Miracle-dz/UniFAR-FTUs huggingface dataset:
Enzymatic Synthesis of Quercetin Monoglucopyranoside and Maltooligosaccharides

Quercetin 3-O-β-monoglucopyranoside and quercetin 3-O-β-maltooligosaccharide were synthesized from quercetin using glucosyltransferase-3 from Phytolacca americana and cyclodextrin glucanotransferase.
High-sensitivity C-reactive protein: a novel and promising marker of coronary heart disease.

BACKGROUND Coronary heart disease remains the leading cause of morbidity and mortality in the industrialized world. Clinical and laboratory studies have shown that inflammation plays a major role in the initiation, progression, and destabilization of atheromas. C-Reactive protein (CRP), an acute phase reactant that reflects low-grade systemic inflammation, has been studied in a variety of cardiovascular diseases. APPROACH Findings from prospective clinical trials were examined to determine the prognostic utility of CRP in acute coronary syndromes, and observations from epidemiological studies were reviewed to determine the ability of CRP to predict future first coronary events. The analytical considerations of CRP measurement in these clinical applications were also examined. CONTENT In patients with established coronary disease, CRP has been shown to predict adverse clinical events. In addition, prospective studies have consistently shown that CRP is a strong predictor of future coronary events in apparently healthy men and women. The relative risk associated with CRP is independent of other cardiovascular disease risk factors. High-sensitivity CRP (hs-CRP) assays are needed for risk assessment of cardiovascular disease. Such assays are currently available but may require further standardization because patients' results will be interpreted using population-based cutpoints. Preventive therapies to attenuate coronary risk in individuals with increased hs-CRP concentrations include aspirin and statin-type drugs. SUMMARY hs-CRP has prognostic utility in patients with acute coronary syndromes and is a strong independent predictor of future coronary events in apparently healthy subjects.
Supporting Software Integration Activities with First-Class Code Changes. (Aide à l'Intégration de Branches Grâce à la Réification des Changements)

Developers typically change codebases in parallel from each other, which results in diverging codebases. Such diverging codebases must be integrated when finished. Integrating diverging codebases involves difficult activities. For example, two changes that are correct independently can introduce subtle bugs when integrated together. Integration can be difficult with existing tools, which, instead of dealing with the evolution of the actual program entities being changed, handle code changes as lines of text in files. Tools are important: software development tools have greatly improved from generic text editors to IDEs by providing high-level code manipulation such as automatic refactorings and code completion. This improvement was possible by the reification of program entities. Nevertheless, integration tools did not benefit from a similar reification of change entities to improve productivity in integration. In this work we first conducted a study to learn which integration activities are important and have little tool support. We discovered that one of such activities is the detection of tangled commits (that contain unrelated tasks such as a bug fix and a refactoring). Then we proposed Epicea, a reified change model and associated IDE tools, and EpiceaUntangler, an approach to help developers share untangled commits based on Epicea. The results of our evaluations with real-world studies show the usefulness of our approaches.
Reading's Old or East Cemetery: the geological landscape of an urban burial ground in modern central Berkshire

ABSTRACT The landscape of the private Old or East Cemetery in Reading was laid out as a garden, a plan popular in the early nineteenth century. Interments began in 1843 and continued after extension of the Cemetery in about 1900; in 1927 the rate of burials peaked in excess of 500 per decade. Although the town continued to grow, the interment rate subsequently plunged, in the face of competition from a new, municipal burial ground (Henley Road) in the eastern town. Burials continued at the Old Cemetery, but largely at established family plots. The Old Cemetery is now semi-wild, but in excess of 5,600 graves with accessible monuments are still to be found. The geological landscape presented by these memorials resembles that of other burial grounds in south-central and south-east England: chiefly Italian marble, Pennant sandstone, Scottish and Cornubian (Cornwall-Devon) granites, Portland limestone, and gabbro. There are minor applications of other granites, Lower Carboniferous Limestone, York stone, Banbury Ironstone, Bathstone, slate and gneiss, and some artificial stone (especially terrazzo) and cast iron. Pennant sandstone was the early stone of choice. Marble rose to great and sustained popularity from the late nineteenth century. Scottish granites had a modest but steady appeal, in contrast to granites from south-west England, which rose to prominence only in the early twentieth century. Gabbros from far overseas appeared mainly late, stimulated by the growth of cheap freight-container transport. The geological evolution of the landscape of the Old Cemetery therefore broadly matches that recorded in other burial grounds of the region, such as Oxford and west London.
Overview of cluster-based routing protocols in wireless sensor networks

Owing to the limited resources of the sensor nodes, energy-efficient routing mechanism becomes one of the most important technologies in wireless sensor networks. As an active branch of routing technology, cluster-based routing protocols excel in network topology management, energy minimization, data aggregation and so on. In this paper, cluster-based routing mechanisms for wireless sensor networks are analyzed. Cluster head selection, cluster formation and data transmission are three key techniques in cluster-based routing protocols. As viewed from the three techniques, recent important cluster-based routing protocols and algorithms are presented. Meanwhile, several representative cluster-based routing protocols are introduced, and their characteristics and performances are compared. Finally, the future research issues in this area are pointed out.
Timeliness of Diagnosing Lung Cancer: Number of Procedures and Time Needed to Establish Diagnosis

Abstract To study number of procedures and time to diagnose lung cancer and factors affecting the timeliness of clinching this diagnosis. Retrospective cohort study of lung cancer patients who consecutively underwent diagnostic bronchoscopy in 1 year (October 2013 to September 2014). Out of 101 patients diagnosed with lung cancer from bronchoscopy, average time interval between first abnormal computed tomogram (CT) scan-to-1st procedure, 1st procedure-to-diagnosis, and 1st abnormal CT scan-to-diagnosis was 16 ± 26, 11 ± 19, and 27 ± 33 days, respectively. These intervals were significantly longer in those requiring repeat procedures. Multivariate analysis revealed inconclusive 1st procedure to be the predictor of prolonged (>30 days) CT scan to diagnosis time (P = 0.04). Twenty-nine patients (28.7%) required repeat procedures (n = 63). Reasons behind repeating the procedures were inadequate procedure (n = 14), inaccessibility of lesion (n = 9), inappropriate procedure (n = 5), mutation analysis (n = 2), and others (n = 2). Fifty had visible endo-bronchial lesion, 20 had positive bronchus sign, and 83 had enlarged mediastinal/hilar lymph-nodes or central masses adjacent to the airways. Fewer procedures, and shorter procedure to diagnosis time, were observed in those undergoing convex probe endobronchial ultrasound-transbronchial needle aspiration (EBUS-TBNA) (P = 0.04). Most patients exhibit enlarged mediastinal lymph node or mass adjacent to the central airway accessible by convex probe EBUS-TBNA. Hence, combining it with conventional bronchoscopic techniques such as bronchoalveolar lavage, brush, and forceps biopsy increases detection rate, and reduces number of procedures and time to establish diagnosis. This may translate into cost and resource savings, timeliness of diagnosis, greater patient satisfaction, and conceivably better outcomes.
CREDROID: Android malware detection by network traffic analysis

Android, one of the most popular open source mobile operating system, is facing a lot of security issues. Being used by users with varying degrees of awareness complicates the problem further. Most of the security problems are due to maliciousness of android applications. The malwares get installed in mobile phones through various popular applications particularly gaming applications or some utility applications from various third party app-stores which are untrustworthy. A common feature of the malware is to access the sensitive information from the mobile device and transfer it to remote servers. For our work, we have confined ourselves to defining maliciousness as leakage of privacy information by Android application. In this paper we have proposed a method named as CREDROID which identifies malicious applications on the basis of their Domain Name Server(DNS) queries as well as the data it transmits to remote server by performing the in-depth analysis of network traffic logs in offline mode. Instead of performing signature based detection which is unable to detect polymorphic malwares, we propose a pattern based detection. Pattern in our work refers to the leakage of sensitive information being sent to the remote server. CREDROID is a semi-automated approach which works on various factors like the remote server where the application is connecting, data being sent and the protocol being used for communication for identifying the trustworthiness (credibility) of the application. In our work, we have observed that 63% of the applications from a standard dataset of malwares are generating network traffic which has been the focus of our work.
Secure parent node selection scheme in route construction to exclude attacking nodes from RPL network

The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). Since RPL is a tree-based topology network, an attacking node may falsely claim its rank towards neighbor nodes in order to be chosen as a parent of them and to collect more packets to tamper. In this paper, we propose a secure parent selection scheme so that each child node can select a legitimate node as its parent. In the proposed scheme, each node chooses a parent after excluding the best candidate if multiple parent candidates exist. Our scheme utilizes the fact that an attacking node claims falsely a lower rank than that of a legitimate nodes. We show that attacking nodes have no merits to claim lower ranks than true ones in a secure parent node selection scheme. By the computer simulation, we show that the proposed scheme reduces the total number of child nodes attached to attacking nodes in comparison with the conventional RPL scheme.
On the ecohydrology of structurally heterogeneous semiarid landscapes

