ppxscal/embedding_network huggingface dataset:
Efficient Java thread serialization
Authors: Sara Bouchenak, Daniel Hagimont, Noël De Palma
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The Java system supports the transmission of code via dynamic class loading, and the transmission or storage of data via object serialization. However, Java does not provide any mechanism for the transmission/storage of computation (i.e., thread serialization). Several projects have recently addressed the issue of Java thread serialization, e.g., Sumatra, Wasp, JavaGo, Brakes, Merpati. But none of them has been able to avoid the overhead incurred by thread serialization on thread performance. We propose a Java thread serialization mechanism that does not impose any performance overhead on serialized threads. In this paper, we describe our implementation of thread serialization in Sun Microsystems' JVM, and present the techniques that allowed us to cancel the performance overhead, namely type inference and dynamic de-optimization.
Automatic segmentation and recognition system for handwritten dates on cheques
Authors: C. Y. Suen, Louisa Lam
Venue:  (2003)

This thesis presents the first automatic date processing system developed on a Canadian real-life standard cheque database. This system can process unconstrained handwritten dates written in English or in French, and it can also be applied to the recognition of any handwritten dates with similar format on many other kinds of documents. A knowledge-based module has been proposed for the date segmentation and a new cursive month word recognition system has also been implemented based on a combination of classifiers. The interaction between the segmentation and recognition stages has been properly established by using a multi-hypotheses generation and evaluation module. In addition, a verification module with two levels is designed in the postprocessing stage to correct some errors and reject invalid results, which further improves the reliability of the system. The segmentation of the date zone can be implemented in the knowledge-based segmentation module, the multi-hypotheses generation and evaluation module, or the verification module. An effective neural network ensemble system is proposed in this knowledge extraction stage to differentiate handwritten alphabetic words from numeric strings (A/N). We investigate the use of effective features extensively, and propose several new methods in the design of neural networks, creation of neural network ensembles, and combination methods for the ensembles created. For date recognition, the new cursive month word recognizer is implemented by combining a Hidden Markov Model classifier (HMM) with two Multi-Layer Perceptron (MLP) classifiers. (Abstract shortened by UMI.)
Necessary Optimality Conditions in Multiobjective Dynamic Optimization
Venue: SIAM Journal on Control and Optimization (2003)

We consider a nonsmooth multiobjective optimal control problem related to a general preference. Both differential inclusion and endpoint constraints are involved. Necessary conditions and Hamiltonian necessary conditions expressed in terms of the limiting Fréchet subdifferential are developed. Examples of useful preferences are given.
Structure Search and Stability Enhancement of Bayesian Networks
Authors: Hanchuan Peng, Chris Ding
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Learning Bayesian network structure from large-scale datasets, without any expert-specified ordering of variables, remainsa difficult problem. We propose systematic improvements toautomatically learn Bayesian network structure from data. (1)We propose a linear parent search method to generate candidategraph. (2) We propose a comprehensive approach to eliminatecycles using minimal likelihood loss, a short cycle first heuristic,and a cut-edge repairing. (3) We propose structure perturbationto assess the stability of the network and a stability-improvementmethod to refine the network structure. The algorithms are easyto implement and efficient for large networks. Experimental resultson two data sets show that our new approach outperformsexisting methods.
High-Assurance Synthesis of Security Services from Basic Microservices
Authors: Sung Kim, Farokh B. Bastani, I-Ling Yen, Ing-Ray Chen
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Computer systems are vulnerable to many differenttypes of threats ranging from harmless mistakes in dataentries to malicious attacks by computer hackers.Furthermore,the explosive growth of the Internet has introducedvery sophisticated ways of compromising any computer system.Consequently, a great deal of time and effort hasbeen spent on achieving computer network security.Mostof the efforts to deal with computer security have emphasizedthe networks security aspect (i.e., the focus so far hasbeen on intruders from outside the system).However, therealso exists a significant threat from "enemies within", e.g.,attacks due to malicious code embedded in the software.Whether it is intentional or not, there are many softwarebugs that can potentially be the source of the informationmisusages.One approach for dealing with this issue is tocertify component security and deduce system security fromits components.The advantage of this method is that it ismuch simpler to validate a small component as comparedwith a large monolithic software system.In this paper, wedefine a general process that allows the system security tobe decomposed into orthogonal aspects so that it is possibleto rigorously certify the security of a system.The approachis illustrated for the security service for an e-mail application.
Coupling delay optimization by temporal decorrelation using dual threshold voltage technique
Authors: Ki-Wook Kim, Seong-Ook Jung, Taewhan Kim, Prashant Saxena, C. L. Liu, Sung-Mo Kang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Coupling effect due to line-to-line capacitance is of serious concern in timing analysis of circuits in ultra deep submicrometer CMOS technology. Often coupling delay is heavily dependent on temporal correlation of signal switching in relevant wires. Temporal decorrelation by shifting timing window can alleviate performance degradation induced by fight coupling. This paper presents an algorithm for minimizing circuit delay through timing window modulation in dual Vt technology. Experimental results on the ISCAS85 benchmark circuits indicate that the critical delay will be reduced significantly when low Vt is applied properly.
Randomized protocols for asynchronous consensus
Authors: James Aspnes
Venue: Distributed Computing (2003)

