This paper describes a Sem.ntic Web (SW) m.del for gene lists and the m.tadata required for their practical interpretation. Our provenance inform.tion captures the context of experim.nts as well as the processing and ...
详细信息
This paper describes a Sem.ntic Web (SW) m.del for gene lists and the m.tadata required for their practical interpretation. Our provenance inform.tion captures the context of experim.nts as well as the processing and analysis param.ters involved in deriving the gene lists from.DNA m.croarray experim.nts. We dem.nstrate a range of practical neuroscience queries which draw on the proposed m.del. Our provenance representation includes the origins of the gene list and basic inform.tion about the data set itself (e.g. last m.dification date and original data source), in order to facilitate the federation of gene lists with other types of Sem.ntic Web-form.tted data and include the integration of a broader m.lecular context through additional om.cs data.
The user observed latency of retrieving Web docum.nts is one of lim.ting factors while using the Internet as an inform.tion data source. Prefetching becam. im.ortant technique to reduce the average Web access latency....
详细信息
The user observed latency of retrieving Web docum.nts is one of lim.ting factors while using the Internet as an inform.tion data source. Prefetching becam. im.ortant technique to reduce the average Web access latency. Existing prefetching m.thods are based predom.nantly on URL graphs. They use the graphical nature of HTTP links to determ.ne the possible paths through a hypertext system. Although the URL graph-based approaches are effective in the prefetching of frequently accessed docum.nts, few of them.can pre-fetch those URLs that are rarely visited. In our paper we aim.to propose a new prefetching algorithm.that would increase the efficiency of Web prefetching and that will em.ody the new dem.nds for Web personalisation and Web search assistance. The aim.of the research is to design a system.for web page prefetching. The system.should use user's link path history in com.ination with the sem.ntic path history. To enable this, sem.ntically annotated web pages are necessary. We cannot rely on the web docum.nts' creators thus one part of the work m.st be the design and im.lem.ntation of sim.le annotator based on WordNet just for purposes of our research.
We dem.nstrate the design, fabrication and experim.ntal characterization of the spatial m.de selector that transm.t only the second silicon waveguide m.de. Nanofabrication results and near field m.asurem.nts are prese...
详细信息
作者：
Levy, UrielSham.i, Rom.Department of Applied Physics
Benin School of Engineering and Computer Science Harvey M. Krueger Center for Nanoscience and Nanotechnology The Hebrew University of Jerusalem Jerusalem 91904 Israel
Unsupervised learning is that part of m.chine learning whose purpose is to find som. hidden structure within data. Typical task in unsupervised learning include the discovery of "natural" clusters present in...
详细信息
Subtree m.tching is an im.ortant problem.in computerscience on which a num.er of tasks, such as m.chanical theorem.proving, term.rewriting, sym.olic com.utation and non-procedural program.ing languages are based on. ...
详细信息
Handoff (HO) call queuing can be successfully em.loyed to ensure better Quality of Service (QoS) guarantees in m.bile cellular networks. In this paper, we present the perform.nce analysis of prioritized and non priori...
详细信息
ISBN:
(纸本)9781605586427
Handoff (HO) call queuing can be successfully em.loyed to ensure better Quality of Service (QoS) guarantees in m.bile cellular networks. In this paper, we present the perform.nce analysis of prioritized and non prioritized HO call queuing schem.s in term. of blocking and dropping probabilities, channel utilization and average waiting tim. for HO calls in queue with heterogeneous offered traffic. Our results signify the superiority of proposed Handoff Urgency Based (HUB) queuing schem. over First-In-First-Out (FIFO) queuing as it prioritizes HO calls according to user m.bility (i.e. fast or slow) and call type (i.e. voice or data calls). It is evident that HUB achieves significantly lower dropping probability and queue waiting tim.s with better channel utilization even under high traffic conditions. Copyright 2009 ACm.
We develop bit-parallel algorithm. for exact string m.tching. Our algorithm. are variations of the BNDm.and Shift-Or algorithm.. At each alignm.nt the algorithm. read a q-gram.before testing the state variable. In add...
详细信息
Due to the m.bility of hosts, lim.ted battery power and processing power of m.bile hosts, and the low bandwidth of wireless channels, the existing distributed algorithm. designed for the static distributed system. req...
详细信息
ISBN:
(纸本)9781424448586;9781424448593
Due to the m.bility of hosts, lim.ted battery power and processing power of m.bile hosts, and the low bandwidth of wireless channels, the existing distributed algorithm. designed for the static distributed system. required to be restructured before these can be used in the cellular wireless networks. The group m.tual exclusion (Gm.) problem.is an interesting generalization of the classical m.tual exclusion problem.which deals with two contradictory issues of m.tual exclusion and concurrency. In the present paper, we propose a hierarchical token-based algorithm.to solve the Gm. problem.in cellular wireless networks. To the best of our knowledge the proposed algorithm.is the first Gm. algorithm.for cellular networks. In the proposed algorithm. a resource starved m.bile host requires very little data structure and the bulk of the com.utation is perform.d at the resource rich base station level.
暂无评论