ppxscal/embedding_network huggingface dataset:
Optimal Component Stocking Policy for Assemble-to-Order Systems with Lead-Time-Dependent Component and Product Pricing
Authors: Vernon Ning Hsu, Chung Yee Lee, Kut C. So
Venue: Management Science (2006)

Short delivery time and the efficient management of component inventories are two crucial elements that determine the competitiveness of many contract assembly manufacturers, especially in the electronics industry. In this paper, we develop and analyze an optimization model to determine the optimal stocking quantities for components of an assemble-to-order product in an environment where demand is uncertain and the price for the final product and the costs of components depend on their delivery lead times. We provide an efficient solution procedure to solve the problem in which the manufacturer must deliver the full order quantity possibly in multiple shipments. We further extend our model to the situation where the manufacturer has the option of not delivering the full quantity but instead takes the penalty for a delivery shortage. We derive some analytical results that illustrate how different model parameters affect the optimal solution and provide useful insights for managing components in the assemble-to-order environment.
A drift-kinetic semi-Lagrangian 4D code for ion turbulence simulation
Authors: V. Grandgirard, M. Brunetti, P. Bertrand, N. Besse, X. Garbet, P. Ghendrih, G. Manfredi, Y. Sarazin, O. Sauter, E. Sonnendrücker, J. Vaclavik, L. Villard
Venue: Journal of Computational Physics (2006)

A new code is presented here, named Gyrokinetic SEmi-LAgragian (GYSELA) code, which solves 4D drift-kinetic equations for ion temperature gradient driven turbulence in a cylinder (r,θ,z). The code validation is performed with the slab ITG mode that only depends on the parallel velocity. This code uses a semi-Lagrangian numerical scheme, which exhibits good properties of energy conservation in non-linear regime as well as an accurate description of fine spatial scales. The code has been validated in the linear and non-linear regimes. The GYSELA code is found to be stable over long simulation times (more than 20 times the linear growth rate of the most unstable mode), including for cases with a high resolution mesh (δr ∼ 0.1 Larmor radius, δz ∼ 10 Larmor radius).
Quantitative evaluation of a wavelet-based method in ventricular late potential detection
Authors: Ali Shahidi Zandi, Mohammad Hassan Moradi
Venue: Pattern Recognition (2006)

Ventricular late potentials (VLPs) are low-amplitude, high-frequency waveforms appearing in the terminal part of the QRS complex in electrocardiogram (ECG) of patients who are susceptible to ventricular tachycardia and sudden cardiac death, after surviving myocardial infarction. Accordingly, VLP detection presents a prominent non-invasive marker for some cardiac diseases clinically. This paper proposes a VLP detection method based on the wavelet transform and investigates its performance. In this method, a modified vector magnitude waveform is formed using discrete wavelet transform for each high-resolution ECG (HRECG) record; then, by applying the continuous wavelet transform to the QRS complex end part in this waveform, a feature vector is extracted from the resultant time-scale plot. This wavelet-based feature vector is processed by principle component analysis to reduce its dimensionality. Finally, a supervised feedforward artificial neural network, trained by a proper set of these feature vectors, is employed as a classifier. To evaluate the proposed method performance, a HRECG database consisting of the real VLP-negative and simulated VLP-positive patterns is used. In a comparative approach, different VLP detection techniques including the conventional time-domain method, developed by Simson, and some methods utilizing distinct diagnostic features are also applied to this database to investigate the capability of the proposed method in VLP analysis more completely. The results show the proposed method, employing the wavelet transform in both pre-processing and feature extraction stages, reveals high evaluation criteria (accuracy, sensitivity, and specificity) and is qualified to detect VLPs.
Design Patterns C#
Authors: Steven John Metsker
Venue:  (2004)

Steven John Metsker explains how to use C# as an object-oriented language, using design patterns to create clean code while taking advantage of the extensive Microsoft(R) .NET Framework Class Libraries.For all 23 classic "Gang of Four" design patterns, Metsker offers detailed code examples utilizing C# and the .NET Framework--as well as programming exercises crafted to help you rapidly build expertise. His exercises and explanations make extensive use of the Unified Modeling Language, helping you build your skills in this standard notation.Design patterns covered include: Interfaces: Adapter, Facade, Composite, and Bridge Responsibility: Singleton, Observer, Mediator, Proxy, Chain of Responsibility, and Flyweight Construction: Builder, Factory Method, Abstract Factory, Prototype, and Memento Extensions: Decorator, Iterator, and VisitorIf you've already used design patterns in other languages, Design Patterns in C# will deepen your understanding, build your confidence, and help you apply them to any C# project. If you're a Microsoft programmer who's new to design patterns, this book will be an ideal practical introduction.www.awprofessional.com/patterns/
Reducing TCB complexity for security-sensitive applications: three case studies
Authors: Lenin Singaravelu, Calton Pu, Hermann Härtig, Christian Helmuth
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

