New Ranking of Generalized Quadrilateral Shape Fuzzy Number Using Centroid Technique

The output of the fuzzy set is reduced by one for the defuzzification procedure.It is employed to provide a comprehensible outcome from a fuzzy inference process.This page provides further information about the defuzzifica-tion approach for quadrilateral fuzzy numbers,which may be used to convert them into discrete values.Defuzzification demonstrates how useful fuzzy ranking systems can be.Our major purpose is to develop a new ranking method for gen-eralized quadrilateral fuzzy numbers.The primary objective of the research is to provide a novel approach to the accurate evaluation of various kinds of fuzzy inte-gers.Fuzzy ranking properties are examined.Using the counterexamples of Lee and Chen demonstrates the fallacy of the ranking technique.So,a new approach has been developed for dealing with fuzzy risk analysis,risk management,indus-trial engineering and optimization,medicine,and artificial intelligence problems:the generalized quadrilateral form fuzzy number utilizing centroid methodology.As you can see,the aforementioned scenarios are all amenable to the solution pro-vided by the generalized quadrilateral shape fuzzy number utilizing centroid methodology.It’s laid out in a straightforward manner that’s easy to grasp for everyone.The rating method is explained in detail,along with numerical exam-ples to illustrate it.Last but not least,stability evaluations clarify why the Gener-alized quadrilateral shape fuzzy number obtained by the centroid methodology outperforms other ranking methods.

Weakness Ranking Method for Subsystems of Heavy-Duty Machine Tools Based on FMECA Information

Heavy-duty machine tools are composed of many subsystems with different functions,and their reliability is governed by the reliabilities of these subsystems.It is important to rank the weaknesses of subsystems and identify the weakest subsystem to optimize products and improve their reliabilities.However,traditional ranking methods based on failure mode effect and critical analysis(FMECA)does not consider the complex maintenance of products.Herein,a weakness ranking method for the subsystems of heavy-duty machine tools is proposed based on generalized FMECA information.In this method,eight reliability indexes,including maintainability and maintenance cost,are considered in the generalized FMECA information.Subsequently,the cognition best worst method is used to calculate the weight of each screened index,and the weaknesses of the subsystems are ranked using a technique for order preference by similarity to an ideal solution.Finally,based on the failure data collected from certain domestic heavy-duty horizontal lathes,the weakness ranking result of the subsystems is obtained to verify the effectiveness of the proposed method.An improved weakness ranking method that can comprehensively analyze and identify weak subsystems is proposed herein for designing and improving the reliability of complex electromechanical products.

Ranking important nodes in complex networks by simulated annealing

In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented.First, the concept of an importance sequence（IS） to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks.

Comparison of Block Design Nonparametric Subset Selection Rules Based on Alternative Scoring Rules

This article compares the size of selected subsets using nonparametric subset selection rules with two different scoring rules for the observations. The scoring rules are based on the expected values of order statistics of the uniform distribution (yielding rank values) and of the normal distribution (yielding normal score values). The comparison is made using state motor vehicle traffic fatality rates, published in a 2016 article, with fifty-one states (including DC as a state) and over a nineteen-year period (1994 through 2012). The earlier study considered four block design selection rules—two for choosing a subset to contain the “best” population (i.e., state with lowest mean fatality rate) and two for the “worst” population (i.e., highest mean rate) with a probability of correct selection chosen to be 0.90. Two selection rules based on normal scores resulted in selected subset sizes substantially smaller than corresponding rules based on ranks (7 vs. 16 and 3 vs. 12). For two other selection rules, the subsets chosen were very close in size (within one). A comparison is also made using state homicide rates, published in a 2022 article, with fifty states and covering eight years. The results are qualitatively the same as those obtained with the motor vehicle traffic fatality rates.

A survey on network node ranking algorithms:Representative methods,extensions,and applications

