Application of piece‐wise linear weight functions for 2D 8‐node quadrilateral element in contact problems

The present study is a continuation of our previous work with the aim to reduce problems caused by standard higher order elements in contact problems. The difficulties can be attributed to the inherent property of the Galerkin method which gives uneven distributions of nodal forces resulting in oscillating contact pressures. The proposed remedy is use of piece‐wise linear weight functions. The methods to establish stiffness and/or mass matrix for 8‐node quadrilateral element in 2D are presented, i.e. the condensing and direct procedures. The energy and nodal displacement error norms are also checked to establish the convergence ratio. Interpretation of calculated contact pressures is discussed. Two new 2D 8‐node quadrilateral elements, QUAD8C and QUAD8D, are derived and tested in many examples, which show their good performance in contact problems. Copyright © 2004 John Wiley & Sons, Ltd.     

会计政策选择的效率性分析

会计政策选择类型在理论上大体可分为机会主义型和效率(或有效契约)型。会计政策选择具有效率性,但也为经理人员的机会主义行为打开了大门。在我国,由于企业缺乏一系列有效的激励约束机制,会计政策选择的机会主义仍然严重。为此,必须建立适合我国企业有效的激励约束机制。     

Singular Trajectories in Multi-Input Time-Optimal Problems: Application to Controlled Mechanical Systems

This paper deals with the time-optimal control problem for a class of control systems which includes controlled mechanical systems with possible dissipation terms. The Lie algebras associated with such mechanical systems have certain special properties. These properties are explored and used in conjunction with the Pontryagin maximum principle to determine the structure of singular extremals and, in particular, time-optimal trajectories. The theory is illustrated by an application to a time-optimal problem for a class of underwater vehicles.     

Maximally efficient dialogue mode algorithm

Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized.     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

Testing of multi-output circuits by means of signature analyzer

Let a circuit havem outputs,m>1. There are two ways to test this circuit by means of a signature analyzer: use a single input analyzer for each output or use anm-input analyzer to test all outputs simultaneously. The main goal of this letter is to demonstrate that for fault output sequences with small multiplicity of errors and long length the second approach is more effective.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

浅谈程序设计中一题多解的教学方法

中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。     

Gorillas (Gorilla gorilla) and Orangutans (Pongo pygmaeus) Encode Relevant Problem Features in a Tool-Using Task.

Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved)