ppxscal/embedding_network huggingface dataset:
Collaboration in Global Software Projects at Siemens: An Experience Report
Authors: Matthew Bass, James D. Herbsleb, Christian Lescher
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

As a globally operating company with about 30,000 software engineers worldwide, Siemens has accumulated a wide variety of experiences in global development. Many individuals and organizations have adjusted their practices to deal with the challenges related to the geographic distribution of the development effort. From a corporate perspective, Siemens has accumulated a rich base of knowledge about global development and how to approach it successfully. The Siemens Software Initiative - a company-wide improvement program for software development at Siemens - has worked on collecting this widely-distributed knowledge and synthesizing it in a form accessible to the wider software development community. In this paper, the approach as well as key learnings in people and communication-related aspects of collaboration are summarized.
A game AI production shell framework: generating AI opponents for geomorphic-isometric strategy games via modeling of expert player intuition
Authors: Andrew Chiou
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

One of the most challenging aspects of game AI implementation in computer games is in the production of artificial opponents that can demonstrate human-intuitive strategic skills. In this paper, the need and requirements for a quick and efficient method to capture these skills are identified. Based on these requirements, a framework for a game AI shell is proposed. A case study is presented to demonstrate the workability of the framework by employing a prototype shell to generate a game AI middleware for a tabletop strategy-base game.
Tutorial Series 7 Software Project Verification and Validation
Authors: M. S. Deutsch
Venue: Computer (1981)

From prototype techniques presently used, new directions are emerging that lead to improved management and earlier detection of errors.
Evaluating the Impact of Adaptive Maintenance Process on Open Source Software Quality
Authors: Denis Kozlov, Jussi Koskinen, Jouni Markkula, Markku Sakkinen
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The paper focuses on measuring and assessing the relation of adaptive maintenance process and quality of open source software (OSS). A framework for assessing adaptive maintenance process is proposed and applied. The framework consists of six subprocesses. Five OSSs with considerable number of releases have been studied empirically. Their main evolutionary and quality characteristics have been measured. The main results of the study are the following:. 1) Software maintainability is affected mostly by the activities of the 'Analysis' maintenance sub-process. 2) Software testability is affected by the activities of all maintenance sub-processes. 3) Software reliability is affected mostly by the activities of the 'Design' and 'Delivery' maintenance subprocesses. 4) Software complexity is affected mostly by the activities of the 'Problem identification', 'Design', 'Implementation' and 'Test' sub-processes. 5) Software flexibility is affected mostly by the activities of the 'Delivery' sub-process.
A Cellular Array for the Nonrestoring Extraction of Square Roots
Authors: J. C. Majithia, R. Kitai
Venue: IEEE Transactions on Computers (1971)

An alternative cellular array design is described for nonrestoring extraction of square roots. The array uses a single type of adder/ subtractor cell with a near-iterative connection pattern.
Interactive sound rendering in complex and dynamic scenes using frustum tracing
Authors: Christian Lauterbach Anish Chandak Dinesh Manocha
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a new approach for simulating real-time sound propagation in complex, virtual scenes with dynamic sources and objects. Our approach combines the efficiency of interactive ray tracing with the accuracy of tracing a volumetric representation. We use a four-sided convex frustum and perform clipping and intersection tests using ray packet tracing. A simple and efficient formulation is used to compute secondary frusta and perform hierarchical traversal. We demonstrate the performance of our algorithm in an interactive system for complex environments and architectural models with tens or hundreds of thousands of triangles. Our algorithm can perform real-time simulation and rendering on a high-end PC.
A Case Study: Online Operation Guidance for Real-time Distance Education Environment
Authors: Aiguo He
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Computer support system is useful for improving the effect of real time and interactive distance education activities especially in the case that every participant uses his own computer connected to the system. A problem in such a distance education environment is that the participants need information about the usage of the support system. So it is important that the system can support the participants to learn the system itself. Online documents about the system is not so good for easily guiding the participants to operate the system. This paper reports the result of a case study on the online operation guidance of a real time and interactive distance lecture support system. The effectiveness of this e proposal has been confirmed by experiment.
Automatic Eye Localization in Color Images
Authors: Jose Gilvan Rodrigues Maia, Fernando de Carvalho Gomes, Osvaldo de Souza
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

