Miracle-dz/UniFAR-FTUs huggingface dataset:
Performance of Water-Based Zinc Oxide Nanoparticle Coolant during Abrasive Grinding of Ductile Cast Iron

This paper presents the performance of ductile cast iron grinding machining using water-based zinc oxide nanoparticles as a coolant. The experimental data was utilized to develop the mathematical model for first- and second-order models. The second order gives worthy performance of the grinding. The results indicate that the optimum parameters for the grinding model are 20 m/min table speed and 42.43 μm depth of cut for single-pass grinding. For multiple-pass grinding, optimization is at a table speed equal to 35.11 m/min and a depth of cut equal to 29.78 μm. The model fit was adequate and acceptable for sustainable grinding using a 0.15% volume concentration of zinc oxide nanocoolant. This paper quantifies the impact of water-based ZnO nanoparticle coolant on the achieved surface quality. It is concluded that the surface quality is the most influenced by the depth of cut(s) and table speed.
On centroidal voronoi tessellation—energy smoothness and fast computation

Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has many applications in computational sciences and engineering, including computer graphics. The prevailing method for computing CVT is Lloyd's method, which has linear convergence and is inefficient in practice. We develop new efficient methods for CVT computation and demonstrate the fast convergence of these methods. Specifically, we show that the CVT energy function has 2nd order smoothness for convex domains with smooth density, as well as in most situations encountered in optimization. Due to the 2nd order smoothness, it is possible to minimize the CVT energy functions using Newton-like optimization methods and expect fast convergence. We propose a quasi-Newton method to compute CVT and demonstrate its faster convergence than Lloyd's method with various numerical examples. It is also significantly faster and more robust than the Lloyd-Newton method, a previous attempt to accelerate CVT. We also demonstrate surface remeshing as a possible application.
Widely linear reception strategies for layered space-time wireless communications

A new class of receivers based on widely linear data processing has been recently proposed for data detection in communication systems affected by improper complex noise. In this paper, it is shown that this detection strategy may be applied to wireless communication systems employing multiple transmit and receive antennas and adopting a noncircular modulation. Improved versions of the linear decorrelating and minimum mean square error (mmse) receivers, and of the nonlinear nulling and cancellation (V-BLAST) receiver are, thus, developed and analyzed. In particular, we show that the improved receivers outperform the conventional ones both in terms of the error probability and of the capacity to cope with the power disparities that the fading channel may induce on the data streams transmitted by different antennas. Moreover, the improved receivers exhibit satisfactory performance also in systems with a number of transmit antennas exceeding the number of receive antennas. Finally, we also consider the situation in which the propagation channel is not perfectly known to the receiver, and show that the performance of the improved receivers is less sensitive to the channel estimation errors than the conventional receivers.
Protein and energy value of dehydrated poultry excreta in diets for feedlot cattle.

Four Holstein steers (222 kg) with cannulas in the rumen and proximal duodenum were used in a crossover design experiment to evaluate the energy and protein value of dehydrated poultry excreta (DPE). Dietary treatments contained (DM basis) 4% alfalfa hay, 8% sudangrass hay, 49% flaked barley, 8% cane molasses, 3% yellow grease, . 8% urea, 1.4% limestone, . 3% mineral salt, and . 4% chromic oxide, plus 25% of either tapioca pellets or DPE. The DPE contained 42% ash and 27% CP (6% true protein). Substituting DPE for tapioca decreased the DE value of the diet (P < .01). The estimated DE value of the DPE was 1.36 Mcal/kg (.34 Mcal NEm/ kg). There were no treatment effects (P > .10) on microbial N flow to the small intestine or ruminal microbial efficiency (grams of microbial N/kilogram of OM fermented). The addition of DPE increased (P < .05) the flow of non-ammonia and feed N to the small intestine. The estimated ruminal escape N value of DPE was 22%, although very little of this was true protein. Dehydrated poultry excreta did not increase (P > .10) flow of alpha-amino N to the small intestine. Ruminal degradability of uric acid was 96%. Total tract true digestibility of N in DPE was 84%. It is concluded that the NE value of DPE is markedly overestimated in current tables of feeding standards. Less than 10% of the N in DPE escapes the rumen as true protein N.
A Bipartite Substrate Recognition Motif for Cyclin-dependent Kinases*

Cy or RXL motifs have been previously shown to be cyclin binding motifs found in a wide range of cyclin-Cdk interacting proteins. We report the first kinetic analysis of the contribution of a Cy motif on a substrate to phosphorylation by cyclin-dependent kinases. For both cyclin A-Cdk2 and cyclin E-Cdk2 enzymes, the presence of a Cy motif decreased the K m(peptide) 75–120-fold while the k cat remained unchanged. The large effect of the Cy motif on theK m(peptide) suggests that the Cy motif and (S/T)PX(K/R) together constitute a bipartite substrate recognition sequence for cyclin-dependent kinases. Systematic changes in the length of the linker between the Cy motif and the phosphoacceptor serine suggest that both sites are engaged simultaneously to the cyclin and the Cdk, respectively, and eliminate a “bind and release” mechanism to increase the local concentration of the substrate. PS100, a peptide containing a Cy motif, acts as a competitive inhibitor of cyclin-Cdk complexes with a 15-fold lowerK i for cyclin E-Cdk2 than for cyclin A-Cdk2. These results provide kinetic proof that a Cy motif located a minimal distance from the SPXK is essential for optimal phosphorylation by Cdks and suggest that small chemicals that mimic the Cy motif would be specific inhibitors of substrate recognition by cyclin-dependent kinases.
Glacier ice loss monitored through the Planet cubesat constellation

The Planet cubesat constellation is a developing earth observation constellation, that is and will continue to sense the whole earth surface on a daily scale at high resolution. In this contribution, we exploit this datastream to estimate the iceberg production of an outlet glacier of the Southern Patagonian icefield, called Perito Moreno. We demonstrate an automatic pipeline that takes into account the displacement due to glacier motion and the ad-hoc coverage of the glacier, due to different observation angles and orbits. With such a robust and adaptive pipeline, constructing a high resolution and temporal dense dataset is possible to be obtained. Which is of great value to understand the complex behavior of calving.
Protective Effects of the Extract of Juglans mandshurica Maxim on Endothelial Cell Damage

Abstract: Objective: To investigate whether the extract of Juglans mandshurica maxim could inhibits the apoptosis induced by endogenous H2O2 on Endothelial Cell （EVC-304）in vitro. METHODS: Cultured EVC-304 cells were incubated with 10mUGOX or with 10mUGOX and different concentrations (25μg/ mL, 50μg/ mL, 100μg/ mL) of the extract of Juglans mandshurica maxim for 24h.The proliferation of EVC-304cells was detected by methyl thiazolyl tetrazolium (MTT) assay. The early apoptotic percent was measured by flow cytometry (FCM). RESULTS: MTT results showed that the inhibition proliferation of EVC-304 cells induced by endogenous H2O2 could be inhibited by the extract of Juglans mandshurica maxim in a dose -dependent manner. FCM assay indicated that, after treatment on EVC-304 cells with endogenous H2O2, the early apoptotic percent was increased, but the apoptosis rate was decreased significantly when the extract of Juglans mandshurica maxim added. CONCLUSION: the extract of Juglans mandshurica maxim protected significantly the cell damage and cell apoptosis induced by endogenous H2O2.
Nano-optical studies of superconducting nanowire devices for single-photon detection