The large size and high complexity of security-sensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to alleviate this problem is to extract the security-sensitive parts of application and systems software, thereby reducing the size and complexity of software that needs to be trusted. At the system software level, we use the Nizza architecture which relies on a kernelized trusted computing base (TCB) and on the reuse of legacy code using trusted wrappers to minimize the size of the TCB. At the application level, we extract the security-sensitive portions of an already existing application into an AppCore. The AppCore is executed as a trusted process in the Nizza architecture while the rest of the application executes on a virtualized, untrusted legacy operating system. In three case studies of real-world applications (e-commerce transaction client, VPN gateway and digital signatures in an e-mail client), we achieved a considerable reduction in code size and complexity. In contrast to the few hundred thousand lines of current application software code running on millions of lines of systems software code, we have AppCores with tens of thousands of lines of code running on a hundred thousand lines of systems software code. We also show the performance penalty of AppCores to be modest (a few percent) compared to current software.
Easy Computer Basics (Easy)
Authors: Michael Miller
Venue:  (2005)

Your new PC just arrived. You open the box, excited to hook it up, start surfing the web, send e-mails...and then you see all of the cords, CD-ROMs and parts that need to be connected and installed, and suddenly it doesn't seem like so much fun anymore. The instructions look even more intimidating. Don't panic! Easy Computer Basics can help. This up-to-date, full-color, highly visual guide will walk you through the entire set-up process and then show you how to use the different programs to accomplish common tasks. You'll learn how to: Use Microsoft Windows, Works and Word Connect to the Internet Surf the web Read and write e-mail View and edit digital pictures Download and listen to digital music Add new devices, such as printers and hard drives Perform basic maintenance and security tasksHaving a computer is supposed to be fun, so don't let its size or complexity take the fun out of your experience. Make your PC work for you with Easy Computer Basics. 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
The misbehavior of value and the discipline of the will
Authors: Peter Dayan, Yael Niv, Ben Seymour, Nathaniel D. Daw
Venue: Neural Networks (2006)

Most reinforcement learning models of animal conditioning operate under the convenient, though fictive, assumption that Pavlovian conditioning concerns prediction learning whereas instrumental conditioning concerns action learning. However, it is only through Pavlovian responses that Pavlovian prediction learning is evident, and these responses can act against the instrumental interests of the subjects. This can be seen in both experimental and natural circumstances. In this paper we study the consequences of importing this competition into a reinforcement learning context, and demonstrate the resulting effects in an omission schedule and a maze navigation task. The misbehavior created by Pavlovian values can be quite debilitating; we discuss how it may be disciplined.
Knowledge glyphs as a tactic for multi-planar visualization of simulation products
Authors: Gina Thomas-Meyers, Randall Whitaker
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Commanders' Predictive Environment (CPE) is a multi-year program that has been undertaken by the Air Force Research Laboratory to develop ways to allow commanders to better anticipate and predict the outcomes of actions of both allied and opponent forces. One objective of this program is to use intuitive and innovative visualization techniques to present known and alternative courses of action within the command center. One such technique currently under development is termed knowledge glyphs. This paper explains and defines knowledge glyphs and presents initial examples of their use. The current model for knowledge glyphs was developed with the objectives that it be internally coherent, referentially comprehensive, and explicitly linked to the visual interface elements that are most critical to commanders when selecting courses of action.
Simulation study of dissimilarity between point process
Authors: Avner Bar-Hen, Nicolas Picard
Venue: Computational Statistics (2006)

The spatial distributions of two species of tree result in a bivariate pattern. This pattern characterizes biological mechanism involved within a forest with the spatial localization of the trees. If we consider simultaneously two species, the main question is not to describe the marginal distribution of each species but to describe the relationship between the repartitions of the two species under study. The relationship between two clouds of points can be described in various ways and therefore many indices can be defined. Each index will give a specific information about these relationships and will greatly depends on the ecological mechanisms, i.e., the point process that leads to the observed repartition. The aim of this article is to review the leading indices in ecology and to provide guidelines for practical use. To mimic ecological situations, we simulated 13 point process that can model classical relationships between two species of trees and compute nine classical indices. The interest of the various indices are discussed. A R package for simulating the point process and to compute the indices is available on request. The package is available upon request at picard@cirad.fr or avner@inapg.fr
Efficient computation of adaptive threshold surfaces for image binarization
Authors: Ilya Blayvas, Alfred Bruckstein, Ron Kimmel
Venue: Pattern Recognition (2006)

