Miracle-dz/UniFAR-FTUs huggingface dataset:
Guided implant surgery and immediate implant placement in esthetic zone

With the introduction of digital imaging techniques such as computerized tomography (CT) and lately cone beam computed tomography (CBCT), anatomical structures of the oral and maxillofacial region can be appreciated in three dimensions. The aim of this article is to familiarize clinicians with a workflow for guided implant surgery based on the use of CBCT and intraoral scanner in case of immediate implant placement. A CBCT was recorded for the patient and a digital impression was registered using an intraoral scanner (Lava COS). Codiagnostix® software was used for the coupling of cone beam computed tomography (CBCT) and intraoral scan data and virtual treatment planning. Ideal implant position and suprastructure were planned by digitally integrating the anatomic situations and future prosthetic demands. In the present case, digital planning software and fabricated surgical guide were beneficial in accurate immediate implant placement in the esthetic zone. The positioning of implants is more precise with guided implant surgery which will help clinicians to achieve prosthetically driven implant placement as it offers many advantages in terms of favorable esthetic, desirable occlusion, phonetics, and long-term peri-implant hard and soft tissues stability.
Verification of a cryptographic circuit : SHA-1 using ACL 2 ∗

Our study was motivated by a cooperative project aiming at the design and verification of a circuit for secure communications between a computer and a terminal smart card reader. A SHA-1 component is included in the circuit. SHA-1 is a cryptographic primive that produces for any message, a 160 bits signature, called message digest. We automatically produce the ACL2 model for the VHDL RTL design, and apply a stepwise approach to prove theorems about each computation step, using intermediate digest functions. These functions are proven compliant with the functional specification of SHA-1.
Facial animation with motion capture based on surface blending

This paper proposes a methodology to reconstruct 3D facial expressions with motion capture data. Featurepoint based facial animation provides easy control of expression usually by moving surface points using mathematical deformation. However it does not support the high quality of surface animation of the face where the feature points are not present. In this paper, we focus on animating a 3D facial model using only feature points, but keeping the high quality animation by using an expression databank obtained from surface scanning. Firstly, a facial expression databank is prepared by processing the raw laser-scanned human face data with a consistent parameterization technique. Secondly, sparse motion capture data is obtained using an optical tracking system. Thirdly, guided by the captured MPEG-4 feature point motions, we find the corresponding surface information in the existing examples in the databank by linear combination of them. The optimized blending weights are obtained implicitly by Genetic Algorithms (GA). Finally, the surface blending result is retargeted into the performer’s neutral facial mesh. Consequently, motions of the facial surface points are reconstructed.
Calculation method of dynamic loads spectrum and effects on fatigue damage of a full-scale carbody for high-speed trains

With the wide application of ballastless track on high-speed railway, the load on the structure of the high-speed train exhibits the characteristics of high frequency and small amplitude. It is the key to analyse the time–frequency characteristics of the track spectrum and to study the efficient and accurate calculation method of the carbody load spectrum. First, the time domain signal estimation of the existing track power spectral density function is carried out, and the influence of the upper and lower limits of different sampling frequencies on the time domain characteristics of the track spectrum is compared and analysed. The frequency response function of vehicle system is calculated by establishing the vehicle vertical system dynamics model. Then it is combined with the track power spectrum density function to calculate the vertical load power spectrum of the carbody, and the carbody load spectrum is obtained through time–frequency domain signal conversion. And the longitudinal load of the carbody is calculated based on the traction braking characteristics of the high-speed train. Finally, the carbody mode is calculated, and then the modal response is used as an excitation to obtain the dynamic stress time history of each node. Combine them with Miner's linear damage accumulation theory to obtain carbody damage. Thereby, the influence of longitudinal load on the fatigue damage of the carbody is compared and analysed.
Stability of dense liquid carbon dioxide

