ppxscal/embedding_network huggingface dataset:
Mixed Synchronous/Asynchronous State Memory for Low Power FSM Design
Authors: Cao Cao, Bengt Oelmann
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Finite state machine (FSM) partitioning proves effective for power optimization. In this paper we propose a design model based on mixed synchronous/asynchronous state memory that results in implementations with low power dissipation and low area overhead for partitioned FSMs. The state memory here is composed of the synchronous local state memory and asynchronous global state memory, where the former is used to distinguish the states inside a sub-FSM, and the latter is responsible for controlling sub-FSM communication. The input and output behaviour of the decomposed FSM is cycle by cycle equivalent to the undecomposed synchronous FSM. Together with clock gating technique, substantial power reduction can be demonstrated.
NcML-G{ML}: Encoding NetCDF Datasets Using GML
Authors: S. Nativi, J. Caron, B. Domenico
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we describe the NcML-G{ML}: an extension of the NetCDF Markup Language (NcML). Such extension allows to encode NetCDF dataset resorting to GML 3.0 elements.It was conceived to facilitate the interoperability between the Atmospheric Science and the GIS Communities: NcML-G{ML} leverages the NcML effectiveness for encoding multi-dimensional arrays, encoding geo-metadata in GML. The abstract and the general content model which lead to the NcML-G{ML} are described.
Dia de los Muertos
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

"Dia de 10s Muertos" (Day of the Dead) captures the beauty, mystery and sacredness of the ancient Meso-American holiday that honors and remembers those who have died. Combining stop-motion and CG characters, miniatures, digital backgrounds and FX, Kirk Kelley creates a richly layered world that blurs the boundaries separating the living from the dead. Dynamic camera angles and lively music enhance the subtle, stylized performances of the living characters and the frenzied action of the spirits. Copyright held by creator.
Multilinear Jacobians for isoparametric planar elements
Authors: K. E. Barrett
Venue: Finite Elements in Analysis and Design (2004)

A systematic procedure is developed for analysing the Jacobians of planar finite elements. Conditions are derived for the Jacobians to be linear or multilinear in the two isoparametric coordinates. For the case of the 6-noded triangle a complete geometrical description is given of elements which have a positive linear or quadratic Jacobian. Some partial geometrical results are also given for the eight-noded quadrilateral and the cubic triangle. Numerical examples involving the solution of Laplace's equation compare results obtained by using exactly and non-exactly integrable elements near curved boundaries.
On the achievements of high school students studying computational models
Authors: Michal Armoni, Judith Gal-Ezer
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a theoretical unit on computational models. It includes deterministic and non-deterministic finite automata, regular and non-regular languages, closure properties of regular languages, pushdown automata, closure properties of context free languages, Turing machines, the Church-Turing thesis and the halting problem. This paper focuses on part of a study we conducted dealing with the achievements of high school students studying this unit. Specifically, this paper compares the achievements of students on the technical parts of this unit vs. its theoretical parts. We also examine the correlation between achievements of students studying the Computational Models unit, and two other factors: The students' previous computer-related background (not necessarily computer science) and the level on which they studied mathematics.
The 4th international workshop on multimedia data mining (MDM/KDD2003)
Authors: Valery A. Petrushin, Anne Kao, Latifur Khan
Venue: ACM SIGKDD Explorations Newsletter (2004)

In this short report we provide a summary of the presentations, conclusions and directions of future work that were discussed during MDM/KDD2003 workshop, held in conjunction with the 9th ACM SIGKDD International conference on Knowledge Discovery and Data Mining, August 27, 2003 at Washington, DC, USA.
Heavy Transversals and Indecomposable Hypergraphs
Authors: E. K&#x00e9;zdy, Jen&#x0151; Lehel, C. Powers
Venue: Combinatorica (2003)

