ppxscal/embedding_network huggingface dataset:
Fingerprint matching using OrientationCodes and PolyLines
Authors: Xuchu Wang, Jianwei Li, Yanmin Niu
Venue: Pattern Recognition (2007)

Effectively incorporating various features with minutiae in fingerprint matching is a challenging task. This paper presents an algorithm to extract two novel discriminative features that describe three kinds of information: macro orientation patterns, micro ridge representation, and minutiae of fingerprints. These features, namely OrientationCodes and PolyLines, are fixed-length, easy to be measured in similarity, and effective in various stages of fingerprint matching, such as alignment, minutiae pairing, matching score computation, and matching rates fusion. In addition, the scheme of the proposed method has advantages of programming implementation, manipulating fingerprint matching much simpler and smoother at a high level. Experimental results on six data sets of FVC2002 and FVC2004 indicate the proposed algorithm not only achieves remarkably lower EERs, but also consumes significantly less computational times.
Managing the relationship between intermediaries and meta sites
Authors: Pearl Brewer
Venue:  (2006)

Travel meta search engines have great potential to alter the travel landscape. Although their current booking impact is relatively low, these new entrants are well-funded, growing quickly, and gaining consumer visibility (Christodoulidou, Connolly, and Brewer, 2006). This research (a) explored whether travel meta sites are an opportunity or a threat to travel intermediaries, (b) examined the transactional relationship between travel meta sites, travel intermediaries, and their suppliers, and (c) compared the consumer's perceptions regarding travel meta sites and travel intermediaries. To examine the role of meta sites in the travel industry and the transactional relationships an information rich-case study approach was used. The results were triangulated using personal interviews with subjects-matter experts from the travel industry, document analysis, and a review of the literature. The outcomes of these studies revealed that the travel intermediaries should consider establishing partnerships with meta search engines now, while they are in a position of power to leverage an opportunity. In addition, these research findings can act as a guide as to how travel meta sites and travel intermediaries should structure and maintain relationships with their suppliers. In order to examine consumer's perceptions, an online survey was used to identify whether travel meta sites provide additional benefits for the customer over travel intermediaries. Factor analysis was used to identify the groupings and the measures of the customer's perceptions. MANOVA was then performed to identify any significant differences in consumer behavior. Finally ANOVA was conducted to see whether travel meta sites and travel intermediaries, affect the factors of ease of use, intrinsic value, extrinsic value, loyalty, and decision autonomy.
Blending telephony and IPTV: Building the TV-link service package using the Alcatel-Lucent Service Broker&trade;: Research Articles
Authors: Andre Beck, Robert E. Daugherty, J. Robert Ensor, Jairo O. Esteban, F. Theodore Freuler, Sugato Ganguly, Kristin F. Kocan, William D. Roome
Venue: Bell Labs Technical Journal (2007)

This paper discusses the design and implementation of blended services&mdash; composite services whose base component services interact within a common control structure. The paper focuses on blended services that combine aspects of Internet Protocol television (IPTV) and IP Multimedia Subsystem&ndash; (IMS)-based telephony services and, in particular, focuses on a service that blends TV viewing and telephone call-handling functions. If a subscriber to this service receives a telephone call while watching TV, the caller ID is displayed on the subscriber's TV screen and the subscriber can signal call control instructions using the set-top box remote control. In this service blend, functions from each base service are coordinated with actions in the other. The mechanism allowing this service is an information channel that allows status and control information to move between the subscriber's set-top box and the IMS system. The services described in this paper are built upon a software foundation called the Alcatel-Lucent Service Broker&trade; platform, a platform that has unique capabilities to support such an information channel and to serve as the gateway between IMS and digital TV. This foundation offers service developers a set of important functions for the creation of blended services. Specifically, the Alcatel-Lucent Service Broker offers a means of controlling the invocation of base services, a means of communicating through different protocols, and support for large-scale deployment and for service customization. &copy; 2007 Alcatel-Lucent.
State of the Art: Coordinated & Multiple Views in Exploratory Visualization
Authors: Jonathan C. Roberts
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

The area of Coordinated and Multiple Views has been steadily developing and maturing over the past fifteen years. Some may say that it is a "solved problem', while others argue that we are only just scratching the surface of the subject. Considering merely the CMV conference series, it is clear to see that in the early years researchers were concerned with models and techniques, while in latter years authors presented more work on how to apply these ideas to different domains. It is our view that there is still much research to be done, but the subject is changing and developing as a tool for Visual Analytics. This paper provides the "state of the art' of CMV, it describes areas that should be developed further and looks at what the future may hold for Coordinated and Multiple Views.
Making context-sensitive points-to analysis with heap cloning practical for the real world
Authors: Chris Lattner, Andrew Lenharth, Vikram Adve
Venue: ACM SIGPLAN Notices (2007)

