ppxscal/embedding_network huggingface dataset:
Active Wearable Vision Sensor: Recognition of Human Activities and Environments
Authors: Kazuhiko Sumi, Akihiro Sugimoto, Takashi Matsuyama, Masato Toda, Sotaro Tsukizawa
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

To realize a symbiotic relationship between humans andcomputers, it is crucial to estimate the external and internalstate of the human by observation. One promising approachis to acquire the same visual information as the human acquires.In this paper, we introduce our wearable vision sensor,which is equipped with a pair of active stereo camerasand a gaze-direction detector. From the visual informationobtained by the wearable vision sensor, we present three basicthree functionalities: a 3D gaze point detection and imageretrieval, a 3D digitization of a hand-held object, andthe measurement of a walking trajectory.
SILCA: Fast-Yet-Accurate Time-Domain Simulation of VLSI Circuits with Strong Parasitic Coupling Effects
Authors: Zhao Li, C.-J. Richard Shi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We propose a new circuit analysis method, namelySemi-Implicit Linear-Centric Analysis (SILCA), for efficientSPICE-accurate transient simulation of deep-submicron VLSIcircuits with strong parasitic coupling effects introduced byinterconnect lines, common substrate, power/ground networks, etc.SILCA is based on two linear-centric techniques. First, a new semi-implicititerative numerical integration scheme is developed, whichapplies dynamic time step control accounting for stiff systems andmeanwhile keeps constant equivalent conductance forcapacitor/inductor companion models. Its convergence and stabilityproperties are characterized. Second, to achieve constant linearizedconductance for nonlinear devices during nonlinear iterationprocess, a successive variable chord method is introduced as analternative of the Newton-Raphson method and the rank-one updatetechnique is implemented for fast LU factorization. With thesetechniques, SILCA reduces the number and cost of required LUfactorizations dramatically. Experimental results on substrate andpower/ground networks have demonstrated that SILCA yieldsSPICE-like accuracy with an over 80X reduction in LUfactorization cost, and an about 20X overall CPU time speedup overSPICE3 for circuits with tens of thousands elements, and theefficiency increases further with the size of a circuit.
Integrated environments
Authors: Insup Lee
Venue: ACM SIGPLAN Notices (1983)

The session on debugging in integrated environments started with Fairley's characterization of integrated environments as follows: (1) versatile collection of analysis, design, implementation, testing, and maintenance tools; (2) consistent user interface among the tools; (3) common representation of information (e.g., Stoneman's database model, Unix pipe); (4) history/version control/configuration management capability; and (5) encouragement of good practice. He then asked the audience the following questions: (1) what is your view of environments? (2) what possibilities exist for debugging in integrated environments that do not exist in a mere collection of tools? (3) what is the difference between high--level debugging and low--level debugging with high--level tools?
Low-Latency Hard Real-Time Communication over Switched Ethernet
Authors: Jork Loeser, Hermann Haertig
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Ethernet, the most widely used commodity network, increasinglymoves toward switches as implementation technologythus replacing busses. This allows to use trafficshaping techniques to implement hard real-time distributedsystems on commodity networks. However, because Ethernetswitches lack build-in policing features, nodes connectedby Switched Ethernet need to be cooperative. Althoughthe theory behind traffic shaping for real-time communicationis known for some time, it has not been consideredfor Ethernet so far.In this paper we present the implementation of trafficshaping on Switched Ethernet technology. We make thoroughexperiments to understand the cost and practical limitsof using Fast and Gigabit Ethernet for hard real-timecommunication. We do measurements to analyze propertiesof switches and delays that we can achieve using theseswitches. We further analyze the influences of non real-timeLinux nodes sharing the network.
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
Authors: Amitava Datta
Venue: The Journal of Supercomputing (2004)

We present several fast algorithms for multiple addition and prefix sum on the Linear Array with a Reconfigurable Pipelined Bus System (LARPBS), a recently proposed architecture based on optical buses. Our algorithm for adding N integers runs on an N log M-processor LARPBS in O(log* N) time, where log* N is the number of times logarithm has to be taken to reduce N below 1 and M is the largest integer in the input. Our addition algorithm improves the time complexity of several matrix multiplication algorithms proposed by Li, Pan and Zheng (IEEE Trans. Parallel and Distributed Systems, 9(8):705&ndash;720, 1998). We also present several fast algorithms for computing prefix sums of N integers on the LARPBS. For integers with bounded magnitude, our first algorithm for prefix sum computation runs in O(log log N) time using N processors and in O(1) time using N1+&epsiv; processors, for \frac{1}{3} &le; &epsiv; < 1. For integers with unbounded magnitude, the first algorithm for multiple addition runs in O(log log N log* N) time using N log M processors, when M is the largest integer in the input. Our second algorithm for multiple addition runs in O(log* N) time using N1+&epsiv; log M processors, for \frac {1}{3} &le; &epsiv; < 1. We also show suitable extensions of our algorithm for real numbers.
On the existence of rook equivalent t-cores
Authors: Jaclyn Anderson
Venue: Journal of Combinatorial Theory Series A (2004)

