Miracle-dz/UniFAR-FTUs huggingface dataset:
Magnetic and FMR Study on CoFe<formula formulatype="inline"><tex Notation="TeX">$_{2}$</tex></formula>O<formula formulatype="inline"> <tex Notation="TeX">$_{4}$</tex></formula>/ZnFe<formula formulatype="inline"> <tex Notation="TeX">$_{2}$</tex></formula>O<formula formulatype="inline"> <tex Notation=

CoFe2O4/ZnFe2O4 bilayers were deposited by the pulsed laser deposition on amorphous fused quartz substrate at substrate temperature of 350°C and in oxygen pressure of 0.16 mbar. The films were studied after ex-situ annealing for 2 h in air at various temperatures up to 650°C. The magnetic properties of the bilayers were studied at 300 K and at 10 K. Ferromagnetic resonance was carried out at x-band frequencies at room temperature. It was found that as a result of annealing, the diffusion between Co ferrite and Zn ferrite starts around 350°C and leads to a large line width system having magnetization, which remains undetected by Ferromagnetic resonance.
Analysis of the average depth in a suffix tree under a Markov model

In this report, we prove that under a Markovian model of order one, the average depth of suffix trees of index n is asymptotically similar to the average depth of tries (a.k.a. digital trees) built on n independent strings. This leads to an asymptotic behavior of $(\log{n})/h + C$ for the average of the depth of the suffix tree, where $h$ is the entropy of the Markov model and $C$ is constant. Our proof compares the generating functions for the average depth in tries and in suffix trees; the difference between these generating functions is shown to be asymptotically small. We conclude by using the asymptotic behavior of the average depth in a trie under the Markov model found by Jacquet and Szpankowski ([JaSz91]).
A practical query-by-humming system for a large music database

A music retrieval system that accepts hummed tunes as queries is described in this paper. This system uses similarity retrieval because a hummed tune may contain errors. The retrieval result is a list of song names ranked according to the closeness of the match. Our ultimate goal is that the correct song should be first on the list. This means that eventually our system's similarity retrieval should allow for only one correct answer. The most significant improvement our system has over general query-by-humming systems is that all processing of musical information is done based on beats instead of notes. This type of query processing is robust against queries generated from erroneous input. In addition, acoustic information is transcribed and converted into relative intervals and is used for making feature vectors. This increases the resolution of the retrieval system compared with other general systems, which use only pitch direction information. The database currently holds over 10,000 songs, and the retrieval time is at most one second. This level of performance is mainly achieved through the use of indices for retrieval. In this paper, we also report on the results of music analyses of the songs in the database. Based on these results, new technologies for improving retrieval accuracy, such as partial feature vectors and or'ed retrieval among multiple search keys, are proposed. The effectiveness of these technologies is evaluated quantitatively, and it is found that the retrieval accuracy increases by more than 20% compared with the previous system [9]. Practical user interfaces for the system are also described.
Distributed Measurement-Aware Routing for Flow Utility in Routing Assisted Traffic Monitoring

Network-wide traffic measurement is important for various network management tasks, ranging from traffic accounting, traffic engineering, and network troubleshooting to security. The network operators are interested in monitoring passing traffic in a network for reasons of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Previous research has focused on monitor placement across the network for maximizing the monitoring utility. But, traffic characteristics and measurement objectives can change dynamically, rendering a placement of monitors suboptimal. It will not be the feasible solution to dynamically reconfigure measurement infrastructure. The problem is addressed by strategically routing traffic subpopulations over fixed monitors. This approach is referred as MeasuRouting. The challenge of MeasuRouting to work within the intradomain TE operations that are geared for utilizing bandwidth resources and meeting quality-ofservice (QoS). A feature of intradomain routing, is specified for aggregate flows which is feasible for measurouting. MeasuRouting can route the components of an total flow while ensuring that the placement of monitor is compliant to original TE objectives. In this paper, a theoretical framework for MeasuRouting and flow utility function for packet is presented.
Visually evoked responses in multiple sclerosis1

Visually evoked cerebral responses (VERs) from the occipital and central areas were compared between 50 patients with multiple sclerosis and 50 control subjects. The average peak latencies of four occipital components (OII-OV) and two central ones (CIV and CV) were significantly delayed. In no instance was the amplitude significantly different. Routine EEGs were either entirely normal (16) or showed only minor findings (10) in 26 patients. Of this group, nine showed abnormal VERs. Seventeen patients had clinical symptoms or signs which pointed to spinal cord involvement only; nonetheless, eight in this group had abnormal responses. Inasmuch as changes in visually evoked potentials are not directly dependent upon the presence of a demonstrable field defect, the technique may be useful in detecting otherwise occult cerebral lesions.
A New Algorithm for Computing One-Dimensional Stable and unstable Manifolds of Maps