Clarification of the coupled ecohydrological mechanisms that determine the spatial pattern and structural characteristics of vegetation in water‐limited landscapes remains a vexing problem in both hydrological and vegetation sciences. A particular challenge is the fact that the spatial pattern of vegetation is both a cause and effect of variation in water availability in semiarid ecosystems. Here we develop a methodology to derive the landscape‐scale distribution of water balance and soil moisture in a patchy vegetation mosaic based on the statistics of an underlying poisson distribution of individual tree canopies and their accompanying root systems. We consider the dynamics of water balance at a point to be dependent on the number of intersecting tree root systems and overlapping tree canopies. The coupling of individual pattern to landscape‐scale distribution of soil water balance allows for investigations into the role of tree density, average canopy size, and the lateral extension of tree root systems on the spatiotemporal patterns of soil moisture dynamics, plant water uptake, and plant stress in a wide range of open woodland ecosystems. Our model is applied to southern African savannas, and we find that locations in the landscape that contain average vegetation structure correspond to conditions of minimum stress across a wide range of annual rainfall and vegetation densities. Furthermore, observed vegetation structural parameters are consistent with an optimization that simultaneously maximizes plant water uptake while minimizing plant water stress. Finally, the model predicts adaptive changes in the optimal lateral extent of plant roots which decreases with increasing rainfall along a regional gradient in mean annual precipitation.
Parallel In-place Model Transformations with LinTra