Superconducting nanowire single photon detectors (SNSPDs) are a rapidly maturing detector technology that offer superior performance relative to competing infrared photon counting technologies. The original experimental work presented here explores three novel methods of improving and analysing detector characteristics, employing low-temperature piezoelectric motors at temperatures below 4 K in a closed-cycle cryostat. Utilizing the low-temperature piezoelectric nanopositioners in tandem with a miniature confocal microscope, this work specifically shows a spatially-separable parallel-wire SNSPD demonstrating one- and two-pixel photon discrimination, with the detector responding more quickly when triggering two pixels. The work demonstrates nanoantenna-coupled SNSPDs, which are simulated, designed, and tested using the same nano-optical setup. In these an increased local absorption into the nanowire is seen at the antennas' resonant wavelengths, enhancing the efficiency of the detector by up to 130 %. Finally, a modified optical setup using a distributed Bragg reflector fibre in place of the microscope to form a tunable cavity around two configurations of SNSPD is demonstrated, improving absorption of the incident light into the nanowire across the whole active area. For these, enhancement in the system detection efficiency of up to 40 % is seen.
Population Genetic Structure and Colonisation History of the Tool-Using New Caledonian Crow

New Caledonian crows exhibit considerable variation in tool making between populations. Here, we present the first study of the species’ genetic structure over its geographical distribution. We collected feathers from crows on mainland Grande Terre, the inshore island of Toupéti, and the nearby island of Maré where it is believed birds were introduced after European colonisation. We used nine microsatellite markers to establish the genotypes of 136 crows from these islands and classical population genetic tools as well as Approximate Bayesian Computations to explore the distribution of genetic diversity. We found that New Caledonian crows most likely separate into three main distinct clusters: Grande Terre, Toupéti and Maré. Furthermore, Toupéti and Maré crows represent a subset of the genetic diversity observed on Grande Terre, confirming their mainland origin. The genetic data are compatible with a colonisation of Maré taking place after European colonisation around 1900. Importantly, we observed (1) moderate, but significant, genetic differentiation across Grande Terre, and (2) that the degree of differentiation between populations on the mainland increases with geographic distance. These data indicate that despite individual crows’ potential ability to disperse over large distances, most gene flow occurs over short distances. The temporal and spatial patterns described provide a basis for further hypothesis testing and investigation of the geographical variation observed in the tool skills of these crows.
Negation in SPARQL

This paper presents a thorough study of negation in SPARQL. The types of negation supported in SPARQL are identified and their main features discussed. Then, we study the expressive power of the corresponding negation operators. At this point, we identify a core SPARQL algebra which could be used instead of the W3C SPARQL algebra. Finally, we analyze the negation operators in terms of their compliance with elementary axioms of set theory.
Feedback load reduction scheme in OFDM-based wireless multicast systems

To reduce the feedback load of OFDM-based wireless multicast systems, an opportunistic feedback scheme (OFS) is proposed. OFS aims to only feed the key channel gains that can significantly affect the system throughput back to the base station (BS). By mathematical derivation, the key channel gains are proved to belong to a channel gain interval, which can be estimated by a proposed statistical method. Simulation results show that OFS can significantly reduce the feedback load of OFDM-based multicast system, while remaining 99% multicast throughput performance compared with the full feedback scheme. Besides, the channel fading type of the BS-user link is not required, which would be more realistic.
SNP500Cancer: a public resource for sequence validation and assay development for genetic variation in candidate genes

The SNP500Cancer Database provides sequence and genotype assay information for candidate single nucleotide polymorphisms (SNPs) useful in mapping complex diseases, such as cancer. The database is an integral component of the NCI's Cancer Genome Anatomy Project. SNP500Cancer provides bi-directional sequencing information on a set of control DNA samples derived from anonymized subjects (102 Coriell samples representing four self-described ethnic groups: African/African-American, Caucasian, Hispanic and Pacific Rim). All SNPs are chosen from public databases and reports, and the choice of genes includes a bias towards non-synonymous and promoter SNPs in genes that have been implicated in one or more cancers. The web site is searchable by gene, chromosome, gene ontology pathway and by known dbSNP ID. As of July 2003, the database contains over 3400 SNPs, 2490 of which have been sequenced in the SNP500Cancer population. For each analyzed SNP, gene location and over 200 bp of surrounding annotated sequence (including nearby SNPs) are provided, with frequency information in total and per subpopulation, and calculation of Hardy-Weinberg Equilibrium (HWE) for each subpopulation. Sequence validated SNPs with minor allele frequency > 5% are entered into a high-throughput pipeline for genotyping analysis to determine concordance for the same 102 samples. The website provides the conditions for validated genotyping assays. SNP500Cancer provides an invaluable resource for investigators to select SNPs for analysis, design genotyping assays using validated sequence data, choose selected assays already validated on one or more genotyping platforms, and select reference standards for genotyping assays. The SNP500Cancer Database is freely accessible via the web page at http://snp500cancer.nci. nih.gov/.
A Wizard of Oz Experiment for Tutorial Dialogues in Mathematics

