ppxscal/embedding_network huggingface dataset:
Isabelle Theories for Machine Words
Authors: Jeremy Dawson
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We describe a collection of Isabelle theories which facilitate reasoning about machine words. For each possible word length, the words of that length form a type, and most of our work consists of generic theorems which can be applied to any such type. We develop the relationships between these words and integers (signed and unsigned), lists of booleans and functions from index to value, noting how these relationships are similar to those between an abstract type and its representing set. We discuss how we used Isabelle's bin type, before and after it was changed from a datatype to an abstract type, and the techniques we used to retain, as nearly as possible, the convenience of primitive recursive definitions. We describe other useful techniques, such as encoding the word length in the type.
User-level operating system transactions
Authors: Diomidis Spinellis
Venue: Software&mdash;Practice Experience (2009)

User-level operating system transactions allow system administrators and ordinary users to perform a sequence of file operations and then commit them as a group, or abort them without leaving any trace behind. Such a facility can aid many system administration and software development tasks. The snapshot isolation concurrency control mechanism allows transactions to be implemented without locking individual system calls; conflicts are detected when the transaction is ready to commit. Along these lines we have implemented a user-space transaction monitor that is based on ZFS snapshots and a file system event monitor. Transactions are committed through a robust and efficient algorithm that merges the operations performed on a file system's clone back to its parent. Both the performance impact and the implementation cost of the transaction monitor we describe are fairly small. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Test Method Research of Magnetic Saturation Current of High-Frequency Transformer
Authors: Hongtao Ma, Xiaojun Wang, FenPing Zhou
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

When the case of magnetic saturation of high-frequency transformer occurs in switching power supply, the effect to efficiency and output power as well as the harm to power switch tube are analyzed. A method of low-voltage, low-frequency square wave signal driving the primary coil of high-frequency transformer is introduced. By observing the current waveform of coil with oscilloscope and some following simple calculation, high-frequency magnetic transformer saturation current value can be obtained. The principle, related circuit, specific method, an example and result analysis of measuring are presented.
Optimal scheduling of contract algorithms with soft deadlines
Authors: Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a well-studied problem with significant applications in AI. In the classical case, the interruptions are hard deadlines in which a solution must be reported immediately at the time the interruption occurs. In this paper we study the more general setting of scheduling contract algorithms at the presence of soft deadlines. This is motivated by the observation of practitioners that soft deadlines are as common an occurrence as hard deadlines, if not more common. In our setting, at the time t of interruption the algorithm is given an additional window of time w(t) ≤ c ċ t to continue the contract or, indeed, start a new contract (for some fixed constant c). We explore this variation using the acceleration ratio, which is the canonical measure of performance for these schedules, and derive schedules of optimal acceleration ratio for all functions w.
Robust detection of phone boundaries using model selection criteria with few observations
Authors: George Almpanidis, Margarita Kotti, Constantine Kotropoulos
Venue: IEEE Transactions on Audio, Speech, and Language Processing (2009)

Automatic phone segmentation techniques based on model selection criteria are studied. We investigate the phone boundary detection efficiency of entropy- and Bayesian- based model selection criteria in continuous speech based on the DISTBIC hybrid segmentation algorithm. DISTBIC is a text-independent bottom-up approach that identifies sequential model changes by combining metric distances with statistical hypothesis testing. Using robust statistics and small sample corrections in the baseline DISTBIC algorithm, phone boundary detection accuracy is significantly improved, while false alarms are reduced. We also demonstrate further improvement in phonemic segmentation by taking into account how the model parameters are related in the probability density functions of the underlying hypotheses as well as in the model selection via the information complexity criterion and by employing M-estimators of the model parameters. The proposed DISTBIC variants are tested on the NTIMIT database and the achieved F1 measure is 74.7% using a 20-ms tolerance in phonemic segmentation.
Goal-Directed Movement Generation with a Transient-Based Recurrent Neural Network Controller
Authors: R. Felix Reinhart, Jochen J. Steil
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

