Multiple periodic solutions of a delayed stage-structured predator–prey model with non-monotone functional responses

A delayed stage-structured predator–prey model with non-monotone functional responses is proposed. It is assumed that immature individuals and mature individuals of the predator are divided by a fixed age, and that immature predators do not have the ability to attack prey. Some new and interesting sufficient conditions are obtained for the global existence of multiple positive periodic solutions of the stage-structured predator–prey model. Our method is based on Mawhin’s coincidence degree and novel estimation techniques for the a priori bounds of unknown solutions to Lx = λNx. An example is given to illustrate the feasibility of our main result.     

The Riesz decomposition of finely superharmonic functions

This paper answers a question of Fuglede about minimal positive harmonic functions associated with irregular boundary points. As a consequence, an old and central problem of fine potential theory, concerning the Riesz decomposition, is resolved. Namely, it is shown that, on certain fine domains, there exist positive finely superharmonic functions which do not admit any positive finely harmonic minorant and yet are not fine potentials.     

C59N单分子整流器

通过将单个C59N分子置于双势垒隧道结中，从而利用单电子隧穿效应和C59N分子的特殊能级结构，我们成功地实现了一种新型的单分子整流器件．实验中这个整流器件的正向导通电压约为0．5-0．7V，反向击穿电压约为1．6—1．8V．理论分析表明，中性C59N分子的半占据费米能级以及在不同充电情况下费米能级的不对称移动是形成整流效应的主要原因．其构成原理也决定了该器件具有稳定、易重复的特点．     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.     

Some explicit examples of Hamiltonian minimal Lagrangian submanifolds in complex space forms

In this paper, we find some new explicit examples of Hamiltonian minimal Lagrangian submanifolds among the Lagrangian isometric immersions of a real space form in a complex space form.     

The communication complexity of private value single-item auctions

This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions—the Vickrey auction, the English auction and the recently proposed bisection auction—and show that in the truth-telling equilibrium the bisection auction is the best performer.     

A MINI MULTI-GAS DETECTION SYSTEM BASED ON INFRARED PRINCIPLE

To counter the problems of gas accidents in coal mines, family safety resulted from using gas, a new infrared detection system with integration and miniaturization has been developed. The infrared detection optics principle used in developing this system is mainly analyzed. The idea that multi gas detection is introduced and guided through analyzing single gas detection is got across. Through researching the design of cell structure, the cell with integration and miniaturization has been devised. The way of data transmission on Controller Area Network (CAN) bus is explained. By taking Single-Chip Microcomputer (SCM) as intelligence handling, the functional block diagram of gas detection system is designed with its hardware and software system analyzed and devised. This system designed has reached the technology requirement of lower power consumption, mini-volume, big measure range, and able to realize multi-gas detection.