ppxscal/embedding_network huggingface dataset:
Equidistance routing in high-speed VLSI layout design
Authors: Yukiko Kubo, Hiroshi Miyashita, Yoji Kajitani, Kazuyuki Tateishi
Venue: Integration, the VLSI Journal (2005)

In VLSI layout design, certain nets in a given net set are required to propagate their signals within a tolerable skew of delays. Though the delay of the signal on a wire is determined by a complex environment, it is hard to satisfy this requirement unless all the concerned nets are routed within a certain skew of length. In this paper, we propose L-equidistance routing, which routes the concerned nets with a prescribed length L. After a basic technique of L-equidistance routing of a single 1-sink net, an algorithm is presented for the channel routing of plural multi-sink nets. The key idea is in the symmetric-slant grid interconnect scheme by which the problem is reduced to a grid routing problem. In L-equidistance routing of a channel, the total length of a n-sink net is not unique for n ≥ 3. An algorithm based on dynamic programming to solve this minimization problem is presented. Then, L-equidistance switch-box routing is discussed based on the L-equidistance channel routing. Algorithms are explained on the Euclidean space. But it is shown that a straightforward transformation of the routes to those on the Manhattan grid is possible keeping the property of equidistance. The proposing channel routing algorithm was implemented and applied to random data to demonstrate their ability.
Transition matrix generation
Authors: Anatoliy Antonov, Yanka Yanakieva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper considers a new approach for regression based construction of transition matrix using market spread curves or historic probabilities of default. The generated transition matrix could be adjusted according to the credit year quality and the systematic component or using an aggregation schema.
Classification of chemical compounds to support complex queries in a pathway database: Conference Papers
Authors: Ulrike Wittig, Andreas Weidemann, Renate Kania, Christian Peiss, Isabel Rojas
Venue: Comparative and Functional Genomics (2004)

Data quality in biological databases has become a topic of great discussion. To provide high quality data and to deal with the vast amount of biochemical data, annotators and curators need to be supported by software that carries out part of their work in an (semi-) automatic manner. The detection of errors and inconsistencies is a part that requires the knowledge of domain experts, thus in most cases it is done manually, making it very expensive and time-consuming. This paper presents two tools to partially support the curation of data on biochemical pathways. The tool enables the automatic classification of chemical compounds based on their respective SMILES strings. Such classification allows the querying and visualization of biochemical reactions at different levels of abstraction, according to the level of detail at which the reaction participants are described. Chemical compounds can be classified in a flexible manner based on different criteria. The support of the process of data curation is provided by facilitating the detection of compounds that are identified as different but that are actually the same. This is also used to identify similar reactions and, in turn, pathways. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Predicting navigation patterns on the mobile-internet using time of the week
Authors: Martin Halvey, Mark T. Keane, Barry Smyth
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A predictive analysis of user navigation in the Internet is presented that exploits time-of-the-week data. Specifically, we investigate time as an environmental factor in making predictions about user navigation. An analysis is carried out of a large sample of user, navigation data (over 3.7 million sessions from 0.5 million users) in a mobile-Internet context to determine whether user surfing patterns vary depending on the time of the week on which they occur. We find that the use of time improves the predictive accuracy of navigation models.
Frequency Hopping Pattern Detection in Wireless Ad Hoc Networks
Authors: Min Song, Scott Wigginton
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Frequency hopping is a technique that wireless devices communicate in a way that the transmission frequencies are alternated in a pre-determined ordered hopping pattern known only to the sending and receiving devices. In this paper, we develop an algorithm called Frequency Hopping Pattern Detection to detect the frequency hopping pattern of a wireless ad hoc network. The algorithm is performed in three stages. Stage 1 locates the first frequency in the pattern; stage 2 detects the remaining frequencies; and stage 3 calculates the entire hopping pattern. All three stages work together and guarantee the capture of all frequencies used, the pattern in which they occur, and the length of transmission for each frequency. The algorithm is simulated in a VHDL environment. Simulation results verify the correctness of the algorithm.
Organizing the Last Line of Defense before Hitting the Memory Wall for CMPs
Authors: Chun Liu, Anand Sivasubramaniam, Mahmut Kandemir
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

