ppxscal/embedding_network huggingface dataset:
Projection Displays, 2nd edition
Authors: Matthew S. Brennesholtz, Edward H. Stupp
Venue: Wiley Series In Display Technology (2008)

Projection is a technology for generating large, high resolution images at a price point end users can afford. This allows it to be used in a wide variety of large-screen markets such as television and cinema. In addition, there are emerging small screen markets where a pocketable miniaturized projector can display images from mobile information devices such as smart phones or portable media players.Fully revised, this second edition of [start italics]Projection Displays[end italics] provides up-to-date coverage of the optical and mechanical systems in electronic projection displays. It takes into account major new developments in the many technologies needed to manufacture a projector display system. It presents a comprehensive review of projector architectures, systems, components and devices. Key new and updated features include: new material on light sources for projection displays; updated information on the human factors of projection displays including color gamuts, resolution and speckle; coverage of new image generating systems including LCOS and scanned laser systems; up to date information on front and rear projection screens; practical examples of projection display applications; models for predicting the performance of optical and mechanical systems This book is aimed at practicing engineers and researchers involved in the research, development, design and manufacture of projection displays. It includes key aspects from the many technologies contributing to projection systems such as illumination sources, optical design, electronics, semiconductor design, microdisplay systems and mechanical engineering. The book will also be of interest to graduate students taking courses in display technology and imaging science, as well as students of the many other engineering, physics and optics disciplines that lead into the field of projection displays.
Determining an appropriate number of foups in semiconductor wafer fabrication facilities
Authors: Jens Zimmermann, Lars Mönch, Scott J. Mason, John W. Fowler
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, multiple orders per job type formation and release strategies are described for semiconductor wafer fabrication facilities (wafer fabs). Different orders are grouped into one job because orders of an individual customer very often fill only a portion of a Front-Opening Unified Pod (FOUP). A FOUP is assigned to each job and is used to move the job throughout the wafer fab after the job formation. We determine an appropriate number of FOUPs for a given order release rate that will yield acceptable values for on-time delivery performance, cycle time, and throughput via discrete event simulation.
Conformal equivalence of triangle meshes
Authors: Boris Springborn, Peter Schröder, Ulrich Pinkall
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of discrete conformal equivalence for triangle meshes which mimics the notion of conformal equivalence for smooth surfaces. The problem of finding a flat mesh that is discretely conformally equivalent to a given mesh can be solved efficiently by minimizing a convex energy function, whose Hessian turns out to be the well known cot-Laplace operator. This method can also be used to map a surface mesh to a parameter domain which is flat except for isolated cone singularities, and we show how these can be placed automatically in order to reduce the distortion of the parameterization. We present the salient features of the theory and elaborate the algorithms with a number of examples.
Visual navigation: image profiles for odometry and control
Authors: Devin Smith, Zachary Dodds
Venue: Journal of Computing Sciences in Colleges (2009)

This paper investigates the extent to which image profiles, pixel-intensity sums across subsets of a video stream, offer a basis for autonomous robotics. Building on previous work that uses image profiles for odometry, we introduce an improved algorithm for odometric estimation based on visual input alone. In addition, we extend prior results by showing how image profiles can support control and exploration tasks. We validate these new approaches through results implemented atop a low-cost vision-only vehicle consisting of a laptop and an iRobot Create.
Extracting Dependency Trees from Sanskrit Texts
Authors: Oliver Hellwig
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

In this paper, I describe a hybrid dependency tree parser for Sanskrit sentences improving on a purely lexical parsing approach through simple syntactic rules and grammatical information. The performance of the parser is demonstrated on a group of sentences from epic literature.
European internet early warning system
Authors: Malte Hesse, Norbert Pohlmann
Venue: International Journal of Electronic Security and Digital Forensics (2009)

