Search

In this paper, we define the right Boolean lifting property (left Boolean lifting property) RBLP (LBLP) for pseudo BL-algebra to be the property that all Boolean elements can be lifted modulo every right filter (left filter) and next we study the behavior of RBLP (LBLP) with respect to direct products of pseudo BL-algebra. We introduce some conditions, which turn out to be a strengthening and a weakling of RBLP (LBLP) respectively and which open new ways of approaching the study of the RBLP (LBLP) in pseudo BL-algebras. Keywords: Lifting property, Boolean center, (prime, maximal) filter, (maximal, local, hyper Archimedean, quasi-local, semi local) pseudo BL-algebra

This paper presents a new two-tier decision making framework with linguistic preferences for scientific decision making. The major reason for adopting linguistic preference is to ease the process of rating of alternatives by allowing decision makers (DMs) to strongly emphasize their opinion on each alternative. In the first tier, aggregation is done using a newly proposed operator called linguistic based aggregation (LBA), which aggregates linguistic terms directly without making any conversion. The main motivation for this proposal is driven by the previous studies on aggregation theory which reveals that conversion leads to loss of information and formation of virtual sets which are no longer sensible and rational for decision making process. Secondly, in the next tier, a new ranking method called IFSP (intuitionistic fuzzy set based PROMETHEE) is proposed which is an extension to PROMETHEE (preference ranking organization method for enrichment evaluation) under intuitionistic fuzzy set (IFS) context. Unlike previous ranking methods, this ranking method follows a new formulation by considering personal choice of the DMs over each alternative. The main motivation for such formulation is derived from the notion of not just obtaining a suitable alternative but also coherently satisfying the DMs’ viewpoint during decision process. Finally, the practicality of the framework is tested by using supplier selection (SS) problem for an automobile factory. The strength and weakness of the proposed LBA-IFSP framework are verified by comparing with other methods under the realm of theoretical and numerical analysis. The results from the analysis infer that proposed LBA-IFSP framework is rationally coherent to DMs’ viewpoint, moderately consistent with other methods and highly stable and robust against rank reversal issue.

Nowadays, the most important aspects of wireless sensor networks (WSNs) are to make optimal use of and direct the limited energy of sensor nodes towards the desired application and prolong the network lifetime for that application. Although a few studies exist that have addressed these special goals, they have been mostly focused on the process of selecting cluster heads (CHs) and forwarders. No studies have been conducted so far on the selection of fuzzy input parameters in clustering and routing processes as well as the application-based parameter selection process. Generally, a fixed number of parameters have always been selected by designers. Hence, the shuffled frog leaping algorithm (SFLA) was employed in this paper to propose a technique for selecting fuzzy input parameters in a fuzzy multi-hop clustering protocol named the PS-SFLA. This technique includes three main phases, introduced in three versions for the sake of stepwise evaluation. Based on the literature review, the most frequent and diverse parameters were extracted and formulated in the first version. The proposed technique used the SFLA in the second version to select the appropriate parameters fitting the application specifics and scenario and determine the coefficients of parameters simultaneously so that they could be used as the inputs of the fuzzy inference system. It was also utilized in the final version for the automated, accurate, application-based tuning of fuzzy rules before the network was set up. By design, different versions of the PS-SFLA act as the starting points of the next version in addition to the fact that they can be evaluated separately. The PS-SFLA was compared with the LEACH, ASLPR, SIF, ERA, and FSFLA in different scenarios and two applications from the perspective of the alive nodes, the number of packets received by the BS, lifetime, and other factors. According to the simulation results, the PS-SFLA outperformed all of the other methods greatly in all scenarios and applications and PS-SFLA increases the lifetime due to the appropriate selection of fuzzy input parameters based on application and purpose.

One of the important issues in computer networks is Active Queue Management (AQM) that increases the performance of the network. Autoregressive Integrated Moving Average (ARIMA) as an Active Queue Management can improve methods such as congestion control and flow control by predicting the state of the queue in the networks. In current complications of queue theory in computer networks, due to the lack of linear constant trend and other issues such as packets bursting and non-periodic fluctuations of queue length, the present methods of prediction are being challenged. In this paper, a new anticipation ploy is proposed, which improved the prototype of ARIMA by considering available problems and requirements in computer networks. The subscribed algorithm that is called Queue-based ARIMA (QARIMA), can present predictions which are closer to true data, by uplift input data models.

We study some special sets in MTL-algebras. The notion of the radical of a filter in MTL-algebras is defined and several characterizations of the radical of a filter are given. The sets of dense elements and double complemented elements in MTL-algebras are defined and we state and prove some theorems on the properties of these sets and filters of MTL-algebras. We also prove that the radical of a positive implicative filter of an MTL-algebra is a subset of double complemented elements.

In this paper, we introduce the notion of intuitionistic (T,S)-fuzzy subalgebras in CI-algebras and study their fundamental properties. We get a fuzzy subalgebra from an intuitionistic (T,S)-fuzzy subalgebra. Also the notion of intuitionistic (T,S)-fuzzy (closed) filters of CI-algebras is introduced. We investigate the relationship between intuitionistic (T,S)-fuzzy subalgebras and intuitionistic (T,S)-fuzzy (closed) filters of CI-algebras.

In this article, we present a routing protocol through intra-clustering. Most hierarchical protocols use direct intra-cluster routing, so that all the cluster member nodes forward their data to the cluster head node directly. Considered parameters are cluster lifetime and end to end delay between cluster member nodes and cluster head node. Also, rules related to queue theory have been used to determine end to end delay. At last, simulation results show the efficiency of the proposed protocol.

In this paper, we define the Smarandache hyper BCC-algebra, and Smarandache hyper BCC-ideals of type 1, 2, 3 and 4. We state and prove some theorems in Smarandache hyper BCC-algebras, and then we determine the relationships between these hyper ideals.

In this paper we define the Smarandache BL -algebra, Q -Smarandache ideal and Q -Smarandache implicative ideal, we obtain some related results. After that by considering the notions of these ideals we determine relationships between ideals in BL -algebra and Q -Smarandache (implicative) ideals of BL -algebra. Finally we construct quotient of Smarandache BL -algebras via MV -algebra and prove some theorems.