Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.     

Instron texture profile of buffalo milk cheddar cheese as influenced by composition and ripening changes

Buffalo milk Cheddar cheese samples of different ages were analysed for compositional attributes (CA), ripening indices (RI) and Instron Textural Profile (ITP). All samples were compositionally alike, except for pH and salt-in-moisture (SM) contents. RI showed significant variations. CA and RI showed highly significant correlations within themselves and with each other, except for moisture with pH, SM with moisture, MNFS, Fat and FDM and Fat with MNFS. The ITPs of cheeses showed significant variations and had highly significant intercorrelations indicating their interdependence. CA (except moisture and MNFS) and RI showed a highly significant correlationship with ITPs. Moisture content showed a highly significant correlationship with all ITPs, except cohesiveness and springiness, where it was significant. MNFS content showed significant correlations only with hardness and brittleness. Stepwise regression analysis revealed that MI was the most predominant factor influencing cheese texture, followed by pH, SM, FDM and TVFA. Knowing Ca and RI, the textural properties of cheeses can be forecast through mathematical equations. Similarly the age of cheese can also be predicted if RI and/or textural properties are known.     

钛容器的特点

根据钛材的化学、物理、力学和工艺性能介绍了钛容器在设计、制造、检验和应用方面的特点。     

Reliability and performance analysis of time – space – time switching networks with multiple separated space switches

Since electronic switching systems usually require very strict reliability requirements as well as good performance objectives, we need to jointly analyse the performance and reliability of switching systems. In this paper, we compare conventional time–space–time switches with single space switches with those with multiple separated space switches, from the viewpoints of reliability and performance. We consider time–space–time switching networks which consist of N incoming time switches, i.e. one NxN space switch, two (N/2)x(N/2) space switches, and four (N/4)x(N/4) space switches. We introduce a Markov reliability model to study the effect of failures and analyse the reliability and performance of three different types of switching networks in terms of average blocking probability and the mean time to unreliable operation, as we vary the offered traffic. As a result, T–S–T switching networks with multiple separated space switches exhibit better performance and reliability than those with single space switches.     

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.     

Practical method for generation expansion planning based on dynamic programming

This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology.     

Community OR — Five Years of Organised Activities and Beyond

What has become known as Community Operational Research has been around in the UK for many years. The election of Jonathan Rosenhead as President of the UK OR Society in 1986–87 was the catalyst for bringing together and expanding activities which had been carried out largely by individuals working in isolation on a voluntary basis. The following five years have seen the establishment of the Community OR Unit at Northern College, the Centre for Community OR at Hull University and the Community OR Network, which supports the activities of volunteer OR workers across the UK. This paper reviews the range and types of work which have been undertaken by various practitioners. An assessment of the success of community OR is made and a number of issues which have arisen are discussed. Finally, given the diverse nature of community OR, its practice and practitioners, there is some discussion about the future of the area.