For a positive integer t, a partition is said to be a t-core if each of the hook numbers from its Ferrers-Young diagram is not divisible by t. In 1998, Haglund et al. (J. Combin. Theory Ser. A 84 (1) (1998) 9) proved that if t = 2, 3, or 4, then two distinct t-cores are rook equivalent if and only if they are conjugates. In contrast to this theorem, they conjectured that if t ≥ 5, then there exists a constant N(t) such that for every positive integer n ≥ N(t), there exist two distinct rook equivalent t-cores of n which are not conjugate. Here this conjecture is proven for t ≥ 12 with N(t) = 4 in all cases.
On the Fundamental Capacity and Lifetime Limits of Energy-Constrained Wireless Sensor Networks
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Energy constraints on sensor nodes pose significantchallenges towards extending operational lifetimes and sustainablecapacities of wireless sensor networks. In this paper, we seekto answer two fundamental questions with respect to energy-constrainedsensor networks. First, what is the operationallifetime of a particular wireless sensor network under the controlof optimal power management schemes? With an adequatedefinition of operational lifetimes, our asymptotic analysis showsthat, with fixed node densities, operational lifetime of sensornetworks decreases in the order of 1/n as the number of initiallydeployed nodes n grows. Second, what is the impact of constrainedenergy levels on the maximum sustainable throughputin sensor networks? Even with renewable energy sources oneach of the sensors (e.g., solar energy sources), our analysisconcludes that the maximum sustainable throughput in energy-constrainedsensor networks scales worse than the capacity basedon interference among concurrent transmissions as long as thephysical network size grows with n in the order greater thanlog n. In this case, when the number of nodes is sufficiently high,the energy-constrained network capacity dominates.
Quantum algorithms a decade after shor
Authors: Andris Ambainis
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

In 1994, Peter Shor discovered a polynomial time quantum algorithm for factoring and discrete logarithm. Two years later, in 1996, Lov Grover discovered a search algorithm which is quadratically better than conventional search. By now, each of the two algorithms has developed into a line of research which goes well beyond the original algorithm. Shor's algorithm has inspired the study of quantum Fourier sampling which has resulted in more quantum algorithms for number-theoretic and group-theoretic problems. Grover's algorithm has developed into the area of quantum query algorithms.I will survey the developments in quantum query algorithms. The topics will include: applications of Grover's algorithm to element distinctness and other problems, lower bounds on quantum algorithms and the use of quantum random walks to design better search algorithm. I will also describe how some of techniques in this area can be used as "quantum black boxes" in an otherwise classical algorithm.
Didactic strategies for promoting significant learning in formal languages and automata theory
Authors: Carlos I. Chesñevar, Maria P. González, Ana G. Maguitman
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

An undergraduate course in Formal Languages and Automata Theory (FLAT) involves different topics that are core to the CS curricula and whose level of abstraction makes them difficult both to teach and to learn. Such difficulty stems from the complexity of the abstract notions involved and the required mathematical background. Surveys conducted among our students showed that many of them were applying some theoretical concepts mechanically rather than developing a significant learning of them, leading to a lack of motivation and interest. To cope with this problem, we introduced a number of didactic strategies based on a constructivist approach. The main aim of the proposed strategies is to promote a more significant learning of several important FLAT topics.
Imaged-Based 3D Face Modeling
Authors: Mandun Zhang, Linna Ma, Xiangyong Zeng, Yangsheng Wang
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In this paper, we present an image-based 3D face modeling algorithm. Different from traditional complex stereo vision procedure, our new method needs only two orthogonal images for fast 3D modeling without any camera calibration. The proposed method has two steps. Firstly according to MPEG-4 protocol for 3D face structure, we appoint and deform feature points by Radial Basis functions (RBF) in the input images corresponding to the generic model. Then the texture mapping is carried out with regard to different directional projections. The experiments demonstrate that our new algorithm can photo- realistically render 3D face with very limited computation.
Trust Based Incentive in P2P Network
Authors: YangBin Tang, HuaiMin Wang, Wen Dou
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In the world of Internet technologies, Peer-to-Peer (P2P) computing is currently receiving considerable interest. However, as experience with P2P networks such as Gnutella shows, the selfish behaviors of peers may lead to serious problems of P2P network, such as Free-riding and Tragedy of Commons. In order to solve these problems, there are increasingly considerations on incentive design in the study of P2P systems. In this paper, we give a brief survey of researches on trust based incentive in P2P network. By investigating the reputation systems in P2P networks, we outline some key issues within the design of trust based incentive in P2P networks. After that we introduce some other approaches addressing the incentive of P2P networks and conclude the paper with a summary and discussion on future research.
Data streaming algorithms for efficient and accurate estimation of flow size distribution
Authors: Abhishek Kumar, Minho Sung, Jun (Jim) Xu, Jia Wang
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

