In this paper, first, we consider closed convex and bounded subsets of infinite-dimensional unital Banach algebras and show with regard to the general conditions that these sets are not quasi-Chebyshev and pseudo-Cheb...In this paper, first, we consider closed convex and bounded subsets of infinite-dimensional unital Banach algebras and show with regard to the general conditions that these sets are not quasi-Chebyshev and pseudo-Chebyshev. Examples of those algebras are given including the algebras of continuous functions on compact sets. We also see some results in C＊-algebras and Hilbert C＊-modules. Next, by considering some conditions, we study Chebyshev of subalgebras in C＊-algebras.展开更多
There are many important concepts in linear algebra, such as linear correlation and linear independence, eigenvalues and eigenvectors, and so on. The article provides a graphical explanation of how to distinguish betw...There are many important concepts in linear algebra, such as linear correlation and linear independence, eigenvalues and eigenvectors, and so on. The article provides a graphical explanation of how to distinguish between the concepts of linear correlation and linear independence. The conclusion points out that linear independence means that there are no two (base) vectors with the same direction in a vector graph;otherwise, it is a linear correlation.展开更多
Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make ...Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make the network structurally controllable. Different from the works in complex network field where structural controllability is often used to explore the emergence properties of complex networks at a macro level,in this paper, we investigate it for control design purpose at the application level and focus on describing and obtaining the solution space for all selections of driver nodes to guarantee structural controllability. In accord with practical applications,we define the complete selection rule set as the solution space which is composed of a series of selection rules expressed by intuitive algebraic forms. It explicitly indicates which nodes must be controlled and how many nodes need to be controlled in a node set and thus is particularly helpful for freely selecting driver nodes. Based on two algebraic criteria of structural controllability, we separately develop an input-connectivity algorithm and a relevancy algorithm to deduce selection rules for driver nodes. In order to reduce the computational complexity,we propose a pretreatment algorithm to reduce the scale of network's structural matrix efficiently, and a rearrangement algorithm to partition the matrix into several smaller ones. A general procedure is proposed to get the complete selection rule set for driver nodes which guarantee network's structural controllability. Simulation tests with efficiency analysis of the proposed algorithms are given and the result of applying the proposed procedure to some real networks is also shown, and these all indicate the validity of the proposed procedure.展开更多
Some new properties of lattice filters are presented based on the order-preserving mapping and lattice homomorphism, and two necessary and sufficient conditions for lattice filters under the chain type are given. Then...Some new properties of lattice filters are presented based on the order-preserving mapping and lattice homomorphism, and two necessary and sufficient conditions for lattice filters under the chain type are given. Then, the relations between lattice filter and lattice implication algebras （LIAs）, i. e., the relations between lattice filter and LIA-filters, and the related properties are investigated. In addition, three necessary and sufficient conditions for LIA-filters are discussed. The obtained results may serve as some theoretical supports to lattice-valued logical system.展开更多
Computer administering of a psychological investigation is the computer representation of the entire procedure of psychological assessments—test construction, test implementation, results evaluation, storage and main...Computer administering of a psychological investigation is the computer representation of the entire procedure of psychological assessments—test construction, test implementation, results evaluation, storage and maintenance of the developed database, its statistical processing, analysis and interpretation. A mathematical description of psychological assessment with the aid of personality tests is discussed in this article. The set theory and the relational algebra are used in this description. A relational model of data, needed to design a computer system for automation of certain psychological assessments is given. Some finite sets and relation on them, which are necessary for creating a personality psychological test, are described. The described model could be used to develop real software for computer administering of any psychological test and there is full automation of the whole process: test construction, test implementation, result evaluation, storage of the developed database, statistical implementation, analysis and interpretation. A software project for computer administering personality psychological tests is suggested.展开更多
In handing information regarding various aspects of uncertainty, non-classical-mathematics (fuzzy mathematics or great extension and development of classical mathematics) is considered to be a more powerful technique ...In handing information regarding various aspects of uncertainty, non-classical-mathematics (fuzzy mathematics or great extension and development of classical mathematics) is considered to be a more powerful technique than classical mathematics. The non-classical mathematics, therefore, has now days become a useful tool in applications mathematics and computer science. The purpose of this paper is to apply the concept of the fuzzy sets to some algebraic structures such as an ideal, upper semilattice, lower semilattice, lattice and sub-algebra and gives some properties of these algebraic structures by using the concept of fuzzy sets. Finally, related properties are investigated in fuzzy BCK-algebras.展开更多
The collection of all the rough sets of an approximation space has been given several algebraic interpretations, including Stone algebras, regular double Stone algebras, semi-simple Nelson algebras, pre-rough algebras...The collection of all the rough sets of an approximation space has been given several algebraic interpretations, including Stone algebras, regular double Stone algebras, semi-simple Nelson algebras, pre-rough algebras and 3-valued Lukasiewicz algebras. A 3-valued Lukasiewicz algebra is a Stone algebra, a regular double Stone algebra, a semi-simple Nelson algebra, a pre-rough algebra. Thus, we call the algebra constructed by the collection of rough sets of an approximation space a rough 3-valued Lukasiewicz algebra.In this paper,the rough 3-valued Lukasiewicz algebras, which are a special kind of 3-valued Lukasiewicz algebras, are studied. Whether the rough 3-valued Lukasiewicz algebra is a axled 3-valued Lukasiewicz algebra is examined.展开更多
In 2012, the author submitted an article to the Prespacetime Journal based upon the premise of inquiry as to the alleged vanishing of disjoint open sets contributing to quantum vector measures no longer working, i.e. ...In 2012, the author submitted an article to the Prespacetime Journal based upon the premise of inquiry as to the alleged vanishing of disjoint open sets contributing to quantum vector measures no longer working, i.e. the solution in 2012 was that the author stated that quantum measures in 4 dimensions would not work, mandating, if measure theory were used, imbedding in higher dimensions was necessary for a singularity. The idea was to use the methodology of String Theory as to come up with a way out of the impasse if higher dimensions do not exist. We revisit this question, taking into account a derived HUP, for metric tensors if we look at Pre-Planckian space-time introducing a pre-quantum mechanical HUP which may be a way to ascertain a solution not mandating higher dimensions, as well as introducing cautions as to what will disrupt the offered solution. Note that first, measurable spaces allow disjoint sets. Also, that smooth relations alone do not define separability or admit sets Planck’s length, if it exists, is a natural way to get about the “bad effects” of a cosmic singularity at the beginning of space-time evolution, but if a development is to be believed, namely by Stoica in the article, about removing the cosmic singularity as a breakdown point in relativity, there is nothing which forbids space-time from collapsing to a point. Without the use of a Pre Planckian HUP, for metric tensors, the quantum measures in four dimensions break down. We try to ascertain if a Pre Planckian HUP is sufficient to avoid this pathology and also look at if division algebras which can link Octonionic geometry and E8, to Quark spinors, in the standard model and add sufficient definition to the standard model are necessary and sufficient conditions for a metric tensor HUP which may remove this breakdown of the sum rule in the onset of the “Big Bang”.展开更多
文摘In this paper, first, we consider closed convex and bounded subsets of infinite-dimensional unital Banach algebras and show with regard to the general conditions that these sets are not quasi-Chebyshev and pseudo-Chebyshev. Examples of those algebras are given including the algebras of continuous functions on compact sets. We also see some results in C＊-algebras and Hilbert C＊-modules. Next, by considering some conditions, we study Chebyshev of subalgebras in C＊-algebras.
文摘There are many important concepts in linear algebra, such as linear correlation and linear independence, eigenvalues and eigenvectors, and so on. The article provides a graphical explanation of how to distinguish between the concepts of linear correlation and linear independence. The conclusion points out that linear independence means that there are no two (base) vectors with the same direction in a vector graph;otherwise, it is a linear correlation.
基金supported by the National Science Foundation of China(61333009,61473317,61433002,61521063,61590924,61673366)the National High Technology Research and Development Program of China(2015AA043102)
文摘Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make the network structurally controllable. Different from the works in complex network field where structural controllability is often used to explore the emergence properties of complex networks at a macro level,in this paper, we investigate it for control design purpose at the application level and focus on describing and obtaining the solution space for all selections of driver nodes to guarantee structural controllability. In accord with practical applications,we define the complete selection rule set as the solution space which is composed of a series of selection rules expressed by intuitive algebraic forms. It explicitly indicates which nodes must be controlled and how many nodes need to be controlled in a node set and thus is particularly helpful for freely selecting driver nodes. Based on two algebraic criteria of structural controllability, we separately develop an input-connectivity algorithm and a relevancy algorithm to deduce selection rules for driver nodes. In order to reduce the computational complexity,we propose a pretreatment algorithm to reduce the scale of network's structural matrix efficiently, and a rearrangement algorithm to partition the matrix into several smaller ones. A general procedure is proposed to get the complete selection rule set for driver nodes which guarantee network's structural controllability. Simulation tests with efficiency analysis of the proposed algorithms are given and the result of applying the proposed procedure to some real networks is also shown, and these all indicate the validity of the proposed procedure.
基金The National Natural Science Founda-tion of China (No.60474022)the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20060613007)
文摘Some new properties of lattice filters are presented based on the order-preserving mapping and lattice homomorphism, and two necessary and sufficient conditions for lattice filters under the chain type are given. Then, the relations between lattice filter and lattice implication algebras （LIAs）, i. e., the relations between lattice filter and LIA-filters, and the related properties are investigated. In addition, three necessary and sufficient conditions for LIA-filters are discussed. The obtained results may serve as some theoretical supports to lattice-valued logical system.
文摘Computer administering of a psychological investigation is the computer representation of the entire procedure of psychological assessments—test construction, test implementation, results evaluation, storage and maintenance of the developed database, its statistical processing, analysis and interpretation. A mathematical description of psychological assessment with the aid of personality tests is discussed in this article. The set theory and the relational algebra are used in this description. A relational model of data, needed to design a computer system for automation of certain psychological assessments is given. Some finite sets and relation on them, which are necessary for creating a personality psychological test, are described. The described model could be used to develop real software for computer administering of any psychological test and there is full automation of the whole process: test construction, test implementation, result evaluation, storage of the developed database, statistical implementation, analysis and interpretation. A software project for computer administering personality psychological tests is suggested.
文摘In handing information regarding various aspects of uncertainty, non-classical-mathematics (fuzzy mathematics or great extension and development of classical mathematics) is considered to be a more powerful technique than classical mathematics. The non-classical mathematics, therefore, has now days become a useful tool in applications mathematics and computer science. The purpose of this paper is to apply the concept of the fuzzy sets to some algebraic structures such as an ideal, upper semilattice, lower semilattice, lattice and sub-algebra and gives some properties of these algebraic structures by using the concept of fuzzy sets. Finally, related properties are investigated in fuzzy BCK-algebras.
基金The 973 NationalKey BasicResearchand Development Program of China (No .2002CB312106 ) theChinaPostdoctoralScience Foundation (N o.2004035715)+1 种基金 the Science & Technology Program of Zhejiang Province in C hina(N o.2004C31098 )thePostdoctoraSlcienceFoundationofZhejiangProvinceinChina (No .2004-bsh-023).
文摘The collection of all the rough sets of an approximation space has been given several algebraic interpretations, including Stone algebras, regular double Stone algebras, semi-simple Nelson algebras, pre-rough algebras and 3-valued Lukasiewicz algebras. A 3-valued Lukasiewicz algebra is a Stone algebra, a regular double Stone algebra, a semi-simple Nelson algebra, a pre-rough algebra. Thus, we call the algebra constructed by the collection of rough sets of an approximation space a rough 3-valued Lukasiewicz algebra.In this paper,the rough 3-valued Lukasiewicz algebras, which are a special kind of 3-valued Lukasiewicz algebras, are studied. Whether the rough 3-valued Lukasiewicz algebra is a axled 3-valued Lukasiewicz algebra is examined.
文摘In 2012, the author submitted an article to the Prespacetime Journal based upon the premise of inquiry as to the alleged vanishing of disjoint open sets contributing to quantum vector measures no longer working, i.e. the solution in 2012 was that the author stated that quantum measures in 4 dimensions would not work, mandating, if measure theory were used, imbedding in higher dimensions was necessary for a singularity. The idea was to use the methodology of String Theory as to come up with a way out of the impasse if higher dimensions do not exist. We revisit this question, taking into account a derived HUP, for metric tensors if we look at Pre-Planckian space-time introducing a pre-quantum mechanical HUP which may be a way to ascertain a solution not mandating higher dimensions, as well as introducing cautions as to what will disrupt the offered solution. Note that first, measurable spaces allow disjoint sets. Also, that smooth relations alone do not define separability or admit sets Planck’s length, if it exists, is a natural way to get about the “bad effects” of a cosmic singularity at the beginning of space-time evolution, but if a development is to be believed, namely by Stoica in the article, about removing the cosmic singularity as a breakdown point in relativity, there is nothing which forbids space-time from collapsing to a point. Without the use of a Pre Planckian HUP, for metric tensors, the quantum measures in four dimensions break down. We try to ascertain if a Pre Planckian HUP is sufficient to avoid this pathology and also look at if division algebras which can link Octonionic geometry and E8, to Quark spinors, in the standard model and add sufficient definition to the standard model are necessary and sufficient conditions for a metric tensor HUP which may remove this breakdown of the sum rule in the onset of the “Big Bang”.
