一类非线性混合整规划的无约束连续化解法

将整系数多项式 0 - 1混合整规划问题化成无约束多项式规划问题。通过解该问题 ,能得到原问题的近似解。处理方法的特点是能够直接处理不等式约束情形 ,而不需要先将不等式约束化成等式约束再来处理     

家庭档案及其教育功能探析

家庭档案在人们社会生活中的重要作用日益凸显;就教育功能而言,突出地表现在家庭档案可以提供德智体、美育、心育等方面的教育内容;同时,家庭档案也是一种积极有效的教育手段:能促进自主学习与自我教育,有利于家庭积极参与社区教育和社会主义精神文明建设;能促进学校的教育教学工作,有利于家教合作。档案部门、家庭、学校等有关方面应积极协作,加强宣传力度,加强公众的档案意识,向公众提供建设家庭档案的业务指导,加强家庭档案的建设,以充分发挥其教育功能。     

矩阵方程XA＝B的亚（半）正定自共轭四元数矩阵解

给出了四元数体Ｑ上ｎ×ｎ分块矩阵为亚（半）正定自共轭矩阵的一个充要条件，进而给出了Ｑ上矩阵方程ＸＡｎｍ＝Ｂｎｍ有亚（半）正定自共轭四元数矩阵解的充要条件及解集合的显式表示，从而推广改进了数城上线性方程组的反问题及矩阵反问题的相应结果．     

儒家思想的演进、特质与功能探析

儒家思想在中华文化中占有突出的位置,发挥着弥散性功能,渗透到中国古代社会生活的各个领域各个层次各个方面。扫描儒家思想,可见其问题、理念、范式与时俱进;对其进行结构探悉,发现其主旨、论域、关怀一如既往;对其进行功能考量,得知其学术、治术、心术功能兼容并包。     

Dynamic reliability models with conditional proportional hazards

A dynamic approach to the stochastic modelling of reliability systems is further explored. This modelling approach is particularly appropriate for load-sharing, software reliability, and multivariate failure-time models, where component failure characteristics are affected by their degree of use, amount of load, or extent of stresses experienced. This approach incorporates the intuitive notion that when a set of components in a coherent system fail at a certain time, there is a jump from one structure function to another which governs the residual lifetimes of the remaining functioning components, and since the component lifetimes are intrinsically affected by the structure function which they constitute, then at such a failure time there should also be a jump in the stochastic structure of the lifetimes of the remaining components. For such dynamically-modelled systems, the stochastic characteristics of their jump times are studied. These properties of the jump times allow us to obtain the properties of the lifetime of the system. In particular, for a Markov dynamic model, specific expressions for the exact distribution functions of the jump times are obtained for a general coherent system, a parallel system, and a series-parallel system. We derive a new family of distribution functions which describes the distributions of the jump times for a dynamically-modelled system.     

一类二阶中立型时滞差分方程的振动定理

研究了一类具有变系数的二阶中立型时滞差分方程的振动性,得到了该类方程振动及差分算子△振动的一个充分条件.     

Sample selection in radiocarbon dating

Archaeologists working on the island of O'ahu, Hawai'i, use radiocarbon dating of samples of organic matter found trapped in fish-pond sediments to help them to learn about the chronology of the construction and use of the aquicultural systems created by the Polynesians. At one particular site, Loko Kuwili, 25 organic samples were obtained and funds were available to date an initial nine. However, on calibration to the calendar scale, the radiocarbon determinations provided date estimates that had very large variances. As a result, major issues of chronology remained unresolved and the archaeologists were faced with the prospect of another expensive programme of radiocarbon dating. This paper presents results of research that tackles the problems associated with selecting samples from those which are still available. Building on considerable recent research that utilizes Markov chain Monte Carlo methods to aid archaeologists in their radiocarbon calibration and interpretation, we adopt the standard Bayesian framework of risk functions, which allows us to assess the optimal samples to be sent for dating. Although rather computer intensive, our algorithms are simple to implement within the Bayesian radiocarbon framework that is already in place and produce results that are capable of direct interpretation by the archaeologists. By dating just three more samples from Loko Kuwili the expected variance on the date of greatest interest could be substantially reduced.     

Efficient Estimation of a Distribution Function under Quadrant Dependence

LetX₁,X₂, ..., be real-valued random variables forming a strictly stationary sequence, and satisfying the basic requirement of being either pairwise positively quadrant dependent or pairwise negatively quadrant dependent. LetF^ be the marginal distribution function of theX_ips, which is estimated by the empirical distribution functionF_n and also by a smooth kernel-type estimateF_n, by means of the segmentX₁, ...,X_n. These estimates are compared on the basis of their mean squared errors (MSE). The main results of this paper are the following. Under certain regularity conditions, the optimal bandwidth (in the MSE sense) is determined, and is found to be the same as that in the independent identically distributed case. It is also shown thatn MSE(F_n(t)) andnMSE (F^_n(t)) tend to the same constant, asn→∞ so that one can not discriminate be tween the two estimates on the basis of the MSE. Next, ifi(n) = min {k∈{1, 2, ...}; MSE (F_k(t)) ≤ MSE (F_n(t))}, then it is proved thati(n)/n tends to 1, asn→∞. Thus, once again, one can not choose one estimate over the other in terms of their asymptotic relative efficiency. If, however, the squared bias ofF^_n(t) tends to 0 sufficiently fast, or equivalently, the bandwidthh_n satisfies the requirement thatnh³_n→ 0, asn→∞, it is shown that, for a suitable choice of the kernel, (i(n) ?n)/(nh_n) tends to a positive number, asn→∞ It follows that the deficiency ofF_n(t) with respect toF^_n(t),i(n) ?n, is substantial, and, actually, tends to ∞, asn→∞. In terms of deficiency, the smooth estimateF^_n(t) is preferable to the empirical distribution functionF_n(t)     

A spanning heuristic for the unordered and ordered matching identification problem

The matching identification problem (MIP) is a combinatoric search problem related to the fields of learning from examples, boolean functions, and knowledge acquisition. The MIP involves identifying a single “goal” item from a large set of items. Because there is commonly a cost associated with evaluating each guess, the goal item should be identified in as few guesses as possible. As in most search problems, the items have a similar structure, which allows an evaluation of each guessed item. In other words, each guessed item elicits partial information about the goal item, i.e. how similar the guess is to the goal. With this information the goal is more quickly identified.The unordered MIP has been studied by Mehrez and Steinberg (ORSA J. Comput. 7 (1995) 211) in which they proposed two different types of algorithms. The purpose of the present paper is to suggest an improved Spanning Heuristic algorithm. Its improvement increases as the problem size increases. Further results and comparisons are derived for the unordered and ordered cases.This research shows that when the search space is very large, it is better to inquire from items that are known not to be the goal (they have been ruled out by previous guesses), for the purpose of acquiring more information about the goal. As the search space is narrowed, it is better to guess items that have not been ruled out.     

Approach and Positive Affect in Toddlerhood Predict Early Childhood Behavior Problems

The aim of the study was to examine the moderating role of positive affect on the relation between approach behaviors and adjustment outcomes. One hundred eleven toddlers participated in a laboratory assessment of approach and positive affect at 24 months. Behavior problems were reported by a parent in the fall of the child's kindergarten year. Results supported our hypotheses that children who displayed high approach and high positive affect in both non‐threat and low‐threat contexts were rated as higher in externalizing behavior problems. On the other hand, for children showing low positive affect, increases in approach in a moderate‐threat context lowered the risk of developing internalizing behavior problems. Implications for these findings are discussed, including methodological considerations of differences among eliciting contexts and advantages of separating positive affect and approach.