The last line of defense in the cache hierarchy before going to off-chip memory is very critical in chip multiprocessors (CMPs) from both the performance and power perspectives. This paper investigates different organizations for this last line of defense (assumed to be L2 in this paper) towards reducing off-chip memory accesses. We evaluate the trade-offs between private L2 and address-interleaved shared L2 designs, noting their individual benefits and drawbacks. The possible imbalance between the L2 demands across the CPUs favors a shared L2 organization, while the interference between these demands can favor a private L2 organization. We propose a new architecture, called Shared Processor-Based Split L2, that captures the benefits of these two organizations, while avoiding many of their drawbacks. Using several applications from the SPEC OMP suite and a commercial benchmark, Specjbb, on a complete system simulator, we demonstrate the benefits of this shared processor-based L2 organization. Our results show as much as 42.50% improvement in IPC over the private organization (with 11.52% on the average), and as much as 42.22% improvement over the shared interleaved organization (with 9.76% on the average).
The evaluation of periodic functions with large input arguments
Authors: J. Y. Wang
Venue: ACM SIGNUM Newsletter (1978)

The argument reduction scheme plays an important role in the evaluation of periodic functions. In this report we discuss the criteria for determining the domain of computer routines that evaluate periodic functions, and apply the results to the widely used sine and cosine functions.
Challenges and design choices in nanoscale CMOS
Authors: Siva G. Narendra
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2005)

The driving force for the semiconductor industry growth has been the elegant scaling nature of CMOS technology. In this article, we will first review the history of technology scaling that follows Moore's law from the prespective of microprocessor designs. Challenges to continue the historical scaling trends will be highlighted and design choices to address two specific challenges, process variation and leakage power, will be discussed. In nanoscale CMOS technology generations, supply and threshold voltages will have to continually scale to sustain performance increase, limit energy consumption, control power dissipation, and maintain reliability. These continual scaling requirements on supply and threshold voltages pose several technology and circuit design challenges. One such challenge is the expected increase in process variation and the resulting increase in design margins. Concept of adaptive circuit schemes to deal with increasing design margins will be explained. Next, with threshold voltage scaling, subthreshold leakage power has become a significant portion of total power in nanoscale CMOS systems. Therefore, it has become imperative to accurately predict and minimize leakage power of such systems, especially with increasing within-die threshold voltage variation. A model that predicts system leakage based on first principles will be presented and circuit techniques to reduce system leakage will be discussed. It is essential to point out that this article does not cover all challenges that nanoscale CMOS systems face. Challenges that are not detailed in the main sections of the article and speculation on what future nanoscale silicon based CMOS systems might resemble are summarized.
Pose-independent simplification of articulated meshes
Authors: Christopher DeCoro, Szymon Rusinkiewicz
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Methods for triangle mesh decimation are common; however, most existing techniques operate only on static geometry. In this paper, we present a view- and pose-independent method for the automatic simplification of skeletally articulated meshes. Such meshes have associated kinematic skeletons that are used to control their deformation, with the position of each vertex influenced by a linear combination of bone transformations. Our method extends the commonly-used quadric error metric by incorporating knowledge of potential poses into a probability function. We minimize the average error of the deforming mesh over all possible configurations, weighted by the probability. This is possible by transforming the quadrics from each configuration into a common coordinate system. Our simplification algorithm runs as a preprocess, and the resulting meshes can be seamlessly integrated into existing systems. We demonstrate the effectiveness of this approach for generating highly-simplified models while preserving necessary detail in deforming regions near joints.
Learning Weights in the Generalized OWA Operators
Authors: Gleb Beliakov
Venue: Fuzzy Optimization and Decision Making (2005)

This paper discusses identification of parameters of generalized ordered weighted averaging (GOWA) operators from empirical data. Similarly to ordinary OWA operators, GOWA are characterized by a vector of weights, as well as the power to which the arguments are raised. We develop optimization techniques which allow one to fit such operators to the observed data. We also generalize these methods for functional defined GOWA and generalized Choquet integral based aggregation operators.
The Effect of Different Failure Recovery Procedures on the Distribution of Task Completion Times
Authors: Robert Sheahan, Lester Lipsky, Pierre Fiorini
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

