ppxscal/embedding_network huggingface dataset:
An approach to online optimization of heuristic coordination algorithms
Authors: Jumpol Polvichai, Paul Scerri, Michael Lewis
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where characteristics of the environment vary dramatically from scenario to scenario, it is desirable to have automated techniques for appropriately configuring the coordination. This paper presents an approach that takes performance data from a simulator to train a stochastic neural network that concisely models the complex, probabilistic relationship between configurations, environments and performance metrics. The stochastic neural network is used as the core of a tool that allows rapid online or offline configuration of coordination algorithms to particular scenarios and user preferences. The overall system allows rapid adaptation of coordination, leading to better performance in new scenarios.
Combining Logic and Aggregation for Answer Selection
Authors: Ingo Glöckner
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

MAVE (Multinet-based Answer Verification) is a system for answer validation which combines logic-based techniques and aggregation for identifying the correct answers in given sets of answer candidates. The paper explains the basic concepts underlying MAVE and also presents ablation studies which reveal the contribution of the proposed methods to the achieved quality of selection.
Viewing Student Affect and Learning through Classroom Observation and Physical Sensors
Authors: Toby Dragon, Ivon Arroyo, Beverly P. Woolf, Winslow Burleson, Rana Kaliouby, Hoda Eydgahi
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We describe technology to dynamically collect information about students' emotional state, including human observation and real-time multi-modal sensors. Our goal is to identify physical behaviors that are linked to emotional states, and then identify how these emotional states are linked to student learning. This involves quantitative field observations in the classroom in which researchers record the behavior of students who are using intelligent tutors. We study the specific elements of learner's behavior and expression that could be observed by sensors. The long-term goal is to dynamically predict student performance, detect a need for intervention, and determine which interventions are most successful for individual students and the learning context (problem and emotional state).
Computer Simulation of the Anisotropy of Fluorescence in Ring Molecular Systems: Tangential vs. Radial Dipole Arrangement
Authors: Pavel Heřman, Ivan Barvík, David Zapletal
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Time dependence of the anisotropy of fluorescence in recently discovered cyclic antenna units of the BChl photosystem is modeled. Interaction with a bath and a static disorder here modeled as uncorrelated Gaussian disorder in the transfer integrals is taken into account. Parallel computer enviroment is used because one is forced to recalculate every physical quantity for several thousands of different realizations of disorder. Results for the ring LH4 with radial optical transition dipole arrangement are compared with those for the ring LH2 with the tangential one. The difference between LH2 and LH4 results for the static disorder in transfer integrals has an opposite sign in comparison with that one for the static disorder in local energies. Equivalent differences are shifted to a smaller times for the stronger interaction with a bath.
Optimised State Assignment for FSMs Using Quantum Inspired Evolutionary Algorithm
Authors: Marcos Paulo Araujo, Nadia Nedjah, Luiza Macedo Mourelle
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

Synchronous finite state machines are very important for digital sequential designs. Among other important aspects, they represent a powerful way for synchronizing hardware components so that these components may cooperate adequately in the fulfillment of the main objective of the hardware design. In this paper, we propose an evolutionary methodology to solve one of the problems related to the design of finite state machines. We solve the state assignment NP-complete problem using a quantum inspired evolutionary algorithm. This is motivated by the fact that with an optimised state assignment one can physically implement the state machine using a minimal hardware area and response time.
Efficient solution of a partial integro-differential equation in finance
Authors: E. W. Sachs, A. K. Strauss
Venue: Applied Numerical Mathematics (2008)

Jump-diffusion models for the pricing of derivatives lead under certain assumptions to partial integro-differential equations (PIDE). Such a PIDE typically involves a convection term and a non-local integral. We transform the PIDE to eliminate the convection term, discretize it implicitly, and use finite differences on a uniform grid. The resulting dense linear system exhibits so much structure that it can be solved very efficiently by a circulant preconditioned conjugate gradient method. Therefore, this fully implicit scheme requires only on the order of O(nlogn) operations. Second order accuracy is obtained numerically on the whole computational domain for Merton's model.
Performance Study of Routing Protocols for Wireless Mesh Networks
Authors: Anna Zakrzewska, Leszek Koszalka, Iwona Pozniak-Koszalka
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper proposes the performance evaluation and comparison of the main topology-based routing protocols commonly used in wireless ad hoc networks: DSDV, OLSR, AODV and DSR in a different environment such as wireless mesh network. It provides an overview of available solutions based on detailed simulation study. The performance comparison is done with regard to the network size, network load and the mobility of nodes. Based on the experimental results, we recommend using particular protocols in certain conditions.
MICRO: A Multilevel Caching-Based Reconstruction Optimization for Mobile Storage Systems
Authors: Tao Xie, Hui Wang
Venue: IEEE Transactions on Computers (2008)

