Miracle-dz/UniFAR-FTUs huggingface dataset:
Razones para la emoción en el consumo de moda / Reasons for emotion in fashion consumption

Fashion consumption seems to be linked to emotion due to diverse causes: the kind of product that tends to be tried; the space carefully designed where the product is located; the special customer service in the buying process; the social impact of the brand ambassadors that act as opinion leaders; and the spectacular nature of the media coverage in this industry. The main aim of this article is to know the reasons why fashion brand links emotionally, giving an emotional identity to the fashion brand. For this purpose, firstly it has been conducted a literature review of the concept brand identity, brand image and positioning. Secondly, research comprehends a literature review of the concept of emotion –sensorial or affective emotion mostly-, studied the relationship between emotion and senses and described the role of senses in buying fashion. Thirdly, it has been described the role of senses in buying fashion. The conclusions generate some reasons to explain the link between emotion and fashion consumption: clothes are more visible and constitute a multisensory product; the industry is very competitive and focuses the origin of emotional shopping, where fashion styles are changing; and finally the nature of the store atmosphere influences psychologically.
The price of virtualization: Performance isolation in multi-tenants networks

Network virtualization sits firmly on the Internet evolutionary path allowing researchers to experiment with novel clean-slate designs over the production network and practitioners to manage multi-tenants infrastructures in a flexible and scalable manner. In such scenarios, isolation between virtual networks is often intended as purely logical: this is the case of address space isolation or flow space isolation. This approach neglects the effect that network virtualization has on resource allocation network-wide. In this work we investigate the price paid by a purely logical approach in terms of performance degradation. This performance loss is paid by the actual users of a multi-tenants datacenter network. We propose a solution to this problem leveraging on a new network virtualization primitive, namely an online link utilization feedback mechanism. It provides each tenant with the necessary information to make efficient use of network resources. We evaluate our solution trough a real implementation exploiting the OpenFlow protocol. Empirical results confirm that the proposed scheme is able to support tenants in exploiting virtualized network resources effectively.
Glycated Hemoglobin Predicts All-Cause, Cardiovascular, and Cancer Mortality in People Without a History of Diabetes Undergoing Coronary Angiography

OBJECTIVE Glycated hemoglobin has been suggested to be superior to fasting glucose for the prediction of vascular disease and death from any cause. The aim of the present work was to analyze and compare the predictive value of glycated hemoglobin and fasting glucose on all-cause and cause-specific mortality in subjects who underwent coronary angiography. RESEARCH DESIGN AND METHODS We studied 2,686 participants of the Ludwigshafen Risk and Cardiovascular health study without a history of diabetes. The majority of this cohort had coronary artery disease. Glycated hemoglobin was measured at the baseline examination. The mean (± SD) duration of the follow-up for all-cause, cardiovascular, and cancer mortality was 7.54 ± 2.1 years. RESULTS A total of 508 deaths occurred during the follow-up. Of those, 299 were accounted for by cardiovascular diseases and 79 by cancer. Baseline glycated hemoglobin was predictive of all-cause, cardiovascular, and cancer mortality. The multivariable-adjusted hazard ratios (HR) (95% CI) for glycated hemoglobin values of <5.0, 5.0–5.4, 5.5–5.9, 6.0–6.4, 6.5–7.4, and ≥7.5% for all-cause mortality were 1.36 (0.85–2.18), 1.00 (0.76–1.32), 1.00 (reference), 1.11 (0.88–1.41), 1.39 (1.07–1.82), and 2.15 (1.32–3.53), respectively. Similar J-shaped relationships were found between glycated hemoglobin and cardiovascular and cancer mortality. The associations of glycated hemoglobin with all-cause and cardiovascular mortality remained significant after inclusion of fasting glucose as a covariate. However, fasting glucose was not significantly related to mortality when adjusting for glycated hemoglobin. CONCLUSIONS Glycated hemoglobin significantly and independently of fasting glucose predicts all-cause and cardiovascular mortality in whites at intermediate to high cardiovascular risk.
Crystal Structure Studies of Human Dental Apatite as a Function of Age

