ppxscal/embedding_network huggingface dataset:
Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems
Authors: Bach D. Bui, Marco Caccamo, Lui Sha, Joseph Martinez
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case study and experiments show that in a typical real-time embedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment.
A Graph-Theory Algorithm for WCET Estimation
Authors: Guowei Wu, Kai Yao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The complexity of modern program increases the difficulty to compute the upper bound worst case execution time fast and accurately. A new estimation method for WCET estimation is presented that uses graph theory to solve the program complexity problem. In this method, program basic blocks are represented as vertices in an undirected graph. The resulting graph can be partitioned into connected subgraphs with no edges between them. These subgraphs can in turn be broken into biconnected components. The combinational problem is reduced to finding the maximum energy of these small biconnected components and combining the results to identify the global maximum energy information, that is the worst case execution time. This algorithm will allow to analyze more complex program and can makes the execution time upper bound more accurate.
Quick encoding of plane graphs in log 214 bits per edge
Authors: Raquel Viaòa
Venue: Information Processing Letters (2008)

In this paper, a simple technique to encode any unlabeled and connected plane graph of E edges in Elog"214 bits is proposed. Both loops and multiple edges are allowed. The encoding process follows a labeling strategy based on a deterministic traversal of the graph. It improves existing methods which achieve shorter bit-length encodings in both time efficiency and simplicity. Besides, it does not impose any restriction on the number of loops and multiple edges that are allowed. Compared to techniques of similar time requirements, it offers a more compact compression solution.
Introducing Physical Visualization Sub-league
Authors: Rodrigo Silva Guerra, Joschka Boedecker, Norbert Mayer, Shinzo Yanagimachi, Yasuji Hirosawa, Kazuhiko Yoshikawa, Masaaki Namekawa, Minoru Asada
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

This work introduces the new sub-league of the RoboCup Soccer Simulation League, called Physical Visualization. We show how the fundamental collaborative concepts of this new sub-league shift essential research issues from the playing agents themselves to the development of a new versatile research and educational platform. Additionally, we discuss benefits of this new platform in terms of standardization, flexibility and reasonable price. We also try to characterize and discuss the place of this new sub-league within the RoboCup community. Finally, competition formats and roadmaps are presented and discussed.
Scalable Routing for Large Self-organizing Networks
Authors: Thomas Fuhrmann
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Over the past years, much effort has been devoted to investigate the interplay of peer-to-peer protocols and the underlying network infrastructure. One surprising result of these studies is the insight that peer-to-peer mechanisms can be pushed down into the network layer. The probably most thoroughly researched embodiment of that idea is the Scalable Source Routing (SSR) protocol. Recently, another similar protocol has been published, the Virtual Ring Routing (VRR) protocol. This tutorial explains both protocols and discusses their potential uses in large self-organizing networks.SSR and VRR are self-organizing routing protocols which have been inspired by structured peer-to-peer routing protocols such as Chord. Unlike Chord, SSR and VRR are genuine network layer protocols. They are especially suited for networks that do not have a well crafted structure, for example, sensor-actuator networks, ad-hoc networks and mesh networks. In particular, SSR is very memory efficient so that it can provide routing among nodes with very limited resources. This resource efficiency might also prove beneficial for large meshes of multi-homed wireline networks because it greatly reduces the size of the routers' forwarding information base.Both, SSR and VRR work on a flat identifier space. As a consequence, they can easily support host mobility without requiring any location directory or other centralized service. Furthermore, SSR and VRR directly provide key based routing in the network layer so that they can serve as efficient basis for fully decentralized applications. Both protocols are based on a virtual ring structure which is used in a Chord-like manner. SSR builds source routes to previously unknown destinations and caches them at so-called intermediate nodes. VRR creates state along the respective paths.This tutorial gives an in-depth introduction to SSR and VRR. It relates the protocols to previous approaches in ad-hoc networks, mesh networks and sensor networks; and it discusses the various parameters that optimize the protocols in a given scenario. The tutorial concludes with three practical examples from the presenter's research group. As a result, the participants will be well prepared to apply SSR or VRR for their own purposes.
On estimating joint interference for concurrent packet transmissions in low power wireless networks
Authors: Ritesh Maheshwari, Shweta Jain, Samir R. Das
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