We introduce a control framework based on a recurrent neural network for goal-directed movement generation. We exploit the network dynamics to implement a nonlinear task space controller. Efficient online learning and execution of the network makes the proposed approach adaptive and real-time capable. We achieve reliable and excellent generalization for the 7-DOF redundant PA-10 robot arm in simulation.
Using cycles and quasi-cycles to disambiguate dictionary glosses
Authors: Roberto Navigli
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We present a novel graph-based algorithm for the automated disambiguation of glosses in lexical knowledge resources. A dictionary graph is built starting from senses (vertices) and explicit or implicit relations in the dictionary (edges). The approach is based on the identification of edge sequences which constitute cycles in the dictionary graph (possibly with one edge reversed) and relate a source to a target word sense. Experiments are performed on the disambiguation of ambiguous words in the glosses of WordNet and two machine-readable dictionaries.
A demonstration of ScriptEase interruptible and resumable behaviors for CRPGs
Authors: Maria Cutumisu, Duane Szafron, Jonathan Schaeffer, Kevin Waugh, Curtis Onuczko, Jeff Siegel, Allan Schumacher
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Intelligent non-player characters that exhibit realistic ambient behaviors produce more captivating and immersive stories for the player. However, the creation of nonrepetitive and entertaining behaviors is challenging, since it involves writing complex custom scripting code for thousands of characters in a common game adventure. This demonstration describes the generation of motivational behavior scripts using generative behavior patterns with ScriptEase. We demonstrate interruptible and resumable motivational ambient and latent behaviors for a tavern scene in a custom Neverwinter Nights game module.
Protection Algorithm Based on Lightpath Load in GMPLS Optical Networks
Authors: Lei Guo, Xingwei Wang, Cunqian Yu, Weigang Hou, Hongming Li, Hongpeng Wang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, we study survivability in GMPLS optical networks and propose a new algorithm called Protection based on Lightpath Load (PLL) to tolerate the single-fiber link failure. Based on the parameter, Boundary of Heavy-load Lightpath (BHL), PLL can effectively choose the protection execution whether on optical layer or on IP/MPLS layer, such that the bandwidth utilization ratio and recovery complexity can be compromised. In PLL, if the number of Working Label Switching Paths (WLSPs) carried on a Working Lightpath (WLP) exceeds the value of BHL, this WLP will be protected in optical layer; otherwise, these WLSPs carried on this WLP will be protected on IP/MPLS layer. Simulation results show that, compared to conventional algorithm, PLL not only can significantly reduce the recovery complexity but also can obtain satisfactory trade-off performance.
Online and face-to-face discussions in the classroom: a study on the experiences of 'active' and 'silent' students
Authors: Christa S. C. Asterhan, Tammy Eisenmann
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Even though the advantages of online discussions over face-to-face discussion formats has been extensively reported and investigated, the blending of online discussion tools in co-located classroom settings has been considered with far less intensity. In this paper, we report on secondary school students' experiences and preferences concerning two different discussion formats in co-located classroom settings, namely face-to-face (F2F) and synchronous, computer-mediated communication (CMC). In addition, we also differentiate between students that are known to be active participants in F2F classroom discussions and those who usually remain silent. The findings highlight several advantages of CMC over F2F discussions in co-located settings and show that different students ('active' and 'silent') experience F2F and computer-mediated communication differently.
Robust real-time face tracking and gesture recognition
Authors: J. Heizmann, A. Zelinsky
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

