ppxscal/embedding_network huggingface dataset:
Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software
Authors: Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival
Venue: The essence of computation: complexity, analysis, transformation (2002)

We report on a successful preliminary experience in the design and implementation of a special-purpose Abstract Interpretation based static program analyzer for the verification of safety critical embedded real-time software. The analyzer is both precise (zero false alarm in the considered experiment) and efficient (less than one minute of analysis for 10,000 lines of code). Even if it is based on a simple interval analysis, many features have been added to obtain the desired precision: expansion of small arrays, widening with several thresholds, loop unrolling, trace partitioning, relations between loop counters and other variables. The efficiency of the tool mainly comes from a clever representation of abstract environments based on balanced binary search trees.
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes
Authors: Qian-Ping Gu, Shietung Peng
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Set-to-set node-disjoint paths problem is that given two sets S={s 1,...,sk} and T={t1,...,tk} of nodes in a graph, find k node disjoint paths si >tji, where (j1,...,jk) is a permutation of (1,...,k). For general undirect graphs G(V,E), this problem is usually solved by applying flow techniques which take Poly(|V|) time. In this paper, we give an algorithm which, given S={s 1,...,sk} and T={t 1,...,t k}, 1tji of length at most n+log k+2 in O(kn log* k) time. This improves the previous results of n+k and O(kn log k), respectively.
Preprocessing EEG signals for direct human-system interface
Authors: S. Gupta, H. Singh
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

EEG-based direct human-system interfaces attempt to provide a direct brain activated control for quadriplegics and workers in high-workload environments. But significant practical obstacles due to individual differences, subject generated artifacts, noise and interference remain. Eyeblinks and eyeball movements artifacts cause severe interference in EEG recorded by forehead electrodes. This work concentrates on real-time removal of eye-blink and eyeball movement artifacts from the forehead EEG recordings. The proposed approach uses a fixed bandpass FIR filter to remove slow baseline drift. This is followed by a subject specific eyeblink threshold. The results obtained from a real-time implementation on a general-purpose computer are also presented.
Using Dynamic Branch Behavior for Power-Efficient Instruction Fetch
Authors: J. S. Hu, N. Vijaykrishnan, M. J. Irwin, M. Kandemir
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Power consumption has become an increasing concern inhigh performance microprocessor design in terms of packaging and cooling cost. The fetch unit including instructioncache contributes a large portion of the total power consumption in the microprocessor. The instruction cache itself suffers some hidden power consumption due to dynamic control flows. Although capturing the dynamic control flows toboost performance, conventional trace caches (CTC) may increase power consumption in the fetch unit due to its simultaneous access to both the trace cache and the instructioncache. By avoiding this simultaneous accesses, sequentialtrace caches (STC) achieve lower power consumpt on, butsuffer a significant performance loss at the meantime. In thispaper, we propose dynamic direction prediction based tracecache (DPTC), which avoids simultaneous accesses to thetrace cache and the instruct on cache with the guide of fetchdirection prediction. Experimental results show that dynamicprediction based trace cache can achieve 38.5% power reduction over conventional trace caches and an additional7.2% reduction over STC, on average, while only trading a1.8% performance loss compared to CTC.
A new approach to the queue length and waiting time of BMAP/G/1 queues
Authors: Ho Woo Lee, No Ik Park, Jongwoo Jeon
Venue: Computers and Operations Research (2003)

We apply the factorization principle to derive the generating function of the queue length and the vector Laplace-Stieltjes transform of the waiting time of a BMAP/G/1 queue. The mean performance measures are provided with a computational experience.
Beyond Productivity in Software Maintenance: Factors Affecting Lead Time in Servicing Users' Requests
Authors: Taizan Chan
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Research on the economics of software maintenance has concentrated on software maintenance productivity. More often than not, maintenance productivity is measured by the number of hours spent in servicing a maintenance request. While this measure captures the cost of an information systems (IS) department, it ignores a potential opportunity cost to the users that is better captured by the lead-time taken to fulfill a request. Using detailed data of more than 1,000 maintenance projects collected at a field site over a 6-year period, we examine how the lead-time of a request is affected by factors such as the characteristics of the system, the request, and the maintainer responsible for the request. We found that the complexity of a request significantly post-pones its lead-time. The lead-time is also increased by the internal lead-time target set by the IS department based on staff availability. We also divided the lead-time into the queuing time and the service time components and study how they are influenced by the same factors.
Bandwidth Usage Analysis of Service Location Protocol
Authors: Michel Barbeau
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

