Miracle-dz/UniFAR-FTUs huggingface dataset:
A Fully Differential CMOS–MEMS DETF Oxide Resonator With $Q > \hbox{4800}$ and Positive TCF

A fully differential CMOS-MEMS double-ended tuning-fork (DETF) oxide resonator fabricated using a 0.18-μm CMOS process has been demonstrated with a Q greater than 4800 and more-than-20-dB stopband rejection at 10.4 MHz. The key to attaining such a performance attributes to the use of oxide structures with embedded metal electrodes, where SiO2 offers a Q enhancement (at least a 3-times-higher Q) as compared to other CMOS-MEMS-based composite resonators with similar structures and vibrating modes and where flexible electrical routing facilitates fully differential configuration to suppress capacitive feedthroughs. In addition, the resonators developed in this work possess a positive temperature coefficient of frequency (TCf) and mode-splitting capability, therefore indicating a great potential for temperature compensation and spurious-mode suppression, respectively. This technology paves a way to realize fully integrated CMOS-MEMS oscillators and filters which might benefit future single-chip transceivers for wireless communications.
Improvement of multilateration (MLAT) accuracy and convergence for airport surveillance

We study, evaluate and develop the use of regularization methods to solve the location problem in multilateration systems using Mode-S signals. The Tikhonov method has been implemented as a first application to solve the classical system of hyperbolic equations in multilateration systems. Some simulations are obtained and the results are compared with those obtained by the well established Taylor linearization and with the Cramér-Rao Lower Bound analysis. Significant improvements are found for the application of Tikhonov method.
Unified Development of Multiplicative Algorithms for Linear and Quadratic Nonnegative Matrix Factorization

Multiplicative updates have been widely used in approximative nonnegative matrix factorization (NMF) optimization because they are convenient to deploy. Their convergence proof is usually based on the minimization of an auxiliary upper-bounding function, the construction of which however remains specific and only available for limited types of dissimilarity measures. Here we make significant progress in developing convergent multiplicative algorithms for NMF. First, we propose a general approach to derive the auxiliary function for a wide variety of NMF problems, as long as the approximation objective can be expressed as a finite sum of monomials with real exponents. Multiplicative algorithms with theoretical guarantee of monotonically decreasing objective function sequence can thus be obtained. The solutions of NMF based on most commonly used dissimilarity measures such as α - and β-divergence as well as many other more comprehensive divergences can be derived by the new unified principle. Second, our method is extended to a nonseparable case that includes e.g., γ-divergence and Rényi divergence. Third, we develop multiplicative algorithms for NMF using second-order approximative factorizations, in which each factorizing matrix may appear twice. Preliminary numerical experiments demonstrate that the multiplicative algorithms developed using the proposed procedure can achieve satisfactory Karush-Kuhn-Tucker optimality. We also demonstrate NMF problems where algorithms by the conventional method fail to guarantee descent at each iteration but those by our principle are immune to such violation.
Performance analysis of a selective encryption algorithm for wireless ad hoc networks

Symmetric key algorithms are a typically efficient and fast cryptosystem, so it has significant applications in many realms. For a wireless ad hoc network with constraint computational resources, the cryptosystem based on symmetric key algorithms is extremely suitable for such an agile and dynamic environment, along with other security strategies. In this paper, we introduce the concept of selective encryption into the design of data protection mechanisms. First, we present the principle of selective encryption and propose a probabilistically selective encryption algorithm based on symmetric key. By utilizing probabilistic methodology and stochastic algorithm, a sender includes proper uncertainty in the process of message encryption, so that only entrusted receiver can decrypt the ciphertext and other unauthorized nodes have no knowledge of the transmitted messages on the whole. In addition, we also employ other security mechanisms to enhance the security of our proposed scheme. Eventually, we carry out an extensive set of simulation experiments based on ns2 simulator, and our simulation indicates that the technique of selective algorithms can indeed improve the efficiency of message encryption.
Early mesodermal phenotypes in splotch suggest a role for Pax3 in the formation of epithelial somites

