ppxscal/embedding_network huggingface dataset:
IT planning in India: implications for IT effectiveness
Authors: Shivraj Kanungo, Madan Chouthoy
Venue: Information Technology for Development (1998)

Organizational context plays an important role in how organizations develop and implement IT strategies and plans. Since, in developing nations like India where, in the presence of highly skilled based of technical manpower, embedded organizational and cultural issues exert a strong impact on strategies adopted by organizations, it becomes important to identify organizational attributes that determine IT effectiveness. In this paper we investigate the critical nexus between IT planning and IT effectiveness in the Indian corporate milieu with the aim of identifying strategies and practices that could result in effective IT usage in spite of organizational and cultural constraints. Empirical support was provided for this study by in-depth interviews conducted with systems managers and, in some instances, CEOs. Results indicate that the majority of the organizations do not use IT effectively. Moreover, some of these deficiencies can be linked to planning and strategic aspects of IT management. Results are discussed in the light of existing conditions and the main outcome that emerges is that if organizations in India do not develop and implement strategies to use IT for both incremental as well as radical organizational improvements, they are not likely to experience significant IT-related benefits.
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
Authors: Guy Louchard, Wojciech Szpankowski, Jing Tang
Venue: SIAM Journal on Computing (1999)

The goal of this research is threefold: (i) to analyze generalized digital search trees, (ii) to derive the average profile (i.e., phrase length) of a generalization of the well-known parsing algorithm due to Lempel and Ziv, and (iii) to provide analytic tools to analyze asymptotically certain partial differential functional equations often arising in the analysis of digital trees. In the generalized Lempel--Ziv parsing scheme, one partitions a sequence of symbols from a finite alphabet into phrases such that the new phrase is the shortest substring seen in the past by at most b-1 phrases (b=1 corresponds to the original Lempel--Ziv scheme). Such a scheme can be analyzed through a generalized digital search tree in which every node is capable of storing up to b strings. In this paper, we investigate the depth of a randomly selected node in such a tree and the length of a randomly selected phrase in the generalized Lempel--Ziv scheme. These findings and some recent results allow us to compute the average redundancy of the generalized Lempel--Ziv code and compare it to the ordinary Lempel--Ziv code, leading to an optimal value of b. Analytic techniques of (precise) analyses of algorithms are used to establish most of these conclusions.
Graph Partitioning and Continuous Quadratic Programming
Authors: William W. Hager, Yaroslav Krylyuk
Venue: SIAM Journal on Discrete Mathematics (1999)

A continuous quadratic programming formulation is given for min-cut graph partitioning problems. In these problems, we partition the vertices of a graph into a collection of disjoint sets satisfying specified size constraints, while minimizing the sum of weights of edges connecting vertices in different sets. An optimal solution is related to an eigenvector (Fiedler vector) corresponding to the second smallest eigenvalue of the graph's Laplacian. Necessary and sufficient conditions characterizing local minima of the quadratic program are given. The effect of diagonal perturbations on the number of local minimizers is investigated using a test problem from the literature.
ASDEN: a comprehensive design framework vision for automotive electronic control systems
Authors: Deborah Wilson, Daniel Dayton, R. Todd Hansell
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

The automotive electronics industry is experiencing an era of unprecedented growth. Driven by emissions and safety legislation, fuel economy constraints, cost constraints, and customer demand for convenience features and enhanced performance, electronic controls are steadily replacing their mechanical and hydraulic predecessors. As the sophistication of these systems grows, their complexity has grown dramatically as well, creating difficulties in the application of traditional engineering methods to modern systems. New design paradigms, such as model-based control, have begun to emerge. These factors have created a need for more sophisticated, integrated tool sets to help support the systems engineering process and manage the designs of the new systems. The Automotive Systems Design Environment (ASDEN) project has been undertaken by Motorola to address this need for a sophisticated, capable framework of interoperable tools. This project paves the way for a future where the &ldquo;Virtual Automobile&rdquo; becomes a reality: a car designed, simulated, and &ldquo;driven&rdquo; before the first physical prototype is even built.
How should data structures and algorithms be taught
Authors: Danny Kopec, Richard Close, Jim Aman
Venue: ACM SIGCSE Bulletin (1999)

Data Structures and Algorithms is clearly a very important topic and course in the Computer Science curriculum. It has been taught at several levels by a number of approaches. Should the approach be mathematical, theoretical and abstract or very concrete and "hands on"? Whichever method is used, the ultimate goal is the same: enhancing student comprehension. The panelists discuss three distinct and well-defined approaches.
Indexing images in Oracle8i
Authors: Melliyal Annamalai, Rajiv Chopra, Samuel DeFazio, Susan Mavris
Venue: ACM SIGMOD Record (2000)

