Miracle-dz/UniFAR-FTUs huggingface dataset:
Exact algorithms based on specific complexity measures for hard problems

At present, most of the important computational problems—be they decision, search, or optimization problems—are known to satisfy one of the following two criteria: 1. The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small enough to guarantee that the problem can be tackled efficiently in practice. In particular, the decision version of the problem is in P. Typical time complexities are O(n log n) and O(nk), k ≤ 3. 2. The problem is NP-hard, and its decision version is NP-complete. We do not know whether the problem can be solved in polynomial time, but it is complex enough to express every other NP-complete problem via polynomial-time transformations. A typical time complexity for this case is O(cn) with c > 1.1. Under the widely accepted assumption that P6=NP, exact algorithms for problems of the second variety inevitably take superpolynomial time (not necessarily for every input, but in the worst case). In terms of worst-case behavior, it is easy to see that the respective algorithms can be infeasible even for instances of moderate size. The thesis at hand addresses this intricacy by combining two concepts, one of which is a well-known paradigm and the other one of which is an analytical tool that has only been used less explicitly in earlier scholarship. Firstly, we consider the parameterized complexity of hard graph problems. In particular, we design and analyze parameterized algorithms, i.e., algorithms whose running times are typically exponential in some parameter of the input (such as the desired size of the solution), but only polynomial in the size of the input. The most important of the resulting runtime bounds are: O((2 + ε)k · poly(n)) to find an optimum Steiner tree for k terminals O(2.7606k · poly(n)) to check for a k-node connected vertex cover O(3.2361k · poly(n)) to check for a k-node tree cover of weight ≤W O(1.3803k · poly(n)) to count all vertex covers of size up to k O(4k · poly(n)) to check for a k-node path O((16 + ε)k · poly(n)) to check for k edge-disjoint triangles All of the above results constitute the best parameterized runtime bounds for the respective problems known today. Secondly, we employ problem-specific complexity measures: we identify quantities whose smallness can be exploited in order to solve the problem more efficiently, then prove that they are small in any case, or that they can be made small using bounded additional effort. Such complexity measures
Past Experiences of Getting Bullied and Assaulted and Posttraumatic Stress Disorder (PTSD) after a Severe Traumatic Event in Adulthood: A Study of World Trade Center (WTC) Responders

ABSTRACT Although experiencing bullying and other forms of assault is associated with adverse physical, emotional, and psychological consequences, the long-term consequences, especially in the aftermath of a severe trauma in adulthood, is not known. This study examined the relationship between history of being bullied and/or assaulted and posttraumatic stress disorder (PTSD) symptoms among responders to the World Trade Center (WTC) disaster. During 2015–2016, a modified life events checklist was administered to responders at Stony Brook WTC Health Program. WTC-related PTSD symptoms were assessed by PTSD checklist (PCL). Longitudinal mixed models examined associations between bullying, other forms of assault, and severity and chronicity of PTSD symptoms. Approximately, 13% of 920 responders had probable WTC-PTSD (PCL≥44). Being bullied in childhood was associated with increased odds of WTC-PTSD (adjusted odds ratio [aOR] = 7.34; 95% confidence interval [CI] = 2.12–25.34), adjusted for demographics, other stressors, and WTC exposures. PTSD odds decreased over time among those not bullied (aOR 0.82; 95% CI: 0.73–0.92), but not among victims. Experiencing physical, sexual, or verbal assaults during adulthood also had a significant association with WTC-PTSD (aOR 4.64; 95% CI: 1.98–10.92). Findings suggest being bullied in childhood and/or assaulted in adulthood can increase PTSD risk and progression after mass trauma.
Cyberbullying on Social Networking Sites: The Crime Opportunity and Affordance Perspectives

Abstract Cyberbullying on social networking sites (SNS bullying) is an emerging societal challenge related to the deviant use of technologies. To address the research gaps identified in the literature, we draw on crime opportunity theory and the affordance perspective to propose a meta-framework that guides our investigation into SNS bullying. The meta-framework explains how SNS affordances give rise to the evaluation of favorable SNS environmental conditions for SNS bullying, which, in turn, promote SNS bullying. The research model was empirically tested using a longitudinal online survey of 223 SNS users. The results suggest that the evaluation of SNS environmental conditions predict SNS bullying, and SNS affordances influence the evaluation of these environmental conditions. This work offers a new theoretical perspective to study SNS bullying, highlighting the critical impacts of environmental conditions in shaping such behavior. It also provides actionable insights into measures that combat SNS bullying.
Quality control on the frontier