The internet is consisting of autonomous systems each managed by individual and mostly rival organisations. This situation makes it very difficult to capture the state of the internet as a whole. An individual internet situation awareness for various stakeholders can be accomplished by creating a common basis for private and public operators to monitor their networks, by offering them a common smart approach to monitor their network individually and the additional benefit of participating to establish a global view, which they can use as a reference for their local situation. This smart approach should utilise well-proven existing global statistics, best practices and existing technical sensors, which can be adapted to the overall common framework. From this, output for all relevant stakeholders can be generated to fulfil the individual needs. Once the internet situation awareness is accomplished, it can be used besides others for an European internet early warning system.
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
Authors: Shigeaki Kuzuoka, Tomohiko Uyematsu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.
Impasse-Driven Learning in the Context of Video Games in Chinese Players
Authors: Xuemin Zhang, Xin Luo, Fran C. Blumberg, Zijiao Shen, Chunhui Su
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This study was designed to elucidate the problem-solving skills used by frequent and infrequent Chinese video game players to negotiate impasses encountered while playing video game. All participants were instructed to think aloud while playing a video game for 20 consecutive minutes. Comments were made with thinking aloud. Findings showed that frequent players made significantly greater reference to insight and game strategies than infrequent players. After reaching an impasse, all players also were most likely to comment on their game progress and potential game strategies to use. Over the course of game play, there are some cross cultural differences were founded.
On the transitivity of a parametric family of cardinality-based similarity measures
Authors: B. De Baets, S. Janssens, H. De Meyer
Venue: International Journal of Approximate Reasoning (2009)

We introduce a parametric family of cardinality-based similarity measures for ordinary sets (on a finite universe) harbouring numerous well-known similarity measures. We characterize the Lukasiewicz-transitive and product-transitive members of this family. Their importance derives from their one-to-one correspondence with pseudo-metrics. Fuzzification schemes based on a commutative quasi-copula are then used to transform these similarity measures for ordinary sets into similarity measures for fuzzy sets, rendering them applicable on graded feature set representations of objects. The main result of this paper is that transitivity, and hence also the corresponding dual metric interpretation, is preserved along this fuzzification process.
Research on computer vision-based for UAV autonomous landing on a ship
Authors: Guili Xu, Yong Zhang, Shengyu Ji, Yuehua Cheng, Yupeng Tian
Venue: Pattern Recognition Letters (2009)

In this paper, a novel approach to UAV's automatic landing on the ship's deck is proposed. We present the design of the cooperative object, and then begin our basic research on UAV autonomous landing on a ship by using computer vision and affine moment invariants. We analyze the infrared radiation images in our experiments by extracting the target from the background and then recognizing it. Also, we calculate the angle of yaw. We study the basic research concerning automatic UAV navigation and landing on the deck. Based on our experiments, the average recognition time is 17.2ms which is obtained through the use of affine moment invariants. This type of speed is expected to improve the reliability and real-time performance of autonomous UAV landing.
Proceedings of the May 6-10, 1974, national computer conference and exposition
Venue: AFIPS Joint Computer Conferences (1974)

The 74 NCC has the objective of providing a forum for computer specialists, users, potential users and manufacturers to exchange information on new developments in computer science and technology and their applications in various areas. The Conference Program focuses on five broad computer science and technology areas, and ten applications areas. Science and technology areas cover the latest developments which should enable Users to make more efficient use of their resources in a wide range of areas. The applications areas not only demonstrate how computer technology can indeed be used to improve the efficiency of current operations, but also point out potential usage in many other areas which should generate new demands for further development in computer science and technology. Although each area forms a "conference within a conference," all fifteen areas form a comprehensive and cohesive program, instead of disjointed subprograms 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
Constructing edge-disjoint spanning trees in locally twisted cubes
Authors: Sun-Yuan Hsieh, Chang-Jen Tu
Venue: Theoretical Computer Science (2009)

The use of edge-disjoint spanning trees for data broadcasting and scattering problem in networks provides a number of advantages, including the increase of bandwidth and fault-tolerance. In this paper, we present an algorithm for constructing n edge-disjoint spanning trees in an n-dimensional locally twisted cube. Since the n-dimensional locally twisted cube is regular with the common degree n, the number of constructed trees is optimal.
Parallel Simulation of Oil Reservoirs on a Multi-core Stream Computer
Authors: Fadi N. Sibai, Hashir Karim Kidwai
Venue: Transactions on Computational Science III (2009)

