ppxscal/embedding_network huggingface dataset:
SIFT Features Tracking for Video Stabilization
Authors: Sebastiano Battiato, Giovanni Gallo, Giovanni Puglisi, Salvatore Scellato
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a video stabilization algorithm based on the extraction and tracking of Scale Invariant Feature Transform features through video frames. Implementation of SIFT operator is analyzed and adapted to be used in a feature-based motion estimation algorithm. SIFT features are extracted from video frames and then their trajectory is evaluated to estimate interframe motion. A modified version of Iterative Least Squares method is adopted to avoid estimation errors and features are tracked as they appear in nearby frames to improve video stability. Intentional camera motion is eventually filtered with Adaptive Motion Vector Integration. Results confirm the effectiveness of the method.
Extended abstract: organizing automaton specifications to achieve faithful representation
Authors: E. Leonard, M. Archer
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We have developed an approach to organizing automaton specifications in which a reference variable captures the essential state and shadow variables are used to facilitate expressiveness. We have applied our approach in specifying automaton models for three different examples: TESLA protocol, SELinux security policies and leader election for IEEE 1394. In all three cases the resulting specification bears an obvious close relationship to the actual system being modeled.
A Machine Description Facility for Compiler Testing
Authors: H. Samet
Venue: IEEE Transactions on Software Engineering (1977)

Requirements for a machine description facility for compiler testing are discussed. The compiler testing procedure consists of proving that programs are correctly translated by the compiler at hand. This is achieved by use of a common intermediate representation for both the source and object programs. The intermediate representation for the object program is built by use of a process termed symbolic interpretation. This process interprets a set of procedures which describe the effects of machine language instructions corresponding to the target machine on a suitable computation model in a manner consistent with an execution level definition of the high level language. Some of the important factors which enter into such a definition are discussed. These include architectural constraints posed by the target machine, and a description facility for memory and data types. Once such a definition is formulated, the actual instruction set of the target machine can be described. The highlights and limitations of such a definition facility are discussed in the context of a specific LISP implementation on a PDP-10 computer.
Fusion of appearance image and passive stereo depth map for face recognition based on the bilateral 2DLDA
Authors: Jian-Gang Wang, Hui Kong, Eric Sung, Wei-Yun Yau, Eam Khwang Teoh
Venue: Journal on Image and Video Processing (2007)

This paper presents a novel approach for face recognition based on the fusion of the appearance and depth information at the match score level. We apply passive stereoscopy instead of active range scanning as popularly used by others. We show that present-day passive stereoscopy, though less robust and accurate, does make positive contribution to face recognition. By combining the appearance and disparity in a linear fashion, we verified experimentally that the combined results are noticeably better than those for each individual modality. We also propose an original learning method, the bilateral two-dimensional linear discriminant analysis (B2DLDA), to extract facial features of the appearance and disparity images. We compare B2DLDA with some existing 2DLDA methods on both XM2VTS database and our database. The results show that the B2DLDA can achieve better results than others.
A framework for music analysis instruction system with synchronization of MIDI and real performaing audio
Authors: Hao-Tung Lin, Yu-Yuan Lin, Ting-Yi Ma, Herng-Yow Chen
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

For college students who major in Music, listening to audio recordings with analytical instructions and music scores is an important task. In this paper we proposes a Web-based music lecture authoring, annotating, and presentation framework, which is especially designed for Music instructors to easily record their lecturing comments (i.e., voice and tele-pointer) based on some prepared teaching materials (i.e., music score, audio or MIDI, and analysis figure for music), so as for students to replay the multimedia lecture after class on the Web. To present the music score and waveform audio in a synchronized manner, we design a MIDI-to-WAV alignment algorithm that can explore the temporal relations between MIDI and the corresponding performance recording. We built a system prototype to demonstrate the feasibility and effectiveness of our idea.
Device Middleware for Mobile Applications
Authors: André Elia Assad, Nelson Souto Rosa
Venue: IEEE Distributed Systems Online (2007)

D-Mid (Device Middleware) supports mobile applications built on different programming languages but running on the same device, so the applications can communicate.
A synchronous language at work: the story of Lustre
Authors: N. Halbwachs
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We recall the story of the development of the synchronous data-flow language Lustre and of its industrial transfer inside the toolset SCADE. We try to analyse the reasons of its success, and to report the main lessons we got from the transfer of an academic concept into real industrial world.
Low-cost Anonymous Timed-Release Encryption
Authors: D. Hristu-Varsakelis, K. Chalkias, G. Stephanides
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