The problem of binarization of gray level images, acquired under non-uniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive threshold surface, determined by interpolation of the image gray levels at points where the image gradient is high. The rationale is that high image gradient indicates probable object edges, and there the image values are between the object and the background gray levels. The threshold surface was determined by successive over-relaxation as the solution of the Laplace equation. This work proposes a different method to determine an adaptive threshold surface. In this new method, inspired by multiresolution approximation, the threshold surface is constructed with considerably lower computational complexity and is smooth, yielding faster image binarizations and often better noise robustness.
Alice: An information-rich autonomous vehicle for high-speed desert navigation: Field Reports
Authors: Lars B. Cremean, Tully B. Foote, Jeremy H. Gillula, George H. Hines, Dmitriy Kogan, Kristopher L. Kriechbaum, Jeffrey C. Lamb, Jeremy Leibs, Laura Lindzey, Christopher E. Rasmussen, Alexander D. Stewart, Joel W. Burdick, Richard M. Murray
Venue: Journal of Robotic Systems (2006)

This paper describes the implementation and testing of Alice, the California Institute of Technology's entry in the 2005 DARPA Grand Challenge. Alice utilizes a highly networked control system architecture to provide high performance autonomous driving in unknown environments. Innovations include a vehicle architecture designed for efficient testing in harsh environments, a highly sensory-driven approach to fuse sensor data into speed maps used by real-time trajectory optimization algorithms, health and contingency management algorithms to manage failures at the component and system level, and a software logging and display environment that enables rapid assessment of performance during testing. The system successfully completed several runs in the National Qualifying Event, but encountered a combination of sensing and control issues in the Grand Challenge Event that led to a critical failure after traversing approximately 8 miles. &copy; 2006 Wiley Periodicals, Inc.
Microsoft SQL Server to IBM DB2 Udb Conversion Guide (IBM Redbooks)
Authors: Whei-Jen Chen
Venue:  (2005)

DB2 Universal Database (DB2 UDB) has long been known for its technology leadership. This IBM Redbook is an informative guide that describes how to convert the database system and applications from Microsoft SQL Server to DB2 UDB Version 8.2. This guide presents the best practices in conversion strategy and planning, an architecture overview of the two relational database systems, migration tools, and practical conversion examples. It is intended for technical staff involved in a SQL Server to DB2 UDB conversion project. We discuss, in detail, the conversion of database structure, data, and database objects including stored procedures, triggers, and user defined functions. We address SQL and application conversion considerations. Examples are used throughout the book to illustrate the conversion and to provide solutions and work-arounds for different scenarios. In addition, we provide a DB2 tools and wizard usage overview, performance considerations, and testing and troubleshooting techniques. Finally, a migration scenario using the IBM DB2 Migration Toolkit is included to show the complete migration process. 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
An effective proof of the well-foundedness of the multiset path ordering
Authors: Solange Coupet-Grimal, William Delobel
Venue: Applicable Algebra in Engineering, Communication and Computing (2006)

The main contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. It is a sequence of nested inductions and it only relies on the fact that the multiset order, restricted to a well-founded part of the base set, is well-founded. In particular, it does not require to establish preliminarily the transitivity of the relation, although we prove it as an additional property. The terms we consider are not supposed to be ground nor the signature to be finite. All the proofs have been carried out in the Coq proof-assistant.
An investigation of the modified direction feature for cursive character recognition
Authors: Michael Blumenstein, Xin Yu Liu, Brijesh Verma
Venue: Pattern Recognition (2007)

This paper describes and analyses the performance of a novel feature extraction technique for the recognition of segmented/cursive characters that may be used in the context of a segmentation-based handwritten word recognition system. The modified direction feature (MDF) extraction technique builds upon the direction feature (DF) technique proposed previously that extracts direction information from the structure of character contours. This principal was extended so that the direction information is integrated with a technique for detecting transitions between background and foreground pixels in the character image. In order to improve on the DF extraction technique, a number of modifications were undertaken. With a view to describe the character contour more effectively, a re-design of the direction number determination technique was performed. Also, an additional global feature was introduced to improve the recognition accuracy for those characters that were most frequently confused with patterns of similar appearance. MDF was tested using a neural network-based classifier and compared to the DF and transition feature (TF) extraction techniques. MDF outperformed both DF and TF techniques using a benchmark dataset and compared favourably with the top results in the literature. A recognition accuracy of above 89% is reported on characters from the CEDAR dataset.
Subspace distance analysis with application to adaptive Bayesian algorithm for face recognition
Authors: Liwei Wang, Xiao Wang, Jufu Feng
Venue: Pattern Recognition (2006)

