Set Of Algorithms Research Articles

Bi-DexHands: Towards Human-Level Bimanual Dexterous Manipulation.

Achieving human-level dexterity in robotics remains a critical open problem. Even simple dexterous manipulation tasks pose significant difficulties due to the high number of degrees of freedom and the need for cooperation among heterogeneous agents (e.g., finger joints). While some researchers have utilized reinforcement learning (RL) to control a single hand in manipulating objects, tasks that require coordinated bimanual cooperation are still under-explored due to the fewer suitable environments, which can result in difficulties and sub-optimal performance. To address these challenges, we introduce Bi-DexHands, a simulator with two dexterous hands featuring 20 bimanual manipulation tasks and thousands of target objects, designed to match various levels of human motor skills based on cognitive science research. We developed Bi-DexHands in Issac Gym, enabling highly efficient RL training at over 30,000 frames per second using a single NVIDIA RTX 3090. Based on Bi-DexHands, we present a comprehensive evaluation of popular RL algorithms in different settings, including single-agent/multi-agent RL, offline RL, multi-task RL, and meta RL. Our findings show that on-policy algorithms, such as PPO, can master simple manipulation tasks that correspond to those of 48-month-old babies, such as catching a flying object or opening a bottle. Furthermore, multi-agent RL can improve the ability to perform manipulations that require skilled bimanual cooperation, such as lifting a pot or stacking blocks. Despite achieving success in individual tasks, current RL algorithms struggle to learn multiple manipulation skills in most multi-task and few-shot learning scenarios. This highlights the need for further research and development within the RL community.

Concept mapping in an Online Undergraduate Pathology Course: Integrating etiology, pathophysiology, and clinical aspects of disease

Concept mapping has proven to be a useful tool in science education by helping students make connections between facts thereby establishing hierarchies of knowledge. These hierarchies enable students to assimilate information into meaningful reference memories. During the COVID pandemic, classroom activities were severely limited, creating a lack of classroom engagement. Online classes replaced in-class lectures, decreasing opportunities for student contact. To address this pedological shortcoming, concept maps were utilized in an asynchronous online pathology course for pre-health profession undergraduate students. Students asked to create a concept map for a disease, connecting the disease’s pathophysiology, etiology, and clinical considerations. Rough drafts of maps were given feedback to improve connections and flow of the maps. Maps were graded using a rubric modified from several sources, and points were awarded when connections were made within and between the three main pillars of pathology. There were many types of creative maps. Course evaluations indicated that students enjoyed concept mapping as a learning alternative to standard class assignments. The overall goal was to provide a precursor activity that would enhance students’ abilities to utilize algorithms in clinical settings. No support was required. This is the full abstract presented at the American Physiology Summit 2024 meeting and is only available in HTML format. There are no additional versions or additional content available for this abstract. Physiology was not involved in the peer review process.

Pore Pressure Prediction for High-Pressure Tight Sandstone in the Huizhou Sag, Pearl River Mouth Basin, China: A Machine Learning-Based Approach

A growing number of large data sets have created challenges for the oil and gas industry in predicting reservoir parameters and assessing well productivity through efficient and cost-effective techniques. The design of drilling plans for a high-pressure tight-sand reservoir requires accurate estimations of pore pressure (Pp) and reservoir parameters. The objective of this study is to predict and compare the Pp of Huizhou Sag, Pearl River Mouth Basin, China, using conventional techniques and machine learning (ML) algorithms. We investigated the characteristics of low-permeability reservoirs by observing well-logging data sets and cores and examining thin sections under a microscope. In the reservoir zone, the average hydrocarbon saturation is 55%, and the average effective porosity is 11%. The tight sandstone reservoirs consist of fine- to extremely fine-grained argillaceous feldspathic sandstone. The mean absolute error for reservoir property prediction is 1.3%, 2.2%, and 4.8%, respectively, for effective porosity, shale volume, and water saturation. Moreover, the ML algorithm was employed to cross-check the validity of the prediction of Pp. Combining conventional and ML techniques with the core data demonstrates a correlation coefficient (R2) of 0.9587, indicating that ML techniques are the most effective in testing well data. This study shows that ML can effectively predict Pp at subsequent depths in adjacent geologically similar locations. Compared to conventional methods, a substantial data set and ML algorithms improve the precision of Pp predictions.

Primal‐dual active set algorithm for valuating American options under regime switching

