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.
Historically, behavior-based computer security has relied on automatic classification of the activities of persons and programs to determine whether these activities should be restricted. In this paper, we argue that classification that relies exclusively upon observation of low-level events (either via signatures or anomalies) is insufficient to infer higher-level behavior correctly. However, ordering...
Parsing is a process of transforming natural language into an internal system representation, which can be trees, dependency graphs, frames or some other structural representations. If a natural language be successfully parsed then grammar checking from this language becomes easy. In this paper we describe a context free grammar for Bangla language and hence we develop a Bangla parser based on the...
Visualizing information has been one of the main subjects of study in the computer field. Representing objects with diagrams is one approach to visualizing information and its effectiveness has widely been recognized. Thus far, many graph-drawing algorithms have been proposed. Several authors have studied the problem of producing tidy drawings of binary trees - drawings that are aesthetically pleasing...
This paper introduces IPP-Ann: the Interactive Predictive Parsing Tree Annotator. IPP-Ann is an interactive tool that can be used by an expert to effortlessly annotate syntactic trees. The tool shows an initial proposed annotation tree, and then allows the user to perform individual corrections on the tree constituents. These corrections implicitly validate a prefix subtree, and IPP-Ann reacts to...
Grammar Induction (or Grammar Inference or Language Learning) is the process of learning of a grammar from training data of the positive and negative strings of the language. Genetic algorithms are amongst the techniques which provide successful result for the grammar induction. This paper presents a stochastic Mutation Operator based on an Adapted Genetic Algorithm which works with random mask, with...
The face expressions are considered to be a significant part of the very important nonverbal information, needed to understand the other party's feelings in communications. In this work we proposed a system that facilitates the exchange of face expressions of players together with the standard communication content. We experimentally investigated the influence on the content of the communication and...
Grammar inference is one of the NP-complete problems in machine learning. Most of the solutions in this field are not well suited for concurrent execution. The aim of this paper is to present a grid-enabled brute force grammar inference approach.
This article describes a parallel process method to autogenerate LL(1) analytical table on multiprocessor computers, and it also discusses the designing thoughts and executing tactics in this parallel algorithm, just in order to improve the efficiency of compiler. Compiler is an important system software, and syntax analysis is the first step of compiler. In general, there are two kinds of methods...
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.