ppxscal/embedding_network huggingface dataset:
Simulation analysis of an outpatient department of internal medicine in a university hospital
Authors: A. K. Athula Wijewickrama, Soemon Takakuwa
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Soaring health care costs and greater emphasis on preventative medicine have compelled researchers to examine new ways to reduce costs and improve efficiency in outpatient services. Extended waiting times for treatment in the outpatient department followed by short consultations has long been a complaint of patients. This issue is becoming increasingly important in Japan with its progressively aging society. In this context, a discrete event simulation model was developed to examine doctor schedule mixes (DSMs) and various appointment schedules (ASs) in a mixed-patient type environment in an outpatient department of internal medicine of a university hospital. It could identify some of the best DSMs by integrating a simulation model into an optimization program. Combining one DSM found via an optimization program with some ASs, the patient waiting time could be reduced drastically without adding extra resources.
CNET Do-It-Yourself Digital Home Office Projects, 1 edition
Authors: Sally Slack
Venue:  (2007)

Run a world-class business from home Today's home office is much more than a desk and a computer. In this easy-to-follow guide, you'll find out how to set up a connected, collaborative, portable, and secure digital workspace in your home. Produced in conjunction with CNET.com, the place you go for the latest in tech and consumer electronics, this book explains how to get the most out of the latest wireless and Web-based technologies.Inside, you'll find 24 self-contained projects, step-by-step instructions, a list of tools needed at the beginning of each project, and hundreds of clear photos and screenshots. With CNET Do-It-Yourself Digital Home Office Projects, you'll be able to manage a competitive business from the comfort of your home. Set up a serverConfigure a wireless networkEnable videoconferencingMake free phone calls from your PC Create a commerce websiteEarn advertising income from your blog or websiteProduce podcastsAnd much moreTable of contentsForewordAcknowledgmentsIntroductionPart I: Organize Your WorkspaceProject 1: Set Up a PC Messaging CenterProject 2: Expand Your Desktop with Multiple MonitorsProject 3: Perk Up Your Infrastructure with a WebcamProject 4: Set Up a Docking Station for Your LaptopProject 5: Turn Your Monitor into a TVProject 6: Create an e-Shipping CenterPart II: Take It on the RoadProject 7: Get and Send E-mail AnywhereProject 8: Set Up a Mobile GPSProject 9: Use Office Applications from AnywhereProject 10: Remote Control: Remotely Connect to Your PC or Get HelpPart III: Communicate with Clients and EmployersProject 11: Turn Your PC into a Virtual Conference RoomProject 12: Talk for Free on Your PCProject 13: Create Your Own Wiki Collaborative SpaceProject 14: Set Up a Virtual Private NetworkPart IV: Enhance Your Sales and MarketingProject 15: Earn Advertising Incomes from Your Blog or Web SiteProject 16: Establish an eBay StoreProject 17: Set Up a Commerce Web SiteProject 18: Create a Podcast from Your Home OfficeProject 19: Set Up an RSS Feed for Your Web SitePart V: Work Securely from HomeProject 20: Turn an Old PC into a Network ServerProject 21: Automate Your File BackupsProject 22: Teach Your PC to Recognize Your VoiceProject 23: Set Up a Wireless NetworkProject 24: Secure Your Wireless Network and ComputersIndex 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
A least-squares finite element formulation for unsteady incompressible flows with improved velocity-pressure coupling
Authors: J. P. Pontaza
Venue: Journal of Computational Physics (2006)

