Miracle-dz/UniFAR-FTUs huggingface dataset:
The Relation of Childhood BMI to Adult Adiposity: The Bogalusa Heart Study

Objective. Although many studies have found that childhood levels of body mass index (BMI; kg/m2) are associated with adult levels, it has been reported that childhood BMI is not associated with adult adiposity. We further examined these longitudinal associations. Design. Cohort study based on examinations between 1973 and 1996. Setting. Bogalusa, Louisiana. Participants. Children (2610; ages 2-17 years old) who were followed to ages 18 to 37 years; the mean follow-up was 17.6 years. Main Outcome Measures. BMI-for-age and triceps skinfold thickness (SF) were measured in childhood. Subscapular and triceps SFs were measured among adults, and the mean SF was used as an adiposity index. Adult obesity was defined as a BMI ≥ 30 kg/m2 and adult overfat as a mean SF in the upper (gender-specific) quartile. Results. Childhood levels of both BMI and triceps SF were associated with adult levels of BMI and adiposity. The magnitude of these longitudinal associations increased with childhood age, but the BMI levels of even the youngest (ages 2-5 years) children were moderately associated (r = 0.33-0.41) with adult adiposity. Overweight (BMI-for-age ≥ 95th centile) 2- to 5-year-olds were >4 times as likely to become overfat adults (15 of 23 [65%]), as were children with a BMI < 50th centile (30 of 201 [15%]). Even after accounting for the triceps SF of children, BMI-for-age provided additional information on adult adiposity. Conclusions. Childhood BMI is associated with adult adiposity, but it is possible that the magnitude of this association depends on the relative fatness of children.
The synthesis of ninety proteins including actin throughout the HeLa cell cycle

Abundant cytoplasmic proteins pulse-labeled with [35S]methionine at specific times throughout the HeLa cell cycle were analyzed with two- dimensional gel electrophoresis. More than 300 proteins could be resolved in this way. The frequency of appearance of label in the most abundant 90 proteins, ranging from 4% to less than 0.1% of the total methionine incorporated, was determined at six time points in the cell cycle. 84 of these proteins were made as a similar proportion of the total at all times during the cell cycle. A nonmuscle actin protein (spot 1) identified by molecular weight and isoelectric point represented 2-4% of the total methionine incorporated at all the time points. Only six proteins were found which varied by greater than fourfold during cell division, four appearing to represent a greater proportion of the total synthesis during the period at or immediately surrounding M (spots 31b, 44, 53, and 70d). Two appear to represent a smaller percentage of total synthesis during the early (spot 78) or the total (spot 74) G2 period.
Novel Audio Features for Music

4 Abstract— This work advances the music emotion recognition state-of-the-art by proposing novel emotionally-relevant audio features. 5 We reviewed the existing audio features implemented in well-known frameworks and their relationships with the eight commonly 6 deﬁned musical concepts. This knowledge helped uncover musical concepts lacking computational extractors, to which we propose 7 algorithms - namely related with musical texture and expressive techniques. To evaluate our work, we created a public dataset of 900 8 audio clips, with subjective annotations following Russell’s emotion quadrants. The existent audio features (baseline) and the proposed 9 features (novel) were tested using 20 repetitions of 10-fold cross-validation. Adding the proposed features improved the F1-score to 10 76.4 percent (by 9 percent), when compared to a similar number of baseline-only features. Moreover, analysing the features relevance 11 and results uncovered interesting relations, namely the weight of speciﬁc features and musical concepts to each emotion quadrant, and 12 warrant promising new directions for future research in the ﬁeld of music emotion recognition, interactive media, and novel music 13 interfaces. 14
Equations Of Radiation Hydrodynamics

Thank you for downloading equations of radiation hydrodynamics. Maybe you have knowledge that, people have look hundreds times for their chosen novels like this equations of radiation hydrodynamics, but end up in malicious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they cope with some infectious bugs inside their laptop. equations of radiation hydrodynamics is available in our digital library an online access to it is set as public so you can download it instantly. Our book servers spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the equations of radiation hydrodynamics is universally compatible with any devices to read.
Impairment of erbB 1 receptor and fluid-phase endocytosis and associated mitogenic signaling by inositol hexaphosphate in human prostate carcinoma DU 145 cells

