A heuristic multi-start decomposition approach for optimal design of serial machining lines

We study an optimal design problem for serial machining lines. Such lines consist of a sequence of stations. At every station, the operations to manufacture a product are grouped into blocks. The operations within each block are performed simultaneously by the same spindle head and the blocks of the same station are executed sequentially. The inclusion and exclusion constraints for combining operations into blocks and stations as well as the precedence constraints on the set of operations are given. The problem is to group the operations into blocks and stations minimizing the total line cost. A feasible solution must respect the given cycle time and all given constraints. In this paper, a heuristic multi-start decomposition approach is proposed. It utilizes a decomposition of the initial problem into several sub-problems on the basis of a heuristic solution. Then each obtained sub-problem is solved by an exact algorithm. This procedure is repeated many times, each time it starts with a new heuristic solution. Computational tests show that the proposed approach outperforms simple heuristic algorithms for large-scale problems.     

直觉模糊集的扩张运算

在 K.Atanassov引进直觉模糊集概念的基础上 ,首先给出乘积的定义和扩张原理 ,并讨论群上的直觉模糊集的并、交等扩张运算 ;其次在两个经典群同态、同构的条件下 ,研究直觉模糊集乘积的扩张运算问题。     

变量有广义界线性规划的直接对偶单纯形法

本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术，建立问题的一个直接对偶单纯形法。分析了方法的性质，给出了初始对偶可行基的计算方法，并用实例说明方法的具体操作。     

Consensus seeking in multi-agent systems via hybrid protocols with impulse delays

This paper studies the consensus problem of multi-agent systems with both fixed and switching topologies. A hybrid consensus protocol is proposed to take into consideration of continuous-time communications among agents and delayed instant information exchanges on a sequence of discrete times. Based on the proposed algorithms, the multi-agent systems with the hybrid consensus protocols are described in the form of impulsive systems or impulsive switching systems. By employing results from matrix theory and algebraic graph theory, some sufficient conditions for the consensus of multi-agent systems with fixed and switching topologies are established, respectively. Our results show that, for small impulse delays, the hybrid consensus protocols can solve the consensus problem if the union of continuous-time and impulsive-time interaction digraphs contains a spanning tree frequently enough. Simulations are provided to demonstrate the effectiveness of the proposed consensus protocols.     

模糊数直觉模糊集运算的模糊结构元表示

在文[4]提出的模糊数直觉模糊集定义的基础上,将文[2]和[7]定义的区间值直觉模糊集运算推广到模糊数直觉模糊集中.利用模糊数的结构元表示方法,得到了模糊数直觉模糊集运算的简便的结构元表示形式,同时给出这些运算的相关性质及证明.     

Fractional commensurate, composition, and adding schemes: Learning trajectories of Jason and Laura: Grade 5

A case study of two 5th-Grade children, Jason and Laura, is presented who participated in the teaching experiment, Children’s Construction of the Rational Numbers of Arithmetic. The case study begins on the 29th of November of their 5th-Grade in school and ends on the 5th of April of the same school year. Two basic problems were of interest in the case study. The first was to provide an analysis of the concepts and operations that are involved in the construction of three fractional schemes: a commensurate fractional scheme, a fractional composition scheme, and a fractional adding scheme. The second was to provide an analysis of the contribution of interactive mathematical activity in the construction of these schemes. The phrase, “commensurate factional scheme” refers to the concepts and operations that are involved in transforming a given fraction into another fraction that are both measures of an identical quantity. Likewise, “fractional composition scheme” refers to the concepts and operations that are involved in finding how much, say, 1/3 of 1/4 of a quantity is of the whole quantity, and “fractional adding scheme” refers to the concepts and operations involved in finding how much, say, 1/3 of a quantity joined to 1/4 of a quantity is of the whole quantity. Critical protocols were abstracted from the teaching episodes with the two children that illustrate what is meant by the schemes, changes in the children’s concepts and operations, and the interactive mathematical activity that was involved. The body of the case study consists of an on-going analysis of the children’s interactive mathematical activity and changes in that activity. The last section of the case study consists of an analysis of the constitutive aspects of the children’s constructive activity, including the role of social interaction and nonverbal interactions of the children with each other and with the computer software we used in teaching the children.     

Quantum protocols for untrusted computations

In this paper, we propose new quantum arithmetic protocols among multiple parties. Let some parties have values. A problem is to find a protocol such that under the condition that any eavesdropper intercepting any quantum system being exchanged among the parties must not be able to acquire information, the parties compute an arithmetic operation such as addition and multiplication, and transfer its computing result to another party. One of main ideas to solve this problem is based on operating state phases. A quantum addition algorithm based on operating phases has been proposed by Draper, but his algorithm was not considered being eavesdropped. We propose secure quantum arithmetic protocols.     

Compile time preparations for run time scheduling in monitors

High level programming language constructs are proposed for scheduling of concurrent operations on a shared variable. Proof rules are given that can be used to check if an adequate scheduling can be prepared from the program text. The basis for the constructs is the condition that must be fulfilled before an operation on a shared variable is performed (the precondition of the operation) and what can be proved to hold when an operation terminates (the postassertion of the operation).     

Rational cubic/quartic Said-Ball conics

