Multiround Unconditionally Secure Authentication

Authentication codes are used to protect communication against a malicious adversary. In this paper we investigate unconditionally secure multiround authentication schemes. In a multiround scheme a message is authenticated by passing back and forth several codewords between the sender and receiver. We define a multiround authentication model and show how to calculate the probability of a successful attack for this model. We prove the security for a 3-round scheme and give a construction for the 3-round scheme based on Reed-Solomom codes. This construction has a very small key size for even extremely large messages. Furthermore, a secure scheme for an arbitrary number of rounds is given. We give a new upper bound for the keys size of an n-round scheme.     

Diffusion in poro‐plastic media

A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd.     

Density results for subspace multiwindow Gabor systems in the rational case

Let S be a periodic set in R and L2(S) be a subspace of L2 (R). This paper investigates the density problem for multiwindow Gabor systems in L2(S) for the case that the product of time-frequency shift parameters is a rational number. We derive the density conditions for a multiwindow Gabor system to be complete (a frame) in L2(S). Under such conditions, we construct a multiwindow tight Gabor frame for L2(S) with window functions being characteristic functions. We also provide a characterization of a multiwindow Gabor frame to be a Riesz basis for L2(S), and obtain the density condition for a multiwindow Gabor Riesz basis for L2(S).     

A new hybrid method for solving a generalized equilibrium problem, solving a variational inequality problem and obtaining common fixed points in Banach spaces, with applications

The purpose of this paper is to prove by using a new hybrid method a strong convergence theorem for finding a common element of the set of solutions for a generalized equilibrium problem, the set of solutions for a variational inequality problem and the set of common fixed points for a pair of relatively nonexpansive mappings in a Banach space. As applications, we utilize our results to obtain some new results for finding a solution of an equilibrium problem, a fixed point problem and a common zero-point problem for maximal monotone mappings in Banach spaces.     

Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon

We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. This result is a first step for giving a nonparametric test for identifying the degree function of a large random graph. Replacing the indicator function in the empirical CDF by a smoother function, we get general asymptotic results for functionals of homomorphism densities for partially labeled graphs. This general setting allows to recover recent results on asymptotics for homomorphism densities of sampled graphon.     

Stackelberg–Nash exact controllability for the Kuramoto–Sivashinsky equation

This paper deals with a hierarchical control problem for the Kuramoto–Sivashinsky equation following a Stackelberg–Nash strategy. We assume that there is a main control, called the leader, and two secondary controls, called the followers. The leader tries to drive the solution to a prescribed target and the followers intend to be a Nash equilibrium for given functionals. It is known that this problem is equivalent to a null controllability result for an optimality system consisting of three non-linear equations. One of the novelties is a new Carleman estimate for a fourth-order equation with right-hand sides in Sobolev spaces of negative order, which allows to relax some geometric conditions for the observation sets for the followers.     

树的稳定子集和稳定指标

一个实矩阵的符号稳定性问题在经济学、生态学等诸多领域中都有应用背景．本文利用[1]中给出的不可约矩阵的符号稳定性的有关结论，将一个实矩阵的符号稳定性判定问题转化为一个等价的图论问题，即判定无向树中一个点子集的稳定性问题．本文引入了树的稳定子集的概念并给出了稳定子集的递归判别方法．本文还提出井研究了树的稳定指标，即树中所有稳定子集的最小基数，证明了关于稳定指标的一个min—max型定理，井给出了n阶树的稳定指标的最好上界及达到上界的极树的完全刻划。     

An algorithm for the two-dimensional assortment problem

In this paper we consider the two-dimensional assortment problem. This is the problem of choosing from a set of stock rectangles a subset which can be used for cutting into a number of smaller rectangular pieces. Constraints are imposed upon the number of such pieces which result from the cutting.A heuristic algorithm for the guillotine cutting version of the problem is developed based on a greedy procedure for generating two-dimensional cutting patterns, a linear program for choosing the cutting patterns to use and an interchange procedure to decide the best subset of stock rectangles to cut.Computational results are presented for a number of test problems which indicate that the algorithm developed produces good quality results both for assortment problems and for two-dimensional cutting problems.     

Competence-driven project portfolio selection,scheduling and staff assignment

This paper presents a new model for project portfolio selection, paying specific attention to competence development. The model seeks to maximize a weighted average of economic gains from projects and strategic gains from the increment of desirable competencies. As a sub-problem, scheduling and staff assignment for a candidate set of selected projects must also be optimized. We provide a nonlinear mixed-integer program formulation for the overall problem, and then propose heuristic solution techniques composed of (1) a greedy heuristic for the scheduling and staff assignment part, and (2) two (alternative) metaheuristics for the project selection part. The paper outlines experimental results on a real-world application provided by the E-Commerce Competence Center Austria and, for a slightly simplified instance, presents comparisons with the exact solution computed by CPLEX.     

Representation for the Green’s function of the Dirichlet problem for polyharmonic equations in a ball

We explicitly construct the Green’s function for the Dirichlet problem for polyharmonic equations in a ball in a space of arbitrary dimension. The formulas for the Green’s function are of interest in their own right. In particular, the explicit representations for a solution to the Dirichlet problem for the biharmonic equation are important in elasticity.     

Subexponential behaviour of the Dirichlet heat kernel

We obtain a formula for the asymptotic behaviour of the Dirichlet heat kernel for large time in terms of the survival probability of a Brownian motion, under the assumption that the latter decays subexponentially for large time. We also obtain a lower bound for the Dirichlet heat kernel for arbitrary open and connected sets in Euclidean space.     

Optimal Control and Stabilization for Some Fisher-Like Models

