Construction of Non-Symmetric Balanced Incomplete Block Design through Combination of Symmetric Disjoint Balanced Incomplete Block Designs

The existence of several non-symmetric balanced incomplete block designs (BIBDs) is still unknown. This is because the non-existence property for non-symmetric BIBDs is still not known and also the existing construction methods have not been able to construct these designs despite their design parameters satisfying the necessary conditions for the existence of BIBD. The study aimed to bridge this gap by introducing a new class of non-symmetric BIBDs. The proposed class of BIBDs is constructed through the combination of disjoint symmetric BIBDs. The study was able to determine that the total number of disjoint symmetric BIBDs (n) with parameters (v = b, r = k, λ) that can be obtained from an un-reduced BIBD with parameters (v, k) is given by n = r - λ. When the n symmetric disjoint BIBDs are combined, then a new class of symmetric BIBDs is formed with parameters v* = v, b* = nb, r* = nr, k* = k, λ* = λ, where 2≤ n ≤ r - λ. The study established that the non-existence property of this class of BIBD was that when is not a perfect square then v should be even and when v* is odd then the equation should not have a solution in integers x, y, z which are not all simultaneously zero. In conclusion, the study showed that this construction technique can be used to construct some non-symmetric BIBDs. However, one must first construct the disjoint symmetric BIBDs before one can construct the non-symmetric BIBD. Thus, the disjoint symmetric BIBDs must exist first before the non-symmetric BIBDs exist.

一种关于数据流区间Disjoint查询的快速处理算法

在关于数据流子序列相似性匹配的研究中,Disjoint查询是很重要的一类,在传感网络和数据挖掘等方面都发挥着非常重要的作用.但现有的研究并没有关注到定长区间上的Disjoint查询问题.直接对每个区间内成员使用Spring算法是解决该问题的NAIVE算法,但是因为NAIVE算法不具有增量计算的特点,所以存在冗余运算.针对NAIVE算法冗余运算的处理问题,提出了边界路径技术.边界路径技术很好地使用了Spring算法在相邻前一区间上的执行结果,使得Spring算法无需对当前区间上每个成员执行,就可以得到Disjoint查询在该区间的查询结果.使用该技术对NAIVE算法进行改造,设计并实现了快速区间Disjoint查询处理算法(fast section Disjoint query processing algorithm,FSDQ),该算法具有增量计算的特点.实验证明FSDQ算法可以有效减少NAIVE算法所具有的冗余运算,是处理数据流上区间Disjoint查询的有效方法.

Reinforcing a Matroid to Have k Disjoint Bases

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查询的增量处理算法

对于滑动窗口下不具有全局约束机制的数据流Disjoint查询精确处理问题进行了研究,在现有FSM算法基础上提出了一种具有增量计算特征的查询处理算法DQPIC.该算法使用FSM算法处理第一个窗口中的数据流成员,同时保留了该窗口上的查询结果和窗口所对应STWM的最后一个列向量,除此之外还需要保留窗口STWM中所有列向量第curbound.highest个成员DTW路径的起始位置、距离值以及该成员在STWM中对应列向量的dmin值和候选查询结果这些信息.从第二个窗口开始,继续使用FSM算法处理窗口成员,同时也保留和第一个窗口一样的信息.在这个过程中,当处理相邻窗口中相同数据流成员时,通过比较该成员在前后两个窗口中分别对应的保留信息是否相同,可以确定算法有无继续处理剩余相同数据流成员的必要,能够在前一个窗口查询结果基础上增量地获得当前窗口查询结果.基于公用数据样本SST与Maskedchirp的仿真实验验证了该算法的有效性.提出的算法与现有其他算法执行结果相同,在空间开销增加1.12~3.27倍情况下,可以实现时间效率2.5~25倍的提高,对于与大窗口下的Disjoint查询相关应用场景,具有更好的时间效果.

A disjoint algorithm for seismic reliability analysis of lifeline networks

The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.

Disjoint双线性规划的一个混合整数线性规划变换及其应用