Content-based retrieval of images is the ability to retrieve images that are similar to a query image. Oracle8i Visual Information Retrieval provides this facility based on technology licensed from Virage, Inc. This product is built on top of Oracle8i interMedia which enables storage, retrieval and management of images, audios and videos. Images are matched using attributes such as color, texture and structure and efficient content-based retrieval is provided using indexes of an image index type. The design of the index type is based on a multi-level filtering algorithm. The filters reduce the search space so that the expensive comparison algorithm operates on a small subset of the data. Bitmap indexes are used to evaluate the first filter resulting in a design which performs well and is scalable. The image index type is built using Oracle8i extensible indexing technology, allowing users to create, use, and drop instances of this index type as they would any other standard index. In this paper we present an overview of the product, the design of the image index type, and some performance results of our product.
The integrality of speech in multimodal interfaces
Authors: Michael A. Grasso, David S. Ebert, Timothy W. Finin
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1998)

A framework of complementary behavior has been proposed which maintains that direct-manipulation and speech interfaces have reciprocal strengths and weaknesses. This suggests that user interface performance and acceptance may increase by adopting a multimodal approach that combines speech and direct manipulation. This effort examined the hypothesis that the speed, accuracy, and acceptance of multimodal speech and direct-manipulation interfaces will increase when the modalities match the perceptual structure of the input attributes. A software prototype that supported a typical biomedical data collection task was developed to test this hypothesis. A group of 20 clinical and veterinary pathologists evaluated the prototype in an experimental setting using repeated measures. The results of this experiment supported the hypothesis that the perceptual structure of an input task is an important consideration when designing a multimodal computer interface. Task completion time, the number of speech errors, and user acceptance improved when interface best matched the perceptual structure of the input attributes.
The Applicability of Green&lsquo;s Theorem to Computation of Rate of Approach
Authors: Zoran Duric, Azriel Rosenfeld, James Duncan
Venue: International Journal of Computer Vision (1999)

The rate of approach (ROA) of a moving observer toward a scene point, as estimated at a given instant, is proportional to the component of the observer&lsquo;s instantaneous velocity in the direction of the point. In this paper we analyze the applicability of Green&lsquo;s theorem to ROA estimation. We derive a formula which relates three quantities: the average value of the ROA for a surface patch in the scene&semi; a surface integral that depends on the surface slant of the patch&semi; and the contour integral of the normal motion field around the image of the boundary of the patch. We analyze how much larger the ROA on the surface patch can be than the value of the contour integral, for given assumptions about the variability of the distance to points on the surface patch. We illustrate our analysis quantitatively using synthetic data, and we also validate it qualitatively on real image sequences.
Machines invented for WW II code breaking
Authors: Beryl Plimmer
Venue: ACM SIGCSE Bulletin (1998)

In 1944 a computer was commissioned at Bletchley Park in England. This computer was designed specifically to find the settings used by German cipher machines to encrypt messages, which it did very effectively. Before "Colossus" the Polish and British military had developed mechanical machines to aid with cryptography. All of this work was top secret and only with the recent release of documents has the true significance of these machines and the people who created them been appreciated.
Speeding up power estimation of embedded software
Authors: Akshaye Sama, J. F. M. Theeuwen, M. Balakrishnan
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Power is increasingly becoming a design constraint for embedded systems. A processor is responsible for energy consumption on account of the software component of the embedded system. The power estimation of this component is a major concern due to the rising complexities of processors and the slow estimation tools. This work attempts to estimate the energy dissipation of the PR1900 processor based on instruction set model with improved accuracy. The model is integrated in a simulation framework and validated. Over 200 times speedup has been obtained with average 1.4% loss in accuracy over gate level estimation. Analysis of the energy dissipated by the instruction vis a vis the processor architecture has been carried out and a substantial reduction in the measurement effort to build the processor energy model has been achieved.
Fully dynamic planarity testing with applications
Authors: Zvi Galil, Giuseppe F. Italiano, Neil Sarnak
Venue: Journal of the ACM (JACM) (1999)

This paper introduces compressed certificates for planarity, biconnectivity and triconnectivity in planar graphs, and proves many structural properties of certificates in planar graphs. As an application of our compressed certificates, we develop efficient dynamic planar algorithms. In particular, we consider the following three operations on a planar graph G: (i) insert an edge if the resultant graph remains planar; (ii) delete an edge; and (iii) test whether an edge could be added to the graph without violating planarity. We show how to support each of the above operations in O(n2/3) time, where n is the number of vertices in the graph. The bound for tests and deletions is worst-case, while the bound for insertions is amortized. This is the first algorithm for this problem with sub-linear running time, and it affirmatively answers a question posed in Epstein et al. [1992]. We use our compressed certificates for biconnectivity and triconnectivity to maintain the biconnected and triconnected components of a dynamic planar graph. The time bounds are the same: O(n2/3) worst-case time per edge deletion, O(n2/3) amortized time per edge insertion, and O(n2/3) amortized time per edge insertion, and O(n2/3)worst-case time to check whether two vertices are either biconnected or triconnected.
Congestion control in a wireless network
Authors: Anna D. Hać
Venue: International Journal of Network Management (1999)

