Open AccessFeature PaperArticle
Axisymmetric Arc Sliding Method of Basal Heave Stability Analysis for Braced Circular Excavations
Symmetry 2018, 10(5), 179; https://doi.org/10.3390/sym10050179 (registering DOI) -
Abstract
On the basis of the circular arc sliding model of the limit equilibrium method, an axisymmetric arc sliding method (AASM) is proposed to analyze the basal heave stability of braced circular excavations. The proposed method considers the stiffness of the enclosure structure and
[...] Read more.
On the basis of the circular arc sliding model of the limit equilibrium method, an axisymmetric arc sliding method (AASM) is proposed to analyze the basal heave stability of braced circular excavations. The proposed method considers the stiffness of the enclosure structure and spatial effects. The AASM was applied to check basal heave stability in a design example and provided results that were more reasonable than those obtained using other methods. The radii effects in theory and numerical simulation, and the enclosure structure stiffness effects on the basal heave stability safety factor were discussed. Additionally, the effects of the embedded depth on the basal heave stability of a braced circular excavation were analyzed. The safety factor of basal heave stability for a braced circular excavation will be larger when calculated with the AASM than when calculated with the circular arc sliding method, and the optimized embedded depth of the enclosure structure may therefore be reduced by 4∼5 m to lower the cost of the enclosure structure. Full article
Figures

Figure 1

Open AccessArticle
Selecting Products Considering the Regret Behavior of Consumer: A Decision Support Model Based on Online Ratings
Symmetry 2018, 10(5), 178; https://doi.org/10.3390/sym10050178 (registering DOI) -
Abstract
With the remarkable promotion of e-commerce platforms, consumers increasingly prefer to purchase products online. Online ratings facilitate consumers to choose among products. Thus, to help consumers effectively select products, it is necessary to provide decision support methods for consumers to trade online. Considering
[...] Read more.
With the remarkable promotion of e-commerce platforms, consumers increasingly prefer to purchase products online. Online ratings facilitate consumers to choose among products. Thus, to help consumers effectively select products, it is necessary to provide decision support methods for consumers to trade online. Considering the decision makers are bounded rational, this paper proposes a novel decision support model for product selection based on online ratings, in which the regret aversion behavior of consumers is formulated. Massive online ratings provided by experienced consumers for alternative products associated with several evaluation attributes are obtained by software finders. Then, the evaluations of alternative products in format of stochastic variables are conducted. To select a desirable alternative product, a novel method is introduced to calculate gain and loss degrees of each alternative over others. Considering the regret behavior of consumers in the product selection process, the regret and rejoice values of alternative products for consumer are computed to obtain the perceived utility values of alternative products. According to the prior order of the evaluation attributes provided by the consumer, the prior weights of attributes are determined based on the perceived utility values of alternative products. Furthermore, the overall perceived utility values of alternative products are obtained to generate a ranking result. Finally, a practical example from Zol.com.cn for tablet computer selection is used to demonstrate the feasibility and practically of the proposed model. Full article
Figures

Figure 1

Open AccessArticle
A Novel Comparison of Probabilistic Hesitant Fuzzy Elements in Multi-Criteria Decision Making
Symmetry 2018, 10(5), 177; https://doi.org/10.3390/sym10050177 (registering DOI) -
Abstract
The probabilistic hesitant fuzzy element is a common tool to deal with multi-criteria decision-making problems when the decision makers are irresolute in providing their evaluations. The existing methods for ranking probabilistic hesitant fuzzy elements are limited and not reasonable in practical applications. The
[...] Read more.
The probabilistic hesitant fuzzy element is a common tool to deal with multi-criteria decision-making problems when the decision makers are irresolute in providing their evaluations. The existing methods for ranking probabilistic hesitant fuzzy elements are limited and not reasonable in practical applications. The main purpose of this paper is to find a more precise and appropriate comparison method so that we can deal with multi-criteria decision-making problems more efficiently. We first propose a chart technique to analyze the structure of a probabilistic hesitant fuzzy element. After that, we propose a novel possibility degree formula to rank probabilistic hesitant fuzzy elements. Last but not least, we provide a useful process to solve the actual multi-criteria decision-making problems, and make a real case study which demonstrates that our method is feasible and reliable. Full article
Figures

Figure 1

