ppxscal/embedding_network huggingface dataset:
Robust Recovery of Shapes with Unknown Topology from the Dual Space
Authors: Chen Liang, Kwan-Yee K. Wong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In this paper, we address the problem of reconstructing an object surface from silhouettes. Previous works by other authors have shown that, based on the principle of duality, surface points can be recovered, theoretically, as the dual to the tangent plane space of the object. In practice, however, the identification of tangent basis in the tangent plane space is not trivial given a set of discretely sampled data. This problem is further complicated by the existence of bi-tangents to the object surface. The key contribution of this paper is the introduction of epipolar parameterization in identifying a well-defined local tangent basis. This extends the applicability of existing dual space reconstruction methods to fairly complicated shapes, without making any explicit assumption on the object topology. We verify our approach with both synthetic and real-world data, and compare it both qualitatively and quantitatively with other popular reconstruction algorithms. Experimental results demonstrate that our proposed approach produces more accurate estimation, whilst maintaining reasonable robustness towards shapes with complex topologies.
A Matrix-Based Random Key Pre-distribution Scheme for Wireless Sensor Networks
Authors: Ting Yuan, Shiyong Zhang, Yiping Zhong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Dynamics of wireless sensor networks (WSN) make secu- rity one of the top issues we should pay attention to. WSN's can be deployed in hostile environments where their nodes are easy to be captured or re-programmed for deleterious use by an adversary. Therefore, it is necessary to pro- tect communications between sensor nodes through cryp- tographic methods. To address this, symmetric key manage- ment in wireless sensor networks arises as a challenging security issue because other key management issues (e.g., asymmetric cryptography or key distribution centers) are proven undesirable for resource-limited sensor nodes. So far, several key distribution schemes have been proposed to solve key management problems. In this paper, we propose a matrix-based random key pre-distribution scheme, which uses simple linear algebraic operations to derive common keys and is shown to be better resilient against node collu- sion than certain existing schemes.
An algorithm for fast, model-free tracking indoors
Authors: Aiyou Chen, Cristina Harko, Diane Lambert, Phil Whiting
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2007)

Tracking people and objects indoors from signal strength measurements has applications as diverse as security monitoring, self-guided museum tours, and personalization of communications services. Accurate dynamic tracking in real-time has been elusive, though, because signal propagation in buildings and the paths that people follow are complex. This paper proposes a simple algorithm for indoor tracking that requires neither a propagation model nor a motion model. It is also simple to compute, requiring only standard tools: Delaunay triangulation, linear interpolation, moving averaging, and local regression. Experiments with real data and simulations based on real data show that the algorithm is not only simple, it is effective.
PIVOT and UNPIVOT: optimization and execution strategies in an RDBMS
Authors: Conor Cunningham, César A. Galindo-Legaria, Goetz Graefe
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

PIVOT and UNPIVOT, two operators on tabular data that exchange rows and columns, enable data transformations useful in data modeling, data analysis, and data presentation. They can quite easily be implemented inside a query processor, much like select, project, and join. Such a design provides opportunities for better performance, both during query optimization and query execution. We discuss query optimization and execution implications of this integrated design and evaluate the performance of this approach using a prototype implementation in Microsoft SQL Server.
Keyword Spotting Based on Syllable Confusion Network
Authors: Pengyuan Zhang, Jian Shao, Qingwei Zhao, Yonghong Yan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Keyword spotting becomes a very important branch of speech recognition. But the acoustic mismatch between training and testing environments often causes a severe degradation in the recognition performance. This paper presents an improved keyword spotting strategy. A fuzzy search algorithm is proposed to extract keyword hypotheses from a syllable confusion network (SCN). SCN is linear and naturally suitable for indexing. To accelerate search process, SCN are pruned to feasible sizes. As a post-processing method, minimum classification error (MCE) optimized confidence measure is adopted to reject false accepts. On Mandarin conversational telephone speech (CTS), the proposed algorithms reduce the equal error rate (EER) by 7.2% relative.
Image Segmentation by Using Discrete Tchebichef Moments and Quantum Neural Network
Authors: Zhen Liu, Zhongying Bai, Jinming Shi, Hao Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A new image segmentation method based on discrete Tchebichef moments and Quantum neural networks is presented. The Tchebichef moments in certain local window of each pixel in the image are computed and input to quantum neural network . Quantum neural networks , which use multilevel transfer function, have the inherent fuzzy characteristics. The point accommodates to the connatural uncertainty of fractional image data in image segmentation procession. Experiments confirm that the performance of our proposed method is more accurate and has less iterative times in comparison with the traditional segmentation methods based on Legendre moments and BP neutral networks
Explaining the lazy Krivine machine using explicit substitution and addresses
Authors: Frédéric Lang
Venue: Higher-Order and Symbolic Computation (2007)