We propose a new server-based efficient protocol for time-release encryption (TRE), or -- as sometimes referred to -- sending information "into the future". As with other recently-proposed schemes, ours is based on the use of bilinear pairings on any Gap Diffie-Hellman group, allowing absolute release time of the encrypted data. Our protocol possesses the required properties regarding user anonymity and server passivity. It also provides almost-costless scalability in settings with multiple time-servers, and improves significantly upon existing TRE schemes, in terms of computational and communication cost. This makes our approach well-suited to a number of emerging e-applications that require future decryption of confidential data.
A Combinatorial Solution to the Reliability of Interwoven Redundant Logic Networks
Authors: J. A. Abraham
Venue: IEEE Transactions on Computers (1975)

A combinatorial procedure is given to calculate the reliability of an interwoven redundant logic network to any desired degree of accuracy. The procedure consists of enumerating combinations of gate failure which are tolerated by the redundant network, and is explained with reference to a quadded logic network. Since the exact reliability calculation might be too time consuming for large networks, a formula is given for a lower bound which can be used in conjunction with the exact method to give a very accurate reliability figure with a comparatively small computation time.
Agile Software Assurance: An Empirical Study
Authors: Noura Abbas
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

This poster will describe an empirical study of Agile Software Assurance. The main goal of this research is to study the quality of Agile projects in order to help software development organizations to have deeper understanding of Agile Methods, principles and practices. Moreover, this research will help evaluating the quality of Agile projects.
Efficient memory safety for TinyOS
Authors: Nathan Cooprider, Will Archer, Eric Eide, David Gay, John Regehr
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Reliable sensor network software is difficult to create: applications are concurrent and distributed, hardware-based memory protection is unavailable, and severe resource constraints necessitate the use of unsafe, low-level languages. Our work improves this situation by providing efficient memory and type safety for TinyOS 2 applications running on the Mica2, MicaZ, and TelosB platforms. Safe execution ensures that array and pointer errors are caught before they can corrupt RAM. Our contributions include showing that aggressive optimizations can make safe execution practical in terms of resource usage; developing a technique for efficiently enforcing safety under interrupt-driven concurrency; extending the nesC language and compiler to support safety annotations; finding previously unknown bugs in TinyOS; and, finally, showing that safety can be exploited to increase the availability of sensor networks applications even when memory errors are left unfixed.
Health information exchange and patient safety
Authors: David C. Kaelber, David W. Bates
Venue: Journal of Biomedical Informatics (2007)

One of the most promising advantages for health information exchange (HIE) is improved patient safety. Up to 18% of the patient safety errors generally and as many as 70% of adverse drug events could be eliminated if the right information about the right patient is available at the right time. Health information exchange makes this possible. Here we present an overview of six different ways in which HIE can improve patient safety-improved medication information processing, improved laboratory information processing, improved radiology information processing, improved communication among providers, improved communication between patients and providers, and improved public health information processing. Within the area of improved medication information processing we discuss drug-allergy information processing, drug-dose information processing, drug-drug information processing, drug-diagnosis information processing, and drug-gene information processing. We also briefly discuss HIE and decreased patient safety as well as standards and completeness of information for HIE and patient safety.
A Matlab library for solving quasi-static volume conduction problems using the boundary element method
Authors: M. Stenroos, V. Mäntynen, J. Nenonen
Venue: Computer Methods and Programs in Biomedicine (2007)

