Miracle-dz/UniFAR-FTUs huggingface dataset:
The Stabilizing Role of Government Size

This paper presents an analysis of how alternative models of the business cycle can replicate the stylized fact that large governments are associated with less volatile economies. Our analysis shows that adding nominal rigidities and costs of capital adjustment to an otherwise standard RBC model can generate a negative correlation between government size and the volatility of output. However, in the model, we find that the stabilizing effect is only due to a composition effect and it is not present when we look at the volatility of private output. Given that empirically we also observe a negative correlation between government size and the volatility of consumption, we modify the model by introducing rule-of-thumb consumers. In this modified version of our initial model we observe that consumption volatility is also reduced when government size increases in similar way to the observed pattern in OECD economies over the last 45 years.
Robust registration of 3D point sets for free-form surface inspection

The problem of robust registration of 3D point sets disturbed by noise for free-form surface inspection is considered. In this research, M-estimation methods are used to eliminate the effects of outliers, and a robust extension of tangent-squared distance minimization (TDM) using M-estimation is proposed. The proposed algorithm is compared with standard TDM method, iterative closest point (ICP) method and ICP with M-estimation in terms of robustness and convergence speed. The experiment results show that the algorithm exhibits faster convergence speed and better robustness against disturbed points.
Dynamic abstraction model checking

Model checking has attracted considerable attention since this technique is an automatic technique for verifying finite state concurrent systems. It is a formal method to verify if a software system or hardware system meets its properties. Nowadays, model checkers have become indispensable tools in hardware and software design and implementation, since they can reduce human efforts. Time and feasibility of the model checking process depends up on the size and complexity of the formal system model. However, the state space explosion problem still remains a major hurdle, as the number of global states can be enormous. There are many methods to improve the speed of model checkers and abstraction technology is one of them. Abstraction amounts to removing or simplifying details, as well as removing entire components of the concrete model irrelevant to the specifications. In practice, abstraction-based methods have been essential to verify designs of different fields of industrial complexity. Manual abstraction is ad hoc and error-prone; hence, automatic abstraction strategies are desirable for verifying actual hardware and software design. This thesis presents a new approach to check the model using two abstractions—Universal Abstraction and Existential Abstraction. These new techniques can check both the Existential fragment of Computational Tree Logic (ECTL) and the Universal fragment of Computational Tree Logic (ACTL) specifications. I developed a Model Checker, called LOTUS, building upon these new techniques with a traditional fixed point algorithm on Linux. Experimental results confirmed the feasibility and validity of this new dynamic model checking technique. The input grammar is designed and implemented using Bison and YACC on Linux. The process for this new technique follows. First, automatically construct two abstraction models according to the specifications defined in the input file by the user. Second, LOTUS verifies whether the abstraction model satisfies the specifications and outputs the conclusion. Lotus can produce the final output, if the conclusion is credible; otherwise, refine the two abstraction models
LcrG-LcrV Interaction Is Required for Control of Yops Secretion in Yersinia pestis

ABSTRACT Yersinia pestis expresses a set of plasmid-encoded virulence proteins called Yops and LcrV that are secreted and translocated into eukaryotic cells by a type III secretion system. LcrV is a multifunctional protein with antihost and positive regulatory effects on Yops secretion that forms a stable complex with a negative regulatory protein, LcrG. LcrG has been proposed to block the secretion apparatus (Ysc) from the cytoplasmic face of the inner membrane under nonpermissive conditions for Yops secretion, when levels of LcrV in the cell are low. A model has been proposed to describe secretion control based on the relative levels of LcrG and LcrV in the bacterial cytoplasm. This model proposes that under secretion-permissive conditions, levels of LcrV are increased relative to levels of LcrG, so that the excess LcrV titrates LcrG away from the Ysc, allowing secretion of Yops to occur. To further test this model, a mutant LcrG protein that could no longer interact with LcrV was created. Expression of this LcrG variant blocked secretion of Yops and LcrV under secretion permissive conditions in vitro and in a tissue culture model. These results agree with the previously described secretion-blocking activity of LcrG and demonstrate that the interaction of LcrV with LcrG is necessary for controlling Yops secretion.
Using SchedFlow for performance evaluation of workflow applications

Computational science increasingly relies on the execution of workflows in distributed networks to solve complex applications. However, the heterogeneity of resources in these environments complicates resource management and the scheduling of such applications. Sophisticated scheduling policies are being developed for workflows, but they have had little impact in practice because their integration into existing workflow engines is complex and time consuming as each policy has to be individually ported to a particular workflow engine. In addition, choosing a particular scheduling policy is difficult, as factors like machine availability, workload, and communication volume between tasks are difficult to predict. In this paper, we describe SchedFlow, a tool that integrates scheduling policies into workflow engines such as Taverna, DAGMan or Karajan. We show how SchedFlow was used to take advantage of different scheduling policies at different times, depending on the dynamic workload of the workflows. Our experiments included two real workflow applications and four different scheduling policies. We show that no single scheduling policy is the best for all scenarios, so tools like SchedFlow can improve performance by providing flexibility when scheduling workflows.
Multi-group multi-way relaying with multi-stage non-regenerative relay stations