In a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lambda-calculus of explicit substitution ¿ ¿ w with addresses, so that it gives an account of the sharing implemented by lazy functional language interpreters. We show in this paper that their calculus, called ¿ ¿ w a , fits well to the lazy Krivine machine, which describes the core of a lazy (call-by-need) functional programming language implementation. The lazy Krivine machine implements term evaluation sharing, that is essential for efficiency of such languages. The originality of our proof is that it gives a very detailed account of the implemented strategy.
A New Approach to the Fault Location of Combinational Circuits
Authors: S. Y. H. Su
Venue: IEEE Transactions on Computers (1972)

A systematic approach to the location of a single failure in a combinational logic network is presented. The method utilizes only the required tests and needs no fault table. The structure of the logic network is taken into consideration when selecting the tests to be applied. For tree networks, we start from the gate that generates a primary output and sequentially trace back through the stages of the network according to a fixed set of rules. At each stage we either locate the fault or determine the direction of the trace.
Application-Level Correctness and its Impact on Fault Tolerance
Authors: Xuanhua Li, Donald Yeung
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Traditionally, fault tolerance researchers have required architectural state to be numerically perfect for program execution to be correct. However, in many programs, even if execution is not 100% numerically correct, the program can still appear to execute correctly from the user's perspective. Hence, whether a fault is unacceptable or benign may depend on the level of abstraction at which correctness is evaluated, with more faults being benign at higher levels of abstraction, i.e. at the user or application level, compared to lower levels of abstraction, i.e. at the architecture level. The extent to which programs are more fault resilient at higher levels of abstraction is application dependent. Programs that produce inexact and/or approximate outputs can be very resilient at the application level. We call such programs soft computations, and we find they are common in multimedia workloads, as well as artificial intelligence (AI) workloads. Programs that compute exact numerical outputs offer less error resilience at the application level. However, we find all programs studied in this paper exhibit some enhanced fault resilience at the application level, including those that are traditionally considered exact computations-e.g., SPECInt CPU2000. This paper investigates definitions of program correctness that view correctness from the application's standpoint rather than the architecture's standpoint. Under application-level correctness, a program's execution is deemed correct as long as the result it produces is acceptable to the user. To quantify user satisfaction, we rely on application-level fidelity metrics that capture user perceived program solution quality.
Quality Assurance in Web Information Systems Development
Authors: Klaus-Dieter Schewe, Jane Zhao, Bernhard Thalheim
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Information Systems that are accessible via the web have become a very important class of large-scale soft- ware systems. In order to assure a high quality of such systems we propose a layered approach using integrated methods for all levels. In doing so we bring together knowl- edge from semiotics, goal-oriented requirements engineer- ing, conceptual modelling, databases, human-computer in- teraction and web-oriented languages. In this paper we out- line our approach and argue why the systematic application of our methodology to web information systems develop- ment will result in quality.
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
Authors: Stephan Dahlke, Erich Novak, Winfried Sickel
Venue: Journal of Complexity (2007)

We study the optimal approximation of the solution of an operator equation A(u)=f by certain n-term approximations with respect to specific classes of frames. We consider worst case errors, where f is an element of the unit ball of a Sobolev or Besov space B"q^t(L"p(@W)) and @W@?R^d is a bounded Lipschitz domain; the error is always measured in the H^s-norm. We study the order of convergence of the corresponding nonlinear frame widths and compare it with several other approximation schemes. Our main result is that the approximation order is the same as for the nonlinear widths associated with Riesz bases, the Gelfand widths, and the manifold widths. This order is better than the order of the linear widths iff p
DWT-Based Audio Watermarking Resistant to Desynchronization
Authors: Hai-yan Liu, Xue-feng Zheng, Ying Wang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A robust and blind audio watermarking algorithm based on the discrete wavelet transform(DWT)is proposed in this paper as an effective way to resist the malicious de-synchronization attacks. The algorithm embeds the watermark information into the absolute average of audio low frequency coefficients in the DWT and error- correcting coding is applied in order to lower the bit error rate of watermark in extraction. Experimental results show the performance of the method is ideal against various common signal processing attacks, especially, robustness to de-synchronization attacks. Keywords: audio watermarking; synchronization; DWT; robustness ; cropping-resistant
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
Authors: W. H. Kohler
Venue: IEEE Transactions on Computers (1975)

