ppxscal/embedding_network huggingface dataset:
Using Echo State Networks for Anomaly Detection in Underground Coal Mines
Authors: Oliver Obst, X. Rosalind Wang, Mikhail Prokopenko
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We investigate the problem of identifying anomalies in monitoring critical gas concentrations using a sensor network in an underground coal mine. In this domain, one of the main problems is a provision of mine specific anomaly detection, with cyclical (moving) instead of flatline (static) alarm threshold levels. An additional practical difficulty in modelling a specific mine is the lack of fully labelled data of normal and abnormal situations. We present an approach addressing these difficulties based on echo state networks learning mine specific anomalies when only normal data is available. Echo state networks utilize incremental updates driven by new sensor readings, thus enabling a detection of anomalies at any time during the sensor network operation. We evaluate this approach against a benchmark -- Bayesian network based anomaly detection, and observe that the quality of the overall predictions is comparable to the benchmark. However, the echo state networks maintain the same level of predictive accuracy for data from multiple sources. Therefore, the ability of echo state networks to model dynamical systems make this approach more suitable for anomaly detection and predictions in sensor networks.
Answering preference queries with bit-sliced index arithmetic
Authors: Denis Rinfret
Venue: Proceedings of the 2008 C3S2E conference (2008)

Systems providing only exact match answers, without allowing any kind of preference or approximate queries, are not sufficient in many contexts. Many different approaches have been introduced, often incompatible in their setup or proposed implementation. This work shows how different kinds of preference queries (PREFER, preference SQL and skyline) can be combined and answered efficiently using bit-sliced index (BSI) arithmetic. This approach has been implemented in a DBMS and performance results are included, showing that the bit-sliced index approach is efficient not only in a prototype system, but in a real system.
Co-modelling and Simulation with Multilevel of Granularity for Real Time Electronic Systems Supervision
Authors: Manel Khlif, Mohamed Shawky
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper describes a new modelling and simulation approach in order to observe the system behaviour and eventual faults. It is based on hardware-software co-modelling with multi-level of granularity to get multi-level of simulation speed. Our modelling approach let integrate the hardware specifications to the functional model in order to establish also hardware supervision models after HW/SW co-modelling and simulation.To reach this objective we have to have a relationship between the desired accuracy of the supervision and the level of granularity of the hardware-software model, for every ECU (Electronic Computing Units) that belongs to an automotive embedded architecture.
Composing heterogeneous reactive systems
Authors: Albert Benveniste, Benoît Caillaud, Luca P. Carloni, Paul Caspi, Alberto L. Sangiovanni-Vincentelli
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2008)

We present a compositional theory of heterogeneous reactive systems. The approach is based on the concept of tags marking the events of the signals of a system. Tags can be used for multiple purposes from indexing evolution in time (time stamping) to expressing relations among signals, like coordination (e.g., synchrony and asynchrony) and causal dependencies. The theory provides flexibility in system modeling because it can be used both as a unifying mathematical framework to relate heterogeneous models of computations and as a formal vehicle to implement complex systems by combining heterogeneous components. In particular, we introduce an algebra of tag structures to define heterogeneous parallel composition formally. Morphisms between tag structures are used to define relationships between heterogeneous models at different levels of abstraction. In particular, they can be used to represent design transformations from tightly synchronized specifications to loosely-synchronized implementations. The theory has an important application in the correct-by-construction deployment of synchronous design on distributed architectures.
Data Protection in the Third Pillar: In the Aftermath of the ECJ Decision on PNR Data and the Data Retention Directive
Authors: Eleni Kosta, Fanny Coudert, Jos Dumortier
Venue: International Review of Law, Computers and Technology (2007)

