ppxscal/embedding_network huggingface dataset:
The Value of Persistence: A Study of the Creation, Ordering and Use of Conversation Archives by a Knowledge Worker
Authors: Christine A. Halverson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

This paper argues that designers of Computer Mediated Communication Systems (CMCs) need to pay attention to the storage, organization and retrieval of conversations. It presents an ethnographic study of Bob,' an expert consultant to consultants in a large organization, and examines the ways in which he fashioned what he calls his "external memory pack" from the thousands of conversations he has had via instant messaging, email, and other forms of CMC.Particular attention is paid to the way in which he organizes, searches, and weaves together conversations to achieve his ends. We conclude by outlining the design implications of his use.
The Road to Requirements Maturity
Authors: Debi Zylbermann, Yigal Cohen, Leah Goldin
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

NDS' mission is to be a leading supplier of open end-to-end digital systems and solutions for the secure delivery of entertainment and information to televisionsand IP devices.This paper describes the processes and changes that NDSTechnologies Israel (NDS-TI) underwent, over the pastthree years, in order to achieve a culture of requirementsmanagement, and discusses the future of the process.We will describe the establishment of the RequirementsManagement process, and focus on the leap, from thepoint of view of Return on Investment.We will describe the side-benfits from achieving aworking Requirements Management process andinfrastructure:1. Lessons learned of the RM process2. Measuring the effectiveness of the RM process andpresenting to Senior management3. Senior management setting new business goals.
Separation anxiety: metaphoric transmutations from a paradoxical biological instrument, or: What is a cactus doing in our concert hall?
Authors: Paul Rudy
Venue: Organised Sound (2001)

In its original rendition, Degrees of Separation: &ldquo;Grandchild of Tree&rdquo; (1998) is performed with cactus, outboard digital effects, and CD playback, with simple lighting. The work is a metaphor which portrays subtle transformations (or transmutations) in human existence precipitated by pervasive new technology. A new version consists of a performance with a video component and all electronics fully automated in MAX/MSP on a Macintosh Powerbook. Development of this work, and subsequent versions, have proven invaluable for my own approach to the music I compose, and for the understanding of my position in the contemporary world of computers, technology and art. This paper attempts to describe these discoveries through outlining the levels of symbolism and metaphor in the work as realised through source abstraction (both visually and aurally), spatialisation and (re-)contextualisation. It begins with the question: What is a cactus doing in the concert hall?
Privacy: a survey
Authors: Paul Armer
Venue: ACM SIGCAS Computers and Society (1981)

(This survey of the privacy issue is concerned only with the computer related aspects of privacy and does not touch upon non-computer related topics like wire-tapping, psychological testing, etc.)
A generalization of the language of Łukasiewicz coding rooted planar hypermaps
Authors: Didier Arquès, Anne Micheli
Venue: Theoretical Computer Science (2003)

We introduce a coding of rooted planar hypermaps by words of a language generalizing the language of Lukasiewicz. This code is obtained by a geometrical decomposition of hypermaps and leads to a new enumeration of rooted planar hypermaps with respect to the number of vertices, hyperfaces and hyperedges.
The use of numerical simulation to predict the unlocking stress of dislocations in Cz-silicon wafers
Authors: A. Giannattasio, S. Senkader, S. Azam, R. J. Falster, P. R. Wilshaw
Venue: Microelectronic Engineering (2003)

Under certain conditions, interstitial oxygen atoms in Czochralski-grown silicon (Cz-Si) are known to hinder or completely stop dislocation motion. As a result, oxygen impurities can remarkably improve the mechanical strength of silicon wafers as they are transported and bound to dislocations. The amount of oxygen bound to dislocations--and with it the wafer's resistance to plastic deformation--is oxygen concentration, time, temperature and, importantly, thermal history dependent. It is also reversible. A numerical model has been developed to predict the shear stress necessary to move glide dislocations in Cz-Si wafers during the course (time evolution) of different heat treatments and sequences of heat treatments typical of integrated circuit fabrication. This model accurately accounts for the experimentally observed behaviour of isolated straight dislocations over a wide range of controlled conditions. Modifications to heat treatments can be predicted by using this numerical simulation so that wafer warpage can be minimised during device processing.
From the chair
Authors: Janice C. Sipior, Laurie Schatzberg
Venue: ACM SIGMIS Database (2003)

