Miracle-dz/UniFAR-FTUs huggingface dataset:
Informative counting: fine-grained batch authentication for large-scale RFID systems

Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, while little work has been done to address the scalability issue in batch authentications. Deterministic approaches verify them one by one, and the communication overhead and time cost grow linearly with increasing size of tags. We design a fine-grained batch authentication scheme, INformative Counting (INC), which achieves sublinear authentication time and communication cost in batch verifications. INC also provides authentication results with accurate estimates of the number of counterfeiting tags and genuine tags, while previous batch authentication methods merely provide 0/1 results indicating the existence of counterfeits. We conduct detailed theoretical analysis and extensive experiments to examine this design and the results show that INC significantly outperforms previous work in terms of effectiveness and efficiency.
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels

We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint subgraphs isomorphic to H. For every graph class F, let F-Subgraph Test and F-Packing be the special cases of the two problems where H is restricted to be in F. Our goal is to study which classes F make the two problems tractable in one of the following senses: • (randomized) polynomial-time solvable, • admits a polynomial (many-one) kernel (that is, has a polynomial-time preprocessing procedure that creates an equivalent instance whose size is polynomially bounded by the size of the solution), or • admits a polynomial Turing kernel (that is, has an adaptive polynomial-time procedure that reduces the problem to a polynomial number of instances, each of which has size bounded polynomially by the size of the solution). To obtain a more robust setting, we restrict our attention to hereditary classes F. It is known that if every component of every graph in F has at most two vertices, then F-Packing is polynomial-time solvable, and NP-hard otherwise. We identify a simple combinatorial property (every component of every graph in F either has bounded size or is a bipartite graph with one of the sides having bounded size) such that if a hereditary class F has this property, then F-Packing admits a polynomial kernel, and has no polynomial (many-one) kernel otherwise, unless the polynomial hierarchy collapses. Furthermore, if F does not have this property, then F-Packing is either WK[1]-hard, W[1]-hard, or Long Path-hard, giving evidence that it does not admit polynomial Turing kernels either. For F-Subgraph Test, we show that if every graph of a hereditary class F satisfies the property that it is possible to delete a bounded number of vertices such that every remaining component has size at most two, then F-Subgraph Test is solvable in randomized polynomial time and it is NP-hard otherwise. We introduce a combinatorial property called (a, b, c, d)-splittability and show that if every graph in a hereditary class F has this property, then F-Subgraph Test admits a polynomial Turing kernel and it is WK[1]-hard, W[1]-hard, or Long Path-hard otherwise. We do not give a complete characterization of the cases when F-Subgraph Test admits polynomial many-one kernels, but show examples that this question is much more fragile than the characterization for Turing kernels.
Significant message precedence in object-based systems

Distributed applications are realized by cooperation of objects. A state of the object depends on in what order the object exchanges request and response messages and computes requests. In this paper, we newly define a significantly precedent order of messages based on a conflicting relation among requests. The objects can be mutually consistent if the objects take messages in the significantly precedent order. We discuss a protocol which supports the significantly ordered delivery of request and response messages. Here, an object vector is newly proposed to significantly order messages.
Serious gaming based on Kinect technology for autistic children in Serbia

In this paper, a new, serious Kinect-based game for autistic children in Serbia is presented. The main purpose of this game is fine-tuning of motor skills, and performance improvement of basic cognitive tasks through practicing five game categories: Sorting, Math exercises, Catching, Imitation and Seeking. It is a user-friendly game, with colorful interface, approachable for autistic children. Therapists can monitor numerical scores and graphical representation of the results. This way, while the child plays and performs integrated task of motor and cognitive exercises, the therapists can quantitatively and objectively assess child's progress, based on gesture precision, smoothness, repeatability, reflexes, and results from mathematical tasks.
Basal serum tryptase level correlates with severity of hymenoptera sting and age.

BACKGROUND Increased serum tryptase has been linked to the severity of the reaction after Hymenoptera stings. The aim of the study was to measure basal tryptase levels in patients with Hymenoptera venom allergy and investigate the possible correlation between these levels and the severity of sting reaction. METHODS One hundred nine patients were included in the study. Sixty-three were wasp venom-allergic and 46 were honey bee venom-allergic. Basal serum tryptase levels were measured by UniCAP. RESULTS Basal serum tryptase levels were elevated in 12 (11%) of the 109 patients. Levels were 5.14 pg/L (3.62-5.84), 5.3 microg/L (2.94-6.54), 5.18 microg/L (3.71-6.25), and 6.98 microg/L (4.78-12.6), for patients with sting reactions of grade I, II, III and IV (as classified by Mueller), respectively. Basal serum tryptase levels correlated significantly with the sting reaction severity (r = 0.2752; P = .004) and with age (r = 0.2906; P = .002). Sting reaction severity also correlated with age (r = 0.3654; P = .001). CONCLUSIONS Basal serum tryptase levels were found to be elevated in 11% of venom allergic patients and correlated significantly with both sting reaction severity and age.
Evolution of posterior parietal cortex and parietal‐frontal networks for specific actions in primates