AbstractThis paper focuses on numerical algorithms to value American options under regime switching. The prices of such options satisfy a set of complementary parabolic problems on an unbounded domain. Based on our previous experience, the pricing model could be truncated into a linear complementarity problem (LCP) over a bounded domain. In addition, we transform the resulting LCP into an equivalent variational problem (VP), and discretize the VP by an Euler‐finite element method. Since the variational matrix in the discretized system is P‐matrix, a primal‐dual active set (PDAS) algorithm is proposed to evaluate the option prices efficiently. As a specialty of PDAS, the optimal exercise boundaries in all regimes are obtained without further computation cost. Finally, numerical simulations are carried out to test the performance of our proposed algorithm and compare it to existing methods.

Employing Algorithms in Cosmetic Facial Surgery

The aim is to evaluate the scientific literature on the creation and application of algorithms in clinical settings, with a focus on their efficacy. Material and methods. The literature search was performed using the databases Scopus, Medline (PubMed), eLibrary (in total: 32 scientific papers). Results. The acquisition of data pertaining to the principles of algorithm development was accomplished, and the notion that algorithms will increasingly be adopted across a range of plastic surgery specialties was validated. Conclusions. Based on scientific research data, it can be inferred that the development and implementation of algorithms play a significant role in an aesthetic surgeon’s work in surgical practice. All authors unanimously support the effectiveness of integrating algorithms into clinical practice, some of which were developed by them for the first time. When planning and executing surgical procedures, it is emphasized to base on individual patient data, as well as the relevance of such developments in improving the achievement of better surgical correction outcomes. In some instances, the implementation of algorithms in clinical practice has led to a significant improvement in patients' quality of life after the interventions. Each correction method has its unique effectiveness. The positive results of the work on the development and implementation of algorithms in clinical practice suggest that the development of this type for aesthetic interventions on the lower third of the face would allow for: 1) improved aesthetic outcomes, 2) enhanced intervention quality, 3) a reduction in the number of interventions necessary to achieve a positive and long-lasting effect, 4) a decrease in the likelihood of short-term and long-term postoperative complications, and 5) lower treatment costs and shorter treatment duration.

Multivariate realized volatility: an analysis via shrinkage methods for Brazilian market data

IntroductionRealized volatility analysis of assets in the Brazilian market within a multivariate framework is the focus of this study. Despite the success of volatility models in univariate scenarios, challenges arise due to increasing dimensionality of covariance matrices and lower asset liquidity in emerging markets.MethodsIn this study, we utilize intraday stock trading data from the Brazilian Market to compute daily covariance matrices using various specifications. To mitigate dimensionality issues in covariance matrix estimation, we implement penalization restrictions on coefficients through regressions with shrinkage techniques using Ridge, LASSO, or Elastic Net estimators. These techniques are employed to capture the dynamics of covariance matrices.ResultsComparison of covariance construction models is performed using the Model Confidence Set (MCS) algorithm, which selects the best models based on their predictive performance. The findings indicate that the method used for estimating the covariance matrix significantly impacts the selection of the best models. Additionally, it is observed that more liquid sectors demonstrate greater intra-sectoral dynamics.DiscussionWhile the results benefit from shrinkage techniques, the high correlation between assets presents challenges in capturing stock or sector idiosyncrasies. This suggests the need for further exploration and refinement of methods to better capture the complexities of volatility dynamics in emerging markets like Brazil.

Application of generalised atomic wavelets in image processing problems

The problem of processing large data arrays is considered. Development of effective algorithms is the basis of successful application of new technologies. Complexity of the algorithm and accuracy of the results are the key quality indicators. The use of compact carrier functions leads to a decrease in processing time and complexity of the numerical algorithm. The accuracy of the data representation and the correctness of the results mainly depend on the approximation properties. It follows that a combination of the above characteristics is necessary to create efficient algorithms for processing large data sets. Aim of article – to develop and evaluate the possibilities of application of generalised wavelets based on Kravchenko-Rvachev functions for image processing with a given quality on the basis of the analysis of the quality loss control mechanism. Discrete image compression by Kravchenko-Rvachev functions possessing such fundamental qualities as good approximation properties, high order of smoothness and existence of a basis with a local carrier in spaces of atomic functions is considered. Since the generalised up-functions have the same properties, similar compression results can be obtained using the generalised discrete atomic transform, which is based on their application, which is a promising direction in digital image processing. The presented method of image processing can be used for various purposes, including reducing the size of data before their transmission through the communication channel from the sensor to the point of reception via a communication line with limited bandwidth, for storing the received images for their further use in the centres of information processing of remote sensing of the earth, as well as for data transmission to potential users.

