ppxscal/embedding_network huggingface dataset:
Fingerprint Recognition
Authors: Gualberto Aguilar, Gabriel Sanchez, Karina Toscano, Moises Salinas, Mariko Nakano, Hector Perez
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Fingerprint recognition is one of the most popular and successful methods used for person identification, which takes advantage of the fact that the fingerprint has some unique characteristics called minutiae; which are points where a curve track finishes, intersect with other track or branches off. Biometric identification systems using fingerprints patterns are called AFIS (Automatic Fingerprint Identification System). In this paper a novel method for Fingerprint recognition is considered using a combination of Fast Fourier Transform (FFT) and Gabor Filters to enhancement the fingerprint image was captured using a UareU 4000 fingerprint reader of Digital Person, Inc.
A linear-time algorithm for computing the multinomial stochastic complexity
Authors: Petri Kontkanen, Petri Myllymäki
Venue: Information Processing Letters (2007)

The minimum description length (MDL) principle is a theoretically well-founded, general framework for performing model class selection and other types of statistical inference. This framework can be applied for tasks such as data clustering, density estimation and image denoising. The MDL principle is formalized via the so-called normalized maximum likelihood (NML) distribution, which has several desirable theoretical properties. The codelength of a given sample of data under the NML distribution is called the stochastic complexity, which is the basis for MDL model class selection. Unfortunately, in the case of discrete data, straightforward computation of the stochastic complexity requires exponential time with respect to the sample size, since the definition involves an exponential sum over all the possible data samples of a fixed size. As a main contribution of this paper, we derive an elegant recursion formula which allows efficient computation of the stochastic complexity in the case of n observations of a single multinomial random variable with K values. The time complexity of the new method is O(n+K) as opposed to O(nlognlogK) obtained with the previous results.
DynCNET: A Protocol for Dynamic Task Assignment in Multiagent Systems
Authors: Danny Weyns, Nelis Boucke, Tom Holvoet, Bart Demarsin
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Task assignment in multiagent systems is a complex coordination problem, in particular in systems that are subject to dynamic and changing operating conditions. To enable agents to manage dynamism and change, adaptive task assignment approaches are needed. In this paper, we introduce DynCNET, a protocol for dynamic task assignment that extends standard contract net (CNET). DynCNET allows the agents involved in the protocol to switch the assignment of tasks dynamically. We use an industrial automated transportation system as illustration and present results obtained from a real-world test setting that compare DynCNET with standard CNET and a field-based approach for task assignment.
Network intrusion detection: evasion, traffic normalization, and end-to-end protocol semantics
Authors: Mark Handley, Vern Paxson, Christian Kreibich
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

A fundamental problem for network intrusion detection systems is the ability of a skilled attacker to evade detection by exploiting ambiguities in the traffic stream as seen by the monitor. We discuss the viability of addressing this problem by introducing a new network forwarding element called a traffic normalizer. The normalizer sits directly in the path of traffic into a site and patches up the packet stream to eliminate potential ambiguities before the traffic is seen by the monitor, removing evasion opportunities. We examine a number of tradeoffs in designing a normalizer, emphasizing the important question of the degree to which normalizations undermine end-to-end protocol semantics. We discuss the key practical issues of "cold start" and attacks on the normalizer, and develop a methodology for systematically examining the ambiguities present in a protocol based on walking the protocol's header. We then present norm, a publicly available user-level implementation of a normalizer that can normalize a TCP traffic stream at 100,000 pkts/sec in memory-to-memory copies, suggesting that a kernel implementation using PC hardware could keep pace with a bidirectional 100 Mbps link with sufficient headroom to weather a high-speed flooding attack of small packets.
Guest Editors' Introduction: A Web 2.0 Tune-Up
Authors: Liang-Jie (LJ) Zhang, Sally Ericksen, Jaideep Roy
Venue: IT Professional (2007)

