Published Article / A company in South Africa is a three-phase induction motor protection relay manufacturer. The function of the protection relay is to capture running data, to provide protection against possible damage, to control an electric motor and to communicate this data to the System Control and Data Acquisition (SCADA) system in a control room. In the case of remote sites e.g. a pump station, the protection relays are used as standalone units. The protection relays are equipped with communication facilities to be used in an instrumentation environment. If a trip occurs or settings need to be changed a technician has to visit the remote site and address the problem. The ideal cost and time effective solution is to perform these tasks remotely via a reliable wireless network. A study was conducted to ascertain the viability of using the standard GSM cellular networks in South Africa to effectively control electric motors and to communicate with the Motor Protection Relays (MPRs) controlling the electric motors in order to determine the status of a motor, settings of the motor, trips that occurred and time of occurrence. It was shown that a node controller could be used to store all the data from various electric motors at a single location. It was also shown that the data from the different electric motors could be analysed at the node controller and that communication can then be initiated from the controller to a responsible person via the GSM network. It was further illustrated that, by making use of the GSM networks in South Africa together with the short message service (SMS), communication and control can be effectively established. SMSs proved to be a reliable means of communication between cellular phones, an embedded network and MPRs. It was shown that software protocols, although slower in communication speed, proved to be reliable and effective for the purpose of transferring information between the node controller and the motor protection relays connected to the electric motors.

Constructing spline models for isogeometric analysis is important in integrating design and analysis. Converting designed CAD (Computer Aided Design) models with B-reps to analysis-suitable volumetric T-spline is fundamental for the integration. In this thesis, we work on two directions to achieve this: (a) using Boolean operations and skeletons to build polycubes for feature-preserving high-genus volumetric T-spline construction; and (b) developing weighted T-splines with arbitrary degree for T-spline surface and volume modeling which can be used for analysis. In this thesis, we first develop novel algorithms to build feature-preserving polycubes for volumetric T-spline construction. Then a new type of T-spline named the weighted T-spline with arbitrary degree is defined. It is further used in converting CAD models to analysis-suitable volumetric T-splines. An algorithm is first developed to use Boolean operations in CSG (Constructive Solid Geometry) to generate polycubes robustly, then the polycubes are used to generate volumetric rational solid T-splines. By solving a harmonic field with proper boundary conditions, the input surface is automatically decomposed into regions that are classified into topologically either a cube or a torus. Two Boolean operations, union and difference, are performed with the primitives and polycubes are generated by parametric mapping. With polycubes, octree subdivision is carried out to obtain a volumetric T-mesh. The obtained T-spline surface is C2-continuous everywhere except the local region surrounding irregular nodes, where the surface continuity is elevated from C0 to G1. B´ezier elements are extracted from the constructed solid T-spline models, which are further used in isogeometric analysis. The Boolean operations preserve the topology of the models inherited from design and can generate volumetric T-spline models with better quality. Furthermore, another algorithm is developed which uses skeleton as a guidance to the polycube construction. From the skeleton of the input model, initial cubes in the interior are first constructed. By projecting corners of interior cubes onto the surface and generating a new layer of boundary cubes, the entire interior domain is split into different cubic regions. With the splitting result, octree subdivision is performed to obtain T-spline control mesh or T-mesh. Surface features are classified into three groups: open curves, closed curves and singularity features. For features without introducing new singularities like open or closed curves, we preserve them by aligning to the parametric lines during subdivision, performing volumetric parameterization from frame field, or modifying the skeleton. For features introducing new singularities, we design templates to handle them. With a valid T-mesh, we calculate rational trivariate T-splines and extract B´ezier elements for isogeometric analysis. Weighted T-spline basis functions are designed to satisfy partition of unity and linear independence. The weighted T-spline is proved to be analysis-suitable. Compared to standard T-splines, weighted T-splines have less geometrical constraint and can decrease the number of control points significantly. Trimmed NURBS surfaces of CAD models are reparameterized with weighted T-splines by a new edge interval extension algorithm, with bounded surface error introduced. With knot interval duplication, weighted T-splines are used to deal with extraordinary nodes. With B´ezier coefficient optimization, the surface continuity is elevated from C0 to G1 for the one-ring neighborhood elements. Parametric mapping and sweeping methods are developed to construct volumetric weighted T-splines for isogeometric analysis. Finally, we develop an algorithm to construct arbitrary degree T-splines. The difference between odd degree and even degree T-splines are studied in detail. The methods to extract knot intervals, calculate new weights to handle extraordinary nodes, and extract B´ezier elements for analysis are investigated with arbitrary degrees. Hybrid degree weighted Tspline is generated at designated region with basis functions of different degrees, for the purpose of performing local p-refinement. We also study the convergence rate for T-spline models of different degrees, showing that hybrid degree weighted T-splines have better performance after p-refinement. In summary, we develop novel methods to construct volumetric T-splines based on polycube and sweeping methods. Arbitrary degree weighted T-spline is proposed, with proved analysis-suitable properties. Weighted T-spline basis functions are used to reparameterize trimmed NURBS surfaces, handling extraordinary nodes, based on which surface and volumetric weighted T-spline models are constructed for isogeometric analysis.

