Search results for " machine"
showing 10 items of 1317 documents
Bond strength evaluation of the veneering-core ceramics bonds.
2009
The purpose of this study was to determine whether the bond of veneering porcelain to a ceramic core in bilayered ceramics was similar to that of the metal ceramic control of well known behaviour. Six groups of nine specimens each were fabricated, whose dimensions were 15 mm long and 8 mm in diameter at the core, and 2 mm long and 8 mm in diameter for the veneer. The groups were GR. 1 (control group): CrNi alloy/d.SIGN (Ivoclar), GR. 2: IPS e.maxPress/IPS e.maxCeram (Ivoclar), GR. 3: IPS e.maxZirCad/ IPS e.maxZirPress (Ivoclar), GR. 4: IPS e.maxZirCad/IPS e.maxCeram (Ivoclar), GR. 5: Lava Frame (3M ESPE)/ Lava Ceram (3M ESPE) and GR. 6: Lava Frame (3M ESPE)/IPS e.maxCeram (Ivoclar). A shear…
Effects of femtosecond laser and other surface treatments on the bond strength of metallic and ceramic orthodontic brackets to zirconia.
2017
Femtosecond laser has been proposed as a method for conditioning zirconia surfaces to boost bond strength. However, metallic or ceramic bracket bonding to femtosecond lasertreated zirconia surfaces has not been tested. This study compared the effects of four conditioning techniques, including femtosecond laser irradiation, on shear bond strength (SBS) of metallic and ceramic brackets to zirconia.Three hundred zirconia plates were divided into five groups: 1) control (C); 2) sandblasting (APA); 3) silica coating and silane (SC); 4) femtosecond laser (FS); 5) sandblasting followed by femtosecond laser (APA+SC). A thermal imaging camera measured temperature changes in the zirconia during irrad…
Drug Activity Characterization Using One-Class Support Vector Machines with Counterexamples
2013
The problem of detecting chemical activity in drugs from its molecular description constitutes a challenging and hard learning task. The corresponding prediction problem can be tackled either as a binary classification problem (active versus inactive compounds) or as a one class problem. The first option leads usually to better prediction results when measured over small and fixed databases while the second could potentially lead to a much better characterization of the active class which could be more important in more realistic settings. In this paper, a comparison of these two options is presented when support vector models are used as predictors.
Microstructure–property relation and machine learning prediction of hole expansion capacity of high-strength steels
2021
Abstract The relationship between microstructure features and mechanical properties plays an important role in the design of materials and improvement of properties. Hole expansion capacity plays a fundamental role in defining the formability of metal sheets. Due to the complexity of the experimental procedure of testing hole expansion capacity, where many influencing factors contribute to the resulting values, the relationship between microstructure features and hole expansion capacity and the complexity of this relation is not yet fully understood. In the present study, an experimental dataset containing the phase constituents of 55 microstructures as well as corresponding properties, su…
RIP-Chip analysis supports different roles for AGO2 and GW182 proteins in recruiting and processing microRNA targets.
2019
Background MicroRNAs (miRNAs) are small non-coding RNA molecules mediating the translational repression and degradation of target mRNAs in the cell. Mature miRNAs are used as a template by the RNA-induced silencing complex (RISC) to recognize the complementary mRNAs to be regulated. To discern further RISC functions, we analyzed the activities of two RISC proteins, AGO2 and GW182, in the MCF-7 human breast cancer cell line. Methods We performed three RIP-Chip experiments using either anti-AGO2 or anti-GW182 antibodies and compiled a data set made up of the miRNA and mRNA expression profiles of three samples for each experiment. Specifically, we analyzed the input sample, the immunoprecipita…
SAUCE: A Web-Based Automated Assessment Tool for Teaching Parallel Programming
2015
Many curricula for undergraduate studies in computer science provide a lecture on the fundamentals of parallel programming like multi-threaded computation on shared memory architectures using POSIX threads or OpenMP. The complex structure of parallel programs can be challenging, especially for inexperienced students. Thus, there is a latent need for software supporting the learning process. Subsequent lectures may cover more advanced parallelization techniques such as the Message Passing Interface (MPI) and the Compute Unified Device Architecture (CUDA) languages. Unfortunately, the majority of students cannot easily access MPI clusters or modern hardware accelerators in order to effectivel…
Context-free Languages
1988
In this chapter we shall define a class of rewriting systems called context-free grammars. The left-hand side of a rule in a context-free grammar consists of a single symbol, so that symbols are rewritten “context-freely”. Context-free grammars are of central importance to us because they define the class of context-free languages, the parsing of which is the subject of this book. In this chapter we shall consider some structural properties of context-free grammars which are of importance in parsing. Also, a basic method for recognizing context-free languages will be given.
Positive Versions of Polynomial Time
1998
Abstract We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems, which we denote by posP . By a well-known result of Razborov, posP is a proper subclass of the class of monotone problems in P . We exhibit complete problems for posP via weak logical reductions, as we do for other logically defined classes of problems. Our work is a continuation of research undertaken by Grigni and Sipser, and subsequently Stewart; indeed, we introduce the notion of a positive deterministic Turing machine and consequently solve a problem posed by Grigni and Sipser.
On a class of languages with holonomic generating functions
2017
We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars
2021
We consider the following problem: A researcher identified a small number of molecules with a certain property of interest and now wants to find further molecules sharing this property in a database. This can be described as learning molecular classes from small numbers of positive examples. In this work, we propose a method that is based on learning a graph grammar for the molecular class. We consider the type of graph grammars proposed by Althaus et al. [2], as it can be easily interpreted and allows relatively efficient queries. We identify rules that are frequently encountered in the positive examples and use these to construct a graph grammar. We then classify a molecule as being conta…