The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Considering the wide spectrum of both practical and research applicability, opinion mining has attracted increased attention in recent years. This article focuses on breaking the domain-dependency barrier which occurs in supervised opinion mining strategies by using a semi-supervised approach, which ensures domain independence. Our work devises a generalized methodology by considering a set of grammar...
In the era of information explosion, more social network applications present a platform for people to share various news and information sources, which brings people into the era of big data. And the processing of structured information attracts more researchers' attention. In this paper, we propose a method of feature extraction based on the syntactic and grammar structure to discover the emotion...
Code clones have to be made explicit and be managed in software maintenance. Researchers have developed many clone detection tools to detect and analyze code clones in software systems. These tools report code clones as similar code fragments in source files. However, clone-related maintenance tasks (e.g., refactorings) often involve a group of code clones appearing in larger syntactic context (e...
This paper extends our behavioural type and effect system for detecting deadlocks by polymorphism and formalizing type inference (with respect to lock types). Our inference is defined for a simple concurrent, first-order language. From the inferred effects, after suitable abstractions to keep the state space finite, we either obtain the verdict that the program will not deadlock, or that it may deadlock...
To evolve object-oriented code, one must understand both the code structure in terms of classes, and the runtime structure in terms of abstractions of objects that are being created and relations between those objects. To help with this understanding, static program analysis can extract heap abstractions such as object graphs. But the extracted graphs can become too large if they do not sufficiently...
Pattern search of programs is a fundamental function for supporting programming. In this paper, we propose a search method for unpreprocessed programs, which are difficult to parse. Our parser directly parses them by rewriting token sequences, and allows minor errors in syntax trees. The search tool takes queries that are the same as the format of program fragments. By using the same parser for both...
Multiple morphological interpretations of wordforms is a bottleneck for different level of syntactico-semantic analyses of Natural Language (NL) sentences. Common vocabulary words of morphologically rich languages typically have more than one morphological analyses. However, if a word contains multiple morphological alternatives, one of them is appropriate with respect to the context where the word...
In this paper, we present a normal bisimulation for higher order pi-calculus with unguarded choice and prove the coincidence between such normal bisimulation and context bisimulation for higher order pi-calculus with unguarded choice. To achieve this aim, we introduce indexed higher order pi-calculus with unguarded choice. Furthermore we present corresponding indexed bisimulations in this calculus,...
Sentiment Analysis is one of the significant issues in the area of natural language processing, computational linguistics and text mining. It has also become a potential research area in bibliographic search and opinion mining, which is our main focus in this paper. Sentiment analysis of citations on schema-based research contents, such as scientific articles and reports, may not only makes an appropriate...
This paper describes the development of parser algorithm which is used for Hindi-English machine translation (MT). Machine translation requires analysis, transfer and generation steps to produce target language output from a source language input. Structural representation of Hindi sentences codes the information of Hindi sentences and a transfer module can be designed to generate English sentences...
Service Creation Environments facilitate the creation of complex services and play a major role in the software industry. In this context, we aim at developing a domain-specific framework (networking domain) that uses a chain of existing "off-the-shelf" tools that are integrated together from the design phase to the verification activities. In this paper, we propose a new meta-model that...
We detail the integration in SPIKE, an implicit induction theorem prover, of two reasoning modules operating over naturals combined with interpreted symbols. The first integration schema is à la Boyer-Moore, based on the combination of a congruence closure procedure with a decision procedure for linear arithmetic over rationals/reals. The second follows a 'black-box' approach and is based on external...
High Efficiency Video Coding (HEVC) is the newest video coding standard approved by the ISO/IEC and ITU-T in January 2013. By providing a video coding efficiency gain of up to 50% compared to its predecessor H.264/MPEG-4 AVC, the complexity of the used algorithms has raised significantly. Targeting video formats with higher spatial and temporal resolutions - e.g. 4Kp60 in broadcast applications -...
Mobile distributed systems involve specific aspects such as migration, communication and concurrency, usually under temporal constraints. In this paper, we deal with formal modelling of timed migrating and communicating processes, as provided by the TiMo calculus. In this framework, mobile processes can move between different locations and communicate when collocated, all this happening in the presence...
This paper presents a labeled transition system (LTS) for π-calculus that uses contexts of processes rather than actions as labels for transitions. We present a set of rules that derives transitions with contextual labels. We show that the operational semantics defined with the LTS corresponds to the semantics defined with reaction rules. The set of rules does not refer the rules for reaction semantics...
Idioms are extensively used in everyday language. They carry a metaphorical sense that makes their comprehension difficult as their meaning cannot be deduced from the meaning of their constituent parts. They pose a challenge for Natural language processing (NLP) applications like machine translation, information retrieval and question answering as their translation and meaning needs to be derived...
Machine Translation is the process of translating one natural language into another using automated and computerized means. The proposed system is a rule based multilingual unidirectional translation system which translates English sentences into corresponding Malayalam and Hindi sentences. During translation it incorporates morphological and syntactic information present in the working pair of languages...
The more books a child reads in mother tongue, the better he understands the text although he does not intend to find out the meanings of new words, i.e., using unsupervised learning with previously established constants. We think this is because semantics and syntax of the language emerges in his brain through past sufficient exposure to the language and past interactions with the environment using...
Machine translation (MT) deals with a large amount of data which represents sentence meanings constructed on the basis of the grammatical rules and the lexical knowledge of the source and target languages. As it is hardly possible to make an automated semantic analysis of the source language data, predominant methods in use have been transfer models such as those of phrase-based statistical MT and...
Flow-sensitive analysis for information-flow control (IFC) allows data structures to have mutable security labels, i.e., labels that can change over the course of the computation. This feature is often used to boost the permissiveness of the IFC monitor, by rejecting fewer programs, and to reduce the burden of explicit label annotations. However, when added naively, in a purely dynamic setting, mutable...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.