ppxscal/embedding_network huggingface dataset:
MetaSockets: design and operation of runtime reconfigurable communication services: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: S. M. Sadjadi, P. K. McKinley, E. P. Kasten, Z. Zhou
Venue: Software&mdash;Practice Experience (2006)

This paper describes the internal architecture and operation of an adaptable communication component called the MetaSocket. MetaSockets are created using Adaptive Java, a reflective extension to Java that enables a component's internal architecture and behavior to be adapted at runtime in response to external stimuli. This paper describes how adaptive behavior is implemented in MetaSockets, as well as how MetaSockets interact with other adaptive components, such as decision makers and event mediators. Results of experiments on a mobile computing testbed demonstrate how MetaSockets respond to dynamic wireless channel conditions in order to improve the quality of interactive audio streams delivered to iPAQ handheld computers. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Building a Distributed Software Environment for the Experiment CDF at UCL Utilising a Switched Light Path
Authors: V. Bartsch, N. Pezzi, M. Lancaster
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The amount of data produced in high energy experiments like CDF (Collider Detector at FNAL (Fermi National Accelerator Laboratory)) [1] requires to distribute the computing and the data for the scientists analysing data of the experiments. Often remote computing resources are shared throughout several high energy experiments, although the underlying grid software differs from experiment to experiment. Here the situation is described for the computing set up at UCL (University College London) for both the local users and all users for the experiment CDF. Grid software and techniques developed for the CDF experiment are used and a dedicated switched light path between FNAL and UCL is utilised.
Modeling information for manufacturing-oriented supply-chain simulations
Authors: Guixiu Qiao, Frank Riddick
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper discusses a new approach that facilitates the use of simulation in supply chain applications, especially for manufacturing-related activities. A neutral information representation methodology, which is based on the eXtensible Markup Language (XML), referred to as the Manufacturing Information Model for Simulation (MIMS), is being developed at NIST to address the needs of information integration and exchange along supply chain applications. This information model can be applied to create a data-driven simulation that supports supply chain optimization. An example of a manufacturing-oriented supply-chain simulation is also discussed.
A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks
Authors: Paolo Santi, Stephan Eidenbenz, Giovanni Resta
Venue: Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks (2006)

We study the problem of building and maintaining a network topology with certain desirable features in a wireless multi-hop network where nodes behave as selfish agents. We first provide examples showing that existing topology control approaches are not resilient to strategic node behavior, indicating the need to consider possible selfish node behavior at the design stage. To this end, we propose a general framework that can be used as a guideline in the design of incentive compatible topology control protocols. As an example of how to apply our framework to specific topology control protocols, we present an incentive compatible distributed algorithm for building the minimum spanning tree (MST), which is a very well-known topology control approach. We test the economic validity of our protocol through simulation of wireless networks under various advanced signal loss models on the physical layer. To the best of our knowledge, this is the first incentive compatible realization of topology control presented in the literature.
The Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics
Authors: Mark de Longueville, Rade T. Živaljević
Venue: Journal of Combinatorial Theory Series A (2006)

This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.
Separation of the Systems for Color and Spatial Manipulation in Working Memory Revealed by a Dual-task Procedure
Authors: Harald M. Mohr, David E.J. Linden
Venue: Journal of Cognitive Neuroscience (2005)

The manipulation of different kinds of content is fundamental to working memory. It has been suggested that the mere maintenance of color and spatial information occurs in parallel, but little is known about whether this holds true for manipulation as well. Using a dual-task delayed-response paradigm that required the manipulation of color and angles, this study finds that the two functions do not interfere. Conversely, interference did occur when both components of a dual-task tapped into the spatial system. Thus, color and spatial information are manipulated in parallel. A concurrent phonological task did not interfere with either maintenance or manipulation, whereas a task requiring central executive processes interfered with manipulation only. We speculate that the ventral&ndash;dorsal dissociation of visual processing is conserved for manipulation processes and that manipulation differs from maintenance in the extent to which is relies on central executive resources.
Human motion analysis in space and time: theory and experiment
Authors: Rama Chellappa, Qinfen Zheng
Venue:  (2006)