A weighted hypergraph is a hypergraph H = (V, E) with a weighting function $$w:V \to R$$, where R is the set of reals. A multiset S &#x2286; V generates a partial hypergraph HS with edges $${\left\{ {e \in E{\kern 1pt} :{\kern 1pt} {\left| {e \cap S} \right|} > w{\left( S \right)}} \right\}}$$, where both the cardinality $${\left| {e \cap S} \right|}$$ and the total weight w(S) are counted with multiplicities of vertices in S. The transversal number of H is represented by &#x03c4;(H). We prove the following: there exists a function f(n) such that, for any weighted n-Helly hypergraph H, &#x03c4;(HB) &#x2264; 1, for all multisets B &#x2286; V if and only if &#x03c4;(HA) &#x2264; 1, for all multisets A &#x2286; V with $${\left| A \right|} \leqslant f{\left( n \right)}$$. We provide lower and upper bounds for f(n) using a link between indecomposable hypergraphs and critical weighted n-Helly hypergraphs.
Testing Agent-Based Mobile Computing Applications Using Distributed Simulations
Authors: S. Ilarri, E. Mena, A. Illarramendi
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The attractiveness of computing services that are available anywhere and anytime has given rise to an intense research and development of mobile computing applications. However, there is a great pressure over providers of wireless data services to be the first in providing a new service. This leads to the need of a mechanism that allows developers to test their prototypes in a timely and non-expensive fashion, what excludes the possibility of performing real tests. In this paper we present a simulation framework for evaluating data services designed for wireless environments. Our approach, based on mobile agents, allows to perform distributed simulations of mobile networks composed of moving objects and proxies. We focus on the problems that arise to simulate moving objects that execute multiagent applications. Finally, we show the usefulness of our solution by testing a sample application.
Surgical Interactive Multimedia Modules: A novel, non-browser based architecture for medical education
Authors: Marc M. Triola, Mary Ann Hopkins, Matthew J. Weiner, William Holloway, Richard I. Levin, Martin S. Nachbar, Thomas S. Riles
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Contemporary medical education faces new challenges as the climate of the health caredelivery system transforms. Diminished length-of-stay and continuity-of-care have radicallyaltered the way medical students are exposed to and learn about illness. These educationalchallenges are particularly pronounced in the teaching of surgery.We developed a multimedia application, Surgical Interactive Multimedia Modules(SIMM), to utilize rich media objects and high-resolution video to overcome modern didacticchallenges. The SIMM client was created using Macromedia Director MX and communicatesusing XML with an Oracle database containing the rich-media educational objects. TheSIMMs integrate digital video, 3-D models, self-assessment tools, and current medicalevidence to generate a dynamic learning environment encompassing core surgery topics.Students can access SIMM modules either via a high-speed network connection or by using a DVD. The interface was designed to focus on a narrative timeline that provided students with a familiar metaphor for interacting with the learning objects.Students on the surgery clerkship are currently using four SIMM modules and feedbackindicates that they are regarded as compelling and useful educational tools for learning aboutcomplex surgical topics. Future areas of research will address student ability to annotate thelearning objects and to maintain a personal repository of medical education resources.
Real World Video Avatar: Transmission and Presentation of Human Figure
Authors: Hiroyuki Maeda, Tomohiro Tanikawa, Jun Yamashita, Koichi Hirota, Michitaka Hirose
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

Video avatar is one methodology of interaction withpeople at a remote location. By using such video-basedreal-time human figures, participants can interact using non-verbal information such as gestures and eye contact. In traditional video avatar interaction, however, participants can interact only in lnvirtuallt space.
Programmable baseband filter for multistandard mobile phones
Authors: Rasmus Glarborg Jensen, Kåre Tais Christensen, Erik Bruun
Venue: Analog Integrated Circuits and Signal Processing (2003)

This paper describes a channel selection filter for mobile communication systems using a direct down conversion architecture. The filter can be programmed to meet the requirements of different communication standards, including GSM (Global System for Mobile communication), WCDMA (Wideband Code Division Multiple Access), and Bluetooth. The filter includes a novel DC offset compensation circuit that combines offset sampling in GSM mode with high pass filtering in WCDMA mode. The filter can be programmed to different noise performance levels by programming the impedance level and power consumption of the input transconductor. The entire filter consumes between 2.5 mW and 7.5 mW, depending on the desired noise performance. It is implemented in a standard 0.25 µm CMOS process. A test circuit has been developed and fabricated and measurements show that both the required programmability and the required transfer functions can be obtained from the designed circuit.
Group Communication Protocol for Atomic and Causal Delivery of Multimedia Messages
Authors: Satoshi Itaya, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

