Search

Recently, various types of single valued neutrosophic (SVN) rough set models were presented based on the same inclusion relation. However, there is another SVN inclusion relation in SVN sets. In this paper, we propose a new type of SVN covering rough set model based on the new inclusion relation. Furthermore, the graph and matrix representations of the new SVN covering approximation operators are presented. Firstly, the notion of SVN β 2 -covering approximation space is proposed, which is decided by the new inclusion relation. Then, a type of SVN covering rough set model under the SVN β 2 -covering approximation space is presented. Moreover, there is a corresponding SVN relation rough set model based on a SVN relation induced by the SVN β 2 -covering, and two conditions under which the SVN β 2 -covering can induce a symmetric SVN relation are presented. Thirdly, the graph and matrix representations of the new SVN covering rough set model are investigated. Finally, we propose a novel method for decision making (DM) problems in paper defect diagnosis under the new SVN covering rough set model.

In recent years, crowded stampede incidents have occurred frequently, resulting in more and more serious losses. The common cause of such incidents is that when large-scale populations gather in a limited area, the population is highly unstable. In emergency situations, only when the crowd reaches the safe exit as soon as possible within a limited evacuation time to complete evacuation can the loss and casualties be effectively reduced. Therefore, the safety evacuation management of people in public places in emergencies has become a hot topic in the field of public security. Based on the analysis of the factors affecting the crowd path selection, this paper proposes an improved path-planning algorithm based on BEME (Balanced Evacuation for Multiple Exits). And pedestrian evacuation simulation is carried out in multi-exit symmetrical facilities. First, this paper optimizes the update method of the GSDL list in the BEME algorithm as the basis for evacuating pedestrians to choose an exit. Second, the collision between pedestrians is solved by defining the movement rule and collision avoidance strategy. Finally, the algorithm is compared with BEME and traditional path-planning algorithms. The results show that the algorithm can further shorten the global evacuation distance of the symmetrical evacuation scene, effectively balance the number of pedestrians at each exit and reduce the evacuation time. In addition, this improved algorithm uses a collision avoidance strategy to solve the collision and congestion problems in path planning, which helps to maximize evacuation efficiency. Whether the setting of the scene or the setting of the exit, all studies are based on symmetric implementation. This is more in line with the crowd evacuation in the real scene, making the experimental results more meaningful.

The variant, encryption, and confusion of WebShell results in problems in the detection method based on feature selection, such as poor detection effect and weak generalization ability. In order to solve this problem, a method of WebShell detection based on regularized neighborhood component analysis (RNCA) is proposed. The RNCA algorithm can effectively reduce the dimension of data while ensuring the accuracy of classification. In this paper, it is innovatively applied to a WebShell detection neighborhood, taking opcode behavior sequence features as the main research object, constructing vocabulary by using opcode sequence features with variable length, and effectively reducing the dimension of WebShell features from the perspective of feature selection. The opcode sequence selected by the algorithm is symmetrical with the source code file, which has great reference value for WebShell classification. On the issue of the single feature, this paper uses the fusion of behavior sequence features and text static features to construct a feature combination with stronger representation ability, which effectively improves the recognition rate of WebShell to a certain extent.

The plastic modifications in synaptic connectivity is primarily from changes triggered by neuromodulated dopamine signals. These activities are controlled by neuromodulation, which is itself under the control of the brain. The subjective brain’s self-modifying abilities play an essential role in learning and adaptation. The artificial neural networks with neuromodulated plasticity are used to implement transfer learning in the image classification domain. In particular, this has application in image detection, image segmentation, and transfer of learning parameters with significant results. This paper proposes a novel approach to enhance transfer learning accuracy in a heterogeneous source and target, using the neuromodulation of the Hebbian learning principle, called NDHTL (Neuromodulated Dopamine Hebbian Transfer Learning). Neuromodulation of plasticity offers a powerful new technique with applications in training neural networks implementing asymmetric backpropagation using Hebbian principles in transfer learning motivated CNNs (Convolutional neural networks). Biologically motivated concomitant learning, where connected brain cells activate positively, enhances the synaptic connection strength between the network neurons. Using the NDHTL algorithm, the percentage of change of the plasticity between the neurons of the CNN layer is directly managed by the dopamine signal’s value. The discriminative nature of transfer learning fits well with the technique. The learned model’s connection weights must adapt to unseen target datasets with the least cost and effort in transfer learning. Using distinctive learning principles such as dopamine Hebbian learning in transfer learning for asymmetric gradient weights update is a novel approach. The paper emphasizes the NDHTL algorithmic technique as synaptic plasticity controlled by dopamine signals in transfer learning to classify images using source-target datasets. The standard transfer learning using gradient backpropagation is a symmetric framework. Experimental results using CIFAR-10 and CIFAR-100 datasets show that the proposed NDHTL algorithm can enhance transfer learning efficiency compared to existing methods.

Canonical correlation analysis (CCA) is the default method for investigating the linear dependence structure between two random vectors, but it might not detect nonlinear dependencies. This paper models the nonlinear dependencies between two random vectors by the perturbed independence distribution, a multivariate semiparametric model where CCA provides an insight into their nonlinear dependence structure. The paper also investigates some of its probabilistic and inferential properties, including marginal and conditional distributions, nonlinear transformations, maximum likelihood estimation and independence testing. Perturbed independence distributions are closely related to skew-symmetric ones.