Optimal parallelization strategies for active flow control in deep reinforcement learning-based computational fluid dynamics

Deep reinforcement learning (DRL) has emerged as a promising approach for handling highly dynamic and nonlinear active flow control (AFC) problems. However, the computational cost associated with training DRL models presents a significant performance bottleneck. To address this challenge and enable efficient scaling on high-performance computing architectures, this study focuses on optimizing DRL-based algorithms in parallel settings. We validate an existing state-of-the-art DRL framework used for AFC problems and discuss its efficiency bottlenecks. Subsequently, by deconstructing the overall framework and conducting extensive scalability benchmarks for individual components, we investigate various hybrid parallelization configurations and propose efficient parallelization strategies. Moreover, we refine input/output (I/O) operations in multi-environment DRL training to tackle critical overhead associated with data movement. Finally, we demonstrate the optimized framework for a typical AFC problem where near-linear scaling can be obtained for the overall framework. We achieve a significant boost in parallel efficiency from around 49% to approximately 78%, and the training process is accelerated by approximately 47 times using 60 central processing unit (CPU) cores. These findings are expected to provide valuable insight for further advancements in DRL-based AFC studies.

Exploring Uncertainty-Based Self-Prompt for Test-Time Adaptation Semantic Segmentation in Remote Sensing Images

Test-time adaptation (TTA) has been proven to effectively improve the adaptability of deep learning semantic segmentation models facing continuous changeable scenes. However, most of the existing TTA algorithms lack an explicit exploration of domain gaps, especially those based on visual domain prompts. To address these issues, this paper proposes a self-prompt strategy based on uncertainty, guiding the model to continuously focus on regions with high uncertainty (i.e., regions with a larger domain gap). Specifically, we still use the Mean-Teacher architecture with the predicted entropy from the teacher network serving as the input to the prompt module. The prompt module processes uncertain maps and guides the student network to focus on regions with higher entropy, enabling continuous adaptation to new scenes. This is a self-prompting strategy that requires no prior knowledge and is tested on widely used benchmarks. In terms of the average performance, our method outperformed the baseline algorithm in TTA and continual TTA settings of Cityscapes-to-ACDC by 3.3% and 3.9%, respectively. Our method also outperformed the baseline algorithm by 4.1% and 3.1% on the more difficult Cityscapes-to-(Foggy and Rainy) Cityscapes setting, which also surpasses six other current TTA methods.

Better Sum Estimation via Weighted Sampling

Given a large set U where each item a ∈ U has weight w ( a ), we want to estimate the total weight W = ∑ a ∈ U w ( a ) to within factor of 1 ± ε with some constant probability > 1/2. Since n = | U | is large, we want to do this without looking at the entire set U . In the traditional setting in which we are allowed to sample elements from U uniformly, sampling Ω ( n ) items is necessary to provide any non-trivial guarantee on the estimate. Therefore, we investigate this problem in different settings: in the proportional setting we can sample items with probabilities proportional to their weights, and in the hybrid setting we can sample both proportionally and uniformly. These settings have applications, for example, in sublinear-time algorithms and distribution testing. Sum estimation in the proportional and hybrid setting has been considered before by Motwani, Panigrahy, and Xu [ICALP, 2007]. In their paper, they give both upper and lower bounds in terms of n . Their bounds are near-matching in terms of n , but not in terms of ε. In this paper, we improve both their upper and lower bounds. Our bounds are matching up to constant factors in both settings, in terms of both n and ε. No lower bounds with dependency on ε were known previously. In the proportional setting, we improve their \(\tilde{O}(\sqrt {n}/\varepsilon ^{7/2}) \) algorithm to \(O(\sqrt {n}/\varepsilon) \) . In the hybrid setting, we improve \(\tilde{O}(\sqrt [3]{n}/ \varepsilon ^{9/2}) \) to \(O(\sqrt [3]{n}/\varepsilon ^{4/3}) \) . Our algorithms are also significantly simpler and do not have large constant factors. We then investigate the previously unexplored scenario in which n is not known to the algorithm. In this case, we obtain a \(O(\sqrt {n}/\varepsilon + \log n / \varepsilon ^2) \) algorithm for the proportional setting, and a \(O(\sqrt {n}/\varepsilon) \) algorithm for the hybrid setting. This means that in the proportional setting, we may remove the need for advice without greatly increasing the complexity of the problem, while there is a major difference in the hybrid setting. We prove that this difference in the hybrid setting is necessary, by showing a matching lower bound. Our algorithms have applications in the area of sublinear-time graph algorithms. Consider a large graph G = ( V , E ) and the task of (1 ± ε)-approximating | E |. We consider the (standard) settings where we can sample uniformly from E or from both E and V . This relates to sum estimation as follows: we set U = V and the weights to be equal to the degrees. Uniform sampling then corresponds to sampling vertices uniformly. Proportional sampling can be simulated by taking a random edge and picking one of its endpoints at random. If we can only sample uniformly from E , then our results immediately give a \(O(\sqrt {|V|} / \varepsilon) \) algorithm. When we may sample both from E and V , our results imply an algorithm with complexity \(O(\sqrt [3]{|V|}/\varepsilon ^{4/3}) \) . Surprisingly, one of our subroutines provides an (1 ± ε)-approximation of | E | using \(\tilde{O}(d/\varepsilon ^2) \) expected samples, where d is the average degree, under the mild assumption that at least a constant fraction of vertices are non-isolated. This subroutine works in the setting where we can sample uniformly from both V and E . We find this remarkable since it is O (1/ε 2 ) for sparse graphs.

