ppxscal/embedding_network huggingface dataset:
Three-Dimensional Model-Based Object Recognition and Segmentation in Cluttered Scenes
Authors: Ajmal S. Mian, Mohammed Bennamoun, Robyn Owens
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Viewpoint independent recognition of free-form objects and their segmentation in the presence of clutter and occlusions is a challenging task. We present a novel 3D model-based algorithm which performs this task automatically and efficiently. A 3D model of an object is automatically constructed offline from its multiple unordered range images (views). These views are converted into multidimensional table representations (which we refer to as tensors). Correspondences are automatically established between these views by simultaneously matching the tensors of a view with those of the remaining views using a hash table-based voting scheme. This results in a graph of relative transformations used to register the views before they are integrated into a seamless 3D model. These models and their tensor representations constitute the model library. During online recognition, a tensor from the scene is simultaneously matched with those in the library by casting votes. Similarity measures are calculated for the model tensors which receive the most votes. The model with the highest similarity is transformed to the scene and, if it aligns accurately with an object in the scene, that object is declared as recognized and is segmented. This process is repeated until the scene is completely segmented. Experiments were performed on real and synthetic data comprised of 55 models and 610 scenes and an overall recognition rate of 95 percent was achieved. Comparison with the spin images revealed that our algorithm is superior in terms of recognition rate and efficiency.
Digital Dialogue Games for Inclusive Conceptual Learning: Exploring Multimodal Interaction
Authors: Andrew Ravenscroft
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper will present a reusable, flexible and adaptable 'game-based' approach to dialogical and conceptual learning. These synchronous dialogue games for learning are realized through a 'state of the art' socio-cognitive tool called InterLoc that scaffolds the development and use of dialogical and reasoning skills in students. The dialogue game and InterLoc approach will be described before discussing how key findings from recent pilot studies suggest multimodal enhancements that will improve the 'attractiveness', degree of fit with learners digital behaviour and general power of the approach.
Synchronous Elastic Networks
Authors: Sava Krstic, Jordi Cortadella, Mike Kishinevsky, John O'Leary
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We formally define--at the stream transformer level--a class of synchronous circuits that tolerate any variability in the latency of their environment. We study behavioral properties of networks of such circuits and prove fundamental compositionality results. The paper contributes to bridging the gap between the theory of latency-insensitive systems and the correct implementation of efficient control structures for them.
Saturate it, of course!
Authors: E. Keith Hege
Venue: ACM SIGSMALL Newsletter (1982)

This reply is prompted by Fred Maryanski's question in his Chairman's column (<u>Sigsmall Newsletter</u>, August 1982). "What will we do with all that bandwidth?" This response follows my consideration of the implications for on-line video signal processing given the advent of 2&Oslash; MHz bus, 8 Mbyte, 32-bit minicomputer systems. This is what "<u>think Mini</u>" now means for us in astronomical image processing applications. We are now considering the question: What happens in a modestly networked video signal processing environment?
Fractionating the Left Frontal Response to Tools: Dissociable Effects of Motor Experience and Lexical Competition
Authors: Irene P. Kan, Joseph W. Kable, Amanda Van Scoyoc, Anjan Chatterjee, Sharon L. Thompson-schill
Venue: Journal of Cognitive Neuroscience (2006)

