Miracle-dz/UniFAR-FTUs huggingface dataset:
Hot Anchors: A Heuristic Anchors Sampling Method in RCNN-Based Object Detection

In the image object detection task, a huge number of candidate boxes are generated to match with a relatively very small amount of ground-truth boxes, and through this method the learning samples can be created. But in fact the vast majority of the candidate boxes do not contain valid object instances and should be recognized and rejected during the training and evaluation of the network. This leads to extra high computation burden and a serious imbalance problem between object and none-object samples, thereby impeding the algorithm’s performance. Here we propose a new heuristic sampling method to generate candidate boxes for two-stage detection algorithms. It is generally applicable to the current two-stage detection algorithms to improve their detection performance. Experiments on COCO dataset showed that, relative to the baseline model, this new method could significantly increase the detection accuracy and efficiency.
Revision of the genus Eumorphobotys with descriptions of two new species (Lepidoptera, Crambidae, Pyraustinae).

The genus Eumorphobotys Munroe Mutuura (1969) comprises two species that have been found in southern China. Two new species, E. concavuncus sp. n. and E. horakae sp. n. , are described from southwest China. In appearance, this genus also resembles Calamochrous Lederer, 1863, Sclerocona Meyrick, 1890, Prodasycnemis Warren, 1892, and Loxoneptera Hampson, 1896. In order to evaluate the generic placement of the new taxa, the phylogeny of Eumorphobotys species and several species representing the potential related genera based on sequence data of COI, 16S rRNA, EF-1α and 28S rRNA gene regions were reconstructed and the taxonomy of these genera based on morphological characters was re-assessed. The results are as follows: (i) the monophyly of Eumorphobotys is well supported; (ii) Loxoneptera is paraphyletic. Two species of Calamochrous were recovered as terminal lineages within Loxoneptera; (iii) the clade comprising species of Loxoneptera and Calamochrous is in the sister position to Eumorphobotys with a robust support; (iv) species of Loxoneptera and Calamochrous resemble Eumorphobotys in the wing shape and the porrect labial palpus but differ in genitalia structures. The relationships of these genera are discussed; (v) two new species, E. concavuncus sp. n. and E. horakae sp. n. , are described, Calamochrous obscuralis (Caradja, 1925) syn. n. is synonymized with E. eumorphalis (Caradja, 1925) based on the male genitalia and the adults and genitalia of all species (except the female of E. horakae sp. n.) are illustrated.
A School-Based Educational Intervention for School-Aged Children and Caregivers about Rational Use of Antibiotics in Urban Areas of Shaanxi Province: A Study Protocol for a Randomized Controlled Research

(1) Background: Antibiotic resistance is an imperative public health issue globally. Major factors that are resulting in this trend are the irrational and excessive use of antibiotics. Children account for a greater population of antibiotics use, therefore, an educational intervention on the rational use of antibiotics for children and caregivers will be beneficial. (2) Methods: A randomized controlled and parallel group study of fifth grade children and their caregivers will be evaluated in four primary schools in Baoji and Weinan of the Shaanxi Province. Two primary schools will be randomly selected for the educational intervention and two schools will serve as a control group. In the intervention arm, educational interventions will be conducted among caregivers and their children. The intervention measures include interactive training sessions, booklets, and printed or electronic educational materials that will be given to the caregivers or the school-aged children. In the control arm, no interventions will be implemented. Baseline data collected from June, 2018 and the intervention will last for three months. Knowledge-Attitude-Practice (KAP) questionnaires will be used to evaluate the caregivers’ knowledge, their attitude, and their practice. Knowledge-Retention questionnaires will be used to assess the children’s knowledge about microbes, antibiotics, and hygiene. (3) Discussion: This study is a unique comprehensive intervention targeting both children and their caregivers. We hypothesize a decrease in the irrational use of antibiotics among the studied population. Hence, this result would provide evidence for policy makers and educational departments for the implementation of similar interventions on the rational use of antibiotics.
Transynaptic Action of Botulinum Neurotoxin Type A at Central Cholinergic Boutons

