Miracle-dz/UniFAR-FTUs huggingface dataset:
Common genetic and environmental contributions to post-traumatic stress disorder and alcohol dependence in young women

Background The few genetically informative studies to examine post-traumatic stress disorder (PTSD) and alcohol dependence (AD), all of which are based on a male veteran sample, suggest that the co-morbidity between PTSD and AD may be attributable in part to overlapping genetic influences, but this issue has yet to be addressed in females. Method Data were derived from an all-female twin sample (n=3768) ranging in age from 18 to 29 years. A trivariate genetic model that included trauma exposure as a separate phenotype was fitted to estimate genetic and environmental contributions to PTSD and the degree to which they overlap with those that contribute to AD, after accounting for potential confounding effects of heritable influences on trauma exposure. Results Additive genetic influences (A) accounted for 72% of the variance in PTSD; individual-specific environmental (E) factors accounted for the remainder. An AE model also provided the best fit for AD, for which heritability was estimated to be 71%. The genetic correlation between PTSD and AD was 0.54. Conclusions The heritability estimate for PTSD in our sample is higher than estimates reported in earlier studies based almost exclusively on an all-male sample in which combat exposure was the precipitating traumatic event. However, our findings are consistent with the absence of evidence for shared environmental influences on PTSD and, most importantly, the substantial overlap in genetic influences on PTSD and AD reported in these investigations. Additional research addressing potential distinctions by gender in the relative contributions of genetic and environmental influences on PTSD is merited.
Black box modeling of steam distillation essential oil extraction system using ARMAX structure

In this paper, the temperature response of a steam distillation essential oil extraction system with a refilling line is modeled based on data collected using a dedicated acquisition system. The autoregressive moving average with exogenous input (ARMAX) model structure is assumed and the pseudo-random binary sequences (PRBS) signal was used to perturb the process. The optimization of ARMAX model structure such as model order criterions is discussed. The model order criterions includes the normalized sum of squared error (NSSE), Akaikepsilas Information Criterion (AIC), Akaikepsilas Final Prediction Error (FPE) and Rissanenpsilas Minimum Description Length (MDL). All criterions will be used to estimate the model order of the system based on the data. The system identification will be performed based on these selected model orders and the estimated models are denoted as ARMAX-NSSE, ARMAX-AIC, ARMAX-FPE and ARMAX-MDL respectively. All the models will be validated and compared in terms of coefficient of determination (R2), adjusted-R2 and normalized mean-square-error (NMSE). Overall, ARMAX-MDL provides best results. Finally, the results are discussed and concluded.
Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed under iterative decoding. In the past, lower bounds on the error exponent were derived. In this paper a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.
APPlaUSE: area and performance optimization in a unified placement and synthesis environment

We present a new methodology for high-level synthesis, which incorporates placement in an early phase of the synthesis process. This placement, prior to interconnect and storage allocation, allows for early and accurate estimates on area and net length. These cost factors are critical for the quality of the chip. The system has been implemented and extensive tests verify the estimates to be accurate.
Diversity analysis of bit-interleaved coded multiple beamforming with orthogonal frequency division multiplexing

For Multiple-Input Multiple-Output (MIMO) systems with frequency selective fading channels, Bit-Interleaved Coded Multiple Beamforming (BICMB) with Orthogonal Frequency Division Multiplexing (OFDM) can be employed to offer both spatial and multipath diversity, making it an important technique. Nevertheless, analyzing its diversity is a challenging problem. In this paper, the diversity analysis of BICMB-OFDM is carried out. First, the maximum achievable diversity is derived and a full diversity condition is proved. Then, the performance degradation due to the subcarrier correlation is investigated. Finally, the subcarrier grouping technique is applied to combat the performance degradation and provide multi-user compatibility.
Physical-layer network coding over wireless fading channel