In this paper, we present a new efficient method for accurate eye localization in color images. Our algorithm is based on robust feature filtering and explicit geometric clustering. This combination enhances localization speed and robustness by relying on geometric relationships between pixel clusters instead of other properties extracted from the image. Furthermore, its efficiency makes it well suited for implementation in low performance devices, such as cell phones and PDAs. Experiments were conducted with 1532 face images taken from a CCD camera under (real-life) varying illumination, pose and expression conditions. The proposed method presented a localization rate of 94.125% under such circumstances.
Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts
Venue: ACM International Conference Proceeding Series; Vol. 274 (2007)

Douglas Englebart in 1997 said "In 20 or 30 years, you'll be able to hold in your hand as much computing knowledge as exists now in the whole city, or even the whole world." Ten years later, we are well onto our way to that goal. As we get closer to such a vision and dream, the way that we interact with such media and media art and culture will become even more critical. The research described in DIMEA picks up this challenge. The development of media besides extending the limits of human capacity for representation and knowledge, are overcoming their own limits that defined them in their origin. Media form an expanded media of the human mind, and thus calls for a multi-disciplinary research in continual change. In this conference we wish to present and discuss these radical transformations, and to fortify knowledge of media art and technology and interaction for humans. We appreciate the hard work of all the authors who contributed to DIMEA2007 by submitting their papers and artworks. DIMEA2007 attracted 31 regular paper submissions, 7 demo submissions, 4 abstract paper submissions and 5 artworks. Based on a thorough review and selection process carried out by international experts from academia and industry as members of the conference committee and the international program committee, a high-quality program was compiled. Regular papers were reviewed by the international program committee which consists of 31 experts from all over the world. All the regular papers have been peer-reviewed by at least two international program committee members. The final decision was made by the conference chairs and the technical program chairs based on the reviewers' feedback available online via the conference management tool. Through earnest and fair discussions, 21 regular papers were accepted as full papers, 2 regular papers were accepted as short papers, and 1 regular paper were accepted as artwork paper from the 31 regular paper submissions. Other submissions, 7 demo submissions, 4 abstract submissions, and 5 artwork submissions were reviewed by the technical program chairs and the demo and art chair. As the result, 5 demos were accepted among 7 submissions, 4 abstract papers were accepted from 4 submissions, and 3 artworks were accepted from 5 submissions. Together we look forward to an exciting future empowered by new media devices and services. Welcome to the conference!
The seventh layer of the clinical-genomics information infrastructure
Authors: Amnon Shabo, Dolev Dotan
Venue: IBM Systems Journal (2007)

Clinical genomics is an interdisciplinary field dealing with the use of genetic data in clinical practice, such as the prescription of drugs based on a patient's genetic profile. To support the integration of clinical genomics information with clinical practice and research, information technologies should enable the semantic association of patient-specific genetic data (e.g., gene variants) with the patient's phenotypic information. To create such genotype-phenotype associations effectively, information technologies should consider relevant data from patient medical records along with information from biomedical knowledge sources. In this paper, we describe how these challenges are addressed by Clinical Genomics Level Seven (CGL7), a set of Web services for clinical-genomics decision-support applications that follow the HL7® (Health Level 7®) Clinical Genomics standard for the representation and exchange of clinical genomics data.
An Auto-Regulative Document Recommendation System Based on P2P Networks
Authors: Feng Guo, Shaozi Li, Kunhui Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Personal recommendation systems help people to find interesting things and they are widely used in the world, such as Amazon.com and eBay.com. This paper presents our recent research work on our auto-regulative personal document recommendation system based on pure P2P network. The peers in our system automatic share and recommend documents with the other peers without central control. The peers can join and leave groups automatic, and the groups can accept and expel peers automatic too, the whole system is auto-regulative. Comparing to the other traditional C/S model systems, ours is easier to extend. In this paper, we present a new algorithm for reputation management and an improvement in the recommendation algorithm, and it works well in the unstructured P2P network and avoids the cold start problem. The results of our experiment show the advantages of the document recommendation system.
A New Intrusion Detection Method Based on Artificial Immune System
Authors: Baoyi WANG, Shaomin ZHANG
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Use the algorithm of generating variable-radius detectors to generate detectors. Analyze different effects on detection results by choosing different radii. Test samples need to compare with all detectors to detect intrusions. When the number of detectors is large, the detection speed is slow. Cluster near detectors into an area. The test samples which fall in this area only compare with the detectors in this area not all detectors, so the times of comparing are reduced and the detection speed is increased. For the test sample falling in some area of non-self space which is not covered by any detector, comparing the minimum distance between this test sample and all self training samples with the minimum distance between this test sample and all detectors can judge whether this test sample is non-self. It is proved by experiments that this method can increase the detection speed as well as detection rate.
A cryptographic access control architecture secure against privileged attackers
Authors: Christian Payne
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