This article proposes a congestion control model for a wireless network. Wireless communications can cause congestion in a high-speed switching network depending on the volume of calls, their origination and the network architecture. In congested areas where wireless services are extensively used, the switching network can become congested. The proposed congestion control model allows for evaluation of these limitations and for choosing the best possible solution. Copyright &copy; 1999 John Wiley Sons, Ltd.
Event-Based Techniques to Debug an Object Request Broker
Authors: Pablo Galdámez, Declan Murphy, José M. Bernabéu-Aubánjosep, Francesc D. Muñoz-Escoi
Venue: The Journal of Supercomputing (1999)

This work presents a debugging system built for the Object Request Broker (ORB) used in the construction of Solaris MC, a multicomputer OS. Even though it has been built and tested on a particular ORB, we believe similar ideas could be employed on other ORBs with similar structure and goals. The goal of this system is to provide a means to stress the ORB behavior in a controlled manner while logging the events occurred during its execution. The tool, called the Fault Injection and Event Logging Tool (FIELT) helps system programmers to find possible inconsistencies in the code by means of a post-mortem analysis of the collected trace data. The approach taken to design the event logging follows the event-driven techniques to monitorize distributed systems. Failures in the ORB are injected by software instrumentation and these injected failures are considered as special events. This allows us to reason about the correctness of the ORB in a broad sense, where its expected behavior includes to gracefully cope with failures. The number of potentially relevant events produced during the ORB execution is unmanageably high. There is, thus, a need to find a minimum subset of those events which, without losing relevant system behavior, allows us to infer its correctness (or lack of). We address this problem using a new model for ORB computations, assigning each event produced by the ORB to one of the high level objects it manages.
Quasi-asynchronous migration: a novel migration protocol for PVM tasks
Authors: Pei Dan, Wang Dongsheng, Zhang Youhui, Shen Meiming
Venue: ACM SIGOPS Operating Systems Review (1999)

Process migration is a desirable and useful facility for the Network of Workstations (NOW). This paper presents a novel migration protocol called quasi-asynchronous migration for PVM tasks, which allows non-migrating tasks to execute during most of the time of migration. Message flushing and message delaying are the key mechanisms used in quasi-asynchronous migration. Because the protocol is implemented on top of PVM and at user-level, it is both transparent to users and portable. Both the analysis of the migration protocol and the experimental results show that quasi-asynchronous migration has lower overhead than other migration protocols.
The text REtrieval conference (TREC): history and plans for TREC-9
Authors: Ellen M. Voorhees, Donna Harman
Venue: ACM SIGIR Forum (1999)

Text retrieval systems have historically been refined through experimentation on test collections. In 1990 NIST was asked to build a very large test collection for use in evaluation of text retrieval technology in the DARPA TIPSTER project. This collection was to be on the order of 1 million full-text documents: a magnitude about 100 times larger than any existing non-proprietary test collection. The following year NIST proposed that this collection be made available to the full research community by the formation of the Text REtrieval Conference (TREC). The first conference took place in September, 1992 with 25 participating groups including most of the leading text retrieval research groups. Although scaling their research algorithms to handle this near-operational amount of text (for 1992) was a Herculean task, groups joined TREC to get the test data and to take part in the first major cross-system search engine evaluation. Participation in TREC has since increased each year. The most recent TREC (TREC-8 held in November, 1999) had 66 participating groups representing 16 different countries.This paper serves as a general introduction to TREC. Detailed information about TREC including the complete Proceedings for each workshop, instructions for obtaining test collections, and the Call for Participation for TREC-9 can be found on the TREC web site at http://trec.nist.gov. Task descriptions for some of the tasks to be done in TREC-9 follow in this issue. To participate in TREC-9, follow the instructions given in the Call for Participation.
Effects of contextual navigation aids on browsing diverse Web systems
Authors: Joonah Park, Jinwoo Kim
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