The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on fault-tolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols.
Energy characterization of embedded real-time operating systems
Authors: Andrea Acquaviva, Luca Benini, Bruno Riccó
Venue: Compilers and operating systems for low power (2003)

In this chapter we present a methodology to analyze the energy overhead due to the presence of an embedded operating system in a wearable device. Our objective is to determine the key parameters affecting the energy consumption of the RTOS allowing the development of more efficient OS-based power management policies. To achieve this target, we present a characterization strategy that stimulates the RTOS both at the kernel and at the I/O driver level by analyzing various OS-related parameters. Our analysis focus in particular on the relationship between energy consumption and processor frequency characterizing the different functionalities of an RTOS, suggesting a way to develop effective OS-aware energy optimization policies based on variable voltage and frequency. Experimental results are presented for eCos, an open-source embedded OS ported and installed on a prototype of wearable device, the HP SmartBadgeIV.
Securing media for adaptive streaming
Authors: Chitra Venkatramani, Peter Westerink, Olivier Verscheure, Pascal Frossard
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper describes the ARMS system which enables secure and adaptive rich media streaming to a large-scale, heterogeneous client population. The secure streaming algorithms ensure end-to-end security while the content is adapted and streamed via intermediate, potentially untrusted servers. ARMS streaming is completely standards compliant and to our knowledge is the first such end-to-end MPEG-4-based system.
Test resource partitioning and test data compression for system-on-a-chip
Authors: Krishnendu Chakrabarty
Venue:  (2002)

This thesis first presents a novel test data compression method and decompression architecture based on variable-to-variable-length Golomb codes. Tight upper and lower bounds are presented on the amount of compression achieved with Golomb codes. The analytical results corroborate the extensive experimental data for benchmark and industrial circuits. A more efficient architecture that uses Golomb codes and the internal scan chain(s) of the core under test for test set decompression is then presented. An interleaving decompression architecture that reduces testing time by exploiting the structure of Golomb codes is also presented. Experimental results for ISCAS benchmarks and industrial production circuits show that the proposed schemes provide effective solutions to the problem of test data compression/decompression. Next, a new class of variable-to-variable-length codes, which is referred to as frequency-directed run-length codes (FDR), is described. These codes are specifically tailored for effective test data compression. An analytical characterization of the FDR codes, which provides useful bounds on the amount of data compression, is also presented. These bounds are robust and they show that the efficiency of FDR codes is relatively insensitive to the variations in test data. Experimental results demonstrate that FDR codes outperform Golomb codes for benchmark circuits. The thesis then describes a novel technique to reduce both test data volume and scan power using test data compression. It is shown that Golomb codes reduces both test data volume and power consumption for scan vectors in a SOC. This method leads to significant savings in peak and average power, without requiring either a slower scan clock or blocking logic in the scan cells. Finally, this thesis presents a technique to reduce test data volume, testing time and test power simultaneously. These objectives are achieved through the use of a new variable-to-variable-length code, referred to as the alternating run-length code. The advantage of this TRP technique lies in the fact that it provides a unified solution to three different problems&mdash;test data volume, testing time and test power. (Abstract shortened by UMI.)
Scaling and Charact rizing Database Workloads: Bridging the Gap between Research and Practice
Authors: Richard A. Hankins, Trung Diep, Murali Annavaram, Brian Hirano, Harald Eri, Hubert Nueckel, John P. Shen
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