Video based human motion analysis has been actively studied over the past decades. We propose novel approaches that are able to analyze human motion under such challenges and apply them to surveillance and security applications. Part I analyses the cyclic property of human motion and presents algorithms to classify humans in videos by their gait patterns. Two approaches are proposed. The first employs the computationally efficient periodogram, to characterize periodicity. In order to integrate shape and motion, we convert the cyclic pattern into a binary sequence using the angle between two legs when the toe-to-toe distance is maximized during walking. Part II further extends the previous approaches to analyze the symmetry in articulation within a stride. A feature that has been shown in our work to be a particularly strong indicator of the presence of pedestrians is the X-junction generated by bipedal swing of body limbs. The proposed algorithm extracts the patterns in spatio-temporal surfaces. In Part III, we present a compact characterization of human gait and activities. Our approach is based on decomposing an image sequence into x-t slices, which generate twisted patterns defined as the Double Helical Signature (DHS). It is shown that the patterns sufficiently characterize human gait and a class of activities. The features of DHS are: (1) it naturally codes appearance and kinematic parameters of human motion; (2) it reveals an inherent geometric symmetry (Frieze Group); and (3) it is effective and efficient for recovering gait and activity parameters. Finally, we use the DHS to classify activities such as carrying a backpack, briefcase, etc. The advantage of using DHS is that we only need a small portion of 3D data to recognize various symmetries.
Contribution of Human Prefrontal Cortex to Delay Performance
Authors: Linda L. Chao, Robert T. Knight
Venue: Journal of Cognitive Neuroscience (1998)

Neurological patients with focal lesions in the dorsolateral prefrontal cortex and age-matched control subjects were tested on an auditory version of the delayed-match-to-sample task employing environmental sounds.Subjects had to indicate whether a cue (S1) and a subsequent target sound (S2) were identical. On some trials, S1 and S2 were separated by a silent period of 5 sec. On other trials,the 5-sec delay between S1 and S2 was filled with irrelevant tone pips that served as distractors. Behaviorally,frontal patients were impaired by the presence of distractors.Electrophysiologically,patients generated enhanced primary auditory cortex-evoked responses to the tone pips, supporting a failure in inhibitory control of sensory processing after prefrontal damage. Intrahemispheric reductions of neural activity generated in the auditory association cortex and additional intrahemispheric reductions of attention-related frontal activity were also observed in the prefrontal patients.Together, these findings suggest that the dorsolateral prefrontal cortex is crucial for gating distracting information as well as maintaining distributed intrahemispheric neural activity during auditory working memory.
Short paths in quasi-random triple systems with sparse underlying graphs
Authors: Joanna Polcyn, Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi
Venue: Journal of Combinatorial Theory Series B (2006)

The regularity lemma for 3-uniform hypergraphs asserts that every large hypergraph can be decomposed into a bounded number of quasi-random structures consisting of a sub-hypergraph and a sparse underlying graph. In this paper we show that in such a quasi-random structure most pairs of the edges of the graph can be connected by hyperpaths of length at most twelve. Some applications are also given.
Patternprogrammer: yet another rule-based programming environment for children
Authors: Tim Wright
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

Graphical rewrite rules are often used in programming environments for children. These rules consist of two parts: a left-hand side, which is visually matched in the environment, and a right hand side, which replaces the matched area. Programs using graphical rewrite rules typically describe behaviour 2D visual simulations where the program describes how visual agents move around a 2D space and interact with other agents. These types of programming environments are very simple yet very powerful.Despite the simplicity of graphical rewrite rules, evaluations of these programming environments have found the environments suffer two flaws. The first flaw is that children have difficulties understanding the implications of the rule scheduler. The second flaw is that children create one or two large rules to describe complex behaviour rather than creating many small rules.This paper presents another rule-based programming environment for children. The environment is designed to avoid these problems at the cost of an intuitive rule matching algorithm. Informal usability tests found that people initially make some mistakes comprehending how Pattern-Programmer applies their rules, but quickly adjust their cognitive model to one that accurately reflects PatternProgrammer's scheduling and matching behaviour.
On-Line Balancing of Horizontally-Range-Partitioned Data in Distributed Spatial Telemetric Data Warehouse
Authors: Marcin Gorawski, Maciej Kaminski
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

An essential issue while designing parallel database systems is to considerably minimize the amount of response time for submitted queries. One of the system's methods to reduce the mentioned time is data load balancing. In this paper, we are going to present a trial of applying load balancing mechanism based on horizontally- range-partitioning schema to a distributed spatial telemetric data warehouse with aR-tree indexing.
Joint scheduling of material handling equipment in automated air cargo terminals
Authors: Henry Y. K. Lau, Ying Zhao
Venue: Computers in Industry (2006)