In a wireless network it is important to understand the nature of the joint interference generated at a receiver by multiple concurrent transmitters. This understanding helps developing packet scheduling algorithms. Prior experimental work using older generation mote-class radios (CC1000) have showed systematic deviations between estimation and direct measurement of the joint interference power, thus questioning whether the standard assumption that received signal powers are additive is applicable in practice. We, however, show via extensive experimentation that on newer generation radios (CC2420), the additive assumption is valid, particularly at the low power end.
Simulation of the roughing process
Authors: Enescu Ioan, Buzatu Constantin, Lepadatescu Badea
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

We tried to answer to the main question: how are the elastic contact stress and deformation between curved face in contact influenced by surface roughness? Many processes involve the passage of a strip or sheet of material through the nip between rollers. In this paper we consider the strip to be perfectly elastic and investigate the stress in the strip, the length of the arc of contact with the roller, the maximum indentation of the strip and the precise speed at which it feeds through the nip in relation to the surface speed of the rollers. If the strip is wide and the rollers are long in the axial direction it is reasonable to assume plane deformation.
Dealing with Nondeterminism in Symbolic Control
Authors: Marius Kloetzer, Calin Belta
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Abstractions (also called symbolic models) are simple descriptions of continuous and hybrid systems that can be used in analysis and control. They are usually constructed in the form of transition systems with finitely many states. Such abstractions offer a very attractive approach to deal with complexity, while at the same time allowing for rich specification languages. Recent results show that, through the abstraction process, the resulting transition systems can be nondeterministic (i.e., if an input is applied in a state, several next states are possible). However, the problem of controlling a nondeterministic transition system from a rich specification such as a temporal logic formula is not well understood. In this paper, we develop a control strategy for a nondeterministic transition system from a specification given as a Linear Temporal Logic formula with a deterministic Büchi generator. Our solution is inspired by LTL games on graphs, is complete, and scales polynomially with the size of the Büchi automaton. An example of controlling a linear system from a specification given as a temporal logic formula over the regions of its triangulated state space is included for illustration.
Class-Based OSPF Traffic Engineering Inspired on Evolutionary Computation
Authors: Pedro Sousa, Miguel Rocha, Miguel Rio, Paulo Cortez
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

This paper proposes a novel traffic engineering framework able to automatically provide near-optimal OSPF routing configurations for QoS constrained scenarios. Within this purpose, this work defines a mathematical model able to measure the QoS compliance in a class-based networking domain. Based on such model, the NP-hard optimization problem of OSPF weight setting is faced resorting to Evolutionary Algorithms. The presented results show that, independently of other QoS aware mechanisms that might be in place, the proposed framework is able to improve the QoS level of a given domain only taking into account the direct influence of the routing component of the network. The devised optimization tool is able to optimize OSPF weight configurations in scenarios either considering a single level of link weights or using multiple levels of weights (one for each class) in multi-topology routing scenarios.
A Supervised Pattern Recognition Approach for Human Movement Onset Detection
Authors: Paolo Soda, Stefano Mazzoleni, Giuseppe Cavallo, Eugenio Guglielmelli, Giulio Iannello
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Applications of robotics and mechatronics to neurorehabilitation are getting more and more consensus in the clinical community thanks to early encouraging results. They enable an objective assessment of patient's motor recovery and the administration of rehabilitation treatments specific for each patient. In particular, isometric force/torque measurements in post-stroke patients were recently used in clinical trials for the functional assessment, with encouraging results. A challenging issue in the processing of such measurements is to detect the initiation of the voluntary contraction of the patient (i.e., onset time). The onset detection is crucial to obtain clinically relevant data. In previous works, different deterministic methods for onset detection were presented. Each of those methods is signal-structure dependant, causing drop of performance when applied to different kind of signals. In this paper, we introduce an innovative technique for the automatic selection of the best onset detection method. To this aim, we adopt a supervised pattern recognition approach that dynamically selects, from a pool of deterministic methods, the one that is best suited for each signal according to the signal structure. The method has been tested on annotated force and torque datasets, showing that such a method improves not only the performance achieved by the single deterministic techniques, but also those attained by a group of clinical experts.
CARSVM: A class association rule-based classification framework and its application to gene expression data
Authors: Keivan Kianmehr, Reda Alhajj
Venue: Artificial Intelligence in Medicine (2008)