Open AccessArticle
Neutrosophic Weighted Support Vector Machines for the Determination of School Administrators Who Attended an Action Learning Course Based on Their Conflict-Handling Styles
Symmetry 2018, 10(5), 176; https://doi.org/10.3390/sym10050176 -
Abstract
In the recent years, school administrators often come across various problems while teaching, counseling, and promoting and providing other services which engender disagreements and interpersonal conflicts between students, the administrative staff, and others. Action learning is an effective way to train school administrators
[...] Read more.
In the recent years, school administrators often come across various problems while teaching, counseling, and promoting and providing other services which engender disagreements and interpersonal conflicts between students, the administrative staff, and others. Action learning is an effective way to train school administrators in order to improve their conflict-handling styles. In this paper, a novel approach is used to determine the effectiveness of training in school administrators who attended an action learning course based on their conflict-handling styles. To this end, a Rahim Organization Conflict Inventory II (ROCI-II) instrument is used that consists of both the demographic information and the conflict-handling styles of the school administrators. The proposed method uses the Neutrosophic Set (NS) and Support Vector Machines (SVMs) to construct an efficient classification scheme neutrosophic support vector machine (NS-SVM). The neutrosophic c-means (NCM) clustering algorithm is used to determine the neutrosophic memberships and then a weighting parameter is calculated from the neutrosophic memberships. The calculated weight value is then used in SVM as handled in the Fuzzy SVM (FSVM) approach. Various experimental works are carried in a computer environment out to validate the proposed idea. All experimental works are simulated in a MATLAB environment with a five-fold cross-validation technique. The classification performance is measured by accuracy criteria. The prediction experiments are conducted based on two scenarios. In the first one, all statements are used to predict if a school administrator is trained or not after attending an action learning program. In the second scenario, five independent dimensions are used individually to predict if a school administrator is trained or not after attending an action learning program. According to the obtained results, the proposed NS-SVM outperforms for all experimental works. Full article
Open AccessArticle
Optimum Geometric Transformation and Bipartite Graph-Based Approach to Sweat Pore Matching for Biometric Identification
Symmetry 2018, 10(5), 175; https://doi.org/10.3390/sym10050175 -
Abstract
Sweat pores on the human fingertip have meaningful patterns that enable individual identification. Although conventional automatic fingerprint identification systems (AFIS) have mainly employed the minutiae features to match fingerprints, there has been minimal research that uses sweat pores to match fingerprints. Recently, high-resolution
[...] Read more.
Sweat pores on the human fingertip have meaningful patterns that enable individual identification. Although conventional automatic fingerprint identification systems (AFIS) have mainly employed the minutiae features to match fingerprints, there has been minimal research that uses sweat pores to match fingerprints. Recently, high-resolution optical sensors and pore-based fingerprint systems have become available, which motivates research on pore analysis. However, most existing pore-based AFIS methods use the minutia-ridge information and image pixel distribution, which limit their applications. In this context, this paper presents a stable pore matching algorithm which effectively removes both the minutia-ridge and fingerprint-device dependencies. Experimental results show that the proposed pore matching algorithm is more accurate for general fingerprint images and robust under noisy conditions compared with existing methods. The proposed method can be used to improve the performance of AFIS combined with the conventional minutiae-based methods. Since sweat pores can also be observed using various systems, removing of the fingerprint-device dependency will make the pore-based AFIS useful for wide applications including forensic science, which matches the latent fingerprint to the fingerprint image in databases. Full article
Figures

Figure 1

Open AccessArticle
Neutrosophic Hesitant Fuzzy Subalgebras and Filters in Pseudo-BCI Algebras
Symmetry 2018, 10(5), 174; https://doi.org/10.3390/sym10050174 -
Abstract
The notions of the neutrosophic hesitant fuzzy subalgebra and neutrosophic hesitant fuzzy filter in pseudo-BCI algebras are introduced, and some properties and equivalent conditions are investigated. The relationships between neutrosophic hesitant fuzzy subalgebras (filters) and hesitant fuzzy subalgebras (filters) is discussed. Five kinds
[...] Read more.
The notions of the neutrosophic hesitant fuzzy subalgebra and neutrosophic hesitant fuzzy filter in pseudo-BCI algebras are introduced, and some properties and equivalent conditions are investigated. The relationships between neutrosophic hesitant fuzzy subalgebras (filters) and hesitant fuzzy subalgebras (filters) is discussed. Five kinds of special sets are constructed by a neutrosophic hesitant fuzzy set, and the conditions for the two kinds of sets to be filters are given. Moreover, the conditions for two kinds of special neutrosophic hesitant fuzzy sets to be neutrosophic hesitant fuzzy filters are proved. Full article
Open AccessArticle
On Topological Properties of Symmetric Chemical Structures
Symmetry 2018, 10(5), 173; https://doi.org/10.3390/sym10050173 -
Abstract
The utilizations of graph theory in chemistry and in the study of molecule structures are more than someone’s expectations, and, lately, it has increased exponentially. In molecular graphs, atoms are denoted by vertices and bonds by edges. In this paper, we focus on
[...] Read more.
The utilizations of graph theory in chemistry and in the study of molecule structures are more than someone’s expectations, and, lately, it has increased exponentially. In molecular graphs, atoms are denoted by vertices and bonds by edges. In this paper, we focus on the molecular graph of (2D) silicon-carbon Si2C3 -I and Si2C3 - II . Moreover, we have computed topological indices, namely general Randić Zagreb types indices, geometric arithmetic index, atom–bond connectivity index, fourth atom–bond connectivity and fifth geometric arithmetic index of Si2C3 -I and Si2C3 - II . Full article
Figures

