ppxscal/embedding_network huggingface dataset:
Controllably Mobile Infrastructure for Low Energy Embedded Networks
Authors: Arun A. Somasundara Aman Kansal, David D. Jea, Deborah Estrin, Mani B. Srivastava
Venue: IEEE Transactions on Mobile Computing (2006)

We discuss the use of mobility to enhance network performance for a certain class of applications in sensor networks. A major performance bottleneck in sensor networks is energy since it is impractical to replace the batteries in embedded sensor nodes post-deployment. A significant portion of the energy expenditure is attributed to communications and, in particular, the nodes close to the sensor network gateways used for data collection typically suffer a large overhead as these nodes must relay data from the remaining network. Even with compression and in-network processing to reduce the amount of communicated data, all the processed data must still traverse these nodes to reach the gateway. We discuss a network infrastructure based on the use of controllably mobile elements to reduce the communication energy consumption at the energy constrained nodes and, thus, increase useful network lifetime. In addition, our approach yields advantages in delay-tolerant networks and sparsely deployed networks. We first show how our approach helps reduce energy consumption at battery constrained nodes. Second, we describe our system prototype which utilizes our proposed approach to improve the energy performance. As part of the prototyping effort, we experienced several interesting design choices and trade-offs that affect system capabilities and performance. We describe many of these design challenges and discuss the algorithms developed for addressing these. In particular, we focus on network protocols and motion control strategies. Our methods are tested using a practical system and do not assume idealistic radio range models or operation in unobstructed environments.
Germination of the Active Lighting: An Introduction and Brief History of Our Research
Authors: Shinsaku Hiura, Kosuke Sato, Ichiro Kanaya
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We have been engaged in the researches on the active lighting techniques for twenty years. At first, we proposed a method to measure the 3-D shape of the object by projecting multiple patterns of structured light, because it is much faster than the method with scanning slit of light, and dense range image can be measured. For this purpose, we made a projector which consists of mechanicallychangeable masks, but it was soon replaced by a speciallymade liquid crystal panel with many slit segments. From the fact, we can proudly declare that the projector is not a diverted device but exclusively developed as a part of projector-camera systems, and the projection target is originally not a planar screen but a real scene with varied depth. Actually, this infant device was successful and commercially enough practical for 3-D shape measurement, but unfortunately we had to wait for the evolution of panel display technology more than a decade, to make a step to the studies which utilizes full duality between cameras and projectors. In the middle of 1990s, many researchers started using video projectors. Since we were computer vision researchers, we used the flexibility of video projector not for a interaction technique but improving performance of 3-D measurement such as motion tracking. But we were also aware of its advantage as a visualization tool in a real scene. Alike to the other research activities, we have confirmed that the projector can change the seen color, texture and specular of the real object. In addition, faked shade projected on the object make it possible to change our interpretation of its shape. Furthermore, the traditional shape measurement method we had developed is seamlessly combined with the visualization technique. Therefore, we have a common view to the possibility of intuitive interface systems with realistic visualization for communicating, training and designing works, so now is a good time to look-ing back on the history of projector-camera systems for our community. Of course you are already familiar with mostresearches in this field, but we regret our less presence if you are not aware of our research activities. Therefore, in this paper, we summarize the history and progress on light projection methodologies in our laboratory.
A new mesh selection algorithm, based on conditioning, for two-point boundary value codes
Authors: J. R. Cash, F. Mazzia
Venue: Journal of Computational and Applied Mathematics (2005)

We present a hybrid mesh selection strategy for use in codes for the numerical solution of two-point boundary value problems. This new mesh strategy is based on the estimation of two parameters which characterise the conditioning of the continuous problem as well as on a standard estimate of the local discretisation error. We have implemented this algorithm in the well known code TWPBVP and have found that the modified code is often considerably more efficient than the original. Another strong advantage of using the new mesh selection algorithm is that it automatically provides an estimate of the conditioning of the discrete problem. This is very valuable (arguably indispensible) for use either in an a posteriori error estimate or, in situations where the conditioning constants are large, as a warning that the accuracy obtained in the solution may be worse than anticipated.
Reconstruction of concurrent system models described by decomposed data tables
Authors: Zbigniew Suraj, Krzysztof Pancerz
Venue: Fundamenta Informaticae (2006)

