Miracle-dz/UniFAR-FTUs huggingface dataset:
Imperial / TP / 2018 / JG / 03 A geometric dual of c-extremization

We consider supersymmetric AdS3 × Y7 and AdS2 × Y9 solutions of type IIB and D = 11 supergravity, respectively, that are holographically dual to SCFTs with (0, 2) supersymmetry in two dimensions and N = 2 supersymmetry in one dimension. The geometry of Y2n+1, which can be defined for n ≥ 3, shares many similarities with Sasaki-Einstein geometry, including the existence of a canonical R-symmetry Killing vector, but there are also some crucial differences. We show that the R-symmetry Killing vector may be determined by extremizing a function that depends only on certain global, topological data. In particular, assuming it exists, for n = 3 one can compute the central charge of an AdS3 × Y7 solution without knowing its explicit form. We interpret this as a geometric dual of cextremization in (0, 2) SCFTs. For the case of AdS2 × Y9 solutions we show that the extremal problem can be used to obtain properties of the dual quantum mechanics, including obtaining the entropy of a class of supersymmetric black holes in AdS4. We also study many specific examples of the type AdS3×T ×Y5, including a new family of explicit supergravity solutions. In addition we discuss the possibility that the (0, 2) SCFTs dual to these solutions can arise from the compactification on T 2 of certain d = 4 quiver gauge theories associated with five-dimensional Sasaki-Einstein metrics and, surprisingly, come to a negative conclusion. On leave at the Galileo Galilei Institute, Largo Enrico Fermi, 2, 50125 Firenze, Italy.
Real time rendering of skeletal implicit surfaces

We present a framework consisting of a surface representation based on skeletal implicit surfaces and a ray tracing algorithm that allows to model animated surfaces in real time. This framework allows common effects used in computer graphics such as texturing and displacement mapping and can be integrated in a real time renderer. To demonstrate the power of the framework, we build an interactive modelling tool. The surface representation that we use is a subset of skeletal implicit surfaces and we limit ourselves to simple primitives such as points and line segments. We choose degree four polynomials for the convolution kernel. We combine this skeletal representation of the geometry with a hierarchical bone data structure to allow animation. The rendering is done on the GPU in a single pass via ray-tracing. The ray-tracing algorithm uses bisection to find the ray-surface intersection and relies on finding points on the ray that are inside the surface. We propose a method to apply 3D and 2D textures to the model in the fragment shader that is compatible with animation. This method consists in transforming the position of the fragment to it’s position in the model’s rest pose to compute the texture coordinates with local projectors.
57 SOLID MODELING

The objective of solid modeling is to represent, manipulate, and reason about the 3D shape of solid physical objects, by computer. As an application-oriented field, the scope of solid modeling, as well as the relative emphasis on its parts, change over time. Since its inception, [RV82, Bra75], in the 1970s, the focus on modeling shape alone has continued to expand to integrate widening domains of physical properties. Monographs of the subject appeared in the late 1980s and include [Chi88, Hof89, Män88]. The expansion was and continues to be driven by major applications that include manufacturing, architecture, construction, computer vision, materials science, medicine, biological engineering, graphics, and virtual reality. With the integration of new applications, and with the availability of inexpensive, powerful computing platforms, the relative importance of specific shape representations can change. Along with such shifts, new modeling and analysis techniques are added. As a result, the field draws on very diverse technologies, including numerical analysis, symbolic algebraic computation, approximation theory, point set and algebraic topology, differential geometry, algebraic geometry, and computational geometry. In this chapter, we first review the major representations of solids in Section 57.1. They include constructive solid geometry, boundary representation, spatial subdivisions of various types, and medial surface representations. With changing scope and focus, different representations enter and exit center stage. For instance, polygonal meshes and voxel-based representations became relatively marginal in the late 1990s, only to gain renewed interest and importance recently with the advent of 3D printing, because they allow representing a structured interior of modeled shapes. Procedural and declarative representations are becoming more popular as geometric programming methods are increasingly used for creating complex solid models and assemblies in architecture and additive manufacturing. For decades modeled solids were generally assumed to have a homogeneous interior. This fact reflected common manufacturing applications and manufacturing processes that separated the production of raw materials from subsequent processing of those materials into parts, assemblies, etc. With the advent of additive manufacturing, that is, machinery that builds physical objects by additive processes, laying down material layer by layer, there is growing interest in building solids that have a complex interior structure. An efficient and comprehensive representation of heterogeneous interior has not yet emerged. Along with explorations of printer technologies and of what can or should be built there is a wide-ranging, diverse body of research, that we will comment on in Section 57.1. 7, tracing this development. Next, major layers of abstraction in a typical solid modeling system are characterized in Section 57.2. The lowest level of abstraction comprises a substratum
Clinical Informatics: Supporting the Use of Evidence in Practice and Relevance to Physical Therapy Education