This paper proposes a new combinational technology which is feasible to apply physical-layer network coding (PNC) to wireless fading channel. The key step of PNC is that sources broadcast signals simultaneously without orthogonal scheduling. Naturally, the signals overlap in the free space at the receivers. Since the signals from different sources are mutual independent, rooted on this rational assumption, an enhanced Joint Diagonalization Separation named Altering Row Diagonalization (ARD) algorithm is exploited to separate these signals by maximizing the cost function measuring independence among them. This APNC (ARD PNC) methodology provides an innovative apparatus to implement signal-level network coding at the presence of interference and without any priori information about channels in fading environments, thus a blind way. Besides throughput gains via fully utilization of channel degree of freedom, APNC diversity gains could be ensured by relaying selection. In conclusion, the proposed APNC performs well with higher bandwidth efficiency and lower error rate.
Recalculating the Net Use Gap: A Multi-Country Comparison of ITN Use versus ITN Access

Use of insecticide treated nets is widely recognized as one of the main interventions to prevent malaria and high use rates are a central goal of malaria programs. The gap between household ownership of at least one ITN and population use of ITN has in the past been seen as evidence for failure to achieve appropriate net use. However, past studies compared net use with ownership of at least one net, not access to sufficient nets within households. This study recalculates the net use gap in recent large household surveys using the comparison indicator of ‘access to nets within the household’ as now recommended by Roll Back Malaria and the World Health Organization. Data from 41 Demographic Health Surveys (DHS) and Malaria Indicator Surveys (MIS) (2005–2012) in sub-Saharan Africa were used. For each dataset three indicators were calculated: population access to ITN, population use of ITN, and household ownership of at least one ITN. The ITN use gap was expressed as the difference between one and the ratio of use to access. The median proportion of users compared to those with access was high, at 82.1%. Even at population access levels below 50%, a median 80.6% used an ITN given they had access, and this rate increased to 91.2% for access rates above 50%. Linear regression of use against access showed that 89.0% of household members with access to nets used them the night before. These results clearly show that previous interpretations of the net use gap as a failure of behavioral change communication interventions were not justified and that the gap was instead primarily driven by lack of intra-household access. They also demonstrate the usefulness of the newly recommended ITN indicators; access to an ITN within the household provides a much more accurate comparison of ITN use than ownership.
The ‘Burnside Process’ Converges Slowly

We consider the problem of sampling ‘unlabelled structures’, i.e., sampling combinatorial structures modulo a group of symmetries. The main tool which has been used for this sampling problem is Burnside’s lemma. In situations where a significant proportion of the structures have no nontrivial symmetries, it is already fairly well understood how to apply this tool. More generally, it is possible to obtain nearly uniform samples by simulating a Markov chain that we call the Burnside process: this is a random walk on a bipartite graph which essentially implements Burnside’s lemma. For this approach to be feasible, the Markov chain ought to be ‘rapidly mixing’, i.e., converge rapidly to equilibrium. The Burnside process was known to be rapidly mixing for some special groups, and it has even been implemented in some computational group theory algorithms. In this paper, we show that the Burnside process is not rapidly mixing in general. In particular, we construct an infinite family of permutation groups for which we show that the mixing time is exponential in the degree of the group.
TÜRKİYE’YE GELEN ÇİNLİ TURİSTLERİN SEYAHAT MOTİVASYONLARI ÜZERİNE BİR ARAŞTIRMA

Cin, son yillarda ekonomik olarak hizla gelisen ve dunyaya acilan bir ulke konumundadir. Cin, uluslararasi turizm pazarinda da hizli buyume gostererek en cok harcama yapan ulke konumuna gelmistir. Cin turizm pazari dunya genelinde ilgi cekmeye baslamistir. Pek cok ulke bu pazardan pay alma cabasi icerisine girmistir. Ancak Turkiye’ye gelen Cinli turist sayilari uluslararasi seyahat eden turist sayisi ile kiyaslandiginda oldukca dusuk seviyelerde oldugu gorulmektedir. Alternatif turizm pazarlarina ihtiyac duyan Turkiye’nin bu pazardan daha fazla pay almasi gerektigi dusunulmektedir. Bu dusunceden yola cikilarak calismada Cin turizm pazarinin incelenmesi ve Cinli turistlerin seyahat motivasyonlarinin belirlenmesi amaclanmistir. Bu amac dogrultusunda Istanbul’u ziyaret eden 131 Cinli turist uzerine anket teknigi ile veriler toplanmis, frekans analizi, farklilik testleri, aciklayici faktor analizi ve dogrulayici faktor analizi yapilmistir. Arastirma sonucunda cekici motivasyonlarin, dogal ve kulturel olanaklar, etkinlikler, kalite ve guven, alisveris olanaklari, fiyat ve uygunluk olmak uzere 5 boyuttan olustugu, bu boyutlarin bazi demografik ozelliklere gore farkliliklar gosterdigi gorulmustur.
Grasslands as a sustainable tourism resource in Germany: environmental knowledge effects on resource conservation preferences

