ppxscal/embedding_network huggingface dataset:
Where Do Parsing Errors Come From
Authors: Kaili Müürisep, Helen Nigol
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper discusses some issues of developing a parser for spoken Estonian which is based on an already existing parser for written language, and employs the Constraint Grammar framework.When we used a corpus of face-to-face everyday conversations as the training and testing material, the parser gained the recall 97.6% and the precision 91.8%. The parsing of institutional phone calls turned out to be a more complicated task, with the recall dropping by 3%. In this paper, we will focus on parsing nonfluent speech using a rule-based parser. We will give an overview of parsing errors and ways to overcome them.
An Interference-Robust Transmission Method for OFDMA Uplink
Authors: Ki-Chang Lee, Tae-Hyun Moon
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

This paper deals with a simple way of reducing the multiple access interference (MAI) introduced by symbol timing misalignment in an OFDMA uplink system. To alleviate the MAI, we provide a new OFDMA transmitter equipping with a simple symbol repetition coupled with a cyclic time shift. It is found that this scheme can provide the MAI-robust reception without decreasing the bandwidth efficiency when the system is fully loaded.
Incremental Learning and Decremented Characterization of Gene Expression Data Analysis
Authors: Mario Rosario Guarracino, Salvatore Cuciniello, Davide Feminiano
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In this study, we present Incremental Learning and Decremented Characterization of Regularized Generalized Eigenvalue Classification (ILDC-ReGEC), a novel algorithm to train a generalized eigenvalue classifier with a substantially smaller subset of points and features of the original data. The proposed method provides a constructive way to understand the influence of new training data on an existing classification model and the grouping of features that determine the class of samples. The proposed algorithm is compared with other well known solutions. Experimental results are conducted on publicly available datasets and standard parameters are used for evaluation.
An application framework for mobile, context-aware trails
Authors: Cormac Driver, Siobhan Clarke
Venue: Pervasive and Mobile Computing (2008)

In this paper we describe the design, implementation and evaluation of a software framework that supports the development of mobile, context-aware trails-based applications. A trail is a contextually scheduled collection of activities and represents a generic model that can be used to satisfy the activity management requirements of a wide range of context-based time management applications. Trails overcome limitations with traditional time management techniques based on static to-do lists by dynamically reordering activities based on emergent context.
Fast and Practical Algorithms for Computing All the Runs in a String
Authors: Gang Chen, Simon J. Puglisi, W. F. Smyth
Venue: Proceedings of the 18th annual symposium on Combinatorial Pattern Matching (2007)

A repetition in a string x is a substring ${ \bf{w}} = {\it \bf{u}}^e$ of x, maximum e ¿ 2, where u is not itself a repetition in w. A run in x is a substring ${\it \bf{w}} = {\it \bf{u}}^e{\it \bf{u^{*}}}$ of "maximal periodicity", where ${\it \bf{u}}^e$ is a repetition and u * a maximum-length possibly empty proper prefix of u. A run may encode as many as $|{\it \bf{u}}|$ repetitions. The maximum number of repetitions in any string ${\it \bf{x}} = {\it \bf{x}}[1..n]$ is well known to be ¿(nlogn). In 2000 Kolpakov Kucherov showed that the maximum number of runs in x is O(n); they also described a ¿(n)-time algorithm, based on Farach's ¿(n)-time suffix tree construction algorithm (STCA), ¿(n)-time Lempel-Ziv factorization, and Main's ¿(n)-time leftmost runs algorithm, to compute all the runs in x. Recently Abouelhoda et al. proposed a ¿(n)-time Lempel-Ziv factorization algorithm based on an "enhanced" suffix array -- a suffix array together with other supporting data structures. In this paper we introduce a collection of fast space-efficient algorithms for computing all the runs in a string that appear in many circumstances to be superior to those previously proposed.
A Multi-layered General Agent Model
Authors: Stefania Costantini, Arianna Tocchio, Francesca Toni, Panagiota Tsintza
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