A warm invitation is extended to you and your invited guests to attend "The Third Annual ACM-SIGMIS Reception," to be held as an ACM-SIGMIS event prior to the International Conference on Information Systems (ICIS2002) in Seattle, WA USA, December 14-17, 2003. Light refreshments will be served.What: Third Annual ACM-SIGMIS Reception Where: International Conference on Information Systems (ICIS2003) Sheraton Seattle Hotel & Towers, Room 418/420, Seattle, WA, USA When: 5:30 to 7:00 pm Saturday, December 13, 2002 Who: All ACM-SIGMIS members and their invited guests are welcomeI would like to take this opportunity to thank Sajda Qureshi, University of Nebraska at Omaha, for her outstanding service as Program Chair of the Knowledge Management Track for the International Conference on Information and Knowledge Management (CIKM) held November 3-8, 2003 in New Orleans, LA, USA. After graciously serving in this role for both CIKM'02 and CIKM'03, Sajda has decided not to continue. I would like to ask for volunteers to serve as Chair or Co-Chair of the Knowledge Management Track. For additional information on the role of Track Chair, please contact me at janice.sipior@villanova.edu or Sajda at squreshi@ist.unomaha.edu. CIKM is co-sponsored by SIGMIS and ACM-SIGIR (Special Interest Group on Information Retrieval). For more information on CIKM, please visit http://www.csee.umbc.edu/cikm.We would like to thank you for your continued support of SIGMIS. We encourage your comments and suggestions. Please feel free to contact any one of us.We look forward to seeing you at ICIS'03!
Regularized discriminant analysis for the small sample size problem in face recognition
Authors: Juwei Lu, K. N. Plataniotis, A. N. Venetsanopoulos
Venue: Pattern Recognition Letters (2003)