Resulting from centuries of traditional animal husbandry, extensive grasslands belong to the most important natural tourism resources in Central Europe adding to the amenity values of many landscapes. Facing agricultural market pressures, they are endangered by agricultural intensification as well as by abandonment. Both developments threaten grassland values for tourists and recreationists. However, many non-experts regard extensive grasslands as 'natural' and ignore the essential contribution of animal husbandry to their conservation. Against this background, we conducted choice experiments with respondents from two semi-rural suburbs of Gottingen City and from two Harz mountain villages (n = 336). Respondents either use the grassland landscape for recreation and/or operate tourism businesses. We document substantial preferences for vistas facilitated by local grasslands and for grassland species diversity. Residents with higher scores of an index of grassland knowledge prefer higher numbers of sheep and cattle for grassland conservation.
Direction Finding With Partly Calibrated Uniform Linear Arrays

A new method for direction finding with partly calibrated uniform linear arrays (ULAs) is presented. It is based on the conventional estimation of signal parameters via rotational invariance techniques (ESPRIT) by modeling the imperfections of the ULAs as gain and phase uncertainties. For a fully calibrated array, it reduces to the conventional ESPRIT algorithm. Moreover, the direction-of-arrivals (DOAs), unknown gains, and phases of the uncalibrated sensors can be estimated in closed form without performing a spectral search. Hence, it is computationally very attractive. The Cramér-Rao bounds (CRBs) of the partly calibrated ULAs are also given. Simulation results show that the root mean squared error (RMSE) performance of the proposed algorithm is better than the conventional methods when the number of uncalibrated sensors is large. It also achieves satisfactory performance even at low signal-to-noise ratios (SNRs).
Algorithm 337: calculation of a polynomial and its derivative values by Horner scheme

Here n is the degree of the polynomial whose coefficients are given by a[O:n]. I t is assumed that 0 < k ~ n. If k = 0 only the value of the polynomial is calculated. If b is fa lse the choice k = n would be most useful. This algorithm is essentially equivalent to Algorithm 29 [Comm. A C M 3 (Nov. 1960), 604] in terms of quantit ies computed, but the application of Horner 's scheme significantly reduces the number of operations. Example 1. For the polynomial of degree n = 5: w(x) = x ~" 5 + 2 X x T 4 3 X x T 3 + S X x ~" 2 7 X x + l l , k = 2, x0 = 2 and b = t r ue , the following was obtained: r[0] = 69, r i l l = 133, r[2] = 236, i.e. w(2) = 69, w'(2) -133 and w" (2) = 236. Example 2. For the polynomial of degree n = 7: w(x) = x T 7 7 X x ~ 5 q6 X x T 4 q 4 X x 1" 3 x T 2 2 X x 9, k = 7, xO = 2 a n d b = f a I s e the following vector r was obtained: 15, 122, 279, 332, 216, 77, 14, 1, i.e., the given polynomial can be expressed in the form: w(x) = 15 -F 122 X ( x 2 ) + 2 7 9 X ( x 2 ) T 2 + 3 3 2 X (x-2) T 3 + 2 1 6 X (x-2) T 4 + 7 7 X (x-2) $ 5 + 1 4 X ( x 2 ) T 6 + (x-2) 1" 7; b e g i n i n t e g e r i, j, l; r ea l rr; rr := a[0]; for i := 0 s tep 1 u n t i l k do r[i] := rr; for j := 1 s tep 1 u n t i l n do b e g i n r[0] := r[0] X x0 + a[j]; 1 := i f n j > k t h e n k e l s e n j ; for i := 1 s tep 1 u n t i l 1 do r[i] := r[i] X xO + r[i--1] end ; i f b t h e n b e g i n l : = l ; for i := 2 s t e p 1 u n t i l k d o , b e g i n l : = l X i ; r[i] := r[i] X l en d e n d end horner
Accelerating local feature extraction using OpenCL on heterogeneous platforms

