Google recently updated the navigation of the site (that's how I found out about them) and made the link to the branding guidelines more obvious, likely to emphasize most of the rules we describe below.
In this paper, we describe the data and sample selection rules, we describe network characteristics of the entire network and of the samples, we provide an analysis of disease spread on sampled networks, and, finally, we discuss the results and practical implications as they relate to the two research questions.
In contrast to the standard practice of sleep staging, defined by scoring rules, we describe sleep via posterior probabilities of a finite number of states, not necessarily reflecting the traditional sleep stages.
We have several things to watch then: first, whether the Hortonworks's IPO can go off at all as it falls outside the two rules we described above, failing the declining losses test; and second, whether it changes its pricing north, indicating strong market demand.
More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints.
In Rule-Set-1 we describe the SWRL rules that are used to infer the truth values of classified symbolic network bandwidth given in (1).
The rule-based modeling we describe is a continual, iterative process, much like perfecting in vitro or in vivo experiments.
After a summary of the usual cartographic rules on label placement, we describe and justify this new measure.
In particular, we describe the rule model of SAMOS, which represents a smooth integration of ECA-rules into an object-oriented data model.
We describe the rule generation processes, and demonstrate the model's ability to use the resulting rules to solve the RPM with similar performance and error patterns to human subjects.
In this paper, we describe deduction rules, which are used to calculate values of complex Hex positions recursively starting from the simplest ones.