On-ine Transaction Processing (OLTP) workloads arecrucial benchmarks for the design and analysis of serverprocessors. Typical cached configurations used byresearchers to simulate OLTP workloads are orders ofmagnitude smaller than the fully scaled configurationsused by OEM vendors to achieve world-record transactionprocessing throughput. The objective of this study is todiscover the underlying relationships that characterizeOLTP performance over a wide range of configurations.To this end, we have derived the "iron law" of databaseperformance. Using our iron law, we show that both theaverage instructions executed per transaction (IPX) andthe average cycles per instruction (CPI) are critical to thetransaction-throughput performance. We use an extensive,empirical examination of an Oracle® based commercialOLTP workload on an Intel® XeonTM multiprocessorsystem to characterize the scaling behavior of both theIPX and the CPI. We demonstrate that across a widerange of configurations the IPX and CPI behavior followspredictable trends, which can be accurately characterizedby simple linear or piece-wise linear approximations.Based on our data,we propose a method for selecting aminimal, representative workload configuration fromwhich behaviors of much larger OLTP configurations canbe accurately extrapolated.
Virtual Experiment Environments Design for Science Education
Authors: Young-Suk Shin
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Virtual reality technology is reported that theuse of virtual reality(VR) as an educational toolcan increase student interests, understanding andcreative learning because of encouragingstudents to learn by exploring and interactingwith the information on virtual environments.This paper presents the virtual experiment (VE)environments for science education using virtualreality simulation. We developed the VEenvironments on the Web designed compatible tothe learner levels through level analysis in thelearning contents. The students can select thelearning level in the exploring step of learningcycle model: regular, advanced and remedialcourses according to the degree of theirunderstanding or interest about the learning topic.The VE environments support students to learnscientific phenomena and concepts focusing on:the seismic wave, the earth's crust balance,radiation balance, the movement of ocean, solarsystem and the control of telescope in the sciencefield of middle school. The responses of learningon VE environments have demonstrated that theVE environments can be used as a usefulmethodology in science education for middleschool students.
Evolutionary Algorithms and Theirs Use in the Design of Sequential Logic Circuits
Authors: B. Ali, A. E. A. Almaini, T. Kalganova
Venue: Genetic Programming and Evolvable Machines (2004)

In this paper an approach based on an evolutionary algorithm to design synchronous sequential logic circuits with minimum number of logic gates is suggested. The proposed method consists of four main stages. The first stage is concerned with the use of genetic algorithms (GA) for the state assignment problem to compute optimal binary codes for each symbolic state and construct the state transition table of finite state machine (FSM). The second stage defines the subcircuits required to achieve the desired functionality. The third stage evaluates the subcircuits using extrinsic Evolvable Hardware (EHW). During the fourth stage, the final circuit is assembled. The obtained results compare favourably against those produced by manual methods and other methods based on heuristic techniques.
Gene functional classification by semi-supervised learning from heterogeneous data
Authors: Tao Li, Shenghuo Zhu, Qi Li, Mitsunori Ogihara
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Gene function discovery is an important and interesting problem in computational analysis of microarray data. In this paper, we investigate the use of a semi-supervised learning algorithm for inferring gene functional classifications from heterogeneous data set consisting of DNA microarray expression measurements and phylogenetic profiles from whole-genome sequence compassions. The semisupervised learning approach aims at minimizing the disagreement between individual models built from each separate information source by employing a co-updating method and making use of both labeled and unlabeled data. Our results suggest that the semisupervised approach could be used for gene functional classification. The data sets and the program code used for the experiments can be accessed from our webpage.
Security Aspects of Internet Voting
Authors: Guido Schryen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Voting via the Internet has become a feasible option for political as well as non-political ballots. However, there are many obstacles which have to be overcome, especially legal restrictions have to be transformed into technical and security solutions. The article starts with a briefpresentation of advantages and disadvantages of Internet ballots and presents application fields and pilot schemes. Then, technological security aspects are derived due to democratic basic principles. Especially the applied voting procedures are critical in security terms. Hence, the most relevant cryptographic protocols are presented and their drawbacks and shortcomings are identified. However, this article does not propose a new voting protocol. Beyond fixing cryptographic procedures for ballots, more elements are to be specified, e.g. responsibilities and rights of involved authorities or security precautions regarding hardware and software. For this reason, a structural security framework for electronic voting systems is presented which can be used for their composition and analysis.
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Authors: Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Naturally-occurringinstances of such problems are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean satisfiability (SAT) and 0-1 ILP suggests generic problem-reduction methods, rather than problem-specific heuristics, because (1) heuristics are easily upset by new constraints, (2) heuristics tend to ignore structure, and (3) many relevant problems are provably inapproximable. The NP-spec project offers a language to specify NP-problems and automatic reductions to SAT.Problem reductions often lead to highly symmetric SAT instances, and symmetries are known to slow down SAT solvers. In this work, we compare several avenues for symmetry-breaking, in particular when certain kinds of symmetry are present in all generated instances. Our surprising conclusion is that instance-independent symmetries should often be processed together with instance-specific symmetries rather than earlier, at the specification level.
Perceptual user interfaces using vision-based eye tracking
Authors: Ravikrishna Ruddarraju, Antonio Haro, Kris Nagel, Quan T. Tran, Irfan A. Essa, Gregory Abowd, Elizabeth D. Mynatt
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

