Miracle-dz/UniFAR-FTUs huggingface dataset:
Parental Socioeconomic Status and Weight Faltering in Infants in Japan

Background: Previous studies in the UK and Denmark found no significant association between low socioeconomic status (SES) and weight faltering. However, to our knowledge, there are no studies from other developed countries. We examined the association between parental SES and weight faltering in infants up to 1.5 years of age, and investigated whether the inequalities changed between 2001 and 2010 in Japan. Methods: We used data from two Japanese population-based birth cohorts started in 2001 (n = 34,594) and 2010 (n = 21,189). Parental SES was assessed as household income and parental education when the infant was 6 months old. Weight faltering was defined as the slowest weight gaining in 5% of all children in each cohort. Logistic regression analyses were conducted with adjustment for covariates. The relative index of inequality was used to assess relative impact of parental SES on weight faltering. Results: Infants in the lowest quartile of household income were 1.29 (95% confidence interval [CI]: 1.10, 1.52) and 1.27 (95% CI: 1.03, 1.56) times more likely to experience weight faltering than those in the highest income quartile both in the 2001 and 2010 cohorts, respectively. The relative index of inequality for household income was 1.66 (95% CI: 1.36, 1.96) in 2001 and 1.86 (95% CI: 1.42, 2.31) in 2010. Conclusions: Infants from lower income families have a greater risk of weight faltering in Japan. Additionally, the income-related inequalities in weight faltering did not change between the two cohorts. Social policies to address maldistribution of weight faltering due to household income are needed.
Gravity currents in aquatic canopies

A lock exchange experiment is used to investigate the propagation of gravity currents through a random array of rigid, emergent cylinders which represents a canopy of aquatic plants. As canopy drag increases, the propagating front varies from the classic profile of an unobstructed gravity current to a triangular profile. Unlike the unobstructed lock exchange, the gravity current in the canopy decelerates with time as the front lengthens. Two drag‐dominated regimes associated with linear and nonlinear drag laws are identified. The theoretical expression for toe velocity is supported by observed values. Empirical criteria are developed to predict the current regime from the cylinder Reynolds number and the array density.
An Adaptive Backpropagation Algorithm for Limited-Angle CT Image Reconstruction

Presented in this paper is a neural back propagation algorithm for reconstructing two-dimensional CT images from a small number of projection data. The paper extends the work in [1], in which a backpropagation algorithm is applied to the CT image reconstruction problem. The delta rule of the ordinary backpropagation algorithm is modified using a ‘secondary’ teaching signal and the ‘Resilient backpropagation’ scheme. Results obtained are presented along with those of two well known conventional methods: MART and EMML method. A quantitative evaluation reveals the effectiveness of the proposed algorithm. key words: backpropagation, CT image, EMML, MART, rprop
Guarded Actions

Guarded actions are changes with preconditions acting as a guard. Guarded action models are multimodal Kripke models with the valuations replaced by guarded actions. Call guarded action logic the result of adding product updates with guarded action models to PDL (propositional dynamic logic). We show that guarded action logic reduces to PDL. keywords Dynamic epistemic logic, logic of communication, logic of change, propositional dynamic logic, program transformation. ACM Classification (1998) E 4, F 4.1, H 1.1.
Candidate Lasserre Integrality Gap For Unique Games

We propose a candidate Lasserre integrality gap construction for the Unique Games problem. Our construction is based on a suggestion in [27] wherein the authors study the complexity of approximately solving a system of linear equations over reals and suggest it as an avenue towards a (positive) resolution of the Unique Games Conjecture. We use a new encoding scheme that we call the real code. The real code has two useful properties: like the long code, it has a unique local test, and like the Hadamard code, it has the so-called sub-code covering property. This write-up represents a part of a work in progress.
1 C-00334-2016 Revised 1 2 3 4 5 S-Nitrosylation and S-Glutathionylation of Cys 134 on troponin I have 6 opposing competitive actions on Ca 2 + sensitivity in rat fast-twitch muscle fibers