Context-sensitive pointer analysis algorithms with full "heapcloning" are powerful but are widely considered to be too expensive to include in production compilers. This paper shows, for the first time, that a context-sensitive, field-sensitive algorithm with fullheap cloning (by acyclic call paths) can indeed be both scalable and extremely fast in practice. Overall, the algorithm is able to analyze programs in the range of 100K-200K lines of C code in 1-3 seconds,takes less than 5% of the time it takes for GCC to compile the code (which includes no whole-program analysis), and scales well across five orders of magnitude of code size. It is also able to analyze the Linux kernel (about 355K linesof code) in 3.1 seconds. The paper describes the major algorithmic and engineering design choices that are required to achieve these results, including (a) using flow-insensitive and unification-basedanalysis, which are essential to avoid exponential behavior in practice;(b) sacrificing context-sensitivity within strongly connected components of the call graph; and (c) carefully eliminating several kinds of O(N2) behaviors (largely without affecting precision). The techniques used for (b) and (c) eliminated several major bottlenecks to scalability, and both are generalizable to other context-sensitive algorithms. We show that the engineering choices collectively reduce analysis time by factors of up to 10x-15xin our larger programs, and have found that the savings grow strongly with program size. Finally, we briefly summarize results demonstrating the precision of the analysis.
Homography-based partitioning of curved surface for stereo correspondence establishment
Authors: Jianbo Su, Ronald Chung, Liang Jin
Venue: Pattern Recognition Letters (2007)

Planar homography (collineation) is an image-to-image mapping that could be used to pinpoint stereo correspondences, but its usage has been limited to only planar scenes. This paper describes a mechanism that generalizes the use of planar homography for establishing stereo correspondences over curved scenes. Piecewise-linear approximation is used to describe curved scene, so that stereo correspondences over images of the scene are captured by a collection of local homographies. Unlike the classical approaches, the mechanism does not employ the smoothness heuristic in establishing correspondences, but is instead based upon the interplay of two processes in an iterative manner: (1) partitioning of the scene into local planar patches based upon the most current set of confirmed stereo correspondences; and (2) prediction of new stereo correspondences by the use of the local homographies defined by the partitions, plus confirmation of such predictions by the image data, thereby enlarging the set of confirmed correspondences in every iteration until no more improvement could be obtained. A key step of the mechanism is to decide what local planar homography, and thereby what planar patch, is to be used for correspondence prediction of any given unmatched feature in any given iteration of the mechanism. With knowledge of the epipolar geometry, homography could be defined by any 3 non-collinear feature correspondences. Thus for any given unmatched feature, there are choices of the aforementioned local homography as defined by any set of three non-collinear matched features in the vicinity of the feature. In this paper, we explore what criteria are to be used to decide which of such triplet sets of matched features should be used. We analyze what errors in correspondence prediction could come with a planar homography. In particular, we classify the errors into scene-related geometric error and computation-related algebraic error. We examine their effects by simulated data experiments, and propose two ways of deciding which local homography to adopt for any given unmatched feature point. Real image experiments show that the methods could lead to promising results.
Total least squares fitting of point sets in m-D
Authors: Gaojin Wen, Dengming Zhu, Shihong Xia, Zhaoqi Wang
Venue: Proceedings of the Computer Graphics International 2005 (2005)

