Relevance and truthfulness in information correction and fusion

A general approach to information correction and fusion for belief functions is proposed, where not only may the information items be irrelevant, but sources may lie as well. We introduce a new correction scheme, which takes into account uncertain metaknowledge on the source’s relevance and truthfulness and that generalizes Shafer’s discounting operation. We then show how to reinterpret all connectives of Boolean logic in terms of source behavior assumptions with respect to relevance and truthfulness. We are led to generalize the unnormalized Dempster’s rule to all Boolean connectives, while taking into account the uncertainties pertaining to assumptions concerning the behavior of sources. Eventually, we further extend this approach to an even more general setting, where source behavior assumptions do not have to be restricted to relevance and truthfulness. We also establish the commutativity property between correction and fusion processes, when the behaviors of the sources are independent.     

Performance investigation of an advanced tracked prime mover on the low bearing soil

This study has presented a performance investigation of an advanced tracked prime mover for the operation of agricultural goods and other operations on peat terrain. The maximum and continuous traction torque of the prime mover has been developed by designing an advanced controller for controlling the intelligent system. The prime mover’s mobility is studied with ultrasonic displacement sensor, torque transducer, National Instrument cRIO-9004 Compact-RIO Real-time Controller Unit (RCU), a National Instrument TPC 2106T Touch Panel Control (TPC), a Trimble AG132 GPS antenna and receiver unit, and a Dlink DIR-655 router. The fuzzy logic controller (FLC) has been equipped with the prime mover hydraulic system to increase the traction torque of the hydraulic motor when the prime mover’s sinkage is more than or equal to 70 mm. The prime mover’s design demonstrates good potential in traversing peat terrain as the measured tractive effort was found to be 48% of the vehicle’s gross weight while the recommended tractive effort is in the range of 30–36% of the vehicle’s gross weight.     

The Construction of DNA Logic Gates Restricted to Certain Live Cells Based on the Structure Programmability and Aptamer-Cell Affinity of G-Quadruplexes

DNA computation is considered a fascinating alternative to silicon-based computers; it has evoked substantial attention and made rapid advances. Besides realizing versatile functions, implementing spatiotemporal control of logic operations, especially at the cellular level, is also of great significance to the development of DNA computation. However, developing simple and efficient methods to restrict DNA logic gates performing in live cells is still a challenge. In this work, a series of DNA logic gates was designed by taking full advantage of the diversity and programmability of the G-quadruplex (G4) structure. More importantly, by further using the high affinity and specific endocytosis of cells to aptamer G4, an INHIBIT logic gate has been realized whose operational site is precisely restricted to specific live cells. The design strategy might have great potential in the field of molecular computation and smart bio-applications.     

Two-Photon-Induced CO-Releasing Molecules as Molecular Logic Systems in Solution,Polymers, and Cells

Phototherapeutic applications of carbon monoxide (CO)-releasing molecules are limited because they require harmful UV and blue light for activation. We describe two-photon excitation with NIR light (800 nm)-induced CO-release from two Mn^I tricarbonyl complexes bearing 1,8-naphthalimide units ( 1 , 2 ). Complex 2 behaves as a logic OR gate in solution, nonwovens, and in HeLa cells. CO release, indicated by fluorescence enhancement, was detected in solution, nonwoven, and HeLa cells by single- (405 nm) and two-photon (800 nm) excitation. The photophysical properties of 1 and 2 have been measured and supported by DFT and TDDFT quantum chemical calculations. Both photoCORMs are stable in the dark in solution and noncytotoxic, leading to promising applications as phototherapeutics with NIR light.     

Quantifier-free epistemic term-modal logic with assignment operator

In standard epistemic logic, the names and the existence of agents are usually assumed to be common knowledge implicitly. This is unreasonable for various applications in computer science and philosophy. Inspired by term-modal logic and assignment operators in dynamic logic, we introduce a lightweight modal predicate logic where names can be non-rigid, and the existence of agents can be uncertain. The language can handle various de dicto/de re distinctions in a natural way. We characterize the expressive power of our language, obtain complete axiomatisations of the logics over several classes of varying-domain/constant-domain epistemic models, and show their (un)decidability.     

Reasoning about proof and knowledge

In previous work [15], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from Gödel's interpretation of IPC in S4, our modal systems contain IPC in the way established in [13]. The modal operator can be viewed as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are partially adopted from Intuitionistic Epistemic Logic IEL [4]. In the present paper, we show that the S5-style systems of our hierarchy correspond to an extended Brouwer–Heyting–Kolmogorov interpretation and are complete w.r.t. a relational semantics based on intuitionistic general frames. In this sense, our S5-style logics are adequate and complete systems for the reasoning about proof combined with belief or knowledge. The proposed relational semantics is a uniform framework in which also IEL can be modeled. Verification-based intuitionistic knowledge formalized in IEL turns out to be a special case of the kind of knowledge described by our S5-style systems.     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.