Miracle-dz/UniFAR-FTUs huggingface dataset:
Factors that influence the development of compassion fatigue, burnout, and compassion satisfaction in emergency department nurses.

PURPOSE The purpose of this study was twofold: (a) to determine the prevalence of compassion satisfaction, compassion fatigue, and burnout in emergency department nurses throughout the United States and (b) to examine which demographic and work-related components affect the development of compassion satisfaction, compassion fatigue, and burnout in this nursing specialty. DESIGN AND METHODS This was a nonexperimental, descriptive, and predictive study using a self-administered survey. Survey packets including a demographic questionnaire and the Professional Quality of Life Scale version 5 (ProQOL 5) were mailed to 1,000 selected emergency nurses throughout the United States. The ProQOL 5 scale was used to measure the prevalence of compassion satisfaction, compassion fatigue, and burnout among emergency department nurses. Multiple regression using stepwise solution was employed to determine which variables of demographics and work-related characteristics predicted the prevalence of compassion satisfaction, compassion fatigue, and burnout. The α level was set at . 05 for statistical significance. FINDINGS The results revealed overall low to average levels of compassion fatigue and burnout and generally average to high levels of compassion satisfaction among this group of emergency department nurses. The low level of manager support was a significant predictor of higher levels of burnout and compassion fatigue among emergency department nurses, while a high level of manager support contributed to a higher level of compassion satisfaction. CONCLUSIONS The results may serve to help distinguish elements in emergency department nurses' work and life that are related to compassion satisfaction and may identify factors associated with higher levels of compassion fatigue and burnout. CLINICAL RELEVANCE Improving recognition and awareness of compassion satisfaction, compassion fatigue, and burnout among emergency department nurses may prevent emotional exhaustion and help identify interventions that will help nurses remain empathetic and compassionate professionals.
Necessity (not just novelty) is the mother of invention: using creativity research to improve research in work and organizational psychology

ABSTRACT In this essay, we discuss reasons that work and organizational psychology does not live up to its self-declared mission of being an applied science in the service of improving both people’s quality of working life and organizational effectiveness. We use fundamentals of research on creativity and innovation as a lens through which we can view problems and possible solutions to these problems. In particular, we stress that innovation entails not only new, but also useful insights, that innovation requires “rewarding failure”, and that innovation feeds off of team diversity. We provide suggestions for how the definition of theoretical and empirical contributions of research, reward systems, and collaboration practices could be changed to foster innovative research that helps people thrive at work.
AS-level topology collection through looking glass servers

While accurate and complete modeling of the Internet topology at the Autonomous System (AS) level is critical for future protocol design, performance evaluation, simulation and analysis, still it remains a challenge to construct its accurate representation. In this paper, we collect BGP route announcements of ASes from Looking glass (LG) servers. By querying LG servers, we build an AS topology estimate of around 116 K AS links, from which we discover 11 K new AS links and 686 new ASes. We conclude that collecting BGP traces from LG servers can help enhance the current view of the AS topology from the BGP collector projects (e.g., RouteViews).
Direct analysis of Holliday junction resolving enzyme in a DNA origami nanostructure

Holliday junction (HJ) resolution is a fundamental step for completion of homologous recombination. HJ resolving enzymes (resolvases) distort the junction structure upon binding and prior cleavage, raising the possibility that the reactivity of the enzyme can be affected by a particular geometry and topology at the junction. Here, we employed a DNA origami nano-scaffold in which each arm of a HJ was tethered through the base-pair hybridization, allowing us to make the junction core either flexible or inflexible by adjusting the length of the DNA arms. Both flexible and inflexible junctions bound to Bacillus subtilis RecU HJ resolvase, while only the flexible junction was efficiently resolved into two duplexes by this enzyme. This result indicates the importance of the structural malleability of the junction core for the reaction to proceed. Moreover, cleavage preferences of RecU-mediated reaction were addressed by analyzing morphology of the reaction products.
Variable Length Representation in Evolutionary Electronics

This work investigates the application of variable length representation (VLR) evolutionary algorithms (EAs) in the field of Evolutionary Electronics. We propose a number of VLR methodologies that can cope with the main issues of variable length evolutionary systems. These issues include the search for efficient ways of sampling a genome space with varying dimensionalities, the task of balancing accuracy and parsimony of the solutions, and the manipulation of non-coding segments. We compare the performance of three proposed VLR approaches to sample the genome space: Increasing Length Genotypes, Oscillating Length Genotypes, and Uniformly Distributed Initial Population strategies. The advantages of reusing genetic material to replace non-coding segments are also emphasized in this work. It is shown, through examples in both analog and digital electronics, that the variable length genotype's representation is natural to this particular domain of application. A brief discussion on biological genome evolution is also provided.
3D tracking using rectangular regions in structured scenes

