ppxscal/embedding_network huggingface dataset:
Graphical strategies to convey functional relationships in the human brain: a case study
Authors: Tomihisa Welsh, Klaus Mueller, Wei Zhu, Nora Volkow, Jeffrey Meade
Venue: Proceedings of the conference on Visualization '01 (2001)

Brain imaging methods used in experimental brain research such as Positron Emission Tomography (PET) and Functional Magnetic Resonance (fMRI) require the analysis of large amounts of data. Exploratory statistical methods can be used to generate new hypotheses and to provide a reliable measure of a given effect. Typically, researchers report their findings by listing those regions which show significant statistical activity in a group of subjects under some experimental condition or task. A number of methods create statistical parametric maps (SPMs) of the brain on a voxelbasis. In our approach statistics are computed not on individual voxels but on predefined anatomical regions-of-interest (ROIs). A correlation coefficient is used to quantify similarity in response for various regions during an experimental setting. Since the functional inter-relationships can become rather complex and spatially widespread, they are best understood in the context of the underlying 3-D brain anatomy. However, despite the power of the 3-D model, the relative location of ROIs in 3-D can be obscured due the inherent problem of presenting 3-D spatial information on a 2-D screen. In order to address this problem, we have explored a number of visualization techniques to aid the brain researcher in exploring the spatial relationships of brain activity. In this paper, we present a novel 3-D interface that allows the interactive exploration of correlation datasets.
Partial Evaluation of Computation Process&mdash;AnApproach to a Compiler-Compiler
Authors: Yoshihiko Futamura
Venue: Higher-Order and Symbolic Computation (1999)

This paper reports the relationship between formal description of semantics (i.e., interpreter) of a programming language and an actual compiler. The paper also describes a method to automatically generate an actual compiler from a formal description which is, in some sense, the partial evaluation of a computation process. The compiler-compiler inspired by this method differs from conventional ones in that the compiler-compiler based on our method can describe an evaluation procedure (interpreter) in defining the semantics of a programming language, while the conventional one describes a translation process.
Surfacing Signatures: An Orientation Independent Free-Form Surface Representation Scheme for the Purpose of Objects Registration and Matching
Authors: Sameh M. Yamany, Aly A. Farag
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper introduces a new free-form surface representation scheme for the purpose of fast and accurate registration and matching. Accurate registration of surfaces is a common task in computer vision. The proposed representation scheme captures the surface curvature information (seen from certain points) and produces images, called "surface signatures," at these points. Matching signatures of different surfaces enables the recovery of the transformation parameters between these surfaces. We propose using template matching to compare the signature images. To enable partial matching, another criterion, the overlap ratio is used. This representation scheme can be used as a global representation of the surface as well as a local one and performs near real-time registration. We show that the signature representation can be used to recover scaling transformation as well as matching objects in 3D scenes in the presence of clutter and occlusion. Applications presented include: free-form object matching, multimodal medical volumes registration, and dental teeth reconstruction from intraoral images.
Wiring Knock-Knee Layouts: A Global Approach
Authors: M. Sarrafzadeh, D. Wagner, F. Wagner, K. Weihe
Venue: IEEE Transactions on Computers (1994)

Presents a global approach to solve the three-layer wirability problem for knock-knee layouts. In general, the problem is NP-complete. Only for very restricted classes of layouts polynomial three-layer wiring algorithms are known up to now. The authors show that for a large class of layouts a three-layer wiring can be constructed by solving a path problem in a special class of graphs or a two-satisfiability problem, and thus may be wired in time linear in the size of the layout area. Moreover, it is shown that a minimum stretching of the layout into a layout belonging to this class can be found by solving a clique cover problem in an interval graph. This problem is solvable in time linear in the size of the layout area as well. Altogether, the method also yields a good heuristic for the three-layer wirability problem for knock-knee layouts.
Critical Sets and Properties of Endomorphisms Built by Coupling of Two Identical Quadratic Mappings
Authors: V. A. Dobrynskii
Venue: Journal of Dynamical and Control Systems (1999)

In this paper, it is shown that there are parameter values such that endomorphisms built by coupling of two identical 1-dimensional quadratic mappings (a) have two kinds of trapping regions in the phase space: a large simply-connected domain inside of which there is a smaller trapping subregion consisting of two disjoint domains&semi; (b) restrictions of the main diagonal y &equals; x of their nonwandering sets are invariant subsets, which may not belong to attractors of the given endomorphisms, but in any way, can be nonisolated in their nonwandering sets. Numerical investigation results represented in the Appendix display the existence of a couple of bifurcation cascades and this leads to a couple of nontrivial symmetrically disposed chaotic strange attractors each of which consists of four disjoint simply connected regions. As parameters vary, these attractors merge into the one consisting at first of two and then of one such region as mentioned above.
The Curse of Fast Iron
Authors: James F. Dunnigan
Venue: Computer (2001)

More powerful microprocessors, graphics chips, and sound boards are killing commercial strategy games.
Composition of Services with Mobile Code
Authors: Pierre-Antoine Queloz, Alex Villazón
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Mobile code is slowly gaining acceptance but it is still not clear where it is really useful. If not used judiciously it may incur greater complexity of programming and degradation of performances. The goal of this paper is to show that mobile code is particularly well suited as a glue for the composition of immobile services, where flexibility and extensibility are necessary. To support our claim we describe two services and one application that have been programmed with mobile code in the context of active networking. We study the impact on the flexibility, complexity and performance of the resulting systems. We observe positive effects on flexibility and complexity and acceptable performance penalties.
Employment 2005: Boom or Bust for Computer Professionals?
Authors: John Keaton, Scott Hamilton
Venue: Computer (1996)

Over the last four years, the world's corporations have been restructured, reengineered, downsized, and rightsized. Whatever it is called, the process usually involves laying off workers. Some of the largest upheavals have involved those corporations built around the sale and application of computer technology, and one of the professions affected most is the computing profession. We continue to hear contradictory reports of excesses and shortages of skilled labor in the world's technology market. Is it boom or bust for computer professionals? This article examines the trends that are important to computer professionals. The fact is that the computing profession as a whole is enjoying stable employment and renewed hiring, and the job market for computer professionals is bullish over the next 10 years.
A stream compiler for communication-exposed architectures
Authors: Michael I. Gordon, William Thies, Michal Karczmarek, Jasper Lin, Ali S. Meli, Andrew A. Lamb, Chris Leger, Jeremy Wong, Henry Hoffmann, David Maze, Saman Amarasinghe
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

With the increasing miniaturization of transistors, wire delays are becoming a dominant factor in microprocessor performance. To address this issue, a number of emerging architectures contain replicated processing units with software-exposed communication between one unit and another (e.g., Raw, SmartMemories, TRIPS). However, for their use to be widespread, it will be necessary to develop compiler technology that enables a portable, high-level language to execute efficiently across a range of wire-exposed architectures.In this paper, we describe our compiler for StreamIt: a high-level, architecture-independent language for streaming applications. We focus on our backend for the Raw processor. Though StreamIt exposes the parallelism and communication patterns of stream programs, some analysis is needed to adapt a stream program to a software-exposed processor. We describe a partitioning algorithm that employs fission and fusion transformations to adjust the granularity of a stream graph, a layout algorithm that maps a stream graph to a given network topology, and a scheduling strategy that generates a fine-grained static communication pattern for each computational element.We have implemented a fully functional compiler that parallelizes StreamIt applications for Raw, including several load-balancing transformations. Using the cycle-accurate Raw simulator, we demonstrate that the StreamIt compiler can automatically map a high-level stream abstraction to Raw without losing performance. We consider this work to be a first step towards a portable programming model for communication-exposed architectures.
Formal agent-oriented modeling with UML and graph transformation
Authors: Ralph Depke, Reiko Heckel, Jochen Malte Küster
Venue: Science of Computer Programming (2002)

