多媒体推理的概念框架

Up to now, AI technology is dominated by the Physical Symbolic System(PSS), in which symbolic information is used as the medium for reasoning, In these approaches, information other than symbols, such as image, graphics, and even video should first be represented by symbols, and after reasoning, the symbolic result is again changed into its original media form. In this paper, we will propose a new form of reasoning method called multimedia reasoning (MR), a kind of reasoning that is based on the different media such as text, image, video, audio and so on. By introducing the concept of multimedia transformation theory (MTT), it presents a conceptual framework for multimedia reasoning, In the end, it discusses the importance and potentials in applications.     

A general scheme for formalizing defaults using the predicateab(I, S)

In common sense reasoning two typical types of defaults are encountered.One is of the form “all birds can fly excepts b1,b2,…,and bm(m≥1)”,and the other “All birds can fly,but there exist exceptions”.The type of defaults is readily formalized but the other,as some researchers have noticad,is difficult to deal with.This paper establishes a general scheme for formalizing defaults of the two types,the key to which is the introduction of a two-argument predicate ab(I,S) to represent exceptional objects.     

Asymptotic stability of port‑hamiltonian systems with constant inputs

In this paper, the asymptotic stability of Port-Hamiltonian (PH) systems with constant inputs is studied. Constant inputs are useful for stabilizing systems at their nonzero equilibria and can be realized by step signals. To achieve this goal, two methods based on integral action and comparison principle are presented in this paper. These methods change the convex Hamiltonian function and the restricted damping matrix of the previous results into a Hamiltonian function with a local minimum and a positive semidefinite matrix, respectively. Due to common conditions of Hamiltonian function and damping matrix, the proposed method asymptotically stabilizes more classes of PH systems with constant inputs than the existing methods. Finally, the validity and advantages of the presented methods are shown in an example.     

Domain-specific ontology of botany

Domain-specific ontologies are greatly useful in knowledge acquisition, sharing and analysis. In this paper, botany-specific ontology for acquiring and analyzing botanical knowledge is presented. The ontology is represented in a set of well-defined categories, and each concept is viewed as an instance of certain category. The authors also introduce botany-specific axioms, an integral part of the ontology, for checking and reasoning with the acquired knowledge. Consistency, completeness and redundancy of the axioms are discussed.     

Formalizing Default Reasoning

Fuzzy set systems can be used to solve the problem with uncertain knowledge,and default logic can be used to solve the problem with incomplete knowledge,in some sense.In this paper,based on interval-valued fuzzy sets we introduce a method of inference which combines approximate reasoning an default ogic,and give the procedure of transforming monotonic reasoning into default reasoning.     

A new approximation algorithm for sorting of signed permutations

Sequence comparison leads to a combinatorial optimization problem of sorting permutations by reversals and transpositions.Namely,given any two permutations,find the shortest distance between them.This problem is related with genome rearrangement,genes are oriented in DNA sequences.The transpositions which have been studied in the liteature can be viewed as operations working on two consecutive segments of the genome.In this paper,a new kind of transposition which can work on two arbitrary segments of the genome is proposed,and the sorting of signed permutations by reversals and this new kind of transpostitions are studied.After establishing a lower bound on the number of operations needed,a 2-approximation algorithm is presented for this problem and an example is given to show that the performance ratio of the algorithm cannot be improved.     

Isomorphic transformations of uncertainties for incorporating EMYCIN-style and PROSPECTOR-style systems into a distributed expert system

In the past,expert systems exploited mainly the EMYCIN model and the PROSPECTOR mdoel to deal with uncertaintes.In other words,a lot of stand-alone expert systems which use thse two models are available.If we can use the Internet to Couple them together,their performance will be improved through cooperation.This is because the problem-solving ability of expert systems is greatly improved by the way of cooperation among different expert systems in a distributed expert system.Cooperation between different expert systems with these two heterogeneous uncertain reasoning models is essentially based on the transformations of uncertainties of propositions between these two models.In this paper,we discovered the exactly isomorphic transformations uncertaintis between uncertain reasoning models,as used by EMYCIN and PROSPECTOR.     

The completeness and applications of the formal system B

Since the formal deductive system (?) was built up in 1997, it has played important roles in the theoretical and applied research of fuzzy logic and fuzzy reasoning. But, up to now, the completeness problem of the system (?) is still an open problem. In this paper, the properties and structure of R0 algebras are further studied, and it is shown that every tautology on the R0 interval [0,1] is also a tautology on any R0 algebra. Furthermore, based on the particular structure of (?) -Lindenbaum algebra, the completeness and strong completeness of the system (?) are proved. Some applications of the system (?) in fuzzy reasoning are also discussed, and the obtained results and examples show that the system (?) is suprior to some other important fuzzy logic systems.     

基于空间推理的设计方法及其应用

In this paper,we discuss two main techniques concerning spatial reasoning in the designfield:representation of spatial relation and method of spatial reasoning. Based on this,we present aspatial reasoning model. Finally,we discuss an automatic advertising creation system which acts asan example of this model     

Counterworking the Operation Disturbance of a Radiators Structure due to External Actions

The operation of a complicated radiators structure creating a required field in a given area is disturbed often due to different external actions. As an example, the impact of metallic objects approaching off to an antenna system with minimal irradiation on user＇s body is analyzed. In this case, the zone itself, where the area of a weak field （a dark spot） is created, is generally not approachable for sensors installation. In order to counteract the disturbance of the system operation due to presence of different metallic objects in close proximity to the radiators, two methods based on two information sources are studied. These information sources are antennas driving currents and fields at a predetermined point outside the given area. As an example, the antenna system used in the compensation method for reducing human＇s body irradiation, to which a metal object approaches, is analyzed. The conditions of severe external actions are considered： a great metal body and a small distance from this body to the dark spot. It is shown that under these conditions of severe external actions the second method based on the field values measuring demonstrates a higher efficiency. A block scheme for structure of an automatic adjustment is suggested. The considered problem is a common one, and developers of radio circuits are faced with them constantly.     