This Special Issue covers symmetric and asymmetric data that occur in real-life problems. We invited authors to submit their theoretical or experimental research to present engineering and economic problem solution models that deal with symmetry or asymmetry of different data types. The Special Issue gained interest in the research community and received many submissions. After rigorous scientific evaluation by editors and reviewers, seventeen papers were accepted and published. The authors proposed different solution models, mainly covering uncertain data in multi-criteria decision-making problems as complex tools to balance the symmetry between goals, risks, and constraints to cope with the complicated problems in engineering or management. Therefore, we invite researchers interested in the topics to read the papers provided in the Special Issue.

In decision-making process, decision-makers may make different decisions because of their different experiences and knowledge. The abnormal preference value given by the biased decision-maker (the value that is too large or too small in the original data) may affect the decision result. To make the decision fair and objective, this paper combines the advantages of the power average (PA) operator and the Bonferroni mean (BM) operator to define the generalized fuzzy soft power Bonferroni mean (GFSPBM) operator and the generalized fuzzy soft weighted power Bonferroni mean (GFSWPBM) operator. The new operator not only considers the overall balance between data and information but also considers the possible interrelationships between attributes. The excellent properties and special cases of these ensemble operators are studied. On this basis, the idea of the bidirectional projection method based on the GFSWPBM operator is introduced, and a multi-attribute decision-making method, with a correlation between attributes, is proposed. The decision method proposed in this paper is applied to a software selection problem and compared to the existing methods to verify the effectiveness and feasibility of the proposed method.

This paper deals with uncertainty, asymmetric information, and risk modelling in a complex power system. The uncertainty is managed by using probability and decision theory methods. More specifically, influence diagrams—as extended Bayesian network functions with interval probabilities represented through credal sets—were chosen for the predictive modelling scenario of replacing the most critical circuit breakers in optimal time. Namely, based on the available data on circuit breakers and other variables that affect the considered model of a complex power system, a group of experts was able to assess the situation using interval probabilities instead of crisp probabilities. Furthermore, the paper examines how the confidence interval width affects decision-making in this context and eliminates the information asymmetry of different experts. Based on the obtained results for each considered interval width separately on the action to be taken over the considered model in order to minimize the risk of the power system failure, it can be concluded that the proposed approach clearly indicates the advantages of using interval probability when making decisions in systems such as the one considered in this paper.

In this paper, we introduce a new representation of semiopenness of L-fuzzy sets in RL-fuzzy bitopological spaces based on the concept of pseudo-complement. The concepts of pairwise RL-fuzzy semicontinuous and pairwise RL-fuzzy irresolute functions are extended and discussed based on the (i,j)-RL-semiopen gradation. Further, pairwise RL-fuzzy semi-compactness of an L-fuzzy set in RL-fuzzy bitopological spaces are given and characterized. As RL-fuzzy bitopology is a generalization of L-bitopology, RL-bitopology, L-fuzzy bitopology, and RL-fuzzy topology, the results of our paper are more general.

The dataset distribution of actual logging is asymmetric, as most logging data are unlabeled. With the traditional classification model, it is hard to predict the oil and gas reservoir accurately. Therefore, a novel approach to the oil layer recognition model using the improved whale swarm algorithm (WOA) and semi-supervised support vector machine (S3VM) is proposed in this paper. At first, in order to overcome the shortcomings of the Whale Optimization Algorithm applied in the parameter-optimization of the S3VM model, such as falling into a local optimization and low convergence precision, an improved WOA was proposed according to the adaptive cloud strategy and the catfish effect. Then, the improved WOA was used to optimize the kernel parameters of S3VM for oil layer recognition. In this paper, the improved WOA is used to test 15 benchmark functions of CEC2005 compared with five other algorithms. The IWOA–S3VM model is used to classify the five kinds of UCI datasets compared with the other two algorithms. Finally, the IWOA–S3VM model is used for oil layer recognition. The result shows that (1) the improved WOA has better convergence speed and optimization ability than the other five algorithms, and (2) the IWOA–S3VM model has better recognition precision when the dataset contains a labeled and unlabeled dataset in oil layer recognition.

Cloud based healthcare computing have changed the face of healthcare in many ways. The main advantages of cloud computing in healthcare are scalability of the required service and the provision to upscale or downsize the data storge, collaborating Artificial Intelligence (AI) and machine learning. The current paper examined various research studies to explore the utilization of intelligent techniques in health systems and mainly focused into the security and privacy issues in the current technologies. Despite the various benefits related to cloud-computing applications for healthcare, there are different types of management, technology handling, security measures, and legal issues to be considered and addressed. The key focus of this paper is to address the increased demand for cloud computing and its definition, technologies widely used in healthcare, their problems and possibilities, and the way protection mechanisms are organized and prepared when the company chooses to implement the latest evolving service model. In this paper, we focused on a thorough review of current and existing literature on different approaches and mechanisms used in e-Health to deal with security and privacy issues. Some of these approaches have strengths and weaknesses. After selecting original articles, the literature review was carried out, and we identified several models adopted in their solutions. We arrived at the reviewed articles after comparing the models used.

The fractional integral is a function known for the elegant results obtained when introducing new operators, it has proved to have interesting applications. In the present paper, differential subordinations and superodinations for the fractional integral of the confluent hypergeometric function introduced in a previously published paper are presented. A sandwich-type theorem at the end of the original part of the paper connects the outcomes of the studies done using the dual theories.

