ppxscal/embedding_network huggingface dataset:
Gates accept concurrent behavior
Authors: V. Gupta, V. Pratt
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We represent concurrent processes as Boolean propositions or gates, cast in the role of accepters of concurrent behavior. This properly extends other mainstream representations of concurrent behavior such as event structures, yet is defined more simply. It admits an intrinsic notion of duality that permits processes to be viewed as either schedules or automata. Its algebraic structure is essentially that of linear logic, with its morphisms being consequence-preserving renamings of propositions, and with its operations forming the core of a natural concurrent programming language.
V-shaped micromechanical tunable capacitors for RF applications
Authors: Aur&#x00e9;lie Cruau, Ga&#x00eb;lle Lissorgues, Pierre Nicole, Dominique Placko, Adrian M. Ionescu
Venue: Microsystem Technologies (2005)

A new MEM varactor design is presented. It relies on the displacement of an isolated conductor in the air gap of a V-shaped capacitor. To estimate capacitance and tuning ratio of this structure the distributed point source method (DPSM) has been used for electrostatic simulations. The realisation and characterisation of glass motionless prototypes show the feasibility and the interest of this new concept for RF applications. To obtain actuated mobile devices, a novel silicon process has also been developed.
A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings
Authors: Mordechai Shalom, Shmuel Zaks
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

SONET add/drop multiplexers (ADMs) are dominant cost factors in WDM SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in Calinescu and Wan, 2002. Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + ε approximation for it.
Path planning for laser scanning with an industrial robot
Authors: Sören Larsson, J. A. P. Kjellander
Venue: Robotics and Autonomous Systems (2008)

Reverse Engineering is concerned with the problem of creating CAD models of real objects by measuring point data from their surfaces. Current solutions either require manual interaction or expect the nature of the objects to be known. We believe that in order to create a fully automatic system for RE of unknown objects the software that creates the CAD-model should be able to control the operation of the measuring system. This paper is based on a real implementation of a measuring system controlled by CAD software, capable of measuring along curved paths. Some details of the system have been described in earlier publications. This paper is concerned with the problem of automatic path planning for a system that can move along curved paths.
An Intrusion-Tolerant Mechanism for Intrusion Detection Systems
Authors: Liwei Kuang, Mohammad Zulkernine
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In accordance with the increasing importance of intrusion detection systems (IDS), users justifiably demand the trustworthiness of the IDS. However, sophisticated attackers attempt to disable the IDS before they launch a thorough attack. Therefore, to accomplish its function, an IDS should have some mechanism to guarantee uninterrupted detection service even in the face of IDS component failures due to attacks. In this paper, we propose an intrusion-tolerant mechanism for network intrusion detection systems (NIDS) that employ multiple independent components. The mechanism monitors the detection units and the hosts on which the units reside and enables the IDS to survive component failure due to intrusions. As soon as a failed IDS component is discovered, a copy of the component is installed to replace it and the detection service continues. We implement the intrusion-tolerant mechanism based on the CSI-KNN-based NIDS and evaluate the prototype in the face of component failures. The results demonstrate that the mechanism can effectively tolerate intrusions.
Design of a fuzzy controller for pH using genetic algorithm
Authors: D. Mokeddem, J. P. Corriou, A. Khellaf, J. P. Cassar
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The control of pH is important in the chemical industry, poses a difficult problem because of inherent nonliniarities and frequently changing process dynamics. The work described in this paper aims at exploring a technique for producing adaptive fuzzy logic controller (FLC), in which a genetic (GA) is employed to alter membership functions. GA is an adaptive search technique based on natural selection and genetics rules. An adaptive GA-FLC scheme is presented for control of the pH process, the objective is to drive the pH of the solution to the desired set point in the shortest time by adjusting the valves on the two control input streams.
Development of Context-Aware Systems to Support Human-Human Communication and Collaboration
Authors: Rahat Iqbal, Kashif Iqbal, Nazaraf Shah, Jawed Siddiqui, Anne James
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The development of context-aware systems such as groupware or CSCW and ubiquitous systems require a significant understanding of specific tasks that the users will perform seamlessly in their everyday work. In order to do this, we need to understand the users’ tasks and their knowledge to perform these tasks, and build a computational model reflecting upon users’ tasks and their knowledge. Most importantly, such systems need to be socially appropriate so that they can support human-human communication in an implicit and unobtrusive way, by constantly monitoring humans, their activities and their intentions. The traditional methods of requirements capture are not suitable to design and develop such systems. In this paper, we discuss different models and theories that can help to gather requirements. Most importantly, a simulation can play an important role in the requirements engineering processes of such systems.
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
Authors: Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
Venue: Proceedings of the Data Compression Conference (2008)