Algorithmic Foundation of Federated Learning with Sequential Data

The current analysis of federated optimization algorithms for training deep neural networks assumes that the data is non-sequential (e.g., images), which incurs a smooth loss objective. In contrast, edge devices generate lots of sequential data every day, where these sequences exhibit significant sequential correlation at different time stamps (e.g., text messages). In order to learn from such sequential data, people typically use a class of neural networks that is inherently nonsmooth, with a potentially unbounded smoothness parameter. Examples include recurrent neural networks, long-short-term memory networks, and transformers. It remains unclear how to design provably efficient algorithms for training these neural networks to learn from sequential data. My goal is to lay the algorithmic foundation of federated learning with sequential data, which contributes novel algorithms for learning from a range of real-world sequential data (e.g., natural language, electronic health record, transportation, time series, etc.) using state-of-the-art deep neural networks. In this talk, I will first motivate the problem by showing that the transformer, which is widely used for sequential data learning, has an unbounded smooth landscape. Then, I will introduce provably efficient federated deep learning algorithms in the presence of unbounded smoothness. In particular, I will introduce a few efficient algorithms for various settings of federated learning, including homogeneous data, heterogeneous data, and partial client participation. The main result is twofold. First, we show that the designed algorithms provably small computational and communication complexities. Second, we establish fundamental hardness results in the unbounded smoothness setting. Ultimately, I will discuss the future challenges of extending our research framework from small-scale neural networks to large language models.

Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility

Two-sided matching markets have been widely studied in the literature due to their rich applications. Since participants are usually uncertain about their preferences, online algorithms have recently been adopted to learn them through iterative interactions. An existing work initiates the study of this problem in a many-to-one setting with responsiveness. However, their results are far from optimal and lack guarantees of incentive compatibility. We first extend an existing algorithm for the one-to-one setting to this more general setting and show it achieves a near-optimal bound for player-optimal regret. Nevertheless, due to the substantial requirement for collaboration, a single player's deviation could lead to a huge increase in its own cumulative rewards and a linear regret for others. In this paper, we aim to enhance the regret bound in many-to-one markets while ensuring incentive compatibility. We first propose the adaptively explore-then-deferred-acceptance (AETDA) algorithm for responsiveness setting and derive an upper bound for player-optimal stable regret while demonstrating its guarantee of incentive compatibility. This result is a significant improvement over existing works. And to the best of our knowledge, it constitutes the first player-optimal guarantee in matching markets that offers such robust assurances. We also consider broader substitutable preferences, one of the most general conditions to ensure the existence of a stable matching and cover responsiveness. We devise an online DA (ODA) algorithm and establish an upper bound for the player-pessimal stable regret for this setting.

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs

Causal effect estimation from observational data is a fundamental task in empirical sciences. It becomes particularly challenging when unobserved confounders are involved in a system. This paper focuses on front-door adjustment – a classic technique which, using observed mediators allows to identify causal effects even in the presence of unobserved confounding. While the statistical properties of the front-door estimation are quite well understood, its algorithmic aspects remained unexplored for a long time. In 2022, Jeong, Tian, and Bareinboim presented the first polynomial-time algorithm for finding sets satisfying the front-door criterion in a given directed acyclic graph (DAG), with an O(n³(n+m)) run time, where n denotes the number of variables and m the number of edges of the causal graph. In our work, we give the first linear-time, i.e., O(n+m), algorithm for this task, which thus reaches the asymptotically optimal time complexity. This result implies an O(n(n+m)) delay enumeration algorithm of all front-door adjustment sets, again improving previous work by a factor of n³. Moreover, we provide the first linear-time algorithm for finding a minimal front-door adjustment set. We offer implementations of our algorithms in multiple programming languages to facilitate practical usage and empirically validate their feasibility, even for large graphs.