Both the theory of differential subordination and its dual, the theory of differential superordination, introduced by Professors Miller and Mocanu are based on reinterpreting certain inequalities for real-valued functions for the case of complex-valued functions. Studying subordination and superordination properties using different types of operators is a technique that is still widely used, some studies resulting in sandwich-type theorems as is the case in the present paper. The fractional integral of confluent hypergeometric function is introduced in the paper and certain subordination and superordination results are stated in theorems and corollaries, the study being completed by the statement of a sandwich-type theorem connecting the results obtained by using the two theories.

The idea of inequality has been extended from the real plane to the complex plane through the notion of subordination introduced by Professors Miller and Mocanu in two papers published in 1978 and 1981. With this notion came a whole new theory called the theory of differential subordination or admissible functions theory. Later, in 2003, a particular form of inequality in the complex plane was also defined by them as dual notion for subordination, the notion of differential superordination and with it, the theory of differential superordination appeared. In this paper, the theory of differential superordination is applied to confluent hypergeometric function. Hypergeometric functions are intensely studied nowadays, the interest on the applications of those functions in complex analysis being renewed by their use in the proof of Bieberbach’s conjecture given by de Branges in 1985. Using the theory of differential superodination, best subordinants of certain differential superordinations involving confluent (Kummer) hypergeometric function are stated in the theorems and relation with previously obtained results are highlighted in corollaries using particular functions and in a sandwich-type theorem. An example is also enclosed in order to show how the theoretical findings can be applied.

Topology optimization is a modern method for optimizing the material distribution in a given space, automatically searching for the ideal design of the product. The method aims to maximize the design performance of the system regarding given conditions. In engineering practice, a given space is first described using the finite element method and, subsequently, density-based method with solid isotropic material with penalty. Then, the final shape is found using a gradient-based method, such as the optimality criteria algorithm. However, obtaining the ideal shape is highly dependent on the correct setting of numerical parameters. This paper focuses on the sensitivity analysis of key formulations of topology optimization using the implementation of mathematical programming techniques in MATLAB software. For the purposes of the study, sensitivity analysis of a simple spatial task-cantilever bending-is performed. This paper aims to present the formulations of the optimization problem-in this case, minimization of compliance. It should be noted that this paper does not present any new mathematical formulas but rather provides an introduction into the mathematical theory (including filtering methods and calculating large-size problems using the symmetry of matrices) as well as a step-by step guideline for the minimization of compliance within the density-based topology optimization and search for an optimal shape. The results can be used for complex commercial applications produced by traditional manufacturing processes or by additive manufacturing methods. Web of Science 13 4 art. no. 712

This paper introduces a general approach to the idea of protection of graphs, which encompasses the known variants of secure domination and introduces new ones. Specifically, we introduce the study of secure w-domination in graphs, where w=(w0,w1,⋯,wl) is a vector of nonnegative integers such that w0&ge, 1. The secure w-domination number is defined as follows. Let G be a graph and N(v) the open neighborhood of v&isin, V(G). We say that a function f:V(G)⟶{0,1,⋯,l} is a w-dominating function if f(N(v))=&sum, u&isin, N(v)f(u)&ge, wi for every vertex v with f(v)=i. The weight of f is defined to be &omega, (f)=&sum, v&isin, V(G)f(v). Given a w-dominating function f and any pair of adjacent vertices v,u&isin, V(G) with f(v)=0 and f(u)&gt, 0, the function fu&rarr, v is defined by fu&rarr, v(v)=1, fu&rarr, v(u)=f(u)&minus, 1 and fu&rarr, v(x)=f(x) for every x&isin, V(G)∖{u,v}. We say that a w-dominating function f is a secure w-dominating function if for every v with f(v)=0, there exists u&isin, N(v) such that f(u)&gt, 0 and fu&rarr, v is a w-dominating function as well. The secure w-domination number of G, denoted by &gamma, ws(G), is the minimum weight among all secure w-dominating functions. This paper provides fundamental results on &gamma, ws(G) and raises the challenge of conducting a detailed study of the topic.

In this research, the fourth axiom to improve the well-defined examination of similarity measures is studied, where the measures have a symmetric structure. We first provide a theoretic enhancement of three correlation coefficient similarity measures that were proposed by a source paper. Second, we use the same numerical example proposed by the source paper for pattern recognition problems to illustrate that the weighted correlation coefficient similarity measure is dependent on the set of weights. Finally, we demonstrate that the correlation coefficient similarity measure in the intuitionistic fuzzy set environment can address the issue of practical fault diagnosis when solving the turbine engine problems using similarity measures with symmetric characteristics.

In this paper, we study Carlitz&rsquo, s type higher-order (p,q)-Genocchi polynomials. To be specific, we define Carlitz&rsquo, s type higher-order (p,q)-Genocchi polynomials and Carlitz&rsquo, s type higher-order (h,p,q)-Genocchi polynomials. This paper also explores properties including distribution relation and symmetric identities. In addition, we find alternating (p,q)-power sums. We identify symmetric identities using Carlitz&rsquo, s type higher-order (h,p,q)-Genocchi polynomials and alternating (p,q)-power sums.