A resource discovery protocol allows networked embedded processors and handheld devices to discover each other's capabilities. Service Location Protocol (SLP) has been proposed by the IETF for that purpose. The usage of bandwidth or the amount of traffic that such a protocol makes is a characteristic that is particularly relevant when devices are mobile and wireless. Protocols that are less chatty are more desirable because wireless bandwidth is a scarce resource as well as mobile device power. The goal of this work is to characterize the usage of bandwidth SLP makes and to contrast it with the usage of bandwidth that JINI makes, which is another resource discovery protocol. We present equations characterizing the usage of bandwidth made by SLP and JINI.
Dynamic object recomposition for active information system on mobile environment
Authors: Y. Teranishi, F. Tanemo, Y. Umemoto
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Location-dependent information service requires an ability to change both the information and functions provided to the mobile client according to user location and time of access. The paper describes a framework for location dependent information service, called the mobile object model. In the mobile object model, a service consists of objects that contain both information and functions. These objects, called mobile objects, are managed as distributed objects. Mobile objects are recomposed to a composite object according to user status dynamically. This composite object is then executed to realize location-dependent information service. We also propose an architecture based on the model. The architecture reduces the load of network transmission and the amount of CPU power used by the mobile client. Finally, we present a prototype system developed on the WWW called "LODIS".
Validation of Extended Transition Networks Using GEDBLOG
Authors: Stephen Cook, Patrizia Asirelli, Keith Jeffery
Venue:  (1995)

In order to prove properties of information systems, we need a formalism for representing the system, a set of construction rules for the appropriate class of system, and a suitable environment for testing the proof. This paper builds on earlier work on the Extended Transition Network (ETN) formalism and proposes some generic construction rules for information systems specified using ETN. We demonstrate that the GEDBLOG logic database is a suitable tool for expressing these rules and validating ETN models. EMAIL:: asirelli@iei.pi.cnr.it
BVLO - A Language for SIMD Computing
Authors: Russell Tuck
Venue:  (1986)

The Boolean Vector Language Zero (BVLO) is described and analyzed. It is the first version of a language for programming single instruction multiple data (SIMD) machines, and is specially tailored for programming the Boolean Vector Machine (BVM). Its parallel operations include mathematical and logical operations on vectors stored one element per processing element (PE). Control structures are provided for specifying which vector elements are to be operated on. Communication between PEs is by the Cube-Connected Cycles network in the BVM, but other networks with a fixed number of connections per PE could be used in BVLO. A full size BVM will have over a million PEs. Both BVLO and the BVM were designed at Duke University, where they are currently being implemented.
Analysis of orthogonal grillage systems using transfer matrix methods
Authors: E. S. Kameshki
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper the transfer matrix methodology is adopted to the analysis of orthogonal grillage systems. Partitioning the structure along each transverse member where they intersect the longitudinal members generates a nonbranching chain of members. Field and station transfer matrices are derived on the basis of a minimum number of only the essential degrees of freedom per longitudinal spacing. The analyses and the computer code are systematically tested for accuracy and efficiency through comparison of their predictions with ready-made structural analysis and design software STAADIII.
A Simulation for Real Time Data Compression
Authors: Toan L. P. Pham
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper presents one new basic step in real time data compression. The data under compression are random sequence of variable Y which at time t: y0, y1,..., yt have occurred. Y - random integer - {0, 1, N-1}. So, at time t, if we produce YA to be really a subset to Y so that yt+1 in YA then we can write or send the index of yt+1 in YA instead of yt+1 . To do it we create a function F, which learned from some recent past Y by the fixed rules, to map a known set onto Y. The known set is the set known by both sender and receiver, and the function F is automatically created the same at both sides.Based on this scheme we roughly developed and experienced an algorithm for many segments of .com or .exe file (MS DOS File Format) in 80x86 systems to see we have compression ratio 10:7,10:4 in real time. (The segment of pure codes not including data).
How to Do Everything with Your Palm Handheld, 4 edition
Authors: Dave Johnson, Rick Broida
Venue:  (2003)

