ppxscal/embedding_network huggingface dataset:
Guest Editor's Introduction: Unorthodox Computer Architectures
Authors: Karl E. Grosspietsch
Venue: IEEE Micro (2002)

Progress in hardware integration technology for full- and semicustom implementations enables cost-efficient, innovative computing architectures that could provide alternatives or add-ons to the current von Neumann architecture. Radical, alternative architectures not in compliance with this classical imperative approach--for example, those that support functional programming--have not succeeded in replacing the von Neumann architecture. But several basic approaches--especially an inherent exploitation of the parallelizibility of certain problems--continue to imply modifications of the imperative style. Although unorthodox, these architectures nevertheless constitute well-fitting add-ons to a basic von Neumann architecture. Such approaches includemassively parallel processing,instruction-level parallelism,dataflow machines,associative architectures,neural networks, and biologically inspired architectures.
The Interspace: Concept Navigation Across Distributed Communities
Authors: Bruce R. Schatz
Venue: Computer (2002)

With the Interspace, the global information infrastructure will, for the first time, directly support interaction with abstraction. This infrastructure uses technologies that go beyond searching individual repositories to analyze and correlate knowledge across multiple sources and subjects. The Interspace will offer distributed services to transfer concepts across domains, just as Arpanet used distributed services to transfer files across machines and the Internet uses distributed services to transfer objects across repositories. Standard protocols for the emerging information infrastructure will support searching knowledge collections maintained and indexed by specialized communities and residing directly on users' personal machines. These protocols will automatically interconnect related logical spaces, letting individuals navigate across community repositories rather than searching for interlinked objects within physical networks. The Community Architectures for Network Information Systems Laboratory has developed a working Interspace prototype that uses scalable technologies for concept extraction and navigation. They have successfully tested these technologies, which compute contextual frequency of document phrases within community repository, on discipline-scale, real-world collections. Within the next decade, semantic indexing will extend beyond concepts and categories to perspectives, which relate concepts within categories, and situations, which relate categories within collections. These more abstract semantic levels will lead to a closer matching of the meanings in the user's mind to the world's objects.
An Algebra for Probabilistic Databases
Authors: M. Pittarelli
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

An algebra is presented for a simple probabilistic data model that may be regarded as an extension of the standard relational model. The probabilistic algebra is developed in such a way that (restricted to /spl alpha/-acyclic database schemes) the relational algebra is a homomorphic image of it. Strictly probabilistic results are emphasized. Variations on the basic probabilistic data model are discussed. The algebra is used to explicate a commonly used statistical smoothing procedure and is shown to be potentially very useful for decision support with uncertain information.
Internationalization Support in Java
Authors: Vartan Piroumian
Venue: IEEE Micro (1997)

Computers throughout the world use different standards for representing and displaying text; people use vastly different languages and data representation standards, and they have diverse cultural conventions. How do we build software to overcome these differences? It should enable people all over the world to communicate unhindered by the compatibility problems of hundreds of human languages, national standards, and mechanisms for representing data. As modern communications technologies make the world smaller every day, the need for globally sensitive, or internationalized, software is more critical than ever. The most recent release of the Java Development Kit lets developers create software that adapts to the local language and conventions wherever it is deployed.
Test Research in Japan
Authors: Hideo Fujiwara, Yuzo Takamatsu, Takashi Nanya, Teruhiko Yamada, Hideo Tamamoto, Kiyoshi Furuya
Venue: IEEE Design Test (1988)

Surveys recent research activities in test technology for computers, focusing on the results of university researchers. They cover test-pattern generation, fault simulation, design for testability, built-in self-test, and self-checking.
TiAl3 formation kinetic in sputtered Ti/AlCu0.5% thin films
Authors: C. Bresolin, S. Pirotta
Venue: Microelectronic Engineering (2002)

Sputtered aluminum on titanium double layers are widely used in conventional interconnection schemes of integrated circuits (IC); one known phenomenon is the formation of intermetallic compounds. In this work, the kinetic of the TiAl3 reaction is studied by collecting the sheet resistance increase of 400 nm AlCu0.5% on 10 nm titanium sputtered samples, in situ annealed at three different temperatures (450, 480 and 500 °C). The observed resistance drift is correlated to the expected aluminum consumption and the TEM observed TiAl3 grain morphology; by adopting an exponential fit of observed resistance curves, the activation energy of the TiAl3 formation is found out to be 1.75±0.25 eV.
Model-Based Fault-tolerant Control Reconfiguration for General Network Topologies
Authors: Gregory Provan, Yi-Liang Chen
Venue: IEEE Micro (2001)

