ppxscal/embedding_network huggingface dataset:
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
Authors: P. Krueger, T. H. Lai, V. A. Dixit-Radiya
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Managing computing resources in a hypercube entails two steps. First, a job must bechosen to execute from among those waiting (job scheduling). Next a particular subcubewithin the hypercube must be allocated to that job (processor allocation). Whereasprocessor allocation has been well studied, job scheduling has been largely neglected.The goal of this paper is to compare the roles of processor allocation and job schedulingin achieving good performance on hypercube computers. We show that job schedulinghas far more impact on performance than does processor allocation. We propose a newfamily of scheduling disciplines, called Scan, that have particular performanceadvantages. We show that performance problems that cannot be resolved throughcareful processor allocation can be solved by using Scan job-scheduling disciplines.Although the Scan disciplines carry far less overhead than is incurred by even thesimplest processor allocation strategies, they are far more able to improve performancethan even the most sophisticated strategies. Furthermore, when Scan disciplines areused, the abilities of sophisticated processor allocation strategies to further improveperformance are limited to negligible levels. Consequently, a simple O(n) allocationstrategy can be used in place of these complex strategies.
Decomposition of Knowledge for Concurrent Processing
Authors: Gilbert Babin, Cheng Hsu
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In some environments, it is more difficult for distributed systems to cooperate. In fact, some distributed systems are highly heterogeneous and might not readily cooperate. In order to alleviate these problems, we have developed an environment that preserves the autonomy of the local systems, while enabling distributed processing. This is achieved by 1) modeling the different application systems into a central knowledge base (called a Metadatabase), 2) providing each application system with a local knowledge processor, and 3) distributing the knowledge within these local shells. This paper is concerned with describing the knowledge decomposition process used for its distribution. The decomposition process is used to minimize the needed cooperation among the local knowledge processors, and is accomplished by "serializing" the rule execution process. A rule is decomposed into a ordered set of subrules, each of which is executed in sequence and located in a specific local knowledge processor. The goals of the decomposition algorithm are to minimize the number of subrules produced, hence reducing the time spent in communication, and to assure that the sequential execution of the subrules is "equivalent" to the execution of the original rule.
Disjoint subgraphs of large maximum degree
Authors: Oleg Pikhurko, Andrew Thomason
Venue: Discrete Mathematics (2002)

Erdös [in: Chartrand (Ed.), The Theory and Applications of Graphs, Wiley, New York, 1981, p. 331] conjectured that the vertices of any graph with fewer than (2n+1 2) - (n 2) edges can be split into two parts, both parts inducing subgraphs of maximum degree less than n. Recently, the first named author [Combinatorica 21 (2001) 403-412] disproved this conjecture. In this paper we consider further questions arising out of the conjecture.First of all, we give couterexamples to the conjecture having only 2n + 80 vertices for large n. (The above counterexample had around n3/2/√2 vertices, though it had many fewer edges than our examples.)We also define the function b(n,m) to be the minimum size of a graph G such that, for any partition V(G) = A∪B, either Δ(G[A]) ≥ n or Δ(G[B]) ≥ m holds. In this terminology, Erdös's conjecture was b(n,n) = (2n+1 2 ) - (n 2) We prove that b(n,m) = 2nm - m2 + O(√m)n for n ≥ m,b(n, 1) = 4n - 2 for n ≥ 7, and b(n,2) = 6n + O(1).Let m(n,k,j) be the minimum size of a graph G on n + k vertices in which Δ(G[A]) ≥ n for every (n + j)-set A ⊆ V(G). We prove that, if k = o(n(n+j)/logn), then m(n,k,j) = (1 + o(1)) (1 + k-j/2n + 2j) (k - j + 1)n as n → ∞. The upper bound here disproves a conjecture made by Erdös, Reid, Schelp and Staton [Discrete Math. 158 (1996) 283-286].
Can Kondo-like behavior occur in open quantum dots?
Authors: J. P. Bird, A. Shailos, M. Elhassan, C. Prasad, K. M. Indlekofer, L. Shifren, R. Akis, D. K. Ferry, L.-H. Lin, N. Aoki, Y. Ochiai, K. Ishibashi, Y. Aoyagi
Venue: Microelectronic Engineering (2002)

We discuss the possibility that a Kondo effect may arise in transport through open quantum dots, in which isolated periodic orbits, accessed by non-classical phase-space tunneling, serve as the localized charge that gives rise to the Kondo behavior. Some support for these ideas is shown to be provided by a simple formulation of the Anderson model, in which we assume the electron interaction strength within the dot to be strongly peaked at specific energies. Using this model, we are able to demonstrate behavior reminiscent of the metal-insulator transition, observed in our experimental studies of open quantum dots and dot arrays. The indication of these experiments appears to be that we enter a regime of many-body transport, which becomes effective once the temperature is lowered such that the discrete density of states of the dot becomes energetically resolved.
Proceedings of the conference on Visualization '01
Venue: VISUALIZATION (2001)

