Symmetry

23 pages, 364 KiB

Open AccessArticle

Generating Functions for Orthogonal Polynomials of A₂, C₂ and G₂

by Tomasz Czyżycki^1,†, Jiří Hrivnák^2,*,†

and Jiří Patera^3,†

¹ Institute of Mathematics, University of Białystok, Ciołkowskiego 1M, 15-245 Białystok, Poland

² Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Břehová 7, 115 19 Prague 1, Czech Republic

³ Centre de Recherches Mathématiques et Département de Mathématiques et de Statistique, Université de Montréal, C. P. 6128 Centre Ville, Montréal, QC H3C 3J7, Canada

^† These authors contributed equally to this work.

Symmetry 2018, 10(8), 354; https://doi.org/10.3390/sym10080354 - 20 Aug 2018

Cited by 4 | Viewed by 3345

Abstract

The generating functions of fourteen families of generalized Chebyshev polynomials related to rank two Lie algebras

A_{2}

,

C_{2}

and

G_{2}

are explicitly developed. There exist two classes of the orthogonal polynomials corresponding to the symmetric and antisymmetric orbit functions [...] Read more.

The generating functions of fourteen families of generalized Chebyshev polynomials related to rank two Lie algebras

A_{2}

,

C_{2}

and

G_{2}

are explicitly developed. There exist two classes of the orthogonal polynomials corresponding to the symmetric and antisymmetric orbit functions of each rank two algebra. The Lie algebras

G_{2}

and

C_{2}

admit two additional polynomial collections arising from their hybrid character functions. The admissible shift of the weight lattice permits the construction of a further four shifted polynomial classes of

C_{2}

and directly generalizes formation of the classical univariate Chebyshev polynomials of the third and fourth kinds. Explicit evaluating formulas for each polynomial family are derived and linked to the incomplete exponential Bell polynomials. Full article

11 pages, 2090 KiB

Open AccessArticle

Cryptanalysis on SDDO-Based BM123-64 Designs Suitable for Various IoT Application Targets

by Tran Song Dat Phuc and Changhoon Lee^*

Department of Computer Science and Engineering, Seoul National University of Science and Technology, Gongneung-ro, Nowon-gu, Seoul 01811, Korea

Symmetry 2018, 10(8), 353; https://doi.org/10.3390/sym10080353 - 20 Aug 2018

Cited by 5 | Viewed by 3862

Abstract

BM123-64 block cipher, which was proposed by Minh, N.H. and Bac, D.T. in 2014, was designed for high speed communication applications factors. It was constructed in hybrid controlled substitution–permutation network (CSPN) models with two types of basic controlled elements (CE) in distinctive designs. [...] Read more.

BM123-64 block cipher, which was proposed by Minh, N.H. and Bac, D.T. in 2014, was designed for high speed communication applications factors. It was constructed in hybrid controlled substitution–permutation network (CSPN) models with two types of basic controlled elements (CE) in distinctive designs. This cipher is based on switchable data-dependent operations (SDDO) and covers dependent-operations suitable for efficient primitive approaches for cipher constructions that can generate key schedule in a simple way. The BM123-64 cipher has advantages including high applicability, flexibility, and portability with different algorithm selection for various application targets with internet of things (IoT) as well as secure protection against common types of attacks, for instance, differential attacks and linear attacks. However, in this paper, we propose methods to possibly exploit the BM123-64 structure using related-key attacks. We have constructed a high probability related-key differential characteristics (DCs) on a full eight rounds of BM123-64 cipher. The related-key amplified boomerang attack is then proposed on all three different cases of operation-specific designs with effective results in complexity of data and time consumptions. This study can be considered as the first cryptographic results on BM123-64 cipher. Full article

(This article belongs to the Special Issue Symmetry-Adapted Machine Learning for Information Security)

▼ Show Figures

Figure 1

15 pages, 506 KiB

Open AccessArticle

PUF Based Authentication Protocol for IoT

by An Braeken

Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussel, Belgium

Symmetry 2018, 10(8), 352; https://doi.org/10.3390/sym10080352 - 20 Aug 2018

Cited by 144 | Viewed by 11302

Abstract

Key agreement between two constrained Internet of Things (IoT) devices that have not met each other is an essential feature to provide in order to establish trust among its users. Physical Unclonable Functions (PUFs) on a device represent a low cost primitive exploiting [...] Read more.

Key agreement between two constrained Internet of Things (IoT) devices that have not met each other is an essential feature to provide in order to establish trust among its users. Physical Unclonable Functions (PUFs) on a device represent a low cost primitive exploiting the unique random patterns in the device and have been already applied in a multitude of applications for secure key generation and key agreement in order to avoid an attacker to take over the identity of a tampered device, whose key material has been extracted. This paper shows that the key agreement scheme of a recently proposed PUF based protocol, presented by Chatterjee et al., for Internet of Things (IoT) is vulnerable for man-in-the-middle, impersonation, and replay attacks in the Yao–Dolev security model. We propose an alternative scheme, which is able to solve these issues and can provide in addition a more efficient key agreement and subsequently a communication phase between two IoT devices connected to the same authentication server. The scheme also offers identity based authentication and repudiation, when only using elliptic curve multiplications and additions, instead of the compute intensive pairing operations. Full article

▼ Show Figures

Graphical abstract

19 pages, 7069 KiB

Open AccessArticle

Agustín de Betancourt’s Double-Acting Steam Engine: Geometric Modeling and Virtual Reconstruction

by José Ignacio Rojas-Sola^1,*

, Belén Galán-Moral² and Eduardo De la Morena-De la Fuente³

¹ Department of Engineering Graphics, Design and Projects, University of Jaén, Campus de las Lagunillas, s/n, 23071 Jaén, Spain

² University of Jaén, Campus de las Lagunillas, s/n, 23071 Jaén, Spain

³ Research Group ‘Engineering Graphics and Industrial Archaeology’, University of Jaén, Campus de las Lagunillas, s/n, 23071 Jaén, Spain

Symmetry 2018, 10(8), 351; https://doi.org/10.3390/sym10080351 - 20 Aug 2018

Cited by 26 | Viewed by 5249

Abstract

In this paper, the geometric modeling and virtual reconstruction of the double-acting steam engine designed by Agustín de Betancourt in 1789 are shown. For this, the software Autodesk Inventor Professional is used, which has allowed us to obtain its geometric documentation. The material [...] Read more.

