ppxscal/embedding_network huggingface dataset:
Efficient harmonic balance simulation using multi-level frequency decomposition
Authors: Peng Li, L. T. Pileggi
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Efficient harmonic balance (HB) simulation provides a useful tool for the design of RF and microwave integrated circuits. For practical circuits that can contain strong nonlinearities, however, HB problems cannot be solved reliably or efficiently using conventional techniques. Various preconditioning techniques have been proposed to facilitate a robust and efficient analysis based on Krylov subspace linear solvers. In This work we introduce a multi-level frequency domain preconditioner based on a hierarchical frequency decomposition approach. At each Newton iteration, we recursively solve a set of smaller problems to provide an effective preconditioner for the large linearized HB problem. Compared to the standard single-level block diagonal preconditioner, our experiments indicate that our approach provides a more robust, memory efficient solution while offering a 2-9/spl times/ speedup for several strongly nonlinear HB problems in our experiments.
Some thoughts on the use of simulation in the health services sector
Authors: Arnold Reisman
Venue: ACM SIGSIM Simulation Digest (1979)

Simulation has been used in a number of modes in conducting studies for the health care industry. This paper briefly presents these usage modes and references each to more extensive write-ups of studies performed by teams which included the author of this article.
Evolution of the Intel's e-Business Data Center toward a Service-Oriented Infrastructure
Authors: Jackson He, Mark Chang, Enrique Castro-Leon
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper brings a historic perspective of the Intel e-Business data center growth from supporting a simple static Web site to a leading e-Business implementation, one of the world's largest and most complex installations of its type. It outlines the challenges facing IT and e- Business operations today and calls out the needs for more advanced platform and service manageability technologies. To cope with these new challenges, the paper introduces the concept of service-oriented infrastructure (SOI), its architecture, key technical components, business benefits, and key steps to of the evolution toward SOI.
Three Dimensional System on Chip Technology, invited
Authors: Earl E. Swartzlander,  Jr.
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