We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT converts the text into a set of points in 2-dimensional geometry. Using this transform, we cananswer to many open questions in compressed text indexing: (1) Can compressed data structures be designed in external memory with similar performance as the uncompressed counterparts? (2) Can compressed data structures be designed for position restricted pattern matching? We also introduce a reverse transform, called Points2Text, which converts a set of pointsinto text. This transform allows us to derive the FIRST known lower bounds in compressed text indexing. We show strong equivalence between data structural problems in geometric range searching and text pattern matching. This provides a way to derive new results in compressed text indexing by translating the results from range searching.
The Solution Modelling System with Grouped Agents
Authors: Cai Zhiming, Yin Jun, Huang Liangli
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The solution selecting now is becoming very globally distributed. Many enterprises or organizations have grouped many agents with many teams around the world. They build the solution models cooperatively in the different sites. There are many difficulties in the group communication, the group visual modelling, the group decision-making, etc. It’s not easy for them to often come together for many meetings. So we are trying to build a group modelling system and help the distributed teams to reach a conclusion through the network. The agents can build models of the solutions in the local database, and share them with others via Intranet/Internet. The modelling process, model updating and agents’ working status can be conducted and traced by “soft-agents”. The system can reason the approximate best solutions by using two well-known group-decision-supporting algorithms – AHP, OWG.
An empirical study of bi-level parallel computing on a PC
Authors: Yu-Fai Fung, Wai-Leung Cheung, Gujit Singh, Muhammet F. Ercan
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Modern microprocessors that are being utilized in commodity personal computers have build-in parallel computing feature. In general, these microprocessors support Single Instruction Multiple Data (SIMD) parallel computing mechanism. Recently, dual-CPU systems are becoming very common and therefore, it is possible to combine the SIMD mechanism and the computing power that comes with two microprocessors to form a cost-effective parallel computing system. In this paper, we describe the methodology of combining two types of parallel processing mechanism and study the performance of such a system empirically.
A Novel Utility and Game-Theoretic Based Security Mechanism for Mobile P2P Systems
Authors: Brent Lagesse, Mohan Kumar
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Research on security in Peer-to-Peer (P2P) systems is dominated by reputation-based solutions. These solutions propagate opinions about other peers in order to help identify the best set of peers to utilize. In this paper, we model peers with utility functions and use those functions to examine the case in which an individual peer participates in an unfamiliar and untrusted system, similar to one in which a mobile peer can enter when moving into a new location. We additionally introduce a novel security mechanism for P2P systems called resource exploration in order to mitigate the problems inherent in reputation-based systems and analyze its effect on a 2-player game (between an attacker and the benign peer).
Area-efficient arithmetic expression evaluation using deeply pipelined floating-point cores
Authors: Ronald Scrofano, Ling Zhuo, Viktor K. Prasanna
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Recently, it has become possible to implement floating-point cores on field-programmable gate arrays (FPGAs) to provide acceleration for the myriad applications that require high-performance floating-point arithmetic. To achieve high clock rates, floating-point cores for FPGAs must be deeply pipelined. This deep pipelining makes it difficult to reuse the same floating-point core for a series of dependent computations. However, floating-point cores use a great deal of area, so it is important to use as few of them in an architecture as possible. In this paper, we describe area-efficient architectures and algorithms for arithmetic expression evaluation. Such expression evaluation is necessary in applications from a wide variety of fields, including scientific computing and cognition. The proposed designs effectively hide the pipeline latency of the floating-point cores and use at most two floating-point cores for each type of operator in the expression. While best-suited for particular classes of expressions, the proposed designs can evaluate general expressions as well. Additionally, multiple expressions can be evaluated without reconfiguration. Experimental results show that the areas of our designs increase linearly with the number of types of operations in the expression and that our designs occupy less area and achieve higher throughput than designs generated by a commercial hard-ware compiler.
Wrapper filtering criteria via linear neuron and kernel approaches
Authors: Michalis E. Blazadonakis, Michalis Zervakis
Venue: Computers in Biology and Medicine (2008)

