ppxscal/embedding_network huggingface dataset:
OQAFMA Querying agent for the foundational model of anatomy: a prototype for providing flexible and efficient access to large semantic networks
Authors: Peter Mork, James F. Brinkley, Cornelius Rosse
Venue: Journal of Biomedical Informatics (2003)

The development of large semantic networks, such as the UMLS, which are intended to support a variety of applications, requires a flexible and efficient query interface for the extraction of information. Using one of the source vocabularies of UMLS as a test bed, we have developed such a prototype query interface. We first identify common classes of queries needed by applications that access these semantic networks. Next, we survey STRUQL, an existing query language that we adopted, which supports all of these classes of queries. We then describe the OQAFMA Querying Agent for the Foundational Model of Anatomy (OQAFMA), which provides an efficient implementation of a subset of STRUQL by pre-computing a variety of indices. We describe how OQAFMA leverages database optimization by converting STRUQL queries to SQL. We evaluate the flexibility and efficiency of our implementation using English queries written by anatomists. This evaluation verifies that OQAFMA provides flexible, efficient access to one such large semantic network, the Foundational Model of Anatomy, and suggests that OQAFMA could be an efficient query interface to other large biomedical knowledge bases, such as the Unified Medical Language System.
Privacy: A Machine Learning View
Authors: Staal A. Vinterbo
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

The problem of disseminating a data set for machine learning while controlling the disclosure of data source identity is described using a commuting diagram of functions. This formalization is used to present and analyze an optimization problem balancing privacy and data utility requirements. The analysis points to the application of a generalization mechanism for maintaining privacy in view of machine learning needs. We present new proofs of NP-hardness of the problem of minimizing information loss while satisfying a set of privacy requirements, both with and without the addition of a particular uniform coding requirement. As an initial analysis of the approximation properties of the problem, we show that the cell suppression problem with a constant number of attributes can be approximated within a constant. As a side effect, proofs of NP-hardness of the minimum k{\hbox{-}}{\rm{union}}, maximum k{\hbox{-}}{\rm{intersection}}, and parallel versions of these are presented. Bounded versions of these problems are also shown to be approximable within a constant.
On Sampling for Surfaces Reconstruction
Authors: Yong-chun Zhang, Fei-peng Da, Wen-zhong Song
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In CAD and reverse engineering, triangulation, i.e. C^0 interpolation, of scattered sampled points should has the property of shape-preserving for precisely reconstruction of original surface. This depends much more on sampling. It is well known that over-sampling or under-sampling either increases computing consumption in triangulation or cannot get the correct reconstruction. In this paper, the local structure of 3D curve is firstly analyzed in frequent domain with Fourier transformation. And then the sampling frequency based on Shannon theorem is discussed. Subsequently, generalizing it to the surface case, we present in particularly a sampling method for 3D surfaces. The results indicate that , with the method, dense enough triangulations can be obtained so as to avoid over- and under-sampling.
Minimum Entropy Clustering and Applications to Gene Expression Analysis
Authors: Haifeng Li, Keshu Zhang, Tao Jiang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First, we propose the minimum entropy (measured on a posteriori probabilities) criterion, which is the conditional entropy of clusters given the observations. Fanoýs inequality indicates that it could be a good criterion for clustering. We generalize the criterion by replacing Shannonýs entropy with Havrda-Charvatýs structural ¿-entropy. Interestingly, the minimum entropy criterion based on structural á-entropy is equal to the probability error of the nearest neighbor method when ¿ = 2. This is another evidence that the proposed criterion is good for clustering. With a non-parametric approach for estimating a posteriori probabilities, an efficient iterative algorithm is then established to minimize the entropy. The experimental results show that the clustering algorithm performs significantly better than k-means/medians, hierarchical clustering, SOM, and EM in terms of adjusted Rand index. Particularly, our algorithm performs very well even when the correct number of clusters is unknown. In addition, most clustering algorithms produce poor partitions in presence of outliers while our method can correctly reveal the structure of data and effectively identify outliers simultaneously.
External Matching in UDDI
Authors: John Colgrave, Rama Akkiraju, Richard Goodwin
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

