ppxscal/embedding_network huggingface dataset:
A reduction technique of large-scale RCG interconnects in the complex frequency domain: Research Articles
Authors: Y. Yamagami, Y. Tanji, A. Hattori, Y. Nishio, A. Ushida
Venue: International Journal of Circuit Theory and Applications (2004)

High-speed digital LSI chips usually consist of many sub-circuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the fault switching operations due to the time-delays, crosstalks, reflections, etc. In order to solve these problems, it is very important to develop a user-friendly simulator for the analysis of LSIs coupled with interconnects. In this paper, we consider a large-scale gate-array circuit coupled with multi-conductor RCG interconnects. At first, we propose a new method for calculating the dominant poles of the impedance matrix, which give the large effects to the transient response. The corresponding residues are estimated by the least squares method. Using these poles and residues, the input&ndash;output relation of each interconnect can be described by the partial fractions. After then, the interconnect is replaced by the equivalent circuit realizing the partial fractions. In this way, we can easily develop a user-friendly simulator familiar with SPICE. We found from many examples that the good results can be obtained using only few dominant poles around the origin. Furthermore, the reduction ratio of our method is very large especially for large scale interconnects. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A description logic-based configurator on the web
Authors: Deborah L. McGuinness, Charles Isbell, Matt Parker, Peter Patel-Schneider, Lori Alperin Resnick, Chris Welty
Venue: ACM SIGART Bulletin (1998)

Description logics have a history of success in configuration applications in major companies including AT&T (mentioned in this paper) and the Ford Motor Company. While we have produced a number of commercial configurators, we find a demonstration application to be the best expository tool for describing how description logics can be leveraged effectively in tasks such as configuration.
Internet game network utilization on college campuses
Authors: Kevin Green
Venue: Journal of Computing Sciences in Colleges (2005)

Internet bandwidth is an expensive and limited resource at many colleges around the country. As a result students may not always have the bandwidth they desire. Students complain about slow web browsing and restrictions on the use of popular network applications like instant messaging, file sharing, and games.
A scalable formal method for design and automatic checking of user interfaces
Authors: Jean Berstel, Stefano Crespi Reghizzi, Gilles Roussel, Pierluigi San Pietro
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

The article addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and actions that constitute dialogs are specified by means of modular, communicating grammars called VEG (Visual Event Grammars), which extend traditional BNF grammars to make them more convenient to model dialogs.A VEG specification is independent of the actual layout of the GUI, but it can easily be integrated with various layout design toolkits. Moreover, a VEG specification may be verified with the model checker SPIN, in order to test consistency and correctness, to detect deadlocks and unreachable states, and also to generate test cases for validation purposes.Efficient code is automatically generated by the VEG toolkit, based on compiler technology. Realistic applications have been specified, verified and implemented, like a Notepad-style editor, a graph construction library and a large real application to medical software. It is also argued that VEG can be used to specify and test voice interfaces and multimodal dialogs. The major contribution of our work is blending together a set of features coming from GUI design, compilers, software engineering and formal verification. Even though we do not claim novelty in each of the techniques adopted for VEG, they have been united into a toolkit supporting all GUI design phases, that is, specification, design, verification and validation, linking to applications and coding.
Parallel machine selection and job scheduling to minimize machine cost and job tardiness
Authors: Dong Cao, Mingyuan Chen, Guohua Wan
Venue: Computers and Operations Research (2005)

This paper discusses the problem of simultaneously selecting and scheduling parallel machines to minimize the sum of machine holding cost and job tardiness cost. A combinatorial optimization model is developed for this purpose. Solving the developed model is NP-hard. A heuristic algorithm is developed to locate the optimal or near optimal solutions based on a Tabu search mechanism specially designed to control the search process in the solution neighborhood for jobs scheduled on specific machines. Numerical examples show that the solutions of the model lead to compromises between the system cost related to machine selection and the operational cost related to job tardiness penalties. The examples also show that the developed algorithm is effective and computationally efficient.
An Intelligent System Approach to Higher-Dimensional Classification of Volume Data
Authors: Fan-Yin Tzeng Eric B. Lum, Kwan-Liu Ma
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

