Next Issue
Previous Issue

Table of Contents

Symmetry, Volume 10, Issue 5 (May 2018)

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Readerexternal link to open them.
Cover Story (view full-size image) We have formulated a numerical application of linear-molecule symmetry properties, described by the [...] Read more.
View options order results:
result details:
Displaying articles 1-53
Export citation of selected articles as:
Open AccessArticle Network Embedding via a Bi-Mode and Deep Neural Network Model
Symmetry 2018, 10(5), 180; https://doi.org/10.3390/sym10050180
Received: 6 April 2018 / Revised: 10 May 2018 / Accepted: 21 May 2018 / Published: 22 May 2018
PDF Full-text (416 KB) | HTML Full-text | XML Full-text
Abstract
Network embedding (NE) is an important method to learn the representations of a network via a low-dimensional space. Conventional NE models focus on capturing the structural information and semantic information of vertices while neglecting such information for edges. In this work, we propose
[...] Read more.
Network embedding (NE) is an important method to learn the representations of a network via a low-dimensional space. Conventional NE models focus on capturing the structural information and semantic information of vertices while neglecting such information for edges. In this work, we propose a novel NE model named BimoNet to capture both the structural and semantic information of edges. BimoNet is composed of two parts; i.e., the bi-mode embedding part and the deep neural network part. For the bi-mode embedding part, the first mode—named the add-mode—is used to express the entity-shared features of edges and the second mode—named the subtract-mode—is employed to represent the entity-specific features of edges. These features actually reflect the semantic information. For the deep neural network part, we firstly regard the edges in a network as nodes, and the vertices as links, which will not change the overall structure of the whole network. Then, we take the nodes’ adjacent matrix as the input of the deep neural network, as it can obtain similar representations for nodes with similar structure. Afterwards, by jointly optimizing the objective function of these two parts, BimoNet could preserve both the semantic and structural information of edges. In experiments, we evaluate BimoNet on three real-world datasets and the task of relation extraction, and BimoNet is demonstrated to outperform state-of-the-art baseline models consistently. Full article
Figures

Figure 1

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
Received: 4 May 2018 / Revised: 18 May 2018 / Accepted: 19 May 2018 / Published: 22 May 2018
PDF Full-text (1447 KB) | HTML Full-text | XML Full-text
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
Received: 16 April 2018 / Revised: 13 May 2018 / Accepted: 17 May 2018 / Published: 21 May 2018
PDF Full-text (2735 KB) | HTML Full-text | XML Full-text
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
Received: 26 April 2018 / Revised: 18 May 2018 / Accepted: 18 May 2018 / Published: 21 May 2018
PDF Full-text (425 KB) | HTML Full-text | XML Full-text
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
(This article belongs to the Special Issue Symmetry in Computing Theory and Application)
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
Received: 30 March 2018 / Revised: 15 May 2018 / Accepted: 18 May 2018 / Published: 20 May 2018
PDF Full-text (488 KB) | HTML Full-text | XML Full-text
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
Received: 19 April 2018 / Revised: 11 May 2018 / Accepted: 16 May 2018 / Published: 20 May 2018
PDF Full-text (12972 KB) | HTML Full-text | XML Full-text
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
Received: 29 April 2018 / Revised: 13 May 2018 / Accepted: 14 May 2018 / Published: 18 May 2018
PDF Full-text (328 KB) | HTML Full-text | XML Full-text
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
Received: 16 April 2018 / Revised: 3 May 2018 / Accepted: 11 May 2018 / Published: 18 May 2018
PDF Full-text (4138 KB) | HTML Full-text | XML Full-text
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 S i 2 C 3 -I and S i 2 C 3 - I I . 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 S i 2 C 3 -I and S i 2 C 3 - I I . 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
Received: 20 April 2018 / Revised: 10 May 2018 / Accepted: 14 May 2018 / Published: 18 May 2018
PDF Full-text (1006 KB) | HTML Full-text | XML Full-text
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
(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)
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
Received: 25 April 2018 / Revised: 13 May 2018 / Accepted: 14 May 2018 / Published: 17 May 2018
PDF Full-text (4034 KB) | HTML Full-text | XML Full-text
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
Received: 12 April 2018 / Revised: 7 May 2018 / Accepted: 10 May 2018 / Published: 17 May 2018
PDF Full-text (345 KB) | HTML Full-text | XML Full-text
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
(This article belongs to the Special Issue Symmetry: Anniversary Feature Papers 2018)
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
Received: 25 April 2018 / Revised: 13 May 2018 / Accepted: 15 May 2018 / Published: 17 May 2018
PDF Full-text (10654 KB) | HTML Full-text | XML Full-text
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
Received: 24 April 2018 / Revised: 11 May 2018 / Accepted: 15 May 2018 / Published: 17 May 2018
PDF Full-text (292 KB) | HTML Full-text | XML Full-text
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
(This article belongs to the Special Issue Emerging Approaches and Advances in Big Data)
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
Received: 4 April 2018 / Revised: 14 May 2018 / Accepted: 14 May 2018 / Published: 16 May 2018
PDF Full-text (7795 KB) | HTML Full-text | XML Full-text
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
Received: 14 April 2018 / Revised: 10 May 2018 / Accepted: 11 May 2018 / Published: 16 May 2018
PDF Full-text (269 KB) | HTML Full-text | XML Full-text
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 X Y -modules. Particularly, we examine Kahler modules on X Y , and search for the homological size of Λ 2 ( Ω 1 ( X Y ) ) . Full article
(This article belongs to the Special Issue Mathematical Physics and Symmetry)
Back to Top