Biological literature databases continue to grow rapidly with vital information that is important for conducting sound biomedical research. As data and information space continue to grow exponentially, the need for ra...
详细信息
Biological literature databases continue to grow rapidly with vital information that is important for conducting sound biomedical research. As data and information space continue to grow exponentially, the need for rapidly surveying the published literature, synthesizing, and discovering the embedded "knowledge" is becoming critical to allow the researchers to conduct "informed" work, avoid repetition, and generate new hypotheses. Knowledge, in this case, is defined as one-to-many and many-to-many relationships among biological entities such as gene, protein, drug, disease, etc. the knowledge discovery process basically involves identification of biological object names, reference resolution, ontology and synonym discovery, and finally extracting object-object relationships. the overall goal of this work is to investigate and develop a complete knowledge base, called BioMap, using the entire MEDLINE collection of (over 12 million) bibliographic citations and author abstracts from over 4600 biomedical journals worldwide and to develop an interactive knowledge network for users to access this secondary knowledge (BioMap) along with its primary databases such as the MEDLINE. In this paper we present the organization of a distributed database system to maintain the knowledge base of BioMap and some preliminary results on biological object name identification problem based on an initial set of 30,000 MEDLINE abstracts.
the proceedings contain 195 papers from the 18th Annual symposium on appliedcomputing. the topics discussed include: implementing fuzzy expert system for intelligent buildings;image texture classification using datag...
详细信息
the proceedings contain 195 papers from the 18th Annual symposium on appliedcomputing. the topics discussed include: implementing fuzzy expert system for intelligent buildings;image texture classification using datagrams and characteristics views;enabling mobile agents to dynamically assume roles;automatic parallelism in differentiation of Fourier transforms and long time step molecular dynamics using targeted Langevin stabilization.
An attempt is made to look at how research theories developed in the context of various areas of science education can be applied to computing Science Education as well as ways in which computing science educational t...
详细信息
An attempt is made to look at how research theories developed in the context of various areas of science education can be applied to computing Science Education as well as ways in which computing science educational theories may be used in those areas. the possibilities and difficulties in some import and exports attempts between several areas of Science Education Research and computing Science Education are discussed.
A growing trend in Software Engineering (SE) courses, especially in capstones, is to use an actual business or industry' client for case-based projects. We will broadly examine approaches taken to deal with situat...
详细信息
A growing trend in Software Engineering (SE) courses, especially in capstones, is to use an actual business or industry' client for case-based projects. We will broadly examine approaches taken to deal with situations occurring when projects with outside clients are brought into the classroom at various size institutions in different countries. Specifically we will discuss the issues of client management, team management, project assessment, and preparation and planning for courses utilizing external clients.
this special session will report on the work of the acm K-12 Computer Science Curriculum Committee, whose charge is to design a model curriculum for K-12 computer science that can be widely implemented. It will also g...
详细信息
ISBN:
(纸本)9781581136487
this special session will report on the work of the acm K-12 Computer Science Curriculum Committee, whose charge is to design a model curriculum for K-12 computer science that can be widely implemented. It will also gather feedback from attendees on the content and direction of that work.
During the ITiCSE 2002 conference in Århus, Denmark, a panel presentation on the topic of import to and export from computing Science Education and other fields focused on the case of Mathematics Education Resear...
详细信息
ISBN:
(纸本)9781581136487
During the ITiCSE 2002 conference in Århus, Denmark, a panel presentation on the topic of import to and export from computing Science Education and other fields focused on the case of Mathematics Education Research. the outcome was very successful, withthe panelists' presentations giving rise to active audience *** withthe theme from the earlier panel, this proposal suggests a similar format withthe expanded theme of transfer into computing Science Education from Science Education Research. this panel will look at how research theories developed in the context of various areas of science education can be applied to computing Science Education as well as ways in which computing science educational theories may be used in those areas. Because computing Science Education is a young discipline, it is still in search of its research framework [2]. In formulating such a framework, it can be practical and productive to adapt approaches from research in other disciplines, both educational and related areas. At the same time, the younger discipline can offer innovative new approaches to the older *** panelists will examine possibilities and difficulties in some import and export attempts between several areas of Science Education Research and computing Science Education. For this context, science is considered to include mathematics.
this paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains a...
详细信息
ISBN:
(纸本)9781581134452
this paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using a minimal path due to a faulty node or link. the probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.
In this paper, we consider the problem of computingthe Betti numbers of an arrangement of n compact semi-algebraic sets, S1,..., Sn ⊂ k, where each Si is described using a constant number of polynomials with degrees ...
详细信息
In this paper, we consider the problem of computingthe Betti numbers of an arrangement of n compact semi-algebraic sets, S1,..., Sn ⊂ k, where each Si is described using a constant number of polynomials with degrees bounded by a constant. Such arrangements are ubiquitous in computational geometry. We give an algorithm for computing -th Betti number, β(∪iSi), 0 ≤ ≤ k - 1, using O(n+2) algebraic operations. Additionally, one has to perform linear algebra on matrices of size bounded by O(n+1). All previous algorithms for computingthe Betti numbers of arrangements, triangulated the arrangement giving rise to a complex of size O(n2k) in the worst case. To our knowledge this is the first algorithm for computing β(∪iSi) that does not rely on such a global triangulation, and has a graded complexity which depends on .
In this paper we consider the notion of relative competitive analysis, which is a simple generalization of the conventional competitive analysis and extra-resource analysis for on-line algorithms. We apply this analys...
详细信息
In this paper we consider the notion of relative competitive analysis, which is a simple generalization of the conventional competitive analysis and extra-resource analysis for on-line algorithms. We apply this analysis to study on-line schedulers for stream merging in two different video-on-demand (VOD) systems, which are based on two common approaches, namely, piggybacking and skimming. Our new analysis, in its simplest form, reveals a 3-competitive algorithm for stream merging based on skimming as well as piggybacking. this improves all previous results [4, 8]. We also show how to obtain guarantee on the performance improvement based on adding extra resources, and more interestingly, we provide a unified methodology to compare piggybacking and skimming. We believe that our result gives a clue to system designers for choosing desirable configurations.
暂无评论