The Report of Homological Algebra

The current article intends to introduce the reader to the concept of injective and projective modules and to describe the CFT. We present a clear view to show the homological algebra and injective and projective modules.

A 16-bit 18-MSPS flash-assisted SAR ADC with hybrid synchronous and asynchronous control logic

This paper presents a 16-bit,18-MSPS(million samples per second)flash-assisted successive-approximation-register(SAR)analog-to-digital converter(ADC)utilizing hybrid synchronous and asynchronous(HYSAS)timing control logic based on an on-chip delay-locked loop(DLL).The HYSAS scheme can provide a longer settling time for the capacitive digital-to-analog converter(CDAC)than the synchronous and asynchronous SAR ADC.Therefore,the issue of incomplete settling or ringing in the DAC voltage for cases of either on-chip or off-chip reference voltage can be solved to a large extent.In addition,the fore-ground calibration of the CDAC’s mismatch is performed with a finite-impulse-response bandpass filter(FIR-BPF)based least-mean-square(LMS)algorithm in an off-chip FPGA(field programmable gate array).Fabricated in 40-nm CMOS process,the proto-type ADC achieves 94.02-dB spurious-free dynamic range(SFDR),and 75.98-dB signal-to-noise-and-distortion ratio(SNDR)for a 2.88-MHz input under 18-MSPS sampling rate.

THE BSE PROPERTY FOR SOME VECTOR-VALUED BANACH FUNCTION ALGEBRAS

In this paper,X is a locally compact Hausdorff space and A is a Banach algebra.First,we study some basic features of C0(X,A)related to BSE concept,which are gotten from A.In particular,we prove that if C0(X,A)has the BSE property then A has so.We also establish the converse of this result,whenever X is discrete and A has the BSE-norm property.Furthermore,we prove the same result for the BSE property of type I.Finally,we prove that C0(X,A)has the BSE-norm property if and only if A has so.

Quantum Fibrations:Quantum Computation on an Arbitrary Topological Space

Using operator algebras,we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.Quantum computation is usually implemented on finite discrete sets,and the purpose of this study is to extend this to theories on arbitrary sets.The conventional theory of quantum computers can be viewed as a simplified algebraic geometry theory in which the action of SU(2)is defined on each point of a discrete set.In this study,we extend this in general as a theory of quantum fibrations in which the action of the von Neumann algebra is defined on an arbitrary topological space.The quantum channel is then naturally extended as a net of von Neumann algebras.This allows for a more mathematically rigorous discussion of general theories,including physics and chemistry,which are defined on sets that are not necessarily discrete,from the perspective of quantum computer science.

Groupoid Approach to Ergodic Dynamical System of Commutative von Neumann Algebra

Given a compact and regular Hausdorff measure space (X, μ), with μ a Radon measure, it is known that the generalised space M(X) of all the positive Radon measures on X is isomorphic to the space of essentially bounded functions L∞(X, μ) on X. We confirm that the commutative von Neumann algebras M⊂B(H), with H=L2(X, μ), are unitary equivariant to the maximal ideals of the commutative algebra C(X). Subsequenly, we use the measure groupoid to formulate the algebraic and topological structures of the commutative algebra C(X) following its action on M(X) and define its representation and ergodic dynamical system on the commutative von Neumann algebras of M of B(H) .

Representations of Hom-Jacobi-Jordan Algebras

Some relationships between the representation of Hom-Jacobi-Jordan algebra and that of Jacobi-Jordan algebra are studied.Moreover,by using the notion ofαk-anti-derivation,a property theorem of multiplicative Hom-Jacobi-Jordan algebras is also given.

A Survey on Type-3 Fuzzy Logic Systems and Their Control Applications