This paper develops a joint approach to solve the problem of integrated scheduling of different types of material handling equipment in a typical automated air cargo handling system. Due to the nature of the operations, the schedules for different cooperating equipment are highly interactive. In order to formally describe the interactive properties of cooperating equipment, an event framework for the specification of an automated cargo handling system and a model for the integrated scheduling for more than one type of cooperating equipment is developed. A heuristic algorithm, known as the extended maximum-matching algorithm (EMMA), is proposed to solve the joint scheduling problem. The performance of the proposed EMMA is evaluated via extensive numerical studies. Experimental results show that the EMMA can be readily adapted to real-world applications.
Assessment of argument in science education: a critical review of the literature
Authors: Victor D. Sampson, Douglas B. Clark
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Theoretical and empirical research on argumentation in science education has intensified over the last two decades. This article reviews and synthesizes analytical methods used to assess and characterize the nature of rhetorical arguments generated by students as part of this research. This synthesis of the current state of argumentation analysis in science education research provides a comprehensive framework for future research on rhetorical argumentation.
Vessel Crawlers: 3D Physically-based Deformable Organisms for Vasculature Segmentation and Analysis
Authors: Chris McIntosh, Ghassan Hamarneh
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present a novel approach to the segmentation and analysis of vasculature from volumetric medical image data. Our method is an adoption and significant extension of deformable organisms, an artificial life framework for medical image analysis that complements classical deformable models with high-level, anatomically-driven control mechanisms. We extend deformable organisms to 3D, model their bodies as tubular spring-mass systems, and equip them with a new repertoire of sensory modules, behavioral routines, and decision making strategies. The result is a new breed of robust deformable organisms, vessel crawlers, that crawl along vasculature in 3D images, accurately segmenting vessel boundaries, detecting and exploring bifurcations, and providing sophisticated, clinically-relevant structural analysis. We validate our method through the segmentation and analysis of vascular structures in both noisy synthetic and real medical image data.
The Faces of Development: A Review of Early Face Processing over Childhood
Authors: M. J. Taylor, M. Batty, R. J. Itier
Venue: Journal of Cognitive Neuroscience (2004)

The understanding of the adult proficiency in recognizing and extracting information from faces is still limited despite the number of studies over the last decade. Our knowledge on the development of these capacities is even more restricted, as only a handful of such studies exist. Here we present a combined reanalysis of four ERP studies in children from 4 to 15 years of age and adults (n = 424, across the studies), which investigated face processing in implicit and explicit tasks. We restricted these analyses to what was common across studies: early ERP components and upright face processing across all four studies and the inversion effect, investigated in three of the studies. These data demonstrated that processing faces implicates very rapid neural activity, even in young children&mdash; at the P1 component&mdash;with protracted age-related change in both P1 and N170, that were sensitive to the different task demands. Inversion produced latency and amplitude effects on the P1 from the youngest group, but on N170 only starting in mid childhood. These developmental data suggest that there are functionally different sources of the P1 and N170, related to the processing of different aspects of faces.
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs
Authors: Anita Das, B. S. Panda, Rajendra P. Lal
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

A spanning tree T of a graph G is called a tree t-spanner if the distance between any two vertices in T is at most t-times their distance in G. A graph that has a tree tspanner is called a tree t-spanner admissible graph. Given a graph G and an integer t, the tree t-spanner problem asks whether G admits a tree t-spanner. It is known that the tree t-spanner problem is NP-complete for chordal bipartite graphs for t /ge 5 whereas the complexity status of the cases t = 3and t = 4are open. In this paper, we study the tree 3- spanner problem in simple chordal bipartite graphs which is a subclass of chordal bipartite graphs. We have shown that this class need not admit tree 3-spanner in general. First, we present a structural characterization of tree 3- spanner admissible simple chordal bipartite graphs. Based on this characterization, we propose a linear time algorithm to recognize tree 3-spanner admissible simple chordal bipartite graphs. Finally, we present a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible simple chordal bipartite graph.
Distributed Wisdom: What's Wrong with Us?
Authors: Marc Shapiro
Venue: IEEE Distributed Systems Online (2006)

