Miracle-dz/UniFAR-FTUs huggingface dataset:
Electro-mechanical coupling in nematic elastomers: statics and dynamics

SUMMARY. New analytical and computational results on the static and dynamic response of ne-matic elastomers to applied electric fields and mechanical loads are reviewed, and compared with the available experimental evidence. 1 INTRODUCTION Nematic elastomers display a peculiar mechanical response arising from the interplay between the electro-optical properties of liquid crystals and the elastic properties of a rubbery solid. They have been the subject of numerous studies in the recent literature, see [21] and the many references cited therein. Envisaged by the late P.G. de Gennes [5], nematic elastomers were synthesized at the end of the 80s [22], [15]. Early experiments [16], [17] have immediately shown their potential as materials for soft actuators (large spontaneous deformations which, as it is now known, can be activated thermally, by electric fields, or UV light). At the same time, these experiments have revealed a very rich and complex behavior: unusually soft elastic response to uniaxial stretching, akin to the phenomenon of super-elasticity in shape memory alloys, and stripe domain instabilities, which are reminiscent of mechanical twinning. The interest in the theoretical understanding of the behavior of nematic elastomers has been strong and sustained, starting from the pioneering paper of de The goal of this paper is to present some new analytical and computational results on the static and dynamic response of nematic elastomers to applied electric fields and mechanical loads. As discussed in [11], these results can be used to understand both the classical stretching experiments in [16], [17] and the more recent experimental measurements contained in [18], [19], and [12].
Quantum fluctuations and correlations of spatial scalar or multimode vector solitons in Kerr media

We apply the Green function method to determine the global degree of squeezing and the transverse spatial distribution of quantum fluctuations of solitons in Kerr media. We show that both scalar bright solitons and multimode vector solitons experience strong squeezing on the optimal quadrature. For vector solitons, this squeezing is shown to result from an almost perfect anti-correlation between the fluctuations in the two incoherently coupled circular polarizations.
Cumulative Effect of Psychosocial Factors in Youth on Ideal Cardiovascular Health in Adulthood: The Cardiovascular Risk in Young Finns Study

Background— The American Heart Association has defined a new metric of ideal cardiovascular health as part of its 2020 Impact Goals. We examined whether psychosocial factors in youth predict ideal cardiovascular health in adulthood. Methods and Results— Participants were 477 men and 612 women from the nationwide Cardiovascular Risk in Young Finns Study. Psychosocial factors were measured from cohorts 3 to 18 years of age at the baseline of the study, and ideal cardiovascular health was examined 27 years later in adulthood. The summary measure of psychosocial factors in youth comprised socioeconomic factors, emotional factors, parental health behaviors, stressful events, self-regulation of the child, and social adjustment of the child. There was a positive association between a higher number of favorable psychosocial factors in youth and greater ideal cardiovascular health index in adulthood (&bgr;=0.16; P<0.001) that persisted after adjustment for age, sex, medication use, and cardiovascular risk factors in childhood (&bgr;=0.15; P<0.001). The association was monotonic, suggesting that each increment in favorable psychosocial factors was associated with improvement in cardiovascular health. Of the specific psychosocial factors, a favorable socioeconomic environment (&bgr;=0.12; P<0.001) and participants’ self-regulatory behavior (&bgr;=0.07; P=0.004) were the strongest predictors of ideal cardiovascular health in adulthood. Conclusions— The findings suggest a dose-response association between favorable psychosocial factors in youth and cardiovascular health in adulthood, as defined by the American Heart Association metrics. The effect seems to persist throughout the range of cardiovascular health, potentially shifting the population distribution of cardiovascular health rather than simply having effects in a high-risk population.
Real-time rendering of billboard plants in a dynamic lighting environment

Realistic rendering of nature is still a very challenging task. Even a small part of a forest includes thousands of trees, shrubs and other plants. To achieve real-time rates it is necessary to use very simplified models. Since the foliage consists of many arbitrary orientated elements, standard level of detail methods producing inaccurate results. Decoret et al. [Decoret et al. 2003] introduced billboard clouds to reduce the complexity of polygonal models. A modified version of this approach can be used for plants as well. A tree is converted into a collection of billboards, that are representing individual parts of the original object. This method however leads to problems when rendering the new models, because the position and normal of the elements were changed during the creation process. In our sketch we present a new approach to render billboard plants in a dynamic low-frequency lighting environment. A additional illumination texture enables us to include many lighting effects like self-shadowing or subsurface scattering in real-time.
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

