Evaluation of the Plant–Craig stochastic convection scheme (v2.0) in the ensemble forecasting system MOGREPS-R (24 km) based on the Unified Model (v7.3)

The Plant–Craig stochastic convection parameterization (version 2.0) is implemented in the Met Office Regional Ensemble Prediction System (MOGREPS-R) and is assessed in comparison with the standard convection scheme with a simple stochastic scheme only, from random parameter variation. A set of 34 ensemble forecasts, each with 24 members, is considered, over the month of July 2009. Deterministic and probabilistic measures of the precipitation forecasts are assessed. The Plant–Craig parameterization is found to improve probabilistic forecast measures, particularly the results for lower precipitation thresholds. The impact on deterministic forecasts at the grid scale is neutral, although the Plant–Craig scheme does deliver improvements when forecasts are made over larger areas. The improvements found are greater in conditions of relatively weak synoptic forcing, for which convective precipitation is likely to be less predictable.

Cross layer based protocols for energy aware and critical data delivery related applications using wireless sensor networks

Wireless Sensor Networks (WSNs) have been an exciting topic in recent years. The services offered by a WSN can be classified into three major categories: monitoring, alerting, and information on demand. WSNs have been used for a variety of applications related to the environment (agriculture, water and forest fire detection), the military, buildings, health (elderly people and home monitoring), disaster relief, and area or industrial monitoring. In most WSNs tasks like processing the sensed data, making decisions and generating emergency messages are carried out by a remote server, hence the need for efficient means of transferring data across the network. Because of the range of applications and types of WSN there is a need for different kinds of MAC and routing protocols in order to guarantee delivery of data from the source nodes to the server (or sink). In order to minimize energy consumption and increase performance in areas such as reliability of data delivery, extensive research has been conducted and documented in the literature on designing energy efficient protocols for each individual layer. The most common way to conserve energy in WSNs involves using the MAC layer to put the transceiver and the processor of the sensor node into a low power, sleep state when they are not being used. Hence the energy wasted due to collisions, overhearing and idle listening is reduced. As a result of this strategy for saving energy, the routing protocols need new solutions that take into account the sleep state of some nodes, and which also enable the lifetime of the entire network to be increased by distributing energy usage between nodes over time. This could mean that a combined MAC and routing protocol could significantly improve WSNs because the interaction between the MAC and network layers lets nodes be active at the same time in order to deal with data transmission. In the research presented in this thesis, a cross-layer protocol based on MAC and routing protocols was designed in order to improve the capability of WSNs for a range of different applications. Simulation results, based on a range of realistic scenarios, show that these new protocols improve WSNs by reducing their energy consumption as well as enabling them to support mobile nodes, where necessary. A number of conference and journal papers have been published to disseminate these results for a range of applications.

Histological Outcomes on the Development of New Space-making Devices for Maxillary Sinus Floor Augmentation

Background: Previous studies have pointed out that the mere elevation of the maxillary sinus membrane promotes bone formation without the use of augmentation materials. Purpose: This experimental study aimed at evaluating if the two-stage procedure for sinus floor augmentation could benefit from the use of a space-making device in order to increase the bone volume to enable later implant installation with good primary stability. Materials and Methods: Six male tufted capuchin primates (Cebus apella) were subjected to extraction of the three premolars and the first molar on both sides of the maxilla to create an edentulous area. The sinuses were opened using the lateral bone-wall window technique, and the membrane was elevated. One resorbable space-making device was inserted in each maxillary sinus, and the bone window was returned in place. The animals were euthanatized after 6 months, and biopsy blocks containing the whole maxillary sinus and surrounding soft tissues were prepared for ground sections. Results: The histological examination of the specimens showed bone formation in contact with both the schneiderian membrane and the device in most cases even when the device was displaced. The process of bone formation indicates that this technique is potentially useful for two-stage sinus floor augmentation. The lack of stabilization of the device within the sinus demands further improvement of space-makers for predictable bone augmentation. Conclusions: It is concluded that (1) the device used in this study did not trigger any important inflammatory reaction; (2) when the sinus membrane was elevated, bone formation was a constant finding; and (3) an ideal space-making device should be stable and elevate the membrane to ensure a maintained connection between the membrane and the secluded space.

A Clinical Study of 406 Sinus Augmentations With 100% Anorganic Bovine Bone