Background. Clinical informatics is the subdiscipline of biomedical informatics that focuses on the representation, collection, retrieval, and use of health information in clinical practice. Purpose. This paper provides a general introduction to the field of biomedical informatics and recommends specific facets of clinical informatics that are germane to education programs in physical therapy. Position and Rationale. In light of the growing importance of information technology in health care, an understanding of clinical informatics is needed for physical therapy practitioners. Discussion. Many avenues and examples are available for incorporating clinical informatics training into the core curriculum of allied health programs. Conclusion. Instruction regarding applied aspects of clinical informatics needs to be considered as a component of a well‐rounded education in physical therapy.
M ay 2 01 6 DistributedController-Estimator forTargetTrackingof NetworkedRobotic SystemsunderSampled Interaction ⋆

This paper investigates the target tracking problem for networked robotic systems (NRSs) under sampled interaction. The target is assumed to be time-varying and described by a second-order oscillator. Two novel distributed controller-estimator algorithms (DCEA), which consist of both continuous and discontinuous signals, are presented. Based on the properties of small-value norms and Lyapunov stability theory, the conditions on the interaction topology, the sampling period, and the other control parameters are given such that the practical stability of the tracking error is achieved and the stability region is regulated quantitatively. The advantages of the presented DCEA are illustrated by comparisons with each other and the existing coordination algorithms. Simulation examples are given to demonstrate the theoretical results.
MATHEMATICAL MODELS Dynamics of Tectonic Plates

We suggest a model that describes a mutual dynamics of tectonic plates. It is a sort of stick-slip dynamics modeled by a Markov random process. The process defines the dynamics on a micro-level. A macro-level is obtained by a scaling limit which leads to a system of integrodifferential equations which determines a kind of mean field systems. The conditions when the Gutenberg-Richter empirical law holds are presented at the mean field level. Those conditions are rather universal and independent of the features of the resistant forces.
ANTTON IKOLA DEVELOPING MASTER DATA MANAGEMENT IN A MULTI-BUSI- NESS CASE ORGANIZATION

ANTTON IKOLA: Developing master data management in a multi-business case organization Tampere University of Technology Master of Science Thesis, 87 pages, 2 Appendix pages February 2018 Master’s Degree Program in Information and Knowledge Management Major: Information and Knowledge management, Information analytics Examiner: Professor Samuli Pekkola
Intra-and intermolecular domain interactions among novel two-component system proteins coded by Rv 0600 c , Rv 0601 c and Rv 0602 c of Mycobacterium tuberculosis

Received 1 April 2008 Revised 29 October 2008 Accepted 12 November 2008 Two-component signal transduction pathways comprising a histidine kinase and its cognate response regulator play a dominant role in the adaptation of Mycobacterium tuberculosis to its host, and its virulence, pathogenicity and latency. Autophosphorylation occurs at a conserved histidine of the histidine kinase and subsequently the phosphoryl group is transferred to the conserved aspartate of its cognate response regulator. Among the twelve two-component systems of M. tuberculosis, Rv0600c (HK1), Rv0601c (HK2) and Rv0602c (TcrA) are annotated as a unique three-protein two-component system. HK1 contains an ATP-binding domain, and HK2, a novel Hpt mono-domain protein, contains the conserved phosphorylable histidine residue. HK1 and HK2 complement each other’s functions. Interactions among different domains of the HK1, HK2 and TcrA proteins were studied using a yeast two-hybrid system. Self-interaction was observed for HK2 but not for HK1 or TcrA. HK2 was found to interact reasonably well with both HK1 and TcrA, but HK1 interacted weakly with TcrA. The conserved aspartate-containing receiver domain of TcrA interacted well with HK2 but not with HK1. These results suggest the existence of a novel signalling mechanism amongst HK1–HK2–TcrA, and a model for this mechanism is proposed.
Complete 1 H , 13 C and NMR assignments and secondary structure of the 269-residue serine protease PB 92 from Bacillus alcalophilus

