ppxscal/embedding_network huggingface dataset:
The Memory-Integrated Network Interface
Authors: Ron Minnich, Dan Burns, Frank Hady
Venue: IEEE Micro (1995)

We are designing a zero-copy ATM interface call MInetwork interface, the Memory Integrated Network interface. MInetwork interface has a target bandwidth of 1 Gbps and will support application-to-application latency of 1.2 microseconds. MInetwork interface is a multiuser ATM interface which resides in the memory space of the computer system, as opposed to I/O space. Applications will have direct access to pages of memory which are used for the network I/O; thus applications can send and receive packets with no operating system support needed. An application can initiate packet transmission with one memory write; it can determine if a packet has arrived by checking a per-circuit control and status word. At the same time, the operating system can use MInetwork interface for its own communications and for supporting standard networking software such as TCP/IP and NFS. Initial structural VHDL simulations have shown that for single ATM cells we can "bounce" an ATM cell from application to application in a round-trip time of 3.9 microseconds (including software overhead on the relaying node), at a bandwidth of 10 Mbytes/s. For 960-byte packets, the bandwidth is 103 Mbytes/s. The architecture of MInetwork interface is motivated by our experiences with applicatio ns we have run in cluster and distributed computing environments. We have used from 48 to 200 computers per application, and have observed that successful applications are ones that use the network very little. The MInetwork interface design is targeted at the kinds of applications we cannot currently run, those that need to send or receive data at very frequent intervals.
Software Measurement: Uncertainty and Causal Modeling
Authors: Norman Fenton, Paul Krause, Martin Neil
Venue: IEEE Software (2002)

Software measurement has the potential to play an important role in risk management during product development. Metrics incorporated into predictive models can give advanced warning of potential risks. However, the common approach of using simple regression models, notably to predict software defects, can lead to inappropriate risk management decisions. These naïve models should be replaced with predictive models incorporating genuine cause-effect relationships. The authors show how to build these models using Bayesian networks, a powerful graphical modeling technique for software quality risk management that is providing accurate predictions of software defects in a range of real projects. As well as their use for prediction, Bayesian networks can also be used for performing a range of"what if" scenarios to identify potential problems and possible improvement actions.
Global Teleporting with Java: Toward Ubiquitous Personalized Computing
Authors: Kenneth R. Wood, Tristan Richardson, Frazer Bennett, Andy Harter, Andy Hopper
Venue: Computer (1997)

The essence of mobile computing is having your personal computing environment available wherever you happen to be. Traditionally, this is achieved by physically carrying a computing device (say, a laptop or PDA) which may have some form of intermittent network connectivity, either wireless or tethered. However, at the Olivetti and Oracle Research Laboratory, we have introduced another form of mobility in which it is the user's applications that are mobile.1 Users do not carry any computing platform but instead bring up their applications on any nearby machine exactly as they appeared when last invoked. We call this form of mobility teleporting, and it has been used continuously and fruitfully by many members of our laboratory for the past three years. Clearly, teleporting to these machines requires that they be networked and that they provide a common interface at some level. In our case, we use our local area network (Ethernet and ATM), with X Windows serving as the common interface. When we teleport, our personal X session-with all its associated applications in their latest collective state-is transferred from one host's display to another within the lab. For example, we can walk into someone else's office and immediately call up and interact with our personal working environment on their machine, alongside any other working environments currently displayed there. We are currently extending this idea from our LAN to the entire Internet using Java as the common interface. It is still our personal X sessions that are made mobile, but now they can appear anywhere on the Internet within any Java-enabled browser. Although in theory the original form of teleporting could be used across the Internet, it would be restricted to hosts running an X server, and, even more problematically, would contravene the X security policy implemented by most system administrators. (The next release of X, code-named Broadway, will address some of these issues.2) But even more importantly, our current approach aims to take advantage of the rapid global proliferation of the World Wide Web. Web browsers are available in a dramatically growing range of locations, including corporate, personal, and even public-access sites. The ability to call up any personal computing environment on any such browser will enable nomadic computing on a truly global scale.
Two-coloring random hypergraphs
Authors: Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
Venue: Random Structures Algorithms (2002)