In this paper we report on a Wizard-of-Oz (WOz) experiment which was conducted in order to collect written empirical data on mathematics tutorial dialogues in German. We present a methodological approach for optimising the gains from WOz empirical studies. We show the results of this approach from our empirical study.
Fast Near-Duplicate Video Retrieval via Motion Time Series Matching

This paper introduces a method for the efficient comparison and retrieval of near duplicates of a query video from a video database. The method generates video signatures from histograms of orientations of optical flow of feature points computed from uniformly sampled video frames concatenated over time to produce time series, which are then aligned and matched. Major incline matching, a data reduction and peak alignment method for time series, is adapted for faster performance. The resultant method is compact and robust against a number of common transformations including: flipping, cropping, picture-in-picture, photometric, addition of noise and other artifacts. We evaluate on the MUSCLE VCD 2007 dataset and a dataset derived from TRECVID 2009. Good precision (average 88.8%) at significantly higher speeds (average durations: 45 seconds for signature generation plus 92 seconds for a linear search of 81-second query video in a 300 hour dataset) than results reported in the literature are shown.
Optimal RANSAC - Towards a Repeatable Algorithm for Finding the Optimal Set

A novel idea on how to make RANSAC repeatable is presented, which will ﬁnd the optimal set in nearly every run for certain types of applications. The proposed algorithm can be used for such transformations that can be constructed by more than the minimal points required. We give examples on matching of aerial images using the Direct Linear Transformation, which requires at least four points. Moreover, we give examples on how the algorithm can be used for ﬁnding a plane in 3D using three points or more. Due to its random nature, standard RANSAC is not always able to ﬁnd the optimal set even for moderately contaminated sets and it usually performs badly when the number of inliers is less than 50%. However, our algorithm is capable of ﬁnding the optimal set for heavily contaminated sets, even for an inlier ratio under 5%. The proposed algorithm is based on several known methods, which we modify in a unique way and together they produce a result that is quite different from what each method can produce on its own.
Integer tree-based search and mixed-integer optimal control of distribution chains

The use of integer tree-based search and mixed-integer programming is investigated for the purpose of control of multi-item multi-echelon distribution chains. A discrete-time model is considered to describe the dynamics of a generic distribution chain. The decisions on the amounts of goods to transfer are made by referring to a performance index that accounts for transportation, storage, and backlog costs at two levels, i.e., strategic and tactical. As to the strategic level, a worst-case stock replenishment policy is adopted to exploit the uncertain information available on long-term predictions of the customers' demand. The solution of such a problem is obtained by using a top-down tree-based algorithm to select policy parameters such as the delivery cycle times of goods. At the tactical level, the on-line decisions on the transportation of goods are taken basing on model predictive control, which allows one to take into account recent, reliable, short-term predictions of the demand. The tactical optimal decisions are obtained by solving mixed-integer programming problems with fewer variables as compared with the strategic setting. Simulation results are presented to show the effectiveness of the proposed approach.
Web content mining using web design patterns

One of the artifacts important for reuse is design pattern. Our article concentrates on the usage of web design patterns while analyzing the structures and contents of web pages. We have created our own Pattrio method of pattern detection on web pages. The detected patterns on web pages describe the web page architecture from the external point of view of the user. The knowledge of this architecture can be used in various connections. Experiments have been presented in several conferences using the method of knowing the structure of web pages as automatically found. The article compares our approach with other selected approaches. Our comparison shows that web design patterns can play an important role in the area of analysis of web page structure and contents.
Creating an ambient intelligence network using insight and merged reality technologies

