ppxscal/embedding_network huggingface dataset:
Joint Minimization of Power and Area in Scan Testing by Scan Cell Reordering
Authors: Shalini Ghosh, Sugato Basu, Nur A. Touba
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper describes a echnique for re-ordering ofscan cells to minimize power dissipation that is alsocapable of reducing the area overhead of the circuitcompared to a random ordering of the scan cells. For agiven test set, our proposed greedy algorithm finds the(locally) optimal scan cell ordering for a given value of \lambda,which is a rade-off parameter hat can be used by hedesigner to specify the relative importance of areaoverhead minimization and power minimization. Thestrength of our algorithm lies in the fact that we use anovel dynamic minimum transition fill (MT-fill) techniqueto fill the unspecified bits in the test vector. Experimentsperformed on the ISCAS-89 benchmark suite show areduction in power (70%for s13207, \lambda = 500) as well asa reduction in layout area (6.72%for s13207, \lambda = 500).
Nondeterministic regular expressions as solutions of equational systems
Authors: Rocco De Nicola, Anna Labella
Venue: Theoretical Computer Science (2003)

We define the class of the linear systems whose solution is expressible as a tuple of nondeterministic regular expressions when they are interpreted as trees of actions rather than as sets of sequences. We precisely characterize those systems that have a regular expression as "canonical" solution, and show that any regular expression can be obtained as a canonical solution of a system of the defined class.
Triply coupled vibrations of thin-walled open cross-section beams including shear effect
Authors: A. Arpaci, E. Bozdag, E. Sunbuloglu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Triply coupled vibrations of thin-walled beams with open cross-sections having no axis of symmetry are studied by taking into account the shear effect. The cross-sectional warping is also considered. The governing differential equations of motion are derived and solved by imposing the appropriate boundary conditions. The effect of shear on natural frequencies is shown in figures for various types of cross-sections and boundary conditions. It is seen that this effect is more profound for some shapes of cross-sections especially in bending dominated modes.
SICStus MT - A Multithreaded Execution Environment for SICStus Prolog
Authors: Jesper Eskilson
Venue:  (1998)

The development of intelligent software agents and other complex applications which continuously interact with their environments has been one of the reasons why explicit concurrency has become a necessity in a modern Prolog system today. Such applications need to perform several tasks which may be very different with respect to how they are implemented in Prolog. Performing these tasks simultaneously is very tedious without language support. This paper describes the design, implementation and evaluation of a prototype multithreaded execution environment for SICStus Prolog. The threads are dynamically managed using a small and compact set of Prolog primitives implemented in a portable way, requiring almost no support from the underlying operating system.
Extending Planar Graph Algorithms to $K_{3}$,$_{3}$-free Graphs
Authors: Samir Khuller
Venue:  (1988)

For several problems, restricting attention to special classes of graphs has yielded better algorithms. In particular, restricting to planar graphs yields efficient parallel algorithms for several graph problems. In this paper we extend these algorithms to $K_{3}$,$_{3}$-free graphs, showing that the restriction of planarity is not important. The three problems dealt with are: graph coloring, depth first search and maximal independent sets. As a corollary we show that $K_{3}$,$_{3}$-free graphs are five colorable (this bound is tight). 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
Local correlation energies of two-electron atoms and model systems
Authors: Chien Huang, C. J. Umrigar
Venue:  (1997)

We present nearly-local definitions of the correlation energy density, and its potential and kinetic components, and evaluate them for several two-electron systems. This information should provide valuable guidance in constructing better correlation functionals than those in common use. In addition, we demonstrate that the quantum chemistry and the density functional definitions of the correlation energy rapidly approach one another with increasing atomic number.
Process Division in Haptic Display System
Authors: Shoichi Hasegawa, Masahiro Ishii, Makoto Sato, Yasuharu Koike
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper proposes a novel inter-process communication, between a virtual world manager with slow update rate and a haptic controller with fast update rate, which incorporates the integrated force given from the user to the world. High-speed refresh rate, generally 1kHz, is required to present stiff virtual objects that have spring-damper characteristic with haptic display. On the other hand, the managing of an interactive and rich virtual world that takes a lot of computational time makes the refresh rate as low as 10Hz, which is enough for perceptual cycle. The dividing of the process into two has been proposed to interact with such a world and interprocess communication between the processes has been discussed. Although the methods proposed previously work well on condition that the virtual world is static, goes wrong on dynamic world. The importance of the integrated force on the object motion acquisition is described and an interprocess communication that cares about the integrated force is proposed to remove the influence of the sampling timing. An experimental result shows that the proposed method improve the accuracy of the operation.
Message Logging and Recovery in Wireless CORBA Using Access Bridge
Authors: Xinyu Chen, Michael R. Lyu
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The emerging mobile wireless environment posses exciting challenges for distributed fault tolerant (FT) computing. Thi paper propose a message logging and recovery protocol on the top of Telecom Wireles CORBA and FT-CORBA architectures. It uses the storage available at the access bridge as the table storage to log messages and checkpoints on behalf of a mobile host. Our approach engages both quasi-ender-based and receiver-based logging methods and makes seamless handoff in the presence of failures. The details of how to tolerate mobile host disconnection, mobile host crash and access bridge crash are described. The normalized execution time of a mobile host engaging our proposed scheme and the handoff effect are evaluated.
Optimal Location of High-speed Facility in Heterogeneous Networks
Authors: T. Touyama, A. Takahashi, S. Horiguchi
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