In this paper, the geometric modeling and virtual reconstruction of the double-acting steam engine designed by Agustín de Betancourt in 1789 are shown. For this, the software Autodesk Inventor Professional is used, which has allowed us to obtain its geometric documentation. The material for the research is available on the website of the Betancourt Project of the Canary Orotava Foundation for the History of Science. Almost all parts of the steam engine are drawn on the sheets, but due to the absence of scale and space, it is insufficient to obtain an accurate and reliable 3D CAD (Computer-Aided Design) model. For this reason a graphic scale has been adopted so that the dimensions of the elements are coherent. Also, it has been necessary to make some dimensional and geometric hypotheses, as well as restrictions of movement (degrees of freedom). Geometric modeling has made it possible to know that the system is balanced with the geometric center of the rocker arm shaft, and presents an energetic symmetry whose axis is the support of the parallelogram where the shaft rests: calorific energy to the left and mechanical energy to the right, with the rocker arm acting as a transforming element from one to the other. Full article

(This article belongs to the Special Issue Symmetry and Engineering Design)

▼ Show Figures

Graphical abstract

15 pages, 323 KiB

Open AccessArticle

Commutative Generalized Neutrosophic Ideals in BCK-Algebras

by Rajab Ali Borzooei¹

, Xiaohong Zhang^2,3,*

, Florentin Smarandache⁴

and Young Bae Jun^1,5

¹ Department of Mathematics, Shahid Beheshti University, Tehran 1983963113, Iran

² Department of Mathematics, Shaanxi University of Science & Technology, Xi’an 710021, China

³ Department of Mathematics, Shanghai Maritime University, Shanghai 201306, China

⁴ Department of Mathematics, University of New Mexico, Gallup, NM 87301, USA

⁵ Department of Mathematics Education, Gyeongsang National University, Jinju 52828, Korea

Symmetry 2018, 10(8), 350; https://doi.org/10.3390/sym10080350 - 20 Aug 2018

Cited by 24 | Viewed by 3186

Abstract

The concept of a commutative generalized neutrosophic ideal in a

B C K

-algebra is proposed, and related properties are proved. Characterizations of a commutative generalized neutrosophic ideal are considered. Also, some equivalence relations on the family of all commutative generalized neutrosophic ideals [...] Read more.

The concept of a commutative generalized neutrosophic ideal in a

B C K

-algebra is proposed, and related properties are proved. Characterizations of a commutative generalized neutrosophic ideal are considered. Also, some equivalence relations on the family of all commutative generalized neutrosophic ideals in

B C K

-algebras are introduced, and some properties are investigated. Full article

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)

14 pages, 1623 KiB

Open AccessArticle

Optimizing the High-Level Maintenance Planning Problem of the Electric Multiple Unit Train Using a Modified Particle Swarm Optimization Algorithm

by Jianping Wu¹, Boliang Lin^1,*

, Hui Wang², Xuhui Zhang³, Zhongkai Wang² and Jiaxi Wang¹

¹ School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

² Institute of Computing Technology, China Academy of Railway Sciences, Beijing 100081, China

³ Department of Vehicles, China Railway Shanghai Bureau Group Co., Ltd., Shanghai 200071, China

Symmetry 2018, 10(8), 349; https://doi.org/10.3390/sym10080349 - 19 Aug 2018

Cited by 8 | Viewed by 3856

Abstract

Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not [...] Read more.

Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not be fully satisfied due to the insufficient supply of trains. In contrast, if the process is undergone in advance, extra costs will be incurred. Based on the practical requirements of high-level maintenance, a 0–1 programming model is proposed. To simplify the description of the model, candidate sets of delivery dates, i.e., time windows, are generated according to the historical data and maintenance regulations. The constraints of the model include maintenance regulations, the passenger transportation demand, and capacities of workshop. The objective function is to minimize the mileage losses of all EMU trains. Moreover, a modified particle swarm algorithm is developed for solving the problem. Finally, a real-world case study of Shanghai Railway is conducted to demonstrate the proposed method. Computational results indicate that the (approximate) optimal solution can be obtained successfully by our method and the proposed method significantly reduces the solution time to 500 s. Full article

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)

▼ Show Figures

Figure 1

13 pages, 751 KiB

Open AccessArticle

Sharp Bounds on the Higher Order Schwarzian Derivatives for Janowski Classes

by Nak Eun Cho¹, Virendra Kumar^2,* and V. Ravichandran³

¹ Department of Applied Mathematics, Pukyong National University, Busan 48513, Korea

² Department of Mathematics, Ramanujan college, University of Delhi, H-Block, Kalkaji, New Delhi 110019, India

³ Department of Mathematics, National Institute of Technology, Tiruchirappalli, Tamil Nadu 620015, India

Symmetry 2018, 10(8), 348; https://doi.org/10.3390/sym10080348 - 18 Aug 2018

Cited by 6 | Viewed by 3016

Abstract

Higher order Schwarzian derivatives for normalized univalent functions were first considered by Schippers, and those of convex functions were considered by Dorff and Szynal. In the present investigation, higher order Schwarzian derivatives for the Janowski star-like and convex functions are considered, and sharp [...] Read more.

Higher order Schwarzian derivatives for normalized univalent functions were first considered by Schippers, and those of convex functions were considered by Dorff and Szynal. In the present investigation, higher order Schwarzian derivatives for the Janowski star-like and convex functions are considered, and sharp bounds for the first three consecutive derivatives are investigated. The results obtained in this paper generalize several existing results in this direction. Full article

(This article belongs to the Special Issue Integral Transforms and Operational Calculus)

18 pages, 5686 KiB

Open AccessArticle

Skin Lesion Segmentation Method for Dermoscopy Images Using Artificial Bee Colony Algorithm

by Mohanad Aljanabi^1,2

, Yasa Ekşioğlu Özok¹, Javad Rahebi³ and Ahmad S. Abdullah^1,4,*

¹ Department of Electrical & Electronics Engineering, Altinbas University, Istanbul 34218, Turkey

² Department of Electrical Power Techniques Engineering, Technical College, Al-Furat Al-Awsat Technical University, Najaf 54001, Iraq

³ Department of Electrical & Electronics Engineering, University of Turkish Aeronautical Association, Ankara 06790, Turkey

⁴ Department of Communications, University of Diyala, Diyala 32001, Iraq

Symmetry 2018, 10(8), 347; https://doi.org/10.3390/sym10080347 - 18 Aug 2018

Cited by 44 | Viewed by 7968

Abstract

The occurrence rates of melanoma are rising rapidly, which are resulting in higher death rates. However, if the melanoma is diagnosed in Phase I, the survival rates increase. The segmentation of the melanoma is one of the largest tasks to undertake and achieve [...] Read more.

