ppxscal/embedding_network huggingface dataset:
Virtual Development Environment Based on SystemC for Embedded Systems
Authors: Sang-Young Cho, Yoojin Chung, Jung-Bae Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Virtual development environment increases efficiency of embedded system development because it enables developers to develop, execute, and verify an embedded system without real hardware. We implemented a virtual development environment that is based on SystemC, a system modeling language. This environment was implemented by linking the AxD debugger with a SystemC-based hardware simulation environment through the RDI interface. We minimized modification of SystemC simulation engine so that the environment can be easily changed or extended with various SystemC models. Also, by using RDI, any debugging controller that support RDI can be used to develop an embedded software on the simulation environment. We executed example applications on the developed environment to verify operations of our implemented models and debugging functions. Our environment targets in ARM cores that are widely used in commercial business.
Construction process visualization: a 3D animation of project activities
Authors: V. K. Bansal
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Most of the commercially available tools allow planner to the build 4D model of construction process but lack in the features like generation and manipulation of components of the 4D model in a single platform. Geographic Information Systems (GIS) based 3D animation of construction project activities linked with schedule is developed in this paper for visualization and review of construction project schedule. To facilitate the manipulation of components of animation on a single platform, both 3D model and project schedule are developed in GIS.
Guest Editor's Introduction: Frontiers of Simulation, Part II
Authors: Douglass Post
Venue: Computing in Science and Engineering (2004)

In this second of two issues devoted to the frontiers of simulation, we feature four articles that illustrate the diversity of computational applications of complex physical phenomena. A major challenge for computational simulations is how to accurately calculate the effects of interacting phenomena, especially when such phenomena evolve with different time and distance scales and have very different properties. When time scales for coupling different effects are long compared with those that determine each effect's evolution separately then the system is "loosely coupled." It is then possible to couple several existing calculations together through an interface and obtain accurate answers.
A process-driven computing model for reconfigurable semiconductor manufacturing
Authors: Robin G. Qiu, Gina Y. Tang, Sanjay B. Joshi
Venue: Robotics and Computer-Integrated Manufacturing (2008)

Reconfigurability is essential for semiconductor manufacturing systems to remain competitive. Reconfigurable systems avoid costly modifications required to change and adapt to changes in product, production and services. A fully automated, collaborative, and integrated while reconfigurable manufacturing system proves cost-effective in the long term and is a promising strategy for the semiconductor manufacturing industry. However, there is a lack of computing models to facilitate the design and development of control and management systems in a truly reconfigurable manner. This paper presents an innovative computing model for reconfigurable systems and controlled manufacturing processes while allowing for the integration of modern technologies to facilitate reconfiguration, such as radio frequency identification (RFID) and reconfigurable field programmable gate array (FPGA). Shop floor manufacturing activities are modeled as processes from a business perspective. A process-driven formal method that builds on prior research on virtual production lines is proposed for the formation of a reconfigurable cross-facility manufacturing system. The trajectory of the controlled manufacturing systems is optimized for on-demand production services. Reconfigurable process controllers are introduced in support of the essential system reconfigurability of future semiconductor manufacturing systems. Implementation of this approach is also presented.
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
Authors: Satoru Tanaka, Ken Nakamula
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

The problem of constructing pairing-friendly elliptic curves has received a lot of attention. To find a suitable field for the construction we propose a method to find a polynomial u(x), by the method of indeterminate coefficients, such that ¿ k (u(x)) factors. We also refine the algorithm by Brezing and Weng using a factor of ¿ k (u(x)). As a result, we produce new families of parameters using our algorithm for pairing-friendly elliptic curves with embedding degree 8, and we compute some explicit curves as numerical examples.
Enhancing Grids for Massively Multiplayer Online Computer Games
Authors: Sergei Gorlatch, Frank Glinka, Alexander Ploss, Jens Müller-Iden, Radu Prodan, Vlad Nae, Thomas Fahringer
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Massively multiplayer online games (MMOG) are an innovative and challenging class of applications for Grid computing that require large amounts of computational resources for providing a responsive and scalable gameplay for concurrently participating players connected via Internet. We present our Real-Time Framework (RTF) --- a Grid-based middleware for scaling game sessions through a variety of parallelization and distribution techniques. RTF is described within a novel multi-layer service-oriented architecture that comprises three advanced services --- monitoring, capacity planning, and runtime steering --- that use the potential of Grid computing to provide pervasive access to a potentially unbounded number of resources. We report experimental results on the quality of our capacity planning and scalability of the RTF distribution mechanism.
Efficient approximate inference in distributed Bayesian networks for MAS-based sensor interpretation
Authors: Norman Carver
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The multiply sectioned Bayesian network (MSBN) framework is the most studied approach for distributed Bayesian Network inference in an MAS setting. This paper describes a new framework that supports efficient approximate MAS-based sensor interpretation, more autonomy and asynchrony among the agents, and more focused, situation-specific communication patterns. Its use can lead to significant improvements in agent utilization and time-to-solution.
OPERAS: A Framework for the Formal Modelling of Multi-Agent Systems and Its Application to Swarm-Based Systems
Authors: Ioanna Stamatopoulou, Petros Kefalas, Marian Gheorghe
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