The paired box containing transcription factor Pax3 is a crucial regulator of dermomyotome and muscle development. However, the allelic series of Pax3/Splotch mutants also displays characteristic vertebral column malformations, which do not result from defective dorsoventral somite pattern. Rather, vertebral column and sclerotomal phenotypes are reminiscent of the phenotypes observed in the segmentation/somitogenesis mutants rachiterata and pudgy. Moreover, rostrocaudal somite pattern and somitic boundaries are disturbed in Splotch as monitored by the expression of Uncx4.1 and Lunatic fringe. Alterations in EphA4, Dll1, and Uncx4.1 expression are evident already in the condensing paraxial mesoderm, correlating with the first phase of Pax3 expression before and during somite formation. This finding suggests an early function of Pax3 during the formation of epithelial somites. © 2001 Wiley‐Liss, Inc.
Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets

We examine several (dynamic) graph and set intersection problems in the word-RAM model with word size $w$. We begin with Dynamic Connectivity where we need to maintain a fully dynamic graph $G=(V,E)$ with $n=|V|$ vertices while supporting $(s,t)$-connectivity queries. To do this, we provide a new simplified worst-case solution for the famous Dynamic Connectivity (which is interesting on its own merit), and then show how in the word-RAM model the query and update cost can be reduced to $O(\sqrt{n\frac{\log n}{w}\log(\frac{w}{\log n})})$, assuming $w < n^{1-\Omega(1)}$. Since $w=\Omega(\log n)$, this bound is always $O(\sqrt{n})$ and it is $o(\sqrt{n})$ when $w=\omega(\log n)$. We then examine the task of maintaining a family $F$ of dynamic sets where insertions and deletions into the sets are allowed, while enabling a set intersection reporting queries on sets from $F$. We first show that given a known upper-bound $d$ on the size of any set, we can maintain $F$ so that a set intersection reporting query costs $O(\frac{d}{w/log^2 w})$ expected time, and updates cost $O(\log w)$ expected time. Using this algorithm we can list all triangles of a graph $G=(V,E)$ in $O(\frac{m\alpha}{w/log^2 w} +t)$ expected time where $m=|E|$, $\alpha$ is the arboricity of $G$, and $t$ is the size of the output. This is comparable with known algorithms that run in $O(m \alpha)$ time. Next, we provide an incremental data structure on $F$ that supports intersection proof queries where two sets that intersect must return an element in the intersection. Both queries and insertions of elements into sets take $O(\sqrt \frac{N}{w/log^2 w})$ expected time, where $N=\sum_{S\in F} |S|$. Finally, we provide time/space tradeoffs for the fully dynamic set intersection listing problem.
Local Search for the Colouring Graph Problem . A Computational Study .

The Graph Colouring Problem (GCP) is a well known NP-hard problem with many theoretical and practical applications. In this paper we introduce a new local search algorithm based on a very large scale neighbourhood. We provide an extensive numerical comparison between this method and several other local search techniques considering also the embedding of the local search into more complex schemes like Iterated Local Search or Tabu Search.
A Perturbative Solution to Plane Wave Scattering From a Rough Dielectric Cylinder

We present an analytical, second-order perturbative solution to the problem of electromagnetic plane-wave scattering from a dielectric cylinder with a randomly rough surface. In contrast to previous integral equation-based approaches, we perturb the electromagnetic boundary conditions at the cylinder interface. Doing so affords us tractable expressions for the fields internal and external to the cylinder. We validate our results by comparing them with rigorous, but computationally intensive solutions obtained from the method of moments, and numerically estimate a region of validity for our results. We report this region as h0 <; λ/20 and l > 4 h0, where h0 and l are the root-mean-square surface roughness and surface correlation length, respectively, for scattering at a wavelength λ.
“Not not bad” is not “bad”: A distributional account of negation