A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H(k, n, p) be a random k-uniform hypergraph on a vertex set V of cardinality n, where each k-subset of V is an edge of H with probability p, independently of all other k-subsets. Let m = p(????) denote the expected number of edges in H. Let us say that a sequence of events En holds with high probability (w.h.p.) if limn → ∞ Pr[En] = 1. It is easy to show that if m = c2kn then w.h.p H is not 2-colorable for c > ln 2/2. We prove that there exists a constant c > 0 such that if m = (c2k/k)n, then w.h.p H is 2-colorable.
A Language for Construction of Belief Networks
Authors: R. P. Goldman, E. Cherniak
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A method for incrementally constructing belief networks, which are directed acyclic graph representations for probability distributions, is described. A network-construction language, FRAIL3, which is similar to a forward-chaining language using data dependencies but has additional features for specifying distributions, was developed. A particularly important feature of this language is that is allows the user to conveniently specify conditional probability matrices using stereotyped models of intercausal interaction. Using FRAIL3, one can define parmeterized classes of probabilistic models. These parameterized models make it possible to apply probabilistic reasoning to problems for which it is impractical to have a single large, static model.
Bringing the Wireless Internet to Mobile Devices
Authors: Subhasis Saha, Mark Jamtgaard, John Villasenor
Venue: Computer (2001)

Mapping Internet content to mobile wireless devices requires new technologies, standards, and innovative solutions that minimize cost and maximize efficiency. The wireless Internet must deliver information in a suitable format to handheld device users--regardless of location and connectivity. Although the exact form in which high-speed wireless data services will develop is uncertain, the authors predict an improvement over today's data rates. Current mobile devices suffer from small displays, limited memory, limited processing power, low battery power, and vulnerability to inherent wireless net-work transmission problems. To address these issues, a group of leading wireless and mobile communications companies have developed the wireless application protocol for transmitting wireless information and telephony ser-vices on mobile handheld devices. Whereas HTTP sends its data in text for-mat, WAP uses Wireless Markup Language to create and deliver content in a compressed binary format that provides efficiency and security. Middleware, an alternative to manually replicating content, seamlessly translates a Web site's existing content to mobile devices that support operating systems, markup languages, microbrowsers, and protocols. The authors predict that middleware such as Relational Markup Language will be critical to bringing Internet content to wireless devices, and they anticipate that open standards based on this or similar techniques will gain acceptance.
Asynchronous Comparison-Based Decoders for Delay-Insensitive Codes
Authors: Venkatesh Akella, Nitin H. Vaidya, G. Robert Redinbo
Venue: IEEE Transactions on Computers (1998)

A comparison-based decoder detects the arrival of a code word by comparing the received checkbits with the checkbits computed using the received data. Implementation issues underlying comparison-based decoders for systematic delay-insensitive (DI) or unordered codes is the subject of this paper. We show that if the decoder is to be implemented using asynchronous logic, i.e., if the gate and wire delays are arbitrary (unbounded but finite), then it is impossible to design a comparison-based decoder for any code that is more efficient than a dual-rail code. In other words, the encoded word must contain at least twice as many bits as the data. In addition, the codes should satisfy two other properties, called the initial condition and the all-zero lower triangle (AZLT) property, for the realization of a delay-insensitive comparison-based decoder. The paper shows that comparison-based decoders for codes that have the requisite level of redundancy and that satisfy the two properties can be implemented using asynchronous logic.
Capture, Integration, and Analysis of Digital System Requirements with Conceptual Graphs
Authors: Walling R. Cyre
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Initial requirements for new digital systems and products that are generally expressed in a variety of notations including diagrams and natural language can be automatically translated to a common knowledge representation for integration, for consistency and completeness analysis, and for further automatic synthesis. In this paper, block diagrams, flowcharts, timing diagrams, and English as used in specifying digital systems requirements are considered as examples of source notations for system requirements. The knowledge representation selected for this work is a form of semantic networks called conceptual graphs. For each source notation, a basis set of semantic primitives in terms of conceptual graphs is given, together with an algorithm for automatically generating conceptual structures from the notation. The automatic generation of conceptual structures from English presumes a restricted sublanguage of English and feedback to the author for verification of the interpretation. Mechanisms for integrating the separate conceptual structures generated from individual requirements expressions using schemata are discussed, and methods are illustrated for consistency and completeness analysis.
Coupling effects on the conductance fluctuations in GaAs/A1GaAs double quantum dots
Authors: Tomomitsu Risaki, Tetsuya Ida, Koji Ishibashi, Takuo Sugano
Venue: Microelectronic Engineering (2002)

Electron wave interference effects in GaAs/AlGaAs coupled quantum dots have been studied at 30 mK in magnetic fields with different coupling strength between two dots. In a strong coupling regime, the existence of global trajectories which span two dots was suggested, while in a weak coupling regime, the trajectories were found to be limited in each single dot.
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
Authors: B. M. Maziarz, V. K. Jain
Venue: IEEE Transactions on Computers (2002)

