Miracle-dz/UniFAR-FTUs huggingface dataset:
Personal Identification with Human Iris Recognition based on Wavelet Transform

This paper presents a biometric recognition system based on the iris of a human eye using wavelet transform. The proposed system includes three modules: image preprocessing, feature extraction, and recognition modules. The feature extraction module adopts the gradient directions (i.e., angles) on wavelet transform as the discriminating texture features. The identification system encodes the features to generate the iris codes using two simple and efficient coding techniques: binary Gray encoding and delta modulation. The experimental results show that the recognition rates up to 95.27%, 95.62%, 96.21%, and 99.05%, respectively, using different coding methods can be achieved.
Atmospheric response to ocean fronts and eddies: A Review

Air-sea interaction at ocean fronts and eddies exhibits positive correlation between sea surface temperature (SST), wind speed, and heat fluxes out of the ocean, indicating that the ocean is forcing the atmosphere. This contrasts with larger scale climate modes where the negative correlations suggest that the atmosphere is driving the system. This paper reviews studies of the interaction of sharp SST gradients and the overlying marine atmospheric boundary layer and deeper atmosphere. The importance of different physical mechanisms of atmospheric response to SST gradients, such as the effect of surface stability variations on momentum transfer, pressure gradients, secondary circulations and cloud cover will be assessed. These processes will be compared and contrasted for different regions such as the Equatorial Front in the Eastern Pacific, and oceanic fronts in mid-latitudes such as the Gulf Stream, Kuroshio, and Agulhas Return Current.
A novel clustering and KWNN-based strategy for Wi-Fi fingerprint indoor localization

With the increasing usage of Wi-Fi infrastructure, methods of indoor localization by Wi-Fi are receiving more and more research efforts in the past. Reducing computational complexity and improving the rate of matching effectively can improve accuracy and real-time of localization. In this paper, we propose a novel clustering approach-AP similarity clustering and K-Weighted Nearest Node (KWNN) method for Wi-Fi indoor localization system. In offline stage, fingerprint in database is trained and divided into different clusters based on different APs' similarity. In online test stage, firstly, a mobile node finds out the suitable sub-cluster, secondly, we use k-weighted nearest node algorithm to select k nodes among this cluster rather than the whole fingerprint database to reduce the matching space. To validate our strategy, we simulate and compare the proposed approach+KWNN and k-means+KWNN and KWNN-only using the real fingerprint data collected from 900m2 indoor environment. Experiment results reveal that our algorithm will improve localization accuracy by 17.14% and reduce position time-consuming by 50%.
Dialysate White Blood Cell Change after Initial Antibiotic Treatment Represented the Patterns of Response in Peritoneal Dialysis-Related Peritonitis

Background. Patients with peritoneal dialysis-related peritonitis usually have different responses to initial antibiotic treatment. This study aimed to explore the patterns of response by using the changes of dialysate white blood cell count on the first five days of the initial antibiotic treatment. Materials and Methods. A retrospective cohort study was conducted. All peritoneal dialysis-related peritonitis episodes from January 2014 to December 2015 were reviewed. We categorized the patterns of antibiotic response into 3 groups: early response, delayed response, and failure group. The changes of dialysate white blood cell count for each pattern were determined by multilevel regression analysis. Results. There were 644 episodes in 455 patients: 378 (58.7%) of early response, 122 (18.9%) of delayed response, and 144 (22.3%) of failure episodes. The patterns of early, delayed, and failure groups were represented by the average rate reduction per day of dialysate WBC of 68.4%, 34.0%, and 14.2%, respectively (p value < 0.001 for all comparisons). Conclusion. Three patterns, which were categorized by types of responses, have variable rates of WBC declining. Clinicians should focus on the delayed response and failure patterns in order to make a decision whether to continue medical therapies or to aggressively remove the peritoneal catheter.
A Pixel Domain Video Coding based on Turbo code and Arithmetic code

In recent years, with emerging applications such as multimedia sensors networks, wireless low-power surveillance and mobile camera phones, the traditional video coding architecture in being challenged. In fact, these applications have different requirements than those of the broadcast video delivery systems: a low power consumption at the encoder side is essential. In this context, we propose a pixel-domain video coding scheme which fits well in these senarios. In this system, both the arithmetic and turbo codes are used to encode the video sequence's frames. Simulations results show significant gains over Pixel-domain Wyner-Ziv video codeingr.
Evidence for Multiple Ground‐Rupturing Earthquakes in the Past 4,000 Years Along the Pasuruan Fault, East Java, Indonesia: Documentation of Active Normal Faulting in the Javan Backarc