How SOA, Web services, and software engineering are keys to building Web-based solutions.
A new reduced-bias multichannel gradient-based steepest descent algorithm for ill-conditioned correlation matrices
Authors: Byung-Jae Kwak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The convergence speed of the steepest descent (SD) adaptive algorithm is determined by the eigenvalue spread of the correlation matrix. When the correlation matrix is singular, the algorithm will take a long time to converge. The problem can be regularized by adding a small constant to the diagonal, but this comes at the price of introducing bias. This paper introduces a new adaptive algorithm that uses a family of steepest descent iterations which converge quickly while making the bias arbitrarily small. A numerical example discusses in some detail the operation of the new algorithm.
Marked-Controlled Reconfigurable Workflow Nets
Authors: Marisa Llorens, Javier Oliver
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In previous studies, we have introduced marked-controlled net rewriting systems and a subclass of these called marked-controlled reconfigurable nets. The main goal of these models is to analyze, simulate and verify concurrent and distributed systems that are subject to structural dynamic changes. In a marked-controlled net rewriting system, a system configuration is described as a Petri net, and a change in configuration is described as a graph rewriting rule. A marked-controlled reconfigurable net is a marked-controlled net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule not only depends on the net topology, but also depends on the net marking according to control places. In this work, we introduce marked-controlled reconfigurable workflow nets, based on Van der Aalst's workflow nets and marked-controlled reconfigurable nets, in order to model workflow systems handling structural dynamic changes. A characterization of the soundness property for marked-controlled reconfigurable workflow nets is also provided.
Butson Hadamard matrices with partially cyclic core
Authors: Ji-Woong Jang, Jong-Seon No, Habong Chung
Venue: Designs, Codes and Cryptography (2007)

In this paper, we introduce a class of generalized Hadamard matrices, called a Butson Hadamard matrix with partially cyclic core. Then a new construction method for Butson Hadamard matrices with partially cyclic core is proposed. The proposed matrices are constructed from the optimal balanced low-correlation zone(LCZ) sequence set which has correlation value ¿1 within LCZ.
Motivation and material retention, a spiral program in electrical and computer engineering
Authors: W. H. Eggiman
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The Department of Electrical and Computer Engineering at Worcester Polytechnic Institute has been engaged in the development of a new approach to teach basic electrical engineering. Some of these features were quite successful, others presented problems. The program consists of four sequential courses which present the following material: the first course uses demonstrations and mini-projects to give a broad perspective of electrical and computer engineering, the second course gives an introduction to digital circuits, and in the following two courses, the emphasis is on a rigorous treatment of electric circuits, with some discussions on transformers, basic motors and generators, and transmission lines. While the course content is by its nature relatively traditional the approach is guided by the following: (1) Motivate the students in the first courses by presenting the material in an interesting manner using demonstrations and make the connection to practical applications. (2) Improve the material retention of the students by revisiting the basic concepts and applications in previous courses many different times in an increasingly more sophisticated context. (3) Promote the understanding of the material by practical design projects in the laboratory and for homework. Another feature to promote understanding involves verbalization of important concepts, designing appropriate exams, and handling of mathematical relations. In addition, the application of new technology such as multimedia aids and the World Wide Web as a course platform are briefly addressed. 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
Person tracking and reidentification: Introducing Panoramic Appearance Map (PAM) for feature representation
Authors: Tarak Gandhi, Mohan Manubhai Trivedi
Venue: Machine Vision and Applications (2007)

