ppxscal/embedding_network huggingface dataset:
Multi-model motion tracking under multiple team member actuators
Authors: Yang Gu, Manuela Veloso
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Autonomous robots need to track objects. Object tracking relies on predefined robot motion and sensory models. Tracking is particularly challenging if the robots can actuate on the object to be tracked, as the motion can become highly discontinuous and nonlinear. We have previously developed a successful tracking approach that switches among target motion models as a function of one robot's actions. In this paper, we consider the object to be effected by a team of agents. We contribute on our team-based tracking method that can use a dynamic multi-motion model based on a team coordination plan. We present the multi-target multi-model probabilistic tracking algorithm in detail and present empirical results both in simulation and in a human-robot Segway soccer team. The team coordination plan allows the robot to much more effectively track mobile targets.
Verification of a Data Synchronization Circuit For All Time
Authors: Geoffrey M. Brown
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

This paper presents a model and automated proof for a synchronizer circuit that is commonly used to reliably transfer data across clock domains. In contrast with previous work, this paper describes a proof that is valid for all clock rates and phases meeting modest constraints. Furthermore, the proof was realized with an existing model checkerSAL.
Randomly generated intersecting hypergraphs II
Authors: Tom Bohman, Alan Frieze, Ryan Martin, Miklós Ruszinkó, Cliff Smyth
Venue: Random Structures Algorithms (2007)

Let c be a positive constant. Suppose that r = o(n5/12) and the members of $({{[n]}\atop r})$ are chosen sequentially at random to form an intersecting hypergraph ${\cal H}$. We show that whp (A sequence of events ${\cal E}_1,\ldots,{\cal E}_n,\ldots$ is said to occur with high probability (whp) $\lim_{n\to\infty}\Pr({\cal E}_n)=1$.) ${\cal H}$ consists of a simple hypergraph ${\cal S}$ of size &tilde;(r/n1/3), a distinguished vertex v and all r-sets that contain v and meet every edge of ${\cal S}$. This is a continuation of the study of such random intersecting systems started in (Bohman et al., Electronic J Combinatorics (2003) R29) where the case r = O(n1/3) was considered. To obtain the stated result we continue to investigate this question in the range &Eacute;(n1/3) d r d o(n5/12). &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Detecting Bilateral Symmetry in Perspective
Authors: Hugo Cornelius, Gareth Loy
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

A method is presented for efficiently detecting bilateral symmetry on planar surfaces under perspective projection. The method is able to detect local or global symmetries, locate symmetric surfaces in complex backgrounds, and detect multiple incidences of symmetry. Symmetry is simultaneously evaluated across all locations, scales, orientations and under perspective skew. Feature descriptors robust to local affine distortion are used to match pairs of symmetric features. Feature quadruplets are then formed from these symmetric feature pairs. Each quadruplet hypothesises a locally planar 3D symmetry that can be extracted under perspective distortion. The method is posed independently of a specific feature detector or descriptor. Results are presented demonstrating the efficacy of the method for detecting bilateral symmetry under perspective distortion. Our unoptimised Matlab implementation, running on a standard PC, requires of the order of 20 seconds to process images with 1,000 feature points.
Qualitative research projects in computing education research: an overview
Authors: Anders Berglund, Mats Daniels, Arnold Pears
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

Qualitative research approaches have much to offer computing education research (CER). Conducting studies which are theoretically anchored in pedagogy, as well as in computing, can help us to draw more solid and significant conclusions about how students learn computing. When studying teaching and learning situations it is important to take into explicit account what is meant by learning. We claim that this implies that research into student learning is strengthened by increased awareness of the role and relevance of qualitative research approaches in CER.With this aim in mind we identify the area of "pedagogically anchored qualitative research" and place it within the broader CER landscape. We also provide an overview of research methods and resulting studies, which we feel exemplify the value this type of study has for the CER community.
Temporal Allocation of Visual Attention in Adult Attention Deficit Hyperactivity Disorder
Authors: Deidre E. Hollingsworth, Sean P. Mcauliffe, Barbara J. Knowlton
Venue: Journal of Cognitive Neuroscience (2001)

