ppxscal/embedding_network huggingface dataset:
Current Flattening in Software and Hardware for Security Applications
Authors: Radu Muresan, Catherine Gebotys
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

This paper presents a new current flattening technique applicable in software and hardware. This technique is important in embedded cryptosystems since power analysis attacks (that make use of the current variation dependency on data and program) compromise the security of the system. The technique flattens the current internally by exploiting current consumption differences at the instruction level. Code transformations supporting current variation reductions due to program dependencies are presented. Also, a new real-time hardware architecture capable of reducing the current to data and program dependencies is proposed. Measured and simulated current waveforms of cryptographic software are presented in support of these techniques.
A new pattern for flexible worker threads with in-place consumption message queues
Authors: Robert Steinke, Micah Clark, Elihu McMahon
Venue: ACM SIGOPS Operating Systems Review (2005)

We present a new pattern for implementing worker threads that is more flexible than traditional patterns. Traditional worker threads receive command messages with enumerated IDs that refer to pre-defined behaviors. In our new pattern, worker threads receive function pointers, and they have only one behavior: invoke the function. In this way, new behaviors can be passed in to the thread at run-time rather than having to be pre-defined. In addition, we present in-place consumption as an improvement for command message queues that reduces the number of times data needs to be copied.
Noise-tolerant high fan-in dynamic CMOS circuit design
Authors: Walid Elgharbawy, Pradeep Golconda, Magdy Bayoumi
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Scaling CMOS technology to next generation improves performance, increases transistor density, and reduces power consumption per device. However, scaling also increases the subthreshold leakage current which greatly degrades the circuit's noise immunity. In this paper we propose a new circuit technique that makes domino dynamic CMOS more robust and more noise-tolerant with minimal performance degradation and energy overhead. Simulations for high fan-in gates show a noise immunity improvement of 2.13X using Berkeley Predictive Technology Models (BPTM) of 70nm with minimal performance and power degradations over standard domino circuits.
New approach to design for reusability of arithmetic cores in systems-on-chip
Authors: Martin Margala, Hongfan Wang
Venue: Integration, the VLSI Journal (2004)

This paper presents a new approach to design for reusability in System-on-Chip applications. The fundamental principle of the new concept is in merging multiple configurations into a single functional architecture that is then represented by a soft reconfigurable macrocell. Using the example of a multiplier cell, it has been demonstrated that the new soft macro requires up to 88% less additions compared to conventional array architecture. Comparison to previous implementations is also presented. The experimental devices have been implemented in 0.35 µm CMOS technology.
CRL/NMSU and Brandeis MucBruce: MUC-4 test results and analysis
Authors: Jim Cowie, Louise Guthrie, Yorick Wilks, James Pustejovsky
Venue: Proceedings of the 4th conference on Message understanding (1992)

The Computing Research Laboratory (New Mexico State University) and the Computer Science Department (Brandeis University) are collaborating on the development of a system (DIDEROT) to perform data extraction for the Tipster project. This system is still far from fully developed, but as many of the techniques being used are domain ---and in many cases language--- independent, we have assembled them in a preliminary manner to produce a prototype system (MucBruce), which handles the MUC-4 texts.
Correcting errors without leaking partial information
Authors: Yevgeniy Dodis, Adam Smith
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak a significant amount of information about W --- that is, from the adversary's point of view, the entropy of W will drop significantly. Nevertheless, we construct schemes with which Alice and Bob can prevent an adversary from learning any useful information about W. Specifically, if the entropy of W is sufficiently high, then there is no function f(W) which the adversary can learn from the error-correction information with significant probability.This leads to several new results: (a) the design of noise-tolerant "perfectly one-way" hash functions in the sense of Canetti et al. [7], which in turn leads to obfuscation of proximity queries for high entropy secrets W; (b) private fuzzy extractors [11], which allow one to extract uniformly random bits from noisy and nonuniform data W, while also insuring that no sensitive information about W is leaked; and (c) noise tolerance and stateless key re-use in the Bounded Storage Model, resolving the main open problem of Ding [10].The heart of our constructions is the design of strong randomness extractors with the property that the source W can be recovered from the extracted randomness and any string W' which is close to W.
Exploiting temporal locality in drowsy cache policies
Authors: Salvador Petit, Julio Sahuquillo, Jose M. Such, David Kaeli
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Technology projections indicate that static power will become a major concern in future generations of high-performance microprocessors. Caches represent a significant percentage of the overall microprocessor die area. Therefore, recent research has concentrated on the reduction of leakage current dissipated by caches. The variety of techniques to control current leakage can be classified as non-state preserving or state preserving. Non-state preserving techniques power off selected cache lines while state preserving place selected lines into a low-power state. Drowsy caches are a recently proposed state-preserving technique. In order to introduce low performance overhead, drowsy caches must be very selective on which cache lines are moved to a drowsy statePast research on cache organization has focused on how best to exploit the temporal locality present in the data stream. In this paper we propose a novel drowsy cache policy called Reuse Most Recently used On (RMRO), which makes use of reuse information to trade off performance versus energy consumption. Our proposal improves the hit ratio for drowsy lines by about 67%, while reducing the power consumption by about 11.7% (assuming 70nm technology) with respect to previously proposed drowsy cache policies.
A rule-based system for sense-and-respond telematics services
Authors: Jonathan Munson, SangWoo Lee, DaeRyung Lee, David Wood, Gerry Thompson, Alan Cole
Venue: Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services (2005)

