具有某种特性的向量优化问题的解的刻画

在有限维空间中,当目标函数凸下半连续时,向量优化问题一定有弱有效解,并且解集是紧的,但当目标函数非凸时,这不一定成立,文章讨论了把目标函数的凸性减弱之后,向量优化问题的解集是非空并且紧的,另外还得到一些等价的刻画。     

从Zygmund空间到Bloch-type空间的加权复合算子

令φ,u分别是复平面C上的单位开圆盘D中的解析自映射和解析函数.加权复合算子定义为（uCφ）（f）（z）=u（z）f（φ（z））,z∈D,f∈H（D）.主要讨论了从Zygmund空间到Bloch-type空间的加权复合算子的有界性和紧性.     

基于压实度保证率的砾石土压实度快速检测法优化

砾石土心墙料压实度指标是砾石土心墙大坝工程质量控制的一个关键指标,常借助核子密度仪进行快速检测。鉴于砾石土的非均质特性,常规方法利用最大干密度均值求取的压实度为近似值,当实际最大干密度大于最大干密度均值时,压实度计算值偏大,易引起误判,影响工程质量。提出了压实度保证率概念,通过压实度及压实度保证率双控指标,对常规方法进行优化,明确了优化方法的评定流程及判定准则。并结合两河口水电站工程实例,论证了常规方法仅为优化方法的一种特殊表现形式。通过两河口水电站工程2019年3月份实测数据对比分析发现：采用常规方法检测的压实度均一次检验合格,而采用优化方法检测时,存在个别不合格点,需进一步复测。优化方法较常规方法更为严格,提高了工程安全裕度,保障了工程质量。     

软土地区旧桩拔除技术和新建桩基础调整方案及施工措施

结合天津南开区某地块定向经济适用房项目,介绍其在基础施工中遇到旧预制方桩时,采用全套管高压喷气、射水振动沉管施工工艺清孔拔桩,并对该工艺进行分析得出:该拔桩施工工艺适用于软土地区旧桩拔除项目;并针对旧桩孔无法回填压实、部分新建桩基础与拔除旧桩孔距离较近等原因导致钻孔倾斜、串孔等问题,提出远离旧桩位置或调整至旧桩桩心位置等方法调整桩位,并采用加大桩径、增设承台等调整方案承担因调整桩位而产生的上部偏心荷载;采用拌和白灰、分层压实、回填静置等措施提高回填土的密实度,采用保证垂直度和调节泥浆配合比等措施,以改善不良施工条件,得出适当增加混凝土充盈系数保证成桩质量等施工经验,为后续类似工程提供借鉴。     

Target point‐based path‐following controller for a car‐type vehicle using bounded controls

In this paper, we have studied the control problem of target point‐based path following for car‐type vehicles. This special path‐following task arises from the needs of vision‐based guidance systems, where a given target point located ahead of the vehicle, in the visual range of the camera, must follow a specified path. A solution to this problem is developed through a nonlinear transformation of the path‐following problem into a reference trajectory tracking problem, by modeling the target point as a virtual vehicle. The use of target point complicates the control problem, as the development produces a first‐order nonlinear nonglobally Lipschitz differential equation with finite escape time. This problem is solved by using small control signals. Bounded feedback laws are designed to control the real vehicle's angular acceleration and the virtual vehicle's velocity, to achieve stability. The resulting controller is globally asymptotically stable with respect to the origin, the proof of which is derived from Lyapunov‐based arguments and a bootstrap argument. It is also shown that the use of exponentially convergent observers/differentiators does not affect the stability of the closed‐loop system. The effectiveness of this controller has been illustrated through simulations. Copyright © 2014 John Wiley & Sons, Ltd.     

A unique property of single-link distance and its application in data clustering

We prove a unique property of single-link distance, based on which an algorithm is designed for data clustering. The property states that a single-link cluster is a subset with inter-subset distance greater than intra-subset distance, and vice versa. Among the major linkages (single, complete, average, centroid, median, and Ward's), only single-link distance has this property. Based on this property we introduce monotonic sequences of iclusters (i.e., single-link clusters) to model the phenomenon that a natural cluster has a dense kernel and the density decreases as we move from the kernel to the boundary. A monotonic sequence of iclusters is a sequence of nested iclusters such that an icluster in the sequence is a dominant child (in terms of size) of the icluster before it. Our data clustering algorithm is monotonic sequence based. We classify a dataset of one monotonic sequence into to two classes by splitting the sequence into two parts: the kernel part and the surrounding part. For a data set of multiple monotonic sequences, each leaf monotonic sequence represents the kernel of a class, which then “grows” by absorbing nearby non-kernel points. This algorithm, proved by experiments, compares favorable in effectiveness to other clustering algorithms.     

Partition arguments in multiparty communication complexity

Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x₁,…,x_k∈{0,1}ⁿ communicate to compute the value f(x₁,…,x_k) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem.In this paper, we study the power of partition arguments. Our two main results are very different in nature:

(i)

For randomized communication complexity, we show that partition arguments may yield bounds that are exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is Ω(n), while partition arguments can only yield an Ω(logn) lower bound. The same holds for nondeterministiccommunication complexity.

(ii)

For deterministic communication complexity, we prove that finding significant gaps between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on a generalized version of the “log-rank conjecture” in communication complexity. We also observe that, in the case of computing relations (search problems), very large gaps do exist.

We conclude with two results on the multiparty “fooling set technique”, another method for obtaining communication complexity lower bounds.     

Worker control: A reply to Ronan.

Argues that W. W. Ronan (1980) presents a one-sided picture of "work force control" by the "entrepreneur–capitalist–management group" and discredits the contributions of many psychologists to workers' well-being. Ronan's contentions that (1) psychological concepts are applied to programs that are motivated by management's desire to avoid unionization, (2) psychological experiments and interventions are unilaterally imposed on workers by management, and (3) economic benefits of psychological interventions should be shared equally with workers are discussed. It is concluded that psychologists have every reason to be proud of their colleagues' contributions to making companies more profitable while improving the work environment for employees. (1 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

SPS原位反应快速制备WC-6Co硬质合金的研究

应用放电等离子烧结（SPS）技术，利用WO3、Co3O4和C粉的混合粉末原位还原、化合反应快速制备WC6Co硬质合金。分析了烧结温度与压力对合金致密度、显微组织和性能的影响．结果表明：应用SPS技术，利用原位反应合成的短流程工艺路线，在烧结温度与压力分别为1270℃和90MIa的条件下能够快速制备出相对密度达99％、洛氏硬度（HRA）≥93、维氏硬度（HV）≥1900且成相良好、显微组织均匀的WC-Co硬质合金。