As an industry-backed registry for Web Services,UDDI plays an important role in helping requesters findsuitable services. Unfortunately, the current searchfunctions in UDDI are limited in their support for makingautomatic service selection decisions. While someapproaches have been suggested to enhance the searchcapabilities in UDDI using service semantics, they sufferfrom limitations. These approaches either prescribeperforming semantic matching outside of UDDI leaving itssearch function unchanged or propose embedding aspecific matching engine within UDDI thereby making thesearch function inflexible. In this work, we present aflexible mechanism to enhance UDDI's search function.Using our approach, users can integrate multiple externalmatching services with a UDDI registry to support multipleexternal service description languages. The result is aUDDI registry with flexible and intelligent service searchfunction that can be used for dynamic service selection.
VirusFinder: A Web-Based Virus Identification System Using Viral Nucleotide Signatures
Authors: Yan Ding, Hong Cao, Shu Wen
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

VirusFinder was developed as a web-based virus identification system using viral signatures. Nucleotide signature-based detection has been proven to be a rapid and accurate pathogen identification approach in natural outbreaks or acts of bioterrorism. Species-specific signatures of selected families of HFVs including arenaviruses, bunyaviruses, filoviruses, and flaviviruses have been identified by comparative genomics. The unique signatures for each individual species of HFVs were derived from the multiple sequence alignments and were then saved into the signature database after validation. VirusFinder was implemented using J2EE technology with an intelligent signature recognition algorithm. As such, species-level differentiation and identification of HFVs was automatically achieved given an input of unknown nucleotide sequences. Results show that VirusFinder is able to identify HFVs at species level with 100% accuracy.
On the mean value of Smarandache double factorial function
Authors: Gao Jing, Liu Huaning
Venue: Smarandache Notions Journal (2004)

For any positive integer n, the Smarandache double factorial function df(n) is defined to be the smallest integer such that df(n)!! is a multiple of n. In this paper, we study the hybrid mean value of the Smarandache double factorial function and the Mangoldt function, and give a sharp asymptotic formula.
This wonderful life
Authors: Liam Kemp
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A young woman mourning the death of her husband takes a walk into the countryside, feeling alone and withdrawn from life. Her sense of isolation is lifted when she discovers, beneath a bridge, an abandoned baby. As the woman and the baby begin to develop a natural bond, her perception of what it means to be alive changes forever. Copyright held by creator. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The encyclopedia of life project: grid software and deployment
Authors: Wilfred W. Li, Robert W. Byrnes, Jim Hayes, Adam Birnbaum, Vicente M. Reyes, Atif Shahab, Coleman Mosley, Dmitry Pekurovsky, Greg B. Quinn, Ilya N. Shindyalov, Henri Casanova, Larry Ang, Fran Berman, Peter W. Arzberger, Mark A. Miller, Philip E. Bourne
Venue: New Generation Computing (2004)

