检索结果-南通市图书馆

SYMMETRIC MENDELSOHN TRIPLE SYSTEM AND LARGE SETS OF disjoint MENDELSOHN TRIPLE SYSTEMS

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1989年第14期34卷 1226-1228页

作者：康庆德常彦勋 Department of Mathematics Hebei Normal College Shijiazhuang

For an MTS(v)=(S,(?)), if there exists a,b∈S(a≠b) such that 〈a, b, x〉∈(?)〈b,a,x〉∈(?) and 〈a,x,y〉∈(?)〈b,y,x〉∈(?)(x,y∈S\{a,b}) then we call MTS(v) a symmetric Mendelsohn triple system of order v and denot... 详细信息

关键词： pairwise symmetric triple disjoint whenever suppose subset 二尹 briefly thank

disjoint BOOLEAN ALGEBRA AND ITS APPLICATION

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1984年第2期29卷 143-146页

作者：廖炯生 Beijing Institute of Control Engineering

For reliability analysis the Boolean variable, which is discrete, is used to represent the failure or success of a system or a component. And the calculation of occurrence probability of 0/1 event, which is continous real variable in [0, 1], is required. The system failure (success) probability may be derived from those of components. In

关键词： disjoint Booleanunion algebra Probability ordinary arbitrarily minimization viewpoint Bayesian

Finding Multiple Length-Bounded disjoint Paths in Wireless Sensor Networks

在线全文

学校读者我要写书评

暂无评论

Wireless Sensor Network 2011年第12期3卷 384-390页

作者： Kejia Zhang Hong Gao 不详

In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not consider length constraint of the paths. A too long path will be useless because of high latency and high packet loss rate. This paper deals with such a problem: given two nodes s and t in a sensor network, finding as many as possible disjoint paths connecting s and t whose lengths are no more than L, where L is the length bound set by the users. By now, we know that this problem is not only NP hard but also APX complete [1,2], which means that there is no PTAS for this problem. To the best of our knowledge, there is only one heuristic algorithm proposed for this problem [3], and it is not suitable for sensor network because it processes in a centralized way. This paper proposes an efficient distributed algorithm for this problem. By processing in a distributed way, the algorithm is very communication efficient. Simulation results show that our algorithm outperforms the existing algorithm in both aspects of found path number and communication efficiency.

关键词： disjoint Paths Sensor Networks Length-Bounded Paths

Reinforcing a Matroid to Have k disjoint Bases

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics 2010年第3期1卷 244-249页

作者： Hong-Jian Lai Ping Li Yanting Liang Jinquan Xu 不详

Let denote the maximum number of disjoint bases in a matroid . For a connected graph , let , where is the cycle matroid of . The well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs with . Edmonds generalizes this theorem to matroids. In [1] and [2], for a matroid with , elements with the property that have been characterized in terms of matroid invariants such as strength and -partitions. In this paper, we consider matroids with , and determine the minimum of , where is a matroid that contains as a restriction with both and . This minimum is expressed as a function of certain invariants of , as well as a min-max formula. These are applied to imply former results of Haas [3] and of Liu et al. [4].

关键词： disjoint Bases Edge-disjoint Spanning Trees Spanning Tree Packing Numbers Strength

MSDM: Maximally Spatial disjoint Multipath Routing Protocol for MANET

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications and Network 2013年第4期5卷 316-322页

作者： Wesam Almobaideen Roba Al-Soub Azzam Sleit Computer Science Department King Abdulla II School for Information Technology The University of Jordan Amman Jordan

Mobile Ad-hoc Network (MANET) consists of mobile nodes that are connected via very dynamic multi-hop channels. Routing in MANET is a challenging task that has received great attention from researchers. In this paper we present Maximally Spatial disjoint Multipath routing protocol (MSDM) which is a modification of AOMDV protocol. MSDM finds paths which are spatially separated and maximally disjointed. We think that sending various packets over spatially disjointed paths reduces the probability of collision occurrence and allows concurrent transmission over the set of different selected paths. Performance comparison of MSDM and AOMDV using GloMoSim simulator shows that MSDM is able to achieve a considerable improvement regarding some performance metrics such as delay, routing packets overhead, and network throughput.

关键词： MANET Routing Protocols Multipath Routing Spatial disjoint Paths

Further Results About Large Sets of disjoint Mendeisohn Triple Systems (Ⅰ, Ⅱ)

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1993年第5期38卷 436-437页

作者：康庆德常彦勋 Hebei Normal College Shijiazhuang 050091 PRC

A large set of disjoint Mendelsohn triple systems of order v on X={1, 2, …, v} and LMTS(v)={(X, B_i)}_i is called quasi-symmetric (QLMTS(v)), if there exist a, b∈X (a≠b) such that ∈B_i, if and only if ∈B_i for any i. A QLMTS(v) is called compatible (CLMTS(v)) if there exists a subset J_i of B_i such that (1)Each J_i is a partition of X\{a, b, i}; (2) all ordered pairs contained in all cyclic triples of ∪ J_i are different.

关键词： Triple partition symmetric compatible subset triple contained satis quasi disjoint

TWO EDGE-disjoint HAMILTONIAN CYCLES IN AN ORE-TYPE-(2), GRAPH

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1986年第19期31卷 1363-1364页

作者：吴正声 Department of Mathematics Nanjing Normal University

In this letter we consider only undirected simple graphs. Let G he a graph, we shall use V(G) and E(G) to denote the vertex set and the edge set of G respectively. And let u,v∈V(G), we denote the degree of v by d(u) ... 详细信息

关键词： undirected vertex letter disjoint integer GRAPH Hamiltonian joining conjecture answer

ON THE EDGE-disjoint 1-FACTORS IN THE POWER OF CONNECTED GRAPHS

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1990年第21期35卷 1841-1841页

作者：张建勋 Lanzhou Railway College Lanzhou 730070 PRC

Let G = ( V, E ) be a simple connected graph of order p, and n be a positive integer. The nth power G^n of G is defined as: V(G)= V(G^n), E(G^n)={uv: u, v ∈ V(G), d_G(u, v)≤n},where d_G,(u, v )is the distance betwee... 详细信息

关键词： integer connected disjoint

ON LARGE SETS OF PAIRWISE disjoint TRANSITIVE TRIPLE SYSTEMS

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1992年第2期37卷 171-171页

作者：常彦勋康庆德 Institute of Mathematics Hebei Normal College Shijiazhuang 050091 PRC

Let X be a set of v elements (v≥3). A transitive triple from X is a collection of three ordered pairs (x, y), (y, z)and (x, z), where x, y and z are distinct dements of X. It is denoted by (x, y, z). A transitive triple system on X is a pair (X, B), where B is a collection of transitive triples from X such that each ordered pair of distinct elements of X belongs to exactly one transitive triple of B. The system is denoted by TTS(v). It is well known that the spectrum for TTS(v)is the set of all v≡0, 1 (mod 3).

关键词： triple collection belongs exactly ordered disjoint struction stence letter