RHPTree—Risk Hierarchical Pattern Tree for Scalable Long Pattern Mining

Risk patterns are crucial in biomedical research and have served as an important factor in precision health and disease prevention. Despite recent development in parallel and high-performance computing, existing risk pattern mining methods still struggle with problems caused by large-scale datasets, such as redundant candidate generation, inability to discover long significant patterns, and prolonged post pattern filtering. In this article, we propose a novel dynamic tree structure, Risk Hierarchical Pattern Tree (RHPTree), and a top-down search method, RHPSearch, which are capable of efficiently analyzing a large volume of data and overcoming the limitations of previous works. The dynamic nature of the RHPTree avoids costly tree reconstruction for the iterative search process and dataset updates. We also introduce two specialized search methods, the extended target search (RHPSearch-TS) and the parallel search approach (RHPSearch-SD), to further speed up the retrieval of certain items of interest. Experiments on both UCI machine learning datasets and sampled datasets of the Simons Foundation Autism Research Initiative (SFARI)—Simon’s Simplex Collection (SSC) datasets demonstrate that our method is not only faster but also more effective in identifying comprehensive long risk patterns than existing works. Moreover, the proposed new tree structure is generic and applicable to other pattern mining problems.

A Comparative Study of Meta-Heuristic and Conventional Search in Optimization of Multi-Dimensional Feature Selection

Algorithmic – based search approach is ineffective at addressing the problem of multi-dimensional feature selection for document categorization. This study proposes the use of meta heuristic based search approach for optimal feature selection. Elephant optimization (EO) and Ant Colony optimization (ACO) algorithms coupled with Naïve Bayes (NB), Support Vector Machin (SVM), and J48 classifiers were used to highlight the optimization capability of meta-heuristic search for multi-dimensional feature selection problem in document categorization. In addition, the performance results for feature selection using the two meta-heuristic based approaches (EO and ACO) were compared with conventional Best First Search (BFS) and Greedy Stepwise (GS) algorithms on news document categorization. The comparative results showed that global optimal feature subsets were attained using adaptive parameters tuning in meta-heuristic based feature selection optimization scheme. In addition, the selected number of feature subsets were minimized dramatically for document classification.

Designing of Container Feeder Service Networks Under Unstable Demand Conditions

The COVID-19 pandemic has greatly magnified supply challenges in all industries, and virus waves continue to cause an extraordinary amount of variation in both the demand for and the availability of necessary products. This uncertainty has also forced many organizations including container liner shipping to redesign their supply chain. Feeder services from hub ports are essential chain of shipping networks. This chapter addresses the design of feeder networks under consideration of demand fluctuations over the year. For this purpose, a perturbation-based variable neighbourhood search approach is developed in order to determine the feeder ship fleet size and mix, the fleet deployment, service routes, and voyage schedules to minimize operational costs. In the case study investigation, the authors consider the feeder network design problem faced by a feeder shipping company as a sample application. The performance of alternate network configurations is compared under dynamic demand conditions. Numerical results highlight the advantage of dynamic and flexible design of feeder service networks.

A Reduced Variable Neighborhood Search Approach to the Heterogeneous Vector Bin Packing Problem

The two-dimensional heterogeneous vector bin packing problem (2DHet-VBPP) consists of packing the set of items into the set of various type bins, respecting their two resource limits. The problem is to minimize the total cost of all bins. The problem, known to be NP-hard, can be formulated as a pure integer linear program, but optimal solutions can be obtained by the CPLEX Optimizer engine only for small instances. This paper proposes a metaheuristic approach to the 2DHet-VBPP, based on Reduced variable neighborhood search (RVNS). All RVNS elements are adapted to the considered problem and many procedures are designed to improve efficiency of the method. As the Two-dimensional Homogeneous-VBPP (2DHom-VBPP) is more often treated, we considered also a special version of the RVNS algorithm to solve the 2DHom-VBPP. The results obtained and compared to both CPLEX results and results on benchmark instances from literature, justify the use of the RVNS algorithm to solve large instances of these optimization problems.

