ppxscal/embedding_network huggingface dataset:
Enterprise Integration and Monitoring Solution using Active Shared Space
Authors: Pawan Chowdhary, Lianjun An, Jun-Jang Jeng, Shyh-Kwei Chen
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper describes an architecture and framework for business process transformation and monitoring, using active shared space along with business process solution composer, for achieving the above goals. This framework treats business data and business services as the first class citizens. The central notions of this framework are business artifacts and business services both of which users can exploit to define the key business data and performance indicators. There are producers and consumers of business artifacts and business services for the shared data space. Underlying services and data graphs can be configured in such a way that the service invocation and data mediation can be fully automated via the active shared space without human intervention. Active shared space advocates new programming paradigm that enables business level monitoring and business process execution based upon the definitions of business artifacts, business services and data graph. The architecture of the active shared space will be detailed in this paper. A reference implementation will be given for the sake of validation and discussion.
A Novel Approach for Enacting the Distributed Business Workflows Using BPEL4WS on the Multi-Agent Platform
Authors: Li Guo, David Robertson, Yun-Heh Chen-Burger
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper describes the development of a distributed multi-agent workflow enactment mechanism using BPEL4WS[1] specification. It demonstrates that a multi-agent protocol (Lightweight Coordination Calculus (LCC)[5]) can be used to interpret a BPEL4WS speci- fication to enable distributed business workflow using web services composition. The key difference between our system and other existing multi-agent based web services composition systems is that with our approach, a business process model(system requirement) can be adopted directly in the multi-agent system, thus reduce the effort on the validation and verification of interaction protocol (system specification). This approach also provides us with a lightweight way of re-design of large components based system.
Introducing Systems Engineering to Industrial Design Engineering Students with Hands-On Experience
Authors: G. Maarten Bonnema, Ilanit F. Lutters-Weustink, Fred J. A. M. van Houten
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The article will present an innovative educational project to introduce Systems Engineering to third year's students in industrial design engineering at the University of Twente. In a short period the students are confronted with new technology, namely sensors and actuators. They have to apply this technology in a complex situation, the design of a home climate system or an intelligent automobile. They work in large groups without tutor. In parallel a basic course on systems engineering is given to provide the students with tools for handling this situation. The aim is that students are forced to apply the systems engineering tools in a concrete situation, thus directly experiencing the benefits. The project is implemented and the article describes the context, the goals, the setup, and the experiences of both teachers and students. The article concludes with an evaluation of the first and second year it has been executed.
A memory management approach for swapless embedded systems
Authors: Mauricio Lin, Ville Medeiros, Raoni Novellino, Ilias Biris, Edjard Mota
Venue: Linux Journal (2005)

Avoid the dreaded Out-of-Memory killer exception using these strategies for memory allocation.
A Lexicon Reduction Strategy in the Context of Handwritten Medical Forms
Authors: Robert Milewski, Srirangaraj Setlur, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Traditional handwriting recognition algorithms rely heavily on small lexicons and clean word images. Unfortunately, emergency medical documents do not satisfy either of these conditions. This is a significant road-block that is hampering efforts to rapidly convert valuable offline healthcare handwriting data into digital content that can be efficiently mined for information. This paper describes a strategy whereby given an image representing a noisy handwritten word from a medical document, and a large lexicon consisting of English, medical and pharmacological words, symbols, abbreviations and acronyms, significantly reduces the size of the lexicon while keeping the unknown desired entry within the lexicon. The approach combines geometric interpretations of the word image along with contextual inference of concepts to reduce lexicons for word recognition. The data extracted can then be efficiently and securely disseminated for epidemiological and outbreak detection/analysis. Experimental results on NY State PCR forms are reported.
A Fuzzy Approach of Decision Making for an Airline
Authors: Souhir Charfeddine, Felix Mora-Camino, Karim Zbidi
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In the Air Transport sector where the uncertainty is very frequent due to the high sensitivity of the activity to many factors that influence the behavior of the consumers. Fuzzy logic can be used to produce estimates which take into account the vagueness of the operating environment. In this sector, many important decisions about the supply of service are based on these estimates. In this paper an analysis of the optimal supply conditions under fuzzy demand information is considered for a market where only one carrier is operating. The carrier's supply decision making process is investigated, first when the demand function is obtained through classical methods then when it is given by a fuzzy function. The main advantages of the new approach are then discussed.
A Cloverleaf of Software Engineering
Authors: Dines Bjorner
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We shall touch upon four issues of software engineering (SE): domain engineering, formal techniques, SE sociology, and academic software architects. First, before software can be designed one must understand its requirements; but before requirements can be formulated one must understand the domain. So we assume that requirements development is based on first having established models of the (application) domain. I will illustrate facets of the railway domain. Second, we touch upon all of the three phases: domain engineering, requirements engineering and software design also being done formally, however "lite". Third, despite 35 years of formal methods, the SE industry, maturity-wise still lags far behind that of other engineering disciplines. So we examine why. Finally, in several areas, in health care, in architecture, and others, we see that major undertakings are primarily spearheaded by senior academic staff. Professors of medicine daily perform specialised surgery and treatments at hospitals. Professors of architecture design new, daring buildings for industry, and professors of civil engineering head the engineering structural design of new, daring bridges. So we speculate what a similar approach would entail for SE. The paper is provocative, it postulates, but most claims are not (but can and will be [4]) substantiated.
Real-Time Face Verification System on a Cell-Phone Using Advanced Correlation Filters
Authors: Chee Kiat Ng, Marios Savvides, Pradeep K. Khosla
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

