ppxscal/embedding_network huggingface dataset:
Shared environment representation for a human-robot team performing information fusion
Authors: Tobias Kaupp, Bertrand Douillard, Fabio Ramos, Alexei Makarenko, Ben Upcroft
Venue: Journal of Field Robotics (2007)

This paper addresses the problem of building a shared environment representation by a human-robot team. Rich environment models are required in real applications for both autonomous operation of robots and to support human decision-making. Two probabilistic models are used to describe outdoor environment features such as trees: geometric (position in the world) and visual. The visual representation is used to improve data association and to classify features. Both models are able to incorporate observations from robotic platforms and human operators. Physically, humans and robots form a heterogeneous sensor network. In our experiments, the human-robot team consists of an unmanned air vehicle, a ground vehicle, and two human operators. They are deployed for an information gathering task and perform information fusion cooperatively. All aspects of the system including the fusion algorithms are fully decentralized. Experimental results are presented in form of the acquired multi-attribute feature map, information exchange patterns demonstrating human-robot information fusion, and quantitative model evaluation. Learned lessons from deploying the system in the field are also presented. &copy; 2007 Wiley Periodicals, Inc.
Building Investment Strategy Portfolios by Combination Genetic Algorithms
Authors: Jiah-Shing Chen, Jia-Li Hou, Shih-Min Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The classical portfolio problem is a problem of distributing capital to a set of securities. By generalizing the set of securities to a set of investment strategies (or security-rule pairs), this study proposes an investment strategy portfolio problem, which becomes a problem of distributing capital to a set of investment strategies. Since the investment strategy portfolio problem can be formulated as a combination optimization problem, a new combination genetic algorithm is proposed for solving the new investment strategy portfolio problem. Experimental results show that the idea of investment strategy portfolios is feasible and the combination genetic algorithm is effective on the investment strategy portfolio problem.
Speech Understanding Through Syntactic and Semantic Analysis
Authors: D. E. Walker
Venue: IEEE Transactions on Computers (1976)

Stanford Research Institute (SRI) is participating in a major program of research on the analysis of continuous speech by computer. The goal is the development of a speech understanding system capable of engaging a human operator in a natural conversation about a specific problem domain. The approach being taken is distinctive in the extent to which it depends on syntactic and semantic processing to guide the acoustic analysis. This correspondence provides a description of the first version of the system, emphasizing the kinds of information that need to be added for effective results.
k-Unlinkability: A privacy protection model for distributed data
Authors: Bradley Malin
Venue: Data Knowledge Engineering (2008)

In the past, data holders protected the privacy of their constituents by issuing separate disclosures of sensitive (e.g., DNA) and identifying data (e.g., names). However, individuals visit many places and their location-visit patterns, or ''trails'', can re-identify seemingly anonymous data. In this paper, we introduce a formal model of privacy protection, called k-unlinkability, to prevent trail re-identification in distributed data. The model guarantees that sensitive data trails are linkable to no less than k identities. We develop a graph-based model and illustrate how k-unlinkability is a more appropriate solution to this privacy problem compared to alternative privacy protection models.
Operational Life Testing of Electronic Components
Authors: David Farnholtz
Venue: IEEE Design Test (1985)

The infant mortality rates for ICs and other components have been a major concern throughout the electronics industry. OperationalLife Testing was developed by AT&T to continuously monitor the early-life failure levels of various electonic componentproduct families at the manufacturing plant. Rapid failure-mode analysis of OLT defects and implementation of the indicatedprocess, testing, and design changes have in resuled in significant savings and enhanced component reliability. OLT couldalso be applied to incoming components by a system manufacturer. 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
Operating System Integration and Performance of a Multi Stream Cipher Architecture for Reconfigurable System-on-Chip
Authors: C. M. Wee, P. R. Sutton, N. W. Bergmann
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper describes the integration and performance of a multi-stream cipher core with a uClinux Microblaze based reconfigurable System-on- Chip that uses the Open Crypto Framework. This allows applications to access the multi stream cipher core via kernel space calls.
An Advanced-Architectur CMOS/SOS Microprocessor
Authors: David Best, Charles Kress, Nick Mykris, Jeffrey Russell, William Smith
Venue: IEEE Micro (1982)