The Cliché of the Official Business Style and its Transfer from Russian into the Yakut Language

At present, the official business style of the Yakut language is more developed in comparison with the translations of the twentieth century, when this style was just beginning to be practiced. Along with this, the translation of official-business style texts is also developing. As state and municipal services are an integral part of our life and understanding the strengths and merits, which adds the translation to society, it is very important to translate the Yakut language information, regulatory documents of the population of our Republic and members of the institutions, namely the Standard of applicants to the State autonomous institution Multifunctional center for the provision of state and municipal services in the Republic of Sakha (Yakutia) Rules of applicants. The aim of this work is to analyze the difficulties of transmission clich official-business style of Russian into Yakut language and the search approach solutions to these difficulties. The methodological basis of this study is the comparative and descriptive methods based on the data obtained by the continuous sampling method. As a result of the analysis, we identified lexical and grammatical difficulties in translating official-business style cliches from Russian into Yakut. Lexical words include borrowing words, words without equivalent correspondence and abbreviations in the cliche, where the first ones are most often transmitted to the Yakut language by transcription or remain by themselves, the second ones are translated by an adequate replacement, paraphrasing or description, and the third ones with the Russian version in a bracket. Grammatical difficulties include complex sentences with passive constructions and participial turns, which directly affect how the cliche will be translated into them. Cliches in complex sentences occur frequently, sometimes several times in the same sentence.

Alteration in the Efficacy of in Vitro Vancomycin and Ceftazidime Prepared in Normal Saline Versus Balanced Salt Solution in the Management of Ocular Infections

Objective: The purpose of this review article is to highlight the efficacy of Vancomycin and Ceftazidime formulated in different solutions for ocular use in the management of microbiological Ocular infections varies. Methodology: To locate and assess all relevant literature, we employed systematic review as a search approach, utilizing punctilious and unambiguous methodologies. We initiated by stipulating key terms and selecting appropriate databases for your literature search. To find replicable and reportable publications from high-quality peer-reviewed journals, we used Google Scholar, PubMed, and Research Gate. Results: Ceftazidime precipitated at 37 degree Celsius, but not at room temperature, however it did not show any effect on the pH of the medium. In both the media of Normal Saline and Balanced Salt Solution, it precipitated on its own or when coupled with vancomycin. Ceftazidime was initially prepared in Balanced Salt Solution rather than Normal Saline, which resulted in further precipitation. Ceftazidime prepared in Normal Saline precipitated to 54% after 168 hours in the dialysis chambers, compared to 88% in Balanced Salt Solution. Ceftazidime synthesized in Normal Saline declined from an initial concentration of 137.5 to 73.4 µg/ml after 48 hours, while ceftazidime prepared in Balanced Salt Solution decreased to 6.3µg/ml. Vancomycin precipitation was inappreciable. Conclusion: Vancomycin did not precipitate in Normal Saline or Balanced Salt Solution, according to this systemic study. Regardless of the presence of vancomycin, ceftazidime precipitated, and it precipitated more expeditiously if it was produced in Balanced Salt Solution rather than Normal Saline.

A large neighborhood search approach for the paint shop scheduling problem

Minimizing the setup costs caused by color changes is one of the main concerns for paint shop scheduling in the automotive industry. Yet, finding an optimized color sequence is a very challenging task, as a large number of exterior systems for car manufacturing need to be painted in a variety of different colors. Therefore, there is a strong need for efficient automated scheduling solutions in this area. Previously, exact and metaheuristic approaches for creating efficient paint shop schedules in the automotive supply industry have been proposed and evaluated on a publicly available set of real-life benchmark instances. However, optimal solutions are still unknown for many of the benchmark instances, and there is still a potential of reducing color change costs for large instances. In this paper, we propose a novel large neighborhood search approach for the paint shop scheduling problem. We introduce innovative exact and heuristic solution methods that are utilized within the large neighborhood search and show that our approach leads to improved results for large real-life problem instances compared to existing techniques. Furthermore, we provide previously unknown upper bounds for 14 benchmark instances using the proposed method.