People naturally express themselves through facial gestures. We have implemented an interface that tracks a person's facial features robustly in real time (30Hz) and does not require artificial artifacts such as special illumination or facial makeup. Even if features become occluded the system is capable of recovering tracking in a couple of frames after the features reappear in the image. Based on this fault tolerant face tracker we have implemented realtime gesture recognition capable of distinguish 12 different gestures ranging from "yes", "no" and "may be" to winks, blinks and "asleep".
A High Order Neural Network Model and Application in Economic Forecast
Authors: Feng Duan, Yi Fulin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, we propose a vector input neural network model. The architecture of this network is composed by two parts: single vector immutiply and mix (de-mix) matrix process. The model can be described as a high-dimension neural network operator. Simplify this model bring to a high-dimension array as the kernel of the network. The high-dimension neural network is usable in many fields especially the input signals are vectors. High-dimension immutiply has the physical mean that the victor input channels are filtered at the same sample time. We use this neural network forecasting economic. The economic statistics data such as GDP, CPI composed the input vector and we can use this model (as a high-dimension array) to forecast the data of next year or later.
Experimental Evaluation of Processing Time for the Synchronization of XML-Based Business Objects
Authors: Michael Ameling, Bernhard Wolf, Thomas Springer, Alexander Schill
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Business objects (BOs) are data containers for complex data structures used in business applications such as Supply Chain Management and Customer Relationship Management. Due to the replication of application logic, multiple copies of BOs are created which have to be synchronized and updated. This is a complex and time consuming task because BOs rigorously vary in their structure according to the distribution, number and size of elements. Since BOs are internally represented as XML documents, the parsing of XML is one major cost factor which has to be considered for minimizing the processing time during synchronization. The prediction of the parsing time for BOs is an significant property for the selection of an efficient synchronization mechanism. In this paper, we present a method to evaluate the influence of the structure of BOs on their parsing time. The results of our experimental evaluation incorporating four different XML parsers examine the dependencies between the distribution of elements and the parsing time. Finally, a general cost model will be validated and simplified according to the results of the experimental setup.
SemEval-2010 task 7: argument selection and coercion
Authors: James Pustejovsky, Anna Rumshisky
Venue: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions (2009)

In this paper, we describe the Argument Selection and Coercion task, currently in development for the SemEval-2 evaluation exercise scheduled for 2010. This task involves characterizing the type of compositional operation that exists between a predicate and the arguments it selects. Specifically, the goal is to identify whether the type that a verb selects is satisfied directly by the argument, or whether the argument must change type to satisfy the verb typing. We discuss the problem in detail and describe the data preparation for the task.
A One-Layer Recurrent Neural Network for Non-smooth Convex Optimization Subject to Linear Equality Constraints
Authors: Qingshan Liu, Jun Wang
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In this paper, a one-layer recurrent neural network is proposed for solving non-smooth convex optimization problems with linear equality constraints. Comparing with the existing neural networks, the proposed neural network has simpler architecture and the number of neurons is the same as that of decision variables in the optimization problems. The global convergence of the neural network can be guaranteed if the non-smooth objective function is convex. Simulation results are provided to show that the state trajectories of the neural network can converge to the optimal solutions of the non-smooth convex optimization problems and show the performance of the proposed neural network.
Challenges in Automatic Optimization of Arithmetic Circuits
Authors: Ajay K. Verma, Philip Brisk, Paolo Ienne
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, especially for arithmetic circuits. In many cases, the outcome of even the most advanced synthesis techniques is highly dependent on the input description of the circuit, and the optimizations themselves barely modify the architecture of the circuit itself. Once the input description is converted to an appropriate architecture, logic synthesis performs local optimizations quite effectively; however, finding the best architecture up front is a nontrivial problem. This paper reviews recent results in arithmetic logic synthesis that the authors have published in recent years. Progress has clearly been made, but much further work is still needed to narrow the gap between the effectiveness of logic synthesis techniques for arithmetic and control-oriented circuits.
Dimension amnesic pyramid match kernel
Authors: Yi Liu, Xu-Lei Wang, Hongbin Zha
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an efficient approach to quantifying the similarity between two unordered feature-sets, which allows well established kernel machines to learn with such representations. However, the approximation of PMK to the optimal feature matches deteriorates linearly with the dimension of local features, which prohibits the direct use of high dimensional features. In this paper, we propose a general, data-independent kernel to quantify the feature-set similarities, which gives an upper bound of approximation error independent of the dimension of local features. The key idea is to employ the technique of normal random projection to construct a number of low dimensional subspaces, and perform the original PMK algorithm therein. By leveraging on the invariance property of p-stable distributions, our approach achieves the desirable dimension-free property. Extensive experiments on the ETH-80 image database solidly demonstrate the advantage of our approach to high dimensional features.
Evolution of Query Optimization Methods: From Centralized Database Systems to Data Grid Systems
Authors: Abdelkader Hameurlain
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

