ppxscal/embedding_network huggingface dataset:
Transparent Tabletop Interface for Multiple Users on Lumisight Table
Authors: Yasuaki Kakehi, Takero Hosomi, Makoto Iida, Takeshi Naemura, Mitsunori Matsushita
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

This paper presents a new type of tabletop interface on Lumisight Table. Putting physical objects on a tabletop display is one of the typical methods for intuitive tangible input. To date, various interactive systems that can identify and track the tabletop objects by using a camera, have been proposed. However, in these systems, the existence of objects with special devices or markers can disturb users' natural interaction by hiding displayed information. To solve this problem, the authors propose a transparent tabletop interface that is transparent from users but visible from a camera installed inside the system. This paper describes our research motivation, design and implementation of this interface, and examples of interaction.
Advantages of HfA1ON gate dielectric film for advanced low power CMOS application
Authors: A. Toriumi, K. Iwamoto, H. Ota, M. Kadoshima, W. Mizubayashi, T. Nabatame, A. Ogawa, K. Tominaga, T. Horikawa, H. Satake
Venue: Microelectronic Engineering (2005)

There are a number of challenges against an actual employment of high-k films in the production, but ultra-thin SiON films cannot survive for low power application anymore. On the other hand, any new materials introduced into ULSI fabrication processes are required to be used for a couple of device generations, so the material selection should be carefully made. We have investigated HfA1ON film as a high-k material in perspective of the equivalent oxide thickness (EOT) =1nm, and has newly developed a layer-by-layer deposition and annealing (LL-D&A) method for the film growth technique and a high temperature oxygen annealing (HiTOA) for the post-deposition annealing process, in order to overcome intrinsic challenges of deposited films. This paper describes recent progress of HfAlON gate stack technology, and discusses advantages of those approaches for advanced low power CMOS from scalability viewpoints of material and film growth technique as well as from experimental results of gate leakage current reduction, mobility improvement and threshold voltage control.
Single channel speech enhancement by efficient coding
Authors: Allan Kardec Barros, Noboru Ohnishi
Venue: Signal Processing (2005)

A number of approaches have been proposed for enhancing/extracting a given speech in a noisy environment, in the aim of, for example, enhancing the speech recognition rate. The speech enhancement can be carried out by either using single or multiple channel measurements. Some of those approaches explore the harmonicity of speech, and others make use of the redundancy among the channels, usually by independent component analysis. To enhance one speech from a single channel, we propose here to use the characteristics of speech through the concept of efficient coding, which mimics the way the auditory cortex code information. This is carried out in a supervized fashion. Simulations and real world measurements show that this technique can be used efficiently to enhance a given speech signal.
Sequential Correction of Perspective Warp in Camera-based Documents
Authors: Camille Monnier, Steve Holden, Magnus Snorrason, Vitaly Ablavsky
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Documents captured with hand-held devices, such as digital cameras often exhibit perspective warp artifacts. These artifacts pose problems for OCR systems which at best can only handle in-plane rotation. We propose a method for recovering the planar appearance of an input document image by examining the vertical rate of change in scale of features in the document. Our method makes fewer assumptions about the document structure than do previously published algorithms.
Real-Time Guarantee of Aperiodic Packets in Single-Hop Ad Hoc Wireless Networks
Authors: Ryan Boder, Chang-Gun Lee
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Building real-time applications on 802.11 wireless networks is challenging because the medium access protocol is distributed and nodes contend for the channel non-deterministically. So far all attempts at providing real-time services in 802.11 require restrictive traffic assumptions such as periodicity. In this paper we describe distributed admission control, a modification to 802.11 that, when used with distributed prioritization, provides real-time guarantees for aperiodic packets. We show that barring external errors such as interference on the channel or incorrect priority scheduling this protocol guarantees deadlines will be met.
Valid inequalities based on the interpolation procedure
Authors: Sanjeeb Dash, Oktay G&#x00fc;nl&#x00fc;k
Venue: Mathematical Programming: Series A and B (2006)

We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has recently been re-considered by Evans (2002) and Gomory, Johnson and Evans (2003). We compare inequalities generated by this procedure with mixed-integer rounding (MIR) based inequalities discussed in Dash and Gunluk (2003). We first analyze and extend the shooting experiment described in Gomory, Johnson and Evans. We show that MIR based inequalities dominate inequalities generated by the interpolation procedure in some important cases. We also show that the Gomory mixed-integer cut is likely to dominate any inequality generated by the interpolation procedure in a certain probabilistic sense. We also generalize a result of Cornu&#x00e9;jols, Li and Vandenbussche (2003) on comparing the strength of the Gomory mixed-integer cut with related inequalities.
SP2A: Enabling Service-Oriented Grids using a Peer-to-Peer Approach
Authors: Michele Amoretti, Monica Reggiani, Francesco Zanichelli, Gianni Conte
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

