CFD analysis of liquid stream going through the wire-screen mesh

Paper presented at the 5th International Conference on Heat Transfer, Fluid Mechanics and Thermodynamics, South Africa, 1-4 July, 2007.Wire-screen mesh is normally used for the removal of particles from a liquid stream. Here we consider a system where fluid passes wire-screen mesh perpendicularly. The configurations of wire-screen mesh such as diameter and shape factor of wire affect the stream of fluid going through the screen. In this study, we performed a theoretical approach to the relation between wire mesh and fluid stream with computational fluid dynamics (CFD). FLUENT is used for the simulation. Head loss can be estimated by Rose equation when the stream passes through the wire-mesh (Rose 1945). The drag coefficient (CD) varies with the stream types. The other parameters depend on a specific mesh, velocity and pressure. In the experiment we used a screen of 50 mesh-size and water as a fluid. The pressure drop during water flow was determined. The average and maximum velocities of water were calculated. On the basis of these values, we derived a proportional factor between the velocity of fluid and head loss that can estimate CD.cs201

Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis

The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and then compute a winning strategy for the corresponding omega-regular game. To this end, the obtained omega-automata have to be (pseudo)-determinized where typically a variant of Safra's determinization procedure is used. In this paper, we show that this determinization step can be significantly improved for tool implementations by replacing Safra's determinization by simpler determinization procedures. In particular, we exploit (1) the temporal logic hierarchy that corresponds to the well-known automata hierarchy consisting of safety, liveness, Buechi, and co-Buechi automata as well as their boolean closures, (2) the non-confluence property of omega-automata that result from certain translations of LTL formulas, and (3) symbolic implementations of determinization procedures for the Rabin-Scott and the Miyano-Hayashi breakpoint construction. In particular, we present convincing experimental results that demonstrate the practical applicability of our new synthesis procedure

No major flaws in "Identification of individuals by trait prediction using whole-genome sequencing data"

In a recently published PNAS article, we studied the identifiability of genomic samples using machine learning methods [Lippert et al., 2017]. In a response, Erlich [2017] argued that our work contained major flaws. The main technical critique of Erlich [2017] builds on a simulation experiment that shows that our proposed algorithm, which uses only a genomic sample for identification, performed no better than a strategy that uses demographic variables. Below, we show why this comparison is misleading and provide a detailed discussion of the key critical points in our analyses that have been brought up in Erlich [2017] and in the media. Further, not only faces may be derived from DNA, but a wide range of phenotypes and demographic variables. In this light, the main contribution of Lippert et al. [2017] is an algorithm that identifies genomes of individuals by combining multiple DNA-based predictive models for a myriad of traits

Distributed Block Coordinate Descent for Minimizing Partially Separable Functions

In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates. We analyze its complexity under the assumption that the smooth part of the objective function is partially block separable, and show that the degree of separability directly influences the complexity. This extends the results in [Richtarik, Takac: Parallel coordinate descent methods for big data optimization] to a distributed environment. We first show that partially block separable functions admit an expected separable overapproximation (ESO) with respect to a distributed sampling, compute the ESO parameters, and then specialize complexity results from recent literature that hold under the generic ESO assumption. We describe several approaches to distribution and synchronization of the computation across a cluster of multi-core computers and provide promising computational results.Comment: in Recent Developments in Numerical Analysis and Optimization, 201

Recognition of the Phanerozoic “Young Granite Gneiss” in the central Yeongnam Massif

Up to now, all the high-grade gneisses of the Korean peninsula have been regarded as Precambrian basement rocks and presence of the Phanerozoic high-grade metamorphic rocks have remained unknown. However, such granite gneiss is discovered through this study from the central Yeongnam massif near Gimcheon. SHRIMP zircon U-Pb age determinations on the granite gneiss, having well-developed gneissic foliations and migmatitic textures, reveal concordant age of ca. 250 Ma indicating the Early Triassic emplacement of this pluton, which is in contradict to the previous belief that it is a Precambrian product. Even though the granite gneiss reveals well-developed gneissic foliations and some zircons show rather low Th/U ratios, the metamorphic age has not been determined successfully. However, the age of metamorphism can be constrained as middle Triassic considering the absence of any evidences of metamorphism from the nearby granitic plutons having emplacement ages of ca. 225 Ma. Early Triassic emplacement and subsequent Middle Triassic metamorphism of the granite gneiss from the Yeongnam massif bear a remarkable resemblance to the case of South China block. We suggest the possibility that Early to Middle Triassic metamorphism of the Korean peninsula might be products of the intracontinental collisional events not directly related with the Early Triassic continental collision event