Botulinum neurotoxin Type A (BoNT/A) is an effective treatment for several movement disorders, including spasticity and dystonia. BoNT/A acts by cleaving synaptosomal-associated protein of 25 kDa (SNAP-25) at the neuromuscular junction, thus blocking synaptic transmission and weakening overactive muscles. However, not all the therapeutic benefits of the neurotoxin are explained by peripheral neuroparalysis, suggesting an action of BoNT/A on central circuits. Currently, the specific targets of BoNT/A central activity remain unclear. Here, we show that catalytically active BoNT/A is transported to the facial nucleus (FN) after injection into the nasolabial musculature of rats and mice. BoNT/A-mediated cleavage of SNAP-25 in the FN is prevented by intracerebroventricular delivery of antitoxin antibodies, demonstrating that BoNT/A physically leaves the motoneurons to enter second-order neurons. Analysis of intoxicated terminals within the FN shows that BoNT/A is transcytosed preferentially into cholinergic synapses. The cholinergic boutons containing cleaved SNAP-25 are associated with a larger size, suggesting impaired neuroexocytosis. Together, the present findings indicate a previously unrecognized source of reduced motoneuron drive after BoNT/A via blockade of central, excitatory cholinergic inputs. These data highlight the ability of BoNT/A to selectively target and modulate specific central circuits, with consequent impact on its therapeutic effectiveness in movement disorders. SIGNIFICANCE STATEMENT Botulinum neurotoxins are among the most potent toxins known. Despite this, their specific and reversible action prompted their use in clinical practice to treat several neuromuscular pathologies (dystonia, spasticity, muscle spasms) characterized by hyperexcitability of peripheral nerve terminals or even in nonpathological applications (i.e., cosmetic use). Substantial experimental and clinical evidence indicates that not all botulinum neurotoxin Type A (BoNT/A) effects can be explained solely by the local action (i.e., silencing of the neuromuscular junction). In particular, there are cases in which the clinical benefit exceeds the duration of peripheral neurotransmission blockade. In this study, we demonstrate that BoNT/A is transported to facial motoneurons, released, and internalized preferentially into cholinergic terminals impinging onto the motoneurons. Our data demonstrate a direct central action of BoNT/A.
On the Security of a Certificateless Strong Designated Verifier Signature Scheme

Recently, Chen et al. proposed the first non-delegatable certificateless strong designated verifier signature scheme and claimed that their scheme achieves all security requirements. However, in this paper, we disprove their claim and present a concrete attack which shows that their proposed scheme is forgeable. More precisely, we show that there exist adversaries who are able to forge any signer's signature for any designated verifier on any message of his choice.
A model parameter estimation method using Mathematica© applied to transient chemical engineering processes

In the present paper, we apply a new approach, based on mainly two built‐in functions of the computer algebra Mathematica©, in order to estimate the parameters of several models that describe various transient (i.e., time‐dependent) chemical engineering processes. These models usually consist of either a set of ordinary differential equations (ODEs) or partial differential equations (PDEs). Basing on experimental data, it is possible to obtain, both readily and accurately, estimates of the values of the parameters involved in such models by adopting the proposed methodology. We illustrate the approach with three case studies, all related to chemical reactors. Actual experimental data, collected by senior students at King Fahd University of Petroleum & Minerals during their core laboratory course (i.e., Chemical Engineering Lab II or CHE 409) are used in the first two case studies: (1) response to a tracer input of three continuous stirred‐tank reactors in series and (2) saponification reaction of ethyl acetate in a batch reactor. In the first case study, the residence time distribution and the mean residence time in each reactor are deduced from the set of gathered data. Reaction order and rate constant are estimated from the experimental findings in the second case study. A more advanced situation, involving the solution of the advection–diffusion equation applied to a tubular micro‐reactor, is considered in the third case study. Data were collected, as part of a Ph.D. research of S. Mejri, using an experimental set‐up at Energy Intensified Reactor Engineering Lab at the University of Warwick, U.K. Here, we obtained an estimate of the relevant dimensionless number namely, the Péclet number.
Proving the correct execution of concurrent services in zero-knowledge