There has been a lot of good distributed-systems research in Europe, yet it seems to have little impact: it doesn't make major publications, colleagues elsewhere haven't heard of it, and industry ignores it. European researchers can change this situation by both working within the system and working to change the system.
Scaling a Dataflow Testing Methodology to the MultiparadigmWorld of Commercial Spreadsheets
Authors: Marc Fisher,  II, Gregg Rothermel, Tyler Creelan, Margaret Burnett
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Spreadsheets are widely used but often contain faults. Thus, in prior work we presented a dataflow testing methodology for use with spreadsheets, which studies have shown can be used cost-effectively by enduser programmers. To date, however, the methodology has been investigated across a limited set of spreadsheet language features. Commercial spreadsheet environments are multiparadigm languages, utilizing features not accommodated by our prior approaches. In addition, most spreadsheets contain large numbers of replicated formulas that severely limit the efficiency of dataflow testing approaches. We show how to handle these two issues with a new dataflow adequacy criterion and automated detection of areas of replicated formulas, and report results of a controlled experiment investigating the feasibility of our approach.
VHDL-Based Simulation of a Parallel Implementation of a Phase-Based Algorithm for Optical Flow
Authors: Yasmine Nagy, Magdy Saeb, Yasser El-Sonbaty
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The computation of optical flow can be an important part in a diverse number of applications. However, optical flow algorithms can be categorized as either very accurate and slow or very fast and highly inaccurate. None of the optical flow algorithms combined both accuracy and efficiency. Among these algorithms was the phase-based fleet and Jepson algorithm. Although this algorithm has proved to produce relatively accurate results, it can not be exploited in many real-life applications due to its relatively long run-time. The goal of this paper is to combine the accuracy of the phase-based optical flow algorithm by Fleet and Jepson and exploit the parallelism and high performance capabilities of the FPGAs to provide an accurate and efficient optical flow algorithm for FPGA-based applications.
Emergence of service-added model in B2C for small-sized companies
Authors: Taro Kamioka, Kazuhiko Yahata
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Independent site administration is not as easy for small-sized companies as it is for large ones in the field of B2C e-commerce from the perspective of limited resources. The most prevalent and effective method of compensating for such limited resources is through participation in organizations such as intermediary sites like online shopping malls. On the other hand, the recent movement in Japan which has caught our attention is the emergence of a scheme where customers who access specific sites are privileged to receive exclusive services. This sort of scheme will be referred to here as the service-added model. Though the idea for the service-added model is very simple, it without a doubt enables small-sized companies to increase the access volume to their sites as well as the chance for interaction between the site and customers. At the same time there is a negative aspect of this movement: that this subsequent increase in access volume may cause small-sized companies to neglect the movement of establishing relationships with customers. Yet it is believed that the service-added model could be a promising choice for the sites of small-sized companies as a future B2C model because it allows them to retain the high degree of freedom regarding decision-making and the use of customer data compared with the intermediary model. The idea is supported by our research on sites adopting the service-added model.
Speech Recognition in Reverberant Environments Using Remote Microphones
Authors: Luca Brayda, Christian Wellekens, Marco Matassoni, Maurizio Omologo
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper addresses distant-talking speech recognition by means of remote sensors in a reverberant room. Recognition performances is investigated for different ways of initializing, steering, and optimizing the related beamformer. Results show how much critical that front-end processing may be in such a challenging setup, according to the different positions and orientations of the speaker.
The Effectiveness of Threshold-Based Scheduling Policies in BOINC Projects
Authors: Trilce Estrada, David A. Flores, Michela Taufer, Patricia J. Teller, Andre Kerstens, David P. Anderson
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Several scientific projects use BOINC (Berkeley Open Infrastructure for Network Computing) to perform largescale simulations using volunteers' computers (workers) across the Internet. In general, the scheduling of tasks in BOINC uses a First-Come-First-Serve policy and no attention is paid to workers' past performance, such as whether or not they have tended to perform tasks promptly and correctly. In this paper we use SimBA, a discrete-event Simulator of BOINC Applications, to study new threshold-based scheduling strategies for BOINC projects that use availability and reliability metrics to classify workers and distribute tasks according to this classification. We show that if availability and reliability thresholds are selected properly, then the workers' throughput of valid results increases significantly in BOINC projects.