Instrumental and historical records of earthquakes supplemented by paleoeseismic records reveal the earthquake potential of an area. The back‐arc region of the Javan subduction system has been considered to be inactive seismically and is identified as a region of low seismic hazard on the seismic hazard map of Indonesia. However, our study documents recent geological activity along Pasuruan Fault, a high‐angle normal fault located within this zone. The fault is expressed in the landscape as prominent ~13‐km‐long, 2‐ to 50‐m‐high scarps cutting Pleistocene sediments on the north coast of East Java. We excavated two fault‐perpendicular trenches across a relay ramp structure and documented evidence for past earthquakes in both trenches. Our preliminary age model, constrained by 23 radiocarbon dates on detrital charcoal, indicates that since 2006 ± 134 cal BCE, there have been at least six ground‐rupturing earthquakes along the fault at this location. The most recent is attributed to the 1852 Grati earthquake. Our modeled 95th percentile ranges for the next four earlier earthquakes (and their mean, in years CE) are 1786–1846(1816), 1666–1777(1721), 1086–1648(1367), and 726–1093(909). Using these events, we calculate a recurrence interval of 236 ± 46 years. The Pasuruan Fault is located near the western end of the Bali‐Flores back‐arc basin. The late Holocene activity along the fault shows that extensional faulting is ongoing though the mechanism causing this structure remains unclear. Although the fault is considered as a minor structure, its potential for producing large earthquakes may pose significant hazard to the densely populated region.
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions

We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidders in a way that maximizes the sum of bidders' values for their allocated items. Bidders have complex preferences over items expressed by valuation functions that assign values to all subsets of items. We study the "black box" setting in which the auctioneer has oracle access to the valuation functions of the bidders. In particular, we explore the well-known value query model in which the permitted query to a valuation function is in the form of a subset of items, and the reply is the value assigned to that subset of items by the valuation function. We consider different classes of valuation functions: submodular,subadditive, and superadditive. For these classes, it has been shown that one can achieve approximation ratios of 1 -- 1/e, 1/√m, and √ m/m, respectively, via a polynomial (in k and m) number of value queries. We prove that these approximation factors are essentially the best possible: For any fixed ε > 0, a (1--1/e + ε)-approximation for submodular valuations or an 1/m1/2-ε-approximation for subadditive valuations would require exponentially many value queries, and a log1+ε m/ m-approximation for superadditive valuations would require a superpolynomial number of value queries.
Probabilistic Coverage in Wireless Sensor Networks

We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. We design PCP keeping in mind that no single sensing model (probabilistic or not) will accurately model all types of sensors in all environments. It is expected that different sensor types will require different sensing models. Even for the same sensor type, the sensing model may need to be changed in different environments. Designing, implementing, and testing a different coverage protocol for each sensing model is indeed an extremely costly process, if at all possible. To address this challenging task, we design our protocol with limited dependence on the sensing model. In particular, our protocol requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We show how this parameter can be derived in general, and we actually do the calculations for two example sensing models: (i) the probabilistic exponential sensing model, and (ii) the commonly-used deterministic disk sensing model. The first model is chosen because it is conservative in terms of estimating sensing capacity, and it has been used before in another probabilistic coverage protocol, which enables us to conduct a fair comparison. Because it is conservative, the exponential sensing model can be used as a first approximation for many other sensing models. The second model is chosen to show that our protocol can easily function as a deterministic coverage protocol. In this case, we compare our protocol against two recent deterministic protocols that were shown to outperform others in the literature. Our comparisons indicate that our protocol outperforms all other protocols in
Functional characterization of dopamine transporter in vivo using Drosophila melanogaster behavioral assays

Dopamine mediates diverse functions such as motivation, reward, attention, learning/memory and sleep/arousal. Recent studies using model organisms including the fruit fly, have elucidated various physiological functions of dopamine, and identified specific neural circuits for these functions. Flies with mutations in the Drosophila dopamine transporter (dDAT) gene show enhanced dopamine signaling, and short sleep and memory impairment phenotypes. However, understanding the mechanism by which dopamine signaling causes these phenotypes requires an understanding of the dynamics of dopamine release. Here we report the effects of dDAT expression on behavioral traits. We show that dDAT expression in a subset of dopaminergic neurons is sufficient for normal sleep. dDAT expression in other cell types such as Kenyon cells and glial cells can also rescue the short sleep phenotype of dDAT mutants. dDAT mutants also show a down-regulation of the D1-like dopamine receptor dDA1, and this phenotype is rescued when dDAT is expressed in the same cell types in which it rescues sleep. On the other hand, dDAT overexpression in mushroom bodies, which are the target of memory forming dopamine neurons, abolishes olfactory aversive memory. Our data demonstrate that expression of extrasynaptic dopamine transporters can rescue some aspects of dopamine signaling in dopamine transporter mutants. These results provide novel insights into regulatory systems that modulate dopamine signaling.
Expression of 16 Nitrogenase Proteins within the Plant Mitochondrial Matrix