It is well-known that the applicability of both linear discriminant analysis (LDA) and quadratic discriminant analysis (QDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the so-called "small sample size" (SSS) problem arising from the small number of available trainings samples compared to the dimensionality of the sample space. In this paper, we propose a new QDA like method that effectively addresses the SSS problem using a regularization technique. Extensive experimentation performed on the FERET database Indicates that the proposed methodology outperforms traditional methods such as Eigenfaces, direct QDA and direct LDA in a number of SSS setting scenarios.
Info-mathics: the mathematical modeling of information systems
Authors: Andrew S. Targowski
Venue: UML and the unified process (2003)

This chapter reviews Information Systems (IS) modeling techniques, including relational algebra, structured design, architectural design, and Unified Modeling Language. A new technique "info-mathics" (i.e.,mathematical description of the hierarchical systems architecture) is defined to secure the system reliability and quality. The classification of IS categories and its attributes such as components, structure, relationships, system level, system product, system deepness, system width, system list, system end, and other are presented. Examples of the mathematical notations are provided and their meaning for the practical implications of info-mathics in system analysis and design are indicated.
Necessary and sufficient condition for absolute stability of normal neural networks
Authors: Tianguang Chu, Cishen Zhang, Zongda Zhang
Venue: Neural Networks (2003)

Globally convergent dynamics of a class of neural networks with normal connection matrices is studied by using the Lyapunov function method and spectral analysis of the connection matrices. It is shown that the networks are absolutely stable if and only if all the real parts of the eigenvalues of the connection matrices are nonpositive. This extends an existing result on symmetric neural networks to a larger class including certain asymmetric networks. Further extension of the present result to certain non-normal case leads naturally to a quasi-normal matrix condition, which may be interpreted as a generalization of the so-called principle of detailed balance for the connection weights or the quasi-symmetry condition that was previously proposed in the literature in association with symmetric neural networks. These results are of particular interest in neural optimization and classification problems.
Trellis Coded Hybrid Selective Repeat ARQ Schemes for Point-to-Multipoint Communication over Rayleigh Fading Channels
Authors: Necmi Taşpinar
Venue: Wireless Personal Communications: An International Journal (2003)

In this paper, the hybrid selective repeat (SR) automatic repeat request (ARQ) scheme using trellis coded modulation (TCM) proposed by Tellambura and Bhargava [21] is generalized to point-to-multipoint communications for Rayleigh fading channel. Analytical expressions are derived for the throughputs of the point-to-multipoint communication schemes with and without code combining technique. Numerical results show that the protocol using code combining technique yields better throughput than the protocol without code combining and the throughputs decrease when the number of receivers and the value of erasure threshold increase. When the number of receivers equals 1, the scheme without code combining becomes the point-to-point communication scheme proposed in [21].
Weather and climate numerical algorithms: an efficient, parallel solution scheme for the shallow water equations
Authors: C. R. Ethier
Venue:  (2003)

The rapid growth in the complexity of climate and weather simulation problems, combined with a paradigm shift from uniprocessor to parallel computing platforms, make the design of new numerical algorithms for climate and weather simulation essential. In this thesis, a numerical algorithm is developed that maps the global meteorological simulation problem onto massively parallel computer platforms efficiently and accurately through an understanding of the inter-relationships among the physics, the algorithm and the computing platform. The standard and well-accepted two dimensional nonlinear shallow water equation system is used as a model test problem. As part of the sequential algorithm, a conservative semi-implicit, Weak Lagrange-Galerkin (WLG) Finite Element (FE) scheme along with a novel quasi-uniform unstructured spherical triangular grid is designed and implemented. After a systematic evaluation of the true parallel complexity of meteorological simulation problems, an efficient, portable, scalable, parallel algorithm is developed. Sequential and parallel results from several benchmark problems of increasing complexity are presented and compared with published results. The present algorithm handles the pole problem, advection, Rossby waves and inertia-gravity waves accurately and efficiently. It achieves good parallel efficiencies on a range of parallel platforms. For these reasons, the present algorithm is a viable alternative to the currently popular spectral schemes.
Index construction for linear categorisation
Authors: Vaughan R. Shanks, Hugh E. Williams
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Categorisation is a useful method for organising documents into subcollections that can be browsed or searched to more accurately and quickly meet information needs. On the Web, category-based portals such as Yahoo! and DMOZ are extremely popular: DMOZ is maintained by over 56,000 volunteers, is used as the basis of the popular Google directory, and is perhaps used by millions of users each day. Support Vector Machines (SVM) is a machine-learning algorithm which has been shown to be highly effective for automatic text categorisation. However, a problem with iterative training techniques such as SVM is that during their learning or training phase, they require the entire training collection to be held in main-memory; this is infeasible for large training collections such as DMOZ or large news wire feeds. In this paper, we show how inverted indexes can be used for scalable training in categorisation, and propose novel heuristics for a fast, accurate, and memory efficient approach. Our results show that an index can be constructed on a desktop workstation with little effect on categorisation accu-racy compared to a memory-based approach. We conclude that our techniques permit automatic categorisation using very large train-ing collections, vocabularies, and numbers of categories.
Sensitivity and robustness in selection problems
Authors: Alan Jessop
Venue: Computers and Operations Research (2004)

When using a simple linear multiattribute utility model for the selection of a preferred alternative the result depends in part on the weighting of the attributes. Given the difficulties which may make weight determination problematic it is natural to seek to justify a choice by showing that it is insensitive to weight imprecision. To do this some view must be taken of what constitutes justification. Three such views are defined and tested on a real data set: choose that alternative which maximises the number of plausible scenarios in which it is best (sensitivity); maximises the difference between best and second best (robustness); minimises the difference between a chosen candidate and the best under different weighting schemes (risk aversion). Application of these different criteria identify a small number of alternatives, one of which is readily chosen. Some quite loose weight restrictions are applied, the clarity of the recommendations indicating that further judgmental input may not be needed.
Management decision support through reverse engineering technology
Authors: Scott R. Tilley
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Managers of large software systems face enormous challenges when it comes to making informed project-related decisions. They require a high-level understanding of the entire system and in-depth information on selected components. Unfortunately, many software systems are so complex and/or old that such information is not readily available. Reverse engineering---the process of extracting system abstractions and design information from existing software systems---can provide some of this missing information. This paper outlines how a software system can benefit from reverse engineering, and describes how management personnel can use the information provided by this process as an aid in making informed decisions related to large software projects.
Nonparametric Multiscale Energy-Based Model and Its Application in Some Imagery Problems
Authors: Max Mignotte
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper investigates the use of a nonparametric regularization energy term for devising a example-based rendering and segmentation technique. We have stated this problem in the multiresolution energy minimization framework and exploited the multiscale structure proposed by Wei and Levoy for the texture synthesis problem. In this nonparametric energy minimization framework, we also propose a computationally efficient coarse-to-fine recursive optimization method to minimize the cost function related to this hierarchical model. In this context, the formulation of our example-based regularization term also allows to directly infer an intuitive dissimilarity measure between two contour shapes. This measure is herein exploited to define an efficient shape descriptor for the contour-based shape recognition and indexing problem.
Approximate searches: k-neighbors + precision
Authors: Sid-Ahmed Berrani, Laurent Amsaleg, Patrick Gros
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

It is known that all multi-dimensional index structures fail to accelerate content-based similarity searches when the feature vectors describing images are high-dimensional. It is possible to circumvent this problem by relying on approximate search-schemes trading-off result quality for reduced query execution time. Most approximate schemes, however, provide none or only complex control on the precision of the searches, especially when retrieving the k nearest neighbors (NNs) of query points.In contrast, this paper describes an approximate search scheme for high-dimensional databases where the precision of the search can be probabilistically controlled when retrieving the k NNs of query points. It allows a fine and intuitive control over this precision by setting at run time the maximum probability for a vector that would be in the exact answer set to be missed in the approximate set of answers eventually returned. This paper also presents a performance study of the implementation using real datasets showing its reliability and efficiency. It shows, for example, that our method is 6.72 times faster than the sequential scan when it handles more than 5 106 24-dimensional vectors, even when the probability of missing one of the true nearest neighbors is below 0.01.
Multi-Adaptive Galerkin Methods for ODEs II: implementation and Applications
Authors: Anders Logg
Venue: SIAM Journal on Scientific Computing (2003)

Continuing the discussion of the multi-adaptive Galerkin methods {$\mathrm{mcG}(q)$} and {$\mathrm{mdG}(q)$} presented in [A. Logg, SIAM J. Sci. Comput., 24 (2003), pp. 1879--1902], we present adaptive algorithms for global error control, iterative solution methods for the discrete equations, features of the implementation Tanganyika, and computational results for a variety of ODEs. Examples include the Lorenz system, the solar system, and a number of time-dependent PDEs.
Efficient decision tree construction on streaming data
Authors: Ruoming Jin, Gagan Agrawal
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass algorithm for decision tree construction. Their work uses Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed.In this paper, we revisit this problem. We make the following two contributions: 1) We present a numerical interval pruning (NIP) approach for efficiently processing numerical attributes. Our results show an average of 39% reduction in execution times. 2) We exploit the properties of the gain function entropy (and gini) to reduce the sample size required for obtaining a given bound on the accuracy. Our experimental results show a 37% reduction in the number of data instances required.
The connected user interface: realizing a personal situated navigation service
Authors: Antonio Krüger, Andreas Butz, Christian Müller, Christoph Stahl, Rainer Wasinger, Karl-Ernst Steinberg, Andreas Dirschl
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Navigation services can be found in different situations and contexts: while connected to the web through a desktop PC, in cars, and more recently on PDAs while on foot. These services are usually well designed for their specific purpose, but fail to work in other situations. In this paper we present an approach that connects a variety of specialized user interfaces to achieve a personal navigation service spanning different situations. We describe the concepts behind the \bf BPN (BMW Personal Navigator), an entirely implemented system that combines a desktop event and route planner, a car navigation system, and a multi-modal, in- and outdoor pedestrian navigation system for a PDA. Rather than designing for one unified UI, we focus on connecting specialized UIs for desktop, in-car and on-foot use.
A Graph Grammar Approach to Software Architecture Verification and Transformation
Authors: Jun Kong, Kang Zhang, Jing Dong, Guanglei Song
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Software architecture and design are usually modeledand represented by informal diagrams, such asarchitecture diagrams and UML diagrams. While thesegraphic notations are easy to understand and areconvenient to use, they are not amendable to automatedverification and transformation. This paper provides graphgrammars for architecture and UML class diagrams.These grammars enable a high level of abstraction for thegeneral organization of a class of software architectures,and form a basis for various analysis and transformations.In this approach, software verification is performedthrough a syntax analyzer. Architecture transformation isachieved by applying predefined transformation rules.
Change Profiles
Authors: Taneli Mielikäinen
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper we introduce a generalization of associationrules: change profiles. We analyze their properties, describetheir relationship to other structures in pattern discoveryand sketch their possible applications. We studyhow the frequent patterns can be clustered based on theirchange profiles and propose methods for approximating thefrequencies of the patterns from the approximate changeprofiles and bounding the intervals where the frequencies ofthe patterns are guaranteed to be. We evaluate empiricallythe methods for estimating the frequencies and the stabilityof their frequency estimates under different kinds of noise.
Hiperlan/2 public access interworking with 3G cellular systems
Authors: Stephen McCann, Helena Flygare
Venue: Wireless Networks (2004)

This paper discusses some of the recent work within the Broadband Radio Access Network (BRAN) project of ETSI (European Telecommunications Standards Institute), regarding the issue of establishing an interworking solution between Hiperlan/2 and 3G cellular systems and introduces the concept of Hiperlan/2 Public Access. So far the BRAN project has identified several fundamentally different types of possible solutions whose differences lie within the level of integration. The most essential requirements identified were authentication, mobility between Hiperlan/2 and 3G, service continuity, and preservation of the applied security levels. Recent agreements between ETSI, IEEE and MMAC may now take this work forward to produce a generic WLAN to 3G and external networks interworking standard. Indeed such work may also form the precursor for post 3G systems.