Studies of the average crystal structure properties of human dental apatite as a function of age in the range of 5–87 years are reported. The crystallinity of the dental hydroxyapatite decreases with the age. The a-lattice constant that is associated with the carbonate content in carbonate apatite decreases with age in a systematic way, whereas the c-lattice constant does not change significantly. Thermogravimetric measurements demonstrate an increase of the carbonate content with the age. FTIR spectroscopy reveals both B and A-type carbonate substitutions with the B-type greater than the A-type substitution by a factor up to ~5. An increase of the carbonate content as a function of age can be deduced from the ratio of the ν 2CO3 to the ν 1PO4 IR modes.
Automatic Concept-Based Query Expansion Using Weighted Transitive Part-Whole Relations

In a theoretical view, we specify part-whole relations which are transitive. We will discuss the application Dimeronymy for automatic concept-based query expansion tasks in information retrieval. For practical reasons, we propose to specify meronymic relations and apply different weightings for query expansion purposes. For the construction of knowledge organization systems we point out that on a hyponymy concept ladder a term transmits all its parts (and all transitive parts of those) to its narrower terms.
Codimensional surface tension flow on simplicial complexes

Many visually interesting natural phenomena are characterized by thin liquid sheets, long filaments, and droplets. We present a new Lagrangian-based numerical method to simulate these codimensional surface tension driven phenomena using non-manifold simplicial complexes. Tetrahedra, triangles, segments, and points are used to model the fluid volume, thin films, filaments, and droplets, respectively. We present a new method for enforcing fluid incompressibility on simplicial complexes along with a physically-guided meshing algorithm to provide temporally consistent information for interparticle forces. Our method naturally allows for transitions between codimensions, either from tetrahedra to triangles to segments to points or vice versa, regardless of the simulation resolution. We demonstrate the efficacy of this method by simulating various natural phenomena that are characterized by thin fluid sheets, filaments, and surface tension effects.
Reexamining the Calculus of Voting : A Social Cognitive Perspective on the Turnout Decision

This study applies social cognitive theory to the study of voter turnout, examining the effects of self-efficacy on citizens’ decisions of whether or not to vote. Consistent with recent arguments in cognitive psychology (Fenton-O’Creevy, Nicholson, Soane, & Willman, 2003, 2005), I argue that excessive perceptions of selfefficacy lead some citizens to overestimate their vote’s impact in close elections and to vote as a consequence of these perceptions. This illusion of control is further engendered by the features of skill-based activities such as choice, personal involvement, stimulus familiarity, and exertion of effort (Langer, 1975) that are inherent in the act of voting. Employing both cross-sectional and panel data, I find that individuals with high levels of self-efficacy are more likely to be moved to vote by perceptions that an election will be close than are citizens with low levels of self-efficacy. The results demonstrate the utility of social cognitive theory for the study of voter participation.
Dependence of multi-dimensional array references

Accurate data dependence analysis is the key function in vectorizing-restructuring compilers for supercomputers. However, the data dependence analysis algorithms currently available have limitations. Those that execute quickly, such as the Banerjee Test [3], [4], [21] are very limited in generality. Those that are general are too slow. 1 Compiler designers have been keenly aware of the need for an algorithm that is both general and fast. The algorithm that follows fills this need simply and uniformly. Aside from fast execution, this algorithm has three main features: It can deal with arbitrary linear constraints whose variables are not limited to loop-control variables It can deal with any number of these linear constraints simultaneously. It only looks at integer solutions. The algorithm organizes the multiple constraints into a constraint matrix and uses a method derived from linear programming techniques. We refer to this as the Constraint-Matrix algorithm. Burke and Cytron [6] have discussed linearization to deal with arrays of greater than one dimension. This approach was also referred to by Towle [18]. Linearization is limited unless additional constraints are added; it cannot deal with arbitrary additional constraints and it does not restrict its solutions to integers. The Constraint-Matrix algorithm is organized specifically for a goal that is different from the standard linear programming problem. This goal is to prove the lack of a solution [i.e. the lack of a dependence) rather than minimize an “objective function. ” further, this algorithm is designed to “short-circuit” when its goal is reached, in a way that a standard linear programming algorithm cannot. In order to simplify the exposition, we begin with a precise definition of dependence. To provide some motivation for the later algorithm and to show the advantages of the matrix format, we then present two special case methods (Solvable-Matrix and Matrix-GCD). Finally we present the Constraint-Matrix algorithm.
Global Inequalities in Cervical Cancer Incidence and Mortality are Linked to Deprivation, Low Socioeconomic Status, and Human Development