With the oil barrel price presently crippling the world economy, developing fast oil reservoir simulators is as important as ever. This article describes the parallelization and development of a 2-phase oil-water reservoir simulator on the state-of-the-art IBM Cell computer. The interdependent linear algebraic equations of the reservoir simulator is presented as well as the pipelined time step parallelization approach adopted on the Cell, The performance results reveal that given the largely interdependent nature of the oil reservoir model equations which highly limits parallelism, speedups of 6x or higher could be obtained. This speedup is significant as it results in oil simulation runs cut from weeks to days, allowing for more simulation runs with various well placements to run on the same hardware, and resulting in better reservoir management, and possibly higher oil production. The results also demonstrate that the oil reservoir simulator application is characterized by higher speedups with increasing grid size. However the speedup was shown to go down with increased number of time steps as the main memory transfer overhead becomes an important factor. Proper choice of compiler optimization flags helped boost the performance by a factor of 2x. Our parallelization approach is economically feasible due to the affordable cost of the widely available Cell-based Playstation 3.
Output feedback model predictive control for nonlinear systems
Authors: I. I. Siller-Alcalá, J. Jaimes-Ponce, R. Alcántara-Ramírez
Venue: WSEAS Transactions on Systems and Control (2008)

In this paper, an Output Feedback Model Predictive Control for nonlinear systems is presented. The proposed output feedback control consists of the well known robust controller NCGPC (Nonlinear Continuous Time Generalized Predictive Control) and an open loop observer (a simulated model in parallel) in order to estimate the output derivatives and a regulation filter used to account for plant/model mismatch. The main advantages of the new approach are i) that the assumption of full-state feedback inherent in feedback linearization schemes is eliminated, the only measurement required is the output and finally ii) the process output converges to a constant reference in spite of presence of parameter uncertainties and process disturbances. The analysis of the induction motor and simulation results in the numerical example show that the output feedback model predictive control proposed can tolerate certain process uncertainty.
A Seamless Virtualization Approach for Transparent Dynamical Function Mapping Targeting Heterogeneous and Reconfigurable Systems
Authors: Rainer Buchty, David Kramer, Fabian Nowak, Wolfgang Karl
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Future systems are not only heading towards increased parallelism, but also embrace heterogeneity and reconfigurability. We therefore present an approach targeting comfortable program development and execution, enabling full exploitation of the underlying hardware without burdening the application programmer with the details of the underlying hardware infrastructure. The approach employs lightweight resource virtualization by means of on-demand function resolution. By carefully extending the existing system infrastructure, the approach comes at virtually no cost and with highest compatibility to existing legacy code. The approach is suitable for a wide range of architectures from embedded systems to high-performance computing platforms.
A Framework to Collaborative and Incremental Development of Distributed Information Systems
Authors: Mutaleci Miranda, Geraldo Xexeo, Jano Moreira Souza
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In this work, we approach the problem of developing corporate information systems in complex organizations dispersed across large geographical regions. Under these circumstances, management of differences among organizational unit requirements and implementation of new requirements over time may be cumbersome. We present a proposal to handle this problem by combining the use of semi-structured documents as data model, the partitioning of system code in several loosely coupled agents and the use of ontologies to conciliate differences in organizational unit vocabularies. We also describe an implementation of the proposal based on our Coppeer agent platform.
A comparative study of ranking methods, similarity measures and uncertainty measures for interval type-2 fuzzy sets
Authors: Dongrui Wu, Jerry M. Mendel
Venue: Information Sciences: an International Journal (2009)

