Results 61 to 70 of about 24,130 (303)
LTL-specification for development and verification of control programs
This work continues the series of articles on development and verification of control programs based on the LTL-specification. The essence of the approach is to describe the behavior of programs using formulas of linear temporal logic LTL of a special ...
Maxim V. Neyzov, Egor V. Kuzmin
doaj +1 more source
Historical Foundation and Practical Guideline for Ferroelectric Switching Kinetic Studies
The P and U pulses in the conventional PUND measurements are not identical because of the interplay between switching current and the measurement circuit components. This circuit effect can lead to a shift in polarization transients and misinterpreted physics in the switching kinetics.
Yi Liang, Pat Kezer, John T. Heron
wiley +1 more source
On some innovations in teaching the formal semantics using software tools
In this work we discuss the motivation for innovations and need of a teaching tool for the visualization of the natural semantics method of imperative programming languages. We present the rôle of the teaching software, its design, development and use in
Steingartner William
doaj +1 more source
Building an IDE for the Calculational Derivation of Imperative Programs [PDF]
In this paper, we describe an IDE called CAPS (Calculational Assistant for Programming from Specifications) for the interactive, calculational derivation of imperative programs. In building CAPS, our aim has been to make the IDE accessible to non-experts
Dipak L. Chaudhari, Om Damani
doaj +1 more source
Tuning Separator Chemistry: Improving Zn Anode Compatibility via Functionalized Chitin Nanofibers
Nanochitin derived from waste shrimp shells is used to fabricate separators for aqueous zinc batteries. By tuning the density of amine and carboxylic surface groups, water mobility at the separator interface is controlled, promoting uniform zinc deposition, suppressing dendrite growth, and enabling exceptional cycling stability exceeding 2000 h ...
Ibrahim Al Kathemi +6 more
wiley +1 more source
Algorithmic Completeness of Imperative Programming Languages [PDF]
According to the Church-Turing Thesis, effectively calculable functions are functions computable by a Turing machine. Models that compute these functions are called Turing-complete. For example, we know that common imperative languages (such as C, Ada or Python) are Turing complete (up to unbounded memory). Algorithmic completeness is
openaire +3 more sources
Transfer of Analogies in Traditional Programming Languages to Teaching VHDL
One of the languages available to describe a digital system in FPGA is the VHDL language. Since programming in hardware requires a different way of thinking than developing software, the students face some difficulties when trying to design in VHDL ...
Ali Gülbağ, Halit Öztekin
doaj +1 more source
We present a novel proteolysis‐targeting chimera (PROTAC) system conjugated to lipoic acid gold nanoclusters (PLANC), designed to degrade pTau, regulate inflammatory signaling, and effectively traverse the blood‐brain barrier (BBB). PLANC degraded pTau at various phosphorylation sites, with mechanistic studies confirming proteasome‐mediated degradation
Sarah Nevins +9 more
wiley +1 more source
Teaching logic programming: a review
Logic programming constitutes a significant paradigm within computer science, offering a unique approach to programming based on formal logic rather than conventional imperative instructions.
Serhiy O. Semerikov +2 more
doaj +1 more source
A Graph Model for Imperative Computation [PDF]
Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values. We
Guy McCusker
doaj +1 more source