In this paper,we offer a review of type-3 fuzzy logic systems and their applications in control.The main objective of this work is to observe and analyze in detail the applications in the control area using type-3 fuzzy logic systems.In this case,we review their most important applications in control and other related topics with type-3 fuzzy systems.Intelligent algorithms have been receiving increasing attention in control and for this reason a review in this area is important.This paper reviews the main applications that make use of Intelligent Computing methods.Specifically,type-3 fuzzy logic systems.The aim of this research is to be able to appreciate,in detail,the applications in control systems and to point out the scientific trends in the use of Intelligent Computing techniques.This is done with the construction and visualization of bibliometric networks,developed with VosViewer Software,which it is a free Java-based program,mainly intended to be used for analyzing and visualizing bibliometric networks.With this tool,we can create maps of publications,authors,or journals based on a co-citation network or construct maps of keywords,countries based on a co-occurrence networks,research groups,etc.

A Formal Model for Analyzing Fair Exchange Protocols Based on Event Logic

Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and electronic contract signing,ensuring the reliability and security of network transactions.In order to address the limitations of current research methods and enhance the analytical capabilities for fair exchange protocols,this paper proposes a formal model for analyzing such protocols.The proposed model begins with a thorough analysis of fair exchange protocols,followed by the formal definition of fairness.This definition accurately captures the inherent requirements of fair exchange protocols.Building upon event logic,the model incorporates the time factor into predicates and introduces knowledge set axioms.This enhancement empowers the improved logic to effectively describe the state and knowledge of protocol participants at different time points,facilitating reasoning about their acquired knowledge.To maximize the intruder’s capabilities,channel errors are translated into the behaviors of the intruder.The participants are further categorized into honest participants and malicious participants,enabling a comprehensive evaluation of the intruder’s potential impact.By employing a typical fair exchange protocol as an illustrative example,this paper demonstrates the detailed steps of utilizing the proposed model for protocol analysis.The entire process of protocol execution under attack scenarios is presented,shedding light on the underlying reasons for the attacks and proposing corresponding countermeasures.The developedmodel enhances the ability to reason about and evaluate the security properties of fair exchange protocols,thereby contributing to the advancement of secure network transactions.

Logical stochastic resonance in a cross-bifurcation non-smooth system

This paper investigates logical stochastic resonance(LSR)in a cross-bifurcation non-smooth system driven by Gaussian colored noise.In this system,a bifurcation parameter triggers a transition between monostability,bistability and tristability.By using Novikov's theorem and the unified colored noise approximation method,the approximate Fokker-Planck equation is obtained.Then we derive the generalized potential function and the transition rates to analyze the LSR phenomenon using numerical simulations.We simulate the logic operation of the system in the bistable and tristable regions respectively.We assess the impact of Gaussian colored noise on the LSR and discover that the reliability of the logic response depends on the noise strength and the bifurcation parameter.Furthermore,it is found that the bistable region has a more extensive parameter range to produce reliable logic operation compared with the tristable region,since the tristable region is more sensitive to noise than the bistable one.

RESTlogic: Detecting Logic Vulnerabilities in Cloud REST APIs

logical testing model and resource lifecycle information,generate test cases and complete parameters,and alleviate inconsistency issues through parameter inference.Once again,we propose a method of analyzing test results using joint state codes and call stack information,which compensates for the shortcomings of traditional analysis methods.We will apply our method to testing REST services,including OpenStack,an open source cloud operating platform for experimental evaluation.We have found a series of inconsistencies,known vulnerabilities,and new unknown logical defects.

Multi-modal knowledge graph inference via media convergence and logic rule

Media convergence works by processing information from different modalities and applying them to different domains.It is difficult for the conventional knowledge graph to utilise multi-media features because the introduction of a large amount of information from other modalities reduces the effectiveness of representation learning and makes knowledge graph inference less effective.To address the issue,an inference method based on Media Convergence and Rule-guided Joint Inference model(MCRJI)has been pro-posed.The authors not only converge multi-media features of entities but also introduce logic rules to improve the accuracy and interpretability of link prediction.First,a multi-headed self-attention approach is used to obtain the attention of different media features of entities during semantic synthesis.Second,logic rules of different lengths are mined from knowledge graph to learn new entity representations.Finally,knowledge graph inference is performed based on representing entities that converge multi-media features.Numerous experimental results show that MCRJI outperforms other advanced baselines in using multi-media features and knowledge graph inference,demonstrating that MCRJI provides an excellent approach for knowledge graph inference with converged multi-media features.