The paper contains a discussion on solutions to symmetric type of fuzzy stochastic differential equations. The symmetric equations under study have drift and diffusion terms symmetrically on both sides of equations. We claim that such symmetric equations have unique solutions in the case that equations&rsquo, coefficients satisfy a certain generalized Lipschitz condition. To show this, we prove that an approximation sequence converges to the solution. Then, a study on stability of solution is given. Some inferences for symmetric set-valued stochastic differential equations end the paper.

In the intersection of the theories of nonsymmetric Jack polynomials in N variables and representations of the symmetric groups S N one finds the singular polynomials. For certain values of the parameter &kappa, there are Jack polynomials which span an irreducible S N -module and are annihilated by the Dunkl operators. The S N -module is labeled by a partition of N, called the isotype of the polynomials. In this paper the Jack polynomials are of the vector-valued type, i.e., elements of the tensor product of the scalar polynomials with the span of reverse standard Young tableaux of the shape of a fixed partition of N. In particular, this partition is of shape m , m , &hellip, m with 2 k components and the constructed singular polynomials are of isotype m k , m k for the parameter &kappa, = 1 / m + 2 . This paper contains the necessary background on nonsymmetric Jack polynomials and representation theory and explains the role of Jucys&ndash, Murphy elements in the construction. The main ingredient is the proof of uniqueness of certain spectral vectors, namely the list of eigenvalues of the Jack polynomials for the Cherednik&ndash, Dunkl operators, when specialized to &kappa, = 1 / m + 2 . The paper finishes with a discussion of associated maps of modules of the rational Cherednik algebra and an example illustrating the difficulty of finding singular polynomials for arbitrary partitions.

In this paper, new sufficient conditions for oscillation of fourth-order neutral differential equations are established. One objective of our paper is to further improve and complement some well-known results which were published recently in the literature. Symmetry ideas are often invisible in these studies, but they help us decide the right way to study them, and to show us the correct direction for future developments. An example is given to illustrate the importance of our results.

With a focus on the multivariable coupling characteristics in a cross-directional (CD) basis weight control system, we study the coupling characteristics of a CD control system and decoupling control, and we propose a novel multivariable interpolation decoupling control strategy and a real-time decomposition algorithm in this paper. Based on a model of the CD basis weight profile, a system non-square interaction matrix of high-dimensional data is analyzed by experimental studies and numerical simulation. Along the diagonal of the interaction matrix, the matrix block method is adopted to reduce the system dimension and convert it into a square system. A multivariable control system with high dimensionality is divided into several subsystems. For the high-dimensional Toeplitz symmetric subsystem with small-scale coupling characteristics, an interpolation decoupling algorithm is proposed. Then, a decoupling compensator with the structure of a symmetric Toeplitz matrix was obtained. Compared with the conventional diagonal decoupling matrix, the branch number of the new decoupling network is reduced from 2408 to 186, which realizes the fast decoupling of multivariable systems. The results were even better when we used a double size interaction matrix obtained by interpolation between actual values. By designing the diagonalized controller for the new decoupled system, a decouped CD control system for corrugated paper with a basis weight of 133 g/m2 was implemented in an actual project in a paper mill.

In the first part of our paper, we construct a cyclic hypergroup of matrices using the Ends Lemma. Its properties are then, in the second part of the paper, used to describe the symmetry of lower and upper approximations in certain rough sets with respect to invertible subhypergroups of this cyclic hypergroup. Since our approach is widely used in autonomous robotic systems, we suggest an application of our results for the study of detection sensors, which are used especially in mobile robot mapping.

The new general theory dedicated to the stability for LTI MIMO, in particular nonsquare, fractional-order systems described by the Gr&uuml, nwald&ndash, Letnikov discrete-time state&ndash, space domain is presented in this paper. Such systems under inverse model control, principally MV/perfect control, represent a real research challenge due to an infinite number of solutions to the underlying inverse problem for nonsquare matrices. Therefore, the paper presents a new algorithm for fractional-order perfect control with corresponding stability formula involving recently given H- and &sigma, inverse of nonsquare matrices, up to now applied solely to the integer-order plants. On such foundation a new set of stability-related tools is introduced, among them the key role played by so-called control zeros. Control zeros constitute an extension of transmission zeros for nonsquare fractional-order LTI MIMO systems under inverse model control. Based on the sets of stable control zeros a minimum-phase behavior is specified because of the stability of newly defined perfect control law described in the non-integer-order framework. The whole theory is complemented by pole-free fractional-order perfect control paradigm, a special case of fractional-order perfect control strategy. A significant number of simulation examples confirm the correctness and research potential proposed in the paper methodology.

Recently, two classes of univalent functions S e * and K e were introduced and studied. A function f is in S e * if it is analytic in the unit disk, f ( 0 ) = f &prime, ( 0 ) - 1 = 0 and z f &prime, ( z ) f ( z ) ≺ e z . On the other hand, g &isin, K e if and only if z g &prime, &isin, S e * . Both classes are symmetric, or invariant, under rotations. In this paper, we solve a few problems connected with the coefficients of functions in these classes. We find, among other things, the estimates of Hankel determinants: H 2 , 1 , H 2 , 2 , H 3 , 1 . All these estimates improve the known results. Moreover, almost all new bounds are sharp. The main idea used in the paper is based on expressing the discussed functionals depending on the fixed second coefficient of a function in a given class.

