ppxscal/embedding_network huggingface dataset:
A specific floating-body effect in fully depleted SOI MOSFETs with ultra-thin gate Oxide
Authors: M. Cassé, J. Prétet, S. Cristoloveanu, T. Poiroux, C. Raynaud, G. Reimbold
Venue: Microelectronic Engineering (2004)

Transconductance measurements are performed on advanced fully depleted SOI MOSFETs and reveal a new floating-body effect. Gate tunneling current is responsible for the body charging and may lead to the onset of a strong second peak in front-gate transconductance. This effect occurs at low drain voltage and can be modulated by the back gate bias. We have investigated the size and the temperature (down to 100 K) dependence of the peak magnitude. A qualitative analytical model describes the onset and experimental behavior of the second transconductance peak.
Conceptual discrepancies and feedback in human-computer interaction
Authors: Robbert-Jan Beun, Rogier M. van Eijk
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

In this paper, we present a computational framework for the detection of conceptual discrepancies in human-computer interaction. The framework is developed as a basis for the generation of feedback utterances at the ontological level. In our method, presuppositions are extracted from the user's message, expressed in a common vocabulary, and compared with the system's ontology, which is expressed in type theory. Discrepancies are detected by the system if it notices type conflicts, particular inconsistencies or ontological gaps. Depending on the kind of discrepancy, the system generates a particular feedback message in order to establish alignment of its private ontology with the mental model of the user.
Dynamic Data-bit Memory Built-In Self- Repair
Authors: M. Nicolaidis, N. Achouri, S. Boutobza
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In modern SoCs, embedded memories occupythe largest part of the chip area and include an evenlarger amount of active devices. As memories aredesigned very tightly to the limits of the technology theyare more prone to failures than logic. Thus, theyconcentrate the large majority of defects and affect circuityield dramatically. Thus, Built-In Self-Repair is gainingsignificant importance. This work presents a dynamicmemory built-in self-repair schemer acting on the data-bitlevel. It allows reducing the size of the repairable units,or in other words, it allows using a single spare unit forrepairing faults affecting several regular units. As aconsequence, it repairs multiple faults by means of lowhardware cost.
Efficient mining of both positive and negative association rules
Authors: Xindong Wu, Chengqi Zhang, Shichao Zhang
Venue: ACM Transactions on Information Systems (TOIS) (2004)

This paper presents an efficient method for mining both positive and negative association rules in databases. The method extends traditional associations to include association rules of forms A &rArr; &not; B, &not; A &rArr; B, and &not; A &rArr; &not; B, which indicate negative associations between itemsets. With a pruning strategy and an interestingness measure, our method scales to large databases. The method has been evaluated using both synthetic and real-world databases, and our experimental results demonstrate its effectiveness and efficiency.
An investigation on technologies to fabricate magnetic microcomponents for miniaturized actuator systems
Authors: T. Budde, M. F&#x00f6;hse, B. Majjer, H. L&#x00fc;thje, G. Br&#x00e4;uer, H. H. Gatzen
Venue: Microsystem Technologies (2004)

Soft magnetic yokes, cores, and poles, as well as permanent magnets are the potential magnetic components of an electromagnetic microactuator system. Depending on the requirements of the actuator, soft magnetic materials, hard magnetic materials or a combination of both have to be applied. Their design and fabrication as well as their integration into coil systems is one aspect of the Collaborate Research Center &#x201c;Design and Fabrication of Active Microsystems&#x201d; (Sonderforschungsbereich 516). The investigations presented in this paper cover alternative technologies for depositing various magnetic materials as well as their capability of being utilized for fabricating electromagnetic Microsystems. In the area of soft magnetic materials, the application of NiFe (Permalloy) in various compositions was investigated. Technologies utilized for their deposition were electroplating, sputtering, and gas flow sputtering. For fabricating rather thick soft magnetic micro structures with heights of up to 70 &#x03bc;m, electroplating is particularly well suited. In the area of hard magnetic materials, sputtering was applied for depositing Samarium-Cobalt (SmCo). Hereby, layers with a thickness of up to 50 &#x03bc;m with very good hard magnetic properties were deposited and patterned using wet chemical etching.
Area Efficient, Low Power and Robust Design for Add-Compare-Select Units
Authors: Mohammad K. Akbari, Ali Jahanian, Mohsen Naderi, Bahman Javadi
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents an area efficient, low-power and robust ACS unit for Viterbi Decoder in two synchronous and asynchronous architectures. The asynchronous design is based upon Quasi Delay Insensitive (QDI) timing model which leads to a robust and low power purpose and synchronous architecture uses a hybrid CMOS-Pseudo NMOS technology to improve area and throughput factors. Some optimization techniques to reduce the power and area are applied to each design. The simulation results show the asynchronous design has the lowest power consumption with 6.65mW and hybrid CMOS has the lowest transistor counts with 759 in relative to other reported circuits.
Temperely-Lieb Algebras and the Four-Color Theorem
Authors: Louis Kauffman, Robin Thomas
Venue: Combinatorica (2003)

