Miracle-dz/UniFAR-FTUs huggingface dataset:
Citation for Published Item: Use Policy Algorithms and Almost Tight Results for 3-colorability of Small Diameter Graphs

the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited. The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full DRO policy for further details. Abstract The 3-coloring problem is well known to be NP-complete. It is also well known that it remains NP-complete when the input is restricted to graphs with diameter 4. Moreover, assuming the Exponential Time Hypothesis (ETH), 3-coloring cannot be solved in time 2 o(n) on graphs with n vertices and diameter at most 4. In spite of extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of this problem on graphs with small diameter, i.e. with diameter at most 2, or at most 3, has been an open problem. In this paper we investigate graphs with small diameter. For graphs with diameter at most 2, we provide the first subexponen-tial algorithm for 3-coloring, with complexity 2 O(√ n log n). Furthermore we extend the notion of an articulation vertex to that of an articulation neighborhood, and we provide a polynomial algorithm for 3-coloring on graphs with diameter 2 that have at least one 123 Algorithmica articulation neighborhood. For graphs with diameter at most 3, we establish the complexity of 3-coloring by proving for every ε ∈ [0, 1) that 3-coloring is NP-complete on triangle-free graphs of diameter 3 and radius 2 with n vertices and minimum degree δ = Θ(n ε). Moreover, assuming ETH, we use three different amplification techniques of our hardness results, in order to obtain for every ε ∈ [0, 1) subexponen-tial asymptotic lower bounds for the complexity of 3-coloring on triangle-free graphs with diameter 3 and minimum degree δ = Θ(n ε). Finally, we provide a 3-coloring algorithm with running time 2 O(min{δΔ, n δ log δ}) for arbitrary graphs with diameter 3, where n is the number of vertices and …
Cultural Ecosystem Services in Protected Areas: Understanding Bundles, Trade‐Offs, and Synergies

The concept of ecosystem services (ES) provides a potentially useful tool for decision‐making in natural area management. Provisioning and regulating ES often occur in “bundles” that are cohesive because of coprovisioning or codependence. We asked whether individual preferences for cultural benefits also define service bundles. Data from a large survey of visitor preferences (n = 3,131 respondents) from all 19 South African National Parks indicated five bundles of cultural ecosystem services: (1) “natural history,” (2) “recreation,” (3) “sense of place,” (4) “safari experiences,” and (5) “outdoor lifestyle. ” Trade‐offs and synergies between bundles of services depended on the ecosystem providing them and on alignment between demand for services and the supply of particular service bundles in specific ecosystems. Our results show that identifying demand for multiple services can both help us to understand why people visit and value protected areas, and better inform the management choices that influence service provision.
Sol-gel synthesis of barium-strontium titanate in porous anodic alumina for uncooled IR detector

We report on sol-gel synthesis of barium-strontium titanate (BST) in porous anodic alumina. BST inside the channels of mesoporous matrices is considered as component allowing observation of phase transition under IR irradiation, thus, from our viewpoint, tunable photonic crystal for detection of IR irradiation could be developed. Sol-gel derived BST doped with terbium fabricated in porous anodic alumina exhibits room-temperature Tb-related photoluminescence (PL).
Cost-effective lifetime and yield optimization for NoC-based MPSoCs

As manufacturing processes scale, designers are increasingly dependent on techniques to mitigate manufacturing defect and permanent failure. In embedded systems-on-chip, system lifetime and yield can be increased using slack—under-utilization in execution and storage resources—so that when components are defective, data and tasks can be remapped and rescheduled. For any given system, the design space of possible slack allocations is both large and complex, consisting of every possible way to replace each component in the initial system with another from the component library. Based on the observation that useful slack is often quantized, we have developed Critical Quantity Slack Allocation (CQSA), an approach that effectively and efficiently allocates execution and storage slack to jointly optimize system yield and cost. While exploring less than 1.4% of the slack allocation design space, our approach consistently outperforms alternative slack allocation techniques to find sets of designs within 1.4% of the lifetime-cost Pareto-optimal front. When applied to yield-cost optimization, our approach again outperforms alternative techniques, exploring less than 1.62% of the design space to find sets of designs within 4.27% of the yield-cost Pareto-optimal front. One advantage of managing failure at the system level is that the same techniques that improve lifetime often also improve yield. As a result, with little modification, CQSA is further able to perform effective joint optimization of lifetime and yield, finding designs within 1.6% of the Pareto-optimal front.
Learning relational algebra by snapping blocks

