نتایج جستجو برای: granularity

تعداد نتایج: 8120  

Journal: :Comparative and Functional Genomics 2004
Anand Kumar Barry Smith Daniel D. Novotny

An explicit formal-ontological representation of entities existing at multiple levels of granularity is an urgent requirement for biomedical information processing. We discuss some fundamental principles which can form a basis for such a representation. We also comment on some of the implicit treatments of granularity in currently available ontologies and terminologies (GO, FMA, SNOMED CT).

Journal: :IJDMMM 2011
Riccardo Albertoni Elena Camossi Monica De Martino Franca Giannini Marina Monti

A fundamental issue to improve the accessibility to information resources is how to efficiently deal with huge amount(s) of data. In this respect, ontology driven techniques are expected to improve the overlap between the Cognitive Space applied by the user and the Information Space, which is defined by the information providers. In this paper we describe a powerful method to extract semantic g...

1997
Sanjay Poria Roberto Garigliano

Most people would agree that a formalisation of granular-ity in natural language should involve notions of abstraction and detail. However in reality, this concept has proved diicult to capture formally. In this paper we examine the role of granularity in constructing explanations. This role is clariied by providing several dimensions along which any explanation task can be characterised. We ar...

Journal: :Electronic Publishing 1992
Frans C. Heeman

Structured documents have become a widely accepted concept for document manipulation applications like editing, formatting, and archiving. However, some aspects of structured documents are still not well understood. In particular, the transition in structured documents from logical structure to contents, is a grey area in which different systems use different interpretations. In this article, w...

Journal: :CoRR 2014
Fan Cheng

Mrs. Gerber’s Lemma (MGL) hinges on the convexity of H(p ∗ H(u)), where H(u) is the binary entropy function. In this work, we prove thatH(p∗f(u)) is convex in u for every p ∈ [0, 1] provided H(f(u)) is convex in u, where f(u) : (a, b) → [0, 1 2 ]. Moreover, our result subsumes MGL and simplifies the original proof. We show that the generalized MGL can be applied in binary broadcast channel to s...

2008
Mohd Sahaid Kalil Hisham Alshiyab Sahaid Kalil Aidil Abdul Hamid Wan Mohtar Wan Yusoff

This study was carried out to study the effect of trace metal addition for hydrogen production The results show that this bacterial need a selected nutrient with selected concentration. The optimum parameters for cultivation were at initial pH of 7.0 and temperature of 30°C. Trace metal addition to the new medium showed that only iron enhanced the H2 yield. The results showed that 25 mgL FeSO4⋅...

1999
Jana Lewerenz Klaus-Dieter Schewe Bernhard Thalheim

The idea of data warehouses is to provide condensed information in order to support managers in the analysis of business facts such as sales, costs, proots, etc. along various dimensions such as geography , organisation, time, etc. The analysis should allow fast switches between diierent selected multiple dimensions at diierent granularity. The task itself is usually called on-line analytical p...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

Recently, researchers have applied the word-character lattice framework to integrated word information, which has become very popular for Chinese named entity recognition (NER). However, prior approaches fuse information by different variants of encoders such as Lattice LSTM or Flat-Lattice Transformer, but are still not data-efficient indeed fully grasp depth interaction cross-granularity and ...

1996
Jong-Suk Ahn Peter B. Danzig

This paper describes a packet network simulator whose timing granularity can shift continuously from ne, packet-level detail to coarse, conversation-level detail. Simulation run time decreases with coarser timing granularity, but the details in the underlying model become faded as the timing granularity coarsens. The ner the gran-ularity, the slower but more precise the simulation. If a simulat...

2010
John G. Stell

A set of subsets of a set may be seen as granules that allow arbitrary subsets to be approximated in terms of these granules. In the simplest case of rough set theory, the set of granules is required to partition the underlying set, but granulations based on relations more general than equivalence relations are well-known within rough set theory. The operations of dilation and erosion from math...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید