ppxscal/embedding_network huggingface dataset:
The interaction of domain knowledge and linguistic structure in natural language processing: interpreting hypernymic propositions in biomedical text
Authors: Thomas C. Rindflesh, Marcelo Fiszman
Venue: Journal of Biomedical Informatics (2003)

Interpretation of semantic propositions in free-text documents such as MEDLINE citations would provide valuable support for biomedical applications, and several approaches to semantic interpretation are being pursued in the biomedical informatics community. In this paper, we describe a methodology for interpreting linguistic structures that encode hypernymic propositions, in which a more specific concept is in a taxonomic relationship with a more general concept. In order to effectively process these constructions, we exploit underspecified syntactic analysis and structured domain knowledge from the Unified Medical Language System (UMLS). After introducing the syntactic processing on which our system depends, we focus on the UMLS knowledge that supports interpretation of hypernymic propositions. We first use semantic groups from the Semantic Network to ensure that the two concepts involved are compatible; hierarchical information in the Metathesaurus then determines which concept is more general and which more specific. A preliminary evaluation of a sample based on the semantic group Chemicals and Drugs provides 83% precision. An error analysis was conducted and potential solutions to the problems encountered are presented. The research discussed here serves as a paradigm for investigating the interaction between domain knowledge and linguistic structure in natural language processing, and could also make a contribution to research on automatic processing of discourse structure. Additional implications of the system we present include its integration in advanced semantic interpretation processors for biomedical text and its use for information extraction in specific domains. The approach has the potential to support a range of applications, including information retrieval and ontology engineering.
Open Source to the Core
Authors: Jordan Hubbard
Venue: Queue (2004)

The open source development model is not exactly new. Individual engineers have been using open source as a collaborative development methodology for decades. Now that it has come to the attention of upper and middle management, however, it's finally being openly acknowledged as a commercial engineering force-multiplier and important option for avoiding significant software development costs.
Managing Personal Digital Resources
Authors: Thang To, Dan Smith
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The amount of information available in digital form is growing explosively. Indexing and searching this information efficiently is essential if we are to manage it effectively. This paper presents an approach for describing those data files so that they can be located quick and easily. It also introduces an approximate temporal retrieval model, supports multiple calendars, and allows users to define imprecise search queries with imprecise temporal constraints.
Nonmonotonic causal theories
Authors: Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Norman McCain, Hudson Turner
Venue: Artificial Intelligence (2004)

The nonmonotonic causal logic defined in this paper can be used to represent properties of actions, including actions with conditional and indirect effects, nondeterministic actions, and concurrently executed actions. It has been applied to several challenge problems in the theory of commonsense knowledge. We study the relationship between this formalism and other work on nonmonotonic reasoning and knowledge representation, and discuss its implementation, called the Causal Calculator.
A fixed-parameter tractable algorithm for matrix domination
Authors: Mark Weston
Venue: Information Processing Letters (2004)

MATRIX DOMINATION is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same column as all other non-zero entries. Using a kernelization and search tree approach, we show the problem to be fixed-parameter tractable with running time O(n3 + 1.959kk5/2).
Evolvable hardware techniques for on-chip automated reconfiguration of programmable devices
Authors: A. Stoica, R. S. Zebulum, D. Keymeulen, M. I. Ferguson, V. Duong, X. Guo
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

While complete automated design is a harder problem than computer-assisted design, automated hardware reconfiguration is an even more challenging problem, because it needs to adjust to limited resources and various factors, such as noise and parasitic capacitance, a resistance and inductance. This paper presents some experimental results of on-chip automated design and reconfiguration using evolvable hardware techniques. It describes a stand-alone board level evolvable system, and its use to demonstrate on-chip synthesis of new circuits in only a few seconds. The experiments presented here indicate a recovery capability in the case of extreme environmental conditions, such as extreme temperatures, that adversely affect electronics. Some of the difficulties of dealing with the real hardware are exposed, as well as challenges more generally related to automated evolution of complex electronic systems.
Towards the development of a conceptual distance metric for the UMLS
Authors: Jorge E. Caviedes, James J. Cimino
Venue: Journal of Biomedical Informatics (2004)