A large-scale network is composed of various types of communication channels. Here, each communication channel supports Quality of Service (QoS) which may be different from others. In group communications, each process sends a message to multiple processes while receiving messages from multiple processes. In addition, messages are required to be causally delivered. A process supporting enough QoS receives messages, cannot deliver the messages if another process supporting lower QoS does not receive the messages. Thus, multimedia data cannot be delivered to processes so as to satisfy the real-time constraint if a slower process is included in a group. In this paper, we discuss group communication protocols by which multimedia messages can be delivered to a process with synchronization and QoS constraints.
Usefulness of hyperlink structure for query-biased topic distillation
Authors: Vassilis Plachouras, Iadh Ounis
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we introduce an information theoretic method for estimating the usefulness of the hyperlink structure induced from the set of retrieved documents. We evaluate the effectiveness of this method in the context of an optimal Bayesian decision mechanism, which selects the most appropriate retrieval approaches on a per-query basis for two TREC tasks. The estimation of the hyperlink structure's usefulness is stable when we use different weighting schemes, or when we employ sampling of documents to reduce the computational overhead. Next, we evaluate the effectiveness of the hyperlink structure's usefulness in a realistic setting, by setting the thresholds of a decision mechanism automatically. Our results show that improvements over the baselines are obtained.
A simple polynomial-time rescaling algorithm for solving linear programs
Authors: John Dunagan, Santosh Vempala
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for learning a threshold function. ). In spite of its exponential worst-case complexity, it is often quite useful, in part due to its noise-tolerance and also its overall simplicity. In this paper, we show that a randomized version of the perceptron algorithm with periodic rescaling runs in polynomial-time. The resulting algorithm for linear programming has an elementary description and analysis.
Physical Register Inlining
Authors: Mikko H. Lipasti, Brian R. Mestan, Erika Gunadi
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Physical register access time increases the delaybetween scheduling and execution in modern out-of-orderprocessors. As the number of physical registers increases,this delay grows, forcing designers to employ register fileswith multicycle access. This paper advocates more efficientutilization of a fewer number of physical registers in orderto reduce the access time of the physical register file. Registervalues with few significant bits are stored in the renamemap using physical register inlining, a scheme analogous toinlining of operand fields in data structures. Specifically,whenever a register value can be expressed with fewer bitsthan the register map would need to specify a physical registernumber, the value is stored directly in the map, avoidingthe indirection, and saving space in the physical register file.Not surprisingly, we find that a significant portion of all registeroperands can be stored in the map in this fashion, anddescribe straightforward microarchitectural extensions thatcorrectly implement physical register inlining. We find thatphysical register inlining performs well, particularly in processorsthat are register-constrained.
Challenges: Wireless Web Services
Authors: Hao-hua Chu, Chuang-wen You, Chao-ming Teng
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper describes the challenges of adaptingexisting web-service architecture to the wirelessenvironment. It presents a new, wireless, web-servicearchitecture based on the smart client model that canaddress some of the fundamental differences betweenthe wireless and wireline environments. Thefundamental differences between these environmentscan be called the mobile challenges, including (1) theunpredictable nature of the wireless network, (2) thelimited processing capabilities and power on mobiledevices, and (3) the need for consumer device to havea fast startup time for mobile applications.The smart client model suggests the followingmodifications to the existing web-service stack in orderto overcome these mobile challenges: (1) a lightweightweb-service container that runs on a resource-limitedmobile device (the client), (2) a quality of userexperience (QoUE) model based on applicationresponse time, application startup time, and powerconsumption, and (3) an adaptive applicationconfiguration algorithm that can exploit the tradeoffamong the QoUE parameters to provide the best userexperience given preferences and the device platform.
PCA-Based Walking Engine Using Motion Capture Data
Authors: Pascal Glardon, Ronan Boulic, Daniel Thalmann
Venue: Proceedings of the Computer Graphics International (2004)

This paper aims to propose a novel approach to generatenew generic human walking patterns using motion-captureddata, leading to a real-time engine intended for virtual humansanimation. The method applies the PCA (PrincipalComponent Analysis) technique on motion data acquired byan optical system to yield a reduced dimension space wherenot only interpolation, but also extrapolation are possible,controlled by quantitative speed parameter values. Moreover,with proper normalization and time warping methods,the generic presented engine can produce walking motionswith continuously varying human height and speed withreal-time reactivity.
Edge weights and vertex colours
Authors: Michał Karoński, Tomasz Łuczak, Andrew Thomason
Venue: Journal of Combinatorial Theory Series B (2004)