We present a real-time face recognition system that we implemented on a cell-phone using computationally efficient Minimum Average Correlation Energy Filters. We examine the challenges faced in realizing such a practical system that can perform both enrollment and verification in real-time on the cell-phone using its limited memory and computational resources. Due to the speed and memory constraints of the cell-phone, we optimize the Correlation Filters using a fast fixed-point implementation of 2D Fourier Transform optimal for the cell-phone platform. We also detail an efficient algorithm for synthesizing these filters efficiently in order to minimize computation load and making the system practical with real-time enrollment of users.
A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming
Authors: Xue Gao, Pierre Michel Lallican, Christian Viard-Gaudin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, an online handwritten Chinese character segmentation method is proposed. It is based on a dynamic programming algorithm, which uses geometrical features extracted from the handwritten strokes. The algorithm is carried out in two stages: pre-segmentation and recognition-based segmentation. The experimental results on 2363 sentences, representing nearly 70,000 characters and more than 370,000 strokes, show that the presegmentation stage keeps incorrect segmentation rate below 1% with an over-segmentation rate limited to 11%. The final correct segmentation rate is about 88%, without using any language model, indicating the effectiveness of proposed approach.
Vowel & Diphthong Tutors for Language Therapy
Authors: Ingrid Kirschning, Ma. Teresa Toledo, Lydia E. Valadez, Dora Canizales
Venue: Proceedings of the Sixth Mexican International Conference on Computer Science (2005)

The present paper describes the application called ICATIANI, developed to aid hearing impaired children in the acquisition of speech. The system supports the practice of vowels, diphthong and basic vocabulary. An animated character "Baldi" pronounces slowly and asks the student to speak, and if the utterance is correctly recognized, Baldi smiles otherwise he makes a sad face and asks the child to try again. A speech recognizer is used to evaluate the pronunciation of the words. Tests were performed to assess the children's pronunciation and progress. Last year some improvement was detected and now not only hearing impaired children but also children with intellectual disabilities are trying out the system. This paper presents the advances and the results so far, as well as experiences of the applying speech technology to support language acquisition for children in a public school in Mexico.
Parametric curves on meshes
Authors: Takashi Kanai
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this paper, we propose a method for creating parametric curves on triangular meshes. A curve on a mesh is frequently used as a boundary curve of a specific region of a mesh in mesh modeling and applications such as texture mapping, remeshing or morphing. Although the curve defined in this paper is a piecewise linear approximation of a strict parametric curve, it is guaranteed that such a curve is just on a mesh. The basic idea is creating a curve on a spherical parameterization instead of direct definition on a mesh. The computation of this curve is done by using only the control points on a spherical parameterization which does not depend on the number of vertices in a mesh. This enables interactive creation/modification of curves even for dense meshes.
Sublinear algorithms for the fourier transform of signals with very few fourier modes: theory, implementations and applications
Authors: Ingrid Daubechies
Venue:  (2005)

