Results 201 to 210 of about 108,839 (264)
Biological Functional Class Enrichment Analysis with R, an Annotated Tutorial for Bench Scientists. [PDF]
Methods ProtocHu K.
europepmc +1 more source
Interpretable prediction of Ki-67 expression in breast cancer through integrated photoacoustic radiomics and clinical parameters. [PDF]
Front OncolWang M +8 more
europepmc +1 more source
Regulation of a nickel tolerance operon conserved in <i>Mesorhizobium</i> strains from serpentine soils. [PDF]
Appl Environ MicrobiolJensen KT, Griffitts JS.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fundamenta Informaticae, 2012
Tabular expressions are one of the most important table-based techniques used to formally specify software requirements. The power of tabular expressions stems from their visual structure, and concise representation of mathematical functions and relations.
Imen Bourguiba, Belaid Moa
openaire +2 more sources
Tabular expressions are one of the most important table-based techniques used to formally specify software requirements. The power of tabular expressions stems from their visual structure, and concise representation of mathematical functions and relations.
Imen Bourguiba, Belaid Moa
openaire +2 more sources
ACM SIGPLAN Notices, 1973
Conventional languages are serial from statement to statement unless broken by explicit parenthesization such as BEGIN blocks or their equivalent in other languages. However, they are not serial within statements, but possess a complex priority scheme which seems to have little justification except historical notation in a few branches of mathematics ...
openaire +1 more source
Conventional languages are serial from statement to statement unless broken by explicit parenthesization such as BEGIN blocks or their equivalent in other languages. However, they are not serial within statements, but possess a complex priority scheme which seems to have little justification except historical notation in a few branches of mathematics ...
openaire +1 more source
Expressive Power of “Now” and “Then” Operators
Journal of Logic, Language and Information, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Monotonicity and the Expressibility of NP Operators
Mathematical Logic Quarterly, 1994AbstractWe investigate why similar extensions of first‐order logic using operators (that is, generalized quantifiers) corresponding to NP‐complete decision problems apparently differ in expressibility: the logics capture either NP or LNP. It had been conjectured that the complexity class captured is NP if and only if the operator is monotone.
openaire +1 more source
On the Expressiveness of MTL with Past Operators
2006We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘SI’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more ...
Prabhakar, Pavithra, D’Souza, Deepak
openaire +1 more source
1988
Operators are the verbs of the C language that let you calculate values. C’s rich set of operators is one of its distinguishing characteristics. In the preceding chapters, you have already seen a number of C operators, such as + (addition), /(division), < (less than), and = (assignment).
Peter A. Darnell, Philip E. Margolis
openaire +1 more source
Operators are the verbs of the C language that let you calculate values. C’s rich set of operators is one of its distinguishing characteristics. In the preceding chapters, you have already seen a number of C operators, such as + (addition), /(division), < (less than), and = (assignment).
Peter A. Darnell, Philip E. Margolis
openaire +1 more source
1986
A constant is an explicit data value written by the programmer. Thus, it is a value known to the compiler at compile time. The compiler may deal with this value in any of several ways, depending on the type of constant and its context. For example, the binary equivalent of the constant may be inserted directly into the output code stream.
openaire +1 more source
A constant is an explicit data value written by the programmer. Thus, it is a value known to the compiler at compile time. The compiler may deal with this value in any of several ways, depending on the type of constant and its context. For example, the binary equivalent of the constant may be inserted directly into the output code stream.
openaire +1 more source