ppxscal/embedding_network huggingface dataset:
Thermo-visual feature fusion for object tracking using multiple spatiogram trackers
Authors: Ciar&#x00e1;n &#x00d3; Conaire, Noel E. O&#x2019;Connor, Alan Smeaton
Venue: Machine Vision and Applications (2008)

In this paper, we propose a framework that can efficiently combine features for robust tracking based on fusing the outputs of multiple spatiogram trackers. This is achieved without the exponential increase in storage and processing that other multimodal tracking approaches suffer from. The framework allows the features to be split arbitrarily between the trackers, as well as providing the flexibility to add, remove or dynamically weight features. We derive a mean-shift type algorithm for the framework that allows efficient object tracking with very low computational overhead. We especially target the fusion of thermal infrared and visible spectrum features as the most useful features for automated surveillance applications. Results are shown on multimodal video sequences clearly illustrating the benefits of combining multiple features using our framework.
A Compact Computing Environment for a Windows Cluster: Giving Hints and Assisting Job Execution
Authors: Yuichi Tsujita, Takuya Maruyama, Yuhei Onishi
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Windows Compute Cluster Server 2003 [1] (hereafter Windows CCS) has been focused to build and utilize a PC cluster with high availability and a Windows graphical user interface (GUI). The Windows CCS consists of an operating system and an add-on software toolkit. The former is Windows Server 2003, Compute Cluster Edition and the latter is Compute Cluster Pack. The Compute Cluster Pack provides many useful software tools such as a well-tuned MPI [2] library named MS-MPI [1] and a job scheduler.
From 'La Piazza' to 'Puente': How place, people and technology make intergenerational learning
Authors: F. Decortis, E. Ackermann, M. Barajas, R. Magli, M. Owen, G. Toccafondi
Venue: International Journal of Technology Enhanced Learning (2008)

The divide between generations and the need to integrate aging populations through life wide learning strategies have been evidenced by researches and policy documents. Yet, the lack of mutually beneficial learning practices calls for innovative solutions to prevent societal fragmentation. In 'La Piazza' the purpose was to identify good practices through the use of case studies and interaction design techniques and gauge the potential of digital technologies as enablers of intergenerational learning. In 'Puente', the goal is to further explore the transformative power of existing good practices and to provide guidelines for the design of environments in which young and old can grow in connection.
Level-of-Detail Triangle Strips for Deforming Meshes
Authors: Francisco Ramos, Miguel Chover, Jindra Parus, Ivana Kolingerova
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Applications such as video games or movies often contain deforming meshes. The most-commonly used representation of these types of meshes consists in dense polygonal models. Such a large amount of geometry can be efficiently managed by applying level-of-detail techniques and specific solutions have been developed in this field. However, these solutions do not offer a high performance in real-time applications. We thus introduce a multiresolution scheme for deforming meshes. It enables us to obtain different approximations over all the frames of an animation. Moreover, we provide an efficient connectivity coding by means of triangle strips as well as a flexible framework adapted to the GPU pipeline. Our approach enables real-time performance and, at the same time, provides accurate approximations.
Transactional Reduction of Component Compositions
Authors: Serge Haddad, Pascal Poizat
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Behavioural protocols are beneficial to Component-Based Software Engineering and Service-Oriented Computing as they foster automatic procedures for discovery, composition, composition correctness checking and adaptation. However, resulting composition models (e.g., orchestrations or adaptors) often contain redundant or useless parts yielding the state explosion problem. Mechanisms to reduce the state space of behavioural composition models are therefore required. While reduction techniques are numerous, e.g., in the process algebraic framework, none is suited to compositions where provided/required services correspond to transactions of lower-level individual event based communications. In this article we address this issue through the definition of a dedicated model and reduction techniques. They support transactions and are therefore applicable to service architectures.
The Computing Program of the Office of Naval Research, 1946-1953
Authors: Mina Rees
Venue: IEEE Annals of the History of Computing (1982)

The computing program of the Office of Naval Research was concerned primarily with numerical analysis and with computers developed at universities; but ONR also participated in the National Bureau of Standards program, under which the UNIVAC was successfully produced commercially for the Census Bureau and the SEAC and SWAC were constructed at NBS. By 1953, ONR's principal computer projects, at the Institute for Advanced Study and at MIT, had produced important results; numerical analysis had emerged as a respectable field of mathematical research; and large commercial companies, which had held back in the immediate postwar years, had committed themselves to the manufacture of computers. 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
A Computational Model of the Amygdala Nuclei's Role in Second Order Conditioning
Authors: Francesco Mannella, Stefano Zappacosta, Marco Mirolli, Gianluca Baldassarre
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

