As organizations increasingly embrace digital transformation, the integration of modern web technologies like React.js with Business Process Management (BPM) applications has become essential. React components offer f...As organizations increasingly embrace digital transformation, the integration of modern web technologies like React.js with Business Process Management (BPM) applications has become essential. React components offer flexibility, reusability, and scalability, making them ideal for enhancing user interfaces and driving user engagement within BPM environments. This article explores the benefits, challenges, and best practices of leveraging React components in BPM applications, along with real-world examples of successful implementations.展开更多
Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent ...Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent results of the quantum computation group at Nanjing University, namely the functional quantum programming language NDQFP. All primitive functions and combining forms in NDQFP are given in the appendix.展开更多
Declarative Programming Languages (DPLs) apply a process model of Horn claun es such as PARLOG[8] or a reduction model of A-calculus such as SML[7] and are) in principle, well suited to multiprocessor implemelltation....Declarative Programming Languages (DPLs) apply a process model of Horn claun es such as PARLOG[8] or a reduction model of A-calculus such as SML[7] and are) in principle, well suited to multiprocessor implemelltation. However, the performance of a parallel declarative program can be impaired by a mismatch between the parallelism available in an application and the parallelism available in the architecture. A particularly attractive solution is to automatically match the parallelism of the program to the parallelism of the target hardware as a compilation step. In this paper) we present an optimizillg compilation technique called granularity analysis which identi fies and removes excess parallelism that would degrade performance. The main steps are: an analysis of the flow of data to form an attributed call graph between function (or predicate) arguments; and an asymptotic estimation of granularity of a function (or predicate) to generate approximate grain size. Compiled procedure calls can be annotated with grain size and a task scheduler can make scheduling decisions with the classilication scheme of grains to control parallelism at runtime. The resulting granularity analysis scheme is suitable for exploiting adaptive parallelism of declarative programming languages on multiprocessors.展开更多
Due to the rapid development of applications of artificial intelligence and robotics in recent years, the necessity of reasoning and decision making with uncertain and inaccurate information is increasing. Since robot...Due to the rapid development of applications of artificial intelligence and robotics in recent years, the necessity of reasoning and decision making with uncertain and inaccurate information is increasing. Since robots in the real world are always exposed to behavioral inaccuracies and uncertainty arising from recognition methods, they may occasionally encounter contradictory facts during reasoning on action decision. Paraconsistent logic programming is promising to make appropriate action decisions even when an agent is exposed to such uncertain information or contradictory facts, but there has been no implementation of this programming to the best of our knowledge. We propose a resolution algorithm for the 3-valued paraconsistent logic programming system QMPT0 and its implementation on SWI-Prolog. We also describe an application of the 3-valued paraconsistent logic programming regarding agent decision making.展开更多
Statistics of this Paper derive from a business correspondence translation,Sing Sing Lounge,participated by English ma jors of one higher-educational institution.Facilitated with means of quantitative approach,this Pa...Statistics of this Paper derive from a business correspondence translation,Sing Sing Lounge,participated by English ma jors of one higher-educational institution.Facilitated with means of quantitative approach,this Paper,introducing an applicable procedure to analyze translation by students from one Class,is devoted to discover subjects used in declarative sentences of their translations.展开更多
We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.
In this paper,we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors.Under the graph rewriting framework, a Heterogeneous Parallel G...In this paper,we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors.Under the graph rewriting framework, a Heterogeneous Parallel Graph Rewriting Execution Model(HPGREM)is presented firstly.Then based on HPGREM,a parallel abstract machine PAM/TGR is described.Furthermore,several optimizing compilation schemes for executing declarative programs on transputer array are proposed. The performance statistics on a transputer array demonstrate the effectiveness of our model,parallel ab- stract machine,optimizing compilation strategies and compiler.展开更多
This paper presents a declarative semantics of compositional inheritancein an object-oriented logic programming' framework wit h explicit exceptions,based on the iterated least Aspoint semantics to normal logic pr...This paper presents a declarative semantics of compositional inheritancein an object-oriented logic programming' framework wit h explicit exceptions,based on the iterated least Aspoint semantics to normal logic programs. Tak-ing logic objects with exceptions as a ldnd of nonmonotonic theory, the nonmonotonicity of inheritance is achieved, which is of importance for modelingincomplete knowledge and requirement specffications in both artificial intelli-gence and softwa-re engineering.展开更多
This study followed a 52-year-old male patient, who had suffered from severe impairment in recent memory due to se- quelae of herpes encephalitis, for 20 years. He returned to his highly intellectual work and performe...This study followed a 52-year-old male patient, who had suffered from severe impairment in recent memory due to se- quelae of herpes encephalitis, for 20 years. He returned to his highly intellectual work and performed well despite his doctor’s prediction. While the patient showed consistently poor results on various neuropsychological memory tests, he demonstrated incredible performance at work. This case exemplifies an extreme case that declarative memory is formed with the support of semantic memory, procedural memory, and his strong interests. Additionally, it offers lessons that results on memory tests do not necessarily correspond to the actual level of competence. The focal sites were found on both sides of the medial temporal lobe, predominantly on the left side. The T2-weighted magnetic resonance images (MRI) obtained 9 years after the onset confirmed widespread damage to the left brain including parahippocampal gyrus, hippocampus, spindle gyrus, and amygdaloid complex, with microlesions extending from the right parahippocampal gyrus to its antero-interior rim. However, the damage to hippocampus was presumed to be minor.展开更多
Object-oriented modeling with declarative equation based languages often unconsciously leads to structural inconsistencies. Component-based debugging is a new structural analysis approach that addresses this problem b...Object-oriented modeling with declarative equation based languages often unconsciously leads to structural inconsistencies. Component-based debugging is a new structural analysis approach that addresses this problem by analyzing the structure of each component in a model to separately locate faulty components. The analysis procedure is performed recursively based on the depth-first rule. It first generates fictitious equations for a component to establish a debugging environment, and then detects structural defects by using graph theoretical approaches to analyzing the structure of the system of equations resulting from the component. The proposed method can automatically locate components that cause the structural inconsistencies, and show the user detailed error messages. This information can be a great help in finding and localizing structural inconsistencies, and in some cases pinpoints them immediately.展开更多
Objective:To investigate gender difference in the effects of daytime sleep on item and source memories,which are dissociable elements of declarative memory,and the effects of sleep on recollection and familiarity,whic...Objective:To investigate gender difference in the effects of daytime sleep on item and source memories,which are dissociable elements of declarative memory,and the effects of sleep on recollection and familiarity,which are two processes underlying recognition. Methods:Participants saw a series of pictures with either blue or red background,and were then given a pretest for item and source memories. Then males and females respectively were randomly assigned either to a wake or a sleep condition. In the wake condition,participants remained awake until the posttest;in the sleep condition,participants slept for 1 h until awakened and asked to remain awake until the posttest. Results:Daytime sleep contributed to retention of source memory rather than item memory in females,whereas males undergoing daytime sleep had a trend towards increased familiarity. For females,however,neither recollection nor familiarity appeared to be influenced by daytime sleep. Conclusion:The mechanism underlying gender difference may be linked with different memory traces resulting from different encoding strategies,as well as with different electrophysiological changes during daytime sleep.展开更多
文摘As organizations increasingly embrace digital transformation, the integration of modern web technologies like React.js with Business Process Management (BPM) applications has become essential. React components offer flexibility, reusability, and scalability, making them ideal for enhancing user interfaces and driving user engagement within BPM environments. This article explores the benefits, challenges, and best practices of leveraging React components in BPM applications, along with real-world examples of successful implementations.
基金the National Natural Science Foundation of China (Grant No. 60721002)
文摘Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent results of the quantum computation group at Nanjing University, namely the functional quantum programming language NDQFP. All primitive functions and combining forms in NDQFP are given in the appendix.
文摘Declarative Programming Languages (DPLs) apply a process model of Horn claun es such as PARLOG[8] or a reduction model of A-calculus such as SML[7] and are) in principle, well suited to multiprocessor implemelltation. However, the performance of a parallel declarative program can be impaired by a mismatch between the parallelism available in an application and the parallelism available in the architecture. A particularly attractive solution is to automatically match the parallelism of the program to the parallelism of the target hardware as a compilation step. In this paper) we present an optimizillg compilation technique called granularity analysis which identi fies and removes excess parallelism that would degrade performance. The main steps are: an analysis of the flow of data to form an attributed call graph between function (or predicate) arguments; and an asymptotic estimation of granularity of a function (or predicate) to generate approximate grain size. Compiled procedure calls can be annotated with grain size and a task scheduler can make scheduling decisions with the classilication scheme of grains to control parallelism at runtime. The resulting granularity analysis scheme is suitable for exploiting adaptive parallelism of declarative programming languages on multiprocessors.
文摘Due to the rapid development of applications of artificial intelligence and robotics in recent years, the necessity of reasoning and decision making with uncertain and inaccurate information is increasing. Since robots in the real world are always exposed to behavioral inaccuracies and uncertainty arising from recognition methods, they may occasionally encounter contradictory facts during reasoning on action decision. Paraconsistent logic programming is promising to make appropriate action decisions even when an agent is exposed to such uncertain information or contradictory facts, but there has been no implementation of this programming to the best of our knowledge. We propose a resolution algorithm for the 3-valued paraconsistent logic programming system QMPT0 and its implementation on SWI-Prolog. We also describe an application of the 3-valued paraconsistent logic programming regarding agent decision making.
文摘Statistics of this Paper derive from a business correspondence translation,Sing Sing Lounge,participated by English ma jors of one higher-educational institution.Facilitated with means of quantitative approach,this Paper,introducing an applicable procedure to analyze translation by students from one Class,is devoted to discover subjects used in declarative sentences of their translations.
文摘We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.
基金This work was partially supported by the National 863 High Technical Grant 863-306-101the National Doctoral Subject Foundation Grant 0249136.
文摘In this paper,we focus on the compiling implementation of parallel logic language PARLOG and functional language ML on distributed memory multiprocessors.Under the graph rewriting framework, a Heterogeneous Parallel Graph Rewriting Execution Model(HPGREM)is presented firstly.Then based on HPGREM,a parallel abstract machine PAM/TGR is described.Furthermore,several optimizing compilation schemes for executing declarative programs on transputer array are proposed. The performance statistics on a transputer array demonstrate the effectiveness of our model,parallel ab- stract machine,optimizing compilation strategies and compiler.
文摘This paper presents a declarative semantics of compositional inheritancein an object-oriented logic programming' framework wit h explicit exceptions,based on the iterated least Aspoint semantics to normal logic programs. Tak-ing logic objects with exceptions as a ldnd of nonmonotonic theory, the nonmonotonicity of inheritance is achieved, which is of importance for modelingincomplete knowledge and requirement specffications in both artificial intelli-gence and softwa-re engineering.
文摘This study followed a 52-year-old male patient, who had suffered from severe impairment in recent memory due to se- quelae of herpes encephalitis, for 20 years. He returned to his highly intellectual work and performed well despite his doctor’s prediction. While the patient showed consistently poor results on various neuropsychological memory tests, he demonstrated incredible performance at work. This case exemplifies an extreme case that declarative memory is formed with the support of semantic memory, procedural memory, and his strong interests. Additionally, it offers lessons that results on memory tests do not necessarily correspond to the actual level of competence. The focal sites were found on both sides of the medial temporal lobe, predominantly on the left side. The T2-weighted magnetic resonance images (MRI) obtained 9 years after the onset confirmed widespread damage to the left brain including parahippocampal gyrus, hippocampus, spindle gyrus, and amygdaloid complex, with microlesions extending from the right parahippocampal gyrus to its antero-interior rim. However, the damage to hippocampus was presumed to be minor.
基金Supported by the National Natural Science Foundation of China （Grant No. 60574053）, the National High-Tech Development 863 Program of China （Grant No. 2003AA001031）, and the National Basic Research 973 Program of China （Grant No. 2003CB716207）.
文摘Object-oriented modeling with declarative equation based languages often unconsciously leads to structural inconsistencies. Component-based debugging is a new structural analysis approach that addresses this problem by analyzing the structure of each component in a model to separately locate faulty components. The analysis procedure is performed recursively based on the depth-first rule. It first generates fictitious equations for a component to establish a debugging environment, and then detects structural defects by using graph theoretical approaches to analyzing the structure of the system of equations resulting from the component. The proposed method can automatically locate components that cause the structural inconsistencies, and show the user detailed error messages. This information can be a great help in finding and localizing structural inconsistencies, and in some cases pinpoints them immediately.
基金supported partially by the National Basic Research Program (973) of China (No. 2006CB303101)the National Natural Science Foundation of China (No. 90820305)
文摘Objective:To investigate gender difference in the effects of daytime sleep on item and source memories,which are dissociable elements of declarative memory,and the effects of sleep on recollection and familiarity,which are two processes underlying recognition. Methods:Participants saw a series of pictures with either blue or red background,and were then given a pretest for item and source memories. Then males and females respectively were randomly assigned either to a wake or a sleep condition. In the wake condition,participants remained awake until the posttest;in the sleep condition,participants slept for 1 h until awakened and asked to remain awake until the posttest. Results:Daytime sleep contributed to retention of source memory rather than item memory in females,whereas males undergoing daytime sleep had a trend towards increased familiarity. For females,however,neither recollection nor familiarity appeared to be influenced by daytime sleep. Conclusion:The mechanism underlying gender difference may be linked with different memory traces resulting from different encoding strategies,as well as with different electrophysiological changes during daytime sleep.
