- Full text PDF available (14)
The symmetric encryption problem which manifests itself when two parties must securely transmit a message m with a short shared secret key is considered in conjunction with a computationally unbounded adversary. As the adversary is unbounded, any encryption scheme must leak information about m; in particular, the mutual information between m and its… (More)
In this paper, the concept of weakly compact set in L-fuzzy topological space have been introduced. The characterization of weakly compact set are researched. Also it is pointed out that weakly compactness is an L-good extension of usual weak compactness. compact set，fuzzy mapping.
Let k, t and n be three integers with t ~ 2, k ~ 2t and n ~ 3t. We conjecture that if G is a graph of order n with minimum degree at least k, then G contains t vertex-disjoint cycles covering at least min(2k, n) vertices of G. We will show the conjecture to be true for t = 2.
We propose a conjecture: for each integer k 2:: 2, there exists N (k) such that if G = (Vb \12; E) is a bipartite graph with IV 1 1 = 1\121 = n 2: N(k) and d(x) + d(y) 2: n + k for each pair of non-adjacent vertices x and y of G with x E V 1 and y E \12, then for any k independent edges Let k be a positive integer and let G = (Vi, \12; E) be a bipartite… (More)
An asteroid landing trajectory optimization method is studied based on Gauss Pseudo-spectral. Firstly, we analyze the characteristics of probe landing on asteroid, and put forward the initial conditions, process constraints, terminal constraints and the optimization performance index. The probe's landing trajectory optimization should meet the index.… (More)
Some nonlinear weakly singular integral inequalities in two variables which generalize some known results are discussed. The results can be used as powerful tools in the analysis of certain classes of differential equations, integral equations, and evolution equations. An example is presented to show boundedness of solution of a differential equation here.
In this paper we consider a new scheduling model with learning effect, in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job's scheduled position. We show that the single machine problems to minimize the makespan and the total completion time are polynomially solvable. In… (More)
Let F be a forest of order nand G a graph of order n. Suppose that b..(G)(~(F) + 1) ~ n. Then, except for three pairs of graphs (G,F), there is a packing of G and F.
We develop an ELLAM (Eulerian-Lagrangian localized adjoint method) scheme to solve two-dimensional advection-diiusion equations with all combinations of innow and outtow Dirichlet, Neumann, and ux boundary conditions. The ELLAM formalism provides a systematic framework for implementation of general boundary conditions, leading to mass-conservative numerical… (More)
A graph G of order n is k-placeable if there exist k edge-disjoint copies of G in the complete graph K n. Previous work characterized all trees that are k-placeable for k ≤ 3. This work extends those results by giving a complete characterization of all 4-placeable trees.