Welcome to IEEE Visualization 2001! These are the proceedings of the conference being held October 21 -- 26, 2001 in San Diego, California. These days we find that the visualization technologies have permeated almost all facets of human endeavors in science, engineering, medicine, and entertainment and arc undeniably influencing the very quality of our lives. As the ubiquity of visualization has grown over the last few decades, so too has the scope of this conference. This year the conference provides an intellectually stimulating program spanning a diverse set of applications, a rich set of data and information representations, and a variety of algorithms and systems. We see this conference as fulfilling the important mission of providing a forum to promote interaction among researchers, developers, and users of various visualization technologies and applications. This annual Visualization Conference series is sponsored by the IEEE Computer Society's Technical Committee on Visualization and Graphics in cooperation with ACM SIG-GRAPH. We hope that you will find this year's program tightly packed with exciting papers, educational case studies, and thought-provoking panels between the visionary keynote and the capstone sessions.
Mat&eacute;: a tiny virtual machine for sensor networks
Authors: Philip Levis, David Culler
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopulate. Often there is no feasible method to recharge motes, so energy is a precious resource. Once deployed, a network must be reprogrammable although physically unreachable, and this reprogramming can be a significant energy cost.We present Mat&eacute;, a tiny communication-centric virtual machine designed for sensor networks. Mat&eacute;'s high-level interface allows complex programs to be very short (under 100 bytes), reducing the energy cost of transmitting new programs. Code is broken up into small capsules of 24 instructions, which can self-replicate through the network. Packet sending and reception capsules enable the deployment of ad-hoc routing and data aggregation algorithms. Mat&eacute;'s concise, high-level program representation simplifies programming and allows large networks to be frequently reprogrammed in an energy-efficient manner; in addition, its safe execution environment suggests a use of virtual machines to provide the user/kernel boundary on motes that have no hardware protection mechanisms.
Software-Engineering Research Revisited
Authors: Colin Potts
Venue: IEEE Software (1993)

The author discusses three major changes that he suggests are occurring as a result of the software engineering industry adopting the industry-as-laboratory approach, in which researchers identify problems through close involvement with industrial projects and create and evaluate solutions in an almost indivisible research activity. This approach emphasizes what people actually do or can do in practice, rather than what is possible in principle. The three changes are a greater reliance on empirical definition of problems, an emphasis on real case studies, and a greater emphasis on contextual issues.
Future System-on-Silicon LSI Chips
Authors: Mitsumasa Koyanagi, Hiroyuki Kurino, Kang Wook Lee, Katsuyuki Sakuma, Nobuaki Miyakawa, Hikotaro Itani
Venue: IEEE Micro (1998)

A new three-dimensional (3D) integration technology to achieve system-on-silicon LSIs has been proposed. Several LSI wafers are vertically stacked and glued each other after thinning them in this 3D integration technology. Therefore, this technology can be considered as both 3D LSI technology and a wafer-scale 3D chip-on-chip packaging technology. Effective packing density can be significantly increased by stacking several chips in the vertical direction. In addition, a huge number of interconnections are formed through these stacked chips. Therefore, the chip-package co-design considering the 3D distribution of generated heat and the 3D routing of wirings becomes very important to realize 3D LSIs or 3D multichip modules (3D-MCMs) using this new integration technology. Various kinds of new system-on-silicon LSIs or system LSIs based on this 3D integration technology have been proposed. A real time microvision system has been described as a typical example of the systems realized by using this new 3D integration technology. Several key technologies for this 3D integration such as formation of buried interconnection and microbump, wafer thinning, wafer alignment and wafer bonding have been described.
An analytical high-level battery model for use in energy management of portable electronic systems
Authors: Daler N. Rakhmatov, Sarma B. K. Vrudhula
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Once the battery becomes fully discharged, a battery-powered portable electronic system goes off-line. Therefore, it is important to take the battery behavior into account. A system designer needs an adequate high-level model in order to make battery-aware decisions that target maximization of the system's lifetime on-line. We propose such a model: it allows a designer to predict the battery time-to-failure for a given load and provides a cost metric for lifetime optimization algorithms. Our model also allows for a tradeoff between the accuracy and the amount of computation performed. The quality of the proposed model is evaluated using a detailed low-level simulation of a lithium-ion electrochemical cell.
Voice transmission in an IEEE 802.11 WLAN based access network
Authors: Andreas Köpsel, Adam Wolisz
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