Knowing the distribution of the sizes of traffic flows passing through a network link helps a network operator to characterize network resource usage, infer traffic demands, detect traffic anomalies, and accommodate new traffic demands through better traffic engineering. Previous work on estimating the flow size distribution has been focused on making inferences from sampled network traffic. Its accuracy is limited by the (typically) low sampling rate required to make the sampling operation affordable. In this paper we present a novel data streaming algorithm to provide much more accurate estimates of flow distribution, using a "lossy data structure" which consists of an array of counters fitted well into SRAM. For each incoming packet, our algorithm only needs to increment one underlying counter, making the algorithm fast enough even for 40 Gbps (OC-768) links. The data structure is lossy in the sense that sizes of multiple flows may collide into the same counter. Our algorithm uses Bayesian statistical methods such as Expectation Maximization to infer the most likely flow size distribution that results in the observed counter values after collision. Evaluations of this algorithm on large Internet traces obtained from several sources (including a tier-1 ISP) demonstrate that it has very high measurement accuracy (within 2%). Our algorithm not only dramatically improves the accuracy of flow distribution measurement, but also contributes to the field of data streaming by formalizing an existing methodology and applying it to the context of estimating the flow-distribution.
Content-based Medical Image Retrieval (CBMIR): An Intelligent Retrieval System for Handling Multiple Organs of Interest
Authors: Paul Miki Willy, Karl-Heinz Kufer
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

A medical image usually contains images of several organs, with each organ being unique.It is a prerequisite for a physician to attentively examine more than one organ, so-called organs of interest. In this paper, we present an experimental design of an intelligent Content-based Medical Image Retrieval (CBMIR) for handling multiple organs of interest through three main processes. First, CBMIR identifies all such organs by comparing the images directly using the Hausdorff distance to the single, healthy organs stored in an organ database. After that, CBMIR builds image classes using neural networks and, finally, recognizes the proper class for a query image using a multicriteria optimization approach.
Rapid prototyping workshop: overview
Authors: Stephen L. Squires, Marvin Zelkowitz, Martha Branstad
Venue: Proceedings of the workshop on Rapid prototyping (1982)