We present ab initio calculations of the phase diagram of liquid CO2 and its melting curve over a wide range of pressure and temperature conditions, including those relevant to the Earth. Several distinct liquid phases are predicted up to 200 GPa and 10,000 K based on their structural and electronic characteristics. We provide evidence for a first-order liquid–liquid phase transition with a critical point near 48 GPa and 3,200 K that intersects the mantle geotherm; a liquid–liquid–solid triple point is predicted near 45 GPa and 1,850 K. Unlike known first-order transitions between thermodynamically stable liquids, the coexistence of molecular and polymeric CO2 phases predicted here is not accompanied by metallization. The absence of an electrical anomaly would be unique among known liquid–liquid transitions. Furthermore, the previously suggested phase separation of CO2 into its constituent elements at lower mantle conditions is examined by evaluating their Gibbs free energies. We find that liquid CO2 does not decompose into carbon and oxygen up to at least 200 GPa and 10,000 K.
Advertising Blindness : The New Banner Blindness ?

Copyright © 2010-2011, Usability Professionals’ Association and the authors. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. URL: http://www.usabilityprofessionals. org. Text Advertising Blindness: The New Banner Blindness?
A knowledge construction methodology to automate case‐based learning using clinical documents

The case‐based learning (CBL) approach has gained attention in medical education as an alternative to traditional learning methodology. However, current CBL systems do not facilitate and provide computer‐based domain knowledge to medical students for solving real‐world clinical cases during CBL practice. To automate CBL, clinical documents are beneficial for constructing domain knowledge. In the literature, most systems and methodologies require a knowledge engineer to construct machine‐readable knowledge. Keeping in view these facts, we present a knowledge construction methodology (KCM‐CD) to construct domain knowledge ontology (i.e., structured declarative knowledge) from unstructured text in a systematic way using artificial intelligence techniques, with minimum intervention from a knowledge engineer. To utilize the strength of humans and computers, and to realize the KCM‐CD methodology, an interactive case‐based learning system(iCBLS) was developed. Finally, the developed ontological model was evaluated to evaluate the quality of domain knowledge in terms of coherence measure. The results showed that the overall domain model has positive coherence values, indicating that all words in each branch of the domain ontology are correlated with each other and the quality of the developed model is acceptable.
A Neural Network Approach For Long-Term Software MTTF Prediction

Accurate prediction of software MTTF (Mean Time To Failure) is necessary in critical applications. This paper presents the prediction of long-term MTTF using neural network. The proposed method is to learn a sequence of cumulative observation time and the corresponding observed accumulated failures up to the present testing time. The results obtained through proposed method were compared with CASRE (Computer-Aided Software Reliability Estimation) tool. It is observed that information provided by the proposed method is more meaningful as compared to existing methods.
Clinical Evaluation of a Semipermeable Polymeric Membrane Dressing for the Treatment of Chronic Diabetic Foot Ulcers

OBJECTIVE To evaluate the utility of a semipermeable polymeric membrane dressing for the treatment of chronic diabetic foot ulcers. RESEARCH DESIGN AND METHODS Nineteen subjects with either insulin- dependent diabetes mellitus (IDDM) or non-insulin-dependent diabetes mellitus (NIDDM) and foot ulcers were randomly assigned to the polymeric dressing or conventional wet-to-dry saline dressings. Subjects had foot ulcer site measurements performed every 3 weeks. The subjects using conventional therapy were allowed to cross over to polymeric dressing after 2 months. RESULTS At the end of 2 months, in the patients using the polymeric dressing, ulcer size was reduced to 35 ± 16% of baseline. The patients on conventional therapy had an ulcer size of 105 ± 28% of baseline (P < 0.03, polymeric vs. conventional). Patients initially treated with wet-to-dry saline were crossed over into the polymeric membrane treatment and demonstrated a decrease to 35 ± 11% of baseline size (P < 0.02) after an additional 2 months. CONCLUSIONS The semipermeable polymeric membrane dressing is a useful therapeutic option for treating uncomplicated chronic diabetic foot ulcers.
Differential Impairment of Catecholaminergic Cell Maturation and Survival by Genetic Mitochondrial Complex II Dysfunction

