ppxscal/embedding_network huggingface dataset:
Ordinal Palmprint Represention for Personal Identification
Authors: Zhenan Sun, Tieniu Tan, Yunhong Wang, Stan Z. Li
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Palmprint-based personal identification, as a new member in the biometrics family, has become an active research topic in recent years. Although great progress has been made, how to represent palmprint for effective classification is still an open problem. In this paper, we present a novel palmprint representation ¿ ordinal measure, which unifies several major existing palmprint algorithms into a general framework. In this framework, a novel palmprint representation method, namely orthogonal line ordinal features, is proposed. The basic idea of this method is to qualitatively compare two elongated, line-like image regions, which are orthogonal in orientation and generate one bit feature code. A palmprint pattern is represented by thousands of ordinal feature codes. In contrast to the state-of-the-art algorithm reported in the literature, our method achieves higher accuracy, with the equal error rate reduced by 42% for a difficult set, while the complexity of feature extraction is halved.
Test Scheduling for Modular SOCs in an Abort-on-Fail Environment
Authors: Urban Ingelsson, Sandeep Kumar Goel, Erik Larsson, Erik Jan Marinissen
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Complex SOCs are increasingly tested in a modular fashion, which enables us to record the yield-per-module. In this paper, we consider the yield-per-module as the pass probability of the moduleýs manufacturing test. We use it to exploit the abort-on-fail feature of ATEs, in order to reduce the expected test application time. We present a model for expected test application time, which obtains increasing accuracy due to decreasing granularity of the abortable test unit. For a given SOC, with a modular test architecture consisting of wrappers and disjunct TAMs, and for given pass probabilities per module test, we schedule the tests on each TAM such that the expected test application time is minimized. We describe two heuristic scheduling approaches, one without and one with preemption. Experimental results for the ITCý02 SOC Test Benchmarks demonstrate the effectiveness of our approach, as we achieve up to 97% reduction of the expected test application time, without any modification of the SOC or ATE.
How to Do Everything with Adobe Acrobat 7.0, 1 edition
Authors: Doug Sahlin
Venue:  (2005)

Create and distribute PDF (Portable Document Format) documents using Adobe Acrobat 7.0. This easy-to-follow guide shows you how to generate Adobe PDF files that retain the look and feel of the original documents, share PDFs, initiate and participate in PDF document reviews, and prepare PDFs for print or the Web. You¿ll also learn to develop interactive forms, secure your documents, and create PDFs from Microsoft Office and other authoring applications. With coverage of Adobe Acrobat Standard and Professional editions, this hands-on resource will help you take full advantage of the premier paperless publishing and collaboration solution.
Research at the U. of Massachusetts at Amherst
Authors: David D. McDonald
Venue: Issue 79 (January 1982) (1982)

Computational linguistics is a central area of research at in cognitive science at UMass, involving eight professors and nine graduate students with thesis work in this area across three departments. Interdisciplinary cooperation is our hallmark, with contributions from the perspectives of linguistics, artificial intelligence, and brain theory. Our work is broken down into five major projects:
Customizing a Geographical Routing Protocol for Wireless Sensor Networks
Authors: Jian Chen, Yong Guan, Udo Pooch
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Several problems are required to be fixed in order to apply geographical routing protocol Greedy Perimeter Stateless Routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability) which is not realistic for many practical sensor networks, since wireless links in sensor networks often are asymmetric. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address. Therefore, packets are routed to the home node which is the node geographically closest to the destined location. Under GPSR, when the target location is outside the exterior perimeter of the sensor network, each packet has to visit all nodes on the boundary of the sensor network topology before it identifies the home node, which results in energy inefficiency. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose On-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little bit more packet delivery delay.
An Audit Logic for Accountability
Authors: J. G. Cederquist, R. Corin, M. A. C. Dekker, S. Etalle, J. I. den Hartog
Venue: Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (2005)