The objective of this work is to investigate the feasibility of conceptual similarity metrics in the framework of the Unified Medical Language System (UMLS). We have investigated an approach based on the minimum number of parent links between concepts, and evaluated its performance relative to human expert estimates on three sets of concepts for three terminologies within the UMLS (i.e., MeSH, ICD9CM, and SNOMED). The resulting quantitative metric enables computer-based applications that use decision thresholds and approximate matching criteria. The proposed conceptual matching supports problem solving and inferencing (using high-level, generic concepts) based on readily available data (typically represented as low-level, specific concepts). Through the identification of semantically similar concepts, conceptual matching also enables reasoning in the absence of exact, or even approximate, lexical matching. Finally, conceptual matching is relevant for terminology development and maintenance, machine learning research, decision support system development, and data mining research in biomedical informatics and other fields.
Time-critical collision detection using an average-case approach
Authors: Jan Klein, Gabriel Zachmann
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection.We pursue an average-case approach that yields a numerical measure of the quality. This can either be specified by the simulation or interaction, or it can help to assess the result of the collision detection in a time-critical system.Conceptually, we consider sets of polygons during traversal and estimate probabilities that there is an intersection among these sets. This can be done efficiently by storing characteristics about the average distribution of the set of polygons with each node in a bounding volume hierarchy (BVH). Consequently, we neither need any polygon intersection tests nor access to any polygons during the collision detection process.Our approach can be applied to virtually any BVH. Therefore, we call a BVH that has been augmented in this way an average-distribution tree or ADB-tree.We have implemented our new approach with two basic BVHs and present performance measurements and comparisons with a very fast previous algorithm, namely the DOP-tree. The results show a speedup of about a factor 3 to 6 with only approximately 4% error.
A New Conceptual Clustering Framework
Authors: Nina Mishra, Dana Ron, Ram Swaminathan
Venue: Machine Learning (2004)

We propose a new formulation of the conceptual clustering problem where the goal is to explicitly output a collection of simple and meaningful conjunctions of attributes that define the clusters. The formulation differs from previous approaches since the clusters discovered may overlap and also may not cover all the points. In addition, a point may be assigned to a cluster description even if it only satisfies most, and not necessarily all, of the attributes in the conjunction. Connections between this conceptual clustering problem and the maximum edge biclique problem are made. Simple, randomized algorithms are given that discover a collection of approximate conjunctive cluster descriptions in sublinear time.
Efficient Similarity Search in Streaming Time Sequences
Authors: M. Kontaki, A. N. Papadopoulos
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Query processing in data streams is a very importantresearch direction.The challenge in a databaseof data streams is to provide efficient algorithms andaccess methods for query processing, taking into considerationthe fact that the database changes continuously as new data arrive.Traditional access methodsthat continuously update the data costs.In thispaper we present IDC-Index, an efficient techniquefor similarity query processing in streaming time sequences,which is based on a multidimensional accessmethod enhanced with a deferred update policy andan incremental computation of the Discrete FourierTransform (DFT), which is used as a feature extractionmethod.The method manages to reduce the numberof false alarms examined and therefore achieveshigh answers/candidates ratio.Moreover, an extensiveperformance evaluation based on synthetic randomwalk and real time sequences have shown that theproposed technique outperforms significantly existingapproaches for similarity range query processing.
First Step to Combining Control and Data Speculation
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Recently there are many studies of data value prediction for increasing instruction level parallelism, and it is found that data speculation affects branch prediction accuracy. Even when data dependences are speculated successfully, processor performance would be degraded if branch prediction accuracy were decreased. On the other hand, branch prediction studies are nearly matured. While it becomes very difficult to increase the accuracy, there is still a vast gap between actual and ideal processor performance. From these considerations, we investigate to combine control and data speculation. In this paper, we evaluate the correlation between control speculation and data speculation and then propose to predict branch outcomes using data value prediction.
The backwash effect on SQL skills grading
Authors: Julia Coleman Prior, Raymond Lister
Venue: ACM SIGCSE Bulletin (2004)