The industrial production and use of nitrogenous fertilizer involves significant environmental and economic costs. Strategies to reduce fertilizer dependency are required to address the world's increasing demand for sustainable food, fibers, and biofuels. Biological nitrogen fixation, a process unique to diazatrophic bacteria, is catalyzed by the nitrogenase complex, and reconstituting this function in plant cells is an ambitious biotechnological strategy to reduce fertilizer use. Here we establish that the full array of biosynthetic and catalytic nitrogenase (Nif) proteins from the diazotroph Klebsiella pneumoniae can be individually expressed as mitochondrial targeting peptide (MTP)-Nif fusions in Nicotiana benthamiana. We show that these are correctly targeted to the plant mitochondrial matrix, a subcellular location with biochemical and genetic characteristics potentially supportive of nitrogenase function. Although Nif proteins B, D, E, F, H, J, K, M, N, Q, S, U, V, X, Y, and Z were all detectable by Western blot analysis, the NifD catalytic component was the least abundant. To address this problem, a translational fusion between NifD and NifK was designed based on the crystal structure of the nitrogenase MoFe protein heterodimer. This fusion protein enabled equimolar NifD:NifK stoichiometry and improved NifD expression levels in plants. Finally, four MTP-Nif fusion proteins (B, S, H, Y) were successfully co-expressed, demonstrating that multiple components of nitrogenase can be targeted to plant mitochondria. These results establish the feasibility of reconstituting the complete componentry for nitrogenase in plant cells, within an intracellular environment that could support the conversion of nitrogen gas into ammonia.
Automatic Classification of Photographs and Graphics

In general, digital images can be classified into photographs and computer graphics. This taxonomy is very useful in many applications, such as Web image search. However, there are no effective methods to perform this classification automatically. In this paper, we manage to solve this problem from two aspects. At first, we propose some novel low-level features that can reveal perceptional differences between photographs and graphics. Then, we adopt an effective algorithm to perform the classification. The experiments conducted on a large-scale image database indicate the effectiveness of our algorithm
An optimal control approach to the multi-agent persistent monitoring problem in two-dimensional spaces

We address the persistent monitoring problem in two-dimensional (2D) mission spaces where the objective is to control the movement of multiple cooperating agents to minimize an uncertainty metric. In a one-dimensional (1D) mission space, we have shown that the optimal solution is for each agent to move at maximal speed and switch direction at specific points, possibly waiting some time at each such point before switching. In a 2D mission space, such simple solutions can no longer be derived. An alternative is to optimally assign each agent a linear trajectory, motivated by the 1D analysis. We prove, however, that elliptical trajectories outperform linear ones. Therefore, we formulate a parametric optimization problem in which we seek to determine such trajectories.We show that the problem can be solved using Infinitesimal Perturbation Analysis (IPA) to obtain performance gradients on line and obtain a complete solution. Numerical examples are included to illustrate the main result and to compare our proposed scalable approach to trajectories obtained through off-line computationally intensive solutions.
Towards Trustworthy Identity and Access Management for the Future Internet

The Future Internet, in its different variants, promises a global connectivity of people, things and services.However, in order to develop its full potential and to achieve an accepted, seamless integration of Internet use into daily lives, severe security issues have to be addressed. In this paper, we propose to establish security and trustworthiness by means of an integrated identity and access management. Especially, we sketch the foundations of a novel identity and access management approach that is tailored for the Future Internet. We provide mechanisms for flexible modeling and description of digital user identities with support to transaction-based privacy protection, access to personal data, flexible third party accountability and end-to-end secure communication. The mechanisms are tailored for the use on a trusted personaldevice called Minimal Entity, which provides a trustworthy gateway to benefit from the offerings of the Future Internet.
Bleeding manifestations of congenital and drug-induced defects of the platelet P2Y12 receptor for adenosine diphosphate

Summary P2Y12, one of the two platelet receptors for adenosine diphosphate (ADP), plays a central role in platelet function. Defects of P2Y12 should be suspected when ADP, even at high concentrations (≥10 μM), is unable to induce full, irreversible platelet aggregation. Patients with congenital P2Y12 defects display a mild-to-moderate bleeding diathesis of variable severity, characterised by mucocutaneous bleeding and excessive post-surgical and post-traumatic blood loss. Drugs that inhibit P2Y12 are potent antithrombotic drugs, attesting the central role played by P2Y12 in platelet thrombus formation. Clopidogrel, the most widely used drug that inhibits P2Y12, is effective both in monotherapy and in combination with acetylsalicylic acid (ASA). Its most important drawback is the inability to inhibit adequately P2Y12-dependent platelet function in about 1/3 of patients, at the recommended therapeutic doses. The incidence of bleeding events is similar in ASA-treated and clopidogrel-treated patients; however, the combination of ASA and clopidogrel causes more bleeding than each drug in monotherapy. Compared to clopidogrel, new drugs inhibiting P2Y12, such as prasugrel and ticagrelor, decrease the risk of cardiovascular events and increase the risk of bleeding complications, because they adequately inhibit P2Y12-dependent platelet function in the vast majority of treated patients.
Comparing of goal setting strategy with group education method to increase physical activity level: A randomized trial