Objectives This study examined global inequalities in cervical cancer incidence and mortality rates as a function of cross-national variations in the Human Development Index (HDI), socioeconomic factors, Gender Inequality Index (GII), and healthcare expenditure. Methods Age-adjusted incidence and mortality rates were calculated for women in 184 countries using the 2008 GLOBOCAN database, and incidence and mortality trends were analyzed using the WHO cancer mortality database. Log-linear regression was used to model annual trends, while OLS and Poisson regression models were used to estimate the impact of socioeconomic and human development factors on incidence and mortality rates. Results Cervical cancer incidence and mortality rates varied widely, with many African countries such as Guinea, Zambia, Comoros, Tanzania, and Malawi having at least 10-to-20-fold higher rates than several West Asian, Middle East, and European countries, including Iran, Saudi Arabia, Syria, Egypt, and Switzerland. HDI, GII, poverty rate, health expenditure per capita, urbanization, and literacy rate were all significantly related to cervical cancer incidence and mortality, with HDI and poverty rate each explaining >52% of the global variance in mortality. Both incidence and mortality rates increased in relation to lower human development and higher gender inequality levels. A 0.2 unit increase in HDI was associated with a 20% decrease in cervical cancer risk and a 33% decrease in cervical cancer mortality risk. The risk of a cervical cancer diagnosis increased by 24% and of cervical cancer death by 42% for a 0.2 unit increase in GII. Higher health expenditure levels were independently associated with decreased incidence and mortality risks. Conclusions and Public Health Implications Global inequalities in cervical cancer are clearly linked to disparities in human development, social inequality, and living standards. Reductions in cervical cancer rates are achievable by reducing inequalities in socioeconomic conditions, availability of preventive health services, and women’s social status.
Predicting SQL Query Execution Time for Large Data Volume

In a production system, increase in data size will increase the execution time of the application's SQL queries and degrade its performance. Tuning SQL queries in production requires additional efforts and cost. Time constraints during application development do not permit testing SQL queries with high data volumes. Having the capability to predict SQL query execution time for large data volumes can alert the developers to tune queries or database design upfront, in such scenarios. Application developers may use 'cost' of SQL query as given by optimizer based relational databases to estimate the SQL query execution time for large data sizes. However, the 'cost' based models may lead to large estimation errors as discussed in this paper. We have presented a modular approach of estimating SQL query execution time for high data volumes using measurements at low data volume. A compound SQL query execution plan is mapped to a sequential execution of a set of elementary steps. The execution time of a SQL query in isolation is predicted as summation of estimated execution time of all its elementary steps. We have built analytical models for estimating execution time of different IO access, DB cache access and SQL operators as function of data size for each such step. The proposed model dynamically adapts itself to the structure of the query execution plans and characteristics of the underlying hardware. We have evaluated the model by generating synthetic queries for all combinations of elementary steps for a range of data sizes. The model has also been validated with TPC-H benchmarks and three real life applications. The proposed model shows an average prediction error to be within 10%.
Controllability analysis of severe slugging in well-pipeline-riser systems