This paper considers defect tolerance issues for parallel computing systems based on a new interconnection network, namely "Tori connected mESHes (TESH)." Key features of this network are the following: It is hierarchical, thus allowing exploitation of computation locality and systematic expansion up to a million processors, and it appears to be well-suited for VLSI/ULSI realization, including 3D implementation. The goal here is to present efficient reconfiguration algorithms for such hierarchical parallel computing systems. Despite the dramatic improvement in defect density in recent years, it is still necessary to provide redundancy and defect circumvention to achieve acceptable system-level yields for large multicomputer systems. The TESH-based parallel systems are no exception. Therefore, we develop placement and routing algorithms that assign logical nodes to healthy physical nodes and configure switches to bypass the defective cells, switches, and links. Simulations indicate that the placement (or remapping) is nearly 100 percent effective, while the routing performance diminishes with increasing defect density for a given extent of redundancy. The approach scales up well because, in TESH networks, essentially the same kind of sparing is used at all levels.
Quality Time
Venue: IEEE Software (1993)

An approach using maintenance-based projects to instill a quality ethic in software engineering students is discussed. The model is based on assigning specific roles with explicit responsibilities that initiate best current practice. Each student has to interact with other roles so that the entire team worked in concert to complete the maintenance tasks while ensuring quality.
Toward Code-Free Business Application Development
Authors: Eric Wegscheider
Venue: Computer (1997)

Conventional wisdom holds that building high-end business applications is unavoidably difficult because applications and the technology for implementing them are complex. Empirical evidence from real projects amply reinforces this conclusion. Building business applications requires technical knowledge about database design, entity relationship or object modeling, GUI design, middleware technology, programming languages, operating systems, prototyping tools, and so on. Pulling together a development environment and a knowledgeable team capable of tackling a large application can be a major hurdle in starting a new project. It can be argued that spiraling technical complexity makes it difficult to focus on the application's core business problem. Complicated prototyping tools may help with early rapid iteration, but they result in throwaway mock-ups that quickly lose sync with the application as it evolves. To reach a new level of productivity and quality in application building, we need something better. This article begins with a simple business application and attempts to sketch out what an "ideal" approach to specifying it might be. From this basic example, design and process patterns emerge that allow for the specification of a comprehensive environment that meets these criteria.
The Emerging Landscape of Bioinformatics Software Systems
Authors: Lenwood S. Heath, Naren Ramakrishnan
Venue: Computer (2002)

Fusing computing and biology expertise, bioinformatics software provides a powerful tool for organizing and mining the vast amounts of data genetics researchers are accumulating. Biology has increasingly become a data driven science. The emergence of highthroughputdata acquisition technologies for investigating biological phenomena has been an important factor in this process. For example, the recent completion of the human, rice, and flowering plant Arabidopsis thaliana genome maps signifies a major milestone in data acquisition.The development of novel algorithms and databases to catalog, organize, harness, and mine theincreasing amount of data such research efforts generate has also been important. The potential for scientists to infer significant biological knowledge computationally from a desktop is both appealing and real. In this issue, we gather perspectives, articles,and reports to showcase the emergence of bioinformatics software as a discipline in its own right. The "Molecular Biology for Computer Scientists" sidebar provides some pertinent background information.
On Uniformization of Affine Dependence Algorithms
Authors: Weijia Shang, Edin Hodzic, Zhigang Chen
Venue: IEEE Transactions on Computers (1996)

This paper deals with the problem of transforming irregular data dependence structures of algorithms with nested loops into more regular ones. Algorithms under consideration are n-dimensional algorithms (algorithms with n nested loops) with affine dependences where dependences are affine functions of index variables of the loop. Methods are proposed to uniformize affine dependence algorithms, i.e., to transform affine dependence algorithms into uniform dependence algorithms where dependences are independent of the index variables (constant). Objectives are considered to guide the selection of feasible uniformizations. The first one is to reduce the number of dependences after uniformization. The second one is to maximize parallelism preserved by the uniformization. Some parallelism might be lost due to the uniformization. The parallelism preserved by the uniformization is measured by 1) the total execution time by the optimal linear schedule which assigns each computation in the algorithm an execution time according to a linear function of the index of the computation, and 2) the size of the cone spanned by the dependence vectors after uniformization.
Virtual Images for Similarity Retrieval in Image Databases
Authors: G. Petraglia, M. Sebillo, M. Tucci, G. Tortora
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We introduce the virtual image, an iconic index suited for pictorial information access in a pictorial database, and a similarity retrieval approach based on virtual images to perform content-based retrieval. A virtual image represents the spatial information contained in a real image in explicit form by means of a set of spatial relations. This is useful to efficiently compute the similarity between a query and an image in the database. We also show that virtual images support real-world applications that require translation, reflection, and/or rotation invariance of image representation.
IEEE Computer Society Technical Committees
Authors: Paul L. Borrill
Venue: Computer (1995)