This paper discuss a problem of locating a facility on tree networks. The facility takes the form of a path- or a tree-shaped subgraph on the network. To construct efficient network, we must set the facility to optimal location. In this paper, we propose new evaluation function, all-pair distancesum, which is the sum of distance of all pairs of nodes on the network. Then we show some characteristics of it, which lead to the following relations. In case of continuous tree-shaped version, minimum all-pair distancesum facility is same to minimum distancesum facility. In case of path-shaped or descrete tree-shaped versions, thesefacilities may be different. Furthermore, we show how to locate minimum all-pair distancesum facility.
Boundary layer flow of a second grade fluid with variable heat flux at the wall
Authors: Mehrdad Massoudi
Venue: Applied Mathematics and Computation (2003)

We study the boundary layer (stagnation) flow of a second grade fluid, with a prescribed variable heat flux at the wall. The flow is assumed to be steady and laminar. The governing equations are solved using an iterative central difference approximation method in a non-uniform grid domain. The effects of the non-Newtonian nature of the fluid and the heat flux parameter on the thermal boundary layer are also presented.
Low-field and high-field characterization of THUNDER actuators
Authors: Ounaies Z., Mossi K., Smith R., Bernd J.
Venue:  (2001)

THUNDER (THin UNimorph DrivER) actuators are pre-stressed piezoelectric devices developed at NASA Langley Research Center (LaRC) that exhibit enhanced strain capabilities. As a result, they are of interest in a variety of aerospace applications. Characterization of their performance as a function of electric field, temperature and frequency is needed in order to optimize their operation. Towards that end, a number of THUNDER devices were obtained from FACE International Co. with a stainless steel substrate varying in thickness from 1 mil to 20 mils. The various devices were evaluated to determine low-field and high-field displacement as well as the polarization hysteresis loops. The thermal stability of these drivers was evaluated by two different methods. First, the samples were thermally cycled under electric field by systematically increasing the maximum temperature from 25C to 200C while the displacement was being measured. Second, the samples were isothermally aged at 0C, 50C, 100C, and 150C in air, and the isothermal decay of the displacement was measured at room temperature as a function of time.
Incorporating a priori Knowledge into Initialized Weights for Neural Classifier
Authors: Zhe Chen, Tian-Jin Feng, Zweitze Houkes
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Artificial neural networks (ANN), esp. multilayer perceptrons (MLP) have been widely used in pattern recognition and classification. Nevertheless, how to incorporate a priori knowledge to design ANN is still an open problem. This paper tries to give some insightful discussions on this topic emphasizing weight initialization from three perspectives. Theoretical analyses and simulations are offered for validation.
Multiple Bus Interconnection Schemes
Authors: Gershon Kedem
Venue:  (1986)

