ppxscal/embedding_network huggingface dataset:
The continuum architecture: towards enabling chaotic ubiquitous computing
Authors: Octavian Andrei Dragoi
Venue:  (2005)

Interactions in the style of the ubiquitous computing paradigm are possible today, but only in handcrafted environments within one administrative and technological realm. This thesis describes an architecture (called Continuum), a design that realises the architecture, and a proof-of-concept implementation that brings ubiquitous computing to chaotic environments. Essentially, Continuum enables an ecology at the edge of the network, between users, competing service providers from overlapping administrative domains, competing internet service providers, content providers, and software developers that want to add value to the user experience. Continuum makes the ubiquitous computing functionality orthogonal to other application logic. Existing web applications are augmented for ubiquitous computing with functionality that is dynamically compiled and injected by a middleware proxy into the web pages requested by a web browser at the user's mobile device. This enables adaptability to environment variability, manageability without user involvement, and expansibility without changes to the mobile. The middleware manipulates self-contained software units with precise functionality (called frames), which help the user interact with contextual services in conjunction with the data to which they are attached. The middleware and frame design explicitly incorporates the possibility of discrepancies between the assumptions of ubiquitous-computing software developers and field realities: multiple administrative domains, unavailable service, unavailable software, and missing contextual information. A framework for discovery and authorisation addresses the chaos inherent to the paradigm through the notion of role assertions acquired dynamically by the user. Each assertion represents service access credentials and contains bootstrapping points for service discovery on behalf of the holding user. A proof-of-concept prototype validates the design, and implements several frames that demonstrate general functionality, including driving discovery queries over multiple service discovery protocols and making equivalences between service types, across discovery protocols.
Levels of interaction allowing humans to command, interrogate and teach a communicating object: lessons learned from two robotic platform
Authors: Peter Ford Dominey, Alfredo Weitzenfeld
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

As robotic systems become increasingly capable of complex sensory, motor and information processing functions, the ability to interact with them in an ergonomic, real-time and adaptive manner becomes an increasingly pressing concern. In this context, the physical characteristics of the robotic device should become less of a direct concern, with the device being treated as a system that receives information, acts on that information, and produces information. Once the input and output protocols for a given system are well established, humans should be able to interact with these systems via a standardized spoken language interface that can be tailored if necessary to the specific system.The objective of this research is to develop a generalized approach for human-machine interaction via spoken language that allows interaction at three levels. The first level is that of commanding or directing the behavior of the system. The second level is that of interrogating or requesting an explanation from the system. The third and most advanced level is that of teaching the machine a new form of behavior. The mapping between sentences and meanings in these interactions is guided by a neuropsychologically inspired model of grammatical construction processing. We explore these three levels of communication on two distinct robotic platforms. The novelty of this work lies in the use of the construction grammar formalism for binding language to meaning extracted from video in a generative and productive manner, and in thus allowing the human to use language to command, interrogate and modify the behavior of the robotic systems.
Mixed mode execution with context threading
Authors: Mathew Zaleski, Marc Berndl, Angela Demke Brown
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Interpreters are widely used to implement portable language runtime environments. Programs written in these languages may benefit from performance beyond that obtainable by optimizing interpretation alone. A modern high-performance mixed-mode virtual machine (VM) includes amethod-based Just In Time (JIT) compiler. A method-based JIT, however, requires the up-front development of a complex compilation infrastructure before any performance benefits are realized.Ideally, the architecture for a mixed-mode VM could detect and execute a variety of shapes of hot regions of a virtual program. Our VM architecture is based on context threading. It supports powerful, efficient instrumentation and a simple framework for dynamic code generation. It has the potential to directly support a full spectrum of mixed-mode execution: from interpreted bytecode bodies, to specialized bytecode generated at runtime, to traces, to compiled methods. Further, it provides the necessary tools to detect these regions at runtime.We extended two VMs, SableVM and the OCaml interpreter with our infrastructure on both the P4 and PPC. To demonstrate the power and flexibility of our infrastructure we compare the selection and dispatch effectiveness for three common region shapes: whole methods, partial methods, and SPECL traces. We report results for a preliminary version of our code generator which compiles a region into a sequence of direct calls to bytecode bodies.
High Order A-stable Numerical Methods for Stiff Problems
Authors: J. C. Butcher
Venue: Journal of Scientific Computing (2005)