IEEE 802.11 contains a mechanism for transmission of data with realtime constraints known as Point Coordination Function. This supplementary medium access protocol resides on top of the basic medium access mechanism Distributed Coordination Function and uses a centralized polling approach. Due to the complexity of a PCF implementation and the predicted inefficiency of the PCF several proposals have been presented for providing QoS support without the need of a centralized scheduler. Those solutions suffer from the fact that they are shifting implementation complexity from the access point to the mobile nodes. In this paper we compare the suitability of the basic DCF and PCF protocols for the transmission of audio data in an interactive scenario. We show that a simple priority mechanism used on the mobiles as well as the access point is suitable for providing improved QoS in terms of band-width and without the need of an extended DCF protocol. In combination with the PCF an adequate delay characteristic for audio flows is achievable as well. To overcome the limitations in channel capacity caused by the PCF we suggest an implicit signaling scheme for improving the channel capacity by avoiding unsuccessful PCF polling attempts.
Implementation of the Exclusive-Or Function in a Hopfield Style Recurrent Network
Authors: Roelof Brouwer
Venue: Neural Processing Letters (1997)

It is well known that a perceptron cannot be used to implement the XOR function but that a feed forward network with some hidden neurons can. The purpose of this work is to show that a Hopfield style network can also be used to implement the XOR function. It is shown here that the XOR function can be implemented in a Hopfield style network using only two hidden neurons.
Unix and the Am29000 Microprocessor
Authors: Daniel Mann
Venue: IEEE Micro (1992)

Features that make the AM29000 a good Unix host are examined. The discussion covers the C calling sequence, context switching, system calls, interrupt handling, memory access protection, cache support, multiprocessor Unix, floating-point support, and system costs.
Distributed Belief Revision
Authors: Aldo Franco Dragoni, Paolo Giorgini
Venue: Autonomous Agents and Multi-Agent Systems (2003)

In this paper, a distributed approach to belief revision is presented. It is conceived as a collective activity of a group of interacting agents, in which each component contributes with its own local beliefs. The integration of the different opinions is performed not by an external supervisor, but by the entire group through an election mechanism. Each agent exchanges information with the other components and uses a local belief revision mechanism to maintain its cognitive state consistent. We propose a model for local belief revision/integration based on what we called: &ldquo;Principle of Recoverability.&rdquo; Computationally, our way to belief revision consists of three steps acting on the symbolic part of the information, so as to deal with consistency and derivation, and two other steps working with the numerical weight of the information, so as to deal with uncertainty. In order to evaluate and compare the characteristics and performance of the centralized and of the distributed approaches, we made five different experiments simulating a simple society in which each agent is characterized by a degree of competence, communicates with some others, and revise its cognitive state. The results of these experiments are presented in the paper.
A model of the Witt design W12 based on quadrics of PG(2,3)
Authors: Hans Havlicek
Venue: Discrete Mathematics (2002)

An elementary geometric proof for the existence of Witt's 5-(12, 6, 1) design is given.
Design and Analysis of a Scalable Cache Coherence Scheme Based on Clocks and Timestamps
Authors: S. L. Min, J. L. Baer
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A timestamp-based software-assisted cache coherence scheme that does not require any global communication to enforce the coherence of multiple private caches is proposed. It is intended for shared memory multiprocessors. The scheme is based on a compile-time marking of references and a hardware-based local incoherence detection scheme. The possible incoherence of a cache entry is detected and the associated entryis implicitly invalidated by comparing a clock (related to program flow) and a timestamp (related to the time of update in the cache). Results of a performance comparison, which is based on a trace-driven simulation using actual traces. between the proposed timestamp-based scheme and other software-assisted schemes indicate that the proposed scheme performs significantly better than previous software-assisted schemes, especially when the processors are carefully scheduled so as to maximize the reuse of cache contents. This scheme requires neither a shared resource nor global communication and is, therefore, scalable up to a large number of processors.
A Real-Time Video Decoder for Digital HDTV
Authors: Nam Ling, Nien-Tsu Wang
Venue: Journal of VLSI Signal Processing Systems (2003)

In this paper, an architecture for real-time digital HDTV video decoding is presented. Our architecture is based on a dual decoding datapath controlled in a fixed schedule with an efficient write-back scheme for anchor pictures. The decoding datapath is synchronized at the block (8 &times; 8 pixels) level. Unlike other decoding approaches such as the slice bar decoding method and the cross-divide method, our scheme reduces memory access contention problem to achieve real-time HDTV decoding without a high cost in overall decoder buffers, architecture, and bus. In comparison to data-flow approaches, our method eliminates the complexity associated with tagged data operations. Our anchor picture storage is organized to minimize page-breaks during memory accesses. Simulation shows that with a relatively low rate 81 MHz clock, our decoder can decode MPEG-2 MP@HL HDTV in real-time, based on an ATSC video format of 1,920 &times; 1,080 pixels/frame at 30 frames/s, at a bit rate of 18 to 20 Mbps.
Carbon nanotubes in interconnect applications
Authors: F. Kreupl, A. P. Graham, G. S. Duesberg, W. Steinhögl, M. Liebau, E. Unger, W. Hönlein
Venue: Microelectronic Engineering (2002)

