ppxscal/embedding_network huggingface dataset:
Shooting methods for numerical solutions of exact controllability problems constrained by linear and semilinear wave equations with local distributed controls
Authors: Sung-Dae Yang
Venue: Applied Mathematics and Computation (2006)

Numerical solutions of exact controllability problems for linear and semilinear wave equations with distributed controls are studied. Exact controllability problems can be solved by the corresponding optimal control problems. The optimal control problem is reformulated as a system of equations (an optimality system) that consists of an initial value problem for the underlying (linear or semilinear) wave equation and a terminal value problem for the adjoint wave equation. The discretized optimality system is solved by a shooting method. The convergence properties of the numerical shooting method in the context of exact controllability are illustrated through computational experiments.
An architecture for the estimation of higher order cumulants
Authors: H. M. Stellakis, E. S. Manolakos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

To achieve real-time performance in signal processing applications that require the estimation of higher order statistics, it is necessary to introduce parallel processing and pipelining. The authors present a two stage VLSI architecture for the computation of all the non-negative lags of the cumulants of a real, one-dimensional data sequence. All the non-negative lags of the moments, up to the fourth order, are computed first by a triangular array, based on the indirect block-type estimation approach (C. L. Nikias and M. R. Roghuveer, 1987). The second and fourth order moments are then used to compute the fourth order cumulants using additional processors. A systematic algorithm-to-architectures synthesis methodology facilitated the design of both parts of the architecture and their optimal space and data flow matching.
Plug once, test everything
Authors: Ariel Sabiguero Yawelak, Cesar Viho
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Configuration management presents several challenges to test suite execution in Interoperability Testing. Several nodes have to be rearranged from test to test in a reliable and efficient way. This work proposes a novel methodology based on the replacement of underlying networking technologies to transparently automatize the process. The methodology is presented and initial results are exposed.
A Toolkit for Design and Performance Analysis of Real-Time Component-Based Software Systems
Authors: Egor Bondarev, Michel Chaudron, Heorhiy Byelas, Peter H. N. de With
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Software tools supporting the design and analysis of complex software-intensive systems are highly desirable, since they enable earlier decision making about system realization. This paper presents a tooling environment that supports the design and performance analysis of time-critical component-based software architectures deployed on complex multiprocessor platforms. The tooling environment contains a set of integrated tools for (a) component storage and retrieval, (b) graphics-based design of software and hardware architectures, (c) performance analysis of the defined architectures and, (d) automated code generation. The cornerstone of the toolkit is a performance analyzer that provides efficient simulation of the designed architectures and enables design-time prediction of key performance properties like response time, data throughout, and usage of hardware resources (processor, memory and bus). For every architecture alternative, the performance predictions can be quickly obtained, thereby enabling a fast and yet broad design space exploration. We demonstrate the efficiency and robustness of this toolkit on a Car Radio Navigation benchmark case.
The interpreted system model of knowledge, belief, desire and intention
Authors: Kaile Su, Xiangyu Luo, Abdul Sattar, Mehmet A Orgun
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a new model of knowledge, belief, desire and intention, called the interpreted KBDI-system model (or KBDI-model for short). The key point of the interpreted KBDI-system model is that we express an agent's knowledge, belief, desire and intention as a set of runs (computing paths), which is exactly a system in the interpreted system model, a well-known agent model due to Halpern and his colleagues. Our KBDI-model is computationally grounded in that we are able to associate a KBDI-model with a computer program, and formulas, involving agents' knowledge, belief, desire (goal) and intention, can be understood as properties of program computations. We present a sound and complete proof system with respect to our KBDI-model and explore how symbolic model checking techniques can be applied to model checking multi-agent systems with KBDI-models.
Entropy-based Concept Shift Detection
Authors: Peter Vorburger, Abraham Bernstein
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