RA&ell;SFA (Randomized Algorithm for Sparse Fourier Approximation) is a sublinear randomized algorithm. Given a discrete signal S of length N, the algorithm finds a near-optimal B-term Sparse Representation R in time and space poly(B, log(N), log(&delta;),&epsis; &minus;1), such that ||S &minus; R|| 2 &le; (1 + &epsis;)||S &minus; R Ropt|| 2. Its sublinear time cost outperforms the superlinear &Omega;( N log N) time requirement of the famous Fast Fourier Transform (FFT). However, a straightforward implementation of the RA&ell;SFA in [31] turns out to be very slow. Thus, it is important to improve the algorithm for practical purpose. This dissertation focuses on the improvement, implementation, and application of RA&ell;SFA. In order to make the theoretical sketch practical, we introduce several new ideas to speed up the algorithm. Both rigorous and heuristic arguments are presented. Theoretically, our RA&ell;SFA achieves the near-optimal approximation with high probability in time poly(B) log( N) log(1/&delta;)/&epsis;2. We also extend the algorithm to higher dimensional cases. Numerical examples show that our implementation is faster (by a factor of four thousand times) than original RA&ell;SFA. Furthermore, it already beats FFT for reasonably large N. The crossover point lies at N &sime; 70, 000 in one dimension, and at N &sime; 900 for data on a N x N grid in two dimensions for small B signals contaminated by noise. In some real applications, it is desirable to reconstruct the sparse representation from incomplete data. There are two main difficulties caused by irregularly spaced data. For one thing, a uniformly spaced sample may not always be available as a subset of the data; for another, the success probability of the RA&ell;SFA relies heavily on the percentage of available data. This thesis proposed a new adapted sublinear RA&ell;SFA algorithm. It introduced a greedy technique and Lagrange interpolation to overcome the above problems. One of the exciting applications of RA&ell;SFA is multiscale models. Typically, the solutions of these models have rapidly oscillating coefficients, with period proportional to a small parameter &alpha;. Chapter 4 presents the first study of a new sublinear spectral method with time cost O(|log &alpha;|poly(d)) per time step. It shows great potential in solving multiscale models fast, especially for small resolutions and high dimensions. This is a joint work with Dr. Ingrid Daubechies.
Good Learning and Implicit Model Enumeration
Authors: A. Morgado, J. Marques-Silva
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and hybrid solvers. Besides practical applications, the problem of counting propositional models is of key relevancy in computational complexity. In recent years a number of algorithms have been proposed for propositional model enumeration. This paper surveys algorithms for model enumeration, and proposes optimizations to existing algorithms, namely through the learning and simplificationof goods. Moreover, the paper also addresses open topics in model counting related with good learning. Experimental results indicate that the proposed techniques are effective for model enumeration.
CALL research archive: How can an online knowledge base further communication among second language professionals
Authors: Jane L. Hanson, Svetlana Dembovskaya, Soojung Lee
Venue: ReCALL (2005)