The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not account for these agent-specific aspects. Therefore, dedicated techniques for agent-oriented modeling are required which are based on the concepts and notations of object-oriented modeling and extend these in order to support agent-specifiC concepts.In this paper, an agent-oriented modeling technique is introduced which is based on UML notation. Graph transformation is used both on the level of modeling in order to capture agent-specific aspects and as the underlying formal semantics of the approach. Concepts of the concurrency theory of graph transformation systems following the double-pushout approach are exploited in order to formalize the relation between global requirements specification by means of sequence diagrams, and implementation-oriented design models where graph transformation rules specify the agents' local operations.
Predictable routing
Authors: Ryan Kastner, Elaheh Bozorgzadeh, Majid Sarrafzadeh
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Predictable routing is the concept of using prespecified patterns to route a net. By doing this, we allow an more accurate prediction mechanism for metrics such as congestion and wirelength earlier in the design flow. Additionally, we can better plan the routes, insert buffers and perform wire sizing earlier. With comparable routing quality, we show that we can predictably route up to 80% of a selected subset of nets. Also, we introduce methods for finding a group of nets which can be predictably routed.
A Theory of Translation From Relational Queries to Hierarchical Queries
Authors: Weiyi Meng, Clement Yu, Won Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In a heterogeneous database system, a query for one type of database system (i.e., a source query) may have to be translated to an equivalent query (or queries) for execution in a different type of database system (i.e., a target query). Usually, for a given source query, there is more than one possible target query translation. Some of them can be executed more efficiently than others by the receiving database system. Developing a translation procedure for each type of database system is time-consuming and expensive. In this paper, we abstract a generic hierarchical database system (GHDBS) which has properties common to database systems whose schema contains hierarchical structures (e.g., System 2000, IMS, and some object-oriented database systems). We develop principles of query translation with GHDBS as the receiving database system. Translation into any specific system can be accomplished by a translation into the general system with refinements to reflect the characteristics of the specific system. We develop rules that guarantee correctness of the target queries, where correctness means that the target query is equivalent to the source query. We also provide rules that can guarantee a minimum number of target queries in cases when one source query needs to be translated to multiple target queries. Since the minimum number of target queries implies the minimum number of times the underlying system will be invoked, efficiency is taken into consideration.
How to Store a Triangular Matrix
Authors: A. S. LaPaugh, R. J. Lipton, J. S. Sandberg
Venue: IEEE Transactions on Computers (1992)

The problem of storing a triangular matrix so that each row and column is stored as a vector, i.e. the locations form an arithmetic progression, is discussed. Storing rows and columns as vectors can speed up access significantly. It is shown that there is no such storage method that does not waste approximately one-half of the computer memory.
Controlled Vocabularies in OODBs: Modeling Issues and Implementation
Authors: Li-Min Liu, Michael Halper, James Geller, Yehoshua Perl
Venue: Distributed and Parallel Databases (1999)

A major problem that arises in many large application domains is the discrepancy among terminologies of different information systems. The terms used by the information systems of one organization may not agree with the terms used by another organization even when they are in the same domain. Such a situation clearly impedes communication and the sharing of information, and decreases the efficiency of doing business. Problems of this nature can be overcome using a controlled vocabulary (CV), a system of concepts that consolidates and unifies the terminologies of a domain. However, CVs are large and complex and difficult to comprehend. This paper presents a methodology for representing a semantic network-based CV as an object-oriented database (OODB). We call such a representation an Object-Oriented Vocabulary Repository (OOVR). The methodology is based on a structural analysis and partitioning of the source CV. The representation of a CV as an OOVR offers both the level of support typical of database management systems and an abstract view which promotes comprehension of the CV&lsquo;s structure and content. After discussing the theoretical aspects of the methodology, we apply it to the MED and InterMED, two existing CVs from the medical field. A program, called the OOVR Generator, for automatically carrying out our methodology is described. Both the MED-OOVR and the InterMED-OOVR have been created using the OOVR Generator, and each exists on top of ONTOS, a commercial OODBMS. The OOVR derived from the InterMED is presently available on the Web.
Applying the mu BTRON Bus to a Music LAN
Authors: Ken Sakamura, Kanehisha Tsurumi, Hiro Kato
Venue: IEEE Micro (1988)

The BTRON computer architecture, developed as part of the Japanese TRON (The Real-Time Operating Nucleus) project, contains specifications for several buses. The application of one of these, the mu BTRON bus, as a music local area network, is discussed. Simulation results for mu BTRON bus performance when electronic musical instruments are connected to BTRON-based computers are reported. Electronic musical instruments were chosen for the simulation target because they need real-time performance, a feature of the mu BTRON bus.
Design and Evaluation of a Generic Software Architecture for On-Demand Video Servers
Authors: Jonathan Chien-Liang Liu, David H. C. Du, Simon S. Y. Shim, Jenwei Hsieh, MengJou Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

High-bandwidth and real-time constraints for supporting concurrent video accesses make generic software architecture design for high-performance on-demand video servers challenging. This challenging task can be even more complicated when we consider that a generic software architecture should be applied to different hardware platforms. In this paper, we introduce the design, implementation, and evaluation of a generic software architecture for on-demand video servers. We describe different key components on controlling the storage and network devices within the server. The interactive collaborations between these software components are also illustrated. The experimental results indicate a very promising direction on exploring the right combinations of these software components. The server is, thus, able to increase the number of concurrent video accesses with the same hardware configuration. For instance, with the right combinations, the system achieved about 80 percent of the storage system bandwidth of four disks, about 70 percent of the storage system bandwidth of six disks, and generally reached the maximal achieved SCSI bandwidth when eight disks are used over two SCSI buses (i.e., four disks on each SCSI bus). Our research and experimental results are based on video servers currently under construction across a variety of hardware platforms, including SMP, DMP, and clusters of PC or workstations. The most-advanced prototype server is based on an SGI shared-memory multiprocessor with a mass storage system consisting of RAID-3 disk arrays. With all the enabling/management schemes, we were able to further investigate interesting research issues by considering the user's access profiles for taking advantage of popular video titles. The results were significant, with a range of 60 percent improvement given a 512 Kbyte block size. In addition to the experimental results, theoretical performance models were also developed that closely match to our collected experimental results.
A Fault Injection Technique for VHDL Behavioral-Level Models
Authors: Todd A. Delong, Barry W. Johnson, Joseph A. Profeta Iii
Venue: IEEE Design Test (1996)