This paper deals with reconstruction of net models of concurrent systems described by information systems changing in time. Constructed net models have the form of coloured Petri nets. Resulting nets are constructed on the basis of decomposed information systems. In many practical cases, a description of modelled systems changes in time. New knowledge about structures and behaviours of systems appears. When new descriptions appear, the net models should be changed taking into consideration the new knowledge. An approach to reconstruction of net models is presented here. One of many possible cases is considered, i.e., when the new global state of the modelled system appears. The ability to compute reducts and components of a new information system, being a new description of a modelled system, in an efficient way is important for reconstruction. Therefore, some propositions and corollaries useful to compute reducts of a new information system on the basis of reducts of an old information system are given. These propositions and corollaries are the basis to formulate algorithms for computing new reducts and components. Moreover, a way to determine the cost of the reconstruction of a net model is given. The cost of the reconstruction is treated as the cost of adding new functional modules, communication lines or their modifications. The discussed approach to model reconstruction extends and refines that proposed by Z. Suraj in 1998. An example is given in this paper to illustrate the presented idea.
Adaptive Multi-Sensor, Multi-Actuator Media Workflow System for Interactive Arts
Authors: Lina Peng, K. Selcuk Candan
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We are presenting the Architecture for Interactive Arts (ARIA) middleware architecture for sensory/ reactive environments, such as interactive performances. ARIA processes, filters, and fuses sensory inputs and actuates responses in real-time while providing various service guarantees. ARIA is deployed on a centralized stream processor that monitors and queries over distributed media sensors and outputs of the media workflows are sent to actuators with video and audio presentation capabilities. Due to rapid updates and the continuous nature of sensory data streams, approximation and adaptation techniques are necessary to optimize resource usage. We propose a mechanism that adapts media workflows by adjusting parameters of filters and fusion operators that dynamically control the speed of data streams and the sampling rate. In [1], we developed the ARIA middleware model, including the operators, performance models, and the optimization techniques for chain structured (single-sensor, single-actuator) media workflows. In this paper, we focus on development of flow optimization techniques in adaptive multi-sensor, multi-actuator workflow system. We experimentally evaluate the efficiency and the effectiveness of the algorithms.
Representation and analysis of spatial resources in construction simulation
Authors: Cheng Zhang, Tarek M. Zayed, Amin Hammad, Gabriel Wainer
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Space is one of the resources that may cause crucial problems during construction. Discrete event simulation has been widely used in construction to allocate resources and improve productivity or mitigate conflicts. However, simulation research that provides an explicit method to investigate possible space conflicts is still limited. This paper suggests a cell-based method to represent space resources in construction simulation, which enables conflict analysis and visual display of the worksite and the occupation of spaces. Different simulation models are compared to identify their limitations in space representation.
Properties of NP-Complete Sets
Authors: Christian Glasser, A. Pavan, Alan L. Selman, Samik Sengupta
Venue: SIAM Journal on Computing (2006)

We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S \not\supseteq L is a p-selective sparse set, then L - S is \leq pm-hard for NP. We demonstrate the existence of a sparse set S \in DTIME(22n) such that for every L \in NP - P, L - S is not \leq pm-hard for NP. Moreover, we prove for every L \in NP - P that there exists a sparse S \in EXP such that L - S is not \leq pm-hard for NP. Hence, removing sparse information in P from a complete set leaves the set complete, while removing sparse information in EXP from a complete set may destroy its completeness. Previously, these properties were known only for exponential time complexity classes. We use hypotheses about pseudorandom generators and secure one-way permutations to derive consequences for longstanding open questions about whether NP-complete sets are immune. For example, assuming that pseudorandom generators and secure one-way permutations exist, it follows easily that NP-complete sets are not p-immune. Assuming only that secure one-way permutations exist, we prove that no NP-complete set is DTIME(2nepsilon)-immune. Also, using these hypotheses we show that no NP-complete set is quasi-polynomial-close to P. We introduce a strong but reasonable hypothesis and infer from it that disjoint Turing-complete sets for NP are not closed under union. Our hypothesis asserts the existence of a UP-machine M that accepts 0* such that for some 0 < epsilon < 1, no 2nepsilon time-bounded machine can correctly compute infinitely many accepting computations of M. We show that if UP \cap coUP contains DTIME(2nepsilon)-bi-immune sets, then this hypothesis is true.
Native and Nonnative Speakers' Processing of a Miniature Version of Japanese as Revealed by ERPs
Authors: Jutta L. Mueller, Anja Hahne, Yugo Fujii, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2005)