ABSTRACT The SDHD gene (subunit D of succinate dehydrogenase) has been shown to be involved in the generation of paragangliomas and pheochromocytomas. Loss of heterozygosity of the normal allele is necessary for tumor transformation of the affected cells. As complete SdhD deletion is lethal, we have generated mouse models carrying a “floxed” SdhD allele and either an inducible (SDHD-ESR strain) or a catecholaminergic tissue-specific (TH-SDHD strain) CRE recombinase. Ablation of both SdhD alleles in adult SDHD-ESR mice did not result in generation of paragangliomas or pheochromocytomas. In contrast, carotid bodies from these animals showed smaller volume than controls. In accord with these observations, the TH-SDHD mice had decreased cell numbers in the adrenal medulla, carotid body, and superior cervical ganglion. They also manifested inhibited postnatal maturation of mesencephalic dopaminergic neurons and progressive cell loss during the first year of life. These alterations were particularly intense in the substantia nigra, the most affected neuronal population in Parkinson's disease. Unexpectedly, TH+ neurons in the locus coeruleus and group A13, also lacking the SdhD gene, were unaltered. These data indicate that complete loss of SdhD is not sufficient to induce tumorigenesis in mice. They suggest that substantia nigra neurons are more susceptible to mitochondrial damage than other catecholaminergic cells, particularly during a critical postnatal maturation period.
A pitch target approximation model for F0 contours in Mandarin

In this paper we report a quantitative model for generating F0 contours in Mandarin Chinese. The model assumes that a) the basic units underlying Mandarin tones are pitch targets that are either static or dynamic, b) each pitch target is assigned to and implemented in synchrony with a syllable, and c) throughout the duration of a syllable, the pitch target is implemented continuously and asymptotically. The model expresses the F0 curve in each syllable as an exponential asymptote that approximates an underlying pitch target. Parameters in the model specify a) the properties of the pitch target, including its height and direction of movement, b) the rate at which the target is approximated, and c) how smoothly two adjacent tones are joined at the syllable boundary. Preliminary effort to fit the model to existing F0 data has yielded encouraging results.
Paternal hyperglycemia in rats exacerbates the development of obesity in offspring.

Parental history with obesity or diabetes will increase the risk for developing metabolic diseases in offspring. However, literatures as to transgenerational inheritance of metabolic dysfunctions through male lineage are relatively scarce. In the current study, we aimed to evaluate influences of paternal hyperglycemia on metabolic phenotypes in offspring. Male SD rats were i.p. injected with streptozotocin (STZ) or citrate buffer (CB, as control). STZ-injected rats with glucose levels higher than 16.7 mM were selected to breed with normal female rats. Offspring from STZ or CB treated fathers (STZ-O and CB-O) were maintained in the identical condition. We monitored body weight and food intake, and tests of glucose and insulin tolerance (GTTs and ITTs), fasting-refeeding and cold exposure were performed. Expression of factors involved in hypothalamic feeding and brown adipose tissue (BAT) thermogenic activity was performed by real-time PCR and Western blot. Adult STZ-O were heavier than CB-O. Impairment of GTTs was observed in STZ-O compared with CB-O at 22 and 32 weeks of age; ITTs results showed decreased insulin sensitivity in STZ-O. Daily food intake and accumulated food intake during 12-h refeeding after fasting were significantly higher in STZ-O. UCP1 levels were downregulated in BAT from STZ-O at room temperature and cold exposure. Finally, STZ-O rats showed suppressed leptin signaling in the hypothalamus as evidenced by upregulated SOCS3, reduced phosphorylation of STAT3, impaired processing POMC and decreased α-MSH production. Our study revealed that paternal hyperglycemia predisposes offspring to developing obesity, which is possibly associated with impaired hypothalamic leptin signaling.
Video temporal error concealment using improved directional boundary matching algorithm