We present a multi-camera vision-based eye tracking method to robustly locate and track user's eyes as they interact with an application. We propose enhancements to various vision-based eye-tracking approaches, which include (a) the use of multiple cameras to estimate head pose and increase coverage of the sensors and (b) the use of probabilistic measures incorporating Fisher's linear discriminant to robustly track the eyes under varying lighting conditions in real-time. We present experiments and quantitative results to demonstrate the robustness of our eye tracking in two application prototypes.
Linux in air traffic control
Authors: Tom Brusehaver
Venue: Linux Journal (2004)

Using Linux as a testing platform for mission-critical software. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
One, Two and Three Times log n&#x002F;n for Paths in a Complete Graph with Random Weights
Authors: Svante Janson
Venue: Combinatorics, Probability and Computing (1999)

Consider the minimal weights of paths between two points in a complete graph Kn with random weights on the edges, the weights being, for instance, uniformly distributed. It is shown that, asymptotically, this is log n&#x002F;n for two given points, that the maximum if one point is fixed and the other varies is 2 log n&#x002F;n, and that the maximum over all pairs of points is 3 log n&#x002F;n.Some further related results are given as well, including results on asymptotic distributions and moments, and on the number of edges in the minimal weight paths.
Alternative Implementation Techniques for Web Text Visualization
Authors: Omar Alonso, Ricardo Baeza-Yates
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

We present an approach for building text visualizations that avoids using plug-ins or clients based on languages like Java. Instead we propose to make the search engine application more aware of the visualization process and use the web browser standard features to do the rendering work. We demonstrate the ideas with a text visualization metaphor implementation that is part of a search engine.
Software effort estimation by analogy and "regression toward the mean"
Authors: Magne Jørgensen, Ulf Indahl, Dag Sjøberg
Venue: Journal of Systems and Software (2003)

Estimation by analogy is, simplified, the process of finding one or more projects that are similar to the one to be estimated and then derive the estimate from the values of these projects. If the selected projects have an unusual high or low productivity, then we should adjust the estimates toward productivity values of more average projects. The size of the adjustments depends on the expected accuracy of the estimation model. This paper evaluates one adjustment approach, based on the findings made by Sir Francis Galton in the late 1800s regarding the statistical phenomenon "regression toward the mean" (RTM). We evaluate this approach on several data sets and find indications that it improves the estimation accuracy. Surprisingly, current analogy based effort estimation models do not, as far as we know, include adjustments related to extreme analogues and inaccurate estimation models. An analysis of several industrial software development and maintenance projects indicates that the effort estimates provided by software professionals, i.e., expert estimates, to some extent are RTM-adjusted. A student experiment confirms this finding, but also indicates a rather large variance in how well the need for RTM-adjustments is understood among software developers.
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
Authors: Sushil J. Louis, Gary L. Raines
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic algorithm searches through a space of transition rule parameters of a two dimensional cellular automatamodel to find rule parameters that fit observed mining activity data. Previous work by one of the authors in calibrating the cellular automaton took weeks - the genetic algorithm takes a day and produces rules leading to about the same (or better) fit to observed data. These preliminary results indicate that genetic algorithms are a viable tool in calibrating cellular automata for this application. Experience gained during the calibration of this cellular automatasuggests that mineral resource information is a critical factor in the quality of the results. With automated calibration, further refinements of how the mineral-resource information is provided to the cellular automaton will probably improve our model.