Search

The increasing commercialization and massive deployment of radio frequency identification (RFID) systems has raised many security related issues which in return evokes the need of security protocols. Logic of events theory (LoET) is a formal method for constructing and reasoning about distributed systems and protocols that involve concepts of security. We propose fresh ciphertext and ciphertext release lemmas to extend LoET for analyzing and proving the security of authentication protocols that use symmetric key cryptography more than just digital signature. Based on the extended LoET we formally analyze and prove the authentication property of RCIA protocol, which provides mutual authentication between Tag and Reader in RFID system. Our proof approach based on extended LoET could be applied to the design and analysis of such ultralightweight RFID mutual authentication protocols.

The cardiac MRI findings of Danon disease cardiomyopathy included symmetric hypertrophic cardiomyopathy phenotype and atypical subendocardial late gadolinium enhancement in nonischemic cardiomyopathy, especially with midbasal septum sparing and apex and free-wall involvement.

Electrocardiography-gated CT had noninferior sensitivity compared with transesophageal echocardiography in early identification of aortic perivalvular abscesses, extension of these abscesses, fistulization, and valvular destruction but had inferior sensitivity in detecting vegetations.

Ultralightweight mutual authentication protocols (UMAP) of Radio frequency identification (RFID) systems have attracted much attention from researchers. Many studies reveal that most of UMAP suffer malicious attack. To improve security of UMAP, formal analysis is performed with Simple promela interpreter (SPIN). Two typical UMAPs, which are RCIA and RAPP, are selected as our case study. A protocol abstract modeling method is presented to make UMAP can be formalized simply. Using SPIN, verification results show that RCIA and RAPP are both vulnerable against desynchronization attack. A Generalized model of UMAP (G-UMAP) and a general patching scheme are presented for resisting the attack. To validate the patching scheme, formal verification is then performed for the improved protocol. SPIN verification shows that the improved RCIA and RAPP both gain higher security. The above proposed modeling method has great significance for similar UMAP analyzing, and the proposed patching scheme is proved to be practical and reliable.

Due to the need of the logical foundation for uncertain information processing, development of efficient automated reasoning system based on non-classical logics is always an active research area. The present paper focuses on the resolution-based automated reasoning theory in a many-valued logic with truth-values defined in a lattice-ordered many-valued algebraic structure - lattice implication algebras (LIA). Specifically, as a continuation and extension of the established work on binary resolution at a certain truth-value level α(called α-resolution), a non-clausal multi-ary α-generalized resolution calculus is introduced for a lattice-valued propositional logic LP(X) based on LIA, which is essentially a non-clausal generalized resolution avoiding reduction to normal clausal form. The new resolution calculus in LP(X) is then proved to be sound and complete. The concepts and theoretical results are further extended and established in the corresponding lattice-valued first-order logic LF(X) based on LIA.

•What is the primary question addressed by this study?•We investigated whether there is abnormal functional connectivity within the dorsolateral prefrontal cortex network in late-life depression with suicidal ideation.•What is the main finding of this study?•We found a lower pattern of functional connectivity within the dorsolateral prefrontal cortex network in late-life depression with suicidal ideation.•What is the meaning of the finding?•These findings carry implications for suicide prevention and intervention in older adults by providing potential markers for tracing suicidal ideation and exploring network-based neuromodulation targets in the context of late-life depression.

Based on the general form of a-resolution principle for a lattice-valued logic with truth-values defined in a lattice-valued logical algebra structure - lattice implication algebra, the further extended a-resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, a-quasi-lock semantic resolution method in lattice-valued propositional logic LP(X) is established by combining the lock and semantic resolution simultaneously, and its theorems of soundness and conditional completeness are proved. Secondly, this a-quasi-lock semantic resolution method is extended into the corresponding lattice-valued first-order logic LF(X), and its soundness and conditional completeness are also established. This extended resolution method will provide a theoretical basis for automated soft theorem proving and program verification based on lattice-valued logic.

AbstractBased on the general form of α-resolution principle for a lattice-valued logic with truth-values defined in a lattice-valued logical algebra structure - lattice implication algebra, the further extended α-resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, α-quasi-lock semantic resolution method in lattice-valued propositional logic LP(X) is established by combining the lock and semantic resolution simultaneously, and its theorems of soundness and conditional completeness are proved. Secondly, this α-quasi-lock semantic resolution method is extended into the corresponding lattice-valued first-order logic LF(X), and its soundness and conditional completeness are also established. This extended resolution method will provide a theoretical basis for automated soft theorem proving and program verification based on lattice-valued logic.

Supplemental Digital Content is available in the text

Resolution as a famous rule of inference has played a key role in automated reasoning for over five decades. A number of variants and refinements of resolution have been also studied, essentially, they are all based on binary resolution, that is, the cutting rule of the complementary pair while every deduction involves only two clauses. In the present work, we consider an extension of binary resolution rule, which is proposed as a novel contradiction separation based inference rule for automated deduction, targeted for dynamic and multiple (two or more) clauses handling in a synergized way, while binary resolution is its special case. This contradiction separation based dynamic multi-clause synergized automated deduction theory is then proved to be sound and complete. The development of this new extension is motivated not only by our view to show that such a new rule of inference can be generic, but also by our wish that this inference rule could provide a basis for more efficient automated deduction algorithms and systems. [ABSTRACT FROM AUTHOR]