Relational algebra provides a theoretical foundation for how modern database management systems optimize and execute queries. Its main concepts are based on set theory and first order logic, which can be challenging for students to learn due to their abstract nature. This paper presents Bags, a new type of visual programming environment (inspired by Snap! ) for the teaching of relational operations and data analysis. Students formulate algebraic queries by snapping together graphical blocks that represent data sets and relational operators, resulting in an interactive visualization of the underlying concepts. The outcomes of this work will not only enhance university-level database courses, but also provide an engaging computational thinking resource for K-12 teachers in content areas outside of science and engineering.
Gaussian pseudo-maximum likelihood estimation of fractional time series models

We consider the estimation of parametric fractional time series models in which not only is the memory parameter unknown, but one may not know whether it lies in the stationary/invertible region or the nonstationary or noninvertible regions. In these circumstances, a proof of consistency (which is a prerequisite for proving asymptotic normality) can be difficult owing to nonuniform convergence of the objective function over a large admissible parameter space. In particular, this is the case for the conditional sum of squares estimate, which can be expected to be asymptotically efficient under Gaussianity. Without the latter assumption, we establish consistency and asymptotic normality for this estimate in case of a quite general univariate model. For a multivariate model, we establish asymptotic normality of a one-step estimate based on an initial √n-consistent estimate.
Ejection of Supermassive Black Holes from Galaxy Cores

Recent numerical relativity simulations have shown that the emission of gravitational waves during the merger of two supermassive black holes (SMBHs) delivers a kick to the final hole, with a magnitude as large as 4000 km s−1. We study the motion of SMBHs ejected from galaxy cores by such kicks and the effects on the stellar distribution using high-accuracy direct N-body simulations. Following the kick, the motion of the SMBH exhibits three distinct phases. (1) The SMBH oscillates with decreasing amplitude, losing energy via dynamical friction at each core passage. Chandrasekhar's theory accurately reproduces the motion of the SMBH if 2≲ ln Λ ≲ 3 and if the changing core density is taken into account. (2) When the amplitude of the motion has fallen to roughly the core radius, the SMBH and core begin to exhibit oscillations about their common center of mass. These oscillations decay with a time constant that is at least 10 times longer than predicted by Chandrasekhar's formula. (3) Eventually, the SMBH reaches thermal equilibrium with the stars. The time for the SMBH's oscillations to damp to the Brownian level is as long as ~1 Gyr in the brightest galaxies. The longevity of the oscillations makes this mechanism competitive with others proposed to explain double or offset nuclei. Ejection of SMBHs also results in a lowered density of stars near the galaxy center; mass deficits as large as five times the SMBH mass can be produced. We compare the N-body density profiles with luminosity profiles of early-type galaxies in Virgo and show that even the largest observed cores can be reproduced by the kicks. Implications for displaced AGNs and helical radio structures are discussed.
Reliability and Performance Trade-off Study of Heterogeneous Memories

Heterogeneous memories, organized as die-stacked in-package and off-package memory, have been a focus of attention by the computer architects to improve memory bandwidth and capacity. Researchers have explored methods and organizations to optimize performance by increasing the access rate to faster die-stacked memory. Unfortunately, reliability of such arrangements has not been studied carefully thus making them less attractive for data centers and mission-critical systems. Field studies show memory reliability depends on device physics as well as on error correction codes (ECC). Due to the capacity, latency, and energy costs of ECC, the performance-critical in-package memories may favor weaker ECC solutions than off-chip. Moreover, these systems are optimized to run at peak performance by increasing access rate to high-performance in-package memory. In this paper, authors use the real-world DRAM failure data to conduct a trade-off study on reliability and performance of Heterogeneous Memory Architectures (HMA). This paper illustrates the problem that an HMA system which only optimizes for performance may suffer from impaired reliability over time. This work also proposes an age-aware access rate control algorithm to ensure reliable operation of long-running systems.
Statistical Power to Detect Genetic (Co)Variance of Complex Traits Using SNP Data in Unrelated Samples

We have recently developed analysis methods (GREML) to estimate the genetic variance of a complex trait/disease and the genetic correlation between two complex traits/diseases using genome-wide single nucleotide polymorphism (SNP) data in unrelated individuals. Here we use analytical derivations and simulations to quantify the sampling variance of the estimate of the proportion of phenotypic variance captured by all SNPs for quantitative traits and case-control studies. We also derive the approximate sampling variance of the estimate of a genetic correlation in a bivariate analysis, when two complex traits are either measured on the same or different individuals. We show that the sampling variance is inversely proportional to the number of pairwise contrasts in the analysis and to the variance in SNP-derived genetic relationships. For bivariate analysis, the sampling variance of the genetic correlation additionally depends on the harmonic mean of the proportion of variance explained by the SNPs for the two traits and the genetic correlation between the traits, and depends on the phenotypic correlation when the traits are measured on the same individuals. We provide an online tool for calculating the power of detecting genetic (co)variation using genome-wide SNP data. The new theory and online tool will be helpful to plan experimental designs to estimate the missing heritability that has not yet been fully revealed through genome-wide association studies, and to estimate the genetic overlap between complex traits (diseases) in particular when the traits (diseases) are not measured on the same samples.
EDDIE - An Emotion-Display with Dynamic Intuitive Expressions