The ranking of network node importance is one of the most essential problems in the field of network science.Node ranking algorithms serve as an essential part in many application scenarios such as search engine,social networks,and recommendation systems.This paper presents a systematic review on three representative methods:node ranking based on centralities,Page Rank algorithm,and HITS algorithm.Furthermore,we investigate the latest extensions and improvements of these representative methods,provided with several main application fields.Inspired by the survey of current literature,we attempt to propose promising directions for future research.The conclusions of this paper are enlightening and beneficial to both the academic and industrial communities.

A personalized trustworthy service selection method

A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP （analytic hierarchy process） and PROMETHEE （preference ranking organization method for enrichment evaluations） is proposed. AHP is used to determine the weights of trust metrics according to users＇ preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users＇ personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.

An Improved Jellyfish Algorithm for Multilevel Thresholding of Magnetic Resonance Brain Image Segmentations

Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.

Using a process-oriented methodology to precisely evaluate temperature suitability for potato growth in China using GIS

A process-oriented methodology to conduct precise evaluation temporally and spatially on temperature suitability for potato growth was applied in China. Arable lands in China were gridded with 1 km×1 km geographic units, and potential potato phenology in each unit was automatically identified in terms of the potato planting initial temperature and effective accu- mulated temperature. A temperature thermal response coefficient model was used to compute a temperature suitability value for each day of potato phenology in each geographic unit. In addition, five temperature suitability ranking methods were applied to define suitable areas： （1） upper fourth quantile, （2） median, （3） expected value＋1/4 standard deviation, （4） expected value＋1/2 standard deviation, （5） expected value＋1 standard deviation. A validation indicator was innovated to test the effectiveness of the five ranking methods. The results showed that from a strict degree point of view, the five methods sequence was as follows： 1=3〉4〉2〉5, with a and c determined as the two best ranking methods. For methods 1 and 3, the suitable potato growing area was 1 of 57.76× 10^4 km2. In addition, the suitable, areas were spatially coincident with the main potato producing counties. The study output technically supports the proposal from China＇s government that there is a large potential area to grow winter-ploughed potato in South China because the potential suitable area for growing potato is approximately 2×10^7 ha. In southeast Heilongjiang and east Jilin, where it is hilly and mountainous, there are still some potentially suitable areas for potato growing accounting for nearly 2.32×10^6 ha. The authors suggest to optimize the agricultural regionalization and layout in China and to adjust the cropping pattern structure.

Diversity of Pareto front: A multiobjective genetic algorithm based on dominating information

In this paper, the diversity information included by dominating number is analyzed, and the probabilistic relationship between dominating number and diversity in the space of objective function is proved. A ranking method based on dominating number is proposed to build the Pareto front. Without increasing basic Pareto method’s computation complexity and introducing new parameters, a new multiobjective genetic algorithm based on proposed ranking method (MOGA-DN) is presented. Simulation results on function optimization and parameters optimization of control system verify the efficiency of MOGA-DN.

Random Low Patch⁃rank Method for Interpolation of Regularly Missing Traces

Assuming seismic data in a suitable domain is low rank while missing traces or noises increase the rank of the data matrix,the rank⁃reduced methods have been applied successfully for seismic interpolation and denoising.These rank⁃reduced methods mainly include Cadzow reconstruction that uses eigen decomposition of the Hankel matrix in the f⁃x(frequency⁃spatial)domain,and nuclear⁃norm minimization(NNM)based on rigorous optimization theory on matrix completion(MC).In this paper,a low patch⁃rank MC is proposed with a random⁃overlapped texture⁃patch mapping for interpolation of regularly missing traces in a three⁃dimensional(3D)seismic volume.The random overlap plays a simple but important role to make the low⁃rank method effective for aliased data.It shifts the regular column missing of data matrix to random point missing in the mapped matrix,where the missing data increase the rank thus the classic low⁃rank MC theory works.Unlike the Hankel matrix based rank⁃reduced method,the proposed method does not assume a superposition of linear events,but assumes the data have repeated texture patterns.Such data lead to a low⁃rank matrix after the proposed texture⁃patch mapping.Thus the methods can interpolate the waveforms with varying dips in space.A fast low⁃rank factorization method and an orthogonal rank⁃one matrix pursuit method are applied to solve the presented interpolation model.The former avoids the singular value decomposition(SVD)computation and the latter only needs to compute the large singular values during iterations.The two fast algorithms are suitable for large⁃scale data.Simple averaging realizations of several results from different random⁃overlapped texture⁃patch mappings can further increase the reconstructed signal⁃to⁃noise ratio(SNR).Examples on synthetic data and field data are provided to show successful performance of the presented method.

