Miracle-dz/UniFAR-FTUs huggingface dataset:
Selectively Enhanced UV-A Photoresponsivity of a GaN MSM UV Photodetector with a Step-Graded AlxGa1−xN Buffer Layer

The UV-to-visible rejection ratio is one of the important figure of merits of GaN-based UV photodetectors. For cost-effectiveness and large-scale fabrication of GaN devices, we tried to grow a GaN epitaxial layer on silicon substrate with complicated buffer layers for a stress-release. It is known that the structure of the buffer layers affects the performance of devices fabricated on the GaN epitaxial layers. In this study, we show that the design of a buffer layer structure can make effect on the UV-to-visible rejection ratio of GaN UV photodetectors. The GaN photodetector fabricated on GaN-on-silicon substrate with a step-graded AlxGa−xN buffer layer has a highly-selective photoresponse at 365-nm wavelength. The UV-to-visible rejection ratio of the GaN UV photodetector with the step-graded AlxGa1−xN buffer layer was an order-of-magnitude higher than that of a photodetector with a conventional GaN/AlN multi buffer layer. The maximum photoresponsivity was as high as 5 × 10−2 A/W. This result implies that the design of buffer layer is important for photoresponse characteristics of GaN UV photodetectors as well as the crystal quality of the GaN epitaxial layers.
Online diagnosis of labeled timed Petri net using reduction rules

We propose some redection rules to simplify the labeled timed Petri net model. Our purpose is to construct a labeled delay timed Petri net(LDTPN) that allows us to preserve the temporal constraints of the original model. We introduced also an algorithm for computing a Reduced Modified State Class, which is used to obtained the Cover Tree State Class that we used for online diagnosis. the solution for online diagnosis proposed in this paper permit us to restrain the explosion of stats.
THE INFLUENCE OF CIRCUIT RE-SYNTHESIZING ON THE FAULT COVERAGE

The design complexity of systems on a chip drives the need to reuse legacy or intellectual property cores, whose gate-level implementation details are unavailable. The core test depends on manufacturing technologies and changes permanently during a design lifecycle. In this paper we consider the impact of circuit realization on the fault coverage of the test set. We have performed various comprehensive experiments with combinational benchmark circuits. Our experiments show that the test sets generated for a particular circuit realization fail to detect in average only less than one and a half percent of the stuck-at faults of the re-synthesized circuit but in some cases this figure is more than nine percent. The double test sets declined almost twice both the maximum and the average percent of undetected faults. The experiments exhibit that the supplement of the test set with sensitive adjacent test patterns significantly increases the fault coverage of the re-synthesized core.
Rapid loss of genetic variation in an endangered possum

The endangered mountain pygmy possum is the only Australian marsupial that hibernates under snow cover. Most of its alpine habitat was burnt by a rare fire in 2003, and habitat loss and disturbance have also occurred owing to ski resort development. Here we show that there has been a rapid loss of genetic variation following habitat loss associated with resort development, but no detectable loss of alleles or decrease in heterozygosity following the fire.
A Design Space Exploration Framework For Automotive Embedded Systems And Their Power Management

The E/E (electric/electronic) architecture of a modern vehicle is a complex distributed system, where up to 80 electronic control units (ECUs), interconnected by several communication buses, need to collaborate with each other in order to implement the various comfort and safety features. The presented E/E design space exploration framework supports engineers during the development process of new E/E architectures by providing a graphical modeling and simulation environment with an interactive visualization of simulation-based results. Furthermore, it contains an advanced business logic which administrates the modeling, storing, retrieving and cloning of evaluation sessions consisting of complex experiments. Due to a high-level modeling approach, future architectures can be evaluated in respect to power consumption and performance values already in an early stage of the design process and design alternatives can be easily compared with each other.
Forest dependence and community well‐being: A segmented market approach

Forestry activities, such as timber production and processing, are important economic activities in many rural communities. Yet the research on the relationship between forest dependence and community economic well‐being is inconclusive. This article examines the relationship between forest dependence and county per capita income and poverty in rural Georgia. Forest dependence is conceptualized according to Averitt's theory of the dual economy. Core dependence, in other words, dependence on well‐capitalized, pulp and paper firms, is expected to affect county‐level economic well‐being differently than dependence on periphery forest industry or high timberland concentrations. Regression analyses show that core forest industries are positively related to county per capita income, while periphery industries have no significant effect and timberland concentration is negatively related to per capita income and positively related to the poverty rate.
An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach

A new form of Genetic Programming (GP) called Cartesian Genetic Programming (CGP) is proposed in which programs are represented by linear integer chromosomes in the form of connections and functionalities of a rectangular array of primitive functions. The effectiveness of this approach is investigated for boolean even-parity functions (3,4,5), and the 2-bit multiplier. The minimum number of evaluations required to give a 0.99 probability of evolving a target function is used to measure the efficiency of the new approach. It is found that extremely low populations are most effective. A simple probabilistic hillclimber (PH) is devised which proves to be even more effective. For these boolean functions either method appears to be much more efficient than the GP and Evolutionary Programming (EP) methods reported. The efficacy of the PH suggests that boolean function learning may not be an appropriate problem for testing the effectiveness of GP and EP.
Antenna selection for MIMO-NOMA networks

This paper considers the joint antenna selection (AS) problem for a classical two-user non-orthogonal multiple access (NOMA) network where both the base station and users are equipped with multiple antennas. Since the exhaustive-search-based optimal AS scheme is computationally prohibitive when the number of antennas is large, two computationally efficient joint AS algorithms, namely max-min-max AS (AIA-AS) and max-max-max AS (A3-AS), are proposed to maximize the system sum-rate. The asymptotic closed-form expressions for the average sum-rates for both AIA-AS and A3-AS are derived in the high signal-to-noise ratio (SNR) regime, respectively. Numerical results demonstrate that both AIA-AS and A3-AS can yield significant performance gains over comparable schemes. Furthermore, AIA-AS can provide better user fairness, while the A3-AS scheme can achieve the near-optimal sum-rate performance.
Comparison of volumetric registration algorithms for tensor-based morphometry

Nonlinear registration of brain MRI scans is often used to quantify morphological differences associated with disease or genetic factors. Recently, surface-guided fully 3D volumetric registrations have been developed that combine intensity-guided volume registrations with cortical surface constraints. In this paper, we compare one such algorithm to two popular high-dimensional volumetric registration methods: large-deformation viscous fluid registration, formulated in a Riemannian framework, and the diffeomorphic “Demons” algorithm. We performed an objective morphometric comparison, by using a large MRI dataset from 340 young adult twin subjects to examine 3D patterns of correlations in anatomical volumes. Surface-constrained volume registration gave greater effect sizes for detecting morphometric associations near the cortex, while the other two approaches gave greater effects sizes subcortically. These findings suggest novel ways to combine the advantages of multiple methods in the future.
Augmenting a Small Parallel Text with Morpho-Syntactic Language

In this work, we examine the quality of several statistical machine translation systems constructed on a small amount of parallel Serbian-English text. The main bilingual parallel corpus consists of about 3k sentences and 20k running words from an unrestricted domain. The translation systems are built on the full corpus as well as on a reduced corpus containing only 200 parallel sentences. A small set of about 350 short phrases from the web is used as additional bilingual knowledge. In addition, we investigate the use of monolingual morpho-syntactic knowledge i.e. base forms and POS tags.
Coverage control for mobile sensing networks

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks, where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.
Overcomplete tensor decomposition via convex optimization

This work develops theories and computational methods for overcomplete, non-orthogonal tensor decomposition using convex optimization. Under an incoherence condition of the rank-one factors, we show that one can retrieve tensor decomposition by solving a convex, infinite-dimensional analog of ℓ1 minimization on the space of measures. The optimal value of this optimization defines the tensor nuclear norm. Two computational schemes are proposed to solve the infinite-dimensional optimization: semidefinite programs based on sum-of-squares relaxations and nonlinear programs that are an exact reformulation of the tensor nuclear norm. The latter exhibits superior performance compared with the state-of-the-art tensor decomposition methods.
Learning-Induced Gene Expression in the Hippocampus Reveals a Role of Neuron -Astrocyte Metabolic Coupling in Long Term Memory

We examined the expression of genes related to brain energy metabolism and particularly those encoding glia (astrocyte)-specific functions in the dorsal hippocampus subsequent to learning. Context-dependent avoidance behavior was tested in mice using the step-through Inhibitory Avoidance (IA) paradigm. Animals were sacrificed 3, 9, 24, or 72 hours after training or 3 hours after retention testing. The quantitative determination of mRNA levels revealed learning-induced changes in the expression of genes thought to be involved in astrocyte-neuron metabolic coupling in a time dependent manner. Twenty four hours following IA training, an enhanced gene expression was seen, particularly for genes encoding monocarboxylate transporters 1 and 4 (MCT1, MCT4), alpha2 subunit of the Na/K-ATPase and glucose transporter type 1. To assess the functional role for one of these genes in learning, we studied MCT1 deficient mice and found that they exhibit impaired memory in the inhibitory avoidance task. Together, these observations indicate that neuron-glia metabolic coupling undergoes metabolic adaptations following learning as indicated by the change in expression of key metabolic genes.
A Minimal Solution for Two-View Focal-Length Estimation Using Two Affine Correspondences