针对disjoint双线性规划问题,给出了一个混合整数线性规划变换方法,以求得其全局最优解。该方法将disjoint双线性规划变换为一个带有互补约束的线性规划,并利用0-1变量和大M法线性化互补约束。同时,将该方法应用于金融系统中的不确定性系统性风险估计问题,证明了该问题可变换为一个disjoint双线性规划问题,进而利用所提出的方法求解。数值结果表明:提出的方法能有效找到中大规模最坏情形系统性风险估计问题的全局最优解,并优于已有的全局解方法。

DISJOINT SUPERCYCLIC WEIGHTED PSEUDO-SHIFTS ON BANACH SEQUENCE SPACES

In this article, we present several equivalent conditions ensuring the disjoint supercyclicity of finite weighted pseudo-shifts acting on an arbitrary Banach sequence space. The disjoint supercyclic properties of weighted translations on locally compact discrete groups, the di rec t sums of finite classical weighted backward shifts, and the bilateral backward opera tor weighted shifts can be viewed as special cases of our main results. Furthermore, we exhibit an interesting fact that any finite bilateral weighted backward shifts on the space l^2 (Z) never satisfy the d-Supercyclicity Criterion by a simple proof.

FINITENESS OF HIGHER CODIMENSIONAL DISJOINT MINIMAL GRAPHS

We estimate the number of disjoint open subsets in Rn, which can support area-decreasing minimal graphs. This result generalizes the related results of Li-Wang and Tkachev for minimal hypersurfaces to higher codimensional case.

MSDM: Maximally Spatial Disjoint Multipath Routing Protocol for MANET

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.

EXTREME POINTS IN DIAGONAL-DISJOINT IDEALS OF NEST ALGEBRAS

In this paper, the extreme points of the unit ball of diagonal-disjoint ideals L in nest algebras are characterized completely; Furthermore, it is shown that every extreme point of the unit ball of L has essential-norm one.

Finding Multiple Length-Bounded Disjoint Paths in Wireless Sensor Networks

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.

QoS in Node-Disjoint Routing for Ad Hoc Networks

Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications such as video and voice MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. QoS support in MANETs is an important issue as best-effort routing is not efficient for supporting multimedia applications. This paper presents a novel adaptation of NDMR, QoS enabled NDMR, which introduces agent-based SLA management. This enhancement allows for the intelligent selection of node-disjoint routes based on network conditions, thus fulfilling the QoS requirements of Service Level Agreements (SLAs).

Optimization of Disjoints Using WDM-PON in an Optical Network

An optical network is a type of data communication network built with optical fibre technology. It utilizes optical fibre cables as the primary communication medium for converting data and passing data as light pulses between sender and receiver nodes. The major issue in optical networking is disjoints that occur in the network. A polynomial time algorithm Wavelength Division Multiplexing-Passive Optical Networking (WDM-PON) computes disjoints of an optical network and reduces the count of disjoints that occur in the network by separating Optical Network Units (ONU) into several virtual point-to-point connections. The Arrayed Waveguide Grating (AWG) filter is included in WDM-PON to avoid the traffic in the network thereby increasing the bandwidth capacity. In case of a failure or disjoint Ant Colony Optimization (ACO) algorithm is used to find the optimized shortest path for re-routing. For enhanced security, modified Rivert Shamir Adleman (RSA) algorithm encrypts the message during communication between the nodes. The efficiency is found to be improved in terms of delay in packet delivery, longer optical reach, optimized shortest path, packet error rate.

On the Maximal Disjoint Division in Riesz Spaces

The authors p oint out a problem in the article of Ref.(Xiong Hongyun,Rong Ximin.Maximal disjoint systems in Riesz space and representation.Acta Math Sinica ,1998,41(4):763-766.)and revise it.Let E be an Archimed ean Riesz space possessing a weak unit e and a maximal disjoint division{e i:i∈I} in which each e i is a proj ection element. Concerning the following statements:(1) There exists a completel y regular Hausdorff space X such that E is Riesz isomorphic to C(X);(2) For every i∈I there exi sts a completely regular Hausdorff space X i such that the band generated by e i is Riesz isomorphic to C(X i).It is shown that (1) implies (2),and find some conditions for the inverse bein g true are found.Furthermore,if each X i in (2) is a compact Ha usdorff space, a necessary and sufficient condition is established under which E can be represented as a C(X) for some compact Hausdorff space X.As corollaries, corresponding results for late rally complete Riesz spaces are obtained.