We introduce a telematics-oriented event detection service, and programming framework supporting it, that enables application developers to more easily develop applications based on the sense-and-respond model. The system provides a rule-based programming model in which the application is partitioned in two parts: (1) a set of rules that operate on low-level position-update events and which, when triggered, produce high-level, application-defined events; and (2) logic that acts on the high-level events, which is deployed outside the event detection service, and typically within the environment of the enterprise deploying the rule. Programmers represent events of interest in the form of rules, which operate on both input received from the data acquisition systems as well as data resources provided and managed by the application programmers. Programmers declare the inputs the rules require, and the system is responsible for acquiring the inputs. A high-level programming framework assists programmers in defining the set of rules, and the actions that respond to events from the rules, and in deploying the rules to the system.
HAM-ANS (Hamburg application-oriented natural-language system): U. of Hamburg, FRG
Authors: Walther von Hahn, Wolfgang Wahlster, Wolfgang Hoeppner
Venue: Issue 79 (January 1982) (1982)

The aim of this three-and-a-half-year project (7/1/81-12/31/84) is the development of a robust and cooperative system which provides natural language access in German to other software systems, e.g. reservation, data base, and vision systems. The basic core of HAM-ANS is a generalized version of the experimental NL-system HAM-RPM (see below). Broad coverage will mainly be achieved in the analysis grammar, the inference component and the language generation component. Domain-dependent parts are to be identified and implemented in a way that allows the exchange of different application areas while keeping up the core modules. The implementation will be accompanied by optimization efforts, e.g. compilation of LISP and ATN code. Issues of adaptability and portability of the interface will be studied by implementing parts of the system on a LISP machine and in FRANZ LISP on a VAX 11/780.
Worst-case update times for fully-dynamic all-pairs shortest paths
Authors: Mikkel Thorup
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present here the first solution to the fully-dynamic all pairs shortest path problem where every update is faster than a recomputation from scratch in Ω(n3log ⁄n) time. This is for a directed graph with arbitrary non-negative edge weights. An update inserts or deletes a vertex with all incident edges. After each such vertex update, we update a complete distance matrix in Õ(n2.75) time.
Mobile Agent-Based Execution Modelling
Authors: Wenyu Qu, Hong Shen
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Mobile agent-based technology has attracted considerable interest in both academia and industry in recent years. Fault tolerance is of paramount importance to integrate mobile agent-based technology into today's e-society. In this paper, we propose a mobile agent-based fault-tolerant execution model and analyze the stochastic nature of mobile agents, including the transaction time from node to node, the life expectancy of mobile agents, and the population distribution of mobile agents. Our approach exploits a new way to design fault-tolerant mobile agent-driven system. Our analysis provides useful tools for effectively estimating the performance of agent-driven systems.
The explicit factorization of two commonly occuring matrices
Authors: D. Kershaw
Venue: ACM SIGNUM Newsletter (1972)

Tridiagonal and periodic tridiagonal matrices often occur in numerical analysis and frequently in examination questions. Two such matrices are presented here together with their LU factorizations. The constructive proofs of the results are tedious but verification is straightforward. 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
Survey of network weapons part 1: weapons for profiling
Authors: Linda S. Grubb, Luis Cuéllar
Venue: Journal of Computing Sciences in Colleges (2004)