With the increasing empirical success of distributional models of compositional semantics, it is timely to consider the types of textual logic that such models are capable of capturing. In this paper, we address shortcomings in the ability of current models to capture logical operations such as negation. As a solution we propose a tripartite formulation for a continuous vector space representation of semantics and subsequently use this representation to develop a formal compositional notion of negation within such models.
A study of the internal and external effects of concurrency bugs

Concurrent programming is increasingly important for achieving performance gains in the multi-core era, but it is also a difficult and error-prone task. Concurrency bugs are particularly difficult to avoid and diagnose, and therefore in order to improve methods for handling such bugs, we need a better understanding of their characteristics. In this paper we present a study of concurrency bugs in MySQL, a widely used database server. While previous studies of real-world concurrency bugs exist, they have centered their attention on the causes of these bugs. In this paper we provide a complementary focus on their effects, which is important for understanding how to detect or tolerate such bugs at run-time. Our study uncovered several interesting facts, such as the existence of a significant number of latent concurrency bugs, which silently corrupt data structures and are exposed to the user potentially much later. We also highlight several implications of our findings for the design of reliable concurrent systems.
A generalized formulation for harmonic retrieval in correlated noise

In this paper we develop a generalized formulation for harmonic retrieval in correlated noise. Well-known spatial smoothing-based ESPRIT and the Matrix Pencil methods are important special cases of the proposed formulation. The connection between these methods is established analytically. The proposed generalized formulation is applicable to single-snapshot scenarios with arbitrary noise covariance matrix. Moreover, a numerical study is included showing that the Matrix Pencil method is robust to mismodeling of the noise covariance matrix.
Representative pattern extraction for nucleotide sequence groups using base frequency differences

Advances in high-throughput technology in molecular biology have been producing lots of sequence data on various organisms. Some organisms like virus have various variances in their nucleotide sequences and could be categorized into several subtypes. A sequential pattern which characterizes a subtype and discriminates it from other subtypes is called signature. This paper proposes a method which extracts signature from a collection of sequences data. Based on position specific relative base frequency deference between one subtype data set and the other subtype data set, the proposed method examines discrimination capabilities for the potential signatures. A tool has been developed which implements the proposed method and applied to an experiment to extract signatures for HIV-1 virus subtypes.
A novel graph reduction algorithm to identify structural conflicts

The algorithm is based on a set of graph reduction rules to identify the deadlock and lack of synchronization conflicts that could compromise the correct execution of a workflow. However, an example, which is apparently correct but cannot be reduced by the rules, shows the incompleteness of the algorithm. In this paper, we present a complete and minimal set of rules and a novel algorithm to implement the identification of structural conflicts in process models. The correctness and completeness of the algorithm is strictly proved. Finally, the complexity of the algorithm is analyzed.
Evaluation of poly(etheretherketone) for use as innovative material in the fabrication of a removable partial denture framework

Since the 1930s, partial denture frameworks have generally been made from metallic alloys and resin polymers such as Cobalt-Chromium (Co-Cr) and Polymethylmethacrylate (PMMA). However, the main limitations of these materials over the last 15 years are related to their biocompatibility, long term performance and it seems neither of these materials meets the ideal properties for satisfactory results for long standing applications. Polyetheretherketone (PEEK) as a new thermoplastic polymer has been successfully used for medical purposes due to outstanding mechanical properties, thermal and chemical stability in implantations. PEEK shows promise for use instead of metals inside the human body. The aim of this study is to evaluate PEEK polymer as an alternative material for use in the fabrication of removable partial denture frameworks. Initially the evaluation was by denture injection moulding method to explore the material’s physical properties, and then with CAD/CAM techniques the mechanical properties were investigated to consider these findings for design considerations. Clasps were then designed and the retentive force tested with thermo-cycling fatigue representing 3 years of insertion/removal. The significant findings of this study relate to its demonstration of the superior mechanical properties of PEEK polymer as a denture base material compared to PMMA, and the exceptional retentive force of the innovative clasp design at different tooth undercuts compared to the conventional Co-Cr clasp design. In conclusion, these study findings indicate the promise offered by PEEK thermoplastic polymer for future use as a denture material.
Development and Characterization of a Cloned Rat Pulmonary Arterial Smooth Muscle Cell Line That Maintains Differentiated Properties Through Multiple Subcultures