A number of theories about the evolution of language posit a close (and perhaps causal) relationship between tool use and speech. Consistent with this idea, neuroimaging studies have found that tool knowledge retrieval activates not only a region of the left premotor cortex involved in hand action, but also an adjacent region that is typically described as a language center. We examined whether this pattern of activation is best described as the result of a single process, related to both action and language, or the result of two independent processes. We identified two distinct neural components that jointly contribute to this response: a posterior region centered in the premotor cortex, which responds to motor knowledge retrieval, and an anterior region centered in the left frontal operculum, which responds to lexical competition. Crucial to the interpretation of the premotor response, individual variation in motor experience was highly correlated with the magnitude of the response in the premotor cortex, but not in the prefrontal cortex.
Multi-formalism modeling approach for semiconductor supply/demand networks
Authors: Gary W. Godding, Hessam S. Sarjoughian, Karl G. Kempf
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major hurdles in building a principled and robust system are model composibility and algorithm interoperability. We describe an approach to the composibility problem including initial results. This exposition is given in the context of Linear Programming as the decision technique and Discrete Event Simulation as the simulation technique, both applied to the design and operation of semiconductor supply/demand networks.
Exciting Event Detection Using Multi-level Multimodal Descriptors and Data Classification
Authors: Shu-Ching Chen, Min Chen, Chengcui Zhang, Mei-Ling Shyu
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Event detection is of great importance in high-level semantic indexing and selective browsing of video clips. However, the use of low-level visual-audio feature descriptors alone generally fails to yield satisfactory results in event identification due to the semantic gap issue. In this paper, we propose an advanced approach for exciting event detection in soccer video with the aid of multi-level descriptors and classification algorithm. Specifically, a set of algorithms are developed for efficient extraction of meaningful mid-level descriptors to bridge the semantic gap and to facilitate the comprehensive video content analysis. The data classification algorithm is then performed upon the combination of multimodal mid-level descriptors and low-level feature descriptors for event detection. The effectiveness and efficiency of the proposed framework are demonstrated over a large collection of soccer video data with different styles produced by different broadcasters.
Neural Network Simulation and Evolutionary Synthesis of QCA Circuits
Authors: Omar Paranaiba Vilela Neto, Marco Aurelio C. Pacheco, Carlos R. Hall Barbosa
Venue: IEEE Transactions on Computers (2007)

CMOS technology miniaturization limits have promoted research on new alternatives which can keep the technologically advanced level of the last decades. Quantum-dot Cellular Automata (QCA) is a new technology in the nanometer scale that has been considered as one of these alternatives. QCA have a large potential in the development of circuits with high space density and low heat dissipation and allow the development of faster computers with lower power consumption. Differently from conventional technologies, QCA do not codify information by means of electric current flow, but rather by the configuration of electrical charges in the interior of the cells. The Coulomb interaction between cells is responsible for the flow of information. This paper proposes the use of computational intelligence techniques in the simulation and in the automatic synthesis of QCA circuits. The first results show that these techniques may play an important role in this research area since they are capable of simulating efficiently and fast, synthesizing optimized circuits with a reduced number of cells. Such optimization reduces the possibility of failures and guarantees higher speed.
BioFOSS: a survey of Free/Open Source Software in Bioinformatic
Authors: Kirby Shabaga, Daniel M. German
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper discusses the current state of Free/Open Source Software (F/OSS) projects in the field of academic bioinformatics. The paper reports on a survey of the Bioinformatics journal that enumerates the number of Application Notes published between volumes 2004-20-17 and 2005-21-7. The purpose of this survey is to determine what percentage of bioinformatics applications are made available under open source licenses. Bioinformatics includes tools, databases, and organizations to support them. An overview is given for the EMBOSS project, the Open Bioinformatics Foundation, and GenBank. In addition, a short discussion of Linux distributions tailored to the needs of bioinformaticians is provided.
A Formal Model of XML Schema
Authors: Leonid Novak, Alexandre Zamulin
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The semantics of the core features of XML Schema in terms of XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many sorted algebra whose sorts are sets of data type values and different kinds of nodes and whose operations are data type operations and node accessors. The values of some node accessors, such as "parent", "children" and "attributes", define a document tree with a definite order of nodes. The values of other node accessors help to make difference between kinds of nodes, learn the names, types and values associated with the corresponding document entities, etc., i.e., provide primitive facilities for a query language. As a result, a document can be easily mapped to its implementation in terms of nodes and accessors defined on them.
Management and Integration of Information in Intrusion Detection System: Data Integration System for IDS Based Multi-Agent Systems
Authors: Emanoel Costa Claudino, Zair Abdelouahab, Mario Meireles Teixeira
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper, we present a model, an architecture and an implementation of an Information Manager for an IDS (Intrusion Detection Systems), using the technology of Multiagents Systems and Web Services. This Manager has been integrated to NIDIA (Network Intrusion Detection System based on Intelligent Agents), which is an IDS whose architecture consists of a group of cooperative agents. In our proposal, the NIDIA is adapted and extended so that its services uses updated and secure information. The goal of the Information Manager Module is to keep safe and update of information that is necessary for the development of inherent functions of an IDS.
Performance analysis of access selection and transmit diversity in multi-access networks
Authors: Fredrik Berggren, Remco Litjens
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Motivated by the "beyond 3g" vision of radio access network integration and coordinated radio resource management, a purely analytical performance assessment is presented for a single access point integrating multiple radio accesses. Principal focus is placed on the evaluation of multi-user diversity, multi-access diversity and trunking gains. Scenarios with persistent and non-persistent data flows are investigated, concentrating on throughput and transfer time performance, respectively. A number of numerical experiments are included in order to quantify the relative contribution of the distinguished aspects to the performance gain. These experiments indicate that the exploitation of multi-user diversity with a channel-aware access selection scheme attains the most significant gains, while also the trunking gain that is due to an above-proportional performance enhancement when aggregating system-specific capacities, is noted to be significant. The assignment of multiple accesses to a given flow is demonstrated to have limited potential.
Component-driven engineering of database applications
Authors: Klaus-Dieter Schewe, Bernhard Thalheim
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