Stiff problems pose special computational difficulties because explicit methods cannot solve these problems without severe limitations on the stepsize. This idea is illustrated using a contrived linear test problem and a discretized diffusion problem. Even though the Euler method can solve these problems if the stepsize is small enough, there is no such limitation for the implicit Euler method. To obtain high order A-stable methods, it is traditional to turn to Runge---Kutta methods or to linear multistep methods. Each of these has limitations of one sort or another and we consider, as a middle ground, the use of general linear (or multivalue multistage) methods. Methods possessing the property of inherent Runge---Kutta stability are identified as promising methods within this large class, and an example of one of these methods is discussed. The method in question, even though it has four stages, out-performs the implicit Euler method if sufficient accuracy is required, because of its higher order
Visual programming support for graph-oriented parallel-distributed processing: Research Articles
Authors: Fan Chan, Jiannong Cao, Alvin T. S. Chan, Kang Zhang
Venue: Software&mdash;Practice Experience (2005)

GOP is a graph-oriented programming model which aims at providing high-level abstractions for configuring and programming cooperative parallel processes. With GOP, the programmer can configure the logical structure of a parallel&sol;distributed program by constructing a logical graph to represent the communication and synchronization between the local programs in a distributed processing environment. This paper describes a visual programming environment, called VisualGOP, for the design, coding, and execution of GOP programs. VisualGOP applies visual techniques to provide the programmer with automated and intelligent assistance throughout the program design and construction process. It provides a graphical interface with support for interactive graph drawing and editing, visual programming functions and automation facilities for program mapping and execution. VisualGOP is a generic programming environment independent of programming languages and platforms. GOP programs constructed under VisualGOP can run in heterogeneous parallel&sol;distributed systems. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Post-processing clustering to reduce XCS variability
Authors: Flavio Baronti, Alessandro Passaro, Antonina Starita
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result is important. We propose an algorithm to join the rules produced from many XCS runs, based on a measure of distance between rules. We also suggest a general definition for such a measure, and show the results obtained on a complex data set.
Pairwise Symmetry Decomposition Method for Generalized Covariance Analysis
Authors: Tsuyoshi Ide
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We propose a new theoretical framework for generalizing the traditional notion of covariance. First, we discuss the role of pairwise cross-cumulants by introducing a cluster expansion technique for the cumulant generating function. Next, we introduce a novel concept of symmetry decomposition of probability density functions according to the C_4v group. By utilizing the irreducible representations, generalized covariances are explicitly defined, and their utility is demonstrated using an analytically solvable model.
Three contributions to statistical computing
Authors: Donald B. Rubin
Venue:  (2005)

