#### Filter Results:

#### Publication Year

2002

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 ,. .. , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in the design of wireless communication networks. We give a… (More)

In the original paper, Goldman et al. (2000) launched the study of the inverse problems in combinatorial chemistry, which is closely related to the design of combinatorial libraries for drug discovery. Following their ideas, we investigate four other topological indices, i.e., the sigma-index, the c-index, the Z-index, and the M(1)-index, with a special… (More)

Consider two sets of strings, B (bad genes) and G (good genes), as well as two integers d b and dg (d b ≤ dg). A frequently occurring problem in computational biology (and other fields) is to find a (distinguishing) substring s of length L that distinguishes the bad strings from good strings, i.e., such that for each string s i ∈ B there exists a length-L… (More)

—The secure remote Internet voting protocol play an important role in Internet voting system. The direction of development of remote Internet voting protocol is that implementation of receipt-freeness and coercion-resistance is from with strong physical assumptions to with weak physical assumptions. The final purpose is that receipt-freeness and… (More)

—The huge damage of denial of service attacks in security protocols attracts researchers' attention and effort to analysis, verification and prevention of denial of service attacks. In order to model resistance of denial of service attacks, firstly, we extend applied pi calculus from both adversary context and processes aspects; secondly, the first… (More)

- Bo Meng, Wei Huang, Zimao Li, Dejun Wang
- JDCTA
- 2010

Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance have been proposed in the literatures, but these formal models are not supported by automatic tools. Recently Backes et al. propose a new formal automated model of security properties… (More)

- Zimao Li, Wenying Xiao
- JNW
- 2014