The time it takes to download a file in a peer-to-peer (P2P) overlay network is dependent on several factors. These factors include the quality of the network between peers (e.g. packet loss, latency, and link failures), distance, peer selection technique, and packet loss due to Internet Service Providers (ISPs) engaging in traffic shaping. Recent research shows that P2P download time is adversely impacted by the presence of distant peers, particularly when traffic goes across an ISP that could be engaging in P2P traffic throttling activities. It has also been observed that additional delays are introduced when distant candidate nodes for exchanging data are included during the formation of a P2P network overlay. Researchers have shifted their attention to the mechanism for peer selection. They started questioning the random technique because it ignores the location of nodes in the topology of the underlying physical network. Therefore, selecting nodes for interaction in a distributed system based on their position in the network continues to be an active area of research. The goal of this work was to reduce the cumulative file download time and variance for the majority of participating peers in a P2P network by using a peer selection mechanism that favors nearby nodes. In this proposed proximity strategy, the Internet address space is separated by IP blocks that belong to different Autonomous Systems (AS). IP blocks are further broken up into subsets named zones. Each zone is given a landmark (a.k.a. beacon), for example routers or DNS servers, with a known geographical location. At the time peers joined the network, peers were grouped into zones based on their geographical distance to the selected beacons. Peers that end up in the same zone were put at the top of the list of available nodes for interactions during the formation of the overlay. Experiments were conducted to compare the proposed proximity based peer selection strategy to the random peer selection strategy. The results indicate that the proximity technique outperforms the random approach for peer selection in a network with low packet loss and latency and also in a more realistic network subject to packet loss, traffic shaping and long distances. However, this improved performance came at the cost of additional memory (230 megabytes) and to a lesser extent some additional CPU cycles to run the additional subroutines needed to group peers into zones. The framework and algorithms developed for this work made it possible to implement a fully functioning prototype that implements the proximity strategy. This prototype enabled high fidelity testing with a real client implementation in real networks including the Internet. This made it possible to test without having to rely exclusively on event-driven simulations to prove the hypothesis.

Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the shortest and most reliable path in a MANET in which users are moving continuously and have no base station to be used as a reference for their position. This thesis proposes some new routing protocols based on the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a series of nodes that are moving in approximately the same direction. The rationale behind this concept is to maintain the connection between the nodes as long as possible. This is in contrast to the well known hop count method, which does not consider the connection lifetime. We propose three enhancements and modifications of the Ad-hoc on demand distance vector (AODV) protocol that can find a suitable path between source and destination using combinations and prioritization of angle direction and hop count. Firstly, we consider that if there are multiple routing paths available, the path with the minimum hop count is selected and when the hop counts are the same the path with the best angle direction is selected. Secondly, if multiple routing paths are available the paths with the best angle direction are chosen but if the angles are the same (fall within the same specified segment), the path with minimum hop count is chosen. Thirdly, if there is more than one path available, we calculate the average of all the heading angles in every path and find the best one (lowest average) from the source to the destination. In MANETs, flooding is a popular message broadcasting technique so we also propose a new scheme for MANETS where the value of the rebroadcast packets for every host node is dynamically adjusted according to the number of its neighbouring nodes. A fixed probabilistic scheme algorithm that can dynamically adjust the rebroadcasting probability at a given node according to its ID is also proposed; Fixed probabilistic schemes are one of the solutions to reduce rebroadcasts and so alleviate the broadcast storm problem. Performance evaluation of the proposed schemes is conducted using the Global Mobile Information System (GloMoSim) network simulator and varying a number of important MANET parameters, including node speed, node density, number of nodes and number of packets, all using a Random Waypoint (RWP) mobility model. Finally, we measure and compare the performance of all the proposed approaches by evaluating them against the standard AODV routing protocol. The simulation results reveal that the proposed approaches give relatively comparable overall performance but which is better than AODV for almost all performance measures and scenarios examined.

No description available.

<p>A complex network graphics may be composed of hundreds and thousands of objects, such as nodes and edges. Each object may hold a large number of attributes that might be difficult to explore in the network visualization. Therefore, many visualization tools and approaches have been developed to gain more information from the network graphics. In this paper, we introduce the concept of the Network Lens<em>, </em>a new widget that assists the users to deal with a complex network. The Network Lens is an interactive tool that combines data visualization to a magic lens. With the help of the Network Lens, users can display hidden information of the elements in the network graphics based on their interest. Moreover, the Network Lens supports a series of interactive functions that give the users flexible options to define their own lenses.</p>