Can the edges of any non-trivial graph be assigned weights from {1, 2, 3} so that adjacent vertices have different sums of incident edge weights?We give a positive answer when the graph is 3-colourable, or when a finite number of real weights is allowed.
Traceable Document Flows
Authors: Martin Bernauer, Gerti Kappel, Elke Michlmayr
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Ad-hoc data exchange, e.g., by sending email attachments, leads to multiple copies or versions of a document at dispersed nodes in a network. However, their relationships such as is-a-version-of are lost. The relationships between a single document's existing versions together with the versions themselves form a so-called document flow, which allows to trace where a document originated and how it was distributed from node to node. The paper proposes an ontological, machine-processable framework for semantically describing and thus revealing document flows. The presented approach provides a light-weight communication infrastructure for information exchange and collaboration that is based on distributed versioning of documents and offers flexible document annotation mechanisms. After describing our infrastructure model, we present the implemented prototype and discuss a range of application scenarios for traceable document flows (TDFs).
Point-Based Probabilistic Surfaces to Show Surface Uncertainty
Authors: Gevorg Grigoryan Penny Rheingans
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Efficient and informative visualization of surfaces with uncertainties is an important topic with many applications in science and engineering. In these applications, the correct course of action may depend not only on the location of a boundary, but on the precision with which that location is known. Examples include environmental pollution borderline detection, oil basin edge characterization, or discrimination between cancerous and healthy tissue in medicine. This paper presents a method for producing visualizations of surfaces with uncertainties using points as display primitives. Our approach is to render the surface as a collection of points and to displace each point from its original location along the surface normal by an amount proportional to the uncertainty at that point. This approach can be used in combination with other techniques such as pseudocoloring to produce efficient and revealing visualizations. The basic approach is sufficiently flexible to allow natural extensions; we show incorporation of expressive modulation of opacity, change of the stroke primitive, and addition of an underlying polygonal model. The method is used to visualize real and simulated tumor formations with uncertainty of tumor boundaries. The point-based technique is compared to pseudocoloring for a position estimation task in a preliminary user study.
Teaching roles of variables in elementary programming courses
Authors: Marja Kuittinen, Jorma Sajaniemi
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Computer programming is a difficult skill for many students and new methods and techniques to help novices to learn programming are needed. This paper presents roles of variables as a new concept that can be used to assist in learning and gives detailed instructions on techniques to present roles to novices. These techniques are based on current learning theories and they have been used in a classroom experiment comparing traditional teaching with role-based teaching. The results suggest that the introduction of roles provides students a new conceptual framework that enables them to mentally process programs in a way similar to that of good code comprehenders; the use of role-based animation seems to assist in the adoption of role knowledge and expert-like programming skill.
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
Authors: Chi-Jen Lu
Venue: Journal of Cryptology (2004)

We study the problem of information-theoretically secure encryption in the bounded-storage model introduced by Maurer. The sole assumption of this model is a limited storage bound on an eavesdropper Eve, who is even allowed to be computationally unbounded. Suppose a sender Alice and a receiver Bob agreed on a short private key beforehand, and there is a long public random string accessible by all parties, say broadcast from a satellite or sent by Alice. Eve can only store some partial information of this long random string due to her limited storage. Alice and Bob read the public random string using the shared private key, and produce a one-time pad for encryption or decryption. In this setting, Aumann et al. proposed protocols with a nice property called everlasting security, which says that the security holds even if Eve later manages to obtain that private key. Ding and Rabin gave a better analysis showing that the same private key can be securely reused for an exponential number of times, against some adaptive attacks.We show that an encryption scheme with such nice properties can be derived immediately from any strong randomness extractor, a function which extracts randomness from a slightly random source, so that its output and its seed together are almost random. To have an efficient encryption scheme, one needs a strong extractor that can be evaluated in an on-line and efficient way. We give one such construction, which yields an encryption scheme that has the nice security properties as before but now can encrypt longer messages using shorter private keys.
Model Checking Dependability Attributes of Wireless Group Communication
Authors: Mieke Massink, Joost-Pieter Katoen, Diego Latella
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Models used for the analysis of dependability and performanceattributes of communication protocols often abstractconsiderably from the details of the actual protocol. Thesemodels often consist of concurrent sub-models and this maymake it hard to judge whether their behaviour is faithfullyreflecting the protocol. In this paper, we show how modelchecking of continuous-time Markov chains, generated fromhigh-level specifications, facilitates the analysis of both correctnessand dependability attributes. We illustrate this byrevisiting a dependability analysis [Analysis and estimation of the quality of service of group communication protocols] of a variant of thecentral access protocol of the IEEE 802.11 standard forwireless local area networks. This variant has been developedto support real-time group communication betweenautonomous mobile stations. Correctness and dependabilityproperties are formally characterised using ContinuousStochastic Logic and are automatically verified by theETMCC model checker. The models used are specified asStochastic Activity Nets.