ppxscal/embedding_network huggingface dataset:
Advances in children's speech recognition within an interactive literacy tutor
Authors: Andreas Hagen, Bryan Pellom, Sarel Van Vuuren, Ronald Cole
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

In this paper we present recent advances in acoustic and language modeling that improve recognition performance when children read out loud within digital books. First we extend previous work by incorporating cross-utterance word history information and dynamic n-gram language modeling. By additionally incorporating Vocal Tract Length Normalization (VTLN), Speaker-Adaptive Training (SAT) and iterative unsupervised structural maximum a posteriori linear regression (SMAPLR) adaptation we demonstrate a 54% reduction in word error rate. Next, we show how data from children's read-aloud sessions can be utilized to improve accuracy in a spontaneous story summarization task. An error reduction of 15% over previous published results is shown. Finally we describe a novel real-time implementation of our research system that incorporates time-adaptive acoustic and language modeling.
Design and Realization of FCE Optimized Model in DSS
Authors: Yubin Zhong, Bifang Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The Model Base plays an important role in the process of Decision Support System (DSS) design, so it is a worthwhile study to the reasonable design and the optimization of models. This paper makes an in-depth research on Fuzzy Comprehensive Evaluation (FCE) model which is on a widely used and put forward the Fast FCE model based on Neural Network (NN). This method organically combines FCE, NN and Genetic Algorithms (GA) together for the first time and solves the parameters; setting problem of all links in the model. The weight vector of the model is obtained by training NN to avoid man-made interventions, and the training speed of NN is improved by the pre-study of GA. Finally, according to the index data of China real estate listed companies in 2005 and 2006, this paper takes a comprehensive strength evaluation on real estate listed companies in 2007 and compares the evaluated result with the top 10 of real estate listed companies in 2007 published by the Real Estate Comprehensive Strength Evaluation Top 10 Study Team. The result shows that the model is effective to evaluate enterprises' comprehensive strength and better than the other comprehensive evaluation methods.
Use and Trust of Simple Independent Open Learner Models to Support Learning within and across Courses
Authors: Susan Bull, Peter Gardner, Norasnita Ahmad, Jeffrey Ting, Ben Clarke
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

This paper introduces two independent open learner models (learner models that are accessible to user viewing), which are deployed alongside university courses to facilitate self-assessment skills, planning and independent learning. OLMlets is used in specific courses, while UK-SpecIAL, a modular extension to OLMlets, draws on the OLMlets learner models to display progress towards achieving learning outcomes applicable across courses. User logs demonstrate usage of each system, and questionnaire responses provide insight into the reasons for user trust in the environments.
Genome rearrangement and planning
Authors: Esra Erdem, Elisabeth Tillier
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