This thesis contains three papers (which may be read independently) on statistical computing. Paper 1 deals with improving the expectation-maximization (EM) algorithm using vector sequence transformations (VSTs). VSTs, such as reduced rank extrapolation and minimal polynomial extrapolation, are popular in numerical analysis but almost unknown to statisticians. For a vector sequence {sn, n &ge; 1} that converges linearly to s&infin; these methods achieve increased speed of convergence by making a guess at s&infin; based on several consecutive values of the sequence. These accelerators are easy to implement, take little computer time, and often result in considerably improved speed, although they do not automatically preserve the monotone increase in the likelihood function, which is a great advantage of EM. When fitting hierarchical models such as generalized linear mixed models (GLMMs) using EM or the data augmentation (DA) algorithm, the computing efficiency may depend crucially on the choice of the augmentation scheme. The efficient data augmentation idea of Meng and van Dyk (1997, 1999, 2001) chooses a DA scheme that is both quick to converge and easy to implement. Papers 2 and 3 both deal with finding efficient DA schemes. Paper 2 first studies the convergence rates of EM under two special augmentation schemes, the sufficient augmentation (SA) and the ancillary augmentation (AA), and then proceeds to design, using results on EM, certain optimal conditional augmentation (OCA) schemes, to speed up the DA algorithm. On the theoretical side, we derive general formulas for the OCA, which are often easily obtained or approximated; in the empirical comparisons, we extend the use of efficient DA to complicated situations such as GLMMs, and show that OCA results in considerable gain in efficiency. Paper 3 proposes a combined augmentation approach, which utilizes simultaneously the SA and the AA. Using a Poisson time series model as a realistic example, we demonstrate that, by utilizing both sufficient and ancillary augmentation schemes, considerable computational efficiency is gained with limited extra human effort, and the improved algorithm is fast for various data configurations. In the theoretical study that complements the empirical investigations, we show that, in addition to being robust, under certain conditions this combined approach is also optimal among a broad class of DA schemes.
A Random Walk through Human Associations
Authors: Raz Tamir
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Letting one's thoughts wander is not simply an arbitrary or rambling process. It can better be described as "associative thinking", where a complex chain of associative thoughts and ideas are linked. It is our contention that this seemingly chaotic process can be modeled by a random walk in a weighted directed graph. Furthermore, is it possible to predict mathematically the "steady state" of such a process, to determine where such wandering is leading. The random walk process uses rules of association, defined by the Local Confidence Gain (LCG) interestingness measure. Extracted concepts are used as nodes of a directed graph. The associative "forces" between any two concepts (measured by LCG) are used to weigh the edges connecting the nodes that create a graph of associations. It is common, yet not trivial, for people to look for data about a subject without knowing its exact nomenclature (for example, finding the name of a disease just by knowing its symptoms). Random walk in association graphs can discover highly informative phrases that can be used for query expansion in a way that better expresses the user's initial search goals. A different usage is to create a user profile representing his current interests. We used a modified version of the Turing Test to show that the random walk process discovers association rules that conform to a human associations generating process. By constructing the user associations we were able to build a profile representing the user's "line of thoughts". The suggested algorithm can be used in any database and can implement the ranking measures of other association rules.
An Overview of the VigilNet Architecture
Authors: Tian He, Liqian Luo, Ting Yan, Lin Gu, Qing Cao, Gang Zhou, Radu Stoleru, Pascal Vicaire, Qiuhua Cao, John A. Stankovic, Sang H. Son, Tarek F. Abdelzaher
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Battlefield surveillance often involves a high element of risk for military operators. Hence, it is very important for the military to execute unmanned surveillance by using large-scale wireless sensor systems. This invited paper summarizes the architecture of the VigilNet system ¿ a long-term real-time networked sensor system for military surveillance. Specifically, we review the design of several major subsystems within VigilNet including sensing and classification, localization, tracking, networking, power management, reconfiguration, graphic user interface, and the debugging subsystem. High-level programming abstractions are also presented. This is a balanced design to achieve real-time response, high confidence detection, accurate tracking and energy efficiency simultaneously.
Button Component Encasing for Wearable Technology Applications
Authors: Jaana Htinnikainen, Jussi Mikkonen, Jukka Vanhala
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper describes a novel bulfon component encasing for wearable technology applications. The button covers the electronics inside and forms a galvanic contact for communications between the hard electronics and textiles. However, the apprearance and usability of the clothing are maintained. A protolype for the encasing has been implemented, in which a temperature sensor is embedded inside the button The contact between the button and clothing IS implemented by sewing with electrrcally conductive fiber yarn Protowpe tests have shown that the encasing IS directly suitable to be used in a range of applications and galvanic connections are possible to implement by sewing with electrically conductive fibers.
Building an Adaptive Website Based on User Access Patterns
Authors: Gong Chibing, Mats Nordahl
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, we present an approach to building an adaptive website based on user access patterns. Our purpose is to build an adaptive website by automatically changing the site structure and make users find the information they desire within a minimum amount of time. Preprocessing, user access patterns and site reorganization are main three steps in this study. This research has been evaluated on a large website. Experiments show that the approach is feasible and effective for building an adaptive website based on user access patterns.
Interactive Computer Video Multimedia
Authors: Pablo Gonzalez, Diana Elsa Gonzalez
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper adds to the growing amount of material on digital television; a new way of presenting video. A leap is made from the traditional 2-D video to a more realistic 3-D video. The 2-D and 3-D models will be compared. It will be shown that 3-D video offers more realism and freedom of movement. It will also show how it can be used to improve existing Biometric systems. It will show how Distributive Processing using Message Passing Interface can be used to synchronize several video cameras to give the end user the freedom to select different view sites while the video is playing.
A New Securely Running Mechanism and Programming Model Based on WorkerApplet Thread in Elastos
Authors: Zhicheng Chen, Chen Yu, Lizhu Zhou, Weikang Yang, Mingyi Mao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With the transferring and development of the application of computer operating system from desktop to network, in the next generation of internet operating system, it is more and more important to consider the security of creating, running and exiting a thread on remote computer. This paper put forward the conceptions of "WorkerApplet",and designs a new running mechanism of thread that is implemented in Elastos. We change the object of thread for running from a "code of function" to a "WorkerApplet object". This work gives a new way to create, run, and exit a thread in remote system, especially which can be used to improve the security of system and data in the internet environment. And it perfects the running mechanism of thread in traditional operating system on the aspects of both the management of security and programming model.
Motion Prediction in a High-Speed, Dynamic Environment
Authors: Yu Sheng, Yonghai Wu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The immanent existence of system latency greatly affects the control behavior of a closed-loop system. In order to reduce the influence induced by latency, this paper proposes a systematic method based on neural network to predict the motion of objects in a high-speed, dynamic, and competitive environment. We apply this method to the competition of RoboCup Small Size League, which greatly improves the performance of our control system.
Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part II: The Lagrange--Newton Solver and Its Application to Optimal Control of Steady Viscous Flows
Authors: George Biros, Omar Ghattas
Venue: SIAM Journal on Scientific Computing (2005)

