ppxscal/embedding_network huggingface dataset:
Knowledge Transfer in ISD Offshore Outsourcing Project
Authors: Huang Ling Yun
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, we present the body of knowledge which is transferred between client and vendor in ISD (Information System Development) offshoring outsourcing project, which are domain knowledge, technical knowledge, process knowledge and culture knowledge. We also find the process of knowledge transfer though the whole ISD project life circles by case study. The results showed that in different stage of project life-circle, the transfer intensity of every kinds of knowledge are different. Domain and business process knowledge are what vendors lack of most according to the current situation of knowledge base for vendors in China. They can accumulate lots of know-how through cooperation with clients in western markets from different vertical industry. We also proposed key factors impacting the effectiveness and efficiency of knowledge transfer in real-life ISD offshoring outsourcing project, which are project character (novelty, customization, complex), client character (firm size, interaction participation, process maturity), client-vendor related character (communication quality, knowledge overlaps, prior cooperation experiences) and vendor character(firm size, work dispersion, absorb ability, culture fit). Among those factors, most of the respondents emphasis that communication, understanding and culture fit are what they most concern of knowledge transfer in onsite-offshoring/dispersed setup. The managerial implications derived from our knowledge transfer framework may help guide vendors pay more attention on the training of culture and communication skills for the employee. And vendors should design knowledge management systems or implement CMM or CMMi to acquire know-how as much as they can through every project
Time Reversibility, Computer Simulation, and Chaos
Authors: William G. Hoover
Venue: Nonlinear Dynamics (1999)

Describes the work of physicists, chemists, mathematicians, and engineers who are attacking the classic problem of the reversibility paradox, describing their work from the perspective of computer simulation, emphasizing the author's approach to the problem of understanding the compatability of time-reverse mechanics.
A concept of intelligent biometric-based early detection and warning system
Authors: Svetlana N. Yanushkevich
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

This paper presents a concept of a new biometric-based physical access security system using an early warning principle and intelligent decision making support. This system is being prototyped in the first phase of a Project. The early warning principle exploits the real-time analysis of the biometrics of individual being scanned. Binding all sources of information into an objective supported by intelligence tools not only provide for reliable identification of an individual, but also supplies data for situational awareness and risk management support. An intelligent approach provides an interpretation of biometric data in semantic form, as well as dialogue support between the officer and the customer. The PASS is directed at a wide spectrum of applications such as immigration service and border control airports, seaports, and border-crossing, security of important public events, hospitals, and banking.
Effective use of data communications hardware
Authors: Patrick McGregor
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The broad range of perspectives of those involved with data communication networks makes effective use of hardware a topic of many dimensions. We will consider here the particular areas of cost, reliability, performance, and flexibility. Although these are not all-inclusive areas of network evaluation, they do encompass a sizeable portion of most evaluation efforts. Each of the areas is itself broad, and there is considerable overlapping. However, without a functional separation into such areas it is particularly difficult to approach the topic. We will try to note the interaction between the areas whenever possible.
Theory of Applied Robotics: Kinematics, Dynamics, and Control
Authors: Reza N. Jazar
Venue:  (2007)

Theory of Applied Robotics: Kinematics, Dynamics, and Control is appropriate for courses in robotics that emphasize kinematics, dynamics, and control. The contents of this book are presented at a theoretical-practical level. It explains robotics concepts in detail, concentrating on their practical use. Related theorems and formal proofs are provided, as are real-life applications. Students, researchers, and practicing engineers alike will appreciate this user-friendly presentation of a wealth of robotics topics, most notably orientation, velocity, and forward kinematics. Theory of Applied Robotics: Kinematics, Dynamics, and Control includes: Richly illustrated chapters and over 200 diagrams to help readers visualize concepts. More than 300 detailed examples with fully-worked solutions which expose readers to a balanced and broad understanding of robotics in todays world. A wealth of detailed problem sets and challenge problems for each chapter for the more advanced reader. A rich solutions manual which is available for instructors. Reza N. Jazar is an associate professor in the Mechanical Engineering Department at Manhattan College. His main research areas is nonlinear dynamic systems, including robotics, vehicles, and MEMS. He's written extensively on many diverse topics in applied mathematics and mechanical engineering subjects. He regularly teaches undergraduate and graduate-level courses on mechanical engineering.
Flexible Model for Simulating Drinkable Water Treatment Station
Authors: Eyman F. Ahmed, Ali M. Abdelrahman
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Due to the rapid increase of population and the necessity of providing adequate drinkable water supplies, which meet hygiene conditions, modern techniques are applied for water treatment. In particular, this study introduces a flexible model for describing, calculating and estimating the volume of water in distribution tanks through all phases of treatment processes. The model considers a typical water treatment station, located in the capital of Sudan, called Bait Elmal. Moreover the modeling process followed by intensive simulation using Matlab. The results obtained are useful for developing a complete control panel for the station. The ease and flexibility of this model permit its implementation for a wide range of water purification plants.
Relative Motion Decoupled Control for Spacecraft Formation with Coupled Translational and Rotational Dynamics
Authors: Yunhua Wu, Xibin Cao, Yanjun Xing, Pengfei Zheng, Shijie Zhang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The formation relative motion control by using one body fixed thruster and reaction wheels is a challenging problem due to the coupled translational and rotational dynamics. As the thruster vector depends on the current attitude and its angular velocity, and some of the attitude constraints also couple the position and attitude of the spacecraft, it makes the formation control problem high dimensional. This paper develops two decoupling conditions, including thrust vector maneuverability condition and included angle condition between the thruster and the star camera boresight, and then presents two methods to calculate the target attitude quaternion. Both of the two methods need first design the optimal trajectory of the thrust vector, and then use geometric and nonlinear programming methods to calculate the attitude trajectory. The validity of the proposed approach is demonstrated in a typical application of a dualspacecraft formation initialization.
Rethinking signal processing
Authors: Kirk L. Kroeker
Venue: Communications of the ACM (2009)

Compressed sensing, which draws on information theory, probability theory, and other fields, has generated a great deal of excitement with its nontraditional approach to signal processing.
Ontology-Based Rescue Operation Management
Authors: Stasinos Konstantopoulos, Jens Pottebaum, Jochen Schon, Daniel Schneider, Thomas Winkler, Georgios Paliouras, Rainer Koch
Venue: Mobile Response: Second International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2008. Bonn, Germany, May 29-30, 2008, Revised Selected Papers (2009)

The focus of this paper is ontology-based knowledge management in the framework of a mobile communication and information system for rescue operation management. We present a novel ontology data service, combining prior domain knowledge about large-scale rescue operations with dynamic information about a developing operation. We also discuss the integration of such a data service into a service-oriented application framework to reach high performance and accessibility, and offer examples of SHARE applications to demonstrate the practical benefits of the approach chosen.
Moebius circuit: dual-rail dynamic logic for logic gate level pipeline with error gate search feature
Authors: MyeongGyu Jeong, Toru Nakura, Makoto Ikeda, Kunihiro Asada
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

We have introduced the concept of the Moebius strip into LSI circuit design, realizing 8.4 FO4-Inverter throughput for any kind of digital logic circuit. The Moebius circuit operates in a logic gate level pipeline, and has error detection and error gate search features, using a self-timed architecture.
WormBench: a configurable workload for evaluating transactional memory systems
Authors: Ferad Zyulkyarov, Adrian Cristal, Sanja Cvijic, Eduard Ayguade, Mateo Valero, Osman Unsal, Tim Harris
Venue: Proceedings of the 9th workshop on MEmory performance: DEaling with Applications, systems and architecture (2008)

Transactional Memory (TM) is a promising new technology that makes it possible to ease writing multi-threaded applications. Many different TM implementations exist, unfortunately most of those TM systems are currently evaluated by using workloads that are (1) tightly coupled to the interface of a particular TM implementation, (2) are small and lack to capture the common concurrency problems that exist in real multi-threaded applications and also (3) fail to evaluate the overall behavior of the Transactional Memory considering the complete software stack. WormBench is parameterized workload designed from the ground up to evaluate TM systems in terms of robustness and performance. Its goal is to provide an unified solution to the problems stated above (1, 2, 3). The critical sections in the code are marked with the atomic statements and thus proving a framework to test the compiler's ability to translate them properly and efficiently into the appropriate TM system interface. Its design considers the common synchronization problems that exist in TM multi-threaded applications. The behavior of WormBench can be changed by using run configurations which provide the ability to reproduce a runtime behavior observed in a typical multi-threaded application or a behavior that stresses a particular aspect of the TM system such as abort handling. In this paper, we analyze the transactional characteristics of WormBench by studying different run configurations and demonstrate how Worm-Bench can be configured to model the transactional behavior of an application from the STAMP benchmark suite.
A multi-resolution approach for line-edge roughness detection
Authors: Wei Sun, Rajib Mukherjee, Pieter Stroeve, Ahmet Palazoglu, Jose A. Romagnoli
Venue: Microelectronic Engineering (2009)