The occurrence rates of melanoma are rising rapidly, which are resulting in higher death rates. However, if the melanoma is diagnosed in Phase I, the survival rates increase. The segmentation of the melanoma is one of the largest tasks to undertake and achieve when considering both beneath and over the segmentation. In this work, a new approach based on the artificial bee colony (ABC) algorithm is proposed for the detection of melanoma from digital images. This method is simple, fast, flexible, and requires fewer parameters compared with other algorithms. The proposed approach is applied on the PH2, ISBI 2016 challenge, the ISBI 2017 challenge, and Dermis datasets. These bases contained images are affected by different abnormalities. The formation of the databases consists of images collected from different sources; they are bases with different types of resolution, lighting, etc., so in the first step, the noise was removed from the images by using morphological filtering. In the next step, the ABC algorithm is used to find the optimum threshold value for the melanoma detection. The proposed approach achieved good results in the conditions of high specificity. The experimental results suggest that the proposed method accomplished higher performance compared to the ground truth images supported by a Dermatologist. For the melanoma detection, the method achieved an average accuracy and Jaccard’s coefficient in the range of 95.24–97.61%, and 83.56–85.25% in these four databases. To show the robustness of this work, the results were compared to existing methods in the literature for melanoma detection. High values for estimation performance confirmed that the proposed melanoma detection is better than other algorithms, which demonstrates the highly differential power of the newly introduced features. Full article

▼ Show Figures

Graphical abstract

16 pages, 1339 KiB

Open AccessArticle

A Neutrosophic Set Based Fault Diagnosis Method Based on Multi-Stage Fault Template Data

by Wen Jiang^*

, Yu Zhong and Xinyang Deng

School of Electronics and Information, Northwestern Polytechnical University, Xi’an 710072, China

Symmetry 2018, 10(8), 346; https://doi.org/10.3390/sym10080346 - 17 Aug 2018

Cited by 10 | Viewed by 3618

Abstract

Fault diagnosis is an important issue in various fields and aims to detect and identify the faults of systems, products, and processes. The cause of a fault is complicated due to the uncertainty of the actual environment. Nevertheless, it is difficult to consider [...] Read more.

Fault diagnosis is an important issue in various fields and aims to detect and identify the faults of systems, products, and processes. The cause of a fault is complicated due to the uncertainty of the actual environment. Nevertheless, it is difficult to consider uncertain factors adequately with many traditional methods. In addition, the same fault may show multiple features and the same feature might be caused by different faults. In this paper, a neutrosophic set based fault diagnosis method based on multi-stage fault template data is proposed to solve this problem. For an unknown fault sample whose fault type is unknown and needs to be diagnosed, the neutrosophic set based on multi-stage fault template data is generated, and then the generated neutrosophic set is fused via the simplified neutrosophic weighted averaging (SNWA) operator. Afterwards, the fault diagnosis results can be determined by the application of defuzzification method for a defuzzying neutrosophic set. Most kinds of uncertain problems in the process of fault diagnosis, including uncertain information and inconsistent information, could be handled well with the integration of multi-stage fault template data and the neutrosophic set. Finally, the practicality and effectiveness of the proposed method are demonstrated via an illustrative example. Full article

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)

▼ Show Figures

Graphical abstract

8 pages, 720 KiB

Open AccessArticle

Neutrosophic Duplets of {Z_pn,×} and {Z_pq,×} and Their Properties

by Vasantha Kandasamy W.B.¹

, Ilanthenral Kandasamy^1,*

and Florentin Smarandache²

¹ School of Computer Science and Engineering, VIT, Vellore 632014, India

² Department of Mathematics, University of New Mexico, 705 Gurley Avenue, Gallup, NM 87301, USA

Symmetry 2018, 10(8), 345; https://doi.org/10.3390/sym10080345 - 17 Aug 2018

Cited by 15 | Viewed by 2920

Abstract

The notions of neutrosophy, neutrosophic algebraic structures, neutrosophic duplet and neutrosophic triplet were introduced by Florentin Smarandache. In this paper, the neutrosophic duplets of

Z_{p^{n}}

,

Z_{p q}

and

Z_{p_{1} p_{2} \dots p_{n}}

are studied. In [...] Read more.

The notions of neutrosophy, neutrosophic algebraic structures, neutrosophic duplet and neutrosophic triplet were introduced by Florentin Smarandache. In this paper, the neutrosophic duplets of

Z_{p^{n}}

,

Z_{p q}

and

Z_{p_{1} p_{2} \dots p_{n}}

are studied. In the case of

Z_{p^{n}}

and

Z_{p q}

, the complete characterization of neutrosophic duplets are given. In the case of

Z_{p_{1} \dots p_{n}}

, only the neutrosophic duplets associated with

p_{i}

s are provided;

i = 1, 2, \dots, n

. Some open problems related to neutrosophic duplets are proposed. Full article

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)

24 pages, 2537 KiB

Open AccessArticle

Perception of 3D Symmetrical and Nearly Symmetrical Shapes

by Vijai Jayadevan^1,*

, Tadamasa Sawada²

, Edward Delp¹

and Zygmunt Pizlo³

¹ Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA

² School of Psychology, National Research University Higher School of Economics, Moscow 109316, Russia

³ Department of Cognitive Sciences, University of California-Irvine, Irvine, CA 92697, USA

Symmetry 2018, 10(8), 344; https://doi.org/10.3390/sym10080344 - 16 Aug 2018

Cited by 13 | Viewed by 6341

Abstract

The human visual system uses priors to convert an ill-posed inverse problem of 3D shape recovery into a well-posed one. In previous studies, we have demonstrated the use of priors like symmetry, compactness and minimal surface in the perception of 3D symmetric shapes. [...] Read more.

The human visual system uses priors to convert an ill-posed inverse problem of 3D shape recovery into a well-posed one. In previous studies, we have demonstrated the use of priors like symmetry, compactness and minimal surface in the perception of 3D symmetric shapes. We also showed that binocular perception of symmetric shapes can be well modeled by the above-mentioned priors and binocular depth order information. In this study, which used a shape-matching task, we show that these priors can also be used to model perception of near-symmetrical shapes. Our near-symmetrical shapes are asymmetrical shapes obtained from affine distortions of symmetrical shapes. We found that the perception of symmetrical shapes is closer to veridical than the perception of asymmetrical shapes. We introduce a metric to measure asymmetry of abstract polyhedral shapes, and a similar metric to measure shape dissimilarity between two polyhedral shapes. We report some key observations obtained by analyzing the data from the experiment. A website was developed with all the shapes used in the experiment, along with the shapes recovered by the subject and the shapes recovered by the model. This website provides a qualitative analysis of the effectiveness of the model and also helps demonstrate the goodness of the shape metric. Full article

(This article belongs to the Special Issue Symmetry-Related Activity in Mid-Level Vision)

▼ Show Figures

Figure 1

22 pages, 738 KiB

Open AccessArticle

Three-Body Dispersion Potentials Involving Electric Octupole Coupling

by Stefan Yoshi Buhmann^1,2 and A. Salam^1,2,3,*