This paper develops a concept of Panoramic Appearance Map (PAM) for performing person reidentification in a multi-camera setup. Each person is tracked in multiple cameras and the position on the floor plan is determined using triangulation. Using the geometry of the cameras and the person location, a panoramic map centered at the person&#x2019;s location is created with the horizontal axis representing the azimuth angle and vertical axis representing the height. Each pixel in the map image gets color information from the cameras which can observe it. The maps between different tracks are compared using a distance measure based on weighted SSD in order to select the best match. Temporalintegration by registering multiple maps over the tracking period improves the matching performance. Experimental results of matching persons between two camera sets show the effectiveness of the approach.
A Web 3D Viewer Based on STEP/AP203
Authors: Xianping Huang, Guobin Zhou, Ronghua Liang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In collaborative virtual environment system, to render 3D models on web based on a unified modeling kernel is a challenging issue. Previous technologies of Web 3D rendering mainly concentrate on the technology of visualization and interaction, and typically Web 3D models are rendered with surface model. In this paper, we develop a novel Web 3D viewer based on STEP/AP203 kernel, and the relation of entities in STEP/AP203 is detailed. This viewer, which is based on hierarchical scene graph, solve the visualization and interaction of 3D models on Web among heterogeneous environments using Java 3D. 3D models based on STEP/AP203 kernel in this viewer are helpful to collaborative design.
VSTA: A prolog-Based Formal Verifier for Systtolic Array Designs
Authors: Nam Ling, Timothy Shih
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Special purpose formal design verifier for a specific class of archirecture has the advantage of being able to exploit the dtributes of that architecture class to produce efficiency in the design verrification process.
MODE with extra-roots (MODEX): a new DOA estimation algorithm with an improved threshold performance
Authors: A. B. Gershman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose a new MODE-based direction of arrival (DOA) estimation algorithm with an improved SNR threshold as compared to the conventional MODE technique. Our algorithm preserves all good properties of MODE, such as asymptotic efficiency, excellent performance in scenarios with coherent sources, as well as a reasonable computational cost. Similarly to root-MODE, the proposed method does not require any global multidimensional optimization since it is based on a combination of polynomial rooting and a simple combinatorial search. Our technique is referred to as MODEX (MODE with EXtra roots) because it makes use of a certain polynomial with a larger degree than that of the conventional MODE-polynomial. The source DOAs are estimated via checking a certain (enlarged) number of candidate DOAs using either the stochastic or the deterministic maximum likelihood function. To reduce the computational cost of MODEX, a priori information about source localization sectors can be exploited.
Use of wireless computers in the undergraduate and graduate classroom
Authors: J. Kabara
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Laptop and handheld computers are increasingly available for use in educational environments for a variety of applications, from taking classroom notes to providing access to electronic presentations and "paperless" coursework. In this work-in-progress, we are building an experimental system to explore how mobile devices with wireless Internet connectivity may be effectively used in a classroom setting. The experimental testbed consists of a wireless local area network in the School of Information Sciences at the University of Pittsburgh connected to the university's wired network. A variety of user (student) devices are being tested with the goal of minimizing the cost of a useful classroom system.
Software engineering class eating its own tail
Authors: Samuel Mann, Lesley Smith
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

This paper describes an experiment where software engineering students were given the task of developing a project management system for use in capstone projects. The Agile Development Framework, which is a combination of agile and structured methodologies, is introduced. Using examples of student work, the paper describes the effect on learning of this recursive approach to learning software engineering.
Examining perception of digital information space
Authors: John A. D'Ignazio, Joseph D. Ryan, Sarah C. Harwell, Anne R. Diekema, Elizabeth D. Liddy
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

A study using a modified think aloud protocol of University of Rochester undergraduate students' interactions with a general, humanities scholarly database helped a research team gain insight into their information-seeking behavior and thus the impact of the digital library.
The business case for audio watermarking
Authors: P. Jessop
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This article reviews the applications of audio watermarking for the recording industry. It examines the reasons for placing watermarks in sound recordings, the benefits which might result and the potential hazards which need to be overcome. It covers the objectives, methodology and results of the MUSE project, one of whose tasks was the evaluation of "embedded signaling" systems. Finally, it looks at developments in the adoption of watermarking in the recording industry. 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
Towards scalable multiprocessor virtual machines
Authors: Volkmar Uhlig, Joshua LeVasseur, Espen Skoglund, Uwe Dannowski
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