With ever-finer device geometry, increasing device counts and interconnect delays playing a larger role in the performance of a system on a chip, the architectures that are used to support such technologies must take these factors into account. Highly pipelined or highly parallel architectures that utilize local processing, and therefore shorter interconnects, are required. Three-dimensional, monolithic integrated circuit technology which can significantly shorten the interconnects and accommodate more devices per chip may be an attractive solution. The basic idea is presented along with an illustrative application specific processor design.
Improving the Performance of Automatic Sequential Test Generation by Targeting Hard-to-Test Faults
Authors: Loganathan Lingappan, Niraj K. Jha
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Automatic test pattern generation (ATPG) for sequential circuits usually involves search for a sequence of vectors to detect single stuck-at faults. The sequential search space is exponential in the memory elements and primary inputs. Existing sequential test generators are known to spend substantial amounts of run-time in searching for test sequences to detect hard-to-test faults. In this paper, we present a pre-process stage that precedes sequential test generation for each hard-to-test fault and prunes the sequential search space, which in turn reduces the test generation time for these faults. In this stage, the effects of different conditions imposed on the circuit for test generation are propagated as far as possible. This process requires only a single pass through the iterative array model of the given circuit. Using the pre-process stage along with a Boolean satisfiability (SAT) based sequential test generator, we show that the proposed approach is on an average 11.3X (maximum 25.2X) faster than an efficient gate-level sequential test generator for hard-to-test faults in ISCAS'89 benchmark circuits. The proposed pre-process stage is also applicable to sequential test generation at the register-transfer level (RTL) and improves the overall performance of an efficient sequential test generator at the RTL by 3.5X on average and a maximum of 4.6X for all faults.
Using evolutionary algorithms and dynamic programming to solve uncertain multi-criteria optimization problems with application to lifetime management for military platforms
Authors: Claire J. Thie, Darren M. Chitty, Colin M. Reed
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Microelectronics are typically critical components in a military platform, some of which may become obsolete, before the equipment life cycle end. Obsolete components may be required for a number of reasons. Components can become obsolete even before production of a platform commences. The selection of solutions for resolving obsolete components throughout a platform can be considered as a multi-criteria optimization problem where the aim is to select the most cost effective solutions for resolving a portfolio of obsolescence arisings. In this paper we consider the case where the criteria with which the options are evaluated are not point values, but probability distributions generated by a Bayesian Belief Network. We propose the use of an evaluation technique called measures of effectiveness (MOE), that can capture and use the probabilistic information associated with potential solutions. This is used with two candidate optimization techniques, Dynamic Programming (DP) and Evolutionary Algorithms (EAs), to identify cost effective solutions for resolving obsolescent components throughout a platform. Both optimization techniques were able to identify a number of solutions at different cost and MOE levels; the solutions that form the DP Pareto front dominate very slightly in places those that form the EA Pareto front.
Designing Scalable Routers with a New Switching Architecture
Authors: Zuhui Yue, Youjian Zhao, Jianping Wu, Xiaoping Zhang
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Today most routers consist of line cards and centralized switching fabrics. It is now more and more difficult to increase the speed of line cards. Each generation of routers consume more power, and it gets more difficult to package a router in one rack of equipment. The research on routers shifts from singlerack systems to multi-rack ones. Most switches in routers today reside out of line cards. As the number of line cards increases, they will meet scalability problems. The Cellular Router (CR) architecture introduced in this paper is a new switching architecture. This architecture can be used in scalable routers and shows excellent properties. We give a detailed discussion of the CR architecture and show the implementation of the basic CR architecture. There exist some problems in the basic CR architecture. We solve them by introducing Mirror Points (MPs). We also introduce two minimal routing algorithms.
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
Authors: Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Yu, Kevin Drummey
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tree methods have been reported to be significantly more accurate than widely-accepted single decision trees, although the training procedure of some methods incorporates a surprisingly random factor and therefore opposes the generally accepted idea of employing gain functions to choose optimum features at each node and compute a single tree that fits the data. One important question that is not well understood yet is the reason behind the high accuracy. We provide an insight based on posterior probability estimations. We first establish the relationship between effective posterior probability estimation and effective loss reduction. We argue that randomized decision tree methods effectively approximate the true probability distribution using the decision tree hypothesis space. We conduct experiments using both synthetic and real-world datasets under both 0-1 and cost-sensitive loss functions.
DOMProxy: Enabling Dynamic-Content Front-end Web Caching
Authors: Manolis Veliskakis, John Roussos, Panos Georgantas, Timos Sellis
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Proxy caching is a commonly accepted methodology used to reduce Internet traffic, decrease back-end related user delays, and generally improve web performance. Nevertheless, it seems to be inadequate when it comes to caching dynamic web pages, due to their low degree of reusability and strong dependency on the back-end site infrastructure. In order to overcome these drawbacks we present DOMProxy (Dynamic Objects Manager Proxy), a new Proxy architecture that enables front-end web caching for dynamically generated web pages. Instead of caching web pages produced dynamically or their fragments, the proposed architecture provides methods for "caching" their generation process. This is achieved by caching both the applications and the back-end data content that are used to create dynamic web pages. We discuss the new challenges and issues raised by this approach, with special emphasis on the caching and manipulation of different types of web objects at a front-end caching point.
A Platform for Distributed Analysis of Neuroimaging Data on Global Grids
Authors: Scott Kolbe, Tianchi Ma, Wei Liu, Wee Siong Soh, Rajkumar Buyya, Gary Egan
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This paper presents a Grid environment developed for analysis of MRI brain data on global Grids. In the current experiment, the MRI data analysis tasks are composed and formulated as a parameter sweep application. This application was deployed using the Gridbus Resource broker. The clusters in our Grid environment were managed using PBS and SGE. To execute tasks on remote resources, the Gridbus broker used SSH services for some resources and Globus middleware services for others for initiating execution and management. In this experiment, 16 x 8.1MB images and 28 x 16.3MB images were processed using a volumetric analysis method. The total waiting time was 1800s and the total processing time was 1279.30s. The broker overhead was 521s. Completing this analysis on a single machine could take over twenty hours. This Grid architecture provides a useful time-saving analysis tool for neuroimaging applications.
Immersive Mixed-Reality Configuration of Hybrid User Interfaces
Authors: Christian Sandor, Alex Olwal, Blaine Bell, Steven Feiner
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Information in hybrid user interfaces can be spread over a variety of different, but complementary, displays, with which users interact through a potentially equally varied range of interaction devices. Since the exact configuration of these displays and devices may not be known in advance, it is desirable for users to be able to reconfigure at runtime the data fIow between interaction devices and objects on the displays. To make this possible, we present the design and implementation of a prototype mixed reality system that allows users to immersively reconfigure a running hybrid user interface.
Approximation of Solutions of Riccati Equations
Authors: Pavel Bubák, Cornelis V. M. van, der Mee, André C. M. Ran
Venue: SIAM Journal on Control and Optimization (2005)