The data protection directive regulated the issue of processing of personal data, excluding from its field of application activities that relate to police and judicial cooperation in criminal matters. The terrorist attacks of 2001 and the bombings in Madrid and London have given a new impulse to political interest in police cooperation throughout the European Union and its regulation in order to ensure greater efficiency. As a response, the European Commission presented in October 2005 a Draft Framework Decision on the protection of personal data processed in the framework of police and judicial co-operation in criminal matters. Numerous drafts have been prepared thereafter, but no consensus has been yet reached (August 2007). In our paper we will present the current developments at European level for the regulation of the issue of data protection in the third pillar and we will analyse the main principles that should be applied in order to ensure a coherent data protection framework, which will pay due respect to the fundamental rights of the citizens, and especially the right to privacy and data protection on one hand, and the safeguards for an effective law enforcement system on the other.
Framework for version control & dependency link of components & products in software product line
Authors: Faheem Ahmed, Luiz Fernando Capretz, Miriam Capretz
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Software product line deals with the assembly of products from existing core assets commonly known as components and continuous growth in the core assets as we proceed with production. This idea has emerged as vital in terms of software development from component-based architecture. Since in software product line one has to deal with number of products and components simultaneous therefore there is a need to develop a strategy, which will help to store components and products information in such a way that they can be traced easily for further development. This storage strategy should reflect a relationship between products and components so that product history with reference to components can be traced and vise versa. In this paper we have presented a tree structure based storage strategy for components and products in software product line. This strategy will enable us to store the vital information about components and products with a relationship of their composition and utilization. We implemented this concept and simulated the software product line environment.
A content-based load balancing algorithm with admission control for cluster web servers
Authors: Saeed Sharifian, Seyed A. Motamedi, Mohammad K. Akbari
Venue: Future Generation Computer Systems (2008)

With the growing demands for web-based applications, cluster web servers emerged as a reliable and leading resource in internet infrastructure. Managing performance of the cluster web servers under heavy load conditions is a critical task specifically when it comes to the advent of dynamic contents and database-driven applications. In this paper we propose a new load balancing algorithm namely IQRD (Intelligent Queue-based Request Dispatcher) for web-switches of the cluster web servers which operates at layer-7. The IQRD aims to achieve better load balancing with the help of request classification, performance isolation and dynamic remaining capacity estimation mechanisms. For this, a queuing model was employed for each class of requests in each node of the cluster to provide an estimation regarding the node remaining capacity. This value is used as a load descriptor (index) in the load balancing algorithm and also used by the admission control mechanism. The implementation results with synthetic and realistic workloads confirm that IQRD effectively balances loads among servers in the cluster and achieves better response time and throughput compared to other load balancing algorithms. However, the IQRD algorithm offered more processing overheads both in the web-switch and the web servers, but presented a better load balancing among web servers, even when the request rates were beyond the cluster capacity.
Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics
Authors: David Applegate, Gerth Brodal, Daniel Panario, Robert Sedgewick
Venue:  (2007)

Proceedings of the Seventh SIAM International Conference on Data Mining
On the accuracy of statistical procedures in Microsoft Excel 2007
Authors: B. D. McCullough, David A. Heiser
Venue: Computational Statistics Data Analysis (2008)

Excel 2007, like its predecessors, fails a standard set of intermediate-level accuracy tests in three areas: statistical distributions, random number generation, and estimation. Additional errors in specific Excel procedures are discussed. Microsoft's continuing inability to correctly fix errors is discussed. No statistical procedure in Excel should be used until Microsoft documents that the procedure is correct; it is not safe to assume that Microsoft Excel's statistical procedures give the correct answer. Persons who wish to conduct statistical analyses should use some other package.
Research on Active Defense Strategy of Counter DDoS Attacks Based on Differential Games Model
Authors: Rui Guo, Guiran Chang, Yuhai Qin, Baojing Sun, Yifu Feng, Dan Peng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In this paper, it is advocated that defenders should take active action to stop DDoS attacks. We propose a new model based on Differential Games theory. Four main actors are included, Attacker, Defender, Victim, and Botnet. It is our belief that Victims who experience an attack should cooperate with Defender to defend for a DDoS-attack. The model indicates the minimum number of Bots that should blocked by Defender. A Differential Games model is used to determine how a Defender combats an Attacker and protect the servers. The feasibility and effectiveness of our approach is validated by measuring the performance of an experimental prototype against a series of attacks. The advantages of the scheme are discussed and further research directions are given.
Semantics Based Computational Resource Broker for Grid
Authors: Kailash Selvaraj, Neela Narayanan Venkatraman, Saswati Mukherjee
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Grid technology enables large scale aggregation of computational and other resources for sharing across organizational boundaries. Resource broker, the gateway to a managed set of computing elements, handles the job submission on behalf of the user. In this paper we present the design and development of computational resource broker for grid using semantic resource description and matching technique. We evaluate the computational resource broker with different job profile using Gridsim, Grid simulation toolkit and conclude with the discussion results
3rd international workshop on advances and applications of problem frames
Authors: Thein T. Tun, Jon G. Hall, Lucia Rapanotti, Karl Cox, Zhi Jin
Venue: Companion of the 30th international conference on Software engineering (2008)

