ABUNDANT LOCALIZED COHERENT STRUCTURES FOR THE (2 1)-DIMENSIONAL LONG DISPERSIVE WAVE SYSTEM

1 .　INTRODUCTIONThoughthesolitonstructuresandpropertiesof(1 1) dimensionalintegrablenonlinearevolutionequationshavebeenunderstoodverywell,thecor responding problomsinhigherspatialdimensionsarestilltobesolved .Sincetheadventof“dromions” ,whichareexponentiallocalizedstruc turesdrivenbyboundaries ,unearthedbyBoitiandhisco workers[1] andFokasandSantini[2 ] ,therehasbeen growinginterestin (2 1) dimensionalnonlinearevolutionequations .Thedromionsolu tionsofavarietyof (2 1) dimension…     

A new approach to the decomposition of boolean functions. 4. non-disjoint decomposition: the method of <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>-partitions

A set-theoretical approach to the non-disjoint decomposition of different forms of representation of Boolean functions of n variables is considered. This approach is based on the method of p,q-partitions of conjuncterms and on the concept of a decomposition clone. Two techniques of searching for some non-disjoint functional decomposition are described. Theorems on the non-disjoint decomposition of full and partial functions and their systems are formulated. The proposed approach is illustrated by examples. Parts I, II, and III of this article are published in No. 5 (2001), No. 1 (2002), and No. 2 (2007). Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 15-41, May–June 2009.     

The Capture Analysis of Constant Modulus Approach for Blind Multiuser Detection

This paper analyzes the lock/capture behavior of constant modulus approach (CMA) for blind multiuser detection. Conditions under which CMA locks on the desired signal and when it captures the interferer are derived.     

Has behaviour modification lost its identity?

This paper considers the current identity for behaviour modification from a recent historical perspective. An examination is made of the identity changes occurring during the evolution of behaviour modification from academic operant psychology to a treatment approach concerned with socially important behaviours. It is pointed out that changes taking place over this time period have resulted in a lack of clarity concerning what behaviour modification is, and that several possible resolutions for this lack of clarity could occur. Recommendations are made for an identity characterized by the application of experimental analysis to treatment endeavors based upon a wide range of theoretical constructs, rather than to treatment based solely upon a conditioning model. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

滑坡灾害分析中的智能优化方法

滑坡是仅次于地震和洪水的一种严重的地质灾害,也是水利水电工程建设中面临的一个重要风险。滑坡分析最困难的问题在于临界滑动面的搜索,智能优化算法在解决此类问题时有着独特的优势。遗传算法、人工神经网络及蚁群算法在边坡稳定分析中的应用都有其各自的优缺点,今后研究的方向应该是将不同的智能优化方法结合起来,以充分发挥各自的优势。     

REACTIVITY RATIO ESTIMATION IN COPOLYMERIZATION: A NEW ANALYSIS OF UNRESOLVED CONFLICTS

Using a stochastic approach, a fresh analysis has been provided to resolve the possible causes of the existing conflicts in the reactivity ratio estimation in copolymerization systems. The analysis provides some new clues regarding the inadequacy of a transient system (batch reactor) and suggests the use of a steady state operation (CSTR) as a more reliable method.     

并联型工业机器人的运动弹性动力学研究

从关联型机器人的通有模型出发，引入力域内的雅可比矩阵，将中央平台之后开链部分的质量和惯性计入模型，推导出完整形式的动力学模型，建立了基于弹性理论和有限元分析的运动弹性动力学方程，并以天府－Ｉ型点焊机械手为例进行了ＫＥＤ分析，编制了相应的软件，在建模时还采用了计算机符号－数据处理技术。     

Parallel simulation on the hypercube multiprocessor

Summary This paper focuses upon a particular conservative algorithm for parallel simulation, the Time of Next Event (TNE) suite of algorithms [13]. TNE relies upon a shortest path algorithm which is independently executed on each processor in order to unblock LPs in the processor and to increase the parallelism of the simulation. TNE differs fundamentally from other conservative approaches in that it takes advantage of having several LPs assigned to each processor, and does not rely upon message passing to provide lookahead. Instead, it relies upon a shortest path algorithm executed independently in each processor. A deadlock resolution algorithm is employed for interprocessor deadlocks. We describe an empirical investigation of the performance of TNE on the iPSC/i860 hypercube multiprocessor. Several factors which play an important role in TNE's behavior are identified, and the speedup relative to a fast uniprocessor-based event list algorithm is reported. Our results indicate that TNE yields good speedups and out-performs an optimized version of the Chandy&Misra-null message (CMB) algorithm. TNE was 2–5 times as fast as the CM approach for less than 10 processors (and 1.5–3 times as fast when more than 10 processors were used for the same population of processes.) Azzedine Boukerche received the State Engineer degree in Software Engineering from Oran University, Oran, Algeria, and the M.Sc. degree in Computer Science from McGill University, Montreal, Canada. He is a Ph.D. candidate at the School of Computer Science, McGill University. During 1991–1992, he was a visiting doctoral student at the California Institute of Technology. He is employed as a Faculty Lecturer of computer Science at McGill University since 1993. His research interests include parallel simulation, distributed algorithms, and system performance analysis. He is a student member of the IEEE and ACM. Carl Tropper is an Associate Professor of Computer Science at McGill University. His primary area of research is parallel discrete event simulation. His general area of interest is in parallel computing and distributed algorithms in particular. Previously, he has done research in the performance modeling of computer networks, having written a book,Local Computer Network Technologies, while active in the area. Before coming to university life, he worked for the BBN Corporation and the Mitre Corporation, both located in the Boston area. He spent the 1991–92 academic year on a sabbatical leave at the Jet Propulsion Laboratories of the California Institute of Technology where he contributed to a project centered about the verification of flight control software. As part of this project he developed algorithms for the parallel simulation of communicating finite state machines. During winters he may be found hurtling down mountains on skis.This work has been completed while the author was a visiting doctoral student at the California Institute of TechnologyWas on sabbatical leave at the Jet Propulsion laboratories, California Institute of Technology     

A combined nonparametric approach to feature selection and binary decision tree design

An efficient procedure which integrates feature selection and binary decision tree construction is presented. The nonparametric approach is based on the Kolmogorov-Smirnov criterion which yields an optimal classification decision at each node. By combining the feature selection with the design of the classifier, only the most informative features are retained for classification.     

A dissonance theory approach to defensive projection.

It was hypothesized that cognitive dissonance involving the self-concept leads to the use of projection to reduce the dissonance. Ss were given personality tests, and instead of true results received falisified data indicating favorable or unfavorable personality traits—thereby raising or lowering their self-esteem. In the presence of another S, Ss were shown pictures of men and were told this would be an indicator of their latent homosexuality; GSRs were supported to reflect their degree of anxiety. Ss were asked to estimate the reaction of the other S; Ss with high self-esteem tended to attribute a greater degree of responsiveness of the other S to the pictures. The relationship of psychoanalytic and dissonance theory is discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)