The mechanisms underlying learning in classical conditioning experiments play a key role in many learning processes of real organisms. This paper presents a novel computational model that incorporates a biologically plausible hypothesis on the functions that the main nuclei of the amygdala might play in first and second order classical conditioning tasks. The model proposes that in these experiments the first and second order conditioned stimuli (CS) are associated both (a) with the unconditioned stimuli (US) within the basolateral amygdala (BLA), and (b) directly with the unconditioned responses (UR) through the connections linking the lateral amygdala (LA) to the central nucleus of amygdala (CeA). The model, embodied in a simulated robotic rat, is validated by reproducing the results of first and second order conditioning experiments of both sham-lesioned and BLA-lesioned real rats.
A Personalized Approach to Experience-Aware Service Ranking and Selection
Authors: Friederike Klan, Birgitta König-Ries
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

Existing approaches to service ranking and selection evaluate the suitability of available services for a given request based on the advertisement created by the service provider. They will compare how well the advertisement matches the service request and will choose the service with the best matching advertisement. Unfortunately, at this point in time, it is uncertain whether the service that will actually be performed will match the request as well as the advertisement promised. In this paper, we present an approach that reduces the degree of this uncertainty by taking previous experiences with the service provider (which reflect the performance of the actual service not the advertisement) into account. Contrary to many other approaches our solution accounts for the subjective nature of rating-based experiences by considering the preferences of the experience creators. Moreover it exploits the number of available experiences more effectively by considering not only experiences for a given service, but also experiences for similar services of the same provider. Our solution utilizes indirect user information and avoids explicit sharing of personal consumer information.
Modeling molecular polarizabilities with graph-theoretical concepts
Authors: Lionello Pogliani
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding dual indices. The descriptive power of these indices and of the higher-order terms they give rise, was tested when the basis indices were derived by the aid of odd complete graphs. This last type of graph has been used to encode the core electrons of the atoms of which the given molecules are done. The obtained model is very satisfactory and stresses the importance of the odd complete graphs when used to encode the core electrons of atoms with n &ge; 2. Present model also stresses the importance of the dual basis indices in improving the modeling ability of the higher-order connectivity-pseudoconnectivity terms. Another relevant feature of the present model is the importance assumed by the zeroth-order valence molecular connectivity basis index, $^{0}$&chi;$^{v}$, which allows a direct topological-physical interpretation of the modeling.
On Dominance Reporting in 3D
Authors: Peyman Afshani
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