The lurch index has recently been introduced in applied kinematics as an integral descriptor of the fluency of the motion of a rigid body in space. It may be defined in different versions, according to the component of motion under investigation. In the present paper, we analyze a rotational lurch index, which describes the fluency of the spin component of motion and whose value depends, through involved relations, on the dynamics of three canonical descriptors of the orientation of a rigid body in space. The aim of the present paper is to offer a closed-form expression of the instantaneous component of the rotational lurch, which leads to the namesake index upon integration and normalization. The closed form of the index is, then, used to evaluate its practical calculation, based on numerical approximations on a number of data sets.

In this paper the model of infection diseases by Marchuk is considered. Mathematical questions which are important in its study are discussed. Among them there are stability of stationary points, construction of the Cauchy matrices of linearized models, estimates of solutions. The novelty we propose is in a distributed feedback control which affects the antibody concentration. We use this control in the form of an integral term and come to the analysis of nonlinear integro-differential systems. New methods for the study of stability of linearized integro&ndash, differential systems describing the model of infection diseases are proposed. Explicit conditions of the exponential stability of the stationary points characterizing the state of the healthy body are obtained. The method of the paper is based on the symmetry properties of the Cauchy matrices which allow us their construction.

This paper presents a formal description and analysis of an SIR (involving susceptible- infectious-recovered subpopulations) epidemic model in a patchy environment with vaccination controls being constant and proportional to the susceptible subpopulations. The patchy environment is due to the fact that there is a partial interchange of all the subpopulations considered in the model between the various patches what is modelled through the so-called travel matrices. It is assumed that the vaccination controls are administered at each community health centre of a particular patch while either the total information or a partial information of the total subpopulations, including the interchanging ones, is shared by all the set of health centres of the whole environment under study. In the case that not all the information of the subpopulations distributions at other patches are known by the health centre of each particular patch, the feedback vaccination rule would have a decentralized nature. The paper investigates the existence, allocation (depending on the vaccination control gains) and uniqueness of the disease-free equilibrium point as well as the existence of at least a stable endemic equilibrium point. Such a point coincides with the disease-free equilibrium point if the reproduction number is unity. The stability and instability of the disease-free equilibrium point are ensured under the values of the disease reproduction number guaranteeing, respectively, the un-attainability (the reproduction number being less than unity) and stability (the reproduction number being more than unity) of the endemic equilibrium point. The whole set of the potential endemic equilibrium points is characterized and a particular case is also described related to its uniqueness in the case when the patchy model reduces to a unique patch. Vaccination control laws including feedback are proposed which can take into account shared information between the various patches. It is not assumed that there are in the most general case, symmetry-type constrains on the population fluxes between the various patches or in the associated control gains parameterizations.

This paper focuses on multi-attribute group decision-making (MAGDM) course in which attributes are evaluated in terms of interval-valued intuitionistic fuzzy (IVIF) information. More explicitly, this paper introduces new aggregation operators for IVIF information and further proposes a new IVIF MAGDM method. The power average (PA) operator and the Muirhead mean (MM) are two powerful and effective information aggregation technologies. The most attractive advantage of the PA operator is its power to combat the adverse effects of ultra-evaluation values on the information aggregation results. The prominent characteristic of the MM operator is that it is flexible to capture the interrelationship among any numbers of arguments, making it more powerful than Bonferroni mean (BM), Heronian mean (HM), and Maclaurin symmetric mean (MSM). To absorb the virtues of both PA and MM, it is necessary to combine them to aggregate IVIF information and propose IVIF power Muirhead mean (IVIFPMM) operator and the IVIF weighted power Muirhead mean (IVIFWPMM) operator. We investigate their properties to show the strongness and flexibility. Furthermore, a novel approach to MAGDM problems with IVIF decision-making information is introduced. Finally, a numerical example is provided to show the performance of the proposed method.

In this paper, Normalized Weighted Bonferroni Mean (NWBM) and Normalized Weighted Bonferroni Harmonic Mean (NWBHM) aggregation operators are proposed. Besides, we check the properties thereof, which include idempotency, monotonicity, commutativity, and boundedness. As the intuitionistic fuzzy numbers are used as a basis for the decision making to effectively handle the real-life uncertainty, we extend the NWBM and NWBHM operators into the intuitionistic fuzzy environment. By further modifying the NWBHM, we propose additional aggregation operators, namely the Intuitionistic Fuzzy Normalized Weighted Bonferroni Harmonic Mean (IFNWBHM) and the Intuitionistic Fuzzy Ordered Normalized Weighted Bonferroni Harmonic Mean (IFNONWBHM). The paper winds up with an empirical example of multi-attribute group decision making (MAGDM) based on triangular intuitionistic fuzzy numbers. To serve this end, we apply the IFNWBHM aggregation operator.

In this paper, an intra prediction method is proposed for coding of depth pictures using plane modelling. Each pixel in the depth picture is related to the distance from a camera to an object surface, and pixels corresponding to a flat surface of an object form a relationship with the 2D plane surface. The plane surface can be represented by a simple equation in the 3D camera coordinate system in such a way that the coordinate system of depth pixels can be transformed to the camera coordinate system. This paper finds the parameters which define the plane surface closest to given depth pixels. The plane model is then used to predict the depth pixels on the plane surface. A depth prediction method is also devised for efficient intra prediction of depth pictures, using variable-size blocks. For prediction with variable-size blocks, the plane surface that occupies a large part of the picture can be predicted using a large block size. The simulation results of the proposed method show that the mean squared error is reduced by up to 96.6% for a block size of 4 × 4 pixels and reduced by up to 98% for a block size of 16 × 16, compared with the intra prediction modes of H.264/AVC and H.265/HEVC.