Though it is commonly agreed that the design of large database schemata requires group effort, database design from component subschemata has not been investigated thoroughly. In this paper we investigate snowflake-like subschemata of database schemata expressed in the Higher-order Entity-Relationship Model (HERM). These subschemata are almost hierarchical in the sense that they may contain cycles in the schema, but not in the instances. We show that each HERM schema can be decomposed into such subschemata using a small set of composition constructors. We then describe how the composition of components can be seen as a database design primitive leading to component-driven database design and re-design pragmatics.
A Unit-Test Framework for Database Applications
Authors: Claus A. Christensen, Steen Gundersborg, Kristian de Linde, Kristian Torp
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

The outcome of a test of an application that stores data in a database naturally depends on the state of the database. It is therefore important that test developers are able to set up and tear down database states in a simple and efficient manner. In existing unit-test frameworks, setting up and tearing down such test fixtures is labor intensive and often requires copy-and-paste of code. This paper presents an extension to existing unit-test frameworks that allows unit tests to reuse data inserted by other unit tests in a very structured fashion. With this approach, the test fixture for each unit test can be minimized. In addition, the reuse between unit tests can speed up the execution of test suites. A performance test on a medium-size project shows a 40% speed up and an estimated 25% reduction in the number of lines of test code.
Educational virtual environments: design rationale and architecture
Authors: C. Bouras, T. Tsiatsos
Venue: Multimedia Tools and Applications (2006)

The use of collaborative virtual environments in e-learning is one of the most promising uses of virtual reality technology. While much research has been done in the area of networked virtual environments corresponding to the sharing of events, very little research has been done on specific services and functionality. However both the requirements and the kind of the offered services affect significantly the design of a system. In this paper we present the design and implementation of a platform suitable for educational virtual environments, which are collaborative virtual environments aiming at offering collaborative e-learning services to the users. Apart from the platform itself, we present the technological choices, and a new method for sharing virtual environments. Furthermore, we present an e-learning environment to support e-learning services using collaborative virtual environments from both the technical and functional point of view, along with the end-user evaluation results.
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
Authors: Shao Liu, Tamer Başar, R. Srikant
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

We introduce a new congestion control algorithm, called TCP-Illinois, which has many desirable properties for implementation in (very) high-speed networks. TCP-Illinois is a sender side protocol, which modifies the AIMD algorithm of the standard TCP (Reno, NewReno or SACK) by adjusting the increment/decrement amounts based on delay information. By using both loss and delay as congestion signals, TCP-Illinois achieves a better throughput than the standard TCP for high-speed networks. To study its fairness and stability properties, we extend recently developed stochastic matrix models of TCP to accommodate window size backoff probabilities that are proportional to arrival rates when the network is congested. Using this model, TCP-Illinois is shown to allocate the network resource fairly as in the standard TCP. In addition, TCP-Illinois is shown to be compatible with the standard TCP when implemented in today's networks, and is shown to provide the right incentive for transition to the new protocol. We finally perform ns-2 simulations to validate its properties and demonstrate its performance.
A rigorous analysis of the compact genetic algorithm for linear functions
Authors: Stefan Droste
Venue: Natural Computing: an international journal (2006)