The boundary element method (BEM) is commonly used in the modeling of bioelectromagnetic phenomena. The Matlab language is increasingly popular among students and researchers, but there is no free, easy-to-use Matlab library for boundary element computations. We present a hands-on, freely available Matlab BEM source code for solving bioelectromagnetic volume conduction problems and any (quasi-)static potential problems that obey the Laplace equation. The basic principle of the BEM is presented and discretization of the surface integral equation for electric potential is worked through in detail. Contents and design of the library are described, and results of example computations in spherical volume conductors are validated against analytical solutions. Three application examples are also presented. Further information, source code for application examples, and information on obtaining the library are available in the WWW-page of the library: http://biomed.tkk.fi/BEM.
Inductive equivalence checking under retiming and resynthesis
Authors: Jie-Hong R. Jiang, Wei-Lun Hung
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Retiming and resynthesis are among the most important techniques for practical sequential circuit optimization. However, their applicability is much limited due to verification concerns. Overcoming the verification bottleneck is a supreme task. This paper studies both the theoretical and practical aspects of inductive verification on the equivalence between circuits under retiming and resynthesis transformation. We study the completeness condition of the inductive approach to equivalence checking and show that prior work is only complete for circuits transformed under retiming or resynthesis, but not both. We overcome prior limitation and make complete the equivalence checking for circuits transformed up to retiming+resynthesis+retiming. The theoretical insights lead to a robust satisfiability formulation of verification under various retiming and resynthesis scenarios. Experimental results demonstrate the scalability of the approach. Several previously unverifiable circuits and unverifiable transformation scenarios can now be verified effectively.
Camera-Based Graphical Symbol Detection
Authors: M. Rusinol, J. Llados, P. Dosch
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we present a method to locate and recog- nize graphical symbols appearing in real images. A vector- ial signature is defined to describe graphical symbols. It is formulated in terms of accumulated length and angular in- formation computed from polygonal approximation of con- tours. The proposed method aims to locate and recognize graphical symbols in cluttered environments at the same time, without needing a segmentation step. The symbol sig- nature is tolerant to rotation, scale, translation and to dis- tortions such as weak perspective, blurring effect and illu- mination changes usually present when working with scenes acquired with low resolution cameras in open environments.
Estimating Columns of Under-determined Mixing Matrix by Information Index Removal and Perturbed Mean Shift Algorithm
Authors: B. Panyangam, K. Chinnasarn, C. Lursinsap
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

We proposed an inner point removal based on information index and perturbed mean shift algorithm to estimate the number of columns in the mixing matrix for underdetermined blind source separation (BSS) with the unknown number of sources. The information index is used for preliminary filtering all relevant points clustered along the basic independent components. Then, the perturbed mean shift algorithm with entropy measure is applied to enhance to actual basic independent components. The experimental results on synthetic and real speech signals confirm the performance of the proposed method is more accurate than a standard k-mean method and AICA method.
Shared Resource Multiprocessing
Authors: M. J. Flynn, A. Podvin
Venue: Computer (1972)

A good design is the Elderado in any systems area. The elements of good design include efficiency, simplicity, and flexibility for use. While we make no pretense that the ideas described in this paper are essential to good computer design, it seems to us that it does meet many of the criteria and avoids a number of the pitfalls associated with high performance computers.
Arkose: reusing informal information from online discussions
Authors: Kevin K. Nam, Mark S. Ackerman
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Online discussions such as a large-scale community brainstorming often end up with an unorganized bramble of ideas and topics that are difficult to reuse. A process of distillation is needed to boil down a large information space into information that is concise and organized. We take a system-augmented approach to the problem by creating a set of tools with which human editors can collaboratively distill a large amount of informal information. Two design principles, which we will define as incremental diagenesis and incremental summarization, help editors flexibly distill the informal information. Our system, Arkose, is built as a demonstration of these principles, providing the necessary tools for distillation. These tools include a number of visualization and information retrieval mechanisms, as well as an authoring tool and a navigator for the information space. They support a gradual increase in the order and reusability of the information space and allow various levels of intermediate states of a distillation.
WLocator: An Indoor Positioning System
Authors: Shaun Phillips, Michael Katchabaw, Hanan Lutfiyya
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

systems utilizing wireless technology, though varying in cost, coverage and accuracy. In this paper we will introduce WLocator, a system that aims to strike a balance between these areas. WLocator will provide location infor- mation relative to symbolic, user-created "landmarks". These landmarks are easily created and maintained, thus reducing short and long term costs. Additionally, the unique matching algorithm invoked by WLocator attempts to offer a relatively high level of accuracy, given the low cost of implementing the system.
Animated 3D CT Imaging
Authors: Edward Farrell, Wen Yang, Rosario Zappulla
Venue: IEEE Computer Graphics and Applications (1985)

A new display-system approach uses 3D animation to enhance the viewer's spatial perception of patient scan data.
Voting Algorithm of Fuzzy ARTMAP and Its Application to Fault Diagnosis
Authors: Zhiyong Tang, Xiang_an Yan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Simplified fuzzy ARTMAP (SFAM) is a simplification of fuzzy ARTMAP (FAM) by reducing the computational overhead and architectural redundancy. SFAM is powerful neural network in the application of prediction and classifier. Individual SFAM performance depends on the ordering of training sample presentation. A multiple classifier combination scheme is proposed in this paper to obtain reliable and accurate fault diagnosis. SFAMs input the data vectors in the complement code format and output fault diagnosis results. The sum rule voting algorithm combines the SFAMs outputs and generates final conclusion. A weight is assigned to each SFAM according to its historical achievements. Case study has shown that the proposed method is effective in fault diagnosis application.
Common EVAL
Authors: Henry Lieberman, Christopher Fry
Venue: ACM SIGPLAN Lisp Pointers (1988)

