ppxscal/embedding_network huggingface dataset:
A cooperative management scheme for power efficient implementations of real-time operating systems on soft processors
Authors: Jingzhao Ou, Viktor K. Prasanna
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

A cooperative management scheme for power efficient implementations of real-time operating systems on field-programmable gate-array (FPGA)-based soft processors is presented. Dedicated power management hardware peripherals are tightly coupled to a soft processor by utilizing its configurability. These hardware peripherals manage tasks and interrupts in cooperation with the soft processor, while retaining the real-time responsiveness of the operating system. More specifically, the hardware peripherals perform the following power management functionalities: 1) control the on-chip clock distribution network for driving the soft processor, its hardware peripherals, and the bus interfaces between them; 2) perform task and interrupt management responsibilities of the operating system when the soft processor is turned off; and 3) selectively wake up the soft processor and its hardware components, and put them into proper activation states based on the hardware resource requirements of the tasks under execution. The implementations of two popular real-time operating systems on a state-of-the-art FPGA device are presented. Measurements on an experimental board show that the proposed power management scheme can lead to significant power savings.
Protection and Recovery of Disk Encryption Key Using Smart Cards
Authors: Kazumasa Omote, Kazuhiko Kato
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Information leakage has recently become a serious problem. Because a user's disk might contain a lot of confidential information, it should be encrypted and the encryption key protected securely. Disk security has been improved by storing the encryption key in a hardware token such as a smart card or USB device. There must be some way to recover the encryption key when the token is lost, but to prevent information leakage the encryption key should not be known by the system administrator and should not be able to be recovered by malicious users inside the system. Here we describe a scheme that can limit key recovery when the user’s smart card is lost and can do so without the administrator knowing the key. The smart card is used for generating the key and for improving the user authentication.
Decentralised coordination of groups of autonomous mobile robots
Authors: Andrey V. Savkin
Venue: International Journal of Systems, Control and Communications (2008)

The paper gives a qualitative analysis of the dynamics of a system consisting of several mobile robots coordinating their motion using simple local nearest neighbour rules. We show that under some assumptions the headings of all robots will be eventually constant. We give an example of a multi-agent system with a cyclic dynamics.
The Complexity Challenge in Embedded System Design
Authors: Hermann Kopetz
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The ever-increasing functionality and the non-functional constraints that must be satisfied by embedded systems lead to an enormous growth in the complexity at the system level. In this paper we investigate the notion of cognitive complexity and argue that it is not the embedded system, but the models of the embedded system that must be simple and understandable. The introduction of appropriate levels of abstraction in modeling and the associated concept formation help to reduce the emerging complexity by focusing on the relevant properties and omitting irrelevant detail, thus leading to a simpler representation of the evolving artifact. In the second part of the paper we present examples of basic-level concepts that we find essential in the design of distributed embedded systems and summarize the insights by presenting a set of concise design patterns that support the component-based design of embedded systems.
Sorting on Partially Connected Mesh Networks
Authors: Xuerong Feng, Chunlei Liu, Jun Kong
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We consider sorting problems based on compare-and-exchange operations on partially connected mesh networks, where n node are organized in sequence and each connects to its k nearest neighbors on both sides. Each node holds a distinct key and these keys need to be sorted in certain order. We present a sequential algorithm with $\frac{3}{8k}n^2$ + $O(n log n)$ time complexity and a parallel algorithm with $\frac{3}{2k}n$ + $O(log n)$ time complexity.
Software Quality Metrics and their Impact on Embedded Software
Authors: Marcio F. S. Oliveira, Ricardo Miotto Redin, Luigi Carro, Luís da Cunha Lamb, Flávio Rech Wagner
Venue: Proceedings of the 2008 5th International Workshop on Model-based Methodologies for Pervasive and Embedded Software (2008)