A language-directed stack architecture, implemented in two-micrometer CMOS/SOS, yields a 16-bit microprocessor having high throughput and high compiled code density.
pService: Peer-to-Peer based Web Services Discovery and Matching
Authors: Weifeng Lv, Jianjun Yu
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Nowadays Web Services has been one of the most prevalent technology for resource integration and share. Usually Web Services scheme standard protocols WSDL and UDDI to describe, discover and integrate web resources, whereas it is not realistic for all companies to publish their services to one registry, which definitely will result in one point of failures and meet scalability problem. P2P overlay network provides a scalable alternative for service providers by distributing service descriptions among all peers while keeping system's decentralization, scalability, load-balancing and self-organizing. In this paper, we scheme WSDL-S as Web services semantic description language, and construct a P2P overlay network for Web services distribution, discovery and invocation supporting locality-preserving, range query, tree lookups and semantic service matching. We also promote a Web Services discovery system named pService and achieve considerable performance comparable to centralized service discovery systems.
Semantic clustering of information systems' users with stochastic techniques
Authors: Konstantinos Raftopoulos, Nikolaos Papadakis, Klimis Ntalianis, Stefanos Kollias
Venue: Proceedings of the International Conference on Semantic Computing (2007)

We use a Markovian model to capture the habitual user profiles of an information access system. In this model, the general as well as the individual for each user, profile is captured in the form of a Markovian process where the states are the keywords asked to the system by the users and a transition from state to state corresponds to the order theses keywords appeared in the queries. Under this model the probabilistic locality of the Markovian state space translates to semantical locality of the corresponding keywords in a way that a clustering of the Markovian state space corresponds to a semantic clustering of the keyword space. Since the states represent keywords asked by the users, the state space can grow very large, but at the same time it is partitioned into disjoint subsets such that strong interactions among the states of the same subset exists but weak interactions among states of different subsets. We exploit this structure to effectively cluster the large state space and reveal the corresponding semantic keyword clusters. We then define a semantic distance between the various user profiles that can be used to cluster the user space on the basis of keyword usage and keyword semantic relevance. The resulting clustering achieves high independence from the row data. Users for e.g. that never asked a common keyword may end up very close to each other if their keywords were asked together by many other users.
User-Centric Identity Management: New Trends in Standardization and Regulation
Authors: Pete Bramhall, Marit Hansen, Kai Rannenberg, Thomas Roessler
Venue: IEEE Security and Privacy (2007)

The European Commission-funded Privacy and Identity Management for Europe project (Prime) proposes a solution driven by the EU Privacy Directive, which puts the user in control wherever possible. This article focuses on that project and how it interacts with standardization initiatives and international organizations.
Line Detection for Point Set of Varying Discrete Degrees
Authors: Haidong Yuan, Huadong Ma
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Many line detection algorithms based on Hough transform are used to work on continuous set of points, such as edge image, which is composed of continuous or almost continuous points. When these algorithms work on the high-discrete point set, they produce the multi-short-line segments because of the noise and large gaps between points, which seldom characterize the whole line segment completely. We proposed an improved HoughLines algorithm to solve this problem: First, we propose a new sorting strategy of the point coordinates that is self-adaptive for each line segment; second, we improve the strategy of finding the non-background points that contributed to peaks of Hough transform matrix through a tolerance threshold. The improved algorithm can detect line segments in point set of varying discrete degrees at a high precision. A number of experiments show our method is very efficient.
Frequent XML Query Pattern Mining based on FP-TRee
Authors: Mi Sug Gu, Jeong Hee Hwang, Keun Ho Ryu
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