The absolute orientation technique, minimizing the mean squared error between two matched point sets under similarity transformations, has numerously applied in the areas of photogrammetry, robotics, object motion analysis as well as object pose estimation following recognition. Based on it, in this paper, a total least squares fitting algorithm, which generates a fixed point set from k corresponding original point sets and minimizes the mean squared error between the fixed point sets and these k point sets, is proposed and proved. Experiments and interesting applications are also presented to show its efficiency, accuracy and robustness.
Achieving Rate Two Space-Time-Frequency Codes for Multiband UWB-MIMO Communication Systems Using Rotated Multidimensional Modulation
Authors: J. Chusing, L. Wuttisittikulkij, S. Segkhoontod
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper, the rate-2 pcu STF coding schemes that can be efficiently implemented for use in multiband UWB-MIMO systems has been presented. These proposed STF codes are constructed based on the multi-dimensional constellation precoding so that the rotated version of the information symbols are spread across adjacent subcarriers and sent over t M transmit antennas and b M time periods, allowing effective exploitation of space, time and frequency diversity. The performance of these STF codes with two transmit antennas over the IEEE 802.15.SG3a channel models are compared at the same spectral efficiency. It is shown that our proposed codes outperform well known schemes found in the literature such as rate-1 SF codes, which guarantee full diversity. In addition, we devise a random interleaving method to incorporate into the proposed codes and the simulation results show that further gains can be achieved depending on the level of SNR.
Robust spread-spectrum audio watermarking
Authors: D. Kirovski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present several mechanisms that enable effective spread-spectrum audio watermarking systems: prevention against detection desynchronization, cepstrum filtering, and chess watermarks. We have incorporated these techniques into a system capable of reliably detecting a watermark in an audio clip that has been modified using a composition of attacks that degrade the original audio characteristics well beyond the limit of acceptable quality. Such attacks include: fluctuating scaling in the time and frequency domain, compression, addition and multiplication of noise, resampling, requantization, normalization, filtering, and random cutting and pasting of signal samples.
An 0.9 &times; 1.2", low power, energy-harvesting system with custom multi-channel communication interface
Authors: Phillip Stanley-Marbell, Diana Marculescu
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Presented is a self-powered computing system, Sunflower, that uses a novel combination of a PIN photodiode array, switching regulators, and a supercapacitor, to provide a small footprint renewable energy source. The design provides software-controlled power-adaptation facilities, for both the main processor and its peripherals. The system's power consumption is characterized, and its energy-scavenging efficiency is quantified with field measurements under a variety of weather conditions.
Lattice Boltzmann model for two-dimensional unsteady Burgers' equation
Authors: YaLi Duan, RuXun Liu
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, a special lattice Boltzmann model is proposed to simulate two-dimensional unsteady Burgers' equation. The maximum principle and the stability are proved. The model has been verified by several test examples. Excellent agreement is obtained between numerical predictions and exact solutions. The cases of steep oblique shock waves are solved and compared with the two-point compact scheme results. The study indicates that lattice Boltzmann model is highly stable and efficient even for the problems with severe gradients.
I/O system performance debugging using model-driven anomaly characterization
Authors: Kai Shen, Ming Zhong, Chuanpeng Li
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

It is challenging to identify performance problems and pinpoint their root causes in complex systems, especially when the system supports wide ranges of workloads and when performance problems only materialize under particular workload conditions. This paper proposes a model-driven anomaly characterization approach and uses it to discover operating system performance bugs when supporting disk I/O-intensive online servers. We construct a whole-system I/O throughput model as the reference of expected performance and we use statistical clustering and characterization of performance anomalies to guide debugging. Unlike previous performance debugging methods offering detailed statistics at specific execution settings, our approach focuses on comprehensive anomaly characterization over wide ranges of workload conditions and system configurations. Our approach helps us quickly identify four performance bugs in the I/O system of the recent Linux 2.6.10 kernel (one in the file system prefetching, two in the anticipatory I/O scheduler, and one in the elevator I/O scheduler). Our experiments with two Web server benchmarks, a trace-driven index searching server, and the TPC-C database benchmark show that the corrected kernel improves system throughput by up to five-fold compared with the original kernel (averaging 6%, 32%, 39%, and 16% for the four server workloads).
Kiltera: A Simulation Language for Timed, Dynamic Structure Systems
Authors: Ernesto Posse, Hans Vangheluwe
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

In recent years there has been an increased interest in modelling systems whose structure changes dynamically, for example to study mobility. At the same time, there is a plethora of simulation languages for discrete-event systems that include an explicit notion of time, but few, if any, support explicitly the notion of structural change. In this paper we introduce a process description language which addresses these issues explicitly. We discuss an application to modelling networks of servers.
Connection technology [maths/science education summer school]
Authors: K. K. Stevens
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Students need to be able to place math and science concepts into the context of real world problems. They need a better understanding of today's technological world; and they need information to help them make reasoned educational and career decisions. Teachers need opportunities to improve their skills, broaden their horizons, and work with state-of-the-art equipment not available at their schools. The Florida Atlantic University (FAU) College of Engineering has been helping students and teachers meet these needs through its Technology Connection (TC) summer program. Now in its fourteenth year the TC program has enjoyed many successes and has achieved widespread recognition for its efforts to cultivate and stimulate secondary student and teacher interest in math, science, computers, and engineering. Program organization, activities, staffing funding, and cost-benefits are described in this paper.
Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem
Authors: Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios Pnevmatikatos
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