BackgroundPulmonary hypertension is associated with abnormal pulmonary arterial contractility and growth. The mechanisms for these abnormalities are largely unknown. To study these processes, we sought to develop an in vitro system. Even though cultured aortic and pulmonary artery smooth muscle cells (SMCs) have been of considerable value in studying smooth muscle biology, one drawback of this system has been that these cells often lose differentiated properties in an unpredictable manner when they are passaged in culture. In addition, there appear to be significant differences in physiological and pathological responses between the systemic and pulmonary circulations, many of which could be directly related to the smooth muscle. We therefore established a cloned population of rat pulmonary arterial SMCs (PASMCs) that maintain differentiated properties through multiple subcultures. Methods and ResultsPASMCs were obtained initially by enzymatic dissociation from pulmonary arteries of adult Sprague-Dawley rats. From these cells, clones were isolated. The cloned cells retained expression of functional surface receptors for angiotensin II, norepinephrine, and α-thrombin and high levels of the smooth muscle isoforms of α-actin, myosin heavy chain, myosin regulatory light chain, and α-tropomyosin mRNAs even after multiple passages. The cells could also be transfected and processed exogenous transcripts in a smooth muscle-specific fashion. ConclusionsThese cloned PASMCs retain many differentiated characteristics and should be valuable for future studies of pulmonary vascular smooth muscle cell biology.
Novel Bacteriophages Containing a Genome of Another Bacteriophage within Their Genomes

A novel bacteriophage infecting Staphylococus pasteuri was isolated during a screen for phages in Antarctic soils. The phage named SpaA1 is morphologically similar to phages of the family Siphoviridae. The 42,784 bp genome of SpaA1 is a linear, double-stranded DNA molecule with 3′ protruding cohesive ends. The SpaA1 genome encompasses 63 predicted protein-coding genes which cluster within three regions of the genome, each of apparently different origin, in a mosaic pattern. In two of these regions, the gene sets resemble those in prophages of Bacillus thuringiensis kurstaki str. T03a001 (genes involved in DNA replication/transcription, cell entry and exit) and B. cereus AH676 (additional regulatory and recombination genes), respectively. The third region represents an almost complete genome (except for the short terminal segments) of a distinct bacteriophage, MZTP02. Nearly the same gene module was identified in prophages of B. thuringiensis serovar monterrey BGSC 4AJ1 and B. cereus Rock4-2. These findings suggest that MZTP02 can be shuttled between genomes of other bacteriophages and prophages, leading to the formation of chimeric genomes. The presence of a complete phage genome in the genome of other phages apparently has not been described previously and might represent a ‘fast track’ route of virus evolution and horizontal gene transfer. Another phage (BceA1) nearly identical in sequence to SpaA1, and also including the almost complete MZTP02 genome within its own genome, was isolated from a bacterium of the B. cereus/B. thuringiensis group. Remarkably, both SpaA1 and BceA1 phages can infect B. cereus and B. thuringiensis, but only one of them, SpaA1, can infect S. pasteuri. This finding is best compatible with a scenario in which MZTP02 was originally contained in BceA1 infecting Bacillus spp, the common hosts for these two phages, followed by emergence of SpaA1 infecting S. pasteuri.
Alcohol-Based Handrub: Evaluation of Technique and Microbiological Efficacy with International Infection Control Professionals