The Temperley&#x2013;Lieb algebra Tn with parameter 2 is the associative algebra over Q generated by 1,e0,e1, . . .,en, where the generators satisfy the relations $$e^{2}_{i} = 2e_{i} ,{\kern 1pt} {\kern 1pt} e_{i} e_{j} e_{i} = e_{i}$$ if |i&#x2212;j|=1 and eiej=ejei if |i&#x2212;j|&#x2265;2. We use the Four Color Theorem to give a necessary and sufficient condition for certain elements of Tn to be nonzero. It turns out that the characterization is, in fact, equivalent to the Four Color Theorem.
The Application of Virtual Reality to ( Chemical Engineering ) Education
Authors: John T. Bell, H. Scott Fogler
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

Virtual reality, VR, offers many benefits totechnical education, including the delivery ofinformation through multiple active channels, theaddressing of different learning styles, andexperiential-based learning. This poster presentswork performed by the authors to apply VR toengineering education, in three broad project areas:Virtual chemical plants, virtual laboratory accidents,and a virtual UIC campus. The first area providesguided exploration of domains otherwise inaccessible,such as the interior of operating reactors andmicroscopic reaction mechanisms. The secondpromotes safety by demonstrating the consequences ofnot following proper lab safety procedures. And thethird provides valuable guidance for (foreign)visitors. All programs developed are available on theweb, for free download to any interested parties.
Gate-Oxide grown on the sidewalls and base of a U-shaped Si trench: effects of the Oxide and Oxide/Si interface condition on the properties of vertical MOS devices
Authors: S. A. Suliman, O. O. Awadelkarim, R. S. Ridley, G. M. Dolny
Venue: Microelectronic Engineering (2004)

We report on the SiO2/Si interface condition and on its high electric field stress reliability in U-shaped trench gated metal-oxide-silicon (MOS) structures. The interface state density measured is ∼1011 eV-1 cm-2, and using deep level transient spectroscopy the Pb center is found to be the dominant interface defect. The degradation induced by electrical stressing is examined using changes in the charge pumping current in a U-trench-gated transistor. It is shown that the SiO2/Si interface at the bottom corners of the trench is the weakest region in the MOS structure.
From the Editors: P ≠ NP
Authors: Francis Sullivan
Venue: Computing in Science and Engineering (2004)

When and if the statement in the title is proved, the person who proves it will win a million dollars and become an instant megastar. He or she will certainly appear on the front page of The New York Times and should expect invitations from late-night talk shows and to be the subject of a PBS Nova special. For a long time a very long time this fundamental open question about the relationship between P and NP has been the large white hippo blocking the main hallway of the Academy of Complexity Theory.
Properties of &#x211b;-Sausages
Authors: Badri Toppur, J. MacGregor Smith
Venue: Discrete Computational Geometry (2004)

This paper is concerned with the Steiner ratio. A number of properties about the structure of the flat sausage and &#x211b;-Sausage convex polytopes yielding the best Steiner ratio in two- and three-dimensional Euclidean space, and the topology of the Steiner Minimal Tree for the corresponding vertex sets, are presented.
A Sum-over-Paths Impulse-Response Moment-Extraction Algorithm for IC-Interconnect Networks: Verification, Coupled RC Lines
Authors: Y. L. Le Coz, D. Krishna, D. M. Petranovic, W. M. Loh, P. Bendix
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We have created a stochastic impulse-response (IR) moment-extractionalgorithm for RC circuit networks. It employs anewly discovered Feynman Sum-over-Paths Postulate. Fullparallelism has been preserved. Numerical verification resultsfor coupled RC lines confirmed rapid convergence. We believethis algorithm may find useful application in massively coupledelectrical systems, such as those encountered in high-enddigital-IC interconnects.
Distributed prototyping from validated specifications
Authors: David Hansel, Rance Cleaveland, Scott A. Smolka
Venue: Journal of Systems and Software (2004)