¹ Physikalisches Institut, Albert-Ludwigs-Universität Freiburg, Herman-Herder-Straße 3, 79104 Freiburg, Germany

² Freiburg Institute for Advanced Studies (FRIAS), Albert-Ludwigs-Universität Freiburg, Albertstraße 19, 79104 Freiburg, Germany

³ Department of Chemistry, Wake Forest University, Winston-Salem, NC 27109, USA

Symmetry 2018, 10(8), 343; https://doi.org/10.3390/sym10080343 - 16 Aug 2018

Cited by 3 | Viewed by 3649

Abstract

Non-pairwise additive three-body dispersion potentials dependent upon one or more electric octupole moments are evaluated using the theory of molecular quantum electrodynamics. To simplify the perturbation theory calculations, an effective two-photon interaction Hamiltonian operator is employed. This leads to only third-order theory being [...] Read more.

Non-pairwise additive three-body dispersion potentials dependent upon one or more electric octupole moments are evaluated using the theory of molecular quantum electrodynamics. To simplify the perturbation theory calculations, an effective two-photon interaction Hamiltonian operator is employed. This leads to only third-order theory being required to evaluate energy shifts instead of the usual sixth-order formula, and the summation over six time-ordered sequences of virtual photon creation and annihilation events. Specific energy shifts computed include DD-DD-DO, DD-DO-DO, DO-DO-DO, and DD-DO-OO terms, where D and O are electric dipole and octupole moments, respectively. The formulae obtained are applicable to an arbitrary arrangement of the three particles, and we present explicit results for the equilateral triangle and collinear configurations, which complements the recently published DD-DD-OO potential. In this last case it was found that the contribution from the octupole weight-1 term could be viewed as a higher-order correction to the triple-dipole dispersion potential DD-DD-DD. In a similar fashion the octupole moment is decomposed into its irreducible components of weights-1 and -3, enabling insight to be gained into the potentials obtained in this study. Dispersion interaction energies proportional to mixed dipole-octupole polarisabilities, for example, are found to depend only on the weight-1 octupole moment for isotropic species and are retarded. Additional approximations are necessary in the evaluation of wave vector integrals for these cases in order to yield energy shifts that are valid in the near-zone. Full article

(This article belongs to the Special Issue New Trends in Quantum Electrodynamics)

▼ Show Figures

Graphical abstract

23 pages, 4317 KiB

Open AccessFeature PaperArticle

A Robust Distributed Big Data Clustering-based on Adaptive Density Partitioning using Apache Spark

by Behrooz Hosseini¹

and Kourosh Kiani^2,*

¹ Electrical and Computer Engineering Department, Semnan University, Semnan 35131-1911, Iran

² Faculty of Electrical and Computer Engineering Department, Semnan University, Semnan 35131-1911, Iran

Symmetry 2018, 10(8), 342; https://doi.org/10.3390/sym10080342 - 15 Aug 2018

Cited by 15 | Viewed by 4985

Abstract

Unsupervised machine learning and knowledge discovery from large-scale datasets have recently attracted a lot of research interest. The present paper proposes a distributed big data clustering approach-based on adaptive density estimation. The proposed method is developed-based on Apache Spark framework and tested on [...] Read more.

Unsupervised machine learning and knowledge discovery from large-scale datasets have recently attracted a lot of research interest. The present paper proposes a distributed big data clustering approach-based on adaptive density estimation. The proposed method is developed-based on Apache Spark framework and tested on some of the prevalent datasets. In the first step of this algorithm, the input data is divided into partitions using a Bayesian type of Locality Sensitive Hashing (LSH). Partitioning makes the processing fully parallel and much simpler by avoiding unneeded calculations. Each of the proposed algorithm steps is completely independent of the others and no serial bottleneck exists all over the clustering procedure. Locality preservation also filters out the outliers and enhances the robustness of the proposed approach. Density is defined on the basis of Ordered Weighted Averaging (OWA) distance which makes clusters more homogenous. According to the density of each node, the local density peaks will be detected adaptively. By merging the local peaks, final cluster centers will be obtained and other data points will be a member of the cluster with the nearest center. The proposed method has been implemented and compared with similar recently published researches. Cluster validity indexes achieved from the proposed method shows its superiorities in precision and noise robustness in comparison with recent researches. Comparison with similar approaches also shows superiorities of the proposed method in scalability, high performance, and low computation cost. The proposed method is a general clustering approach and it has been used in gene expression clustering as a sample of its application. Full article

(This article belongs to the Special Issue Emerging Approaches and Advances in Big Data)

▼ Show Figures

Figure 1

14 pages, 387 KiB

Open AccessArticle

Symmetry Analysis, Explicit Solutions, and Conservation Laws of a Sixth-Order Nonlinear Ramani Equation

by Aliyu Isa Aliyu^1,2,*

, Mustafa Inc¹

, Abdullahi Yusuf^1,2

and Dumitru Baleanu^3,4

¹ Department of Mathematics, Science Faculty, Firat University, Elazig 23119, Turkey

² Department of Mathematics, Faculty of Science, Federal University Dutse, Dutse 71560, Nigeria

³ Department of Mathematics, Cankaya University, Ankara 06790, Turkey

⁴ Institute of Space Sciences, Magurele 077126, Romania

Symmetry 2018, 10(8), 341; https://doi.org/10.3390/sym10080341 - 15 Aug 2018

Cited by 41 | Viewed by 4978

Abstract

In this work, we study the completely integrable sixth-order nonlinear Ramani equation. By applying the Lie symmetry analysis technique, the Lie point symmetries and the optimal system of one-dimensional sub-algebras of the equation are derived. The optimal system is further used to derive [...] Read more.

In this work, we study the completely integrable sixth-order nonlinear Ramani equation. By applying the Lie symmetry analysis technique, the Lie point symmetries and the optimal system of one-dimensional sub-algebras of the equation are derived. The optimal system is further used to derive the symmetry reductions and exact solutions. In conjunction with the Riccati Bernoulli sub-ODE (RBSO), we construct the travelling wave solutions of the equation by solving the ordinary differential equations (ODEs) obtained from the symmetry reduction. We show that the equation is nonlinearly self-adjoint and construct the conservation laws (CL) associated with the Lie symmetries by invoking the conservation theorem due to Ibragimov. Some figures are shown to show the physical interpretations of the acquired results. Full article

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)

▼ Show Figures

Figure 1

17 pages, 1675 KiB

Open AccessArticle

Chinese Remainder Theorem-Based Secret Image Sharing with Small-Sized Shadow Images

by Jinrui Chen

, Kesheng Liu, Xuehu Yan^*, Lintao Liu, Xuan Zhou

and Longdan Tan

National University of Defense Technology, Hefei 230037, China