We propose a layered representation of general agent models with a base layer, composed of basic agent features including control, and a higher layer, consisting of a meta-control with the task of tuning, supervising and modifying the base layer. This provides higher flexibility in how an agent is built and may evolve.
Jabberwocky: children's digital ink story writing from nonsense to sense
Authors: Janet C Read
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper describes Jabberwocky, a digital ink based story writing and reading application for children. Created following an immersive design experience, the Jabberwocky interface, and its underlying algorithms, are motivated and described in the paper. Jabberwocky is novel on several counts; it provides a humorous and fun filled interface to shield users from the ambiguity of its underlying recognition based systems, it allows for the setting of user parameters to respect the different tolerance levels of children, and it features a 'won't work for you' interface to protect children who are not yet able to gain advantage from its use.
Energy Efficient Forwarding Scheme for Secure Wireless Ad Hoc Routing Protocols
Authors: Kwonseung Shin, Min Young Chung, Hyunseung Choo
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Ad hoc networks can be used in scenarios such as military and emergency relief, and have the advantage of establishing communications independently. Securing the ad hoc routing protocol is necessary to prevent attacks in these applications. However, securing protocols for mobile ad hoc networks presents challenges due to energy consuming processes such as authentication of hosts and verification of messages. In this paper, we propose an efficient forwarding mechanism for secure ad hoc routing protocols, based on public key cryptography.
ADHDP for the pH Value Control in the Clarifying Process of Sugar Cane Juice
Authors: Xiaofeng Lin, Shengyong Lei, Chunning Song, Shaojian Song, Derong Liu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

The clarifying process of sugar cane juice is the important craft in the control process, which has the characteristics of strong non-linearity, multi-constraint, time-varying, large time-delay, and multi-input. It is an important content to control the neutralized pH value within a required range, which has the vital significance for acquiring high quality purified juice, reducing energy consumption and raising sucrose recovery. This article uses ADHDP (Action-Dependent Heuristic Dynamic Programming) method to optimize and control the neutralized pH value in the clarifying process of sugar cane juice. In this way, we can stabilize the clarifying process and enhance the quality of the purified juice and lastly enhance the quality of product sugar. This method doesn't need the precise mathematical model of the controlled object, and it is trained on-line. The simulation results indicate this method has the good application prospect in industries.
Verifying Multi-threaded C Programs with SPIN
Authors: Anna Zaks, Rajeev Joshi
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

A key challenge in model checking software is the difficulty of verifying properties of implementation code, as opposed to checking an abstract algorithmic description. We describe a tool for verifying multi-threaded C programs that uses the SPIN model checker. Our tool works by compiling a multi-threaded C program into a typed bytecode format, and then using a virtual machine that interprets the bytecode and computes new program states under the direction of SPIN. Our virtual machine is compatible with most of SPIN's search options and optimization flags, such as bitstate hashing and multi-core checking. It provides support for dynamic memory allocation (the malloc and free family of functions), and for the pthread library, which provides primitives often used by multi-threaded C programs. A feature of our approach is that it can check code after compiler optimizations, which can sometimes introduce race conditions. We describe how our tool addresses the state space explosion problem by allowing users to define data abstraction functions and to constrain the number of allowed context switches. We also describe a reduction method that reduces context switches using dynamic knowledge computed on-the-fly, while being sound for both safety and liveness properties. Finally, we present initial experimental results with our tool on some small examples.
Parallelization of C# Programs Through Annotations
Authors: Cristian Dittamo, Antonio Cisternino, Marco Danelutto
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper we discuss how extensible meta-data featured by virtual machines, such as JVM and CLR, can be used to specify the parallelization aspect of annotated programs. Our study focuses on annotated CLR programs written using a variant of C#; we developed a meta-program that processes these sequential programs in their binary form and generates optimized parallel code. We illustrate the techniques used in the implementation of our tool and provide some experimental results that validate the approach.
Pattern-Oriented Agent-Based Modeling for Financial Market Simulation
Authors: Chi Xu, Zheru Chi
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The paper presents a pattern-oriented agent-based model to simulate the dynamics of a stock market. The model generates satisfactory market macro-level trend and volatility while the agents obey simple rules but follow the behaviors of the neighbors closely. Both the market and the agents are made to evolve in an environment where Darwin's natural selection rules apply.
Overlapped parallel computations of scalar multiplication with resistance against Side Channel Attacks
Authors: Turki F. Al-Somani
Venue: International Journal of Information and Computer Security (2008)

This paper presents an efficient scheme for computing elliptic curve scalar multiplication that uses side-channel atomicity to resist against SPA attacks. The inherent parallelism within point operations is exploited to perform parallel computations of atomic blocks within the same point operation. The computations of atomic blocks of subsequent point operations are then overlapped to increase the performance. Randomising the scalar multiplier and the projective coordinates are applied together to immunise the scheme against DPA attacks. The results show that the proposed scheme is highly efficient in comparison with the pipelined scheme of Mishra (2006), which outperformed previous schemes.
Mathematical models of formation of rational organizational hierarchies
Authors: M. V. Gubko
Venue: Automation and Remote Control (2008)

A survey of Russian and foreign papers devoted to one of the burning trends of the theory of control of social and economic systems, i.e., mathematical models of formational of rational organization hierarchies is made. The following lines of investigations are emphasized: multilevel symmetrical hierarchies, hierarchies of knowledge, multilevel hierarchies of data processing, hierarchies and command theory, hierarchies of decision-making, hierarchies and contracts theory, and general model of optimal hierarchies search.
Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
Authors: Umberto Straccia
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

We address a novel issue for logic programming, namely the problem of evaluating ranked top-k queries. The problem occurs for instance, when we allow queries such as "find cheap hotels close to the conference location" in which vague predicates like cheap and close occur. Vague predicates have the effect that each tuple in the answer set has now a score in [0,1]. We show how to compute the top-k answers in case the set of facts is huge, without evaluating all the tuples.
Evaluation of Ultrasound Attenuation Characteristics of Human Cataract
Authors: Alvydas Paunksnis, Skaidra Kurapkienė, Marija-Liucija Paunksnienė, Audris Mačiulis
Venue: Informatica (2003)

Cataract is very frequent disease of human eye and the diagnosis of this disease is not difficult. However, it is important to describe it quantitatively, but it is difficult using only the slit lamp. Ultrasound examinations are widely used in ophthalmology. Piezoelectric crystals generate ultrasound waves of 5-50 MHz. Short pulses of 2 to 3 cycles are sent from transducer into the eye. These pulses go through the tissues of the eye with the speed that is inversely proportional to the density and elasticity of the eye. Acoustic parameters of biologic tissues are described by velocity and attenuation coefficient. It is known that in soft tissues the attenuation coefficient is approximately proportional to the frequency - high frequency components of echoes are attenuated more than the lower frequency components. Results of ultrasound attenuation characteristics of human nuclear cataract are presented. It was shown that ultrasound attenuation of nuclear cataract could be used as &ldquo;second opinion&rdquo; for physicians decision support.
Simulation of Three-Phase Voltage Source PWM Rectifier Based on Direct Current Control
Authors: Xu Wang, Kaizheng Huang, Shijie Yan, Bin Xu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

This paper is concerned with the design and simulation of a pulse width modulation (PWM) rectifier for three-phase Permanent Magnetic motor drive. Based on the mathematical model of PWM rectifier, the dual-close-loop engineering design with decoupled feed-forward control is applied in the 3-phase voltage source rectifier. The objective to be reached is to realize unity power factor at the input ac mains and regulate output voltage. The paper presents the MATLAB/SIMULINK simulation model. The results confirm the validity of the model and its control method.
A Theory of Bounded Fair Scheduling
Authors: Jens Schönborn, Marcel Kyas
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Modeling languages like UML use asynchronous communication but do not specify the order in which messages are received. A simple language for specifying such orders declaratively is proposed that ensures fair and bounded fair scheduling. Such scheduling specifications are then translated to Streett automata that accept only and all infinite runs satisfying the specification. Using the automaton as a scheduler guarantees fairness and allows to analyze schedulability using standard automata-theoretic algorithms. The formalism is extended to the case of an uncooperative environment by "fall-back" scheduling specifications when events required for progress are not provided by the environment.
Verifying Space and Time Requirements for Resource-Bounded Agents
Authors: Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini, Mark Jago, Brian Logan, Luciano Serafini
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge base. In this paper we show how to determine the effective reasoning capability of an agent with limited memory by encoding the agent as a transition system and automatically verifying whether a state where the agent believes a certain conclusion is reachable from the start state. We present experimental results using the Model Based Planner (mbp) which illustrates how the length of the deduction varies for different memory sizes.
A region-based GLRT detection of oil spills in SAR images
Authors: Lena Chang, Z. S. Tang, S. H. Chang, Yang-Lang Chang
Venue: Pattern Recognition Letters (2008)