Michael Jackson's Problem Frames are a highly promising approach to early life-cycle software engineering. Their focus moves the engineer back to the problem to be solved rather than forward to the software and solving a poorly defined problem. By applying the Problem Frames approach, the software engineer can understand the problem context and how it is to be affected by the proposed software, and ultimately work towards the right solution for the problem. The influence of the Problem Frames approach and related work is spreading in the fields of domain modelling, business process modelling, requirements engineering, software architecture as well as software engineering in general.
Pattern matching using the Hausdorff distance
Authors: Fang Yi, Xiong ShengWu
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Point matching can be a computationally intensive task, especially when large point sets are involved and when the transformation space has many degree of freedom. Here, we employ two efficient algorithms to solve the problem, in an attempt to reduce its computational complexity, while providing acceptable result. The first method is an approximation algorithm based on branch-and-bound approach, it is possible to achieve a tradeoff between the quality of result and the running time. The second method operates within the framework of the first method but accelerate it by using point alignments. We demonstrate the algorithms' performances on synthetically generate data. Moreover, we apply them on finding facial feature points in images and show some preliminary results.
Educational social linking in example authoring
Authors: I-Han Hsiao, Qi Li, Yi-Ling Lin
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Each educational resource management website relies on an authoring tool to provide example content. It takes time and experience for authors to create valuable content. Providing support during authoring can affect the quality and quantity of the examples. In this paper we propose a mashup solution to automatically link community wisdom to authors and ease various difficulties in authoring.
Novel indoor mobile robot navigation using monocular vision
Authors: Mao-Hai Li, Bing-Rong Hong, Ze-Su Cai, Song-Hao Piao, Qing-Cheng Huang
Venue: Engineering Applications of Artificial Intelligence (2008)

Novel autonomous navigation system for an indoor mobile robot based on monocular vision is presented. The navigation system is composed of on-line and off-line stages. During the off-line learning stage, the robot records an image frame sequence. From this sequence a hybrid environment map is built with Rao-Blackwellized particle filters (RBPF), where the number of resampling steps is determined adaptively for significantly reducing the particle depletion problem, and the evolution strategies (ES) are introduced for avoiding particle impoverishment. The map is partitioned into topological locations characterized by a set of geometrical scale invariant key-points. These key-points, represented with multi-dimension descriptors, can be robustly matched despite changes in contrast, scale and viewpoint, demonstrated with nearest neighbor search based on KD-tree. In the on-line navigation stage, the robot recognizes the most likely location through robust location recognition algorithm, estimates the relative pose between the locations, and then navigates the environment autonomously. Experiment results carried out with a real robot in an indoor environment show the superior performance of the proposed method.
Delay-dependent robust H∞ control for uncertain discrete-time singular systems with time-delays
Authors: Shuping Ma, Chenghui Zhang, Zhaolin Cheng
Venue: Journal of Computational and Applied Mathematics (2008)