Spin logic devices based on negative differential resistance -enhanced anomalous Hall effect

Owing to rapid developments in spintronics,spin-based logic devices have emerged as promising tools for next-generation computing technologies.This paper provides a comprehensive review of recent advancements in spin logic devices,particularly focusing on fundamental device concepts rooted in nanomagnets,magnetoresistive random access memory,spin–orbit torques,electric-field modu-lation,and magnetic domain walls.The operation principles of these devices are comprehensively analyzed,and recent progress in spin logic devices based on negative differential resistance-enhanced anomalous Hall effect is summarized.These devices exhibit reconfigur-able logic capabilities and integrate nonvolatile data storage and computing functionalities.For current-driven spin logic devices,negative differential resistance elements are employed to nonlinearly enhance anomalous Hall effect signals from magnetic bits,enabling reconfig-urable Boolean logic operations.Besides,voltage-driven spin logic devices employ another type of negative differential resistance ele-ment to achieve logic functionalities with excellent cascading ability.By cascading several elementary logic gates,the logic circuit of a full adder can be obtained,and the potential of voltage-driven spin logic devices for implementing complex logic functions can be veri-fied.This review contributes to the understanding of the evolving landscape of spin logic devices and underscores the promising pro-spects they offer for the future of emerging computing schemes.

BANACH ALGEBRA STRUCTURE IN DERIVATIVE HARDY SPACES

In this paper,we consider the algebraic structure of derivative Hardy Spaces.By using the method of[6,12,15],we get the Duhamel product forming Banach algebra in derivative Hardy Spaces,and invertibility criterion,and describe the extended eigenvalue of the integral operator V.We generalize the results in[1,2,6,11,16].

Implementation of Fuzzy Logic Control into an Equivalent Minimization Strategy for Adaptive Energy Management of A Parallel Hybrid Electric Vehicle

As government agencies continue to tighten emissions regulations due to the continued increase in greenhouse gas production, automotive industries are seeking to produce increasingly efficient vehicle technology. Hybrid electric vehicles (HEVs) have been introduced to mitigate problems while improving fuel economy. HEVs have led to the demand of creating more advanced controls software to consider multiple components for propulsive power in a vehicle. A large section in the software development process is the implementation of an optimal energy management strategy meant to improve the overall fuel efficiency of the vehicle. Optimal strategies can be implemented when driving conditions are known a prior. The Equivalent Consumption Minimization Strategy (ECMS) is an optimal control strategy that uses an equivalence factor to equate electrical to mechanical power when performing torque split determination between the internal combustion engine and electric motor for propulsive and regenerative torque. This equivalence factor is determined from offline vehicle simulations using a sensitivity analysis to provide optimal fuel economy results while maintaining predetermined high voltage battery state of charge (SOC) constraints. When the control hierarchy is modified or different driving styles are applied, the analysis must be redone to update the equivalence factor. The goal of this work is to implement a fuzzy logic controller that dynamically updates the equivalence factor to improve fuel economy, maintain a strict charge sustaining window of operation for the high voltage battery, and reduce computational time required during algorithm development. The adaptive algorithm is validated against global optimum fuel economy and charge sustaining results from a sensitivity analysis performed for multiple drive cycles. Results show a maximum fuel economy improvement of 9.82% when using a mild driving style and a 95% success rate when maintaining an ending SOC within 5% of the desired SOC regardless of starting SOC.

Split-Tetraquaternion Algebra and Applications

In this paper, from the spacetime algebra associated with the Minkowski space ℝ3,1by means of a change of signature, we describe a quaternionic representation of the split-tetraquaternion algebra which incorporates the Pauli algebra, the split-biquaternion algebra and the split-quaternion algebra, we relate these algebras to Clifford algebras and we show the emergence of the stabilized Poincaré-Heisenberg algebra from the split-tetraquaternion algebra. We list without going into details some of their applications in Physics and in Born geometry.