Estimation of distribution algorithms (EDAs) solve an optimization problem heuristically by finding a probability distribution focused around its optima. Starting with the uniform distribution, points are sampled with respect to this distribution and the distribution is changed according to the function values of the sampled points. Although there are many successful experiments suggesting the usefulness of EDAs, there are only few rigorous theoretical results apart from convergence results without time bounds. Here we present first rigorous runtime analyses of a simple EDA, the compact genetic algorithm (cGA), for linear pseudo-Boolean functions on n variables. We prove a general lower bound for all functions and a general upper bound for all linear functions. Simple test functions show that not all linear functions are optimized in the same runtime by the cGA.
Pictures and Their Colors: What Do Children Remember?
Authors: Yael M. Cycowicz, David Friedman, Martin Duff
Venue: Journal of Cognitive Neuroscience (2003)

Theories regarding children's reliability as witnesses suggest that children are more likely to confuse memories from different sources especially when the sources are highly similar. To investigate the developmental aspects of source retrieval, we measured brain electrical activity from children and adults while they retrieved content and source information. Similar brain responses among the age groups were found when participants were asked to retrieve content information. However, retrieval of source information improved with age and was accompanied by different patterns of brain potentials. The results implicate immaturity of frontal lobe structures in children's difficulty in retrieving source information.
MX Navigator: An Application for Advanced Music Fruition
Authors: Adriano Barate, Goffredo Haus, Luca A. Ludovico
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper describes an application that allows an advanced fruition of music contents. Thanks to our music XML format, namely MX (IEEE PAR1599), and to the interface provided by such application, users can enjoy music from different points of view: it is possible to navigate different scores, video and audio performances of the same piece; besides, each content type can be used as the leading media to keep all the other related contents synchronized. The working application has been installed at the exhibition "Tema con Variazioni" (December 2005 -- January 2006), organized by the Italian Ministry of Cultural Heritages and held in Rome.
Analysis of initial stage of plasma discharge in tokamaks: mathematical model formulation, simulation results, comparison with experiments
Authors: V. A. Belyakov, V. I. Vasiliev, K. M. Lobanov, L. P. Makarova, A. B. Mineev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Stage of plasma initiation is marked out front remaining plasma discharge scenario in tokamak. Plasma as object for control is appear during this stage. Mathematical model of SCENPLINT code for the physical processes description on the stage of plasma initiation is done. Results of comparison between simulations and experimental data on the Russian tokamak T-10 are presented.
Channel Capacity Analysis of Spread Spectrum Audio Watermarking for Noisy Environments
Authors: Saeed Sedghi, Morteza Khademi, Nedeljko Cvejic
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper channel capacity analysis of spread spectrum audio watermarking (SSW) system for transmission of hidden information through a noisy environment is performed. Channel capacity analysis of algorithm enables us to determine the most reliable transmission rate of hidden information by the watermarking system, i.e. the analysis makes a relation between capacity and robustness as two conflicting features of watermarking algorithms. Examining transmission and detection of hidden information shows that SSW behaves like a binary symmetric channel. It is proved that well known Shannon channel capacity formula for calculating channel capacity is not applicable for SSW system. Instead, analysis of channel capacity for additive color noise channels should be used. Obtaining channel capacity for SSW system using pseudo-noise random sequences with different period, different power of additive white Gaussian noise channel and different power of host signal is performed in simulation results.
Recent Advances in Research on P2P Networks
Authors: Yunfei Zhang, Changjia Chen, Xiaoping Wang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

As one of the killing applications in NGI, peer-topeer networks (P2P for short) have rapidly developed in recent years. We survey and catalog the current hot research aspects in P2P networks, compare and review most of the research work in P2P networks, and summarize the research means and their problems.
Iterative Compilation of Multiagent Probabilistic Graphical Models
Authors: Xiangdong An, Nick Cercone
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains. Inference in MSBNs can be performed effectively using their compiled representations. The compilation involves cooperative moralization and triangulation of the set of local graphical structures that collectively defines the dependencies among domain variables. Privacy of agents prevents us from compiling MSBNs by first assembling graphical subnets at a central location and then compiling their union. In earlier work, agents perform compilation in a limited parallel via a depth-first traversal of the local structures organized in a tree structure (called hypertree). Agents need some synchronization with each other. In this paper, we present an iterative method, by which multiple agents compile MSBNs asynchronously. Compared to the traversal method, the iterative one is self-adaptive and robust.