A new algorithm is presented to compute one-dimensional stable and unstable manifolds of fixed points for both two-dimensional and higher dimensional diffeomorphism maps. When computing the stable manifold, the algorithm does not require the explicit expression of the inverse map. The global manifold is grown from a local manifold and one point is added at each step. The new point is located with a "prediction and correction" scheme, which avoids searching the computed part of the manifold with a bisection method and accelerates the searching process. By using the fact that the Jacobian transports derivatives along the orbit of the manifold, the tangent component of the manifold is determined and a new accuracy criterion is proposed to check whether the new point that defines the manifold is acceptable. The performance of the algorithm is demonstrated with several numerical examples.
Sample Path Derivatives for (s, S) Inventory Systems

for ( s , S ) inventory systems, we derive sample path derivatives of performance measures with respect to the two parameters s and S . These derivatives yield derivative estimators which can be estimated from a single sample path or simulation of the inventory system, in some cases not even requiring actual knowledge of the underlying demand distribution. Such derivative estimates would be useful in sensitivity analysis or in gradient-based optimization techniques. We consider the nondiscounted periodic review system with general independent and identically distributed (i.i.d.) continuous demands, full backlogging, and general holding and shortage costs. For the infinite horizon model, consistency proofs are given for some special cases, although we argue why the estimators should be correct for the more general case.
Inverse immunostaining pattern for synthesized versus endocytosed alpha‐granule proteins in human bone marrow megakaryocytes

The time of appearance and pattern of expression of several α‐granule proteins, von Willebrand factor (VWF), fibrinogen and immunoglobulins (Ig) were examined and compared in human bone marrow megakaryocytes (MK) using an immunocytochemical approach. VWF is synthesized by immature MK, whereas it has been shown that fibrinogen is incorporated from the plasma into α‐granules. The present study was undertaken in order to determine whether there are chronological and morphological differences in the expression of VWF and fibrinogen in vivo in human MK. Seven paraffin‐embedded biopsies of normal human bone marrow were labelled with specific antibodies for VWF and for fibrinogen, detected by the alkaline phosphatase anti‐alkaline phosphatase (APAAP) method, and analysed by immunomorphometry. We found a clear, statistically significant, difference in the labelling pattern of VWF and fibrinogen. The expression of other endocytosed α‐granule proteins, immunoglobulins G and A, was therefore studied in bone marrow MK from two patients with multiple myeloma, one with monoclonal IgG and one with monoclonal IgA. The immunostaining pattern was similar to that of fibrinogen and different from VWF, and characteristic of endocytosed α‐granule proteins.
Mutation of Three Residues in the Third Intracellular Loop of the Dopamine D2 Receptor Creates an Internalization-defective Receptor*

Background: Arrestin mediates G protein-independent signaling and internalization of the D2 receptor. Results: A D2 receptor mutant with modestly diminished ability to recruit arrestin and β2-adaptin did not internalize in response to agonists. Conclusion: Arrestin-mediated recruitment of receptor to AP2 is not sufficient for internalization. Significance: Receptor mutants lacking specific functions are tools for analysis of signaling mechanisms. Arrestins mediate desensitization and internalization of G protein-coupled receptors and also direct receptor signaling toward heterotrimeric G protein-independent signaling pathways. We previously identified a four-residue segment (residues 212–215) of the dopamine D2 receptor that is necessary for arrestin binding in an in vitro heterologous expression system but that also impairs receptor expression. We now describe the characterization of additional mutations at that arrestin binding site in the third intracellular loop. Mutating two (residues 214 and 215) or three (residues 213–215) of the four residues to alanine partially decreased agonist-induced recruitment of arrestin3 without altering activation of a G protein. Arrestin-dependent receptor internalization, which requires arrestin binding to β2-adaptin (the β2 subunit of the clathrin-associated adaptor protein AP2) and clathrin, was disproportionately affected by the three-residue mutation, with no agonist-induced internalization observed even in the presence of overexpressed arrestin or G protein-coupled receptor kinase 2. The disjunction between arrestin recruitment and internalization could not be explained by alterations in the time course of the receptor-arrestin interaction, the recruitment of G protein-coupled receptor kinase 2, or the receptor-induced interaction between arrestin and β2-adaptin, suggesting that the mutation impairs a property of the internalization complex that has not yet been identified.
Chosen-ciphertext secure proxy re-encryption