In this paper, we propose a signal transmission model for multi-group multi-way (MGMW) relaying which allows complete information exchange among users belonging to different user groups, with applications such as file sharing among users separated by large distances. We achieve this through the use of multi-stage non-regenerative relay stations (RSs). The groups of multiple users are connected to the nearest RS stages which are again connected via RSs at the next nearest stage and so on. The RSs at each stage obtain messages from user groups connected through the next RS stage by subtracting information extracted from the previous RS stage. We formulate the achievable sum rate of such a network and investigate the impact of system parameters on it. We show that increasing the number of users per group, while keeping a smaller number of user groups, improves the sum rate.
Increasing the accuracy of untaught robot positions by means of a multi-camera system

We aim to improve the absolute in line positional accuracy of a robot-guided effector to better than 1 mm. We do so using photogrammetric techniques and by relying heavily on simulations to fine tune each parameter and avoid weak configurations. We also use simulations to design an LED calibration object adapted to this application. A test procedure enables us to validate both the simulated results as well as the calibration procedure. The test results exceed expectations by improving the absolute positioning of a robot effector by a factor of 20.
Integrating synchronous and asynchronous collaboration with virtual network computing

With thin-client virtual network computing technology, the support for synchronous collaboration offered by traditional CSCW tools has been extended to asynchronous participation in a shared workspace. Using frame buffer rectangles to relay pixel values, the system considered acquires and stores the ongoing computer session and offers all participants a joint viewing of their shared workspace. The system also forwards input from the real-time conferees to the remote session and offers support for teleoperations from multiple distributed users. It also lets latecomers retrieve and play back parts of the session they have missed with VCR-like control (fast forward, rewind, play, and stop). Distributed users can access the remote session from heterogeneous platforms such as X Window or Windows NT, or with a Web browser such as Netscape.
Gap 2 Promotes the Formation of a Stable Protein Complex Required for Mature Fap 1 Biogenesis

Haley Echlin, Fan Zhu, Yirong Li, Zhixiang Peng, Teresa Ruiz, Gregory J. Bedwell, Peter E. Prevelige, Jr., Hui Wu Departments of Pediatric Dentistry and Microbiology, Schools of Dentistry and Medicine, University of Alabama at Birmingham, Birmingham, Alabama, USA; Department of Laboratory Medicine, Tongji Medical School, Huazhong University of Science and Technology, Wuhan, Hubei, China; Department of Endodontics, Guanghua School of Stomatology, Sun Yat-sen University, Guangzhou, Guangdong, China; Department of Molecular Physiology and Biophysics, University of Vermont, Burlington, Vermont, USA
Comparison between k-nn and svm method for speech emotion recognition

Human - Computer intelligent interaction (HCII) is an emerging field of science aimed at providing natural ways for humans to use computer as aids. Machine intelligence needs to include emotional intelligence it is argued that for the computer to be able to interact with humans, it needs to have the communication skills of human. One of these skills is the ability to understand the emotional state of the person. Two recognition methods namely K-Nearest Neighbor (K-NN) and Support vector machine (SVM) classifier have been experimented and compared. The paper explores the simplicity and effectiveness of SVM classifier for designing the real-time emotion recognition system.
A review on emotion recognition using speech

Emotion recognition or affect detection from speech is an old and challenging problem in the field of artificial intelligence. Many significant research works have been done on emotion recognition. In this paper, the recent works on affect detection using speech and different issues related to affect detection has been presented. The primary challenges of emotion recognition are choosing the emotion recognition corpora (speech database), identification of different features related to speech and an appropriate choice of a classification model. Different types of methods to collect emotional speech data and issues related to them are covered by this presentation along with the previous works review. Literature survey on different features used for recognizing emotion from human speech has been discussed. The significance of various classification models has been presented along with some recent research works review. A detailed description of a prime feature extraction technique named Mel Frequency Cepstral Coefficient (MFCC) and brief description of the working principle of some classification models are also discussed here. In this paper terms like affect detection and emotion recognition are used interchangeably.
ÍÓ LA PSICOLOGÍA POSITIVA: ANTIGUA O NUEVA CONCEPCIÓN POSITIVE PSYCHOLOGY: EARLY OR NEW CONCEPTION