Although many improvements for software development are proposed by software engineers, the embedded system community faces a hard task in applying these improvements to software development, due to the strong dependence between software and hardware in embedded systems, which raises a trade-off between software quality, measured by traditional metrics, and optimization for a specific platform. Traditional software quality concerns reuse, abstraction, coupling, and coherence. Such concepts are usually in conflict with performance, memory footprint, and other physical metrics used for design evaluation in embedded systems. The purpose of this work is to evaluate the relationship between quality metrics for software products and physical metrics for embedded systems, in order to guide an embedded designer in selecting the best alternative design during design space exploration already at the model level. After the experiments, we could analyze the correlation between these metrics and highlight the behavior for quality and physical metrics, which help us to better understand the trade-off between reuse and optimization.
Effect of Polysaccharides on the Functional Properties of Peanut Protein
Authors: Zhining Cai, Mouming Zhao, Xiaoquan Yang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Proteins and polysaccharides are present together in many kinds of food and medicine systems and both macromolecules contribute to the structure, texture and stability of foods and medicines. This paper studied the effect of four kinds of polysaccharides on the functional properties of PPI. The results showed that both polysaccharides decreased the solubility of PPI with the increased of polysaccharides, and the emulsifying properties were increased. Foaming capacity and gelling of PPI were also be affected. These phenomena maybe due to different kinds interactions betwenn PPI and polysaccharides
Limited receptive area neural classifier for texture recognition of mechanically treated metal surfaces
Authors: O. Makeyev, E. Sazonov, T. Baidyk, A. Martín
Venue: Neurocomputing (2008)

The limited receptive area (LIRA) neural classifier is proposed for texture recognition of mechanically treated metal surfaces. It may be applied in systems that have to recognize position and orientation of complex work pieces during micromechanical device assembly as well as in surface quality inspection systems. The performance of the proposed classifier was tested on a specially created image database with four texture types corresponding to metal surfaces after milling, polishing with sandpaper, turning with lathe and polishing with file. The promising recognition rate of 99.8% was obtained.
Linearizablity of 1: -3 resonant system with homogeneous cubic nonlinearities
Authors: Zhibek Kadyrsizova, Valery G. Romanovski
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

We study the systems of differential equations of the form . x = x + p(x,y), . y = -3y + q(x,y), where p and q are homogeneous polynomials of degree three (either of which may be zero). The necessary and sufficient coefficient conditions for linearization of such systems are obtained.
A Heuristic Algorithm for Individual Haplotyping with Minimum Error Correction
Authors: Abdullah Al Mueen, Md. Shamsuzzoha Bayzid, Md. Maksudul Alam, Md. Saidur Rahman
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Haplotype is a pattern of Single Nucleotide Polymorphisms (SNP) on a single chromosome. Constructing a pair of haplotypes from aligned and overlapping but intermixedand erroneous fragments of the chromosomal sequences is a nontrivial problem. Minimum error correction approach states to minimize the number of errors to be corrected so that the pair of haplotypes can be constructed through consensus of the fragments. We give a heuristic algorithm that searches through alternative solutions using a gain measure and stops whenever no better solution can be achieved. Time complexity of each iteration is O(m3k) for an m × k SNP matrix where m and k are the number of fragments (number of rows) and number of SNP sites(number of columns) respectively in a SNP matrix. Alter native gain measure is also given to reduce running time. Experimental results show that our algorithm out performsthe best known previous algorithm.
Basis Collapse in Holographic Algorithms
Authors: Jin-Yi Cai, Pinyan Lu
Venue: Computational Complexity (2008)

Holographic algorithms are a novel approach to design polynomial time computations using linear superpositions. Most holographic algorithms are designed with basis vectors of dimension 2. Recently Valiant showed that a basis of dimension 4 can be used to solve in P an interesting (restrictive SAT) counting problem mod 7. This problem without modulo 7 is #P-complete, and counting mod 2 is NP-hard.We give a general collapse theorem for bases of dimension 4 to dimension 2 in the holographic algorithms framework. We also define an extension of holographic algorithms to allow more general support vectors. Finally we give a Basis Folding Theorem showing that in a natural setting the support vectors can be simulated by bases of dimension 2.
A linear-processor polylog-time algorithm for shortest paths in planar graphs
Authors: P. N. Klein, S. Subramanian
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We give an algorithm requiring polylog time and a linear number of processors to solve single-source shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O(/spl radic/n polylog n) separators.
Ontology-based knowledge management for joint venture projects
Authors: Kuo-Cheng Ku, Anthony Wensley, Hsing-Pei Kao
Venue: Expert Systems with Applications: An International Journal (2008)