In two experiments, we examined the ability of adults with attention deficit hyperactivity disorder (ADHD) to process multiple targets appearing in a rapid serial visual presentation (RSVP) stream. Using a standard attentional blink (AB) task, subjects were required to both identify a target in the RSVP stream and detect a probe appearing in one of several posttarget serial positions. In Experiment 1, ADHD adults exhibited a protracted AB compared to controls, in that their probe detection did not improve as a function of increasing probe-to-target intervals (450&ndash;720 msec). In Experiment 2, the ADHD group performed as well as controls in detecting probes appearing immediately (i.e., 90 msec) after the target. Taken together, the results demonstrate that adults with ADHD exhibit a selective deficit in rapidly shifting attention between the target and the probe, when the two appear several hundred milliseconds apart. These results suggest that adults with ADHD can use automatic (reflexive) attention to detect items in close temporal proximity in the RSVP stream, but have difficulty allocating controlled attention to multiple stimuli separated by several hundred milliseconds.
A Tale of Two Writing Teams
Authors: Stacia Heimgartner, Melody Locke
Venue: Proceedings of the conference on AGILE 2006 (2006)

Our report compares and contrasts the Agile experiences of technical writers from two companies. In both cases, the writers had to integrate themselves into medium-sized Agile development projects. However, the writing teams differed in their approaches during the necessary transition and integration to the Agile methodology. Writers assigned to these Agile projects found themselves adapting to new team dynamics in ways that were quite agile, including creative time-slicing, scaling across multiple teams, and finding ways to save time while focusing on business value. We also found that, even though writers can be uncomfortable while adapting the documentation process to conform to Agile practices, they can rise to the challenges and assist their product teams in becoming more proficient and efficient in an Agile world. For writers to become truly agile, their management must invest in the tools, technologies, and personnel to enable their writer--and overall project team--to succeed.
Data dissemination techniques for distributed simulation environments
Authors: Bryan Horling, Victor Lesser
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Farm is a distributed simulation environment for modeling the performance of large-scale multi-agent systems. It uses a component-based architecture to distribute the computational load of the simulation and improve running time. It also supports a global data repository, which permits both actors running in the simulator and external analysis components to generate and use arbitrary pieces of information. Because the components are distributed, the manner in which this data is accessed can have significant effect on the communication overhead and duration of the simulation. In this paper we explore several different techniques for accessing and disseminating this data. Analytic and empirical models of the system's performance are presented, along with an analysis of which strategy is appropriate under different conditions.
Analysis of cluttered scenes using an elastic matching approach for stereo images
Authors: Christian Eckes, Jochen Triesch, Christoph von der Malsburg
Venue: Neural Computation (2006)

We present a system for the automatic interpretation of cluttered scenes containing multiple partly occluded objects in front of unknown, complex backgrounds. The system is based on an extended elastic graph matching algorithm that allows the explicit modeling of partial occlusions. Our approach extends an earlier system in two ways. First, we use elastic graph matching in stereo image pairs to increase matching robustness and disambiguate occlusion relations. Second, we use richer feature descriptions in the object models by integrating shape and texture with color features. We demonstrate that the combination of both extensions substantially increases recognition performance. The system learns about new objects in a simple one-shot learning approach. Despite the lack of statistical information in the object models and the lack of an explicit background model, our system performs surprisingly well for this very difficult task. Our results underscore the advantages of view-based feature constellation representations for difficult object recognition problems.
Timed-MPSG: A Formal Model for Real-Time Shop Floor Controller
Authors: Devinder Thapa, Jaeil Park, Gi-Nam Wang, Dongmin Shin
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The MPSG (Message-based Part State Graph) model has been developed for the execution portion of shop-floor controllers that operate in a distributed and hierarchical control environment. It describes the behavior of a controller from the parts' point of view, and each part within the domain of the controller is in a particular 'state' as described by the MPSG for that controller. It is based on deterministic finite state automata and represents the execution module of shop-floor controller as a communicating finite state machine. However, there is still no consideration for handling the time in this framework. We propose an extension of temporal properties in MPSG to model the real-time shop floor controller. It has been christened as a Timed-MPSG. It is a novel approach to deal with the auto generation of real time based controller logic for hierarchical and distributed shop floor system. In this paper we have described the conceptual idea and formal model of Timed-MPSG with suitable examples.
Semantic Map of Services for Structural Bioinformatics
Authors: Pierre Tuffery, Zoe Lacroix, Herve Menager
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

We present a Semantic Map of resources for Structural Bioinformatics applied to proteins, i.e., various methods to predict and analyze protein structures in silico. Our map depicts resources on two levels: a logical level that provides a high-level description of the scientific concepts using a domain ontology; a physical level, that describes the actual resources implementing these connections. Scientists can use our system to express a query that captures their scientific aim, and are guided to identify the resources best meeting their needs. It is intended to provide scientists a tool to register and share knowledge about the available services in this field. Our approach addresses the problem of semantic interoperability of scientific resources publicly available on the web.
A fast shot matching strategy for detecting duplicate sequences in a television stream
Authors: Xavier Naturel, Patrick Gros
Venue: Proceedings of the 2nd international workshop on Computer vision meets databases (2005)