Nowadays some systems such as multimedia systems try to present a high quality of digital videos every day. Because of the possible errors in communication channels, compressed video data would be damaged in the sending process. Error concealment is a useful technique for concealing the effects of sending errors at the decoder. In this paper, an improved directional boundary matching algorithm is presented, in which by using adjacent macroblocks (MBs) of the damaged MB a direction is identified for each boundary. Then every boundary of candidate MBs is compared to an identified direction. Finally, the candidate motion vector (MV) that has the minimum improved directional matching function is selected as the MV of the damaged MB. Furthermore, to increase the accuracy in damaged MV estimation, a specific weight is given to the boundaries of adjacent MBs. Conforming to the experimental results, the proposed algorithm not only outperforms subjective visual evaluation compared to classic boundary matching, outer boundary matching, and directional boundary matching algorithms, but also it is able to improve the objective quality of reconstructed video frames effectively.
Loop mitigation in bloom filter based multicast: A destination-oriented approach

Recently, several Bloom filter based multicast schemes have been proposed, in which multicast routing information is carried with an in-packet Bloom filter. Since routers have no need to maintain forwarding states on a per-group basis, the Bloom filter based multicast protocols have desirable scalability. However, a critical issue is that these schemes may incur forwarding loops due to the false positive inherent in the Bloom filter. Existing solutions can only conditionally mitigate the probability of the forwarding loop, instead of fully preventing such events which (once occurred) will cause severe damage to the network. In this paper, we resolve this issue in the context of a destination-oriented multicast (DOM) scheme, a Bloom filter based multicast protocol carrying destinations IP addresses with the in-packet Bloom filter. With a theoretical analysis of the loop issue in DOM context developed, we reveal that the DOM design natively supports automatical elimination of permanent forwarding loops in all cases except a subtle one termed as conservation of bits. Based on the conclusion, we derive a probability upper bound on the loop occurrence in DOM. Furthermore, we propose an accurate tree branch pruning scheme, which equips the DOM the capability to completely and efficiently remove the false-positive forwarding loop. We present simulation results over a practical topology to demonstrate the performance of the loop mitigating DOM, with comparison to a representative Bloom filter based multicast scheme FRM and traditional IP multicast.
Nonatomic Mutual Exclusion with Local Spinning ∗ ( Extended

We present an N -process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs Θ(log N) remote memory references to enter and exit its critical section. This algorithm is derived from Yang and Anderson’s atomic tree-based local-spin algorithm in a way that preserves its time complexity. No atomic read/write algorithm with better asymptotic worst-case time complexity (under the remote-memory-references measure) is currently known. This suggests that atomic memory is not fundamentally required if one is interested in worst-case time complexity. The same cannot be said if one is interested in fast-path algorithms (in which contention-free time complexity is required to be O(1)) or adaptive algorithms (in which time complexity is required to be proportional to the number of contending processes). We show that such algorithms fundamentally require memory accesses to be atomic. In particular, we show that for any N -process nonatomic algorithm, there exists a single-process execution in which the lone competing process executes Ω(log N/ log log N) remote operations to enter its critical section. Moreover, these operations must access Ω( √ logN/ log logN) distinct variables, which implies that fast and adaptive algorithms are impossible even if caching techniques are used to avoid accessing the processors-to-memory interconnection network. ∗Work supported by NSF grants CCR 9972211, CCR 9988327, and ITR 0082866.
ICP-SLAM methods implementation on a bi-steerable mobile robot

Scan matching is a popular way of recovering a mobile robot's motion and constitutes the basis of many localization and mapping approaches. The work presented in this paper consists in the implementation of a SLAM method (Simultaneous Localization and Mapping) based on the Iterative Closest Points (ICP) algorithm on the Robucar, a car-like mobile robot. Two variants are considered related to the error metric minimization. These variants of ICP-SLAM have been implemented and tested on the robot for performance's comparison.
Recognition of Words from the EEG Laplacian

Recent works on the relationship between the electro-encephalogram (EEG) data and psychological stimuli show that EEG recordings can be used to recognize an auditory stimulus presented to a subject. The recognition rate is, however, strongly affected by technical and physiological artifacts. In this work, subjects were presented seven auditory simuli in the form of English words (first, second, third, left, right, yes, and no), and the time-locked electric field was recorded with a 64 channel Neuroscan EEG system. We used the surface Laplacian operator to eliminate artifacts due to sources located at regions far from the electrode. Our intent with the Laplacian was to improve the recognition rates of auditory stimuli from the electric field. To compute the Laplacian, we used a spline interpolation from spherical harmonics. The EEG Laplacian of the electric field were average over trials for the same auditory stimulus, and with those averages we constructed prototypes and test samples. In addition to the Laplacian, we applied Butterworth bandpass digital filters to the averaged prototypes and test samples, and compared the filtered test samples against the prototypes using a least squares metric in the time domain. We also analyzed the effects of the spline interpolation order and bandpass filter parameters in the recognition rates. Our results show that the use of the Laplacian improves the recognition rates and suggests a spatial isomorphism between both subjects.
CMOS inverter analytical delay model considering all operating regions

This paper presents an accurate analytical delay model for CMOS inverter considering both subthreshold and superthreshold operating regions. Previous related work are either only valid for a specific operating condition or assume a step input. Therefore, that is the first approach to consider both different operating regions and input transition time. Moreover, the proposed model also considers several second order effects that influence the CMOS inverter dynamic behavior. Compared to electrical simulations based on BSIM4 transistor model the proposed delay model presents an average error of 2.3% and the worst case error of 6.6%.
High-resolution DOA estimation by algebraic phase unwrapping algorithm

A common strategy among modern high-resolution direction-of-arrival (DOA) estimation schemes is their systematic translation from the DOA estimation problem to a global nonlinear optimization problem: find all (local) minima or maxima of certain univariate functions, defined as the values on the unit circle, of carefully designed complex self-reciprocal univariate Laurent polynomials. We present, for this highly nonlinear optimization problem, an algebraic (finite step) algorithm to compute the complete minima-maxima distributions along the unit circle, i.e., the exact number of minima or maxima located on an arbitrarily chosen sub-arc of the unit circle. This algorithm can serve as a powerful mathematical tool for the high-resolution DOA estimation problem. The key idea of the proposed algorithm is essentially based on the use of the generalized Sturm sequence developed originally for the exact solution to the algebraic multidimensional phase unwrapping problem (Yamada I. et al, IEEE Trans. Sig. Process., vol.46, p.1639-64, 1998).
Optimization of the conditions for the decolorization of batik wastewater by Aspergillus sp. 3

Most batik industries dispose of wastewater into the environment without being processed first. Biological wastewater treatment effectively can reduce color parameters. Optimization was carried out to determine the optimum condition of growth. The aim of this study were to obtain the optimum concentration of inoculum, pH, incubation time and culture condition in the decolorization of Indigosol blue batik wastewater by Aspergillus sp. 3 strain G-LnsP isolate. The isolate was isolated from batik wastewater. Variations of inoculum concentration were 100, 150, 200, 250 spores / ml, pH was 3, 4, 5, 6, 7, 8, the incubation time was 24, 48 and 72 hours, and the culture conditions were agitated. The parameters observed in the optimization were the percentage of decolorization analyzed by the spectrophotometer method. The optimization results showed that the best inoculum concentration was 100 spores / ml with decolorization 94.8%. The optimum pH was 3 with decolorization of 96.6%. The optimum incubation time was 24 hours with decolorization degradation 95.32%. Decolorization of culture conditions were found to be higher in agitated conditions than static conditions