ppxscal/embedding_network huggingface dataset:
Object-oriented programming application in automotive door control performance
Authors: Abbasali Taghipour, Ehsan Taheripour
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

In this paper, a practical simulation of Automotive Door Control (ADC) is studied by using of Java software capabilities. ADC structure and its components with the main design parameters and relations are discussed. Dynamical model and the interactive effects of each internal component are ullustrated and explained. A program for Control and testing ADC in different conditions is developed. Software is designed for four doors Automotive. As a result, test procedure of each component can be accomplished simultaneously and can be done in any different conditions.
Performance Analysis and Evaluation of Digital Connection Oriented Internet Service Systems
Authors: Shunfu Jin, Wuyi Yue
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we propose a discrete-time connection oriented Internet service system with a release delay, and present performance analysis and evaluation of the system. We build a batch arrival Geom*/G/1 queueing model with a setup/close-delay/close-down strategy to characterize the system operation, and suppose that the batch size is a random variable following Pareto(c, ¿) distribution. We describe the performance measures for setup ratio and utility of connection based on numerical results.
Research on the Organizational Decision Support System for Small & Medium-Size Enterprise Based on Agent
Authors: Ruixue Fu, Chaofeng Xu, Ming Song, Zhanhong Xin
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

To develop more powerful and flexible Organizational Decision Support Systems (ODSS), after the introduction of abstract architecture of a federated MAS system with two types of agent, the architecture of AODSS with three layers has been presented. The core layer includes two kinds of agencies: Application Agency for the common applications of this system, and Decision Agency for performing the actual decision activity and providing the results. To illustrate the architecture, a simulation work has been done in one Chinese TV company and the results imply that the architecture provides a very efficient method to design and develop ODSS for small & medium-size enterprise, in coordination mechanisms to ensure that organizational decision processes are optimized, information integrating of legacy systems for knowledge sharing, the interaction of multiple groups, flexibility and ability to extend and reengineer, the reusable ability of legacy systems, has played a very important role.
Detecting LSB matching by applying calibration technique for difference image
Authors: Xiaolong Li, Tieyong Zeng, Bin Yang
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

In this paper, we investigate the calibration technique used in steganalysis of LSB matching. Instead of working on the original image, we propose to calculate the calibration-based detectors (e.g. Calibrated HCF COM) on the difference image, which is defined as the difference of the adjacent pixels of an image. The theoretical reliability of the new detectors is carefully studied. Moreover, several practical observations for enhancing the detectability are also given. The extensive experimental results clearly illustrate that the new detectors outperform the previous. Indeed, the new ones perform well even when the embedding rate is low.
The Clique Corona Operation and Greedoids
Authors: Vadim E. Levit, Eugen Mandrescu
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

S is a local maximum stable set of G, and we write S ¿ ¿(G), if S is a stable set of maximum size in the subgraph induced by S ¿ N(S), where N(S) is the neighborhood of S.It is known that ¿(G) is a greedoid for every forest G, [10]. Bipartite graphs and triangle-free graphs, whose families of local maximum stable sets form greedoids were characterized in [11] and [12], respectively.The clique corona is the graph G = H ¿ {H 1,H 2,...,H n } obtained by joining each vertex v k of the graph H with the vertices of some clique H k , respectively. In this paper we demonstrate that if G is a clique corona, then ¿(G) forms a greedoid on its vertex set.
Improving Angle Based Mappings
Authors: Frank Rehm, Frank Klawonn
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Visualization of high-dimensional data is an important issue in data mining as it enhances the chance to selectively choose appropriate techniques for analyzing data. In this paper, two extensions to recent angle based multi-dimensional scaling techniques are presented. The first approach concerns the preprocessing of the data with the objective to lower the error of the subsequent mapping. The second aims at improving differentiability of angle based mappings by augmenting the target space by one additional dimension. Experimental results demonstrate the gain of efficiency in terms of layout quality and computational complexity.
Numerical computations for long-wave short-wave interaction equations in semi-classical limit
Authors: Qianshun Chang, Yau-Shu Wong, Chi-Kun Lin
Venue: Journal of Computational Physics (2008)