In the weak form Galerkin formulation for incompressible flows, the pressure has a well-understood role. At all times, it may be interpreted as a Lagrange multiplier that enforces the divergence-free constraint on the velocity field. This is not the case in least-squares formulations for incompressible flows, where the divergence-free constraint is enforced in a least-squares sense in a variational setting of residual minimization. Thus, the role of the pressure in a least-squares formulation is rather vague. We find that this lack of velocity-pressure coupling in least-squares formulations may induce spurious temporal pressure oscillations when using the non-stationary form of the equations. We present a least-squares formulation with improved velocity-pressure coupling, based on the use of a regularized divergence-free constraint. A first-order system least-squares (FOSLS) approach based on velocity, pressure and vorticity is used to allow the use of practical C0 element expansions in the finite element model. We use high-order spectral element expansions in space and second- and third-order time stepping schemes. Excellent conservation of mass and accuracy of computed pressure metrics are demonstrated in the numerical results.
Chroma Key Using a Checker Pattern Background
Authors: Hiroki Agata, Atsushi Yamashita, Toru Kaneko
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we propose a new region extraction method using chroma key with a two-tone checker pattern background. The method solves the problem in conventional chroma key techniques that foreground objects become transparent if their colors are the same as the background color. The method utilizes the adjacency condition between two-tone regions of the background and the geometrical information of the background grid line. The procedure of the proposed method consists of four steps: 1) background color extraction, 2) background grid line extraction, 3) foreground extraction, and 4) image composition. As to background color extraction, a color space approach is used. As to background grid line extraction, it is difficult to extract background grid line by a color space approach because the color of this region may be a composite of two background colors and different from them. Therefore, the background grid line is extracted from adjacency conditions between two background colors. As to foreground extraction, the boundary between the foreground and the background is detected to recheck the foreground region whose color is same as the background, and the background region whose color is same as the foreground. To detect regions whose colors are same as the background, the adjacency conditions with the background grid line are utilized. As to image composition, the process that smoothes the color of the foreground's boundary against the new background is carried out to create natural images. Experimental results show that the foreground objects can be segmented exactly from the background regardless of the colors of the foreground objects.
SASSY: a design for a scalable agent-based simulation system using a distributed discrete event infrastructure
Authors: Maria Hybinette, Eileen Kraemer, Yin Xiong, Glenn Matthews, Jaim Ahmed
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The PDES literature offers a rich set of techniques for distributed and efficient simulation. However, there is a growing need for simulators that support agent-based applications, and PDES systems are not always well suited for these applications. Example agent-based applications include simulation of biological systems such as ants and bees, multi-robot systems and battlefield simulations. The robotics research community has developed agent-based simulators that provide useful APIs for agent applications. However, such simulators have performance limitations, and they do not scale well. Our approach is to provide middleware between an agent-based API and a PDES simulation kernel. The result is a simulation system that offers an agent-based API for the programmer to a high performance PDES system. Here we describe our design and initial implementation of SASSY, the Scalable Agents Simulation System. We describe our initial implementation and compare the design with related approaches.
Oracle SQL Developer Handbook, 1 edition
Authors: Dan Hotka
Venue:  (2006)

Start-to-finish coverage of Oracle's new free development tool, from Oracle PressHere is the first book to offer concise, practical details for installing, setting up, and effectively using Oracle's new free development tool--Oracle SQL Developer. Featuring a Quick Start section and tips and techniques previously not available in print, this Oracle Press guide will help you effectively enhance productivity and simplify database development tasks.Table of contentsPart I. Getting StartedChapter 1. Product Installation, Upgrades & System Requirements Chapter 2. Getting ConnectedChapter 3. Quick StartPart II. Using SQL DeveloperChapter 4. General Information Chapter 5. Working with the Connections NavigatorChapter 6. Working with SQLChapter 7. Working with PL/SQLChapter 8. Additional TopicsPart III. SQL Developer ReportsChapter 9. Available Reports Chapter 10. User-Defined ReportsAppendix A. Feature, Function, and Keystroke Cross-ReferenceAppendix B. SQL Developer Version 1.1 and BeyondIndex 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
Causality information and fossil collection in timewarp simulations
Authors: Malolan Chetlur, Philip A. Wilsey
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper presents a Time Warp fossil collection mechanism that functions without need for a GVT estimation algorithm. Effectively each Logical Process (LP) collects causality information during normal event execution and then each LP utilizes this information to identify fossils. In this mechanism, LPs use constant size vectors (that are independent of the total number of parallel simulation objects) as timestamps called Plausible Total Clocks to disseminate causality information. For proper operation, this mechanism requires that the communication layer preserves a FIFO ordering on messages. A detailed description of this new fossil collection mechanism and its proof of correctness is presented in this paper.
Automatic recognition of biological particles in microscopic images
Authors: M. Ranzato, P. E. Taylor, J. M. House, R. C. Flagan, Y. LeCun, P. Perona
Venue: Pattern Recognition Letters (2007)

A simple and general-purpose system to recognize biological particles is presented. It is composed of four stages: First (if necessary) promising locations in the image are detected and small regions containing interesting samples are extracted using a feature finder. Second, differential invariants of the brightness are computed at multiple scales of resolution. Third, after point-wise non-linear mappings to a higher dimensional feature space, this information is averaged over the whole region thus producing a vector of features for each sample that is invariant with respect to rotation and translation. Fourth, each sample is classified using a classifier obtained from a mixture-of-Gaussians generative model. This system was developed to classify 12 categories of particles found in human urine; it achieves a 93.2% correct classification rate in this application. It was subsequently trained and tested on a challenging set of images of airborne pollen grains where it achieved an 83% correct classification rate for the three categories found during one month of observation. Pollen classification is challenging even for human experts and this performance is considered good.
Using GOstats to test gene lists for GO term association
Authors: S. Falcon, R. Gentleman
Venue: Bioinformatics (2007)