In the world of high-throughput sequencing there are numerous challenges to effective data quality control. There are no single quality metrics which are appropriate in all conditions. Here we detail the different open source software used at the Exeter Sequencing Service to provide generic quality control information, as well as more specific metrics for genomic and transcriptomic libraries run on Illumina platforms.
Hurricane Katrina: A Case Study of its Impacts on Medical Service Providers and Their Client Populations*

There is a great deal of literature in the areas of: (1) medical demography; (2) the effect of disasters on first re- sponders; (3) measuring the immediate demographic and social effects of a disaster; and (4) the short and long term eco- nomic and financial effects of disasters. However, there is very little if anything about the demographic effects of large scale disasters on medical providers once rescue operations have been completed and operations move into the relief and recovery/rehabilitation phases associated with a disaster. This paper seeks to bridge this gap by providing as a "recov- ery/rehabilitation" case study, estimates of the effects of Hurricane Katrina on the client populations and candidates for a specific medical procedure in the service areas associated with two medical facilities on the Mississippi gulf coast. The es- timates presented here show that Katrina had a substantial demographic impact and that this translated into an adverse im- pact on the client base of both medical facilities. Although the results come from a single case study, the results suggest that the effects of a disaster can have substantial impacts on medical care providers and their ability to continue business that goes well beyond physical damage. That is, these results suggest that the impact of demographic effects of a disaster on a client base can be more important than physical damage, a fact that does not appears to be widely recognized. The first step in effectively dealing with a disaster is the presence of a plan and it is typical of organizations to have both "dis- aster recovery" plans and "business continuation" plans. Given the long term effects of Katrina on client populations found in this case study, it would be prudent that medical care providers include estimates of demographic impacts on their client populations in these plans, particularly in regard to the long-term "effects horizon" of a given disaster
User interfaces for privacy agents

Most people do not often read privacy policies because they tend to be long and difficult to understand. The Platform for Privacy Preferences (P3P) addresses this problem by providing a standard machine-readable format for website privacy policies. P3P user agents can fetch P3P privacy policies automatically, compare them with a user's privacy preferences, and alert and advise the user. Developing user interfaces for P3P user agents is challenging for several reasons: privacy policies are complex, user privacy preferences are often complex and nuanced, users tend to have little experience articulating their privacy preferences, users are generally unfamiliar with much of the terminology used by privacy experts, users often do not understand the privacy-related consequences of their behavior, and users have differing expectations about the type and extent of privacy policy information they would like to see. We developed a P3P user agent called Privacy Bird. Our design was informed by privacy surveys and our previous experience with prototype P3P user agents. We describe our design approach, compare it with the approach used in other P3P use agents, evaluate our design, and make recommendations to designers of other privacy agents.
Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot

Abs t rac t Much of the focus of the research effort in path planning for mobile robots has centred on the problem of finding a path from a start location to a goal location, while minimising one or more parameters such as length of path, energy consumption or journey time. A path of complete coverage is a planned path in which a robot sweeps all areas of free space in an environment in a systematic and efficient manner. Possible applications for paths of complete coverage include autonomous vacuum cleaners, lawn mowers, security robots, land mine detectors etc. This paper will present a solution to this problem based upon an extension to the distance transform path planning methodology. The solution has been implemented on the self-contained autonomous mobile robot called the Yamabico.
A molecular dynamics simulation of DNA damage induction by ionizing radiation

We present a multi-scale simulation of the early stage of DNA damages by the indirect action of hydroxyl (•OH) free radicals generated by electrons and protons. The computational method comprises of interfacing the Geant4-DNA Monte Carlo with ReaxFF molecular dynamics software. A clustering method was employed to map the coordinates of •OH-radicals extracted from the ionization-track-structures onto nano-meter simulation voxels filled with DNA and water molecules. The molecular dynamics simulation provides the time-evolution and chemical reactions in individual simulation voxels as well as the energy–landscape accounted for the DNA–•OH chemical reaction that is essential for the first-principle enumeration of hydrogen abstractions, chemical bond breaks, and DNA-lesions induced by collection of ions in clusters less than the critical dimension which is approximately 2–3 Å. We show that the formation of broken bonds leads to DNA-base and backbone damages that collectively propagate to DNA single and double-strand breaks. For illustration of the methodology, we focused on particles with an initial energy of 1 MeV. Our studies reveal a qualitative difference in DNA damage induced by low energy electrons and protons. Electrons mainly generate small pockets of •OH-radicals, randomly dispersed in the cell volume. In contrast, protons generate larger clusters along a straight-line parallel to the direction of the particle. The ratio of the total DNA double-strand breaks induced by a single proton and electron track is determined to be ≈4 in the linear scaling limit. In summary, we have developed a multi-scale computational model based on first-principles to study the interaction of ionizing radiation with DNA molecules. The main advantage of our hybrid Monte Carlo approach using Geant4-DNA and ReaxFF is the multi-scale simulation of the cascade of both physical and chemical events which result in the formation of biological damage. The tool developed in this work can be used in the future to investigate the relative biological effectiveness of light and heavy ions that are used in radiotherapy.
ON THE SPECTRAL PROPERTIES OF MATRICES ASSOCIATED WITH TREND FILTERS