Abstract Background And Objective: The Centers for Disease Control and Prevention has published a new guideline on hand hygiene promoting the use of the alcohol-based handrub, but the technique was not addressed. The goal of this study was to evaluate the influence of technique on the efficacy of the alcohol-based handrub. Participants: Healthcare workers (HCWs) attending a course in hospital epidemiology. Methods: A fluorescent dye was added to a hand antiseptic, and hands were checked under ultraviolet light after antiseptic cleansing. Data regarding the numbers of predefined fluorescent areas on the skin were collected in addition to demographic data such as age, gender, job description, and job experience. Results of the visualization test were compared with the data from microbiological samples before and after the procedure by the hand plate technique. Results: Sixty HCWs were tested, 63% of whom had worked in infection control for more than 10 years. Sixty-six percent of all participants still had detectable bacteria after antisepsis. The mean log10 CFU reduction was 2.0 (range, 0–3.85). Twenty-five percent of all HCWs achieved less than 1.1 log10 CFU. Staphylococcus aureus was isolated from 13% (one of them being methicillin resistant) and gram-negative bacilli from 6.7%. After using the alcohol handrub, one subject still remained positive for S. aureus. Years of experience was the single most important factor predicting antimicrobial efficacy. Conclusions: Technique is of crucial importance in hand antisepsis. Major deficiencies were detected among even highly trained HCWs. Training should be provided before switching from handwashing to the alcohol handrub.
A Baseline Wander Tracking System for Artifact Rejection in Long-Term Electrocardiography

Long-term electrocardiogram (ECG) signals might suffer from relevant baseline disturbances during physical activity. Motion artifacts in particular are more pronounced with dry surface or esophageal electrodes which are dedicated to prolonged ECG recording. In this paper we present a method called baseline wander tracking (BWT) that tracks and rejects strong baseline disturbances and avoids concurrent saturation of the analog front-end. The proposed algorithm shifts the baseline level of the ECG signal to the middle of the dynamic input range. Due to the fast offset shifts, that produce much steeper signal portions than the normal ECG waves, the true ECG signal can be reconstructed offline and filtered using computationally intensive algorithms. Based on Monte Carlo simulations we observed reconstruction errors mainly caused by the non-linearity inaccuracies of the DAC. However, the signal to error ratio of the BWT is higher compared to an analog front-end featuring a dynamic input ranges above 15 mV if a synthetic ECG signal was used. The BWT is additionally able to suppress (electrode) offset potentials without introducing long transients. Due to its structural simplicity, memory efficiency and the DC coupling capability, the BWT is dedicated to high integration required in long-term and low-power ECG recording systems.
SCOPEC: a database of protein catalytic domains

MOTIVATION Domains are the units of protein structure, function and evolution. It is therefore essential to utilize knowledge of domains when studying the evolution of function, or when assigning function to genome sequence data. For this purpose, we have developed a database of catalytic domains, SCOPEC, by combining structural domain information from SCOP, full-length sequence information from Swiss-Prot, and verified functional information from the Enzyme Classification (EC) database. Two major problems need to be overcome to create a database of domain-function relationships; (1) for sequences, EC numbers are typically assigned to whole sequences rather than the functional unit, and (2) The Protein Data Bank (PDB) structures elucidated from a larger multi-domain protein will often have EC annotation although the relevant catalytic domain may lie elsewhere. RESULTS SCOPEC entries have high quality enzyme assignments; having passed both computational and manual checks. SCOPEC currently contains entries for 75% of all EC annotations in the PDB. Overall, EC number is fairly well conserved within a superfamily, even when the proteins are distantly related. Initial analysis is encouraging; suggesting that there is a 50:50 chance of conserved function in distant homologues first detected by a third iteration PSI-BLAST search. Therefore, we envisage that a knowledge-based approach to function assignment using the domain-EC relationships in SCOPEC will gain a marked improvement over this base line. AVAILABILITY The SCOPEC database is a valuable resource in the analysis and prediction of protein structure and function. It can be obtained or queried at our website http://www.enzome. com