In the algebra of single-valued structures, cyclicity is one of the fundamental properties of groups. Therefore, it is natural to study it also in the algebra of multivalued structures (algebraic hyperstructure theory). However, when one considers the nature of generalizing this property, at least two (or rather three) approaches seem natural. Historically, all of these had been introduced and studied by 1990. However, since most of the results had originally been published in journals without proper international impact and later—without the possibility to include proper background and context-synthetized in books, the current way of treating the concept of cyclicity in the algebraic hyperstructure theory is often rather confusing. Therefore, we start our paper with a rather long introduction giving an overview and motivation of existing approaches to the cyclicity in algebraic hyperstructures. In the second part of our paper, we relate these to EL-hyperstructures, a broad class of algebraic hyperstructures constructed from (pre)ordered (semi)groups, which were defined and started to be studied much later than sources discussed in the introduction were published. V algebře jednoznačných struktur je cyklicita jednou z význačných vlastností grup. Proto je zajímavé studovat ji také v algebře mnohoznačných struktur, tj. algebraické teorii hyperstruktur. Nicméně, pokud uvážíme možnosti zobecnění cyklicity, je zřejmé, že přirozené jsou dva (nebo spíše tři) přístupy. Historicky byly všechny studovány již před rokem 1990. Většina těchto výsledků však byla publikována v časopisech bez patřičného ohlasu a jejich shrnutí poté bylo bez patřičného kontextu zařazeno do některých monografií, odkud je nyní přebíráno často ve zkreslené podobě. Proto svůj článek začínáme poněkud delším úvodem, který si klade za cíl zasadit studovanou problematiku do patřičného kontextu a uvést motivaci jednotlivých přístupů. Ve druhé části článku se poté věnujeme cyklicitě v EL-hypergrupách, tj. široké třídě hyperstruktur, která byla definována mnoho let poté, co byly publikovány články zmiňované v úvodu.

This paper is a continuation of our previous publication of enhanced matrix power function (MPF) as a conjectured one-way function. We are considering a problem introduced in our previous paper and prove that tis problem is NP-Complete. The proof is based on the dual interpretation of well known multivariate quadratic (MQ) problem defined over the binary field as a system of MQ equations, and as a general satisfiability (GSAT) problem. Due to this interpretation the necessary constraints to MPF function for cryptographic protocols construction can be added to initial GSAT problem. Then it is proved that obtained GSAT problem is NP-Complete using Schaefer dichotomy theorem. Referencing to this result, GSAT problem by polynomial-time reduction is reduced to the sub-problem of enhanced MPF, hence the latter is NP-Complete as well.

The concept of quantum B-algebra was introduced by Rump and Yang, that is, unified algebraic semantics for various noncommutative fuzzy logics, quantum logics, and implication logics. In this paper, a new notion of q-filter in quantum B-algebra is proposed, and quotient structures are constructed by q-filters (in contrast, although the notion of filter in quantum B-algebra has been defined before this paper, but corresponding quotient structures cannot be constructed according to the usual methods). Moreover, a new, more general, implication algebra is proposed, which is called basic implication algebra and can be regarded as a unified frame of general fuzzy logics, including nonassociative fuzzy logics (in contrast, quantum B-algebra is not applied to nonassociative fuzzy logics). The filter theory of basic implication algebras is also established.

The purpose of the paper is to study new algebraic operations and fundamental properties of totally dependent-neutrosophic sets and totally dependent-neutrosophic soft sets. First, the in-coordination relationships among the original inclusion relations of totally dependent-neutrosophic sets (called type-1 and typ-2 inclusion relations in this paper) and union (intersection) operations are analyzed, and then type-3 inclusion relation of totally dependent-neutrosophic sets and corresponding type-3 union, type-3 intersection, and complement operations are introduced. Second, the following theorem is proved: all totally dependent-neutrosophic sets (based on a certain universe) determined a generalized De Morgan algebra with respect to type-3 union, type-3 intersection, and complement operations. Third, the relationships among the type-3 order relation, score function, and accuracy function of totally dependent-neutrosophic sets are discussed. Finally, some new operations and properties of totally dependent-neutrosophic soft sets are investigated, and another generalized De Morgan algebra induced by totally dependent-neutrosophic soft sets is obtained.

In this paper, we develop a genetically oriented rule-based Incremental Granular Model (IGM). The IGM is designed using a combination of a simple Linear Regression (LR) model and a local Linguistic Model (LM) to predict the modeling error obtained by the LR. The IGM has been successfully applied to various examples. However, the disadvantage of IGM is that the number of clusters in each context is determined, with the same number, by trial and error. Moreover, a weighting exponent is set to the typical value. In order to solve these problems, the goal of this paper is to design an optimized rule-based IGM with the use of a Genetic Algorithm (GA) to simultaneously optimize the number of cluster centers in each context, the number of contexts, and the weighting exponent. The experimental results regarding a coagulant dosing process in a water purification plant, an automobile mpg (miles per gallon) prediction, and a Boston housing data set revealed that the proposed GA-based IGM showed good performance, when compared with the Radial Basis Function Neural Network (RBFNN), LM, Takagi–Sugeno–Kang (TSK)-Linguistic Fuzzy Model (LFM), GA-based LM, and IGM itself.