The overwhelming majority of existing access control schemes use active protection mechanisms where a security kernel enforces policy based upon an identity label assigned to each process. However, this design is fragile as a result of widely-used but flawed privilege architectures where all special privileges are assigned to a single identity. As a result, this account is required for all administrative tasks and, in practice, is often compromised leading to system-wide security failure. This paper describes an alternative, `locks and keys' based access control architecture which leverages the passive nature of cryptography as a protection mechanism to limit the impact of this problem. This is more flexible than existing cryptographic file systems since it provides the same features as conventional access control schemes. Furthermore, it achieves its specified security objectives of confidentiality and verifiable integrity even in the face of an attacker who can bypass the security kernel and directly modify objects on the disk. This addresses the need for stronger security architectures in contemporary operating systems while presenting the user with the simple and well-understood interface of an access control scheme.
Reinventing Academic Publishing-Part 1
Authors: James Hendler
Venue: IEEE Intelligent Systems (2007)

The nature of academic publishing is changing, and computer scientists need to lead the way.
D-Script: A Computational Theory of Descriptions
Authors: R. C. Moore
Venue: IEEE Transactions on Computers (1976)

This paper describes D-Script, a language for representing knowledge in artificial intelligence (AI) programs. D-Script contains a powerful formalism for descriptions, which permits the representation of statements that are problematical for other systems. Particular attention is paid to problems of opaque contexts, time contexts, and knowledge about knowledge. The design of a deductive system for this language is also considered.
Reduced-order modelling of the bending of an array of torsional micromirrors
Authors: A. Molfese, A. Nannini, F. Pieri
Venue: Analog Integrated Circuits and Signal Processing (2007)

An array of micromirrors for beam steering optical switching has been designed in a thick polysilicon technology. A novel semi-analytical method to calculate the static characteristics of the micromirrors by taking into account the flexural deformation of the structure is presented. The results are compared with 3D coupled-field FEM simulation.
Autonomous Text Capturing Robot Using Improved DCT Feature and Text Tracking
Authors: M. Tanaka, H. Goto
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

When an autonomous robot tries to find text in the sur- rounding scene using an onboard video camera, some du- plicate text images appear in the video frames. To avoid recognizing the same text many times, it is necessary to de- crease the number of text candidate regions for recognition. This paper presents a text capturing robot that can look around the environment using an active camera. The text candidate regions are extracted from the images using an improved DCT feature. The text regions are tracked in the video sequence so that the number of text images to be rec- ognized is reduced. In the experiment, we tested 460 images of a corridor with fifteen signboards including text. The number of text candidate regions is reduced by 90.1% using our text tracking method.
Regression Trees and Contingent Valuation
Authors: Angela Scaringella
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

We discuss the use of regression trees in the contingent valuation problem. A method is proposed for valuation that exploits surrogate variables. The method is applied to Boston housing data to assess the dependence of house values on a variable related to air pollution.
The Reusable Software Library
Authors: B. A. Burton
Venue: IEEE Software (1987)

The RSL couples a passive database with interactive design tools to make reuse an integral part of the software development process.
Enhancing Depth-Perception with Flexible Volumetric Halos
Authors: Stefan Bruckner Eduard Gröller
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, such as shading, contours, and shadows. Artists and illustrators frequently employ halos for this purpose. In this technique, regions surrounding the edges of certain structures are darkened or brightened which makes it easier to judge occlusion.Based on this concept, we present a flexible method for enhancing and highlighting structures of interest using GPU-based direct volume rendering. Our approach uses an interactively defined halo transfer function to classify structures of interest based on data value, direction, and position. A feature-preserving spreading algorithm is applied to distribute seed values to neighboring locations, generating a controllably smooth field of halo intensities. These halo intensities are then mapped to colors and opacities using a halo profile function. Our method can be used to annotate features at interactive frame rates.
VISIM: Sequential simulation for linear inverse problems
Authors: Thomas Mejer Hansen, Klaus Mosegaard
Venue: Computers Geosciences (2008)

Linear inverse Gaussian problems are traditionally solved using least squares-based inversion. The center of the posterior Gaussian probability distribution is often chosen as the solution to such problems, while the solution is in fact the posterior Gaussian probability distribution itself. We present an algorithm, based on direct sequential simulation, which can be used to efficiently draw samples of the posterior probability distribution for linear inverse problems. There is no Gaussian restriction on the distribution in the model parameter space, as inherent in traditional least squares-based algorithms. As data for linear inverse problems can be seen as weighed linear averages over some volume, block kriging can be used to perform both estimation (i.e. finding the center of the posterior Gaussian pdf) and simulation (drawing samples of the posterior Gaussian pdf). We present the kriging system which we use to implement a flexible GSLIB-based algorithm for solving linear inverse problems. We show how we implement such a simulation program conditioned to linear average data. The program is called VISIM as an acronym for Volume average Integration SIMulation. An effort has been made to make the program efficient, even for larger scale problems, and the computational efficiency and accuracy of the code is investigated. Using a synthetic cross-borehole tomography case study, we show how the program can be used to generate realizations of the a posteriori distributions (i.e. solutions) from a linear tomography problem. Both Gaussian and non-Gaussian a priori model parameter distributions are considered.
Tours of Graphs, Digraphs, and Sequential Machines
Authors: P. Cull
Venue: IEEE Transactions on Computers (1980)

A tour of a graph (digraph or sequential machine) is a sequence of nodes from the graph such that each node appears at least once and two nodes are adjacent in the sequence only if they are adjacent in the graph. Finding the shortest tour of a graph is known to be an NP-complete problem. Several theorems are given that show that there are classes ofgraphs in which the shortest tour can be found easily. For more general graphs, we present approximating algorithms for finding short tours. For undirected graphs, the approximating algorithms give tours at worst a constant times the length of the shortest tour. For directed graphs, the size of the calculated tour is bounded by the size of the digraph times the shortest tour. Not only are the bounds worse for the directed case, but the running times of the approximating algorithms are also larger than those for the undirected case.
Special Feature: Nanoprogramming vs. Microprogramming
Authors: G. F. Casaglia
Venue: Computer (1976)

Vertical microprogramming (or, as others say, functional microprogramming or firmware) was introduced in contrast with Wilkes' microprogramming (generally called horizontal or structural microprogramming), and has greatly enhanced the use of microprogramming in control design and implementation. As applied today, the former technique is not yet a way of designing control structures, but an additional software level whose implications in the system are not well clarified. 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
Wikify!: linking documents to encyclopedic knowledge
Authors: Rada Mihalcea, Andras Csomai
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper introduces the use of Wikipedia as a resource for automatic keyword extraction and word sense disambiguation, and shows how this online encyclopedia can be used to achieve state-of-the-art results on both these tasks. The paper also shows how the two methods can be combined into a system able to automatically enrich a text with links to encyclopedic knowledge. Given an input document, the system identifies the important concepts in the text and automatically links these concepts to the corresponding Wikipedia pages. Evaluations of the system show that the automatic annotations are reliable and hardly distinguishable from manual annotations.
Robust Discriminant Analysis of Gabor Feature for Face Recognition
Authors: Weihong Deng, Jiani Hu, Jun Guo, Honggang Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper introduces a Robust discriminant analysis of Gabor Feature (RGF) method for face recognition. The RGF method apply a novel Robust Fisher linear discriminant Model (RFM) to the low dimensional Gabor feature defined by principle component analysis. The robustness of the RGF method comes form the new RFM which improves the generalization capability of the FLD by robust estimate of the within-class scatter matrix. The feasibility of the RGF method has been successfully tested on face recognition using 1400 images from ORL and FERET database. The effectiveness of the RGF method is shown in term of both the excellent accuracy (99% and 97.75%) and the comparative performance against some popular face recognition schemes such as the Eigenfaces, the Fisherfaces, and the Gabor-Fisher Classifier method.
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies
Authors: W. T. Hardgrave
Venue: IEEE Transactions on Software Engineering (1980)

This paper defines and demonstrates four philosophies for processing queries on tree structures; shows that the data semantics of queries shuld be described by designating sets of nodes from which v values for attnbutes may be returned to the data consumer; shows that the data semantics of database processing can be specified totally independent of any madhine, file structure, or implementation; shows that set theory is a natural and effective vehicle for analyzing the semantics of queries on tree structures; and finally, shows that Bolts is an adequate formalism for conveying the semantics of tree structure processing.