Several event-related potential (ERP) studies in second language (L2) processing have revealed a differential vulnerability of syntax-related ERP effects in contrast to purely semantic ERP effects. However, it is still debated to what extent a potential critical period for L2 acquisition, as opposed to the attained proficiency level in the L2, contributes to the pattern of results reported in previous ERP studies. We studied L2 processing within the model of a miniature version of a natural language, namely Japanese, specifically constructed to assure high proficiency of the learners. In an auditory ERP experiment, we investigated sentence processing of the "Mini-Japanese" in Japanese native speakers and German volunteers before and after training. By making use of three different types of violation, namely, word category, case, and classifier violations, native and nonnative ERP patterns were compared. The three types of violation elicited three characteristic ERP patterns in Japanese native speakers. The word category violation elicited an anteriorly focused, broadly distributed early negativity followed by a P600, whereas the case violation evoked a P600 which was preceded by an N400. The classifier violation led solely to a late left distributed negativity with an anterior focus. Although the P600 was similar for Japanese natives and learners, the N400 and the anterior negativities were not present in the learner group. The differences across groups suggest deviant neural processes in on-line syntactic and thematic processing in the L2 learners despite high behavioral skills.
A simple design method of reduced-order filters and its applications to multirate filter bank design
Authors: Zhisheng Duan, Jingxin Zhang, Cishen Zhang, Edoardo Mosca
Venue: Signal Processing (2006)

Based on linear matrix inequality (LMI) technique, a new design method is proposed for the reduced-order filters of continuous and discrete time linear systems. The method is derived from decomposing the key matrix in LMIs which determines the order of designed filters. Different from the existing methods, the proposed method first minimizes the upper bound of the key matrix and then eliminates its near-zero eigenvalues, which results in a simpler, more direct and reliable design procedure. The proposed method can be used to design H"2 and H"~ reduced-order filters and multirate filter banks. Its effectiveness is illustrated by several examples.
Exploring Data Streams with Nonparametric Estimators
Authors: Christoph Heinz, Bernhard Seeger
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

A variety of real-world applications requires a meaningful online analysis of transient data streams. An important building block of many analysis tasks is the characterization of the underlying data distribution. Sophisticated techniques from the area of nonparametric statistics provide a well-defined estimation of continuous data distributions. The analysis of data streams may gain advantage of these techniques, however, the rigid processing requirements of streams render a direct application impossible. In our work, we tackle the adaptation of nonparametric techniques to streaming data. We concentrate on density estimation as it provides a convenient basis for the exploration of an unknown continuous data distribution. Specifically, we have developed kernel- and wavelet-based density estimators for data streams in compliance with their processing requirements. Both techniques are incorporated into PIPES, our Java library for advanced data stream processing and analysis. In the demonstration, we will present our nonparametric density estimators over data streams and show their performance for a variety of heterogeneous data streams from different real-world application scenarios. We will also present the implementation of further analysis tasks on top of our estimators by means of illustrative use cases.
Developing User Requirements for Visualizations of Literature Knowledge Domains
Authors: Sarah Faisal, Paul Cairns, Ann Blandford
Venue: Proceedings of the conference on Information Visualization (2006)