We describe a policy language and implement its associated proof checking system. In our system, agents can distribute data along with usage policies in a decentralized architecture. Our language supports the specification of conditions and obligations, and also the possibility to refine policies. In our framework, the compliance with usage policies is not actively enforced. However, agents are accountable for their actions, and may be audited by an authority requiring justifications.
An effective and efficient algorithm for high-dimensional outlier detection
Authors: C. Aggarwal, S. Yu
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are most important for high-dimensional domains in which the data can contain hundreds of dimensions. Many recent algorithms have been proposed for outlier detection that use several concepts of proximity in order to find the outliers based on their relationship to the other points in the data. However, in high-dimensional space, the data are sparse and concepts using the notion of proximity fail to retain their effectiveness. In fact, the sparsity of high-dimensional data can be understood in a different way so as to imply that every point is an equally good outlier from the perspective of distance-based definitions. Consequently, for high-dimensional data, the notion of finding meaningful outliers becomes substantially more complex and nonobvious. In this paper, we discuss new techniques for outlier detection that find the outliers by studying the behavior of projections from the data set.
Real-world project management in the academic environment
Authors: Joo Tan, John Phillips
Venue: Journal of Computing Sciences in Colleges (2005)

Instructors of many team-based project courses commonly focus on technical aspects such as experimenting with the best software development methods, developing processes that improve important software factors like reliability, usability, and maintainability, and researching software tools that enhance a team's productivity. This paper describes the management aspect of teaching two team-based project courses over the course of a two academic year period. We summarize practical ways of managing teams, explain procedures used to evaluate students, and describe ways of simulating a company environment in the classroom. Issues and solutions found in our classroom management process will aid future instructors in organizing, managing, and teaching similar upper-level undergraduate courses. As a result of taking these courses, students feel more confident in team projects and are ready to assume more responsibility within a team environment.
On Cooperative Content Distribution and the Price of Barter
Authors: Prasanna Ganesan, Mukund Seshadri
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing to upload data to each other and, under a simple bandwidth model, derive an optimal solution involving communication on a hypercube-like overlay network. We also study different randomized algorithms, and show that their performance is surprisingly good. We then consider non-cooperative scenarios based on the principle of barter, in which one client does not upload to another unless it receives data in return. A strict barter requirement increases the optimal completion time considerably compared to the cooperative case. We consider relaxations of the barter model in which an efficient solution is theoretically feasible, and show that obtaining a high-performance practical solution may require careful choices of overlay networks and data-transfer algorithms.
The development of a cybernetic sculptor: Edward Ihnatowicz and the senster
Authors: Aleksandar Zivanovic
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Edward Ihnatowicz (1926-1988) built one of the world's first computer-controlled robotic sculptures, The Senster, in 1968-70. Rather than concentrate entirely on this groundbreaking and influential piece of work, this paper describes the stages he went through in developing his ideas, as an illustration of how a conventional artist became a cybernetic sculptor.
Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Authors: V. S. Borkar, A. A. Kherani, B. J. Prabhu
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

We study a decision problem faced by an energy limited wireless device that operates in discrete time. There is some external arrival to the deviceýs transmit buffer. The possible decisions are: a) to serve some of the buffer content; b) to reorder a new battery after serving the maximum possible amount that it can; or c) to remain idle so that the battery charge can increase owing to diffusion process (which is possible in some commercially available batteries). We look at open and closed-loop controls of the system. The closed-loop control problem is a using the framework of Markov Decision Processes. We address both finite and infinite horizon discounted costs as well as average cost minimization problems. Without using any second order characteristics, we obtain results that include i) optimality of bang-bang control, ii) the optimality of threshold based policies, iii) parametric monotonicity of the threshold, and iv) uniqueness of the threshold. For the open-loop control setting we use recent advances in application of multimodular functions to establish optimality of bracket sequence based control.
The Little Mac Book, Tiger Edition (Little Book Series)
Authors: Robin Williams
Venue:  (2005)

Adopting a back-to-the-basics approach, this best-selling little Mac classic has been revised and overhauled to introduce users to Tiger, Apple's newest version of its revolutionary operating system. In the gentle, friendly, funny style that generations of computer users have come to know and love, author Robin Williams shows readers how to dive in and start working with the Mac and OS X 10.4 Tiger. Readers will learn how to find their way around the interface; use the desktop, Dock, Finder, and icons; control the mouse; manipulate windows; search with Tiger's new Spotlight feature; save and print documents; and more. Using straightforward, jargon-free explanations delivered in logical, easy-to-follow sections, Robin is a new user's personal guide, coaching and encouraging users as they learn their way around the magic of the Mac.
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
Authors: Michael E. Houle, Jun Sakuma
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper introduces a practical index for approximate similarity queries of large multi-dimensional data sets: the spatial approximation sample hierarchy (SASH). A SASH is a multi-level structure of random samples, recursively constructed by building a SASH on a large randomly selected sample of data objects, and then connecting each remaining object to several of their approximate nearest neighbors from within the sample. Queries are processed by first locating approximate neighbors within the sample, and then using the pre-established connections to discover neighbors within the remainder of the data set. The SASH index relies on a pairwise distance measure, but otherwise makes no assumptions regarding the representation of the data. Experimental results are provided for query-by-example operations on protein sequence, image, and text data sets, including one consisting of more than 1 million vectors spanning more than 1.1 million terms ¿ far in excess of what spatial search indices can handle efficiently. For sets of this size, the SASH can return a large proportion of the true neighbors roughly 2 orders of magnitude faster than sequential search.
Atomic functions of three variables invariant with respect to a rotation group
Authors: V. M. Kolodyazhnyi, V. A. Rvachev
Venue: Cybernetics and Systems Analysis (2005)

