Search results for "Runt"
showing 10 items of 39 documents
A mitogenome sequence of an Equus hydruntinus specimen from Late Quaternary site of San Teodoro Cave (Sicily, Italy)
2020
Abstract Equus hydruntinus was a small equid that ranged from the Iberian Peninsula to Middle East. In Italy it has been considered present from the Middle Pleistocene to its extinction in the Middle-Late Holocene. E. hydruntinus shares plesiomorphic traits with other known Pleistocene equids. As a consequence, its classification has always been problematic. Genetic analyses on few fossil remains from Iran and Crimea have revealed that E. hydruntinus was more closely related to extant hemiones. To further investigate its systematic position, using target-enrichment capture and next-generation sequencing, we reconstructed a near complete mitogenome of a specimen from San Teodoro Cave from Si…
Le financement des études supérieures par l'emprunt
1973
The occurrence of runt eggs in waterfowl clutches
2004
Abstract Eggs that are abnormally small are called runt eggs, and they occur in clutches across a wide variety of bird species. We surveyed waterfowl researchers to determine the natural frequency of occurrence of runt eggs in wild nesting ducks, geese, and swans. Of 551,632 eggs examined, 215 were runts, yielding a frequency of 0.039%. They occurred at about four times this frequency (0.156% in 21,832 eggs) in a museum oological collection. Runt eggs were not significantly more common within any taxonomic group among wild waterfowl, and their occurrence was not related to the mean clutch size of a species or to whether waterfowl exhibited regular conspecific nest parasitism. Cavity-nesting…
Latvijas ūdeņu vides pētījumi un aizsardzība: LU Bioloģijas fakultātes Hidrobioloģijas katedras sekcijas referātu tēžu krājums (Rīga, 2012. gada 24. …
2012
Krājumā ievietotās LU 70.konferences LU Bioloģijas fakultātes Hidrobioloģijas katedras sekcijas referātu tēzes nav recenzētas.
Asynchronous Runtime Verification of Business Processes
2015
The authors propose a runtime verification mechanism for business processes. This mechanism allows verifying the correctness of business process execution and it runs in parallel with the base processes affecting them insignificantly. The authors have identified the case where the use of business process runtime verification is helpful and applicable. The verification mechanism monitors the business process execution and verifies compliance with the base process description. The verification mechanism prototype was developed and tested in real business processes, as well as limits of runtime verification overhead were evaluated.
Asynchronous Runtime Verification of Business Processes: Proof of Concept
2020
WSN Design and Verification Using On-Board Executable Specifications
2019
The gap between informal functional specifications and the resulting implementation in the chosen programming language is notably a source of errors in embedded systems design. In this paper, we discuss a methodology and a software platform aimed at coping with this issue in programming resource-constrained wireless sensor network nodes (WSNs). Whereas the typical development model for the WSNs is based on cross compilation, the proposed approach supports high-level symbolic coding of abstract models and distributed applications, as well as their test and their execution, directly on the target hardware. As a working example, we discuss the application of our methodology to specify the func…
Persistent software transactional memory in Haskell
2021
Emerging persistent memory in commodity hardware allows byte-granular accesses to persistent state at memory speeds. However, to prevent inconsistent state in persistent memory due to unexpected system failures, different write-semantics are required compared to volatile memory. Transaction-based library solutions for persistent memory facilitate the atomic modification of persistent data in languages where memory is explicitly managed by the programmer, such as C/C++. For languages that provide extended capabilities like automatic memory management, a more native integration into the language is needed to maintain the high level of memory abstraction. It is shown in this paper how persiste…
Knowledge-based verification of concatenative programming patterns inspired by natural language for resource-constrained embedded devices
2020
We propose a methodology to verify applications developed following programming patterns inspired by natural language that interact with physical environments and run on resource-constrained interconnected devices. Natural language patterns allow for the reduction of intermediate abstraction layers to map physical domain concepts into executable code avoiding the recourse to ontologies, which would need to be shared, kept up to date, and synchronized across a set of devices. Moreover, the computational paradigm we use for effective distributed execution of symbolic code on resource-constrained devices encourages the adoption of such patterns. The methodology is supported by a rule-based sys…