In volume data visualization, the classification step is used to determine voxel visibility and is usually carried out through the interactive editing of a transfer function that defines a mapping between voxel value and color/opacity. This approach is limited by the difficulties in working effectively in the transfer function space beyond two dimensions. We present a new approach to the volume classification problem which couples machine learning and a painting metaphor to allow more sophisticated classification in an intuitive manner. The user works in the volume data space by directly painting on sample slices of the volume and the painted voxels are used in an iterative training process. The trained system can then classify the entire volume. Both classification and rendering can be hardware accelerated, providing immediate visual feedback as painting progresses. Such an intelligent system approach enables the user to perform classification in a much higher dimensional space without explicitly specifying the mapping for every dimension used. Furthermore, the trained system for one data set may be reused to classify other data sets with similar characteristics.
A Framework for HLA-Based Interactive Simulations on the Grid
Authors: Katarzyna Rycerz, Marian Bubak, Maciej Malawski, Peter Sloot
Venue: Simulation (2005)

This article presents the design and feasibility of a system that supports execution of High Level Architecture (HLA)-distributed interactive simulations in an unreliable Grid environment. The article presents an overall architecture of a system based on experience gained from previous designs. The most important operational components of the system are presented, and actual performance issues are discussed. The design of the architecture is based on the Open Grid Services Architecture (OGSA) concept that allows for modularity and compatibility with Grid services already being developed. The issue of migration to the recently proposed Web Services Resource Framework (WSRF) is discussed as well.
Improving Data Accessibility for Mobile Clients through Cooperative Hoarding
Authors: Kwong Yuen Lai, Zahir Tari, Peter Bertok
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

In this paper, we introduce the concept of cooperative hoarding to reduce the risks of cache misses for mobile clients. Cooperative hoarding takes advantage of group mobility behaviour, combined with peer cooperation in ad-hoc mode, to improve hoard performance. Two cooperative hoarding approaches that take into account clientsý access frequencies, connection probabilities and cache size when performing hoarding are proposed. Test results show that the proposed methods significantly improve cache hit ratio and reduce query costs compared to existing approaches.
Synthesis of controllers on the basis of a solution of linear matrix inequalities and a search algorithm for reciprocal matrices
Authors: D. V. Balandin, M. M. Kogan
Venue: Automation and Remote Control (2005)

It is shown how the synthesis of stabilizing, H¿-optimal, and robust controllers of the prescribed order in the output for linear continuous and discrete systems reduces to a solution of linear matrix inequalities relative to two reciprocal matrices. To verify the solvability of such inequalities and to find their solutions, an algorithm realizable in the MATLAB package is proposed. An example of stabilization of an inverted pendulum with the aid of a controller of the reduced order in the output is given.
A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers
Authors: C. Amza, A. L. Cox, W. Zwaenepoel
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong data consistency as perceived by the user, nomodifications to existing dynamic content site tiers and no additional programming effort from the user or site administrator upon deployment. We study strategies for scheduling and load balancing queries on a cluster of replicated database back-ends. We also investigate transparent query caching as a means of enhancing database replication. Our work shows that, on an experimental platform with up to 8 database replicas, the various techniques work in synergy to improve overall scaling for the e-commerce TPCW benchmark. We rank the techniques necessary for high performance in order of impact as follows. Key among the strategies are scheduling strategies, such as conflict-aware scheduling, that minimize consistency maintainance over-heads. The choice of load balancing strategy is less important. Transparent query result caching increases performance significantly at any given cluster size for a mostly-read workload. Its benefits are limited for write-intensive workloads, where content-aware scheduling is the only scaling option.
Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
Authors: Hee-Jun Park, Byung Kook Kim
Venue: Journal of Parallel and Distributed Computing (2005)

We develop an optimal task allocation and scheduling algorithm which minimizes the computing period for multiprocessor systems with general network structures considering task execution time and communication contentions and routing delays explicitly. We presented new ideas of scheduling: (i) individual start allowing overlapping two different iterations, (ii) the scheduling space and the scheduling graph representing feasible schedules, and (iii) the check-and-diffusion algorithm utilizing property of the start-time difference vs. the computing period. With concrete examples of scheduling spaces, segments, and schedules for various multiprocessor network architectures, we showed that individual start reduces the computing period, and our algorithm can find the optimal computing period without exhaustive search.
Correcting real-word spelling errors by restoring lexical cohesion
Authors: Graeme Hirst, Alexander Budanitsky
Venue: Natural Language Engineering (2005)