Local feature extraction is one of the most important steps in image processing applications such as image matching and object recognition. The Scale Invariant Feature Transformation (SIFT) algorithm is one of the most robust as well as one of the most computation intensive algorithms to extract local features. Recent implementations of the algorithm focus on homogeneous processors like multi-core CPUs or many-core GPUs. In this paper, we introduce an OpenCL-based implementation, which can be used in homogeneous and heterogeneous CPU/GPU environments. We analyze possible coarse-grained and fine-grained parallelization solutions of the SIFT algorithm. Using a set of optimizations we implement a high-performance SIFT implementations for very different CPU/GPU architectures. The scalable implementation allows for a fast processing, more than 40 FPS for Full-HD images.
Generating a Prion with Bacterially Expressed Recombinant Prion Protein

Recombinant Infectious Prions Prion diseases are a group of fatal neurodegenerative disorders that include Creutzfeldt-Jakob disease in humans and bovine spongiform encephalopathy in cows. The prion hypothesis states that the infectious agent of these diseases is an aberrant conformational isoform of the normal prion protein (PrPC), a glycosylphosphatidylinositol-anchored cell surface protein enriched in the central nervous system. The final proof for the prion hypothesis is to convert bacterially expressed recombinant PrP into an infectious prion, but this has been difficult to achieve. F. Wang et al. (p. 1132, published online 28 January; see the Perspective by Supattapone) put recombinant PrP purified from bacteria into mice and obtained all the characteristics of the infectious agent in prion disease. The recombinant form is not only resistant to proteinase-K, but also shows infectivity in cultured cells and causes rapid disease progression in wild-type mice, yielding both the behavioral and the neuropathological symptoms. Recombinant prion protein recapitulates the characteristics of the infectious agent in prion disease. The prion hypothesis posits that a misfolded form of prion protein (PrP) is responsible for the infectivity of prion disease. Using recombinant murine PrP purified from Escherichia coli, we created a recombinant prion with the attributes of the pathogenic PrP isoform: aggregated, protease-resistant, and self-perpetuating. After intracerebral injection of the recombinant prion, wild-type mice developed neurological signs in ~130 days and reached the terminal stage of disease in ~150 days. Characterization of diseased mice revealed classic neuropathology of prion disease, the presence of protease-resistant PrP, and the capability of serially transmitting the disease; these findings confirmed that the mice succumbed to prion disease. Thus, as postulated by the prion hypothesis, the infectivity in mammalian prion disease results from an altered conformation of PrP.
A quantitative comparison of parallel computation models

In recent years, a large number of parallel computation models have been proposed to replace the PRAM as the parallel computation model presented to the algorithm designer. Although mostly the theoretical justifications for these models are sound, and many algorithmic results where obtained through these models, little experimentation has been conducted to validate the effectiveness of these models for developing cost-effective algorithms and applications on existing hardware platforms. In this article a first attempt is made to perform a detailed experimental account on the preciseness of these models. The achieve this, three models (BSP, E-BSP, and BPRAM) were selected and validated on five parallel platforms (Cray T3E, Thinking Machines CM-5, Intel Paragon, MasPar MP-1, and Parsytec GCel). The work described in this article consists of three parts. First, the predictive capabilities of the models are investigated. Unlike previous experimental work, which mostly demonstrated a close match between the measuredd and predicted execution times, this article shows that there are several situations in which the models do not precisely predict the actual runtime behavior of an algorithm implementation. Second, a comparison between the models is provided in order to determine the model that induces that most efficient algorithms. Lastly, the performance achieved by the model-derived algorithms is compared with the performace attained by machine-specific algorithms in order to examine the effectiveness of deriving fast algorithms through the formalisms of the models.
The Application of Cooperative Learning in English Teaching under the Multimedia Environment

