共查询到20条相似文献,搜索用时 31 毫秒
1.
Xifu Liu 《国际计算机数学杂志》2018,95(8):1666-1671
In this paper, we establish some conditions for the existence and the representations for the Hermitian reflexive and Hermitian anti-reflexive, and non-negative definite reflexive solutions to the matrix equation AX=B with respect to a generalized reflection matrix P by using the Moore–Penrose inverse. Moreover, in corresponding solution sets of the equation, the explicit expressions of the nearest matrix to a given matrix in the Frobenius norm have been provided. 相似文献
2.
SHU GUANGFU 《国际通用系统杂志》2013,42(4-5):367-382
This paper first introduces the basic notions of overall systems with logical relations, their subsystems, structure representation graphs, sets of H-structures and G-structures with logical relations S H L and S G L, immediate refinement and aggregate with logical relations, structure-graph mappings rV L, rG L, etc., and the notions of inclusiveness with logical relations, upper bounding and lower bounding with logical relations. Then it proves the sufficient conditions under which representation graphs R L form a lattice. By defining the least upper bound and largest lower bound of (RL, ) and recommending a lemma on distributivity, this paper proves the sufficient conditions under which G-structures with logical relations form Boolean lattices. Finally after defining the M-structures and C-structures with logical relations, i.e. M-structures and C-structures, this paper proposes the sufficient conditions for the uniqueness of C-structures in G-structure equivalence classes, and proves that the C L-structure is the least refined GL-structure in equivalence class S G L/r G L. 相似文献
3.
Summary In this paper we initiate the study of rational bijections, that is of rational transductions which are bijections of a rational (=regular) set R onto a rational set S. We present a complete and easily decidable characterization of the existence of a rational bijection between two given rational sets.This author acknowledges with pleasure the financial support of the Austrian Federal Ministry of Science and Research which allowed him to spend one week in Graz where this paper was initiated 相似文献
4.
The problem of finding global state space transformations and global feedback of the form u(t)= α(x) + ν(t) to transform a given nonlinear system
to a controllable linear system on Rn or on an open subset of Rn, is considered here. We give a complete set of differential geometric conditions which are equivalent to the existence of a solution to the above problem. 相似文献
5.
Hongxia Han Qingguo Li Lankun Guo 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2016,20(5):1853-1861
The rough approximations on a complete completely distributive lattice L based on binary relation were introduced by Zhou and Hu (Inf Sci 269:378–387, 2014), where the binary relation was defined on the set of non-zero join-irreducible elements. This paper extends Zhou and Hu’s rough set model by defining new approximation operators via ideal. When I is the least ideal of L and R is a reflexive binary relation, these two approximations coincide. We present the essential properties of new approximations and also discuss how the new one relates to the old one. Finally, the topological and lattice structures of the approximations are given. 相似文献
6.
We show that several discrepancy-like problems can be solved in NC nearly achieving the discrepancies guaranteed by a probabilistic analysis and achievable sequentially. For example, we describe an NC algorithm that given
a set system (X, S) , where X is a ground set and S⊆2
X
, computes a set R⊆X so that for each S∈
S the discrepancy ||R
S|-|R-∩S|| is
. Whereas previous NC algorithms could only achieve discrepancies
with ɛ>0 , ours matches the probabilistic bound within a multiplicative factor 1+o(1) . Other problems whose NC solution we improve are lattice approximation, ɛ -approximations of range spaces with constant VC-exponent, sampling in geometric configuration spaces, approximation of integer
linear programs, and edge coloring of graphs.
Received June 26, 1998; revised February 18, 1999. 相似文献
7.
We solve the following over-determined boundary value problem (the “extension problem”): Let R(∂) be a matrix whose entries are linear partial differential operators, with constant coefficients. Let Ω be a non-empty, open, bounded, convex set. We consider the homogeneous system R(∂)f=0 in a neighborhood of
, subject to the boundary condition f=g in a neighborhood of ∂Ω. For a given g, we give a criterion for the (unique) existence of a smooth solution f to this problem. There are two obvious necessary conditions: g is smooth and R(∂)g=0 in a neighborhood of ∂Ω. We characterize the class of differential operators R(∂) for which the problem is solvable for any g satisfying the necessary conditions. Finally, in the case where the solution is non-unique, we consider the possibility of obtaining uniqueness by fixing several components of the desired solution. 相似文献
8.
首先指出文献《基于Lukasiewicz三角模及其剩余蕴涵的模糊粗糙集》中定理7的结论不成立,并给出了反例。其次,从两个方面对上述文献进行了修正:(1)当R是自反模糊关系时,T′={A∈F(U)|R(A)=A}是一模糊拓扑;(2)当R是自反、传递的模糊关系时,上述文献中的结论成立。最后,给出了模糊集A为模糊拓扑T的开集的充分必要条件,从而得到了模糊拓扑T的另外几个性质。 相似文献
9.
Nadia Creignou Phokion Kolaitis Bruno Zanuttini 《Journal of Computer and System Sciences》2008,74(7):1103-1115
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be expressed as a conjunctive query over the relations in the set S? Our algorithm is derived by first introducing the concept of a plain basis for a co-clone and then identifying natural plain bases for every co-clone in Post's lattice. In the process, we also give a quadratic algorithm for the problem of finding the smallest co-clone containing a Boolean relation. 相似文献
10.
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (xTS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates. 相似文献
11.
Daniele Micciancio 《Computational Complexity》2007,16(4):365-411
12.
Jan Paseka Zdenka Rie?anov�� 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(3):543-555
We study remarkable sub-lattice effect algebras of Archimedean atomic lattice effect algebras E, namely their blocks M, centers C(E), compatibility centers B(E) and sets of all sharp elements S(E) of E. We show that in every such effect algebra E, every atomic block M and the set S(E) are bifull sub-lattice effect algebras of E. Consequently, if E is moreover sharply dominating then every atomic block M is again sharply dominating and the basic decompositions of elements (BDE of x) in E and in M coincide. Thus in the compatibility center B(E) of E, nonzero elements are dominated by central elements and their basic decompositions coincide with those in all atomic blocks
and in E. Some further details which may be helpful under answers about the existence and properties of states are shown. Namely,
we prove the existence of an (o)-continuous state on every sharply dominating Archimedean atomic lattice effect algebra E with
B(E)\not = C(E).B(E)\not =C(E). Moreover, for compactly generated Archimedean lattice effect algebras the equivalence of (o)-continuity of states with their complete additivity is proved. Further, we prove “State smearing theorem” for these lattice
effect algebras. 相似文献
13.
Son Pham 《The Visual computer》1992,9(1):1-24
Digitization of a real circle is defined as the set of closest pixels (integer lattice points) to the circle. These pixels form a digital circle. First, this paper defines the term closest pixels and provides an algorithm to digitize an arbitrary circle, i.e., one whose radius is not necessarily an integer, and whose center is not necessarily a lattice point. This digitizing algorithm is simplified to the case of integer radius and integer-coordinate center so that it can be compared to two well-known algorithms: the Bresenham algorithm and an algorithm using the Digital Differential Analyzer (DDA) technique. As a result, the new algorithm consumes only 77% and 40% of the time required for Bresenham and DDA algorithms, respectively. Second, we investigate the problem of finding, for a given digital circle and center, the set of possible real radii that generate that digital circle. For some integerr, we look at all digital circles centered at the origin with real radius in the interval [r–0.5,r+0.5) and determine the paritions of this interval into sub-intervals of real radii generating the same digital circles. Third, we study fixing the digital circle and radius, and finding the set of possible centers. For some pixel (x
c,y
c), we find the partitions of the unit square [x
c
–0.5,x
c
+0.5)×[y
c
–0.5,y
c
+0.5) such that for each partition each center in that partition generates the same digital circle. The partition boundaries can be constructed by compass and ruler. Finally, the paper uses these results to determine whether or not a given finite set of pixels is a digital circle segment and if so, shows how to construct its region of possible centers by ruler and compass. We also present an algorithm to detect whether a closed digital are is a digital circle. 相似文献
14.
A standard control system is considered, in conjunction with a state constraint S and a target set Σ. The properties of open loop S-constrained control to Σ and practical closed loop S-constrained control to Σ are shown to be equivalent, and to be characterizable in terms of the existence of certain types of control Lyapunov functions. Feedback S-constrained stabilizability to Σ can be added to the list of equivalences, when a small time controllability property is posited. 相似文献
15.
16.
Among the huge diversity of ideas that show up while studying graph theory, one that has obtained a lot of popularity is the concept of labelings of graphs. Graph labelings give valuable mathematical models for a wide scope of applications in high technologies (cryptography, astronomy, data security, various coding theory problems, communication networks, etc.). A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions. Graph labeling is a mapping of elements of the graph, i.e., vertex and/or edges to a set of numbers (usually positive integers), called labels. If the domain is the vertex-set or the edge-set, the labelings are called vertex labelings or edge labelings respectively. Similarly, if the domain is V (G)[E(G), then the labeling is called total labeling. A reflexive edge irregular k-labeling of graph introduced by Tanna et al.: A total labeling of graph such that for any two different edges ab and a'b' of the graph their weights has ωtχ(ab) = χ(a) + χ(ab) + χ(b) and ωtχ(a'b') = χ(a') + χ(a'b') + χ(b') are distinct. The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G). In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical
product of two paths Pa × Pb for any choice of a ≥ 3 and b ≥ 3. 相似文献
17.
In the paper, we propose a model that tracks the dynamics of many diseases spread by vectors, such as malaria, dengue, or West Nile virus (all spread by mosquitoes). Our model incorporates demographic structure with variable population size which is described by nonlinear birth rate and linear death rate. The stability of the system is analyzed for the existence of the disease-free and endemic equilibria points. We find the basic reproduction number R0 in terms of measurable epidemiological and demographic parameters is the threshold condition that determines the dynamics of disease infection: if R0<1 the disease fades out, and for R0>1 the disease remains endemic. The threshold condition provides important guidelines for accessing control of the vector diseases, and implies that it is an efficient way to halt the spread of vector epidemic by reducing the carrying capacity of the environment for the vector and the host. Moreover, sufficient conditions are also obtained for the global stability of the unique endemic equilibrium E*. 相似文献
18.
We consider the following scenario: There are two individuals, say Q (Questioner) and R (Responder), involved in a search game. Player R chooses a number, say x, from the set S={1,…,M}. Player Q has to find out x by asking questions of type: “which one of the sets A1,A2,…,Aq, does x belong to?”, where the sets A1,…,Aq constitute a partition of S. Player R answers “i” to indicate that the number x belongs to Ai. We are interested in the least number of questions player Q has to ask in order to be always able to correctly guess the number x, provided that R can lie at most e times. The case e=0 obviously reduces to the classical q-ary search, and the necessary number of questions is [logqM]. The case q=2 and e1 has been widely studied, and it is generally referred to as Ulam's game. In this paper we consider the general case of arbitrary q2. Under the assumption that player R is allowed to lie at most twice throughout the game, we determine the minimum number of questions Q needs to ask in order to successfully search for x in a set of cardinality M=qi, for any i1. As a corollary, we obtain a counterexample to a recently proposed conjecture of Aigner, for the case of an arbitrary number of lies. We also exactly solve the problem when player R is allowed to lie a fixed but otherwise arbitrary number of times e, and M=qi, with i not too large with respect to q. For the general case of arbitrary M, we give fairly tight upper and lower bounds on the number of the necessary questions. 相似文献
19.
This paper addresses the reduced-order H∞ filtering problem for continuous-time Makovian jump linear systems, where the jump parameters are modelled by a discrete-time Markov process. Sufficient conditions for the existence of the reduced-order H∞ filter are proposed in terms of linear matrix inequalities (LMIs) and a coupling non-convex matrix rank constraint. In particular, the sufficient conditions for the existence of the zero-order H∞ filter can be expressed in terms of a set of strict LMIs. The explicit parameterization of the desired filter is also given. Finally, a numerical example is given to illustrate the proposed approach. 相似文献
20.
经典粗糙集是在等价关系基础上建立的一类不确定性理论方法。研究一般二元关系下的广义粗糙集,不仅可以拓宽粗糙集理论的应用范围,而且也能从一定的角度进一步阐释经典粗糙集的基本性质。在考虑自反粗糙近似算子的基础上,提出了严格局部自反关系的定义,讨论了严格局部自反关系下广义粗糙集的性质,给出了其公理化特征。结合自反粗糙近似算子,研究了一般二元关系下广义粗糙集中的精确集,得出了一些重要的结论。 相似文献