This note is concerned with the spectral properties of matrices associated with linear smoothers. We derive analytical results on the eigenvalues and eigenvectors of smoothing matrices by interpreting the latter as perturbations of matrices belonging to algebras with known spectral properties, such as the circulant and the generalized tau. These results are used to characterize the properties of a smoother in terms of an approximate eigen-decomposition of the associated smoothing matrix.
The research on segmentation of complex object

It is difficult to use the traditional image segmentation method to segment the complex object whose boundary is blurred from the background. The active contour model, based on level set, is widely used in recent years and selected to segment this type of object in this paper. To increase the speed of segmentation, the fast active contour model without need to solve partial differential equation is used in this paper. This paper proposes a new way of thinking about designing the data-dependent speed function in the fast active model and gives the corresponding general speed function. The probability estimate theory and the conventional CV model are introduced into the data-dependent speed function, and then this paper proposes two novel fast models which can be called histogram-based fast model and CV-based fast model. The two models are studied both theoretically and experimentally. Finally a conclusion can be drawn that the histogram-based fast model is applied to segment the complex object from the background.
Teacher Evaluation to Enhance Professional Practice

One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain those all requirements when having much money? Why don't you try to get something simple at first? That's something that will lead you to know more about the world, adventure, some places, history, entertainment, and more? It is your own time to continue reading habit. One of the books you can enjoy now is teacher evaluation to enhance professional practice here.
Genetics and Genomics of Core STR Loci Used in Human Identity Testing

*Official Disclaimer: Contribution of the U.S. National Institute of Standards and Technology. Not subject to copyright. Points of view in this document are those of the author and do not necessarily represent the official position or policies of the US Department of Justice. Certain commercial equipment, instruments and materials are identified in order to specify experimental procedures as completely as possible. In no case does such identification imply a recommendation or endorsement by the National Institute of Standards and Technology nor does it imply that any of the materials, instruments or equipment identified are necessarily the best available for the purpose.
Quality Estimation for Synthetic Parallel Data Generation

This paper presents a novel approach for parallel data generation using machine translation and quality estimation. Our study focuses on pivot-based machine translation from English to Croatian through Slovene. We generate an English―Croatian version of the Europarl parallel corpus based on the English―Slovene Europarl corpus and the Apertium rule-based translation system for Slovene―Croatian. These experiments are to be considered as a first step towards the generation of reliable synthetic parallel data for under-resourced languages. We first collect small amounts of aligned parallel data for the Slovene―Croatian language pair in order to build a quality estimation system for sentence-level Translation Edit Rate (TER) estimation. We then infer TER scores on automatically translated Slovene to Croatian sentences and use the best translations to build an English―Croatian statistical MT system. We show significant improvement in terms of automatic metrics obtained on two test sets using our approach compared to a random selection of synthetic parallel data.
MOSAIC CONSTRUCTION BY FEATURE TRACKING AND DIRECT REGISTRATION

This paper describes a technique for the construction of 2D mosaics and which integrates feature tracking with a direct registration procedure. An initial alignment computed from a set of feature point correspondences supplied by the tracker is subsequently refined by means of a second registering step directly based on image contents. The direct registration technique is implemented as a two-step process in order to obtain an enhanced toleration of possible inaccuracies in the feature-based estimation – without increasing computational cost. This approach enables the avoidance of more computationally expensive techniques such as pyramidal registration. Some mosaic examples are constructed to demonstrate the effectiveness of this approach.
Atorvastatin decreases apolipoprotein C-III in apolipoprotein B-containing lipoprotein and HDL in type 2 diabetes: a potential mechanism to lower plasma triglycerides.