Daily Generation Strategies with Consideration of Electricity Contract and Spinning Reserve

When programming the daily generation strategies, power plants consider not only the competitive bids in spot market and the original purchase contracts with distribution companies or users, but also the spinning reserve. Aiming at this goal, the paper puts forward a daily generating model, which is a nonlinear programming model containing integral and continous variables, to coordinate the power volumes of competitive bids, contract and the spinning reserve of power plants and thus to maximize their profits. Then, the model is simplified to ease its solving process, and solved by priority ranking method based on efficiency and quadratic programming. The simulation result of a case study shows that the proposed scheme is reasonable and practicable.

On Equalities for BLUEs under Misspecified Gauss-Markov Models

This paper studies relationships between the best linear unbiased estimators （BLUEs） of an estimable parametric functions Kβunder the Gauss-Markov model {y, Xβ, σ^2]E} and its misspecified model {y, X0β,σ^2∑0}. In addition, relationships between BLUEs under a restricted Gauss Markov model and its misspecified model are also investigated.

Estimations of Parametric Functions under a System of Linear Regression Equations with Correlated Errors

Estimations of parametric functions under a system of linear regression equations with correlated errors across equations involve many complicated operations of matrices and their generalized inverses. In the past several years, a useful tool -- the matrix rank method was utilized to simplify various complicated operations of matrices and their generalized inverses. In this paper, we use the matrix rank method to derive a variety of new algebraic and statistical properties for the best linear unbiased estimators （BLUEs） of parametric functions under the system. In particular, we give the necessary and sufficient conditions for some equalities, additive and block decompositions of BLUEs of parametric functions under the system to hold.

Cloudy fuzzy inventory model under imperfect production process with demand dependent production rate

The aim of this article is an effort to initiate the cloudy fuzzy number in developing classical economic production lot-size model of an item produced in scrappy production process with fixed ordering cost and without shortages.Here,the market value of an item is cloudy fuzzy number and the production rate is demand dependent.In general,fuzziness of any parameter remains fixed over time,but in practice,fuzziness of parameter begins to reduce as time progresses because of collected experience and knowledge that motivates to take cloudy fuzzy number.The model is solved in a crisp,general fuzzy and cloudy fuzzy environment using Yager’s index method and De and Beg’s ranking index method and comparisons are made for all cases and better results obtained in the cloudy fuzzy model.The model is solved by dominance based Particle Swarm Optimization algorithm to obtain optimal decision and numerical examples and sensitivity analyses are presented to justify the notion.

A Semantic Ontology Structure-based Approach for Retrieving Similar Medical Images

Radiology doctors perform text-based image retrieval when they want to retrieve medical images.However,the accuracy and efficiency of such retrieval cannot keep up with the requirements.An innovative algorithm is being proposed to retrieve similar medical images.First,we extract the professional terms from the ontology structure and use them to annotate the CT images.Second,the semantic similarity matrix of ontology terms is calculated according to the structure of the ontology.Lastly,the corresponding semantic distance is calculated according to the marked vector,which contains different annotations.We use 120 real liver CT images(divided into six categories)of a top three-hospital to run the algorithm of the program.Result shows that the retrieval index"Precision"is 80.81%,and the classification index"AUC(Area Under Curve)"under the"ROC curve"(Receiver Operating Characteristic)is 0.945.