ppxscal/embedding_network huggingface dataset:
Direkt Profil: a system for evaluating texts of second language learners of French based on developmental sequences
Authors: Jonas Granfeldt, Pierre Nugues, Emil Persson, Lisa Persson, Fabian Kostadinov, Malin Ågren, Suzanne Schlyter
Venue: Proceedings of the second workshop on Building Educational Applications Using NLP (2005)

Direkt Profil is an automatic analyzer of texts written in French as a second language. Its objective is to produce an evaluation of the developmental stage of students under the form of a grammatical learner profile. Direkt Profil carries out a sentence analysis based on developmental sequences, i.e. local morphosyntactic phenomena linked to a development in the acquisition of French. The paper presents the corpus that we use to develop the system and briefly, the developmental sequences. Then, it describes the annotation that we have defined, the parser, and the user interface. We conclude by the results obtained so far: on the test corpus the systems obtains a recall of 83% and a precision of 83%.
Research in Reliability Modeling of WEDM Based on Neural Network
Authors: Hong-bin Zhang, Zhi-xin Jia
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Because of the small size of the Wire-Electronic Discharging Machine (WEDM) reliability data, the reliability model of WEDM can not be set up accurately by the traditional reliability modeling methods. Therefore, the neural network is used in this paper to solve this problem. The algebraic algorithm, a new algorithm of neural network, is used in the proposed method. Based on statistically analyzing the reliability data of WEDM, the general idea and basic method is proposed for setting up reliability model by neural network, and a new way of reliability modeling is found out for WEDM reliability modeling. After an example is calculated, it is shown that the calculation time of the proposed method is 3 times, and the mean absolute error of the proposed method is 0.0156, as well as the mean absolute error of the traditional method is 0.0703. It is proved that the model which is set up by neural network can map the actual data more accurate than the traditional model. It has a good reference to WEDM reliability researching.
On Geometric Graph Ramsey Numbers
Authors: Gyula K&#x00e1;rolyi, Vera Rosta
Venue: Graphs and Combinatorics (2009)

For any two-colouring of the segments determined by 3n&#x00a0;&#x2212;&#x00a0;3 points in general position in the plane, either the first colour class contains a triangle, or there is a noncrossing cycle of length n in the second colour class, and this result is tight. We also give a series of more general estimates on off-diagonal geometric graph Ramsey numbers in the same spirit. Finally we investigate the existence of large noncrossing monochromatic matchings in multicoloured geometric graphs.
A Combination of Joint Sparse Form and Frobenius Map in Scalar Multiplication of Elliptic Curve over GF(2^{mn} )
Authors: Yong Ding, Yin-fang Hong, Wei-tao Wang, Yuan-yuan Zhou, Xiao-yang Zhao
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Lee et al proposed two methods to speed up the computation of scalar multiplication of elliptic curve defined over GF(2^{mn} ) with a medium size of m in the range 10≤ m ≤ 20. In these methods, Frobenius map is utilized to expand the integer k and each coefficient of the expansion is represented as a binary string. In this paper, with the application of joint sparse form (JSF) to the coefficients, some variations of Lee et al's methods are proposed to achieve a better performance.
On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel
Authors: Maciej Paszyński
Venue: Fundamenta Informaticae (2009)

The paper present the composite programmable (CP) graph grammar model of the selfadaptive hp Finite Element Method (hp-FEM) algorithm. The model incorporates the process of the initial mesh generation, direct solver execution, as well as mesh transformations resulting from selectedoptimal hp refinements. The computational mesh is represented by the CP-graph. The operations performed over the mesh are expressed by the graph grammar productions. The graph grammar model allows for the definition of the computational tasks for the Partitioning, Communication, Agglomeration and Mapping (PCAM) method of the parallelization of the self-adaptive hp-FEM algorithm.
A filter-based approach to detect end-of-utterances from prosody in dialog systems
Authors: Olac Fuentes, David Vera, Thamar Solorio
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We propose an efficient method to detect end-of-utterances from prosodic information in conversational speech. Our method is based on the application of a large set of binary and ramp filters to the energy and fundamental frequency signals obtained from the speech signal. These filter responses, which can be computed very efficiently, are used as input to a learning algorithm that generates the final detector. Preliminary experiments using data obtained from conversations show that an accurate classifier can be trained efficiently and that good results can be obtained without requiring a speech recognition system.
Application of Comprehensive Fuzzy Evaluation in Assessing Strategies of E-Commerce Platform
Authors: Qu Zhiming, Li Jinxian
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The strategies evaluation of E-Commerce platform has affected the platform progress and development. The quality evaluation system framework of E-Commerce platform strategy indicator is established. Fuzzy evaluation index system is put forward to consider various factors. As to indexes system, comprehensive fuzzy evaluation (CFE) model and methods are setup and used to check for practical case. Through CFE model and case study, it is concluded that, based on strategies of E-Commerce platform evaluation index system, CFE is applied to evaluate and solve the unclear boundary of E-Commerce platform strategy indicators and inaccurate fuzziness.
An Approach to Evaluation Component Design in Building Serious Game
Authors: Sanya Liu, Wan Ding
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

