Shin et al. [2] proposed the process parameters and tolerance designs model. Their model firstly obtained the process mean and standard deviation. Then the tolerance model is formulated for obtaining the optimal tolerance. Product inspection is a short-term method for assuring the shipment quality. One should consider a long-term method for improving quality, e.g., quality investment. In this paper, the authors address the extension of Shin et al.’s [2] tolerance model with quality investment.

The searchable encryption scheme is employed to address privacy and data confidentiality issues in outsourced databases. It enables users to send encrypted search queries containing a keyword to a server, which then returns all encrypted documents containing the specified keyword without learning additional information about the queries or documents. Boneh et al. [2] proposed a scheme for searching encrypted keywords without leaking information about the keywords and original documents. A unique technique for public-key encryption with keyword search (PEKS) has been presented in this paper, leveraging the power of bilinear pairings, offering better performance than [2] due to not using pairing operation in the encryption. Our scheme can also search conjunctive keywords simultaneously without leaking information and does not require the establishment of a secure channel, known as the secure channel free scheme. Additionally, we introduce a highly efficient SSE scheme that enables advanced conjunctive search cabilities. The innovative approach has been thoroughly examined and verified to be secure.

Game theory offers a logical method of examining social and competitive scenarios that involve several decision-makers. It allows one to investigate independent and interdependent decisions of players. This work presents a novel methodology of tackling decision-making problems that occur in both assignment models and in scenarios of certainty, uncertainty and risk scenarios. The newly suggested methods are used in the combination with the classical ones to accentuate their usefulness and efficiency. The two types of decision making are divided into symmetric and non-symmetric, and both are discussed within the gametheoretic point of view. In addition, the findings achieved are also compared with those obtained using conventional methods to show the strength of the suggested tools. The convergence behaviour of the techniques is also examined to demonstrate the way rate of convergence in the uncertainty-based decision models and assignment problems can be enhanced. The optimality of solutions is confirmed with the help of MATLAB and graphical representation of the solutions is produced in cases of symmetry and non-symmetry. Overall, the paper demonstrates that the suggested approaches can be used to solve a great variety of issues with certainty, uncertainty and risk by combining game theory with decision-making concepts.

The class of algebras known as algebras of logic includes a variety of algebraic structures. The logical algebras BCK and BCI belong to two different classes. They were introduced by Imai and Iséki [13, 14] in 1966 and have been extensively investigated by many researchers. The concept of fuzzy soft sets (FSSs) is introduced in [21] to generalized standard soft sets [25]. The concept of intuitionistic fuzzy soft sets (IFSSs) is introduced by Maji et al. [22], which is based on a combination of the intuitionistic fuzzy set (IFS) [4] and soft set models. In this paper, we apply the idea of hesitant intuitionistic fuzzy soft sets (HIFSSs) for dealing with some types of theories in BCK-algebras. The views of hesitant anti-intuitionistic fuzzy soft commutative ideals (HAIFSCIs) and hesitant anti-intuitionistic fuzzy soft prime

Electronic voting has several advantages in terms of accessibility, effectiveness, and security, it is nevertheless susceptible to ballot tampering, impersonation, and multiple voting. The main difficulty is striking a balance between voter anonymity and transparency. Blockchain based systems improve verifiability and trust, but they frequently jeopardize privacy. To overcome these limitations we propose TrustChain, a blockchain based system that combines a Merkle Root based Tracking ID, a multi-chain Ethereum architecture, and real time facial recognition in order to get around these restrictions. Ethereum guarantees immutability and tamper resistance, while a lightweight Firebase pseudo blockchain handles registration and authentication, allowing for scalable and effective verification. Performance is enhanced by this decoupled design without compromising privacy or security. Candidate specific chains reduce congestion while guaranteeing tamper proof recording, tracking IDs maintain vote integrity without disclosing identities, and facial recognition restrict illegitimate access. Tests show a 45% faster voting process, while maintaining strong security and privacy.

In this paper, we investigate norms defined on intuitionistic fuzzy equivalence relations, intuitionistic fuzzy congruence relations, and intuitionistic fuzzy ideals of rings. We explore their properties and structural characteristics, as well as their behavior under ring homomorphisms.

A measurable collection of dots and a collection of ordered pairings of different dots make up a directed graph, commonly known as a digraph 𝒟. Each (u,v) pair is denoted by uv where u is the arc’s beginning dot and v its terminal dot, is an arc. A digraph having V dots and A arcs is called D(V, A). For each vertex v ∈ V, the indegree d – (v) of v indicates how many arcs have v as their terminal dot and the out degree d+ (v) of v indicates how many arcs have v indicates how many arcs have v as their starting dot. In this article, we explored the presence of di-signed cordiality for certain families of digraphs and defined a new style of labeling known as directed signed cordial labeling (DSCL), also known as di-signed cordial labeling.

We consider fractional, or average reward, optimal stopping problems for multiparameter discrete-time stochastic processes indexed by Nd. We generalize the theory of multiparameter discrete-time optimal stopping problems to include the fractional setting. Moreover we present the characterization of optimal value and optimal stopping point, as well as the efficiency of Denkelbach algorithm for searching an optimal stopping point.

We consider a discrete-time Markov decision process with a state space and an action space in general setting, evaluated according to a fractional discounting reward criterion. For the sake of discussing an optimal control for this model, we transform this model to a Markov decision model under the usual discounted reward criterion by using the parametric method. We discuss the existence of an optimal policy as well as the continuity of the corresponding optimal value function for our model.

In the clean development mechanism, greenhouse gas (GHG) reduction is conducted by implementing projects that aim to decrease fossil fuel consumption in the energy sectors, increase energy productivity, and mitigate energy loss in power plants and transmission networks and distribution systems. This; the Research evaluated the sustainability of the electrical supply chain using inverse input-oriented data envelopment analysis. The; proposed inverse input-oriented model estimates the optimal value of applied resources based on the optimal allocation of two categories of inputs while other production indexs and efficiency scores of supply chain divisions under evaluation remained unchanged. An empirical conclusion was yielded from the model’s performance in the ten electrical supply chains and 15 divisions. The gas field of supply chains, 60% utilize a large amount of gas resources in power production. Also; power plant sectors and transmitter lines of more than 90% of the supply chains produced an optimal vale of energy.