This paper examines the effect of grading approaches for SQL query formulation on students' learning strategies. The way that students are graded in a subject has a significant impact on their learning approach, and it is crucial that graded tasks are carefully designed and implemented to inculcate a deep learning experience. An online examination system is described and evaluated.
Robust pcps of proximity, shorter pcps and applications to coding
Authors: Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil Vadhan
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We continue the study of the trade-off between the length of PCP sand their query complexity, establishing the following main results(which refer to proofs of satisfiability of circuits of size n): 1 We present PCPs of length exp(Õ(log log n)2)•n that can be verified by making o(log logn) Boolean queries.For every ε>0, we present PCPs of length exp(logε n)• n that can be verified by making a constant number of Boolean queries. In both cases, false assertions are rejected withconstant probability (which may be set to be arbitrarily close to 1). The multiplicative overhead on the length of the proof, introduced by transforming a proof into a probabilistically checkable one, is just quasi-polylogarithmic in the first case (ofquery complexity o(log logn)), and 2(log n)ε, for any ε>0, in the second case (of constant query complexity). In contrast, previous results required at least 2 √logn overhead in the length, even to get query complexity 2 √log n. Our techniques include the introduction of a new variant of PCPs that we call "Robust PCPs". These new PCPs facilitate proof composition, which is a central ingredient in construction of PCP systems. (A related notion and its composition properties were discovered independently by Dinur and Reingold. ) Our main technical contribution is a construction of a "length-efficient" Robust PCP. While the new construction uses many of the standard techniques in PCPs, it does differ from previous constructions in fundamental ways, and in particular does not use the "parallelization" step of Arora et al. . The alternative approach may be of independent interest. We also obtain analogous quantitative results for locally testable codes. In addition, we introduce a relaxed notion of locally decodable codes,and present such codes mapping k information bits to code words of length κ1+ε, for any ε>0.
A Framework for Contractual Resource Sharing in Coalitions
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

We develop a framework for specifying and reasoningabout policies for sharing resources in coalitions, focussinghere on a particular, common type of contract inwhich coalition members agree to make available sometotal amount of specified resource over a given time period.The main part of the framework is a policy languagewith two basic elements: 'obligations' (of a member enterpriseto provide a total amount of resource over a giventime period) express the coalition policy, and 'entitlements'(granted by an enterprise to other coalition members) expressthe local policies of the coalition members. We discussthe conditions under which a local policy can be saidto be in compliance with, or meet, the obligations of a coalitionpolicy, and the conditions under which an obligation,and by extension a contract, can be said to be violated orfulfilled.
Clustering Motion
Authors: Sariel Har-Peled
Venue: Discrete Computational Geometry (2004)

Given a set of moving points in &#x211d;d, we show how to cluster them in advance, using a small number of clusters, so that at any time this static clustering is competitive with the optimal k-center clustering at that time. The advantage of this approach is that it avoids updating the clustering as time passes. We also show how to maintain this static clustering efficiently under insertions and deletions.To implement this static clustering efficiently, we describe a simple technique for speeding up clustering algorithms and apply it to achieve faster clustering algorithms for several problems. In particular, we present a linear time algorithm for computing a 2-approximation to the k-center clustering of a set of n points in &#x211d;d. This slightly improves the algorithm of Feder and Greene, that runs in &#x0398;(n log k) time (which is optimal in the algebraic decision tree model).
Novel actuators for haptic displays based on electroactive polymers
Authors: Andrea Mazzone, Rui Zhang, Andreas Kunz
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

After a wrap-up in the human physiology and an overview on physical principles, this paper introduces four novel types of actuators for haptic feedback devices based on electroactive polymers, which were developed and evaluated for their suitability for haptic feedback devices. The electroactive polymers show many promising properties, such as big expansion, high frequency range and big force exertion for instance. Unfortunately they are still in the fledgling state and are not available on the market yet. The actuators presented in this paper are a contribution to the haptic and to the electro active polymer researchers community.
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
Authors: Fabi&#x00e1;n A. Chudak, Tim Roughgarden, David P. Williamson
Venue: Mathematical Programming: Series A and B (2004)

Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [15] discovered primal-dual approximation algorithms for the metric uncapacitated facility location and k-median problems. In this paper we show how Garg&#x2019;s algorithms can be explained simply with ideas introduced by Jain and Vazirani, in particular via a Lagrangean relaxation technique together with the primal-dual method for approximation algorithms. We also derive a constant factor approximation algorithm for the k-Steiner tree problem using these ideas, and point out the common features of these problems that allow them to be solved with similar techniques.
The Thirteen Spheres: A New Proof
Authors: Kurt M. Anstreicher
Venue: Discrete Computational Geometry (2004)