This article concerns optimal control and stabilization for some Fisher-like models with control acting in a subdomain ω. We investigate the optimal position of ω for some optimal harvesting problems. First, we refer to a logistic model with diffusion. We remember the necessary optimality conditions, and then obtain an iterative method to improve the position of ω for the optimal harvesting effort (for a simplified model without logistic term). Next, we consider the null stabilization for a controlled Fisher model and obtain a descent method to improve the position of ω in order to get a faster stabilization to zero. Numerical tests illustrating the effect of the last method are given. We also studied the null stabilization for a prey-predator system and have reduced it to the study of the null stabilizability for a related Fisher model.     

Implicit construction of multiple eigenvalues for trees

We are generally concerned with the possible lists of multiplicities for the eigenvalues of a real symmetric matrix with a given graph. Many restrictions are known, but it is often problematic to construct a matrix with desired multiplicities, even if a matrix with such multiplicities exists. Here, we develop a technique for construction using the implicit function theorem in a certain way. We show that the technique works for a large variety of trees, give examples and determine all possible multiplicities for a large class of trees for which this was not previously known.     

An ultra-fast smoothing algorithm for time–frequency transforms based on Gabor functions

Gabor functions, Gaussian wave packets, are optimally localized in time and frequency, and thus in principle ideal as (frame) basis functions for a wavelet, windowed Fourier or wavelet-packet transform for the detection of events in noisy signals or for data compression. A major obstacle for their use is that a tailored efficient operator acting on the transform coefficients for altering the width of the wave packets does not exist. However, by virtue of a curious property of the Gabor functions it is possible to change the width of the wave packets using just one-dimensional convolutions with very short kernels. The cost of a wavelet-type transform based on the scheme presented below is similar to that of a low order wavelet transform for a compact kernel and significantly less than the algorithme à trous. The scheme can hence easily be employed for the processing of signals in real time.     

Exceptional Family of Elements for a Variational Inequality Problem and its Applications

This paper introduces a new concept of exceptional family of elements (abbreviated, exceptional family) for a finite-dimensional nonlinear variational inequality problem. By using this new concept, we establish a general sufficient condition for the existence of a solution to the problem. Such a condition is used to develop several new existence theorems. Among other things, a sufficient and necessary condition for the solvability of pseudo-monotone variational inequality problem is proved. The notion of coercivity of a function and related classical existence theorems for variational inequality are also generalized. Finally, a solution condition for a class of nonlinear complementarity problems with so-called P _* -mappings is also obtained.     

The impact of cost uncertainty on the location of a distribution center

The location of a distribution center (DC) is a key consideration for the design of supply chain networks. When deciding on it, firms usually allow for transportation costs, but not supplier prices. We consider simultaneously the location of a DC and the choice of suppliers offering different, possibly random, prices for a single product. A buying firm attempts to minimize the sum of the price charged by a chosen supplier, and inbound and outbound transportation costs. No costs are incurred for switching suppliers. We first derive a closed-form optimal location for the case of a demand-populated unit line between two suppliers offering deterministic prices. We then let one of the two suppliers offer a random price. If the price follows a symmetric and unimodal distribution, the optimal location is closer to the supplier with a lower mean price. We also show the dominance of high variability: the buyer can decrease the total cost more for higher price variability for any location. The dominance result holds for normal, uniform, and gamma distributions. We propose an extended model with more than two suppliers on a plane and show that the dominance result still holds. From numerical examples for a line and a plane, we observe that an optimal location gets closer to the center of gravity of demands as the variability of any supplier’s price increases.     

Duality theorem for a generalized Fermat-Weber problem

The classical Fermat-Weber problem is to minimize the sum of the distances from a point in a plane tok given points in the plane. This problem was generalized by Witzgall ton-dimensional space and to allow for a general norm, not necessarily symmetric; he found a dual for this problem. The authors generalize this result further by proving a duality theorem which includes as special cases a great variety of choices of norms in the terms of the Fermat-Weber sum. The theorem is proved by applying a general duality theorem of Rockafellar. As applications, a dual is found for the multi-facility location problem and a nonlinear dual is obtained for a linear programming problem with a priori bounds for the variables. When the norms concerned are continuously differentiable, formulas are obtained for retrieving the solution for each primal problem from the solution of its dual.     

Dynamic contact problem for viscoelastic piezoelectric materials with normal damped response and friction

In this paper, we deal with a class of inequality problems for dynamic frictional contact between a piezoelectric body and a foundation. The model consists of a system of the hemivariational inequality of hyperbolic type for the displacement, the time dependent elliptic equation for the electric potential. The contact is modeled by a general normal damped response condition and a friction law, which are nonmonotone, possibly multivalued and have the subdifferential form. The existence of a weak solution to the model is proved by embedding the problem into a class of second-order evolution inclusions and by applying a surjectivity result for multivalued operators.     

Determinants of matrices over semirings

In this paper, the concept of determinants for the matrices over a commutative semiring is introduced, and a development of determinantal identities is presented. This includes a generalization of the Laplace and Binet–Cauchy Theorems, as well as on adjoint matrices. Also, the determinants and the adjoint matrices over a commutative difference-ordered semiring are discussed and some inequalities for the determinants and for the adjoint matrices are obtained. The main results in this paper generalize the corresponding results for matrices over commutative rings, for fuzzy matrices, for lattice matrices and for incline matrices.     

Duality for generalized equilibrium problem

We introduce a generalized equilibrium problem (GEP) that allow us to develop a robust dual scheme for this problem, based on the theory of conjugate functions. We obtain a unified dual analysis for interesting problems. Indeed, the Lagrangian duality for convex optimization is a particular case of our dual problem. We establish necessary and sufficient optimality conditions for GEP that become a well-known theorem given by Mosco and the dual results obtained by Morgan and Romaniello, which extend those introduced by Auslender and Teboulle for a variational inequality problem.