ppxscal/embedding_network huggingface dataset:
Deterministic and stochastic state model of right generalized cylinder (RGC-sm): application in computer phantoms synthesis
Authors: Jacques Azencot, Maciej Orkisz
Venue: Graphical Models (2003)

RGC-sm is a state model proposed to describe complex-shaped objects within the family of right generalized cylinders (RGCs). A continuous deformation of a planar curve (contour) along the object's axis describes its surface. The contour, locally orthogonal to the axis, is modeled by a finite Fourier series (FS). The zero-order FS harmonics (contour centers) define the axis. The object is divided into sections of variable length where the variation rule of the shape remains unchanged. Very concise description of a RGC family having the same statistical properties is obtained by applying an auto-regressive stochastic model to state variables. RGC-sm gives access to morphological parameters such as curvature and torsion of the axis, area of cross-sections, and volume of a cylinder segment. Its usefulness is illustrated in synthesis of vascular phantoms and in segmentation/quantification of real vascular images. It can also be used in other fields such as classification and pattern recognition.
On space, listening and interaction: Words on the streets are these and Still Life
Authors: Nick Fells
Venue: Organised Sound (2002)

This article discusses space and interactivity in relation to some of the author's compositions for performers and computer. It outlines approaches to musical space relevant to those works arising from the realms of acousmatic, instrumental/acoustic and soundscape composition, and explores the conflict arising when a variety of listening practices are employed by the spectator-listener. This conflict challenges the perceived boundaries that differentiate genres, and also challenges the significance of existing &lsquo;instrumental&rsquo; definitions of interactive computer music to the author's work. The author's approach to investigating this issue through composition is discussed, using two pieces as examples: Words on the streets are these (2001), an interactive installation, and Still Life (2002), a concert piece for string quartet and live electroacoustics. Technical and aesthetic aspects are outlined, specifically in relation to the experience of the spectator-listener. The overall aim is to emphasise the importance of considering spatial issues in composing interactive music, and to examine how the interplay of spatial concepts might be explored in practice.
Investigation of the interface stability in HfO2-metal electrodes
Authors: F. Fillot, B. Chenevier, S. Maîtrejean, M. Audier, P. Chaudouët, B. Bochu, J. P. Sénateur, A. Pisch, T. Mourier, H. Monchoix, B. Guillaumot, G. Passemard
Venue: Microelectronic Engineering (2003)

As the sharpness of the metal-oxide interface is of major importance to develop efficient structures, we have studied the thermal stability of interfaces in a series of thin film samples where the metallic component was either Pt, Al, Pd, Ni, Nb or Ti deposited on a thin HfO2 film. Thermodynamic considerations have been carried out to determine the possible products of metal-oxide reaction at a temperature of 500 °C. The evolution of the as-deposited thin film structures as a function of annealing temperature has been analysed by combining various techniques and specifically using X-ray reflectometry. This particular technique allows one to detect very thin embedded interfaces, distinguish small density variations and determine accurately the thickness, the normal roughness and the density of each layer. In addition, reflectometry results have been correlated with atomic force microscopy and transmission electron microscopy observations of selected samples. Our results indicate that platinum, palladium and nickel are stable up to 500 °C on hafnium oxide. Annealed aluminium, an interfacial layer forms, whereas niobium and titanium present a diffuse interface.
Center-based indexing in vector and metric spaces
Authors: Arkadiusz Wojna
Venue: Fundamenta Informaticae (2002)

The paper addresses the problem of indexing data for k nearest neighbors (k-nn) search. Given a collection of data objects and a similarity measure the searching goal is to find quickly the k most similar objects to a given query object. We present a top-down indexing method that employs a widely used scheme of indexing algorithms. It starts with the whole set of objects at the root of an indexing tree and iteratively splits data at each level of indexing hierarchy. In the paper two different data models are considered. In the first, objects are represented by vectors from a multi-dimensional vector space. The second, more general, is based on an assumption that objects satisfy only the axioms of a metric space. We propose an iterative k-means algorithm for tree node splitting in case of a vector space and an iterative k-approximate-centers algorithm in case when only a metric space is provided. The experiments show that the iterative k-means splitting procedure accelerates significantly k-nn searching over the one-step procedure used in other indexing structures such as GNAT, SS-tree and M-tree and that the relevant representation of a tree node is an important issue for the performance of the search process. We also combine different search pruning criteria used in BST, GHT nad GNAT structures into one and show that such a combination outperforms significantly each single pruning criterion. The experiments are performed for benchmark data sets of the size up to several hundreds of thousands of objects. The indexing tree with the k-means splitting procedure and the combined search criteria is particularly effective for the largest tested data sets for which this tree accelerates searching up to several thousands times.
Grounding a new information technology implementation framework in behavioral science: a systematic analysis of the literature on IT use
Authors: Rita Kukafka, Stephen B. Johnson, Allison Linfante, John P. Allegrante
Venue: Journal of Biomedical Informatics (2003)