Background: Designing an intervention to increase physical activity is important to be based on the health care settings resources and be acceptable by the subject group. This study was designed to assess and compare the effect of the goal setting strategy with a group education method on increasing the physical activity of mothers of children aged 1 to 5. Materials and Methods: Mothers who had at least one child of 1-5 years were randomized into two groups. The effect of 1) goal-setting strategy and 2) group education method on increasing physical activity was assessed and compared 1 month and 3 months after the intervention. Also, the weight, height, body mass index (BMI), waist and hip circumference, and well-being were compared between the two groups before and after the intervention. Results: Physical activity level increased significantly after the intervention in the goal-setting group and it was significantly different between the two groups after intervention (P < 0.05). BMI, waist circumference, hip circumference, and well-being score were significantly different in the goal-setting group after the intervention. In the group education method, only the well-being score improved significantly (P < 0.05). Conclusion: Our study presented the effects of using the goal-setting strategy to boost physical activity, improving the state of well-being and decreasing BMI, waist, and hip circumference.
Efficiently learning mixtures of two Gaussians

Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this problem for the case of two Gaussians in $n$ dimensions (even if they overlap), with provably minimal assumptions on the Gaussians, and polynomial data requirements. In statistical terms, our estimator converges at an inverse polynomial rate, and no such estimator (even exponential time) was known for this problem (even in one dimension). Our algorithm reduces the n-dimensional problem to the one-dimensional problem, where the method of moments is applied. One technical challenge is proving that noisy estimates of the first six moments of a univariate mixture suffice to recover accurate estimates of the mixture parameters, as conjectured by Pearson (1894), and in fact these estimates converge at an inverse polynomial rate. As a corollary, we can efficiently perform near-optimal clustering: in the case where the overlap between the Gaussians is small, one can accurately cluster the data, and when the Gaussians have partial overlap, one can still accurately cluster those data points which are not in the overlap region. A second consequence is a polynomial-time density estimation algorithm for arbitrary mixtures of two Gaussians, generalizing previous work on axis-aligned Gaussians (Feldman {\em et al}, 2006).
Applying General Compiler Optimizations to a Packet Filter Generator

This paper describes the architecture of the BSD Packet Filter package, which consists of a code generator, optimizer and virtual machine. The ability to do per-packet statistical sampling was added to the package. In addition, several modifications were made to the optimizer to increase the quality of the code output. While these modifications don’t produce drastic improvements in the resulting code, they do illustrate the advantages of using an SSA-like representation for the intermediate byte code.
Asynchronous Orthogonal Differential Decoding for Multiple Access Channels

We propose several differential decoding schemes for asynchronous multi-user MIMO systems based on orthogonal space-time block codes (OSTBCs), where neither the transmitters nor the receiver has knowledge of the channel. First, we derive novel low complexity differential decoders by performing interference cancellation in time and employing different decoding methods. The decoding complexity of these schemes grows linearly with the number of users. We then present additional differential decoding schemes that perform significantly better than our low complexity decoders and outperform the existing synchronous differential schemes but require higher decoding complexity compared to our low complexity decoders. The proposed schemes work for any square OSTBC, any constant amplitude constellation, any number of users, and any number of receive antennas. Furthermore, we analyze the diversity of the proposed schemes and derive conditions under which our schemes provide full diversity. For the cases of two and four transmit antennas, we provide examples of PSK constellations to achieve full diversity. Simulation results show that our differential schemes provide good performance. To the best of our knowledge, the proposed differential detection schemes are the first differential schemes for asynchronous multi-user systems.
Anytime Anyspace AND/OR Search for Bounding the Partition Function

Bounding the partition function is a key inference task in many graphical models. In this paper, we develop an anytime anyspace search algorithm taking advantage of AND/OR tree structure and optimized variational heuristics to tighten deterministic bounds on the partition function. We study how our priority-driven best-first search scheme can improve on state-of-the-art variational bounds in an anytime way within limited memory resources, as well as the effect of the AND/OR framework to exploit conditional independence structure within the search process within the context of summation. We compare our resulting bounds to a number of existing methods, and show that our approach offers a number of advantages on real-world problem instances taken from recent UAI competitions.