Carbon nanotubes with their outstanding electrical and mechanical properties are suggested as an interconnect material of the future. In this paper we will introduce nanotubes, compare their electrical properties with equivalent metal wires made of gold and describe our progress in process integration. Multi-walled carbon nanotubes are grown on 6-inch wafers in a batch process. The resulting nanotubes are evaluated with respect to their conductance as single multiwalled nanotubes and in their implementation as interconnects in vias and contact holes.
Mixed hp-DGFEM for Incompressible Flows
Authors: Dominik Schötzau, Christoph Schwab, Andrea Toselli
Venue: SIAM Journal on Numerical Analysis (2002)

We consider several mixed discontinuous Galerkin approximations of the Stokes problem and propose an abstract framework for their analysis. Using this framework, we derive a priori error estimates for hp-approximations on tensor product meshes. We also prove a new stability estimate for the discrete divergence bilinear form.
Capturing Images with Digital Still Cameras
Authors: Shoji Kawamura
Venue: IEEE Micro (1998)

In general, there are two categories in digital still camera (DSC). One is the camera which uses a black box and lens of the camera with CCD (charge coupled device) back unit which has more than 3 million pixels. Its prise is normally more than $50 million. It is so called "professional / business use" digital camera. The another is the digital camera which uses CCD with more than 350 thousands and up to over 1 million pixels. This type of camera is so called "consumer use" digital camera. And later camera's market has been growing dramatically in last 3 years, because of its easy to handle and of its reasonable price for the picture quality. Herewith, I will explain image capturing system for "consumer use" type of DSC.
Toward Things That Think for the Next Millennium
Authors: Janet Wilson
Venue: Computer (2000)

It's hard to imagine that as few as 40 years ago, US economists were forecasting a crisis of leisure that would arise because of society's increased time savings from technology. As anyone who totes a laptop, cell phone, and pager can attest, technology seems to have overcomplicated life rather than uncomplicated it. Something has gone terribly awry in the way people and computers relate. If scientists like MIT professor Neil Gershenfeld have their way, however, the new millennium could bring a new order. Computers and information technology could come full circle, seeming to fade into the background--becoming almost transparent--even as they become all the more pervasive, useful, and powerful. The author examines Gershenfeld's research into how computers could change radically in the next millennium and what it will take to design them. The article covers possible future applications and limitations, the primary obstacle being the cost of chip production. Significant cost reduction is needed in chip production before revolutionary changes in applications can occur.
New multiscale transforms, minimum total variation synthesis: applications to edge-preserving image reconstruction
Authors: Emmanuel J. Candès, Franck Guo
Venue: Signal Processing (2002)

This paper describes newly invented multiscale transforms known under the name of the ridgelet (Appl. Comput. Harmonic Anal. 6 (1999) 197) and the curvelet transforms (In: Cohen et al. (Eds.), Curves and Surfaces, Vanderbilt University Press, Nashville, TN, 2000, pp. 105-120; Candès and Donoho available at http://www-stat.stanford.edu/donoho/Reports/1998/ curvelets.zip, 1999). These systems combine ideas of multiscale analysis and geometry. Inspired by some recent work on digital Radon transforms (Averbuch et al. available at http://www-stat.stanford.edu/~donoho/Reports/index.html), we then present very effective and accurate numerical implementations with computational complexities of at most N log N. In the second part of the paper, we propose to combine these new expansions with the Total Variation minimization principle for the reconstruction of an object whose curvelet coefficients are known only approximately: quantized, thresholded, noisy coefficients, etc. We set up a convex optimization problem and seek a reconstruction that has minimum Total Variation under the constraint that its coefficients do not exhibit a large discrepancy from the data available on the coefficients of the unknown object. We will present a series of numerical experiments which clearly demonstrate the remarkable potential of this new methodology for image compression, image reconstruction and image 'de-noising'.
Analysis of Camera Behavior During Tracking
Authors: Swarup Reddi, George Loizou
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

A camera is mounted on a moving robot and can rotate, relative to the robot, about two axes. We show how the optical flow field can be used to control the camera¿s motion to keep a target at the center of the camera¿s field of view, but that this is not always possible when the target lies close to the plane defined by the camera¿s two axes of rotation.When the target is held at the center of the camera¿s field of view, then the magnitude of the camera¿s angular velocity about one axis never exceeds the magnitude of the flow vector associated with the target, but the angular velocity about the other axis is dependent on the inverse distance of the target from this axis, and hence can become large as this distance becomes small. Situations, where the magnitudes of the camera¿s angular velocity and acceleration become large, are considered in the special case where the relative motion between the robot and its environment is purely translational. The tracking strategy is experimentally evaluated using computer-generated optical flow fields.