ppxscal/embedding_network huggingface dataset:
Combining Shape-from-Motion Output with Partial Metadata
Authors: Robert Whatmough
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

When the positions of the camera are not given, shape-from-motion methods can use target feature positions identified in a sequence of images to extract the three-dimensional positions of the features and the orientations of the camera relative to the target. These methods can be applied to video sequences taken from an aircraft, but do not reveal the overall size, orientation or geographic location of the target. If the camera is combined with a system that records its location, orientation and focal length, at least approximately for a few of the images, the target size, orientation and location can be estimated In certain cases, some of this information can be estimated from the image sequence itself. This paper considers the theory and practice of combining the shape extraction with the available camera information.
High-resolution finite compact difference schemes for hyperbolic conservation laws
Authors: Yiqing Shen, Guowei Yang, Zhi Gao
Venue: Journal of Computational Physics (2006)

A finite compact (FC) difference scheme requiring only bi-diagonal matrix inversion is proposed by using the known high-resolution flux. Introducing TVD or ENO limiters in the numerical flux, several high-resolution FC-schemes of hyperbolic conservation law are developed, including the FC-TVD, third-order FC-ENO and fifth-order FC-ENO schemes. Boundary conditions formulated need only one unknown variable for third-order FC-ENO scheme and two unknown variables for fifth-order FC-ENO scheme. Numerical test results of the proposed FC-scheme were compared with traditional TVD, ENO and WENO schemes to demonstrate its high-order accuracy and high-resolution.
Lessons Learned: On-board Software Test Automation Using IBM Rational Test RealTime
Authors: Natalie Russ, Gisbert Peter, Ranier Berlin, Bernd Ulmer
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

The on-board software for space missions becomes more and more complex due to variety of tasks which it shall fulfill on-board. A high reliability and quality is required as well as its proper behaviour under nominal and fault conditions. The complexity of the software on one hand and its reliability on other hand makes extensive tests during the development phase necessary. Tests themselves and test systems become challenging. The usage of automated test system and a possibility to perform regression tests is essential for achieving high quality software.
An adaptive approach to fast simulation of traffic groomed optical networks
Authors: Chih-Chieh Hsu, Michael Devetsikiotis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper, we consider the fast simulation of traffic groomed optical networks, in which multiple sub-rate traffic streams may be carried on the same wavelength. For real-sized systems, call blocking probabilities may be rare events and require a large amount of CPU power to simulate. We present two importance sampling methods for fast simulation. For a light-load case, we prove that static IS using the Standard Clock (S-ISSC) method does indeed have bounded relative error (BRE) even in multi-class case. For a non-light-load case, we suggest, alternatively, adaptive ISSC (A-ISSC) which calculates the relative possibility of reaching each target in every step of simulation. Using A-ISSC, biasing methods which are proven to be optimal or have bounded error can be extended to multi-dimensional cases while still retaining a very favorable performance.
MobileHCI'06 demo: mobile remote usability testing
Authors: Xavier Mestres
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper describes the usability remote testing using the UserZoom technology. In this paper, we describe how we do mobile remote usability testing using UserZoom technology.
Distributed automatic target recognition using multi-agent UAV swarms
Authors: Prithviraj Dasgupta
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In modern day warfare, reconnaissance operations such as automatic target recognition(ATR) using unmanned aerial vehicles(UAVs) constitute a strategic war tactic. Traditionally, ATR is performed by UAVs that fly within the reconnaissance area to collect image data through sensors and upload the data to a central base station for analyzing and identifying potential targets. The centralized approach to ATR introduces several problems including scalability with the number of UAVs, network delays in communicating with the central location, and, susceptibility of the system to malicious attacks on the central location. These challenges can be addressed using a distributed system for performing ATR. In this paper, we describe a multi-agent system called COMSTAR-UAV (Cooperative Multi-agent System for automatic TArget Recognition using Unmanned Aerial Vehicles) that uses swarming techniques inspired from insect colonies to perform ATR in a distributed manner.
Fast Active Appearance Model Search Using Canonical Correlation Analysis
Authors: Rene Donner, Michael Reiter, Georg Langs, Philipp Peloschek, Horst Bischof
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