The 1H, 13C and tSN NMR resonances of serine protease PB92 have been assigned using 3D tripleresonance NMR techniques. With a molecular weight of 27 kDa (269 residues) this protein is one of the largest monomeric proteins assigned so far. The side-chain assignments were based mainly on 3D H(C)CH and 3D (H)CCH COSY and TOCSY experiments. The set of assignments encompasses all backbone carbonyl and CHn carbons, all amide (NH and NH2) nitrogens and 99.2% of the amide and CH n protons. The secondary structure and general topology appear to be identical to those found in the crystal structure of serine protease PB92 [Van der Laan et al. (1992) Protein Eng., 5, 405-411], as judged by chemical shift deviations from random coil values, NH exchange data and analysis of NOEs between backbone NH groups.
C O ] 1 4 A ug 2 01 9 Uniform Orderings for Generalized Coloring Numbers ∗

The generalized coloring numbers scolr(G) and wcolr(G) of a graph G were introduced by Kierstead and Yang as a generalization of the usual coloring number, and have found important theoretical and algorithmic applications. For each distance r, these numbers are determined by an “optimal” ordering of the vertices of G. We study the question of whether it is possible to find a single “uniform” ordering that is “good” for all distances r. We show that the answer to this question is essentially “yes”. Our results give new characterizations of graph classes with bounded expansion and nowhere dense graph classes.
EquGener: A Reasoning Network for Word Problem Solving by Generating Arithmetic Equations

Word problem solving has always been a challenging task as it involves reasoning across sentences, identiﬁcation of operations and their order of application on relevant operands. Most of the earlier systems attempted to solve word problems with tailored features for handling each category of problems. In this paper, we present a new approach to solve simple arithmetic problems. Through this work we introduce a novel method where we ﬁrst learn a dense representation of the problem description conditioned on the question in hand. We leverage this representation to generate the operands and operators in the appropriate order. Our approach improves upon the state-of-the-art system by 3% in one benchmark dataset while ensuring comparable accuracies in other datasets.
What are they up to ? Distilling the Twitter Stream of Subpopulations

Social network researchers have been tackling community detection / community search for over a decade. Detecting communities – small groups of people who know each other and interact with each other – have numerous applications, starting from marketing and computational advertisement, all the way to the homeland security domain. By now, the problem can be considered mostly solved, in either its unsupervised form (community detection) or semi-supervised form (community search). In our quest to answer general – and very exciting – questions What are people up to? What do they care about? What are they discussing? , we move beyond detecting communities to circumscribing subpopulations – large groups of people who share some common characteristics, for example activists, students, engineers, New Yorkers, football fans etc. We want to know what are < · · · > talking about on Twitter, where < · · · > is any subpopulation. Initially, the subpopulation is characterized by a few representative members, who are treated as seeds in the iterative Personalized PageRank (PPR) framework that enlarges the subpopulation at each iteration. We immediately hit the scalability limitation, which we overcome by proposing the Splash PPR algorithm, inspired by Splash Belief Propagation. We implement Splash PPR on Apache Spark and show its efficiency and effectiveness on extracting the Twitter stream of a subpopulation of machine learning practitioners, by which we pave the road to distilling valuable signal out of the sea of Twitter noise.
Space Mapping for Engineering Optimization1

Engineers have used optimization techniques for device and system modeling and design for decades [1]. Traditional techniques [2, 3] utilize simulations of appropriate models of the devices and any available derivatives to force relevant system responses to satisfy specifications subject to design constraints. The higher the fidelity (accuracy) of the models the more expensive we expect the application of traditional optimization to be. For complex problems this cost may be prohibitive. Methodologies based on exploitation of iteratively refined surrogates of accurate or high-fidelity models address this issue. Through the construction of a suitably accurate physics-based surrogate model one can represent the objective function over a region of the design space. Then, instead of optimizing the high-fidelity model, one can optimize the surrogate
Advanced Baseline Imager ( ABI ) Algorithm Theoretical Basis Document for Sea Surface Temperature