In spite of the radical enhancement of web technologies, many users still continue to experience severe difficulties in navigating web systems. One way to reduce the navigation difficulties is to provide context information that explains the current situation of users in the web systems. In this study, we empirically examined the effects of two types of context information, namely, structural and temporal context. In the experiment, we evaluated the effectiveness of the contextual navigation aids in two different types of web systems: an electronic commerce system and a content dissemination system. In our experiment, subjects performed several browsing tasks and answered a set of post-questionnaires. The results of the experiment reveal that the two types of contextual navigation aids significantly improved the performance of browsing tasks regardless of different web systems. Moreover, context information changed the users' navigation patterns, and increased their subjective ease of navigation. This study concludes with implications for understanding the users' browsing patterns and for developing effective navigation systems.
A Robust Competitive Clustering Algorithm With Applications in Computer Vision
Authors: Hichem Frigui, Raghu Krishnapuram
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This paper addresses three major issues associated with conventional partitional clustering, namely, sensitivity to initialization, difficulty in determining the number of clusters, and sensitivity to noise and outliers. The proposed Robust Competitive Agglomeration (RCA) algorithm starts with a large number of clusters to reduce the sensitivity to initialization, and determines the actual number of clusters by a process of competitive agglomeration. Noise immunity is achieved by incorporating concepts from robust statistics into the algorithm. RCA assigns two different sets of weights for each data point: the first set of constrained weights represents degrees of sharing, and is used to create a competitive environment and to generate a fuzzy partition of the data set. The second set corresponds to robust weights, and is used to obtain robust estimates of the cluster prototypes. By choosing an appropriate distance measure in the objective function, RCA can be used to find an unknown number of clusters of various shapes in noisy data sets, as well as to fit an unknown number of parametric models simultaneously. Several examples, such as clustering/mixture decomposition, line/plane fitting, segmentation of range images, and estimation of motion parameters of multiple objects, are shown.
A data-analysis pipeline for large-scale gene expression analysis
Authors: S. Hennig, R. Herwig, M. Clark, P. Aanstad, A. Musa, J. O'Brien, C. Bull, U. Radelof, G. Panopoulou, A. J. Poustka, H. Lehrach
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

In this article we describe a method for characterization of large cDNA clone libraries based on oligonucleotide fingerprints (OFPs). The main advantage of this technique lies in that, without sequencing, each clone is tagged in an almost unique way, which has a couple of interesting applications, e.g. clustering of clones that belong to the same gene or gene family followed by sequencing of representative clones for each cluster. Moreover, small clusters are likely to represent rarely expressed genes, which are difficult to find by common approaches. We will demonstrate that in the EST projects carried out in our lab the global redundancy is very low compared to similar projects described in the literature, and simultaneously the number of unknown (novel) genes detected using this method is very high. In addition OFPs can be used directly for data base mining, since the sequences of the oligos matching a specific clone is known Recent results are presented, which underline the potential of our method in finding novel genes or genes homologous to known data. We will also address future applications in gene expression profiling, and give an outline of the various bioinformatics tools, which have been developed so far and which are used for automated data processing and analysis.
Evaluation of forced oscillation technique for early detection of airway obstruction in sleep apnea: a model study
Authors: S. Reisch, M. Schneider, J. Timmer, K. Geiger, J. Guttmann
Venue: Technology and Health Care (1998)

The forced oscillation technique (FOT) is a non-invasive method which may be suitable for assessing upper airway obstruction in obstructive sleep apnea/hypopnea syndrome (OSAS) patients. The aim of this study was to determine in vitro if FOT can provide an early detection index of total or partial upper airway occlusion. A respiratory system analog was developed which includes an upper airway analog that allows simulation of upper airway collapse (thus mimicking the situation in patients with OSAS). We simulated different degrees of upper airway obstructions ranging from 0 (unobstructed airways) to 1 (total occlusion). Furthermore, we imitated the collapsible upper airway wall by means of elastic membranes with ten different wall compliances ranging from 3.3 \times 10^{-4} to 1 l/mbar. For the two stiffest rubber membranes (C_{\rm wall}=0.01 and 3.3 \times 10^{-4} l/mbar) the absolute value of the impedance ($|Z|$) showed a marked increase for obstructions greater than 0.6. For the two membranes with the highest wall compliances (C_{\rm wall}=0.03 and 1 l/mbar) obstructions with an increase in |Z| could not be detected before the obstruction reached 0.8. For degrees of obstruction less than 0.6 the phase angle of collapsible membranes with low compliance (stiff airway wall) were about 1.5\pi which significantly differed from phase angles of 1.7\pi measured in membranes with high compliance (elastic airway wall) semi; p <0.01. We hypothesized that stiffness of upper airway walls corresponds with their muscle tone, i.e., stiff airway walls are related with high muscle tone and vice versa. Thus, a decrease in upper airway muscle activity would cause an increase of upper airway wall elasticity that enables upper airway collapse. As a consequence the phase angle \phi could be expected to change from values characterizing stiff membranes to values characterizing more elastic membranes which could be used as early indicator for obstructive respiratory events. We have frequently observed such changes in morphology of \phi(t) data obtained from patients with OSAS.