Symmetry 2018, 10(8), 340; https://doi.org/10.3390/sym10080340 - 15 Aug 2018

Cited by 11 | Viewed by 4210

Abstract

Secret image sharing (SIS) with small-sized shadow images has many benefits, such as saving storage space, improving transmission time, and achieving information hiding. When adjacent pixel values in an image are similar to each other, the secret image will be leaked when all [...] Read more.

Secret image sharing (SIS) with small-sized shadow images has many benefits, such as saving storage space, improving transmission time, and achieving information hiding. When adjacent pixel values in an image are similar to each other, the secret image will be leaked when all random factors of an SIS scheme are utilized for achieving small sizes of shadow images. Most of the studies in this area suffer from an inevitable problem: auxiliary encryption is crucial in ensuring the security of those schemes. In this paper, an SIS scheme with small-sized shadow images based on the Chinese remainder theorem (CRT) is proposed. The size of shadow images can be reduced to nearly

1 / k

of the original secret image. By adding random bits to binary representations of the random factors in the CRT, auxiliary encryption is not necessary for this scheme. Additionally, reasonable modifications of the random factors make it possible to incorporate all advantages of the CRT as well, including a (

k, n

) threshold, lossless recovery, and low computation complexity. Analyses and experiments are provided to demonstrate the effectiveness of the proposed scheme. Full article

(This article belongs to the Special Issue Emerging Data Hiding Systems in Image Communications)

▼ Show Figures

Figure 1

15 pages, 300 KiB

Open AccessArticle

A Three-Dimensional Constrained Ordered Weighted Averaging Aggregation Problem with Lower Bounded Variables

by Yi-Fang Chen and Hui-Chin Tang^*

Department of Industrial Engineering and Management, National Kaohsiung University of Science and Technology, Kaohsiung 80778, Taiwan

Symmetry 2018, 10(8), 339; https://doi.org/10.3390/sym10080339 - 13 Aug 2018

Cited by 2 | Viewed by 2691

Abstract

We consider the constrained ordered weighted averaging (OWA) aggregation problem with a single constraint and lower bounded variables. For the three-dimensional constrained OWA aggregation problem with lower bounded variables, we present four types of solution depending on the number of zero elements. According [...] Read more.

We consider the constrained ordered weighted averaging (OWA) aggregation problem with a single constraint and lower bounded variables. For the three-dimensional constrained OWA aggregation problem with lower bounded variables, we present four types of solution depending on the number of zero elements. According to the computerized experiment we perform, the lower bounds can affect the solution types, thereby affecting the optimal solution of the three-dimensional constrained OWA aggregation problem with lower bounded variables. Full article

(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)

23 pages, 2048 KiB

Open AccessArticle

FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks

by Kanghuai Liu^1,2

, Zhigang Chen^1,2,*, Jia Wu^1,2,*

and Leilei Wang^1,2

¹ School of Software, Central South University, Changsha 410075, China

² “Mobile Health” Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China

Symmetry 2018, 10(8), 338; https://doi.org/10.3390/sym10080338 - 13 Aug 2018

Cited by 50 | Viewed by 4507

Abstract

At the dawn of big data and 5G networks, end-to-end communication with large amounts of data between mobile devices is difficult to be implemented through the traditional face-to-face transmission mechanism in social networks. Consequently, opportunistic social networks proposed that message applications should choose [...] Read more.

At the dawn of big data and 5G networks, end-to-end communication with large amounts of data between mobile devices is difficult to be implemented through the traditional face-to-face transmission mechanism in social networks. Consequently, opportunistic social networks proposed that message applications should choose proper relay nodes to perform effective data transmission processes. At present, several routing algorithms, based on node similarity, attempt to use the contextual information related to nodes and the special relationships between them to select a suitable relay node among neighbors. However, when evaluating the similarity degree between a pair of nodes, most existing algorithms in opportunistic social networks pay attention to only a few similar factors, and even ignore the importance of mobile similarity in the data transmission process. To improve the transmission environment, this study establishes a fuzzy routing-forwarding algorithm (FCNS) exploiting comprehensive node similarity (the mobile and social similarities) in opportunistic social networks. In our proposed scheme, the transmission preference of the node is determined through the fuzzy evaluation of mobile and social similarities. The suitable message delivery decision is made by collecting and comparing the transmission preference of nodes, and the sustainable and stable data transmission process is performed through the feedback mechanism. Through simulations and the comparison of social network algorithms, the delivery ratio in the proposed algorithm is 0.85 on average, and the routing delay and network overhead of this algorithm are always the lowest. Full article

▼ Show Figures

Figure 1

30 pages, 5186 KiB

Open AccessArticle

A Dynamic Adjusting Novel Global Harmony Search for Continuous Optimization Problems

by Chui-Yu Chiu¹, Po-Chou Shih^2,*

and Xuechao Li³

¹ Industrial Engineering and Management, National Taipei University of Technology, Taipei 10632, Taiwan

² College of Management, National Taipei University of Technology, Taipei 10632, Taiwan

³ Department of Computer Science, Concordia University Chicago, Chicago, IL 60305, USA

Symmetry 2018, 10(8), 337; https://doi.org/10.3390/sym10080337 - 12 Aug 2018

Cited by 17 | Viewed by 3723

Abstract

A novel global harmony search (NGHS) algorithm, as proposed in 2010, is an improved algorithm that combines the harmony search (HS), particle swarm optimization (PSO), and a genetic algorithm (GA). Moreover, the fixed parameter of mutation probability was used in the NGHS algorithm. [...] Read more.

A novel global harmony search (NGHS) algorithm, as proposed in 2010, is an improved algorithm that combines the harmony search (HS), particle swarm optimization (PSO), and a genetic algorithm (GA). Moreover, the fixed parameter of mutation probability was used in the NGHS algorithm. However, appropriate parameters can enhance the searching ability of a metaheuristic algorithm, and their importance has been described in many studies. Inspired by the adjustment strategy of the improved harmony search (IHS) algorithm, a dynamic adjusting novel global harmony search (DANGHS) algorithm, which combines NGHS and dynamic adjustment strategies for genetic mutation probability, is introduced in this paper. Moreover, extensive computational experiments and comparisons are carried out for 14 benchmark continuous optimization problems. The results show that the proposed DANGHS algorithm has better performance in comparison with other HS algorithms in most problems. In addition, the proposed algorithm is more efficient than previous methods. Finally, different strategies are suitable for different situations. Among these strategies, the most interesting and exciting strategy is the periodic dynamic adjustment strategy. For a specific problem, the periodic dynamic adjustment strategy could have better performance in comparison with other decreasing or increasing strategies. These results inspire us to further investigate this kind of periodic dynamic adjustment strategy in future experiments. Full article