In CAGD, the Said-Ball representation for a polynomial curve has two advantages over the Bézier representation, since the degrees of Said-Ball basis are distributed in a step type. One advantage is that the recursive algorithm of Said-Ball curve for evaluating a polynomial curve runs twice as fast as the de Casteljau algorithm of Bézier curve. Another is that the operations of degree elevation and reduction for a polynomial curve in Said-Ball form are simpler and faster than in Bézier form. However, Said-Ball curve can not exactly represent conics which are usually used in aircraft and machine element design. To further extend the utilization of Said-Ball curve, this paper deduces the representation theory of rational cubic and quartic Said-Ball conics, according to the necessary and sufficient conditions for conic representation in rational low degree Bézier form and the transformation formula from Bernstein basis to Said-Ball basis. The results include the judging method for whether a rational quartic Said-Ball curve is a conic section and design method for presenting a given conic section in rational quartic Said-Ball form. Many experimental curves are given for confirming that our approaches are correct and effective.     

A special case of transfer lines balancing by graph approach

A balancing problem for paced production lines with workstations in series and blocks of parallel operations at the workstations is considered. Operations of each workstation are partitioned into blocks. All operations of the same block are performed simultaneously by one spindle head. All blocks of the same workstation are also executed simultaneously. The relations of the necessity of executing some operations at the same workstation, the possibility of combining the blocks at the same workstation as well as precedence constraints are given. The operation time of the workstation is the maximal value among operation times of its blocks. The line cycle time is the maximal workstation time. The problem is to choose blocks from a given set and allocate them to workstations in such a way that (i) all the operations are assigned, (ii) the above constraints are satisfied, (iii) a given cycle time is not exceeded, and (iv) the line cost is minimal. A method for solving the problem is based on its transformation to a constrained shortest path problem.     

关于可拓集合的运算

根据蔡文提出的可拓集合的新定义,给出了可拓集合的包含、并、交、非运算的新定义,并讨论了有关运算性质,进而获得可拓域与稳定域的几个交并运算结果.     

Some problems in the application of statistical dynamics to shells manufactured from fibrous composites

On the basis of a statistical approach presupposing direct utilization of experimental data produced in modelling operations, a procedure is proposed for computational estimates on composite materials in which allowance is made for the initial defects, the variable properties of the material, and the conditions of use (physical medium). Experimental data on Plexiglas shells which confirm the practical applicability of the procedure are given. Questions relating to the design of tests on composite shells are discussed.Translated from Mekhanika Polimerov, No. 4, pp. 743–745, July–August, 1972.     

Strengthening the security of authenticated key exchange against bad randomness

Recent history has revealed that many random number generators (RNGs) used in cryptographic algorithms and protocols were not providing appropriate randomness, either by accident or on purpose. Subsequently, researchers have proposed new algorithms and protocols that are less dependent on the RNG. One exception is that all prominent authenticated key exchange (AKE) protocols are insecure given bad randomness, even when using good long-term keying material. We analyse the security of AKE protocols in the presence of adversaries that can perform attacks based on chosen randomness, i.e., attacks in which the adversary controls the randomness used in protocol sessions. We propose novel stateful protocols, which modify memory shared among a user’s sessions, and show in what sense they are secure against this worst case randomness failure. We develop a stronger security notion for AKE protocols that captures the security that we can achieve under such failures, and prove that our main protocol is correct in this model. Our protocols make substantially weaker assumptions on the RNG than existing protocols.     

播挪运算及其性质

在现有的播挪定义基础上,引入了对偶播挪的概念和任意论域子集族的内并、内交两种新运算,提出了十个定理.它们是：平凡播挪空间定理,最小播挪定理,播挪内运算封闭性定理,播挪任意交定理,播挪上确界定理,播挪运算分配性定理,播挪基判定定理,播挪基闭包定理,播挪基约简定理,播挪基内运算封闭性定理.这些定理对于播挪空间的研究具有一定的理论价值.     

Matrix formulation of vector operations

An efficient technique is developed to simplify the computations in the area of vector analysis. The evaluation of vector algebraic and differential operations becomes more simple and straightforward by simply converting the vector operations into matrix operations. The matrix formulation technique is especially useful when there are mixed coordinate basis involved in the vector operations.     

Expected reliability of communication protocols

We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods $r$ with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from $s$ reaches $r$ when the edges of the network fail independently with probability $1?p$.We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when $p$ is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of $p$. In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain.     

共轭可交换性及其在集合形式单调类定理中的应用

引入了集列的极限运算与二元集运算之间的共轭可交换性的概念,讨论了常见的和重要的集列的极限运算与集代数运算之间所具有的共轭可交换性质,在一般的情形下证明了共轭可交换性是集类的极限运算生成类对集代数运算具有封闭性的一个充分条件,使得集合形式的单调类定理的理论得到了统一的解释,并且证明更简单,思路更清晰,最后还给出了一个新的集合形式的单调类定理.     

Adaptive protocols for parallel discrete event simulation

This paper reviews issues concerning the design of adaptive protocols for parallel discrete event simulation (PDES). The need for adaptive protocols are motivated in the background of the classical synchronisation problem that has driven much of the research in this field. Traditional conservative and optimistic protocols and their hybrid variants—that form the basis of adaptive protocols—are also discussed. Adaptive synchronisation protocols are reviewed with special reference to their characteristics regarding the aspects of the simulation state that influence the adaptive decision and the control parameters used. Finally, adaptive load management strategies and their relationship to the synchronisation protocol are discussed.     

A note on adding and deleting edges in hierarchical log-linear models

The operations of edge addition and deletion for hierarchical log-linear models are defined, and polynomial-time algorithms for the operations are given.     

基于四维表示的模糊数赋权排序及简便加减运算

引进模糊数的四维表示,并据此给出一种新的排序方法,简化了模糊数特别是e-型模糊数的加减运算。