A multiprocessor virtual machine benefits its guest operating system in supporting scalable job throughput and request latency-useful properties in server consolidation where servers require several of the system processors for steady state or to handle load bursts. Typical operating systems, optimized for multiprocessor systems in their use of spin-locks for critical sections, can defeat flexible virtual machine scheduling due to lock-holder preemption and misbalanced load. The virtual machine must assist the guest operating system to avoid lock-holder preemption and to schedule jobs with knowledge of asymmetric processor allocation. We want to support a virtual machine environment with flexible scheduling policies, while maximizing guest performance. This paper presents solutions to avoid lock-holder preemption for both fully virtualized and paravirtualized environments. Experiments show that we can nearly eliminate the effects of lock-holder preemption. Furthermore, the paper presents a scheduler feedback mechanism that despite the presence of asymmetric processor allocation achieves optimal and fair load balancing in the guest operating system.
Self-Similar Algorithms for Dynamic Distributed Systems
Authors: K. Mani Chandy, Michel Charpentier
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may cease functioning temporarily or permanently. Communication and computing may be interrupted by an adversary or by environmental factors such as noise and power loss. The set of processes may be partitioned into subsets that cannot communicate with each other; algorithms in which all such subsets behave in a similar fashion, regardless of size and identities of processes, are called self-similar algorithms. Algorithms adapt to changing conditions, speeding up or slowing down depending on the resources available. The paper presents necessary and sufficient conditions for the application of a self-similar strategy. Self-similar algorithms are developed for several problems by applying the methodology.
Effects of Embedded Decompression and Compaction Architectures on Side-Channel Attack Resistance
Authors: Chunsheng Liu, Yu Huang
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Attack resistance has been a critical concern for security-related applications. Various side-channel attacks can be launched to retrieve security information such as encryption key. Prior work does not consider the presence of embedded compression architectures and their impacts on security. In this paper, we analyze the complexity of side-channel attacking on designs with embedded decompression and compaction circuit. We first present a possible attacking strategy and perform analysis on the complexity of attacking circuits with EDT architecture. We then extend the probabilistic analysis to the more general compaction schemes using distance coding. We show that successful attacking of designs with embedded decompressor and compactor is extremely difficult. The complexity is much higher than the results shown in prior work assuming no decompression and compaction. It indicates that the use of embedded compression architectures can achieve higher security level.
Efficient Multiparty Computation for Comparator Networks
Authors: Koji Chida, Hiroaki Kikuchi, Gembu Morohashi, Keiichi Hirota
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We propose a multiparty protocol for various computations using comparator networks such as sorting and searching. By repeating the execution of a comparator, the proposed protocol can efficiently detect outlier values, without revealing them. In our scenario, all input values to a comparator network and the intermediate output from each comparator are kept secret assuming the presence of an honest majority. Possible application areas for the proposed protocol include statistical analysis while preserving the privacy of respondents.
Optimisation of controlled acoustic shadows
Authors: S. E. Wright
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper considers the acoustic interference across high frequency source distributions and how to generate an acoustic shadow from these sources using a controlled array of discrete cancelling sources. The optimum shadow depth as a function of the canceller density is considered including optimum system parameters. The behaviour of the secondary sources and how they organise themselves in phase and amplitude to cancel the primary field is investigated, together, with details of the antifield and resulting residual field (shadow). Finally, the special case of excessive canceller effort to produce the near perfect shadows is also considered.
Towards intelligent camera networks: a virtual vision approach
Authors: F. Z. Qureshi, D. Terzopoulos
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

The goals of this paper are two-fold: (i) to present our initial efforts towards the realization of a fully autonomous sensor network of dynamic video cameras capable of providing perceptive coverage of a large public space, and (ii) to further the cause of exploiting visually and behaviorally realistic virtual environments in the development and testing of machine vision systems. In particular, our proposed sensor network employs techniques that enable a collection of active (pan-tilt-zoom) cameras to collaborate in performing various visual surveillance tasks, such as keeping one or more pedestrians within view, with minimal reliance on a human operator. The network features local and global autonomy and lacks any central controller, which entails robustness and scalability. Its functionality is the result of local decision-making capabilities at each camera node and communication between the nodes. We demonstrate our surveillance system in a virtual train station environment populated by autonomous, lifelike virtual pedestrians. Our readily reconfigurable virtual cameras generate synthetic video feeds that emulate those generated by real surveillance cameras monitoring public spaces. This type of research would be difficult in the real world given the costs of deploying and experimenting with an appropriately complex camera network in a large public space the size of a train station.