ppxscal/embedding_network huggingface dataset:
3D Reconstruction of Background and Objects Moving on Ground Plane Viewed from a Moving Camera
Authors: Chang Yuan, Gerard Medioni
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a novel method to obtain a 3D Euclidean reconstruction of both the background and moving objects in a video sequence. We assume that, multiple objects are moving rigidly on a ground plane observed by a moving camera. The video sequence is first segmented into static background and motion blobs by a homography-based motion segmentation method. Then classical "Structure from Motion" (SfM) techniques are applied to obtain a Euclidean reconstruction of the static background. The motion blob corresponding to each moving object is treated as if there were a static object observed by a hypothetical moving camera, called a "virtual camera". This virtual camera shares the same intrinsic parameters with the real camera but moves differently due to object motion. The same SfM techniques are applied to estimate the 3D shape of each moving object and the pose of the virtual camera. We show that the unknown scale of moving objects can be approximately determined by the ground plane, which is a key contribution of this paper. Another key contribution is that we prove that the 3D motion of moving objects can be solved from the virtual camera motion with a linear constraint imposed on the object translation. In our approach, a planartranslation constraint is formulated: "the 3D instantaneous translation of moving objects must be parallel to the ground plane". Results on real-world video sequences demonstrate the effectiveness and robustness of our approach.
New Directions in Mobile Device Architectures
Authors: Risto Suoranta
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Mobile industry will face several disruptive changes in coming years. Emerging digital convergence will bring new exiting multifunctional products for consumers but it also put new requirements for the product development. Shift from vertical to horizontal mode will bring deep impact to the R&D of the whole mobile industry. Emerging dominant platforms and architectures will challenge the whole community to maintain the spirit of open innovation instead of ending up to dominance of one or two key players. In this presentation we are considering the challenges and requirements for the future architectures, and open up our thinking what are the right architectural directions to go.
The use of simulation and design of experiments for productivity improvement in the sawmill industry
Authors: Felipe F. Baesler, Eduardo Araya, Francisco J. Ramis, José A. Sepúlveda
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This work presents a discrete event simulation model of an important sawmill in Chile. This model was used to perform a bottleneck analysis of the wood process and to propose, based on these results, alternatives that would yield to an improvement in the process productivity. Different alternatives were simulated and the results obtained were used to perform a full factorial design in order to select the combination of factors that have the most important impact in the process productivity. The implementation of these improvement measures could increase the wood production up to a 25%.
Design and test on chip for EMC
Authors: Fabian Vargas
Venue: IEEE Design Test (2006)

The "Design and test on chip for EMC" panel at the 2006 EMC Europe International Symposium on Electromechanical Compatibility addressed the recent explosion of the portable-electronics market and the increasingly hostile electromagnetic environment in which these systems must operate.
GPU Based Real-time Shadow Research in Large Ship-handling Simulator
Authors: Yang Xiao, Jin Yicheng
Venue: Proceedings of the conference on Information Visualization (2006)

Shadow can strengthen the reality of 3D virtual scene and provide important visual information for the objects' spacial relationship in the scene. This paper presents a GPU based method for all the process of shadow volume algorithm. It can achieve greater shadow performance in Ship-handling simulator than previous methods by migrating the silhouette extraction and shadow volume rending to GPU, and applying a series of techniques for culling, clipping, and simplifying shadow volume geometry. We make a series of optimization for the visual system of the ship-handling simulator such as limit the range of illumination, the alternation of z-pass and z-fail algorithm, using the ultra shadow technology and two sided stencil buffer to accelerate the rending of shadow.
Optimal dynamic transport selection for wireless portable devices: Research Articles
Authors: Mohamed Younis, Amit Sardesai, Yaacov Yesha
Venue: Wireless Communications Mobile Computing (2007)