Many interventions to improve the success of information technology (IT) implementations are grounded in behavioral science, using theories, and models to identify conditions and determinants of successful use. However, each model in the IT literature has evolved to address specific theoretical problems of particular disciplinary concerns, and each model has been tested and has evolved using, in most cases, a more or less restricted set of IT implementation procedures. Functionally, this limits the perspective for taking into account the multiple factors at the individual, group, and organizational levels that influence use behavior. While a rich body of literature has emerged, employing prominent models such as the Technology Adoption Model, Social-Cognitive Theory, and Diffusion of Innovation Theory, the complexity of defining a suitable multi-level intervention has largely been overlooked. A gap exists between the implementation of IT and the integration of theories and models that can be utilized to develop multi-level approaches to identify factors that impede usage behavior. We present a novel framework that is intended to guide synthesis of more than one theoretical perspective for the purpose of planning multi-level interventions to enhance IT use. This integrative framework is adapted from PRECEDE/PROCEDE, a conceptual framework used by health planners in hundreds of published studies to direct interventions that account for the multiple determinants of behavior. Since we claim that the literature on IT use behavior does not now include a multi-level approach, we undertook a systematic literature analysis to confirm this assertion. Our framework facilitated organizing this literature synthesis and our analysis was aimed at determining if the IT implementation approaches in the published literature were characterized by an approach that considered at least two levels of IT usage determinants. We found that while 61% of studies mentioned or referred to theory, none considered two or more levels. In other words, although the researchers employ behavioral theory, they omit two fundamental propositions: (1) IT usage is influenced by multiple factors and (2) interventions must be multi-dimensional. Our literature synthesis may provide additional insight into the reason for high failure rates associated with underutilized systems, and underscores the need to move beyond the current dominant approach that employs a single model to guide IT implementation plans that aim to address factors associated with IT acceptance and subsequent positive use behavior.
A New Block Fetching Scheme Considering Traffic Smoothing in Multimedia Servers
Authors: Sooyong Kang, Heon Y. Yeom
Venue: Multimedia Tools and Applications (2004)

Typical block placement schemes generally assume CTL (Constant Time Length) block size, one block read for each stream in a round, round-robin striping, and peak rate-based admission control. Traditional smoothing schemes for stored continuous media objects do not consider the block layout of the storage system. Hence, the combination of schemes from the two domains can introduce new challenges. In this paper, we present a server transmission delay problem that arises when traditional block placement and smoothing schemes are used at the same time in a continuous media server. To resolve the problem, we first present two simple straightforward solutions, Server-side Block Prefetching and Multiple Block Read, and then propose a new solution Smoothed Fetching. SF overcomes the defects of the other two schemes by exploiting a smoothing technique when retrieving blocks from disks and using a tight admission control algorithm. Simulation results show that SF achieves the best performance among the three solutions.
Extracting association rules from XML documents using XQuery
Authors: Jacky W. W. Wan, Gillian Dobbie
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Data mining is generally considered the extraction and analysis of information from databases. With the rapid growth of XML data available online, mining XML data from the web is becoming important. In support of this trend, several encouraging attempts at developing methods for mining XML data have been proposed. However, efficiency and simplicity are still a barrier for further development In this paper, we show that any XML document can be mined for association rules using only the query language XQuery without any pre-processing or post-processing.
Between the lines: documenting the multiple dimensions of computer-supported collaborations
Authors: Rosemary Luckin
Venue: Computers Education (2003)

