Miracle-dz/UniFAR-FTUs huggingface dataset:
El emprendedor y la empresa: una revisión teórica de los determinantes a su constitución

espanolA lo largo del tiempo, numerosas investigaciones se han planteado la cuestion de que es lo que predispone a las personas a ser emprendedores y a constituir su propia empresa. No existe un conjunto unico y universal de razones aplicable a cualquier persona, sino que cada sujeto tiene sus propios motivos, los cuales pueden cambiar a lo largo de su vida. El fenomeno de creacion de empresas es deficiente si se centrase unicamente en las caracteristicas y comportamientos de los empresarios individuales, tambien deben considerarse a estudio otros factores como determinantes a este fenomeno. El objetivo de este articulo es recapitular las principales teorias sobre creacion de empresas existentes en la literatura y que mas difusion han tenido, atendiendo a factores economicos, psicologicos, socioculturales e internos a la organizacion. EnglishOver the course of time, many research projects have examined the question of what predisposes people to become entrepreneurs and form their own company. There is no one specific set of universal reasons that can be applied to any individual. It is rather a case of each person having their own motives, which are susceptible to change throughout their lifetime. The phenomenon of setting up companies would be missing something if only the characteristics and behaviours of individual entrepreneurs were focused on; it is essential for other factors to be taken into consideration as having a decisive effect on this phenomenon. The aim of this article is to recapitulate the main theories concerning the formation of companies that already exist in the literature and have been most widely publicised, taking into account the economic, psychological and sociocultural factors along with the internal organisation of the company.
Poster: Real time hand pose recognition with depth sensors for mixed reality interfaces

We present a method for predicting articulated hand poses in real-time with a single depth camera, such as the Kinect or Xtion Pro, for the purpose of interaction in a Mixed Reality environment and for studying the effects of realistic and non-realistic articulated hand models in a Mixed Reality simulator. We demonstrate that employing a randomized decision forest for hand recognition benefits real-time applications without the typical tracking pitfalls such as reinitialization. This object recognition approach to predict hand poses results in relatively low computation, high prediction accuracy and sets the groundwork needed to utilize articulated hand movements for 3D tasks in Mixed Reality workspaces.
Regularization techniques for fine-tuning in neural machine translation

We investigate techniques for supervised domain adaptation for neural machine translation where an existing model trained on a large out-of-domain dataset is adapted to a small in-domain dataset. In this scenario, overfitting is a major challenge. We investigate a number of techniques to reduce overfitting and improve transfer learning, including regularization techniques such as dropout and L2-regularization towards an out-of-domain prior. In addition, we introduce tuneout, a novel regularization technique inspired by dropout. We apply these techniques, alone and in combination, to neural machine translation, obtaining improvements on IWSLT datasets for English→German and English→Russian. We also investigate the amounts of in-domain training data needed for domain adaptation in NMT, and find a logarithmic relationship between the amount of training data and gain in BLEU score.
Orthography and rhyme judgement: the interplay between phonology and orthography on rhyme judgement

A Word Rhyme Judgements task for neuropsychological assessment in European Portuguese is presented. The task was modeled from Kay, Lesser & Coltheart (1992). It requires a yes/no decision on whether word pairs rhyme or not. Half of the pairs rhyme; half of these have the same final spelling (CEDO/DEDO), half have different final spellings (POÇO/FOSSO). Control pairs, half of which share the final spelling, do not rhyme (MEDO/CREDO; MOÇO/NOSSO). Thirty-two college students performed this task in the spoken and written modalities (order counterbalanced). Clear effects of modality, in favor of the spoken presentation, and of orthography, in favor of same spelling rimes, even in the spoken presentation, were observed. The findings are consistent with the assumption that orthography interacts with phonology even when the task does not require explicit attention to orthography. The usefulness of the materials and task for the assessment of language is upraised.
Genetic epidemiology of psychiatric disorders.

Perhaps more than any other domain, the search for etiologic factors in psychiatry has been characterized by an enduring "nature versus nurture" debate, with researchers in medicine, psychology, and public health traditionally emphasizing separate causal factors in the generation of mental disorders. More recently, researchers have increasingly embraced a biopsychosocial model based on a growing body evidence that psychiatric disorders are determined by an interaction of multiple factors. Genetic epidemiology reflects this comprehensive approach by clarifying how both genetic and environmental components produce the complex phenotypes of various forms of disorders. However, its application to psychiatry is still relatively new and its methods and contributions within this domain are not well understood. The purpose of this presentation is to review issues and methodological concepts basic to the genetic epidemiology of psychiatric disorders, and to present examples of its application to this field.
RAISE: An Efficient RSU-Aided Message Authentication Scheme in Vehicular Communication Networks