Hierarchical Controller Synthesis Under Linear Temporal Logic Specifications Using Dynamic Quantization

Linear temporal logic(LTL)is an intuitive and expressive language to specify complex control tasks,and how to design an efficient control strategy for LTL specification is still a challenge.In this paper,we implement the dynamic quantization technique to propose a novel hierarchical control strategy for nonlinear control systems under LTL specifications.Based on the regions of interest involved in the LTL formula,an accepting path is derived first to provide a high-level solution for the controller synthesis problem.Second,we develop a dynamic quantization based approach to verify the realization of the accepting path.The realization verification results in the necessity of the controller design and a sequence of quantization regions for the controller design.Third,the techniques of dynamic quantization and abstraction-based control are combined together to establish the local-to-global control strategy.Both abstraction construction and controller design are local and dynamic,thereby resulting in the potential reduction of the computational complexity.Since each quantization region can be considered locally and individually,the proposed hierarchical mechanism is more efficient and can solve much larger problems than many existing methods.Finally,the proposed control strategy is illustrated via two examples from the path planning and tracking problems of mobile robots.

A Neuro T-Norm Fuzzy Logic Based System

In this study, we are first examining well-known approach to improve fuzzy reasoning model (FRM) by use of the genetic-based learning mechanism [1]. Later we propose our alternative way to build FRM, which has significant precision advantages and does not require any adjustment/learning. We put together neuro-fuzzy system (NFS) to connect the set of exemplar input feature vectors (FV) with associated output label (target), both represented by their membership functions (MF). Next unknown FV would be classified by getting upper value of current output MF. After that the fuzzy truths for all MF upper values are maximized and the label of the winner is considered as the class of the input FV. We use the knowledge in the exemplar-label pairs directly with no training. It sets up automatically and then classifies all input FV from the same population as the exemplar FVs. We show that our approach statistically is almost twice as accurate, as well-known genetic-based learning mechanism FRM.

The Fundamental Theory of Artificial Intelligence—Logic Structure and Logic Engineering

The research purpose of this dissertation is threefold: to innovate artificial intelligence methods, to create the intersection of artificial intelligence and biological research, and to innovate human methodology. The work I have done in my research includes: improving logical structure and logical engineering, using my theory to study the innovation of the development path of artificial intelligence, using my theory to create biomimetic logic, a new intersection of artificial intelligence and biological research, and exploring the innovation of human methodology through the previous two works. The results of the research are as follows: 1) Introduction to bionic logic, incorporating simulations of people, society, and life as core principles. 2) Definition of the logical structure as the primary focus of research, with logic mechanics serving as foundational research principles. 3) Examination of the logical structure’s environment through logical fields and networks. 4) Study of logical structure communication via logical networks and main lines. 5) Proposal of data logic. 6) Investigation into the logic of logical structures, employing structural diagrams of logical equations. 7) Development of a theory of life activity within logical structures, encompassing information reasoning, its corresponding control structure, and structural reasoning. 8) Introduction of the lifecycle theory for logical structures and examination of the clock equation. 9) Exploration of logical structure intelligence. 10) Study of logical structures in mathematical forms. 11) Introduction of logic engineering. 12) Examination of artificial intelligence’s significance. 13) Investigation into the significance of human methodology.

Discussion on the Homology Theory of Lie Algebras

Because homology on compact homogeneous nilpotent manifolds is closely related to homology on Lie algebras, studying homology on Lie algebras is helpful for further studying homology on compact homogeneous nilpotent manifolds. So we start with the differential sequence of Lie algebras. The Lie algebra g has the differential sequence E0,E1,⋯,Es⋯, which leads to the chain complex Es0→Δs0Ess→Δs1⋯→ΔsiEs(i+1)s→Δsi+1⋯of Esby discussing the chain complex E10→Δ10E11→Δ11⋯→Δ1r−1E1r→Δ1r⋯of E1and proves that Es+1i≅Hi(Es)=KerΔsi+1/ImΔsiand therefore Es+1≅H(Es)by the chain complex of Es(see Theorem 2).

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.