ppxscal/embedding_network huggingface dataset:
Frame-level temporal calibration of video sequences from unsynchronized cameras
Authors: Senem Velipasalar, Wayne H. Wolf
Venue: Machine Vision and Applications (2008)

This paper describes a method for temporally calibrating video sequences from unsynchronized cameras by image processing operations, and presents two search algorithms to match and align trajectories across different camera views. Existing multi-camera systems assume that input video sequences are synchronized either by genlock or by time stamp information and a centralized server. Yet, hardware-based synchronization increases installation cost. Hence, using image information is necessary to align frames from the cameras whose clocks are not synchronized. The system built for temporal calibration is composed of three modules: object tracking module, calibration data extraction module, and the search module. A robust and efficient search algorithm is introduced that recovers the frame offset by matching the trajectories in different views, and finding the most reliable match. Thanks to information obtained from multiple trajectories, this algorithm is robust to possible errors in background subtraction and location extraction. Moreover, the algorithm can handle very large frame offsets. A RANdom SAmple Consensus (RANSAC) based version of this search algorithm is also introduced. Results obtained with different video sequences are presented, which show the robustness of the algorithms in recovering various range of frame offsets for video sequences with varying levels of object activity.
Drag-and-dock design pattern
Authors: Paulo Santos, Ademar Aguiar
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

The Drag-And-Dock design pattern provides a structured solution for designing graphical software applications with multiple content views that end users can freely arrange following a dragging and docking interaction approach.
Some Remarks about Modelling of Annular Three-Layered Plate Structure
Authors: Dorota Pawlus
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The evaluation of the influence of the examined mesh structure on the computational results is considered in this paper. The annular plates with three-layered, cross-section structure having the soft core in the range of critical behaviour after loss of static and dynamic stability have been analysed. Several meshes of plate models, which can be applied in numerical calculations have been presented. The results obtained in finite element method have been compared with the results of plates solved using the finite difference method. The analysis has been undertaken in the wide range of the examined problems taking into account not only the global forms of plate critical deformations but also the other local ones and analysing different plate buckling forms with several transverse waves in circumferential direction, too. In the discussion the rate of the sensitivity of the presented plate models depending on their problem application has been noticed.
Java Performance Evaluation Using External Instrumentation
Authors: Georgios Gousios, Diomidis Spinellis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

The performance of programs written in the Java programming language is not trivial to analyse. The Java Virtual Machine hides the details of bytecode execution while not providing an accessible profiling mechanism. Most tools used for Java performance evaluations are based on sampling and only resent engineers with sampled data aggregations. In this paper, we present the Java DTrace Toolkit, a collection of scripts that is specifically designed to assist engineers in identifying the roots of various performance problems observed with other tools.
Applying double auctions for scheduling of workflows on the Grid
Authors: Marek Wieczorek, Stefan Podlipnig, Radu Prodan, Thomas Fahringer
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Grid economy models have long been considered as a promising alternative for the classical Grid resource management, due to their dynamic and decentralized nature, and because the financial valuation of resources and services is inherent in any such model. In particular, auction models are widely used in the existing Grid research, as they are easy to implement and are shown to successfully manage resource allocation on the Grid market. The focus on the current work is on workflow scheduling in the Grid resource allocation model based on Continuous Double Auctions (CDA). We analyze different scheduling strategies that can be applied by the user to execute workflows in such an environment, and try to identify the general behavioral patterns that can lead to a fast and cheap workflow execution. In the experimental study, we show that under certain circumstances some benefit can be gained by applying an "aggressive" scheduling strategy.
Crowd analysis: a survey
Authors: Beibei Zhan, Dorothy N. Monekosso, Paolo Remagnino, Sergio A. Velastin, Li-Qun Xu
Venue: Machine Vision and Applications (2008)