This article describes a fault-tolerant approach to systems with arbitrary network topologies that uses a model-based diagnosis and control reconfiguration mechanism. The authors illustrate this technique using a wireless sensor network as an example.
Concurrent Error Detection Using Monitoring Machines
Authors: Rubin A. Parekhji, G. Venkatesh, Sunil D. Sherlekar
Venue: IEEE Design Test (1995)

In circuits implementing system level functions, the correctness of the overall operation is critically dependent on the correctness of the control part. Therefore, concurrent error detection techniques for controllers implemented in integrated circuits have previously received wide attention. This paper presents a new technique for concurrent error detection in finite state machine (FSM) controllers. It is based on the use of monitoring machines. In a monitored FSM controller, an auxiliary monitoring machine operates in lock-step with the main FSM, such that any fault in either of the two machines is immediately detected. It is shown how the monitoring machine provides a uniform mechanism for the detection of stuck-at faults as well as delay faults. Besides being less costly than the main machine, it is also not identical to it. These features yield designs which compare very favourably with previous implementations. Not only is the fault coverage higher, also the hardware cost of the monitored sequential circuit is significantly lower.
The Big Basics Book of PC's, 2nd edition
Authors: Lisa A. Bucki, Nadeem Muhammed, Jennifer Fulton, Rick Brown
Venue:  (1997)

:Illustrated lessons break complex tasks into simple steps. Pictures show you how your screen should look at each step. Text explains the details in non-technical terms you can understand. Helpful examples and useful "projects" let you put your personal computer to work right away. Just follow the numbered steps for instant results. Learn how to set up and customize your personal computer so you can quickly be productive with Windows 95, the Internet, and many other applications. 101 fast answers solve your personal computer problems. A Quick Finder Table helps you locate your problem and its solution in no time.
Finite element simulation of shaped charges
Authors: J. F. Molinari
Venue: Finite Elements in Analysis and Design (2002)

This paper analyzes by numerical simulation the formation, the fragmentation, and the penetration in a plate of a copper jet that develops in a shaped charge. A finite element Lagrangian code has been used to gain insight into this problem. The study is conducted in two dimensions, axisymmetric. An explicit contact/friction algorithm is used to treat multi-body dynamics. A remeshing algorithm is needed to follow the high deformation pattern of the copper jet. The calculations account for rate-dependent plasticity, heat conduction and thermal coupling. A criterion is introduced to model the jet break-up. The simulations reveal in particular a gradient of shear deformation across the jet.
Artificial Consciousness: Utopia or Real Possibility?
Authors: Giorgio Buttazzo
Venue: Computer (2001)

Given the current pace of advances in artificial intelligence and neural computing, the possibility of building smart machines that could compete with human intelligence now seems more likely than ever. Many researchers believe that artificial consciousness is possible and that, in the future, it will emerge in complex computing machines. The strongest motivation for constructing a self-aware machine is the innate human desire to discover new horizons and enlarge science's frontiers. Further, developing an artificial brain based on biological brain principles would open the door to immortality. Freed from a fragile and degradable body, a being with synthetic organs, including an artificial brain, could represent humanity's next evolutionary step. Such a new species could quickly colonize the universe, search for alien civilizations, survive to the death of the solar system, control the energy of black holes, and move at the speed of light by transmitting to other planets the information necessary for replication. As has proven the case with all important human discoveries, the real problem will be keeping technology under control. Should self-aware computers become possible, we must ensure that we use them for human progress and not for catastrophic aims.
A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing Constraints
Authors: Joachim Wegener, Frank Mueller
Venue: Real-Time Systems (2001)

