نتایج جستجو برای: readable and pleasing

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

2008
Shuji Sato Kazuo Misue Jiro Tanaka

Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is available to us has increased dramatically in recent years, and it is therefore necessary to develop a drawing technique that corresponds to large-scale graphs. In this paper, we describe drawing methods to make large-...

Journal: :Journal of physical activity & health 2010
Lorraine S Wallace Kenneth Bielak Brian Linn

BACKGROUND We evaluated readability and related features of English-language instructions accompanying pedometers, including reading grade level, layout/formatting characteristics, and emphasis of key points. METHODS We identified 15 pedometers currently available for purchase in the US. Reading grade level was calculated using Flesch-Kinkaid (FK) and SMOG formulas. Text point size was measur...

2012
Elaine Angelino

The explosion of Web data over the past fifteen years has fostered a rich body of research in extracting structure from semistructured HTML and XML documents. Today, we are also in the middle of an explosion of semistructured documents that originate from outside the Web domain. This latter kind of semistructured data is everywhere: in electronic medical records (EMRs), government reports, digi...

Journal: :Electr. Notes Theor. Comput. Sci. 2004
Greg O'Keefe

We formally develop category theory up to Yoneda’s lemma, using Isabelle/HOL/Isar, and survey previous formalisations. By using recently added Isabelle features, we have produced a formal text that more closely approximates informal mathematics.

1994
Robert Krovetz

Dictionaries will always be incomplete; sometimes a word will acquire a new sense in a technical eld, and new words are being added to the language all the time. This paper will discuss our comparisons between a machine-readable dictionary and various information retrieval test collections. We will rst report on the number of words found in the dictionary, and how much improvement is gained by ...

Journal: :CoRR 2017
Kyumars Sheykh Esmaili Jaideep Chandrashekar Pascal Le Guyadec

We study the problem of inferring the type of a networked device in a home network by leveraging low level traffic activity indicators seen at commodity home gateways. We analyze a dataset of detailed device network activity obtained from 240 subscriber homes of a large European ISP and extract a number of traffic and spatial fingerprints for individual devices. We develop a two level taxonomy ...

2016
Swen Jacobs Felix Klein Sebastian Schirmer

We present the Temporal Logic Synthesis Format (TLSF), a high-level format to describe synthesis problems via Linear Temporal Logic (LTL). The format builds upon standard LTL, but additionally allows to use high-level constructs, such as sets and functions, to provide a compact and human-readable representation. Furthermore, the format allows to identify parameters of a specification such that ...

2015
Ermira Daka José Campos Jonathan Dorn Gordon Fraser Westley Weimer

Unit tests for object-oriented classes can be generated automatically using search-based testing techniques. As the search algorithms are typically guided by structural coverage criteria, the resulting unit tests are often long and confusing, with possible negative implications for developer adoption of such test generation tools, and the difficulty of the test oracle problem and test maintenan...

2013
Marco Anisetti Claudio Agostino Ardagna Michele Bezzi Ernesto Damiani Antonino Sabetta

Privacy-aware processing of personal data on the web of services requires managing a number of issues arising both from the technical and the legal domain. Several approaches have been proposed to matching privacy requirements (on the clients side) and privacy guarantees (on the service provider side). Still, the assurance of effective data protection (when possible) relies on substantial human...

2005
Eric Nichols Francis Bond Dan Flickinger

In this paper, we outline the development of a system that automatically constructs ontologies by extracting knowledge from dictionary definition sentences using Robust Minimal Recursion Semantics (RMRS), a semantic formalism that permits underspecification. We show that by combining deep and shallow parsing resources through the common formalism of RMRS, we can extract ontological relations in...

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

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