In the study, we propose a fast region-based method for the detection of oil spills in SAR images. The proposed method combines the image segmentation technique and conventional detection theory to improve the accuracy of oil spills detection. From the image statistical characteristics, we first segment the image into regions by using moment preserving method. Then, to get a more integrated segmentation result, we adopt N-nearest-neighbor rule to merge the image regions according to their spatial correlation. Performing the split and merge procedure, we can partition the image into oil-polluted and sea reflection regions, respectively. Based on the segmentation results, we build data models of oil spills and approximate them by using normal distributions. Employing the built oil spills model and the generalized likelihood ratio test (GLRT) detection theory, we derive a closed form solution for oil spills detection. Our proposed method possesses a smaller variance and can reduce the confusion interval in decision. Moreover, we adopt the sample average of image region to reduce the computation complexity. The false alarm rate and oil spills detection probability of the proposed method are derived theoretically. Under the criterion of constant false alarm ratio (CFAR), we determine the threshold of the decision rule automatically. Simulation results performed on ERS2-SAR images have demonstrated the efficiency of the proposed approach.
On the Combination of Ridgelets Descriptors for Symbol Recognition
Authors: O. Ramos Terrades, E. Valveny, S. Tabbone
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

In this paper we propose an original solution to combine the scales of multi-resolution shape descriptors. More precisely, a classifier fusion scheme is applied to a set of shape descriptors obtained from the ridgelets transform. The Ridgelets coefficients are grouped into different descriptors according to their resolution. Then a classifier is trained for each descriptor and a final classification is obtained using the classifier fusion scheme. We have applied this approach to symbol recognition using the GREC 2003 database. In this perspective, we increase the recognition rates of previous works on ridgelets-based descriptors.
A Standard Method of Developing User Interfaces for a Generic ITS Framework
Authors: Mikaël Fortin, Jean-François Lebeau, Amir Abdessemed, François Courtemanche, André Mayers
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper presents a new method to combine in the ASTUS framework the advantages of generic ITSs and their standards with the usability of their domain-specific counterparts when faced with the problem of user interface design. This method involves coupling the taught domain's semantics with the interface, defining scripts to explicit problem-solving step recognition and specifying how relevant data is gathered from that interface. The method is applied to a classic problem solving domain to highlight its potential.
Building a Linux Grid on a Virtual Machine Using a Windows Grid
Authors: Kenichi Tanaka, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In recent years, computing demands have increased greatly. Many researchers have studied on grid computing in order to satisfy the demands. Several researches focus on virtual computing environment known as cloud computing. In cloud computing, computing resources are virtualized, divided into small units and re-organized as arbitrary heterogeneous platform. However, it is difficult to develop the application because cloud computing needs massive resources. In this paper, we propose virtual grid for cloud computing, in which Linux grid is constructed on Windows grid. This utilizes many Windows PCs as grid platform and realizes all functions of Linux grid.
An Attack Graph-Based Probabilistic Security Metric
Authors: Lingyu Wang, Tania Islam, Tao Long, Anoop Singhal, Sushil Jajodia
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

To protect critical resources in today's networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities. This now becomes feasible due to a model of causal relationships between vulnerabilities, namely, attack graph. This paper proposes an attack graph-based probabilistic metric for network security and studies its efficient computation. We first define the basic metric and provide an intuitive and meaningful interpretation to the metric. We then study the definition in more complex attack graphs with cycles and extend the definition accordingly. We show that computing the metric directly from its definition is not efficient in many cases and propose heuristics to improve the efficiency of such computation.
A Learning-Theory Approach to Sensor Networks
Authors: Slobodan N. Simic
Venue: IEEE Pervasive Computing (2003)

Supervised learning techniques have been applied in many diverse scenarios. They also might provide an effective approach to sensor network applications. A well-known learning-theory algorithm effectively applies to environmental monitoring, tracking of moving objects and plumes, and localization. This research, although preliminary, offers a beneficial perspective for the sensor network community to consider.
Towards a resource management and service employment framework
Authors: Christos Chrysoulas, Evangelos Haleplidis, Giorgos Kostopoulos, Robert Haas, Odysseas Koufopavlou
Venue: International Journal of Network Management (2008)

Owing to the increase in both heterogeneity and complexity in today's networking systems, the need arises for new network-based services architectures. They must provide flexibility and efficiency in the definition, deployment and execution of the services and, at the same time, handle the adaptability and evolution of such services. In this paper we present an approach that applies a Web-service-based resource management framework. It enables the provision of parallel applications as QoS-aware applications, whose performance characteristics may be dynamically negotiated between a client application and service providers. Our component model allows context dependencies to be explicitly expressed and dynamically managed with respect to the hosting environment, computational resources and dependencies on other components. In such a model the resource management, in terms of representation, allocation and management of the resources, plays a vital role regarding the efficiency of the entire dynamic service deployment architecture.