Spelling errors that happen to result in a real word in the lexicon cannot be detected by a conventional spelling checker. We present a method for detecting and correcting many such errors by identifying tokens that are semantically unrelated to their context and are spelling variations of words that would be related to the context. Relatedness to context is determined by a measure of semantic distance initially proposed by Jiang and Conrath (1997). We tested the method on an artificial corpus of errors; it achieved recall of 23&ndash;50% and precision of 18&ndash;25%.
DNA-based computation
Authors: Kai Chen
Venue: Journal of Computing Sciences in Colleges (2004)

In 1994, Adleman first illustrated in his ground-breaking seminal article how DNA can be used to solve combinatorial problems. Since then, DNA-based Computation has emerged as an interdisciplinary field that has caught attention of researchers from chemistry, molecular biology, mathematics and computer science. 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 FPGA Based Test Bed for Bio Inspired Computation
Authors: Kolin Paul
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

The evolution and maturity of the CMOS process has heralded new devices with ever shrinking device geometries and higher integration densities. This, however, also gives us more challenging problems to overcome to take full advantage of the new effects that manifest themselves in the nanoscale zone. Design paradigms from the biological domain offer an insight into how we can better utilize the millions (and potentially, billions) of transistors in the evolving new fabrics to design and build large systems.
Efficient method for multiple compressed audio streams spatialization
Authors: Abdellatif Benjelloun Touimi, Marc Emerit, Jean-Marie Pernaux
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

This paper deals with the spatialization of multiple compressed audio streams. A new approach is proposed based on the combination of subband-domain filtering methods with linear decomposition methods of HRTFs filters, and more generally the filters used by sound spatialization techniques (binaural, transaural, ambisonic, etc). Such a combination allows both computation complexity reduction and memory size saving for sound spatialization systems of multiple compressed audio signals. These advantages are very useful for any implementation on limited capabilities terminals (computation power and memory size) which is the case of mobile and portable devices.
Learning Spatiotemporal T-Junctions for Occlusion Detection
Authors: Nicholas Apostoloff, Andrew Fitzgibbon
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The goal of motion segmentation and layer extraction can be viewed as the detection and localization of occluding surfaces. A feature that has been shown to be a particularly strong indicator of occlusion, in both computer vision and neuroscience, is the T-junction; however, little progress has been made in T-junction detection. One reason for this is the difficulty in distinguishing false T-junctions (i.e. those not on an occluding edge) and real T-junctions in cluttered images. In addition to this, their photometric profile alone is not enough for reliable detection. This paper overcomes the first problem by searching for T-junctions not in space, but in space-time. This removes many false T-junctions and creates a simpler image structure to explore. The second problem is mitigated by learning the appearance of T-junctions in these spatio-temporal images. An RVM T-junction classifier is learnt from hand-labelled data using SIFT to capture its redundancy. This detector is then demonstrated in a novel occlusion detector that fuses Canny edges and T-junctions in the spatio-temporal domain to detect occluding edges in the spatial domain.
Self-Management: The Solution to Complexity or Just Another Problem?
Authors: Klaus Herrmann, Gero Muhl, Kurt Geihs
Venue: IEEE Distributed Systems Online (2005)

The distributed computing systems widely used in the industry today are too complex for human operators to manually control. This leads to the suboptimal use of resources, recurring failures, and inadequate protection against malicious attacks on system integrity, resulting in a considerable loss of money and a permanent overstrain of operators with all its consequences. According to recent initiatives of market leaders such as IBM, Microsoft, and Sun, the solution to this inherent problem is self-management. They expect that distributed systems will control themselves in the future. The industry hopes for more effective IT management and expects human resources to be freed for other, more important tasks. Here, the authors discuss the current state of the art of self-management and present several open problems whose solution is necessary to make self-management a reality.
SPARKS
Authors: Andrea Chew, Vincent Leclerc, Sajid Sadi, Aaron Tang, Hiroshi Ishii
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper we introduce Sparks, an ambient social networking and communication facilitation interface. We developed the Sparks system as a physical alternative to existing connectedness mediator systems. While several systems are under investigation, they are limited by their confinement to the traditional display. We address this issue, in part, by collocating the visualization and the user within the physical environment of the scenario. We describe the specific aspects of the system that capitalize on both foreground and peripheral attention to facilitate communication throughout a conversation. We discuss our ongoing research where architectural surfaces are used to provide interactive layers of information related to elements present in the space, and conclude with a discussion of the benefits of the system in combining the immediacy of the physical environment with the dynamic data handling characteristics of a digital system.
The EPISTLE project: IBM, Yorktown Heights
Authors: Lance A. Miller, Roy Byrd, George Heidon, Karen Jensen
Venue: Issue 79 (January 1982) (1982)