In our opinion, the evaluation is one of the most important parts in serious games. An approach to evaluation system design for serious game is come up and discussed in this paper. Firstly, we discuss the importance and the function requirements of evaluation system in serious game. These functions are: record playback, data processing, feedback, database interface, script language support, and so on. Secondly, we design and implement our evaluation system in the form of component for our 3D game engine. Finally, a demonstration is given.
Controlling Earth Pressure of Shield Machine with Optimization Algorithm
Authors: Shouju Li, Zichang Shangguan, Wei Sun, Honhxia Duan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The mechanical parameters of conditioned earth in the head chamber of shield machine are determined for computing response of conditioned earth with the speed change of screw conveyor. The relationship between the strain and the accumulating amount of earth is proposed based on Duncan and Chang's model. The relationship between the increment of earth pressure and the angular velocity of screw conveyor is presented. The controlling model of earth pressure balance of shield machine is proposed with optimization algorithm. The proposed optimization algorithm can take account of practical constraining conditions of screw conveyor including maximum, minimum and maximum gradient of angular velocity of screw. The numerical simulation shows that the proposed control model is effective and stable for controlling earth pressure of shield machine by adjusting speed of screw conveyor.
An Online and Predictive Method for Grid Scheduling Based on Data Mining and Rough Set
Authors: Asgarali Bouyer, Mohammadbagher Karimi, Mnsour Jalali
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Since Grid is a distributed and heterogeneous environment, scheduling and resource management are important in Grid. One of the fundamental problems in Grid is designing a suitable method for management of resources. Many approaches have been proposed to increase performance of scheduling process, but each method has special conditions and they act well only in some special conditions. Moreover for resources scheduling, most of them use GIS's data that maybe is encountered with old data. In this paper, we use an online approach for finding resources with less time spending for resource discovery rather than other proposed methods; and then by using Rough Set and Decision Tree data mining technique, in order to classification of Grid nodes, scheduler will select proper nodes for desired job based on job's condition. This approach also has a fair treat in dealing with The Least Deadline jobs. The obtained results show this approach is one of the promising methods for resource selecting in scheduling phase with high accuracy and performance.
Towards Security Notions for White-Box Cryptography
Authors: Amitabh Saxena, Brecht Wyseur, Bart Preneel
Venue: Proceedings of the 12th International Conference on Information Security (2009)