(This article belongs to the Special Issue Information Technology and Its Applications 2021)

▼ Show Figures

Figure 1

12 pages, 872 KiB

Open AccessArticle

Steganalysis of Inactive Voice-Over-IP Frames Based on Poker Test

by Jie Liu¹, Hui Tian^1,*

, Chin-Chen Chang², Tian Wang¹, Yonghong Chen¹ and Yiqiao Cai¹

¹ College of Computer Science and Technology, National Huaqiao University, Xiamen 361021, China

² Department of Information and Computer Science, Feng Chia University, Taichung 40724, Taiwan

Symmetry 2018, 10(8), 336; https://doi.org/10.3390/sym10080336 - 11 Aug 2018

Cited by 4 | Viewed by 3531

Abstract

This paper concentrates on the detection of steganography in inactive frames of low bit rate audio streams in Voice over Internet Protocol (VoIP) scenarios. Both theoretical and experimental analyses demonstrate that the distribution of 0 and 1 in encoding parameter bits becomes symmetric [...] Read more.

This paper concentrates on the detection of steganography in inactive frames of low bit rate audio streams in Voice over Internet Protocol (VoIP) scenarios. Both theoretical and experimental analyses demonstrate that the distribution of 0 and 1 in encoding parameter bits becomes symmetric after a steganographic process. Moreover, this symmetry affects the frequency of each subsequence of parameter bits, and accordingly changes the poker test statistical features of encoding parameter bits. Employing the poker test statistics of each type of encoding parameter bits as detection features, we present a steganalysis method based on a support vector machine. We evaluate the proposed method with a large quantity of speech samples encoded by G.723.1 and compare it with the entropy test. The experimental results show that the proposed method is effective, and largely outperforms the entropy test in any cases. Full article

(This article belongs to the Special Issue Emerging Data Hiding Systems in Image Communications)

▼ Show Figures

Figure 1

13 pages, 2954 KiB

Open AccessArticle

Finite Element Study of a Threaded Fastening: The Case of Surgical Screws in Bone

by J. A. López-Campos¹, A. Segade^1,*

, E. Casarejos¹

, J. R. Fernández²

, J. A. Vilán¹

and P. Izquierdo¹

¹ Departamento de Ingeniería Mecánica, Máquinas y Motores Térmicos y Fluidos, Universidad de Vigo, Campus as Lagoas Marcosende s/n, Vigo 36310, Spain

² Departamento de Matemática Aplicada I, Universidad de Vigo, Campus as Lagoas Marcosende s/n, Vigo 36310, Spain

Symmetry 2018, 10(8), 335; https://doi.org/10.3390/sym10080335 - 11 Aug 2018

Cited by 10 | Viewed by 6246

Abstract

This paper studies the stress state of a threaded fastening by using Finite Element (FE) models, applied to surgical screws in cortical bone. There is a general interest in studying the stress states induced in the different elements of a joint caused by [...] Read more.

This paper studies the stress state of a threaded fastening by using Finite Element (FE) models, applied to surgical screws in cortical bone. There is a general interest in studying the stress states induced in the different elements of a joint caused by the thread contact. Analytical models were an initial approach, and later FE models allowed detailed studies of the complex phenomena related to these joints. Different studies have evaluated standard threaded joints in machinery and structures, being the thread symmetric. However, surgical screws employ asymmetric thread geometry, selected to improve the stress level generated in the bone. Despite the interest and widespread use, there is scarce documentation on the actual effect of this thread type. In this work, we discuss the results provided by FE models with detailed descriptions of the contacts comparing differences caused by the materials of the joint, the thread geometry and the thread’s three-dimensional helical effects. The complex contacts at the threaded surfaces cause intense demand on computational resources that often limits the studies including these joints. We analyze the results provided by one commercial software package to simplify the threaded joints. The comparison with detailed FE models allows a definition of the level of uncertainty and possible limitations of this type of simplifications, and helps in making suitable choices for complex applications. Full article

(This article belongs to the Special Issue Symmetry and Engineering Design)

▼ Show Figures

Figure 1

12 pages, 3376 KiB

Open AccessArticle

Novel Procedure for Designing and 3D Printing a Customized Surgical Template for Arthrodesis Surgery on the Sacrum

by Francesco Naddeo¹

, Alessandro Naddeo^1,*

, Nicola Cappetti¹, Emilio Cataldo¹ and Riccardo Militio²

¹ Department of Industrial Engineering, University of Salerno, 132, 84084 Fisciano, Italy

² I.M.C.A.R. S.P.A., Via Salvo d’Acquisto 49, 20863 Concorrezzo MB, Italy

Symmetry 2018, 10(8), 334; https://doi.org/10.3390/sym10080334 - 10 Aug 2018

Cited by 6 | Viewed by 3742

Abstract

In this article, the authors propose a novel procedure for designing a customized 3D-printed surgical template to guide surgeons in inserting screws into the sacral zone during arthrodesis surgeries. The template is characterized by two cylindrical guides defined by means of trajectories identified, [...] Read more.

In this article, the authors propose a novel procedure for designing a customized 3D-printed surgical template to guide surgeons in inserting screws into the sacral zone during arthrodesis surgeries. The template is characterized by two cylindrical guides defined by means of trajectories identified, based on standard procedure, via an appropriate Computer-Aided-Design (CAD)-based procedure. The procedure is based on the definition of the insertion direction by means of anatomical landmarks that enable the screws to take advantage of the maximum available bone path. After 3D printing, the template adheres perfectly to the bone surface, showing univocal positioning by exploiting the foramina of the sacrum, great maneuverability due to the presence of an ergonomic handle, as well as a break system for the two independent guides. These features make the product innovative. Thanks to its small size and the easy anchoring, the surgeon can simply position the template on the insertion area and directly insert the screws, without alterations to standard surgical procedures. This has the effect of reducing the overall duration of the surgery and the patient’s exposure to X-rays, and increasing both the safety of the intervention and the quality of the results. Full article

(This article belongs to the Special Issue Symmetry and Engineering Design)

▼ Show Figures

Figure 1

14 pages, 1451 KiB

Open AccessArticle

A Multi-Level Privacy-Preserving Approach to Hierarchical Data Based on Fuzzy Set Theory

by Jinyan Wang^1,2

, Guoqing Cai², Chen Liu², Jingli Wu^1,2 and Xianxian Li^1,2,*

¹ Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin 541004, China

² School of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, China

Symmetry 2018, 10(8), 333; https://doi.org/10.3390/sym10080333 - 10 Aug 2018

Cited by 3 | Viewed by 3733

Abstract

Nowadays, more and more applications are dependent on storage and management of semi-structured information. For scientific research and knowledge-based decision-making, such data often needs to be published, e.g., medical data is released to implement a computer-assisted clinical decision support system. Since this data [...] Read more.

