ppxscal/embedding_network huggingface dataset:
Discrete exterior calculus
Authors: Jerrold E. Marsden
Venue:  (2003)

This thesis presents the beginnings of a theory of discrete exterior calculus (DEC). Our approach is to develop DEC using only discrete combinatorial and geometric operations on a simplicial complex and its geometric dual. The derivation of these may require that the objects on the discrete mesh, but not the mesh itself, are interpolated. Our theory includes not only discrete equivalents of differential forms, but also discrete vector fields and the operators acting on these objects. Definitions are given for discrete versions of all the usual operators of exterior calculus. The presence of forms and vector fields allows us to address their various interactions, which are important in applications. In many examples we find that the formulas derived from DEC are identical to the existing formulas in the literature. We also show that the circumcentric dual of a simplicial complex plays a useful role in the metric dependent part of this theory. The appearance of dual complexes leads to a proliferation of the operators in the discrete theory. One potential application of DEC is to variational problems which come equipped with a rich exterior calculus structure. On the discrete level, such structures will be enhanced by the availability of DEC. One of the objectives of this thesis is to fill this gap. There are many constraints in numerical algorithms that naturally involve differential forms. Preserving such features directly on the discrete level is another goal, overlapping with our goals for variational problems. In this thesis we have tried to push a purely discrete point of view as far as possible. We argue that this can only be pushed so far, and that interpolation is a useful device. For example, we found that interpolation of functions and vector fields is a very convenient. In future work we intend to continue this interpolation point of view, extending it to higher degree forms, especially in the context of the sharp, Lie derivative and interior product operators. Some preliminary ideas on this point of view are presented in the thesis. We also present some preliminary calculations of formulas on regular nonsimplicial complexes.
Network participation indices: characterizing component roles for information processing in neural networks
Authors: Rolf Kötter, Klaas E. Stephan
Venue: Neural Networks (2003)

We propose a set of indices that characterize--on the basis of connectivity data--how a network node participates in a larger network and what roles it may take given the specific sub-network of interest. These Network Participation Indices are derived from simple graph theoretic measures and have the interesting property of linking local features of individual network components to distributed properties that arise within the network as a whole. We use connectivity data on large-scale cortical networks to demonstrate the virtues of this approach and highlight some interesting features that had not been brought up in previously published material. Some implications of our approach for defining network characteristics relevant to functional segregation and functional integration, for example, from functional imaging studies are discussed.
Optimizing tree reconfiguration to track mobile targets in sensor networks
Authors: Wensheng Zhang, Guohong Cao
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing energy efficient techniques to detect and track a mobile target. We introduce the concept of dynamic convoy treebased collaboration (DCTC), and formalize it as an optimization problem which needs to find a convoy tree sequence with low energy consumption. We slove the optimization problem in two steps. First, we propose an interception-based reconfiguration algorithm, which can reconfigure the tree structure in an energy efficient way. Second, we develop a theoretical network model, based on which we propose an optimal method for root migration. Extensive experiments are conducted to verify the effectiveness of the proposed method for root migration, and to evaluate and compare the performance of various tree reconfiguration schemes which use different root migration methods and tree reconfiguration algorithms. The results show that the developed optimal method for root migration matches the analytical results, and the tree reconfiguration scheme using the optimal root migration method and the interception-based reconfiguration algorithm has the lowest energy consumption.
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Authors: David Muradian
Venue: Theoretical Computer Science (2003)

In this paper, we show that the bandwidth minimization problem remains NP-complete for cyclic caterpillars with hair length 1. Cyclic caterpillars with hair length 1 are graphs in which the removal of all pendant vertices results in a simple cycle.
Getting into the Living Memory Box: Family archives & holistic design
Authors: Molly M. Stevens, Gregory D. Abowd, Khai N. Truong, Florian Vollmer
Venue: Personal and Ubiquitous Computing (2003)

Digital archives of personal memories are becoming increasingly technically feasible, but there remain significant interaction design challenges. In this paper, we present a research and design study of the Living Memory Box, a device and service to assist families in preserving memories in a variety of media forms. Through a series of ethnographic interviews, design activities and focus groups, we have developed recommendations for the design and development of future personal memory systems and appliances. These improvements must be considered by future researchers in the coordination of multiple disciplines toward successful holistic systems.
Facial motion cloning
Authors: Igor S. Pandzic
Venue: Graphical Models (2003)