This paper discusses the development of a documentation technique for collaborative interactions. We describe the original version of the technique as used for a single learner collaborating with a software based learning partner; the second generation of the technique, which required adaptation for application to the analysis of group use of multimedia; and finally the current variation, which is being used to record young children using digital toys and associated software. Particular attention is paid to the way in which the original approach has been adapted in order to accommodate learning contexts that involve technology beyond the desktop computer. We explore some of the challenges these different learning situations pose for those involved in the evaluation of collaborative learning and suggest that tried and tested techniques can be adapted and re-used, provided that the loci of interactivity are clearly specified and the appropriate data sources identified.
Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution
Authors: Hui Xiong, Pang-Ning Tan, Vipin Kumar
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Existing association-rule mining algorithms often relyon the support-based pruning strategy to prune its combinatorialsearch space. This strategy is not quite effectivefor data sets with skewed support distributions because theytend to generate many spurious patterns involving itemsfrom different support levels or miss potentially interestinglow-support patterns. To overcome these problems, we proposethe concept of hyperclique pattern, which uses an objectivemeasure called h-confidence to identify strong affinitypatterns. We also introduce the novel concept of cross-supportproperty for eliminating patterns involving itemswith substantially different support levels. Our experimentalresults demonstrate the effectiveness of this method forfinding patterns in dense data sets even at very low supportthresholds, where most of the existing algorithms wouldbreak down. Finally, hyperclique patterns also show greatpromise for clustering items in high dimensional space.
Measurements of segment size
Authors: Alan Batson, Shy-Ming Ju, David C. Wood
Venue: Proceedings of the second symposium on Operating systems principles (1969)

Distributions of segment sizes have been measured under routine operating conditions on a computer system which utilizes variable-sized segments (the Burroughs B5500). The most striking feature of the measurements is the large number of small segments - about 60% of the segments in use contain less than 40 words. Although the results are certainly not installation-independent, they should be relevant to the design of new computer systems, especially with respect to the organization of paging schemes.
A survey of kernels for structured data
Authors: Thomas Gärtner
Venue: ACM SIGKDD Explorations Newsletter (2003)

Kernel methods in general and support vector machines in particular have been successful in various learning tasks on data represented in a single table. Much 'real-world' data, however, is structured - it has no natural representation in a single table. Usually, to apply kernel methods to 'real-world' data, extensive pre-processing is performed to embed the data into areal vector space and thus in a single table. This survey describes several approaches of defining positive definite kernels on structured instances directly.
Does Home Internet Use Influence the Academic Performance of Low-Income Children? Findings from the HomeNetToo Project
Authors: Linda A. Jackson, Alexander von Eye, Frank A. Biocca
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Research on the effects of home Internet use on children's academic performance is virtually nonexistent. Although parents believe that having the Internet at home is important to their children's success in school, evidence linking access to success is lacking. In the HomeNetToo project we automatically recorded the actual Internet use of 130 children (mean age=13) from low-income families for 16 months. Most of the children were African American (83%) and male (58%), and all resided in a mid-size urban community in the United States. Results indicated that Internet use predicted both grade point averages (GPAs) and standardized test scores. In general, the more frequently children used the Internet at home, the better their GPAs and standardized test scores. Implications for efforts to reduce the digital divide and facilitate access to technology for all children are discussed.
Follow automata
Authors: Lucian Ilie, Sheng Yu
Venue: Information and Computation (2003)

We give two new algorithms for constructing small nondeterministic finite automata (NFA) from regular expressions. The first constructs NFAs with ε-transitions (εNFA) which are smaller than all the other εNFAs obtained by similar constructions. Their size is at most 3/2 |α| + 5/2, where α is the regular expression. This is very close to optimal since we prove also the lower bound 4/3; |α| + 5/2. The second constructs NFAs. It uses ε-elimination in the εNFAs we just introduced and builds a quotient of the well-known position automaton w.r.t. the equivalence given by the follow relation; therefore giving the name of follow automaton. The new automaton uses optimally the information from the positions of a regular expression. We compare the follow automaton with the best constructions to date and show that it has important advantages over those.
Buffer pools and file processing projects for an undergraduate data structures course
Authors: Clifford A. Shaffer
Venue: ACM SIGCSE Bulletin (2004)

This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access intermediary to a disk file. These projects provide a meaningful vehicle for practicing object-oriented design techniques and teach fundamental material on file processing and manipulating binary data. I begin with a concrete example, a heap stored on disk and mediated by a buffer pool. Several important intellectual concepts introduced by such a project are enumerated. Significant extensions and alternatives to the basic project are then described. I conclude with some observations on the role of file processing in modern CS curricula, and the significance of recent trends away from coverage of these topics.
Dealing with different time scales in formal specifications
Authors: E. Corsetti, E. Crivelli, D. Mandrioli, A. Montanari, A. C. Morzenti, P. San Pietro, E. Ratto
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We motivate the need for allowing the consistent treatment of different time scales in formal specifications of time critical systems, with the purpose of enhancing the naturalness and practical usability of the notation. Our approach to this issue is illustrated on TRIO, a temporal logic language for the specification of Real-Time systems. We briefly introduce TRIO and define an extension to the language which considers a temporal universe composed of various temporal domains of different time granularity. The semantics of the extended language is defined via translation mechanisms which allow us to interpret formulas referring to a larger time granularity in a finer temporal domain, and the main properties of such translations are discussed. Finally we present a complete simple example of a system specified at various levels of granularity.
A dynamic earth observation system
Authors: Giovanni Aloisio, Massimo Cafaro
Venue: Parallel Computing (2003)