10 1 INTRODUCTION . 11 1.1 Purpose of This Document . 11 1.2 Who Should Use This Document . 11 1.3 Inside Each Section . 11 1.4 Related Documents . 12 1.5 Revision History . 12 2 OBSERVING SYSTEM OVERVIEW . 12 2.1 Products Generated . 13 2.2 Instrument Characteristics . 13 3 ALGORITHM DESCRIPTION . 16 3.1 Algorithm Overview . 16 3.2 Processing Outline . 16 3.3 Algorithm Input . 18 3.3.1 Primary Sensor Data . 18 3.3.2 ABI-Based Ancillary Data . 19 3.3.3 Non-ABI Ancillary Static Data . 19 3.3.4 Non-ABI Ancillary Dynamic Data . 19 3.3.5 Algorithm Coefficients and Control Values (ABI-specific static) . 19 3.3. 6 CRTM Simulations and Dynamic Ancillary Fields Used for SST . 20 3.4 Theoretical description . 23 3.4. 1 Physics of the Problem . 23 3.4. 2 Mathematical Description of the SST Algorithms . 27 3.4. 3 SST Quality Control . 33 3.4. 4 Estimation of Global Biases . 38 3.4. 5 Bias estimation algorithm . 40 3.5 Algorithm Output . 43 4 TEST DATA SETS AND OUTPUT . 44
Quantization-Based Image Watermarking using Multi-resolution Wavelet Decomposition

Watermarking techniques provide efficient methods for protecting copyright of intellectual property. Since the discrete wavelet transform allows independent processing of the resulting sub-bands without significant perceptible interaction between them, it is expected to make the watermark embedding more imperceptible. Furthermore, Wavelet-based watermarking techniques showed to be robust in the face of attacks. In this paper, we introduce an algorithm that applies a quantization step on the sorted detail coefficients of the L level resolution of the wavelet decomposition of a true color image. The extraction process can be carried out blindly, i.e. without the need to refer to the original host image. Experimental results showed that the proposed embedding strategy causes low distortion on the watermarked images where the PSNR values were successfully greater than 40 dB. Furthermore, the proposed method showed effective resistance to attacks such as JPEG compression, image filtering, and Gaussian noise. More simulations were also carried out to evaluate the performance of the proposed algorithm in comparison to similar transform-domain techniques.
Iron deficiency and anemia are prevalent in women with multiple gestations 1 , 2

Background: Little attention has been placed on the unique iron demands that may exist in women with multiple gestations. This merits attention because iron deficiency (ID) during pregnancy is associated with adverse pregnancy outcomes that are known to be more prevalent in multiple births. Objective: We characterized longitudinal changes in iron status across pregnancy in a cohort of healthy women with multiple gestations and identified determinants of maternal ID and anemia. Design: A group of 83 women carrying twins, triplets, or quadruplets (aged 20–46 y) was recruited from 2011 to 2014. Blood samples obtained during pregnancy (w24 wk; n = 73) and at delivery (w35 wk; n = 61) were used to assess hemoglobin, serum ferritin (SF), soluble transferrin receptor (sTfR), hepcidin, serum iron, erythropoietin, serum folate, vitamin B-12, C-reactive protein, and
Is Foreign Direct Investment a Cause of Environmental Degradation in Pakistan? An ARDL Approach to Cointegration

This study has investigated the empirical relationship between FDI and environmental degradation in Pakistan and 43 years of data is used in the study started from 1972 to 2014. Empirical tests show that there exist mix-cointegrating series, so ARDL bounds testing is applied to check the short-long run cointegration among the variables. Results concluded that FDI causes CO2 emissions in long and short-run both. To check the direction of causality between variables, an ARDL Granger test is applied. It proved that FDI and CO2 emissions have bidirectional causality and causing each other from both ways.
NEW ENTROPY ESTIMATES FOR OLDROYD-B AND RELATED MODELS