Zadeh’s fuzzy set theory for imprecise or vague data has been followed by other successful models, inclusive of Molodtsov’s soft set theory and hybrid models like fuzzy soft sets. Their success has been backed up by applications to many branches like engineering, medicine, or finance. In continuation of this effort, the purpose of this paper is to put forward a versatile methodology for the valuation of goods, particularly the assessment of real state properties. In order to reach this target, we develop the concept of (partial) valuation fuzzy soft set and introduce the novel problem of data filling in partial valuation fuzzy soft sets. The use of fuzzy soft sets allows us to quantify the qualitative attributes involved in an assessment context. As a result, we illustrate the effectiveness and validity of our valuation methodology with a real case study that uses data from the Spanish real estate market. The main contribution of this paper is the implementation of a novel methodology, which allows us to assess a large variety of assets where data are heterogeneous. Our technique permits to avoid the appraiser’s subjectivity (exhibited by practitioners in housing valuation) and the well-known disadvantages of some alternative methods (such as linear multiple regression).

Integral inequalities play critical roles in measure theory and probability theory. Given recent profound discoveries in the field of fuzzy set theory, fuzzy inequality has become a hot research topic in recent years. For classical Sandor type inequality, this paper intends to extend the Sugeno integral. Based on the (s,m)-convex function in the second sense, a new Sandor type inequality is proposed for the Sugeno integral. Examples are given to verify the conclusion of this paper.

A multi-objective bi-matrix game model based on fuzzy goals is established in this paper. It is shown that the equilibrium solution of such a game model problem can be translated into the optimal solution of a multi-objective, non-linear programming problem. Finally, the results of this paper are demonstrated through a numerical example.

In order to address the problem of the uncertainty of existing noise models and of the complexity and changeability of the edges and textures of low-resolution document images, this paper presents a projection onto convex sets (POCS) algorithm based on text features. The current method preserves the edge details and smooths the noise in text images by adding text features as constraints to original POCS algorithms and converting the fixed threshold to an adaptive one. In this paper, the optimized scale invariant feature transform (SIFT) algorithm was used for the registration of continuous frames, and finally the image was reconstructed under the improved POCS theoretical framework. Experimental results showed that the algorithm can significantly smooth the noise and eliminate noise caused by the shadows of the lines. The lines of the reconstructed text are smoother and the stroke contours of the reconstructed text are clearer, and this largely eliminates the text edge vibration to enhance the resolution of the document image text.

Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs) from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.

Uncertain differential equations are important mathematical models in uncertain environments. This paper investigates uncertain multi-dimensional and multiple-factor differential equations. First, the solvability of the equations is analyzed. The α-path distributions and expected values of solutions are given. Then, structure preserving uncertain differential equations, uncertain Hamiltonian systems driven by Liu processes, which possess a kind of uncertain symplectic structures, are presented. A symplectic scheme with six-order accuracy and a Yao-Chen algorithm are applied to design an algorithm to solve uncertain Hamiltonian systems. At last, numerical experiments are given to investigate four uncertain Hamiltonian systems, which highlight the efficiency of our algorithm.

As a natural extension of the fuzzy variable, a bifuzzy variable is defined as a mapping from a credibility space to the collection of fuzzy variables, which is an appropriate tool to model the two-fold fuzzy phenomena. In order to enrich its theoretical foundation, this paper explores some important measures for regular bifuzzy variables, the most commonly used type of bifuzzy variables. Firstly, we introduce the regular bifuzzy variables’ mean chance measure and some properties, including self-duality and its calculation formulas. Furthermore, we also investigate the mean chance distribution for strictly monotone functions of regular bifuzzy variables based on the proposed operational law. Finally, we present the expected value operator as well as equivalent analytical formulas of the expected value of regular bifuzzy variables and their strictly monotone functions.

The aim of this paper is to investigate several operators on quantum B-algebras. At first, we introduce closure and interior operators on quantum B-algebras and consider their relations on bounded quantum B-algebras. Furthermore, we discuss very true operators on quantum B-algebras by three cases via the unit element, and present some similar conclusions and different results. Finally, by constructing a very true operator on a quotient very true perfect quantum B-algebra, we establish a homomorphism theorem on very true perfect quantum B-algebras.

Aiming at solving the problems of high background complexity of some butterfly images and the difficulty in identifying them caused by their small inter-class variance, we propose a new fine-grained butterfly classification architecture, called Network based on Multi-rate Dilated Attention Mechanism and Multi-granularity Feature Sharer (MRDA-MGFSNet). First, in this network, in order to effectively identify similar patterns between butterflies and suppress the information that is similar to the butterfly’s features in the background but is invalid, a Multi-rate Dilated Attention Mechanism (MRDA) with a symmetrical structure which assigns different weights to channel and spatial features is designed. Second, fusing the multi-scale receptive field module with the depthwise separable convolution module, a Multi-granularity Feature Sharer (MGFS), which can better solve the recognition problem of a small inter-class variance and reduce the increase in parameters caused by multi-scale receptive fields, is proposed. In order to verify the feasibility and effectiveness of the model in a complex environment, compared with the existing methods, our proposed method obtained a mAP of 96.64%, and an F1 value of 95.44%, which showed that the method proposed in this paper has a good effect on the fine-grained classification of butterflies.

