Properties of serial kanban systems

In this paper we show some structural results of a kanban system by using results about the underlying GSMP. The main results from this connection are: dominance of allocations, optimal partition, upper and lower bounds on throughput, consistency of the IPA derivative, convexity of throughput as a function of service time parameters and concavity of throughput with respect to number of kanbans. Although the dominance and the partition results were obtained previously by sample path arguments, the proofs here are less cumbersome and generalize the earlier results. The second-order properties for kanban lines are new. These results form a basis for results in multi-product lines where proofs by sample paths require extensive notation.     

Projective Approximation of Double Limit Points for Nonlinear Problems

In [2], general approximation results for the solution in a neighborhood of a simple limit point are given. In this paper we give projective approximation results for the solutions in a neighborhood of a double limit point. Application of these results to a nonlinear partial differential equation and numerical results are given.     

关于迭序列的子列极限点

本文讨论了度量空间上一个连续自映射击一点处的迭代序列的子列极限点集的结构，所得的结果统一和推广了Ｄｉａｚ和Ｍｅｔｃａｌｆ，Ｍａｉｔｉ和Ｂａｂｕ和Ｐａｒｋ的若干结果．     

Zu einigen mathematischen problemen in der theorie der transonischen strömung

The work deals with a definition of a weak solution of steady plane transonic flows past a thin profile, with the properties of the solution across a shock wave, and with a derivation of a conservative difference scheme suitable for numerical solution of the above mentioned problem by a finite difference method. The work presents several examples of numerical solution of transonic flows past a profile, through a plane cascade and some three-dimensional results. The numerical results presented are compared with experimental results or with numerical results by other authors.     

Steady solution of solitary wave and linear shear current interaction

The steady solution of a solitary wave propagating in the presence of a linear shear background current is investigated by the Green–Naghdi (GN) equations. The steady solution is obtained by use of the Newton–Raphson method. Three aspects are investigated; they are the wave speed, wave profile and velocity field. The converged GN results are compared with results from the literature. It is found that for the opposing-current case of the solitary wave with a small amplitude, the results of the GN equations match results from the literature well, while for the solitary wave with a large amplitude, results from the literature are seen to be not as accurate. In the following-current case, though the amplitude of the solitary wave is small, the GN results are shown to be accurate. The velocity along the water column at the wave crest and the velocity field for different cases are calculated by the GN equations. The results of the GN equations show obvious differences when compared with the results obtained by superposing the no-current results and linear shear current linearly. We find that for the same current strength, the vortex is stronger for the steep solitary-wave case than that for the small solitary-wave case.     

Obtaining exact value by approximate computations

Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.     

Effective moduli of particulate solids: The completed double layer boundary element method with lubrication approximation

This paper reports the numerical results of the effective moduli of a composite consisting of identical rigid spherical inclusions in a homogeneous isotropic elastic medium. The effective moduli are calculated for particles in simple, body-centered, face-centered cubic lattices, and in a random configuration. The numerical technique used is the Completed Double Layer Boundary Element Method (CDLBEM) augmented by a short-range lubrication approximation. The results agree well with previous numerical results obtained by a completely different technique. Agreement with experimental results for particles in random configurations is also observed.     

Some results on multi-valued weakly jungck mappings in <Emphasis Type="Italic">b</Emphasis>-metric space

In this paper, the concept of multi-valued weak contraction of Berinde and Berinde [8] for the Picard iteration in a complete metric space is extended to the case of multi-valued weak contraction for the Jungck iteration in a complete b-metric space. While our main results generalize the recent results of Berinde and Berinde [8], they also extend, improve and unify several classical results pertainning to single and multi-valued contractive mappings in the fixed point theory. Our results also improve the recent results of Daffer and Kaneko [16].      

Some fixed point results for a generalized ψ-weak contraction mappings in orbitally metric spaces

Samet and Vetro [Samet B, Vetro C. Berinde mappings in orbitally complete metric spaces. Chaos Solitons Fract 2011;44:1075–9.] studied a fixed point theorem for a self-mapping satisfying a general contractive condition of integral type in orbitally complete metric spaces. In this paper, we introduce the notion of a generalized ψ-weak contraction mapping and establish some results in orbitally complete metric spaces. Our results generalize several well-known comparable results in the literature. As an application of our results we deduce the result of Samet and Vetro. Some examples are given to illustrate the useability of our results.     

拟φ-渐近非扩展映像族的公共不动点的迭代算法

在自反的严格凸的光滑Banach空间中给出了一种关于拟φ-渐近非扩展映像族公共不动点的新混杂算法,并利用广义投影算子和K-K性质等技巧证明了算法的强收敛性.所得结果是近期相关结果的改进与推广.     

Systems of quasi-variational relations with applications