The experimental EPISTLE system is ultimately intended to provide intelligent applications for the processing of natural language text. Potential applications are of two types: (1) processing of alreadygenerated text, and (2) assisting in the generation of new text.
Approximation of unbounded functions via compactification
Authors: Harry Gingold
Venue: Journal of Approximation Theory (2004)

Approximants to functions f(s) that are allowed to possess infinite limits on their interval of definition, are constructed.To this end a compactification of Rn is developed which is based on the projection of Rn on a bowl-shaped subset of a parabolic surface. This compactification induces a bijection and a metric with several desirable properties that make it a useful tool for rational approximation of unbounded functions.Roughly speaking this compactification enables us to show that unbounded functions can be approximated by rational functions on a closed interval; thus we also obtain an extension to Weierstrass' celebrated theorem. An extension to a Fourier-type theorem is also obtained. Roughly speaking, our result states that unbounded periodic functions can be approximated by quotients of certain trigonometric sums. The characteristics of the main results are the following. The approximations do not require the original approximated function to possess a restricted rate of growth. Neither do they require that the approximated function possess any amount of smoothness. Moreover, the numerator and denominator, in an approximations quotient are guaranteed not to vanish simultaneously. Furthermore, some of the proposed approximations are guaranteed to be bounded at every point at which the original approximated function is bounded. Beside the tool of compactification we also employ Bernstein polynomials and Cesaro means of "trigonometric sums".
Use of non-uniform spatial blur for image comparison: symmetry axis extraction
Authors: Kunihiko Fukushima
Venue: Neural Networks (2005)

This paper shows that the introduction of non-uniform blur is very useful for comparing images, and proposes a neural network model that extracts axes of symmetry from visual patterns. The blurring operation greatly increases robustness against deformations and various kinds of noise, and largely reduces computational cost. Asymmetry between two groups of signals can be detected in a single action by the use of non-uniform blur having a cone-shaped distribution.The proposed model is a hierarchical multi-layered network, which consists of a contrast-extracting layer, edge-extracting layers (simple and complex types), and layers extracting symmetry axes. The model extracts oriented edges from an input image first, and then tries to extract axes of symmetry. The model checks conditions of symmetry, not directly from the oriented edges, but from a blurred version of the response of edge-extracting layer. The input patterns can be complicated line drawings, plane figures or gray-scaled natural images taken by CCD cameras.
Managing And Using Mac Os X Server
Authors: Michael Bartosh
Venue:  (2005)

From the command line to Apple's graphical tools, this book uses a thorough, fundamental approach that leads readers to mastery of every aspect of the server. Full of much-needed insight, clear explanations, troubleshooting tips, and security information in every chapter, the book shows system administrators how to utilize the software's capabilities and features for their individual needs. Some of the topics covered in detail include: InstallationDeploymentServer managementDirectory servicesWeb application servicesSystem interactionData gatheringStress planning This comprehensive guide also takes the time to carefully highlight and analyze the differences between Mac OS X and the other server platforms. Whether you're a seasoned Unix or Windows administrator or a long-time Mac professional, Essential Mac OS X Panther Server Administration provides you with the depth you're seeking to maximize the potential of your Mac OS X Panther Server.
Polygraph: Automatically Generating Signatures for Polymorphic Worms
Authors: James Newsome, Brad Karp, Dawn Song
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

It is widely believed that content-signature-based intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match polymorphic worms. Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages our insight that for a real-world exploit to function properly, multiple invariant substrings must often be present in all variants of a payload; these substrings typically correspond to protocol framing, return addresses, and in some cases, poorly obfuscated code. We contribute a definition of the polymorphic signature generation problem; propose classes of signature suited for matching polymorphic worm payloads; and present algorithms for automatic generation of signatures in these classes. Our evaluation of these algorithms on a range of polymorphic worms demonstrates that Polygraph produces signatures for polymorphic worms that exhibit low false negatives and false positives.
Proceedings of the 4th international symposium on Information and communication technologies
Venue: ACM International Conference Proceeding Series; Vol. 92 (2005)

It gives me great pleasure to welcome you to the Cape Town International Convention Center for the fourth International Symposium on Information and Communication Technologies. The Symposium is organised around three invited workshops comprising in total fifteen papers. In addition, fifty seven stand alone papers were submitted and a total of twenty three (40%) have been selected for presentation and inclusion in these proceedings.