With the Service-oriented Peer-to-Peer Architecture (SP^2A), we propose a peer-to-peer based solution for service sharing, discovery and provision in Grid environments. This paper presents an overview of SP^2A, along with the structure of the current prototype and some performance results.
Impact of Singular Point Detection on Fingerprint Matching Performance
Authors: Sharat Chikkerur, Nalini Ratha
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

A majority of the minutiae based fingerprint verification algorithms rely on explicit or implict alignment of the minutiae points for matching the two prints. With no prior knowledge about point correspondences, this becomes a combinatorial problem. Global features of the fingerprints such as the core and delta points represent intrinsic points of reference that can be used to align the two prints and reduce the computational complexity of the matcher. However, automatic extraction of singular points is usually error prone and is therefore not used by existing matchers. But, a systematic study of the impact on matching performance when core/delta points are available has not been done to date. In this paper, we explore the effects of the availability of reliable core and delta points on speed and accuracy of a matching algorithm. Towards this end, we present significant improvements to core and delta point detection algorithm based on complex filtering principles originally proposed by Nilsson et al. [9]. We also present a modifiedgraph based matching algorithm that can run in O(n) time when the reference points are available. We analyse the resulting improvement in computational complexity and present experimental evaluation over FVC2002 database. We show that there is upto 43% improvement (70.2ms to 39.8ms) in average verification time and almost no loss in accuracy when reliable core and delta points are used.
Knowledge Discovery Based on Web Robots in Collaborative Design
Authors: Yue-jie Wen, Ling Tian, Bing-shu Tong
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Knowledge discovery is vital to knowledge management, which is an urgent need in collaborative design. Web robots can help to discovery knowledge by acquiring the latest knowledge from the Internet, so that the knowledge base can provide a better service for collaborative design. The mechanism of the web robot in this application is explained with a typical example, and the knowledge extraction algorithm is provided as well. This paper also proposes a new and improved technology based on XML to make the web robots work more efficiently. A web-based prototype system has been developed, and significantly improved the performance of knowledge service.
MediaMill: exploring news video archives based on learned semantics
Authors: Cees G. M. Snoek, Marcel Worring, Jan van Gemert, Jan-Mark Geusebroek, Dennis Koelma, Giang P. Nguyen, Ork de Rooij, Frank Seinstra
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this technical demonstration we showcase the MediaMill system. A search engine that facilitates access to news video archives at a semantic level. The core of the system is an unprecedented lexicon of 100 automatically detected semantic concepts. Based on this lexicon we demonstrate how users can obtain highly relevant retrieval results using query-by-concept. In addition, we show how the lexicon of concepts can be exploited for novel applications using advanced semantic visualizations. Several aspects of the MediaMill system are evaluated as part of our TRECVID 2005 efforts.
Interaction of overlay networks: properties and implications
Authors: Wenjie Jiang, John C. S. Lui, Dah-Ming Chiu
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Although the concept of application layer overlay routing has received much attention lately, there has been little focus on the "coexistence" and "interaction" of overlays on top of the same physical network. In this paper, we show that when each overlay plays the optimal routing strategy so as to optimize its own performance, there exists an equilibrium point for the overall routing strategy. However, the equilibrium may be inefficient: (a) it may not be Pareto optimal, (b) some fairness anomalies of resource allocation may occur. This is worthy of attention since overlays can be easily deployed and overlays may not know the existence of each other, they may continue to operate at a sub-optimal point.
Resource control for large-scale distributed simulation system over loosely coupled domains
Authors: Azzedine Boukerche, Armin Mikkler, Alessandro Fabri
Venue: Journal of Parallel and Distributed Computing (2005)

Collaborative and distributed simulation environments that span across large interconnection networks, such as the Internet, are a promising way of supporting applications distributed over multiple computing sites. How-ever, communication-intensive distributed applications may suffer from variable communication delays, jitter, and latency experienced over the network. We term a loosely coupled domain the combination of multiple sites connected through an internetwork. In this paper, we focus on large-scale distributed simulations based upon local time warp deployed over several sites connected through an interconnection network (a loosely coupled domain). We propose and study a mechanism to tune elaboration according to varying communication performances, to reduce resource consumption and rollback costs that result from unpredictable network behavior. The mechanism is composed of two parts that operate in a completely distributed way: a local elaboration rate control and a message flow control. The experimental study is conducted through emulation to exert a control on injected delays. Our results show that the mechanism is able to globally tune the entire simulation, so as to reduce the escalation of allocated computational resources and the cost of rollbacks. As delays disappear, the mechanism allows elaboration to resume normal rate.
Content Mismanagement Systems
Authors: Warren Harrison
Venue: IEEE Software (2006)