In this paper we improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set K ⊂ R<sup>n</sup> that is contained in a box of radius R we show how to either compute a point in K or prove that K does not contain a ball of radius ϵ using an expected O(n log(nR/ϵ)) evaluations of the oracle and additional time O(n<sup>3</sup> log<sup>O(1)</sup>(nR/ϵ)). This matches the oracle complexity and improves upon the O(n<sup>ω+1</sup> log(nR/ϵ)) additional time of the previous fastest algorithm achieved over 25 years ago by Vaidya [91] for the current value of the matrix multiplication constant w <; 2.373 [98], [36] when R/ϵ = O(poly(n)). Using a mix of standard reductions and new techniques we show how our algorithm can be used to improve the running time for solving classic problems in continuous and combinatorial optimization. In particular we provide the following running time improvements: · Submodular Function Minimization: n is the size of the ground set, M is the maximum absolute value of function values and EO is the time for function evaluation. Our weakly and strongly polynomial time algorithms have a running time of O(n<sup>2</sup> log nM · EO + n<sup>3</sup> log<sup>O(1)</sup> nM) and O(n<sup>3</sup> log<sup>2</sup> n · EO + n<sup>4</sup> log<sup>O(1)</sup> n), improving upon the previous best of O((n<sup>4</sup> · EO + n<sup>5</sup>)logM) and O(n<sup>5</sup> · EO + n<sup>6</sup>) respectively. · Submodular Flow: n = |V|, m = |E|, C is the maximum edge cost in absolute value and U is maximum edge capacity in absolute value. We obtain a faster weakly polynomial running time of O(n<sup>2</sup> log nCU · EO + n<sup>3</sup> logO(1) nCU), improving upon the previous best of O(mn<sup>5</sup> log nU · EO) and O (n<sup>4</sup>h min {log C, log U}) from 15 years ago by a factor of Õ(n<sup>4</sup>). We also achieve faster strongly polynomial time algorithms as a consequence of our result on submodular minimization. · Matroid Intersection: n is the size of the ground set, r is the maximum size of independent sets, M is the maximum absolute value of element weight, T<sub>rank</sub> and T<sub>ind</sub> are the time for each rank and independence oracle query. We obtain a running time of O((nr log<sup>2</sup> nT<sub>rank</sub>+n<sup>3</sup> log<sup>O(1)</sup> n) log nM) and O((n<sup>2</sup> log nT<sub>ind</sub>+n<sup>3</sup> log<sup>O(1)</sup> n) log nM), achieving the first quadratic bound on the query complexity for the independence and rank oracles. In the unweighted case, this is the first improvement since 1986 for independence oracle. · Semidefinite Programming: n is the number of constraints, m is the number of dimensions and S is the total number of non-zeros in the constraint matrices. We obtain a running time of O(n(n<sup>2</sup> + m<sup>ω</sup> + S)), improving upon the previous best of Õ(n(n<sup>ω</sup> + m<sup>ω</sup> + S)) for the regime S is small.
Categorization of Computing Education Resources into the ACM Computing Classification System

The Ensemble Portal harvests resources from multiple heterogonous federated collections. Managing these dynamically increasing collections requires an automatic mechanism to categorize records in to corresponding topics. We propose an approach to use existing ACM DL metadata to build classifiers for harvested resources in the Ensemble project. We also present our experience on utilizing the Amazon Mechanical Turk platform to build ground truth training data sets from Ensemble collections.
Terra: a Collection of Translation Error-Annotated Corpora

Recently the first methods of automatic diagnostics of machine translation have emerged; since this area of research is relatively young, the efforts are not coordinated. We present a collection of translation error-annotated corpora, consisting of automatically produced translations and their detailed manual translation error analysis. Using the collected corpora we evaluate the available state-of-the-art methods of MT diagnostics and assess, how well the methods perform, how they compare to each other and whether they can be useful in practice.
Monocular optical flow for real-time vision systems

This paper introduces a monocular optical flow algorithm that has been shown to perform well at nearly real-time frame rates (4 FPS on a 100 MHz SGI Indy workstation), using natural image sequences. The system is completely bottom-up, using pixel region-matching techniques. A coordinated gradient descent method is broken down into two stages: pixel region matching error measures are locally minimized and flow field consistency constraints apply nonlinear adaptive diffusion, causing confident measurements to influence their less confident neighbors. Convergence is usually accomplished with one iteration for an image frame pair. Temporal integration predicts upcoming flow fields. The algorithm is designed for flexibility: large displacements are tracked as easily as sub-pixel displacements, and higher-level information can feed flow field predictions into the measurement process.
A pseudo stereo vision system as a sensor for real time path control of a robot

In this paper, the design and the construction of a new system for stereo vision using planar mirrors and a single camera is presented. Two superimposed stereo images are received simultaneously as a complex image and using a proper algorithm, disparities and depth of objects of the scene can be obtained. Two virtual cameras are created from this pseudo stereo vision system (PSVS) with exactly the same geometric properties, parameters and angular FOV of the real camera. This vision system has no moving parts, its construction is quite simple and it is mechanically robust. Thus, it is easy for this system to be mounted to the end effector of a robotic manipulator or to a mobile robot.
Typing Weakly Normalizable Terms Via Intersection Types And Expansion Variables