A minimal solution using two affine correspondences is presented to estimate the common focal length and the fundamental matrix between two semi-calibrated cameras &#x2013; known intrinsic parameters except a common focal length. To the best of our knowledge, this problem is unsolved. The proposed approach extends point correspondence-based techniques with linear constraints derived from local affine transformations. The obtained multivariate polynomial system is efficiently solved by the hidden-variable technique. Observing the geometry of local affinities, we introduce novel conditions eliminating invalid roots. To select the best one out of the remaining candidates, a root selection technique is proposed outperforming the recent ones especially in case of high-level noise. The proposed 2-point algorithm is validated on both synthetic data and 104 publicly available real image pairs. A Matlab implementation of the proposed solution is included in the paper.
Parameter–uniform Fitted Mesh Method for Quasilinear Differential Equations with Boundary Layers

Abstract Singularly perturbed quasilinear boundary value problems exhibiting boundary layers are considered. Special piecewise-uniform meshes are constructed which are fitted to these boundary layers. Numerical methods composed of upwind difference operators and these fitted meshes are shown to be parameter robust, in the sense that the solutions satisfy an error estimate in the maximum norm which is independent of the value of the singular perturbation parameter. Numerical results supporting the theory are presented.
Detecting object usage anomalies

Interacting with objects often requires following a protocol---for instance, a specific sequence of method calls. These protocols are not always documented, and violations can lead to subtle problems. Our approach takes code examples to automatically infer legal sequences of method calls. The resulting patterns can then be used to detect anomalies such as "Before calling next, one normally calls hasNext". To our knowledge, this is the first fully automatic defect detection approach that learns and checks methodcall sequences. Our JADET prototype has detected yet undiscovered defects and code smells in five popular open-source programs, including two new defects in AspectJ.
Comparison of haloperidol and midazolam in restless management of patients referred to the Emergency Department: A double-blinded, randomized clinical trial

Background: Restless and violent behaviors are common in Emergency Departments (EDs), which need therapeutic interventions in most of the times. The first-generation anti-psychotic drugs are one of the most applicable therapeutic agents in the management of such patients, but their use has some limitations. Some studies suggest midazolam as an alternative medicine. Therefore, this study was performed with the aim of comparison of the efficacy and safety of haloperidol and midazolam in the restless management of referring patients to EDs. Materials and Methods: The present double-blinded trial was done on patients needed sedation and referred to the ED of Alzahra Hospital, Isfahan, Iran, in 2014. The patients were categorized into two random groups of haloperidol (5 mg) and midazolam receivers (2.5 mg for those weighing <50 kg and 5 mg in >50 kg), as intramuscular administration. The time to achieve sedation, need for rescue dose, need to resedation within the first 60 min, and adverse effects of drugs were compared among the groups. Results: Forty-eight patients were entered to the study. The mean age in the haloperidol and midazolam groups was 44.8 ± 4.1 years and 45.5 ± 4.7 years, respectively (P = 0.91). The mean time of sedation in the haloperidol and midazolam groups was 5.6 ± 0.3 min and 5.2 ± 0.1 min, respectively (P = 0.31). The mean time of full consciousness after sedation was 36.2 ± 4.5 min and 38.2 ± 3.4 min in the haloperidol and midazolam groups, respectively (P = 0.72). On average, time to arousal in the midazolam group was 10.33 min more than the haloperidol group, but it was not statistically significant. Conclusion: The results of the present study show that administration of midazolam and haloperidol have similar efficacy in the treatment of restless symptoms with the same recovery time from drug effects for referring patients to the ED. In addition, none of the adverse effects were observed in this study.
Adaptive Bloom filters for multicast addressing

In-packet Bloom filters are recently proposed as a possible building block of future Internet architectures replacing IP or MPLS addressing that solves efficient multicast routing, security and other functions in a stateless manner. In such frameworks a bloom filter is placed in the header which stores the addresses of the destination nodes or the traversed links. In contrast to the standard Bloom filter, the length of the in-packet Bloom filter must be highly adaptive to the number of stored elements to achieve low communication overhead. In this paper we propose a novel type of Bloom filter called Adaptive Bloom filter, which can adapt its length to the number of elements to be represented with a very fine granularity. The novel filter can significantly reduce the header size for in-packet bloom filter architecture, by eliminating the wasting effect experienced in existing “block-based” approaches which rely on concatenating several standard Bloom filters. Nevertheless, it requires slightly more calculations when adding and removing elements.
Metastatic breast carcinoma mimicking basal skull meningioma