In this paper we discuss methods for connecting a large number of communicating processors. We present two families of multiple bus interconnection schemes. Both families of interconnections provide practical means for connecting a large number of processors while keeping down the number of connections, the number of I/O ports and the distance between processors, that is the number of hops that messages have to travel. The interconnection schemes give the designer a wide spectrum of options and tradeoffs to choose from.
Striping Doesn't Scale: How to Achieve Scalability for Continuous Media Servers with Replication
Authors: Cheng-Fu Chou, Leana Golubchik, John C. S. Lui
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Multimedia applications place high demands for QoS, performance, and reliability on storage servers and communication networks. These, often stringent, requirements make design of cost-effective and scalable continuous media (CM) servers difficult. In particular, the choice of data placement techniques can have a significant effect on the scalability of the CM server and its ability to utilize resources efficiently.In the recent past, a great deal of work has focused on ¿wide¿ data striping. Another approach to dealing with load imbalance problems is replication. The appropriate compromise between the degree of striping and the degree of replication is key to the design of scalable CM servers. Thus, the main focus of this paper is a study of scalability characteristics of CM servers as a function of tradeoffs between striping and replication.
Indoor Navigation Using a Diverse Set of Cheap, Wearable Sensors
Authors: Andrew R. Golding, Neal Lesh
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We apply machine-learning techniques to the task of context-awareness, or inferring aspects of the user's state given a stream of inputs from sensors worn by the person. We focus on the task of indoor navigation, and show that by integrating information from accelerometers, magnetometers, temperature and light sensors, we can collect enough information to infer the user's location. However, our navigation algorithm performs very poorly, with almost 50% error, if we use only the raw sensor signals. Instead, we introduce a ``data cooking'' module that computes appropriate high-level features from the raw sensor data. By introducing these high-level features, we are able to reduce the error rate to 2% in our example environment.
Optimization of Neural Network Structure and Learning Parameters Using Genetic Algorithms
Authors: Seung-Soo Han, Gary S. May
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Neural network models of semiconductor manufacturing processes offer advantages in accuracy and generalization over traditional methods. However, model development is complicated by the fact that back-propagation neural networks contain several adjustable parameters whose optimal values are initially unknown. These include learning rate, momentum, training tolerance, and the number of hidden layer neurons. This paper investigates of the use of genetic algorithms (GAs) to determine the optimal neural network parameters for modeling plasma-enhanced chemical vapor deposition (PECVD) of silicon dioxide films. To find an optimal parameter set for the PECVD models, a performance index is defined and used in the GA objective function. This index accounts for both prediction error as well as training error, with a higher emphasis on reducing prediction error. Results of the genetic search are compared with a similar search using the simplex algorithm. The GA search performed approximately 10% better in reducing training error and 66% better in reducing prediction error.
Evolutionary Model of Opinion Formation
Authors: Taisei Kaizoji, Tomoaki Suzudo
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

We discuss the stylized facts, which are observed in the log return of almost all financial markets.We especially consider an interacting agent model of collective opinion formation in a stock market.For this purpose a two-dimensional Ising model has been applied.The evaluation of the model suggested some key points to improve the simulation precision.
Acquisition of Stair Like Structure by Gift
Authors: Masao Kubo
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This approaches a new type of the traditional building block problem, in order to examineit stabilization of an organizational rule and dynamics of an autonomous agent group.Though we act in a group, irrespective of disparity of evaluation that it would be receivedaccording as its role, I am interested in what type of organizational rule and organizationalconfiguration dominates over us.In this paper, grant system as the second evaluationfunction is introduced to promote social world.
How Agents from Different E-Commerce Enterprises Cooperate
Authors: Qiming Chen, Meichun Hsu, Igor Kleyner
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Using agent technology to support E-Commerce automation is a promising direction. However, the previous "proof-of-concept" efforts do not scale well in E-Commerce automation. An essential reason is that the conventional agent infrastructures are primarily designed for intra-enterprise, group-based agent cooperation, but most E-Commerce applications are based on inter-enterprise business partnership. Agents across enterprise boundaries are unlikely to be organized into the same "agent group" and under a centralized coordination. We tackle the issue of scaling inter-enterprise agent cooperation from the following three angles. First, we have introduced the Point of Presence (POP) approach for integrating message-based agent communication with interface-based service invocation. This approach allows us to unify the messaging service interface for all the agents, and therefore greatly simplify both server-side and client-side interface implementation and maintenance. Next, we have developed the agent-embedded cooperative process manager, for elevating multi-agent cooperation from the conversation level to the business process level, and from centralized process management to peer-to-peer cooperative process management. These emerging technologies are integrated with the E-Carry agent infrastructure, an autonomous and decentralized system we developed at HP Labs. The feasibility of this approach have been demonstrated in a prototyping system.
Off-Line Handwritten Arabic Character Segmentation Algorithm: ACSA
Authors: Toufik Sari, Labiba Souici, Mokhtar Sellami
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Character segmentation is a necessary preprocessing step for character recognition in many OCR systems. It is an important step because incorrectly segmented characters are unlikelyto be recognized correctly. The most difficult case in character segmentation is the cursivescript. The scripted nature of Arabic written language poses some high challenges for automatic character segmentat on and recognition. In this paper a new character segmentation algorithm (ACSA) of Arabic scripts is presented. The developed segmentation algorithm yields on the segmentation of isolated handwritten words in perfectly separated characters. It is based on morphological rules which are constructed at the feature extraction phase. Finally ACSA is combined with an existing handwritten Arabic character recognition system (RECAM).
Isolating Cause-Effect Chains with AskIgor
Authors: Andreas Zeller
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