Recent technological advances in mobile computing and wireless communication have made portable devices, such as PDA, laptops, and wireless modems to be very compact and affordable. On the other hand, wireless networks have gained such wide popularity that new network infrastructure is continually introduced. It is thus likely that many of the future portable devices will be equipped with multiple wireless modems such as Bluetooth and 802.11 WLAN, in order to increase device inter-operability. The availability of multiple modems can leverage the performance of the communication traffic generated by the applications, for example Internet access. We envision a tool for managing the device connection through these modems. At the core of this tool is an optimization engine that splits packet traffic across a subset of the available transports so that user's performance metrics are maximized. This paper describes a mathematical model for such an optimization problem considering its applicability to small portable devices. Relevant quality of service (QoS) parameters such as bandwidth, average delay, and energy consumption are covered in the model. The mathematical formulation is validated using a simulated environment. The experimental results have demonstrated the effectiveness of our model and captured the inter-relationship among the quality parameters. Copyright &copy; 2006 John Wiley & Sons, Ltd.
CryptoPage: An Efficient Secure Architecture with Memory Encryption, Integrity and Information Leakage Protection
Authors: Guillaume Duc, Ronan Keryell
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Several secure computing hardware architectures using memory encryption and memory integrity checkers have been proposed during the past few years to provide applications with a tamper resistant environment. Some solutions, such as HIDE, have also been proposed to solve the problem of information leakage on the address bus. We propose the CRYPTOPAGE architecture which implements memory encryption, memory integrity protection checking and information leakage protection together with a low performance penalty (3% slowdown on average) by combining the Counter Mode of operation, local authentication values and Merkle trees.
Analysis of Multi-ISPs Game Based on Lotka-Volterra Model
Authors: Yaping Zhou, Bo Chen
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 competition for market share among Internet service providers (ISPs) in the Internet service market is similar to the one for prey among predators in a single-prey-multipredators biological system. Based on the classical Lotka- Volterra (LV) model, constructing a multi-ISPs game model (MIGM), studying the games among ISPs under different market environment, analyzing the stability of the equilibrium points and the influences of system parameters on the equilibria via Liapunov's first method, and also showing some characteristics of the system through mathematical analysis and simulation.
A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification
Authors: Husam Abu-Haimed, David L. Dill, Sergey Berezin
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We introduce a heuristic for automatically checking the validity of first-order formulas of the form \forall \alpha ^m \exists \beta ^n. \Psi \left( {\alpha ^m ,\beta ^n } \right) that are encountered in inductive proofs of hardware correctness. The heuristic introduced in this paper is used to automatically check the validity of k-step induction formulas needed to verify hardware designs. The heuristic works on word-level designs that can have data and address buses of arbitrary widths. Our refinement heuristic relies on the idea of predicate instantiation introduced in [2]. The heuristic proves quantified formulas by the use of a validity checker, CVC [21], and a first-order theorem prover, Otter [16]. Our heuristic can be used as a stand-alone technique to verify word-level designs or as a component in an interactive theorem prover. We show the effectiveness of this heuristic for hardware verification by verifying a number of hardware designs completely automatically. The large size of the quantified formulas encountered in these examples shows the effectiveness of our heuristic as a component of a theorem prover.
XCheck: a platform for benchmarking XQuery engines
Authors: Loredana Afanasiev, Massimo Franceschet, Maarten Marx
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

XCheck is a tool for assessing the relative performance of different XQuery engines by means of benchmarks consisting of a set of XQuery queries and a set of XML documents. Given a benchmark and a set of engines, XCheck runs the benchmark on these engines and produces highly informative performance output. The current version of XCheck contains all available XQuery benchmarks which are run against four XQuery engines: Galax, Qizx/open, Saxon and MonetDB/XQuery. XCheck's design makes it easy to include new engines and new benchmarks.
Towards Semantically Coherent Collaboration
Authors: Hadi Sabaa, Henry Hexmoor
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Ontologies are fundamental for communication-based collaboration. Common ontologies enable agents to successfully communicate. Agents in a multi-agent system might share the same ontology or might have different ontologies. In this paper we present a methodology that enables agents characterized by minimally different, lower ontologies to meaningfully communicate. Our approach is based on mediating ontologies between the communicating agents.
The Red and Black Semantics: A Fuzzy Language
Authors: Gianluca Mura
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