Traditional Multi-Criteria Decision Making (MCDM) methods have now become outdated; therefore, most researchers are focusing on more robust hybrid MCDM models that combine two or more MCDM techniques to address decision-making problems. The authors attempted to create two novel hybrid MCDM systems in this paper by integrating Additive Ratio ASsessment (ARAS) with Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) and Complex PRoportional ASsessment (COPRAS). To demonstrate the ability and effectiveness of these two hybrid models i.e., TOPSIS-ARAS and COPRAS-ARAS were applied to solve a real-time robot selection problem with 12 alternative robots and five selection criteria, while evaluating the parametric importance using the CRiteria Importance Through Inter criteria Correlation (CRITIC) objective weighting estimation tool. The rankings of the robot alternatives gained from these two hybrid models were also compared to the obtained results from eight other solo MCDM tools. Although the rankings by the applied methods slightly differ from each other, the final outcomes from all of the adopted techniques are consistent enough to suggest that robot 12 is the best choice followed by robot 11, and robot 4 is the worst one among these 12 alternatives. Spearman Correlation Coefficient (SCC) also reveals that the proposed rankings derived from various methods have a strong ranking relationship with one another. Finally, sensitivity analysis was performed to investigate the effects of weight variation and to validate the robustness of the implemented MCDM approaches.

Article number 1329 This paper discusses the power loss minimization problem in asymmetric distribution systems (ADS) based on phase swapping. This problem is presented using a mixed-integer nonlinear programming model, which is resolved by applying a master-slave methodology. The master stage consists of an improved version of the crow search algorithm. This stage is based on the generation of candidate solutions using a normal Gaussian probability distribution. The master stage is responsible for providing the connection settings for the system loads using integer coding. The slave stage uses a power flow for ADSs based on the three-phase version of the iterative sweep method, which is used to determine the network power losses for each load connection supplied by the master stage. Numerical results on the 8-, 25-, and 37-node test systems show the efficiency of the proposed approach when compared to the classical version of the crow search algorithm, the Chu and Beasley genetic algorithm, and the vortex search algorithm. All simulations were obtained using MATLAB and validated in the DigSILENT power system analysis software. Centro de Investigación y Desarrollo Científico de la Universidad Distrital Francisco José de Caldas 1643-12-2020 Dirección de Investigaciones de la Universidad Tecnológica de Bolívar PS2020002

As a new service-oriented manufacturing paradigm, cloud manufacturing (CMfg) realizes the optimal allocation of resources in the product manufacturing process through the network. Task decomposition is a key problem of the CMfg system for resource scheduling. A high-quality task decomposition method can shorten product development time, reduce costs for resource service providers, and provide technical support for the application of CMfg. However, a cloud manufacturing system has to manage the allocation the correct amount of manufacturing resources, complex production processes, and highly dynamic production environments. At the same time, the tasks issued by service demanders are usually asymmetric and tightly coupled. We solve the complex task decomposition problem by using the traditional methods, that are hard to complete in CMfg. To overcome the shortcomings of CMfg, this paper proposed a task decomposition method based on the cloud platform. For achieving modular production, this approach creatively divides the product production process into four stages: design, manufacturing, transportation, and maintenance. Then a hybrid method, which combines with depth-first search algorithm, fast modular optimization algorithm, and artificial bee colony algorithm, is introduced. The method can obtain a multi-stage task optimization decomposition plan in CMfg. Simulation results demonstrate the proposed method can achieve complex task optimization decomposition in a CMfg environment.

More extensive enterprise cooperation is an effective means to increase the competitiveness of shipbuilding companies in the current distributed manufacturing environment. Most cross-enterprise collaborative processes for shipbuilding projects have been widely concerned. However, the symmetry and cooperativity among the order decision-making process is rarely involved. A key issue for decision makers is to balance the interests of each symmetric participant and realize the consistent decision-making for the order. Existing order decision-making methods in the shipbuilding industry are low efficiency. The aim of this paper is to provide an assistant decision-making method to support effective order decision-making and multi-party cooperation for the multi-wining negotiation objectives. To solve this problem, a collaborative order decision-making framework based on decision support system (DSS) and multi-agent system (MAS) theory is presented, simulating the collaborative order decision-making process, and bridging the order decision-making with production scheduling. Then, a multi-stage negotiation method is provided to solve the distributed and symmetric order decision-making problem, and an illustrative example is conducted to demonstrate the effectiveness and rationality of the methods. Finally, an application case using a prototype system will be reported as a result.

Symmetry plays a key role in the processing and analysis of not only visual but also acoustic signals in various multidisciplinary areas. New innovative and environmentally friendly methods for extinguishing flames are still being sought worldwide. One of these techniques appears to be the acoustic method. A laboratory stand was built for this purpose, which was coupled with the tested prototype of a high-power acoustic extinguisher, and then the original experiments and analyses of extinguishing effectiveness were carried out. For extinguishing, waveforms with specified parameters selected symmetrically around the frequency for which the extinguisher was designed were used. The aim of this article is to present and discuss selected measurement results concerning the possibility of flame extinguishing with the use of sinusoidal acoustic waves of low frequency (below 21 Hz), as well as with the use of frequency sweeping techniques with set parameters. Such an extinguisher can be equipped with an intelligent module so that the extinguisher may be activated automatically (without human intervention) when flames are detected. The benefits of this combination as well as the importance of image processing for flame detection are also presented in this paper. This solution, with its good fire detection and fast response, may be applicable for extinguishing firebreaks in particular.