The Efficient Distance Weighted Case Base Rule (DW-CBR) for Early Childhood Diseases Diagnosis

Children from newborns to six years old are more susceptible to diseases. A common methodology to diagnose childhood diseases is by using a reasoning technique. Reasoning techniques is one of a reliable method for expert systems. Reasoning techniques using the correct case of results have provided enormous support for predicting the diagnosis and treatment of diseases. This paper focuses on the main technical characteristics of two common reasoning techniques, namely; rule-based reasoning and case-based reasoning. This paper describes a comparative analysis of rule-based and case-based reasoning techniques using several commonly used similarity measures and a study on its performance for classification tasks. Moreover, this study proposes a new case-based reasoning approach using an alternative similarity measure, called Distance-Weighted Case Base Reasoning (DW-CBR). The proposed method aims to improve classification performance. The main result of this study shows that case-based reasoning is a more powerful methodology regarding the issues of maintenance and knowledge representations over the rule-based system and reveals that DWCBR has the best accuracy, which is 92%.

Data Reduction for Maximum Matching on Real-World Graphs

Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For n -vertex and m -edge graphs, the best-known algorithms run in Õ( m √ n ) time. We build on recent theoretical work focusing on linear-time data reduction rules for finding maximum-cardinality matchings and complement the theoretical results by presenting and analyzing (thereby employing the kernelization methodology of parameterized complexity analysis) new (near-)linear-time data reduction rules for both the unweighted and the positive-integer-weighted case. Moreover, we experimentally demonstrate that these data reduction rules provide significant speedups of the state-of-the art implementations for computing matchings in real-world graphs: the average speedup factor is 4.7 in the unweighted case and 12.72 in the weighted case.

Weighted higher order exponential type inequalities in metric spaces and applications

In this paper, we establish weighted higher order exponential type inequalities in the geodesic space {({X,d,\mu})} by proposing an abstract higher order Poincaré inequality. These are also new in the non-weighted case. As applications, we obtain a weighted Trudinger’s theorem in the geodesic setting and weighted higher order exponential type estimates for functions in Folland–Stein type Sobolev spaces defined on stratified Lie groups. A higher order exponential type inequality in a connected homogeneous space is also given.

Compositions of Tree-to-Tree Statistical Machine Translation Models

The well-known synchronous context-free grammars (SCFGs) and synchronous tree-substitution grammars (STSGs), both of which are used as tree-to-tree translation models in statistical machine translation are investigated. Their composition hierarchies are established in both the unweighted as well as the weighted case. More precisely, it is shown that SCFGs are closed under composition in both cases and that there is a close connection between compositions of STSGs and compositions of certain tree transducers. With the help of the close ties, the composition closure of STSGs is identified in both cases as well. The results for the weighted case utilize a new lifting technique that might prove useful also in similar setups.

Regularity for the second order Riesz transforms associated with Schrödinger operators on weighted BMO type spaces

Let L = −Δ + V be a Schrödinger operator on ℝn, where V is a nonnegative potential satisfying the suitable reverse Hölder’s inequality. In this paper, we study the boundedness of the second order Riesz transforms such as L−1∇2 on the spaces of BMO type for weighted case. We generalized the known results to the weighted case.

Az arc-, állcsont-szájsebészeti aktív fekvőbetegosztályok teljesítménymutatói

Introduction: In Hungary, the number and structure of the maxillofacial surgery departments underwent significant changes in recent decades. Aim: The aim of our study was to present the actual performance indicators of maxillofacial inpatient departments and based on the available data to compare the departments. Method: The study was based on the number of beds founded by the National Health Insurance Fund. Performance data were supplied by the National Health Insurance Fund Administration. The assessment included the following indicators: number of beds institutional breakdown by type, number of reimbursed cases, the weighted case number, hospital stay, bed occupancy rates and average length of stay. Results: In the examined period 40% of active beds (65) were in university hospitals. The distribution of reimbursed cases was similar. The university hospitals showed higher weighted case number and case-mix index. The oral surgery departments’ bed occupancy rate (45.75%) was below the national average. Conclusion: The indicators show significant differences among different departments in the examined period. Orv. Hetil., 2017, 158(12), 447–453.

Improvement of Grüss and Ostrowski type inequalities

Several inequalities of Ostrowski-Gr?ss-type available in the literature are generalized considering the weighted case of them. The inequality of Gr?ss type proved by P. Cerone and S.S. Dragomir [3] is extended for the weighted case.