This paper introduces Spice, a system for building verifiable state machines (VSMs). A VSM is a request-processing service that produces proofs establishing that requests were executed correctly according to a specification. Such proofs are succinct (a verifier can check them efficiently without reexecution) and zero-knowledge (a verifier learns nothing about the content of the requests, responses, or the internal state of the service). Recent systems for proving the correct execution of stateful computations--Pantry [25], Geppetto [34], CTV [30], vSQL [83], etc.--implicitly implement VSMs, but they incur prohibitive costs. Spice reduces these costs significantly with a new storage primitive. More notably, Spice's storage primitive supports multiple writers, making Spice the first system that can succinctly prove the correct execution of concurrent services. We find that Spice running on a cluster of 16 servers achieves 488-1167 transactions/second for a variety of applications including inter-bank transactions [27], cloud-hosted ledgers [28], and dark pools [63]. This represents an 18,000-685,000× higher throughput than prior work.
Differential Cryptanalysis in ARX Ciphers, Applications to LEA

In this paper we focus on differential cryptanalysis dedicated to a particular class of cryptographic algorithms, namely ARX ciphers. We propose a new algorithm inspired by the Nested Monte-Carlo Search algorithm to find a differential path in ARX ciphers. We apply our algorithm to a round reduced variant of the block cipher LEA. We use the concept of a partial difference distribution table (pDDT) in our algorithm to reduce the search space. This methodology reduced the search space of the algorithm by using only those differentials whose probabilities are greater than or equal to pre-defined threshold. Using this concept we removed many differentials which are not valid or whose probabilities are very low. By doing this we decreased the time of finding a differential path by our nested algorithm due to a smaller search space. This partial difference distribution table also made our nested algorithm suitable for bigger block size ARX ciphers. Finding long differential characteristics is one of the hardest problems where we have seen other algorithms take many hours or days to find differential characteristics in ARX ciphers. Our algorithm finds the differential characteristics in just a few minutes with a very simple framework. We report the differential path for up to 9 rounds in LEA. To construct differential characteristics for a large number of rounds, we divide long characteristics into short ones, by constructing a large characteristic from two short characteristics. Instead of starting from the first round, we start from the middle and run experiments in forward as well as in the reverse direction. Using this method we improved our results and report the differential path for up to 12 rounds. Overall, the best property of our algorithm is that it has potential to provide state-of-the-art results but within a simpler framework as well as less time. Our algorithm is also very interesting for future aspect of research, as it could be applied to other ARX ciphers with a very easy going framework.
Effects of a Superabsorbent Resin with Boron on Bacterial Diversity of Peat Substrate and Maize Straw

As a chemical water-saving material, superabsorbent resin is often applied to improve soil physicochemical properties for the purpose of promoting crop growth. In this study, a new type of superabsorbent resin with boron (SARB) was used as a functional material mixed with peat substrate and maize straw in percentages (mass ratio) of 0.05%, 0.1%, 0.15%, and 0.2%, respectively, and high-throughput sequencing technology was used to test bacterial diversity, analyzing and exploring ecological safety of the superabsorbent resin with boron (SARB) in order to provide theoretical support for field applications. The research results show that the superabsorbent resin with boron (SARB) can promote bacterial community diversity in the maize straw. In ten treatments, Proteobacteria accounted for the absolute advantage of the bacterial population in the CT group and in the JG group. However, the superabsorbent resin with boron (SARB) synthesized in the laboratory cannot change the original structure of the bacterial community and has scarcely any toxic effect on the bacterial community in both peat substrate and maize straw, and, indeed, it has a strengthening effect on Proteobacteria and Actinobacteria and a weakening effect on Acidobacteria and Firmicutes to some extent.
<inline-formula><tex-math notation="LaTeX">$\sf {SIMkNN}$</tex-math><alternatives> <inline-graphic xlink:href="cao-ieq1-2808971.gif"/></alternatives></inline-formula>: A Scalable Method for in-Memory <italic>k</italic>NN Search over Moving Objects in Road Networks