Addressing security and privacy issues is a prerequisite for a market-ready vehicular communication network. Although recent related studies have already addressed most of these issues, few of them have taken scalability issues into consideration. When the traffic density becomes larger, a vehicle cannot verify all signatures of the messages sent by its neighbors in a timely manner, which results in message loss. Communication overhead as another issue has also not been well addressed in previously reported studies. To deal with these issues, this paper introduces a novel RSU-aided messages authentication scheme, called RAISE. With RAISE, roadside units (RSUs) are responsible for verifying the authenticity of the messages sent from vehicles and for notifying the results back to vehicles. In addition, our scheme adopts the k-anonymity approach to protect user identity privacy, where an adversary cannot associate a message with a particular vehicle. Extensive simulations are conducted to verify the proposed scheme, which demonstrates that RAISE yields much better performance than any of the previously reported counterparts in terms of message loss ratio and delay.
Distributed Online Convex Optimization Over Jointly Connected Digraphs

This paper considers networked online convex optimization scenarios from a regret analysis perspective. At each round, each agent in the network commits to a decision and incurs in a local cost given by functions that are revealed over time and whose unknown evolution model might be adversarially adaptive to the agent's behavior. The goal of each agent is to incur a cumulative cost over time with respect to the sum of local functions across the network that is competitive with the best single centralized decision in hindsight. To achieve this, agents cooperate with each other using local averaging over time-varying weight-balanced digraphs as well as subgradient descent on the local cost functions revealed in the previous round. We propose a class of coordination algorithms that generalize distributed online subgradient descent and saddle-point dynamics, allowing proportional-integral (and higher-order) feedback on the disagreement among neighboring agents. We show that our algorithm design achieves logarithmic agent regret (when local objectives are strongly convex), or square-root agent regret (when local objectives are convex) in scenarios where the communication graphs are jointly connected. Simulations in a medical diagnosis application illustrate our results.
Modular verification of linearizability with non-fixed linearization points

Locating linearization points (LPs) is an intuitive approach for proving linearizability, but it is difficult to apply the idea in Hoare-style logic for formal program verification, especially for verifying algorithms whose LPs cannot be statically located in the code. In this paper, we propose a program logic with a lightweight instrumentation mechanism which can verify algorithms with non-fixed LPs, including the most challenging ones that use the helping mechanism to achieve lock-freedom (as in HSY elimination-based stack), or have LPs depending on unpredictable future executions (as in the lazy set algorithm), or involve both features. We also develop a thread-local simulation as the meta-theory of our logic, and show it implies contextual refinement, which is equivalent to linearizability. Using our logic we have successfully verified various classic algorithms, some of which are used in the java.util. concurrent package.
ALU Insertion Polymorphisms in Populations of the South Caucasus

ALU Insertion Polymorphisms in Populations of the South Caucasus An analysis of eight Alu insertion loci (ACE, ApoA1, PV92, TPA25, NBC27, NBC102, NBC148 and NBC182) was carried out in three ethnic groups of the South Caucasus (Abkhazians, Armenians and Georgians). Genetic differentiation between these groups (Gst = 1%) was half as much as in European populations and four time less than in populations of Dagestan. Although it was not possible to determine a contribution of Neolithic farmers to the Caucasian gene pool, the principal component analysis showed clear differences between these populations and those of Europe, Siberia and Asia. No evidence of correlation between genetic and linguistic data in our populations was disclosed. However, long-term habitation on common territory has led to common cultural, anthropological and detectable genetic traits.
Statistically linearized least-squares temporal differences

A common drawback of standard reinforcement learning algorithms is their inability to scale-up to real-world problems. For this reason, a current important trend of research is (state-action) value function approximation. A prominent value function approximator is the least-squares temporal differences (LSTD) algorithm. However, for technical reasons, linearity is mandatory: the parameterization of the value function must be linear (compact nonlinear representations are not allowed) and only the Bellman evaluation operator can be considered (imposing policy-iteration-like schemes). In this paper, this restriction of LSTD is lifted thanks to a derivative-free statistical linearization approach. This way, nonlinear parameterizations and the Bellman optimality operator can be taken into account (this last point allows taking into account value-iteration-like schemes). The efficiency of the resulting algorithms are demonstrated using a linear parametrization and neural networks as well as on a Q-learning-like problem. A theoretical analysis is also provided.
Emotion recognition in the wild challenge 2013