A fast AAM search algorithm based on canonical correlation analysis (CCA-AAM) is introduced. It efficiently models the dependency between texture residuals and model parameters during search. Experiments show that CCA-AAMs, while requiring similar implementation effort, consistently outperform standard search with regard to convergence speed by a factor of four.
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning
Authors: Li Wang, Michael D. Gordon, Ji Zhu
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Linear regression is one of the most important and widely used techniques for data analysis. However, sometimes people are not satisfied with it because of the following two limitations: 1) its results are sensitive to outliers, so when the error terms are not normally distributed, especially when they have heavy-tailed distributions, linear regression often works badly; 2) its estimated coefficients tend to have high variance, although their bias is low. To reduce the influence of outliers, robust regression models were developed. Least absolute deviation (LAD) regression is one of them. LAD minimizes the mean absolute errors, instead of mean squared errors, so its results are more robust. To address the second limitation, shrinkage methods were proposed, which add a penalty on the size of the coefficients. The LASSO is one of these methods and it uses the L1-norm penalty, which not only reduces the prediction error and the variance of estimated coefficients, but also provides an automatic feature selection function. In this paper, we propose the regularized least absolute deviation (RLAD) regression model, which combines the nice features of the LAD and the LASSO together. The RLAD is a regularization method, whose objective function has the form of "loss + penalty." The "loss" is the sum of the absolute deviations and the "penalty" is the L1-norm of the coefficient vector. Furthermore, to facilitate parameter tuning, we develop an efficient algorithm which can solve the entire regularization path in one pass. Simulations with various settings are performed to demonstrate its performance. Finally, we apply the algorithm to solve the image reconstruction problem and find interesting results.
Dynamic heap type inference for program understanding and debugging
Authors: Marina Polishchuk, Ben Liblit, Chloë W. Schulze
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency with program types. Our approach builds on ideas from physical subtyping and conservative garbage collection. We infer a program-defined type for each allocated storage location or identify "untypable" blocks that reveal heap corruption or type safety violations. The analysis exploits symbolic debug information if present, but requires no annotation or recompilation beyond a list of defined program types and allocated heap blocks. We have integrated our analysis into the GNU Debugger (gdb), and describe our initial experience using this tool with several small to medium-sized programs.
Performance evaluation of chord in mobile ad hoc networks
Authors: Curt Cramer, Thomas Fuhrmann
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Mobile peer-to-peer applications recently have received growing interest. However, it is often assumed that structured peer-to-peer overlays cannot efficiently operate in mobile ad hoc networks (MANETs). The prevailing opinion is that this is due to the protocols' high overhead cost. In this paper, we show that this opinion is misguided.We present a thorough simulation study evaluating Chord in the well-known MANET simulator GloMoSim. We found the main issue of deploying Chord in a MANET not to be its overhead, but rather the protocol's pessimistic timeout and failover strategy. This strategy enables fast lookup resolution in spite of highly dynamic node membership, which is a significant problem in the Internet context. However, with the inherently higher packet loss rate in a MANET, this failover strategy results in lookups being inconsistently forwarded even if node membership does not change.
An Efficient Approach to Web Services Discovery and Composition when Large Scale Services are Available
Authors: Zhumin Chen, Jun Ma, Ling Song, Li Lian
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Web Services composition and discovery are two most important research issues in the study of Web Services. Based on the study on previous known conferences it is pointed out that the Web Service Composition Tree (WSCT) is the key that affects the performance of Web Services compositions when a large number of services are available. Then the mutual search operations among Web Service operations, inputs and outputs are studied, and a novel data structure called Double Parameter Inverted File (DuoParaInvertedFile) is proposed to implement these operations. An algorithm to build DuoParaInvertedFile is provided as well. Based on above results an efficient algorithm for constructing the WSCT is given. Furthermore, the QoS (Quality of Service) of Web Service Composition Results (WSCRs) is defined, and then an algorithm used to get the best WSCR in terms of QoS is proposed. Experiments show that this approach not only ensures the success of the performance of Web Services composition but also ensures the QoS of Web Services composition.
A distributed architecture to support infomobility services
Authors: Claudia Canali, Riccardo Lancellotti
Venue: Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications (2006)

The growing popularity of mobile and location aware devices allows the deployment of infomobility systems that provide access to information and services for the support of user mobility. Current systems for infomobility services assume that most information is already available on the mobile device and the device connectivity is used for receiving critical messages from a central server. However, we argue that the next generation of infomobility services will be characterized by collaboration and interaction among the users, provided through real-time bidirectional communication between the client devices and the infomobility system.In this paper we propose an innovative architecture to support next generation infomobility services providing interaction and collaboration among the mobile users that can travel by several different transportation means, ranging from cars to trains to foot. We discuss the design issues of the architecture, with particular emphasis on scalability, availability and user data privacy, which are critical in a collaborative infomobility scenario.
A dynamical clustering method for symbolic interval data based on a single adaptive Euclidean distance
Authors: Francisco de A. T. de Carvalho, Renata M. C. R. de Souza, Lucas X. T. Bezerra
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