This paper presents and compares various numerical techniques for the long-wave short-wave interaction equations. In addition to the standard explicit, implicit schemes and the spectral methods, a novel scheme SRK which is based on a time-splitting approach combined with the Runge-Kutta method is presented. We demonstrate that not only the SRK scheme is efficient compared to the split step spectral methods, but it can apply directly to problems with general boundary conditions. The conservation properties of the numerical schemes are discussed. Numerical simulations are reported for case studies with different types of initial data. The present study enhances our understanding of the behavior of nonlinear dispersive waves in the semi-classical limit.
The misery of digital organisations and the semiotic nature of IT
Authors: Peter Br&#x00f6;dner
Venue: AI Society (2008)

Contrary to common belief, IT systems often disappoint the expectations to increase productivity and flexibility of work and value creation processes. Moreover, most IT design and implementation projects still fail or burst time and cost budgets to a high extent. After presenting significant empirical evidence for these phenomena, the paper reflects on the reasons for their persistence by developing a semiotic perspective on the processes of dealing with computer artifacts in organisations. This semiotic view allows understanding the processes of designing, implementing and using IT systems as efforts of structuring social practices in organisations. A typical case of enterprise resource planning system implementation illustrates this. Finally, a number of guidelines for an improved practice of designing and appropriating IT systems for effective use in organisations are derived from the theoretical reflections.
Structure-Based Rule Selection Framework for Association Rule Mining of Traffic Accident Data
Authors: Rangsipan Marukatat
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

A rule selection framework is proposed which classifies, selects, and filters out association rules based on the analysis of the rule structures. It was applied to real traffic accident data collected from local police stations. The rudimentary nature of the data required several passes of association rule mining to be performed, each with different sets of parameters, so that semantically interesting rules can be spotted from the pool of results. It was shown that the proposed framework could find candidate rules that offer some insight into the phenomena being studied. 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
A System F with Call-by-Name Exceptions
Authors: Sylvain Lebresne
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type $A {\rlap{{*}}\cup} \{\varepsilon\}$ for programs of type A whose execution may raise the exception ¿ at top level, and a corruption type A (¿) for programs that may raise the exception ¿ in any evaluation context (not necessarily at top level). We present the syntax and reduction rules of the system, as well as its typing and subtyping rules. We then study its properties, such as confluence. Finally, we construct a realizability model using orthogonality techniques, from which we deduce that well-typed programs are weakly normalizing and that the ones who have the type of natural numbers really compute a natural number, without raising exceptions. 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
Numerical modeling of extended mild slope equation with finite volume method
Authors: Asu Inan, Lale Balas
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

When waves propagate from deep water to shallow water, they transform. Extended mild slope equation includes wave transformations such as refraction, diffraction, shoaling, reflection and dissipations due to bottom friction and wave breaking and harbour resonance. Extended mild slope equation can be applied to the rapidly varying topographies through higher order bottom effetcs. In this study, extended mild slope equation has been reduced to Helmholtz equation and solved with finite volume method. Numerical model has been applied to the Fethiye Bay in the Mediterranean Sea in Turkey.
A note about some properties of BC graphs
Authors: Xuegong Tan, Shun-Zheng Yu, Jin Han Park
Venue: Information Processing Letters (2008)

BC graphs is an important class of hypercube-like interconnection networks. In this paper, some properties-vertex-pancyclicity, super-connectivity and the maximum number of edges joining vertices are studied.
Statistically Valid Graph Representations of Scale-Space Geometry
Authors: Tomoya Sakai, Atsushi Imiya
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This paper presents a statistical scale-selection criterion for graph representations derived from differential geometric features of a greyscale image in a Gaussian scale space. The image gradient in scale space derives hierarchical and topological relationships among the bright and dark components in the image. These relationships can be represented as a tree and a skeleton-like graph, respectively. Since the image at small scales contains invalid geometric features due to noise and numerical errors, a validation scheme is required for the detected features. The presented scale-selection criterion allows us to identify the valid features used for the graph representations with statistical confidence.
A research agenda for query processing in large-scale peer data management systems
Authors: Katja Hose, Armin Roth, André Zeitz, Kai-Uwe Sattler, Felix Naumann
Venue: Information Systems (2008)