The genome rearrangement problem is to find the most economical explanation for observed differences between the gene orders of two genomes. Such an explanation is provided in terms of events that change the order of genes in a genome. We present a new approach to the genome rearrangement problem, according to which this problem is viewed as the problem of planning rearrangement events that transform one genome to the other. This method differs from the existing ones in that we can put restrictions on the number of events, specify the cost of events with functions, possibly based on the length of the gene fragment involved, and add constraints controlling search. With this approach. We have described genome rearrangements in the action description language ADL. and studied the evolution of Metazoan mitochondrial genomes and the evolution of Campanulaceae chloroplast genomes using the planner TLPLAN. We have observed that the phylogenies reconstructed using this approach conform with the most widely accepted ones.
The Ontology-Cored Emotional Semantic Retrieval Model
Authors: Juan-juan Zhao, Li Jun
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In this paper, an ontology-cored emotional semantic retrieval model was proposed and constructed in order to overcome the current situation that it is difficult to implement emotional semantic search in the course of image searching. A method Combines Mpeg-7, theory of concept lattices and ontology construction together to construct the kernel ontology library was put forward. The difficulty of this method lies on how to integrate the Mpeg-7 standard descriptor with image emotional ontology properties, and how to auto-generate new concept results. This model was implemented and related experiments were carried out of which the results validated the feasibility of this model on image emotional semantic search.
A System Framework for the Design of Embedded Software Targeting Heterogeneous Multi-core SoCs
Authors: Xavier Guerin, Frédéric Petrot
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Embedded appliances designers rely on Heterogeneous Multi-Core System-on-Chips (HMC-SoC) to provide the computing power required by modern applications. Due to the inherent complexity of this kind of platform, the development of speciﬁc system architectures is not considered as an option to provide low-level services to an application. Hence, the software is built either from scratch - when the software’s requirements are not too high - or over a general-purpose operating system, leading to performance and memory usage trade-offs. Our contribution is a component-based system framework that provides high-level system services for embedded software applications with few impacts on the memory usage and ﬁnal performances, thanks to strong interfaces that enable the reuse of existing software elements and facilitate the support of multiple hardware platforms. The efﬁciency of our approach is demonstrated on an existing MC-SoC.
Research on the Variation of the Computer Virus Based on Random Function
Authors: Hui Xie, Zhi-gang Zhang, Rui Wu, Feng Nie
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Studying the variation principle of the computer virus can deeply understand and grasp the variation laws and trends of the computer virus; offer the theoretical foundation for technical research of the anti-virus. In the foundation of summarizing the principle and the development of the virus technology, we introduced the idea of joining the random function in the trigger module of computer virus, in order to realize the computer virus variation similar to the biological virus and achieve a certain degree of the evolution. Then the method of realizing random function which utilizes Windows time function and Logistic Map is presented. This research provides theoretical basis for the anti-virus technique study, prevents virus from spreading effectively and ensures the security of online information.
Support mobility in the global internet
Authors: Lixia Zhang, Ryuji Wakikawa, Zhenkai Zhu
Venue: Proceedings of the 1st ACM workshop on Mobile internet through cellular networks (2009)

Today's technology trend indicates that billions of hand-held gadgets as well as other types of mobile devices will be coming online in the next few years. While the existing Internet mobility standards, namely Mobile IP, is waiting for a wide adoption, cellphone networks are providing the ubiquitous mobility services on a global scale as of today. They have also promoted IP core network architecture and adopted Proxy Mobile IPv6, an extension to Mobile IP, for their mobility service. There is an open question regarding whether the Internet would, or would not, require significant architectural changes to provide universal mobility support at a scale that is likely to go far beyond the scale and scope of today's cellular telephone services. In this paper, we examine the fundamental di erences between the mobility service models provided by Internet and cellphone systems. We argue that decoupling network access control from mobility support can provide an architecturally promising direction for scalable and decentralized mobile communications, and that designing mobility support outside the global routing system can o er an overall best tradeo as measured by flexibility, manageability, and scalability of the resulting systems.
Ray casting of multiple volumetric datasets with polyhedral boundaries on manycore GPUs
Authors: Bernhard Kainz, Markus Grabner, Alexander Bornik, Stefan Hauswiesner, Judith Muehl, Dieter Schmalstieg
Venue: ACM Transactions on Graphics (TOG) (2009)

We present a new GPU-based rendering system for ray casting of multiple volumes. Our approach supports a large number of volumes, complex translucent and concave polyhedral objects as well as CSG intersections of volumes and geometry in any combination. The system (including the rasterization stage) is implemented entirely in CUDA, which allows full control of the memory hierarchy, in particular access to high bandwidth and low latency shared memory. High depth complexity, which is problematic for conventional approaches based on depth peeling, can be handled successfully. As far as we know, our approach is the first framework for multivolume rendering which provides interactive frame rates when concurrently rendering more than 50 arbitrarily overlapping volumes on current graphics hardware.
A Proposal for Making Argumentation Computationally Capable of Handling Large Repositories of Uncertain Data
Authors: Marcela Capobianco, Guillermo R. Simari
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

Data intensive applications with the capability of handling uncertain, imprecise, and inconsistent information are in constant demand. Efficient computational systems that can perform complicated inferences, obtain the appropriate conclusions, and explain the results are increasingly being required to act upon large databases. Argumentation systems could be used in the construction of interactive systems that are able to reason with large databases and/or different data sources. Notwithstanding, there are two important issues that need to be resolved in order to use argumentation in this kind of practical applications: adding the ability to deal with explicit uncertainty, and improving the computational complexity of argumentation, which so far has been an obstacle for its integration into interactive systems acting on large databases. In this paper we propose an argumentation-based system that has been engineered to address these issues.
A Data Transmission Mechanism for Survivable Sensor Networks
Authors: Ruiping Ma, Liudong Xing, Tongdan Jin, Tailiang Song
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