The robust memoryless state feedback H"~ control problem for uncertain time-delay discrete-time singular systems is discussed. Under a series of equivalent transformation, the equivalence of this problem and the robust state feedback H"~ control problem for standard state-space uncertain time-delay discrete-time systems is presented. In terms of matrix inequality, the delay-dependent sufficient condition for the solution of this problem is given, the design method of the memoryless state feedback controller and the controller are also given.
A multi-story power delivery technique for 3D integrated circuits
Authors: Pulkit Jain, Tae-Hyoung Kim, John Keane, Chris H. Kim
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Integrating circuits in the vertical direction can alleviate interconnect related problems and enable heterogeneous chips to be stacked in a single package with a small form factor. This paper addresses the power delivery issues in 3D chips revealing some interesting facts and design challenges. A multi-story power delivery technique that can reduce the worst case DC noise by 45% and lower the overhead power consumed in the power supply network by 65% is proposed. A test chip layout in an SOI process, showing a 5.3% area overhead, demonstrates the feasibility of the scheme.
SEMMO: a scalable engine for massively multiplayer online games
Authors: Nitin Gupta, Alan J. Demers, Johannes E. Gehrke
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We propose to demonstrate SEMMO, a consistency server for MMOs. The key features of SEMMO are its novel distributed consistency protocol and system architecture. The distributed nature of the engine allows the clients to perform all computations locally; the only computation that the central server performs is to determine the serialization order of game actions. We will demo SEMMO through a game called Manhattan Pals, and show how we can exploit game semantics in order to support large-scale MMOs. In the demo, avatars of the audience will be able to play Manhattan Pals and thus experience various scalability and consistency effects of an MMO.
Games for virtual team building
Authors: Jason B. Ellis, Kurt Luther, Katherine Bessiere, Wendy A. Kellogg
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Distributed teams are increasingly common in today's workplace. For these teams, face-to-face meetings where members can most easily build trust are rare and often costprohibitive. 3D virtual worlds and games may provide an alternate means for encouraging team development due to their affordances for facile communication, emotional engagement, and social interaction among participants. Using principles derived from social psychological theory, we have designed and built a collection of team-building games within the popular virtual world Second Life. We detail here the design decisions made in the creation of these games and discuss how they evolved based on early participant observations.
On the bit extraction problem
Authors: J. Friedman
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Consider a coloring of the n-dimensional Boolean cube with c=2/sup s/ colors in such a way that every k-dimensional subcube is equicolored, i.e. each color occurs the same number of times. The author shows that for such a coloring one necessarily has (k-1)/n>or= theta /sub c/=(c/2-1)/(c-1). This resolves the 'bit extraction' or 't-resilient functions' problem (also a special case of the privacy amplification problem) in many cases, such as c-1/n, proving that XOR type colorings are optimal, and always resolves this question to within c/4 in determining the optimal value of k (for any fixed n and c). He also studies the problem of finding almost equicolored colorings when (k-1)/n
Efficient program execution indexing
Authors: Bin Xin, William N. Sumner, Xiangyu Zhang
Venue: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (2008)

Execution indexing uniquely identifies a point in an execution. Desirable execution indices reveal correlations between points in an execution and establish correspondence between points across multiple executions. Therefore, execution indexing is essential for a wide variety of dynamic program analyses, for example, it can be used to organize program profiles; it can precisely identify the point in a re-execution that corresponds to a given point in an original execution and thus facilitate debugging or dynamic instrumentation. In this paper, we formally define the concept of execution index and propose an indexing scheme based on execution structure and program state. We present a highly optimized online implementation of the technique. We also perform a client study, which targets producing a failure inducing schedule for a data race by verifying the two alternative happens-before orderings of a racing pair. Indexing is used to precisely locate corresponding points across multiple executions in the presence of non-determinism so that no heavyweight tracing/replay system is needed.
System overview of the humanoid robot Blackmann
Authors: Jian Wang, Tao Sheng, Jianwen Wang, Hongxu Ma
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents a newly developed humanoid robot Blackmann by the Robot Laboratory in the National University of Defense Technology, China. Blackmann is 1.55 meters tall and 63.5 Kg weight with 36 DOFs. And it was designed to be human-like including two legs, two arms, a trunk and a head. This paper covers the mechanical design, hardware description and basic motion control schemes of Blackmann. Up to now, Blackmann has been built and tested; the embedded motion control system has been realized and assembled in the body of Blackmann; the basic control schemes based on FRI point are implemented and human-like walking has been realized and further study is in process.
Securing Web applications
Authors: Dieter Gollmann
Venue: Information Security Tech. Report (2008)

Web application vulnerabilities have become a major concern in software security. We will present major attack patterns, i.e. SQL injection, cross-site scripting, cross-site request forgery, JavaScript hijacking, and DNS rebinding, together with a survey and assessment of the countermeasures available to web application developers.
GIGA+: scalable directories for shared file systems
Authors: Swapnil V. Patil, Garth A. Gibson, Sam Lang, Milo Polte
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

There is an increasing use of high-performance computing (HPC) clusters with thousands of compute nodes that, with the advent of multi-core CPUs, will impose a significant challenge for storage systems: The ability to scale to handle I/O generated by applications executing in parallel in tens of thousands of threads. One such challenge is building scalable directories for cluster storage - i.e., directories that can store billions to trillions of entries and handle hundreds of thousands of operations per second.