ppxscal/embedding_network huggingface dataset:
Identification of mutations affecting liability to complex disease by the analysis of haplotypes
Authors: Kathryn Roeder
Venue:  (2003)

Disease mutations refer to those gene mutations affecting the risk of developing a disease. For complex disease, however, these mutations are neither sufficient nor necessary to induce the disorder. One approach toward identifying the mutations that increase the liability of contracting a disease involves population-based association analysis, i.e. case-control studies. To detect the association between the genetic variants and the disease, we use the fact that disease mutations can be identified by the excess of haplotype sharing among cases. In this thesis we introduce a new class of one degree-of-freedom statistics that are quadratic functions of the haplotype frequencies to measure haplotype similarity. We call such measures the quadratic statistics of haplotype similarity (QSHS). We then present a testing procedure based on the class of QSHS for initial genome screening. Issues involved in constructing this approach are (1) population substructure and correlated samples, (2) multiple testing, and (3) missing haplotype information (i.e., unphased genotypic data). We tackle the problem of substructure and relatedness within study population by generalizing the Genomic Control principle (Devlin and Roeder 1999) to our class of statistics. We use the False Discovery Rate procedure (Benjamini and Hochberg 1995) to adjust for multiple hypothesis testing. We show that this procedure extends naturally to genotypic data and can be robust to missing haplotype information. Besides our QSHS, the Pearson's chi-square statistic is the commonly used alternative to test for association. A power comparison between these two testing methods are performed via simulation. Our results show that these methods are powerful under different background of mutations, depending on the mutations occurred on rare or common variants. The previous results rely on an assumption that the population haplotype frequencies are bounded away from the degenerate points in the parameter space. We extend the results to non-degenerate and degenerate cases by considering the non-standard limiting distribution of the QSHS.
A microprocessor environmental controller for quadriplegics
Authors: T. Bojanowski, R. Bloch, M. Milner
Venue: Issue 24 (October 1978) (1978)

An environmental controller has been designed using consumer available components. Its flexibility, versatility, and reduced cost, are a direct result of using an isometric joystick, a microprocessor and software package in a configuration that lends itself very readily to change.
Fast normal map generation for simplified meshes
Authors: Yigang Wang, Bernd Fröhlich, Martin Göbel
Venue: Journal of Graphics Tools (2002)

Approximating detailed models with coarse, normal mapped meshes is a very efficient method for real-time rendering of complex objects with fine surface detail. In this paper, we present a new and fast normal map construction algorithm. We scan-convert each triangle of the simplified model, which results in a regularly spaced point set on the surface of each triangle. The original model and all these point samples of the simplified model are rendered from uniformly distributed camera positions. The actual normal map is created by computing the corresponding normals for the point sets. For each point, the normal of the closest point from the high resolution mesh over the set of all camera positions is chosen. Our approach works for general triangle meshes and exploits fully common graphics rendering hardware. Normal map construction times are generally in the range of only a few seconds even for large models. We render our normal-mapped meshes in real-time with a slightly modified version of the standard bump-mapping algorithm. In order to evaluate the approximation error, we investigate the distance and normal errors for normal-mapped meshes. Our investigation of the approximation errors shows that using more than 12 viewpoints does not result in a further improvement in the normal maps for our test cases.
Estimating the spectral measure of a multivariate stable distribution via spherical harmonic analysis
Authors: Marcus Pivato, Luis Seco
Venue: Journal of Multivariate Analysis (2003)

A new method is developed for estimating the spectral measure of a multivariate stable probability measure, by representing the measure as a sum of spherical harmonics.
Efficient Nonlinear Dimension Reduction for Clustered Data Using Kernel Functions
Authors: Cheong Hee Park, Haesun Park
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we propose a nonlinear feature extractionmethod which is based on centroids and kernel functions.The dimension reducing nonlinear transformation isobtained by implicitly mapping the input data into a featurespace using a kernel function, and then finding a linearmapping based on an orthonormal basis of centroids in thefeature space that maximally separates the between-classrelationship. The proposed method utilizes an efficient algorithmto compute an orthonormal basis of centroids in thefeature space transformed by a kernel function and achievesdramatic computational savings. The experimental resultsdemonstrate that our method is capable of extracting non-linearfeatures effectively so that competitive performanceof classification can be obtained in the reduced dimensionalspace.
On the selection of a partial scan path with respect to target faults
Authors: Harald Gundlach, Bernd Koch, Klaus-Dieter Müller-Glaser
Venue: Proceedings of the conference on European design automation (1991)