Figure 1

Open AccessArticle
A Novel Approach to Multi-Attribute Group Decision-Making with q-Rung Picture Linguistic Information
Symmetry 2018, 10(5), 172; https://doi.org/10.3390/sym10050172 -
Abstract
The proposed q-rung orthopair fuzzy set (q-ROFS) and picture fuzzy set (PIFS) are two powerful tools for depicting fuzziness and uncertainty. This paper proposes a new tool, called q-rung picture linguistic set (q-RPLS) to deal with vagueness
[...] Read more.
The proposed q-rung orthopair fuzzy set (q-ROFS) and picture fuzzy set (PIFS) are two powerful tools for depicting fuzziness and uncertainty. This paper proposes a new tool, called q-rung picture linguistic set (q-RPLS) to deal with vagueness and impreciseness in multi-attribute group decision-making (MAGDM). The proposed q-RPLS takes full advantages of q-ROFS and PIFS and reflects decision-makers’ quantitative and qualitative assessments. To effectively aggregate q-rung picture linguistic information, we extend the classic Heronian mean (HM) to q-RPLSs and propose a family of q-rung picture linguistic Heronian mean operators, such as the q-rung picture linguistic Heronian mean (q-RPLHM) operator, the q-rung picture linguistic weighted Heronian mean (q-RPLWHM) operator, the q-rung picture linguistic geometric Heronian mean (q-RPLGHM) operator, and the q-rung picture linguistic weighted geometric Heronian mean (q-RPLWGHM) operator. The prominent advantage of the proposed operators is that the interrelationship between q-rung picture linguistic numbers (q-RPLNs) can be considered. Further, we put forward a novel approach to MAGDM based on the proposed operators. We also provide a numerical example to demonstrate the validity and superiorities of the proposed method. Full article
Figures

Figure 1

Open AccessFeature PaperArticle
Lie Symmetries of Nonlinear Parabolic-Elliptic Systems and Their Application to a Tumour Growth Model
Symmetry 2018, 10(5), 171; https://doi.org/10.3390/sym10050171 -
Abstract
A generalisation of the Lie symmetry method is applied to classify a coupled system of reaction-diffusion equations wherein the nonlinearities involve arbitrary functions in the limit case in which one equation of the pair is quasi-steady but the other is not. A complete
[...] Read more.
A generalisation of the Lie symmetry method is applied to classify a coupled system of reaction-diffusion equations wherein the nonlinearities involve arbitrary functions in the limit case in which one equation of the pair is quasi-steady but the other is not. A complete Lie symmetry classification, including a number of the cases characterised as being unlikely to be identified purely by intuition, is obtained. Notably, in addition to the symmetry analysis of the PDEs themselves, the approach is extended to allow the derivation of exact solutions to specific moving-boundary problems motivated by biological applications (tumour growth). Graphical representations of the solutions are provided and a biological interpretation is briefly addressed. The results are generalised on multi-dimensional case under the assumption of the radially symmetrical shape of the tumour. Full article
Figures

Figure 1