Peer Data Management Systems (Pdms) are a novel, useful, but challenging paradigm for distributed data management and query processing. Conventional integrated information systems have a hierarchical structure with an integration component that manages a global schema and distributes queries against this schema to the underlying data sources. Pdmsare a natural extension to this architecture by allowing each participating system (peer) to act both as a data source and as an integrator. Peers are interconnected by schema mappings, which guide the rewriting of queries between the heterogeneous schemas, and thus form a P2P (peer-to-peer)-like network. Despite several years of research, the development of efficient Pdmsstill holds many challenges. In this article we first survey the state of the art on peer data management: We classify Pdmsby characteristics concerning their system model, their semantics, their query planning schemes, and their maintenance. Then we systematically examine open research directions in each of those areas. In particular, we observe that research results from both the domain of P2P systems and of conventional distributed data management can have an impact on the development of Pdms.
Global Positioning System: A Case Study Focused on Systems Engineering
Authors: Randall Bullard, John Colombi, G. Richard Freeman
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

A case study was conducted which describes the application of systems engineering during the concept validation, system design and development, and production phases of the GPS program. The case examines the applied systems engineering processes, as well as the interactions of the GPS Joint Program Office, the prime contractors, and the multitude of government agencies that were associated with the program's development and fielding. The systems engineering process is traced from the initiation of studies and the development of key technologies that established the vision of a satellite navigation systemin the 1960s, through the multi-phase joint program that resulted in a full operational capability release in 1995. Numerous interviews were conducted with individuals who personally directed, managed and engineered the program, from which the systems engineering story, and the top four learning principles, emerged.
Exploring Manipulative Hand Movements During a Stressful Condition
Authors: Miguel Bruns Alonso, Michel Varkevisser, Paul Hekkert, David V. Keyson
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

By observing the way people who are stressed interact with objects one may be able to interpret how they feel (Krauss et al., 1996). For instance, at a presentation a nervous presenter can often be seen fidgeting with a pen or pointer. This has shown to be true even if people are actively trying to suppress or hide these feelings (Ekman Friesen, 1967). The behaviors when manipulating objects during a stressful event appear to be qualitatively different from manipulations during boring or neutral events (Kenner, 1984). Yet, no studies were found in which a categorization was made in the types of manipulative hand movements during different arousing and non-arousing conditions. The goal of this study was to explore what manipulative hand movements are evoked when using a pen during a stressful event as compared to a neutral event.
Reachability Analysis of Stochastic Hybrid Systems by Optimal Control
Authors: Manuela L. Bujorianu, John Lygeros, Rom Langerak
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

For stochastic hybrid systems, the reachability analysis is an important and difficult problem. In this paper, we prove that, under natural assumptions, reachability analysis can be characterised as an optimal stopping problem. In this way, one can apply numerical methods from optimal control to solve the reachability verification problems.
Study of Ni/Si(100) solid-state reaction with Y addition
Authors: Yi-Fei Huang, Yu-Long Jiang, Guo-Ping Ru, Xin-Ping Qu, Bing-Zong Li
Venue: Microelectronic Engineering (2008)

The characteristics of Ni/Si(100) solid-state reaction with yttrium (Y) addition are studied in this paper. Film stacks of Ti(20nm)/TiN(40nm)/Ni(8nm)/Y(4nm)/Ni(8nm)/Si(100) and Ti(20nm)/TiN(40nm)/Ni(7nm)/Y(6nm)/Ni(7nm)/Si(100) were prepared by physical vapor deposition. After solid-state reaction between metal films and Si was performed by rapid thermal annealing, various material analyses show that NiSi forms even with the addition of Y, and Ni silicidation is accompanied with Y diffusion in Ni film toward its top surface. The electrical characteristic measurements reveal that no significant Schottky barrier height modulation with the addition of Y occurs.
FLUX: functional updates for XML
Authors: James Cheney
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