When enterprises engage in strategic joint venture projects, communication, knowledge sharing and management issues are inevitable and complex problems. Problems relating to communication, knowledge sharing and management issues generally occur in more than one phase of joint venture projects and involve various different domains. This study reviews issues related to knowledge management in the context of joint ventures (JV) from both macro and micro perspectives by using an ontology-based approach to analyze complex knowledge management (KM) issues in the context of the Integrated Circuit (IC) industry. This study presents a framework for an ontology-based model to analyze the knowledge management processing of joint ventures in the IC industry, and uses the IC foundry industry as an example to explore implementation issues. This framework uses a conceptual enterprise ontology (EO) model and domains of EO to analyze the process of EO. Moreover, data from the IC foundry industry is used as a case study. This study aimed to assist managers in increasing the possibility of success in dealing with complicated JV projects.
Strategic bidding in continuous double auctions
Authors: P. Vytelingum, D. Cliff, N. R. Jennings
Venue: Artificial Intelligence (2008)

In this paper, we describe a novel bidding strategy that autonomous trading agents can use to participate in Continuous Double Auctions (CDAs). Our strategy is based on both short and long-term learning that allows such agents to adapt their bidding behaviour to be efficient in a wide variety of environments. For the short-term learning, the agent updates the aggressiveness of its bidding behaviour (more aggressive means it will trade off profit to improve its chance of transacting, less aggressive that it targets more profitable transactions and is willing to trade off its chance of transacting to achieve them) based on market information observed after any bid or ask appears in the market. The long-term learning then determines how this aggressiveness factor influences an agent's choice of which bids or asks to submit in the market, and is based on market information observed after every transaction (successfully matched bid and ask). The principal motivation for the short-term learning is to enable the agent to immediately respond to market fluctuations, while for the long-term learning it is to adapt to broader trends in the way in which the market demand and supply changes over time. We benchmark our strategy against the current state of the art (ZIP and GDX) and show that it outperforms these benchmarks in both static and dynamic environments. This is true both when the population is homogeneous (where the increase in efficiency is up to 5.2%) and heterogeneous (in which case there is a 0.85 probability of our strategy being adopted in a two-population evolutionary game theoretic analysis).
Integrated Real-Time Scheduling and Communication with Probabilistic Timing Assurances in Unreliable Distributed Systems
Authors: Fei Huang, Kai Han, Binoy Ravindran, E. D. Jensen
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