This paper presents the most important concepts and contents of the field of positive psychology. The psychology born with a positive approach, with three main objectives: to cure mental disorders, make life more accomplishing and productive, and identify the talent and intelligence of the people and develop them. Historically suffers a break from the great wars, which focused interest in solving the damages and their consequences. In the second millennium, rising again from the hand of Martin Seligman and is consolidating with great potential and depth of influence in society. To
Magnetic resonance imaging with ultrashort TE (UTE) PULSE sequences: Technical considerations

It is now possible to detect signals from tissues and tissue components with short T2s, such as cortical bone, using ultrashort TE (UTE) pulse sequences. The background to the use of these sequences is reviewed with particular emphasis on MR system issues. Tissue properties are discussed, and tissues are divided into those with a majority and those with a minority of short T2 components. UTE pulse sequences and their variants are described and clinical applications are illustrated. System design requirements for sequences of this type, including gradient performance, RF switching, and data‐processing issues, are outlined. J. Magn. Reson. Imaging 2007. © 2007 Wiley‐Liss, Inc.
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics

We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence. We consider the problems of enumerating such subsets with and without order, and show hardness results that already hold for the propositional Horn fragment, or for the Description Logic EL. We show complexity results for several other related decision and enumeration problems for these fragments that extend to more expressive logics. In particular we show that hardness of these problems depends not only on expressivity of the fragment but also on the shape of the axioms used.
Analysing narratives as practices

Departing from a critique of the conventional paradigm of narrative analysis, inspired by Labov and the narrative turn in social sciences, we propose an alternative framework, recommending combining a focus on the local occasioning of narratives in interaction with the analysis of their participation in a variety of macro-processes, through mobilizing the notions of social practice, genre and community of practice.
Healthy Reflections: The Influence of Mirror-Induced Self-Awareness on Taste Perceptions

Taste, as a focal aspect of food products, plays a major role in food consumption decisions as well as consumers’ eating habits. Here, we show that the taste perception of unhealthy food is malleable, and the presence of a mirror can make unhealthy food less tasty by increasing self-awareness. After eating unhealthy food in front of a mirror, individuals experience the discomfort of acting against the standards of healthy eating. We argue that people attribute this discomfort to the food’s taste since it is difficult to attribute the discomfort to the self while being self-aware. Four studies test the proposed effect of a mirror on food taste and consumption and examine its boundary conditions.
Behavioral features of individuals with Phelan McDermid (22q13.3 deletion) syndrome: An examination of autistic behavior, adaptive functioning and psychiatric symptoms

The 22q13.3 deletion syndrome is a neurodevelopmental disorder that includes general hypotonia, developmental delay, absent or poor speech, and autistic behavior. Despite advances in genetic testing, PMS remains under diagnosed because of difficulty identifying the behavioral phenotype. Results of the current study indicate that autism spectrum disorder (ASD) is a common occurrence among persons with PMS. The ASD criteria most frequently met by participants were deficits in reciprocal social interaction and play, and in verbal language and non-verbal communication. The comorbidity of PMS and ASD is characterized by more adaptive deficits in the areas of socialization and communication, as well as increased mental health risks. These findings add specificity to the behavioral phenotype of PMS and provide direction for future research. BEHAVIORAL FEATURES OF INDIVIDUALS WITH PMS 3
Belief, Awareness, and Two-Dimensional Logic

Belief has been formally modelled using doxastic logics in recent decades. The possible worlds model provides an intuitive semantics for these log­ ics. But it also commits us to the problem of logical omniscience. A number of logics have been intro­ duced to circumvent the problem. Of particular in­ terest is the logic of awareness. In this paper we present a new method to put awareness into doxastic logic so as to get a flexible way to model actual belief. The underlying logics are two-dimensional logics. Two two-dimensional doxastic logics are given. In the first logic, a quite limited concept of actual belief is presented. In the second logic, twodimensional and classical semantics are combined into a hybrid system.
DeAMON: A Decentralized Adaptive Multi-Hop Scheduling Protocol for 6TiSCH Wireless Networks