Fault injection is an important technique for the evaluation of design metrics such as reliability, safety, and fault coverage. Fault injection involves inserting faults into a system and monitoring the system to determine its behavior in response to the fault. Recently, designers are realizing the advantages of using simulation to perform fault injection on a model of the design, as opposed to performing the fault injection on the actual system. As designs become more complex, the need arises to perform fault injection at earlier stages in the design process, specifically at the behavioral level of abstraction where a functional description exists for the various components of the design, but the implementation details have not been developed.A technique has been developed that allows for the injection of faults into a Very High Speed Integrated Circuit (VHSIC) Hardware Description Language (VHDL) behavioral-level model. The corruption of a VHDL signal (the fault injection) is accomplished using a bus resolution function (BRF) and an additional process statement that performs the fault injection. This process corrupts the VHDL signal based on information read from a text file. The file contains the time to start the fault injection, the time to end the fault injection, which signal to corrupt, and how to corrupt the signal (for example, which bits to stick at a 1, which bits to stick at a 0, and which bits are not affected).This article outlines the implementation of the fault injection technique using VHDL and demonstrates the use of the technique to evaluate a design. In this case, the design is an embedded control system used to provide fail-safe operation in the railway industry. The article describes how the technique was used to evaluate the control system and provides the results obtained from the fault injection experiments performed on the control system.
Bootstrap: Europe's Assessment Method
Venue: IEEE Software (1993)

The Bootstrap software assessment method, which yields more detailed capability profiles and maturity levels than the Capability Maturity Model and gives capability profiles of organizations and projects separately, is discussed. The assessment steps, assessment algorithm, and maturity determination are described. Preliminary results from assessments conducted over two and a half years are also discussed.
Fuzzy logic approach for description of meteorological impacts on urban air pollution species: a Hong Kong case study
Authors: Oleg M. Pokrovsky, Roger H. F. Kwok, C. N. Ng
Venue: Computers Geosciences (2002)

An alternative approach to the conventional dynamic and photochemical models is presented to forecast urban air pollutants operationally. It is well known that there are some practical difficulties, which prevent the necessary progress in the development of these models as a forecasting tool. A fuzzy logic based method has been developed here to study the impact of meteorological factors on the evolution of air pollutant levels and to describe them quantitatively. This method meets all requirements but needs substantial amount of observational data. The developed model is based on simulation of diurnal cycles of principal meteorological variables (wind speed and direction, solar irradiance and air temperature) and the corresponding diurnal patterns of various air pollutants (O3, NO2, NO, NOy). In addition, the spatial patterns of these parameters are also studied. Both temporal and spatial parameter distributions have been considered in order to investigate impacts of meteorological factors and they are incorporated into the models as state vectors in the multidimensional space. Here we suggest that most of the weather and air pollution phenomena could be simulated by sequences of its conservation inside some fuzzy sets and the transition from one fuzzy set to another. Therefore, the important key point here is the development of the transition rules.
Beyond Intelligent Machines: Just Do It!
Venue: IEEE Software (1993)

The author argues that users want a sense of direct and immediate control over computers that differs from how they interact with people. He presents several examples of these predictable and controllable interfaces developed in the lab. The examples include tree maps and dynamic queries.
Cool Chips III
Authors: Tadao Nakamura
Venue: IEEE Micro (2000)

These days the concept of architecting, designing, and implementing microprocessors is moving from high-power, high-speed results to low-power and high-speed objectives in a multimedia era. Of course, any processor is toward the same objective even though it is not for multimedia mobile systems. Like general low-pollution world, energy is going to be kept as little as possible. However, it looks inconsistent that as the power consumption of microprocessors is reduced, their performance, especially processing speed, is increasing. Usually there would exist some trade-off between them. However, probably there might be ways to improve the technology for fabrication of low-power and high-speed chips. In reality recently many researches have started on this objective.