Cooperative learning strategies are widely advocated in western countries in order to reach the communicative teaching goal of cultivating students' communicative capability in English classrooms. Domestically, Multi-media system, as the teaching equipment, is widely pursued and quickly spreading in various kinds of classrooms. But the spreading of multi-media system is said to construct a hinder to task-based English language teaching or communicative classroom activities, and it thus has the inclination of reducing to a modern tool of "duck stuffing"teaching method. How to make use of the advantage of this morden equipment and avoid its disadvantages at the same time in classroom teaching is an important issue under discussion. This paper focuses on the combination of cooperative learning strategies and multimedia system so as to maximaze the teaching result. Relative factors concerning classroom teaching, groupworks and multimedia system are discussed and some suggestions are provided to coordinate the morden equipment and strategies in English language teaching.
Early & Quick function point: sizing more with less

The Early & Quick technique was originally proposed in 1997 for IFPUG Function Points, to size software in early stages of the development process, when functional requirements are still to be established in a detailed form and/or when a rapid measure is needed for existing software from a high-level viewpoint, within limited time. Typical lack of measurement details and requirements volatility in early project stages are overcome by the E&Q approach to provide a size estimate as a significant contribution to early project planning needs. Fundamental principles of the technique are classification by analogy, functionality structured aggregation, and multilevel approach, with statistical validation of numerical ranges. Recently, the technique has evolved, to fully comply with any functional size measurement method (ISO/IEC 14143:1998), so to cover new generation methods (e.g., COSMIC Full FP 2.2) and updated releases of existing methods (e.g., IFPUG FP 4.1 and 4.2). This paper describes the current technique release 2.0, application cases, validation results, supporting tools, and further improvement directions
presented a deep 3 D convolutional architecture that models the flow estimation problem as a “ Voxel 2 Voxel ” prediction problem

Motion of the human body is the critical cue for understanding and characterizing human behavior in videos. Most existing approaches explore the motion cue using optical flows. However, optical flow usually contains motion on both the interested human bodies and the undesired background. This “noisy” motion representation makes it very challenging for pose estimation and action recognition in real scenarios. To address this issue, this paper presents a novel deep motion representation, called PoseFlow, which reveals human motion in videos while suppressing background and motion blur, and being robust to occlusion. For learning PoseFlow with mild computational cost, we propose a functionally structured spatial-temporal deep network, PoseFlow Net (PFN), to jointly solve the skeleton localization and matching problems of PoseFlow. Comprehensive experiments show that PFN outperforms the stateof-the-art deep flow estimation models in generating PoseFlow. Moreover, PoseFlow demonstrates its potential on improving two challenging tasks in human video analysis: pose estimation and action recognition.
The effect of compression on solid-state properties of desloratadine and multicomponent crystal

Tablet pharmaceuticals manufacturing process involves several processes i.e. granulation, drying, milling, and compression. This study was conducted to determine the effect of compression of desloratadine (DES) and multicomponent crystal (MCC), which is a salt from DES, on their solid-state properties. A compression method for tablet formation was conducted using a hydraulic pressure machine with punch diameter of 13 mm. Both DES and MCC were made into tablets with the same tensile strength, which is 1.36 MPa. DES and MCC powder and tablet were each evaluated for their physicochemical properties, including analysis of powder X-ray diffraction (PXRD), differential scanning calorimetry (DSC), Fourier transform infrared spectroscopy (FTIR), scanning electron microscopy (SEM), and tablet dissolution. PXRD diffractogram analysis results on DES and MCC showed that the degree of crystallinity decreased after the compression process. There were no polymorphic transformation in DES and MCC after compression. DSC analysis showed a decrease of enthalpy after DES and MCC are compressed. FTIR showed the same spectra pattern for DES and MCC powder and tablet. The SEM scans showed a tendency for interparticle attachment in DES tablets and none in MCC tablets. Meanwhile, dissolution, as indicated by dissolution efficiency, is only slightly decreased due to the compression process. DES and MCC analysis, all characteristics indicated changes of physicochemical properties after compression pressure, but those changes did not affect their dissolution results.