Open AccessFeature PaperArticle
Inflation in Mimetic f(G) Gravity
Symmetry 2018, 10(5), 170; https://doi.org/10.3390/sym10050170 -
Abstract
Mimetic gravity is analysed in the framework of some extensions of general relativity (GR), whereby a function of the Gauss–Bonnet invariant in four dimensions is considered. By assuming the mimetic condition, the conformal degree of freedom is isolated, and a pressureless fluid naturally
[...] Read more.
Mimetic gravity is analysed in the framework of some extensions of general relativity (GR), whereby a function of the Gauss–Bonnet invariant in four dimensions is considered. By assuming the mimetic condition, the conformal degree of freedom is isolated, and a pressureless fluid naturally arises. Then, the complete set of field equations for mimetic Gauss–Bonnet gravity is established, and some inflationary models are analysed, for which the corresponding gravitational action is reconstructed. The spectral index and tensor-to-scalar ratio are obtained and compared with observational bounds from Planck and BICEP2/Keck array data. Full agreement with the above data is achieved for several versions of the mimetic Gauss–Bonnet gravity. Finally, some extensions of Gauss–Bonnet mimetic gravity are considered, and the possibility of reproducing inflation is also explored. Full article
Figures

Figure 1

Open AccessArticle
Efficient Superpixel-Guided Interactive Image Segmentation Based on Graph Theory
Symmetry 2018, 10(5), 169; https://doi.org/10.3390/sym10050169 -
Abstract
Image segmentation is a challenging task in the field of image processing and computer vision. In order to obtain an accurate segmentation performance, user interaction is always used in practical image-segmentation applications. However, a good segmentation method should not rely on much prior
[...] Read more.
Image segmentation is a challenging task in the field of image processing and computer vision. In order to obtain an accurate segmentation performance, user interaction is always used in practical image-segmentation applications. However, a good segmentation method should not rely on much prior information. In this paper, an efficient superpixel-guided interactive image-segmentation algorithm based on graph theory is proposed. In this algorithm, we first perform the initial segmentation by using the MeanShift algorithm, then a graph is built by taking the pre-segmented regions (superpixels) as nodes, and the maximum flow–minimum cut algorithm is applied to get the superpixel-level segmentation solution. In this process, each superpixel is represented by a color histogram, and the Bhattacharyya coefficient is chosen to calculate the similarity between any two adjacent superpixels. Considering the over-segmentation problem of the MeanShift algorithm, a narrow band is constructed along the contour of objects using a morphology operator. In order to further segment the pixels around edges accurately, a graph is created again for those pixels in the narrow band and, following the maximum flow–minimum cut algorithm, the final pixel-level segmentation is completed. Extensive experimental results show that the presented algorithm obtains much more accurate segmentation results with less user interaction and less running time than the widely used GraphCut algorithm, Lazy Snapping algorithm, GrabCut algorithm and a region merging algorithm based on maximum similarity (MSRM). Full article
Figures

Figure 1

Open AccessArticle
Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments
Symmetry 2018, 10(5), 168; https://doi.org/10.3390/sym10050168 -
Abstract
Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task
[...] Read more.
Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs). When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA). We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time. Full article
Figures

Figure 1

Open AccessArticle
Image Denoising via Improved Dictionary Learning with Global Structure and Local Similarity Preservations
Symmetry 2018, 10(5), 167; https://doi.org/10.3390/sym10050167 -
Abstract
We proposed a new efficient image denoising scheme, which leads to four important contributions. The first is to integrate both reconstruction and learning based approaches into a single model so that we are able to benefit advantages from both approaches simultaneously. The second
[...] Read more.
We proposed a new efficient image denoising scheme, which leads to four important contributions. The first is to integrate both reconstruction and learning based approaches into a single model so that we are able to benefit advantages from both approaches simultaneously. The second is to handle both multiplicative and additive noise removal problems. The third is that the proposed approach introduces a sparse term to reduce non-Gaussian outliers from multiplicative noise and uses a Laplacian Schatten norm to capture the global structure information. In addition, the image is represented by preserving the intrinsic local similarity via a sparse coding method, which allows our model to incorporate both global and local information from the image. Finally, we propose a new method that combines Method of Optimal Directions (MOD) with Approximate K-SVD (AK-SVD) for dictionary learning. Extensive experimental results show that the proposed scheme is competitive against some of the state-of-the-art denoising algorithms. Full article
Figures

Figure 1