Today the most often applied DFT-strategy is full scan path. To reduce its overhead a partial scan path can be selected. For minimizing the size of the partial scan path, existing testpatterns are used which will detect a part of the faults. Only the remaining faults, so called target faults, have to be addressed using partial scan.Different methods are given to adapt a partial scan path to the target faults. They do not depend on ATPG and therefore have very short runtimes.Results on sequential ATPG-benchmarks show that a strong reduction in the size of the partial scan path is possible.
Querying fuzzy multidimensional databases: unary operators and their properties
Authors: Anne Laurent
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

In this paper, we study the properties of flexible queries in the OLAP (On-Line Analytical Processing) framework, focusing on unary operators. For this purpose, we consider the model we have defined for fuzzy multidimensional databases. This model provides means to handle fuzzy data and flexible queries. The operators defined in this model are closed on the set of fuzzy hypercubes (hereafter cubes), which means that the result of each operator on a fuzzy cube is a cube. Thus, these operators can be nested into expressions. In this paper, the combination of several queries is investigated in order to study the possibility for the definition of an algebra to manipulate fuzzy cubes. This would provide a framework for query rewriting and, as a result, for query optimization.
The semantics of future and an application
Authors: C. Flanagan, Mattias Felleisen
Venue: Journal of Functional Programming (1999)

The future annotation of MultiLisp provides a simple method for taming the implicit parallelism of functional programs. Prior research on future has concentrated on implementation and design issues, and has largely ignored the development of a semantic characterization of future. This paper considers an idealized functional language with futures and presents a series of operational semantics with increasing degrees of intensionality. The first semantics defines future to be a semantically transparent annotation. The second semantics interprets a future expression as a potentially parallel task. The third semantics explicates the coordination of parallel tasks by introducing placeholder objects and touch operations.We use the last semantics to derive a program analysis algorithm and an optimization algorithm that removes provably redundant touch operations. Experiments with the Gambit compiler indicate that this optimization significantly reduces the overhead imposed by touch operations.
Task specific eye movements understanding for a gaze-sensitive dictionary
Authors: Abdelaziz Khiat, Yoshio Matsumoto, Tsukasa Ogasawara
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper, we study the relation between the user's degree of understanding and his/her eye movements; in an effort to realize a proactive interface that monitors the user and provides a contextual support. The application is a gaze sensitive dictionary that helps the user when reading a text in a browser's window. Not only is the user's gaze analyzed but also the context and thus the difficulty degree of the text being read. The experiment results suggest using regressions as an indicator to trigger the help process along with a context grounding approach.
Authenticity in a reliable protocol for mobile computing
Authors: Nicoletta De Francesco, Marinella Petrocchi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We consider a known protocol for reliable multicast in distributed mobile systems where mobile hosts communicate with a wired infrastructure by means of wireless technology. The original specification of the protocol does not take into consideration any notion of computer security: an adversary may eavesdrop on communications between hosts and inject packets over the wireless links. We suggest a secured version of the protocol providing authenticity and integrity of packets over the wireless links. The secure mechanisms introduced rely on two different techniques: secure wireless channels and 1-time signature schemes. Further, we outline the formal verification of part of the secured protocol.
Evaluation of subsetting programming language elements in a novice's programming environment
Authors: Peter DePasquale, John A. N. Lee, Manuel A. Pérez-Quiñones
Venue: ACM SIGCSE Bulletin (2004)

In this paper, we evaluate the effects of applying programming language subsets to the programming environment used by novice (CS1) students in a closed-laboratory setting, as well as reducing the complexity of the user interface for the environment. Our goal in this effort was to assess if such interface and application-level changes adversely impact the student or hinder the later migration to a traditional professional-strength programming environment.We focus on the comparison of the quantitative data captured from the closed-laboratory sessions (assignment grades, number of syntax / semantic errors, and the number of compilation / execution attempts) involving subjects that used a new programming environment featuring a less complex interface in two forms: one lacking support of language subsets, and one supporting the application of language subsets.We found that while using the environment supporting the application of language subsets, there was no difference in the compilation-attempt rate, the number of errors did not increase, and student grades were equivalent between the experiment groups. Additionally, following a migration to the professional environment from the simplified environment, student grades were equivalent to those that had used the professional environment throughout the experiment. Student reaction to the experimental environment was very positive, especially related to the removal of unused tools and project management features.
A Probability-Based Adaptive Algorithm for Call Admission Control in Wireless Network
Authors: Xue-Ping Wang, Jian-Li Zheng, Wei Zeng, Gen-Du Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