:Learn to use all Palm OS handheld devices, including the Palm VII handheld, the Handspring Visor, and Qualcomm pdQ smartphone with this friendly, solutions-oriented guide. Book rights: McGraw-Hill, the publisher of this eBook, is granting readers the right to print this book as well as the right to lend/give this eBook to other Adobe Acrobat eBook Plus Reader users.Printing: Users can print eBook pages as needed. This is an especially useful feature for business people. To print, click on the menu button in the Acrobat eBook Reader and select the print option. Lending/Giving We currently have two ways to lend or give a book: you can beam it to a computer if both have infrared ports, or you can send it to a computer on your network. To lend a book to someone else, go to the Library, click a book. Click the Menu button and then click Lend/Give to display the Lend/Give dialog box. Choose a loan period or click Give. To send the book over an infrared connection, click Beam. To send the book to a computer on the network, enter the computer name in the Send To box and click Send. You can either lend the book or give it away. Like a paper book, there is only ever one working copy. Once the lending period expires, you get your rights back and you can re-read the book or lend it again. Of course, if you give it away, it's gone for good (unless the recipient gives it back). Listen to your eBooksUsers have the ability to listen to the spoken text of this book. Simply click the Read Aloud button in the Adobe eBook Reader. A control panel appears at the bottom of the display area where you can pause, continue, or stop the spoken text. Please note:This feature is only available on Windows 2000 machines.
A complete symbolic-numeric linear method for camera pose determination
Authors: Greg Reid, Jianliang Tang, Lihong Zhi
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Camera pose estimation is the problem of determining the position and orientation of an internally calibrated camera from known 3D reference points and their images. We briefly survey several existing methods for pose estimation, then introduce our new complete linear method, which is based on a symbolic-numeric method from the geometric (Jet) theory of partial differential equations. The method is stable and robust. In particular, it can deal with the points near critical configurations. Numerical experiments are given to show the performance of the new method.
A Minimal Infrastructure Shell for Supporting Cooperative Agents in Heterogeneous Distributed Environments
Authors: Craig Linn, Malcolm Cook, Bruce Howarth
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

As the Internet grows in both physical sizes as well as social and economic importance, it also becomes far more complex and difficult to manage the vast amounts of information present. This has over recent years resulted in an effort to utilize agent technologies to support our human activities in this very complex distributed environment. While the architectural aspects of agents and their operations have received extensive coverage in the literature much less has been said about fundamental agent infrastructure issues, in particular those parts of infrastructure which are internal to the agent itself. In this paper, we seek to address this imbalance by focusing on the internal agent infrastructure and delineating what constitutes a minimalist infrastructure shell for the support of basic agent operations in distributed heterogeneous environments. In so doing we examine issues such as locating correspondent agents in networked environments, mechanisms for distributed agent communications (in particular message passing versus RPC or ORBs), and meeting concurrency requirements of inter-agent communications.
Information Highlighting
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper reports on an experiment in which 11 subjects were asked to highlight important passages in an 1111-word text. These results were cross-referenced with a range of word attributes in order to test hypotheses about the principles underlying highlighting decisions. With this data a combination of selection criteria was proposed that was able to predict probability of highlighting with a correlation of approximately 0.56, compared with an average correlation of 0.47 amongst the test subjects, and a figure of 0.30 for Word97's highlighting feature. The paper argues that the common factor behind the most successful hypotheses was that they are all signals denoting "new" as opposed to "given" information at the discourse level. Although based on a very limited sample this observation seems clear enough to make detecting such signals a promising candidate for further research.
A simple proof of Dixon's identity
Authors: Victor J. W. Guo
Venue: Discrete Mathematics (2003)

We present another simple proof of Dixon's identity.
Toward the Interoperable Software Design Models: Quartet of UML, XML, DOM and CORBA
Authors: Junichi Suzuki, Yoshikazu Yamamoto
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Unified Modeling Language (UML) has been widely accepted as an object-oriented analysis/design methodology in the software engineering community, and is in the process of revised standardization at OMG (Object Management Group). One of the current major enhancements is SMIF (Stream-based Model Interchange Format) specification, which aims to interchange UML models in a standard based way. It is expected to be based on XML (eXtensible Markup language) standard and used in various development tools such as CASE tools, automatic documentation tools and repositories.This paper addresses a standard-based UML model interchange and presents our effort to make UML interoperable. We developed a XML-based exchange format called UXF (UML eXchange Format) and a distributed model management system for UML. The system leverages the team development, reuse of design models and tool interoperability by interchanging the model information with XML through the Document Object Model (DOM) interface that is implemented on top of CORBA (Common Object Request Broker Architecture). DOM provides a platform and programming language neutral interface to manipulate the content, structure and style of documents.Our work shows a practical application of some key standards in terms of the software model interchange. It provides multiple levels of interoperability for UML, thereby UML models can be highly interoperable.
Computing Integral Points in Convex Semi-algebraic Sets
Authors: Leonid Khachiyan, Lorant Porkolab
Venue:  (1997)

