A new way for constructing high accuracy shock-capturing generalized compact difference schemes

The generalized compact (GC) schemes and some of their important properties are presented. And a new way for constructing high order accuracy and high-resolution GC schemes is presented. The schemes constructed by using this way could satisfy some principles and demands prescribed in advance to ensure some desired properties to the schemes, such as the principle about suppression of the oscillations, the principle of stability, the order of accuracy and number of scheme points, etc. As two examples, a three-point third-order compact scheme and a three-point fifth-order GC scheme satisfying the principle about suppression of the oscillations and the principle of stability are described in this paper. Numerical results show that these schemes are shock-capturing. The time-dependent boundary conditions proposed by Thompson are well employed when the algorithm is applied to the Euler equations of gas dynamics. Fourier analysis shows that the resolution characteristics are spectral-like.     

长25-29井卡钻事故的处理

长２５－２９井在完井阶段通井过程中发生粘附卡钻事故，在处理卡钻过程中又发生卡套铣筒、井漏、溢流等事故及复杂情况。通过对井下情况的认真分析，采取先堵漏后循环再解卡的处理方案，顺利地解除了该次卡钻事故，大大地减少了经济损失。     

Characterization of one-step,chromate-free,primer systems using liquid-state Si and C NMR

Coatings derived from organofunctional silanes have been investigated as possible replacements for the chromate-based systems used in the aerospace industry. In this study, organofunctional silanes [bis-(triethoxysilylpropyl)ethane and bis(triethoxysilylpropyl) tetrasulfide] were reacted with commercially available acrylate (ECO-CRYL™ 9790) and epoxy (EPI-REZ™ WD-510) resins, resulting in a one-step, low-VOC, chromate-free primer. Liquid-state ²⁹Si and ¹³C NMR were used to determine structural characteristics of various optimized formulations.     

Modified CIELAB formula tested using a textile pass/fail data set

The proposed new color-difference formula of CIE TC 129, which is a modified version of CIELAB, was tested with a recently published data set of textile pass/fail judgments. Goodness of fit is improved, if the parameter of lightness is set near 2, and if, additionally, a weight function for lightness is defined that reduces the weight of a lightness difference with lightness level in relation to chroma or hue scaling. © 1994 John Wiley & Sons, Inc.     

Optimal estimation of parameters of dynamical systems by neural network collocation method

In this paper we propose a new method to estimate parameters of a dynamical system from observation data on the basis of a neural network collocation method. We construct an object function consisting of squared residuals of dynamical model equations at collocation points and squared deviations of the observations from their corresponding computed values. The neural network is then trained by optimizing the object function.The proposed method is demonstrated by performing several numerical experiments for the optimal estimates of parameters for two different nonlinear systems. Firstly, we consider the weakly and highly nonlinear cases of the Lorenz model and apply the method to estimate the optimum values of parameters for the two cases under various conditions. Then we apply it to estimate the parameters of one-dimensional oscillator with nonlinear damping and restoring terms representing the nonlinear ship roll motion under various conditions. Satisfactory results have been obtained for both the problems.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Stability of iterative processes with errors for a system of nonlinear -accretive variational inclusions in Banach spaces

In this paper, by using the concept of (A,η)-accretive mappings and the new resolvent operator technique associated with (A,η)-accretive mappings, we introduce and study a system of general mixed quasivariational inclusions involving (A,η)-accretive mappings in Banach spaces, and construct a new perturbed iterative algorithm with mixed errors for this system of nonlinear (A,η)-accretive variational inclusions in q-uniformly smooth Banach spaces. Our results improve and generalize the corresponding results of recent works.     

4J29可伐合金材料低温热物性及弹性模量测试

为了研究4J29可伐合金的低温热物性和机械性能,为低温系统的设计、结构变形、力学稳定性、装调和光学校准等提供技术保障,分别选用"稳态纵向热流法"、"稳态法"测试了4J29可伐合金在77—300 K温区的热导率和比热容,采用弹性模量试验机测试了77—300 K温区的弹性模量系数。通过标准样品材料TC4对比及误差分析,证明热导率测量误差在9%以内,其它误差均控制在6%以内。     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.