The &#x201c;thirteen spheres problem,&#x201d; also known as the &#x201c;Gregory&#x2013;Newton problem,&#x201d; is to determine the maximum number of three-dimensional spheres that can simultaneously touch a given sphere, where all the spheres have the same radius. The history of the problem goes back to a disagreement between Isaac Newton and David Gregory in 1694. Using a combination of harmonic analysis and linear programming it can be shown that the maximum cannot exceed 13, but in fact 13 is impossible. The standard proof that the maximum is 12 uses an ad hoc construction that does not appear to extend to higher dimensions. In this paper we describe a new proof that uses linear programming bounds and properties of spherical Delaunay triangulations.
Parallelizing Clustering of Geoscientific Data Sets using Data Streams
Authors: Silvia Nittel, Kelvin T. Leung
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Computing data mining algorithms such as clustering onmassive geospatial data sets is still not feasible nor efficienttoday. In this paper, we introduce a k-means algorithmthat is based on the data stream paradigm. The so-calledpartial/merge k-means algorithm is implemented as a setof data stream operators which are adaptable to availablecomputing resources such as volatile memory and processingpower. The partial data stream operator consumes asmuch data as can be fit into RAM, and performs a weightedk-means on the data subset. Subsequently, the weightedpartial results are merged by a second data stream operator.All operators can be cloned, and parallelized. Inour analytical and experimental performance evaluation,we demonstrate that the partial/merge k-means can outperforma one-step algorithm by a large margin with regardto overall computation time and clustering quality with increasingdata density per grid cell.
Adaptive Cache-Driven Request Distribution in Clustered EJB Systems
Authors: Hazem Elmeleegy, Noha Adly, Magdy Nagi
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper presents a new algorithm for requestdistribution in clustered EJB systems. A new classificationfor EJB requests is first introduced, on which requestdistribution is based. The objective is to achieve loadbalancing and to enhance the caching performance in theEJB containers. The algorithm is based on periodicallycollecting traffic statistics from the EJB containers, andthen solving a constrained optimization problem that findsthe best distribution strategies for each request type. Anevent-driven simulator is built for the performanceevaluation, where the TPC-W benchmark is used as theworkload. Simulation results show that for relatively smallsizes of the containers' caches, the new algorithmoutperforms the random and round robin algorithms,currently used in clustered EJB systems. In addition, itscales better with the cluster size and can adapt to thevarying load patterns.
A comparative study on user performance in the Virtual Dressmaker application
Authors: Markus Wacker, Stanislav L. Stoev, Michael Keckeisen, Wolfgang Straßer
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

We report on a user study, investigating the efficiency of user interaction in a Virtual Reality application compared to 3D desktop applications.The Virtual Dressmaker is a Virtual Reality application for virtual cloth design, assembly, and simulation that supports advanced 6DoF interaction techniques. We conjecture that these interaction techniques are more natural for the users and lead to faster and more precise results than common desktop applications.In our user study we investigate interaction tools for positioning garment patterns in VR and compare the results to interaction with common 3D desktop applications. We measure completion time and precision of the positioned patterns and evaluate the subjective impressions of the users.The results show that Virtual Environments, and the presented interaction tools in particular, provide a valuable method for cloth design and assembly. Moreover, certain features of current 3D desktop design tools can be exploited for further improvements of VR interaction.
Formula to obtain the next prime in an arithmetic progression
Authors: Sebastián Martín Ruiz
Venue: Smarandache Notions Journal (2004)

In this article, a formula is given to obtain the next prime in an arithmetic progression.
Image Processing Algorithms on Reconfigurable Architecture using HandelC
Authors: V. Muthukumar, Daggu Venkateshwar Rao
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Computer manipulation of images is generally defined as Digital Image Processing (DIP). DIP is employed in variety of applications, including video surveillance, target recognition, and image enhancement. Some of the algorithms used in image processing include convolution, edge detection and contrast enhancement. These are usually implemented in software but may also be implemented in special purpose hardware to reduce speed. In this work the canny edge detection [A computational approach to the edge detection] architecture has been developed using reconfigurable architecture and hardware modeled using a C-like hardware language called Handle-C. The proposed architecture is capable of producing one edge-pixel every clock cycle. The hardware modeled was implemented using the DK2 IDE tool on the RC1000 Xilinx Vertex FPGA based board [Celoxica Ltd. www.celoxica.com]. The algorithm was tested on standard image processing benchmarks and significances of the result are discussed.