44 Nitric oxide is generated in skeletal muscle with activity and decreases Ca-sensitivity of the 45 contractile apparatus, putatively by S-nitrosylation of an unidentified protein. We investigate the 46 mechanistic basis of this effect and its relationship to the oxidation-induced increase in Ca47 sensitivity in mammalian fast-twitch (FT) fibers mediated by S-glutathionylation of Cys134 on 48 fast troponin I (TnIf). Force-[Ca] characteristics of the contractile apparatus in mechanically49 skinned fibers were assessed by direct activation with heavily Ca-buffered solutions. Treatment 50 with S-nitrosylating agents, S-nitrosoglutathione (GSNO) or S-nitroso-N-acetyl-penicillamine 51 (SNAP), decreased pCa50 (=-log10 [Ca] at half maximal activation) by ~-0.07 pCa units in rat 52 and human FT fibers without affecting maximum force, but had no effect on rat and human slow53 twitch fibers or toad or chicken FT fibers, which all lack Cys134. The Ca sensitivity decrease 54 was i) fully reversed with dithiothreitol or reduced glutathione, ii) at least partially reversed with 55 ascorbate, indicative of involvement of S-nitrosylation, and iii) irreversibly blocked by low 56 concentration of the alkylating agent, N-ethylmaleimide (NEM). The biotin-switch assay showed 57 that both GSNO and SNAP treatments caused S-nitrosylation of TnIf. S-glutathionylation 58 pretreatment blocked the effects of S-nitrosylation on Ca sensitivity, and vice-versa. 59 S-nitrosylation pretreatment prevented NEM from irreversibly blocking S-glutathionylation of 60 TnIf and its effects on Ca-sensitivity, and likewise S-glutathionylation pretreatment prevented 61 NEM block of S-nitrosylation. Following substitution of TnIf into rat slow-twitch fibers, 62 S-nitrosylation treatment caused decreased Ca-sensitivity. These findings demonstrate that 63 S-nitrosylation and S-glutathionylation exert opposing effects on Ca-sensitivity in mammalian 64 FT muscle fibers, mediated by competitive actions on Cys134 of TnIf. 65
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach

This paper presents a data routing protocol for a non-mobile, location-aware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environmental, infrastructure, under-water or agricultural monitoring). The protocol, in addition to optimally minimizing the total energy consumption of all sensors over all rounds of data gathering, also balances the load on them. The algorithm works in polynomial time complexity and is completely centralized. However, it incurs less overhead as the data routing information is disseminated to all sensors only once at the network initialization.
The world of combinatorial fuzzy problems and the efficiency of fuzzy approximation algorithms

We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomial-size fuzzy circuits composed of fuzzy gates. We also introduce fuzzy proof verification systems to model the fuzzification of nondeterminism. Those models help us identify four complexity classes: Fuzzy-FPA of fuzzy functions, Fuzzy-PA and Fuzzy-NPA of fuzzy decision problems, and Fuzzy-NPAO of fuzzy optimization problems. Based on a relative approximation scheme targeting fuzzy membership degree, we formulate two notions of "reducibility" in order to compare the computational complexity of two fuzzy problems. These reducibility notions make it possible to locate the most difficult fuzzy problems in Fuzzy-NPA and in Fuzzy-NPAO.
Thermal boundary conductance between carbon nanotubes and surrounding material by molecular dynamics simulations