This article presents a method for detecting duplicate sequences in a continuous television stream. This is of interest to many applications, including commercials monitoring and video indexing. Repetitions can also be used as a way of structuring television streams by detecting inter-program breaks as a set of duplicate sequences. In this context, we present a shot-based method for detecting repeated sequences efficiently. Experiments show that this fast shot matching strategy allows us to retrieve duplicated shots between a 1 hour long query and a 24 hours database in only 10 ms.
Out-of-core frequent pattern mining on a commodity PC
Authors: Gregory Buehrer, Srinivasan Parthasarathy, Amol Ghoting
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset mining algorithms and their drawbacks, we introduce our efficient, highly scalable solution. Presented in the context of the FPGrowth algorithm, our technique involves several novel I/O-conscious optimizations, such as approximate hash-based sorting and blocking, and leverages recent architectural advancements in commodity computers, such as 64-bit processing. We evaluate the proposed optimizations on truly large data sets,up to 75GB, and show they yield greater than a 400-fold execution time improvement. Finally, we discuss the impact of this research in the context of other pattern mining challenges, such as sequence mining and graph mining.
A strategy for autogeneration of space shuttle ground processing simulation models for project makespan estimation
Authors: Michael G. Madden, Roberta Wyrick, Dale E. O'Neill
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Space Shuttle Processing is a complicated and highly variable project. The planning and scheduling problem, categorized as a Resource Constrained - Stochastic Project Scheduling Problem (RC-SPSP), has a great deal of variability in the Orbiter Processing Facility (OPF) process flow from one flight to the next. Simulation Modeling is a useful tool in estimation of the makespan of the overall process. However, simulation requires a model to be developed, which itself is a labor and time consuming effort. With such a dynamic process, often the model would potentially be out of synchronization with the actual process, limiting the applicability of the simulation answers in solving the actual estimation problem. Integration of TEAMS model enabling software with our existing schedule program software is the basis of our solution. This paper explains the approach used to develop an auto-generated simulation model from planning and schedule efforts and available data.
Smart-aloha for multi-hop wireless networks
Authors: Harkirat Singh, Suresh Singh
Venue: Mobile Networks and Applications (2005)

This paper presents a novel slotted ALOHA-based protocol for use in ad hoc networks where nodes are equipped with adaptive array smart antennas. The protocol relies on the ability of the antenna and DoA (Direction of Arrival) algorithms to identify the direction of transmitters and then beamform appropriately to maximize SINR (Signal to Interference and Noise Ratio) at the receiver. The performance of the protocol is evaluated using analytical modeling as well as detailed simulation in OPNET and Matlab where we demonstrate the benefits of using smart antennas. The impact of using different number of antenna elements is also studied for this environment.
Invariances in kernel methods: From samples to objects
Authors: Alexei Pozdnoukhov, Samy Bengio
Venue: Pattern Recognition Letters (2006)

This paper presents a general method for incorporating prior knowledge into kernel methods such as support vector machines. It applies when the prior knowledge can be formalized by the description of an object around each sample of the training set, assuming that all points in the given object share the same desired class. A number of implementation techniques of this method, based on hard geometrical objects and soft objects based on distributions are considered. Tangent vectors are extensively used for object construction. Empirical results on one artificial dataset and two real datasets of electro-encephalogram signals and face images demonstrate the usefulness of the proposed method. The method could establish a foundation for an information retrieval and person identification systems.
A dynamic finite volume scheme for large-eddy simulation on unstructured grids
Authors: M. Ciardi, P. Sagaut, M. Klein, W. N. Dawes
Venue: Journal of Computational Physics (2005)