The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal method is evaluated. The computation is modeled by an acyclic directed graph G(T,
Simultaneous prediction of dialog acts and address types in three-party conversations
Authors: Yosuke Matsusaka, Mika Enomoto, Yasuharu Den
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

This paper reports on automatic prediction of dialog acts and address types in three-party conversations. In multi-party interaction, dialog structure becomes more complex compared to one-to-one case, because there is more than one hearer for an utterance. To cope with this problem, we predict dialog acts and address types simultaneously on our framework. Prediction of dialog act labels has gained to 68.5% by considering both context and address types. CART decision tree analysis has also been applied to examine useful features to predict those labels.
A Framework for the Use of Six Sigma Tools in PSP/TSP
Authors: Youngkyu Park, Hojin Choi, Jongmoon Baik
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The advent of software process models such as CMM/CMMI (Capability Maturity Model/Capability Maturity Model Integration) has helped software engineers understand principles and approaches of software process improvement. There, however, has been difficulty increasing productivity from applying those models since "how" is not within the scope of the CMM/CMMI. For this reason, SEI (Software Engineering Institute) introduced PSP/TSP (Personal Software Process/Team Software Process); however, they still lack statistical analysis tools and systematic process control techniques for analyzing measures collected in PSP/TSP. Six Sigma, on the other hand, provides the quantitative analysis tools necessary to identify high leverage activities, control process performance and evaluate effectiveness of process changes. Deploying PSP/TSP in conjunction with Six Sigma, therefore, can directly lead to improved project performance and continuous process improvement by analyzing data, assessing process stability, and prioritizing improvements in PSP/TSP. Continuing with this rationale, a framework that guides how and where Six Sigma tools are considered in PSP/TSP is proposed.
Mechanisms for activity spread in a neural field model
Authors: Mihaela Enculescu, Michael Bestehorn
Venue: Neurocomputing (2007)

Field models of continuous neural networks incorporate nonlocal connectivities as well as finite axonal propagation velocities and lead therefore to delayed integral equations. For special choices of the synaptic footprint it is possible to reduce the integral model to a system of partial differential equations. One example is that of the inhomogeneous damped wave equation in one space dimension derived by Jirsa and Haken for exponential synaptic footprint. We show that this equation can be put into the form of a conservation law with nonlinear source, and explore numerically this representation. We find two mechanisms for the spread of the activity from an initially excited region.
An Empirical Study of the Effects of Gestalt Principles on Diagram Understandability
Authors: Krystle Lemon, Edward B. Allen, Jeffrey C. Carver, Gary L. Bradshaw
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Comprehension errors in software design must be detected at their origin to avoid propagation into later portions of the software lifecycle and also the final system. This research synthesizes software engineering and Gestalt principles of similarity, proximity, continuity for the purpose of discovering whether certain visual attributes of diagrams can affect the accuracy and efficiency of understanding the diagram. The experiment tested whether two dependent variables, accuracy and response time, were significantly affected by independent variables, diagram type (simple1, simple2, complex), Gestalt principles (good vs. bad), and question order (forward/backward). The results of this study indicated that the Gestalt principles did affect the comprehension in the complex diagrams. Post-hoc analysis results indicated that number of bends per line, length of line in inches, number of lines crossing, boxes per diagram, and number of lines per diagram contributed to the ability of the subjects to comprehend the diagrams.
An Immune Genetic Algorithm for Software Test Data Generation
Authors: Abdelhamid Bouchachia
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper aims at incorporating immune operators in genetic algorithms as an advanced method for solving the problem of test data generation. The new proposed hybrid algorithm is called Immune Genetic Algorithm (IGA). A full description of this algorithm is presented before investigating its application in the context of software test data generation using some benchmark programs. Moreover, the algorithm is compared with other evolutionary algorithms.
Building Compact MQDF Classifier for Off-line Handwritten Chinese Characters by Subspace Distribution Sharing
Authors: Teng Long, Lian-Wen Jin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Quadratic classifier with modified quadratic discriminant function (MQDF) has been successfully applied to recognition of handwritten characters to achieve very good performance. However, for large category classification problem such as Chinese character recognition, the storage of the parameters for the MQDF classifier is huge which makes it not practical to be used in hand-held devices. In this paper, we propose a method to build a compact MQDF classifier for handwritten Chinese characters. We use subspace distribution sharing to form a codebook for the subspaces of the MQDF classifier's parameters. Further more, we employ a two-level Euclidean distance classifier to accelerate the recognition process. Fast recognition speed and compact dictionary size make the high accuracy quadratic classifier be practical for hand-held devices.
Time-adaptive quantile regression
Authors: Jan Kloppenborg Møller, Henrik Aalborg Nielsen, Henrik Madsen
Venue: Computational Statistics Data Analysis (2008)

An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regression problem is given. The observations have been split to allow a direct use of the simplex algorithm. The simplex method and an updating procedure are combined into a new algorithm for time-adaptive quantile regression, which generates new solutions on the basis of the old solution, leading to savings in computation time. The suggested algorithm is tested against a static quantile regression model on a data set with wind power production, where the models combine splines and quantile regression. The comparison indicates superior performance for the time-adaptive quantile regression in all the performance parameters considered.
Quantum vs Semiclassical Dynamics Approaches from highly symmetric to asymmetric reactions
Authors: Noelia Faginas Lago, A. Lagana, Fermin Huarte Larranaga
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The theoretical and computational machinery of a code based on the Semiclassical Initial Value Representation approach has been revisited to introduce the possibility of dealing with asymmetric systems and using non commercial routines. To validate the code a comparison of the cumulative reaction probability with quantum calculations by considering as a case study the H + H2 prototype reaction has been performed.
Reducing Test Time Using an Enhanced RF Loopback
Authors: Marcelo Negreiros, Luigi Carro, Altamiro Amadeu Susin
Venue: Journal of Electronic Testing: Theory and Applications (2007)

This work presents a method to improve the loopback test used in RF transceivers. The approach is targeted to the System-On-Chip environment, being able to reuse system resources in order to minimize the test overhead. An RF sampler is used during loopback operation, allowing observation of spectral characteristics of the RF signal. While able to improve the overall observability of the RF signal path, faster diagnosis than conventional loopback tests is achieved thanks to a large reduction in the number of transmitted symbols. Theoretical analysis and practical results for a prototype transceiver operating at 846 MHz are presented. It is shown that a significant test time reduction is achievable considering bit error rate tests for common digital modulation schemes.
Database architectures for new hardware
Authors: Anastassia Ailamaki
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Thirty years ago, DBMS stored data on disks and cached recently used data in main memory buffer pools, while designers worried about improving I/O performance and maximizing main memory utilization. Today, however, databases live in multi-level memory hierarchies that include disks, main memories, and several levels of processor caches. Four (often correlated) factors have shifted the performance bottleneck of data-intensive commercial workloads from I/O to the processor and memory subsystem. First, storage systems are becoming faster and more intelligent (now disks come complete with their own processors and caches). Second, modern database storage managers aggressively improve locality through clustering, hide I/O latencies using prefetching, and parallelize disk accesses using data striping. Third, main memories have become much larger and often hold the application's working set. Finally, the increasing memory/processor speed gap has pronounced the importance of processor caches to database performance. This tutorial will first survey the computer architecture and database literature on understanding and evaluating database application performance on modern hardware. We will present approaches and methodologies used to produce time breakdowns when executing database workloads on modern processors. We will contrast traditional methods that use system simulation to the more realistic, yet challenging use of hardware event counters. Then, we will survey techniques proposed in the literature to alleviate the problem and their evaluation. We will emphasize the importance and explain the challenges when determining the optimal data placement on all levels of memory hierarchy, and contrast to other approaches such as prefetching data and instructions. Finally, we will discuss open problems and future directions: Is it only the memory subsystem database software architects should worry about? How important are other decisions processors make to database workload behavior? Given the emerging multi-threaded, multi-processor computers with modular, deep cache hierarchies, how feasible is it to create database systems that will adapt to their environment and will automatically take full advantage of the underlying hierarchy?
The Pediaphon - Speech Interface to the free Wikipedia Encyclopedia for Mobile Phones, PDA's and MP3-Players
Authors: Andreas Bischoff
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper presents an approach to generate audio based learning material dynamically from Wikipedia arti- cles for m-Learning and ubiquitous access. It introduces the so called 'Pediaphon', an speech interface to the free Wikipedia online encyclopedia as an example application for 'microlearning'. The effective generation and the de- ployment of the audio data to the user via podcast or pro- gressive download (pseudo streaming) are covered. A con- venient cell phone interface to the Wikipedia content, which is usable with every mobile phone will be introduced.