Objective: The problem of marker selection in DNA microarray analysis has been addressed so far by two basic types of approaches, the so-called filter and wrapper methods. Wrapper methods operate in a recursive fashion where feature (gene) weights are re-evaluated and dynamically changing from iteration to iteration, while in filter methods feature weights remain fixed. Our objective in this study is to show that the application of filter criteria in a recursive fashion, where weights are potentially adjusted from cycle to cycle, produces noticeable improvement on the generalization performance measured on independent test sets. Methods and materials: Toward this direction we explore the behavior of two well known and broadly accepted pattern recognition approaches namely the support vector machines (SVM) and a single linear neuron (LN), properly adapted to the problem of marker selection. Within this context we also show how the kernel ability of SVM could be employed in a practical manner to provide alternative ways to approach the problem of reliable marker selection. Results: We explore how the proposed approaches behave in two application domains (breast cancer and leukemia), achieving comparable or even better results than those reported in the related bibliography. An important advantage of these approaches is their ability to derive stable performance without deteriorating due to the complexity of the application domain. Validation is performed using internal leave one out (ILOO) and 10-fold cross validation as well as independent test set evaluation. Conclusions: Results show that the proposed methodologies achieve remarkable performance and indicate that applying filter criteria in a wrapper fashion ('wrapper filtering criteria') provides a useful tool for marker selection. The contribution of this study is threefold. First it provides a methodology to apply filter criteria in a wrapper way (which is a new approach), second it introduces a fundamental pattern recognition component namely the single neuron (which is a linear estimator) and explores its behavior on marker selection and third it demonstrates an approach to exploit the kernel ability of SVMs in a practical and effective manner.
Minimum-energy control in the integro-differential linear systems
Authors: R. R. Rafatov
Venue: Automation and Remote Control (2008)

The problem of minimum-energy control in the integro-differential linear systems with Fredholm integral was solved using the N.N. Krasovskii method of the problem of moments. An explicit solution of the boundary problem for the integro-differential equation was established using the K.A. Kasymov method.
Network externalities and the deployment of security features and protocols in the internet
Authors: Marc Lelarge, Jean Bolot
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular economic reasons arising from the presence of network externalities. Indeed, like the Internet itself, the technologies to secure it exhibit network effects: their value to individual users changes as other users decide to adopt them or not. In particular, the benefits felt by early adopters of security solutions might fall significantly below the cost of adoption, making it difficult for those solutions to gain attraction and get deployed at a large scale. Our goal in this paper is to model and quantify the impact of such externalities on the adoptability and deployment of security features and protocols in the Internet. We study a network of interconnected agents, which are subject to epidemic risks such as those caused by propagating viruses and worms, and which can decide whether or not to invest some amount to deploy security solutions. Agents experience negative externalities from other agents, as the risks faced by an agent depend not only on the choices of that agent (whether or not to invest in self-protection), but also on those of the other agents. Expectations about choices made by other agents then influence investments in self-protection, resulting in a possibly suboptimal outcome overall. We present and solve an analytical model where the agents are connected according to a variety of network topologies. Borrowing ideas and techniques used in statistical physics, we derive analytic solutions for sparse random graphs, for which we obtain asymptotic results. We show that we can explicitly identify the impact of network externalities on the adoptability and deployment of security features. In other words, we identify both the economic and network properties that determine the adoption of security technologies. Therefore, we expect our results to provide useful guidance for the design of new economic mechanisms and for the development of network protocols likely to be deployed at a large scale.
Critical Episode Mining in Intrusion Detection Alerts
Authors: Mahboobeh Soleimani, Ali A. Ghorbani
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