The recording of symbolic interval data has become a common practice with the recent advances in database technologies. This paper introduces a dynamic clustering method to partitioning symbolic interval data. This method furnishes a partition and a prototype for each cluster by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. To compare symbolic interval data, the method uses a single adaptive Euclidean distance that at each iteration changes but is the same for all the clusters. Experiments with real and synthetic symbolic interval data sets showed the usefulness of the proposed method.
Secure Integration of Distributed Medical Data Using Mobile Agents
Authors: Pedro Manuel Vieira-Marques, Sergi Robles, Jordi Cucurull, Ricardo Joao Cruz-Correia, Guillermo Navarro, Ramon Marti
Venue: IEEE Intelligent Systems (2006)

This article is part of a special issue on Intelligent Agents in Healthcare. This article proposes a secure medical-information-gathering system based on mobile agents that overcomes traditional systems' data availability issues. Information availability is a major concern when the provision of care is at stake. Physicians make their decisions based on available information. Virtual electronic patient records (VEPRs) provide the necessary means for intra-institution data integration, enabling a single view of all patients' clinical information. Nevertheless, patients are mobile entities visiting multiple institutions during their life, leaving a trail of scattered information. This proposal is based on a mobile-agent system that provides IEEE-FIPA standardized interinstitution data discovery, transport, and integration for medical information. It combines traditional security schemes for protecting information with advanced agent-driven self-protection mechanisms and role-based access control. The system interacts with remote legacy applications, thus facilitating integration of clinical documents. Highly sensitive medical information can be brought where needed.
Univariate and bivariate orthonormal splines and cardinal splines on compact supports
Authors: Xiaoyan Liu
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, univariate and bivariate orthonormal spline functions with small compact supports are constructed. The properties of orthonormal splines are explored. Furthermore, cardinal spline functions with small compact supports are built. Numerical integration formulas are created as the applications of the cardinal splines. The method can also be used to construct high-dimensional orthonormal splines, which are not cross products of univariate splines and have their own advantages.
Structured Intelligence
Authors: Essameddin Badreddin, Meike Jipp
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)

A definition and structure of intelligence is suggested based on research results in neurophysiology, psychology, and system theory. Intelligence is defined as the ability to solve problems using space and time resources. The problem solving behavior depends on experience, innovation, solution fusion, and learning mechanisms. Suggestions for implementing these proposed components are provided and discussed, as are cross-disciplinary research results, which support the proposed structure and suggestions for implementation. Implications of the cross-disciplinary structured intelligence (1) on research on artificial intelligence systems such as human-machine systems and on simulation models as well as (2) on intelligence testing are brought into account.
The 3-D Prefrontal Cortex: Hemispheric Asymmetries in Prefrontal Activity and Their Relation to Memory Retrieval Processes
Authors: Charan Ranganath
Venue: Journal of Cognitive Neuroscience (2004)

Neuroimaging results have raised interest in characterizing hemispheric asymmetries in prefrontal activity during different types of memory retrieval tasks. In this issue, Dobbins et al. and Mitchell et al. report results suggesting that the two hemispheres of the prefrontal cortex may indeed make different contributions to memory retrieval. Here, I discuss these findings within the context of studies characterizing more general processing differences between the cerebral hemispheres and studies characterizing prefrontal organization along the dorsal&ndash;ventral and anterior&ndash;posterior dimensions.
Processing Tonal Modulations: An ERP Study
Authors: Stefan Koelsch, Thomas Gunter, Erich Schröger, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2003)