This paper presents a practical 3D tracking method using rectangular regions in structured scenes. The dominant orthogonal vanishing points and some projections of rectangular regions (PRR) are detected from the first frame of a video sequence. Then the focal length of the camera and the height/width ratios for each rectangle are determined. The full camera position and orientation are tracked using the intensity differences among the frame sequences. The advantage of the method is that it can obtain all initial tracking parameters only from the first frame while previous methods may require the first 100 frames or more for initialization, which makes the proposed method very suitable for real-time applications.
Popularity based distribution schemes for P2P assisted streaming of VoD contents

The Video on Demand (VoD) service is becoming a dominant service in the telecommunication market due to the great convenience regarding the choice of content items and their independent viewing time. However, it comes with the downsides of high server storage and capacity demands because of the large variety of content items and the high amount of traffic generated for serving all requests. Storing part of the popular contents on the peers brings certain advantages but, it still has issues regarding the overall traffic in the core of the network and the scalability. Therefore, we propose a P2P assisted model for streaming VoD contents that takes advantage of the clients unused uplink and storage capacity to serve requests of other clients and we present popularity based schemes for distribution of both the popular and unpopular contents on the peers. The proposed model and the schemes prove to reduce the streaming traffic in the core of the network, improve the responsiveness of the system and increase its scalability.
IDENTIKIT 1: A MODELING TOOL FOR INTERACTING DISK GALAXIES

By combining test-particle and self-consistent techniques, we have developed a method to rapidly explore the parameter space of galactic encounters. Our method, implemented in an interactive graphics program33 This software is available at http://www.ifa. hawaii.edu/faculty/barnes/research/identikit/. , can be used to find the parameters required to reproduce the observed morphology and kinematics of interacting disk galaxies. We test this system on an artificial data set of 36 equal-mass merging encounters, and show that it is usually possible to reproduce the morphology and kinematics of these encounters and that a good match strongly constrains the encounter parameters. This software is available at http://www.ifa. hawaii.edu/faculty/barnes/research/identikit/.
Two Problems of Circle in Image

Circle is an important primitive in document images, which is contained in many scenes and shapes due to the aesthetic feeling. As it is known to all, three nonlinear points determine a circle, namely, the radius and the coordinates of circle can be calculated. However, three nonlinear points cannot determine a unique desirable circle occasionally in images. Circumferences consist of many pixels, what is the relation of radius size and number of pixels on the circumferences with and without redundancy? We mainly discuss the condition about how to make a unique desirable circle with three nonlinear pixels in images and the above-mentioned relation. Finally, the relation and condition have been found and testified by experiments.
New Trends in the Chinese Diet: Cultural Influences on Consumer Behaviour

China is one of the most dynamic regions in the world in terms of economic growth and development. Such development has inevitably influenced the structure and habits of Chinese society. Whilst the economic condition of the middle class and high-income segment has steadily improved, cultural changes are also under way: ancient Chinese traditions now include major elements from other cultures, most notably the West. The above scenario is the background to this paper. A structured research-administered survey was developed to investigate the changes in the Chinese consumer food culture: 500 urban participants were randomly selected from six reference cities, covering geographically almost the whole country. This study aims not only to analyze the propensity of consumers to include food products from other countries in their ancient Chinese culinary culture, but also represents an initial attempt to perform a market segmentation of Chinese consumers according to their degree of cultural openness towards non-Chinese food, taking into account socio-demographic, cognitive and psychographic variables.
Apoptosis is promoted by the dsRNA‐activated factor (DRAF1) during viral infection independent of the action of interferon or p53

An apoptotic cellular defense mechanism is triggered in response to viral dsRNA generated during the course of infection by many DNA and RNA viruses. We demonstrate that apoptosis induced by dsRNA or a paramyxovirus is independent of the action of interferon as it can proceed in a variety of cell lines and primary cells deficient in an interferon response. Initiation of apoptosis appears to be triggered by activation of a cellular transcription factor, the dsRNA‐activated factor (DRAF1). DRAF1 is composed of interferon regulatory factor 3 (IRF‐3) and the transcriptional coactivators CREB binding protein (CBP) or p300. We find that activation of IRF‐3 in the absence of viral infection stimulates apoptosis. In addition, a negative interfering mutant blocks both target gene induction and apoptosis, demonstrating a requirement for gene expression by IRF‐3/DRAF1 to promote apoptosis. IRF‐3/DRAF1 target gene expression is also induced in response to a distinct apoptotic stimulus, the DNA damaging agent etoposide. The activity of the p53 tumor suppressor does not appear to be required for IRF‐3/DRAF1‐mediated apoptosis. —Weaver, B. K. , Ando, O. , Kumar, K. P., Reich, N. C Apoptosis is promoted by the dsRNA‐activated factor (DRAF1) during viral infection independent of the action of interferon or p53. FASEB J. 15, 501‐514 (2001)
Characteristics and Significance of Professional-Led Support Groups in the Treatment of Alcoholism