In a proxy re-encryption (PRE) scheme, a proxy is given special information that allows it to translate a ciphertext under one key into a ciphertext of the same message under a different key. The proxy cannot, however, learn anything about the messages encrypted under either key. PRE schemes have many practical applications, including distributed storage, email, and DRM. Previously proposed re-encryption schemes achieved only semantic security; in contrast, applications often require security against chosen ciphertext attacks. We propose a definition of security against chosen ciphertext attacks for PRE schemes, and present a scheme that satisfies the definition. Our construction is efficient and based only on the Decisional Bilinear Diffie-Hellman assumption in the standard model. We also formally capture CCA security for PRE schemes via both a game-based definition and simulation-based definitions that guarantee universally composable security. We note that, simultaneously with our work, Green and Ateniese proposed a CCA-secure PRE, discussed herein.
Electricity Forecasting Using Multi-Stage Estimators of Nonlinear Additive Models

French electricity load forecasting has encountered major changes during the past decade. These changes are, among other things, due to the opening of the electricity market and the economic crisis, which require the development of new automatic time adaptive prediction methods. The advent of innovating technologies also needs the development of some automatic methods because thousands or tens of thousands of time series have to be studied. In this paper we adopt for prediction a semi-parametric approach based on additive models. We present an automatic procedure for explanatory variable selection in an additive model and show how to correct middle term forecasting errors for short term forecasting. First, we consider an application to the EDF customer load demand which is typical of a load demand at an aggregate level. The goal of the application is to select variables from a large explanatory variables dictionary. The second application presented is an application on load demand of GEFCom 2012 competition, which we consider as a local application, where a major difficulty is to select some meteorological stations.
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions

We show that the combinatorial complexity of the. union of n "fat" tetrahedra in 3-space (i.e., tetrahedra all of whose solid angles are at least .some fixed constant) of arbitrary sizes, is O(n2+epsiv),for any epsiv > 0: the bound is almost tight in the worst case, thus almost settling a conjecture of Pach el al. [24]. Our result extends, in a significant way, the result of Pach et al. [24] for the restricted case of nearly congruent cubes. The analysis uses cuttings, combined with the Dobkin-K'irkpatrick hierarchical decomposition of convex polytopes, in order to partition space into subcells, so that, on average, the overwhelming majority of the tetrahedra intersecting a subcell Delta behave as fat dihedral wedges in Delta. As an immediate corollary, we obtain that the combinatorial complexity of the union of n cubes in R3 having arbitrary side lengths, is O(n2+epsiv), for any epsiv > 0 again, significantly extending the result of [24]. Our analysis can easily he extended to yield a nearly-quadratic bound on the complexity of the union of arbitrarily oriented fat triangular prisms (whose cross-sections have, arbitrary sizes) in R3. Finally, we show that a simple variant of our analysis implies a nearly-linear bound on the complexity of the union of fat triangles in the plane.
Tracking-based moving object detection

We present a novel approach for multi-object detection in aerial videos based on tracking. The proposed method mainly involves four steps. Firstly, both the motion history image and the tracking trajectory are employed to extract candidate target regions. Secondly, the spatial-temporal saliency is used to detect moving objects in the candidate regions. Thirdly, the previous detected objects are tracked by mean shift in the current frame. And finally, the detection results are fused with the tracking results to get refined detection results, in turn the modified detection results are used to update the tracking models. The proposed algorithm is evaluated on VIVID aerial videos, and the results show that our approach can reliably detect moving objects even in challenging situations. Meanwhile, the proposed method can process videos in real time, without the effect of time delay.
Improvements in Speech Understanding With Wireless Binaural Broadband Digital Hearing Instruments in Adults With Sensorineural Hearing Loss

This investigation examined whether speech intelligibility in noise can be improved using a new, binaural broadband hearing instrument system. Participants were 36 adults with symmetrical, sensorineural hearing loss (18 experienced hearing instrument users and 18 without prior experience). Participants were fit binaurally in a planned comparison, randomized crossover design study with binaural broadband hearing instruments and advanced digital hearing instruments. Following an adjustment period with each device, participants underwent two speech-in-noise tests: the QuickSIN and the Hearing in Noise Test (HINT). Results suggested significantly better performance on the QuickSIN and the HINT measures with the binaural broadband hearing instruments, when compared with the advanced digital hearing instruments and unaided, across and within all noise conditions.
Hybrid Markov Logic Networks

Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent framework. However, in MLNs all variables and features are discrete, while most real-world applications also contain continuous ones. In this paper we introduce hybrid MLNs, in which continuous properties (e.g., the distance between two objects) and functions over them can appear as features. Hybrid MLNs have all distributions in the exponential family as special cases (e.g., multivariate Gaussians), and allow much more compact modeling of non-i.i. d. data than propositional representations like hybrid Bayesian networks. We also introduce inference algorithms for hybrid MLNs, by extending the MaxWalkSAT and MC-SAT algorithms to continuous domains. Experiments in a mobile robot mapping domain--involving joint classification, clustering and regression--illustrate the power of hybrid MLNs as a modeling language, and the accuracy and efficiency of the inference algorithms.
Matrix-mediated canal formation in primmorphs from the sponge Suberites domuncula involves the expression of a CD36 receptor-ligand system