XML data are increasing in many areas including internet and public documentation. XML data change dynamically while processing the query. Many kinds of techniques have been researched to speed up the query performance about XML data structures. In this paper, based on the XML structure, we analyze the query pattern and propose the data mining technique about extracting the similar query pattern by the users. In this paper to speed up the performance we used FP-growth algorithm for mining similar query patterns about the XML data structure. We confirmed that the proposed method using FP-growth algorithm applied to XML query subtrees outperforms Apriori algorithm. The proposed method gives the fast query result about the repeatedly occurring queries.
The e-maturity of the organization as barometer of the e-readiness of warehouse workers
Authors: Hermanus B. Moolman, A. Seugnet Blignaut
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Organizations aspire to lead in their fields to attract the most profitable customers and clients. e-Maturity, specifically the utilization of Information Technology (IT), provides such a leading edge. Workers are constantly retrained to keep up with the dynamics of the organization. Organizations constantly retrain their workers to keep them current with their function. However, classroom training takes workers away from production and no company can afford this. As a compromise many organizations employ e-learning to train their employees. However many companies do not prepare their employees to become self-driven learners. They question warehouse workers' discipline, motivation, and skills for a complex learning strategy such as e-learning. Reeves identified three fundamental inputs -- emotional, technical, and social aspects -- that influence e-readiness. [1] This article reports an interpretive qualitative case study and uses these fundamental inputs to uncover the influences on the e-readiness of warehouse workers in South Africa.
A web-based semi-automatic assessment tool for conceptual database diagram
Authors: F. Batmaz, C. J. Hinde
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The increased number of diagram-type student work in higher education has recently attracted researchers to look into the automation of diagram marking. This paper proposes a new (semi-automatic) marking approach to reduce number of the diagram component marked by the human marker. We believe this approach improves the marking consistency and has potential to provide individualised and detailed feedback to students with mark-ups. We have developed a prototyped web-based diagram drawing and marking tools for the approach. The initial experiment and findings for the tools are described in the paper.
A Flexible Multi-Volume Shader Framework for Arbitrarily Intersecting Multi-Resolution Datasets
Authors: John Plate, Thorsten Holtkaemper, Bernd Froehlich
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a powerful framework for 3D-texture-based rendering of multiple arbitrarily intersecting volumetric datasets. Each volume is represented by a multi-resolution octree-based structure and we use out-of-core techniques to support extremely large volumes. Users define a set of convex polyhedral volume lenses, which may be associated with one or more volumetric datasets. The volumes or the lenses can be interactively moved around while the region inside each lens is rendered using interactively defined multi-volume shaders. Our rendering pipeline splits each lens into multiple convex regions such that each region is homogenous and contains a fixed number of volumes. Each such region is further split by the brick boundaries of the associated octree representations. The resulting puzzle of lens fragments is sorted in front-to-back or back-to-front order using a combination of a view-dependent octree traversal and a GPU-based depth peeling technique. Our current implementation uses slice-based volume rendering and allows interactive roaming through multiple intersecting multi-gigabyte volumes.
A Nonlinear Feature Extraction Algorithm Using Distance Transformation
Authors: W. L. G. Koontz
Venue: IEEE Transactions on Computers (1972)

Feature extraction has been recognized as a useful technique for pattern recognition. Feature extraction is accomplished by constructing a mapping from the measurement space to a feature space. Often, the mapping is chosen from an arbitrarily specified parametric family by optimizing the parameters with respect to a separability criterion.
On the role of user-centred evaluation in the advancement of interactive information retrieval
Authors: Daniela Petrelli
Venue: Information Processing and Management: an International Journal (2008)

This paper discusses the role of user-centred evaluations as an essential method for researching interactive information retrieval. It draws mainly on the work carried out during the Clarity Project where different user-centred evaluations were run during the lifecycle of a cross-language information retrieval system. The iterative testing was not only instrumental to the development of a usable system, but it enhanced our knowledge of the potential, impact, and actual use of cross-language information retrieval technology. Indeed the role of the user evaluation was dual: by testing a specific prototype it was possible to gain a micro-view and assess the effectiveness of each component of the complex system; by cumulating the result of all the evaluations (in total 43 people were involved) it was possible to build a macro-view of how cross-language retrieval would impact on users and their tasks. By showing the richness of results that can be acquired, this paper aims at stimulating researchers into considering user-centred evaluations as a flexible, adaptable and comprehensive technique for investigating non-traditional information access systems.
Visual Methods for Analyzing Time-Oriented Data
Authors: Wolfgang Aigner, Silvia Miksch, Wolfgang Müller, Heidrun Schumann, Christian Tominski
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Providing appropriate methods to facilitate the analysis of time-oriented data is a key issue in many application domains. In this paper, we focus on the unique role of the parameter time in the context of visually driven data analysis.We will discuss three major aspects — visualization, analysis, and the user. It will be illustrated that it is necessary to consider the characteristics of time when generating visual representations.For that purpose we take a look at different types of time and present visual examples. Integrating visual and analytical methods has become an increasingly important issue. Therefore, we present our experiences in temporal data abstraction, principal component analysis, and clustering of larger volumes of time-oriented data. The third main aspect we discuss is supporting user-centered visual analysis.We describe event-based visualization as a promising means to adapt the visualization pipeline to needs and tasks of users.
Analysis of Multiprocessor Control Organizations with Partial Program Memory Replication
Authors: A. A. Covo
Venue: IEEE Transactions on Computers (1974)