The IEEE 802.15. 4-2015 standard provides a link-layer mechanism, based on time synchronized channel hopping (TSCH), to enable deterministic low-power wireless mesh networking. The emerging IPv6 over IEEE 802.15. 4e TSCH (6TiSCH) working group aims at harmonizing an IP-enabled protocol stack with the IEEE 802.15. 4e link layer. In 802.15. 4-TSCH medium access control, nodes follow a communication schedule; however, the standard does not specify any scheduling policy. Therefore, a number of recent studies have investigated scheduling mechanisms for 6TiSCH wireless networks. This paper introduces DeAMON, which is decentralized adaptive multi-hop scheduling protocol for 6TiSCH wireless networks. The key features of DeAMON include traffic-awareness, sequential scheduling, parallel transmissions, robust over-provisioning, and adaptability to topology changes. Moreover, DeAMON incurs minimal signaling overhead. Performance evaluation demonstrates that DeAMON outperforms state-of-the-art distributed scheduling protocols in terms of reliability, latency, and resource utilization.
Approximation Algorithms for Euler Genus and Related Problems

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by Thomassen [23], [24], and it is known to be fixed-parameter tractable. However, the approximability of the Euler genus is wide open. While the existence of an O(1)-approximation is not ruled out, only an O(√n)-approximation [3] is known even in bounded degree graphs. In this paper we give a polynomialtime algorithm which on input a bounded-degree graph of Euler genus g, computes a drawing into a surface of Euler genus gO(1) · logO(1) n. Combined with the upper bound from [3], our result also implies a O(n1/2-α)-approximation, for some constant α > 0. Using our algorithm for approximating the Euler genus as a subroutine, we obtain, in a unified fashion, algorithms with approximation ratios of the form OPTO(1) · logO(1) n for several related problems on bounded degree graphs. These include the problems of orientable genus, crossing number, and planar edge and vertex deletion problems. Our algorithm and proof of correctness for the crossing number problem is simpler compared to the long and difficult proof in the recent breakthrough by Chuzhoy [5], while essentially obtaining a qualitatively similar result. For planar edge and vertex deletion problems our results are the first to obtain a bound of form poly(OPT, log n). We also highlight some further applications of our results in the design of algorithms for graphs with small genus. Many such algorithms require that a drawing of the graph is given as part of the input. Our results imply that in several interesting cases, we can implement such algorithms even when the drawing is unknown.
Email typosquatting

While website domain typosquatting is highly annoying for legitimate domain operators, research has found that it relatively rarely presents a great risk to individual users. However, any application (e.g., email, ftp,.) relying on the domain name system for name resolution is equally vulnerable to domain typosquatting, and consequences may be more dire than with website typosquatting. This paper presents the first in-depth measurement study of email typosquatting. Working in concert with our IRB, we registered 76 typosquatting domain names to study a wide variety of user mistakes, while minimizing the amount of personal information exposed to us. In the span of over seven months, we received millions of emails at our registered domains. While most of these emails are spam, we infer, from our measurements, that every year, three of our domains should receive approximately 3,585 "legitimate" emails meant for somebody else. Worse, we find, by examining a small sample of all emails, that these emails may contain sensitive information (e.g., visa documents or medical records). We then project from our measurements that 1,211 typosquatting domains registered by unknown entities receive in the vicinity of 800,000 emails a year. Furthermore, we find that millions of registered typosquatting domains have MX records pointing to only a handful of mail servers. However, a second experiment in which we send "honey emails" to typosquatting domains only shows very limited evidence of attempts at credential theft (despite some emails being read), meaning that the threat, for now, appears to remain theoretical.
Frontal midline theta oscillations during mental arithmetic: effects of stress

Complex cognitive tasks such as mental arithmetic heavily rely on intact, well-coordinated prefrontal cortex (PFC) function. Converging evidence suggests that frontal midline theta (FMT) oscillations play an important role during the execution of such PFC-dependent tasks. Additionally, it is well-established that acute stress impairs PFC function, and recent evidence suggests that FMT is decreased under stress. In this EEG study, we investigated FMT oscillations during a mental arithmetic task that was carried out in a stressful and a neutral control condition. Our results show late-onset, sustained FMT increases during mental arithmetic. In the neutral condition FMT started to increase earlier than in the stress condition. Direct comparison of the conditions quantified this difference by showing stronger FMT increases in the neutral condition in an early time window. Between-subject correlation analysis showed that attenuated FMT under stress was related to slowed reaction times. Our results suggest that FMT is associated with stimulus independent mental processes during the natural and complex PFC-dependent task of mental arithmetic, and is a possible marker for intact PFC function that is disrupted under stress.
Relationship between transformational leadership behaviors and manufacturing strategy

Purpose – It is widely agreed that top management's leadership behavior is a source for achieving and sustaining competitive advantage. Very few research studies analyzed the prevalence of transformational leadership style in the manufacturing environment, and importantly, the associations between transformational behaviors and manufacturing strategies in connection with flexibility, quality, delivery, and cost are not yet deeply explored in the literature. In this direction, efforts are initiated to explain the relationships between transformational leadership behaviors and manufacturing strategies in this study. The paper aims to discuss these issues. Design/methodology/approach – A systematic literature review was conducted by analyzing all traditional and contemporary research studies in the fields of leadership and operations management in order to examine the link between transformational leadership and manufacturing strategies comprising of flexibility, quality, delivery, and cost strategy. Finding.