Recently, we observed that epidermal growth factor receptor (EGFR or erbB1) endocytosis and associated mitogenic signaling occur in human prostate cancer (PCA) cells, suggesting that erbB1 endocytosis might be involved in advanced and androgen-independent PCA growth. Based on these findings, and the fact that aberrant expression of erbB family members is common in human prostatic intraepithelial neoplasia and invasive PCA, we reasoned that impairment of erbB1 endocytosis and associated mitogenic signaling might inhibit PCA growth. Inositol hexaphosphate (IP6) interacts with plasma membrane clathrin-associated protein complex 2 (AP2) and inhibits phosphatidylinositol 3-kinase (PI3K). As these are essential components of receptor-mediated and fluid-phase endocytosis, respectively, we reasoned that IP6 might impair erbB1 endocytosis and associated signaling in human PCA cells, leading to their growth inhibition. IP6 strongly to completely inhibited (26–100%; P < 0.05) transforming growth factor α-induced binding of activated erbB1 to AP2 in human PCA DU145 cells, demonstrating the impairment of the initial step in ligand-induced erbB1 endocytosis. IP6 treatment of cells resulted in a dose-dependent increase (1.8to 7.7-fold compared with cells treated with ligand alone; P < 0.05) in levels of activated erbB1. These two findings suggest that the inhibitory effect of IP6 on receptor endocytosis is independent of its lack of effect on ligandinduced erbB1 activation. These effects of IP6, however, were associated with strong inhibition of ligand-induced Shc phosphorylation (77–84% decrease; P < 0.05) and its binding to erbB1 (58–100% decrease; P < 0.05). IP6 also significantly and dose-dependently inhibited fluid-phase endocytosis (19–52%; P < 0.05). It inhibited PI3K–AKT signaling pathway as an upstream response in its effect on the inhibition of fluid-phase endocytosis. The inhibition of erbB1 receptor and fluid-phase endocytosis, and associated signaling by IP6, was corroborated by very strong to complete inhibition (70–100%; P < 0.05) of extracellular signal-regulated protein kinase 1/2 activation by IP6. IP6 significantly (P < 0.05) inhibited anchorage-dependent and
A Catalog of Elemental Neural Circuits

It is well-known that abstract neurons of the McCulloch-Pitts type compute input-output functions that are formally equivalent to suitably defined Boolean functions. Boolean functions, in turn, can be classified (up to isomorphism of underlying logical structure) into a limited number of basic types, each of which is non-isomorphic to each other type. These basic types are conveniently expressed by means of a canonic logical formula involving a minimal number of constituent operations. Each such canonic formula can be translated into an equivalent representation as a neural circuit, resulting in a catalog of basic, distinct neural circuits. Each circuit in this catalog computes a distinct Boolean function, and every Boolean function is computed by one such network, making this a kind of “periodic table” of elemental neural circuits. This brief article presents and discusses this catalog of circuits. An intriguing possibility raised by this analysis is that neural circuits in biological networks might, like the circuits in this catalog, tend to take forms that are minimally complex given the functions they compute—a kind of “principle of neural parsimony. ” The modern mathematical investigation of the properties of neural networks began with McCulloch and Pitts’s model of an “abstract neuron,” which sums D binary inputs, each either excitatory or inhibitory, and fires if and only if the total excitation meets or exceeds a predefined threshold θ. McCulloch and Pitts showed that networks of these simple devices were of extraordinary computational power, in fact equivalent to that of a Turing Machine or modern digital computer (McCulloch & Pitts, 1943). Underlying their proof is the idea that any abstract neuron, or circuit of abstract neurons, computes a Boolean function: that is, a mapping from D binary variables (the inputs on the abstract “dendrites”) to one variable (the output on the abstract “axon”). The mathematics of neural networks are thus inextricably tied up with the mathematics of Boolean functions. A similar relation exists between electrical circuit diagrams, of the type that illustrate textbooks on electrical engineering, and logical formulae, as one would find in a textbook of mathematical logic. The two representations are in a very I am grateful to Randy Gallistel for helpful discussions and to NSF SBR-9875175 for support. Please direct comments to the author at jacob@ruccs.rutgers. edu.
N 4215 : Towards Implementation and Use of memory order consume Doc . No . : WG 21 / N 4215 Date : 2014-1005 Reply to :

The most obscure member of the C11 and C++11 memory order enum seems to be memory order consume [27]. The purpose of memory order consume is to allow reading threads to correctly traverse linked data structures without the need for locks, atomic instructions, or (with the exception of DEC Alpha) memory-fence instructions, even though new elements are being inserted into these linked structures before, during, and after the traversal. Without memory order consume, both the compiler and (again, in the case of DEC Alpha) the CPU would be within their rights to carry out aggressive data-speculation optimizations that would permit readers to see pre-initialization values in the newly added data elements. The purpose of memory order consume is to prevent these optimizations. Of course, memory order acquire may be used as a substitute for memory order consume, however doing so results in costly explicit memory-fence instructions (or, where available, load-acquire instructions) on weakly ordered systems such as ARM, Itanium, and PowerPC [9, 3, 12, 13]. These systems enforce dependency ordering in hardware, in other words, if the address used by one memory-reference instruction depends on the value from a preceding load instruction, the hardware forces that earlier load to complete before the later memory-reference instruction commences. Similarly, if the data to be stored by a given store instruction depends on the value from a preceding load instruction, the hardware again forces that earlier load to complete before the later store instruction commences. Recent software tools for ARM and PowerPC can help explicate their memory models [19, 1, 2]. Note that strongly ordered systems like x86, IBM mainframe, and SPARC TSO enforce dependency ordering as a side effect of the fact that they do not reorder loads with subsequent memory
Human gait identification from extremely low-quality videos: an enhanced classifier ensemble method