One of the most important steps in attack detection using Intrusion Detection Systems (IDSs) is dealing with huge number of alerts that can be either critical single alerts and multi-step attack scenarios or false alerts and non-critical ones. In this paper we try to address the problem of managing alerts via a multi-layer alert correlation and ltering that can identify critical alerts after each step of correlation and ltering. After applying the approach on LL DDoS 1.0 data set, we achieved very good results in terms of critical alert detection rates, running time of approach and its memory usage. Our method could extract all of critical and multi-step attacksin LL DDoS 1.0 data set while we had almost 90% reduction in number of alerts.
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
Authors: M. M. Cropper, J. L. Goldwasser, A. J. W. Hilton, D. G. Hoffman, P. D. Johnson,  Jr.
Venue: Journal of Graph Theory (2000)

Philip Hall's famous theorem on systems of distinct representatives and its not-so-famous improvement by Halmos and Vaughan (1950) can be regarded as statements about the existence of proper list-colorings or list-multicolorings of complete graphs. The necessary and sufficient condition for a proper "coloring" in these theorems has a rather natural generalization to a condition we call Hall's condition on a simple graph G, a vertex list assignment to G, and an assignment of nonnegative integers to the vertices of G. Hall's condition turns out to be necessary for the existence of a proper multicoloring of G under these assignments. The Hall-Halmos-Vaughan theorem may be stated: when G is a clique, Hall's condition is sufficient for the existence of a proper multicoloring. In this article, we undertake the study of the class HHV of simple graphs G for which Hall's condition is sufficient for the existence of a proper multicoloring. It is shown that HHV is contained in the class 퓗0 of graphs in which every block is a clique and each cut-vertex lies in exactly two blocks. On the other hand, besides cliques, the only connected graphs we know to be in HHV are (i) any two cliques joined at a cut-vertex, (ii) paths, and (iii) the two connected graphs of order 5 in 퓗0, which are neither cliques, paths, nor two cliques stuck together. In case (ii), we address the constructive aspect, the problem of deciding if there is a proper coloring and, if there is, of finding one. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 199219, 2000
Towards Bio-Inspired Self-Organization in Sensor Networks: Applying the Ant Colony Algorithm
Authors: Jue Hong, Sanglu Lu, Daoxu Chen, Jiannong Cao
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Self-organization is the key to implement self-calibration, autonomously coordination and p2p communication in sensor networks. Current researches mainly solve this problem in an inappropriate pre-planned manner. The swarm intelligence of the Ant Colony Algorithm (ACA) provides a novel and efficient method for self-organization. For the similarity of sensor network and ant colony, we argue that the sensor networks will benefit from the bio-inspired self-organization by applying the ACA in optimization, structure formation and task/resource allocation. In this paper we outline the current researches on the ACA in sensor network first, then propose the potential applications and research issues. General design of the ACA in sensor network and some challenges are presented as well.
Controlled Disclosure of Context Information across Ubiquitous Computing Domains
Authors: Cristian Hesselman, Henk Eertink, Martin Wibbels, Kamran Sheikh, Andrew Tokmakoff
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

One of the challenges in ubiquitous computing is that of mobility, which typically requires interaction between intelligent environments in different domains of administration. We present a highly distributed and collaborative system that enables context-aware applications to obtain context information about mobile entities (users or devices) independent of the domain that produces this information. The added value of the system is that it enriches the amount of available context information about these entities in a way that is transparent for applications. In addition, the system shares context information across domains in a controlled manner by taking privacy policies into account, both of the mobile entity as well as of the domains it visits. We discuss the system's architecture, its implementation, and the way we deployed it.
Embedded Firmware Development with Multi-way Branching
Authors: Václav Dvorák
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper proposes a technique of firmware development based on Multi-valued Decision Diagrams (MDDs). Evaluation of multiple-output Boolean functions is faster than the one using Binary Decision Diagrams (BDDs) and has a small memory footprint often required in embedded systems. A micro-programmed controller that firmware runs on is supposed to support multi-way branching in hardware, whose implementation is known. A novel heuristic technique of a sub-optimal multivalued MDD synthesis is presented and a specific condition for spatial efficiency of MDD-based firmware is derived. The method is illustrated on practical examples. It may be quite useful for development of embedded microcontroller firmware as well as for fast digital system simulation.