Humans live and work in environments which are essentially “dumb”, though recently, due to information networks, devices within these areas have increasingly become connected. The system presented here builds on previous work to create an ambient intelligence zone using facets of a merged reality system and a new process based on recognition/insight patterns. When combined, agents within the system communicate and react as one to form a responsive ambient intelligence at a given location.
Scalable Gaussian Processes with Billions of Inducing Inputs via Tensor Train Decomposition

We propose a method (TT-GP) for approximate inference in Gaussian Process (GP) models. We build on previous scalable GP research including stochastic variational inference based on inducing inputs, kernel interpolation, and structure exploiting algebra. The key idea of our method is to use Tensor Train decomposition for variational parameters, which allows us to train GPs with billions of inducing inputs and achieve state-of-the-art results on several benchmarks. Further, our approach allows for training kernels based on deep neural networks without any modifications to the underlying GP model. A neural network learns a multidimensional embedding for the data, which is used by the GP to make the final prediction. We train GP and neural network parameters end-to-end without pretraining, through maximization of GP marginal likelihood. We show the efficiency of the proposed approach on several regression and classification benchmark datasets including MNIST, CIFAR-10, and Airline.
Redefining similarity in a thesaurus by using corpora

The aim of this paper is to automatically define the similarity I)etween two nouns which are generally used in various domains. By these similarities, we can construct a large and general thesaurus. In applications of natural language processing, it is necessary to appropriately measure the similarity between two nouns. The similarity is usually calculated from a thesaurus. Since a handmade thesaurus is not slfitahle for machine use, and expensive to compile, automatical construction of~a thesaurus has been a t tempted using corpora (Hindle, 1990). llowever, the thesaurus constructed by such ways does not contain so many nouns, and these nouns are specified by the used corpus. In other words, we cannot construct the general thesaurus from only a corpus. This can be regarded as data sparseness problem that few nouns appear in the corpus. 9b overcome data sparseness, methods to estimate the distribution of unseen eooecurrence frorn the distribution of similar words in the seen cooccurrence has been proposed. Brown et al. proposed a class-based n-gram model, which generalizes the n-gram model, to predict a word from previous words in a text (Brown et al., 1992). They tackled data sparseness by generalizing the word to the class which contains the word. Pereira ct al. also basically used the above method, but they proposed a soft clustering scheme, in which membership of a word in a class is probabilistic (Pereira et al., 1993). Brown and Pereira provide the clustering algorithm assigning words to proper classes, based on their own models. I)agan eL al. proposed a similarity-based model in which each word is generalized, not to its own specific class, but to a set of words which are most similar to it (Dagan et al., 1993). Using this model, they successfully l)redieted which unobserved cooccurrenccs were more likely than others, and estimated the probability of the cooecurrences (Dagan et al., 1994). However, because these schemes look for similar words in the corpus, the number of similarities which we can define is rather small in comparison with the nunlber of similarities for pairs of the whole. The scheme to look for similar words in the corpus has already taken the influence of data sparseness. In this paper, we propose a method distinct from the above methods, which use a handmade thesaurus to find similar words. The proposed method avoids data sparseness by estimating undefined similarities from the similarity in the thesaurus and similarities defined by the corpus. Thus, the obtained similarities are the same in nmuber as the similarities in the thesaurus, and they reflect the particularity of the domain to which the used corpus belongs. The use of a tlmsaurus can obviously set up the similar word independent of the tort)us, and has an advantage that some ambiguities in analyzing the corpus are solved. We have experimented by using Bunrui-goihyon(Bmlrui-goi-hyon, 1994), which is a kind of Japanese handmade thesaurus, and the corpus which consists of Japanese economic newspaper 5 years articles with about 7.85 M sentences. We evaluate the appropriateness of the obtained similarities.