A common stylistic element of Western tonal music is the change of key within a musical sequence (known as modulation in musical terms). The aim of the present study was to investigate neural correlates of the cognitive processing of modulations with event-related brain potentials. Participants listened to sequences of chords that were infrequently modulating. Modulating chords elicited distinct effects in the event-related brain potentials: an early right anterior negativity reflecting the processing of a violation of musical regularities and a late frontal negativity taken to reflect processes of harmonic integration. Additionally, modulations elicited a tonic negative potential suggested to reflect cognitive processes characteristic for the processing of tonal modulations, namely, the restructuring of the "hierarchy of harmonic stability" (which specifies musical expectations), presumably entailing working memory operations. Participants were "nonmusicians"; results thus support the hypothesis that nonmusicians have a sophisticated (implicit) knowledge about musical regularities.
System-on-Chip Architecture Design for Intelligent Sensor Networks
Authors: Wai-Chi Fang, Sharon Kedar, Susan Owen, Gu-Yeon Wei, David Brooks, Jonathan Lees
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

While wireless sensor networks can generically be used for a wide variety of applications, breakthrough innovations are most often achieved when driven by a genuine need or application, with its specific system-level and science-related requirements and objectives. Hence, our work focuses on the development of wireless sensor network system-on-chip devices and supporting software for volcano monitoring, which we call Sensor Network for Active Volcanoes (SNAV). In this paper we present preliminary results of our research and development work on intelligent sensor networks for monitoring hazardous environments especially the SNAV system-on-chip design for active volcanoes monitoring.
A Synchronous Multimedia Annotation System for Secure Collaboratories
Authors: Ronald Schroeter, Jane Hunter, Jonathon Guerin, Imran Khan, Michael Henderson
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper, we describe the Vannotea system - an application designed to enable collaborating groups to discuss and annotate collections of high quality images, video, audio or 3D objects. The system has been designed specifically to capture and share scholarly discourse and annotations about multimedia research data by teams of trusted colleagues within a research or academic environment. As such, it provides: authenticated access to a web browser search interface for discovering and retrieving media objects; a media replay window that can incorporate a variety of embedded plug-ins to render different scientific media formats; an annotation authoring, editing, searching and browsing tool; and session logging and replay capabilities. Annotations are personal remarks, interpretations, questions or references that can be attached to whole files, segments or regions. Vannotea enables annotations to be attached either synchronously (using jabber message passing and audio/video conferencing) or asynchronously and stand-alone. The annotations are stored on an Annotea server, extended for multimedia content. Their access, retrieval and re-use is controlled via Shibboleth identity management and XACML access policies.
Modeling of the electrical properties of polycrystalline ceramic semiconductors with submicron grains
Authors: I. V. Rozhansky, D. A. Zakheim
Venue: Microelectronic Engineering (2005)

A numerical model for simulation of the microstructure and electrical properties of semiconductor ceramic materials is presented. For the case of the average grain size being comparable to the grain boundary depleted region and the double Schottky barriers of the neighboring grain boundaries overlap. The two-dimensional (2D) simulation is performed in the drift-diffusion approximation using Voronoi network method. The influence of the grain size on the volt-ampere characteristic and specific electrical capacitance is analyzed for p-type SrTiO"3.
Security Architecture for Web-based Health Insurance Systems
Authors: Mucahit Mutlugun, Ibrahim Sogukpinar
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Today, the use of information systems in healthcare has dramatically increased. Some health insurance companies use WWW for patient operations such as opening patient consultation, prescription etc. From the security point of view, generally simple security is applied in order to identify patients and physicians. The lack of security results in exploitation of insurance companies by some of patients and physicians. In this paper, we have examined the current web-based healthcare insurance systems and purposed security architecture to solve security problems. The security architecture highly depends on patient and physician smart cards and fingerprint-based biometrics.
Recognize High Resolution Faces: From Macrocosm to Microcosm
Authors: Dahua Lin, Xiaoou Tang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Human faces manifest distinct structures and characteristics when observed in different scales. Traditional face recognition techniques mainly rely on low-resolution face images, leading to the lost of significant information contained in the microscopic traits. In this paper, we introduce a multilayer framework for high resolution face recognition exploiting features in multiple scales. Each face image is factorized into four layers: global appearance, facial organs, skins, and irregular details. We employ Multilevel PCA followed by Regularized LDA to model global appearance and facial organs. However, the description of skin texture and irregular details, for which conventional vector representation are not suitable, brings forth the need of developing novel representations. To address the issue, Discriminative Multiscale Texton Features and SIFT-Activated Pictorial Structure are proposed to describe skin and subtle details respectively. To effectively combine the information conveyed by all layers, we further design an metric fusion algorithm adaptively placing emphasis onto the highly confident layers. Through systematic experiments, we identify different roles played by the layers and convincingly show that by utilizing their complementarities, our framework achieves remarkable performance improvement.