We propose a method for automatically copying facial motion from one 3D face model to another, while preserving the compliance of the motion to the MPEG-4 Face and Body Animation (FBA) standard. Despite the enormous progress in the field of Facial Animation, producing a new animatable face from scratch is still a tremendous task for an artist. Although many methods exist to animate a face automatically based on procedural methods, these methods still need to be initialized by defining facial regions or similar, and they lack flexibility because the artist can only obtain the facial motion that a particular algorithm offers. Therefore a very common approach is interpolation between key facial expressions, usually called morph targets, containing either speech elements (visemes) or emotional expressions. Following the same approach, the MPEG-4 Facial Animation specification offers a method for interpolation of facial motion from key positions, called Facial Animation Tables, which are essentially morph targets corresponding to all possible motions specified in MPEG-4. The problem of this approach is that the artist needs to create a new set of morph targets for each new face model. In case of MPEG-4 there are 86 morph targets, which is a lot of work to create manually. Our method solves this problem by cloning the morph targets, i.e. by automatically copying the motion of vertices, as well as geometry transforms, from source face to target face while maintaining the regional correspondences and the correct scale of motion. It requires the user only to identify a subset of the MPEG-4 Feature Points in the source and target faces. The scale of the movement is normalized with respect to MPEG-4 normalization units (FAPUs), meaning that the MPEG-4 FBA compliance of the copied motion is preserved. Our method is therefore suitable not only for cloning of free facial expressions, but also of MPEG-4 compatible facial motion, in particular the Facial Animation Tables. We believe that Facial Motion Cloning offers dramatic time saving to artists producing morph targets for facial animation or MPEG-4 Facial Animation Tables.
An evolutionary approach for reducing the energy in address buses
Authors: Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi, Antonio Parlato
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

In this paper we present a genetic approach for the efficient generation of an encoder to minimize switching activity on the high-capacity lines of a communication bus. The approach is a static one in the sense that the encoder is realized ad hoc according to the traffic on the bus. This is not, however, a limiting hypothesis if the application scenario considered is that of embedded systems. An embedded system, in fact, executes the same application throughout its lifetime and so it is possible to have detailed knowledge of the trace of the patterns transmitted on a bus following execution of a specific application. The approach is compared with the most efficient encoding schemes proposed in the literature on both multiplexed and separate buses. The results obtained demonstrate the validity of the approach, which on average saves up to 50% of the transitions normally required.
Implementing Fuzzy Expert System for intelligent buildings
Authors: Carlos A. Reyes-Garcia, Elva. Corona
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this paper we present the design of an intelligent dome, as well as the design and implementation of the Fuzzy Expert System for the module controlling Ventilation and Air Conditioning. The system was designed as a Client/Server, Blackboard architecture, implemented in FuzzyCLIPS, and intensively tested under different conditions. We describe here all the design and implementation stages as well as some of the results obtained.
Layout Conscious Bus Architecture Synthesis for Deep Submicron Systems on Chip
Authors: Nattawut Thepayasuwan, Alex Doboli
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

System-level design has a disadvantage in not knowing important aspects about the final layout. This is critical for SoC, where uncertainties in communication delay by very deep submicron effects cannot be neglected. This paper presents a layout-aware bus architecture (BA) synthesis algorithm for designing the communication sub-system of an SoC. BA synthesisincludes finding bus topology and routing individual buses, so that constraints like area, bus speed and length, are tackled at the physical level. The paper presents the BA automaticallysynthesized for a network processor and a JPEG SoC.
Detecting Patterns of Change Using Enhanced Parallel Coordinates Visualization
Authors: Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Andreas Schaller
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Analyzing data to find trends, correlations, and stablepatterns is an important problem for many industrialapplications. In this paper, we propose a new techniquebased on parallel coordinates visualization. Previous workon parallel coordinates methods has shown that they areeffective only when variables that are correlated and/orshow similar patterns are displayed adjacently. Althoughcurrent parallel coordinates tools allow the user tomanually rearrange the order of variables, this process isvery time-consuming when the number of variables islarge. Automated assistance is needed. This paperproposes an edit-distance based technique to rearrangevariables so that interesting patterns can be easilydetected. Our system, V-Miner, includes both automatedmethods for visualizing common patterns and a query toolthat enables the user to describe specific target patterns tobe mined/displayed by the system. Following an overviewof the system, a case study is presented to explain howMotorola engineers have used V-Miner to identifysignificant patterns in their product test and design data.
Statistical Methodology for WEB-Based Simulation
Authors: William E. Biles, Jack P. C. Kleijnen
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