As software systems have grown large and complex in the last few years, the problems with which Model-Driven Development has to cope have increased at the same pace. In particular, the need to improve the performance and scalability of model transformations has become a critical issue. In previous work we introduced LinTra, a model transformation platform for the parallel execution of out-place model transformations. Nevertheless, in-place model transformations are required in several contexts and domains as well. In this paper we discuss the fundamentals of in-place model transformations in the light of their parallel execution and provide LinTra with an in-place execution mode.
A distributed verification scheme for encrypted data aggregation in wireless sensor networks

Wireless sensor networks are composed of sensors with low computational and energy resources. Transmission of data is one of the most energy consuming operations in such networks. In-network data aggregation is a popular technique which is performed to reduce data transmissions. However, by aggregating multiple data into one, the security of them is no longer guaranteed. While concealed data aggregation methods have been recently proposed to provide energy efficient, end-to-end confidentiality, not much work has been done to enhance them with aggregate integrity. In this work, we propose a scalable and energy efficient bihomomorphic method to preserve end-to-end confidentiality and aggregate integrity against outsider attacks. A distributed validation scheme is used to prevent blind rejection caused by outsiders. To provide better resilience, a key refreshment method is used to prevent analysis attacks.
Spatially resolved photovoltaic performance of axial GaAs nanowire pn-diodes

Nanowires allow for a combination of highly mismatched materials needed for optimized broad spectrum absorption [1], and the use of appropriate substrates. III–V nanowires offer in addition a high absorption coefficient which is indispensable if a high efficiency energy transformation is aimed at the nanoscale. Currently, both radial [2] as well as axial III–V nanowire pn-junctions are under discussion for photovoltaic applications. The axial device enables a high forward current, ultra-low leakage, and a possible staggered integration of multiple cells. Moreover, the axial device gives full access for a high resolution photovoltaic analysis that is especially important at the current status of evaluation since a detailed device understanding is pending and the published yield data of nanowire devices are still low [1–2].
Speech pause detection for noise spectrum estimation by tracking power envelope dynamics

A speech pause detection algorithm is an important and sensitive part of most single-microphone noise reduction schemes for enhancement of speech signals corrupted by additive noise as an estimate of the background noise is usually determined when speech is absent. An algorithm is proposed which detects speech pauses by adaptively tracking minima in a noisy signal's power envelope both for the broadband signal and for the high-pass and low-pass filtered signal. In poor signal-to-noise ratios (SNRs), the proposed algorithm maintains a low false-alarm rate in the detection of speech pauses while the standardized algorithm of ITU G.729 shows an increasing false-alarm rate in unfavorable situations. These characteristics are found with different types of noise and indicate that the proposed algorithm is better suited to be used for noise estimation in noise reduction algorithms, as speech deterioration may thus be kept at a low level. It is shown that in connection with the Ephraim-Malah (1984) noise reduction scheme, the speech pause detection performance can even be further increased by using the noise-reduced signal instead of the noisy signal as input for the speech pause decision unit.
Function Fitting about Internal Stress of Ceramic Paste Based on BP-NN and SVM