Abstract Active control of the production choke valve is the recommended solution to prevent severe slugging flow conditions at offshore oilfields. The focus of this work is to find the structure of a simple, yet robust anti-slug control system. In order to find suitable control variables for stabilization, a controllability analysis of the system with different available measurements or different combinations of them was performed. Moreover, for including robustness and performance requirements at the same time, the controllability analysis was extended to a mixed sensitivity ℋ ∞ optimization problem. Two case studies were considered; first, the controllability analysis was performed on a pipeline-rise system using a 4-state model for comparing the results to the previous works. Next, using a 6-state model, the results were extended to a more general well-pipeline-riser system. The controllability results were in accordance with the practical experience in anti-slug control.
Theory of the Relation between Human Brain Activity (MEG) and Hand Movements

Earlier research established that spontaneous changes in human sensorimotor coordination are accompanied by qualitative changes in the spatiotemporal dynamics of neural activity measured by multisensor electroencephalography and magnetoencephalography. More recent research has demonstrated that a robust relation exists between brain activity and the movement profile produced. In particular, brain activity has been shown to correlate strongly with movement velocity independent of movement direction and mode of coordination. Using a recently developed field theoretical model of large-scale brain activity itself based on neuroanatomical and neurophysiological constraints we show here how these experimental findings relate to the field theory and how it is possible to reconstruct the movement profile via spatial and temporal integration of the brain signal. There is a unique relation between the quantities in the theory and the experimental data, and fit between the shape of the measured and the reconstructed time series for the movement is remarkably good given that there are no free parameters.
Landweber exact formal group laws and smooth cohomology theories

The main aim of this paper is the construction of a smooth (sometimes called differential) extension \hat{MU} of the cohomology theory complex cobordism MU, using cycles for \hat{MU}(M) which are essentially proper maps W\to M with a fixed U(n)-structure and U(n)-connection on the (stable) normal bundle of W\to M. Crucial is that this model allows the construction of a product structure and of pushdown maps for this smooth extension of MU, which have all the expected properties. Moreover, we show, using the Landweber exact functor principle, that \hat{R}(M):=\hat{MU}(M)\otimes_{MU^*}R defines a multiplicative smooth extension of R(M):=MU(M)\otimes_{MU^*}R whenever R is a Landweber exact MU*-module. An example for this construction is a new way to define a multiplicative smooth K-theory.
High Performance Dynamic Linking Through Caching

The Spring Operating System provides high performance dynamic linking of program images. Spring uses caching of both fixed-up program images and partially fixed-up shared libraries to make dynamic linking of program images efficient, to reduce the need for PIC (position-independent code), and to improve page sharing between different program images running the same libraries. The result is that with program image caching, dynamically-linked programs have a start-up cost similar to statically-linked programs regardless of the number of unresolved symbols in dynamically-linked program images and shared libraries. In addition, with library and program image caching, we have reduced the need for PIC and have increased page sharing.
Optimal Coordination of Directional Overcurrent Relay for Power Delivery System With A Hybrid Shuffled Frog Leaping Algorithm

This paper presents a new approach for optimal coordination of over current relay in a power delivery system (PDS). For this, the relay coordination problem is formulated as the optimization problem by minimizing the relays operation times. Also, an efficient hybrid algorithm based on Shuffled Frog Leaping (SFL) algorithm and linear programming (LP) is introduced for solving complex and non-convex optimization problem. To investigate the ability of the proposed method, a 30-bus IEEE test system is considered. Also, to validate the obtained result by SFL-LP, a GA-LP method is applied. Simulation results show the efficiency of proposed method.
Fusion of High Resolution Multispectral Imagery in Vulnerable Coastal and Land Ecosystems