In wireless sensor networks (WSN), packets being sent over the transmission channel could get lost or corrupted due to factors such as channel noises, interferences, and node failures. Using the traditional retransmission mechanism to recover the lost/erroneous packets is costly or even impossible for WSN because sensor nodes are severely resource constrained and data transmission is the most energy intensive activity in WSN. An alternative approach is to apply forward error correcting (FEC) codes to achieve reliable data transmission. Nevertheless, FEC mechanisms do not provide security. To overcome this problem, an integrated mechanism has been proposed that systematically combines Reed-Solomon FEC codes and multiple versions of cryptographic algorithms to achieve both reliable and secure data transmission, leading to survivable WSN. In this paper, queuing modeling is applied to evaluate the performance of the integrated data transmission mechanism, and several case studies are performed to illustrate the application of the mechanism.
Computer Analysis Algorithm for Stability of the Extended Dynamic Leontief Input-output Model
Authors: Xiumei Wu, Lei Jiang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

This paper deals with the problem of computer analysis algorithm for the extended dynamic leontief input-output model. A new mathematic method is applied to study the singular systems without converting them into general systems. The parameter uncertainties are considered and are assumed to be Markovian jumping system. A new stability criterion for this singular model is given to ensure the stability of singular input-output model in terms of linear matrix inequality which can turn directly into computer control programs. Finally, the computer controller is provided to prove the applicability of the proposed method.
Promoting Social and Emotional Learning With Games
Authors: Robyn Hromek, Sue Roffey
Venue: Simulation and Gaming (2009)

This article has two broad objectives: (a) It reviews the theoretical and practical literature on the use of games to facilitate social and emotional learning (SEL). (b) Based on this review, it argues that games are a powerful way of developing social and emotional learning in young people. In addition, we draw on our collective experience as educational psychologists to identify effective practice when using games to teach SEL. The social and emotional skills needed to play successfully with others are those needed to succeed at work and in adult life. Prosocial skills involve regulating negative emotions, taking turns and sharing, support orientations to others that are fair, just, and respectful. The natural affiliation between children, play, and the desire to have fun with others makes games an ideal vehicle for teaching SEL. Circle Time games are used to support universal programs for teaching SEL to whole classes. Therapeutic board games provide an effective intervention for young people who have been targeted for further guided practice in small group settings. Verbatim quotations from students and teachers demonstrate ways in which SEL has generalized to real-life situations. The role of facilitator is crucial to the success of this approach, both in modeling appropriate skills and making the learning connections for students. In this article, facilitation and debriefing are deconstructed and the value of collaborative, rather than competitive, aspects of games highlighted.
On FO 2 Quantifier Alternation over Words
Authors: Manfred Kufleitner, Pascal Weil
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We show that each level of the quantifier alternation hierarchy within FO 2[ < ] on words is a variety of languages. We use the notion of condensed rankers, a refinement of the rankers defined by Weis and Immerman, to produce a decidable hierarchy of varieties which is interwoven with the quantifier alternation hierarchy --- and conjecturally equal to it. It follows that the latter hierarchy is decidable within one unit, a much more precise result than what is known about the quantifier alternation hierarchy within FO[ < ], where no decidability result is known beyond the very first levels.
The design and evaluation of the Simple Self-Similar Sequences Generator
Authors: Pedro R. M. Inácio, Branka Lakic, Mário M. Freire, Manuela Pereira, Paulo P. Monteiro
Venue: Information Sciences: an International Journal (2009)