Background: The aim of the present study is to evaluate the use of anorganic bovine bone (ABB) associated with a collagen membrane (CM) for a sinus graft by means of clinical, histologic, and radiographic parameters in cases with bone availability <= 7 mm. A preliminary evaluation consisted of a clinical examination, computed tomography (CT), and a panoramic x-ray. Methods: Ninety-two patients requiring bilateral sinus grafts and 222 requiring unilateral procedures (total: 406 sinuses) participated in this study. A total of 1,025 implants were placed in the grafted sinuses. A total of 118 implants were placed simultaneously with the sinus graft (one stage), and 907 implants were placed in a subsequent surgery (two stages), 6 to 12 months after the graft was performed. In seven cases, a biopsy was harvested for histomorphometric analysis. Recall appointments were scheduled every 6 months, and panoramic and periapical x-rays were required every year for 3 years. Results: Among 1,025 implants, 19 were lost (survival rate: 98.1%). The difference in survival rates for implants placed in native bone: <= 3 mm (98.1%), >3 to <= 5 mm (98.6%), and >5 to <= 7 mm (97.0%) was not statistically significant (P = 0.3408). The survival rates for implants with rough and machined surfaces (98.6% and 97.0%, respectively) were not statistically significant (P = 0.0840). The histomorphometric analysis showed new bone formation (39.0% +/- 12%), marrow space (52.9% +/- 9.3%), and residual ABB (8% +/- 2.7%). Conclusion: Our results indicated that 1,025 implants placed in sinuses grafted exclusively with ABB combined with CM led to an excellent and predictable survival rate of 98.1%. J Periodontol 2009;80:1920-1927.

The nested assembly of individual-resource networks

P>1. Much of the current understanding of ecological systems is based on theory that does not explicitly take into account individual variation within natural populations. However, individuals may show substantial variation in resource use. This variation in turn may be translated into topological properties of networks that depict interactions among individuals and the food resources they consume (individual-resource networks). 2. Different models derived from optimal diet theory (ODT) predict highly distinct patterns of trophic interactions at the individual level that should translate into distinct network topologies. As a consequence, individual-resource networks can be useful tools in revealing the incidence of different patterns of resource use by individuals and suggesting their mechanistic basis. 3. In the present study, using data from several dietary studies, we assembled individual-resource networks of 10 vertebrate species, previously reported to show interindividual diet variation, and used a network-based approach to investigate their structure. 4. We found significant nestedness, but no modularity, in all empirical networks, indicating that (i) these populations are composed of both opportunistic and selective individuals and (ii) the diets of the latter are ordered as predictable subsets of the diets of the more opportunistic individuals. 5. Nested patterns are a common feature of species networks, and our results extend its generality to trophic interactions at the individual level. This pattern is consistent with a recently proposed ODT model, in which individuals show similar rank preferences but differ in their acceptance rate for alternative resources. Our findings therefore suggest a common mechanism underlying interindividual variation in resource use in disparate taxa.

Intrinsically Multivariate Predictive Genes

Canalizing genes possess such broad regulatory power, and their action sweeps across a such a wide swath of processes that the full set of affected genes are not highly correlated under normal conditions. When not active, the controlling gene will not be predictable to any significant degree by its subject genes, either alone or in groups, since their behavior will be highly varied relative to the inactive controlling gene. When the controlling gene is active, its behavior is not well predicted by any one of its targets, but can be very well predicted by groups of genes under its control. To investigate this question, we introduce in this paper the concept of intrinsically multivariate predictive (IMP) genes, and present a mathematical study of IMP in the context of binary genes with respect to the coefficient of determination (CoD), which measures the predictive power of a set of genes with respect to a target gene. A set of predictor genes is said to be IMP for a target gene if all properly contained subsets of the predictor set are bad predictors of the target but the full predictor set predicts the target with great accuracy. We show that logic of prediction, predictive power, covariance between predictors, and the entropy of the joint probability distribution of the predictors jointly affect the appearance of IMP genes. In particular, we show that high-predictive power, small covariance among predictors, a large entropy of the joint probability distribution of predictors, and certain logics, such as XOR in the 2-predictor case, are factors that favor the appearance of IMP. The IMP concept is applied to characterize the behavior of the gene DUSP1, which exhibits control over a central, process-integrating signaling pathway, thereby providing preliminary evidence that IMP can be used as a criterion for discovery of canalizing genes.