In this paper, we introduce a system of quasi-variational relations (in short, SQVR) and present several examples which show that it is a very general and unified model of several problems. We establish the existence of solutions of SQVP, in general, and several other problems, in particular. As an application of our results, we derive maximal element theorems and a collectively fixed point theorem for a family of multivalued maps. As further applications, we study Ky Fan type inequality / inclusion problem for vector valued bifunctions which includes constrained Nash equilibrium problem as a special case. We also present a common fixed point theorem for a family of multivalued maps. The results of this paper improve and generalize several known results on (system of) quasi-equilibrium problems, (system of) quasi-variational inclusions, constrained Nash equilibrium problem, collectively fixed point theorem and KKM type theorems for a family of multivalued maps. Our results also contain several results which appeared in recent literature.     

The isometry classification of hermitian forms over division algebras

The isometry classification problem occupies a central role in the theory of quadratic and hermitian forms. This article is a survey of results on the problem for quadratic and hermitian forms over a field and also for hermitian and skew-hermitian forms over a noncommutative division algebra with involution. Rather than adopting a very abstract approach, the problems are stated in matrix or linear-algebraic terms. The known solutions depend crucially on the particular field considered, although there are some general results which are mentioned. While many of the results date back a long time, some recent results, especially those on skew-hermitian forms over a quaternion algebra over a number field, are included.     

Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces

In this paper, we study regression problems over a separable Hilbert space with the square loss, covering non-parametric regression over a reproducing kernel Hilbert space. We investigate a class of spectral/regularized algorithms, including ridge regression, principal component regression, and gradient methods. We prove optimal, high-probability convergence results in terms of variants of norms for the studied algorithms, considering a capacity assumption on the hypothesis space and a general source condition on the target function. Consequently, we obtain almost sure convergence results with optimal rates. Our results improve and generalize previous results, filling a theoretical gap for the non-attainable cases.     

一类中立型时滞微分方程解的渐近性

本文考虑一类非线性中立型时滞微分方程解的渐近性，给出了方程的解收敛于常数的结果．所得结论改进和推广了文献中的某些已知结果．     

On the uniqueness of an entire function sharing a small entire function with some linear differential polynomial

We prove a theorem on the growth of nonconstant solutions of a linear differential equation. From this we obtain some uniqueness theorems concerning that a nonconstant entire function and its linear differential polynomial share a small entire function. The results in this paper improve many known results. Some examples are provided to show that the results in this paper are the best possible.     

The uniqueness of an entire function sharing a small entire function with its derivatives

In this paper, we prove a theorem on the growth of a solution of a linear differential equation. From this we obtain some uniqueness theorems concerning that a nonconstant entire function and its derivatives sharing a small entire function. The results in this paper improve many known results. Some examples are provided to show that the results in this paper are the best possible.     

Strong Convergence Theorems for a Family of Quasi-φ-Asymptotically Nonexpansive Mappings

The purpose of this article is to propose a modified hybrid projection algorithm and prove a strong convergence theorem for a family of quasi-φ-asymptotically nonexpansive mappings.Its results hold in reflexive,strictly convex,smooth Banach spaces with the property(K).The results of this paper improve and extend recent some relative results.     

On the negative value of information in informationally inefficient markets: Calculations for large number of traders

In informationally inefficient markets, classical decision theory assumes the value of information to be positive. Recent developments, however, contradict this paradigm. Schredelseker [Schredelseker, K., 2001. Is the usefulness approach useful? Some reflections on the utility of public information. In: McLeay, S., Riccaboni, A. (Eds.), Contemporary Issues in Accounting Regulation, Kluwer Academic Publishers, Boston, pp. 135–153] proposed a simulation model wherein a single security is traded among non-cooperating and asymetrically informed traders. One of the main results was the fact that badly informed traders could expect higher returns than traders with more information. But Schredelseker was able to give exact results for a small number of traders only. The aim of this paper is to give reliable results for a sufficiently large number of traders for both the expected gain and the probability of gain larger than zero. We are using combinatorial methods in order to get exact results for badly informed traders and simulation techniques for results of traders with higher level of information. The exact results are used (error between exact results and simulation results for the first traders) to determine the number of samples which have to be drawn with the simulation algorithm.     

Superconvergence and a posteriori error estimates for the Stokes eigenvalue problems

In this paper we consider the finite element approximation of the Stokes eigenvalue problems based on projection method, and derive some superconvergence results and the related recovery type a posteriori error estimators. The projection method is a postprocessing procedure that constructs a new approximation by using the least squares strategy. The results are based on some regularity assumptions for the Stokes equations, and are applicable to the finite element approximations of the Stokes eigenvalue problems with general quasi-regular partitions. Numerical results are presented to verify the superconvergence results and the efficiency of the recovery type a posteriori error estimators.     

图的无号Laplace矩阵的最大特征值

The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.