Let $Y$ be a convex set in $R^k$ defined by polynomial inequalities and equations of degree $d \ge 2$ with integer coefficients of binary length $l$. We show that if $Y \cap Z^k \ne \emptyset$, then $Y$ contains an integral point of binary length $ld^{O(k^4)}$. For fixed $k$, our bound implies a polynomial-time algorithm for computing an integral point $y \in Y$. In particular, we extend Lenstra''s theorem on the polynomial-time solvability of linear integer programming in fixed dimension to semidefinite integer programming.
Group-Based Management of Distributed File Caches
Authors: Ahmed Amer, Darrell D. E. Long, Randal C. Burns
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We describe how to manage distributed file system caches based upon groups of files that are accessed together. We use file access patterns to automatically construct dynamic groupings of files and then manage our cache by fetching groups, rather than single files. We present experimental results, based on trace-driven workloads, demonstrating that grouping improves cache performance. At the file system client, grouping can reduce LRU demand fetches by 50 to 60%. At the server, cache hit rate improvements are much more pronounced, but vary widely (20 to over 1200%) depending upon the capacity of intervening caches. Our treatment includes information theoretic results that justify our approach to file grouping.
Simulating Two Pushdown Stores by One Tape in $O(n^{1.5}\sqrt{logn}$) Time. (Preliminary Version)
Authors: Ming Li
Venue:  (1985)

Based on two graph separator theorems, one old (the Lipton-Tarjan planar separator theorem) and one new, we present two unexpected upper bounds and resolve several open problems for on-line computations: (1) 1 tape nondeterministic machines can simulate 2 pushdown stores in time $O(n^{1.5} \sqrt{logn})$ (true for both on-line and off-line machines). Together with the $\Omega (n^{1.5} \sqrt{logn})$ lower bound by the author [L1], this solved the open problem 1 in [DGPR] for the 1 tape vs. 2 pushdown case. It also disproves the commonly conjectured $\Omega (n^{2})$ lower bound. (Note, the $\Omega (n^{2})$ lower bound has been proved for the deterministic case [M, L, V].) (2) the languages defined by [M] and [F], aimed to obtain optimal lower bound for 1 tape nondeterministic machines, can be accepted in $O(n^{2}loglogn / \sqrt{logn})$ and $O(n^{1.5}\sqrt{logn})$ time by a 1 tape TM, respectively. (3) 3 pushdown stores are better than 2 pushdown stores. This answers open problem 3 of [DG]. (An $\Omega(n^{4/3} / log^{e} n)$ lower bound is also obtained.) (4) 1 tape can nondeterministically simulate 1 queue in $O(n^{1.5} \sqrt{logn})$ time. (The lower bounds were: $\Omega(n^{2})$ for deterministic case [V] and $\Omega(n^{4/3} / logn)$ [L1] for nondeterministic case.) 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
An event mechanism for Linux
Authors: Frederic Rossi
Venue: Linux Journal (2003)

To meet the demands of telecom applications,a plan for a new level of cooperation between applications and thekernel. 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
Backpropagation Algorithm for Logic Oriented Neural Networks
Authors: Takeshi Kamio, Shinichiro Tanaka, Mititada Morisue
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Multilayer feedforward neural network (MFNN) trained by the backpropagation (BP) algorithm is one of the most significant models in artificial neural networks. MFNNs have been used in many areas of signal and image processing due to high applicability. Although they have been implemented as analog, mixed analog-digital and filly digital VLSI circuits, it is still difficult to realize their hardware implementation with BP learning function. This paper describes the BP algorithm for the logic oriented neural network (LOGO-NN), which we have proposed as a sort of MFNN with quantized weights and multilevel threshold neurons. As both weights and neuron outputs are quantized to integer values in LOGO-NNS, it is expected that LOGO-NNS with BP learning can be more effectively implemented than the common MFNNs. Finally; it is shown by simulations that the proposed BP algorithm has good performance for LOGO-NNS.
O (N log log N)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
Authors: Martin Furer, Xin He, Ming Kao, Balaji Raghavachari
Venue:  (1991)

\indent A straight-line grid embedding of a planar graph is a drawing of the graph on a plane where the vertices are located at grid points and the edges are represented by nonintersecting segments of straight lines joining their incident vertices. Given an {\em n}-vertex planar graph with $n \geq 3$, a straight-line embedding on a grid of size $(n - 2) \times (n -2)$ can be computed deterministically in $O (\mbox {log} \, n \, \mbox {log} \, \mbox {log} \, n )$ time with $O (n \, \mbox {log} \, \mbox {log} \, n )$ work on a parallel random access machine. If randomization is used, the complexity is improved to $O (\mbox {log} \, n )$ expected time with the same work bound. The parallel random access machine used by these algorithms allows concurrent reads and concurrent writes of the shared memory; in case of a write conflict, an arbitrary processor succeeds.