Ecosystems provide a wide variety of useful resources that enhance human welfare, but these resources are declining due to climate change and anthropogenic pressure. In this work, three vulnerable ecosystems, including shrublands, coastal areas with dunes systems and areas of shallow water, are studied. As far as these resources’ reduction is concerned, remote sensing and image processing techniques could contribute to the management of these natural resources in a practical and cost-effective way, although some improvements are needed for obtaining a higher quality of the information available. An important quality improvement is the fusion at the pixel level. Hence, the objective of this work is to assess which pansharpening technique provides the best fused image for the different types of ecosystems. After a preliminary evaluation of twelve classic and novel fusion algorithms, a total of four pansharpening algorithms was analyzed using six quality indices. The quality assessment was implemented not only for the whole set of multispectral bands, but also for the subset of spectral bands covered by the wavelength range of the panchromatic image and outside of it. A better quality result is observed in the fused image using only the bands covered by the panchromatic band range. It is important to highlight the use of these techniques not only in land and urban areas, but a novel analysis in areas of shallow water ecosystems. Although the algorithms do not show a high difference in land and coastal areas, coastal ecosystems require simpler algorithms, such as fast intensity hue saturation, whereas more heterogeneous ecosystems need advanced algorithms, as weighted wavelet ‘à trous’ through fractal dimension maps for shrublands and mixed ecosystems. Moreover, quality map analysis was carried out in order to study the fusion result in each band at the local level. Finally, to demonstrate the performance of these pansharpening techniques, advanced Object-Based (OBIA) support vector machine classification was applied, and a thematic map for the shrubland ecosystem was obtained, which corroborates wavelet ‘à trous’ through fractal dimension maps as the best fusion algorithm for this ecosystem.
Limiting end-to-end delays in long-lasting sensor networks

Many applications require a lifetime of several years from a sensor network while expecting low and guaranteed end-to-end delays between sources and a sink. Obviously, these two parameters - lifetime and delay - contradict each other. In this work we present and evaluate a solution that limits the end-to-end delays and nevertheless achieves a long lifetime. We introduce a model for evaluation of delay and lifetime in multi-hop sensor networks. According to our model a network of off-the-shelf sensor nodes limits an end-to-end delay to 5 seconds and works for 8 months. However, if applications can tolerate the end-to-end delay of 20 seconds, the nodes prolong the lifetime to approx. 2 years. Our evaluation revealed that end-to-end delay affects the lifetime only to a certain limit. In our example this limit was 60 seconds, i.e. any delay change above 60 seconds does not influence the lifetime considerably.
Personality traits and health outcomes: an exploration into associations and potential mechanisms

14 The four bodily humours . 15 The birth of psychosomatic medicine . 16 Sheldon’s Constitutional psychology . 17 The beginnings of systematic and evidence based research . 18 Biological theories of personality: Hans Eysenck and Jeffrey Gray . 23 Eysenck’s Three Factor Theory . 24 Gray’s Reinforcement Sensitivity Theory . 26 The Five Factor Model of personality . 28 Personality-health associations within the FFM framework . 30 Mechanisms linking personality and health . 33 The present thesis – research questions and aims . 37 Chapter Two: Personality and Diabetes Mellitus in a National Sample . 40 Abstract . 41. 4
Oncogenic mutations of thyroid hormone receptor β

The C-terminal frame-shift mutant of the thyroid hormone receptor TRβ1, PV, functions as an oncogene. An important question is whether the oncogenic activity of mutated TRβ1 is uniquely dependent on the PV mutated sequence. Using four C-terminal frame-shift mutants—PV, Mkar, Mdbs, and AM—we examined that region in the oncogenic actions of TRβ1 mutants. Remarkably, these C-terminal mutants induced similar growth of tumors in mouse xenograft models. Molecular analyses showed that they physically interacted with the p85α regulatory subunit of PI3K similarly in cells. In vitro GST-binding assay showed that they bound to the C-terminal Src-homology 2 (CSH2) of p85α with markedly higher avidity. The sustained association of mutants with p85α led to activation of the common PI3K-AKT-ERK/STAT3 signaling to promote cell proliferation and invasion and to inhibit apoptosis. Thus, these results argue against the oncogenic activity of PV being uniquely dependent on the PV mutated sequence. Rather, these four mutants could favor a C-terminal conformation that interacted with the CSH2 domain of p85α to initiate activation of PI3K to relay downstream signaling to promote tumorigenesis. Thus, we propose that the mutated C-terminal region of TRβ1 could function as an “onco-domain” and TRβ1 is a potential therapeutic target.