A wavelet-based line-edge detection framework is presented that proves to be solely image-dependent. In this analysis, surfaces are considered as a combination of an underlying surface structure and a surface detail, corresponding to low-frequency and high-frequency features, respectively. Through the multi-scale analysis offered by wavelet decomposition, the underlying surface structure is extracted and used to define the line-edge searching region, which, in turn, helps characterize the line-edge roughness (LER), providing valuable information for the evaluation of device fabrication and performance. We focus on exploring the optimal wavelet decomposition, to better separate the underlying structure and the surface detail, using a number of metrics including the Shannon's entropy, k-means clustering and the flatness factor. The impact of different wavelet functions and resolution levels on line-edge roughness characterization is discussed. An SEM image of a plane diffraction grating is studied to demonstrate the application of the proposed framework.
Sequencing unreliable jobs on parallel machines
Authors: Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir S. Sodhi
Venue: Journal of Scheduling (2009)

This paper addresses an allocation and sequencing problem motivated by an application in unsupervised automated manufacturing. There are n independent jobs to be processed by one of m machines or units during a finite unsupervised duration or shift. Each job is characterized by a certain success probability p i , and a reward r i which is obtained if the job is successfully carried out. When a job fails during processing, the processing unit is blocked, and the jobs subsequently scheduled on that machine are blocked until the end of the unsupervised period. The problem is to assign and sequence the jobs on the machines so that the expected total reward is maximized. This paper presents the following results for this problem and some extensions: (i) a polyhedral characterization for the single machine case, (ii) the proof that the problem is NP-hard even with 2 machines, (iii) approximation results for a round-robin heuristic, (iv) an effective upper bound. Extensive computational results show the effectiveness of the heuristic and the bound on a large sample of instances.
Second International SeMSoC Workshop --- Business Oriented Aspects Concerning Semantics and Methodologies in Service-Oriented Computing
Authors: Maximilian Ahrens, Manfred Hauswirth, Frank Leymann, Marten Schönherr
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

In the last few years both scientists and practitioners have been discussing the issue of Service Oriented Computing (SOC). But facing the challenge of reconciling the business process requirements and the IT landscape especially in the design time of a SOA implementation, one needs to consider both methodological and technological aspects. On the one hand, methodologies are needed for integrating the business driven view and the technology driven perspective in one consistent approach. On the other hand, semantic technologies have recently emerged as a promising approach for reducing data and process heterogeneities and automating tasks within SOA and Business Process Management. Coping with these two aspects, the proposed workshop will bring together academia and industry to discuss solutions towards bridging the gap between business requirements and IT implementations.
Computer science unplugged: pre-conference workshop
Authors: Tom Cortina
Venue: Journal of Computing Sciences in Colleges (2009)

Computer Science Unplugged is a series of learning activities that reveals a little-known secret: computer science isn't really about computers at all! Unplugged teaches principles of computer science such as binary numbers, algorithms and data compression through games and puzzles that use cards, string, crayons and lots of running around. Unplugged is suitable for people of all ages, from elementary school to university, and from many countries and backgrounds. Unplugged has been used around the world for over fifteen years, in classrooms, science centers, homes, and even for holiday events in a park! (Abstract quoted from http://csunplugged.org)
Model and procedure for performance and availability-wise parallel warehouses
Authors: Pedro Furtado
Venue: Distributed and Parallel Databases (2009)