Operation and performance of the ATLAS semiconductor tracker

The semiconductor tracker is a silicon microstrip detector forming part of the inner tracking system of the ATLAS experiment at the LHC. The operation and performance of the semiconductor tracker during the first years of LHC running are described. More than 99% of the detector modules were operational during this period, with an average intrinsic hit efficiency of (99.74±0.04)%. The evolution of the noise occupancy is discussed, and measurements of the Lorentz angle, δ-ray production and energy loss presented. The alignment of the detector is found to be stable at the few-micron level over long periods of time. Radiation damage measurements, which include the evolution of detector leakage currents, are found to be consistent with predictions and are used in the verification of radiation background simulations

The performance of the jet trigger for the ATLAS detector during 2011 data taking

The performance of the jet trigger for the ATLAS detector at the LHC during the 2011 data taking period is described. During 2011 the LHC provided proton–proton collisions with a centre-of-mass energy of 7 TeV and heavy ion collisions with a 2.76 TeV per nucleon–nucleon collision energy. The ATLAS trigger is a three level system designed to reduce the rate of events from the 40 MHz nominal maximum bunch crossing rate to the approximate 400 Hz which can be written to offline storage. The ATLAS jet trigger is the primary means for the online selection of events containing jets. Events are accepted by the trigger if they contain one or more jets above some transverse energy threshold. During 2011 data taking the jet trigger was fully efficient for jets with transverse energy above 25 GeV for triggers seeded randomly at Level 1. For triggers which require a jet to be identified at each of the three trigger levels, full efficiency is reached for offline jets with transverse energy above 60 GeV. Jets reconstructed in the final trigger level and corresponding to offline jets with transverse energy greater than 60 GeV, are reconstructed with a resolution in transverse energy with respect to offline jets, of better than 4 % in the central region and better than 2.5 % in the forward direction

Measurements of fiducial cross-sections for t\bart production with one or two additional b-jets in pp collisions at √s =8 TeVusing the ATLAS detector

Fiducial cross-sections for $t\bar{t}$ production with one or two additional $b$-jets are reported, using an integrated luminosity of 20.3 fb$^{-1}$ of proton--proton collisions at a centre-of-mass energy of 8 TeV at the Large Hadron Collider, collected with the ATLAS detector. The cross-section times branching ratio for $t\bar{t}$ events with at least one additional $b$-jet is measured to be 950 $\pm$ 70 (stat.) $^{+240}_{-190}$ (syst.) fb in the lepton-plus-jets channel and 50 $\pm$ 10 (stat.) $^{+15}_{-10}$ (syst.) fb in the $e \mu$ channel. The cross-section times branching ratio for events with at least two additional $b$-jets is measured to be 19.3 $\pm$ 3.5 (stat.) $\pm$ 5.7 (syst.) fb in the dilepton channel ($e \mu$,\,$\mu\mu$, and \,$ee$) using a method based on tight selection criteria, and 13.5 $\pm$ 3.3 (stat.) $\pm$ 3.6 (syst.) fb using a looser selection that allows the background normalisation to be extracted from data. The latter method also measures a value of 1.30 $\pm$ 0.33 (stat.) $\pm$ 0.28 (syst.)\% for the ratio of $t\bar{t}$ production with two additional $b$-jets to $t\bar{t}$ production with any two additional jets. All measurements are in good agreement with recent theory predictions.Comment: 41 pages plus author list + cover page (58 total), 9 Figures, 16 tables, submitted to EPJC, all figures including auxiliary figures are available at https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/TOPQ-2014-10