As researchers we are constantly working with our literature domains. Making sense and familiarizing ourselves with such domains is a cumbersome but necessary task that is part of every researcher's career, especially novices. Literature Knowledge Domain Visualizations exist which assist users in extracting and interpreting interesting patterns. However, these visualizations tend to be developed without reference to the particular needs of researchers or without addressing the specific challenges of the literature knowledge domain. This paper therefore targets the needs of researchers as they work with their literature. We conducted a qualitative study to understand how researchers make sense of their literature domains. Such information assisted us in coming up with a set of design considerations and guidelines which we believe will assist in building visualizations that are useful for the general research population.
Automatic Acquisition of Immunofluorescence Images: Algorithms and Evaluation
Authors: Paolo Soda, Amelia Rigon, Antonella Afeltra, Giulio Iannello
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In this paper, we report our experience in the development of a system for automatic acquisition of Immuno-Fluorescence Assay (IFA) images. We focus on two basic issues. Firstly, we determine an autofocus function that can deal with photobleaching, a physical phenomenon affecting automatic acquisition of IFA images, and present a set of experiments on real images that confirm its effectiveness. Secondly, we discuss if the physicians may reliably use digital IFA images in place of direct microscope observations to carry out the diagnosis. In this respect, we present the results of a preliminary experiment where physicians perform the diagnosis on a set of images both by looking directly to them at the fluorescence microscope and by looking at digital images on the screen of a workstation.
A resources interpretation of teachers' epistemologies of science
Authors: Sandra Honda, David B. May
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Teachers' epistemologies of science are explored as they emerge during the course of an authentic laboratory research experience. Using a resources framework as an interpretive lens, we find that teachers develop epistemological resources for the nature of science while conducting authentic research and participating in conversations in which epistemic discourse about the nature of science is facilitated. However, stability of these epistemological resources and the contexts in which they are activated vary across individuals. Here we describe a sample of the resources along with some contexts in which they are and are not activated.
A case study of elementary students' argumentation in science
Authors: Seau Yoon Foo, Chee Kit Looi
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper describes how a class of fifth-grade students from a Singapore school engaged in argumentation in Science through a computer-networked environment Knowledge Forum (KF). Extending over three months, the students' KF discussion focused on the rocky seashore ecosystem and its organisms. Fieldwork activities were incorporated to further trigger and sustain the online KF discussions in order to facilitate idea improvement and conceptual progress. Toulmin's Argument Pattern (Toulmin, 1958) was used as a tool to analyse the KF discourse pertaining to students' co-construction of arguments. Preliminary findings from this exploratory study indicated that the fifth-grade students could attain a reasonably good level of argumentation. Possible implications to inform the next cycle of the research study as well as for the teaching and learning of argumentation in Science lessons were also discussed.
Mining distance-based outliers from large databases in any metric space
Authors: Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Let R be a set of objects. An object o ∈ R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric are provided by a user at the run time. The objective is to return all outliers with the smallest I/O cost.This paper considers a generic version of the problem, where no information is available for outlier computation, except for objects' mutual distances. We prove an upper bound for the memory consumption which permits the discovery of all outliers by scanning the dataset 3 times. The upper bound turns out to be extremely low in practice, e.g., less than 1% of R. Since the actual memory capacity of a realistic DBMS is typically larger, we develop a novel algorithm, which integrates our theoretical findings with carefully-designed heuristics that leverage the additional memory to improve I/O efficiency. Our technique reports all outliers by scanning the dataset at most twice (in some cases, even once), and significantly outperforms the existing solutions by a factor up to an order of magnitude.
Succinct representation of flexible and privacy-preserving access rights
Authors: Marina Blanton, Mikhail Atallah
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2006)

We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access control means that the service provider can neither learn what access rights a customer has nor link a request to access an item to a particular customer, thus maintaining privacy of both customer activity and customer access rights. Flexible access rights allow a customer to choose a subset of items or groups of items from the repository, obtain access to and be charged only for the items selected. And portability of access rights means that the rights themselves can be stored on small devices of limited storage space and computational capabilities such as smartcards or sensors, and therefore the rights must be enforced using the limited resources available. In this paper, we present and compare two schemes that address the problem of such access rights. We show that much can be achieved if one allows for even a negligible amount of false positives &#x2013; items that were not requested by the customer, but inadvertently were included in the customer access right representation due to constrained space resources. But minimizing false positives is one of many other desiderata that include protection against sharing of false positives information by unscrupulous users, providing the users with transaction untraceability and unlinkability, and forward compatibility of the scheme. Our first scheme does not place any constraints on the amount of space available on the limited-capacity storage device, and searches for the best representation that meets the requirements. The second scheme, on the other hand, has (modest) requirements on the storage space available, but guarantees a low rate of false positives: with O(mc) storage space available on the smartcard (where m is the number of items or groups of items included in the subscription and c is a selectable parameter), it achieves a rate of false positives of m &#x2212;c .
On the Replacement of Scan Chain Inputs by Primary Input Vectors
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 15th Asian Test Symposium (2006)

We show that the functionality of scan chain inputs sometimes exists in a circuit as part of its functional operation, and can be exhibited by applying specific primary input vectors. By relying on such functionality it is possible to hide scan chains as part of a solution that addresses security. It is also possible to reduce the number of external scan chain inputs that need to be added to the circuit as part of the scan implementation, or remove the need to multiplex primary inputs as scan chain inputs. We define inherent scan in functions to capture the functionality of scan chain inputs that exists in a circuit, and show that they can be computed effectively by simulation. We address the case where multiple scan chains are to be used for the circuit.