In the year 1999 the world population reached 6 billion, doubling the previous census estimate of 1960. Recently, the United States Census Bureau issued a revised forecast for world population showing a projected growth to 9.4 billion by 2050 (US Census Bureau, http://www.census.gov/ipc/www/worldpop.html). Different research disci- plines have studied the crowd phenomenon and its dynamics from a social, psychological and computational standpoint respectively. This paper presents a survey on crowd analysis methods employed in computer vision research and discusses perspectives from other research disciplines and how they can contribute to the computer vision approach.
A Mixed Approach for Data Warehouse Conceptual Design with MDA
Authors: Leopoldo Zepeda, Matilde Celma, Ramon Zatarain
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper is developed in the context of conceptual design of Data Warehoses (DWs) with Model Driven Architecture (MDA) (a methodology for DW conceptual design). The method is made up of a set of transformation rules as a mechanism to extract multidimensional schemas from the conceptual description of the operational database. Next the generation of multidimensional schemas, we apply user requirements to guide the selection of the multidimensional schema that is supported by the operational database and most likely satisfy user requirements.
VeryIDX - A Digital Identity Management System for Pervasive Computing Environments
Authors: Federica Paci, Elisa Bertino, Sam Kerr, Aaron Lint, Anna Squicciarini, Jungha Woo
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The problem of identity theft, that is, the act of impersonating others' identities by presenting stolen identifiers or proofs of identities, has been receiving increasing attention because of its high financial and social costs. In this paper we address such problem by proposing an approach to manage user identity attributes by assuring their privacy-preserving usage. The approach is based on the concept of privacy preserving multi-factor authentication achieved by a new cryptographic primitive which uses aggregate signatures on commitments that are then used for aggregate zero-knowledge proof of knowledge (ZKPK) protocols. We present the implementation of such approach on Nokia NFC cellular phones and report performance evaluation results.
User-Based Constraint Strategy in Ontology Matching
Authors: Feiyu Lin, Kurt Sandkuhl
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Ontologies, as essential elements of the semantic web, have been developed for various purposes and in many different domains. Many ontologies are quite extensive and sophisticated, capturing essential knowledge in a domain. However, ontology users or engineers do not only use their own ontologies, but also want to integrate or adapt other ontologies, or even apply multiple ontologies to solve a problem. As ontologies themselves can be heterogenous, it is necessary to find ways to integrate various ontologies and enable cooperation between them. Ontology matching for finding similar parts in the source ontologies or finding translation rules between ontologies is an important first step. Different strategies (e.g., string similarity, synonyms, structure similarity and based on instances) for determining similarity between entities are used in current ontology matching systems.A lot of existing research work in automatic matching does not sufficiently take into account the user's requirements in the ontology matching process. In real world, the user's or domain expert's requirements play an important role. In this paper, we propose to integrate user-based constraint strategy in ontology matching. The proposed approach includes excluding rules, dominant key and extended key definition and extended key aggregation.
System Description: Spass Version 3.0
Authors: Christoph Weidenbach, Renate A. Schmidt, Thomas Hillenbrand, Rostislav Rusev, Dalibor Topic
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Spass is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in Spass 3.0, including support for dynamic modal logics, relational logics and expressive description logics, additional renaming and selection strategies, and significant interface enhancements for human and machine users.
Growth Optimal Investment with Transaction Costs
Authors: László Györfi, István Vajda
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

Discrete time infinite horizon growth optimal investment in stock markets with transactions costs is considered. The stock processes are modelled by homogeneous Markov processes. Assuming that the distribution of the market process is known, we show two recursive investment strategies such that, in the long run, the growth rate on trajectories (in "liminf" sense) is greater than or equal to the growth rate of any other investment strategy with probability 1.
Computer-Based Office Work: Stories of Gender, Design, and Use
Authors: Linda Stepulevage
Venue: IEEE Annals of the History of Computing (2003)

This article uses autobiographical stories to explore the boundaries between the design and use of computer-based office work systems in the US and Great Britain. Office automation systems were introduced in the 1970s and microcomputers and local networks in the early 1980s. In both periods, gender relations in the workplace were significant in the construction of boundaries between design and use.
Task Hibernation in a Formal Model of Agent-Oriented Computing Systems
Authors: Maciej Smołka
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The paper contains recent enhancements of a formal model of agent-based computing systems. In such systems a computational task together with its data is enveloped in a shell to form a mobile agent. The shell carries the agent's logic, ie. abilities to make decisions about whether to migrate to a less loaded machine, split oneself or continue the task. The model describes an agent-based computational application as a controlled Markov chain. In this paper the operation of the agent hibernation, which is the last resort in the case of a server overload, is included in the model. This modification has an influence on the form of the state equations as well as the form of admissible control strategies.
SMASH: Modular Security for Mobile Agents
Authors: Adam Pridgen, Christine Julien
Venue: Software Engineering for Multi-Agent Systems V: Research Issues and Practical Applications (2007)

Mobile agent systems of the future will be used for secure information delivery and retrieval, off-line searching and purchasing, and even system software updates. As part of such applications, agent and platform integrity must be maintained, confidentiality between agents and the intended platform parties must be preserved, and accountability of agents and their platform counterparts must be stringent. SMASH, Secure Modular Mobile Agent System.H, is an agent system designed using modular components that allow agents to be easily constructed and the system to be easily extended. To facilitate security functionality, the SMASH platform incorporates existing hardware and software security solutions to provide access control, accountability, and integrity. Agents are further protected using a series of standard cryptographic functions. While SMASH promotes high assurance applications, the system also promotes an open network environment, permitting agents to move freely among the platforms and execute unprivileged actions without authenticating. In this paper, we elaborate on the components and capabilities of SMASH and present an application that benefits from each of these elements.
Development of the Multi-target Tracking Scheme Using Particle Filter
Authors: Yang Weon Lee
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper introduces a particle filter algorithm determining the measurement-track association problem in multi-target tracking. This scheme is important in providing a computationally feasible alternative to complete enumeration of JPDA which is intractable. We have proved that given an artificial measurement and track's configuration, particle filter scheme converges to a proper plot in a finite number of iterations. Also, a proper plot which is not the global solution can be corrected by re-initializing one or more times. In this light, even if the performance is enhanced by using the particle filter, we also note that the difficulty in tuning the parameters of the particle filter is critical aspect of this scheme. The difficulty can, however, be overcome by developing suitable automatic instruments that will iteratively verify convergence as the network parameters vary. 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
The Dynamics of Affective Transitions in Simulation Problem-Solving Environments
Authors: Ryan S. Baker, Ma. Mercedes Rodrigo, Ulises E. Xolocotzin
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

We analyze the antecedents of affective states in a simulation problem-solving environment, The Incredible Machine: Even More Contraptions, through quantitative field observations of high school students in the Philippines using that system. We investigate the transitions between affective states over time, finding that several affective states, including flow, boredom, and frustration, but not surprise, tend to persist over for relatively long periods of time. We also investigate how students' usage choices influence their later affect, finding that gaming the system leads to reduced confusion but increased boredom.
Organizational Knowledge Sources Integration through an Ontology-Based Approach: The Onto-DOM Architecture
Authors: Mariel Alejandra Ale, Cristian Gerarduzzi, Omar Chiotti, Maria Rosa Galli
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Nowadays, there is a large number of Knowledge Management (KM) initiatives implemented in organizations, which often fail to manage the natural heterogeneity of organizational knowledge sources. To address heterogeneity, documentation overload and lack of context we propose Onto-DOM, a question-answering ontology-based strategy implemented within a Distributed Organizational Memory. Onto-DOM is a portable question-answering system that accepts natural language queries and, using a domain ontology, transforms and contextualizes the query eliminating the inherent natural language ambiguity. At the same time, it recovers those knowledge objects that are most likely to contain the answer.
Type-safe computation with heterogeneous data
Authors: Freeman Yufei Huang
Venue:  (2007)

Computation with large-scale heterogeneous data typically requires universal traversal to search for all occurrences of a substructure that matches a possibly complex search pattern, whose context may be different in different places within the data. Both aspects cause difficulty for existing general-purpose programming languages, because these languages are designed for homogeneous data and have problems typing the different substructures in heterogeneous data and the complex patterns to match with the substructures. Programmers either have to hard-code the structures and search patterns, preventing programs from being reusable and scalable, or have to use low-level untyped programming or programming with special-purpose query languages, opening the door to type mismatches that cause a high risk of program correctness and security problems. This thesis invents the concept of pattern structures, and proposes a general solution to the above problems&mdash;a programming technique using pattern structures. In this solution, well-typed pattern structures are defined to represent complex search patterns, and pattern searching over heterogeneous data is programmed with pattern parameters, in a statically-typed language that supports first-class typing of structures and patterns. The resulting programs are statically-typed, highly reusable for different data structures and different patterns, and highly scalable in terms of the complexity of data structures and patterns. Adding new kinds of patterns for an application no longer requires changing the language in use or creating new ones, but is only a programming task. The thesis demonstrates the application of this approach to, and its advantages in, two important examples of computation with heterogeneous data, i.e., XML data processing and Java bytecode analysis. Keywords: pattern structure, Pattern Calculus, generic programming, heterogeneous data, type safety, XML processing, Java bytecode checking.
Individual Reuse in Description Logic Reasoning
Authors: Boris Motik, Ian Horrocks
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. To address this, we propose a tableau calculus with individual reuse: to satisfy an existential assertion, our calculus nondeterministically tries to reuse individuals from the model generated thus far. We present two expansion strategies: one is applicable to the DL $\mathcal{ELOH}$ and gives us a worst-case optimal algorithm, and the other is applicable to the DL $\mathcal{SHOIQ}$. Using this technique, our reasoner can process several KBs that no other reasoner can.
Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
Authors: Kewei Tu, Vasant Honavar
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

This paper presents PCFG-BCL, an unsupervised algorithm that learns a probabilistic context-free grammar (PCFG) from positive samples. The algorithm acquires rules of an unknown PCFG through iterative biclustering of bigrams in the training corpus. Our analysis shows that this procedure uses a greedy approach to adding rules such that each set of rules that is added to the grammar results in the largest increase in the posterior of the grammar given the training corpus. Results of our experiments on several benchmark datasets show that PCFG-BCL is competitive with existing methods for unsupervised CFG learning.
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
Authors: Tamás Horváth, Jan Ramon
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the general case. If, however, the transaction graphs are restricted to forests then the problem becomes tractable. In this paper we generalize the positive result on forests to graphs of bounded treewidth. In particular, we show that for this class of transaction graphs, frequent connected subgraphs can be listed in incremental polynomial time. Since subgraph isomorphism remains NP-complete for bounded treewidth graphs, the positive complexity result of this paper shows that efficient frequent pattern mining is possible even for computationally hard pattern matching operators.
Placement Inference for a Client-Server Calculus
Authors: Matthias Neubauer, Peter Thiemann
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Placement inference assigns locations to operations in a distributed program under the constraints that some operations can only execute on particular locations and that values may not be transferred arbitrarily between locations. An optimal choice of locations additionally minimizes the run time of the program, given that operations take different time on different locations and that a cost is associated to transferring a value from one location to another.We define a language with a time- and location-aware semantics, formalize placement inference in terms of constraints, and show that solving these constraints is an NP-complete problem. We then show that optimal placements are computable via a reformulation of the semantics in terms of matrices and an application of the max-plus spectral theory. A prototype implementation validates our results.
Does Judgement of Haptic Virtual Texture Roughness Scale Monotonically with Lateral Force Modulation?
Authors: Gianni Campion, Andrew H. Gosline, Vincent Hayward
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We describe experiments that compared the perceived relative roughness of textured virtual walls synthesized with an accurately controlled haptic interface. Texture was modeled as a spatially modulated sinusoidal friction grating. The results indicate that both the modulation depth of the grating (A), and the coefficient of friction (μ) are strongly associated with the perceived roughness when increasing either A or μ. Changing the spatial period of the grating (l), however, did not yield consistent relative roughness judgement results, indicating that there is a weaker association.