We propose subspace distance measures to analyze the similarity between intrapersonal face subspaces, which characterize the variations between face images of the same individual. We call the conventional intrapersonal subspace average intrapersonal subspace (AIS) because the image differences often come from a large number of persons. An intrapersonal subspace is referred to as specific intrapersonal subspace (SIS) if the image differences are from just one person. We demonstrate that SIS varies significantly from person to person, and most SISs are not similar to AIS. Based on these observations, we introduce the maximum a posteriori (MAP) adaptation to the problem of SIS estimation, and apply it to the Bayesian face recognition algorithm. Experimental results show that the adaptive Bayesian algorithm outperforms the non-adaptive Bayesian algorithm as well as Eigenface and Fisherface methods if a small number of adaptation images are available.
Motion-Based Boundary Tracking of Moving Object Using Parametric Active Contour Model
Authors: Boo Hwan Lee, Il Choi, Gi Joon Jeon
Venue: IEICE - Transactions on Information and Systems (2007)

This paper presents a motion-based boundary tracking method for a moving deformable object in an image sequence using a parametric active contour model. Deciding the local converging directions of the contour points is essential for correctly extracting the boundary of a moving deformable object. Thus, a new energy function for a parametric active contour model is proposed based on the addition of a directional energy term using a frame difference map to the greedy snake. The frame difference map is used to obtain motion information on an object with fast and non-rigid motion. Plus, updating rules for the frame difference map are also developed to encourage the stable convergence of the contour points. Experiments on a set of synthetic and real image sequences show that the proposed method could fully track a speedy deformable object while exactly extracting the boundary of the object in every frame.
Interactive deformable geometry maps: Efficient modeling for interactive deformation of non-rigid 3D objects
Authors: Qiang Liu, Edmond C. Prakash, Mandayam A. Srinivasan
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

Haptics on 3D deformable models is a challenge because of the inevitable and expensive 3D deformation computation. In this paper, we propose a new technique that extends the conventional rigid geometry images approach proposed by Gu et al. [9]. Our approach not only flattens the geometry, but also helps to accomplish deformation in an effective and efficient manner. Our approach is suitable for haptics computing, as it performs the deformation on the geometry map itself thereby avoiding the expensive 3D deformation computation. We demonstrate construction of the deformable geometry map representation and its application utilizing practical methods for interactive surgery simulation and interactive textile simulation.
The Imagination Challenge: Strategic Foresight and Innovation in the Global Economy (VOICES)
Authors: Alexander Manu
Venue:  (2006)

Companies constantly present technological developments-new materials, new mechanisms, and new ways to enhance existing products and services. Yet these seldom lead to truly new ideas. Why? Humans are all born with creative instincts, but in the interest of efficient and predictable productivity, institutions such as schools and businesses routinely hinder those impulses. The most innovative products and services, author Alexander Manu argues, arise out of the behaviors of play--the ability to imagine, without limits, the question "What if...?" Manu's engaging and inspiring book offers companies a wealth of practical advice and tactics to unleash their full creative potential and break ahead of the crowd. Manu's provocative, insightful applied methodologies for creating new business opportunities and transformative innovations gain resonance from real-world scenarios and conversations with leading innovators such as MIT's Mitchel Resnick. Readers will learn strategies to: ï¾ Open their companies' eyes to unseen opportunities ï¾ Spark the imagination and trigger the potential of product innovation teams ï¾ Turn inspired ideas into successful products and services. 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
Codin' for the Web: A Designer's Guide to Developing Dynamic Web Sites
Authors: Charles Wyke-Smith
Venue:  (2006)

EVEN THE MOST SKILLED WEB DESIGNERS can find the complexities of creating a full-functioned Web site to be a daunting task. Here to help designers create sites that not only work, but work well and are easy to update and maintain is an easy-to-read guide to Web programming basics from best-selling author Charles Wyke-Smith. Just as architects need to understand building materials and their properties, Web designers need to understand the code that serves as the foundation of their sites. Wyke-Smith ensures they do by teaching designers that all dynamic Web sites consist of essentially three components: a browser interface, Web server middleware, and a database. The guide covers everything from Web coding concepts and principles to building sites, designing visual interfaces, developing databases, developing middleware, ensuring a good user experience (through good code!), testing and debugging, and more. Create dynamic Web sites that provide real-time responses to user inputs Understand the basic structures of all coding languages, such as variables, functions, conditionals, loops, and objects Use the power of PHP to program the business rules of your site Learn techniques for validating forms to reject erroneous or malicious data Import and export data from other applications via at les Build and query database tables using SQL to manage the data generated by your site's activity Develop a simple content management system Develop a password-protected members-only area of your Web site Build a template-based Web site with dynamic navigation