Nowadays, many location-based applications require the ability of querying <inline-formula> <tex-math notation="LaTeX">$k$</tex-math><alternatives><inline-graphic xlink:href="cao-ieq2-2808971.gif"/> </alternatives></inline-formula>-nearest neighbors over a very large scale of moving objects in road networks, e.g., taxi-calling and ride-sharing services. Traditional grid index with equal-sized cells can not adapt to the skewed distribution of moving objects in real scenarios. Thus, to obtain the fast querying response time, the grid needs to be split into more smaller cells which introduces the side-effect of higher memory cost, i.e., maintaining such a large volume of cells requires a much larger memory space at the server side. In this paper, we present <inline-formula><tex-math notation="LaTeX">$\sf {SIMkNN}$</tex-math><alternatives> <inline-graphic xlink:href="cao-ieq3-2808971.gif"/></alternatives></inline-formula>, a scalable and in-memory <italic>k </italic>NN query processing technique. <inline-formula><tex-math notation="LaTeX">$\sf {SIMkNN}$</tex-math> <alternatives><inline-graphic xlink:href="cao-ieq4-2808971.gif"/></alternatives></inline-formula> is dual-index driven, where we adopt a R-tree to store the topology of the road network and a <italic>hierarchical grid model</italic> to manage the moving objects in non-uniform distribution. To answer a <italic>k</italic>NN query in real time, <inline-formula><tex-math notation="LaTeX">$\sf {SIMkNN}$</tex-math><alternatives> <inline-graphic xlink:href="cao-ieq5-2808971.gif"/></alternatives></inline-formula> adopts the strategy that incrementally enlarges the search area for network distance based nearest neighbor evaluation. It is far from trivial to perform the space expansion within the hierarchical grid index. For a given cell, we first define its neighbors in different directions, then propose a cell communication technique which allows each cell in the hierarchical grid index to be aware of its neighbors at any time. Accordingly, an efficient space expansion algorithm to generate the estimation area is proposed. The experimental evaluation shows that <inline-formula><tex-math notation="LaTeX">$\sf {SIMkNN}$</tex-math><alternatives><inline-graphic xlink:href="cao-ieq6-2808971.gif"/></alternatives></inline-formula> outperforms the baseline algorithm in terms of time and memory efficiency.
Finding well approximating lattices for a finite set of points

In this paper we address the problem of finding well approximating lattices for a given finite set $A$ of points in ${\mathbb R}^n$. More precisely, we search for $\v{o},\v{d_1}, \dots,\v{d_n}\in \mathbb{R}^n$ such that $\v{a}-\v{o}$ is close to $\Lambda=\v{d_1}\mathbb{Z}+\dots+\v{d_n}\mathbb{Z}$ for every $\v{a}\in A$. First we deal with the one-dimensional case, where we show that in a sense the results are almost the best possible. These results easily extend to the multi-dimensional case where the directions of the axes are given, too. Thereafter we treat the general multi-dimensional case. Our method relies on the LLL algorithm. Finally we apply the least squares algorithm to optimize the results. We give several examples to illustrate our approach.
Analysis of Foveal Microvascular Abnormalities in Diabetic Retinopathy Using Optical Coherence Tomography Angiography with Projection Artifact Removal

Purpose To analyze foveal microvascular abnormalities in different stages of diabetic retinopathy (DR) using optical coherence tomography angiography (OCTA) with projection artifact removal (PAR). Methods We analyzed 93 eyes of 59 patients with diabetes—31 with no DR (no DR), 34 with mild to moderate nonproliferative DR (mild DR), and 28 with severe nonproliferative DR to proliferative DR (severe DR)—and 31 age-matched healthy controls. Sections measuring 3 × 3 mm2 centered on the fovea were obtained using OCTA. The area, perimeter, and acircularity index (AI) of the foveal avascular zone (FAZ), vessel density within a 300 μm wide region of the FAZ (FD-300), and parafoveal vessel density in the superficial capillary plexus (SCP) and deep capillary plexus (DCP) were calculated using novel built-in software with PAR. Results There was no statistically significant difference in the FAZ area (p=0.162). There was a statistically significant difference in the FAZ perimeter (p=0.010) and the AI (p < 0.001) between the four groups. There was a correlation between the AI and the increasing severity of DR (p=0.010). Statistically significant decreases of vessel density in the FD-300, SCP, and DCP were observed (all p < 0.001). There was a difference in parafoveal vessel density in the DCP between the healthy control eyes and the eyes with diabetes without DR (p=0.027). There was a significant correlation between vessel density and increasing severity of DR (p < 0.001). Conclusion Compared with the FAZ area, AI allows a more helpful quantitative assessment of the changes in the FAZ. Vessel density determined using OCTA with PAR might be a useful parameter indicating the progression of DR. Parafoveal vessel density in the DCP after PAR might be a potential early biomarker of DR before appearance of clinically evident retinopathy and needs further investigation.
CRISPR/Cas9 System: A Bacterial Tailor for Genomic Engineering