The inspiration for our project arose from a perceived gap between research in foreign/second language learning and classroom practice. In order to address this issue, we created a web site containing summaries of seminal articles in the area of CALL &ndash; computer assisted language learning. The summaries are useful for many teachers who do not have time to read full text journal articles and understand the statistical terms, but would like to take advantage of the research findings. Researchers will receive feedback from teachers in the form of comments, which may give insight for further research. Other features of the website are: a database of teachers' comments and demographic information, keyword search, index, glossary, chronological and alphabetical bibliography, links to research archives and sites assisting with statistical terminology and design of experiments.
A spectral approach to compute performance measures in a correlated single server queue
Authors: J. Kumaran, K. Mitchell, A. van de Liefvoort
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The coupling matrix was introduced in [8] to compute the performance measures of a PH/PH/1 single server queue. This matrix was extended in [1, 2] to include arrival and service processes that are possibly serially correlated processes, although the service process remains independent of the arrival process and all marginal distributions are matrix exponential, and this current paper is an extended abstract of [2]. The coupling matrix is constructed from the arrival and the service distributions without any computational effort, and the performance measures (such as waiting times and queue length distributions) are derived directly from its spectrum.
Skeleton based performance prediction on shared networks
Authors: S. Sodhi, J. Subhlok
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The performance skeleton of an application is a short running program whose performance in any scenario reflects the performance of the application it represents. Such a skeleton can be employed to quickly estimate the performance of a large application under existing network and node sharing. This work presents and validates a framework for automatic construction of performance skeletons of parallel applications. The approach is based on capturing the compute and communication behavior of an executing application, summarizing this behavior and then generating a synthetic skeleton program based on the summarized information. We demonstrate that automatically generated performance skeletons take an order of magnitude less time to execute than the application they represent, yet predict the application execution time with reasonable accuracy. For the NAS benchmark suite, we observed that the average-error in predicting the execution time was 6%. This research is motivated by the problem of performance driven resource selection in shared network and Grid environments.
Towards dynamic multiagent probabilistic inference: testbeds and methods
Authors: Xiangdong An
Venue:  (2005)

Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system monitoring and diagnosis to reason about the states of the corresponding distributed uncertain domains. In the static cases&mdash;where the current state is history independent, multiply sectioned Bayesian networks (MSBNs) provide a solution when interactions within each agent are structured and those among agents are limited. However, in the dynamic cases&mdash;where the current state is affected by history, if each agent evolves separately using a single agent dynamic Bayesian network (DBN), the agents' inference will not guarantee exact posterior probabilities. In this thesis, the theory of MSBNs is applied to dynamic multiagent probabilistic inference. The following three specific tasks are addressed: (1) the generation of MSBNs for empirically studying algorithms on MSBNs, (2) the construction of a dynamic multiagent probabilistic inference testbed that builds dynamic environments and simulates their states over time, and (3) the proposal of dynamic multiagent probabilistic inference methods. For the first task, the generation of MSBNs is treated as a sequence of decisions. The space of each decision is constrained so that a minimum amount of backtracking occurs and the outcome of generation is always a legal MSBN. A suite of algorithms is presented and experimental results are shown. For the second task, it is proposed that sequential digital circuits are simulated as dynamic test environments. Sequential digital circuits are easy to understand, and contain general issues related with uncertain reasoning. The testbed can build sequential digital circuits and simulate their states over time, where some of the logic gates and flip-flops can be set faulty with specified probabilities. For the third task, it is proposed that the entire domain for a period of time is modeled into an MSBN and the state of the domain is reasoned about period by period exactly using the MSBN. The state of a set of entities is reasoned about by observing all variables that are relevant to them. A concept of the graphical observable Markov boundary of a set of variables is introduced to capture all such relevant observable variables. (Abstract shortened by UMI.)
Robots in a domestic setting: a psychological approach
Authors: Massimiliano Scopelliti, Vittoria Giuliani, Ferdinando Fornara
Venue: Universal Access in the Information Society (2005)

The study presented in this paper aims at improving the current understanding of human-robot interaction by adopting a psychological approach. The acceptability of robotic devices in home settings, especially by elderly people, does not depend only on the practical benefits they can provide, but on complex relationships between the cognitive, affective and emotional components of people&#x2019;s images of robots. This study has investigated the main dimensions of these representations, by comparing the attitudes towards technology in general, and domestic robots in particular, held by people at different stages of the lifespan. The results confirm that age is a critical variable.
Contract-Driven Cooperation Development Process for Software Outsourcing
Authors: Junchao Xiao, Qing Wang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Software outsourcing is a process in which part of the work is outsourced to the other organizations by contract. The contract, core of the process, forms the basis of cooperation work. The content of the contract and cooperative mechanism determine whether the development can proceed successfully or if the software can meet the demand. By analyzing the process of contract-driven outsourcing cooperation development, this paper points out that the cooperation according with the contract is the prerequisite and basis of cooperation process. The crux of the problem in software outsourcing is how to share the vision and how to achieve effective engagement. In addition, this paper depicts the major contents of the structured contract and, with the application of the token ring, provides us with a process of software outsourcing development. Furthermore, solutions are offered to solve the problems about authority control, contractbased development and inconsistency avoidance.
Adaptive actor-critic learning for the control of mobile robots by applying predictive models
Authors: Rafiuddin Syam, Keigo Watanabe, Kiyotaka Izumi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

In this paper, we propose two methods of adaptive actor-critic architectures to solve control problems of nonlinear systems. One method uses two actual states at time k and time k+1 to update the learning algorithm. The basic idea of this method is that the agent can directly take some knowledge from the environment to improve its knowledge. The other method only uses the state at time k to update the algorithm. This method is called, learning from prediction (or simulated experience). Both methods include one or two predictive models, which are assumed to be applied to construct predictive states and a model-based actor (MBA). Here, the MBA as an actor can be viewed as a network where the connection weights are the elements of the feedback gain matrix. In the critic part, two value-functions are realized as a pure static mapping, which can be reduced to a nonlinear current estimator by using the radial basis function neural networks (RBFNNs). Simulation results obtained for a dynamical model of nonholonomic mobile robots with two independent driving wheels are presented. They show the effectiveness of the proposed approaches for the trajectory tracking control problem.