While code obfuscation attempts to hide certain characteristics of a program independently of an application, white-box cryptography (WBC) specifically focuses on software implementations of cryptographic primitives in an application. The aim of WBC is to resist attacks from an adversary having access to some `executable' code with an embedded secret key. WBC, if possible, would have several applications. However, unlike obfuscation, it lacks a theoretical foundation. We present a first step towards a theoretical model of WBC via white-box security notions. We also present some positive and negative results on WBC and obfuscation. In particular, we show that for most interesting programs (such as an encryption algorithm), there are security notions that cannot be satisfied when the adversary has white-box access, while they are satisfied when it has black-box access. On the positive side, we show that there exists an obfuscator for a symmetric encryption scheme in the context of a useful security-notion (such as IND-CPA).
Discovery of Correlated Sequential Subgraphs from a Sequence of Graphs
Authors: Tomonobu Ozaki, Takenao Ohkawa
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Dynamic graphs or a sequence of graphs attract much attention recently. In this paper, as a first step towards finding significant patterns hidden in dynamic graphs, we consider the problem of mining successive sequence of subgraphs which appear frequently in a long sequence of graphs. In addition, to exclude insignificant patterns, we take into account the mutual dependency measured by ¿-correlation coefficient among the components in patterns. An algorithm named CorSSS, which utilizes the generality ordering of patterns effectively, is developed for enumerating all frequent and correlated patterns. The effectiveness of CorSSS, is confirmed through the experiments using real datasets.
Systems Biology and Bioinformatics: A Computational Approach, 1st edition
Authors: Kayvan Najarian
Venue:  (2009)

Emphasizing computational methods, Systems Biology and Bioinformatics provides an introduction to system biology and its impact on biology and medicine. The book reviews the basic principles of molecular and cell biology using a system-oriented approach, with a brief description of the high-throughput biological experiments that produce databases. The methods presented in the text include techniques to discover genes, perform nucleotide and amino acid sequence matching, and estimate static gene dynamic pathways. The book also explains how to use system-oriented models to predict the behavior of biological systems for important applications such as rational drug design. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Improve the Tracking Performance of Maneuvering Target Based on Wavelet Neural Network
Authors: Shi Jianfang, Wang Minghui, Zhang Xueying
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Wavelet Neural Network (WNN) takes nonlinear wavelet bases as hidden nodes activation to replace nonlinear activation function in neural networks. It has the advantages of self-learning, rapid convergence rate and nonlinear approximation ability. Aiming at the maneuvering frequency is traditionally determined beforehand as a constant based on the target state estimation in the state model of the maneuvering target. An improved maneuvering target tracking method based on WNN is proposed. The input of the WNN is the new residual, the output of WNN is used to update the maneuvering frequency to realize the adaptive adjustment of the maneuvering frequency of the CS(current statistical) model. The improved algorithm is more close to the real state of the target. The simulation results showed that tracking error can be reduced and the tracking performance can be improved.
A Practical Approach to Courcelle's Theorem
Authors: Joachim Kneis, Alexander Langer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In 1990, Courcelle showed that every problem definable in Monadic Second-Order Logic (MSO) can be solved in linear time on graphs with bounded treewidth. This powerful and important theorem is amongst others the foundation for several fixed parameter tractability results. The standard proof of Courcelle's Theorem is to construct a finite bottom-up tree automaton that recognizes a tree decomposition of the graph. However, the size of the automaton, which is usually hidden as a constant in the Landau-notation, can become extremely large and cannot be bounded by any elemental function unless P=NP (Frick and Grohe, 2004). This makes the problem hard to tackle in practice, because it is just impossible to construct the tree automata. Aiming for a practical implementation, we give a proof of Courcelle's Theorem restricted to Extended MSO formulas of the form optU@?V@f(U), where @f is a first-order formula with vocabulary (adj, U) and opt@?{min,max}. Note that many optimization problems such as Minimum Vertex Cover, Minimum Dominating Set, and Maximum Independent Set can be expressed by such formulas. The proof uses a new technique based on using Hintikka game properties in dynamic programming. To demonstrate the usability of this approach, we present an implementation that solves such formulas on graphs with small pathwidth. It turns out that the large constants can be circumvented on graphs that are not too complex.
A class of discrete time recurrent neural networks with multivalued neurons
Authors: Wei Zhou, Jacek M. Zurada
Venue: Neurocomputing (2009)

This paper discusses a class of discrete time recurrent neural networks with multivalued neurons (MVN), which have complex-valued weights and an activation function defined as a function of the argument of a weighted sum. Complementing state-of-the-art of such networks, our research focuses on the convergence analysis of the networks in synchronous update mode. Two related theorems are presented and simulation results are used to illustrate the theory.
Analyzing and Designing of the Classroom Teaching System Based on the Network
Authors: Delin Hou, Huosong Xia
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

The rapid development of the network technology greatly expands information communication between people and makes the network education become real. Network education has already been an important educational mode, while the teaching information system is one of the most important foundations to make the network education real. This article analyzes the basic characteristics of network classroom teaching, illustrates the required basic conditions of the online teaching based on the network and designs the network teaching system. This system can support the information communication between various forms for teaching and learning activities. Main functional subsystems include: video and audio interactive system, text interactive system, whiteboard interactive system, file-sharing system and management system, etc.
How good is almost perfect?
Authors: Malte Helmert, Gabriele Röger
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Heuristic search using algorithms such as A* and IDA* is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these classical search algorithms, such as the well-known results of Pohl, Gaschnig and Pearl, suggest that such heuristic search algorithms can obtain better than exponential scaling behaviour, provided that the heuristics are accurate enough. Here, we show that for a number of common planning benchmark domains, including ones that admit optimal solution in polynomial time, general search algorithms such as A* must necessarily explore an exponential number of search nodes even under the optimistic assumption of almost perfect heuristic estimators, whose heuristic error is bounded by a small additive constant. Our results shed some light on the comparatively bad performance of optimal heuristic search approaches in "simple" planning domains such as GRIPPER. They suggest that in many applications, further improvements in run-time require changes to other parts of the search algorithm than the heuristic estimator.
Application of RBF Algorithm in Prediction of Threshold Pressure Gradient
Authors: Changjun Zhu, Xiujuan Zhao, Weihua Yang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

It is well known that it plays an important role to determine threshold pressure gradient (TPG) in developing the low permeability oil field, and it directly influences the accuracy of reservoir pressure and developing amount. Threshold pressure gradient becomes nonlinear relation with such factors that may influence accuracy as permeability, viscosity and density of fluid and porosity and so on. Such a problem of nonlinear nature can be solved by RBF neural network systems. Based on above thought, authors of this paper predict the TPG using RBF neural network. This approach has further been tested and verified by actual determining results .The experimental results show that RBF neural network is an effective method for TPG prediction with good precision. The application of this approach can supply basic data for developing oil field so as to save cost and labor
Study on the Emotion Recognition of Whispered Speech
Authors: Yun Jin, Yan Zhao, Chengwei Huang, Li Zhao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

In order to study the new research direction about emotion recognition of whispered speech, the paper develops the construction flow and standards with which the emotion database of whispered speech has been designed and built. With the concepts of Membership Function and Analytic Hierarchy Process in fuzzy mathematics, the validity of each sentence has been checked out to obtain a qualified database with which a preliminary emotion recognition experiment of whispered speech is carried out.
Measurement of Managerial Performance Based on Two-Stage Relative Efficiency Method
Authors: Xu Yan-li, Feng Ying-jun
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Two-stage relative efficiency model, a newly named analytical method, is presented here in order to measure managerial performance fairly. This method evaluates managerial performance by eliminating the influence of existing conditions. Empirical results show that managers in firms with relatively superior existing conditions still need to work hard to maintain their competitiveness and achieve better than before performance. On the other hand, managers in those firms with relatively inferior existing conditions can also achieve better than before performance and fair evaluation if they conscientiously make great efforts. The method presented here can avoid penalizing good managers who manage within an unfavorable existing condition as well as avoid rewarding poor managers who manage in a favorable existing condition. In a word, the two-stage relative efficiency model is an equitable and objective measuring method for efficiency.
Enhanced auditory menu cues improve dual task performance and are preferred with in-vehicle technologies
Authors: Myounghoon Jeon, Benjamin K. Davison, Michael A. Nees, Jeff Wilson, Bruce N. Walker
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

Auditory display research for driving has mainly focused on collision warning signals, and recent studies on auditory in-vehicle information presentation have examined only a limited range of tasks (e.g., cell phone operation tasks or verbal tasks such as reading digit strings). The present study used a dual task paradigm to evaluate a plausible scenario in which users navigated a song list. We applied enhanced auditory menu navigation cues, including spearcons (i.e., compressed speech) and a spindex (i.e., a speech index that used brief audio cues to communicate the user's position in a long menu list). Twenty-four undergraduates navigated through an alphabetized song list of 150 song titles---rendered as an auditory menu---while they concurrently played a simple, perceptual-motor, ball-catching game. The menu was presented with text-to-speech (TTS) alone, TTS plus one of three types of enhanced auditory cues, or no sound at all. Both performance of the primary task (success rate of the game) and the secondary task (menu search time) were better with the auditory menus than with no sound. Subjective workload scores (NASA TLX) and user preferences favored the enhanced auditory cue types. Results are discussed in terms of multiple resources theory and practical IVT design applications.
UBC-ALM: combining k-NN with SVD for WSD
Authors: Eneko Agirre, Oier Lopez de Lacalle
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This work describes the University of the Basque Country system (UBC-ALM) for lexical sample and all-words WSD subtasks of SemEval-2007 task 17, where it performed in the second and fifth positions respectively. The system is based on a combination of k-Nearest Neighbor classifiers, with each classifier learning from a distinct set of features: local features (syntactic, collocations features), topical features (bag-of-words, domain information) and latent features learned from a reduced space using Singular Value Decomposition.