Cyclic automorphic graph decompositions

Chapter 1 introduces the tools and mechanics necessary for this report. Basic definitions and topics of graph theory which pertain to the report and discussion of automorphic decompositions will be covered in brief detail. An automorphic decomposition D of a graph H by a graph G is a G-decomposition of H such that the intersection of graph (D) @H. H is called the automorhpic host, and G is the automorphic divisor. We seek to find classes of graphs that are automorphic divisors, specifically ones generated cyclically. Chapter 2 discusses the previous work done mainly by Beeler. It also discusses and gives in more detail examples of automorphic decompositions of graphs. Chapter 2 also discusses labelings and their direct relation to cyclic automorphic decompositions. We show basic classes of graphs, such as cycles, that are known to have certain labelings, and show that they also are automorphic divisors. In Chapter 3, we are concerned with 2-regular graphs, in particular rCm, r copies of the m-cycle. We seek to show that rCm has a ρ-labeling, and thus is an automorphic divisor for all r and m. we discuss methods including Skolem type difference sets to create cycle systems and their correlation to automorphic decompositions. In the Appendix, we give classes of graphs known to be graceful and our java code to generate ρ-labelings on rCm.

Arctic network builders : the Arctic Coal Company's operations on Spitsbergen and its relationship with the environment

In 1906, two American industrialists, John Munroe Longyear and Frederick Ayer, formed the Arctic Coal Company to make the first large scale attempt at mining in the high-Arctic location of Spitsbergen, north of the Norwegian mainland. In doing so, they encountered numerous obstacles and built an organization that attempted to overcome them. The Americans sold out in 1916 but others followed, eventually culminating in the transformation of a largely underdeveloped landscape into a mining region. This work uses John Law’s network approach of the Actor Network Theory (ANT) framework to explain how the Arctic Coal Company built a mining network in this environmentally difficult region and why they made the choices they did. It does so by identifying and analyzing the problems the company encountered and the strategies they used to overcome them by focusing on three major components of the operations; the company’s four land claims, its technical system and its main settlement, Longyear City. Extensive comparison between aspects of Longyear City and the company’s choices of technology with other American examples place analysis of the company in a wider context and helps isolate unique aspects of mining in the high-Arctic. American examples dominate comparative sections because Americans dominated the ownership and upper management of the company.

ANALYSIS AND VISUALIZATION OF FLOW FIELDS USING INFORMATION-THEORETIC TECHNIQUES AND GRAPH-BASED REPRESENTATIONS

Three-dimensional flow visualization plays an essential role in many areas of science and engineering, such as aero- and hydro-dynamical systems which dominate various physical and natural phenomena. For popular methods such as the streamline visualization to be effective, they should capture the underlying flow features while facilitating user observation and understanding of the flow field in a clear manner. My research mainly focuses on the analysis and visualization of flow fields using various techniques, e.g. information-theoretic techniques and graph-based representations. Since the streamline visualization is a popular technique in flow field visualization, how to select good streamlines to capture flow patterns and how to pick good viewpoints to observe flow fields become critical. We treat streamline selection and viewpoint selection as symmetric problems and solve them simultaneously using the dual information channel [81]. To the best of my knowledge, this is the first attempt in flow visualization to combine these two selection problems in a unified approach. This work selects streamline in a view-independent manner and the selected streamlines will not change for all viewpoints. My another work [56] uses an information-theoretic approach to evaluate the importance of each streamline under various sample viewpoints and presents a solution for view-dependent streamline selection that guarantees coherent streamline update when the view changes gradually. When projecting 3D streamlines to 2D images for viewing, occlusion and clutter become inevitable. To address this challenge, we design FlowGraph [57, 58], a novel compound graph representation that organizes field line clusters and spatiotemporal regions hierarchically for occlusion-free and controllable visual exploration. We enable observation and exploration of the relationships among field line clusters, spatiotemporal regions and their interconnection in the transformed space. Most viewpoint selection methods only consider the external viewpoints outside of the flow field. This will not convey a clear observation when the flow field is clutter on the boundary side. Therefore, we propose a new way to explore flow fields by selecting several internal viewpoints around the flow features inside of the flow field and then generating a B-Spline curve path traversing these viewpoints to provide users with closeup views of the flow field for detailed observation of hidden or occluded internal flow features [54]. This work is also extended to deal with unsteady flow fields. Besides flow field visualization, some other topics relevant to visualization also attract my attention. In iGraph [31], we leverage a distributed system along with a tiled display wall to provide users with high-resolution visual analytics of big image and text collections in real time. Developing pedagogical visualization tools forms my other research focus. Since most cryptography algorithms use sophisticated mathematics, it is difficult for beginners to understand both what the algorithm does and how the algorithm does that. Therefore, we develop a set of visualization tools to provide users with an intuitive way to learn and understand these algorithms.