Atomic functions of three variables, i.e., infinitely differentiable compactly supported solutions of functional differential equations of special type are considered. The existence theorem, conclusion about additivity of the function inside the carrier, the probability sense, and the algorithm of calculation of the moments of compactly supported functions are presented.
Data partitioning-based parallel irregular reductions: Research Articles
Authors: Eladio Gutiérrez, Oscar Plata, Emilio L. Zapata
Venue: Concurrency and Computation: Practice Experience (2004)

Different parallelization methods for irregular reductions on shared memory multiprocessors have been proposed in the literature in recent years. We have classified all these methods and analyzed them in terms of a set of properties: data locality, memory overhead, exploited parallelism, and workload balancing. In this paper we propose several techniques to increase the amount of exploited parallelism and to introduce load balancing into an important class of these methods. Regarding parallelism, the proposed solution is based on the partial expansion of the reduction array. Load balancing is discussed in terms of two techniques. The first technique is a generic one, as it deals with any kind of load imbalance present in the problem domain. The second technique handles a special case of load imbalance which occurs whenever a large number of write operations are concentrated on small regions of the reduction arrays. Efficient implementations of the proposed optimizing solutions for a particular method are presented, experimentally tested on static and dynamic kernel codes, and compared with other parallel reduction methods. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Embedded interpreters
Authors: Nick Benton
Venue: Journal of Functional Programming (2005)

This is a tutorial on using type-indexed embedding&#x002F;projection pairs when writing interpreters in statically-typed functional languages. The method allows (higher-order) values in the interpreting language to be embedded in the interpreted language and values from the interpreted language may be projected back into the interpreting one. This is particularly useful when adding command-line interfaces or scripting languages to applications written in functional languages. We first describe the basic idea and show how it may be extended to languages with recursive types and applied to elementary meta-programming. We then show how the method combines with Filinski's continuation-based monadic reflection operations to define an &lsquor;extensional&rsquor; version of the call-by-value monadic translation and hence to allow values to be mapped bidirectionally between the levels of an interpreter for a functional language parameterized by an arbitrary monad. Finally, we show how SML functions may be embedded into, and projected from, an interpreter for an asynchronous $\pi$-calculus via an &lsquo;extensional&rsquo; variant of a standard translation from $\lambda$ into $\pi$.
Merrimac: Supercomputing with Streams
Authors: William J. Dally, Francois Labonte, Abhishek Das, Patrick Hanrahan, Jung-Ho Ahn, Jayanth Gummaraju, Mattan Erez, Nuwan Jayasena, Ian Buck, Timothy J. Knight, Ujval J. Kapasi
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Merrimac uses stream architecture and advanced interconnection networks to give an order of magnitude more performance per unit cost than cluster-based scientific computers built from the same technology. Organizing the computation into streams and exploiting the resulting locality using a register hierarchy enables a stream architecture to reduce the memory bandwidth required by representative applications by an order of magnitude or more. Hence a processing node with a fixed bandwidth (expensive) can support an order of magnitude more arithmetic units (inexpensive). This in turn allows a given level of performance to be achieved with fewer nodes (a 1-PFLOPS machine, for example, with just 8,192 nodes) resulting in greater reliability, and simpler system management. We sketch the design of Merrimac, a streaming scientific computer that can be scaled from a $20K 2 TFLOPS workstation to a $20M 2 PFLOPS supercomputer and present the results of some initial application experiments on this architecture.
The earth simulator: roles and impacts
Authors: Tetsuya Sato
Venue: Parallel Computing (2004)

