9,198 research outputs found

    Recent development in beta titanium alloys for biomedical applications

    Get PDF
    © 2020 by the authors. Licensee MDPI, Basel, Switzerland. β-type titanium (Ti) alloys have attracted a lot of attention as novel biomedical materials in the past decades due to their low elastic moduli and good biocompatibility. This article provides a broad and extensive review of β-type Ti alloys in terms of alloy design, preparation methods, mechanical properties, corrosion behavior, and biocompatibility. After briefly introducing the development of Ti and Ti alloys for biomedical applications, this article reviews the design of β-type Ti alloys from the perspective of the molybdenum equivalency (Moeq) method and DV-Xα molecular orbital method. Based on these methods, a considerable number of β-type Ti alloys are developed. Although β-type Ti alloys have lower elastic moduli compared with other types of Ti alloys, they still possess higher elastic moduli than human bones. Therefore, porous β-type Ti alloys with declined elastic modulus have been developed by some preparation methods, such as powder metallurgy, additive manufacture and so on. As reviewed, β-type Ti alloys have comparable or even better mechanical properties, corrosion behavior, and biocompatibility compared with other types of Ti alloys. Hence, β-type Ti alloys are the more suitable materials used as implant materials. However, there are still some problems with β-type Ti alloys, such as biological inertness. As such, summarizing the findings from the current literature, suggestions forβ-type Ti alloys with bioactive coatings are proposed for the future development

    On the Patent Claim Eligibility Prediction Using Text Mining Techniques

    Get PDF
    With the widespread of computer software in recent decades, software patent has become controversial for the patent system. Of the many patentability requirements, patentable subject matter serves as a gatekeeping function to prevent a patent from preempting future innovation. Software patents may easily fall into the gray area of abstract ideas, whose allowance may hinder future innovation. However, without a clear definition of abstract ideas, determining the patent claim subject matter eligibility is a challenging task for examiners and applicants. In this research, in order to solve the software patent eligibility issues, we propose an effective model to determine patent claim eligibility by text-mining and machine learning techniques. Drawing upon USPTO issued guidelines, we identify 66 patent cases to design domain knowledge features, including abstractness features and distinguishable word features, as well as other textual features, to develop the claim eligibility prediction model. The experiment results show our proposed model reaches the accuracy of more than 80%, and domain knowledge features play a crucial role in our prediction model

    Prevalence of Dyslipidemia in Patients Receiving Health Checkups: A Hospital-Based Study

    Get PDF
    We used the dataset from one medical center in Taiwan to explore the prevalence of dyslipidemia, which included 2695 subjects receiving private health checkups in 2003-2004. The overall prevalence of hypercholesterolemia was 53.3% in men and 48.2% in women (P = 0.008). The overall prevalence of hypertriglyceridemia was 29.3% in men and 13.7% in women (P < 0.001). The overall prevalence of elevated LDL level was 50.7% in men and 37.9% in women (P < 0.001). The overall prevalence of low HDL level was 47.4% in men and 53% in women (P = 0.004)

    Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes

    Full text link
    In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. Furthermore, this characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints that lead to SDP bounds on the minimum distance or size of CWS-type quantum codes. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results, while SDP consistently provides tight and relevant bounds. Finally, we also provide interpretations of the Shor-Laflamme weight enumerators and shadow enumerators for codeword stabilized codes, enhancing our understanding of quantum codes.Comment: 20 pages, 1 tabl
    corecore