Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

逼近严格伪压缩映象不动点的Ishikawa迭代程序

Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…     

Rhythmic pattern formations in gels and Matalon—Packter law: A fresh perspective

The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law, spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems     

Predictive control of periodic-review production inventory systems with deteriorating items

In this paper a predictive control strategy is applied to a periodic-review dynamic inventory system with deteriorating items. Given the current inventory level, we determine the optimal production rates to be implemented at the beginning of each of the following periods over the control horizon. The effectiveness of this approach is the use of future information of the inventory target level and the desired production rate, which are available, along the fixed horizon. The deterioration coefficient may be known or unknown and both cases are considered. In the case where it is unknown, the self-tuning predictive control is applied. The proposed control algorithms are illustrated by simulations.     

Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.