Motivation: Functional analyses based on the association of Gene Ontology (GO) terms to genes in a selected gene list are useful bioinformatic tools and the GOstats package has been widely used to perform such computations. In this paper we report significant improvements and extensions such as support for conditional testing. Results: We discuss the capabilities of GOstats, a Bioconductor package written in R, that allows users to test GO terms for over or under-representation using either a classical hypergeometric test or a conditional hypergeometric that uses the relationships among GO terms to decorrelate the results. Availability: GOstats is available as an R package from the Bioconductor project: http://bioconductor.org Contact: sfalcon@fhcrc.org
A microprogrammed virtual memory for Eclipse
Authors: Françoise d'Hautcourt-Carette
Venue: ACM SIGMICRO Newsletter (1977)

The Eclipse S-200 is a Data General minicomputer available since 1975. It is a microprogrammed and micro-programmable computer : the user can buy a writable control store (WCS) to define his own specialized instructions.
Migrating from Microsoft Exchange 5.5 to Lotus Notes and Domino 6 (Ibm Redbooks.)
Authors: Tommi Tulisalo
Venue:  (2003)

Benefits of migration Planning and implementing a migration project Coexistence and migration tools This IBM Redbook describes why and how to migrate from Microsoft Exchange 5.5 to IBM Lotus Notes and Domino 6. It begins with a discussion of the reasons an organization using Exchange 5.5 would want to move to Domino 6, and describes the benefits that can be gained. It lays out the different options that the organization has for a future messaging infrastructure and discusses the pros and cons of each alternative. It is particularly suited to business and IT managers. The next part is about planning and managing a migration project. It covers how to assess the current messaging environment, design the migration project and future infrastructure, and successfully implement the migration plan. This part is primarily of interest to project managers and IT architects. The rest of the book deals with the technical aspects of moving to a Lotus Notes and Domino 6 messaging environment. Topics covered are: - Coexistence and migration scenarios - Strategies for coexistence during the project - Installation and setup of coexistence and migration tools - How to migrate users and messaging and calendaring information - Public Folder migration and coexistence - Results achieved in the lab using various tools and techniques - Wrapping up a migration project This material is useful for anyone who has to evaluate the tools, install them, and conduct a messaging migration project.
Controlled SQL query evolution for decision support benchmarks
Authors: Meikel Poess
Venue: Proceedings of the 6th international workshop on Software and performance (2007)

The synthesis of increased global competitiveness and the acceptance of commercially available multi purpose database management systems (DBMS) for decision support applications requires an ever more critical system evaluation and selection to be completed in a progressively short period of time. Designers of standard benchmarks, individual customer benchmarks and system stress tests alike are struggling to mastermind queries that are both representative to the real world and execute in a reasonable time. Additionally, the enriched functionality of every new DBMS release amplifies the complexity of today's decision support systems calling for a novel approach in query generation for benchmarks. This paper proposes a framework of so called query evolution rules that can be applied to typical decision support queries, written in SQL92. Deployed in combination with QGEN2, the query generator developed by the TPC for TPC-DS ?[13], these rules quickly turn a small set of queries into a large set of semantically similar queries for ad-hoc benchmarking purposes or they can be used to generate thousands of queries quickly to stress test optimizers or query execution engines without much user intervention.
Stanford emulation laboratory
Authors: Michael J. Flynn
Venue: ACM SIGMICRO Newsletter (1983)

Over the past decade we have built a laboratory and research environment for the study of architectures and emulation. Initially most effort was directed at building the host processor, EMMY, and its support tools. The next stage was to emulate a variety of instruction sets --- building an archive of emulators. Now we have well over a dozen emulators and can add a new one quickly. A student can emulate a know image architecture in about ten weeks --- twenty weeks includes verification and documentation --- thirty weeks for I/O and interface to a simple operating system. (A student-week is about 6 - 8 hours of effort and corresponds to three units of credit.)
A new metric for measuring metamodels quality-of-fit for deterministic simulations
Authors: Husam Hamad
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Metamodels are used to provide simpler prediction means than the complex simulation models they approximate. Accuracy of a metamodel is one fundamental criterion that is used as the basis for accepting or rejecting a metamodel. Average-based metrics such as root-mean-square error RMSE and R-square are often used. Like all other average-based statistics, these measures are sensitive to sample sizes unless the number of test points in these samples is adequate. We introduce in this paper a new metric that can be used to measure metamodels fit quality, called metamodel acceptability score MAS. The proposed metric gives readily interpretable meaning to metamodels acceptability. Furthermore, initial studies show that MAS is less sensitive to test sample sizes compared to average-based validation measures.
Making the most of using depth reasoning to label line drawings of engineering objects
Authors: P. A. C. Varley, R. R. Martin, H. Suzuki
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

