Miracle-dz/UniFAR-FTUs huggingface dataset:
Constraint on Stress Tensor from Slip on a Single Fault Plane

Given a fault plane and its slip vector, the stress tensor which caused the displacement is sought. Two constraints are considered: first, a geometrical constraint that the shear stress applied to the fault plane is parallel to the slip [Wallace, 1951; Bott, 1959]; second, . a frictional constraint that the shear to normal stress ratio equals tan<po [Coulomb, 1776]. Th1s is done in two steps. In a first step, the stress tensors that satisfy the geometrical constraint are soug~t. For tensors belonging to the vectorial space of solutions, shear and normal stress magm~udes become a function of the principal stress orientation s1, s2, s3 and are mapped, extendmg a study by McKenzie [1969]. The relationship between Mohr's [1882] (<Jn,'t) plane and these maps is described. In a second step, it is investigated which among these tensors also satisfy the frictional constraint. Within this more restricted vectorial space, there is a relationship between principal stress magnitudes, represented _! l 8 = (a1a2)/(a1 a3) and s = (a1a3)/a1, and the "Qrincipal stress orientation s1, s2, s3. Both the range of s and the spatial distribution of s1, s2, s3 are more restricted than when the geometrical constraint alone is considered. As when the geometrical constraint is solely considered [McKenzie, 1969], the principal stress orientations s1, s2, s3 may lie significantly away from and up to right angle to the P, B, Taxis. However, this can happen only in two cases: (1) either the effective stress difference, s, has reached a high value, which is unlikely to happen if enough pre-existing fractures are available to release the stress, or (2) a2 becomes close to either a1 or a3 and therefore barely distinguishable from it; in that case the delocalisation of the principal stress orientations is best described by a tendency for s2 to exchange role with either s1 or s3. When the stress difference remains small and a2 reasonably away from a1 and a3, sf, s2, s3 approach positions that we define as the Pf, B, Tf axis and that are obtained from the P, B, Taxis by a rotation of angle <po/2 around B and towards the slip vector. This explains why the P, B, T axis gives reasonable estimates of the principal stress orientations [Scheidegger, 1964] despite objections [McKenzie, 1969]. However, whenever the fault plane can be distinguished from the auxiliary plane, Pf, B, Tf should give a better estimate [Raleigh et al., 1972]. In an area where many fault planes are available and a uniform tensor is assumed, the scatter in the plane orientations contains information about both the relative position of a2, represented by 8, and the relative stress difference, s: the higher s or the closer 8 to either 0 or 1, the more scatter. This information could then be extracted by inverse methods. Because a friction law would constrain these inverse methods more tightly, it may show the necessity of non-uniform tensor to explain scattered fault planes. Celerier 11/21/88 8:54 PM
Microsatellite allele sizes: a simple test to assess their significance on genetic differentiation.

