Riemann问题的间断有限元

用时空全离散间断零次有限元对Riemarm问题进行了数值求解，没有出现振荡，很好的模拟了稀疏波的逐渐稀疏化和激波的剧烈变化。     

Inverse problems of aggregation processes

The coagulation frequency is the key ingredient in the population balance (Smoluchowski) equation of coagulation kinetics. An inverse problem is formulated to extract the coagulation frequency from transient size distributions when these distributions are self-similar. Two numerical examples illustrate the procedure. The first demonstrates the inverse problem for the recovery of singular coagulation frequencies, while the second shows the procedure when self-similarity is approximate. Transient droplet coagulation experiments in a turbulent flow field have been performed. The resulting size distributions are observed to be self-similar. The inverse problem is used to determine the drop coagulation frequency. This frequency shows significant deviation from the coagulation frequencies derived from simple models of drop-drop interactions in a turbulent flow field.     

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the basic problem as well as its extensions. The VNS shows excellent results on four different benchmark sets. Particularly, for all 120 instances the best known solution could be found and in 71 cases a new best solution was achieved.     

A complexity approach to sustainability – Stafford Beer revisited

There is wide acceptance of the need for a more holistic approach to sustainability. However, practical solutions remain elusive and tend to exhibit underlying conflicts between different paradigms and their associated methodologies. This paper argues the need to wield analytical tools that themselves embody the principles of systemic, ecological thinking. We present here a theoretical framework based on complexity science – focused on organisational and second order cybernetics – that highlights our understanding of the concept of sustainability. The paper goes on to reflect upon how current practice would benefit from such an approach.     

Chordal bipartite completion of colored graphs

Golumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449-473], in their paper on graph sandwich problems published in 1995, left the status of the sandwich problems for strongly chordal graphs and chordal bipartite graphs open. It was recently shown [C.M.H. de Figueiredo, L. Faria, S. Klein, R. Sritharan, On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs, Theoret. Comput. Sci., accepted for publication] that the sandwich problem for strongly chordal graphs is NP-complete. We show that given graph G with a proper vertex coloring c, determining whether there is a supergraph of G that is chordal bipartite and also is properly colored by c is NP-complete. This implies that the sandwich problem for chordal bipartite graphs is also NP-complete.     

Increasing efficiency of inverse iteration

Inverse iteration is simple but not very efficient method for computing few eigenvalues with minimal absolute values and corresponding eigenvectors of a symmetric matrix. The idea is to increase its efficiency by technique similar to multigrid methods used for solving linear systems. This approach is not new, but until now multigrid was mostly used for solving linear system which appear in Rayleigh quotient iteration, inverse iteration and related iterative methods. Instead of choosing appropriate coordinates (grids), our algorithm performs inverse iteration on a sequence of subspaces with decreasing dimensions (multispace). Block Lanczos method is used for the selection of a smaller subspace. This will produce a banded matrix, which makes inverse iteration even faster in the smaller dimensions.      

Large deviations: An introduction to 2007 Abel prize

2007 Abel prize has been awarded to S R S Varadhan for creating a unified theory of large deviations. We attempt to give a flavour of this branch of probability theory, highlighting the role of Varadhan.     

一般非线性渗流方程广义解的存在唯一性与Blow-up

In this paper,we consider nonnegative solutions to Cauchy problem for the general nonlinear filtration equations ut-Dj(aij(x,t,u)Diφ(u))+bi(t,u)Diu+C(x,t,u)=0,and obtain the existence,uniqueness and blow-up in finite time of these solutions under some structure conditions.     

On strong and total Lagrange duality for convex optimization problems

We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature.     

Semianalytic wave functions for highly rotational states of antiprotonic He

The structural and magnetic evolution in magnesium ferrite (MgFe₂O₄) caused by high-energy milling is investigated by Mössbauer spectroscopy.