Consider data warehouses as large data repositories queried for analysis and data mining in a variety of application contexts. A query over such data may take a large amount of time to be processed in a regular PC. Consider partitioning the data into a set of PCs (nodes), with either a parallel database server or any database server at each node and an engine-independent middleware. Nodes and network may even not be fully dedicated to the data warehouse. In such a scenario, care must be taken for handling processing heterogeneity and availability, so we study and propose efficient solutions for this. We concentrate on three main contributions: a performance-wise index, measuring relative performance; a replication-degree; a flexible chunk-wise organization with on-demand processing. These contributions extend the previous work on de-clustering and replication and are generic in the sense that they can be applied in very different contexts and with different data partitioning approaches. We evaluate their merits with a prototype implementation of the system.
Scientific programming at the Java platform with a combination of a scripting interpreter with the compiled Groovy engine
Authors: Stergios Papadimitriou, Dimosthenis Pappas, Konstantinos Terzidis
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The jLab environment extends the potential of Java for scientific computing. It provides a Matlab/Scilab like scripting language that is executed by an interpreter implemented in the Java language. The scripting language supports the basic programming constructs with Matlab like matrix manipulation operators. The jLab "core" provides the general purpose functionality with an extensive set of built in mathematical routines that cover all the basic numerical analysis tasks. The important advantage of jLab compared to other similar environments is the potentiality to dynamically and automatically integrate Java code to the system in order to obtain both execution speed and to reduce the programming effort. This task is supported both by an easy to use extension Java class wizard and by application specific class wizards that automate the utilization of jLab's scientific libraries. However, the incorporation of external Java general purpose code is not as convenient as the scripting code development is. Also, j-scripting is relatively slow compared to Groovy scripting that operates by compiling the scripts to Java classes. This was the motivation for the adaptation of the general purpose Groovy "scripting SuperJava" language as a parallel and cooperative scripting option in the jLab environment. The paper concentrates on the issues involved in the implementation of the multiscripting environment and on the benefits that can be obtained by the combination of these two very different scripting frameworks.
Training social learning skills by collaborative mobile gaming in museums
Authors: Jolien Schroyen, Kris Gabriëls, Kris Luyten, Daniël Teunkens, Karel Robert, Karin Coninx, Eddy Flerackers, Elke Manshoven
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The use of handheld computers as a tool to enrich the museum experience has found its way into many museums, opening up new possibilities to increase the attractiveness of museum visits, especially for youngsters. We developed a mobile guide framework that supports the creation of mobile guides and adheres to social-constructivist principles of learning. The mobile museum game we created with this framework aims at developing the social, cognitive and technical skills of the users. Large scale evaluations show the potential power of our approach to stimulate interaction between youngsters and to create a playful learning experience.
Quality assurance in a large commercial data processing installation
Authors: C. W. Lybrook
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Quality assurance (QA) is one of the most misunderstood, highly desired, yet inconsistently defined, organizational entities in the data processing industry today. There is an increasing number of articles and literature available on the subject. Senior management finds it very attractive. In spite of this, however, few commercial data processing organizations have successfully assimilated effective QA programs into their organizations. This paper describes such a program by the Information Services Group (ISG) of Chemical Bank. Particular emphasis will be placed on the organizational defintion of QA and the philosophy of its operation.
The gene evolution model and computing its associated probabilities
Authors: Lars Arvestad, Jens Lagergren, Bengt Sennblad
Venue: Journal of the ACM (JACM) (2009)

Phylogeny is both a fundamental tool in biology and a rich source of fascinating modeling and algorithmic problems. Today's wealth of sequenced genomes makes it increasingly important to understand evolutionary events such as duplications, losses, transpositions, inversions, lateral transfers, and domain shuffling. We focus on the gene duplication event, that constitutes a major force in the creation of genes with new function [Ohno 1970; Lynch and Force 2000] and, thereby also, of biodiversity. We introduce the probabilistic gene evolution model, which describes how a gene tree evolves within a given species tree with respect to speciation, gene duplication, and gene loss. The actual relation between gene tree and species tree is captured by a reconciliation, a concept which we generalize for more expressiveness. The model is a canonical generalization of the classical linear birth-death process, obtained by replacing the interval where the process takes place by a tree. For the gene evolution model, we derive efficient algorithms for some associated probability distributions: the probability of a reconciled tree, the probability of a gene tree, the maximum probability reconciliation, the posterior probability of a reconciliation, and sampling reconciliations with respect to the posterior probability. These algorithms provides the basis for several applications, including species tree construction, reconciliation analysis, orthology analysis, biogeography, and host-parasite co-evolution.
Degenerate Crossing Numbers
Authors: J&#x00e1;nos Pach, G&#x00e9;za T&#x00f3;th
Venue: Discrete Computational Geometry (2009)

Let G be a graph with n vertices and e&#x2265;4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p, then they properly cross one another at p. It is shown that the number of crossing points, counted without multiplicity, is at least constant times&#x00a0;e and that the order of magnitude of this bound cannot be improved. If, in addition, two edges are allowed to cross only at most once, then the number of crossing points must exceed constant times&#x00a0;(e/n)4.
Finding paths of length k in O∗(2k) time
Authors: Ryan Williams
Venue: Information Processing Letters (2009)

We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k@?poly(n)) time. Our method extends a recent O(2^3^k^/^2@?poly(n))=