This paper contrasts two methods to verify timing constraints of real-time applications. The method of static analysis predicts the worst-case and best-case execution times of a task&rsquo;s code by analyzing execution paths and simulating processor characteristics without ever executing the program or requiring the program&rsquo;s input. Evolutionary testing is an iterative testing procedure, which approximates the extreme execution times within several generations. By executing the test object dynamically and measuring the execution times the inputs are guided yielding gradually tighter predictions of the extreme execution times. We examined both approaches on a number of real world examples. The results show that static analysis and evolutionary testing are complementary methods, which together provide upper and lower bounds for both worst-case and best-case execution times.
Locating Mobile Agents in a Wide Distributed Environment
Authors: Antonella Di Stefano, Corrado Santoro
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Finding the position of a mobile agent in a wide distributed system still represents an open research issue. The various existing mobile agent platforms implement ad hoc naming and location policies, studied to address the requirements of the design choices made. This paper proposes a naming scheme and a location protocol of general validity for mobile agents able to effectively meet all the typical requirements of mobile agent environments and, thus, easy to integrate into different platforms. The paper identifies the main characteristics which an agent naming scheme and a location protocol of general validity should have, and suggests some properties and parameters to be taken into account to evaluate the effectiveness of naming schemes and location protocols. Then, we propose a ¿human readable¿ agent naming scheme based on the distributed environment outlined in MASIF, and a suitable location finding protocol called the Search-By-Path-Chase. Both of them are compared with some of the solutions already provided, using the properties and the parameters suggested. The performances are finally evaluated by means of a set of measurements.
A Deductive Object-Oriented Database System for Situated Inference in Law
Authors: Stephen Wong, Satoshi Tojo
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Deductive Object-Oriented Databases and Situation Theory are two important areas of research in the fields of database and of linguistics. AI and Law is a new field attracting both AI researchers and legal practitioners. Our research brings together the former two fields with the aim of designing knowledge applications in the latter. This is achieved through a formal model for legal reasoning, ${\cal SM}$, and a deductive object-oriented database system, ${\cal QUIX}\!O\!{\cal TE}$. The purpose of this paper is to introduce the key features of this formal model, based on situation theory, and to describe how this database system can implement this abstract model for complex legal reasoning applications. Concrete examples from legal precedents are used to illustrate these advanced features.
A Multiprocessor Bus Design Model Validated by System Measurement
Authors: T. F. Tsuei, M. K. Vernon
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

An accurate and efficient model of a commercial multiprocessor bus is developed. Fourimportant characteristics of the bus design are modeled: asynchronous memory writeoperations; in-order delivery of responses to processor read requests; priority schedulingof memory responses; and upper bounds on the number of outstanding processorrequests. A two-level hierarchical model employing both Markov chain and mean valueanalysis techniques for analyzing queueing networks is used. The model is shown toaccurately predict measured system performance for two parallel program workloads thathave different memory access characteristics. The results provide evidence that analyticqueueing models can be extremely accurate in spite of simplifying assumptions requiredfor model tractability. Model estimates are compared against detailed simulation of thebus to investigate in more detail the likely source of small model inaccuracies. The use ofthe analytical model for assessing system design tradeoffs is illustrated.
Development of an integrated geographical information system prototype for coastal habitat monitoring
Authors: Daniel N. M. Donoghue, Nathalie Mironnet
Venue: Computers Geosciences (2002)

This paper describes a prototype Integrated Geographical Information System (IGIS) developed for coastal habitat monitoring. It outlines the advantages and technical difficulties involved in combining specialist image processing functionality within the LaserScan IGIS software so that it could be used routinely by ecologists. The Coastal Habitat Information Monitoring System prototype set out to demonstrate the feasibility of using remotely sensed imagery for the routine mapping of important coastal habitats in the European Union. The prototype aims to provide an integrated software system to transform Earth Observation data into specialist map products. Normally such processing requires input from remote sensing scientists using specialist software and is not easily accessible to end-users. In principle, the methodology allows different satellite and airborne multi-spectral image data to be used to produce specialist coastal habitat maps. In this paper Landsat TM and IRS 1C LISS 3 data are evaluated and shown to be suitable for mapping the inter-tidal habitats of the Wash estuary on the East Coast of England. A strategic objective of study was to test the feasibility of incorporating all the processing functionality into a single integrated geographical information system. The project concluded satellite data from existing sensor systems can provide habitat data at a good level of detail but that to develop a fully operational processing capability would require considerable development of even the most advanced of the existing commercially available IGIS software package.
Integration Mechanisms and Hospital Efficiency in Integrated Health Care Delivery Systems
Authors: Thomas T. H. Wan, Blossom Yen-Ju Lin, Allen Ma
Venue: Journal of Medical Systems (2002)