The scaling down of feature size in electronics and nanodevices leads to increased concentration of heat. Management of the heat dissipation is currently the biggest limitation in building smaller and faster processors. Being motivated by a new use for carbon nanotubes as heat fins to cool nanosystems, this thesis aims to investigate the thermal boundary conductance between nanotubes and the surrounding materials, which is not well understood to this date. Characterization of the thermal boundary conductance is important also for electric devices in general as it determines the affordable electric load. The heat transport from a single-walled carbon nanotube (SWNT) to a matrix of surrounding liquid or solid argon (Ar), is simulated by molecular dynamics simulations. The entire SWNT was subjected to a pulse of heat to observe the interfacial heat transfer. Depending on the phase of the Ar, the key physics of the heat transfer at the interface are expected to range from random molecular collisions to modal energy transport based on the lattice vibrations (phonons). As a result, significant modal interactions were observed not only for solid but also for liquid Ar, since the liquid forms an adsorption layer around the SWNT with solid-like characteristics. The layer interacts strongly with the nanotube and suppresses vibrations (phonons) with a certain frequency band. Despite the considerable modal interaction, previously reported nanotube-length dependence of thermal conductance was not observed in the current simulations. The cause of the discrepancy is discussed by highlighting the difference of the two numerical studies. In conclusion, the thesis work characterized a key system for constructing thermal fins for the feature use in nanotechnology. The strong modal interaction observed between carbon nanotubes and the surrounding liquid Ar stimulates the idea to create thermal filters where a selected frequency bands can be assigned as the heat transfer channels between a carbon nanotube and the surrounding liquid.
Web based security with LOPass user authentication protocol in mobile application

Today, the internet has became most convenient and widely used media for people exchanging information and doing business over the internet such as accessing web based emails, online auctions or banking sites. But nowadays, accessing the internet is faced with many challenges. One of the most important challenges is to ensure security with vital role to provide security in websites. The text passwords are convenient and simplest form for a user authentication on websites and this level is more prone to security attacks. User mostly uses theses weak passwords and it is often used across several websites. The reuse of the same password in untrusted websites causes password threats. Hackers invoke password stealing methods to grab password such as phishing, malware and keyloggers. Hereby we propose the user authentication protocol named LOPass which creates long term password and one time password for authenticating the user. It has three phases as registration, login and recovery phase. In LOPass, random password is generated for each login. Registration is used for the registration of the user. Recovery phase is used, if the user's mobile phone gets lost. The user needs to remember only his long term password which is secret.
An Account of Geographic Concentration Patterns in Europe

Using entropy indices and associated bootstrap tests, we describe the distribution of economic sectors across Western European regions over the 1975-2000 period. We decompose geographic concentration into its within-country and between-country components. In addition, we estimate centre -periphery gradients in sectoral location patterns and the impact of EU membership on countries' internal geography. It is found that manufacturing has become gradually more concentrated, although the locational bias towards central regions has become weaker. Conversely, market services have been relocating towards centrally located regions. EU integration appears to have strengthened countries' internal concentration trends.
Resolution , Nonlinearity , Constraints , Confidence , Design , Minimax and Bayes

Of those things that can be estimated well in an inverse problem, which are best to estimate? Backus-Gilbert resolution theory answers a version of this question for linear (or linearized) inverse problems in Hilbert spaces with additive zero-mean errors with known, finite covariance, and no constraints on the unknown other than the data. This paper extends Backus-Gilbert resolution: it defines the resolution and Bayes resolution of an estimator, intrinsic minimax and Bayes resolution, and intrinsic minimax and Bayes design resolution. Intrinsic resolution is the smallest value of a penalty among functionals that can be estimated with controlled (minimax or Bayes) risk. Intrinsic minimax resolution includes Backus-Gilbert resolution and subtractive optimally localized averages (SOLA) as special cases. Intrinsic design resolution is the smallest value of a penalty among functionals that can be estimated with controlled (minimax or Bayes) risk using observations with a controlled acquisition cost. Intrinsic resolution wraps the classical problem of choosing an optimal estimator of an abstract parameter inside the problem of choosing an optimal parameter to estimate. Intrinsic design resolution adds another layer: optimizing what to observe. The definitions apply to inverse problems with constraints, to nonlinear inverse problems, to nonlinear and biased estimators, to general measures of risk (not just the variance of unbiased estimators), and to abstract penalties not necessarily related to “spread. ” For illustration, the resolution of “strict bounds” confidence intervals is defined.
Predictive Role of p53 Protein as a Single Marker or Associated with ki67 Antigen in Oral Leukoplakia: A Retrospective Longitudinal Study