Emotion recognition is a very active field of research. The Emotion Recognition In The Wild Challenge and Workshop (EmotiW) 2013 Grand Challenge consists of an audio-video based emotion classification challenges, which mimics real-world conditions. Traditionally, emotion recognition has been performed on laboratory controlled data. While undoubtedly worthwhile at the time, such laboratory controlled data poorly represents the environment and conditions faced in real-world situations. The goal of this Grand Challenge is to define a common platform for evaluation of emotion recognition methods in real-world conditions. The database in the 2013 challenge is the Acted Facial Expression in the Wild (AFEW), which has been collected from movies showing close-to-real-world conditions.
Wound repair during arm regeneration in the red starfish Echinaster sepositus

Starfish can regenerate entire arms following their loss by both autotomic and traumatic amputation. Although the overall regenerative process has been studied several times in different asteroid species, there is still a considerable gap of knowledge as far as the detailed aspects of the repair phase at tissue and cellular level are concerned, particularly in post‐traumatic regeneration. The present work is focused on the arm regeneration model in the Mediterranean red starfish Echinaster sepositus; to describe the early cellular mechanisms of arm regeneration following traumatic amputation, different microscopy techniques were employed. In E. sepositus, the repair phase was characterized by prompt wound healing by a syncytial network of phagocytes and re‐epithelialisation followed by a localized subepidermal oedematous area formation. Scattered and apparently undifferentiated cells, intermixed with numerous phagocytes, were frequently found in the wound area during these first stages of regeneration and extensive dedifferentiation phenomena were seen at the level of the stump, particularly in the muscle bundles. A true localized blastema did not form. Our results confirm that regeneration in asteroids mainly relies on morphallactic processes, consisting in extensive rearrangement of the existing tissues which contribute to the new tissues through cell dedifferentiation, redifferentiation, and/or migration.
Cache Coherence in Distributed Systems

v Abstract Caching has long been recognized as a powerful performance enhancement technique in many areas of computer design. Most modern computer systems include a hardware cache between the processor and main memory, and many operating systems include a software cache between the file system routines and the disk hardware.Caching has long been recognized as a powerful performance enhancement technique in many areas of computer design. Most modern computer systems include a hardware cache between the processor and main memory, and many operating systems include a software cache between the file system routines and the disk hardware. In a distributed file system, where the file systems of several client machines are separated from the server backing store by a communications network, it is desirable to have a cache of recently used file blocks at the client, to avoid some of the communications overhead. In this configuration, special care must be taken to maintain consistency between the client caches, as some disk blocks may be in use by more than one client. For this reason, most current distributed file systems do not provide a cache at the client machine. Those systems that do place restrictions on the types of file blocks that may be shared, or require extra communication to confirm that a cached block is still valid each time the block is to be used. The Caching Ring is a combination of an intelligent network interface and an efficient network protocol that allows caching of all types of file blocks at the client machines. Blocks held in a client cache are guaranteed to be valid copies. We measure the style of use and performance improvement of caching in an existing file system, and develop the protocol and interface architecture of the Caching Ring. Using simulation, we study the performance of the Caching Ring and compare it to similar schemes using conventional network hardware.
"Google by reformulation": modeling search as successive refinement

Humans naturally employ a process of iterative refinement when they search for information, clarifying their intentions and adjusting their goals in response to what they encounter. We propose to develop tools specifically to facilitate this process, and hypothesize that they will help users converge on their desired information more quickly. This work presents a layered extension to the Google Web search interface that illustrates the so-called "retrieval by reformulation" paradigm. The tool will serve as a launching point to a wider field of inquiry into user interaction with large information spaces.
Reciprocal relationships between resource loss and psychological distress following exposure to political violence: an empirical investigation of COR theory's loss spirals

Abstract We conducted a four-wave prospective study of Palestinian adults living in the West Bank, Gaza Strip, and East Jerusalem, interviewed between 2007 and 2009 at 6-month interval to explore transactional relationships between resource loss (i.e., intra and interpersonal resource loss) and psychological distress (i.e., posttraumatic stress disorder and depression symptoms). Initially, 1196 Palestinians completed the first wave interview and 752 of these participants completed all four interviews. A cross-lagged panel design was constructed to model the effects of trauma exposure on both resource loss and psychological distress and the subsequent reciprocal effects of resource loss and psychological distress across four time waves. Specifically, resource loss was modeled to predict distress, which in turn was expected to predict further resource loss. Structural equation modeling was used to test this design. We found that psychological distress significantly predicts resource loss across shorter, 6-month time waves, but that resource loss predicts distress across longer, 12-month intervals. These findings support the Conservation of Resources theory's corollary of loss spirals.
Random Indexing for Content-Based Recommender Systems