FROM TRISECTIONS IN MODULE CATEGORIES TO QUASI-DIRECTED COMPONENTS

In this paper, we define and study a special type of trisections in a module category, namely the compact trisections which characterize quasi-directed components. We apply this notion to the study of laura algebras and we use it to define a class of algebras with predictable Auslander-Reiten components.

Electrocombustion of humic acid and removal of algae from aqueous solutions

This paper reports experiments involving the electrochemical combustion of humic acid (HA) and removal of algae from pond water. An electrochemical flow reactor with a boron-doped diamond film anode was used and constant current experiments were conducted in batch recirculation mode. The mass transfer characteristics of the electrochemical device were determined by voltammetric experiments in the potential region of water stability, followed by a controlled current experiment in the potential region of oxygen evolution. The average mass transfer coefficient was 5.2 x 10(-5) m s(-1). The pond water was then processed to remove HA and algae in the conditions in which the reaction combustion occurred under mass transfer control. To this end, the mass transfer coefficient was used to estimate the initial limiting current density applied in the electrolytic experiments. As expected, all the parameters analyzed here-solution absorbance at 270 nm, total phenol concentration and total organic carbon concentration-decayed according to first-order kinetics. Since the diamond film anode successfully incinerated organic matter, the electrochemical system proved to be predictable and programmable.

Analysis and Evaluation of EndpointSecurity Solutions

The main objective for this degree project was to analyze the Endpoint Security Solutions developed by Cisco, Microsoft and a third minor company solution represented by InfoExpress. The different solutions proposed are Cisco Network Admission Control, Microsoft Network Access Protection and InfoExpress CyberGatekeeper. An explanation of each solution functioning is proposed as well as an analysis of the differences between those solutions. This thesis work also proposes a tutorial for the installation of Cisco Network Admission Control for an easier implementation. The research was done by reading articles on the internet and by experimenting the Cisco Network Admission Control solution. My background knowledge about Cisco routing and ACL was also used. Based on the actual analysis done in this thesis, a conclusion was drawn that all existing solutions are not yet ready for large-scale use in corporate networks. Moreover all solutions are proprietary and incompatible. The future possible standard for Endpoint solution might be driven by Cisco and Microsoft and a rude competition begins between those two giants.

QoS evaluation of bandwidth schedulersin IPTV networks offered SRD fluidvideo traffic: a simulation study

IPTV is now offered by several operators in Europe, US and Asia using broadcast video over private IP networks that are isolated from Internet. IPTV services rely ontransmission of live (real-time) video and/or stored video. Video on Demand (VoD)and Time-shifted TV are implemented by IP unicast and Broadcast TV (BTV) and Near video on demand are implemented by IP multicast. IPTV services require QoS guarantees and can tolerate no more than 10-6 packet loss probability, 200 ms delay, and 50 ms jitter. Low delay is essential for satisfactory trick mode performance(pause, resume,fast forward) for VoD, and fast channel change time for BTV. Internet Traffic Engineering (TE) is defined in RFC 3272 and involves both capacity management and traffic management. Capacity management includes capacityplanning, routing control, and resource management. Traffic management includes (1)nodal traffic control functions such as traffic conditioning, queue management, scheduling, and (2) other functions that regulate traffic flow through the network orthat arbitrate access to network resources. An IPTV network architecture includes multiple networks (core network, metronetwork, access network and home network) that connects devices (super head-end, video hub office, video serving office, home gateway, set-top box). Each IP router in the core and metro networks implements some queueing and packet scheduling mechanism at the output link controller. Popular schedulers in IP networks include Priority Queueing (PQ), Class-Based Weighted Fair Queueing (CBWFQ), and Low Latency Queueing (LLQ) which combines PQ and CBWFQ.The thesis analyzes several Packet Scheduling algorithms that can optimize the tradeoff between system capacity and end user performance for the traffic classes. Before in the simulator FIFO,PQ,GPS queueing methods were implemented inside. This thesis aims to implement the LLQ scheduler inside the simulator and to evaluate the performance of these packet schedulers. The simulator is provided by ErnstNordström and Simulator was built in Visual C++ 2008 environmentand tested and analyzed in MatLab 7.0 under windows VISTA.