This paper focuses on the development of EDDIE, a flexible low-cost emotion-display with 23 degrees of freedom. Actuators are assigned to particular action units of the facial action coding system (FACS). Emotion states represented by the circumplex model of affect are mapped to individual action units. Thereby, continuous, dynamic, and realistic emotion state transitions are achieved. EDDIE is largely developed and manufactured in a rapid-prototyping process. Miniature off-the-shelf mechatronics are used providing high functionality while extremely low-cost. Evaluations are conducted based on a user-study
Robust Iris Feature Extraction and Matching

An iris coding method based on zero crossings of Discrete Cosine Transform (DCT) coefficients between rectangular patches from normalized iris images is shown to provide excellent matching performance at low complexity. The method is applied to two sets of normalized iris images; 2156 images of 308 eyes from the CASIA database and 2955 images of 150 eyes from the Bath database. A product-of-sum approach to Hamming distance calculation is taken and 100% Correct Recognition Rate (CRR) achieved for identification. For verification, a variable threshold is applied to the distance metric and the False Acceptance and False Rejection Rates (FAR, FRR) recorded. The method achieves perfect Receiver Operating Characteristics (ROC), i.e. no false accepts or rejects are registered. A new metric for evaluating practical system performance is proposed and the theoretical equal error rate (EER) estimated from the Hamming Distance distributions is found to be as low as 2.59 times 10-4.
The Possibility of Detecting Planets in the Andromeda Galaxy

The Angstrom project is using a global network of 2 m class telescopes to conduct a high-cadence pixel microlensing survey of the bulge of the Andromeda galaxy (M31), with the primary aim of constraining its underlying bulge mass distribution and stellar mass function. Here we investigate the feasibility of using such a survey to detect planets in M31. We estimate the efficiency of detecting signals produced by planets with various masses and separations from the host star. We find that for a ~5MJ planet that is located within the lensing zone (~1-3 AU), detection is possible above 3 σ with detection efficiency ~6%. This corresponds to the yearly detection rate of ~3fLZ planets, where fLZ is the probability that a planet exists in the lensing zone. It is expected that most events with detectable planets are associated with giant source stars, and thus source size will have a significant effect on the planet detection efficiency. We also find that the planetary perturbations will be in nearly all cases caused by central caustics, and thus observational strategies focusing on these central perturbations would maximize planet detections. A dramatic improvement in the efficiency of ~30%-50% is expected if follow-up observations on an 8 m telescope are made possible by a real-time alert system.
A Genetic Algorithm for Identifying Overlapping Communities in Social Networks Using an Optimized Search Space

There are currently many approaches to identify the community structure of a network, but relatively few specific to detect overlapping community structures. Likewise, there are few networks with ground truth overlapping nodes. For this reason,we introduce a new network, Pilgrim, with known overlapping nodes, and a new genetic algorithm for detecting such nodes. Pilgrim is comprised of a variety of structures including two communities with dense overlap,which is common in real social structures. This study initially explores the potential of the community detection algorithm LabelRank for consistent overlap detection; however, the deterministic nature of this algorithm restricts it to very few candidate solutions. Therefore, we propose a genetic algorithm using a restricted edge-based clustering technique to detect overlapping communities by maximizing an efficient overlapping modularity function. The proposed restriction to the edge-based representation precludes the possibility of disjoint communities, thereby, dramatically reducing the search space and decreasing the number of generations required to produce an optimal solution. A tunable parameterr allows the strictness of the definition of overlap to be adjusted allowing for refinement in the number of identified overlapping nodes. Our method, tested on several real social networks, yields results comparable to the most effective overlapping community detection algorithms to date.
A review of misbehaviour detection and avoidance scheme in ad hoc network

Misbehaving of nodes in ad hoc network is a more sophisticated problem in recent research area. Therefore, detecting misbehavior has been an arduous task for researchers since last few years. Misbehavior node can be selfish or malicious which degrade or disrupt the performance of network upto a great extent. For this, different types of mechanism have already been proposed. In this paper, different mechanisms for detection and prevention of misbehavior node are discussed in detail. This paper contributes in understanding of most appropriate defense mechanisms by providing a comprehensive comparison between them, based on the type of misbehavior they solve. These mechanisms can be integrated into existing or future work to make them resilient to misbehaving nodes. Also, a check list provides a guideline to identify the pros and cons of respected approaches, so that appropriate parameters can be adjusted to enhance network performance.
Treating Female Sex Offenders and Standards for Education and Training in Marriage & Family Therapy Programs By