where the Reynolds number Re>0, the Weissenberg number We>0 and ε∈ (0,1) are some non-dimensional numbers. We recall that the Reynolds number expresses the ratio of inertial forces to viscous forces in the fluid. The Weissenberg number is the ratio of the characteristic time of the microstructure in the complex fluid (typically the polymer chains for dilute polymer solutions) to the characteristic time of the fluid. The non-dimensional number ǫ is the ratio of the viscosity due to the microstructures to the total viscosity. We suppose that the space variable x lives in a bounded domain D of IR. This system is supplied with initial conditions on the velocity u and on the stress tensor τ . For simplicity, we assume no-slip boundary conditions on the velocity u:
Role of Protein Kinase A and the Serine-Rich Region of Herpes Simplex Virus Type 1 ICP 4 in Viral Replication

Efficient expression of herpes simplex virus genes requires the synthesis of functional ICP4, a nuclear phosphoprotein that contains a prominent serine-rich region between amino acids 142 and 210. Residues in this region not only are potential sites for phosphorylation but also are involved in the functions of ICP4. By comparing the growth of a virus in which this region is deleted (d8-10) with wild-type virus (KOS) in PC12 cells or PC12 cells that are deficient in cyclic AMP-dependent protein kinase (PKA), two observations were made: (i) the growth of wild-type virus was impaired by 1 to 2 orders of magnitude in the PKA-deficient cells, indicating the involvement of PKA in the growth cycle of herpes simplex virus type 1, and (ii) while the growth of d8-10 was impaired by almost 2 orders of magnitude in wild-type cells, it was not further impaired (as was that of wild-type virus) in PKA-deficient cells, implicating the region deleted in d8-10 as a possible target for cellular PKA. In trigeminal ganglia of mice, the d8-10 mutant virus grew poorly; however, it established latency in nearly 90% of ganglia tested. Studies of the phosphorylation of wild-type and d8-10 ICP4 proteins revealed that the serine-rich region is a major determinant for phosphorylation of ICP4 in vivo and that the phosphorylation state could change as a function of the PKA activity. Consistent with this observation, the serine-rich region of ICP4 was shown to be a target for PKA in vitro. While intact ICP4 was readily phosphorylated by ICP4 in vitro, the d8-10 mutant ICP4 was not. Moreover, a synthethic peptide representing a sequence in the serine tract that is predicted to be a substrate for PKA was phosphorylated by PKA in vitro, having a Km within the physiological range. These data suggest that PKA plays a role in viral growth through phosphorylation of one or more sites on the ICP4 molecule.
swarm optimisation for feature selection in classification : ovel initialisation and updating mechanisms

In classification, feature selection is an important data pre-processing technique, but it is a difficult problem due mainly to the large search space. Particle swarm optimisation (PSO) is an efficient evolutionary computation technique. However, the traditional personal best and global best updating mechanism in PSO limits its performance for feature selection and the potential of PSO for feature selection has not been fully investigated. This paper proposes three new initialisation strategies and three new personal best and global best updating mechanisms in PSO to develop novel feature selection approaches with the goals of maximising the classification performance, minimising the number of features and reducing the computational time. The proposed initialisation strategies and updating mechanisms are compared with the traditional initialisation and the traditional updating mechanism. Meanwhile, the most promising initialisation strategy and updating mechanism are combined to form a new approach (PSO(4-2)) to address feature selection problems and it is compared with two traditional feature selection methods and two PSO based methods. Experiments on twenty benchmark datasets show that PSO with the new initialisation strategies and/or the new updating mechanisms can automatically evolve a feature subset with a smaller number of features and higher classification performance than using all features. PSO(4-2) outperforms the two traditional methods and two PSO based algorithm in terms of the computational time, the number of features and the classification performance. The superior performance of this algorithm is due mainly to both the proposed initialisation strategy, which aims to take the advantages of both the forward selection and backward selection to decrease the number of features and the computational time, and the new updating mechanism, which can overcome the limitations of traditional updating mechanisms by taking the number of features into account, which reduces the number of features and the computational time.