Optimal Path Searching through Specified Routes using different Algorithms

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive search and analyzed their results. The given problem is similar to Travelling Salesman Problem. Exhaustive search is a best algorithm to solve this problem as it checks each and every possibility and give the accurate result but it is an impractical solution because of huge time consumption. If no. of objects increased from 12 it takes hours to search the shortest path. Simulated annealing is emerged with some promising results with lower time cost. As of probabilistic nature, Simulated annealing could be non optimal but it gives a near optimal solution in a reasonable duration. Greedy algorithm is not a good choice for this problem. So, simulated annealing is proved best algorithm for this problem. The project has been implemented in C-language which takes input and store output in an Excel Workbook

Production and Delivery (Optimization of production system and reliability)

This thesis is done to solve two issues for Sayid Paper Mill Ltd Pakistan. Section one deals with a practical problem arise in SPM that is cutting a given set of raw paper rolls of known length and width, and a set of product paper rolls of known length (equal to the length of raw paper rolls) and width, practical cutting constraints on a single cutting machine, according to demand orders for all customers. To solve this problem requires to determine an optimal cutting schedule to maximize the overall cutting process profitability while satisfying all demands and cutting constraints. The aim of this part of thesis is to develop a mathematical model which solves this problem.Second section deals with a problem of delivering final product from warehouse to different destinations by finding shortest paths. It is an operational routing problem to decide the daily routes for sending trucks to different destination to deliver their final product. This industrial problem is difficult and includes aspect such as delivery to a single destination and multiple destinations with limited resources. The aim of this part of thesis is to develop a process which helps finding shortest path.

Financial time series analysis : Chaos and neurodynamics approach

This work aims at combining the Chaos theory postulates and Artificial Neural Networks classification and predictive capability, in the field of financial time series prediction. Chaos theory, provides valuable qualitative and quantitative tools to decide on the predictability of a chaotic system. Quantitative measurements based on Chaos theory, are used, to decide a-priori whether a time series, or a portion of a time series is predictable, while Chaos theory based qualitative tools are used to provide further observations and analysis on the predictability, in cases where measurements provide negative answers. Phase space reconstruction is achieved by time delay embedding resulting in multiple embedded vectors. The cognitive approach suggested, is inspired by the capability of some chartists to predict the direction of an index by looking at the price time series. Thus, in this work, the calculation of the embedding dimension and the separation, in Takens‘ embedding theorem for phase space reconstruction, is not limited to False Nearest Neighbor, Differential Entropy or other specific method, rather, this work is interested in all embedding dimensions and separations that are regarded as different ways of looking at a time series by different chartists, based on their expectations. Prior to the prediction, the embedded vectors of the phase space are classified with Fuzzy-ART, then, for each class a back propagation Neural Network is trained to predict the last element of each vector, whereas all previous elements of a vector are used as features.

An investigation of worn work roll materials used in the finishing stands of the hot strip mill for steel rolling

The surface failure characteristics of different work roll materials, i.e. High Speed Steel, High Chromium Iron and Indefinite Chill Iron, used in the finishing stands of a hot strip mill have been investigated using stereo microscopy, 3D optical profilometry, scanning electron microscopy and energy dispersive X-ray spectroscopy. The results show that the surface failure mechanisms of work rolls for hot rolling are very complex, involving plastic deformation, abrasive wear, adhesive wear, mechanical and thermal induced cracking, material transfer and oxidation. Despite the differences in chemical composition and microstructure, the tribological response of the different work roll materials was found to be strongly dependent on the material microstructure and especially the presence and distribution of microstructural constituents, such as the different carbide phases and graphite (in the case of Indefinite Chill Iron). Cracking and chipping of the work roll surfaces, both having a negative impact on work roll wear, are strongly influenced by the presence of carbides, carbide networks and graphite in the work roll surface. Consequently, the amount of carbide forming elements as well as the manufacturing process must be controlled in order to obtain an optimised microstructure and a predictable wear rate.

On processing GPS tracking data of car-movements in Borlänge, Sweden

The advancement of GPS technology enables GPS devices not only to be used as orientation and navigation tools, but also to track travelled routes. GPS tracking data provides essential information for a broad range of urban planning applications such as transportation routing and planning, traffic management and environmental control. This paper describes on processing the data that was collected by tracking the cars of 316 volunteers over a seven-week period. The detailed information is extracted. The processed data is further connected to the underlying road network by means of maps. Geographical maps are applied to check how the car-movements match the road network. The maps capture the complexity of the car-movements in the urban area. The results show that 90% of the trips on the plane match the road network within a tolerance.