ABSTRACT A distinctive form of posttreatment support for persons in recovery from alcoholism (alcohol use disorders) is the club of treated alcoholics (CTA). These groups are in the tradition of Alcoholics Anonymous with several important distinctions: the CTA groups are led by a health or social care professional, family members are included in the group, and groups are encouraged to be active in local community. This is a descriptive study of 40 randomly selected CTA groups with a focus on how participation in these groups improves the level of psychosocial functioning in the participants with a focus on how the participants relate to each other and the assigned health care professional.
Scalable automated test generation using coverage guidance and random search

Dynamic symbolic execution has been shown to be an effective technique for automated test input generation. When applied to large-scale programs, its scalability however is limited due to the combinatorial explosion of the path space and the high cost of computation. Several sophisticated search strategies have been proposed to better guide dynamic symbolic execution towards achieving high code coverage. While confirmed effective, these techniques may deteriorate in practical situations because of the large computation cost involved. In this paper, we propose a search heuristic which is directed by coverage information and interleaved with random search to perform dynamic symbolic execution for coverage improvements and cost-effectiveness. We conducted two evaluations to evaluate the effectiveness of our proposed approach and to study the impact of computation costs on its practical capabilities.
Peak-to-average power ratio reduction for pulse-shaping OFDM systems

High peak-to-average power ratio (PAPR) is a major drawback of the pulse-shaping orthogonal frequency division (PS-OFDM) system (mainly refers to Gabor systems in this paper). Due to the overlapped signal structure, it is considered that conventional PAPR reduction schemes intended for rectangular window based OFDM will not be very effective if directly employed in PS-OFDM system. However, in this paper, by making use of the finite length of prototype filters and dividing the PS-OFDM systems into IFFT and filter parts, we propose to employing conventional PAPR reduction schemes directly in PS-OFDM systems before filtering operations. Different with other PAPR reduction techniques, the proposed scheme preserves the localization and orthogonality of the prototype filters and achieves a desirable PAPR reduction of PS-OFDM system at the same time.
A Novel Weighted Support Vector Machine Based on Particle Swarm Optimization for Gene Selection and Tumor Classification

We develop a detection model based on support vector machines (SVMs) and particle swarm optimization (PSO) for gene selection and tumor classification problems. The proposed model consists of two stages: first, the well-known minimum redundancy-maximum relevance (mRMR) method is applied to preselect genes that have the highest relevance with the target class and are maximally dissimilar to each other. Then, PSO is proposed to form a novel weighted SVM (WSVM) to classify samples. In this WSVM, PSO not only discards redundant genes, but also especially takes into account the degree of importance of each gene and assigns diverse weights to the different genes. We also use PSO to find appropriate kernel parameters since the choice of gene weights influences the optimal kernel parameters and vice versa. Experimental results show that the proposed mRMR-PSO-WSVM model achieves highest classification accuracy on two popular leukemia and colon gene expression datasets obtained from DNA microarrays. Therefore, we can conclude that our proposed method is very promising compared to the previously reported results.
A Distributed Node Localization Algorithm Based on Believable Factor for Wireless Sensor Network

Wireless sensor network has a wide range of applications in the fields of national defense, industry and agriculture, environmental monitoring and so on. The localization of sensor nodes is the basis of these applications. A new localization algorithm (wbf-Euclidean) is proposed in this paper, which is based on Euclidean algorithm. This algorithm utilizes iterative approach to increase localization coverage and sets believable factor threshold to avoid using nodes' outlier information. In addition, it uses combination trilateration method to obtain the set of coordinate estimates and then calculate the weighted mean to improve localization accuracy. Simulation results show that it is efficient to prevent large localization errors from spreading through the networks, and it is fit for the large scale sensor networks.
Numerical Methods for Evolution and Stationary ( Integro-) Differential Equations

This study-research project is about numerical methods of differential equations (ordinary differential equations (ODE), partial differential equation (PDE), and integro-differential equations (IDE). ) Required courses for this project are Math 212/213 (Multivariable Calculus), Math 302 (Differential Equations); and additional training in Math 345 (Introduction in Mathematical Biology), Math 413/414 (Numerical Analysis) and Math 441/442 (Applied Mathematics) would be helpful. In Section 1, we give a very short introduction of some basic knowledge on evolution PDEs, especially reaction-diffusion equations. A more comprehensive introduction is my lecture notes [1] for Math 490, and study material for reaction-diffusion equations is also available from my course website: http://www.math.wm.edu/~shij/math490-2006/index.html. In Section 2, we briefly review some numerical methods for studying the equations; and in Section 3, we give description of two possible projects.
Model Selection and the Principle of Minimum Description Length