With the development of modern intelligence technology, BP Neural Network (BP-NN) and Support Vector Machine (SVM) have become hot topics of current international machine learning community. In order to solve the function fitting problem about the internal stress of ceramic paste, a fitting method based BP-NN and SVM is proposed in this paper. By introducing the structures and characteristics of two methods briefly, two methods can rationally solve the problem of multi-input and single-output function fitting during the soft measurement process about internal stress of ceramic paste. The simulation results show that BP-NN and SVM methods can both make up the limitations of "cftool" function in MATLAB which only solves the problem of the single-input single-output, In addition, SVM is better than BP-NN on approximation and generalization ability, and the simulation speed of SVM is also faster than the ones of BP-NN.
The Jaquith Archive Server

Abstract : Advances in robotic devices and storage media now make it possible to design near-line automated storage systems. These systems aim to provide responsive performance to users of tertiary storage devices. The Jaquith system is a prototype archive server that lets network users archive their own files using automated storage. It provides semi-interactive file access to its clients by combining a high-density robotic tape system with disk-based indexing. Jaquith presents an FTP interface whereby whole files are moved between the client and its storage archive. Each client's archive is separately governed to provide independent namespaces, added security, and parallel operation. A wildcard query mechanism lets users manipulate arbitrary subsets of their files. Two important aspects of the query system are abstracts, text tags that can be associated with files, and versions, date-stamps that are applied to archived files. Jaquith throughput is about 135 KB/second when archiving small (10 KB) user files to disk buffers. The use of synchronous disk writes by the server to ensure durability of each user file degrades throughput to 40 KB/second. The performance when writing disk buffers to Exabyte or Metrum tape is severely limited by the time to write a hardware filemark. Consequently, it is important to write several megabytes of data between filemarks for good performance.
Performance evaluation of an integer wavelet transform for FPGA implementation

This paper presents the technique for an optimization of a Wavelet Transform suitable for implementation in Field Programmable Gate Array (FPGA). It employs the simplest version of Integer Wavelet Transform (IWT) for signal decomposition (analysis) which makes it suitable for real-time and cost effective personal health care assistance devices. The computational, memory and consumption resources of low-complexity embedded systems is surpassed by the biomedical wavelet based applications presented so far. To facilitate such systems capable of using wavelet transform, optimization and implementation technique of wavelet transform is proposed in this paper. Its performance evaluation is also carried out with an existing optimized wavelet transform in other platform. By evaluation of the results obtained it may be noted that the proposed technique deliver insignificant degradation in terms of decomposition (analysis) of the given biomedical signal. The proposed technique is also suitable for wavelet based Biomedical signal processing methods like signal denoising and ECG QRS complex detection, etc.
Manage and Query Generic Moving Objects in SECONDO

In this demonstration, we introduce a system that is able to manage moving objects in all real world environments, e.g., road network, bus network and indoor. The complete trip of a person is managed by the system such as Walk, Car, Walk, and Indoor, where the precise locations of both outdoor and indoor movements are represented. Trajectories located in several environments are integrated into the same framework. The system supports the shortest path searching for start and end locations being in different environments, for example, from a room to a bus stop. A comprehensive and scalable set of moving objects is generated to simulate human movement in practice. Optimization methods are developed to efficiently answer novel queries regarding transportation modes and mobile environments. Most of these queries are not supported by existing methods because of the limitation of data representation.
A stochastic downhill search algorithm for estimating the local false discovery rate

Screening for differential gene expression in microarray studies leads to difficult large-scale multiple testing problems. The local false discovery rate is a statistical concept for quantifying uncertainty in multiple testing. We introduce a novel estimator for the local false discovery rate that is based on an algorithm which splits all genes into two groups, representing induced and noninduced genes, respectively. Starting from the full set of genes, we successively exclude genes until the gene-wise p-values of the remaining genes look like a typical sample from a uniform distribution. In comparison to other methods, our algorithm performs compatibly in detecting the shape of the local false discovery rate and has a smaller bias with respect to estimating the overall percentage of noninduced genes. Our algorithm is implemented in the Bioconductor compatible R package TWILIGHT version 1.0. 1, which is available from http://compdiag.molgen. mpg.de/software or from the Bioconductor project at http://www.bioconductor. org.
Generation of Electron Acoustic Waves in the Topside Ionosphere From Coupling With Kinetic Alfven Waves: A New Electron Energization Mechanism

Results from a new drift kinetic model in the topside ionosphere capture the mode conversion from kinetic Alfven waves to electron acoustic waves. When the kinetic Alfven waves propagate into the transition region, where the electron density of ionospheric origin becomes comparable to that of magnetospheric origin, the steep temperature gradient leads to the mode conversion. The electron acoustic waves are short‐lived by dissipating their energy into the electron energization, thus revealing a new type of electron acceleration in the topside ionosphere.