In this paper we discuss how one of the most famous local optimization algorithms for the Traveling Salesman Problem, the 2-Opt, can be efficiently implemented in hardware for Euclidean TSP instances up to a few hundred cities. We introduce the notion of "symmetrical 2-Opt moves" which allows us to uncover fine-grain parallelism when executing the specified algorithm. We propose a novel architecture that exploits this parallelism. A subset of the TSPLIB benchmark is used to evaluate the proposed architecture and its ASIC implementation, which exhibits better final results and an average speedup of 20 when compared with the state-of-the-art software implementation. Our approach produces, to the best of our knowledge, the fastest to date TSP 2-Opt solver for small-scale Euclidean TSP instances.
Dual Communication Network in Program Control Based on Global Application State Monitoring
Authors: Janusz Borkowski, M. Tudruj
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

We discuss the efficiency of a novel parallel/distributed application control method, based on global state monitoring. Processes report their local states to monitors. The monitors construct global states, analyze them and send control signals to processes when necessary. The addition of a special fast control network, responsible for transferring control information, is proposed in this paper. The efficiency is tested in simulation of sample Branch and Bound parallel computations. We show, that multicast capability of a network plays an important role in the resulting system efficiency. Other network parameters, such as latency or bandwidth, are significant only under proper conditions. We identify these conditions, demonstrating that 5-9 times speedup can be obtained by addition of a fast control network.
Voids in the Current CRM Literature: Academic Literature Review and Classification (2000-2005)
Authors: Kristel Paulissen, Koen Milis, Malaika Brengman, Jerry Fjermestad, Nicholas C. Romano,  Jr.
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The status of the CRM literature is investigated for the period of 2000 to 2005, in order to provide an overview of academic research on the subject and to identify gaps in the current literature. To provide as complete picture of CRM as possible, the Information Systems (IS) as well as the Marketing literature was systematically reviewed. From both disciplines the top journals and a number of international conferences were analyzed. Selected publications were reviewed in a structured way and categorized according to the different phases in the CRM lifecycle: adoption, acquisition, implementation, use & maintenance, evolution and retirement. It appears that less attention has been devoted to implementation issues and to the evolution and retirement phases. Furthermore, a difference in attention was found between the IS and Marketing literature: while researchers of the latter focused mainly on the adoption and use phases, IS researchers' attention was more evenly distributed over the lifecycle.
Book Review: Software Agent Technology: The State of the Art
Authors: Maria Ganzha
Venue: IEEE Distributed Systems Online (2007)

A review of "Software Agent-Based Applications, Platforms and Development Kits" Rainer Unland, Matthias Klusch, and Monique Calisti, eds.
A method for dynamic reconfiguration of a cognitive radio system
Authors: Douglas C. Sicker
Venue:  (2006)

Advances in process technology, manufacturing, and architecture have ushered in an age of faster, smaller, and cheaper electronic devices. Emerging processor technology has made it possible to migrate applications that were traditionally implemented in custom silicon to general purpose processors. In the area of wireless communications, this transition has given birth to the field of cognitive and software-defined radio (C/SDR). These C/SDRs offer a broad range of opportunities for improving the use and utilization of radio frequency spectrum. This includes the creation of radio networks that can reconfigure their operation based on application requirements, policy updates, environmental conditions, and the ability to adapt to a wide range of protocols. One of the key benefits of having a C/SDR is its ability to change communication parameters in response to changes in application needs and/or changes in the radio frequency landscape. Such reconfiguration requires an understanding of how these communication parameters interact within the network protocol stack. Analysis of these parametric cross-layer interactions is a critical precursor in the development of a predictive model and algorithm for dynamic reconfiguration of a C/SDR. This work investigates how parameters at the physical, data link, network, and application layers interact, how desirable configurations of these parameters can be determined, and how these parameters affect the performance of file transfer and Voice over IP applications. An analysis of varying communication parameters across networking layers is used to inform the design, implementation, and evaluation of a predictive model and algorithm for dynamic reconfiguration of a cognitive radio. This model and algorithm allow a C/SDR to dynamically modify its configuration in order to improve presented. This method uses statistical analysis of variance and design of experiments techniques to inform the design and implementation of a dynamic reconfiguration algorithm. This algorithm exploits cross-layer interactions to improve system performance, adapt to the needs of users, and respond to changes in the radio frequency environment.