In recent years there has been considerable progress in the application of large-eddy simulation (LES) to increasingly complex flow configurations. Nevertheless a lot of fundamental problems still need to be solved in order to apply LES in a reliable way to real engineering problems, where typically finite-volume codes on unstructured meshes are used. A self-adaptive discretisation scheme, in the context of an unstructured finite-volume flow solver, is investigated in the case of isotropic turbulence at infinite Reynolds number. The Smagorinsky and dynamic Smagorinsky sub-grid scale models are considered. A discrete interpolation filter is used for the dynamic model. It is one of the first applications of a filter based on the approach presented by Marsden et al. In this work, an original procedure to impose the filter shape through a specific selection process of the basic filters is also proposed. Satisfactory results are obtained using the self-adaptive scheme for implicit LES. When the scheme is coupled with the sub-grid scale models, the numerical dissipation is shown to be dominant over the sub-grid scale component. Nevertheless the effect of the sub-grid scale models appears to be important and beneficial, improving in particular the energy spectra. A test on fully developed channel flow at Re"@t=395 is also performed, comparing the non-limited scheme with the self-adaptive scheme for implicit LES. Once again the introduction of the limiter proves to be beneficial.
Design of Maximizing Clustered Sensor Network Lifetime
Authors: Yan-liang Jin, Yi-fan Jiang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Network lifetime is an important problem in sensor networks. The clustered method can enhance the efficient utilization of the limited energy resources of the deployed sensor nodes. In this paper, we describe the network lifetime as a function of the communication and data aggregation (DA) energy consumption and analyze the lifetimes of different transmission schemes in the homogeneous sensor networks. The analysis carried out in this paper would provide the guidelines for network deployment and protocol design in the future applications.
Achieving subspace or key security for WOA using natural or circular watermarking
Authors: Patrick Bas, François Cayre
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

This paper presents two watermarking schemes that are secure when considering the Watermarked content Only Attack (WOA) framework. The definition of watermark security is first recalled and the distinction between key-security and subspace- security classes for Spread Spectrum (SS) watermarking schemes is presented afterwards. Blind source separation techniques are also recalled as a tool to assess the security of a SS watermarking scheme and prove that classical SS and Improved SS are not secure within the WOA framework. To further illustrate these security issues, we next build on a new watermarking scheme called Natural Watermarking (NW). We prove it to be subspace-secure under specific hypotheses. Natural watermarking does not change the Gaussian natural distributions of the projection of each carriers. Furthermore NWprevents estimations both of the watermark subspace (subspace-security) and the different carriers (key-security). We then extend the nice properties of NW to derive the more general family of Circular Watermarking schemes which are key-secure and may offer a better robustness to AWGN attack than NW. An implementation of CW based on ISS is next proposed and comparison of bit error rates for NW, CW, SS and ISS finally draws some conclusions on the robustness cost to achieve security.
Study of social consciousness in stochastic agent based simulations: application to supply chains
Authors: Thierry Moyaux, Brahim Chaib draa, Sophie d'Amours
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Empirical game theory allows studying the strategic interactions of agents in simulations. Specifically, traditional game theory describes such interactions by an analytical model, while empirical game theory employs simulations. In this paper, we use empirical game theory to study how the more-or-less selfishness of agents affects their behaviour. To this end, we assume that every agent utility can be split in two parts, a first part representing the direct utility of agents and a second part representing agent social consciousness, i.e., their impact on the rest of the multiagent system. An application to supply chains illustrates this approach. In this application, the collaborative strategy is often used by every company-agent at whatever their same level of social consciousness, which may indicate that every agent is strongly related with one other.
Why physicians do or do not use computerized physican order entry systems: applying the technology acceptance model
Authors: Patrick D. Pauken
Venue:  (2006)

This study addresses post-implementation usage behavior of Computerized Physician Order Entry (CPOE) system among physicians in an organization by applying the Technology Acceptance Model (TAM). Implementation of CPOE is considered a major organizational activity by chief information officers (Kini Savage, 2004), and physician acceptance of CPOE ultimately decides the success of CPOE implementation (Davis, 1989). Hence, this study assumes much importance. A CPOE-TAM instrument was developed for this study and assessed with principal component analysis. Six hypotheses were developed and tested using hierarchical multiple regressions. Study results suggest that the 'total causal effects' of perceived usefulness of CPOE (PU) and perceived ease of use of CPOE (PEOU) on behavioral intention to use CPOE (BI) and CPOE adoption are striking, and PU is more important than PEOU in their relative influence on BI and CPOE adoption. Implications of the findings suggest that training sessions need to emphasize 'usefulness' of CPOE and any increase in ease of use features of CPOE would directly influence usefulness of CPOE, which in turn influence BI and CPOE adoption. Studying the adoption of CPOE within an organizational context among physicians by applying TAM contributes richly to research literature in these major domains. This CPOE-TAM study was well-validated, and a parsimonious CPOE-TAM instrument is now available to information system and human-computer interaction researchers and practitioners. This CPOE-TAM instrument could be split further into two instruments: one for prediction of future acceptance of CPOE, and the other for explanation of CPOE adoption.