Most Convolutional Neural Network(CNN)interpretation techniques visualize only the dominant cues that the model relies on,but there is no guarantee that these represent all the evidence the model uses for classificati...Most Convolutional Neural Network(CNN)interpretation techniques visualize only the dominant cues that the model relies on,but there is no guarantee that these represent all the evidence the model uses for classification.This limitation becomes critical when hidden secondary cues—potentially more meaningful than the visualized ones—remain undiscovered.This study introduces CasCAM(Cascaded Class Activation Mapping)to address this fundamental limitation through counterfactual reasoning.By asking“if this dominant cue were absent,what other evidence would the model use?”,CasCAM progressively masks the most salient features and systematically uncovers the hierarchy of classification evidence hidden beneath them.Experimental results demonstrate that CasCAM effectively discovers the full spectrum of reasoning evidence and can be universally applied with nine existing interpretation methods.展开更多
The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy imp...The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.展开更多
With the increment of focal elements number in discernment framework,the computation amount in Dezert-Smarandache Theory (DSmT) will exponentially go up. This has been the bottleneck problem to block the wide applicat...With the increment of focal elements number in discernment framework,the computation amount in Dezert-Smarandache Theory (DSmT) will exponentially go up. This has been the bottleneck problem to block the wide application and development of DSmT. Aiming at this difficulty,in this paper,a kind of fast approximate reasoning method in hierarchical DSmT is proposed. Presently,this method is only fit for the case that there are only singletons with assignment in hyper-power set. These singletons in hyper-power set are forced to group through bintree or tri-tree technologies. At the same time,the assignments of singletons in those different groups corresponding to each source are added up respectively,in order to realize the mapping from the refined hyper-power set to the coarsened one. And then,two sources with the coarsened hyper-power set are combined together according to classical DSm Combination rule (DSmC) and Proportional Conflict Redistribution rule No. 5 (PCR5). The fused results in coarsened framework will be saved as the connecting weights between father and children nodes. And then,all assignments of singletons in different groups will be normalized respectively. Tree depth is set,in order to decide the iterative times in hierarchical system. Finally,by comparing new method with old one from different views,the superiority of new one over old one is testified well.展开更多
Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the ...Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.展开更多
Resolution is an useful tool for mechanical theorem proving in modelling the refutation proof procedure, which is mostly used in constructing a “proof” of a “theorem”. An attempt is made to utilize approximate rea...Resolution is an useful tool for mechanical theorem proving in modelling the refutation proof procedure, which is mostly used in constructing a “proof” of a “theorem”. An attempt is made to utilize approximate reasoning methodology in fuzzy resolution. Approximate reasoning is a methodology which can deduce a specific information from general knowledge and specific observation. It is dependent on the form of general knowledge and the corresponding deductive mechanism. In ordinary approximate reasoning, we derive from A→B and by some mechanism. In inverse approximate reasoning, we conclude from A→B and using an altogether different mechanism. An important observation is that similarity is inherent in fuzzy set theory. In approximate reasoning methodology-similarity relation is used in fuzzification while, similarity measure is used in fuzzy inference mechanism. This research proposes that similarity based approximate reasoning-modelling generalised modus ponens/generalised modus tollens—can be used to derive a resolution—like inference pattern in fuzzy logic. The proposal is well-illustrated with artificial examples.展开更多
In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B...In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B’) is ts.First we put forward two reasonable approximate reasoning principles, then, accordingg tO the two reasoning principles we construct a new kind of approximate reasoning methods. The bole idea which the new kind of approximate reasoning methods is that according to the strength p(A1(x1), …, An(xn) )→B (y) which A1(x1),…, An(xn) implicate B(y) and the degree of A’(x) approximates to A(x), we determine the upper limit and B’(y), then take a definite value B’(y) in between the upper limit and the lower limit, and make the reasoning method satisfied the two reasoning principles.展开更多
This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreov...This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreover,we establish the controllability of the considered system.To do so,first,we investigate the approximate controllability of the corresponding linear system.Subsequently,we prove the nonlinear system is approximately controllable if the corresponding linear system is approximately controllable.To reach the conclusions,the theory of resolvent operators,the Banach contraction mapping principle,and fixed point theorems are used.While concluding,some examples are given to demonstrate the efficacy of the proposed results.展开更多
Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,ca...Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,called event evolution patterns,implying informative temporal dependencies between events.Recently,many extrapolation works on TKGs have been devoted to modelling these evolutional patterns,but the task is still far from resolved because most existing works simply rely on encoding these patterns into entity representations while overlooking the significant information implied by relations of evolutional patterns.However,the authors realise that the temporal dependencies inherent in the relations of these event evolution patterns may guide the follow-up event prediction to some extent.To this end,a Temporal Relational Context-based Temporal Dependencies Learning Network(TRenD)is proposed to explore the temporal context of relations for more comprehensive learning of event evolution patterns,especially those temporal dependencies caused by interactive patterns of relations.Trend incorporates a semantic context unit to capture semantic correlations between relations,and a structural context unit to learn the interaction pattern of relations.By learning the temporal contexts of relations semantically and structurally,the authors gain insights into the underlying event evolution patterns,enabling to extract comprehensive historical information for future prediction better.Experimental results on benchmark datasets demonstrate the superiority of the model.展开更多
The cross-modal person re-identification task aims to match visible and infrared images of the same individual.The main challenges in this field arise from significant modality differences between individuals and the ...The cross-modal person re-identification task aims to match visible and infrared images of the same individual.The main challenges in this field arise from significant modality differences between individuals and the lack of high-quality cross-modal correspondence methods.Existing approaches often attempt to establish modality correspondence by extracting shared features across different modalities.However,these methods tend to focus on local information extraction and fail to fully leverage the global identity information in the cross-modal features,resulting in limited correspondence accuracy and suboptimal matching performance.To address this issue,we propose a quadratic graph matching method designed to overcome the challenges posed by modality differences through precise cross-modal relationship alignment.This method transforms the cross-modal correspondence problem into a graph matching task and minimizes the matching cost using a center search mechanism.Building on this approach,we further design a block reasoning module to uncover latent relationships between person identities and optimize the modality correspondence results.The block strategy not only improves the efficiency of updating gallery images but also enhances matching accuracy while reducing computational load.Experimental results demonstrate that our proposed method outperforms the state-of-the-art methods on the SYSU-MM01,RegDB,and RGBNT201 datasets,achieving excellent matching accuracy and robustness,thereby validating its effectiveness in cross-modal person re-identification.展开更多
BACKGROUND Patients with major depression(MD)exhibit conditional reasoning dysfunction;however,no studies on the event-related potential(ERP)characteristics of conditional reasoning in MD have been reported.AIM To inv...BACKGROUND Patients with major depression(MD)exhibit conditional reasoning dysfunction;however,no studies on the event-related potential(ERP)characteristics of conditional reasoning in MD have been reported.AIM To investigate the ERP characteristics of conditional reasoning in MD patients and explore the neural mechanism of cognitive processing.METHODS Thirty-four patients with MD and 34 healthy controls(HCs)completed ERP measurements while performing the Wason selection task(WST).The clusterbased permutation test in FieldTrip was used to compare the differences in the mean amplitudes between the patients with MD and HCs on the ERP components under different experimental conditions.Behavioral data[accuracy(ACC)and reaction times(RTs)],the ERP P100 and late positive potentials(LPPs)were analyzed.RESULTS Although the mean ACC was greater and the mean of RTs was shorter in HCs than in MD patients,the differences were not statistically significant.However,across both groups,the ACC in the precautionary WST was greater than that in the other tasks,and the RTs in the abstract task were greater than those in the other tasks.Importantly,compared with that of HCs,the P100 of the left centroparietal sites was significantly increased,and the early LPP was attenuated at parietal sites and increased at left frontocentral sites;the medium LPP and late LPP were increased at the left frontocentral sites.CONCLUSION Patients with MD have conditional reasoning dysfunction and exhibit abnormal ERP characteristics evoked by the WST,which suggests neural correlates of abnormalities in conditional reasoning function in MD patients.展开更多
The evidential reasoning(ER)rule framework has been widely applied in multi-attribute decision analysis and system assessment to manage uncertainty.However,traditional ER implementations rely on two critical limitatio...The evidential reasoning(ER)rule framework has been widely applied in multi-attribute decision analysis and system assessment to manage uncertainty.However,traditional ER implementations rely on two critical limitations:1)unrealistic assumptions of complete evidence independence,and 2)a lack of mechanisms to differentiate causal relationships from spurious correlations.Existing similarity-based approaches often misinterpret interdependent evidence,leading to unreliable decision outcomes.To address these gaps,this study proposes a causality-enhanced ER rule(CER-e)framework with three key methodological innovations:1)a multidimensional causal representation of evidence to capture dependency structures;2)probabilistic quantification of causal strength using transfer entropy,a model-free information-theoretic measure;3)systematic integration of causal parameters into the ER inference process while maintaining evidential objectivity.The PC algorithm is employed during causal discovery to eliminate spurious correlations,ensuring robust causal inference.Case studies in two types of domains—telecommunications network security assessment and structural risk evaluation—validate CER-e’s effectiveness in real-world scenarios.Under simulated incomplete information conditions,the framework demonstrates superior algorithmic robustness compared to traditional ER.Comparative analyses show that CER-e significantly improves both the interpretability of causal relationships and the reliability of assessment results,establishing a novel paradigm for integrating causal inference with evidential reasoning in complex system evaluation.展开更多
In this paper,a robust and consistent COVID-19 emergency decision-making approach is proposed based on q-rung linear diophantine fuzzy set(q-RLDFS),differential evolutionary(DE)optimization principles,and evidential r...In this paper,a robust and consistent COVID-19 emergency decision-making approach is proposed based on q-rung linear diophantine fuzzy set(q-RLDFS),differential evolutionary(DE)optimization principles,and evidential reasoning(ER)methodology.The proposed approach uses q-RLDFS in order to represent the evaluating values of the alternatives corresponding to the attributes.DE optimization is used to obtain the optimal weights of the attributes,and ER methodology is used to compute the aggregated q-rung linear diophantine fuzzy values(q-RLDFVs)of each alternative.Then the score values of alternatives are computed based on the aggregated q-RLDFVs.An alternative with the maximum score value is selected as a better one.The applicability of the proposed approach has been illustrated in COVID-19 emergency decision-making system and sustainable energy planning management.Moreover,we have validated the proposed approach with a numerical example.Finally,a comparative study is provided with the existing models,where the proposed approach is found to be robust to perform better and consistent in uncertain environments.展开更多
This paper proposed a new systematic approach-functional evidential reasoning model(FERM) for exploring hazardous chemical operational accidents under uncertainty. First, FERM was introduced to identify various causal...This paper proposed a new systematic approach-functional evidential reasoning model(FERM) for exploring hazardous chemical operational accidents under uncertainty. First, FERM was introduced to identify various causal factors and their performance changes in hazardous chemical operational accidents, along with determining the functional failure link relationships. Subsequently, FERM was employed to elucidate both qualitative and quantitative operational accident information within a unified framework, which could be regarded as the input of information fusion to obtain the fuzzy belief distribution of each cause factor. Finally, the derived risk values of the causal factors were ranked while constructing multi-level accident causation chains to unveil the weak links in system functionality and the primary roots of operational accidents. Using the specific case of the “1·15” major explosion and fire accident at Liaoning Panjin Haoye Chemical Co., Ltd., seven causal factors and their corresponding performance changes were identified. Additionally, five accident causation chains were uncovered based on the fuzzy joint distribution of the functional assessment level(FAL) and reliability distribution(RD),revealing an overall increase in risk along the accident evolution path. The research findings demonstrated that FERM enabled the effective characterization, rational quantification and accurate analysis of the inherent uncertainties in hazardous chemical operational accident risks from a systemic perspective.展开更多
In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theo...In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theorem,fractional calculus and resolvent operator functions,we prove the approximate controllability of the considered system.展开更多
Large language models(LLMs)have demonstrated remarkable generalization abilities across multiple tasks in natural language processing(NLP).For multi-step reasoning tasks,chain-of-thought(CoT)prompting facilitates step...Large language models(LLMs)have demonstrated remarkable generalization abilities across multiple tasks in natural language processing(NLP).For multi-step reasoning tasks,chain-of-thought(CoT)prompting facilitates step-by-step thinking,leading to improved performance.However,despite significant advancements in LLMs,current CoT prompting performs suboptimally on smaller-scale models that have fewer parameters.Additionally,the common paradigm of few-shot CoT prompting relies on a set of manual demonstrations,with performance contingent on the quality of these annotations and varying with task-specific requirements.To address these limitations,we propose a select-and-answer prompting method(SAP)to enhance language model performance on reasoning tasks without the need for manual demonstrations.This method comprises two primary steps:guiding the model to conduct preliminary analysis and generate several candidate answers based on the prompting;allowing the model to provide final answers derived from these candidate answers.The proposed prompting strategy is evaluated across two language models of varying sizes and six datasets.On ChatGLM-6B,SAP consistently outperforms few-shot CoT across all datasets.For GPT-3.5,SAP achieves comparable performance to few-shot CoT and outperforms zero-shot CoT in most cases.These experimental results indicate that SAP can significantly improve the accuracy of language models in reasoning tasks.展开更多
This study investigated the relationship between parental cognitive ability and child logical reasoning ability,and the role of academic expectation and family environment in that relationship.Based on the 2020 China ...This study investigated the relationship between parental cognitive ability and child logical reasoning ability,and the role of academic expectation and family environment in that relationship.Based on the 2020 China Family Panel Studies(CFPS)data,1491 children(girls ratio=53.78%;average grade=6.023 years,school grade standard deviation=1.825 years).Results following multiple regression model(OLS)show that the higher the parental cognitive ability,the higher the children’s logical reasoning ability.Secondly,parental academic expectation serves as a mediator between their cognitive ability and children’s logical reasoning ability for higher logical reasoning by children.Third,a possible family environment acts as a mediator in the relationship between parents’cognitive ability and children’s logical reasoning ability to be higher.We conclude from thesefindings that parents with high cognitive abilities can enhance their children’s logical reasoning skills not only by setting higher academic expectations,but also by cultivating a supportive family environment.Thesefindings imply a need for intervention to improve family quality of life to enhance children’s thinking abilities to optimize their academic learning.展开更多
As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be t...As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.展开更多
Aiming at the characteristics of autonomy,confrontation,and uncertainty in unmanned aerial vehicle(UAV)swarm operations,case-based reasoning(CBR)technology with advantages such as weak dependence on domain knowledge a...Aiming at the characteristics of autonomy,confrontation,and uncertainty in unmanned aerial vehicle(UAV)swarm operations,case-based reasoning(CBR)technology with advantages such as weak dependence on domain knowledge and efficient problem-solving is introduced,and a recommendation method for UAV swarm operation strategies based on CBR is proposed.Firstly,we design a universal framework for UAV swarm operation strategies from three dimensions:operation effectiveness,time,and cost.Secondly,based on the representation of operation cases,certain,fuzzy,interval,and classification attribute similarity calculation methods,as well as entropybased attribute weight allocation methods,are suggested to support the calculation of global similarity of cases.This method is utilized to match the source case with the most similarity from the historical case library,to obtain the optimal recommendation strategy for the target case.Finally,in the form of red blue confrontation,a UAV swarm operation strategy recommendation case is constructed based on actual battle cases,and a system simulation analysis is conducted.The results show that the strategy given in the example performs the best in three evaluation indicators,including cost-effectiveness,and overall outperforms other operation strategies.Therefore,the proposed method has advantages such as high real-time performance and interpretability,and can address the issue of recommending UAV swarm operation strategies in complex battlefield environments across both online and offline modes.At the same time,this study could also provide new ideas for the selection of UAV swarm operation strategies.展开更多
As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and soluti...As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.展开更多
基金supported by the Basic Science Research Program through the National Research Foundation of Korea(NRF),funded by the Ministry of Education(RS-2023-00249743).
文摘Most Convolutional Neural Network(CNN)interpretation techniques visualize only the dominant cues that the model relies on,but there is no guarantee that these represent all the evidence the model uses for classification.This limitation becomes critical when hidden secondary cues—potentially more meaningful than the visualized ones—remain undiscovered.This study introduces CasCAM(Cascaded Class Activation Mapping)to address this fundamental limitation through counterfactual reasoning.By asking“if this dominant cue were absent,what other evidence would the model use?”,CasCAM progressively masks the most salient features and systematically uncovers the hierarchy of classification evidence hidden beneath them.Experimental results demonstrate that CasCAM effectively discovers the full spectrum of reasoning evidence and can be universally applied with nine existing interpretation methods.
基金supported by the National Natural Science Foundation of China(60774100)the Natural Science Foundation of Shandong Province of China(Y2007A15)
文摘The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.
基金Supported by the National Natural Science Foundation of China (No. 60804063)
文摘With the increment of focal elements number in discernment framework,the computation amount in Dezert-Smarandache Theory (DSmT) will exponentially go up. This has been the bottleneck problem to block the wide application and development of DSmT. Aiming at this difficulty,in this paper,a kind of fast approximate reasoning method in hierarchical DSmT is proposed. Presently,this method is only fit for the case that there are only singletons with assignment in hyper-power set. These singletons in hyper-power set are forced to group through bintree or tri-tree technologies. At the same time,the assignments of singletons in those different groups corresponding to each source are added up respectively,in order to realize the mapping from the refined hyper-power set to the coarsened one. And then,two sources with the coarsened hyper-power set are combined together according to classical DSm Combination rule (DSmC) and Proportional Conflict Redistribution rule No. 5 (PCR5). The fused results in coarsened framework will be saved as the connecting weights between father and children nodes. And then,all assignments of singletons in different groups will be normalized respectively. Tree depth is set,in order to decide the iterative times in hierarchical system. Finally,by comparing new method with old one from different views,the superiority of new one over old one is testified well.
基金National Natural Science Foundation of China (No. 60875034)Spanish Ministry of Education and Science Fund,Spain (No.TIN-2009-0828)Spanish Regional Government (Junta de Andalucia) Fund,Spain (No. P08-TIC-3548)
文摘Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.
文摘Resolution is an useful tool for mechanical theorem proving in modelling the refutation proof procedure, which is mostly used in constructing a “proof” of a “theorem”. An attempt is made to utilize approximate reasoning methodology in fuzzy resolution. Approximate reasoning is a methodology which can deduce a specific information from general knowledge and specific observation. It is dependent on the form of general knowledge and the corresponding deductive mechanism. In ordinary approximate reasoning, we derive from A→B and by some mechanism. In inverse approximate reasoning, we conclude from A→B and using an altogether different mechanism. An important observation is that similarity is inherent in fuzzy set theory. In approximate reasoning methodology-similarity relation is used in fuzzification while, similarity measure is used in fuzzy inference mechanism. This research proposes that similarity based approximate reasoning-modelling generalised modus ponens/generalised modus tollens—can be used to derive a resolution—like inference pattern in fuzzy logic. The proposal is well-illustrated with artificial examples.
文摘In this peper, we reseach the following form of approximate reasoning.Ant 1: (If x1 is A1 and x2 is A2and… and xn is An then y is B) is t1.Ant 2: (x1 is A’1 and x2 is A’2 and… and xn is A’n) is t2.Cons: (y is。B’) is ts.First we put forward two reasonable approximate reasoning principles, then, accordingg tO the two reasoning principles we construct a new kind of approximate reasoning methods. The bole idea which the new kind of approximate reasoning methods is that according to the strength p(A1(x1), …, An(xn) )→B (y) which A1(x1),…, An(xn) implicate B(y) and the degree of A’(x) approximates to A(x), we determine the upper limit and B’(y), then take a definite value B’(y) in between the upper limit and the lower limit, and make the reasoning method satisfied the two reasoning principles.
文摘This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreover,we establish the controllability of the considered system.To do so,first,we investigate the approximate controllability of the corresponding linear system.Subsequently,we prove the nonlinear system is approximately controllable if the corresponding linear system is approximately controllable.To reach the conclusions,the theory of resolvent operators,the Banach contraction mapping principle,and fixed point theorems are used.While concluding,some examples are given to demonstrate the efficacy of the proposed results.
基金supported in part by the National Natural Science Foundation of China(No.62302507)and the funding of Harbin Institute of Technology(Shenzhen)(No.20210035).
文摘Extrapolation on Temporal Knowledge Graphs(TKGs)aims to predict future knowledge from a set of historical Knowledge Graphs in chronological order.The temporally adjacent facts in TKGs naturally form event sequences,called event evolution patterns,implying informative temporal dependencies between events.Recently,many extrapolation works on TKGs have been devoted to modelling these evolutional patterns,but the task is still far from resolved because most existing works simply rely on encoding these patterns into entity representations while overlooking the significant information implied by relations of evolutional patterns.However,the authors realise that the temporal dependencies inherent in the relations of these event evolution patterns may guide the follow-up event prediction to some extent.To this end,a Temporal Relational Context-based Temporal Dependencies Learning Network(TRenD)is proposed to explore the temporal context of relations for more comprehensive learning of event evolution patterns,especially those temporal dependencies caused by interactive patterns of relations.Trend incorporates a semantic context unit to capture semantic correlations between relations,and a structural context unit to learn the interaction pattern of relations.By learning the temporal contexts of relations semantically and structurally,the authors gain insights into the underlying event evolution patterns,enabling to extract comprehensive historical information for future prediction better.Experimental results on benchmark datasets demonstrate the superiority of the model.
文摘The cross-modal person re-identification task aims to match visible and infrared images of the same individual.The main challenges in this field arise from significant modality differences between individuals and the lack of high-quality cross-modal correspondence methods.Existing approaches often attempt to establish modality correspondence by extracting shared features across different modalities.However,these methods tend to focus on local information extraction and fail to fully leverage the global identity information in the cross-modal features,resulting in limited correspondence accuracy and suboptimal matching performance.To address this issue,we propose a quadratic graph matching method designed to overcome the challenges posed by modality differences through precise cross-modal relationship alignment.This method transforms the cross-modal correspondence problem into a graph matching task and minimizes the matching cost using a center search mechanism.Building on this approach,we further design a block reasoning module to uncover latent relationships between person identities and optimize the modality correspondence results.The block strategy not only improves the efficiency of updating gallery images but also enhances matching accuracy while reducing computational load.Experimental results demonstrate that our proposed method outperforms the state-of-the-art methods on the SYSU-MM01,RegDB,and RGBNT201 datasets,achieving excellent matching accuracy and robustness,thereby validating its effectiveness in cross-modal person re-identification.
基金Supported by Wuxi Taihu Talent Project,No.WXTTP 2021the General Scientific Research Program of Wuxi Municipal Health Commission,No.M202447.
文摘BACKGROUND Patients with major depression(MD)exhibit conditional reasoning dysfunction;however,no studies on the event-related potential(ERP)characteristics of conditional reasoning in MD have been reported.AIM To investigate the ERP characteristics of conditional reasoning in MD patients and explore the neural mechanism of cognitive processing.METHODS Thirty-four patients with MD and 34 healthy controls(HCs)completed ERP measurements while performing the Wason selection task(WST).The clusterbased permutation test in FieldTrip was used to compare the differences in the mean amplitudes between the patients with MD and HCs on the ERP components under different experimental conditions.Behavioral data[accuracy(ACC)and reaction times(RTs)],the ERP P100 and late positive potentials(LPPs)were analyzed.RESULTS Although the mean ACC was greater and the mean of RTs was shorter in HCs than in MD patients,the differences were not statistically significant.However,across both groups,the ACC in the precautionary WST was greater than that in the other tasks,and the RTs in the abstract task were greater than those in the other tasks.Importantly,compared with that of HCs,the P100 of the left centroparietal sites was significantly increased,and the early LPP was attenuated at parietal sites and increased at left frontocentral sites;the medium LPP and late LPP were increased at the left frontocentral sites.CONCLUSION Patients with MD have conditional reasoning dysfunction and exhibit abnormal ERP characteristics evoked by the WST,which suggests neural correlates of abnormalities in conditional reasoning function in MD patients.
基金supported by the Natural Science Foundation of China(Nos.U22A2099,62273113,62203461,62203365)the Innovation Project of Guangxi Graduate Education under Grant YCBZ2023130by the Guangxi Higher Education Undergraduate Teaching Reform Project Key Project,grant number 2022JGZ130.
文摘The evidential reasoning(ER)rule framework has been widely applied in multi-attribute decision analysis and system assessment to manage uncertainty.However,traditional ER implementations rely on two critical limitations:1)unrealistic assumptions of complete evidence independence,and 2)a lack of mechanisms to differentiate causal relationships from spurious correlations.Existing similarity-based approaches often misinterpret interdependent evidence,leading to unreliable decision outcomes.To address these gaps,this study proposes a causality-enhanced ER rule(CER-e)framework with three key methodological innovations:1)a multidimensional causal representation of evidence to capture dependency structures;2)probabilistic quantification of causal strength using transfer entropy,a model-free information-theoretic measure;3)systematic integration of causal parameters into the ER inference process while maintaining evidential objectivity.The PC algorithm is employed during causal discovery to eliminate spurious correlations,ensuring robust causal inference.Case studies in two types of domains—telecommunications network security assessment and structural risk evaluation—validate CER-e’s effectiveness in real-world scenarios.Under simulated incomplete information conditions,the framework demonstrates superior algorithmic robustness compared to traditional ER.Comparative analyses show that CER-e significantly improves both the interpretability of causal relationships and the reliability of assessment results,establishing a novel paradigm for integrating causal inference with evidential reasoning in complex system evaluation.
文摘In this paper,a robust and consistent COVID-19 emergency decision-making approach is proposed based on q-rung linear diophantine fuzzy set(q-RLDFS),differential evolutionary(DE)optimization principles,and evidential reasoning(ER)methodology.The proposed approach uses q-RLDFS in order to represent the evaluating values of the alternatives corresponding to the attributes.DE optimization is used to obtain the optimal weights of the attributes,and ER methodology is used to compute the aggregated q-rung linear diophantine fuzzy values(q-RLDFVs)of each alternative.Then the score values of alternatives are computed based on the aggregated q-RLDFVs.An alternative with the maximum score value is selected as a better one.The applicability of the proposed approach has been illustrated in COVID-19 emergency decision-making system and sustainable energy planning management.Moreover,we have validated the proposed approach with a numerical example.Finally,a comparative study is provided with the existing models,where the proposed approach is found to be robust to perform better and consistent in uncertain environments.
基金supported by the National Key Research&Development Program of China(2021YFB3301100)the National Natural Science Foundation of China(52004014)the Fundamental Research Funds for the Central Universities(ZY2406).
文摘This paper proposed a new systematic approach-functional evidential reasoning model(FERM) for exploring hazardous chemical operational accidents under uncertainty. First, FERM was introduced to identify various causal factors and their performance changes in hazardous chemical operational accidents, along with determining the functional failure link relationships. Subsequently, FERM was employed to elucidate both qualitative and quantitative operational accident information within a unified framework, which could be regarded as the input of information fusion to obtain the fuzzy belief distribution of each cause factor. Finally, the derived risk values of the causal factors were ranked while constructing multi-level accident causation chains to unveil the weak links in system functionality and the primary roots of operational accidents. Using the specific case of the “1·15” major explosion and fire accident at Liaoning Panjin Haoye Chemical Co., Ltd., seven causal factors and their corresponding performance changes were identified. Additionally, five accident causation chains were uncovered based on the fuzzy joint distribution of the functional assessment level(FAL) and reliability distribution(RD),revealing an overall increase in risk along the accident evolution path. The research findings demonstrated that FERM enabled the effective characterization, rational quantification and accurate analysis of the inherent uncertainties in hazardous chemical operational accident risks from a systemic perspective.
基金Supported by Shandong University of Finance and Economics 2023 International Collaborative Projectsthe National Natural Science Foundation of China(Grant No.62073190)。
文摘In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theorem,fractional calculus and resolvent operator functions,we prove the approximate controllability of the considered system.
基金National Natural Science Foundation of China(No.62176052)。
文摘Large language models(LLMs)have demonstrated remarkable generalization abilities across multiple tasks in natural language processing(NLP).For multi-step reasoning tasks,chain-of-thought(CoT)prompting facilitates step-by-step thinking,leading to improved performance.However,despite significant advancements in LLMs,current CoT prompting performs suboptimally on smaller-scale models that have fewer parameters.Additionally,the common paradigm of few-shot CoT prompting relies on a set of manual demonstrations,with performance contingent on the quality of these annotations and varying with task-specific requirements.To address these limitations,we propose a select-and-answer prompting method(SAP)to enhance language model performance on reasoning tasks without the need for manual demonstrations.This method comprises two primary steps:guiding the model to conduct preliminary analysis and generate several candidate answers based on the prompting;allowing the model to provide final answers derived from these candidate answers.The proposed prompting strategy is evaluated across two language models of varying sizes and six datasets.On ChatGLM-6B,SAP consistently outperforms few-shot CoT across all datasets.For GPT-3.5,SAP achieves comparable performance to few-shot CoT and outperforms zero-shot CoT in most cases.These experimental results indicate that SAP can significantly improve the accuracy of language models in reasoning tasks.
基金supported by scientific research fund of Jiangxi Provincial Social Sciences“14th Five-Year Plan”(No.23SH05).
文摘This study investigated the relationship between parental cognitive ability and child logical reasoning ability,and the role of academic expectation and family environment in that relationship.Based on the 2020 China Family Panel Studies(CFPS)data,1491 children(girls ratio=53.78%;average grade=6.023 years,school grade standard deviation=1.825 years).Results following multiple regression model(OLS)show that the higher the parental cognitive ability,the higher the children’s logical reasoning ability.Secondly,parental academic expectation serves as a mediator between their cognitive ability and children’s logical reasoning ability for higher logical reasoning by children.Third,a possible family environment acts as a mediator in the relationship between parents’cognitive ability and children’s logical reasoning ability to be higher.We conclude from thesefindings that parents with high cognitive abilities can enhance their children’s logical reasoning skills not only by setting higher academic expectations,but also by cultivating a supportive family environment.Thesefindings imply a need for intervention to improve family quality of life to enhance children’s thinking abilities to optimize their academic learning.
基金funded by National Science and Technology Council,Taiwan,grant numbers are 110-2401-H-002-094-MY2 and 112-2221-E-130-001.
文摘As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.
基金supported by the National Natural Science Foundation of China(72101263)the Natural Science Foundation of Hunan Province(2023JJ40677).
文摘Aiming at the characteristics of autonomy,confrontation,and uncertainty in unmanned aerial vehicle(UAV)swarm operations,case-based reasoning(CBR)technology with advantages such as weak dependence on domain knowledge and efficient problem-solving is introduced,and a recommendation method for UAV swarm operation strategies based on CBR is proposed.Firstly,we design a universal framework for UAV swarm operation strategies from three dimensions:operation effectiveness,time,and cost.Secondly,based on the representation of operation cases,certain,fuzzy,interval,and classification attribute similarity calculation methods,as well as entropybased attribute weight allocation methods,are suggested to support the calculation of global similarity of cases.This method is utilized to match the source case with the most similarity from the historical case library,to obtain the optimal recommendation strategy for the target case.Finally,in the form of red blue confrontation,a UAV swarm operation strategy recommendation case is constructed based on actual battle cases,and a system simulation analysis is conducted.The results show that the strategy given in the example performs the best in three evaluation indicators,including cost-effectiveness,and overall outperforms other operation strategies.Therefore,the proposed method has advantages such as high real-time performance and interpretability,and can address the issue of recommending UAV swarm operation strategies in complex battlefield environments across both online and offline modes.At the same time,this study could also provide new ideas for the selection of UAV swarm operation strategies.
文摘As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.
