On the short-range order in Al-Mn quasicrystals during low-temperature ageing

We report the evolution of diffuse intensity during the low-temperature ageing of Al-Mn quasicrystals. This is taken as evidence of short-range order in the icosahedral phase prior to its decomposition. The implication of these diffuse intensities is discussed.

Ant Colony Optimization Algorithms for Shortest Path Problems

We propose four variants of recently proposed multi-timescale algorithm in [1] for ant colony optimization and study their application on a multi-stage shortest path problem. We study the performance of the various algorithms in this framework. We observe, that one of the variants consistently outperforms the algorithm [1].

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

Dependence of low-lying energy eigenvalues on the short- and long-range parts of confining potentials

The potential description of a quark-antiquark system seems to work very well in describing a number of hadronic properties. However, the precise form of the potential is unknown. The changes in the low-lying eigenvalues as a result of changes in the long-range part of the potential are investigated in a non-perturbative manner. It is shown by considering a variety of examples that the low-lying eigenvalues are insensitive to the long-range part of the potential.

Fast Public Key Cryptosystem Based On Matrix Rings

A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.

Short-term nutritional supplementation during management of pulmonary exacerbations in cystic fibosis: A controlled study, including effects of protein turnover

Effects of nutritional supplements on minimizing weight loss and abnormalities of protein turnover during pulmonary exacerbations in cystic fibrosis (CF) were studied by controlled trial. Patients received pulmonary therapy and either standard diet (n = 10) or adjunctive enteral supplements (n = 12). Initial protein turnover, measured by [15N]glycine kinetics, showed alterations of protein synthesis (P Syn) and catabolism (P Cat), which correlated with the degree of underweight, and negligible net protein deposition (P Dep). With treatment both groups had significant increases in mean body weight and forced expiratory volume in 1 s, expressed as percent predicted value for height (FEV1) by 3 wk, but a significant correlation between initial underweight and subsequent weight gain was observed only in supplemented patients. Mean P Syn and P Dep increased significantly (p < 0.001) only in the supplemented group. Pulmonary exacerbations in CF have important adverse effects on body-protein metabolism, similar to changes in protein-energy malnutrition and infection. These effects are reversed by short-term nutritional support. Strategic nutritional intervention should thus be considered in management, especially in malnourished patients.

SHAMP: An experimental shared memory multimicroprocessor system for performance evaluation of parallel algorithms

In this paper, the design and implementation of a single shared bus, shared memory multiprocessing system using Intel's single board computers is presented. The hardware configuration and the operating system developed to execute the parallel algorithms are discussed. The performance evaluation studies carried out on Image are outlined.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

Resistivity Maxima in Lithium Fast-Ion Conductors at High Pressure

The resistivity of two types of lithium fast-ion conductors, Li16-2xZnx(GeO4)4 (x=1,2) and Li3+xGexV1-xO4 (x=0.25,0.6,0.72), showed pronounced maxima as a function of pressure. For the first type, ln(ρ / ρ0) peaked at values of 0.12 (x=1) and 0.35 (x=2) near 20 kbar and decreased thereafter up to 80 kbar. Thermal activation energies and prefactors also showed corresponding maxima. For the second type, ln(ρ / ρ0) increased to 3-4 between 20 and 32 kbar. Near 80 kbar, ρ decreased (for x=0.25) by a factor of 250. The results are interpreted in terms of negative activation volumes.

Exploring profit - Sustainability trade-offs in cropping systems using evolutionary algorithms

Models that implement the bio-physical components of agro-ecosystems are ideally suited for exploring sustainability issues in cropping systems. Sustainability may be represented as a number of objectives to be maximised or minimised. However, the full decision space of these objectives is usually very large and simplifications are necessary to safeguard computational feasibility. Different optimisation approaches have been proposed in the literature, usually based on mathematical programming techniques. Here, we present a search approach based on a multiobjective evaluation technique within an evolutionary algorithm (EA), linked to the APSIM cropping systems model. A simple case study addressing crop choice and sowing rules in North-East Australian cropping systems is used to illustrate the methodology. Sustainability of these systems is evaluated in terms of economic performance and resource use. Due to the limited size of this sample problem, the quality of the EA optimisation can be assessed by comparison to the full problem domain. Results demonstrate that the EA procedure, parameterised with generic parameters from the literature, converges to a useable solution set within a reasonable amount of time. Frontier ‘‘peels’’ or Pareto-optimal solutions as described by the multiobjective evaluation procedure provide useful information for discussion on trade-offs between conflicting objectives.