Two women with breast carcinoma developed clinical evidence of a sphenocavernous syndrome with magnetic resonance (MRI) that suggested a basal skull meningioma but in whom biopsy of the lesion revealed metastatic breast carcinoma. The difficulties in distinguishing between the two lesions on the basis of standard MRI are discussed, as are newer imaging techniques that may reduce or eliminate these problems.
CHOISS for selection of single nucleotide polymorphism markers on interval regularity

We developed algorithms that find a set of single nucleotide polymorphism (SNP) markers based on interval regularity, given either the number of SNPs to choose (m) or the desired interval (I), subject to minimum variance or minimum sum of squared deviations from I. In both cases, the number of all possible sets increases exponentially with respect to the number of input SNPs (n), but our algorithms find the minima only with O(n(2)) calculations and comparisons by elimination of redundancy.
On the Use of Specification-Based Assertions as Test Oracles

The "oracle problem' is a well-known challenge for software testing. Without some means of automatically computing the correct answer for test cases, testers must instead compute the results by hand, or use a previous version of the software. In this paper, we investigate the feasibility of revealing software faults by augmenting the code with complete, specification-based assertions. Our evaluation method is to (1) develop a formal specification, (2) translate this specification into assertions, (3) inject or identify existing faults, and (4) for each version of the assertion-enhanced system containing a fault, execute it using a set of test inputs and check for assertion violations. Our goal is to determine whether specification-based assertions are a viable method of revealing faults, and to begin to assess the extent to which their cost-effectiveness can be improved. Our evaluation is based on two case studies involving real-world software systems. Our results indicate that specification-based assertions can effectively reveal faults, as long as they adversely affect the program state. We describe techniques that we used for translating high-level specifications into code-level assertions. We also discuss the costs associated with the approach, and potential techniques for reducing these costs
RRAM Defect Modeling and Failure Analysis Based on March Test and a Novel Squeeze-Search Scheme

The Resistive Random Access Memory (RRAM) is a new type of non-volatile memory based on the resistive memory device. Researchers are currently moving from resistive device development to memory circuit design and implementation, hoping to fabricate memory chips that can be deployed in the market in the near future. However, so far the low manufacturing yield is still a major issue. In this paper, we propose defect and fault models specific to RRAM, i.e., the Over-Forming (OF) defect and the Read-One-Disturb (R1D) fault. We then propose a March algorithm to cover these defects and faults in addition to the conventional RAM faults, which is called March C*. We also develop a novel squeeze-search scheme to identify the OF defect, which leads to the Stuck-At Fault (SAF). The proposed test algorithm is applied to a first-cut 4-Mb HfO2-based RRAM test chip. Results show that OF defects and R1D faults do exist in the RRAM chip. We also identify specific failure patterns from the test results, which are shown to be induced by multiple short defects between bit-lines. By identifying the defects and faults, designers and process engineers can improve the RRAM yield in a more cost-effective way.
P. vivax Malaria and Dengue Fever Co-infection: A Cross-Sectional Study in the Brazilian Amazon

Background Malaria and dengue are the most prevalent vector-borne diseases worldwide and represent major public health problems. Both are endemic in tropical regions, propitiating co-infection. Only few co-infection cases have been reported around the world, with insufficient data so far to enhance the understanding of the effects of co-infection in the clinical presentation and severity. Methodology/Principal Findings A cross-sectional study was conducted (2009 to 2011) in hospitalized patients with acute febrile syndrome in the Brazilian Amazon. All patients were submitted to thick blood smear and PCR for Plasmodium sp. detection, ELISA, PCR and NS1 tests for dengue, viral hepatitis, HIV and leptospirosis. In total, 1,578 patients were recruited. Among them, 176 (11.1%) presented P. vivax malaria mono-infection, 584 (37%) dengue fever mono-infection, and 44 (2.8%) were co-infected. Co-infected patients had a higher chance of presenting severe disease (vs. dengue mono-infected), deep bleeding (vs. P. vivax mono-infected), hepatomegaly, and jaundice (vs. dengue mono-infected). Conclusions/Significance In endemic areas for dengue and malaria, jaundice (in dengue patients) and spontaneous bleeding (in malaria patients) should raise the suspicion of co-infection. Besides, whenever co-infection is confirmed, we recommend careful monitoring for bleeding and hepatic complications, which may result in a higher chance of severity, despite of the fact that no increased fatality rate was seen in this group.
Iris from the ground up: A modular foundation for higher-order concurrent separation logic

Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide variety of verification projects. Iris was designed with the express goal of simplifying and consolidating the foundations of modern separation logics, but it has evolved over time, and the design and semantic foundations of Iris itself have yet to be fully written down and explained together properly in one place. Here, we attempt to fill this gap, presenting a reasonably complete picture of the latest version of Iris (version 3.1), from first principles and in one coherent narrative.