This paper describes a new algorithm for the generation of pseudo random numbers with approximate self-similar structure. The Simple Self-Similar Sequences Generator (4SG) elaborates on an intuitive approach to obtain a fast and accurate procedure, capable of reproducing series of points exhibiting the property of persistence and anti-persistence. 4SG has a computational complexity of O(n) and memory requirements of the order of log"2(N), where N is the number of points to be generated. The accuracy of the algorithm is evaluated by means of computer-based simulations, recurring to several Hurst parameter estimators, namely Variance Time (VT) and the Wavelets-based estimator. The Hosking and the Wavelets-based methods for the generation of self-similar series were submitted to the same tests the 4SG was analysed with, providing for a basis for comparison of several performance aspects of the algorithm. Results show that the proposal embodies a good candidate not only for on-demand emulation of arbitrarily long self-similar sequences, but also for fast and efficient online simulations.
Scaling-Up and Speeding-Up Video Analytics Inside Database Engine
Authors: Qiming Chen, Meichun Hsu, Rui Liu, Weihong Wang
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Most conventional video processing platforms treat database merely as a storage engine rather than a computation engine, which causes inefficient data access and massive amount of data movement. Motivated by providing a convergent platform, we push down video processing to the database engine using User Defined Functions (UDFs).However, the existing UDF technology suffers from two major limitations. First, a UDF cannot take a set of tuples as input or as output, which restricts the modeling capability for complex applications, and the tuple-wise pipelined UDF execution often leads to inefficiency and rules out the potential for enabling data-parallel computation inside the function. Next, the UDFs coded in non-SQL language such as C, either involve hard-to-follow DBMS internal system calls for interacting with the query executor, or sacrifice performance by converting input objects to strings.To solve the above problems, we realized the notion of Relation Valued Function (RVF) in an industry-scale database engine. With tuple-set input and output, an RVF can have enhanced modeling power, efficiency and in-function data-parallel computation potential. To have RVF execution interact with the query engine efficiently, we introduced the notion of RVF invocation patterns and based on that developed RVF containers for focused system support.We have prototyped these mechanisms on the Postgres database engine, and tested their power with Support Vector Machine (SVM) classification and learning, the most widely used analytics model for video understanding. Our experience reveals the value of the proposed approach in multiple dimensions: modeling capability, efficiency, in-function data-parallelism with multi-core CPUs, as well as usability; all these are fundamental to converging data-intensive analytics and data management.
Learning the Structure of Utility Graphs Used in Multi-issue Negotiation through Collaborative Filtering
Authors: Valentin Robu, Han Poutré
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

Graphical utility models represent powerful formalisms for modeling complex agent decisions involving multiple issues [2]. In the context of negotiation, it has been shown [10] that using utility graphs enables reaching Pareto-efficient agreements with a limited number of negotiation steps, even for high-dimensional negotiations involving complex complementarity/ substitutability dependencies between multiple issues. This paper considerably extends the results of [10], by proposing a method for constructing the utility graphs of buyers automatically, based on previous negotiation data. Our method is based on techniques inspired from item-based collaborative filtering, used in online recommendation algorithms. Experimental results show that our approach is able to retrieve the structure of utility graphs online, with a high degree of accuracy, even for highly non-linear settings and even if a relatively small amount of data about concluded negotiations is available.
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Authors: Mirosław Truszczyński
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stable-model semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which seems to be essentially different. Our goal is to explain the relationship between the two semantics. Pearce, Ferraris and Lifschitz's extension of the stable-model semantics is best viewed in the setting of arbitrary propositional theories. We propose an extension of the Faber-Leone-Pfeifer semantics, or FLP semantics, for short, to the full propositional language, which reveals both common threads and differences between the FLP and stable-model semantics. We establish several properties of the FLP semantics. We apply a similar approach to define supported models for arbitrary propositional theories.
Application of 4D Technologies on Shenyang MTC
Authors: Xi Gu, Lieyun Ding, Jun Sun, Hanbin Luo
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The Shenyang metro transit construction (MTC) will be estimate constructed with about tens billions Yuan of investment for next 20-25 years later. Because the long period, more uncertain, numerous participants, complex technologies, and wide scope, this project extremely needs a practical approach to concentrate various aspects of construction processes information. This paper introduced a construction management project used 4-dimensions (4D) technology for the Shenyang metro transit construction. This project developed a 4D applications based on web. It used dynamic interface integrates the 3D model and the real-time payment application, and expresses the 4D model with the novel transparency method. This dynamic interface also is the foundation that 4D extended to nD. However, there are some difference of the 4D application environment between design phase and construction phase. This paper discussed the inconvenience which 4D technology application meets in the current construction phase, and the solution mentality and method in actual project development.