The rise of the Internet has been a boon for Computer Science and the world economy. It has redefined the way technology and information is viewed. But it also has given rise to new types of crimes as well as to new types of criminals. These criminals organize themselves along familiar structures and hierarchies. These organizations share knowledge and develop tools and new weapons, which they use to breach the most sophisticated security mechanisms. This has made Information Security a must for anyone entrusted to safeguard information. Knowledge of the hacker's tools becomes essential for anyone to be able to defend against these criminals. Since interestingly these tools are also used in network management, they are easily found, and often fall into the hands of students and shady persons. Taking a proactive approach by education may counteract this threat, since the best defense is to be well educated and knowledgeable of the risks and threats associated with common network tools.
Wavelet Analysis for Microprocessor Design: Experiences with Wavelet-Based dI/dt Characterization
Authors: Russ Joseph, Zhigang Hu, Margaret Martonosi
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

As microprocessors become increasingly complex, the techniques used to analyze and predict their behavior must become increasingly rigorous. This paper applies wavelet analysis techniques to the problem of dI/dt estimation and control in modern microprocessors. While prior work has considered Bayesian phase analysis, Markov analysis, and other techniques to characterize hardware and software behavior, we know of no prior work using wavelets for characterizing computer systems. The dI/dt problem has been increasingly vexing in recent years, because of aggressive drops in supply voltage and increasingly large relative fluctuations in CPU current dissipation. Because the dI/dt problem has a natural frequency dependence (it is worst in the mid-frequency range of roughly 50-200MHz) it is natural to apply frequency-oriented techniques like wavelets to understand it. Our work proposes (i) an off-line wavelet-based estimation technique that can accurately predict a benchmarkýs likelihood of causing voltage emergencies, and (ii) an on-line wavelet-based control technique that uses key wavelet coefficients to predict and avert impending voltage emergencies. The off-line estimation technique works with roughly 0.94% error. The on-line control technique reduces false positives in dI/dt prediction, allowing voltage control to occur with less than 2.5% performance overhead on the SPEC benchmark suite.
Near Real-Time Reliable Stereo Matching Using Programmable Graphics Hardware
Authors: Minglun Gong, Yee-Hong Yang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