Nowadays, surveillance cameras are widely installed in public places for security and law enforcement, but the video quality may be low because of the limited transmission bandwidth and storage capacity. In this study, the authors proposed a gait recognition method for extremely low-quality videos, which have a frame-rate at one frame per second (1 fps) and resolution of 32 × 22 pixels. Different from popular temporal reconstruction-based methods, the proposed method uses the average gait image (AGI) over the whole sequence as the appearance-based feature description. Based on the AGI description, the authors employed a large number of weak classifiers to reduce the generalisation errors. The performance can be further improved by incorporating the model-based information into the classifier ensemble. The authors found that the performance improvement is directly proportional to the average disagreement level of weak classifiers (i.e. diversity), which can be increased by using the model-based information. The authors evaluated the proposed method on both indoor and outdoor databases (i.e. the low-quality versions of OU-ISIR-D and USF databases), and the results suggest that our method is more general and effective than other state-of-the-art algorithms.
Mechanism Design in Social Networks

This paper studies an auction design problem for a seller to sell a commodity in a social network, where each individual (the seller or a buyer) can only communicate with her neighbors. The challenge to the seller is to design a mechanism to incentivize the buyers, who are aware of the auction, to further propagate the information to their neighbors so that more buyers will participate in the auction and hence, the seller will be able to make a higher revenue. We propose a novel auction mechanism, called information diffusion mechanism (IDM), which incentivizes the buyers to not only truthfully report their valuations on the commodity to the seller, but also further propagate the auction information to all their neighbors. In comparison, the direct extension of the well-known Vickrey-Clarke-Groves (VCG) mechanism in social networks can also incentivize the information diffusion, but it will decrease the seller's revenue or even lead to a deficit sometimes. The formalization of the problem has not yet been addressed in the literature of mechanism design and our solution is very significant in the presence of large-scale online social networks.
An improved algorithm for efficient iris based system

Nowadays, many applications require authentication to identify human before giving access to the resources. With new advances in technology, biometric technique of human authentication, which uses the human iris pattern, is well suited. Biometrics intends to identify a user by his/her physical and or/ behavioural characteristics. Among all biometric techniques, Iris recognition stands out as its error rates are lowest. Iris recognition includes eye imaging, localization, normalization, verification etc. This paper presents an overview of the fundamentals of biometric identification and tries to find out the effect of masking the normalized iris image on recognition rates.
Design of Excavator's Joint Module Using Virtual Reality Development Tool

Continuous growth of construction equipment industry increasingly demands training environment to utilize construction equipment. For this solution, training simulator using virtual reality technology has been studied. In this study, Quest3D was used as for virtual reality development tool. Design of joint module for construction equipment was interactive and real. Especially, realistic expression and high graphics quality was especially achieved to simulate mechanical movement in joint module.
A Technique for Presenting a Deceptive Dynamic Network

Adversaries scan Department of Defense networks looking for vulnerabilities that allow surveillance or the embedding of destructive malware weapons. In cyberspace, adversaries either actively probe or passively observe defended computer networks in attempts to determine, among other attributes, the topology of the network. We develop a novel strategic deceptive methodology, based on principles of military deception, for deceiving a malicious traceroute probe in defense of a physical data communications network. We construct a proof-of-concept network to show that a remote adversary who uses traceroute to map the defended network’s topology can be presented with a false route of the defender’s choosing. Akin to military deception operations in the field and at sea, a network that employs a deception scheme implemented on an intelligent border router can present a deceptive topology to an adversary. Our experiments show that a defender using our technique can successfully deceive a traceroute probe, the first in a sequence of steps to mount a credible deception scheme against an adversary.
Research on Chinese Paper-cut CAD System

The status of the Chinese paper-cut is not optimistic. How to use the latest technology and information technology to strengthen protection of this non-material cultural heritage and its cultural existence style, which is currently the focus of our research group. We find out the most basic element symbols of paper-cut from large quantities of images, and build the paper-cut basic elements database, the paper-cut commonly used symbols database, the paper-cut images database, lay a solid foundation for innovative forms & content of paper-cut. At the same time, we probe into composition of paper-cut art design system and its function from the system design ideas and structures and how to use it to lay a good foundation for the establishment of the CAD system.
Canny edge detection based on inertial product energy