XML database query languages have been studied extensively, but XML database updates have received relatively little attention, and pose many challenges to language design. We are developing an XML update language called FLUX, which stands for FunctionaL Updates for XML, drawing upon ideas from functional programming languages. In prior work, we have introduced a core language for FLUX with a clear operational semantics and a sound, decidable static type system based on regular expression types. Our initial proposal had several limitations. First, it lacked support for recursive types or update procedures. Second, although a high-level source language can easily be translated to the core language, it is difficult to propagate meaningful type errors from the core language back to the source. Third, certain updates are wellformed yet contain path errors, or "dead" subexpressions which never do any useful work. It would be useful to detect path errors, since they often represent errors or optimization opportunities. In this paper, we address all three limitations. Specifically, we present an improved, sound type system that handles recursion. We also formalize a source update language and give a translation to the core language that preserves and reflects typability. We also develop a path-error analysis (a form of dead-code analysis) for updates.
History-Independent Cuckoo Hashing
Authors: Moni Naor, Gil Segev, Udi Wieder
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures and distributed settings, and offers significant improvements compared to other schemes.In this work we construct a practical history-independent dynamic dictionary based on cuckoo hashing. In a history-independent data structure, the memory representation at any point in time yields no information on the specific sequence of insertions and deletions that led to its current content, other than the content itself. Such a property is significant when preventing unintended leakage of information, and was also found useful in several algorithmic settings.Our construction enjoys most of the attractive properties of cuckoo hashing. In particular, no dynamic memory allocation is required, updates are performed in expected amortized constant time, and membership queries are performed in worst case constant time. Moreover, with high probability, the lookup procedure queries only two memory entries which are independent and can be queried in parallel. The approach underlying our construction is to enforce a canonical memory representation on cuckoo hashing. That is, up to the initial randomness, each set of elements has a unique memory representation.
Class structure visualization with semi-supervised growing self-organizing maps
Authors: Arthur Hsu, Saman K. Halgamuge
Venue: Neurocomputing (2008)

We present a semi-supervised learning method for the growing self-organising maps (GSOM) that allows fast visualisation of data class structure on the 2D feature map. Instead of discarding data with missing values, the network can be trained from data with up to 60% of their class labels and 25% of attribute values missing, while able to make class prediction with over 90% accuracy for the benchmark datasets used. The proposed algorithm is compared to three variants of semi-supervised K-means learning on four real-world benchmark datasets and showed comparable performance and better generalisation.
Discretization of ISO-Learning and ICO-Learning to Be Included into Reactive Neural Networks for a Robotics Simulator
Authors: José M. Cuadra Troncoso, José R. Álvarez Sánchez, Félix Paz López
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

Isotropic Sequence Order learning (ISO-learning) and Input Correlation Only learning (ICO-learning) are unsupervised neural algorithms to learn temporal differences. The use of devices implementing this algorithms by simulation in reactive neural networks is proposed. We have applied several modifications to original rules: weights sign restriction, to adequate ISO-learning and ICO-learning devices outputs to the usually predefined kinds of connections (excitatory/inhibitory) used in neural networks, and decay term inclusion for weights stabilization. Original experiments with these algorithms are replicated as accurate as possible with a simulated robot and a discretization of the algorithms. Results are similar to those obtained in original experiments with analogue devices.
Generating Compact MTBDD-Representations from Probmela Specifications
Authors: Frank Ciesinski, Christel Baier, Marcus Größer, David Parker
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

The purpose of the paper is to provide an automatic transformation of parallel programs of an imperative probabilistic guarded command language (called Probmela) into probabilistic reactive module specifications. The latter serve as basis for the input language of the symbolic MTBDD-based probabilistic model checker PRISM, while Probmela is the modeling language of the model checker LiQuor which relies on an enumerative approach and supports partial order reduction and other reduction techniques. By providing the link between the model checkers PRISM and LiQuor, our translation supports comparative studies of different verification paradigms and can serve to use the (more comfortable) guarded command language for a MTBDD-based quantitative analysis. The challenges were (1) to ensure that the translation preserves the Markov decision process semantics, (2) the efficiency of the translation and (3) the compactness of the symbolic BDD-representation of the generated PRISM-language specifications.
Integrating Planning and Dialogue in a Lifestyle Agent
Authors: Cameron Smith, Marc Cavazza, Daniel Charlton, Li Zhang, Markku Turunen, Jaakko Hakulinen
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper, we describe an Embodied Conversational Agent advising users to promote a healthier lifestyle. This embodied agent provides advice on everyday user activities, in order to promote a healthy lifestyle. It operates by generating user activity models (similar to decompositional task models), using a Hierarchical Task Network (HTN) planner. These activity models are refined through various cycles of planning and dialogue, during which the agent suggests possible activities to the user, and the user expresses her preferences in return. A first prototype has been fully implemented (as a spoken dialogue system) and tested with 20 subjects. Early results show a high level of task completion despite the word error rate, and further potential for improvement.