Nowadays, more and more applications are dependent on storage and management of semi-structured information. For scientific research and knowledge-based decision-making, such data often needs to be published, e.g., medical data is released to implement a computer-assisted clinical decision support system. Since this data contains individuals’ privacy, they must be appropriately anonymized before to be released. However, the existing anonymization method based on l-diversity for hierarchical data may cause serious similarity attacks, and cannot protect data privacy very well. In this paper, we utilize fuzzy sets to divide levels for sensitive numerical and categorical attribute values uniformly (a categorical attribute value can be converted into a numerical attribute value according to its frequency of occurrences), and then transform the value levels to sensitivity levels. The privacy model (

α_{l e v}^{h}

, k)-anonymity for hierarchical data with multi-level sensitivity is proposed. Furthermore, we design a privacy-preserving approach to achieve this privacy model. Experiment results demonstrate that our approach is obviously superior to existing anonymous approach in hierarchical data in terms of utility and security. Full article

(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)

▼ Show Figures

Figure 1

11 pages, 275 KiB

Open AccessArticle

On the Distinguishing Number of Functigraphs

by Muhammad Fazil¹, Muhammad Murtaza¹, Zafar Ullah², Usman Ali¹ and Imran Javaid^1,*

¹ Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan

² Department of Mathematics, University of Education Lahore, Campus Dera Ghazi Khan 32200, Pakistan

Symmetry 2018, 10(8), 332; https://doi.org/10.3390/sym10080332 - 9 Aug 2018

Cited by 3 | Viewed by 3318

Abstract

Let

G_{1}

and

G_{2}

be disjoint copies of a graph G and

g : V (G_{1}) \to V (G_{2})

be a function. A functigraph

F_{G}

consists of the vertex set [...] Read more.

Let

G_{1}

and

G_{2}

be disjoint copies of a graph G and

g : V (G_{1}) \to V (G_{2})

be a function. A functigraph

F_{G}

consists of the vertex set

V (G_{1}) \cup V (G_{2})

and the edge set

E (G_{1}) \cup E (G_{2}) \cup {u v : g (u) = v}

. In this paper, we extend the study of distinguishing numbers of a graph to its functigraph. We discuss the behavior of distinguishing number in passing from G to

F_{G}

and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs. Full article

(This article belongs to the Special Issue Symmetry in Graph Theory)

▼ Show Figures

Figure 1

26 pages, 344 KiB

Open AccessArticle

Applications of Neutrosophic Bipolar Fuzzy Sets in HOPE Foundation for Planning to Build a Children Hospital with Different Types of Similarity Measures

by Raja Muhammad Hashim¹, Muhammad Gulistan^1,*

and Florentin Smarandache²

¹ Department of Mathematics, Hazara University, Mansehra 21120, Pakistan

² Department of Mathematics, University of New Mexico, Albuquerque, NM 87301, USA

Symmetry 2018, 10(8), 331; https://doi.org/10.3390/sym10080331 - 9 Aug 2018

Cited by 38 | Viewed by 3600

Abstract

In this paper we provide an application of neutrosophic bipolar fuzzy sets in daily life’s problem related with HOPE foundation that is planning to build a children hospital, which is the main theme of this paper. For it we first develop the theory [...] Read more.

In this paper we provide an application of neutrosophic bipolar fuzzy sets in daily life’s problem related with HOPE foundation that is planning to build a children hospital, which is the main theme of this paper. For it we first develop the theory of neutrosophic bipolar fuzzy sets which is a generalization of bipolar fuzzy sets. After giving the definition we introduce some basic operation of neutrosophic bipolar fuzzy sets and focus on weighted aggregation operators in terms of neutrosophic bipolar fuzzy sets. We define neutrosophic bipolar fuzzy weighted averaging

(N^{B} FWA)

and neutrosophic bipolar fuzzy ordered weighted averaging

(N^{B} FOWA)

operators. Next we introduce different kinds of similarity measures of neutrosophic bipolar fuzzy sets. Finally as an application we give an algorithm for the multiple attribute decision making problems under the neutrosophic bipolar fuzzy environment by using the different kinds of neutrosophic bipolar fuzzy weighted/fuzzy ordered weighted aggregation operators with a numerical example related with HOPE foundation. Full article

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)

12 pages, 749 KiB

Open AccessArticle

Multiple-Attribute Decision-Making Method Using Similarity Measures of Hesitant Linguistic Neutrosophic Numbers Regarding Least Common Multiple Cardinality

by Wenhua Cui and Jun Ye^*

Department of Electrical Engineering and Automation, Shaoxing University, 508 Huancheng West Road, Shaoxing 312000, Zhejiang, China

Symmetry 2018, 10(8), 330; https://doi.org/10.3390/sym10080330 - 9 Aug 2018

Cited by 18 | Viewed by 3418

Abstract

Linguistic neutrosophic numbers (LNNs) are a powerful tool for describing fuzzy information with three independent linguistic variables (LVs), which express the degrees of truth, uncertainty, and falsity, respectively. However, existing LNNs cannot depict the hesitancy of the decision-maker (DM). To solve this issue, [...] Read more.

Linguistic neutrosophic numbers (LNNs) are a powerful tool for describing fuzzy information with three independent linguistic variables (LVs), which express the degrees of truth, uncertainty, and falsity, respectively. However, existing LNNs cannot depict the hesitancy of the decision-maker (DM). To solve this issue, this paper first defines a hesitant linguistic neutrosophic number (HLNN), which consists of a few LNNs regarding an evaluated object due to DMs’ hesitancy to represent their hesitant and uncertain information in the decision-making process. Then, based on the least common multiple cardinality (LCMC), we present generalized distance and similarity measures of HLNNs, and then develop a similarity measure-based multiple-attribute decision-making (MADM) method to handle the MADM problem in the HLNN setting. Finally, the feasibility of the proposed approach is verified by an investment decision case. Full article

(This article belongs to the Special Issue Fuzzy Techniques for Decision Making 2018)

▼ Show Figures

Figure 1

20 pages, 4330 KiB

Open AccessArticle

Barycenter Theorem in Phase Characteristics of Symmetric and Asymmetric Windows

by Jiufei Luo¹

, Haitao Xu¹, Kai Zheng¹

, Xinyi Li² and Song Feng^1,*

¹ Department of Mechanical Engineering, School of Advanced Manufacturing Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

² College of Mechanical Engineering, Chongqing University, Chongqing 400044, China

Symmetry 2018, 10(8), 329; https://doi.org/10.3390/sym10080329 - 8 Aug 2018

Cited by 1 | Viewed by 3308

Abstract