Sponges (Porifera), represent the phylogenetically oldest metazoan phylum still extant today. Recently, molecular biological studies provided compelling evidence that these animals share basic receptor/ligand systems, especially those involved in bodyplan formation and in immune recognition, with the higher metazoan phyla. An in vitro cell/organ-like culture system, the primmorphs, has been established that consists of proliferating and differentiating cells, but no canals of the aquiferous system. We show that after the transfer of primmorphs from the demosponge Suberites domuncula to a homologous matrix (galectin), canal-like structures are formed in these 3D-cell aggregates. In parallel with the formation of these structures a gene is expressed whose deduced protein falls into the CD36/LIMPII receptor family. The receptor was cloned and found to be strongly expressed after adhesion to the galectin matrix. This process was suppressed if primmorphs were co-incubated with a homologous polypeptide containing the CSVTCG domain, as found in thrombospondin-1 (and related) molecules of vertebrates. In situ hybridization studies revealed that the S. domuncula CD36/LIMPII receptor is localized in the pinacocytes that surround the canals of the sponge. Furthermore, a secondary metabolite from a sponge-associated bacterium was isolated and characterized, the 2-methylthio-1,4-naphthoquinone (MTN). MTN causes inhibition of cell proliferation of vertebrate tumor cells at concentrations of >80 ng/ml. However, doses of only 2 ng are required to potently inhibit angiogenesis in the chick chorio-allantoic membrane assay. At concentrations of 10 ng/ml this compound was also found to suppress the expression of the S. domuncula CD36/LIMPII; this result is a first indication that this secondary metabolite has a conserved functional activity: the suppression of the formation of the circulation system, from sponges to vertebrates.
Proof of concept for microarray-based detection of DNA-binding oncogenes in cell extracts

The function of DNA-binding proteins is controlled not just by their abundance, but mainly at the level of their activity in terms of their interactions with DNA and protein targets. Moreover, the affinity of such transcription factors to their target sequences is often controlled by co-factors and/or modifications that are not easily assessed from biological samples. Here, we describe a scalable method for monitoring protein–DNA interactions on a microarray surface. This approach was designed to determine the DNA-binding activity of proteins in crude cell extracts, complementing conventional expression profiling arrays. Enzymatic labeling of DNA enables direct normalization of the protein binding to the microarray, allowing the estimation of relative binding affinities. Using DNA sequences covering a range of affinities, we show that the new microarray-based method yields binding strength estimates similar to low-throughput gel mobility-shift assays. The microarray is also of high sensitivity, as it allows the detection of a rare DNA-binding protein from breast cancer cells, the human tumor suppressor AP-2. This approach thus mediates precise and robust assessment of the activity of DNA-binding proteins and takes present DNA-binding assays to a high throughput level.
A Comparison of Static Architecture Compliance Checking Approaches

The software architecture is one of the most important artifacts created in the lifecycle of a software system. It enables, facilitates, hampers, or interferes directly the achievement of business goals, functional and quality requirements. One instrument to determine how adequate the architecture is for its intended usage is architecture compliance checking. This paper compares three static architecture compliance checking approaches (reflexion models, relation conformance rules, and component access rules) by assessing their applicability in 13 distinct dimensions. The results give guidance on when to use which approach.
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield linear programming (LP) relaxations of exponential size, over which it is not known how to optimize exactly in polynomial time. In this paper we address this issue and obtain LP relaxations of quasi-polynomial size that are at least as strong as that given by the knapsack cover inequalities. For the min-knapsack cover problem, our main result can be stated formally as follows: for any e > 0, there is a (1/e)O(1) nO(log n)-size LP relaxation with an integrality gap of at most 2 + e, where n is the number of items. Prior to this work, there was no known relaxation of subexponential size with a constant upper bound on the integrality gap. Our construction is inspired by a connection between extended formulations and monotone circuit complexity via Karchmer-Wigderson games. In particular, our LP is based on O(log2 n)-depth monotone circuits with fan-in 2 for evaluating weighted threshold functions with n inputs, as constructed by Beimel and Weinreb. We believe that a further understanding of this connection may lead to more positive results complementing the numerous lower bounds recently proved for extended formulations.