We present vpl2cxx, a translator that automatically generates efficient, fully distributed C++ code from high-level system models specified in the mathematically well-founded VPL design language. As the Concurrency Workbench of the New Century (CWB-NC) verification tool includes a front-end for VPL, designers may use the full range of automatic verification and simulation checks provided by this tool on their VPL system designs before invoking the translator, thereby generating distributed prototypes from validated specifications. Besides being fully distributed, the code generated by vpl2cxx is highly readable and portable to a host of execution environments and real-time operating systems (RTOSes). This is achieved by encapsulating all generated code dealing with low-level interprocess communication issues in a library for synchronous communication, which in turn is built upon the adaptive communication environment (ACE) client-server network programming interface. Finally, example applications show that the performance of the generated code is very good, especially for prototyping purposes. We discuss two such examples, including the RETHER real-time Ethernet protocol for voice and video applications.
An assistive technology project for an HCI course
Authors: Blaise W. Liffick
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This presentation describes a project for a standard undergraduate human-computer interaction (HCI) course that incorporates issues related to users who are disabled. It is part of the 2-year project "Integrating Assistive Technology into an Undergraduate Computer Science Curriculum from an HCI Approach," funded by the National Science Foundation.
SIMOB: a portable toolbox for observation of SIMULA executions
Authors: Knut Barra, Hans Petter Dahle
Venue: Proceedings of the symposium on High-level debugging (1983)

To reason correctly over what is happening during an execution is often hard just by looking at the program text. To assist programmers and others to understand what really is going on, a portable tool for observation of SIMULA executions has been designed at the Norwegian Computing Center. In this article the S-PORT project and the main features of the tool are described.
Managing the programming tail
Authors: Lindsey Ford
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

We describe a way of dealing with those students in a class learning programming that are unable to keep up with the rest.
Operating Mechanism for Device Cooperative Content on Ubiquitous Networks
Authors: Yutaka Kidawara, Koji Zettsu
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

We propose an operating mechanism for Device CooperativeContent, which is a concept to provide new content onubiquitous networks. There are two types of Device CooperativeContent. The first is temporal synchronizing contentand the second is semantical synchronizing content. Therefore,the content operation mechanism consists of two typesof cooperative operation. Device Cooperative Playing playsvarious content synchronously after distributing user profileinformation to other accessible devices in setting up a cooperativeplaying environment. Device Cooperative Browsingis an interactive method, which can be used to browse relatedcontent for being content watched.Both operation mechanisms are based on multi-deviceoperation, which are connected to a peer-to-peer network;the former operates cooperatively to find its own interestsand maintains these around itself, the latter is a synchronousmulti-device player. Multi-devices sharing commoninformation might have common interest topics on varioususer devices.When new devices are connected to the environment,they detect suitable information through filtering, and obtainthis from other devices on a local ubiquitous network.We describe this concept and discuss the Device CooperativeSMIL Player and WebBoard, which are implementationsof our concept.
Operational specification as the basis for rapid prototyping
Authors: Robert M. Balzer, Neil M. Goldman, David S. Wile
Venue: ACM SIGSOFT Software Engineering Notes (1982)

This paper describes a set of freedoms which both simplify the task of specifing systems and make the resulting specification more comprehensible. These freedoms eliminate the need, in specific areas, to consider: the mechanisims for accomplishing certain capabilities, the careful coordination and integration of separate operations, the costs of those operations, and other detailed concerns which characterize implementation.These freedoms are partitioned into the areas of efficiency, method, and data, and providing them has resulted in a novel formal specification language, Gist. The main features of this language are described in terms of the freedoms it affords. An overview of the language is then presented together with an example of its use to specify the behavior of a real system.
Compact name-independent routing with minimum stretch
Authors: Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a Õ(√n) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the shortest paths. This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(√n) space per node.
Small-scale software components
Authors: James E. Emery
Venue: ACM SIGSOFT Software Engineering Notes (1979)

An empirical study to identify standardizable small-scale software components from existing source code is described. The rationale for such an effort is presented, followed by a description of the specific study performed by the author. Component identification methods are presented along with preliminary findings. Future identification efforts and possible notational schemes are also discussed.
The document as an ergodic markov chain
Authors: Eduard Hoenkamp
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In recent years, statistical language models are being proposed as alternative to the vector space model. Viewing documents as language samples introduces the issue of defining a joint probability distribution over the terms.The present paper models a document as the result of a Markov process. It argues that this process is ergodic, which is theoretically plausible, and easy to verify in practice.The theoretical result is that the joint distribution can be easily obtained. This can also be applied for search resolutions other than the document level. We verified this in an experiment on query expansion demonstrating both the validity and the practicability of the method. This holds a promise for general language models.
Filtering Location Stream in Moving Object Database
Authors: Xiulan Yu, Ying Chen, Fanyan Rao, Dong Liu
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