Novel disjoint path selection scheme based on link availability in ASON

Risk-disjoint routing is an efficient way to improve network survivability. In this article, a partial risk-disjoint routing algorithm based on link availability （PRDRA-LA） is proposed based on the complete risk-disjoint routing algorithm （CRDRA）. While calculating the protection path with PRDRA-LA, the links that share risks with the links in the working path are filtered by link availability. In addition, the risk disjoint degree between the protection path and the working path can be adjusted freely. Simulation results showed that when compared with CRDRA, routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.

法学教育理论与实践脱节论的三重逻辑反思

应新时代全面依法治国的实践要求,新一轮法学教育改革正在紧张酝酿中,改什么与怎么改成为关键问题。目前法学界在改革的主要问题上形成了理论与实践脱节的观点。本文再度深入反思上述观点,追问其逻辑证立问题。通过三重逻辑反思,认为法学教育中的理论性并未被充分挖掘和讲授,理论与实践的脱节是正常现象,理论与实践是一种“貌离神合”的关系;法学教育中理论联系实践与理论联系实际是不同的,理论联系实际的难度要远小于理论联系实践,应鼓励教师理论联系实际。通过对脱节论的三重逻辑反思,可以发现理论与实践在法学教育中既不能偏废,也不能过度强调,只有真正将“理论与实践有效结合”才是未来法学教育综合改革的可靠出发点与方向。

ON LARGE SETS OF PAIRWISE DISJOINT TRANSITIVE TRIPLE SYSTEMS

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).

Vertex-disjoint K_1+(K_1 ∪ K_2) in K_(1,4)-free Graphs with Minimum Degree at Least Four

A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4. Let κ be an integer with κ ≥ 2. We prove that if G is a K1,4-free graph of order at least llκ- 10 with minimum degree at least four, then G contains k vertex-disjoint copies of K1 ＋ （K1 ∪ KK2）.

Disjoint K-4 in claw-free graphs with minimum degree at least five

A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K1,3. Let K4 be the graph obtained by removing exactly one edge from K4 and let k be an integer with k ≥ 2. We prove that if G is a claw-free graph of order at least 13k - 12 and with minimum degree at least five, then G contains k vertex-disjoint copies of K4. The requirement of number five is necessary.

电场方向对一维断裂纳米通道连接处水桥结构的影响

电场影响纳米通道内的水分子的电偶极矩取向,进而影响纳米通道内的水分子的传输.为了有效发掘水分子在纳米通道内的传输特点,必须研究更复杂的纳米通道结构.最新一种构造复杂纳米通道的方式是构造断裂纳米通道.在研究断裂纳米通道内的水分子的动力学特点时,通常是在零电场或单一电场方向下进行的,电场方向对断裂纳米通道内的水分子的影响机理尚不明确,这制约了部分场控分子器件的设计.为了探究该问题,本文采用分子动力学模拟方法,系统研究了电场方向从0°变化到180°的过程中,电场方向对完整纳米通道以及断裂长度分别为0.2和0.4 nm的断裂纳米通道内的水分子的占据数、传输、水桥、电偶极矩偏向等性质的影响.结果表明,在1 V/nm的电场强度作用下,这三种纳米通道内的水分子的占据数、传输等差别主要集中在电场方向与管轴夹角为90°时,此时完整纳米通道内能形成稳定的水链,断裂长度为0.2 nm的纳米通道的连接处能形成不稳定的水桥,而断裂长度为0.4 nm的纳米通道的连接处不能形成水桥.此外,模拟发现当电场极化方向与管轴夹角为90°时,增大电场的强度,断裂纳米通道连接处的水桥更容易断裂.