This paper describes a procedure for assigning simulation trials to a set of parallel processors for the purpose of conducting a simulation study, involving a complex simulation model, in near real time. Unlike distributed simulation, where a complex simulation model is decomposed and its parts run in a parallel environment, the parallel replications approach discussed here involves running simulation replications to completion for the entire model. The unique elementhere is that the workload involved in running the simulation study is too time consuming to execute on a single workstation, so that the simulation analyst must utilize computer resources available through the web. New statistical methodology is needed for running a complex simulation study in a web-based, parallel replications environment.
Automatic Synthesis and Simulation of Continuous-Time [Sigma-Delta] Modulators
Authors: H. Aboushady, L. de Lamarre, N. Beilleau, M. M. Louërat
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a mixed equation-based and simulation-based design methodology for continuous-time Sigma-Delta modulators from high level specifications down to Layout. The calculation and scaling of the Sigma-Delta coef.cients as well as circuit sizing and layout generation are implemented in the same analog design environment CAIRO+. The design of a complete third order current-mode continuous-time Sigma-Delta modulator is taken as an example to show the effectiveness of the proposed design methodology.
A Performance Comparison among the Traditional R-trees, the Hilbert R-tree and the SR-tree
Authors: Ricardo Rodrigues Ciferri, Ana Carolina Salgado, Valéria Cesário Times, Mário A. Nascimento, Geovane Cayres Magalhães
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

This work investigates the performance of severalspatial access methods with respect to the distribution ofthe indexed spatial objects. Although having gatheredstorage and insertion costs as well, this work focuses onsome issues regarding query costs. The performanceresults have showed that the R+-tree was the best spatialindex structure for the point queries and the enclosurerange queries, whereas the R*-trees have produced thebest outcomes for the intersection and the containmentrange queries. The Hilbert R-tree and the SR-tree havegenerated low performance results for any investigatedquery type. However, additional performance tests haveshowed that a variation in both the size and the shapeproperties of the data rectangles provided competitiveresults for the Hilbert R-tree and the SR-tree, mainly forthe intersection and the containment queries.
Tracking mobile users with uncertain parameters
Authors: Zohar Naor
Venue: Wireless Networks (2003)

A method of reducing the wireless cost of tracking mobile users with uncertain parameters is developed in this paper. Such uncertainty arises naturally in wireless networks, since an efficient user tracking is based on a prediction of its future call and mobility parameters. The conventional approach based on dynamic tracking is not reliable in the sense that inaccurate prediction of the user mobility parameters may significantly reduce the tracking efficiency. Unfortunately, such uncertainty is unavoidable for mobile users, especially for a bursty mobility pattern. The two main contributions of this study are a novel method for topology-independent distance tracking, and a combination of a distance-based tracking with a distance-sensitive timer that guarantees both efficiency and robustness. The expected wireless cost of tracking under the proposed method is significantly reduced, in comparison to the existing methods currently used in cellular networks. Furthermore, as opposed to other tracking methods, the worst case tracking cost is bounded from above and governed by the system, such that it outperforms the existing methods. The proposed strategy can be easily implemented, and it does not require a significant computational power from the user.
Sensor: the atomic computing particle
Authors: Vijay Kumar
Venue: ACM SIGMOD Record (2003)