One of the challenges to build a high performance Moving Object Database (MOD) is how to efficiently process the location stream which are inserted at a high rate beyond the tolerance of database, while location accuracy needs to be preserved. Based on CAMEL, an MOD prototype implemented in IBM China Research Lab, we present the location filter module and integrate it into the CAMEL to address the issue. The proposed location filter includes two components: the on-line location filter to filter the location stream online by filtering algorithm plug-ins, and the temporal location manager to insert location data into database at an acceptable insertion rate. An enhanced adaptive location stream filtering algorithm (ALSF) based on the mobility pattern of moving objects, as well as several other filtering algorithms, are also introduced. Experiments with the simulated data show the performance advantage of the enhanced ALSF algorithm.
Pseudorandom number generation based on controllable cellular automata
Authors: Sheng-Uei Guan, Shu Zhang
Venue: Future Generation Computer Systems (2004)

A novel cellular automata (CA)--controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudo-random number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (ID) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of ID CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.
ERP in China: one package, two profiles
Authors: Maris G. Martinsons
Venue: Communications of the ACM (2004)

How and why the same software system implementation can produce fundamentally different results.
Characterization of queue fluctuations in probabilistic AQM mechanisms
Authors: Peerapol Tinnakornsrisuphap, Richard J. La
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

We develop a framework for studying the interaction of a probabilistic active queue management (AQM) algorithm with a generic end-user congestion-control mechanism. We show that as the number of flows in the network increases, the queue dynamics can be accurately approximated by a simple deterministic process. In addition, we investigate the sources of queue fluctuations in this setup. We characterize two distinct sources of queue fluctuations; one is the deterministic oscillations which can be captured through the aforementioned deterministic process. The other source is the random fluctuations introduced by the probabilistic nature of the marking schemes. We discuss the relationship between these two types of fluctuations and provide insights into how to control them. Concrete examples in this framework are given for several popular algorithms such as Random Early Detection, Random Early Marking and Transmission Control Protocol.
A Variational Ecological-Type Optimization of Some Thermal-Engine Models
Authors: L. A. Arias-Hernández, G. Ares De Parga, F. Angulo-Brown
Venue: Open Systems Information Dynamics (2004)

In a recent work [23] we have analyzed a nonendoreversible thermal engine model under two maximization criteria: the maximum power regime and the so-called ecological criterion. In the present work, we extend the study of the same class of nonendoreversible models, but by using the so-named generalized ecological criterion [15]. This criterion is based on a family of ecological-type functions depending on a parameter associated to the particular heat transfer law used in the engine model. By means of this criterion we find a simplification of some of the results obtained in [23] by using both conventional and variational calculus. Besides, we propose a simple procedure to calculate the parameter involved in the generalized ecological function.
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Authors: Gurmeet Singh Manku, Moni Naor, Udi Wieder
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation networks. In each of these networks, a node has out-degree Θ(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. We establish lower-bounds for greedy routing for these networks, and analyze Neighbor-of-Neighbor (NoN)-greedy routing. The idea behind NoN, as the name suggests, is to take a neighbor's neighbors into account for making better routing decisions.The following picture emerges: Deterministic routing networks like hypercubes and Chord have diameter Θ(log n) and greedy routing is optimal. Randomized routing networks like randomized hypercubes, randomized Chord, and constructions based on small-world percolation networks, have diameter Θ(log n / log log n) with high probability. The expected diameter of Skip graphs is also Θ(log n / log log n). In all of these networks, greedy routing fails to find short routes, requiring Ω(log n) hops with high probability. Surprisingly, the NoN-greedy routing algorithm is able to diminish route-lengths to Θ(log n / log log n) hops, which is asymptotically optimal.
Motion Blending for Real-Time Animation while Accounting for the Environment
Authors: Stephane Menardais, Franck Multon, Richard Kulpa, Bruno Arnaldi
Venue: Proceedings of the Computer Graphics International (2004)

Using motion capture systems to animate human-likefigures still remains difficult when the movementsare complex or need to be adapted to geometricconstraints. We propose a new method to blendseveral captured movements while adapting thetrajectories to new skeletons and to unknownenvironments. For each body part (considered asresources), a priority is defined for each movement(considered as consumers). The trajectories appliedto the skeleton consist of a weighted sum of themotions trajectories. A new technique to compute theweights is proposed. Finally, the system adapts theresulting trajectories to the synthetic skeleton and tothe environment. The results enabled to animate upto one hundred actors in interactive environments.