Network-aware heuristics for inter-domain meta-scheduling in Grids

Grid computing generally involves the aggregation of geographically distributed resources in the context of a particular application. As such resources can exist within different administrative domains, requirements on the communication network must also be taken into account when performing meta-scheduling, migration or monitoring of jobs. Similarly, coordinating efficient interaction between different domains should also be considered when performing such meta-scheduling of jobs. A strategy to perform peer-to-peer-inspired meta-scheduling in Grids is presented. This strategy has three main goals: (1) it takes the network characteristics into account when performing meta-scheduling; (2) communication and query referral between domains is considered, so that efficient meta-scheduling can be performed; and (3) the strategy demonstrates scalability, making it suitable for many scientific applications that require resources on a large scale. Simulation results are presented that demonstrate the usefulness of this approach, and it is compared with other proposals from literature.     

Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion

Pathfinding algorithms used in todays computer games consider the path length or a similar criterion as the only measure of optimality. However, these games usually involve opposing parties, whose agents can inflict damage on those of the others. Therefore, the shortest path in such games may not always be the safest one. Consequently, a new suboptimal offline path search algorithm based on the A¹ algorithm was developed, which takes the threat zones in the game map into consideration. Given an upper limit as the tolerable amount of damage for an agent, this algorithm searches for the shortest path from a starting location to a destination, where the agent may suffer damage less than or equal to the specified limit. Due to its behavior, the algorithm is called Limited-Damage A¹ (LDA¹). Performance of LDA¹ was tested in randomly-generated maze-like grid-based environments of varying sizes, and in hand-crafted fully-observable environments, in which 8-way movement is utilized. Results obtained from LDA¹ are compared with those obtained from Multiobjective A¹ (MOA¹), which is a complete and optimal algorithm that yields exact (best) solutions for every case. LDA¹ was found to perform much faster than MOA¹, yielding acceptable sub-optimality in path length.     

Continuous Airborne Communication Relay Approach Using Unmanned Aerial Vehicles

As a result of unmanned aerial vehicles being widely used in different areas, studies about increasing the autonomous capabilities of unmanned aerial vehicles are gaining momentum. Today, unmanned aerial vehicle platforms are especially used in reconnaissance, surveillance and communications areas. In this study, in order to achieve continuous long-range communication relay infrastructure, artificial potential field based path planning of Unmanned Aerial Vehicles is discussed. A novel dynamic approach to relay-chain concept is proposed to maintain the communication between vehicles. Besides dynamically keeping vehicles in range and appropriate position to maintain communication relay, artificial potential field based path planning also provides collision avoidance system. The performance of the proposed system is measured by applying a simulation under the Matlab Simulink and Network Simulator environment. Artificial potential field based flight patterns are generated in Matlab, and performance of the communication between vehicles is measured in Network Simulation environment. Finally the simulation results show that an airborne communication relay can be established autonomously by using artificial potential filed based autonomous path planning approach. Continues state communication is provided by obtaining a resistant communication relay which depends on artificial potential field based positioning algorithm.     

Selective potentiometric determination of uric acid with uricase immobilized on ZnO nanowires

In this study, a potentiometric uric acid biosensor was fabricated by immobilization of uricase onto zinc oxide (ZnO) nanowires. Zinc oxide nanowires with 80-150 nm in diameter and 900 nm to 1.5 μm in lengths were grown on the surface of a gold coated flexible plastic substrate. Uricase was electrostatically immobilized on the surface of well aligned ZnO nanowires resulting in a sensitive, selective, stable and reproducible uric acid biosensor. The potentiometric response of the ZnO sensor vs Ag/AgCl reference electrode was found to be linear over a relatively wide logarithmic concentration range (1-650 μM) suitable for human blood serum. By applying a Nafion^® membrane on the sensor the linear range could be extended to 1-1000 μM at the expense of an increased response time from 6.25 s to less than 9 s. On the other hand the membrane increased the sensor durability considerably. The sensor response was unaffected by normal concentrations of common interferents such as ascorbic acid, glucose, and urea.     

Coordinated discharge of a collection of batteries

Collections of batteries are used to supply energy to a variety of applications. By utilizing the energy in such a collection efficiently, we can improve the lifetime over which energy can be supplied to the application. We say that the discharge of a collection of batteries is coordinated when, at the end of discharge, the difference in the remaining capacity of individual batteries is small. This paper presents a decision-maker based on a goal-seeking formulation that coordinates the discharge of a collection of batteries. This formulation allows us to use a simple battery model and simple decision-making algorithms. We present results from MATLAB simulations that demonstrate the performance of the decision-maker when energy is drawn out of the collection in three different discharge scenarios. The new decision-maker consistently improves the discharge efficiency obtained using scheduling methods. Our results show that when the discharge is coordinated, the lifetime of the collection is extended.     

Computer Simulation of Fe-Al-Si System Diffusion Couples

Diffusion couples, Fe-6.8 wt% Al-1.0 wt% Si/Fe and Fe-6.3 wt% Al-0.9 wt% Si/Fe were constructed and separately annealed at 1050°C for 3 h and at 1000°C for 64 h. The concentration profiles of Fe, Al and Si atoms in these couples were measured by electron probe micro-analysis (EPMA), while the diffusion behavior was also simulated by coupling thermodynamic and kinetic properties of Fe-Al-Si system. The simulation results were in good agreement with the measured concentration profiles showing the validity of dynamic parameters of Fe-Al-Si system. Calculation was made for Fe-7 wt% Al-1 wt% Si/Fe diffusion couples at 1000?C with different diffusion time. Silicon uphill was found under the influence of aluminum.