This paper deals with two interrelated issues. One is an invariant subspace approach to finding solutions for the algebraic Riccati equation for a class of infinite dimensional systems. The second is approximation of the solution of the algebraic Riccati equation by finite dimensional approximants. The theory of exponentially dichotomous operators and bisemigroups is instrumental in our approach.
Interface Abstraction for Compositional Verificatio
Authors: Dilian Gurov, Marieke Huisman
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

To support dynamic loading of applications on portable devices, one needs compositional reasoning techniques to ensure that newly loaded applications cannot break the overall security of a device. In earlier work, we developed an algorithmic verification technique for control flow based safety properties of smart card applications, which allows global system properties to be inferred from the properties of the components. Application of the technique requires knowledge of the names of all methods implemented by these components. In a truly compositional setting, however, one only knows the public interface of the new applet and does not have access to any implementation details. To compositionally verify interface properties of applets, one therefore has to combine our verification technique with an abstraction which preserves the interface behaviour and reduces the set of implemented methods to the set of public methods. In this paper, we develop such an abstraction technique: we formally define the notion of interface behaviour, and propose an inlining transformation which we prove to preserve the interface properties expressible in our specifi- cation language. In addition, we show on a concrete case study how the reduction in the number of methods resulting from the interface abstraction drastically improves the performance of the computationally most expensive step of the compositional verification technique.
Adaptable representation in GP
Authors: Cezary Z Janikow
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. The sufficiency principle requires that the set be sufficient to label the desired solution trees, often forcing the user to enlarge the set, thus also enlarging the search space. Structure-preserving crossover, STGP, CGP, and CFG-based GP give the user the power to reduce the space by specifying rules for valid tree construction, based on types, syntax, and heuristics. These rules in effect change the representation. However, in general the user may not be aware of the best representation, including heuristics, to solve a particular problem. Last year, ACGP methodology was introduced for extracting local problem-specific heuristics, that is for learning a local model of the problem domain. ACGP discovers representation, in the space of probabilistic representations, one that improves the search itself and that provides the user with heuristics about the domain. This paper discusses and illustrates the probabilistic representation.
Application of Fuzzy Sets in Evaluation of Failure Likelihood
Authors: Lech Bukowski, Jerzy Feliks
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Estimation of failure likelihood for technical objects is a very difficult process because the information about the process is often uncertain and imprecise. Assessment of risk related in catastrophic damages is very difficult, particularly in systems where damage causes threat of human life or serious economic losses. Methods like FMEA and FMECA applied to evaluation of risk of designed systems do not give the full information about meaning of results of possible failure. Therefore the risk evaluation method, when risk is a product of failure likelihood and degree of failure, was proposed.
Intrusion Detection based on Clustering a Data Stream
Authors: Sang-Hyun Oh, Jin-Suk Kang, Yung-Cheol Byun, Gyung-Leen Park, Sang-Yong Byun
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In anomaly intrusion detection, how to model the normal behavior of activities performed by a user is an important issue. To extract the normal behavior as a profile, conventional data mining techniques are widely applied to a finite audit data set. However, these approaches can only model the static behavior of a user in the audit data set. This drawback can be overcome by viewing the continuous activities of a user as an audit data stream. This paper proposes a new clustering algorithm which continuously models a data stream. A set of features is used to represent the characteristics of an activity. For each feature, the clusters of feature values corresponding to activities observed so far in an audit data stream are identified by the proposed clustering algorithm for data streams. As a result, without maintaining any historical activity of a user physically, new activities of the user can be continuously reflected to the on-going result of clustering.
An improved algorithm for loop dead optimization
Authors: Chandan Kumar Behera, Pawan Kumar
Venue: ACM SIGPLAN Notices (2005)