In certain real-time multiprocessor controllers the program memory must be at least partly replicated to reduce queuing delays and meet throughput requirements. In these organizations the program memory is a common pool consisting of K sections servicing m CPU's. The jth section is of size Xi and is replicated ni times (ni = m); j = 1,...-, K. Dynamic programming is used to find optimal values of the number of replications ni relative to given fixed values of m, K, and Xi. This solution satisfies throughput requirements at minimum cost, relative to the given m, K, and Xi. The process is repeated for several values of the last three parameters, using a systematic search procedure described herein, until reaching the first local minimum. This usually provides a satisfactory suboptimal solution. Partial replication (n, = m) is economically attractive in a wide class of real-time control systems in which the CPU's access a relatively small portion of the program store most of the time. Quantitative examples indicate that partial replication may cause 30 to 40 percent cost reduction compared to full replication.
Medical image segmentation using cooccurrence matrix based texture features calculated on weighted region
Authors: Ludvik Tesar, Daniel Smutek, Akinobu Shimizu, Hidefume Kobatake
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

An improvement of texture based 2D or 3D image segmentation method is proposed, aimed at medical image analysis. Segmentation of organs or disease diagnosing is the targetted problem. Features based on cooccurrence matrix are studied. A new approach to local cooccurrence matrix calculation is proposed in this paper. Separate cooccurrence matrix is calculated for each pixel (in 2D case) or vowel (in 3D case), based on pixels (voxels) around the original pixel (voxel). The new approach is in the way of calculating the cooccurrence matrix. As opposed to classical definition where cooccurrence matrix values are counts of relative frequencies of cooccurrences over defined region, we propose for each cooccurrence, to be weighted by the function of distance from the original pixel (voxel) of interest. Compared to calculating the cooccurrence texture features over square (or cubic) region around a pixel (voxel), the proposed approach makes cooccurrence matrix and texture feature more focused, therefore it can be used to search for smaller regions with different texture properties (like tumours). A set of abdominal CT images is used for evaluation of the proposed approach and comparison with older cubic region based approach. The actual cooccurrence features used were some of those proposed by Haralick.
Indexing by Metric Adaptation and Representation Upgrade in an Emotion-based Agent Model
Authors: Rodrigo Ventura, Carlos Pinto-Ferreira
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Following recent neurophysiological research, one important role of emotions consists in providing a mechanism for adequate and efficient response to relevant stimuli. In this paper we propose a methodology for implementing such a mechanism, based on a previously presented emotion-based agent model. This model is founded on a double knowledge representation paradigm: a stimulus reaching the agent is processed under two different and simultaneous perspectives -- a simple (termed perceptual) and a complex (termed cognitive) -- from which two differing representation schemata are derived. This paper addresses a twofold strategy for the construction of a perceptual representation. The first one consists in adapting a perceptual metric, with the goal of approximating it to the cognitive metric. The second one has the goal of upgrading the perceptual representation with additional components (e.g., features). Techniques borrowed from nonmetric Multidimensional Scaling are used to approach these goals.
Mutual Effect of Instruction Layout Optimization and Instruction Memory Hierarchy
Authors: Yu-Ying Wang, Xing-She Zhou
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Instruction layout optimization can efficiently improve the performance of instruction cache by dramatically reducing the instruction fetch miss rate. Traditional instruction layout optimization methods usually do not consider tuning the hardware architecture of the instruction cache in the optimizing process. Therefore, they trend to result in local-optimal solutions. This paper studies the mutual effect of the instruction layout optimization and the instruction memory hierarchy. We built a framework to perform the instruction layout optimizations by profiling the call graph and reordering the instructions at the procedure level. Then, the original procedure and instruction layout optimized one are run on platforms with different cache hierarchy, and the cache miss rates are compared. Experimental results show that the instruction cache configuration greatly influences the benefit of instruction layout optimization, and the performance of the instruction cache could be potentially improved by jointly considering them together.