Oral leukoplakia (OL) is the most common potentially malignant lesion of the oral cavity. Immunohistochemical analysis of p53 and Ki67 proteins is a simple and inexpensive method widely used in non-dysplastic OLs to reveal lesions predicted to develop oral cancer. The present longitudinal study evaluated the predictive role of p53 and Ki67 proteins alone or in combination in a group of OLs without dysplasia followed for many years. Seventy-seven OL patients referred to our Department between January 2006 and October 2013 underwent histochemical analysis of p53 and Ki67 expression. OLs were considered at high risk in the presence of either high p53 expression (>20%), or low/normal p53 expression associated with high Ki67 expression (Ki67/p53 ratio >3). Seven OLs evolved to OSCC during the follow-up period. Three cases had p53 overexpression, while four had a high Ki67/p53 ratio. Statistical significance was reached when samples with p53 overexpression were combined with samples with high Ki67/p53 ratio (Chi square 5.3; p<0.02). The combined immunohistochemical expression of p53 and Ki67 proteins could be a useful and simple molecular marker for early detection of non-dysplastic OLs at risk of developing oral cancer.
Sparse Beamforming and User-Centric Clustering for Downlink Cloud Radio Access Network

This paper considers a downlink cloud radio access network (C-RAN) in which all the base-stations (BSs) are connected to a central computing cloud via digital backhaul links with finite capacities. Each user is associated with a user-centric cluster of BSs; the central processor shares the user's data with the BSs in the cluster, which then cooperatively serve the user through joint beamforming. Under this setup, this paper investigates the user scheduling, BS clustering, and beamforming design problem from a network utility maximization perspective. Differing from previous works, this paper explicitly considers the per-BS backhaul capacity constraints. We formulate the network utility maximization problem for the downlink C-RAN under two different models depending on whether the BS clustering for each user is dynamic or static over different user scheduling time slots. In the former case, the user-centric BS cluster is dynamically optimized for each scheduled user along with the beamforming vector in each time-frequency slot, whereas in the latter case, the user-centric BS cluster is fixed for each user and we jointly optimize the user scheduling and the beamforming vector to account for the backhaul constraints. In both cases, the nonconvex per-BS backhaul constraints are approximated using the reweighted ℓ1-norm technique. This approximation allows us to reformulate the per-BS backhaul constraints into weighted per-BS power constraints and solve the weighted sum rate maximization problem through a generalized weighted minimum mean square error approach. This paper shows that the proposed dynamic clustering algorithm can achieve significant performance gain over existing naive clustering schemes. This paper also proposes two heuristic static clustering schemes that can already achieve a substantial portion of the gain.
Generating Perfect Reversals of Simple Linear-Codes GIT-CERCS-TR-03-04 May 20 , 2003

Bi-directional execution – executing forward as well as in reverse – is useful in many contexts. However, traditional techniques for bi-directional execution are not scalable, as they require infinite storage in the presence of “destructive” assignments. We present a new approach that eliminates the scalability problem for bi-directional execution of a class of functions called linear codes, which are sequences of assignments of arbitrary linear expressions to variables. Examples of linear codes include Fibonacci-like sequence generators, and operators such as shift, swap and rotate. We present an algorithm to generate perfect forward-reverse code pair from any given linear code, and show that any linear code can be perfectly inverted despite the presence of destructive assignments and apparent singularities in the input code. While existing techniques require memory size proportional to forward execution length, the code generated by our algorithm uses bounded amount of memory. The memory is proportional only to the number of variables in the given forward code, and is independent of both forward code size and forward execution length.
Regeneration Technique for Welding Nanostructured