Loop dead variables are the variables, which are defined in a loop, but not used in that loop. On successive execution of loop, these get different value, however all values (except last value) are not used. Hence in optimized program, the definition of a loop dead variable can be moved outside the loop (after the loop), rather than computing every time, inside the loop. In our discussion, we have assumed only simple loop. Every loop has one entry and one exit point.
A Class Abstraction Technique to Support the Analysis of Java Programs During Testing
Authors: David Crowther, Djuradj Babich, Peter J. Clarke
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In this paper, we describe a class abstraction technique (CAT) for Java programs that support the testing process by capturing aspects of software complexity based on the combination of class characteristics. These class characteristics relate to properties of the class features such as concurrency, polymorphism, exception handling, and accessibility as well as relationships between classes. Our taxonomy (CAT) for Java allows us to generate a finite number of possible class groups (taxa). Each class C in a Java program is cataloged into a group that summarizes the dependencies with other types realized through declarations and definitions in C . We also provide a high-level design for a tool to catalog Java classes based on our taxonomy.
Specification of operations for a manipulator on a mobile robot using grafcet
Authors: M. A. Martínez, J. L. Martínez
Venue: Robotica (2005)

This technical note deals with the way of organizing the work of a manipulator on a mobile robot. Every robotic mission is composed of several navigation and manipulation operations. In this research, the robot arm actions have been sequenced, once the mobile robot has stopped, with the help of the graphical specification tool Grafcet. The proposed method has been successfully implemented in the mobile manipulator RAM-2 for transporting videotapes.
Utility-based On-demand Heuristic Strategy to Grid Computing
Authors: Li Liu, Yuanzhuo Wang, Yang Yang, Songtao Liu
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Grids aim at exploiting synergies that result from cooperation of autonomous distributed entities. For this cooperation to be sustainable, participants need to have economic incentive. Within service-oriented Grids, resources may be advertised and traded as services, and QoS requirement is the most important attribute. In this paper, we build on two intellectual threads: market-based approaches and the economic theory of utility to resource allocation. We consider the problem of task scheduling subject to time and budget constrains as QoS-aware joint utility function, and scheduling object is to maximize total attained utility. This scheduling problem can be shown to be NP-hard, thus we present a utility-driven heuristic scheduling algorithm (UDS) for this problem. We study the performance of UDS algorithm through a Stochastic Petri Net (SPN) model. In the end, the performance of model is analyzed by SPNP software package. The numerical results show that UDS can guarantee QoS for users.
Mining Patterns of Change in Remote Sensing Image Databases
Authors: Marcelino Pereira S. Silva, Gilberto Camara, Ricardo Cartaxo M. Souza, Dalton M. Valeriano, Maria Isabel S. Escada
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Remote sensing image databases are the fastest growing archives of spatial information. However, we still have a limited capacity for extracting information from large remote sensing image databases. There are currently very few techniques for image data mining and information extraction in large image data sets, and thus we are failing to exploit our large remote sensing data archives. This paper proposes a methodology to provide guidance for mining remote sensing image databases. The basic idea is to use domain concepts to build generic description of patterns in remote sensing images, and then use structural approaches to identify such patterns in images. We illustrate our proposal with a case study for detecting land use patterns in Amazonia from INPE's remote sensing image database.
Multibody Grouping by Inference of Multiple Subspaces from High-Dimensional Data Using Oriented-Frames
Authors: Zhimin Fan, Jie Zhou, Ying Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Recently, subspace constraints have been widely exploited in many computer vision problems such as multibody grouping. Under linear projection models, feature points associated with multiple bodies reside in multiple subspaces. Most existing factorization-based algorithms can segment objects undergoing independent motions. However, intersections among the correlated motion subspaces will lead most previous factorization-based algorithms to erroneous segmentation. To overcome this limitation, in this paper, we formulate the problem of multibody grouping as inference of multiple subspaces from a high-dimensional data space. A novel and robust algorithm is proposed to capture the configuration of the multiple subspace structure and to find the segmentation of objects by clustering the feature points into these inferred subspaces, no matter whether they are independent or correlated. In the proposed method, an Oriented-Frame (OF), which is a multidimensional coordinate frame, is associated with each data point indicating the point's preferred subspace configuration. Based on the similarity between the subspaces, novel mechanisms of subspace evolution and voting are developed. By filtering the outliers due to their structural incompatibility, the subspace configurations will emerge. Compared with most existing factorization-based algorithms that cannot correctly segment correlated motions, such as motions of articulated objects, the proposed method has a robust performance in both independent and correlated motion segmentation. A number of controlled and real experiments show the effectiveness of the proposed method. However, the current approach does not deal with transparent motions and motion subspaces of different dimensions.