Objective: In this study, we aim at building a classification framework, namely the CARSVM model, which integrates association rule mining and support vector machine (SVM). The goal is to benefit from advantages of both, the discriminative knowledge represented by class association rules and the classification power of the SVM algorithm, to construct an efficient and accurate classifier model that improves the interpretability problem of SVM as a traditional machine learning technique and overcomes the efficiency issues of associative classification algorithms. Method: In our proposed framework: instead of using the original training set, a set of rule-based feature vectors, which are generated based on the discriminative ability of class association rules over the training samples, are presented to the learning component of the SVM algorithm. We show that rule-based feature vectors present a high-qualified source of discrimination knowledge that can impact substantially the prediction power of SVM and associative classification techniques. They provide users with more conveniences in terms of understandability and interpretability as well. Results: We have used four datasets from UCI ML repository to evaluate the performance of the developed system in comparison with five well-known existing classification methods. Because of the importance and popularity of gene expression analysis as real world application of the classification model, we present an extension of CARSVM combined with feature selection to be applied to gene expression data. Then, we describe how this combination will provide biologists with an efficient and understandable classifier model. The reported test results and their biological interpretation demonstrate the applicability, efficiency and effectiveness of the proposed model. Conclusion: From the results, it can be concluded that a considerable increase in classification accuracy can be obtained when the rule-based feature vectors are integrated in the learning process of the SVM algorithm. In the context of applicability, according to the results obtained from gene expression analysis, we can conclude that the CARSVM system can be utilized in a variety of real world applications with some adjustments.
Towards an integrated GIS-based coastal forecast workflow
Authors: Gabrielle Allen, Philip Bogden, Gerry Creager, Chirag Dekate, Carola Jesch, Hartmut Kaiser, Jon McLaren, Will Perrie, Gregory W. Stone, Xiongping Zhang
Venue: Concurrency and Computation: Practice Experience (2008)

The SURA Coastal Ocean Observing and Prediction (SCOOP) program is using geographical information system (GIS) technologies to visualize and integrate distributed data sources from across the United States and Canada. Hydrodynamic models are run at different sites on a developing multi-institutional computational Grid. Some of these predictive simulations of storm surge and wind waves are triggered by tropical and subtropical cyclones in the Atlantic and the Gulf of Mexico. Model predictions and observational data need to be merged and visualized in a geospatial context for a variety of analyses and applications. A data archive at LSU aggregates the model outputs from multiple sources, and a data-driven workflow triggers remotely performed conversion of a subset of model predictions to georeferenced data sets, which are then delivered to a Web Map Service located at Texas A&M University. Other nodes in the distributed system aggregate the observational data. This paper describes the use of GIS within the SCOOP program for the 2005 hurricane season, along with details of the data-driven distributed dataflow and workflow, which results in geospatial products. We also focus on future plans related to the complimentary use of GIS and Grid technologies in the SCOOP program, through which we hope to provide a wider range of tools that can enhance the tools and capabilities of earth science research and hazard planning. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Identification of Speakers from Their Hum
Authors: Hemant A. Patil, Robin Jain, Prakhar Jain
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Automatic Speaker Recognition (ASR)is an economic method of biometrics because of the availability of low cost and powerful processors. An ASR system will be efficient if the proper speaker-specific features are extracted. Most of the state-of-the-art ASR systems use the natural speech signal (either read speech or spontaneous speech) from the subjects. In this paper, an attempt is made to identify speakers from their hum. The experiments are shown for Linear Prediction Coefficients (LPC), Linear Prediction Cepstral Coefficients (LPCC), and Mel Frequency Cepstral Coefficients (MFCC) as input feature vectors to the polynomial classifier of 2 nd order approximation. Results are found to be better for MFCC than LP-based features.
Selection of Efficient Production Management Strategies Using the Multi-agent Approach
Authors: Jarosław Koźlak, Jan Marszałek, Leszek Siwik, Maciej Zygmunt
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