Reverse triple Ⅰ method of fuzzy reasoning

A theory of reverse triple I method with sustention degree is presented by using the implication operator R0 in every step of the fuzzy reasoning. Its computation formulas of supremum for fuzzy modus ponens and infimum for fuzzy modus tollens are given respectively. Moreover, through the generalization of this problem, the corresponding formulas of α-reverse triple I method with sustention degree are also obtained. In addition, the theory of reverse triple I method with restriction degree is proposed as well by using the operator R0, and the computation formulas of infimum for fuzzy modus ponens and supremum for fuzzy modus tollens are shown.     

Decomposing a kind of weakly invertible finite automata with delay 2

Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given,where each of those two automata has the output set of each state with the same size.And for a weakly invertible finite automaton M with delay 2 satisfying the properties mentioned in this paper,two weakly invertible finite automata with delay 1 are constructed such that M is equivalent to a sub-finite-automaton of the composition of those two.So a method to decompose this a kind of weakly invertible finite automate with delay 2 is presented.     

A causal model for diagnostic reasoning

Up to now,there have many methods for knowledge representation and reasoning in causal networks,but few of them include the research on the coactions of nodes.In practice,ignoring these coactions may influence the accureacy of reasoning and even give rise to incorrect reasoning.In this paper,based on multilayer causal networks.the definitions on coaction nodes are given to construct a new causal network called Coaction Causal Network,which serves to construct a model of nerual network for diagnosis followed by fuzzy reasoning,and then the activation rules are given and neural computing methods are used to finish the diagnostic reasoning,These methods are proved in theory and a method of computing the number of solutions for the diagnostic reasoning is given.Finally,the experiments and the conclusions are presented.     

Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling

This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.     

Using confidence interval to summarize the evaluating results of DSM systems

Distributed shared Memory(DSM) systems have gained popular acceptance by combining the scalability and low cost of distributed system with the ease of use of single address space.Many new hardware DSM and software DSM systems have been proposed in recent years.In general,benchmarking is widely used to demonstrate the performance advantages of new systems.Howerver,the common method used to summarize the measured results is the arithmetic mean of ratios,which is incorrect in some cases.Furthermore,many published papers list a lot of data only,and do not summarize them effectively,which confuse users greatly.In fact,many users want to get a single number as conclusion,which is not provided in old summarizing techniques.Therefore,a new data-summarizing technique based on confidence interval is proposed in this paper.The new technique includes two data-summarizing methods:(1) paried confidence interval method;(2) unpaired confidence interval method.With this new technique,it is concluded that at some confidence one system is better than others.Four examples are shown to demonstrate the advantages of this new technique.Furthermore,with the help of confidence level,it is proposed to standardize the benchmaks used for evaluating DSM systems so that a convincing result can be got,In addition,the new summarizing technique fits not only for evaluating DSM systems,but also for evaluating other systems,such as memory system and communication systems.     

A Common Reasoning Model and Its Application in Knowledge-Based System

To use reasoning knowledge accurately and efficiently,many reasoning methods have been proposed.However,the differences in form among the methods may obstruct the systematical analysis and harmonious integration of them.In this paper,a common reasoning model JUM(Judgement Model)is introduced.According to JUM,a common knowledge representation form is abstracted from different reasoning methods and its limitation is reduced.We also propose an algorithm for transforming one type of JUMs into another.In some cases,the algorithm can be used to resolve the key problem of integrating different types of JUM in one system.It is possible that a new architecture of knowledge-based system can be realized under JUM.     

Hybrid algorithm for accelerating the double series of Floquet vector modes

In this paper, a hybrid algorithm for accelerating the double series of Floquet vector modes arising in the analysis of frequency selective surfaces (FSS) is presented. The asymptotic terms with slow convergence in the double series are first accelerated by Poisson transformation and Ewald method, and then the remained series is accelerated by Shank transformation. It results in significant savings in memory and computing time. Numerical examples verify the validity of the hybrid acceleration algorithm.     

A neuro‑observer‑based optimal control for nonaffine nonlinear systems with control input saturations

In this study, an adaptive neuro-observer-based optimal control (ANOPC) policy is introduced for unknown nonaffine nonlinear systems with control input constraints. Hamilton–Jacobi–Bellman (HJB) framework is employed to minimize a non-quadratic cost function corresponding to the constrained control input. ANOPC consists of both analytical and algebraic parts. In the analytical part, first, an observer-based neural network (NN) approximates uncertain system dynamics, and then another NN structure solves the HJB equation. In the algebraic part, the optimal control input that does not exceed the saturation bounds is generated. The weights of two NNs associated with observer and controller are simultaneously updated in an online manner. The ultimately uniformly boundedness (UUB) of all signals of the whole closed-loop system is ensured through Lyapunov’s direct method. Finally, two numerical examples are provided to confirm the effectiveness of the proposed control strategy.     

New robust exponential stability analysis for uncertain neural networks with time-varying delay

In this paper, the global robust exponential stability is considered for a class of neural networks with parametric uncer-tainties and time-varying delay. By using Lyapunov functional method, and by resorting to the new technique for estimating the upper bound of the derivative of the Lyapunov functional, some less conservative exponential stability criteria are derived in terms of linear matrix inequalities (LMIs). Numerical examples are presented to show the effectiveness of the proposed method.