High-carbon steels which are transformed into extremely fine bainite plates embedded in a matrix of carbon-enriched austenite have recently been developed, and have found commercial application in the manufacture of engineering components. However, because of the large carbon concentration, they cannot be welded and this limits the scope for their exploitation. A method is reported here by which the mixture of bainitic ferrite and retained austenite is regenerated to prevent the austenite that is generated by the heat input during welding, from transforming into brittle martensite. The microstructures of the fusion and austenitised zones were characterized by X-ray diffraction, scanning electron microscopes and transmission electron microscopy. Tensile and micro-hardness tests were carried out to evaluate the mechanical properties. The results show Corresponding author: Tel: +86-451-86418422; Fax: +86-451-86416186 E-mail: fangkunhit@163.com Materials and Design 50 (2013) 38-43 2 that a bead-on-plate weld with the tensile strength of 1850 MPa and the hardness of 600 HV can in principle be been achieved; these properties almost match those of the base metal.
Sentence-Based Active Learning Strategies for Information Extraction

Given a classifier trained on relatively few training examples, active learning (AL) consists in ranking a set of unlabeled examples in terms of how informative they would be, if manually labeled, for retraining a (hopefully) better classifier. An important text learning task in which AL is potentially useful is information extraction (IE), namely, the task of identifying within a text the expressions that instantiate a given concept. We contend that, unlike in other text learning tasks, IE is unique in that it does not make sense to rank individual items (i.e., word occurrences) for annotation, and that the minimal unit of text that is presented to the annotator should be an entire sentence. In this paper we propose a range of active learning strategies for IE that are based on ranking individual sentences, and experimentally compare them on a standard dataset for named entity extraction.
Solutions to Australian Unemployment: Three Perspectives - Solutions to Unemployment and Avoiding the 'Diabolical Trade-off': A Discussion

The aim of the paper is to help in the search for the appropriate policy responses to unemployment in Australia. In so doing, it must first address the question of what has caused the persistence of high unemployment in the past quarter of the century, following thirty years of very low unemployment (Figure 1). In the subsequent discussion of solutions, a distinction is highlighted between policies aimed at increasing employment in general, and policies that are more focused on the bottom end of the labour market. It is concluded that if we wish to make a substantial reduction in unemployment on a long-term basis, it is appropriate to adopt policies of both kinds. Further it is argued that they would be complementary.
The Implementation of Parallel Ant Colony Optimization Algorithm Based on MATLAB

At first the relationship between the volume of the data transmitted and the transmission time is tested and the analysis of the data shows that there is a significant linear relationship between the two in MATLAB Distributed Computing Engine. Then we give an implementation solution of the parallel ant colony optimization algorithm, and we also carried on the computation of a TSP example which shows a higher speedup and a better performance. All these show that the it is efficient and effective to use MATLAB to develop distributed computing application program.
Anxiety disorders and intimate partner violence: can the association be explained by coexisting conditions or borderline personality traits?

Abstract Intimate partner violence (IPV) is a serious, preventable public health problem. IPV perpetration is strongly associated with Anxiety disorders at the population level. We investigated whether the association could be explained by coexisting psychiatric conditions or Borderline personality traits, using a combined data-set of two National Household Surveys (n = 15,973). Results showed women were more likely to report perpetrating IPV than men. Anxiety disorders were associated with IPV. When coexisting psychiatric conditions together with a categorical diagnosis of Borderline Personality Disorder (BPD) were investigated as explanatory variables, 19.2% of the association between Anxiety disorders and IPV was explained. Using individual Borderline traits in place of a categorical diagnosis of BPD, 58.3% of the association was explained. In conclusion, the association between Anxiety disorders and IPV was partly, but not fully, explained by coexisting psychiatric conditions and individual Borderline traits. Perpetrators of IPV should be screened for Anxiety disorders and among those with Anxiety disorders, Borderline traits are important.