Open AccessArticle
On the Second-Degree Exterior Derivation of Kahler Modules on XY
Symmetry 2018, 10(5), 166; https://doi.org/10.3390/sym10050166 -
Abstract
This article presents a new approach to stress the properties of Kahler modules. In this paper, we construct the Kahler modules of second-degree exterior derivations and we constitute an exact sequence of XY -modules. Particularly, we examine Kahler modules on X
[...] Read more.
This article presents a new approach to stress the properties of Kahler modules. In this paper, we construct the Kahler modules of second-degree exterior derivations and we constitute an exact sequence of XY -modules. Particularly, we examine Kahler modules on XY , and search for the homological size of Λ2(Ω1(XY)).Full article
Open AccessArticle
False Data Injection Attack Based on Hyperplane Migration of Support Vector Machine in Transmission Network of the Smart Grid
Symmetry 2018, 10(5), 165; https://doi.org/10.3390/sym10050165 -
Abstract
The smart grid is a key piece of infrastructure and its security has attracted widespread attention. The false data injection (FDI) attack is one of the important research issues in the field of smart grid security. Because this kind of attack has a
[...] Read more.
The smart grid is a key piece of infrastructure and its security has attracted widespread attention. The false data injection (FDI) attack is one of the important research issues in the field of smart grid security. Because this kind of attack has a great impact on the safe and stable operation of the smart grid, many effective detection methods have been proposed, such as an FDI detector based on the support vector machine (SVM). In this paper, we first analyze the problem existing in the detector based on SVM. Then, we propose a new attack method to reduce the detection effect of the FDI detector based on SVM and give a proof. The core of the method is that the FDI detector based on SVM cannot detect the attack vectors which are specially constructed and can replace the attack vectors into the training set when it is updated. Therefore, the training set is changed and then the next training result will be affected. With the increase of the number of the attack vectors which are injected into the positive space, the hyperplane moves to the side of the negative space, and the detection effect of the FDI detector based on SVM is reduced. Finally, we analyze the impact of different data injection modes for training results. Simulation experiments show that this attack method can impact the effectiveness of the FDI detector based on SVM. Full article
Figures

Figure 1

Open AccessArticle
Integrated Hybrid Second Order Algorithm for Orthogonal Projection onto a Planar Implicit Curve
Symmetry 2018, 10(5), 164; https://doi.org/10.3390/sym10050164 -
Abstract
The computation of the minimum distance between a point and a planar implicit curve is a very important problem in geometric modeling and graphics. An integrated hybrid second order algorithm to facilitate the computation is presented. The proofs indicate that the convergence of
[...] Read more.
The computation of the minimum distance between a point and a planar implicit curve is a very important problem in geometric modeling and graphics. An integrated hybrid second order algorithm to facilitate the computation is presented. The proofs indicate that the convergence of the algorithm is independent of the initial value and demonstrate that its convergence order is up to two. Some numerical examples further confirm that the algorithm is more robust and efficient than the existing methods. Full article
Figures

Figure 1

Open AccessArticle
An Online Algorithm for Dynamic NFV Placement in Cloud-Based Autonomous Response Networks
Symmetry 2018, 10(5), 163; https://doi.org/10.3390/sym10050163 -
Abstract
Autonomous response networks are becoming a reality thanks to recent advances in cloud computing, Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies. These enhanced networks fully enable autonomous real-time management of virtualized infrastructures. In this context, one of the major challenges is
[...] Read more.
Autonomous response networks are becoming a reality thanks to recent advances in cloud computing, Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies. These enhanced networks fully enable autonomous real-time management of virtualized infrastructures. In this context, one of the major challenges is how virtualized network resources can be effectively placed. Although this issue has been addressed before in cloud-based environments, it is not yet completely resolved for the online placement of virtual machines. For such a purpose, this paper proposes an online heuristic algorithm called Topology-Aware Placement of Virtual Network Functions (TAP-VNF) as a low-complexity solution for such dynamic infrastructures. As a complement, we provide a general formulation of the network function placement using the service function chaining concept. Furthermore, two metrics called consolidation and aggregation validate the efficiency of the proposal in the experimental simulations. We have compared our approach with optimal solutions, in terms of consolidation and aggregation ratios, showing a more suitable performance for dynamic cloud-based environments. The obtained results show that TAP-VNF also outperforms existing approaches based on traditional bin packing schemes. Full article
Figures

Figure 1