Posterior parietal cortex (PPC) is an extensive region of the human brain that develops relatively late and is proportionally large compared with that of monkeys and prosimian primates. Our ongoing comparative studies have led to several conclusions about the evolution of this posterior parietal region. In early placental mammals, PPC likely was a small multisensory region much like PPC of extant rodents and tree shrews. In early primates, PPC likely resembled that of prosimian galagos, in which caudal PPC (PPCc) is visual and rostral PPC (PPCr) has eight or more multisensory domains where electrical stimulation evokes different complex motor behaviors, including reaching, hand‐to‐mouth, looking, protecting the face or body, and grasping. These evoked behaviors depend on connections with functionally matched domains in premotor cortex (PMC) and motor cortex (M1). Domains in each region compete with each other, and a serial arrangement of domains allows different factors to influence motor outcomes successively. Similar arrangements of domains have been retained in New and Old World monkeys, and humans appear to have at least some of these domains. The great expansion and prolonged development of PPC in humans suggest the addition of functionally distinct territories. We propose that, across primates, PMC and M1 domains are second and third levels in a number of parallel, interacting networks for mediating and selecting one type of action over others. J. Comp. Neurol. 524:595–608, 2016. © 2015 Wiley Periodicals, Inc.
In-Silico Computing of the Most Deleterious nsSNPs in HBA1 Gene

Background α-Thalassemia (α-thal) is a genetic disorder caused by the substitution of single amino acid or large deletions in the HBA1 and/or HBA2 genes. Method Using modern bioinformatics tools as a systematic in-silico approach to predict the deleterious SNPs in the HBA1 gene and its significant pathogenic impact on the functions and structure of HBA1 protein was predicted. Results and Discussion A total of 389 SNPs in HBA1 were retrieved from dbSNP database, which includes: 201 non-coding synonymous (nsSNPs), 43 human active SNPs, 16 intronic SNPs, 11 mRNA 3′ UTR SNPs, 9 coding synonymous SNPs, 9 5′ UTR SNPs and other types. Structural homology-based method (PolyPhen) and sequence homology-based tool (SIFT), SNPs&Go, PROVEAN and PANTHER revealed that 2.4% of the nsSNPs are pathogenic. Conclusions A total of 5 nsSNPs (G60V, K17M, K17T, L92F and W15R) were predicted to be responsible for the structural and functional modifications of HBA1 protein. It is evident from the deep comprehensive in-silico analysis that, two nsSNPs such as G60Vand W15R in HBA1 are highly deleterious. These “2 pathogenic nsSNPs” can be considered for wet-lab confirmatory analysis.
Molecular Dynamics Simulation of Nanoscale Contact Process of Plane on Plane

Considering the process of the plane of rectangular indenter contacting on the plane of rectangular basal body in nanoscale as research object, molecular dynamics method is used for modeling, solving and simulation analysis. The change of atomic state and acting force in the contact process of nanoscale plane and plane is analysis from atomic aspect. The result showed that: when the plane of the rectangular indenter is from the surface of the base body a certain distance, due to attractive force, produced by inter-atomic force, the surface of the substrate produces atoms projection phenomenon; As the indenter continue to move down,the inter-atomic force becomes repulsive force, generates the contact pressure which gradually increases as the contact depth increases; The lattice under the indenter is deformed with pressure action. When indenter is in disengagement stage, the contact pressure decreases rapidly, and appears to reverse tensile stress. With action of the reverse tensile stress, dislocation configuration gradually change and restructuring. At same time, due to the surface effect, a number of substrate atoms are adsorbed in the surface of indenter, which caused by adhesion,and pulled out of the base body with the indenter.
Experimental determination of velocity flow fields in continuous hot dip galvanising baths

An experimental device aimed at determining the circulation patterns of molten metal in the zinc pot of a continuous hot dip strip galvanising line was designed and used. The flow pattern was qualitatively determined and some quantitative measurements were performed which led to an average value of circulation speed of about 10 cm s -1 for a line speed of 140 m min -1 . The overall liquid metal circulation deduced from the measurements showed that the liquid accomplishes a complete turnaround in the entire volume in about 2 min which, in the authors' view, makes a continuous galvanising pot a good mixing device.
Cryogenic micro-photoluminescence of silicon solar cell materials