Swarm-based systems are a class of multi-agent systems (MAS) of particular interest because they exhibit emergent behaviour through self-organisation. They are biology-inspired but find themselves applicable to a wide range of domains, with some of them characterised as mission critical. It is therefore implied that the use of a formal framework and methods would facilitate modelling of a MAS in such a way that the final product is fully tested and safety properties are verified. One way to achieve this is by defining a new formalism to specify MAS, something which could precisely fit the purpose but requires significant period to formally prove the validation power of the method. The alternative is to use existing formal methods thus exploiting their legacy. In this paper, we follow the latter approach. We present OPERAS, an open framework that facilitates formal modelling of MAS through employing existing formal methods. We describe how a particular instance of this framework, namely OPERAS XC , could integrate the most prominent characteristics of finite state machines and biological computation systems, such as X-machines and P Systems respectively. We demonstrate how the resulting method can be used to formally model a swarm system and discuss the flexibility and advantages of this approach.
Image-Based Surface Detail Transfer
Authors: Zicheng Liu, Zhengyou Zhang, Ying Shan
Venue: IEEE Computer Graphics and Applications (2004)

This article presents a novel technique, called image-based surface detail transfer, that transfers geometric details from one surface to another with simple 2D image operations. The authors' basic finding is that, without knowing its 3D geometry, geometric details (local deformations) of an object can be extracted from a single image in a way independent of its surface reflectance. Furthermore, these geometric details can be directly transferred to modify the appearance of other objects in image space. The article provides examples of surface detail transfer between real objects, as well as between real and synthesized objects. It also demonstrates that this technique can be applied to human faces to produce aging effects or as a touch-up tool to remove wrinkles and color spots on the face images.
BrightStat.com: Free statistics online
Authors: Daniel Stricker
Venue: Computer Methods and Programs in Biomedicine (2008)

Powerful software for statistical analysis is expensive. Here I present BrightStat, a statistical software running on the Internet which is free of charge. BrightStat's goals, its main capabilities and functionalities are outlined. Three different sample runs, a Friedman test, a chi-square test, and a step-wise multiple regression are presented. The results obtained by BrightStat are compared with results computed by SPSS, one of the global leader in providing statistical software, and VassarStats, a collection of scripts for data analysis running on the Internet. Elementary statistics is an inherent part of academic education and BrightStat is an alternative to commercial products.
Estimating Real Estate Value-at-Risk Using Wavelet Denoising and Time Series Model
Authors: Kaijian He, Chi Xie, Kin Keung Lai
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