A probability-based adaptive algorithm for call admission control in wireless network is proposed and validated. The algorithm is somewhat similar to that of RED (Random Early Detection), which is based on probability to control the Guard channels according to controlled QoS measure. The QoS measures studied are call-blocking probability, Handoff-call blocking probability and system utility. Simulations are compared to study the performance of the probability-based algorithm, the guard channel algorithm, and the adaptive algorithm devised by Yi Zhang. And results show that the probability-based algorithm outperforms the latter two algorithms in QoS measures.
Managing conflict in software testing
Authors: Cynthia F. Cohen, Stanley J. Birkin, Monica J. Garfield, Harold W. Webb
Venue: Communications of the ACM (2004)

Conflict between software testers and developers is inevitable, but mindful managers minimize its effect on development projects through communication, mutual respect, even social interaction.
Towards reliable multimodal sensing in aware environments
Authors: Scott Stillman, Irfan Essa
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

A prototype system for implementing a reliable sensor network for large scale smart environments is presented. Most applications within any form of smart environments (rooms, offices, homes, etc.) are dependent on reliable who, where, when, and what information of its inhabitants (users). This information can be inferred from different sensors spread throughout the space. However, isolated sensing technologies provide limited information under the varying, dynamic, and long-term scenarios (24/7), that are inherent in applications for intelligent environments. In this paper, we present a prototype system that provides an infrastructure for leveraging the strengths of different sensors and processes used for the interpretation of their collective data. We describe the needs of such systems, propose an architecture to dealwith such multi-modal fusion, and discuss the initial set of sensors and processes used to address such needs.
Toward an information technology research agenda for public administration
Authors: G. David Garson
Venue: Public information technology: policy and management issues (2003)

Research questions are outlined, forming the dimensions of a research agenda for the study of information technology (IT) in public administration. The dimensions selected as being the most theoretically important include the issue of the impact of information technology on the distribution of power; the issue of information resource equity and the "digital divide"; the issue of the use of IT as symbolic action; the issue of the impact of IT on discretion; the issue of the impact of IT on organizational culture; the issue of privatization; the issue of decentralization; the issue of remote work; the issue of implementation success factors; the issue of persuasiveness of governmental websites; the issue of regulation of social vices mediated by IT; and other regulatory issues.
Grammatically Based Genetic Programming for Mining Relational Databases
Authors: Celso Y. Ishida, Aurora Pozo
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

Knowledge discovery is the most desirable endproduct of an enterprise information system. Researchesfrom different areas recognize that a new generation ofintelligent tools for automated Data Mining is needed. Inthis sense, this paper explores the Grammatically BasedGenetic Programming (GGP) approach for miningrelational databases, specifically for the classificationtask. Genetic Programming is a powerful inductiontechnique that can be applied to solve a wide variety ofproblems and, in particular, to induce classifiers.Furthermore, knowledge representation using grammarsmakes it possible to represent restrictions, complexstructured objects and relations among objects or theircomponents. A framework named GPSQL Miner wasdeveloped using this approach. It also exploits SQLfeatures to deal with Database Management System(DBMS) that permits fast access to the data. GPSQLMiner automatically generates the input grammar fromsome users' information, like goal and tables, stored inthe DBMS. This grammar is used as bias for the evolutionprocess. In order to validate this approach, the paperpresents results of experiments performed on manydatabases. These experiments show that the proposedapproach is robust, powerful, flexible and able ofattaining good performance.
XQuery speedup using replication in mapping XML into relations
Authors: Jaehoon Kim, Seog Park
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this paper, we introduce some replication methods that reduce the query cost incurred when reconfiguring XML documents from divided XML data. The fundamental idea is that query performance can be enhanced by analyzing query patterns and replicating data essential for the query performance. Several practical and effective replication methods are formulated. A translation process in which XQuery is rewritten into SQL using this replication information is performed by a heuristic method, which shows that existing methods, such as the sorted outer union, may be extended to utilize the replicas. Finally, some experiments show that these replication methods can be very useful.
Forum: a new approach for the production of educational content
Authors: Christine Daviault, Marcelo Coelho
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