AskIgor is a web service for automatically determining causes of program failures. You submit an executable and two invocations: one where the program fails, and one where it passes. AskIgor compares these two runs and conducts a number of systematic tests to narrow down the set of failure-inducing variable values automatically. This reveals the cause-effect chain of the failure ¿ that is, the variables and values that caused the failure.In a case study, AskIgor successfully isolated the cause-effect chain for a failure of the GNU C compiler: "Initially, the C program to be compiled contained an addition of 1_0 ; this caused an addition operator in the intermediate RTL representation; this caused a cycle in the RTL tree ¿ and this caused the compiler to crash."
A Query Propagation Approach to Improve CORBA Trading Service Scalability
Authors: Zahir Tari, Gregory Craske
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Existing CORBA traders, at least most of them, support the core functions of the OMG specification of the Trading Service [6]. We believe that this is useful and can help potential users to use such a service in heterogeneous environments. However, we also believe that this is not sufficient because such environments deal with dynamic information and often require scalability (e.g. stock market applications). The CORBA Trading Service uses static information recorded in different components of a trading graph, which reduces its capabilities to deal with dynamic environments.This paper proposes solutions to the issue of type management and query routing in the context of CORBA Trading Service to improve the scalability and the quality of the results returned by the core trader functions. We propose a query routing mechanism that uses dynamic information recorded within different traders. Some of this information, such as hit factor, is calculated based on the number of offers a remote trader can address and their relative hops away. At the end of the paper we demonstrate that the proposed approach have lead to better performance for the core CORBA trader functions.
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Authors: K P Agarwal, Alon Efrat, Micha Sharir
Venue:  (1995)

Let ${\cal F}$ be a collection of $n$ bivariate algebraic functions of constant maximum degree. We show that the combinatorial complexity of the vertical decomposition of the ${\le}k$-level of the arrangement ${\cal A}({\cal F})$ is $O(k^{3+\varepsilon}\psi({n/k}))$, for any $\varepsilon<0$, where $\psi (r)$ is the maximum complexity of the lower envelope of a subset of at most $r$ functions of ${\cal F}$. This bound is nearly optimal in the worst case, and implies the existence of shallow cuttings of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including: (i) data structures for several generalized three-dimensional range searching problems; (ii) dynamic data structures for planar nearest and farthest neighbor searching under various fairly general distance functions; (iii) %dynamic data structures for maintaining bichromatic %closest pairs under a fairly general distance function, and for %maintaining minimum spanning trees of a set of points under an improved (near-quadratic) algorithm for minimum-weight bipartite Euclidean matching in the plane; and (iv) efficient algorithms for certain geometric optimization problems in static and dynamic settings.
Steering smog prediction
Authors: Robert Liere, Jarke J. Wijk
Venue:  (1997)

The use of computational steering for smog prediction is described. This application is representative for many underlying issues found in steering high performance applications: high computing times, large data sets, and many different input parameters. After a short description of the smog prediction model, its visualization and steering are described. The amount of computation needed to solve the governing transport equations is alarmingly high. The user has a large number of options for the display of various aspects of the simulation, and also for the interactive control of its input data. Smooth animation is very important to monitor the evolution of pollutants and for a responsive feedback to parameter changes. Here a performance of least 15 frames per second is required. We discuss techniques that allow the user to steer the numerical solver, such that an optimal tradeoff between computation speed and accuracy can be made.
Virtual Teeth for Endodontics Training and Practice
Authors: A. Courtenay, H. I. Graham
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper describes the use of Virtual Environments in endodontics. The problems associated with capturing the virtual environment by defining and manipulating the geometric shapes of teeth are illustrated. Dentists require ways of interacting with the virtual environment, which closely mirror the conditions under which they work. Touch is very important when working in the close confines of the mouth and using instruments within dental cavities. Therefore, the paper reports on experimentation with novel interactive techniques designed to work with the available geometric representations of teeth. These techniques involve combining surface descriptions with force feedback and collision detection, to give the dentist realistic sensations in simulating treatment procedures. Some early experiments with distributed environments are described, with potential for collaboration in mentored training.