As the real estate market develops rapidly and is increasingly securitized, it has become an important investment asset in the portfolio design. Thus the measurement of its market risk exposure has attracted attentions from academics and industries due to its peculiar behavior and unique characteristics such as heteroscedasticity and multi scale heterogeneity in its risk and noise evolution etc. This paper proposes the wavelet denoising ARMA-GARCH approach for measuring the market risk level in the real estate sector. The multi scale heterogeneous noise level is determined in the level dependent manner in wavelet analysis. The autocorrelation and heteroscedasticity characteristics for both data and noises are modeled in the ARMA-GARCH framework. Experiment results in Chinese real estate market suggest that the proposed methodology achieves the superior performance by improving the reliability of VaR estimated upon those from traditional ARMA-GARCH approach.
Semantics-Driven Introspection in a Virtual Environment
Authors: Francesco Tamberi, Dario Maggiari, Daniele Sgandurra, Fabrizio Baiardi
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Semantics-driven monitoring discovers attacks against a process by evaluating invariants on the process state. We propose an approach that increases the robustness and the transparency of the run-time monitoring system by introducing two virtual machines (VMs) running on the same platform. One VM runs the monitored process, i.e. the process P to be protected, while the other one evaluates invariants on P state each time P invokes a system call. To this purpose, an Introspection Library allows the monitoring VM to access the memory and the processor registers of the monitored VM.After describing the overall architecture, we focus on the Introspection Library and the problems posed by the introspection of variables in the memory of a program running in a distinct VM to evaluate invariants. A first prototype implementation is also presented together with preliminary performance results.
Exact and Approximate Inference for Annotating Graphs with Structural SVMs
Authors: Thoralf Klein, Ulf Brefeld, Tobias Scheffer
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Training processes of structured prediction models such as structural SVMs involve frequent computations of the maximum-a-posteriori (MAP) prediction given a parameterized model. For specific output structures such as sequences or trees, MAP estimates can be computed efficiently by dynamic programming algorithms such as the Viterbi algorithm and the CKY parser. However, when the output structures can be arbitrary graphs, exact calculation of the MAP estimate is an NP-complete problem. In this paper, we compare exact inference and approximate inference for labeling graphs. We study the exact junction tree and the approximate loopy belief propagation and sampling algorithms in terms of performance and ressource requirements.
Approximate Versus Linguistic Representation in Fuzzy-UCS
Authors: Albert Orriols-Puig, Jorge Casillas, Ester Bernadó-Mansilla
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper introduces an approximate fuzzy representation to Fuzzy-UCS, a Michigan-style Learning Fuzzy-Classifier System that evolves linguistic fuzzy rules, and studies whether the flexibility provided by the approximate representation results in a significant improvement of the accuracy of the models evolved by the system. We test Fuzzy-UCS with both approximate and linguistic representation on a large collection of real-life problems and compare the results in terms of training and test accuracy and interpretability of the evolved rule sets.
Line Facility Location in Weighted Regions
Authors: Yam Ki Cheung, Ovidiu Daescu
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

In this paper, we present approximation algorithms for the line facility location problem in weighted regions: Given l fixed points in a 2-dimensional weighted subdivision of the plane, with n vertices, find a line L such that the sum of the weighted distances from the fixed points to L is minimized. The weighted region setup is a more realistic model for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that could possibly be used for solving other problems in weighted regions.
Fault-free cycles in folded hypercubes with more faulty elements
Authors: Jung-Sheng Fu
Venue: Information Processing Letters (2008)

Let FF"v (respectively, FF"e) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional folded hypercube FQ"n. In this paper, we show that FQ"n-FF"v-FF"e contains a fault-free cycle with length at least 2^n-2|FF"v| if |FF"e|+|FF"v|==3. Our result improves the previously known result of [S.-Y. Hsieh, A note on cycle embedding in folded hypercubes with faulty elements, Information Processing Letters (2008), in press, doi:10.1016/j.ipl.2008.04.003] where |FF"e|+|FF"v|==4.
Development and Evaluation of a Centaur Robot
Authors: Satoshi Tsuda, Kuniya Shinozaki, Ryohei Nakatsu
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Recently various types of robots are being studied and developed, which can be classified into two groups: humanoid type and animal type. Since each group has its own merits and demerits, a new type of robot is expected to emerge with greater strengths and fewer weaknesses. In this paper we propose a new type of robot called the "Centaur Robot" by merging the concepts of these two types of robots. This robot has a human-like upper body and a four-legged animal-like lower body. Due to this basic architecture, the robot has several merits, including human-like behaviors and stable walking even on non-smooth ground. We describe its hardware and software architectures. Also we describe the experiments to evaluate its walking capability.
A Tutorial on Object-Oriented Functional Programming
Authors: Horia F. Pop
Venue: Central European Functional Programming School: Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures (2008)

This paper forms the notes of a two-hours lecture introducing Object-Oriented Functional Programming with Lisp as a support language. We start by remembering the key concepts of functional programming, imperative programming and object-oriented programming. We continue with a discussion of object-orientedness in Lisp, including Lisp packages, Lisp data structures and CLOS --- Common Lisp Object System. We then remind the alternate approach, of functional paradigm in C++. A suggestion for a lab session follows.
Transactional Execution: Toward Reliable, High-Performance Multithreading
Authors: Ravi Rajwar, James Goodman
Venue: IEEE Micro (2003)