A literature review of relevant luminescence spectra for silicon solar cell materials has been performed. Three multi crystalline silicon samples in particular has been the focus of attention, one electronic grade sample R6, and two solar grade samples ES1, and MH2, where MH2 has added chromium. A list of relevant luminescence spectra has been compiled, and can be found in the appendix. The samples was measured using low temperature micro photoluminescence. They where cooled down by liquid helium in a cryostat, and excited using a laser. Photoluminescence was captured by a camera mounted on a spectrometer. Noise components was measured and removed, but are subject to changes in between measurements, causing some unwanted artifacts to appear in the end result. Luminescence due to P and B doping atoms are identified in ES1, and MH2 as expected, and a weak boron bound exciton line is also present in the clean sample R6. R6 also show signs of having a carbon-carbon complex impurity forming at grain boundaries. Lines attributed to chromium boron pairs where not observed in MH2, presumably due to the lack of such pairs. ES1 exhibits a luminescence attributed to a higher quality material, than both MH2, and R6. Expected behavior is for R6 to have such traits, but this is not the case. The reason for ES1 to show this enhanced luminescence is not known. Lines attributed to dislocations are observed in all the samples, but consist of less intense peaks than expected. Local heating is a severe problem using micro photoluminescence. Bound excitons, impurity lines, and dislocation related lines, all loose intensity at higher temperatures. The intrinsic TO line also have a substantial broadening with respect to energies, suggesting that local temperatures are as much as 70K higher than the sample holder temperature, when exciting with 128 mW using a 2 µm spot diameter.
The Advanced Computing Systems Association the Region Trap Library: Handling Traps on Application-defined Regions of Memory the Region Trap Library: Handling Traps on Application-defined Regions of Memory

User-level virtual memory (VM) primitives are used in many different application domains including distributed shared memory, persistent objects, garbage collection, and checkpointing. Unfortunately, VM primitives only allow traps to be handled at the granularity of fixed-sized pages defined by the operating system and architecture. In many cases, this results in a size mismatch between pages and application-defined objects that can lead to a significant loss in performance. In this paper we describe the design and implementation of a library that provides, at the granularity of application-defined regions , the same set of services that are commonly available at a page-granularity using VM primitives. Applications that employ the interface of this library, called the Region Trap Library (RTL), can create and use multiple objects with different levels of protection (i.e., invalid, read-only, or read-write) that reside on the same virtual memory page and trap only on read/write references to objects in an invalid state or write references to objects in a read-only state. All other references to these objects proceed at hardware speeds. Benchmarks of an implementation on five different OS/architecture combinations are presented along with a case study using region trapping within a distributed shared memory (DSM) system, to implement a region-based version of the lazy release consistency (LRC) coherence protocol. Together, the benchmark results and the DSM case study suggest that region trapping mechanisms provide a feasible region-granularity alternative for application domains that commonly rely on page-based virtual memory primitives.
Minimal requirements for inhibition of MraY by lysis protein E from bacteriophage ΦX174

The DNA phage ΦX174 encodes the integral membrane protein E whose expression leads to host cell lysis by inhibition of the peptidoglycan synthesis enzyme MraY. Here we use mutagenesis to characterize the molecular details of the E lysis mechanism. We find that a minimal 18‐residue region with the modified wild‐type sequences of the conserved transmembrane helix of E is sufficient to lyse host cells and that specific residues within and at the boundaries of this helix are important for activity. This suggests that positioning of the helix in the membrane is critical for interactions with MraY. We further characterize the interaction site of the transmembrane helix with MraY demonstrating E forms a stable complex with MraY. Triggering cell lysis by peptidoglycan synthesis inhibition is a traditional route for antimicrobial strategies. Understanding the mechanism of bacterial cell lysis by E will provide insights into new antimicrobial strategies using re‐engineered E peptides.
An FLIR Video Surveillance System to Avoid Bridge-Ship Collision

In this paper, a forward-looking infrared (FLIR) video surveillance system is presented for collision avoidance of moving ships to bridge piers. An image pre-processing algorithm is proposed to reduce clutter noises by multi-scale fractal analysis, in which the blanket method is used for fractal feature computation. Then, the moving ship detection algorithm is developed from image differentials of the fractal feature in the region of surveillance between regularly interval frames. Experimental results have shown that the approach is feasible and effective. It has achieved real-time and reliable alert to avoid collisions of moving ships to bridge piers
Detection of terahertz radiation from quantum cascade laser using vanadium oxide microbolometer focal plane arrays

The authors tried real-time imaging of THz radiation from Quantum Cascade Laser (QCL), using vanadium oxide (VOx) microbolometer focal plane arrays (FPAs) of 320x240 with pitches of 37 μm and 23.5 μm as well as 640x480 with 23.5μm pitch. The QCL has such parameters as 3.1 THz emission frequency (97μm in wavelength), 300-400 nsec pulse width, 1.07 msec repetition period, 30 mW peak intensity, 15K operation temperature. The THz radiation from QCL is collimated by off-axis parabola (OAP) and focused on FPA by another OAP. The 10 μm range infrared radiation from scene is blocked by sapphire disk or metal mesh filter. Noise Equivalent Power (NEP) at 3.1 THz is estimated to be 200~400 pW.
Impact of Acquisition Wideband Noise on Synchrophasor Measurements: A Design Perspective