The Earth Simulator Research Project started in March 2002 with the primary objective of producing reliable prediction data for global climate change. Within a couple of months after the start of operation, the Earth Simulator achieved an amazing performance of 35.86 Teraflops (about 90% of the peak performance of 40.96 Teraflops) in the Linpack benchmark test and, more surprisingly, 26.58 Teraflops for a typical application program of global atmospheric circulation model (called AFES) with a horizontal resolution of 10km. These facts ensure us that the real contribution of the Earth Simulator be far greater than originally expected. Undoubtedly, the Earth Simulator would work to make a paradigm shift in science, industry, and human thinking, as well as finding the best human's wisdom to keep a sustainable symbiotic relationship with nature.
An integrating approach to meshing scattered point data
Authors: Yutaka Ohtake, Alexander Belyaev, Hans-Peter Seidel
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In this paper, we propose a new method for approximating an unorganized set of points scattered over a piecewise smooth surface by a triangle mesh. The method is based on the Garland-Heckbert local quadric error minimization strategy. First an adaptive spherical cover and auxiliary points corresponding to the cover elements are generated. Then the intersections between the spheres of the cover are analyzed and the auxiliary points are connected. Finally the resulting mesh is cleaned from non-manifold parts. The method allows us to control the approximation accuracy, process noisy data, and reconstruct sharp edges and corners. Further, the vast majority of the triangles of the generated mesh have their aspect ratios close to optimal. Thus our approach integrates the mesh reconstruction, smoothing, decimation, feature restoration, and remeshing stages together.
Inverse-free second moment method for electrical systems with uncertain parameters: Research Articles
Authors: E. Shakshuki, K. Ponnambalam, J. Vlach
Venue: International Journal of Circuit Theory and Applications (2005)

Engineering systems are usually designed deterministically, but if there are uncertainties in parameters, an appropriate approach is to use probabilistic methods. For reliability estimation it is necessary to have at least the first two moments including means and covariances of the output variables. Most of the existing methods applied to problems involving linear systems need inverses of matrices. There are two problems with these approaches. First, for large sparse linear systems (for example, a tri-diagonal system) the inverse is fully dense. Second, the mean of the random matrix has to be non-singular. In this paper, we present a new method to automatically formulate the moment equations that aims to overcome the drawbacks of these methods and apply it on electrical networks. This method does not require an inverse and able to solve problems when the mean matrix of a system is singular. In addition, it takes advantage of both sparsity (zero elements) and deterministic coefficients. This method can be used to solve both uncorrelated and correlated cases. To demonstrate the feasibility of this method, a quantitative comparison with another existing method requiring the inverse and with Monte Carlo results is done. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Absolute Beginner's Guide to Windows XP (2nd Edition) (Absolute Beginner's Guide)
Authors: Shelley O'Hara
Venue:  (2005)

Upgrade to a digital lifestyle! Absolute Beginner's Guide to Windows XP, Second Edition is not just about using Windows, but also about how to live in a digital world where you can share pictures over the Internet, download music from websites, communicate with long-distance family and friends on the computer, and more. Step-by-step instructions will show you how to accomplish key tasks and take precautions to protect your computer from viruses and spyware. Some of the tasks covered include: Starting programs Understanding file management basics Getting wired for communication Working with photographs Playing music and videos Improving your computer's performance Upgrading WindowsUpdated to include information on Service Pack 2, Absolute Beginner's guide to Windows XP, Second Edition will show you how to work with Windows XP to make your life easier!
Imaging the Cardiovascular Pulse
Authors: Nanfei Sun, Marc Garbey, Arcangelo Merla, Ioannis Pavlidis
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We have developed a novel method to measure human cardiac pulse at a distance. It is based on the information contained in the thermal signal emitted from major superficial vessels. This signal is acquired through a highly sensitive thermal imaging system. Temperature on the vessel is modulated by pulsative blood flow. To compute the frequency of modulation (pulse), we extract a line-based region along the vessel. Then, we apply Fast Fourier Transform (FFT) to individual points along this line of interest to capitalize on the pulse propagation effect. Finally, we use an adaptive estimation function on the average FFT outcome to quantify the pulse. We have tested the accuracy of our method on 5 subjects with highly successful results. The technology is expected to find applications among others in sustained physiological monitoring of cardiopulmonary diseases, sport training, sleep studies, and psychophysiology (polygraph).