A near-real-time stereo matching technique is presented in this paper, which is based on the reliability-based dynamic programming algorithm we proposed earlier. The new algorithm can generate semi-dense disparity maps using only two dynamic programming passes, while our previous approach requires 20~30 passes. We also implement the algorithm on programmable graphics hardware, which further improves the processing speed. The experiments on the four Middlebury stereo datasets show that the new algorithm can produce dense (>85% of the pixels) and reliable (error rate
Language recognition by two-way deterministic pushdown automata
Authors: L. P. Lisovik, D. A. Koval'
Venue: Cybernetics and Systems Analysis (2005)

It is proved that any bounded context-free language can be recognized by a two-way deterministic automaton with a finite-rotary counter.
A hybrid condensed finite element model with GPU acceleration for interactive 3D soft tissue cutting: Research Articles
Authors: Wen Wu, Pheng Ann Heng
Venue: Computer Animation and Virtual Worlds (2004)

To meet the requirement of computer-aided medical operations, apart from the real-time deformation, it is also necessary in the design to simulate the tissue cutting and suturing in a surgery simulation. In this paper, we present a model on topology change and deformation of soft tissue, referred to as the hybrid condensed finite element model, based on the volumetric finite element method. The most important advantage of our model is its ability to achieve an interactive frame rate for the topology change in surgical simulation on standard PC platform. This is achieved through two innovations. One is to apply the condensation technique, by fully calculating the volumetric deformation in the operation part while only calculating the surface nodes in the non-operation part. Secondly, the major calculation work in the Conjugate Gradient solver for cutting and deformation is migrated from the CPU to the contemporary GPU to promote the calculation. Test examples have been given to show the feasibility and efficiency of the model. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Predicting time series using neural networks with wavelet-based denoising layers
Authors: Uros Lotric, Andrej Dobnikar
Venue: Neural Computing and Applications (2005)

To avoid the need to pre-process noisy data, two special denoising layers based on wavelet multiresolution analysis have been integrated into layered neural networks. A gradient-based learning algorithm has been developed that uses the same cost function to set both the neural network weights and the free parameters of the denoising layers. The denoising layers, when integrated into feedforward and recurrent neural networks, were validated on three time series prediction problems: the logistic map, a rubber hardness time series, and annual average sunspot numbers. Use of the denoising layers improved the prediction accuracy in both cases.
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
Authors: Andreas M. Hinz, Sandi Klavžar, Uroš Milutinović, Daniele Parisse, Ciril Petr
Venue: European Journal of Combinatorics (2005)

It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between any fixed pair of vertices. A formula is given that counts, for a given vertex v, the number of vertices u such that there are two shortest u, v-paths. The formula is expressed in terms of Stern's diatomic sequence b(n) (n ≥ 0) and implies that only for vertices of degree two this number is zero. Plane embeddings of the Tower of Hanoi graphs are also presented that provide an explicit description of b(n) as the number of elements of the sets of vertices of the Tower of Hanoi graphs intersected by certain lines in the plane.
Parallel Queue Processor Architecture Based on Produced Order Computation Model
Authors: Masahiro Sowa, Ben A. Abderazek, Tsutomu Yoshinaga
Venue: The Journal of Supercomputing (2005)

This paper proposes novel produced order parallel queue processor architecture. To store intermediate results, the proposed system uses a first-in-first-out (FIFO) circular queue-registers instead of random access registers. Datum is inserted in the queue-registers in produced order scheme and can be reused. We show that this feature has profound implications in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed.Our performance evaluations show a significant performance improvement (e.g., 10 to 26% decrease in program size and 6 to 46% decrease in execution time over a range of benchmark programs) when compared with the earlier proposed architecture.
New Books
Authors: Keith Price
Venue: Issue 106 (October 1988) (1988)

This book contains the proceedings of the symposium, "Artificial Intelligence Applications in Materials Science." The book contains a collection of 13 papers presented at the symposium. The papers presented show that there is a broad application of AI to the materials science domain. The reader will find that many of the papers deal with descriptions of expert systems that are being developed or proposed for certain tasks, such as failure analysis, manufacturing, alloy design, casting, etc. Issues raised include problems of knowledge representations, knowledge reasoning, scope and how expert systems need to be designed to support the retrieval of information from external sources. 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
Leader election in oriented star graphs
Authors: Wei Shi, A. Bouabdallah, Pradip K. Srimani
Venue: Networks (2005)

Leader election in a network plays an important role in the area of distributed algorithm design. Structural properties of the network as well as presence of direction on the edges of the network greatly affects the complexity of the leader election problem, which is primarily measured by the message complexity of the protocol. Our purpose in the present article is to adapt the existing distributed match making concepts to design a linear time leader election algorithm for star graphs. Star graphs have been extensively studied as an attractive alternative for the well-known hypercubes for network design. Linear election algorithms for oriented hypercubes is known; no such algorithm exists for oriented star graphs. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 169&ndash;179 2005
Building security and trust in online banking
Authors: Maria Nilsson, Anne Adams, Simon Herd
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Growing threats to online banking security (e.g. phishing, personal identify fraud) and the personal nature of the data make the balance between security, trust and usability vital. However, there is little published research about what influences users' perceptions of online banking security and trust. This study identifies that the type of authentication system used can affect users' subsequent perceived control, situational awareness and trust. The results from a questionnaire and in-depth interviews with 86 participants were triangulated to compare two different authentication processes, namely, a 'security box' (i.e. random system generated passwords at the users' location) and 'fixed passwords' (i.e. user owned and constant). The security box and login procedures were perceived significantly more trustworthy and secure at any location than 'fixed passwords'. Four main concepts were identified: "trust" "the authentication system", "location" and "control". The implications of these findings for HCI are discussed.
Designing learning systems to provide accessible services
Authors: Pythagoras Karampiperis, Demetrios Sampson
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

The need for providing learners with web-based learning content that match their accessibility needs and preferences, as well as providing ways to match learning content to user's devices has been identified as an important issue in accessible educational hypermedia literature. Several initiatives already exist trying to provide accessible web-based learning environments addressing a broad range of access needs and requirements. However, the design and development of web-based learning environments for people with special abilities has been addressed so far by the development of hypermedia and multimedia based educational content that is specially designed for the user targeted group, as well as the use of dedicated infrastructure supporting the delivery of learning content. Such approaches not only prevent their user groups (learners and their tutors) from accessing other available resources, but also keep them dependent from the specific e-learning platform, since the supported hypermedia content and learning scenarios are a-priori designed for the targeted user group. In this paper we address the need for an architectural definition of a web-based learning system that satisfies the design steps and requirements identified following the current state-of-the-art accessibility approaches and techniques, as well as the need to define an accessibility application profile for enabling the formalization of learning object accessibility properties, in order to match learning content with learner accessibility preferences.