We visualize the world as a fully connected information space where each object communicates with all other objects without any temporal and geographical constraints. We can model this fully connected space using fine granularity processing which can be implemented using sensors technology. We regard sensors as atomic computing particles which can deployed to geographical locations for capturing and processing data of their surrounding. This report introduces a number of excellent research articles which present unique problems and their success in finding efficient solutions for them. It also peeks in to the future of ever changing information processing discipline.
Spatiotemporal multicast in sensor networks
Authors: Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call "mobicast". Mobicast is a novel spatiotemporal multicast protocol that distributes a message to nodes in a delivery zone that evolves over time in some predictable manner. A key advantage of mobicast lies in its ability to provide reliable and just-in-time message delivery to mobile delivery zones on top of a random network topology. Mobicast can in theory achieve good spatiotemporal delivery guarantees by limiting communication to a mobile forwarding zone whose size is determined by the global worst-case value associated with a compactness metric defined over the geometry of the network (under a reasonable set of assumptions). In this work, we first studied the compactness properties of sensor networks with uniform distribution. The results of this study motivate three approaches for improving the efficiency of spatiotemporal multicast in such networks. First, spatiotemporal multicast protocols can exploit the fundamental tradeoff between delivery guarantees and communication overhead in spatiotemporal multicast. Our results suggest that in such networks, a mobicast protocol can achieve relatively high savings in message forwarding overhead by slightly relaxing the delivery guarantee, e.g., by optimistically choosing a forwarding zone that is smaller than the one needed for a 100% delivery guarantee. Second, spatiotemporal multicast may exploit local compactness values for higher efficiency for networks with non uniform spatial distribution of compactness. Third, for random uniformly distributed sensor network deployment, one may choose a deployment density to best support spatiotemporal communication. We also explored all these directions via simulation and results are presented in this paper.
DOpE - a Window Server for Real-Time and Embedded Systems
Authors: Norman Feske, Hermann Härtig
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

A window server used in real-time applications shouldbe able to assure previously agreed-upon redrawing ratesfor a subset of windows while providing best-effort servicesto the remaining windows and operations such as movingwindows. A window server used in embedded systemsshould be small and require only minimal operating systemsupport, for example just threads and address spacesas provided by microkernels.In this paper, we present the design and an implementationof the DOpE window server. The key techniques usedare to move redrawing responsibility from client applicationsto the window server and to devise a simple schedulingdiscipline for the redrawing subtasks.
Diagnosis of Sensors on the Controlled Plants
Authors: B. V. Lunkin
Venue: Automation and Remote Control (2003)

A procedure of testing sensors for compliance with the metrological requirements immediately on the plant in the course of operation was proposed. It is based on using the predefined calibration characteristics and main errors for various values of the influencing factors, generating a reference signal in the course of diagnosis, measuring the affecting factors, and comparing the sensor readings with the values obtained at calibration. A diagnostic procedure for the cases where determination of the reference signal is hindered was considered. Feasibility of diagnosis without generating the reference signal was exemplified by the radio-frequency sensors.
Eclipse: A Platform Becomes an Open-Source Woodstock
Authors: Alexander Wolfe
Venue: Queue (2003)

Call it a platform. Call it a tool. Call it the hottest open-source software movement since Linux. All those descriptions currently surround Eclipse,1 the language-agnostic code base that’s billed as a “universal platform.”
Advantages and limits of formal approaches for ultra-high dependability
Authors: M. C. Gaudel
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

This position paper discusses the advantages and limits of formal approaches to software development for achieving ultra-high dependability of critical computer systems. Among the issues to be addressed here, are: what is a formal specification? what can be done with it? what is correctness? what kind of certainty comes from a proof? and from testing? The paper does not claim to answer these questions: rather it is a formulation of the author's reflections and perplexities in this area.
Same Bed, Different Dreams?: A Comparative Analysis of Citizen and Bureaucrat Perspectives on E-Government
Authors: M. Jae Moon, Eric W. Welch
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Recent studies indicate that bureaucrats and citizens are beginning to appreciate the opportunities and constraints for applications of information and communication technologies (ICTs) for governance. Using the data collected from independently administered random surveys of citizens and bureaucrats in late 2001 by Hart-Teeter, this essay is designed to explore whether and how citizen and bureaucrat perspectives on e-government coincide and/or diverge in terms of the effectiveness of e-government and pace of e-government implementation, equity (e.g. access), and safety (e.g. privacy and security).