Asymmetric windows are of increasing interest to researchers because of the nonlinear and adjustable phase response, as well as alterable time delay. Short-time phase distortion can provide an essential improvement in speech coding, and also has better performance in speech recognition. The merits [...] Read more.

Asymmetric windows are of increasing interest to researchers because of the nonlinear and adjustable phase response, as well as alterable time delay. Short-time phase distortion can provide an essential improvement in speech coding, and also has better performance in speech recognition. The merits of asymmetric windows in the aspect of spectral behaviors have an important function in frequency component detection and parameter estimation. In this paper, the phase response of windows were further studied, and the phase characteristics of symmetric and asymmetric windows are described. The relationship between the barycenter of windows in the time domain, and the phase characteristic at the center of the main lobe in the frequency domain, was established. In light of the relationship, an improved version of the asymmetric window- based frequency estimation algorithm was proposed. The improved algorithm has advantages of straightforward implementation and computational efficiency. The numeric simulation results also indicate that the improved approach is more robust than the traditional method against additive random noise. Full article

▼ Show Figures

Figure 1

14 pages, 4239 KiB

Open AccessArticle

Thermodynamic Response of Beams on Winkler Foundation Irradiated by Moving Laser Pulses

by Yuxin Sun^*

, Shoubin Liu

, Zhangheng Rao, Yuhang Li and Jialing Yang

Institute of Solid Mechanics, Beihang University, Beijing 100191, China

Symmetry 2018, 10(8), 328; https://doi.org/10.3390/sym10080328 - 8 Aug 2018

Cited by 10 | Viewed by 3704

Abstract

In this paper, the exact analytical solutions are developed for the thermodynamic behavior of an Euler-Bernoulli beam resting on an elastic foundation and exposed to a time decaying laser pulse that scans over the beam with a uniform velocity. The governing equations, namely [...] Read more.

In this paper, the exact analytical solutions are developed for the thermodynamic behavior of an Euler-Bernoulli beam resting on an elastic foundation and exposed to a time decaying laser pulse that scans over the beam with a uniform velocity. The governing equations, namely the heat conduction equation and the vibration equation are solved using the Green’s function approach. The temporal and special distributions of temperature, deflection, strain, and the energy absorbed by the elastic foundation are calculated. The effects of the laser motion speed, the modulus of elastic foundation reaction, and the laser pulse duration time are studied in detail. Full article

▼ Show Figures

Figure 1

27 pages, 5184 KiB

Open AccessArticle

Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their Applications

by Avishek Chakraborty^1,2, Sankar Prasad Mondal³

, Ali Ahmadian^4,*, Norazak Senu⁴, Shariful Alam⁵ and Soheil Salahshour²

¹ Department of Basic Science, Narula Institute of Technology, Agarpara, Kolkata 700109, India

² Department of Mathematics, Indian Institute of Engineering Science and Technology, Shibpur, Howrah 711103, India

³ Department of Mathematics, Midnapore College (Autonomous), Midnapore, West Midnapore 721101, India

⁴ Laboratory of Computational Sciences and Mathematical Physics, Institute for Mathematical Research, University Putra Malaysia, Serdang 43400 UPM, Malaysia

⁵ Young Researchers and Elite Club, Mobarakeh Branch, Islamic Azad University, Mobarakeh, Iran

Symmetry 2018, 10(8), 327; https://doi.org/10.3390/sym10080327 - 7 Aug 2018

Cited by 126 | Viewed by 8756

Abstract

In this paper, we introduce the concept of neutrosophic number from different viewpoints. We define different types of linear and non-linear generalized triangular neutrosophic numbers which are very important for uncertainty theory. We introduced the de-neutrosophication concept for neutrosophic number for triangular neutrosophic [...] Read more.

In this paper, we introduce the concept of neutrosophic number from different viewpoints. We define different types of linear and non-linear generalized triangular neutrosophic numbers which are very important for uncertainty theory. We introduced the de-neutrosophication concept for neutrosophic number for triangular neutrosophic numbers. This concept helps us to convert a neutrosophic number into a crisp number. The concepts are followed by two application, namely in imprecise project evaluation review technique and route selection problem. Full article

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)

▼ Show Figures

Figure 1

14 pages, 268 KiB

Open AccessArticle

Binary Icosahedral Group and 600-Cell

by Jihyun Choi and Jae-Hyouk Lee^*

Department of Mathematics, Ewha Womans University 52, Ewhayeodae-gil, Seodaemun-gu, Seoul 03760, Korea

Symmetry 2018, 10(8), 326; https://doi.org/10.3390/sym10080326 - 7 Aug 2018

Cited by 1 | Viewed by 3901

Abstract

In this article, we have an explicit description of the binary isosahedral group as a 600-cell. We introduce a method to construct binary polyhedral groups as a subset of quaternions

H

via spin map of

S O (3)

. In addition, [...] Read more.

In this article, we have an explicit description of the binary isosahedral group as a 600-cell. We introduce a method to construct binary polyhedral groups as a subset of quaternions

H

via spin map of

S O (3)

. In addition, we show that the binary icosahedral group in

H

is the set of vertices of a 600-cell by applying the Coxeter–Dynkin diagram of

H_{4}

. Full article

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)

6 pages, 239 KiB

Open AccessArticle

Lower Bounds for Gaussian Estrada Index of Graphs

by Yilun Shang

School of Mathematical Sciences, Tongji University, Shanghai 200092, China

Symmetry 2018, 10(8), 325; https://doi.org/10.3390/sym10080325 - 7 Aug 2018

Cited by 19 | Viewed by 3255

Abstract

Suppose that G is a graph over n vertices. G has n eigenvalues (of adjacency matrix) represented by

λ_{1}, λ_{2}, \dots, λ_{n}

. The Gaussian Estrada index, denoted by

H (G)

(Estrada et al., Chaos [...] Read more.

Suppose that G is a graph over n vertices. G has n eigenvalues (of adjacency matrix) represented by

λ_{1}, λ_{2}, \dots, λ_{n}

. The Gaussian Estrada index, denoted by

H (G)

(Estrada et al., Chaos 27(2017) 023109), can be defined as

H (G) = \sum_{i = 1}^{n} e^{- λ_{i}^{2}}

. Gaussian Estrada index underlines the eigenvalues close to zero, which plays an important role in chemistry reactions, such as molecular stability and molecular magnetic properties. In a network of particles governed by quantum mechanics, this graph-theoretic index is known to account for the information encoded in the eigenvalues of the Hamiltonian near zero by folding the graph spectrum. In this paper, we establish some new lower bounds for

H (G)

in terms of the number of vertices, the number of edges, as well as the first Zagreb index. Full article

Journal Menu

Journal Browser

Symmetry, Volume 10, Issue 8 (August 2018) – 56 articles

Further Information

Guidelines

MDPI Initiatives

Follow MDPI