Hybrid constant factor incremental delta modulators

The paper presents a new adaptive delta modulator, called the hybrid constant factor incremental delta modulator (HCFIDM), which uses instantaneous as well as syllabic adaptation of the step size. Three instantaneous algorithms have been used: two new instantaneous algorithms (CFIDM-3 and CFIDM-2) and the third, Song's voice ADM (SVADM). The quantisers have been simulated on a digital computer and their performances studied. The figure of merit used is the SNR with correlated, /?C-shaped Gaussian signals and real speech as the input. The results indicate that the hybrid technique is superior to the nonhybrid adaptive quantisers. Also, the two new instantaneous algorithms developed have improved SNR and fast response to step inputs as compared to the earlier systems.

Short-term responses of leaf growth rate to water deficit scale up to whole-plant and crop levels: An integrated modelling approach in maize.

Physiological and genetic studies of leaf growth often focus on short-term responses, leaving a gap to whole-plant models that predict biomass accumulation, transpiration and yield at crop scale. To bridge this gap, we developed a model that combines an existing model of leaf 6 expansion in response to short-term environmental variations with a model coordinating the development of all leaves of a plant. The latter was based on: (1) rates of leaf initiation, appearance and end of elongation measured in field experiments; and (2) the hypothesis of an independence of the growth between leaves. The resulting whole-plant leaf model was integrated into the generic crop model APSIM which provided dynamic feedback of environmental conditions to the leaf model and allowed simulation of crop growth at canopy level. The model was tested in 12 field situations with contrasting temperature, evaporative demand and soil water status. In observed and simulated data, high evaporative demand reduced leaf area at the whole-plant level, and short water deficits affected only leaves developing during the stress, either visible or still hidden in the whorl. The model adequately simulated whole-plant profiles of leaf area with a single set of parameters that applied to the same hybrid in all experiments. It was also suitable to predict biomass accumulation and yield of a similar hybrid grown in different conditions. This model extends to field conditions existing knowledge of the environmental controls of leaf elongation, and can be used to simulate how their genetic controls flow through to yield.

Bysanttilaisten ja Akhaian ruhtinaskunnan väliset sotatoimet vuosina 1259-83 : Tapaustutkimus myöhäis-bysanttilaisesta sodankäynnistä

In my master thesis I analyse Byzantine warfare in the late period of the empire. I use military operations between Byzantines and crusader Principality of Achaia (1259–83) as a case study. Byzantine strategy was based (in “oriental manner”) on using ambushes, diplomacy, surprise attacks, deception etc. Open field battles that were risky in comparison with their benefits were usually avoided, but the Byzantines were sometimes forced to seek open encounter because their limited ability to keep strong armies in field for long periods of time. Foreign mercenaries had important place in Byzantine armies and they could simply change sides if their paymasters ran out of resources. The use of mercenaries with short contracts made it possible that the composition of an army was flexible but on the other hand heterogeneous – in result Byzantine armies were sometimes ineffective and prone to confusion. In open field battles Byzantines used formation that was made out from several lines placed one after another. This formation was especially suitable for cavalry battles. Byzantines might have also used other kinds of formations. The Byzantines were not considered equal to Latins in close combat. West-Europeans saw mainly horse archers and Latin mercenaries on Byzantine service as threats to themselves in battle. The legitimacy of rulers surrounding the Aegean sea was weak and in many cases political intrigues and personal relationships can have resolved the battles. Especially in sieges the loyalty of population was decisive. In sieges the Byzantines used plenty of siege machines and archers. This made fast conquests possible, but it was expensive. The Byzantines protected their frontiers by building castles. Military operations against the Principality of Achaia were mostly small scale raids following an intensive beginning. Byzantine raids were mostly made by privateers and mountaineers. This does not fit to the traditional picture that warfare belonged to the imperial professional army. It’s unlikely that military operations in war against the Principality of Achaia caused great demographic or economic catastrophe and some regions in the warzone might even have flourished. On the other hand people started to concentrate into villages which (with growing risks for trade) probably caused disturbance in economic development and in result birth rates might have decreased. Both sides of war sought to exchange their prisoners of war. These were treated according to conventional manners that were accepted by both sides. It was possible to sell prisoners, especially women and children, to slavery, but the scale of this trade does not seem to be great in military operations treated in this theses.