The purpose of this talk is to provide a comprehensive state of the art concerning the evolution of query optimization methods from centralized database systems to data Grid systems through parallel, distributed and data integration systems. For each environment, we try to describe synthetically some methods, and point out their main characteristics.
Research of MRM-Based CTCS-3 Level Train Operation Control System Simulation Support Technology
Authors: ShangGuan Wei, Cai Bai-Gen, Wang Jian, Gou Chen-Xi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Train operation control system is one complex system with some feature like real-time and distributing, aim at different application purpose and operation process of system lifecycle, the emphasize point and level of detail is different. In this paper, MRM-based Simulation Support Technology and it’s application was studied, the modeling theory and method was studied systematically; the Aggregation-Disaggregation problem and settle method of MRM model run together in distributing simulation was studied, solving the couple consistency problem of MRM model; design the distributing and interactive simulation system structure base on HLA, the simulation support technology base on different level resolution was studied. Aim at practical demand of Chinese railway development, the modeling method base on MRM and modeling system structure aim at different simulation motivation was studied, the MRM modeling of key subsystem and parts of Train operation control system was studied, combine with practical work pattern of key parts, study the simulation of constructed model.
Convexity of the zeros of some orthogonal polynomials and related functions
Authors: Kerstin Jordaan, Ferenc Tookos
Venue: Journal of Computational and Applied Mathematics (2009)

We study convexity properties of the zeros of some special functions that follow from the convexity theorem of Sturm. We prove results on the intervals of convexity for the zeros of Laguerre, Jacobi and ultraspherical polynomials, as well as functions related to them, using transformations under which the zeros remain unchanged. We give upper as well as lower bounds for the distance between consecutive zeros in several cases.
A unified representation for morphological, syntactic, semantic, and referential annotations
Authors: Erhard W. Hinrichs, Sandra Kübler, Karin Naumann
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

This paper reports on the SYN-RA (SYNtax-based Reference Annotation) project, an on-going project of annotating German newspaper texts with referential relations. The project has developed an inventory of anaphoric and coreference relations for German in the context of a unified, XML-based annotation scheme for combining morphological, syntactic, semantic, and anaphoric information. The paper discusses how this unified annotation scheme relates to other formats currently discussed in the literature, in particular the annotation graph model of Bird and Liberman (2001) and the pie-in-the-sky scheme for semantic annotation.
Parallel Discrete Event Simulation of Molecular Dynamics Through Event-Based Decomposition
Authors: Martin C. Herbordt, Md. Ashfaquzzaman Khan, Tony Dean
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Molecular dynamics simulation based on discrete event simulation (DMD) is emerging as an alternative to time-step driven molecular dynamics (MD).DMD uses simplified discretized models, enabling simulations to be advanced by event, with a resulting performance increase of several orders of magnitude.Even so, DMD is compute bound.Moreover, unlike MD, causality issues make DMD difficult to scale.Here we present a microarchitecture-inspired parallel algorithm for DMD:speculative execution enables multithreading, while in-order commitment ensures correctness.Our initial not-yet optimized implementation obtains scalability for a multicore processor when running realistic simulation models.
JU-SKNSB: extended WordNet based WSD on the English all-words task at SemEval-1
Authors: Sudip Kumar Naskar, Sivaji Bandyopadhyay
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper presents an Extended WordNet based word sense disambiguation system using a major modification to the Lesk algorithm. The algorithm tries to disambiguate nouns, verbs and adjectives. The algorithm relies on the POS-sense tagged synset glosses provided by the Extended WordNet. The basic unit of disambiguation of our algorithm is the entire sentence under consideration. It takes a global approach where all the words in the target sentence are simultaneously disambiguated. The context includes previous and next sentence. The system assigns the default WordNet first sense to a word when the algorithm fails to predict the sense of the word. The system produces a precision and recall of .402 on the SemEval-2007 English All-Words test data.
Speed-Accuracy Tradeoff in Trajectory-Based Tasks with Temporal Constraint
Authors: Xiaolei Zhou, Xiang Cao, Xiangshi Ren
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Speed-accuracy tradeoff is a common phenomenon in many types of human motor tasks. In general, the more accurately the task is to be accomplished, the more time it takes, and vice versa. In particular, when users attempt to complete the task with a specified amount of time, the accuracy of the task can be considered as a dependent variable to measure user performance. In this paper we investigate speed-accuracy tradeoff in trajectory-based tasks with temporal constraint, through a controlled experiment that manipulates the movement time (MT) in addition to the tunnel amplitude (A) and width (W). A quantitative model is proposed and validated to predict the task accuracy in terms of lateral standard deviation (SD) of the trajectory.