We consider distributed real-time systems that operate under run-time uncertainties including those on execution times and communication delays, and subject to arbitrary node failures and message losses. We present an integrated real-time scheduling and communication algorithm called Real-Time Scheduling with Reliable Data Delivery (RTSRD) that provides probabilistic end-to-end assurances on distributed task timeliness behaviors in such systems. RTSRD considers distributed tasks with end-to-end timing requirements that are expressed using time/utility functions and the optimality criterion of maximizing the total accrued utility. The algorithm decomposes end-to-end time constraints into local time constraints, and uses local slack time for node-local real-time scheduling and node-to-node real-time communication. We analytically establish RTSRD’s properties including probabilistic satisfaction of task time constraints. We also compare RTSRD with a prior algorithm called RTGL for the same problem. Our comparisons show that RTSRD outperforms RTG-L in terms of timeliness assurances (stronger) and algorithm overhead (lower).
Security preserving amplification of hardness
Authors: O. Goldreich
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The task of transforming a weak one-way function (which may be easily inverted on all but a polynomial fraction of the range) into a strong one-way function (which can be easily inverted only on a negligible function of the range) is considered. The previously known transformation does not preserve the security (i.e. the running time of the inverting algorithm) within any polynomial. Its resulting function, F(x), applies the weak one-way function to many small (of length mod x mod /sup theta /, theta
Multi-sensory game interface improves player satisfaction but not performance
Authors: Keith V. Nesbitt, Ian Hoskens
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

Players of computer games tend to be discerning about game quality. So, to be successful, game designers need to ensure that players receive the best possible experience. A growing trend in the design of game interfaces is the use of multi-sensory (visual, auditory and haptic) interfaces to broaden the experience for players. The assumption is that, by displaying different information to different senses, it is possible to increase the amount of information available to players and so assist their performance. To test this assumption, the first-person shooter game, "Quake 3: Arena", was evaluated in four modes: with only visual cues; with both visual and auditory cues; with both visual and haptic cues; and with visual, auditory and haptic cues. Players reported improved 'immersion', 'confidence' and 'satisfaction' when additional sensory cues were included, the multisensory game interface seemed to improve the player's experience, but there was no statistically significant improvement in their performance. We suspect that a better design of the information being displayed for each sense may be required if multi-sensory displays are to significantly improve the player's performance on specific game tasks.
A Course on Mathematical Logic (Universitext), 1 edition
Authors: S.M. Srivastava
Venue:  (2008)

This is a short, distinctive, modern, and motivated introduction to mathematical logic for senior undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in knowing what logic is concerned with and who would like to learn Gdels incompleteness theorems should find this book particularly convenient. The treatment is thoroughly mathematical, and the entire subject has been approached like a branch of mathematics. Serious efforts have been made to make the book suitable for the classroom as well as for self-reading. The book does not strive to be a comprehensive encyclopedia of logic. Still, it gives essentially all the basic concepts and results in mathematical logic. The book prepares students to branch out in several areas of mathematics related to foundations and computability such as logic, axiomatic set theory, model theory, recursion theory, and computability. The main prerequisite for this book is the willingness to work at a reasonable level of mathematical rigor and generality.
Dynamic perfect hashing: upper and lower bounds
Authors: M. Dietzfelbinger
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A randomized algorithm is given for the dictionary problem with O(1) worst-case time for lookup and O(1) amortized expected time for insertion and deletion. An Omega (log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes. If the worst-case lookup time is restricted to k, then the lower bound for insertion becomes Omega (kn/sup 1/k/).
Monotonicity of non-deterministic graph searching
Authors: Frédéric Mazoit, Nicolas Nisse
Venue: Theoretical Computer Science (2008)

In graph searching, a team of searchers are aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of the fugitive until they catch it. In another variant, the searchers permanently know the position of the fugitive, i.e. the fugitive is visible. This latter variant is called visible graph searching. A search strategy that catches any fugitive in such a way that the part of the graph reachable by the fugitive never grows is called monotone. A priori, monotone strategies may require more searchers than general strategies to catch any fugitive. This is however not the case for visible and invisible graph searching. Two important consequences of the monotonicity of visible and invisible graph searching are: (1) the decision problem corresponding to the computation of the smallest number of searchers required to clear a graph is in NP, and (2) computing optimal search strategies is simplified by taking into account that there exist some that never backtrack. Fomin et al. [F.V. Fomin, P. Fraigniaud, N. Nisse, Nondeterministic graph searching: From pathwidth to treewidth, in: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS'05, 2005, pp. 364-375] introduced an important graph searching variant, called non-deterministic graph searching, that unifies visible and invisible graph searching. In this variant, the fugitive is invisible, and the searchers can query an oracle that permanently knows the current position of the fugitive. The question of the monotonicity of non-deterministic graph searching was however left open. In this paper, we prove that non-deterministic graph searching is monotone. In particular, this result is a unified proof of monotonicity for visible and invisible graph searching. As a consequence, the decision problem corresponding to non-deterministic graph searching belongs to NP. Moreover, the exact algorithms designed by Fomin et al. do compute optimal non-deterministic search strategies.
Pointwise exact bootstrap distributions of cost curves
Authors: Charles Dugas, David Gadoury
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Cost curves have recently been introduced as an alternative or complement to ROC curves in order to visualize binary classifiers performance. Of importance to both cost and ROC curves is the computation of confidence intervals along with the curves themselves so that the reliability of a classifier's performance can be assessed. Computing confidence intervals for the difference in performance between two classifiers allows the determination of whether one classifier performs significantly better than another. A simple procedure to obtain confidence intervals for costs or the difference between two costs, under various operating conditions, is to perform bootstrap resampling of the test set. In this paper, we derive exact bootstrap distributions for these values and use these dstributions to obtain confidence intervals, under various operating conditions. Performances of these confidence intervals are measured in terms of coverage accuracies. Simulations show excellent results.
On Destination Set in IP-Level Topology Measurement
Authors: Yu Zhang, Bin-xing Fang, Hong-li Zhang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We present a thorough investigation of four issues with the destination set in IP-level topology measurement. 1) To evaluate the completeness of the destination set, we measured by brute force and found that a half of edges will be missed by the uniform random selection (URS) method which was adopted by well-known CAIDA' skitter. 2) Two potential reasons for edge missing, the short-term routing dynamics and the subnetting technique, were investigated with the last-hop selection method and the bisection selection method respectively. And the results showed that the subnetting technique is the main reason. 3) To select destinations efficiently, we presented the minimum cover selection (MCS) method which performed better than the URS method on 75% of networks over three months. 4) Finally, to investigate the bias of topology characterization, we measured a destination set larger than before and discovered a Chinese topology whose size is 5 times as large as that discovered by skitter. The comparison between characteristics of skitter's topology and ours indicated that the small destination set trends to miss the information on marginal networks.