pages 2 4 TABLE OF CONTENTS pages 5 6 CHAPTER ONE Introduction page 7 General Area of Concern page 7 8 Purpose of the Study pages 8 9 The Need for Study pages 9 12 Statement of the Problem pages 12 13 CHAPTER TWO Literature Review pages 14 Prevalence pages 14 17
IJARAS Design and Simulation A Low-Power SA ADC

In this paper, an 8 bit 100 kS/s successive approximation analog to digital converter is designed and simulated in TSMC 0.18 μm CMOS technology. System level simulations are done using MATLAB and design parameters are extracted. Static and dynamic performances of this analog to digital converter are analyzed total power consumption of analog to digital converter is 137 μW in 100 kS/s sampling frequency.
Clinical implications of the molecular genetics of chronic lymphocytic leukemia

Genetics and molecular genetics have contributed to clarify the biological bases of the clinical heterogeneity of chronic lymphocytic leukemia. In recent years, our knowledge of the molecular genetics of chronic lymphocytic leukemia has significantly broadened, offering potential new clinical implications. Mutations of TP53 and ATM add prognostic information independently of fluorescence in situ hybridization cytogenetic stratification. In addition, next generation sequencing technologies have allowed previously unknown genomic alterations in chronic lymphocytic leukemia to be identified. Mutations of NOTCH1, SF3B1 and BIRC3 have been associated with short time to progression and survival. Each of these lesions recognizes a different distribution across different clinical phases and biological subgroups of the disease. The clinical implications of these molecular lesions are in some instances well established, such as in the case of patients with TP53 disruption, who should be considered for alternative therapies/allogeneic stem cell transplant upfront, or in patients with ATM disruption, who are candidates to rituximab-based immunochemotherapy. On the contrary, NOTCH1, SF3B1 and BIRC3 mutations appear to have a specific significance, the clinical value of which is currently being validated, i.e. association to Richter syndrome transformation for NOTCH1 mutations, and short progression-free survival after treatment for SF3B1 mutations. Certainly, these new lesions have helped clarify the molecular bases of chronic lymphocytic leukemia aggressiveness beside TP53 disruption. This review covers the recent advancements in our understanding of the molecular genetics of chronic lymphocytic leukemia and discusses how they are going to translate into clinical implications for patient management.
Combining Data Warehousing and Data Mining Techniques for Web Log Analysis

Enormous amounts of information about Web site user behavior are collected in Web server logs. However, this information is only useful if it can be queried and analyzed to provide high-level knowledge about user navigation patterns, a task that requires powerful techniques.This chapter presents a number of approaches that combine data warehousing and data mining techniques in order to analyze Web logs. After introducing the well-known click and session data warehouse (DW) schemas, the chapter presents the subsession schema, which allows fast queries on sequences of page visits. Then, the chapter presents the so-called " hybrid " technique, which combines DW Web log schemas with a data mining technique called Hypertext Probabilistic Grammars, hereby providing fast and flexible constraint-based Web log analysis. Finally, the chapter presents a " post-check enhanced " improvement of the hybrid technique.
A Multi-Path Routing Protocol for Target Tracking in WMSNs

Wireless multimedia sensor networks (WMSNs) are expected to find wide applicability in target tracking in the near future. This paper proposes a dynamic capacity multi-path routing protocol (DCM), based on improved Ford-Fulkerson algorithm, to solve the problem of data transmission from anchor nodes to base station (BS). By adjusting the parameter of flow capacity in max-flow model, a multi-path routing map which makes the data stream spread extensively is founded. Compared with different static capacity values, the simulation results have verified that DCM is more energy efficient, and strikes a balance between reducing the node power consumption and increasing the lifetime of WMSNs.
Generalization of signatures for SSH encrypted traffic identification

The objective of this work is to discover generalized signatures for identifying encrypted traffic where SSH is taken as an example application. What we mean by generalized signatures is that the signatures learned by training on one network are still valid when they are applied to traffic coming from a totally different network. We identified 13 signatures and 14 flow attributes for SSH traffic classification where IP addresses, source/destination ports and payload information are not employed. The signatures are able to identify encrypted traffic with high detection rate and low false positive rate. We can achieve up to 97% DR and 0.8% FPR for identifying SSH traffic.
On “Solutions” to the Ecological Inference Problem

In his 1997 book, King announced “A Solution to the Ecological Inference Problem”. This review discusses King’s method, and tests it on data where truth is known. In the test data, his method produces results that are far from truth, and diagnostics are unreliable. Ecological regression makes estimates that are similar to King’s, while the neighborhood model is more accurate. His announcement is premature.