When monitoring sensory data (e.g., from a wearable device) the context oftentimes changes abruptly: people move from one situation (e.g., working quietly in their office) to another (e.g., being interrupted by one's manager). These context changes can be treated like concept shifts, since the underlying data generator (the concept) changes while moving from one context situation to another. We present an entropy based measure for data streams that is suitable to detect concept shifts in a reliable, noise-resistant, fast, and computationally efficient way. We assess the entropy measure under different concept shift conditions. To support our claims we illustrate the concept shift behavior of the stream entropy. We also present a simple algorithm control approach to show how useful and reliable the information obtained by the entropy measure is compared to a ensemble learner as well as an experimentally inferred upper limit. Our analysis is based on three large synthetic data sets representing real, virtual, and a combination of both concept drifts under different noise conditions (up to 50%). Last but not least, we demonstrate the usefulness of the entropy based measure context switch indication in a real world application in the context-awareness/wearable computing domain.
Scale-Driven Iterative Optimization for Brain Extraction and Registration
Authors: Terrence Chen, Thomas S. Huang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a novel framework to automatically separate brain region from other non-brain regions in head images. The idea of the proposed method is to estimate larger scale patterns in an image and then correct the boundaries iteratively. The scale estimation is based on the recently proposed total variation (TV) regularized L^1 functional. An iterative optimization method is used to refine non-convex and acute angle boundaries. The final algorithm is able to extract large scale patterns with arbitrary shapes, which is particularly suitable for brain extraction. In order to reduce the computation overhead in 3D data, a multi-level technique is proposed to exponentially improve the speed of the brain extraction process. Based on accurate results of brain extraction, a non-rigid brain registration algorithm is proposed to improve accuracy and consistency of existing registration methods. Experimental results on real 3D brain MR images demonstrate that the proposed methods outperform existing solutions. In addition, results are provided to show that the proposed algorithm can also be used to segment large scale patterns in general images.
The GOBASE: an information management system for Gene Ontology
Authors: Ruey-Lung Hsiao, D. Stott Parker
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Recent research in biology has discovered that a large portion of genes that are responsible for core biological functions are conserved in most or all living cells. This has initiated development of, and emphasizes the importance of, common annotation facilities for biological knowledge, as features and functions of an unknown gene can be related to or inferred from those of a similar and well-studied gene. The Gene Ontology ('GO'), a collection of three ontologies each defining a specialization hierarchy of biological terms, has been an extraordinary focus of this effort. This paper describes GOBASE, a publicly-available graph database for query and visualization of GO information. There are existing browsers for visualizing GO information, but GObase provides a more powerful interface, allowing both interactive query and interactive annotation of GO terms with other data sources. We will focus on how GOBASE achieves interactive annotation and query and its tight interactions with backend databases.
Pursuing Informative Projection on Grassmann Manifold
Authors: Dahua Lin, Shuicheng Yan, Xiaoou Tang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Inspired by the underlying relationship between classification capability and the mutual information, in this paper, we first establish a quantitative model to describe the information transmission process from feature extraction to final classification and identify the critical channel in this propagation path, and then propose a Maximum Effective Information Criteria for pursuing the optimal subspace in the sense of preserving maximum information that can be conveyed to final decision. Considering the orthogonality and rotation invariance properties of the solution space, we present a Conjugate Gradient method constrained on a Grassmann manifold to exploit the geometric traits of the solution space for enhancing the efficiency of optimization. Comprehensive experiments demonstrate that the framework integrating the Maximum Effective Information Criteria and Grassmann manifold-based optimization method significantly improves the classification performance.
Integration of transient Web services into a virtual peer to peer Web service registry
Authors: Schahram Dustdar, Martin Treiber
Venue: Distributed and Parallel Databases (2006)

Transient Web service provisioning implies a variety of different requirements that are hard to meet in traditional Web service environments. Currently, Web service brokerage focuses on centralized or replicated architectures. We argue that such systems are not efficient when it comes to dynamic, respectively ad hoc, Web service provisioning. We propose a distributed peer to peer Web service registry solution based on lightweight Web service profiles. We further introduce the notion of views that allow the specification of arbitrary contexts of Web services and provide a working example to illustrate our approach. Finally, we present a prototype that uses tuple spaces as global storage and communication means.
A Multi-Class Tracker Using a Scalable Condensation Filter
Authors: Simon Denman, Vinod Chandran, Sridha Sridharan, Clinton Fookes
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Tracking systems are typically targeted towards tracking a single class of object. In many real world situations, and in the ETISEO evaluation, it is advantageous to be able to track multiple classes of objects. In this paper we describe the adaptation of a single class tracking system to a multi-class tracking system, and describe a modified version of the condensation filter that can be used to track all objects, of all classes. We show that by using simple targeted detectors, we can achieve accurate tracking and can accurately distinguish between classes.
COTS-based DSRC testbed for rapid algorithm development, implementation, and test
Authors: Jared Dulmage, Minko Tsai, Mike Fitz, Babak Daneshrad
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

This paper describes a Dedicated Short Range Communications (DSRC) testbed which demonstrates the use of common, off-the-shelf (COTS) products to enable rapid algorithm development from conception to hardware implementation and test.
Utilizing witness simulation to model the UH60 Blackhawk production
Authors: Christopher S. Legge
Venue: Proceedings of the 36th conference on Winter simulation (2004)

A case study presentation on the development of a WITNESS / SIMBA simulation to assist the US ARMY monitor the UH60M Blackhawk manufacturing program, the development of a dashboard and the use of a Visual Basic application with embedded WITNESS Simulation Engine. 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
Nullification of Electromagnetic Radiation: 50 Hz Artifact During Electroencephalogram Recording
Authors: S. Murali, Vladimir V. Kulish
Venue: Journal of Medical Systems (2006)

This paper discusses the 50-Hz artifact observed during EEG recording of three patients, using Mindset24 equipment in a biomedical laboratory along with other instruments. The artifact at 50 Hz is created due to electromagnetic (EM) radiation from the environment. Perhaps, the nullification of 50 Hz artifact occurs by the three important means such as (a) grounding of far-field EM current when the patient touches the equipment metal casing, (b) connecting the electrodes in a sequence to obtain differential potentials with suppressed near-field EM radiation potentials of the scalp, and (c) destructive interferences of the EM waves.
Enhancing XML search with XQuery 1.0 and XPath 2.0 full-text
Authors: P. Case
Venue: IBM Systems Journal (2006)

Powerful queries of character strings, numbers, dates, and nodes are familiar to users of relational database systems. Full-text database search systems feature queries that (1) use logical, proximity, and starts-with operators, (2) offer user control of case and diacritics, stemming, and wildcards, and (3) support thesauruses, taxonomies, and ontologies. Two emerging standards, XQuery 1.0 and XQ/XPFT (XQuery 1.0 and XPath 2.0 Full-Text), combine the search capabilities of the aforementioned systems and promise to change the face of full-text searching. This paper explores the expected benefits of these standards in searching relational data and full-text documents in XML from an end user point of view and describes how these benefits would apply to a search system used at the Library of Congress. These standards have the potential to solve many real-life full-text search system problems and to restore the end-user control necessary to enable and facilitate complex searching.
Recognition of Vowel Segments in Spanish Esophageal Speech Using Hidden Markov Models
Authors: Alfredo Mantilla, Hector Perez-Meana, Daniel Mata, Carlos Angeles, Jorge Alvarado, Laura Cabrera
Venue: Proceedings of the 15th International Conference on Computing (2006)

This paper presents a system for recognition of voiced segments in Spanish esophageal speech. It exposes different algorithms for the feature extraction of speech segment like formant analysis, linear prediction coefficients (LPC) and Mel Frequency Cepstral Coefficients (MFCC), as well as, the recognition stage through the Hidden Markov Models. Simulation results are presented for normal and esophageal speech. The system was implemented in a real time processing platform based on a digital signal processor TMS320C5416 of Texas Instruments.
Performance Modeling and Prediction of Face Recognition Systems
Authors: Peng Wang, Qiang Ji
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

It is a challenging task to accurately model the performance of a face recognition system, and to predict its individual recognition results under various environments. This paper presents generic methods to model and predict the face recognition performance based on analysis of similarity measurement. We first introduce a concept of "perfect recognition", which only depends on the intrinsic structure of a recognition system. A metric extracted from perfect recognition similarity scores (PRSS) allows modeling the face recognition performance without empirical testing. This paper also presents an EM algorithm to predict the recognition rate of a query set. Furthermore, features are extracted from similarity scores to predict recognition results of individual queries. The presented methods can select algorithm parameters offline, predict recognition performance online, and adjust face alignment online for better recognition. Experimental results show that the performance of recognition systems can be greatly improved using presented methods.
Efficient data protection for distributed shared memory multiprocessors
Authors: Brian Rogers, Milos Prvulovic, Yan Solihin
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

Data security in computer systems has recently become an increasing concern, and hardware-based attacks have emerged. As a result, researchers have investigated hardware encryption and authentication mechanisms as a means of addressing this security concern. Unfortunately, no such techniques have been investigated for Distributed Shared Memory (DSM) multiprocessors, and previously proposed techniques for uni-processor and Symmetric Multiprocessor (SMP) systems cannot be directly used for DSMs. This work is the first to examine the issues involved in protecting secrecy and integrity of data in DSM systems. We first derive security requirements for processor-processor communication in DSMs, and find that different types of coherence messages need different protection. Then we propose and evaluate techniques to provide efficient encryption and authentication of the data in DSM systems. Our simulation results using SPLASH-2 benchmarks show that the execution time overhead for our three proposed approaches is small and ranges from 6% to 8% on a 16-processor DSM system, relative to a similar DSM without support for data secrecy and integrity.
The pendulum swings back: individual acceptance of re-centralized application platforms
Authors: Yulin Fang, Derrick J. Neufeld
Venue: ACM SIGMIS Database (2006)

After two decades of actively distributing computing power to individual users in the form of desktop and notebook PCs, IT executives are now being drawn back to the benefits of centralized computing platforms, as evidenced by the emergence of thin client technology and the application service provider (ASP) business model. But will individual users embrace this "re-centralization?" This study examines major influencing factors on end-user use of centralized application platforms using the theory of planned behavior (TPB). Two new perceived behavioral control factors are identified: (1) relative functional advantage of the local PC versus the central server, and (2) response promptness of the central server. Data were collected using a paper-and-pencil survey of twenty-six users who had access to a centralized application platform. The two new measures demonstrated satisfactory reliability and validity, and both were strong predictors of intention to use the centralized platform and actual usage. Results also suggest that TPB has strong predictive power for individual use of centralized application platforms.
A novel low-dispersive (2,2) collocated FDTD scheme: Research Articles
Authors: Chakrapani Bommaraju, Rene Marklein, Rolf Schuhmann, Thomas Weiland
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

The dispersion relation and the convergence of a modified finite-difference time-domain scheme (MFDTD), which has fourth-order convergence and excellent broadband characteristics, are presented. The accuracy of several low-dispersion finite-difference time-domain schemes in 2-D is compared with that of the MFDTD, via direct evaluation of the dispersion relation. Convergence of the FDTD and the MFDTD in 2-D are also examined. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Microscopic theory for the valence intersubband absorption of quantum wells
Authors: M. F. Pereira,  Jr., H. Wenzel
Venue: Microelectronic Engineering (2005)

In this paper we focus on the temperature dependence and on a detailed analysis of the interplay between Coulomb effects at Hartree-Fock level, namely: subband shifts, exchange and depolarization shifts to the valence intersubband absorption of III-V semiconductor quantum wells. We show how the tendency of the depolarization to create double peaks in the absorption spectra in the presence of a strongly k-space localized dipole moment can be partially compensated by the other Coulomb corrections considered.
Ubiquitous reach and remote control of devices
Authors: Ophir Frieder
Venue:  (2006)

People find themselves commuting longer and longer times to work or traveling away from home. Many families have both parents working. Time dedicated for household chores and monitoring has become scarce. Thus, there is an increasing need for people to be able to control their devices from any location at any time. Moreover, they need to be able to control multiple devices at the same time. More and more homes have networked devices, and more and more homes have connections to the Internet. It is relatively easy to create advanced user interfaces for these devices, if one has a rich environment with a graphical display and keyboard or pen input. However, by far the most ubiquitous networked device is the plain old telephone, which has no display and only a 12-key keypad. Moreover, times of limited network connectivity can reduce devices with displays and sophisticated input devices to only being able to transport digits. Moreover, it is neither economical nor desired to require special hardware in the controlled devices. This thesis explores remote control of devices using plain old telephones. In particular, the thesis examines the networking of plain old telephones with the Internet. The thesis introduces a protocol, KPML, which enables the remote control of multiple devices with devices that have only a 12-key keypad. After a discussion of the literature, the thesis examines use of the protocol for controlling household devices. Following that is an analysis of the efficiency of the protocol. Finally, the thesis offers a summary and areas of future research.
Link spam detection based on mass estimation
Authors: Zoltan Gyongyi, Pavel Berkhin, Hector Garcia-Molina, Jan Pedersen
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Link spamming intends to mislead search engines and trigger an artificially high link-based ranking of specific target web pages. This paper introduces the concept of spam mass, a measure of the impact of link spamming on a page's ranking. We discuss how to estimate spam mass and how the estimates can help identifying pages that benefit significantly from link spamming. In our experiments on the host-level Yahoo! web graph we use spam mass estimates to successfully identify tens of thousands of instances of heavyweight link spamming.
Pre-Silicon Modeling and Analysis: Impact On Real Design
Authors: Pradip Bose
Venue: IEEE Micro (2006)

Micro editor in chief Pradip Bose talks about the challenge of predicting and tuning a microprocessor's net quality well before its tape out and eventual production cycle.