In part I of this article, we proposed a Lagrange--Newton--Krylov--Schur (LNKS) method for the solution of optimization problems that are constrained by partial differential equations. LNKS uses Krylov iterations to solve the linearized Karush--Kuhn--Tucker system of optimality conditions in the full space of states, adjoints, and decision variables, but invokes a preconditioner inspired by reduced space sequential quadratic programming (SQP) methods. The discussion in part I focused on the (inner, linear) Krylov solver and preconditioner. In part II, we discuss the (outer, nonlinear) Lagrange--Newton solver and address globalization, robustness, and efficiency issues, including line search methods, safeguarding Newton with quasi-Newton steps, parameter continuation, and inexact Newton ideas. We test the full LNKS method on several large-scale three-dimensional configurations of a problem of optimal boundary control of incompressible Navier--Stokes flow with a dissipation objective functional. Results of numerical experiments on up to 256 Cray T3E-900 processors demonstrate very good scalability of the new method. Moreover, LNKS is an order of magnitude faster than quasi-Newton reduced SQP, and we are able to solve previously intractable problems of up to 800,000 state and 5,000 decision variables at about 5 times the cost of a single forward flow solution.
Working as an "only writer" (3)
Authors: Ellen Leder
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

I was hired as the documentation writer for a computer-based market research company of 30 employees, and I would like to share some of my thoughts, now that I have another job. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Impact of post-deposition-annealing on the electrical characteristics of HfOxNy gate dielectric on Ge substrate
Authors: Chao-Ching Cheng, Chao-Hsin Chien, Ching-Wei Chen, Shih-Lu Hsu, Ming-Yi Yang, Chien-Chao Huang, Fu-Liang Yang, Chun-Yen Chang
Venue: Microelectronic Engineering (2005)

We systematically investigated the effect of post-deposition-annealing (PDA) on the electrical characteristics of Ge MOS capacitors with hafnium-oxynitride gate dielectric. The higher PDA temperature and longer PDA time was found to obtain the lower equivalent oxide thickness (EOT) of HfOxNy/Ge gate stack, however, with a larger hysteresis width. A lower EOT of 19.5 Å, with a low leakage current of 1.8 × 10-5 A/cm2 at VG = -1V was achieved after 600°C annealing for 5 min. The improved capacitor properties after the PDA may be closely related to the different compositions and thicknesses of the resultant interfacial layers.
Efficient Algorithms for Mining Maximal Frequent Concatenate Sequences in Biological Datasets
Authors: Jin Pan, Peng Wang, Wei Wang, Baile Shi, Genxing Yang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The growth of bioinformatics has resulted in datasets with new characteristics. The DNA sequences typically contain a large number of items. From them biologists assemble a whole genome of species based on frequent concatenate sequences, which ordinarily have hundreds of items. Such datasets pose a great challenge for existing frequent pattern discovery algorithms. Almost all of them are Apriori-like and so have an exponential dependence on the average sequence length. PrefixSpan is the most efficient algorithm, which presented the projection-based sequential patterngrowth approach. However it grows sequential patterns by exploring length-1 frequent patterns and so is not suitable for biological dataset with long frequent concatenate sequences. In this paper, we propose two novel algorithms, called MacosFSpan and MacosVSpan, to mine maximal frequent concatenate sequences. They are specially designed to handle datasets having long frequent concatenate sequences. Our performance study shows that MacosFSpan outperforms the traditional methods with length-1 sequences exploration and MacosVSpan is more efficient than MacosVSpan.