This work focuses on the problem of inventory management which is an important element of the supply-chain management challenge. The goal of our research was to develop an application which supports decision making regarding optimal strategies for producing electrical machines. The multi-agent approach offers several valuable features which may be exploited for supply-chains management: problem decentralization, isolation of different kinds of sub---problems and solving them separately, as well as modeling and predicting the behavior of the particular modules and referring to the means offered by distributed intelligence.
Impact of feature selection in classification for hidden channel detection on the example of audio data hiding
Authors: Christian Kraetzer, Jana Dittmann
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

The classification accuracy achieved in applied classification problems depends strongly on the choice of classifiers and, if a model based approach is chosen, on the quality of the model. In this paper, for a selected classification problem from the area of determination of the existence of hidden channels in audio data, the relevance of single features for model generation in a support vector machine based classification procedure is determined. Here we consider nine audio data hiding algorithms as well as an existing audio steganalysis approach. The goal is to sharpen the model used for classification by algorithm specific generation of the feature set used and thereby reducing its dimensionality while keeping the same degree of classification accuracy for hidden channel detection on audio data. We show that for a multi-genre audio test set the impact of feature space reduction is less severe than for a set containing only speech. The fractions of the feature space considered significant in the performed multi-genre and speech evaluations (best results for the percentage of the available feature space considered significant in the tests performed here: 37.4% and 54.5% respectively) are determined for different thresholds of considering a feature significant in single feature classification. A first evaluation on embedding domain distinction is performed, distinguishing between time- and frequency/wavelet-domain. The results for application specific steganalysis achieved here are compared to the results achieved in current image steganalysis schemes.
Adaptive Vertical Handoff Management Architecture
Authors: Faraz Idris Khan, Eui Nam Huh
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The 4G mobile system is a collection of radio networks providing access to IP based services. It ensures seamless roaming and users are always connected to the best network providing QoS (Quality of Service) to the end user. The mechanism of switching to a different network is termed as vertical handoff. In this paper we propose a vertical handoff management architecture which ensures efficient utilization of a mobile terminal resource i.e. CPU. This is achieved by employing feedback mechanism which allocates CPU resource according to the network load by adapting the CPU scheduler. In the end the simulation results are presented which are in accord with our idea.
Circular-Secure Encryption from Decision Diffie-Hellman
Authors: Dan Boneh, Shai Halevi, Mike Hamburg, Rafail Ostrovsky
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cycle" usage, where we have a cycle of public/secret key-pairs (pk i ,sk i ) for i = 1,...,n, and we encrypt each sk i under ${\rm pk}_{(i \bmod n)+1}$. Such usage scenarios sometimes arise in key-management systems and in the context of anonymous credential systems. Also, security against key cycles plays a role when relating "axiomatic security" of protocols that use encryption to the "computational security" of concrete instantiations of these protocols.The existence of encryption systems that are secure in the presence of key cycles was wide open until now: on the one hand we had no constructions that provably meet this notion of security (except by relying on the random-oracle heuristic); on the other hand we had no examples of secure encryption systems that become demonstrably insecure in the presence of key-cycles of length greater than one.Here we construct an encryption system that is circular-secure against chosen-plaintext attacks under the Decision Diffie-Hellman assumption (without relying on random oracles). Our proof of security holds even if the adversary obtains an encryption clique, that is, encryptions of sk i under pk j for all 1 ≤ i,j ≤ n. We also construct a circular counterexample: a one-way secure encryption scheme that breaks completely if an encryption cycle (of any size) is published.
Efficient Certificate-Based Encryption in the Standard Model
Authors: Joseph K. Liu, Jianying Zhou
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In this paper, we propose a new Certificate-Based Encryption (CBE) scheme which is fully secure in the standard model. We achieve chosen ciphertext (CCA) security directly without any transformation. When compared to all previous generic constructions (in either random oracle or standard model), our scheme is far more efficient than those schemes. When compared to the CBE scheme in [16] (which is the only concrete implementation secure in the standard model), we enjoy a great improvement in terms of space efficiency. Their scheme requires more than 160 group elements for the public parameters in order to gain an acceptable security. Our scheme just requires 5 group elements. In addition, the message space of our scheme is almost double as the one in [16]. A larger message space implies that it requires a smaller number of encryption operations of the same plaintext, resulting in a smaller overall ciphertext and overhead as well.