Today's content management systems produce Web pages on the fly that look just like ones handcrafted by humans. However, many CMSs' URLs are extremely long and undiscipherable, so you might not be able to tell what's on that page by just looking at the URL. While those systems' designers seem to know little about how users will use that content, other CMSs are more user-friendly. This essay explores differing CMS requirements and goals.
Agent-Based Computational Economics: Growing Economies From the Bottom Up
Authors: Leigh Tesfatsion
Venue: Artificial Life (2002)

Agent-based computational economics (ACE) is the computational study of economies modeled as evolving systems of autonomous interacting agents. Thus, ACE is a specialization of economics of the basic complex adaptive systems paradigm. This study outlines the main objectives and defining characteristics of the ACE methodology and discusses similarities and distinctions between ACE and artificial life research. Eight ACE research areas are identified, and a number of publications in each area are highlighted for concrete illustration. Open questions and directions for future ACE research are also considered. The study concludes with a discussion of the potential benefits associated with ACE modeling, as well as some potential difficulties.
Frugal linear network-based test decompression for drastic test cost reductions
Authors: Wenjing Rao, A. Orailoglu, G. Su
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

In This work we investigate an effective approach to construct a linear decompression network in the multiple scan chain architecture. A minimal pin architecture, complemented by negligible hardware overhead, is constructed by mathematically analysing test data relationships, delivering in turn drastic test reductions. The proposed network drives a large number of internal scan chains with a short input vector, thus allowing significant reductions in both test time and test volume. The proposed method constructs an inverter-interconnect based network by exploring the pairwise linear dependencies of the internal scan chain vectors, resulting in a very low cost network that is nonetheless capable of outperforming much costlier compression schemes. We propose an iterative algorithm to construct the network from an initial set of test cubes. The experimental data shows significant reductions in test time and test volume with no loss of fault coverage.
A Semi-Supervised Learning Method for Remote Sensing Data Mining
Authors: Ranga Raju Vatsavai, Shashi Shekhar, Thomas E. Burk
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

New approaches are needed to extract useful patterns from increasingly large multi-spectral remote sensing image databases in order to understand global climatic changes, vegetation dynamics, ocean processes, etc. Supervised learning, which is often used in land cover (thematic) classification of remote sensing imagery, requires large amounts of accurate training data. However, in many situations it is very difficult to collect labels for all training samples. In this paper we explore methods that utilize unlabeled samples in supervised learning for thematic information extraction from remote sensing imagery. Our objectives are to understand the impact of parameter estimation with small learning samples on classification accuracy, and to augment the parameter estimation with unlabeled training samples to improve land cover predictions. We have developed a semi-supervised learning method based on the Expectation-Maximization (EM) algorithm, and maximum likelihood and maximum a posteriori classifiers. This scheme utilizes a small set of labeled and a large number of unlabeled training samples. We have conducted several experiments on multi-spectral images to understand the impact of unlabeled samples on the classification performance. Our study shows that though in general classification accuracy improves with the addition of unlabeled training samples, it is not guaranteed to get consistently higher accuracies unless sufficient care is exercised when designing a semi-supervised classifier.
Nonparametric selection procedures applied to state traffic fatality rates
Authors: Gary C. McDonald
Venue: ACM SIGSIM Simulation Digest (1978)

This article reviews the practical aspects of several nonparametric subset selection rules useful in block design problems, and discusses advantages and disadvantages of these methods. The populations are assumed stochastically ordered by the parameter of interest. Rules based on ranked observations are given for selecting a subset of populations which contains, with a specified confidence level, the population characterized by the smallest (or largest) parameter value. These procedures are applied to state traffic fatality rates recorded yearly (1960-76). New England states and Middle Atlantic states comprise most of the subset asserted, with a 90% confidence level, to contain the state with the smallest fatality rate; whereas, Southern states, Southwestern states and Rocky Mountain states generally comprise the subset for the state with the largest fatality rate. Note that while this example is not based on simulation data, such data would be analyzed in exactly the same fashion.
Adhesion study of tetra methyl cyclo tetra siloxanes (TMCTS) and tri methyl silane (3MS)-based low-k films
Authors: J. Widodo, M. Damayanti, S. G. Mhaisalkar, W. Lu, S. Ong, T. Sritharan, K. Y. Zeng, L. C. Hsia
Venue: Microelectronic Engineering (2005)