This study analyzes integration mechanisms that affect system performances measured by indicators of efficiency in integrated delivery systems (IDSs) in the United States. The research question is, do integration mechanisms improve IDSs' efficiency in hospital care? American Hospital Association's Annual Survey (1998) and Dorenfest's Survey on Information Systems in Integrated Healthcare Delivery Systems (1998) were used to conduct the study, using IDS as the unit of analysis. A covariance structure equation model of the effects of system integration mechanisms on IDS performance was formulated and validated by an empirical examination of IDSs. The study sample includes 973 hospital-based integrated health care delivery systems operating in the United States, carried in the list of Dorenfest's Survey on Information Systems in Integrated Health care Delivery Systems. The measurement indicators of system integration mechanisms are categorized into six related domains: informatic integration, case management, hybrid physician&ndash;hospital integration, forward integration, backward integration, and high tech medical services. The multivariate analysis reveals that integration mechanisms in system operation are positively correlated and positively affect IDSs' efficiency. The six domains of integration mechanisms account for 58.9% of the total variance in hospital performance. The service differentiation strategy such as having more high tech medical services have much stronger influences on efficiency than other integration mechanisms do. The beneficial effects of integration mechanisms have been realized in IDS performance. High efficiency in hospital care can be achieved by employing proper integration strategies in operations.
Multilevel approach to full-chip gridless routing
Authors: Jason Cong, Jie Fang, Yan Zhang
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper presents a novel gridless detailed routing approach based on multilevel optimization. The multilevel framework with recursive coarsening and refinement in a "V-shaped" flow allows efficient scaling of our gridless detailed router to very large designs. The downward pass of recursive coarsening builds the representations of routing regions at different levels, while the upward pass of iterative refinement allows a gradual convergence to a globally optimized solution. The use of a multicommodity flow-based routing algorithm for the initial routing at the coarsest level and a modified maze algorithm for the refinement at each level considerably improves the quality of gridless routing results. Compared with the recently published gridless detailed routing algorithm using wire planning [1], our multilevel gridless routing algorithm is 3&times; to 75&times; faster. We also compared our multilevel framework with a recently developed three-level routing approach [1] and a traditional hierarchical routing approach. Our multilevel algorithm generates better detailed routing results with higher completion rates. To our knowledge, this is the first time that multilevel optimization has been applied to IC routing.
Parallel incremental graph partitioning using linear programming
Authors: Chao Wei Ou, Sanjay Ranka
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Partitioning graphs into equally large groups of nodes while minimizing the number of edges between different groups is an extremely important problem in parallel computing. For instance, efficiently parallelizing several scientific and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while communication is minimized. Obtaining exact solutions is computationally intractable, since graph-partitioning is an NP-complete.For a large class of irregular and adaptive data parallel applications (such as adaptive meshes), the computational structure changes from one phase to another in an incremental fashion. In incremental graph-partitioning problems the partitioning of the graph needs to be updated as the graph changes over time; a small number of nodes or edges may be added or deleted at any given instant.In this paper we use a linear programming-based method to solve the incremental graph partitioning problem. All the steps used by our method are inherently parallel and hence our approach can be easily parallelized. By using an initial solution for the graph partitions derived from recursive spectral bisection-based methods, our methods can achieve repartitioning at considerably lower cost than can be obtained by applying recursive spectral bisection from scratch. Further, the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.
Shared Memory Multimicroprocessor Operating System with an Extended Petri Net Model
Authors: F. Vallejo, J. A. Gregorio, M. González Harbour, J. M. Drake
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We propose a methodology for programming multiprocessor event-driven systems. Thismethodology is based on two programming levels: the task level, which involvesprogramming the basic actions that may be executed in the system as units with a singlecontrol thread; and the job level, on which parallel programs to be executed by thecomplete multiprocessor system are developed. We also present the structure andimplementation of an operating system designed as the programming support for software development under the proposed methodology. The model that has been chosen for the representation of the system software is based on an extended Petri net, which provides a well-established conceptual model for the development of the tasks, thus allowing a totally independent and generic development. This model also facilitates job-level programming, since the Petri net is a very powerful description tool for the parallel program.
The Importance of Branching Models in SCM
Authors: Chuck Walrad, Darrel Strom
Venue: Computer (2002)

To improve software quality, you must first understand your software. If you do not understand your code base, your odds of updating it without breaking something are poor. Often, a fundamental misunderstanding of software configuration management (SCM) as it applies to real-world application development is at fault. Branching is integral to version management, software build correctness, and release management. Good decisions about when and why to branch can make it much easier for developers and release engineers to coordinate software product changes. The right branching strategy makes it easier to deliver the right code, re-create past releases, and--if necessary--roll back to a previous release. Adopting the right SCM branching model facilitates rapid development, increases overall product quality and process efficiency, reduces the incidence of software failures, and improves organizational performance.