This article reviews the principle of minimum description length (MDL) for problems of model selection. By viewing statistical modeling as a means of generating descriptions of observed data, the MDL framework discriminates between competing models based on the complexity of each description. This approach began with Kolmogorov's theory of algorithmic complexity, matured in the literature on information theory, and has recently received renewed attention within the statistics community. Here we review both the practical and the theoretical aspects of MDL as a tool for model selection, emphasizing the rich connections between information theory and statistics. At the boundary between these two disciplines we find many interesting interpretations of popular frequentist and Bayesian procedures. As we show, MDL provides an objective umbrella under which rather disparate approaches to statistical modeling can coexist and be compared. We illustrate the MDL principle by considering problems in regression, nonparametric curve estimation, cluster analysis, and time series analysis. Because model selection in linear regression is an extremely common problem that arises in many applications, we present detailed derivations of several MDL criteria in this context and discuss their properties through a number of examples. Our emphasis is on the practical application of MDL, and hence we make extensive use of real datasets. In writing this review, we tried to make the descriptive philosophy of MDL natural to a statistics audience by examining classical problems in model selection. In the engineering literature, however, MDL is being applied to ever more exotic modeling situations. As a principle for statistical modeling in general, one strength of MDL is that it can be intuitively extended to provide useful tools for new problems.
Wireless Access for Vehicular Environments

This report is to present the research of Wireless Access for Vehicular Environments (WAVE). It introduces the basic technologies used in this standard, also proposes some limitations and applications of this criteria. Based on this, this report focuses on two limitations: real-time communication constraints and unfairness dedication of channel with using distributed coordination function on Medium Access Control (MAC) layer. Some ideas for improving these limitations are raised with the results of simulations. For the real-time problem, a Time Division Multiple Access (TDMA) MAC layer is studied and evaluated. For the unfairness dedication of channel problem, a priority is given to each node of different speed to achieve a dynamic contention window size. The result of simulation shows this method efficiently improves this limitation. Keywords— IEEE 802.11p, IEEE P1609, WAVE, MAC, RSU,
Optimizing Hierarchical Classification Through Tree Evolution ∗

Hierarchical classification has been shown to have superior performance than flat classification. It is typically performed on hierarchie s created by and for humans rather than for classification performance. As a result , classification based on such hierarchies often yields suboptimal results. In thi s paper, we propose a novel genetic algorithm-based method on hierarchy adaptat ion for improved classification. Our approach customizes the typical GA to optimi ze classification hierarchies. In several text classification tasks, our approa ch produced hierarchies that significantly improved upon the accuracy of the origina l hierarchy as well as hierarchies generated by state-of-the-art methods.
An Approach for Fault Localization Based on Program Slicing and Bayesian

The key issue of reducing software cost and improving software reliability is locating defective codes precisely and efficiently. In this paper, we propose a fault localization method which combines program slicing and Bayesian method. First, we perform dynamic program slicing according to the slicing criteria. Then, we calculate the posterior probability according to Bayesian Theory. Finally, we take the posterior probability as the suspicion degree of the statement and rank the statements in the descending order based on suspicion degree. We apply our approach to six open-source programs. The results of the experiments show that the method we propose can improve the precision of fault localization to some extent.
Multi release modeling of a software with testing effort and fault reduction factor

In today's fast moving day to day life almost everything is more or less dependent on software. This dependence on software has increased the demand of reliable software in no time. Hence software firms are now a days releasing multiple versions of the software instead of providing a software with less number of bugs and removing the bugs of the previous version in the next up-gradation Firms remove the bugs of the previous version in the next up-gradation or by updating the software. But removal of bugs is not a simple task and at the time of removal it may be possible that testing team may introduce some new bugs to it. In the existing software reliability literature numerous models are proposed incorporating effort spent on removing the bugs. In this paper we have incorporated one more attribute of fault reduction factor in the effort based multi release modelling of a software. Fault reduction factors (FRFs) play an important role in software reliability and are generally defined as the ratio of the total number of reduced faults to the total number of failures experienced. FRFs are not fixed and it is affected by many factors, e.g., imperfect debugging, resource allocations, and debugging time lag. Taking this into consideration we propose two effort based multi up-gradation software reliability growth models incorporating time dependent FRF. Numerical illustration of the proposed model is done on a real life data set of tandem computers for four release.