In this paper, we study the 3D dominance reporting problem in different models of computations and offer optimal results in the pointer machine and the external memory models and a near optimal result in the RAM model; all our results consume linear space. We can answer queries in O(log n + k) time on a pointer machine, with O(log B n + k/B) I/Os in the external memory model and in O((log logn)2 + log log U + k) time in the RAM model and in a U×U×U integer grid. These improve the results of various papers, such as Makris and Tsakalidis (IPL'98), Vengroff and Vitter (STOC'96) and Nekrich (SOCG'07). Here, n, k and B are the input, output and block size respectively. With a log3 n fold increase in the space complexity these can be turned into orthogonal range reporting algorithms with matching query times, improving the previous orthogonal range searching results in the pointer machine and RAM models. Using our 3D results as base cases, we can provide improved orthogonal range reporting algorithms in ¿ d , d ¿ 4. We use randomization only in the preprocessing part and our query bounds are all worst case.
Parallelization methods for implementation of a magnetic induction tomography forward model in symmetric multiprocessor systems
Authors: Yasheng Maimaitijiang, Mohammed Ali Roula, Stuart Watson, Ralf Patz, Robert J. Williams, Huw Griffiths
Venue: Parallel Computing (2008)

This paper describes four parallelization approaches used in a finite-difference-based electromagnetic modeller for application in magnetic induction tomography (MIT) and suitable for implementation on computer systems with symmetric multiprocessor (SMP) architecture. The approaches include: (i) splitting by coils using a distributed memory approach, (ii) splitting by physical domain using a distributed memory approach, (iii) splitting by physical domain using hybrid distributed/shared memory approach and (iv) splitting by both coils and physical domain using multi-level distributed and shared memory approaches respectively. All four approaches were implemented and tested on an IBM SP supercomputer. Coil parallelization was the most efficient method due to low inter-processor communication requirements but was limited by the number of coils in the MIT system. Approaches (ii) and (iii) allowed a larger number of processors to be employed but the efficiency versus number of processors was found to drop at a faster rate in comparison to (i). The fourth approach both allowed a larger number of processors to be employed and was found to provide higher efficiency than the parallelization by physical domain only. This multi-level hybrid approach therefore appears to offer an effective parallelization method for implementation of the MIT forward model on SMP clusters.
Refocusing Generalised Normalisation
Authors: José Espírito Santo
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

When defined with general elimination/application rules, natural deduction and &lambda;-calculus become closer to sequent calculus. In order to get real isomorphism, normalisation has to be defined in a "multiary" variant, in which reduction rules are necessarily non-local (reason: nomalisation, like cut-elimination, acts at the head of applicative terms, but natural deduction focuses at the tail of such terms). Non-local rules are bad, for instance, for the mechanization of the system. A solution is to extend natural deduction even further to a unified calculus based on the unification of cut and general elimination. In the unified calculus, a sequent term behaves like in the sequent calculus, whereas the reduction steps of a natural deduction term are interleaved with explicit steps for bringing heads to focus. A variant of the calculus has the symmetric role of improving sequent calculus in dealing with tail-active permutative conversions.
Evolutionary Algorithm for Identifying Discontinuous Parameters of Inverse Problems
Authors: Zhijian Wu, Dazhi Jiang, Lishan Kang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we make an investigation into the discontinuous parameter identification in the case of elliptic problem. The discontinuous parameter is identified by evolutionary algorithm for the first time. For this kind of problem, we present a two-level evolutionary algorithm. The first level is the evolution for discontinuous point and the second level is the evolution for parameter. The numerical experiments suggest that the algorithm carries such features as good stability and adaptability and is not very sensitive to the noise in observation data as well.
SPATIAL POEM: A New Type of Experimental Visual Interaction in 3D Virtual Environment
Authors: Jinyoung Choi, Sang Hyuk Hong
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

SPATIAL POEM is a new type of 'real-time visual interaction' expressing our own creative narrative as real-time visual by playing a musical instrument which is an emotional human behavior. There are sensors on each hole on the surface of the musical instrument. When you play it, sensors recognize that you have covered the holes. All sensors are connected to a keyboard, which means your playing behavior becomes a typing action on the keyboard. And it is programmed to spread out the visual of your words in a virtual 3D space when you play the musical instrument. The behavior when you blow the instrument, to make sounds, changes into the energy that makes you walk ahead continuously in a virtual space. It used a microphone sensor for this. After all by playing musical instrument, we get back the emotion we forgot so far, and your voice is expressed with your own visual language in virtual space.
Testing aspect-oriented programs with state models
Authors: Dianxiang Xu
Venue:  (2007)

The new constructs in aspect-oriented programming can cause hazards to quality assurance. To detect aspect defects, this dissertation presents a state-based approach to systematic modeling and testing of aspects. We extend finite state machines with notations for specifying incremental modification aspects, integration aspects, and combination aspects. We have defined the transition-overriding rule, removal rule, overloading rule, and integration rule in terms of the impacts that aspects impose on the state transitions of base class objects. Using these rules, we can compose aspect models with their base class models through an explicit weaving mechanism. We adapt the round-trip path testing of object-oriented programs to the generation of test sequences from woven-state models. An incremental testing process is exploited to determine whether failures, if revealed, have to do with aspects. We have conducted a series of experiments based on three applications; two of them have multiple working versions that imply alternatives of aspect design and implementation. To further evaluate the fault-detection ability, we have created a significant number of mutants (or variation versions) by seeding one or more aspect variations (i.e., potential faults) and exploited multi-variation mutants to investigate the effect of interaction between aspect variations. The seeding of aspect variations is based on a comprehensive fault model, including eight types of aspect faults in three categories (incorrect pointcut, advice, and aspect precedence). Our experiments show that 92% of total mutants have been killed, and the experimental results indicate that our model-based testing approach is highly effective in the detection of the seeded aspect faults.
Secure Transaction Protocol Analysis: Models and Applications, 1 edition
Authors: Qingfeng Chen, Chengqi Zhang, Shichao Zhang
Venue: Lecture Notes In Computer Science (2008)

The present volume arose from the need for a comprehensive coverage of the state of the art in security protocol analysis. It aims to serve as an overall course-aid and to provide self-study material for researchers and students in formal methods theory and applications in e-commerce, data analysis and data mining. The volume will also be useful to anyone interested in secure e-commerce. The book is organized in eight chapters covering the main approaches and tools in formal methods for security protocol analysis. It starts with an introductory chapter presenting the fundamentals and background knowledge with respect to formal methods and security protocol analysis. Chapter 2 provides an overview of related work in this area, including basic concepts and terminology. Chapters 3 and 4 show a logical framework and a model checker for analyzing secure transaction protocols. Chapter 5 explains how to deal with uncertainty issues in secure messages, including inconsistent messages and conflicting beliefs in messages. Chapter 6 integrates data mining with security protocol analysis, and Chapter 7 develops a new technique for detecting collusion attack in securityprotocols. Chapter 8 gives a summary of the chapters and presents a brief discussion of some emerging issues in the field.
Minimal Simple Pairs in the 3-D Cubic Grid
Authors: N. Passat, M. Couprie, G. Bertrand
Venue: Journal of Mathematical Imaging and Vision (2008)

Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. This paper constitutes an introduction to the study of non-trivial simple sets in the framework of cubical 3-D complexes. A simple set has the property that the homotopy type of the object in which it lies is not changed when the set is removed. The main contribution of this paper is a characterisation of the non-trivial simple sets composed of exactly two voxels, such sets being called minimal simple pairs.
A Privacy-Preserving Framework for Integrating Person-Specific Databases
Authors: Murat Kantarcioglu, Wei Jiang, Bradley Malin
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

Many organizations capture personal information, but the quantity of records needed to detect statistically significant patterns is often beyond the grasp of a single data collector. In the biomedical realm, this problem has pressed regulatory agencies to require funded investigators to share research-derived data to public repositories. The challenge; however, is that shared records must not reveal the identity of the subjects. In this paper, we extend a secure framework in which data holders contribute and query encrypted person-specific data stored on a third party's server. Specifically, we develop protocols that enable data holders to merge personal records, thus creating larger profiles and diminishing duplication. The repository administrator can merge records via encrypted identifiers without decrypting or inferring the contents of the joined records. Our model is more practical than prior secure join methods because each data holder needs only a single interaction with the central repository. We further present an extension to the protocol that permits the revelation of k-anonymous demographics, such that the administrator can perform joins more efficiently with the guarantee that each record can be linked to no less than k individuals in the population. We prove the privacy preserving features of our protocols and experimentally evaluate their efficiency in a real world Census dataset.
Valued Hesitation in Intervals Comparison
Authors: Meltem Öztürk, Alexis Tsoukiàs
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

The paper presents a valued extension of the recently introduced concept of PQI interval order. The main idea is that, while comparing objects represented by interval of values there is a zone of hesitation between strict difference and strict similarity which could be modelled through valued relations. The paper presents suitable definitions of such valued relations fulfilling a number of interesting properties. The use of such a tool in data analysis and rough sets theory is discussed in the paper.
Replication in Intermittently Connected Mobile Ad Hoc Networks
Authors: Ke Shi
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

Data replication is a widely used redundancy scheme for improving data availability and performance in distributed systems. However, currently existing replication schemes do not take into account that the mobile ad hoc network is often partitioned in smaller portions, enjoying only intermittent connectivity thanks to mobile nodes traveling across partitions. A novel replication scheme, RICMAN (Replication in Intermittently Connected Mobile Ad Hoc Networks), is proposed to address this problem. Desired data items are replicated to the nodes with rather stable neighboring topology and with enough resources such as energy and storage space. A semi-probabilistic data disseminating protocol is employed to distribute the replicas and propagate the updates, which can identify the potential mobile nodes traveling across partitions to maximize data delivery despite network partitions and intermittent connectivity. Simulation results demonstrate that RICMAN scheme leads to good successful data access ratios and latencies with small overheads.
An Architecture for Multimedia Content Publishing with GIS-Based Retrieval Facility
Authors: Michele Capua, Donatella Padovano, Monica Sebillo
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

With the rapid growth of broadband network, distribution of multi-media content via internet portals has become a must way to go. This work addresses the creation of a simple web architecture based on an open source framework capable to provide a means to publish and retrieve multimedia content, also with some facilities based on data positioning, associated with multimedia files and subsequent retrieval.