Chemical vapor deposited (CVD) low-k films using tri methyl silane (3MS) precursors and tetra methyl cyclo tetra siloxanes (TMCTS) precursors were studied. Films were deposited by means of four processes, namely, O"2, O"2+He process and CO"2, CO"2+O"2 process for 3MS and TMCTS precursors, respectively. Interfacial adhesion energy (G"c), of low-k/Si samples, as measured by a 4-point bending test displayed a linear relationship with film hardness and modulus. Fractography studies indicated two possible failure modes with the primary interface of delamination being either at low-k/Si or Si/epoxy interface. In the former, once delamination initiated at the low-k/Si interface, secondary delamination at the Si/epoxy and epoxy/low-k interfaces was also observed. Films with low hardness (5 GPa) displayed interfacial energies in excess of 10 J/m^2 with separation of Si/epoxy and epoxy/low-k interfaces, thus indicating excellent adhesion between the Si and low-k films. Films with high hardness have less carbon in the system causing it to be more ''silicon dioxide'' like and exhibiting better adhesion with the Si substrate.
Sensitivity of predictive scheduling
Authors: Ka-Lai Leung, Roger C. Wood, Willy Wai-Yee Chiu
Venue: ACM SIGSIM Simulation Digest (1975)

A popular CPU (Central Processing Unit) scheduling strategy is to give high priority to those jobs with short CPU service times. There are several algorithms for predicting which jobs among all the resident jobs have short service times. No scheme, however, has proved to be 100% accurate in identifying the short jobs. This paper, utilizing results from both simulation and mathematical models, studies the sensitivity of CPU utilization to the accuracy of the predictive algorithm.
Evolutionary fabrication: the emergence of novel assembly methods in artificial ontogenies
Authors: John Rieffel, Jordan Pollack
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Evolutionary Design Systems (EDSs) have demonstrated the ability to generate a wide array of novel objects, including robots, tables, and antennas. Often, the novelty of these evolved designs is due to their ability to discover and exploit important principles of the design space, such as the truss and the ratchet. One current obstacle to the real-world application of such EDSs is that they often create purely descriptive representations, and are therefore capable of generating designs whose specific assembly is difficult, if not impossible, to infer. One solution that we offer is to evolve how to build, rather than what to build. When evolution occurs in assembly space rather than design space, only buildable objects are produced. Furthermore, as we demonstrate in this paper, doing so allows for the emergence not just of novel designs, but of novel means of assembly.
An intrusive evaluation of peripheral display
Authors: Xiaobin Shen, Andrew Vande Moere, Peter Eades
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present an intrusive evaluation of three different peripheral display systems on the same financial data set. Our results indicate there is a significant difference on a primary task performance and a peripheral comprehension task between large and small displays. Furthermore, we have found that distraction may be composed by display-distraction and self-interruption, and that animation may only influence the display-distraction. In addition, this paper proposes a measurement of efficiency derived from cognitive science. Finally, we propose three guidelines for peripheral display design.
Productivity in the Internet mailing lists: A bibliometric analysis
Authors: Victor Kuperman
Venue: Journal of the American Society for Information Science and Technology (2006)

The author examines patterns of productivity in the Internet mailing lists, also known as discussion lists or discussion groups. Datasets have been collected from electronic archives of two Internet mailing lists, the LINGUIST and the History of the English Language. Theoretical models widely used in informetric research have been applied to fit the distribution of posted messages over the population of authors. The Generalized Inverse Poisson-Gaussian and Poisson-lognormal distributions show excellent results in both datasets, while Lotka and Yule&ndash;Simon distribution demonstrate poor-to-mediocre fits. In the mailing list where moderation and quality control are enforced to a higher degree, i.e., the LINGUIST, Lotka, and Yule&ndash;Simon distributions perform better. The findings can be plausibly explained by the lesser applicability of the success-breeds-success model to the information production in the electronic communication media, such as Internet mailing lists, where selectivity of publications is marginal or nonexistent. The hypothesis is preliminary, and needs to be validated against the larger variety of datasets. Characteristics of the quality control, competitiveness, and the reward structure in Internet mailing lists as compared to professional scholarly journals are discussed. &copy; 2006 Wiley Periodicals, Inc.
Complexification and cohomology in real algebraic geometry
Authors: Stanislaw Dolega
Venue:  (2005)

Let X be a compact nonsingular real algebraic variety and let (V, j) be a nonsingular projective complexification of X. We discuss the subgroups j*( H*(V; Z )) of the cohomology ring H*(X; Z ) and conclude that the subgroup H*(X; Z )&lowast; = j*(H*( V; Z )) does not depend on the choice of the complexification. We also answer the question whether H*(&minus;, Z )&lowast; is functorial and give a nontrivial example of the subgroup H*(X; Z )&lowast; when X is an abelian variety. We define the subgroups H*C-alg X;Z &mdash;of algebraic cohomology classes and H*( X; Z )inv&mdash;cohomology classes invariant with respect to a homomorphism induced by a translation in X (only when X is an abelian variety) and examine the relation between them. We define KC-alg (X) and KC (X)inv&mdash;the objects equivalent to H*C-alg (X; Z ) and H*(X; Z )inv in K-theory and find the condition sufficient for the equality KC-alg (X) = KC (X)inv.