Open AccessFeature PaperArticle
Sampling Based Histogram PCA and Its Mapreduce Parallel Implementation on Multicore
Symmetry 2018, 10(5), 162; https://doi.org/10.3390/sym10050162 -
Abstract
In existing principle component analysis (PCA) methods for histogram-valued symbolic data, projection results are approximated based on Moore’s algebra and fail to reflect the data’s true structure, mainly because there is no precise, unified calculation method for the linear combination of histogram data.
[...] Read more.
In existing principle component analysis (PCA) methods for histogram-valued symbolic data, projection results are approximated based on Moore’s algebra and fail to reflect the data’s true structure, mainly because there is no precise, unified calculation method for the linear combination of histogram data. In this paper, we propose a new PCA method for histogram data that distinguishes itself from various well-established methods in that it can project observations onto the space spanned by principal components more accurately and rapidly by sampling through a MapReduce framework. The new histogram PCA method is implemented under the same assumption of “orthogonal dimensions for every observation” with the existing literatures. To project observations, the method first samples from the original histogram variables to acquire single-valued data, on which linear combination operations can be performed. Then, the projection of observations can be given by linear combination of loading vectors and single-valued samples, which is close to accurate projection results. Finally, the projection is summarized to histogram data. These procedures involve complex algorithms and large-scale data, which makes the new method time-consuming. To speed it up, we undertake a parallel implementation of the new method in a multicore MapReduce framework. A simulation study and an empirical study confirm that the new method is effective and time-saving. Full article
Figures

Figure 1

Open AccessArticle
Searching on Encrypted E-Data Using Random Searchable Encryption (RanSCrypt) Scheme
Symmetry 2018, 10(5), 161; https://doi.org/10.3390/sym10050161 -
Abstract
Cloud computing is intensifying the necessity for searchable encryption (SE) for data protection in cloud storage. SE encrypts data to preserve its confidentiality while offering a secure search facility on the encrypted data. Typical index-based SEs in data sharing scenarios can effectively search
[...] Read more.
Cloud computing is intensifying the necessity for searchable encryption (SE) for data protection in cloud storage. SE encrypts data to preserve its confidentiality while offering a secure search facility on the encrypted data. Typical index-based SEs in data sharing scenarios can effectively search secure keyword indexes. However, due to the smaller size of the keyword space, SEs using a public key are susceptible to a Keyword Guessing Attack (KGA) and other statistical information leakage. In this paper, for secure search in a data sharing scenario, we propose Random Searchable enCryption (RanSCrypt) that adds randomness to a transformed keyword to increase its space and aspires to make it irreversible. At the core of the mechanism, two keywords are garbled with randomness, still enabling another party to determine if the two garbled keywords (RanSCrypt’s terms REST and Trapdoor) are the same or not without knowing the actual keywords. As SE in a public key setting suffers from vulnerability to KGA, RanSCrypt transfers into a symmetric key setting with minimum overhead and without losing the features of a data sharing scenario. RanSCrypt also adulterates the search result to add perplexity and provides full control of access only to the data receiver. The receiver can cull out the erroneous results from the search result locally. Finally, we introduce a new type of attack on SE, namely, the Keyword Luring Attack (KLA), and show that RanSCrypt is safe from KLA attack due to adulteration of the result. Our security analysis proves RanSCrypt is invulnerable against KGA and leaks no information. Full article
Figures

Figure 1

Open AccessArticle
Linguistic Neutrosophic Generalized Partitioned Bonferroni Mean Operators and Their Application to Multi-Attribute Group Decision Making
Symmetry 2018, 10(5), 160; https://doi.org/10.3390/sym10050160 -
Abstract
To solve the problems related to inhomogeneous connections among the attributes, we introduce a novel multiple attribute group decision-making (MAGDM) method based on the introduced linguistic neutrosophic generalized weighted partitioned Bonferroni mean operator (LNGWPBM) for linguistic neutrosophic numbers (LNNs). First of
[...] Read more.
To solve the problems related to inhomogeneous connections among the attributes, we introduce a novel multiple attribute group decision-making (MAGDM) method based on the introduced linguistic neutrosophic generalized weighted partitioned Bonferroni mean operator (LNGWPBM) for linguistic neutrosophic numbers (LNNs). First of all, inspired by the merits of the generalized partitioned Bonferroni mean (GPBM) operator and LNNs, we combine the GPBM operator and LNNs to propose the linguistic neutrosophic GPBM (LNGPBM) operator, which supposes that the relationships are heterogeneous among the attributes in MAGDM. Then, we discuss its desirable properties and some special cases. In addition, aimed at the different importance of each attribute, the weighted form of the LNGPBM operator is investigated, which we call the LNGWPBM operator. Then, we discuss some of its desirable properties and special examples accordingly. In the end, we propose a novel MAGDM method on the basis of the introduced LNGWPBM operator, and illustrate its validity and merit by comparing it with the existing methods. Full article