Although lock-based critical sections are the synchronization method of choice, they have significant performance limitations and lack certain properties, such as failure atomicity and stability. Addressing both these limitations requires considerable software overhead. Transactional Lock Removal can dynamically eliminate synchronization operations and achieve transparent transactional execution by treating lock-based critical sections as lock-free optimistic transactions.
Passive circuit synthesis using genetic algorithms in MATLAB
Authors: Vladislav Durev, Elissaveta Gadjeva
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

An approach to passive circuit synthesis in MATLAB is proposed in the present paper. The Modified Nodal Analysis is used for the construction of the admittance circuit matrix. A circuit of passive low-pass filter is used for the demonstration of the method. The algorithm is easy to implement in MATLAB environment. A methodology for the verification of the developed approach is proposed together with structural and structural-parametric optimization of the circuit.
New Malicious Code Detection Based on N-Gram Analysis and Rough Set Theory
Authors: Boyun Zhang, Jianping Yin, Jingbo Hao, Shulin Wang, Dingxing Zhang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Motivated by the standard signature-based technique for detecting viruses, we explore the idea of automatically detecting malicious code using the N-gram analysis. The method is based on statistical learning and not strictly dependent on certain viruses. We propose the use of rough set theory to reduce the feature dimension. An efficient implementation to calculate relative core, based on positive region definition is presented also. The k nearest neighbor and support vector machine classifiers are used to categorize a program as either normal or abnormal. The experimental results are promising and show that the proposed scheme results in low rate of false positive.
Distributed Reasoning with Fuzzy Description Logics
Authors: Jianjiang Lu, Yanhui Li, Bo Zhou, Dazhou Kang, Yafei Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

By the development of Semantic Web, increasing demands for vague and distributed information representation have triggered a mass of theoretical and applied researches of fuzzy and distributed ontologies, whose main logical infrastructures are fuzzy and distributed description logics. However, current solutions are proposed respectively on one of these two aspects. By integrating $\mathcal{E}$-connection into fuzzy description logics, this paper proposes a novel logical approach to couple both fuzzy and distributed features within description logics. The main contribution of these paper is to propose a discrete tableau algorithm to achieve reasoning within this new logical system.
Analysis of Hypernasal Speech in Children with Cleft Lip and Palate
Authors: Andreas Maier, Alexander Reuß, Christian Hacker, Maria Schuster, Elmar Nöth
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In children with cleft lip and palate speech disorders appear often. One major disorder amongst them is hypernasality. This is the first study which shows that it is possible to automatically detect hypernasality in connected speech without any invasive means. Therefore, we investigated MFCCs and pronunciation features. The pronunciation features are computed from phoneme confusion probabilities. Furthermore, we examine frame level features based on the Teager Energy operator. The classification of hypernasal speech is performed with up to 66.6 % (CL) and 86.9 % (RR) on word level. On frame level rates of 62.3 % (CL) and 90.3 % (RR) are reached.
Creation and Collaboration: Engaging New Audiences for Information Visualization
Authors: Jeffrey Heer, Frank Ham, Sheelagh Carpendale, Chris Weaver, Petra Isenberg
Venue: Information Visualization: Human-Centered Issues and Perspectives (2008)

In recent years we have seen information visualization technology move from an advanced research topic to mainstream adoption in both commercial and personal use. This move is in part due to many businesses recognizing the need for more effective tools for extracting knowledge from the data warehouses they are gathering. Increased mainstream interest is also a result of more exposure to advanced interfaces in contemporary online media. The adoption of information visualization technologies by lay users --- as opposed to the traditional information visualization audience of scientists and analysts --- has important implications for visualization research, design and development. Since we cannot expect each of these lay users to design their own visualizations, we have to provide them tools that make it easy to create and deploy visualizations of their datasets.
Lexical Affect Sensing: Are Affect Dictionaries Necessary to Analyze Affect?
Authors: Alexander Osherenko, Elisabeth André
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Recently, there has been considerable interest in the automated recognition of affect from written and spoken language. In this paper, we investigate how information on a speaker's affect may be inferred from lexical features using statistical methods. Dictionaries of affect offer great promise to affect sensing since they contain information on the affective qualities of single words or phrases that may be employed to estimate the emotional tone of the corresponding dialogue turn. We investigate to what extent such information may be extracted from general-purpose dictionaries in comparison to specialized dictionaries of affect. In addition, we report on results obtained for a dictionary that was tailored to our corpus.