The complexity of abstract art languages create new semantics in Art. This model tries to implement its conceptual language within creating new virtual environment. The gap between Art and Technology has been approached with fuzzy logic engine which uses a Red and Black semantic codification. The examples include the application of this meta-language to a virtual artwork experimentation.
Quality-Driven Template-Based Architecture Synthesis for Real-time Embedded SoCs
Authors: Lech Jozwiak, Sien-An Ong
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The recent spectacular progress in modern microelectronics created a big stimulus towards development of embedded and autonomous systems. Unfortunately, it also introduced unusual complexity that results in many serious issues that cannot be resolved without new more adequate development methods and EDA-tools for the system-level design. This paper discusses the problem of an efficient multiobjective optimal architecture synthesis for complex hard real-time embedded systems, when using as an example a system-level architecture exploration and synthesis method that we developed.
Application of orthogonal-search method to Volterra modeling of nonlinear systems
Authors: C.-H. Tseng, E. J. Powers
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The orthogonal-search technique is utilized to reduce the number of filter coefficients required to describe Volterra kernels up to third order. To demonstrate the efficacy of the approach, the orthogonal-search technique is applied to two experimental data sets exhibiting quadratic and cubic nonlinearities, respectively. The results show that this method can reduce the required number of filter coefficients considerably, while still providing a good model of the nonlinear physical system.
Global Analysis of Resource Arbitration for MPSoC
Authors: Akash Kumar, Bart Mesman, Henk Corporaal, Jef van Meerbergen, Ha Yajun
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Modern day applications require use of multi-processor systems for reasons of scalability and power efficiency. As more and more applications are integrated on a single device, mapping and analyzing them on a multi-processor system becomes a multi-dimensional problem. Each possible set of applications that can be active simultaneously leads to a different use-case (also referred to as scenario) that the system has to be verified and tested for. Analyzing the feasibility and resource utilization of all possible use-cases is very demanding and often infeasible. In this paper, we highlight the issue of composability, i.e. being able to analyze applications in isolation while still reason about their overall behavior. We observe that arbitration plays an important role in this analysis. We compare two simple, yet commonly used arbitration mechanisms, and highlight the properties that are important for such analysis. We conclude that none of these arbitration mechanism is ideal for such an analysis and propose some variations to make them more suited for the analysis.
Robustifying Eye Interaction
Authors: Dan Witzner Hansen, John Paulin Hansen
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a gaze typing system based on consumer hardware. Eye tracking based on consumer hardware is subject to several unknown factors. We propose methods using robust statistical principles to accommodate uncertainties in image data as well as in gaze estimates to improve accuracy. We have succeeded to track the gaze of people with a standard consumer camera, obtaining accuracies about 160 pixels on screen. Proper design of the typing interface, however, reduces the need for high accuracy. We have observed typing speeds in the range of 3 - 5 words per minute for untrained subjects using large on-screen buttons and a new noise tolerant dwell-time principle
Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks
Authors: Pang-Chieh Wang, Ting-Wei Hou, Ruei-Hong Yan
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

A new distributed algorithm, called Crystal-Lattice Permutation (CLP) algorithm, is devised to approach the coverage problem in wireless sensor networks. All nodes are assumed as mobile and run the same CLP algorithm in . An initial seed triggers six neighboring nodes to move to hexagon permutation positions, which is like the Crystal-Lattice formation process in nature. These chosen nodes then become new seeds to trigger other neighboring nodes. By such a progressive process, with initial and boundary conditions, the coverage is achieved. Comparing to the Virtual Force algorithm (VFA), the CLP algorithm needs fewer nodes and takes shorter average moving distance to achieve 100% coverage in random deployment. In simulation, the CLP algorithm deployed at least 60 nodes to achieve the 100% coverage, while the VFA algorithm required more than 100 nodes, under the same assumptions. The average moving distance for each CLP node was less than a half of the VFA node. In addition, as there are n mobile nodes, the number of CLP messages is proportional to n, while VFA is proportional to n2. The CLP algorithm is robust in fault tolerance when some nodes are error in distribution.
An efficient and robust computational framework for studying lifetime and information capacity in sensor networks
Authors: Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
Venue: Mobile Networks and Applications (2005)