The mutation process at microsatellite loci typically occurs at high rates and with stepwise changes in allele sizes, features that may introduce bias when using classical measures of population differentiation based on allele identity (e.g., F(ST), Nei's Ds genetic distance). Allele size-based measures of differentiation, assuming a stepwise mutation process [e.g., Slatkin's R(ST), Goldstein et al.'s (deltamu)(2)], may better reflect differentiation at microsatellite loci, but they suffer high sampling variance. The relative efficiency of allele size- vs. allele identity-based statistics depends on the relative contributions of mutations vs. drift to population differentiation. We present a simple test based on a randomization procedure of allele sizes to determine whether stepwise-like mutations contributed to genetic differentiation. This test can be applied to any microsatellite data set designed to assess population differentiation and can be interpreted as testing whether F(ST) = R(ST). Computer simulations show that the test efficiently identifies which of F(ST) or R(ST) estimates has the lowest mean square error. A significant test, implying that R(ST) performs better than F(ST), is obtained when the mutation rate, mu, for a stepwise mutation process is (a) >/= m in an island model (m being the migration rate among populations) or (b) >/= 1/t in the case of isolated populations (t being the number of generations since population divergence). The test also informs on the efficiency of other statistics used in phylogenetical reconstruction [e.g., Ds and (deltamu)(2)], a nonsignificant test meaning that allele identity-based statistics perform better than allele size-based ones. This test can also provide insights into the evolutionary history of populations, revealing, for example, phylogeographic patterns, as illustrated by applying it on three published data sets.
Overexpression of Pex15p, a phosphorylated peroxisomal integral membrane protein required for peroxisome assembly in S.cerevisiae, causes proliferation of the endoplasmic reticulum membrane

We have cloned PEX15 which is required for peroxisome biogenesis in Saccharomyces cerevisiae. pex15Δ cells are characterized by the cytosolic accumulation of peroxisomal matrix proteins containing a PTS1 or PTS2 import signal, whereas peroxisomal membrane proteins are present in peroxisomal remnants. PEX15 encodes a phosphorylated, integral peroxisomal membrane protein (Pex15p). Using multiple in vivo methods to determine the topology, Pex15p was found to be a tail‐anchored type II (Ncyt–Clumen) peroxisomal membrane protein with a single transmembrane domain near its carboxy‐terminus. Overexpression of Pex15p resulted in impaired peroxisome assembly, and caused profound proliferation of the endoplasmic reticulum (ER) membrane. The lumenal carboxy‐terminal tail of Pex15p protrudes into the lumen of these ER membranes, as demonstrated by its O‐glycosylation. Accumulation in the ER was also observed at an endogenous expression level when Pex15p was fused to the N‐terminus of mature invertase. This resulted in core N‐glycosylation of the hybrid protein. The lumenal C‐terminal tail of Pex15p is essential for targeting to the peroxisomal membrane. Furthermore, the peroxisomal membrane targeting signal of Pex15p overlaps with an ER targeting signal on this protein. These results indicate that Pex15p may be targeted to peroxisomes via the ER, or to both organelles.
Investigating the Relationship between Serum Level of s-Met (Soluble Hepatic Growth Factor Receptor) and Preeclampsia in the First and Second Trimesters of Pregnancy

Introduction. Preeclampsia (PE) is an important cause of mortality and morbidity for mothers, fetuses, and the newborns. Placenta plays a pivotal role in pathogenesis of PE. Hepatic growth factor (HGF) is a cytokine expressed by the mesenchymal stalk of placental villi during pregnancy and assumes a paracrine role in trophoblasts which express its receptor (c-MET). In the present study, we investigate the diagnostic value of s-Met (the soluble form of the receptor) in the first and second trimesters of pregnancy for early diagnosis of preeclampsia. Method and Materials. This is a case-control study conducted on 95 pregnant women. The serum level of s-Met was measured in the first and second trimesters, and the participants were followed until delivery. 44 individuals with preeclampsia (the case group) and 51 individuals without preeclampsia (the control group) were evaluated. Results. Serum level of s-Met in preeclamptic participants was lower than that of the control group in both the first and the second trimesters (P < 0.0001). In addition, serum levels of s-Met were significantly lower during the first and second trimesters in patients with early, severe preeclampsia compared to those with late, mild preeclampsia (P < 0.0001). The sensitivity and specificity of s-Met in the first and second trimesters were, respectively, (83%, 94%) and (77%, 94%) for early preeclampsia and (88%, 92%) and (86%, 98%) for severe preeclampsia. Conclusion. Considering our findings, serum level of s-Met may be used as a predictive factor for early detection of preeclampsia. Further research is required to corroborate the functional and therapeutic value of s-Met in preeclampsia.
Behaviour Mining for Fraud Detection

Despite significant efforts by merchants, card issuers and law enforcement to curb fraud, online fraud continues to plague electronic commerce web sites. More advanced solutions are desired to protect merchants from the constantly evolving problem caused by fraud. The supervised machine learning technique for the most well known fraud detection algorithms makes them inadequate for an online system, which usually contains a mammoth size of non-stationery data. This paper describes a method to dynamically create user profile for the purpose of fraud detection. We use a data mining algorithm to adaptively profile legitimate customer behaviour in a form of association rule set from a transaction database. Then the incoming transactions are compared against the user profile to indicate the anomalies. A novel pattern match approach is proposed to evaluate how unusual the new transactions are. An empirical evaluation shows that we can accurately differentiate the anomaly behaviour from profiled user behaviour.
Kinetics of brain nicotine accumulation in dependent and nondependent smokers assessed with PET and cigarettes containing 11C-nicotine

Tobacco smoking is a chronic, relapsing disorder that constitutes one of the primary preventable causes of death in developed countries. Two of the popular hypotheses to explain the development and maintenance of strong nicotine dependence in cigarette smokers posit (i) a rapid brain nicotine accumulation during cigarette smoking and/or (ii) puff-associated spikes in brain nicotine concentration. To address these hypotheses, we investigated the dynamics of nicotine accumulation in the smoker's brain during actual cigarette smoking using PET with 3-s temporal resolution and 11C-nicotine loaded into cigarettes. The results of the study, performed in 13 dependent smokers (DS) and 10 nondependent smokers (NDS), suggest that puff-associated spikes in the brain nicotine concentration do not occur during habitual cigarette smoking. Despite the presence of a puff-associated oscillation in the rate of nicotine accumulation, brain nicotine concentration gradually increases during cigarette smoking. The results further suggest that DS have a slower process of brain nicotine accumulation than NDS because they have slower nicotine washout from the lungs and that DS have a tendency to compensate for their slower rate of brain nicotine accumulation compared with NDS by inhaling a larger volume of smoke. For these reasons, smokers’ dependence on cigarette smoking, or the resistance of NDS to becoming dependent, cannot be explained solely by a faster brain nicotine accumulation.
Dynamic quorum policy for maximizing throughput in limited information multiparty MAC

In multiparty MAC, a sender needs to transmit each packet to a set of receivers within its transmission range. Bandwidth efficiency of wireless multiparty MAC can be improved substantially by exploiting the fact that several receivers can be reached at the MAC layer by a single transmission. Multiparty communication, however, requires new design paradigms since systematic design techniques that have been used effectively in unicast and wireline multicast do not apply. For example, a transmission policy that maximizes the stability region of the network need not maximize the network throughput. Therefore, the objective is to design a policy that maximizes the system throughput subject to maintaining stability. We present a sufficient condition that can be used to establish the throughput optimality of a stable transmission policy. We subsequently design a distributed adaptive stable policy that allows a sender to decide when to transmit using simple computations. The computations are based only on limited information about current transmissions in the sender's neighborhood. Even though the proposed policy does not use any network statistics, it attains the same throughput as an optimal offline stable policy that uses in its decision process past, present, and even future network states. We prove the throughput optimality of this policy using the sufficient condition and the large deviation results. We present a MAC protocol for acquiring the local information necessary for executing this policy, and implement it in ns-2. The performance evaluations demonstrate that the optimal policy significantly outperforms the existing multiparty schemes in ad hoc networks
BONE OVERGROWTH-ASSOCIATED MUTATIONS IN LRP 4 IMPAIR SCLEROSTIN-FACILITATOR FUNCTION

Olivier Leupin 1* , Elke Piters 2* , Christine Halleux 1 , Shouih Hu 1 , Ina Kramer 1 , Frederic Morvan 1 , Tewis Bouwmeester 3,4 , Markus Schirle 5 , Manuel Bueno-Lozano 6 , Feliciano J Ramos Fuentes 6 , Peter H Itin 7 , Eveline Boudin 2 , Fenna de Freitas 2 , Karen Jennes 2 , Barbara Brannetti 8 , Nadine Charara 9 , Hilmar Ebersbach 9 , Sabine Geisse 9 , Chris X. Lu 10 , Andreas Bauer 3,4 , Wim Van Hul 2 and Michaela Kneissel 1
Reactive Oxygen Species as a Signal in Glucose-Stimulated Insulin Secretion

One of the unique features of β-cells is their relatively low expression of many antioxidant enzymes. This could render β-cells susceptible to oxidative damage but may also provide a system that is sensitive to reactive oxygen species as signals. In isolated mouse islets and INS-1(832/13) cells, glucose increases intracellular accumulation of H2O2. In both models, insulin secretion could be stimulated by provision of either exogenous H2O2 or diethyl maleate, which raises intracellular H2O2 levels. Provision of exogenous H2O2 scavengers, including cell permeable catalase and N-acetyl-l-cysteine, inhibited glucose-stimulated H2O2 accumulation and insulin secretion (GSIS). In contrast, cell permeable superoxide dismutase, which metabolizes superoxide into H2O2, had no effect on GSIS. Because oxidative stress is an important risk factor for β-cell dysfunction in diabetes, the relationship between glucose-induced H2O2 generation and GSIS was investigated under various oxidative stress conditions. Acute exposure of isolated mouse islets or INS-1(832/13) cells to oxidative stressors, including arsenite, 4-hydroxynonenal, and methylglyoxal, led to decreased GSIS. This impaired GSIS was associated with increases in a battery of endogenous antioxidant enzymes. Taken together, these findings suggest that H2O2 derived from glucose metabolism is one of the metabolic signals for insulin secretion, whereas oxidative stress may disturb its signaling function.
LAND-USE PLANNING FOR ZERO-ENERGY-BUILDINGS: COMPARISON OF FOUR HIGH-DENSITY CITIES

A net approach to Zero-Energy-Building (Net ZEB) requires all energy demand to be met by on-site generation of renewable energy. An off-site ZEB with compensating measure (off-site ZEB_CM) allows off-site land to be used if the energy demand cannot be met due to the urban arrangement of buildings. A method is developed for evaluating the potential and risk of Net ZEB and off-site ZEB_CM in densified urban situations by examining their land-use requirement onor off-site. Four cities with different climates are modelled: Singapore, Cairo, Beijing and Hamburg. The preliminary results indicate that (1) the rate of change in CM per unit of area of use is not a constant number and varies with numbers of storeys, urban density and climate zone; (2) to save land for the compensating measure, a small number of storeys should be used; (3) to save land in general, high plot ratio should be used. Within a high-density situation, a small number of storeys should be used. This research contributes to the discussion about urban sprawl and compact city by investigating the relationship between urban fabric and energy harvesting. It may encourage the land-use policy makers to include land-use requirement of renewable energy harvesting.
Exhaustible Sets in Higher-type Computation

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate holds or else tells there is no example. The Cantor space of infinite sequences of binary digits is known to be searchable. Searchable sets are exhaustible, and we show that the converse also holds for sets of hereditarily total elements in the hierarchy of continuous functionals; moreover, a selection functional can be constructed uniformly from a quantification functional. We prove that searchable sets are closed under intersections with decidable sets, and under the formation of computable images and of finite and countably infinite products. This is related to the fact, established here, that exhaustible sets are topologically compact. We obtain a complete description of exhaustible total sets by developing a computational version of a topological Arzela--Ascoli type characterization of compact subsets of function spaces. We also show that, in the non-empty case, they are precisely the computable images of the Cantor space. The emphasis of this paper is on the theory of exhaustible and searchable sets, but we also briefly sketch applications.
Optimized flight path for 3D mapping of an area with structures using a multirotor

This paper presents an optimized method to employ a multirotor for collecting images to generate a 3D map of an area of interest with attention to man-made structures in the area. A genetic algorithm is combined with space partitioning methods to find an optimized path to ensure complete coverage of a desired area with necessary overlap for generating a 3D map. This path provides for the collection of detailed information of man-made structures within the area and also consider areas of avoidance and adjust for problematic terrain (such as tall vegetation). The result is a flight path for a multirotor that includes waypoint, altitude, heading, and camera angle for all points along the flight path. This allows for the collection of all necessary images to produce a 3D map of the area with high resolution models of the buildings within the area.
Neural Tumor-Initiating Cells Have Distinct Telomere Maintenance and Can be Safely Targeted for Telomerase Inhibition

Purpose: Cancer recurrence is one of the major setbacks in oncology. Maintaining telomeres is essential for sustaining the limitless replicative potential of such cancers. Because telomerase is thought to be active in all tumor cells and normal stem cells, telomerase inhibition may be nonspecific and have detrimental effects on tissue maintenance and development by affecting normal stem cell self-renewal. Methods: We examined telomerase activity, telomere maintenance, and stem cell maturation in tumor subpopulations from freshly resected gliomas, long-term, primary, neural tumor-initiating cells (TIC) and corresponding normal stem cell lines. We then tested the efficacy of the telomerase inhibitor Imetelstat on propagation and self-renewal capacity of TIC and normal stem cells in vitro and in vivo. Results: Telomerase was undetectable in the majority of tumor cells and specific to the TIC subpopulation that possessed critically short telomeres. In contrast, normal tissue stem cells had longer telomeres and undetectable telomerase activity and were insensitive to telomerase inhibition, which results in proliferation arrest, cell maturation, and DNA damage in neural TIC. Significant survival benefit and late tumor growth arrest of neuroblastoma TIC were observed in a xenograft model (P = 0.02). Furthermore, neural TIC exhibited irreversible loss of self-renewal and stem cell capabilities even after cessation of treatment in vitro and in vivo. Conclusions: TIC exhaustion with telomerase inhibition and lack of telomerase dependency in normal stem cells add new dimensions to the telomere hypothesis and suggest that targeting TIC with telomerase inhibitors may represent a specific and safe therapeutic approach for tumors of neural origin. Clin Cancer Res; 17(1); 111–21. ©2011 AACR.
An Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling

| Jobs arriving over time must be nonpreemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) on-line heuristic is a simple extension of the well known WSPT heuristic, which is optimal for the single machine problem without release dates. We prove that the WSPR heuristic is asymptotically optimal for all instances with bounded job processing requirements and weights. This implies that the WSPR algorithm generates a solution whose relative error approaches zero as the number of jobs increases. Our proof does not require any probabilistic assumption on the job parameters and relies extensively on properties of optimal solutions to a single machine relaxation of the problem.
Multi-layer traffic grooming in networks with an IP/MPLS layer on top of a meshed optical layer

Traffic grooming in networks employing WDM is gaining attention due to the difference between the bandwidth requirements of the traffic demands coming from the client layer and the capacity of a wavelength in an optical transport network (OTN). In this paper an algorithm for efficient traffic grooming in a multi-layer IP/MPLS-over-meshed OTN scenario is presented. It allows designing the IP/MPLS logical topology best suited to deal with the offered traffic pattern, taking into account the unidirectional and maybe asymmetric character of IP traffic. This multi-layer traffic grooming algorithm is based on the idea of charging the IP/MPLS layer for the capacity it consumes in the optical layer. In order to assess its performance, a comparison with other grooming approaches is made. The results show that our method allows for serious savings in the overall network design cost. It also allows for a gradual capacity installation in the network, thus spreading the installation cost.