With this issue, Computer begins a department devoted to the activities of the society¿s 29 technical committees.
Guest Editors' Introduction: The Ongoing March Toward Digital Government
Authors: Ahmed K. Elmagarmid, William J. McIver
Venue: Computer (2001)

Despite occasional setbacks, digital government projects now appear firmly on the road to fulfilling their promise of making civil and political processes more accessible than ever.
Using a Test-Specification Format in Automatic Test-Program Generation
Authors: Bas Verhelst
Venue: IEEE Design Test (1990)

The author suggests that if the information necessary for testing a digital IC or printed-circuit board is kept and transferred in a standardized format, testing will be much easier. He describes the concept of a test-specification format (TSF) and reports the results of experiments with two candidate TSFs. The first, Tandem, is a restricted implementation that uses ITF, aPhilips internal language, to specify tests. The practical use of a TSF was studied by evaluating NCF (neutral code format), a well-documented and stable language. Although the two languages investigated were not true TSFs, the author shows that placing a language between CAD and test systems creates a powerful environment that could greatly reduce test-preparation time and test costs.
Using Distributed Objects for Digital Library Interoperability
Authors: Andreas Paepcke, Steve B. Cousins, Hector Garcia-Molina, Scott W. Hassan, Steven P. Ketchpel, Martin Röscheisen, Terry Winograd
Venue: Computer (1996)

Information repositories are just one of many services tomorrow's digital libraries might offer. Other services include automated news summarization, trend analysis across news repositories, and copyright-related facilities. This distributed collection of services has the potential to be enormously helpful in performing information-intensive tasks. It could also turn such tasks into confusing, frustrating annoyances by forcing programmers and users to learn many interfaces and by confronting users with the bewildering details of fee-based services that were previously only accessible to professional librarians. The Stanford Digital Library project is addressing the problem of interoperability, which is particularly important because standardization efforts are lagging behind the development of digital library services. The authors used CORBA to implement information-access and payment protocols. These protocols provide the interface uniformity necessary for interoperability, while leaving implementers a large amount of leeway to optimize performance and to provide choices in service performance profiles. The authors' initial experience indicates that a distributed object framework-and its access protocol in particular-do give clients and servers the flexibility to manage their communication and processing resources effectively.
Interactive Scientific Visualization of Fluid Flow
Authors: Paul R. Woodward
Venue: Computer (1993)

Examples of scientific visualization techniques used for the interactive exploration of very large data sets from supercomputer simulations of fluid flow are presented. Interactive rendering of images from simulations of grids of 2 million or more computational zones are required to drive high-end graphics workstations to their limits with 2-D data. The author presents one such image and discusses interactive steering of 2-D flow simulations, a phenomenon now possible with grids of half a million computational zones. He uses a simulation of compressible turbulence on a grid of 134 million computational zones to set the scale for discussing interactive 3-D visualization techniques. A concept for a gigapixel-per-second video wall, or gigawall, which could be built with present technology to meet the demands of interactive visualization of the data sets that will be produced by the next generation of supercomputers, is discussed.
A New Structure-from-Motion Ambiguity
Authors: John Oliensis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper demonstrates the existence of a new, approximate, intrinsic ambiguity in Euclidean structure from motion (SFM) which occurs as generically as the bas-relief ambiguity but, unlike it, strengthens for scenes with more depth variation. The ambiguity does not occur in projective SFM, but the reasons for this make projective reconstructions more likely to have large errors. Our analysis gives a semiquantitative characterization of the least-squares error surface over a domain complementary to that analyzed by Jepson, Heeger, and Maybank. As part of our analysis, we show that the least-squares error for infinitesimal motion¿the optical-flow error¿gives a good approximation to the least-squares error for moderate finite motions. We propose that many high-error local minima occur for epipoles in or near the image. We also establish the existence of a new local minimum in minimizing over the rotation, given the translation direction.