Calculation of derivative of complex modes using classical normal modes

In this paper, a method to calculate derivatives of eigenvectors of damped discrete linear dynamic system with respect to the system parameter is presented. Due to the non-proportional nature of the damping, the eigenvectors become complex, and as a consequence, the derivatives also become complex. The derivatives are calculated using small damping assumption, and the method avoids using the state-space approach. The results are obtained in terms of complex modes and frequencies of the second-order system, which in turn are related to the eigensolutions of the undamped system using perturbation method. Based on the derivatives, an expression for total change of the complex eigenvectors is obtained for a more general case when all the elements of mass, stiffness and damping matrices are varying. Application and accuracy of the derived expressions are demonstrated by considering numerical examples.     

最大化中心模式和微小模式生成对抗网络

为了解决生成对抗网络（GAN）在生成图像时出现的模式崩塌问题,提出了一种最大化中心模式和微小模式损失生成对抗网络（MMMGAN）。首先,将具有相同标签的生成图像的模式定义为中心模式和微小模式,中心模式和微小模式分别代表相似模式的集合和学习完中心模式后可能的模式变化。其次,基于上述的定义提出最大化中心模式和微小模式损失。最后,引入该损失函数,在保证生成图像的分布逼近真实图像的前提下,绝大多数评价指标都得到了改善,提升了生成图像的多样性。拓展性的实验结果表明,提出的最大化中心模式和微小模式损失应用于两种及其以上不同类型任务中,模式崩塌得到了有效缓解。     

Calculation of hyper-geometric modes

We develop an algorithm for calculating hyper-geometric modes of the coherent light field, which represent a solution to the paraxial wave (Schrödinger-type) equation. The propagation of the hyper-geometric modes containing a phase spiral singularity is computer simulated. A comparison is conducted of the exact analytical solution and an approximate solution derived using an integral Kirchhoff propagation operator. A specific feature of the hyper-geometric modes that distinguish them from the familiar paraxial (Gauss, Bessel) modes is that the major radius of the former increases as a square root of the distance passed and the spacing between the adjacent maxima (or minima) in the diffraction pattern decreases with increasing radial coordinate.     

Consensus with dual failure modes

The problem of achieving consensus in a distributed system is discussed. Systems are treated in which either or both of two types of faults may occur: dormant (essentially omission and timing faults) and arbitrary (exhibiting arbitrary behavior, commonly referred to as Byzantine). Previous results showed that are number of dormant faults may be tolerated when there are no arbitrary faults and that, at most, [n-1/3] arbitrary faults may be tolerated when there are no dormant faults (n is the number of processors). A continuum is established between the previous results: an algorithm exists iff n >f_max+2m_max and c >f_max+m_max (where c is the system connectivity), when faults are constrained so that there are at most f_max and at most m_max of these that are arbitrary. An algorithm is given and compared to known algorithms. A method is given to establish virtual links so that the communications graph appears completely connected     

应用集成模式研究

随着信息技术的迅猛发展,各单位都建有各种不同业务和管理信息系统.由于这些信息系统大都没有经过统一规划,造成了"信息孤岛"等问题,于是产生了系统集成的需求,包括对现有主要集成模式的描述,对主要集成模式比较后得出的结论及对应用集成技术主要发展趋势的展望3个部分.     

Algebraic characterization of decentralized fixed modes

An input-output, frequency-domain characterization of decentralized fixed modes is given in this paper, using only standard block-diagram algebra, well-known determinantal expansions and the Binet-Cauchy formula.     

Variable structure systems with sliding modes

Variable structure systems consist of a set of continuous subsystems together with suitable switching logic. Advantageous properties result from changing structures according to this switching logic. Design and analysis for this class of systems are surveyed in this paper.     

Inverse error-diffusion using iterated conditional modes

Error-diffusion (ED) is one conventional halftoning technique that converts a gray-level image into a halftone. For further processing the ED halftones, it is often necessary to estimate the original image from the halftone: the inverse of ED. We propose to calculate iterated conditional modes (ICM) for the maximum a posteriori (MAP) solution of inverse ED. The ICM always searches for a better estimate in the valid image space. It requires only local computation and is applicable to any type of the MRF model used for the original gray-level images. Experimental results for common standard images are given to show that our ICM performs well and is more flexible than the descent-projection (DP) approach.     

Optical modes for BiNem® LCDs

Abstract— We report on theoretical simulations and measurements of the optics of BiNem® displays, taking into account not only the luminance at normal incidence, but contrast ratio and color shift over the viewing hemisphere as well. Transmissive and reflective BiNem® modes were optimized differently, emphasizing contrast in transmission and paperlike, white appearance in reflection.     

Optimal choice of modes for aggregation

In this note a method of system simplification by aggregation is proposed. This method is based on the hypothesis of non-observability of conserved modes on the output error. It leads to a simple combinatorial algorithm of optimization.     

Equivalence of characterizations of fixed modes

In this paper an equivalent property of two matrix rank conditions of a family of matrices is established. This equivalent property is then used to show that two well-known characterizations of fixed modes are mutually derivable from each other when a minor condition is satisfied.     

计算机联网审计组网模式的建立

在对众多被审计单位信息化环境及数据分布特征深入调研的基础上,提出了符合我国联网审计实际的三种新型联网审计组网模式,即集中式、分布式以及点到点式组网模式,并利用集中式海关联网审计组网模式对各组网模式的基本组成要素、需解决的关键问题及技术实现进行了深入阐述。该三种组网模式的构建涵盖了国家审计署审计范围内的大部分审计对象,并为联网审计提供了良好的网络平台。     

Smart utilization of tertiary instructional modes

This empirical research surveys first year tertiary business students across different campuses regarding their perceived views concerning traditional, blended and flexible instructional approaches. A structural equation modeling approach shows traditional instructional modes deliver lower levels of student-perceived learning quality, learning experience and learning skills. A combination of on-line and face-to-face learning approaches, embedded across each course, yields far higher levels of total learning effects, and to explain differences in instructional approaches, a ‘Cone of Learning’ continuum is presented and discussed. Theoretical and practical research implications, and the measurement, theoretical and management aspects of future research options are presented. Tertiary institutions can adopt the approaches herein to assist in the development and build of smart targeted learning solutions – ones more in-line with the perceived needs of their respective student year levels and groups.     

Learning preferences towards computerised competitive modes

Abstract  An online domain-independent competitive gaming system, called JOYCE, was devised to engage students in drill-and-practice exercises. In this paper, theories underpinning the system design are explained. As in the system students are allowed to compete with others in a face-to-face situation, and in network situations where an opponent's identify is revealed or concealed, a preliminary study was conducted to examine students' preferences towards different competition modes and satisfaction towards the learning experience. Results supported JOYCE's incorporation into the learning process and the design and development of the system. Based on the obtained data it was suggested that to increase its intrinsic value and to lessen the negative emotional states which is more easily exhibited in a face-to-face competition situation anonymity is a promising feature to be included in a competitive learning system. Furthermore, various competition modes should be built into e-learning environments to satisfy peoples' different learning mode preferences.     

New modes of OWA information fusion

In this work, we focus on the OWA operator. We view this operator as the inner product of two vectors: a weighting vector containing the weights associated with the aggregation, and a second vector containing the arguments to be aggregated. We note the centrality to this operator of the process used to index the elements in the argument vector, and suggest some new mechanisms for ordering the arguments. In the second part, we study the situation in which the weighting vector is context dependent. Finally, we consider the case in which the arguments to be aggregated are drawn from an ordinal scale; the solution to this problem leads us to consider random weighting vectors. © 1998 John Wiley & Sons, Inc.