Next-generation phasor measurement units (PMU) are expected to be more accurate than existing ones, especially to address the stricter requirements of future active distribution grids. From this perspective, the influence of acquisition wideband noise (which includes multiple contributions both in amplitude and in phase) has to be carefully evaluated. In this context, the contribution of this paper is twofold. First, it provides a general framework to evaluate the effect of wideband noise on synchrophasor amplitude, phase, frequency, and rate of change of frequency (ROCOF) estimation. The results of this analysis show that the influence of wideband noise can become critical for compliance with the requirements reported in the IEEE standards C37.118. 1-2011 and C37.118. 1a-2014, especially for frequency and ROCOF estimation. In addition, this paper reports general guidelines to choose the PMU effective resolution and sampling rate for which the impact of wideband noise on both P Class and M Class PMUs is negligible.
Topical Authoritative Answerer Identification on Q&A Posts using Supervised Learning in CQA Sites

Community Question Answering (CQA) site is an online platform for hosting information in question-answer form by collaborative users worldwide. There are basically two types of user in this CQA sites: Asker -- who post their query as questions and Answerer -- who provide the answers to these questions. The semi-structured and growing size of contents in CQA sites is posing several challenges. As there is no restriction in posting the number of answers to a question, so the common challenge is to identify the authoritative answerers of a question in order to evaluate the answer quality for selecting the best answer. In this paper, we use latent dirichlet allocation (LDA) the statistical topic modelling on textual data and statistical computing on metadata to identify the features that would reflect the topical authoritative of answerer. Then these features are represented as vector for each answerer of the dataset under investigation for learning the classifier model. The various baseline classifier model are used to identify the topical authoritative answerer on Q&A posts of two real dataset extracted from StackOverflow and AskUbuntu. The correctness and effectiveness of classifier models are evaluated using various parameters like accuracy, precision, recall, and kappa statistic. The experimental result shows that Random Forest classifier outperforms over each evaluation parameter than other classification algorithms.
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently

The minimum energy, and, more generally, the minimum cost, to transmit one bit of information was recently derived for bursty communication when information is available infrequently at random times at the transmitter. Furthermore, it was shown that even if the receiver is constrained to sample only a fraction <inline-formula> <tex-math notation="LaTeX">$\rho \in ~(0,1]$ </tex-math></inline-formula> of the channel outputs, there is no capacity penalty. That is, for any strictly positive sampling rate <inline-formula> <tex-math notation="LaTeX">$\rho $ </tex-math></inline-formula>, the asynchronous capacity per unit cost is the same as under full sampling, <italic>i.e.</italic>, when <inline-formula> <tex-math notation="LaTeX">$\rho =1$ </tex-math></inline-formula>. Moreover, there is no penalty in terms of decoding delay. These results are asymptotic in nature, considering the limit as the number <inline-formula> <tex-math notation="LaTeX">$B$ </tex-math></inline-formula> of bits to be transmitted tends to infinity, while the sampling rate <inline-formula> <tex-math notation="LaTeX">$\rho $ </tex-math></inline-formula> remains fixed. A natural question is then whether the sampling rate <inline-formula> <tex-math notation="LaTeX">$\rho (B)$ </tex-math></inline-formula> can drop to zero without introducing a capacity (or delay) penalty compared with full sampling. We answer this question affirmatively. The main result of this paper is an essentially tight characterization of the minimum sampling rate. We show that any sampling rate that grows at least as fast as <inline-formula> <tex-math notation="LaTeX">$\omega (1/B)$ </tex-math></inline-formula> is achievable, while any sampling rate smaller than <inline-formula> <tex-math notation="LaTeX">$o(1/B)$ </tex-math></inline-formula> yields unreliable communication. The key ingredient in our improved achievability result is a new, multi-phase adaptive sampling scheme for locating transient changes, which we believe may be of independent interest for certain change-point detection problems.
Automated Cell-Cutting for Cell Cloning

We develop an automated cell-cutting technique for cell cloning. Animal cells softened by the cytochalasin treatment are injected into a microfluidic chip. The microfluidic chip contains two orthogonal channels: one microchannel is wide, used to transport cells, and generates the cutting flow; the other is thin and used for aspiration, fixing, and stretching of the cell. The injected cell is aspirated and stretched in the thin microchannel. Simultaneously, the volumes of the cell before and after aspiration are calculated; the volumes are used to calculate the fluid flow required to aspirate half the volume of the cell into the thin microchannel. Finally, we apply a high-speed flow in the orthogonal microchannel to bisect the cell. This paper reports the cutting process, the cutting system, and the results of the experiment.