Clinical notes classification system for automated identification of diabetic patients: Hybrid approach integrating rules, information extraction and machine learning

Efficient medical information management is essential in today’s healthcare, significantly to automate diagnoses of chronic diseases. This study focuses on the automated identification of diabetic patients through a clinical note classification system. This innovative approach combines rules, information extraction, and machine learning algorithms to promise greater accuracy and adaptability. Initially, the four algorithms evaluated showed similar performance, with Gradient Boosting standing out with an accuracy of 0.999. They were tested on our clinical and oncology notes, where SVM excelled in correctly labeling non-oncology notes with a 0.99. Gradient Boosting had the best average with 0.966. The combination of rules, information extraction, and Random Forest provided the best average performance, significantly improving the classification of clinical notes and reducing the margin of error in identifying diabetic patients. The principal contribution of this research lies in the pioneering integration of rule-based methods, information extraction techniques, and machine learning algorithms for enhanced accuracy in diabetic patient identification. For future work, we consider implementing these algorithms in natural clinical settings to evaluate their practical performance. Additionally, additional approaches will be explored to improve the accuracy and applicability of clinical note-grading systems in healthcare.

Comparison of K-Means, K-Medoids and K-Means++ algorithms based on the Calinski-Harabasz index for COVID-19 epidemic in China

The novel coronavirus spreads from person to person through close contact and respiratory droplets such as coughing or sneezing. Various studies have been conducted globally to deal with COVID-19. However, no cure for the virus has been found , and efficient data processing methods for sudden outbreaks have not yet been identified. This study compares three algorithms for data sets to analyze clustering patterns to determine the best data processing method. The data of this study comes from the Chinese Center for Disease Control and Prevention, including two attributes of confirmed cases and death cases. We selected the data from the initial stage of the outbreak until October 31, 2021. We compared the data analysis and processing results of the clustering of the spread of the new coronavirus in China by the K-Means, K-Medoids and K-Means++ algorithms. By comparing the Calinski-Harabasz index values from K=2 to K=10, the results show that the K-Means, K-Medoids and K-Means++ algorithms have almost the same clustering effect when K does not exceed 6, but when the K value is greater than 6. When the K-Medoids clustering effect is significantly better, therefore, from the three clustering algorithms used, it can be concluded that the best method for clustering the spread of the novel coronavirus outbreak in China is the K-Medoids method. The results of this study provides ideas for future researchers to choose an appropriate cluster analysis method to effectively process the data in the early stages of the epidemic.

E-Commerce Website Sales Prediction using Machine Learning Algorithm

The business model used in the e-commerce web site, for which the model is implemented, includes many sellers that sell the same product at the same time at different prices where the company operates a market place model. The demand prediction for such a model should consider the price of the same product sold by competing sellers along the features of these sellers. In this study we first applied different regression algorithms for specific set of products of one department of a company that is one of the most popular online e-commerce companies .Supply and demand are two fundamental concepts of sellers and customers. Predicting demand accurately is critical for organizations in order to be able to make plans. In this paper, we propose a new approach for demand prediction on an e-commerce web site. The proposed model differs from earlier models in several ways

Preoperatively predicting vessels encapsulating tumor clusters in hepatocellular carcinoma: Machine learning model based on contrast-enhanced computed tomography.

Recently, vessels encapsulating tumor clusters (VETC) was considered as a distinct pattern of tumor vascularization which can primarily facilitate the entry of the whole tumor cluster into the bloodstream in an invasion independent manner, and was regarded as an independent risk factor for poor prognosis in hepatocellular carcinoma (HCC). To develop and validate a preoperative nomogram using contrast-enhanced computed tomography (CECT) to predict the presence of VETC+ in HCC. We retrospectively evaluated 190 patients with pathologically confirmed HCC who underwent CECT scanning and immunochemical staining for cluster of differentiation 34 at two medical centers. Radiomics analysis was conducted on intratumoral and peritumoral regions in the portal vein phase. Radiomics features, essential for identifying VETC+ HCC, were extracted and utilized to develop a radiomics model using machine learning algorithms in the training set. The model's performance was validated on two separate test sets. Receiver operating characteristic (ROC) analysis was employed to compare the identified performance of three models in predicting the VETC status of HCC on both training and test sets. The most predictive model was then used to constructed a radiomics nomogram that integrated the independent clinical-radiological features. ROC and decision curve analysis were used to assess the performance characteristics of the clinical-radiological features, the radiomics features and the radiomics nomogram. The study included 190 individuals from two independent centers, with the majority being male (81%) and a median age of 57 years (interquartile range: 51-66). The area under the curve (AUC) for the combined radiomics features selected from the intratumoral and peritumoral areas were 0.825, 0.788, and 0.680 in the training set and the two test sets. A total of 13 features were selected to construct the Rad-score. The nomogram, combining clinical-radiological and combined radiomics features could accurately predict VETC+ in all three sets, with AUC values of 0.859, 0.848 and 0.757. Decision curve analysis revealed that the radiomics nomogram was more clinically useful than both the clinical-radiological feature and the combined radiomics models. This study demonstrates the potential utility of a CECT-based radiomics nomogram, incorporating clinical-radiological features and combined radiomics features, in the identification of VETC+ HCC.

Design of Pseudo-Command Restricted Controller for Tailless Unmanned Aerial Vehicles Based on Attainable Moment Set

This work investigates the pseudo-command restricted problem for tailless unmanned aerial vehicles with snake-shaped maneuver flight missions. The main challenge of designing such a pseudo-command restricted controller lies in the fact that the necessity of control allocation means it will be difficult to provide a precise envelope of pseudo-command to the flight controller; designing a compensation system to deal with insufficient capabilities beyond this envelope is another challenge. The envelope of pseudo-command can be expressed by attainable moment sets, which leave some open problems, such as how to obtain the attainable moment sets online and how to reduce the computational complexity of the algorithm, as well as how to ensure independent control allocation and the convexity of attainable moments sets. In this article, an innovative algorithm is proposed for the calculation of attainable moment sets, which can be implemented by fitting wind tunnel data into a function to solve the problems presented above. Furthermore, the algorithm is independent of control allocation and can be obtained online. Moreover, based on the above attainable moment sets algorithm, a flight performance assurance system is designed, which not only guarantees that the command is constrained within the envelope so that its behavior is more predictable, but also supports adaptive compensation for the pseudo-command restricted controller. Finally, the effectiveness of the AMS algorithm and the advantages of the pseudo-command restricted control system are validated through two sets of independent simulations.

Decision algorithm for picture fuzzy sets and Aczel Alsina aggregation operators based on unknown degree of wights

Aggregation operators (AOs) are well-known and efficient mathematical tools that are utilized to overcome the impact of imprecise and vague information during the aggregation process. The theoretical concepts of Aczel Alsina aggregation expressions are an extension of triangular norms and become a hot research topic in the environment of the fuzzy framework. The power operators provide a smooth approximation and are used to mitigate the influence of redundant or insufficient information on the attributes or criteria. Some robust aggregation approaches are developed by combining two different theories, like power operators and Aczel Alsina aggregation tools. This article aims to explore the theory of picture fuzzy sets (PFSs), an extended version of fuzzy sets, and intuitionistic fuzzy sets. Some robust operations of Aczel Alsina aggregation tools are also present in light of the picture fuzzy environment. We established a class of new methodologies in the light of picture fuzzy information, including picture fuzzy Aczel Alsina power weighted average (PFAAPWA) and picture fuzzy Aczel Alsina power ordered weighted average (PFAAPOWA) operators. We also developed an appropriate approach like picture fuzzy Aczel Alsina power weighted geometric (PFAAPWG) and picture fuzzy Aczel Alsina power ordered weighted geometric (PFAAPOWG) operators. Notable properties and characteristics of proposed methodologies are also demonstrated. Our invented approaches not only aggregate complicated information but can clearly define interrelationships among several arguments. Moreover, we establish an algorithm for the multi-attribute group decision-making (MAGDM) problem to handle the impact of redundant and vague information on human opinions. Finally, we study an experimental case study to evaluate an appropriate optimal option from available options. To reveal consistency and effectiveness of developed approaches, influence study by changing various parametric values and comparative study by comparing results of existing approaches.

An algorithm for automatic setting of imaging conditions in X-ray CT system

An algorithm for automatic setting of imaging conditions in X-ray CT system