The ongoing global effort of genome sequencing is making large scale comparative proteomic analysis an intriguing task. The Encyclopedia of Life (EOL; http://eol.sdsc.edu) project aims to provide current functional and structural annotations for all available proteomes, a computational challenge never seen before in biology. Using an integrative genome annotation pipeline (iGAP), we have produced 3D models and functional annotations for more than 100 proteomes thus far. This process is greatly facilitated by grid compute resources, and especially by the development of grid application execution environment. AppLeS (Application-Level Scheduling) Parameter Sweep Template (APST) has been adopted by the EOL project as a mediator to grid middleware. APST has made the annotation process much more efficient, highly automated and scalable. Currently we are building a domain-specific bioinformatics workflow management system (BWMS) on top of APST, which further streamlines grid deployment of life science applications. With these developments in mind, we discuss some common problems and expectations of grid computing for high throughput proteomics.
Information Retrieval Techniques for Peer-to-Peer Networks
Authors: Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimitrios Gunopulos
Venue: Computing in Science and Engineering (2004)

Peer-to-peer (P2P) systems are application-layer networks that let networked hosts share resources in a distributed environment. An important attribute of P2P networks is the ability to efficiently search the contents of other peers. In this article, the authors survey existing search techniques for information retrieval (IR) in P2P networks, including recent techniques that they propose. They also present a realistic experimental evaluation and comparison of these techniques, using a distributed middleware infrastructure they designed and implemented.
Analysis and Hardware Design of a Scalable Dual JPEG-2000 Entropy Coder
Authors: I. Aouadi, O. Hammami
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The JPEG-2000 image compression standard is increasingly gaining widespread importance. The rich variety of features makes it highly suitable for a large spectrum of applications but at the same time its associated complexity makes it hard to optimize for particular implementations. One the key step during the processing is entropy coding which takes about 70 % of the execution time. We propose in this paper an analysis and hardware design of a dual entropy coder with the goal of being used as a coprocessor to the general JPEG-2000 flow.
A Time Stamp Control Strategy for CBR Based Reactive Navigation in Dynamic Environments with Priorities
Authors: C. Urdiales, E. J. Perez, F. Sandoval
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

This paper presents a CBR based reactive navigation system for autonomous robots.The main advantage of the proposed system is that it learns by experience how to deal with unexpected situations in dynamic environments.A time stamp control method has been included to deal with mobile obstacles in intersections, where there are priorities depending on the relative positions of those obstacles and the robot.The proposed strategy has been sucessfully tested in real environments.
A Novel Web Sales Tracking Solution for Multi-Channel Marketing Programs on Electronic Commerce
Authors: Thomas Kwok, Thao Nguyen
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Internet based marketing programs have become critically important to many businesses, and at the same time more technologically advanced. If a business practices multiple types of Web marketing campaigns, sells multiple brands, and manages multiple online stores, it has to use market tracking solutions to monitor sales and leads from different marketing programs, and track and evaluate the performance of each program. A novel solution for tracking Web sales for multi-channel marketing programs is described. It consists of two technological components. A transient landing page provides a unique way to centralize, control and distribute Web traffic from different programs, and in doing so saves a Web merchant time, cost and effort in administrating its online stores. A multi-channel identifier allows the merchant to track sales and leads, and to evaluate the results and effectiveness of each program.
On the 49-th Smarandache's problem
Authors: Gao Jing
Venue: Smarandache Notions Journal (2004)

For any prime number p and positive integer n, let Sp(n) be the smallest integer such that Sp(n)! is divisible by pn. In this paper, we study the mean value of the Dirichlet series with coefficients Sp(n). We also show that Sp(n) closely relates to Riemann Zeta function, and give a few asymptotic formulae involving Sp(n) and other arithmetic functions.
FPGA Based Design of the Railway's Interlocking Equipments
Authors: Radek Dobias, Hana Kubatova
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper describes the architecture of a safety system of the railway's interlocking equipment, which has been developed for Czech railways. The system will be used for the railway crossing gate. This system is based on FPGA blocks and has to fulfil the requirements for a fault tolerant system with a fail-safe function. The dual logic and TMR principle are used to increase its dependability. Several self-test and self-diagnostics features are sed, such as an LFSR based built-in self-test, theFPGA readback and 1 out of 2 error detection codes. The functional logic ses a majority correction and the FPGA box reprogramming to precede the failure. The reliability analyses, models and reliability characteristics calculations of this system are described. Markov chain models are sed for the reliability analyses. The TMR principles for fault tolerant system and the Dual-TMR logic have been sed in our design and both attempts are compared.
Applications of Web Mining " From Web Search Engine to P2P Filtering
Authors: Hiroyuki Kawano
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We have developed Japanese web search engine "Mondou(RCAAU)", which was based on the emerging technologiesof data mining. Our search engine provides associativekeywords which are tightly related to focusing webpages. We also implemented the visual interface based onthe technology of information visualization. In order to improvethe performance of various search strategies by usingcharacteristics of web systems, we try to implement the advancedweb information systems with data mining and informationtechnologies.Firstly, we introduce various web mining algorithm,which efficiently reduces the computing cost of websearch. We pay attention to a part of useful pages effectivelyand improve the performance of web search by usingour proposed algorithms.Secondly, for preserving huge volume of born-digital informationin the internet, we are focusing on technologies ofweb archiving system likeWARP (http://warp.ndl.go.jp/). Inorder to handle monotonously increasing digital information,we have to resolve many difficult problems of long lifedata preservation by improving web searching techniques.Our experiences of our Mondou web search engine and cooperativedistributed web robots are very useful and effective.Finally, the technologies of P2P (Peer-to-Peer) distributedsearch systems are becoming important rapidly.For example, it is very hard to discover appropriate informationresources by simple queries of Gnutella, Freenetand so on. Therefore, in order to realize the topic-drivensearch, we propose more intelligent search systems, whichare based on the technologies of data mining.
Silicon nanocrystal memories
Authors: S. Lombardo, B. De Salvo, C. Gerardi, T. Baron
Venue: Microelectronic Engineering (2004)

In this paper, we present an overview of memory structures fabricated by our group by using silicon nanocrystals as storage nodes. These devices show promising characteristics as candidates for future deep-submicron non-volatile memories.
A power, packaging, and cooling overview of the IBM eServer z900
Authors: P. Singh, S. J. Ahladas, W. D. Becker, F. E. Bosco, J. P. Corrado, G. F. Goth, S. Iruvanti, M. A. Nobile, B. D. Notohardjono, J. H. Quick, E. J. Seminaro, K. M. Soohoo, C. Wu
Venue: IBM Journal of Research and Development (2002)

This paper provides an overview of the power, packaging, and cooling aspects of the IBM eServer z900 design. The semiconductor processor chips must be supported and protected in a mechanical structure that has to provide electrical interconnects while maintaining the chip junction temperature within specified limits. The mechanical structure should be able to withstand shock and vibrations during transportation or events such as earthquakes. The processor chips require electrical power at well-regulated voltages, unaffected by the ac-line voltage and load current fluctuations. The acoustical and electromagnetic noise produced by the hardware must be within the limits set by national regulatory agencies, and the electronic operations must be adequately protected from disruption caused by electromagnetic radiation. For high availability, the power, packaging, and cooling hardware must have redundancy and the ability to be maintained while the system is operating. This paper first overviews the packaging hardware, followed by a description of the first- and second-level packaging, which includes the mother board and the multichip module. Thermal management is discussed from the point of view of both the multichip module and the overall system. Power conversion, management, and distribution are presented next. Finally, the design aspects involved with meeting the requirements of electromagnetic compatibility, acoustics, and immunity to shock, vibration, and earthquakes are discussed.
A General Decision Model for a Sustainable Groundwater Planning
Authors: Riccardo Minciardi, Michela Robba, Roberto Sacile
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Water is essential for human life and its protection and sustainable exploitation are crucial tasks. Specifically, it is necessary to identify the possible water bodies that could be exploited and, according to water demand needs, to define strategies that preserve the water resource from depletion and pollution and that are environmentally sustainable. The aim of this work is to present an architecture of a Decision Support System for groundwater supply and quality planning and management, able to integrate physical/chemical models (that take into account phenomena typical of agricultural, saltwater intrusion, and mountain aquifers) and decision models (both for long term planning and short term management problems).
Hierarchies in HTML Documents: Linking Text to Concepts
Authors: Radek Burget
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

For the successful setting of the Semantic Web, it is necessary to provide tools for linking the large amounts of data that are currently available in HTML documents to the Semantic Web ontologies. Due to the enormous variability of the HTML code, it is very limiting to define direct bindings between patterns of the HTML code and the concepts. We propose an approach based on modeling the visual part of the rendered document and describing the key characteristics of the data presentation in a general way. As a next step, we propose the way for using this model for locating the instances of the concepts in the document using the approximate tree matching algorithms and regular expressions.
Modular product design with grouping genetic algorithm: a case study
Authors: Victor B. Kreng, Tseng-Pin Lee
Venue: Computers and Industrial Engineering (2004)

Modular products are products that fulfill various functions through the combination of distinct modules. These detachable modules are constructed both according to the maximum physical and functional relations among components and maximizing the similarity of specifically modular driving forces. Accordingly, a non-linear programming is proposed to identify separable modules and simultaneously optimize the number of modules. This paper presents a systematic approach to accomplish modular product design in four major phases. Phase 1 is by means of functional and physical interaction analysis to format a component-to-component correlation matrix. Phase 2 is the exploration of design requirements to evaluate the relative importance of each modular driver. In phase 3, non-linear programming is used to formulate the objective function. In the final phase, a heuristic grouping genetic algorithm is adopted to search for the optimal or near-optimal modular architecture. This process and its application are illustrated by a real case of an electrical consumer product provided by an Original Design Manufacturer. The results demonstrate that the designer could direct a new approach to establish product modules according to the relative importance of modular drivers and the interaction among components.
Copyright and Creativity
Authors: Michael Lesk
Venue: IEEE Security and Privacy (2004)

Larry Lessig documents the concentration of media ownership and the expansion of intellectual property's protected area, which work to put increasingly more creative output in the hands of fewer organizations. Even cliché phrases can nowbelongý to somebody. Rupert Murdochýs Fox News has tried to claim control of the words "fair and balanced." for example,and Donald Trump wants to trademark "you're fired." What can you say if you can't allude to anything that's gone before without stepping on the toes of someone who can afford a bigger lawsuit than you can?