eLearning is developing at an ever increasing rate as universities and colleges recognize its vast potential to reach a deeper and fragmented student pool. For a while, eLearning was touted as the future of education, the goal we should be aiming for to answer the needs of a diversified student population with requirements predicated by the need to constantly learn new things coupled with the realities of daily life.However, as the rosy glow has faded somewhat, educators, students, and researchers alike, have raised important issues to challenge some of our assumptions as producers of on-line course content. Instructors cite a lack of time and training and concerns over security, students complain of feeling isolated and poorly stimulated by uninspiring content, while researchers question the use of "sacred" concepts such as interactivity and their real impact on the user experience.As designers and developers of on-line content for a university, we have had to address these issues to produce content that reflects, in the end, more accurately what the ultimate users feel comfortable with, but also reaches the goals set forth by faculty. This forum will focus on some of these issues and the process we went through to come up with possible solutions. We will use as an illustration of our results, an on-line course dedicated to the study of Organized Crime that we are in the process of developing and that proposes some ideas to create more appealing and enriching educational on-line content.
Customizing digital storefronts using the knowledge-based approach
Authors: Fiona Y. Chan, William K. Cheung
Venue: Information management: support systems & multimedia technology (2003)

The concept of personalization has long been advocated to be one of the edges to improve the stickiness of on-line stores. By enabling an on-line store with adequate knowledge about the preference characteristics of different customers, it is possible to provide customized services to further raise the customer satisfaction level. In this paper, we describe in detail how to implement a knowledge-based recommender system for supporting such an adaptive store. Our proposed conceptual framework is characterized by a user profiling and product characterization module, a matching engine, an intelligent gift finder, and a backend subsystem for content management. A prototype of an on-line furnishing company has been built for idea illustration. Limitations and future extensions of the proposed system are also discussed.
A Theory of Frame Transformations for Belief Combination
Authors: Sergio A. Alvarez
Venue: Annals of Mathematics and Artificial Intelligence (2004)

In approximate reasoning, aggregation of multiple measures representing uncertainty, belief, or desirability may be achieved by defining an appropriate combination operator. Formalisms such as probability theory and Dempster&ndash;Shafer evidence theory have proposed specific forms for these operators. Ad-hoc approaches to combination have also been put forth, a classical example being the MYCIN calculus of certainty factors. In the present paper we present an analytical theory of combination operators based on the idea that certain combination operators are characterized by special geometric frames of reference or systems of coordinates in which the operators reduce to the canonical arithmetic sum. The cornerstone of our theory is an algorithm that determines whether a given combination operator can be so reduced, and that explicitly constructs a normalizing reference frame directly from the operator whenever such a frame exists. Our approach provides a natural nonlinear scaling mechanism that extends operators to parameterized families, allowing one to adjust the sensitivity of the operators to new information and to control the asymptotic growth rate of the aggregate values produced by the operators in the presence of an unbounded number of information sources. We also give a procedure to reconstruct the normalizing reference frame directly from the group of nonlinear scaling operations associated with it.
Cooperative computing with fragmentable and mergeable groups
Authors: Chryssis Georgiou, Alex A. Shvartsman
Venue: Journal of Discrete Algorithms (2003)

This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P ≤ N). The processors use a group communication service (GCS) to coordinate their activity in the setting where dynamic changes in the underlying network topology cause the processor groups to change over time. GCSs have been recognized as effective building blocks for fault-tolerant applications in such settings. Our results explore the efficiency of fault-tolerant cooperative computation using GCSs. The original investigation of this area by (Dolev et al., Dynamic load balancing with group communication, in: Proc. of the 6th International Colloquium on Structural Information and Communication Complexity, 1999) focused on competitive lower bounds, non-redundant task allocation schemes and work-efficient algorithms in the presence of fragmentation regroupings. In this work we investigate work-efficient and message-efficient algorithms for fragmentation and merge regroupings. We present an algorithm that uses GCSs and implements a coordinator-based strategy. For the analysis of our algorithm we introduce the notion of view-graphs that represent the partially-ordered view evolution history witnessed by the processors. For fragmentations and merges, the work of the algorithm (defined as the worst case total number of task executions counting multiplicities) is not more than min{N ċ f + N, N ċ P}, and the message complexity is no worse than 4(N ċ f + N + P ċ m), where f and m denote the number of new groups created by fragmentations and merges, respectively. Note that the constants are very small and that, interestingly, while the work efficiency depends on the number of groups f created as the result of fragmentations, work does not depend on the number of groups m created as the result of merges.
DVD transcoding via Linux metacomputing
Authors: F. J. Gonzalez-Castaño, R. Asorey-Cacheda, R. P. Martinez-Alvarez, F. Comesaña-Seijo, J. Vales-Alonso
Venue: Linux Journal (2003)

Strategies for converting MPEG-2 video from DVDs to MPEG-4 for next-generation home media applications.