High performance, highly reliable, and energy-efficient storage systems are essential for mobile data-intensive applications such as remote surgery and mobile data center. Compared with conventional stationary storage systems, mobile disk-array-based storage systems are more prone to disk failures due to their severe application environments. Further, they have very limited power supply. Therefore, data reconstruction algorithms, which are executed in the presence of disk failure, for mobile storage systems must be performance-driven, reliability-aware, and energy-efficient. Unfortunately, existing reconstruction schemes cannot fulfill the three goals simultaneously because they largely overlooked the fact that mobile disks have much higher failure rates than stationary disks. Besides, they normally ignore energy-saving. In this paper we develop a novel reconstruction strategy, called multi-level caching-based reconstruction optimization (MICRO), which can be applied to RAID-structured mobile storage systems to noticeably shorten reconstruction times and user response times while saving energy. MICRO collaboratively utilizes storage cache and disk array controller cache to diminish the number of physical disk accesses caused by reconstruction. Experimental results demonstrate that compared with two representative algorithms DOR and PRO, MICRO reduces reconstruction times on average 20.22% and 9.34%, while saving energy no less than 30.4% and 13%, respectively.
A Reinforcement Learning Automata Optimization Approach for Optimum Tuning of PID Controller in AVR System
Authors: Mohammad Kashki, Youssef Lotfy Abdel-Magid, Mohammad Ali Abido
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, an efficient optimization method based on reinforcement learning automata (RLA) for optimum parameters setting of conventional proportional-integral-derivative (PID) controller for AVR system of power synchronous generator is proposed. The proposed method is Continuous Action Reinforcement Learning Automata (CARLA) which is able to explore and learn to improve control performance without the knowledge of the analytical system model. This paper demonstrates the full details of the CARLA technique and compares its performance with Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) as two famous evolutionary optimization methods. The simulation results show the superior efficiency and performance of the proposed method in regard to other ones.
Applying Machine Learning Techniques for Detection of Malicious Code in Network Traffic
Authors: Yuval Elovici, Asaf Shabtai, Robert Moskovitch, Gil Tahan, Chanan Glezer
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

The Early Detection, Alert and Response (eDare) system is aimed at purifying Web traffic propagating via the premises of Network Service Providers (NSP) from malicious code. To achieve this goal, the system employs powerful network traffic scanners capable of cleaning traffic from known malicious code. The remaining traffic is monitored and Machine Learning (ML) algorithms are invoked in an attempt to pinpoint unknown malicious code exhibiting suspicious morphological patterns. Decision trees, Neural Networks and Bayesian Networks are used for static code analysis in order to determine whether a suspicious executable file actually inhabits malicious code. These algorithms are being evaluated and preliminary results are encouraging.
The design and implementation of an OLAP system for sequence data analysis
Authors: Chun Kit Chui
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

We design a novel online analytical processing system for sequence data analysis (the S-OLAP system). The biggest distinction of S-OLAP from traditional OLAP is that a sequence can be characterized not only by the attributes' values of its constituting items, but also by the subsequence/substring patterns it possesses. Traditional OLAP systems and techniques were not designed for sequence data and thus they are incapable of supporting sequence data analysis. This paper describes my Ph.D research on the design and implementation of the S-OLAP system. The proposed system is able to support "pattern-based" grouping and aggregation, which is currently not supported by any OLAP system. The preliminary ideas, significant research issues as well as major challenges of this ongoing project are presented.
A virtual platform for multiprocessor real-time embedded systems
Authors: Elias T. Silva,  Jr, Daniel Barcelos, Flávio R. Wagner, Carlos E. Pereira
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