In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based viewpoint, we model parameters such as the node density, the energy density and the sensed data rate as continuous spatial Functions. This continuous-space flow model is then discretized into grids and solved using a linear programming approach. Numerical studies show that this model produces very accurate results, compared to averaging over results from random instances of deployment, with significantly less computation. Moreover, we develop a robust version of the linear program, which generates robust solutions that apply not just to a specific deployment, but also to topologies that are appropriately perturbed versions. This is especially important for a network designer studying the fundamental lifetime limit of a family of network layouts, since the lifetime of specific network deployment instances may differ appreciably. As an example of this model's use, we determine the optimal node distribution for a linear network and study the properties of optimal routing that maximizes the lifetime of the network.
School-level ICT Adoption Factors in the Western Cape Schools
Authors: Lorien Miller, Mogen Naidoo, Jean-Paul van Belle, Wallace Chigona
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

The ramifications of using Information and Communication Technology (ICT) in education may be the answer to alleviating the educational crisis that South Africa is experiencing. However, the factors that will create a high level of adoption of ICTs in the country's schools haven't been studied, making research in this area vital for project success and sustainability. This project attempts to identify the critical success factors related to ICT interventions in Western Cape schools. In this study the Theory of Planned Behaviour model is used to gain an understanding of decision making processes with regard to ICT use in education. Analysis of the data reveals at school level adoption is affected by availability and accessibility of ICT resources, efficiency of technical support and the influence (attitude) of education leaders.
Application of Virtualisation Techniques at a University Grid Center
Authors: Volker Buge, Yves Kemp, Marcel Kunze, Gunter Quast
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Computing clusters at universities are often shared between many different user groups, having their own requirements concerning computing infrastructure, e.g. the operating system (OS), software packages, access policies and different grid middlewares. The integration of local computing and storage resources into the grid of a specific user group is realised by portal machines, providing different services. In the current implementation of the Worldwide LHC Grid and the CDF grid middleware, these services require dedicated operating systems and should be installed on different machines for stability reasons. Virtualisation of these services on one high-capacity machine eases maintenance of the systems and reduces the hardware overhead especially for smaller clusters. This approach of hardware consolidation is not restricted to the grid infrastructure and may therefore be applied to other even simpler services. This paper describes the process of hardware consolidation at a typical university grid centre. A discussion of different virtualisation techniques is also included and benchmarks show that Xen is an optimal candidate.
Computer automated multi-paradigm modelling for analysis and design of traffic networks
Authors: Hans Vangheluwe, Juan de Lara
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, is introduced. The syntax of Traffic models is meta-modelled in the Entity-Relationship Diagrams formalism. From this, augmented with concrete syntax information, a visual modelling environment is synthesized using our CAMPaM tool AToM3, A Tool for Multi-formalism and Meta-Modelling. The semantics of the Traffic formalism is subsequently modelled by mapping Traffic models onto Petri Net models. As models' abstract syntax is graph-like, graph rewriting can be used to transform models. The advantages of a domain-specific formalism such as Traffic as opposed to a generic formalism such as Petri Nets are presented. We demonstrate how mapping onto Petri Nets allows one to employ the vast array of Petri Net analysis techniques. A Coverability Graph is generated and conservation analysis is automated by transforming this graph into an Integer Linear Programming specification.
Privacy-Preserving Computation of Bayesian Networks on Vertically Partitioned Data
Authors: Zhiqiang Yang Rebecca N. Wright
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Traditionally, many data mining techniques have been designed in the centralized model in which all data is collected and available in one central site. However, as more and more activities are carried out using computers and computer networks, the amount of potentially sensitive data stored by business, governments, and other parties increases. Different parties often wish to benefit from cooperative use of their data, but privacy regulations and other privacy concerns may prevent the parties from sharing their data. Privacy-preserving data mining provides a solution by creating distributed data mining algorithms in which the underlying data need not be revealed. In this paper, we present privacy-preserving protocols for a particular data mining task: learning a Bayesian network from a database vertically partitioned among two parties. In this setting, two parties owning confidential databases wish to learn the Bayesian network on the combination of their databases without revealing anything else about their data to each other. We present an efficient and privacy-preserving protocol to construct a Bayesian network on the parties' joint data.