For a system to be reliable, it must have one or more methods of dealing with failures. Distributed systems face both node failure and communication channel failure. Communication channels, in particular, may suffer failures at a very high rate. Different systems respond to task failure in different ways. The system may resume a failed task from the failure point (or a saved checkpoint shortly before the failure point), it may restart the task, or it may give up on the task and select a replacement task from the ready queue. These three responses to failure all change the distribution of task completion times. The distribution of completion times is important because it governs mean service time and queue length, and therefore quality of service and buffer size necessary to manage the risk of overflow. The changes to the distribution introduced by the failure response can even turn well behaved exponentially distributed times into powertail distributed times with infinite mean and variance. In this paper we examine the characteristics of distributions that result from restarting after each interrupt, with some discussion of Resume and Replace, for comparison. We provide analytic and simulation solutions.
Book review: QuickPascal Programming by Joseph B. Wikert (Que Corporation, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

According to the author, this book is written for both novice and experienced programmers. The book contains no programming exercises, however; it would not lend itself easily to use as a textbook for a class. With the exception of Chapter 1 -- which devotes a total of seventeen pages to the history of programming languages, syntax, programming technique, flowcharts, compilers, interpreters, data storage and format, RAM and ROM -- the book appears to be oriented more towards use as a reference by experienced programmers who want to learn how to use this implementation of Pascal.
Specifying process and measuring progress in terms of information state
Authors: A. J. J. Dick, M. E. C. Hull, K. Jackson
Venue: Journal of Systems and Software (2005)

This paper suggests an approach to specifying process in such a way that progress can be measured in terms of achievement rather than effort expended. The outcome of each process activity is specified in terms of the status of information items and the relationships between them. Pre-requisites to this approach are the presence of an overall information model, and the ability to manage this model and its instantiation in an information repository. A description is given of how the approach has been implemented for a requirements management process using the DOORS requirements management tool. The work was carried out as part of the EC funded Framework project, SUCSEDE.
A New Approach for Predicting the Final Outcome of Evolution Strategy Optimization Under Noise
Authors: Hans-George Beyer, Dirk V. Arnold, Silja Meyer-Nieberg
Venue: Genetic Programming and Evolvable Machines (2005)

Differential-geometric methods are applied to derive steady state conditions for the (¿/¿I,¿)-ES on the general quadratic test function disturbed by fitness noise of constant strength. A new approach for estimating the expected final fitness deviation observed under such conditions is presented. The theoretical results obtained are compared with real ES runs, showing a surprisingly excellent agreement.
Adapting Bayesian statistical spam filters to the server side
Authors: Sara Sinclair
Venue: Journal of Computing Sciences in Colleges (2004)

Bayesian spam filters, which take their name from Bayes' rule for combining conditional probabilities, have become very popular since the publication of Paul Graham's "A Plan for Spam" (http://www.paulgraham.com) in August of 2002. These statistics-based filters use machine learning to gather data about the tokens (words or strings that have been deemed significant) contained in a user's email. They then use this information to analyze the content of a new message to guess the probability that it is spam. Machine learning allows Bayesian filters to adapt to new trends in spam, and also makes them hard for spammers to fool. These features combined with the high accuracy and low false positive rate make them attractive to anyone interested in reducing the amount of spam in their inbox.
Mediating intimacy: designing technologies to support strong-tie relationships
Authors: Frank Vetere, Martin R. Gibbs, Jesper Kjeldskov, Steve Howard, Florian 'Floyd' Mueller, Sonja Pedell, Karen Mecoles, Marcus Bunyan
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Intimacy is a crucial element of domestic life, and many interactive technologies designed for other purposes have been appropriated for use within intimate relationships. However, there is a deficit in current understandings of how technologies are used within intimate relationships, and how to design technologies to support intimate acts. In this paper we report on work that has addressed these deficits. We used cultural probes and contextual interviews and other ethnographically informed techniques to investigate how interactive technologies are used within intimate relationships. From this empirical work we generated a thematic understanding of intimacy and the use of interactional technologies to support intimate acts. We used this understanding to inform the design of intimate technologies. A selection of our design concepts is also presented.
A crisscross checking technique for tamper detection in halftone images
Authors: Jeanne Chen, Tung-Shou Chen, Yu-Mei Pan
Venue: Journal of Systems and Software (2005)

As the race for digital technological advancements accelerates, foremost is the troubling concern for better protection for digital data. Unequivocally, detecting for tamper in data poses a great challenge to information security and image processing. In this paper, a crisscross checking technique is proposed for tamper detection in halftone images. First, a host image is divided into NxN blocks. The individual blocks will be scrambled with a random number into code-strings which will be concatenated into rows and columns code-streams. Finally, these code-streams will be applied to the MD5 and RSA algorithms to generate encrypted signed messages that will be hidden in the blocks. For the detection process, the row and column blocks will be checked for these signed messages which will be extracted, decrypted and compared to the rows and columns blocks of the image for dissimilar bits as sign of tamper. The tampered row and column blocks will be crisscrossed and the intersecting blocks will be identified as tampered areas.
WebGraph: things you thought you could not do with Java&trade;
Authors: Paolo Boldi, Sebastiano Vigna
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Studying web graphs is often difficult due to their large size. The WebGraph framework is a suite of codes, algorithms and tools that make it easy to manipulate large web graphs, and to store them in a limited space, by exploiting the inner redundancies of the web. WebGraph is based on sophisticated bitwise compression techniques, and functional-style lazy constructions. Common wisdom would say that the most unlikely language to implement such a framework is Java. We are going to tell you the real story.
A hydraulically driven multifunctional prosthetic hand
Authors: Stefan Schulz, Christian Pylatiuk, Markus Reischl, Jan Martin, Ralf Mikut, Georg Bretthauer
Venue: Robotica (2005)

In this paper a new prosthetic hand is presented that closely approximates the grasping abilities of a human hand. A large variety of different objects can be grasped reliably and the movements of the hand appear to natural. This five-finger hand has 15 degrees of freedom driven by small sized flexible fluidic actuators. The drives are within the fingers allowing a very compact and lightweight hand. Also, a concept for the control of different grasp types is presented. The characteristics of the new hand are illustrated.
The design and implementation of Zap: a system for migrating computing environments
Authors: Steven Osman, Dinesh Subhraveti, Gong Su, Jason Nieh
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

We have created Zap, a novel system for transparent migration of legacy and networked applications. Zap provides a thin virtualization layer on top of the operating system that introduces pods, which are groups of processes that are provided a consistent, virtualized view of the system. This decouples processes in pods from dependencies to the host operating system and other processes on the system. By integrating Zap virtualization with a checkpoint-restart mechanism, Zap can migrate a pod of processes as a unit among machines running independent operating systems without leaving behind any residual state after migration. We have implemented a Zap prototype in Linux that supports transparent migration of unmodified applications without any kernel modifications. We demonstrate that our Linux Zap prototype can provide general-purpose process migration functionality with low overhead. Our experimental results for migrating pods used for running a standard user's X windows desktop computing environment and for running an Apache web server show that these kinds of pods can be migrated with subsecond checkpoint and restart latencies.
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Authors: Min Cai, Ann Chervenak, Martin Frank
Venue: Proceedings of the 2004 ACM/IEEE conference on Supercomputing (2004)

A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of an RLS implementation in Globus Toolkit Version 3.0. In this paper, we present a Peer-to-Peer Replica Location Service (P-RLS) with properties of self-organization, fault-tolerance and improved scalability. P-RLS uses the Chord algorithm to self-organize PRLS servers and exploits the Chord overlay network to replicate P-RLS mappings adaptively. Our performance measurements demonstrate that update and query latencies increase at a logarithmic rate with the size of the P-RLS network, while the overhead of maintaining the P-RLS network is reasonable. Our simulation results for adaptive replication demonstrate that as the number of replicas per mapping increases, the mappings are more evenly distributed among P-RLS nodes. We introduce a predecessor replication scheme and show it reduces query hotspots of popular mappings by distributing queries among nodes.
Analysis of iSLIP scheduling algorithm for input-queuing switches
Authors: Mitko Gospodinov, Evgeniya Gospodinova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents one of the most up-to-date iSLIP (iterative round robin matching with slip) algorithms for configuration and scheduling input-queuing switch fabrics. The aim of the paper is research the performance of the algorithm regarding cell delay in the queues depending on the load for input-queuing switches with 4, 8, 16 and 32 ports. The advantage of the algorithm is achieving almost 100% throughput as result of de-synchronization of output arbiters playing important role in providing low latency.
Designing a wireless network with directional antennas: frequency division issue: Research Articles
Authors: Yiwen Wu, Joseph Hui
Venue: Wireless Communications Mobile Computing (2004)

We design a mobile ad-hoc network (MANET), where nodes are equipped with several multi-beam adaptive array (MBAA) systems. Such devices provide a great advantage for both space and frequency freedom, and produce a much better network throughput than traditional systems based on single frequency, omnidirectional transmission. A license-free bandwidth up to 7&thinsp;GHz is available centered at 60&thinsp;GHz. The problem to divide this bandwidth into several channels is described as frequency division issue in this paper. We have provided a possible solution for such a problem in our paper, formulated as a (K, M) list-coloring problem of the associated graph. Major results are presented based on two different models for connection requests. In addition, a numerical test is performed to verify the analysis. Copyright &copy; 2004 John Wiley & Sons, Ltd.