Ranking methods, similarity measures and uncertainty measures are very important concepts for interval type-2 fuzzy sets (IT2 FSs). So far, there is only one ranking method for such sets, whereas there are many similarity and uncertainty measures. A new ranking method and a new similarity measure for IT2 FSs are proposed in this paper. All these ranking methods, similarity measures and uncertainty measures are compared based on real survey data and then the most suitable ranking method, similarity measure and uncertainty measure that can be used in the computing with words paradigm are suggested. The results are useful in understanding the uncertainties associated with linguistic terms and hence how to use them effectively in survey design and linguistic information processing.
Extracting Motion Annotations from MPEG-2 Compressed Video for HDTV Content Management Applications
Authors: Chitra Dorai, Vikrant Kobla
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Our research concentrates on developing a novel HDTV content management system that enables end users to search, retrieve, and browse archived standard definition (SD) and high definition (HD) television material for program production and content repurposing in a digital television studio. We have developed the first system that automatically analyzes motion occurring in MPEG-2 coded SD and HD videos within the compressed domain itself, and produces descriptors characterizing the global visual motion in videos, for content-based search and retrieval applications. In this paper, we describe our robust and efficient scheme for automatically generating a flow characterization of a video bitstream without decompression, which is a frame-type-independent uniform motion representation amenable for consistent interpretation and computed from the raw motion vectors encoded in the MPEG-2 bitstreams. We propose novel techniques to handle all the different prediction schemes that are employed with different frame types and picture structures of MPEG-2 during the motion compensation process to deal with interlaced and progressive modes. Experiments with thousands of frames from SD and HD video streams demonstrate the accuracy of our flow estimation process and the effectiveness of utilizing flow vectors for annotation of perceived global motion in video streams.
Fast Simplex Optimization for Active Appearance Model
Authors: Yasser Aidarous, Renaud Séguier
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper presents a fast optimization method for active appearance model based on Nelder Mead simplex in the case of mouth alignment under different expressions. This optimization defines a new constraint space. It uses a Gaussian mixture to initialize and constraint the search of an optimal solution. The Gaussian mixture is applied on the dominant eigenvectors representing the reduced data given by Principal Component Analysis. The new algorithm constraints avoid calculating errors of solutions that don't represent researched forms and textures. The constraint operator added to simplex verifies in each iteration that the solution belongs to the space of research. The tests performed in the context of generalization (learning and testing datasets are different) on two datasets show that our method presents a better convergence rate and less computation time compared to the AAM classically optimized.
Testing polymorphism in object oriented systems for improving software quality
Authors: Dinesh Kumar Saini
Venue: ACM SIGSOFT Software Engineering Notes (2009)

With object-oriented approaches, testing should center on objects, classes, generic classes and super classes, inheritance and polymorphism, instead of subprograms. In object-oriented software test, the feature of inheritance and polymorphism produces the new obstacle during dynamic testing. Polymorphism becomes a problem in dealing with object-oriented software testing. In this paper various issues and problems that are associated with testing polymorphic behavior of objects in object oriented systems is discussed. I propose a testers perspective method to assess the polymorphism in design stage. This way it also provides useful information for developer to probe into the fault that is hidden from test in early stage. Thus it will help in improving the quality of object oriented software.
Multi-sensor fusion for human daily activity recognition in robot-assisted living
Authors: Chun Zhu, Weihua Sheng
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

In this paper, we propose a human activity recognition method by fusing the data from two wearable inertial sensors attached to one foot and the waist of a human subject, respectively. Our multi-sensor fusion based method combines neural networks and hidden Markov models (HMMs), and can reduce the computation load. We conducted experiments using a prototype wearable sensor system and the obtained results prove the effectiveness and the accuracy of our algorithm.
Tactful interaction: exploring interactive social touch through a collaborative tangible installation
Authors: Bruno Nadeau, Amanda Williams
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

How do tangible systems take advantage of our sociophysical embodiment in the world? How can we use tangible interaction to better understand collaboration and intersubjectivity? We present Parazoan, an interactive installation where evocative objects collaboratively control a dynamic visual display. Our analysis of interactions with Parazoan explores our questions and discusses implications for our understanding of tangible and virtual collaboration.
Ascending and descending regions of a discrete Morse function
Authors: Gregor Jerše, Neža Mramor Kosta
Venue: Computational Geometry: Theory and Applications (2009)

We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of our algorithm compared to similar existing results is that it works, at least theoretically, in any dimension. Practically, there are dimensional restrictions due to the size of cellular complexes of higher dimensions, though. We prove that the algorithm is correct in the sense that it always produces a decomposition into descending and ascending regions of the critical cells in a finite number of steps, and that, after a finite number of subdivisions, all the regions are topological disks. The efficiency of the algorithm is discussed and its performance on several examples is demonstrated.