The use of Vector Space Models (VSM) in the area of Information Retrieval is an established practice, thanks to its very clean and solid formalism that allows us to easily represent objects in a vector space and to perform calculations on them. The goal of this work is to investigate the impact of VSM on Recommender Systems (RS) performance. Specifically, we will introduce two approaches: the first is based on a dimensionality reduction technique called Random Indexing, while the second extends the previous one by integrating a negation operator implemented in the Semantic Vectors open-source package. The results emerged from the experimental evaluation confirmed the predictive accuracy of the model. This work summarizes the results already presented in the RecSys 2010 Doctoral Consortium.
The lysine demethylase, KDM4B, is a key molecule in androgen receptor signalling and turnover

The androgen receptor (AR) is a key molecule involved in prostate cancer (PC) development and progression. Post-translational modification of the AR by co-regulator proteins can modulate its transcriptional activity. To identify which demethylases might be involved in AR regulation, an siRNA screen was performed to reveal that the demethylase, KDM4B, may be an important co-regulator protein. KDM4B enzymatic activity is required to enhance AR transcriptional activity; however, independently of this activity, KDM4B can enhance AR protein stability via inhibition of AR ubiquitination. Importantly, knockdown of KDM4B in multiple cell lines results in almost complete depletion of AR protein levels. For the first time, we have identified KDM4B to be an androgen-regulated demethylase enzyme, which can influence AR transcriptional activity not only via demethylation activity but also via modulation of ubiquitination. Together, these findings demonstrate the close functional relationship between AR and KDM4B, which work together to amplify the androgen response. Furthermore, KDM4B expression in clinical PC specimens positively correlates with increasing cancer grade (P < 0.001). Consequently, KDM4B is a viable therapeutic target in PC.
Reliable framework architecture for multi-agent systems interaction

Multi-agent systems (AMS) are developed using a variety of architectures. These range from peer-to-peer to blackboard-like communication, from insecure distributed systems to complex security schemes, from those MAS using databases to those using knowledge based information systems. Although a system's architecture often has to be designed according to its specific application domain, we present a reliable MAS architecture suitable for most purposes in the e-business domain. This framework combines the distributed nature of a multi-agent system with the security and encryption facilities provided by Web servers, separating data from knowledge and encouraging the use of distributed data structures in a concurrent, scalable, transaction-safe and remote-event generator. Notes on agent reputation assessment are also included. We also endow our agents with learning capabilities for two different aspects: reinforcement learning for bidding and a concept learning technique for building user profiles. Reinforcement learning allows for agent adaptive bidding whereas concept learning is of key importance to agent service bundling. The main features of the proposed architecture are agent communication through a common area, remote user access through servlets with authentication and encryption, data/knowledge separation and agent reputation assessment using customer satisfaction values. The functionality of all the proposed multi-agent system features is illustrated through an agent-based travel services application (MASTAS).
Where do people draw lines?

This paper presents the results of a study in which artists made line drawings intended to convey specific 3D shapes. The study was designed so that drawings could be registered with rendered images of 3D models, supporting an analysis of how well the locations of the artists' lines correlate with other artists', with current computer graphics (CG) line definitions, and with the underlying differential properties of the 3D surface. Lines drawn by artists in this study largely overlapped one another, particularly along the occluding contours of the object. Most lines that do not overlap contours overlap large gradients of the image intensity and correlate strongly with predictions made by recent line-drawing algorithms in CG. A few were not well described by any of the local properties considered in this study. The result of our work is a publicly available data set of aligned drawings, an analysis of where lines appear in that data set based on local properties of 3D models, and algorithms to predict where artists will draw lines for new scenes.
The Omega Ontology

We present the Omega ontology, a large terminological ontology obtained by remerging WordNet and Mikrokosmos, adding information from various other sources, and subordinating the result to a newly designed feature-oriented upper model. We explain the organizing principles of the representation used for Omega and discuss the methodology used to merge the constituent conceptual hierarchies. We survey a range of auxiliary knowledge sources (including instances, verb frame annotations, and domainspecific sub-ontologies) incorporated into the basic conceptual structure and applications that have benefited from Omega. Omega is available for browsing at http://omega.isi. edu/.