Different anticoagulation strategies in off-pump coronary artery bypass operations: a European survey

In order to determine anticoagulation strategies in OPCAB a questionnaire survey among 750 European cardio-thoracic surgeons was performed. Questions addressed volume of OPCAB procedures performed, intra- and perioperative heparinization and antiplatelet therapy, as well as perioperative management. A total of 325 (43.7%) questionnaires were returned and validated. Perioperative protocols for administration of antiplatelets differed among the respondent surgeons. Perioperative prophylaxis of thrombosis (low or high molecular weight heparin) is performed by 78%. Intraoperative heparin dosage range between 70 U/kg to 500 U/kg, 60% of respondents prefer a low-dose regimen (< or = 150 U/kg). Correspondingly, the lowest activated clotting time (ACT) during surgery is accepted to be 200 s by 24%, 250 s by 18% and 300 s by 26% of surgeons. Protamine is used by 91% of respondents, while 52% perform a 1:1 reversal. A cell-saver and antifibrinolytics are used by 70% and 40%, respectively. Interestingly, 56% of respondents think bleeding in OPCAB patients is not reduced when compared to on-pump CABG. In addition, 34% of respondents believe there is an increased risk of early graft occlusion following OPCAB. This survey demonstrates widely different intra- and perioperative anticoagulation strategies for OPCAB procedures among European surgeons.

Parameter-free extraction of the functional network topology from intracranial EEG recordings: a time-resolved study of graph properties in focal onset seizures

Rationale: Focal onset epileptic seizures are due to abnormal interactions between distributed brain areas. By estimating the cross-correlation matrix of multi-site intra-cerebral EEG recordings (iEEG), one can quantify these interactions. To assess the topology of the underlying functional network, the binary connectivity matrix has to be derived from the cross-correlation matrix by use of a threshold. Classically, a unique threshold is used that constrains the topology [1]. Our method aims to set the threshold in a data-driven way by separating genuine from random cross-correlation. We compare our approach to the fixed threshold method and study the dynamics of the functional topology. Methods: We investigate the iEEG of patients suffering from focal onset seizures who underwent evaluation for the possibility of surgery. The equal-time cross-correlation matrices are evaluated using a sliding time window. We then compare 3 approaches assessing the corresponding binary networks. For each time window: * Our parameter-free method derives from the cross-correlation strength matrix (CCS)[2]. It aims at disentangling genuine from random correlations (due to finite length and varying frequency content of the signals). In practice, a threshold is evaluated for each pair of channels independently, in a data-driven way. * The fixed mean degree (FMD) uses a unique threshold on the whole connectivity matrix so as to ensure a user defined mean degree. * The varying mean degree (VMD) uses the mean degree of the CCS network to set a unique threshold for the entire connectivity matrix. * Finally, the connectivity (c), connectedness (given by k, the number of disconnected sub-networks), mean global and local efficiencies (Eg, El, resp.) are computed from FMD, CCS, VMD, and their corresponding random and lattice networks. Results: Compared to FMD and VMD, CCS networks present: *topologies that are different in terms of c, k, Eg and El. *from the pre-ictal to the ictal and then post-ictal period, topological features time courses that are more stable within a period, and more contrasted from one period to the next. For CCS, pre-ictal connectivity is low, increases to a high level during the seizure, then decreases at offset. k shows a ‘‘U-curve’’ underlining the synchronization of all electrodes during the seizure. Eg and El time courses fluctuate between the corresponding random and lattice networks values in a reproducible manner. Conclusions: The definition of a data-driven threshold provides new insights into the topology of the epileptic functional networks.