Ziel einer Definition der Resektabilität von Pankreaskarzinomen ist die Beschreibung von Kriterien, welche eine potentielle R0-Resektion ermöglichen. Wenngleich es zur Frage der Resektion bei positiven regionären Lymphknoten keine kontrollierten Studien gibt, ist weltweit die Resektion bei regionären Lymphknotenmetastasen Standard. Positive interaortokavale Lymphknoten stellen trotz Klassifikation als Fernmetastasen (M1) keine absolute Kontraindikation zur Resektion dar. Die mesenteriko-portale Venenresektion bei Verdacht auf Tumorinfiltration ist ein sicheres Verfahren. Sie hat keinen negativen Einfluss auf Morbidität, Mortalität und Überleben. Die En-bloc-Resektion der Arteria hepatica und der Arteria mesenterica superior wird sehr kontrovers diskutiert und sollte nur in Einzelfällen erwogen werden. Bei den meist fortgeschrittenen Karzinomen des Pankreaskorpus und -schwanzes kann durch eine En-bloc-Resektion des Truncus coeliacus eine höhere R0-Resektionsrate erreicht werden. / Pancreatic Cancer: Criteria and Limits of Resectability The aim of defining the resectability of pancreatic cancer is to determine the indication for potential R0 resection. Despite the absence of controlled trials, tumor resection in patients with regional lymph node involvement is a standard procedure worldwide. The involvement of interaortocaval lymph nodes is not an absolute contraindication for resection, although they are classified as distant metastasis (M1). Major pancreatic surgery can be safely combined with en-bloc resection of mesenteric, portal and splenic veins. Postoperative morbidity and mortality and long-term survival in patients with vein resection are comparable with those of patients without vein resection. The role of arterial en-bloc resection of the hepatic artery and the superior mesenteric artery is highly controversial and should be considered only in selected patients. For patients with locally advanced cancer of the body and tail of the pancreas distal pancreatectomy with en-bloc celiac axis resection offers an improved R0 resection rate. / Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.

Elongation of the vertebrate rostrocaudal axis depends on localised populations of axial progenitors. Previous work has demonstrated the presence of Neuromesodermal (NM) progenitors that behave as multipotent stem cells, which contribute to the neurectoderm and mesoderm throughout axis elongation. They have been localised to the Node-­‐Streak Border (NSB) in the primitive streak region, and the Chordoneural Hinge (CNH) in its descendant, the tail bud. At primitive streak stages, the Caudal Lateral Ectoderm (CLE) on either side of the primitive streak itself is also fated for neurectoderm and mesoderm. However, fate mapping studies in mouse and chick have suggested that these progenitors are more transitory than those in the NSB and CNH, leading to the idea that two different types of progenitor cell exist in the primitive streak region; long-­‐term (stem cell-­‐like) and transient progenitors. In this thesis, I have examined the potency of the CLE cells by heterotopically grafting them into the NSB. Anterior CLE cells are exquisitely sensitive to their position and differentiate predominantly as neurectoderm, mesoderm, or both, depending on their exact location in the NSB. Most significantly, their descendants are retained in the CNH, indicating that CLE cells show equal potential to NSB progenitors on transplantation to the border environment. The relationship between fate and potency within the streak stage embryo suggest a mechanism by which stem cells are maintained not only by their intrinsic stem cell program, but are also influenced by their location. Furthermore, I have investigated the expression of candidate markers of NM-­‐progenitors, and have found that the combined expression of Sox2 and T genes in the progenitor area coincides with observed NM-­‐potency, and could serve as a marker for this stem cell population. Over time, axial elongation comes to a halt and NM-­‐progenitors are thereafter not longer active. It is still unclear how exactly this process occurs and specifically whether axial elongation ceases because NM progenitors are eliminated. I have investigated the events occurring immediately before the end of axial elongation. Morphological and gene expression analysis shows that apoptosis reaches a peak only after the complete axis has been laid down, and is not dramatically elevated in the progenitors themselves before that. In order to test signalling pathways that lead to progenitor maintenance, I have developed an in vitro tail growth assay that recapitulates in vivo development, as measured by several morphometric criteria. I show that, even though FGF signalling is critical for most cells in the tail bud including NM-­‐progenitors, it is not sufficient for NM-­‐ progenitor maintenance. In contrast, exposing tail buds to elevated Wnt/β-­‐catenin signalling does prolong the lifetime of NM-­‐progenitors in the ageing tail bud, as judged by the presence of Sox2-­‐T double-­‐positive cells. In this regard we have found that the time of cessation coincides with the disappearance of Sox2-­‐T double-­‐positive cells, the disappearance of Wnt3a and concomitant neuralisation of the progenitor region. This data suggest an important governing role for Wnt signalling in both maintenance and fate decision of NM progenitors. Thus the disappearance of Wnt signalling in the tail bud over time could well be the main reason for triggering the halt of caudal elongation.

This thesis focuses on developing a high data rate wireless sensor network framework that could be integrated with hardware prototypes to monitor structural health of buildings. In order to better understand the wireless sensor network architecture and its consideration in structural health monitoring, a detailed literature review on wireless sensor networks has been carried out. Through research, it was found that there are numerous simulation software packages available for wireless sensor network simulation. One suitable software was selected for modelling the framework. Research showed that Matlab/Simulink was the most suitable environment, and as a result, a wireless sensor network framework was designed in Matlab/Simulink. Further, the thesis illustrates modeling of a simple accelerometer sensor, such as those used in wireless sensor networks in Matlab/Simulink using a mathematical description. Finally, the framework operation is demonstrated with 10 nodes, and data integrity is analyzed with cyclic redundancy check and transmission error rate calculations.

No description available.