We propose that the Common Lisp standard be extended by adding to the language specification a short program, itself written in Common Lisp, to implement the EVAL function. We call this Common EVAL. The interpreters for every correct implementation of Common Lisp would be required to match the semantics of Common EVAL on valid Common Lisp expressions. It should treat other expressions as errors or as implementation dependent extensions. There are three cogent reasons for including a Common EVAL in the standard: First, since EVAL definitively specifies the behavior of Lisp programs, Common EVAL would insure uniformity of program semantics across implementations. Second, it would aid validation efforts, since the behavior of a particular implementation could always be compared to the behavior of Common EVAL. Third, it would facilitate the creation of debuggers and other program-manipulating programs that could be ported across Common Lisp implementations.
Nearest neighbor search in metric spaces through Content-Addressable Networks
Authors: Fabrizio Falchi, Claudio Gennaro, Pavel Zezula
Venue: Information Processing and Management: an International Journal (2008)

Most of the Peer-to-Peer search techniques proposed in the recent years have focused on the single-key retrieval. However, similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. In this paper we introduce an extension of the well-known Content-Addressable Network paradigm to support storage and retrieval of more generic metric space objects. In particular we address the problem of executing the nearest neighbors queries, and propose three different algorithms of query execution. An extensive experimental study on real-life data sets explores the performance characteristics of the proposed algorithms by showing their advantages and disadvantages.
Combining Testing with Formal Specifications: A Case Study
Authors: P. R. McMullin
Venue: IEEE Transactions on Software Engineering (1983)

This paper describes our experience specifying, implementing, and validating a record-oriented text editor similar to one discussed in [7]. Algebraic axioms served as the specification notation; and the implementation was tested with a compiler-based system that uses the axioms to test implementations with a finite collection of test cases. Formal specifications were sometimes difficult to produce, but helped reveal errors during unit testing. Thorough exercising of the implementations by the specifications resulted in few errors persisting until integration.
Examining employees' acceptance of e-learning: an application of the theory of planned behavior
Authors: Spiros A. Borotis, Angeliki K. Poulymenakou
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This study draws upon the well known theory of Planned Behavior, and places it in the context of corporate training through e-Learning. Technology readiness, attitudes towards learning through e-Learning, motivation to learn, and training climate appear as key constructs in the proposed conceptual framework.
An energy-efficient reconfigurable baseband processor for wireless communications
Authors: Ada S. Y. Poon
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Most existing techniques for reconfigurable processors focus on the computation model. This paper focuses on increasing the granularity of configurable units without compromising flexibility. This is carried out by matching the granularity to the degree-of-freedom processing in most wireless systems. A design flow that accelerates the exploration of tradeoffs among various architectures for the configurable unit is discussed. A prototype processor is implemented using the Intel 0.13-µm CMOS standard cell library. The estimated energy efficiency is in the same order as dedicated hardware implementations.
Reflections on the GUN CONTROL simulation: Pedagogical implications for EAP writing classes
Authors: Tânia Gastão Saliés
Venue: Simulation and Gaming (2007)

This article critically reflects on the GUN CONTROL simulation (Sali&#x00E9;s, 1994a) by retaking ideas advanced by Sali&#x00E9;s (2002) and applying them to the context of English for Academic Purposes (EAP) writing classes in Brazil. It examines how controlled practice relates to learners' performance on the first draft in a simulation-based content unit designed for EAP writing courses. Specifically, it describes how fluency and controlled practice were balanced during briefing and debriefing, and it critically discusses the outcomes. Among other issues, it addresses the role of explicit instruction on learners' logical organization of thought, documentation, and use of language.
Revisiting 802.11e EDCA performance analysis
Authors: Albert Banchs, Pablo Serrano
Venue: Wireless Personal Communications: An International Journal (2007)

In this short communication we focus on the Contention Window mechanism of 802.11e EDCA. We first show that existing analyses for this mechanism rely on a system of equations that does not always have a unique solution. Next, we present an alternative analysis for which we prove mathematically the existence of a unique solution. Finally, we validate the accuracy of our analysis by means of simulation results.