The region inertial product energy concept combined with canny edge detection is presented here. It takes the place of the gradient amplitude by calculating the inertial product energy of n*n neighborhood region of central point. Based on inertial product energy and gradient direction, the non-maxima suppression can weaken the noise and tiny information of image effectively and better strike a balance between performance of noise suppression and accuracy of edge positioning in canny edge detection algorithm. The experiment on spatial images shows that this method is given with satisfactory results.
DiscoWeb: Applying Link Analysis to Web Search

How often does the search engine of your choice produce results that are less than satisfying, generating endless links to irrelevant pages even though those pages may contain the query keywords? How often are you given pages that tell you things you already know? While the search engines and related tools continue to make improvements in their information retrieval algorithms, for the most part they continue to ignore an essential part of the web – the links. We have found that link analysis can have significant contributions to web page retrieval from search engines, to web community discovery, and to the measurement of web page influence. It can help to rank results and find high-quality index/hub/link pages that contain links to the best sites on the topic of interest. Our work is based on research from IBM’s CLEVER project [7, 4, 6], Stanford’s Google [3], and the Web Archaeology research [2, 1] at Compaq’s Systems Research Center. These research teams have demonstrated some of the contributions that link analysis can make in the web. In our work, we have attempted to generalize and improve upon these approaches. Just as in citation analysis of published works, the most influential documents on the web will have many other documents recommending (pointing to) them. This idea underlies all link analysis efforts, from the straightforward technique of counting the number of incoming edges to a page, to the deeper eigenvector analysis used in our work and in those projects mentioned above. It turns out that the identification of “high-quality” web pages reduces to a sparse eigenvalue of the adjacency matrix of the linked graph [7, 3]. In 1998, Kleinberg [7] provided the analysis and substantial evidence that each eigenvector creates a web clustering which he called “web communities”. The most important web community corresponds to the principal eigenvector and the component values within each eigenvector represent a ranking of web pages. Determining the eigenvectors is computationally intensive since the linked graph can be quite large, e.g. each keyword search could result in millions of page hits. For this reason, the approach taken in most implementations is to determine only the principal eigenvector [7, 3], using the well-known power iterative method [5] for eigenvectors. If the initial approximation is the unit vector then the first iteration in the power method corresponds to the counting of the incoming and/or outgoing edges for each page of the web graph. There are certain advantages and disadvantages of this approach that we discuss below:
An Improved Two-Factor Authenticated Key Exchange Protocol in Public Wireless LANs

Recently, Lee et. al. carried out the cryptanalysis of Juang et. al. two-factor authentication key exchange protocol in Public wireless LANs. It was shown that Juang et.al. protocol is vulnerable to the stolen verifier attack and doesn't satisfy the user anonymity. Apart from the, high computational overhead of the server. This paper, proposes an improved protocol towards authentication and key exchange based on Elliptic Curve Decision Diffie-Hellman(DDH) problem which ensures their strong resistance towards the existing weaknesses. Besides this, their security and performance analysis shows that the proposed protocol is more secure and efficient.
DETECTION OF EQUATORWARD MERIDIONAL FLOW AND EVIDENCE OF DOUBLE-CELL MERIDIONAL CIRCULATION INSIDE THE SUN

Meridional flow in the solar interior plays an important role in redistributing angular momentum and transporting magnetic flux inside the Sun. Although it has long been recognized that the meridional flow is predominantly poleward at the Sun's surface and in its shallow interior, the location of the equatorward return flow and the meridional flow profile in the deeper interior remain unclear. Using the first 2 yr of continuous helioseismology observations from the Solar Dynamics Observatory/Helioseismic Magnetic Imager, we analyze travel times of acoustic waves that propagate through different depths of the solar interior carrying information about the solar interior dynamics. After removing a systematic center-to-limb effect in the helioseismic measurements and performing inversions for flow speed, we find that the poleward meridional flow of a speed of 15 m s−1 extends in depth from the photosphere to about 0.91 R☉. An equatorward flow of a speed of 10 m s−1 is found between 0.82 and 0.91 R☉ in the middle of the convection zone. Our analysis also shows evidence of that the meridional flow turns poleward again below 0.82 R☉, indicating an existence of a second meridional circulation cell below the shallower one. This double-cell meridional circulation profile with an equatorward flow shallower than previously thought suggests a rethinking of how magnetic field is generated and redistributed inside the Sun.
Adeno-Associated Virus-Based Gene Therapy for CNS Diseases

Gene therapy is at the cusp of a revolution for treating a large spectrum of CNS disorders by providing a durable therapeutic protein via a single administration. Adeno-associated virus (AAV)-mediated gene transfer is of particular interest as a therapeutic tool because of its safety profile and efficiency in transducing a wide range of cell types. The purpose of this review is to describe the most notable advancements in preclinical and clinical research on AAV-based CNS gene therapy and to discuss prospects for future development based on a new generation of vectors and delivery.