A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

Residual currents and corridor of flow in the Rio de la Plata

The Rio de la Plata is a large and shallow water body that discharges onto the Atlantic Ocean. The main driving forces for the river flow are the bathymetry, tides, the outflow from the Paraná and Uruguay rivers and the winds. A numerical model covering the entire river was set up with the objective of increasing our understanding of the hydrographical features and morphological dynamics in the Estuary. The simulations revealed a counter-clockwise residual circulation in the Samborombón Bay and an eastward net flow near the Uruguayan coast. The residual flow is forced by both the tides and the bathymetry. The residence time for the entire river ranges from 40 to 80 days. However, residence times above 120 days was found in the Samborombón Bay. Three corridors of flow have been identified.     

拟因子试验设计在生产中的应用

根据生产实际,综合利用并列、赋闲列和拟水平试验设计,运用多重比较进行方差分析,寻找水泥熟料的最佳工艺.不仅解决了不同水平多因素试验问题,同时还可考虑交互作用,大大减少了试验次数,从而提高经济效益.     

推广的Kantorovich算子在Ba空间中的逼近

利用Ditzian-Totik光滑模,研究了推广的Kantorovich算子在Ba空间中的逼近,得到逼近的正定理与等价定理.所得结果改进、推广和统一了一些作者的结果.     

Comparison of the boundary theory with the contact rule of phase regions and Gupta’s method

The phase boundary theory and the contact rule of phase regions are compared, and some weaknesses of the latter are manifested. The comparison between the Gupta’s method and the boundary theory method for constructing multicomponent isobaric sections is also presented.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

A Joint Integral Test for the Locations of Extrema for Brownian Motion

Let μ⁺(t) and μ⁻(t) be the locations of the maximum and minimum, respectively, of a standard Brownian motion in the interval [0,t]. We establish a joint integral test for the lower functions of μ⁺(t) and μ⁻(t), in the sense of Paul Lévy. In particular, it yields the law of the iterated logarithm for max(μ⁺(t),μ⁻(t)) as a straightforward consequence. Our result is in agreement with well-known theorems of Chung and Erdős [(1952) Trans. Amer. Math. Soc. 72, 179–186.], and Csáki, F?ldes and Révész [(1987) Prob. Theory Relat. Fields 76, 477–497].      

A Characterization of Graphs without Even Factors

In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived. This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University. The research is supported by NSFC