OBJECTIVE Apolipoprotein (apo)C-III is a constituent of HDL (HDL apoC-III) and of apoB-containing lipoproteins (LpB:C-III). It slows the clearance of triglyceride-rich lipoproteins (TRLs) by inhibition of the activity of the enzyme lipoprotein lipase (LPL) and by interference with lipoprotein binding to cell-surface receptors. Elevated plasma LpB:C-III is an independent risk factor for cardiovascular disease. We studied the effect of atorvastatin on plasma LpB:C-III and HDL apoC-III. RESEARCH DESIGN AND METHODS We studied the effect of 30 weeks' treatment with 10 and 80 mg atorvastatin on plasma apoC-III levels in a randomized, double-blind, placebo-controlled trial involving 217 patients with type 2 diabetes and fasting plasma triglycerides between 1.5 and 6.0 mmol/l. RESULTS Baseline levels of total plasma apoC-III, HDL apoC-III, and LpB:C-III were 41.5 +/- 10.0, 17.7 +/- 5.5, and 23.8 +/- 7.7 mg/l, respectively. Plasma apoC-III was strongly correlated with plasma triglycerides (r = 0.74, P < 0.001). Atorvastatin 10- and 80-mg treatment significantly decreased plasma apoC-III (atorvastatin 10 mg, 21%, and 80 mg, 27%), HDL apoC-III (atorvastatin 10 mg, 22%, and 80 mg, 28%) and LpB:C-III (atorvastatin 10 mg, 23%, and 80 mg, 28%; all P < 0.001). The decrease in plasma apoC-III, mainly in LpB:C-III, strongly correlated with a decrease in triglycerides (atorvastatin 10 mg, r = 0.70, and 80 mg, r = 0.78; P < 0.001). Atorvastatin treatment also leads to a reduction in the HDL apoC-III-to-HDL cholesterol and HDL apoC-III-to-apoA-I ratios, indicating a change in the number of apoC-III per HDL particle (atorvastatin 10 mg, -21%, and 80 mg, -31%; P < 0.001). CONCLUSIONS Atorvastatin treatment resulted in a significant dose-dependent reduction in plasma apoC-III, HDL apoC-III, and LpB:C-III levels in patients with type 2 diabetes. These data indicate a potentially important antiatherogenic effect of statin treatment and may explain (part of) the triglyceride-lowering effect of atorvastatin.
Optimal linear codes with a local-error-correction property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such “local” parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.
Squarified Treemaps

An extension to the treemap method for the visualization of hierarchical information, such as directory structures and organization structures, is presented. The standard treemap method often gives thin, elongated rectangles. As a result, rectangles are difﬁcult to compare and to select. A new method is presented to generate lay-outs in which the rectangles approximate squares. To strenghten the visualization of the structure, shaded frames are used around groups of related nodes.
Coursebook Texts as a Helping Hand for Classifying Linguistic Complexity in Language Learners’ Writings

We bring together knowledge from two different types of language learning data, texts learners read and texts they write, to improve linguistic complexity classification in the latter. Linguistic complexity in the foreign and second language learning context can be expressed in terms of proficiency levels. We show that incorporating features capturing lexical complexity information from reading passages can boost significantly the machine learning based classification of learner-written texts into proficiency levels. With an F1 score of . 8 our system rivals state-of-the-art results reported for other languages for this task. Finally, we present a freely available web-based tool for proficiency level classification and lexical complexity visualization for both learner writings and reading texts.
Field of Study and Earnings Inequality among the Highly Educated: 1993-2010

Field of study specializes individuals’ human capital in ways that might be either substitutable or complementary to technological change. We study changes in the earnings distribution of the college-educated population between 1993 and 2010 using the National Survey of College Graduates. After documenting changes that increase earnings inequality, we decompose them into composition and wage-structure effects. We find that composition effects account for virtually none of the growth of inequality and, in fact, are surprisingly small, even after we incorporate field of study into the decomposition. We conclude with speculation about why large inter-field changes in earnings did not lead to comparable changes in the flow of entrants.
Battery State of Charge estimation using Extended Kalman Filter

Battery State of Charge (SOC) evaluation in electrical vehicles (EVs) environment is a key point for widely acceptance of this new technology. As SOC cannot be measured it is imperative to use some method that can accurately make its estimation using measurable variables, such as battery terminal voltage and current. As Kalman Filters are commonly accepted as the best estimator for linear systems, and a good one for non-linear ones, it is expected that they can be successfully applied to battery SOC estimation. So, in this paper, it is presented an Extended Kalman Filter (EKF) based technique for SOC estimation. As EKF needs a process model it is used a new one-dimensional, physics based, battery model that solves Fick's diffusion equations subjected to its boundary conditions. Used Batteries are Lithium-polymer ones due to its promising application as EVs energy source. A set of experiments, with different current profiles, were made and its results confronted with simulated ones enabling to conclude about the quality of proposed battery model and EKF SOC estimation.