The paper presents an overview of SARA/Digital Puglia (Synthetic Aperture Radar Atlas), a remote sensing environment that shows how grid technologies and high performance computing can be efficiently used to build dynamic earth observation systems for the management of huge quantities of data coming from space missions and for their on-demand processing and delivering to final users. SARA/Digital Puglia is a grid-enabled, high performance digital library of remote sensing images, developed in a joint research project with CACR/Caltech, ISI/USC and the Italian Space Agency.
Epistemic Value Theory and Information Ethics
Authors: Don Fallis
Venue: Minds and Machines (2004)

Three of the major issues in information ethics &ndash; intellectual property, speech regulation, and privacy &ndash; concern the morality of restricting people&rsquo;s access to certain information. Consequently, policies in these areas have a significant impact on the amount and types of knowledge that people acquire. As a result, epistemic considerations are critical to the ethics of information policy decisions (cf. Mill, 1978 [1859]). The fact that information ethics is a part of the philosophy of information highlights this important connection with epistemology. In this paper, I illustrate how a value-theoretic approach to epistemology can help to clarify these major issues in information ethics. However, I also identify several open questions about epistemic values that need to be answered before we will be able to evaluate the epistemic consequences of many information policies.
Virtual sculpting with a pressure sensitive pen
Authors: Shinji Mizuno, Daigo Kobayashi, Minoru Okada, Jun-ichiro Toriwaki, Shinji Yamamoto
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

We present a new user interface for the virtual sculpting system. In our system, the user operates a chisel with a pressure sensitive pen to carve a workpiece in the virtual space. The user can control the depth of carving and the angle of the virtual chisel to the surface of the workpiece dynamically like the real wood carving.
Distributed information organization and management for hazardous waste regulation compliance checking
Authors: James O. Leckie
Venue:  (2003)

Those businesses that generate hazardous waste as a byproduct of their activities must be aware of the liabilities associated with hazardous wastes and must also comply with a complex regulatory system. Information management among hazardous waste generators, waste treatment-storage-disposal (TSD) facilities, and Environmental Protection Agencies (EPA) are of critical importance for regulation compliance. Information management for hazardous waste regulation compliance is a distributed information processing task. Interaction and collaboration among different participants produces a complex information flow set and thus, invites a distributed yet integrated information management system to deal with it. An in-depth understanding of the three major information technology aspects of the problem are necessary for building a successful information system for hazardous waste regulation compliance: (1) information organization and management; (2) a distributive regulation framework and its related information processing and interoperation; (3) an Internet-based information management infrastructure; and most of all, the integration of these technologies. Fundamental research as well as pragmatic prototyping is the key for reaching such a goal. The complex information management problem of regulation compliance offers one of many challenges to the inter-disciplinary research community. Three topics are addressed in this research: information organization and management for hazardous waste regulation codes; distributed information and knowledge organization for compliance checking processes; and the interoperability of information exchanges among participants. This research is aimed at understanding the nature of the information management needed for hazardous waste regulation compliance. It investigates the important aspects of building such an information system from theoretical and engineering perspectives, and of building a prototyping system for the purpose of demonstrating a state-of-the-art model which may provide improvement for the quality, consistency and efficiency of environmental regulation compliance.
Estimating Piecewise-Smooth Optical Flow with Global Matching and Graduated Optimization
Authors: Ming Ye, Robert M. Haralick, Linda G. Shapiro
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--This paper presents a new method for estimating piecewise-smooth optical flow. We propose a global optimization formulation with three-frame matching and local variation and develop an efficient technique to minimize the resultant global energy. This technique takes advantage of local gradient, global gradient, and global matching methods and alleviates their limitations. Experiments on various synthetic and real data show that this method achieves highly competitive accuracy.
TATOO: an industrial timing analyzer with false path elimination and test pattern generation
Authors: Jacques Benkoski, Ronald B. Stewart
Venue: Proceedings of the conference on European design automation (1991)

TATOO is an industrial interactive timing analysis system evolved from recently developed false path elimination algorithms. These have been extended to perform more complex searches that facilitate the rapid survey of a network. An automatic test pattern generation mechanism which exercises the statically sensitizable paths has been developed. This forms a direct link to an electrical simulator. The critical path through a network of hundreds of gates is found, the test pattern generated, the critical path simulated, and the resulting waveforms displayed in less than two minutes.