On June 4, 1996 an unmanned Ariane 5 rocket launched by the European Space Agency exploded forty seconds after its takeoff from Kourou, French Guiana. This marked the rocket’s inaugural voyage after a period of development spanning 10 years and costing in excess of $7 billion. In the weeks following the explosion it was determined that the cause of the failure was a software bug. A 64 bit floating point number representing the horizontal velocity of the rocket was converted to a 16 bit signed integer. Since the resulting number was greater than 32,767 (the largest integer storable in a 16 bit signed integer), the conversion failed. The history of software engineering is littered with examples of programming errors. Despite years of expensive research into the failures of software systems, today’s software is notorious for being buggy, unreliable, and incapable of exploiting the full power of our hardware. It has been demonstrated that type systems can reduce at compile time (i.e., statically) the frequency and severity of many programming errors. Statically type-checked programs perform more efficiently than their dynamically type-checked counterparts. Moreover, the use of types to direct the compilation process can further improve performance. The purpose of program analysis is to ensure that a software system behaves correctly with respect to some specification. Many type-based program analyses have worked best as a form of whole-program analysis. This means that a change to one part of the software system requires reanalyzing all parts. Today’s software systems are huge and necessarily modular (i.e., they are built up from smaller components). Source code is split into different modules and saved to many files that are updated at different times. Since most of the common program analysis techniques are not linear in complexity, requiring the reanalysis of a large program due to a single line change is extremely costly [5]. In such an environment, whole-program analysis is simply unmanageable. A modular approach is necessary.
A DCT-based data-hiding method to embed the color information in a JPEG grey level image

In this paper, we propose an original method to embed the color information of an image in a corresponding compressed grey-level image. The objective of this work is to allow free access to the compressed grey-level image and give color image access only if you own a secret key. This method is made of three major steps which are the color quantization, the ordering and the DCT-based data hiding. The novelty of this paper is to build an indexed image which is, in the same time, a semantically intelligible grey-level image. In order to obtain this particular indexed image, which should be robust to data hiding, we propose an original K color ordering algorithm. Finally, the DCT-based data-hiding method benefits from the used of an hybrid JPEG coder which allows to compress images with a Word Wide Web standard format and in the same time proposes a data-hiding functionality.
Integrative Data Analysis for Research in Developmental Psychopathology

Researchers from many disciplines have increasingly called for changes in research practices to be more transparent and rigorous. One of the changes prominently discussed is the utilization of quantitative research synthesis from multiple single studies, which we broadly refer to as integrative data analysis (IDA). The present chapter discusses how IDA can be particularly helpful for research in developmental psychopathology. We provide a broad overview of evidence-based quantitative approaches, covering different types of data, different analytical models, univariate and multivariate models, and complex research synthesis methods. We highlight the promise of utilizing individual participant-level data from multiple single studies or networks of single studies for analyzing multiple related parameters (or multiple endpoints) within the framework of quantitative research synthesis. We provide several data examples to illustrate some of these methods. Through the use of innovative strategies for IDA, we can strengthen our research practices and expand our knowledge base cumulatively.
Rocky 7: a next generation Mars rover prototype

This paper provides a system overview of a new Mars rover prototype, Rocky 7. We describe all system aspects: mechanical and electrical design, computer and software infrastructure, algorithms for navigation and manipulation, science data acquisition, and outdoor rover testing. In each area, the improved or added functionality is explained in a context of its path to flight and within the constraints of desired science missions.
Efficient packet matching for gigabit network intrusion detection using TCAMs

Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to deploy TCAMs as deep package matching engines for network intrusion detection systems (NIDS): long patterns matching and range patterns matching. A novel high speed long patterns matching architecture using cascade TCAMs for large signature set based NIDS is presented in this paper. Systems to handle tens of thousands of signatures with thousands of bytes length each can be built on such architecture. A novel efficient header rules matching system is proposed in this paper. This scheme offloads the range matching task to efficient specialized comparing engines in FPGAs so that it soIves the range matching problem with high throughout performance, about 250 million packets per second (Mpps) theoretically.
On the Security of MTA-OTIBASs (Multiple-TA One-Time Identity-Based Aggregate Signatures)

In [3] the authors proposed a new aggregate signature scheme referred to as multiple-TA (trusted authority) one-time identity-based aggregate signature (MTA-OTIBAS). Further, they gave a concrete MTA-OTIBAS scheme. We recall here the definition of MTA-OTIBAS and the concrete proposed scheme. Then we prove that our MTA-OTIBAS concrete scheme is existentially unforgeable against adaptively chosen-message attacks in the random oracle model under the co-CDH problem assumption.
Transience of Multiclass Queueing Networks Via Fluid Limit Models

This paper treats transience for queueing network models by considering an asso(cid:2) ciated (cid:3)uid model(cid:4) If starting from any initial condition the (cid:3)uid model explodes at a linear rate(cid:5) then the associated queueing network with i(cid:4)i(cid:4)d(cid:4) service times and a renewal arrival process explodes faster than any fractional power(cid:4)
High-altitude Pulmonary Hypertension: an Update on Disease Pathogenesis and Management

High-altitude pulmonary hypertension (HAPH) affects individuals residing at altitudes of 2,500 meters and higher. Numerous pathogenic variables play a role in disease inception and progression and include low oxygen concentration in inspired air, vasculopathy, and metabolic abnormalities. Since HAPH affects only some people living at high altitude genetic factors play a significant role in its pathogenesis. The clinical presentation of HAPH is nonspecific and includes fatigue, shortness of breath, cognitive deficits, cough, and in advanced cases hepatosplenomegaly and overt right-sided heart failure. A thorough history is important and should include a search for additional risk factors for lung disease and pulmonary hypertension (PH) such as smoking, indoor air pollution, left-sided cardiac disease and sleep disordered breathing. Twelve-lead electrocardiogram, chest X-ray and echocardiography can be used as screening tools. A definitive diagnosis should be made with right-sided heart catheterization using a modified mean pulmonary artery pressure of at least 30 mm Hg, differing from the 25 mm Hg used for other types of PH. Treatment of HAPH includes descent to a lower altitude whenever possible, oxygen therapy and the use of medications such as endothelin receptor antagonists, phosphodiesterase 5 blockers, fasudil and acetazolamide. Some recent evidence suggests that iron supplementation may also be beneficial. However, it is important to note that the scientific literature lacks long-term randomized controlled data on the pharmacologic treatment of HAPH. Thus, an individualized approach to treatment and informing the patients regarding the benefits and risks of the selected treatment regimen are essential.
Effect of multi-word features on the hierarchical clustering of web documents

Contemporary search engines and other automated web tools are faced with the task of extracting relevant information from huge web archives. This is supposed to be a difficult task due to the semi-structured and unstructured nature of the web documents. Users need automated ways of organizing and cataloging the web documents so that they can be queried efficiently. Clustering is typically employed to organize web archives and to subsequently handle user queries. This paper analyzes the effect of including multi-word features on the performance of a hierarchical clustering algorithm. Noun sequences are the predominant features considered in our work, while most of the previous research uses n-grams as features. The paper also analyzes the effect of combining link and content based representations for the web documents and their inter-relationships on the clustering performance. Empirical evaluation of the hierarchical clustering engine suggests that including multi-word features enhances the performance of the hierarchical clustering algorithm with respect to precision.
Multi-channel segmental hidden markov models for sports video mining

We present a new multi-channel segmental hidden Markov model (MCSHMM) for sports video mining that is a unique probabilistic graphical model with two advantages. One is the integration of both hierarchical and parallel structures that offer more flexibility and capacity of capturing the interaction between multiple Markov chains. The other is the incorporation of the segmental HMM that represents a variable-length sequence of observations. Especially, we develop a maximum a posteriori (MAP) estimator to optimize model structures and model parameters simultaneously. The proposed MCSHMM is used for American football video analysis, where two semantics structures, play types and camera views, are involved. The experiment shows that the MCSHMM outperforms previous HMM-based approaches.
Embryonic and Postnatal Expression of Aryl Hydrocarbon Receptor mRNA in Mouse Brain

Aryl hydrocarbon receptor (AhR), a member of the basic helix-loop-helix-Per-Arnt-Sim transcription factor family, plays a critical role in the developing nervous system of invertebrates and vertebrates. Dioxin, a ubiquitous environmental pollutant, avidly binds to this receptor, and maternal exposure to dioxin has been shown to impair higher brain functions and dendritic morphogenesis, possibly via an AhR-dependent mechanism. However, there is little information on AhR expression in the developing mammalian brain. To address this issue, the present study analyzed AhR mRNA expression in the brains of embryonic, juvenile, and adult mice by reverse transcription (RT)-PCR and in situ hybridization. In early brain development (embryonic day 12.5), AhR transcript was detected in the innermost cortical layer. The mRNA was also expressed in the hippocampus, cerebral cortex, cerebellum, olfactory bulb, and rostral migratory stream on embryonic day 18.5, postnatal days 3, 7, and 14, and in 12-week-old (adult) mice. Hippocampal expression was abundant in the CA1 and CA3 pyramidal and dentate gyrus granule cell layers, where expression level of AhR mRNA in 12-week old is higher than that in 7-day old. These results reveal temporal and spatial patterns of AhR mRNA expression in the mouse brain, providing the information that may contribute to the elucidation of the physiologic and toxicologic significance of AhR in the developing brain.