Microbes use diverse defence strategies that allow them to withstand exposure to a variety of genome invaders such as bacteriophages and plasmids. One such defence strategy is the use of RNA guided endonuclease called CRISPR-associated (Cas) 9 protein. The Cas9 protein, derived from type II CRISPR/Cas system, has been adapted as a versatile tool for genome targeting and engineering due to its simplicity and high efficiency over the earlier tools such as ZFNs and TALENs. With recent advancements, CRISPR/Cas9 technology has emerged as a revolutionary tool for modulating the genome in living cells and inspires innovative translational applications in different fields. In this paper we review the developments and its potential uses in the CRISPR/Cas9 technology as well as recent advancements in genome engineering using CRISPR/Cas9.
Open source application for mobility measurements on violins

A spectrum analyzer, called AnELyzer, was developed in Scilab for teaching and researching about acoustics of the violin. Unlike other free analyzers, AnELyzer has the capability of dual‐channel analysis and it is cross‐platform. AnELyzer can safely substitute a commercial device because results calculated in both cases were almost the same.
LMS‐supported PBL assessment in an undergraduate engineering program—Case study

Technology has clearly infiltrated all aspects of the education process. In traditional teaching settings, there is an abundance of tools that can assist instructors in delivering their courses, as is evident from the number of available learning management systems (LMS) and other tools. However, LMS platforms are not as well developed for non‐traditional teaching techniques in which the students play a bigger role in the learning process. An example of such techniques is the project‐based learning (PBL) model where autonomous group work is at the heart of the course delivery and non‐conventional assessments are utilized. In this study, we explore the potential and highlight some limitations of adapting Moodle (a popular, open source LMS system) to a PBL environment. We show that Moodle has a potential to leverage the learning process when it is utilized as the main communication platform (student‐student and student‐instructor) due to the abundance of accessibility and versatility such a tool provides to the instructor and the students. The use of LMS allowed us to better evaluate the course design, monitor student's performance, and communicate expectations with students. This has resulted in improving the course design, assessment, and students learning as was evidenced from the collected assessment data.
Optimistic Mixing, Revisited

Mixing Networks are protocols that allow a set of senders to send messages anonymously. Such protocols are fundamental building blocks to achieve privacy in a variety of applications, such as anonymous e-mail, anonymous payments, and electronic voting. Back in 2002, Golle et al. proposed a new concept of mixing network, called optimistic mixing, that allows for fast mixing when all the parties execute the protocol honestly. If, on the other hand, one or more mix-servers cheat, then the attack is recognized and one can back up to a different, slow mix-net. Unfortunately, Abe and Imai (ACISP’03) and independently Wikström (SAC’03) showed several major flaws in the optimistic protocol of Golle et al. In this work, we give another look at optimistic mixing networks. Our contribution is mainly threefold. First, we give formal definitions for optimistic mixing in the UC model. Second, we propose a compiler for obtaining a UC-secure mixing network by combining an optimistic mixing with a traditional mixing protocol as backup mixing. Third, we propose an efficient UC-secure realization of optimistic mixing based on the DDH assumption in the non-programmable random oracle model. As a key ingredient of our construction, we give a new randomizable replayable-CCA secure public key encryption (PKE) that outperforms in efficiency all previous schemes. We believe this result is of independent interest.