This paper presents a virtual platform for the development and test of application software, low-level software, and hardware components for an MPSoC (Multiprocessor System-on-Chip) platform, where components are interconnected by a network-on-chip (NoC). The environment is aimed at the development of multithread real-time embedded applications in Java language. Communication and task management services are provided that are able to deal with real-time restrictions, following the RTSJ standard. SystemC models are used to describe processors and network connections that have equivalent descriptions in VHDL. Performance and power / energy evaluation are made possible, helping to shorten cycles for embedded system development, integration, and test.
Simulatable Binding: Beyond Simulatable Auditing
Authors: Lei Zhang, Sushil Jajodia, Alexander Brodsky
Venue: Proceedings of the 5th VLDB workshop on Secure Data Management (2008)

A fundamental problem in online query auditing is that an outside attacker may compromise database privacy by exploiting the sequence of query responses and the information flow from the database state to the auditing decision. Kenthapadi et al. [14] proposed the simulatable auditing model to solve this problem in a way that completely blocks the aforementioned information flow. However, the security does not come for free. The simulatable auditing model actually suffers from unnecessary data utility loss.We assert that in order to guarantee database privacy, blocking the information flow from the true database state to the auditing decision is sufficient but far from necessary. To limit the loss in data utility, we suggest an alternative approach that controls, instead of blocks, such information flow. To this end, we introduce a new model, called simulatable binding, in which the information flow from the true database state to the auditing decision is provably controlled by a selected safe binding. We prove that the proposed simulatable binding model provides a sufficient and necessary condition to guarantee database privacy, and therefore, algorithms based on our model will provide better data utility than algorithms based on the simulatable auditing model. To demonstrate the strength and practicality of our model, we provide two efficient algorithms for the max query and sum query auditing, respectively. For the ease of comparison, each algorithm is built by applying our simulatable binding model, and is compared to an algorithm applying the simulatable auditing model. Clear improvements are shown through experiments.
Technology, Society and Risk
Authors: Roger Rivett
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

There remains a healthy debate among those working in the fun-ctional safety field over issues that appear to be fundamental to the discipline. Coming from an industry that is a relative newcomer to this discipline I look to the more established industries to give a lead. Not only are they in debate about key issues, the approaches taken do not always transfer easily to a mass market product, developed within very tight business constraints. Key issues that are debated include:What is meant by risk, what is acceptable risk and who does the accepting?How do we justify that an acceptable risk has been, or will be, achieved?What role does the development process play?What is meant by the concept of a Safety Integrity Level?In this talk I will air some views on these questions based on my experience of deve-loping automotive systems and authoring industry sector guidelines and standards in the hope that this will provoke informed discussion. 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
On the Maximum Principle for Impulsive Hybrid Systems
Authors: Vadim Azhmyakov, Sid Ahmed Attia, Jörg Raisch
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this contribution, we consider a class of hybrid systems with continuous dynamics and jumps in the continuous state (impulsive hybrid systems). By using a newly elaborated version of the Pontryagin-type Maximum Principle (MP) for optimal control processes governed by hybrid dynamics with autonomous location transitions, we extend the necessary optimality conditions to a class of Impulsive Hybrid Optimal Control Problems (IHOCPs). For these problems, we obtain a concise characterization of the Impulsive Hybrid MP (IHMP), namely, the corresponding boundary-value problem and some additional relations. As in the classical case, the proposed IHMP provides a basis for diverse computational algorithms for the treatment of IHOCPs.
A gentle introduction to OSGi
Authors: Andre L.C. Tavares, Marco Tulio Valente
Venue: ACM SIGSOFT Software Engineering Notes (2008)

The Open Services Gateway Initiative (OSGi) is a framework that supports the implementation of component-based, service-oriented applications in Java. The framework man- ages the life-cycle of modules (called bundles in OSGi) and provides means to publish and search for services. Moreover, it supports the dynamic install and uninstall of bundles. Nowadays, OSGi is used in many application domains, including mobile phones, embedded devices, and application servers. In this paper, we provide a gentle introduction to the basic services provided by OSGi. The presentation is guided by a simple case study, involving the implementation of a Dictionary System.
Flexible Scientific Workflow Modeling Using Frames, Templates, and Dynamic Embedding
Authors: Anne H. Ngu, Shawn Bowers, Nicholas Haasch, Timothy Mcphillips, Terence Critchlow
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