The Second Software Engineering Symposium was sponsored by ACM SIGSOFT, the IEEE Computer Society Technical Committees on Software Engineering and VLSI, and the National Bureau of Standards. Martha Branstad of the National Bureau of Standards and Marvin Zelkowitz of the University of Maryland were General Cochairmen, and Stephen L. Squires of the National Security Agency was the Program Chairman.
A Simplified Approach to User Controllable Threshold Signatures
Authors: Jong-Phil Yang, Sang Uk Shin, Kyung-Hyune Rhee
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Threshold signature scheme typically assumes that the shared signing function can only be activated by a quorum number of servers. Therefore, it is inappropriate for settings where an organization employs some servers for a threshold protection of its private signing function. That is, if anyone has a power to activate the signing function of servers, he can easily compute valid signatures for specific organization without knowing the secret private key. In this paper, we present a model of threshold signature scheme that the user possesses the controllability to activate his private signing functions and the secret private key is shared among several servers. Moreover, our scheme is applicable to both discrete-log based threshold signatures and RSA based threshold signatures.
Finding Cancer Biomarkers from Mass Spectrometry Data by Decision Lists
Authors: Jian Liu, Ming Li
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Finding accurate biomarkers is key to early diagnosis of many otherwise incurable diseases. We study the problem of finding biomarkers for mass spectrometry (SELDI-TOF) spectra from cancerous and normal tissues. In contrast to the common practice of using vague methods, such as genetic algorithms, or un-interpretable (as biomarker) methods, such as SVM, we looked for a method that is simple, intuitive, interpretable, usable, and more accurate. We introduce decision-lists to this domain. Our experiments on clinical cancer datasets show decision lists give more accurate results than other methods. More interestingly, the resulting decision lists are more interpretable, for possible causal relationship between cancer and differentially expressed proteins, and directly usable in clinical biomarker design.
FROSTY: A Fast Hierarchy Extractor for Industrial CMOS Circuits
Authors: Lei Yang, C.-J. Richard Shi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper presents FROSTY, a computer programfor automatically extracting the hierarchy of a large-scale digitalCMOS circuit from its transistor-level netlist description and alibrary of subcircuits. To handle the complexity of industrialcircuits, FROSTY combines traditional structural recognition andpattern matching methods into a two-step extraction process.First, gate structures based on channel-connected-components arerecognized from a circuit netlist and library subcircuits. Thenannotated graphs representing the connectivity and properties ofgate structures are constructed. Comparing to transistor-levelnetlists, these graphs are much smaller in size, moredistinguishable in structure, and are thus more suitable forlabeling based pattern matching. An efficient pattern matchingalgorithm is applied to extract the circuit hierarchy from thesecondensed circuit graphs. FROSTY has been demonstrated to beorders of magnitude faster than the best known extractionprogram SubGemini, capable of extracting the entire hierarchy ofindustrial designs with several hundred thousand transistors in afew minutes on a Sun workstation. Further FROSTY is scale withthe size of a circuit.
Exploring semantics of movement in context
Authors: P. Y. Chao, I. Cimen, W. Lancee, S. A. M. Offermans, R. Veenstra
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

Industrial Design is concerned with the design of intelligent products and services. When designing these products and services, emotional mediation could be a key aspect in intelligent behavior [2]. In the field of industrial design not much attention has been paid to expressing emotions through movement. Because of this the potency of movement as message carrier and the language of movement were the topic of research. This evoked two questions: Does the addition of movement to objects enrich/enforce the emotional message of the objects? How does a context influence the emotional message of an object?In order to find the answer to these two questions, five vending machines were built. These machines were expressive in their movement and were meant for a specific context. The objects were created using the following idea generation techniques: collages, acting out, tinkering and 4D Sketching [1]. Finally a user test was committed to measure the strength of the message with and without movement. The difference between the strength of the message when the object is in its context and when it is not, was also tested.The result of this test shows an apparent relation between the addition of movement to a static object and an increase of the strength of its emotional message. The presence of the moving object in its accompanying context does not have a relation, which is as apparent as the addition of movement. One must say though that the addition of a context and movement to an object still has a significant effect, showing that the presence of a context certainly hasn't got negative effects. With the results of this research, hopefully attention will be drawn to the importance of movement in objects that mediate a certain message.
Clinical Applications of Handheld Computers
Authors: Michael A. Grasso
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

As the healthcare industry continues to become more distributed, healthcare organizationsare increasing their reliance on mobile links to access patient information and to update theirmaster database at the point of care. Handheld computers have evolved into a viable platform for these systems. While initial projects have shown promise, several questions remain. This article explores the unique characteristics of handheld computers with respect to user interface design and wireless access, and introduces a prototype development effort.
The role of structural reflection in distributed Virtual Reality
Authors: Paul Okanda, Gordon Blair
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

The emergence of collaborative virtual world applications that run over the Internet has presented Virtual Reality (VR) application designers with new challenges. In an environment where the public internet streams multimedia data and is constantly under pressure to deliver over widely heterogeneous user-platforms, there has been a growing need that distributed virtual world applications be aware of and adapt to frequent variations in their context of execution. In this paper, we argue that in contrast to research efforts targeted at improvement of scalability, persistence and responsiveness capabilities, much less attempts have been aimed at addressing the flexibility, maintainability and extensibility requirements in contemporary Distributed VR applications. We propose the use of structural reflection as an approach that not only addresses these requirements but also offers added value in the form of providing a framework for scalability, persistence and responsiveness that is itself flexible, maintainable and extensible.
An Approach to XML-Based Knowledge Representation and Its Application in Dynamic E-Business
Authors: Hua Zhu, Jun-Hua Xu, Xiao-Feng Ji
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Based on the traditional ways of knowledge representation, we propose an XML-based approach of knowledge representation, namely KTML. Via XML technology, knowledge could be transformed into structured-documents and thus knowledge-based technique could be applied into E-business model with Agent and Web service architecture. It will make next generation E-business platform more intelligent, dynamic and integrated.