Automatic creation of B-rep models of engineering objects from freehand sketches would benefit designers. A subgoal is to take a single line drawing (with hidden lines removed), and from it deduce an initial 3D geometric realisation of the visible part of the object. Junction and line labels, and provisional depth coordinates, are important components of this frontal geometry. Most methods for producing frontal geometry use line labelling, but this takes little or no account of geometry. As a result, the line labels produced can be unreliable.Previously, we proposed an approach which inflates a drawing to produce provisional depth coordinates, and uses these to make deductions about line labels. Even a na&iuml;ve implementation can outperform previous line labelling methods in certain cases. In this paper, we further enhance this approach. We extend the algorithm to non-isometric-projection drawings, consider improved ways of realising some of the concepts, and also consider how to combine this approach with other labelling techniques to gain the benefits of each.We test our approach using to be drawings of what we consider representative samples of engineering objects; these exemplify difficulties not considered in many previous papers on line labelling. Our results, based on this test set, show that the enhancements result in significant benefits.
External bone remodeling through boundary elements and damage mechanics
Authors: Gabriela Martínez, José Manuel García Aznar, Manuel Doblaré, Miguel Cerrolaza
Venue: Mathematics and Computers in Simulation (2006)

The most recent advances in external bone remodeling are shown using strain energy density (SED) and damage mechanics variables as stimulus functions. The Boundary Element Method (BEM) is used to obtain the tractions and displacements in each iteration.In this paper it is assumed that the level of damage and the strain energy near the periosteum and endosteum control the external bone remodeling response in the cortical of long bones. The boundary is modified as a function of time and the numerical analysis is solved through the method before mentioned for each variation of the boundary coordinates, then the geometry is evaluated and adapted. Smoothing techniques are used ([β-spline surfaces) to prevent sudden variations in the boundary that may hinder a solution convergence. To validate this model a numerical example is shown with previously validated experimental data from other authors.
Precomputed search trees: planning for interactive goal-driven animation
Authors: Manfred Lau, James J. Kuffner
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present a novel approach for interactively synthesizing motions for characters navigating in complex environments. We focus on the runtime efficiency for motion generation, thereby enabling the interactive animation of a large number of characters simultaneously. The key idea is to precompute search trees of motion clips that can be applied to arbitrary environments. Given a navigation goal relative to a current body position, the best available solution paths and motion sequences can be efficiently extracted during runtime through a series of table lookups. For distant start and goal positions, we first use a fast coarse-level planner to generate a rough path of intermediate sub-goals to guide each iteration of the runtime lookup phase.We demonstrate the efficiency of our technique across a range of examples in an interactive application with multiple autonomous characters navigating in dynamic environments. Each character responds in real-time to arbitrary user changes to the environment obstacles or navigation goals. The runtime phase is more than two orders of magnitude faster than existing planning methods or traditional motion synthesis techniques. Our technique is not only useful for autonomous motion generation in games, virtual reality, and interactive simulations, but also for animating massive crowds of characters offline for special effects in movies.
Improved algorithmms for the k maximum-sums problems
Authors: Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
Venue: Theoretical Computer Science (2006)

Given a sequence of n real numbers and an integer k, 1 ≤ k ≤ 1/2n(n - 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all possible segment sums. Recently, Bengtsson and Chen gave an O(min{k + n log2 n, n√k})-time algorithm for this problem. Bae and Takaoka later proposed a more efficient algorithm for small k. In this paper, we propose an O(n + k log(min{n, k}))-time algorithm for the same problem, which is superior to both of them when k is o(n log n). We also give the first optimal algorithm for delivering the k maximum-sum segments in non-decreasing order if k ≤ n. Then we develop an O(n2d-1 + k log min{n, k})-time algorithm for the d-dimensional version of the problem, where d > 1 and each dimension, without loss of generality, is of the same size n. This improves the best previously known O(n2d-1C)-time algorithm, also by Bengtsson and Chen, where C = min{k + n log2 n, n√k}. It should be pointed out that, given a two-dimensional array of size m × n, our algorithm for finding the k maximum-sum subarrays is the first one achieving cubic time provided that k is O(m2n/log n).
Rapid and brief communication: Proposing new methods in low-level vision from the Mach band illusion in retrospect
Authors: Kuntal Ghosh, Sandip Sarkar, Kamales Bhaumik
Venue: Pattern Recognition (2006)

A re-scan of the well-known Mach band illusion has led to the proposal of a Bi-Laplacian of Gaussian operation in early vision. Based on this postulate, the human visual system at low-level has been modeled from two approaches that give rise to two new tools. On one hand, it leads to the construction of a new image sharpening kernel, and on the other, to the explanation of more complex brightness-contrast illusions and the possible development of a new algorithm for robust visual capturing and display systems.