since the 1990’s, network reliability has been considered as a new index for evaluating transportation networks under uncertainty. a large number of studies have been revealed in the literature in this field, which are mostly dedicated to developing relevant measures that can be utilized for the evaluation of vulnerable networks under different sources of uncertainty, such as daily traffic flow...

The 1980's saw rapid and exciting development of techniques for proving lower bounds in circuit complexity. This pace has slowed recently, and there has even been work indicating that quite di erent proof techniques must be employed to advance beyond the current frontier of circuit lower bounds. Although this has engendered pessimism in some quarters, there have in fact been many positive devel...

This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...

The public key cryptosystem published by Diffie and Hellman in 1976 is still of great interest today. Of the public key systems that have been proposed the RSA scheme of Rivest, Shamir and Adelman is of most current interest. We shall briefly describe this system (more can be found in references 2 and 7) and then describe a method to obtain suitable primes for use in the scheme. Disciplines Phy...

The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analysis that accounts for the systematic ambiguity of the scope of adjuncts in verb cluster constructions, by treating adjuncts as members of the sul)eat list. The extension uses powerNl reeursive lexical rules, implemente...

Let q be a prime power. It is shown that for any hypergraph ~,~ = {F~,..., Fdtq_~)+~ } whose maximal degree is d, there exists Z ¢ ~o c ~, such that IUF~oFI =-0 (rood q). For integers d, m __ 1 let fe(m) denote the minimal t such that for any hypergraph -~ = {Fz . . . . . Ft} whose maximal degree is d, there exists ~ ¢ o~ o c Y, such that I~F~ ~oFI -= 0 (mod m). Here we determine fd(m) when m i...

This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...