While most scientific workflows systems are based on dataflow, some amount of control-flow modeling is often necessary for engineering fault-tolerant, robust, and adaptive workflows. However, control-flow modeling within dataflow often results in workflow specifications that are hard to comprehend, reuse, and maintain. We describe new modeling constructs to address these issues that provide a structured approach for modeling control-flow within scientific workflows, and discuss their implementation within the Kepler scientific workflow system.
Mapping between the Dublin Core Abstract Model DCAM and the TMDM
Authors: Lutz Maicher
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Dublin Core is a widely used metadata vocabulary. There is ongoing standardisation work for the usage of DC-vocabularies in Topic Maps. Although the DC-vocabularies are already used in RDF, XML and HTML, they are defined independently of any particular encoding syntax. The DCMI Abstract Model (DCAM) is the metamodel for the DC vocabulary. It should facilitate the development of better mappings and interoperability. In a first step, this paper describes the relationships between the DCAM and the Topic Maps metamodel (TMDM). Afterwards, the directed DCAM(TMDM and TMDM(DCAM mappings are defined. The DCAM(TMDM mapping, combined with a serialisation specification for a Topic Maps notation, is an encoding guideline for this Topic Maps notation. For the ongoing standardisation of the usage of DC-vocabularies we propose a two layers approach. The first is the mapping defined here, which assures the interoperability between DC-metadata in Topic Maps and documented in other representation formats. The second layer provides authoring guidelines for Topic Maps authors describing DC-metadata. Strictly adhering to these authoring guidelines will assure that the created topic maps can be mapped to the DCAM and, much more important, become always be mergeable (irrespective of the DCAM in the background).
Regional Economy Growth and Convergence: An Empirical Study on China's Science Parks
Authors: Jie Xu, Ning Zhou, Fengdan Shi
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper firstly introduces the concept of “knowledge filter” and divides the growth of Science Parks into innovation and commercialization of knowledge, university-industry relations as well as external factors of industry agglomeration and spillover effect. The empirical study based on the panel data model is applied to test contribution of each factor concerned with China’s science parks. Then, a further study on the effect of science parks on regional economic convergence is conducted by using the β convergence model. The results show that the driving factors have turned out to be better ones when China's science parks are at their mature stage since the 21st century. However, their effect on the economic convergence of their host cities is still limited.
Security and Privacy on Authentication Protocol for Low-Cost RFID
Authors: Yong-Zhen Li, Young-Bok Cho, Nam-Kyoung Um, Sang-Ho Lee
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

The Radio Frequency Identification (RFID) is an automatic identification system, relying on storing and remotely retrieving data about objects we want to manage using devices called RFID tag. Even though RFID system is widely used for industrial and individual applications, RFID tag has a serious privacy problem, i.e., traceability. To protect the users from tracing and also to support Low-cost RFID, we propose an authentication protocol which can be adopted for read-only RFID tag using XOR computation and Partial ID concept. The proposed protocol is secure against reply attacking, eavesdropping, and spoofing attacking so that avoiding the location privacy exposure.
Face Recognition Using Principal Component Analysis and Wavelet Packet Decomposition
Authors: Vytautas Perlibakas
Venue: Informatica (2004)

In this article we propose a novel Wavelet Packet Decomposition (WPD)-based modification of the classical Principal Component Analysis (PCA)-based face recognition method. The proposed modification allows to use PCA-based face recognition with a large number of training images and perform training much faster than using the traditional PCA-based method. The proposed method was tested with a database containing photographies of 423 persons and achieved 82-89% first one recognition rate. These results are close to that achieved by the classical PCA-based method (83-90%).
Dynamic modeling of the human upper limb
Authors: Antoanela Naaji
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

Dynamic modeling of osteoarticular system is necessary because the exertion of various actions and natural physiological movements are essentially dynamic. The wide mobility of human body leads to the necessity of modeling the osteoarticular system as a mechanism with a large number of degrees of freedom. The differential equations system obtained are very complex and assume numerical integration. Very often we use a simplified model because the phenomena produced are so complex that accurate mathematical reproduction is practically impossible. A dynamic model must provide a good estimate of total weight and mass distribution as well as transmissibility and amortization proprieties for bones, muscles, joints, blood and skin. The paper presents a dynamic functional model considering the human upper limb as a mechanic system with 5 degrees of freedom in the case the segments are moved by their own weight forces. The bones and the muscles were modeled in Solid Works, the model of the upper limb obtained being very close as form to the real one. The differential equations of motion were solved using Lagrange formalism.