Search

The International Institute of Knowledge Innovation and Invention (IIKII) is an institute that promotes the exchange of innovations and inventions, and establishes a communication platform for international innovations and researches. In 2019, IIKII cooperated with the Institute of Electrical and Electronics Engineers (IEEE) Tainan Section Sensors Council to hold IEEE conferences such as IEEE ICIASE 2019, IEEE ECBIOS 2019, IEEE ICKII 2019, ICUSA-GAME 2019, and IEEE ECICE 2019. This Special Issue entitled "Selected Papers from IIKII 2019 conferences" aims to select excellent papers from IIKII 2019 conferences, including symmetry in physics, chemistry, biology, mathematics, and computer science, etc. It selected 21 excellent papers from 750 papers presented in IIKII 2019 conferences on the topic of symmetry. The main goals of this Special Issue are to encourage scientists to publish their experimental and theoretical results in as much detail as possible, and to discover new scientific knowledge relevant to the topic of symmetry. [ABSTRACT FROM AUTHOR]

Researchers in cognitive science have long been interested in modeling human perception using statistical methods. This requires maneuvers because these multiple dimensional data are always intertwined with complex inner structures. The previous studies in cognitive sciences commonly applied principal component analysis (PCA) to truncate data dimensions when dealing with data with multiple dimensions. This is not necessarily because of its merit in terms of mathematical algorithm, but partly because it is easy to conduct with commonly accessible statistical software. On the other hand, dimension reduction might not be the best analysis when modeling data with no more than 20 dimensions. Using state-of-the-art techniques, researchers in various research disciplines (e.g., computer vision) classified data with more than hundreds of dimensions with neural networks and revealed the inner structure of the data. Therefore, it might be more sophisticated to process human perception data directly with neural networks. In this paper, we introduce the multi-dimensional data analysis platform (MuDAP), a powerful toolbox for data analysis in cognitive science. It utilizes artificial intelligence as well as network analysis, an analysis method that takes advantage of data symmetry. With the graphic user interface, a researcher, with or without previous experience, could analyze multiple dimensional data with great ease. [ABSTRACT FROM AUTHOR]

In computer science, and especially in computer vision, the contour of an object is used to describe its features; thus, the shape descriptor plays an indispensable role in target detection and recognition. Further, Fourier is an important mathematical description method, and the Fourier transform of a shape contour has symmetry. This paper will demonstrate the symmetry of shape contour in the frequency domain. In recent years, increasing numbers of shape descriptors have come to the fore, but many descriptors ignore the details of shape. It is found that the most fundamental reason affecting the performance of shape descriptors is structural restraints, especially feature structure restraint. Therefore, in this paper, the restraint of feature structure that intrinsically deteriorates recognition performance is shown, and a fast shape recognition method via the Bone Point Segment (BPS) restraint reduction is proposed. An approach using the inner distance to find bone shapes and segment the shape contour by these bones is proposed. Then, Fourier transform is performed on each segment to form the shape feature. Finally, the restraints of the shape feature are reduced in order to build a more effective shape feature. What is commendable is that its discriminability and robustness is strong, the process is simple, and matching speed is fast. More importantly, the experiment results show that the shape descriptor has higher recognition accuracy and the matching speed runs up to more than 1000 times faster than the existing description methods like CBW and TCD. More importantly, it is worth noting that the recognition accuracy approaches 100% in the self-build dataset. [ABSTRACT FROM AUTHOR]

The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweep-lines having different slopes. The interior shape's points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape's characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes. [ABSTRACT FROM AUTHOR]

The notion of fuzzy graph (FG) is widely used in many problems arising from partial or incomplete descriptions of the real world and in particular from fields such as engineering, economics, computer science, social disciplines, or medical diagnostics, and has been used in many fields of pure mathematics as well as in several areas of applied sciences such as decision making, statistics and networking. In this paper we will deal with the graph of the picture fuzzy(symmetric) set using the notion of domination in picture fuzzy graph (PFG) as a generalization of both the concept of fuzzy graph domination and intuitionistic fuzzy graph (IFG) domination. The concepts of domination theory (DT) and double domination theory (DDT) of a PFG are introduced, studied and concretely applied to the real case of an election competition to determine the minimum number of citizens a politician should meet in person in order to win the election. The choice of fuzzification (symmetric) and defuzzification (anti-symmetric) methods depends on the specific application and the type of fuzzy sets being used, whether they are symmetric or anti-symmetric. There are various methods for each process, such as centroid, max-min, and weighted average methods for defuzzification. Finally, in the last section, drawing from the application example, the features and benefits of PFGs with respect to fuzzy graphs and intuitionistic fuzzy graphs are compared and discussed. [ABSTRACT FROM AUTHOR]

Hence, in this Special Issue of I Symmetry i , we invited original research investigating 5G/B5G/6G, deep learning, mobile networks, cross-layer design, wireless sensor networks, cloud computing, edge computing, Internet of Things, software-defined networks, or network security and privacy, which are relevant to Prof. Chao's research fields. Han-Chieh Chao received his MS and PhD degrees in Electrical Engineering from Purdue University, West Lafayette, Indiana, in 1989 and 1993, respectively. Prof. Chao first proposed and established a novel network framework based on the cross-layer design technology for the Taiwan Academic Network (TANet). [Extracted from the article]

Graphs are useful for analysing the structure models in computer science, operations research, and sociology. The word metric dimension is the basis of the distance function, which has a symmetric property. Moreover, finding the resolving set of a graph is NP-complete, and the possibilities of finding the resolving set are reduced due to the symmetric behaviour of the graph. In this paper, we introduce the idea of the edge-multiset dimension of graphs. A representation of an edge is defined as the multiset of distances between it and the vertices of a set, B ⊆ V (Γ) . If the representation of two different edges is unequal, then B is an edge-multiset resolving a set of Γ. The least possible cardinality of the edge-multiset resolving a set is referred to as the edge-multiset dimension of Γ. This article presents preliminary results, special conditions, and bounds on the edge-multiset dimension of certain graphs. This research provides new insights into structure models in computer science, operations research, and sociology. They could have implications for developing computer algorithms, aircraft scheduling, and species movement between regions. [ABSTRACT FROM AUTHOR]

The metric dimension has various applications in several fields, such as computer science, image processing, pattern recognition, integer programming problems, drug discovery, and the production of various chemical compounds. The lowest number of vertices in a set with the condition that any vertex can be uniquely identified by the list of distances from other vertices in the set is the metric dimension of a graph. A resolving function of the graph G is a map ϑ : V (G) → [ 0 , 1 ] such that ∑ u ∈ R { v , w } ϑ (u) ≥ 1 , for every pair of adjacent distinct vertices v , w ∈ V (G) . The local fractional metric dimension of the graph G is defined as ldim f (G) = min { ∑ v ∈ V (G) ϑ (v) , where ϑ is a local resolving function of G } . This paper presents a new family of planar networks namely, rotationally heptagonal symmetrical graphs by means of up to four cords in the heptagonal structure, and then find their upper-bound sequences for the local fractional metric dimension. Moreover, the comparison of the upper-bound sequence for the local fractional metric dimension is elaborated both numerically and graphically. Furthermore, the asymptotic behavior of the investigated sequences for the local fractional metric dimension is addressed. [ABSTRACT FROM AUTHOR]

Local fractional calculus (fractal calculus) plays a crucial role in applications, especially in computer sciences and engineering. One of these applications appears in the theory of chaos. Therefore, this paper studies the dynamics of a fractal complex logistic map and then employs this map to generate chaotic sequences for a new symmetric image encryption algorithm. Firstly, we derive the fractional complex logistic map and investigate its dynamics by determining its equilibria, geometric properties, and chaotic behavior. Secondly, the fractional chaotic sequences of the proposed map are employed to scramble and alter image pixels to increase resistance to decryption attacks. The output findings indicate that the proposed algorithm based on fractional complex logistic maps could effectively encrypt various kinds of images. Furthermore, it has better security performance than several existing algorithms. [ABSTRACT FROM AUTHOR]

A new algorithm is presented for detecting the global reflection symmetry of geometric objects. The algorithm works for 2D and 3D objects which may be open or closed and may or may not contain holes. The algorithm accepts a point cloud obtained by sampling the object's surface at the input. The points are inserted into a uniform grid and so-called boundary cells are identified. The centroid of the boundary cells is determined, and a testing symmetry axis/plane is set through it. In this way, the boundary cells are split into two parts and they are faced with the symmetry estimation function. If the function estimates the symmetric case, the boundary cells are further split until a given threshold is reached or a non-symmetric result is obtained. The new testing axis/plane is then derived and tested by rotation around the centroid. This paper introduces three techniques to accelerate the computation. Competitive results were obtained when the algorithm was compared against the state of the art. [ABSTRACT FROM AUTHOR]

A new algorithm is presented for detecting the local weak reflection symmetries in raster images. It uses contours extracted from the segmented image. A convex hull is constructed on the contours, and so-called anchor points are placed on it. The bundles of symmetry line candidates are placed in these points. Each line splits the plane into two open half-planes and arranges the contours into three sets: the first contains the contours pierced by the considered line, while the second and the third include the contours located in one or the other half-plane. The contours are then checked for the reflection symmetry. This means looking for self-symmetries in the first set, and symmetric pairs with one contour in the second set and one contour in the third set. The line which is evaluated as the best symmetry line is selected. After that, the symmetric contours are removed from sets two and three. The remaining contours are then checked again for symmetry. A multi-branch tree representing the hierarchy of the detected local symmetries is the result of the algorithm. [ABSTRACT FROM AUTHOR]

This paper presents research focusing on visualization and pattern recognition based on computer science. Although deep neural networks demonstrate satisfactory performance regarding image and voice recognition, as well as pattern analysis and intrusion detection, they exhibit inferior performance towards adversarial examples. Noise introduction, to some degree, to the original data could lead adversarial examples to be misclassified by deep neural networks, even though they can still be deemed as normal by humans. In this paper, a robust diversity adversarial training method against adversarial attacks was demonstrated. In this approach, the target model is more robust to unknown adversarial examples, as it trains various adversarial samples. During the experiment, Tensorflow was employed as our deep learning framework, while MNIST and Fashion-MNIST were used as experimental datasets. Results revealed that the diversity training method has lowered the attack success rate by an average of 27.2 and 24.3% for various adversarial examples, while maintaining the 98.7 and 91.5% accuracy rates regarding the original data of MNIST and Fashion-MNIST. [ABSTRACT FROM AUTHOR]

Many problems of practical interest can be modeled and solved by using interval-valued fuzzy graph (IVFG) algorithms. An IVFG is a very useful and effective tool for studying various calculations, fields of intelligence, and computer science, such as networking, imaging, and other fields, such as biological sciences. In different applications, they present an appropriate construction means. There were limitations in the definition of fuzzy graphs (FGs), which prompted us to propose a new definition for IVFGs. Some interesting properties related to the new IVFGs are investigated, and enough conditions under which the level graph on IVFGs is equivalent are obtained. Therefore, in this study, we present the properties of a level graph (LG) of an IVFG, and four operations, the Cartesian product (CP), composition (CO), union, and join, are investigated on it. Today, in a treatment system, one of the issues that can be very valuable and important to the quality of service to patients is finding qualified and efficient people in each department, which is not an easy task. But the interval-valued fuzzy graph, as an important fuzzy graph, can help us by considering the ability of each person in the form of intervals of numbers and the effectiveness of each one on the other (according to the relationships between them) in order to find the most worthy people. So, an application of IVFG to find the most effective person in a hospital information system has been introduced. [ABSTRACT FROM AUTHOR]

Automatic speech recognition, especially large vocabulary continuous speech recognition, is an important issue in the field of machine learning. For a long time, the hidden Markov model (HMM)-Gaussian mixed model (GMM) has been the mainstream speech recognition framework. But recently, HMM-deep neural network (DNN) model and the end-to-end model using deep learning has achieved performance beyond HMM-GMM. Both using deep learning techniques, these two models have comparable performances. However, the HMM-DNN model itself is limited by various unfavorable factors such as data forced segmentation alignment, independent hypothesis, and multi-module individual training inherited from HMM, while the end-to-end model has a simplified model, joint training, direct output, no need to force data alignment and other advantages. Therefore, the end-to-end model is an important research direction of speech recognition. In this paper we review the development of end-to-end model. This paper first introduces the basic ideas, advantages and disadvantages of HMM-based model and end-to-end models, and points out that end-to-end model is the development direction of speech recognition. Then the article focuses on the principles, progress and research hotspots of three different end-to-end models, which are connectionist temporal classification (CTC)-based, recurrent neural network (RNN)-transducer and attention-based, and makes theoretically and experimentally detailed comparisons. Their respective advantages and disadvantages and the possible future development of the end-to-end model are finally pointed out. Automatic speech recognition is a pattern recognition task in the field of computer science, which is a subject area of Symmetry. [ABSTRACT FROM AUTHOR]

Prediction of visual attention is a new and challenging subject, and to the best of our knowledge, there are not many pieces of research devoted to the anticipation of students' cognition when solving tests. The aim of this paper is to propose, implement, and evaluate a machine learning method that is capable of predicting saliency maps of students who participate in a learning task in the form of quizzes based on quiz questionnaire images. Our proposal utilizes several deep encoder–decoder symmetric schemas which are trained on a large set of saliency maps generated with eye tracking technology. Eye tracking data were acquired from students, who solved various tasks in the sciences and natural sciences (computer science, mathematics, physics, and biology). The proposed deep convolutional encoder–decoder network is capable of producing accurate predictions of students' visual attention when solving quizzes. Our evaluation showed that predictions are moderately positively correlated with actual data with a coefficient of 0.547 ± 0.109. It achieved better results in terms of correlation with real saliency maps than state-of-the-art methods. Visual analyses of the saliency maps obtained also correspond with our experience and expectations in this field. Both source codes and data from our research can be downloaded in order to reproduce our results. [ABSTRACT FROM AUTHOR]

Underwater Wireless Sensor Networks (UWSNs) obtains more attention due to their wide range of applications such as underwater oil field discovery, Tsunami monitoring systems, surveillance systems, and many more. In such a resource-constrained environment, sensors are more vulnerable to malicious attacks. Node authentication and secure communication is one of the vital issues in UWSNs. In this study, a secure and lightweight key management framework for UWSNs is proposed. The proposed framework includes key generation, key distribution, revocation, and authentication mechanisms along with lightweight implementation, and scalability. We use an elliptic curve-based algorithm for key distribution, and certificate revocation list (CRL) for key revocation. We also examine the performance of the proposed framework taking into account the amount of communication overhead as well as the level of security. The simulation results show that the proposed framework provides better security with less communication overhead compared to existing frameworks. This framework can be used for secure data communication in UWSNs, which has various applications in oceanography, environmental monitoring, and military operations. [ABSTRACT FROM AUTHOR]

Graphs are often used as models to solve problems in computer science, mathematics, and biology. A pancake sorting problem is modeled using a pancake graph whose classes include burnt pancake graphs, signed permutation graphs, and restricted pancake graphs. The network cost is degree × diameter. Finding a graph with a small network cost is like finding a good sorting algorithm. We propose a novel recursively divided pancake (RDP) graph that has a smaller network cost than other pancake-like graphs. In the pancake graph Pn, the number of nodes is n!, the degree is n − 1, and the network cost is O(n2). In an RDPn, the number of nodes is n!, the degree is 2log2n − 1, and the network cost is O(n(log2n)3). Because O(n(log2n)3) < O(n2), the RDP is superior to other pancake-like graphs. In this paper, we propose an RDPn and analyze its basic topological properties. Second, we show that the RDPn is recursive and symmetric. Third, a sorting algorithm is proposed, and the degree and diameter are derived. Finally, the network cost is compared between the RDP graph and other classes of pancake graphs. [ABSTRACT FROM AUTHOR]

The concepts of terms and tree languages are significant tools for the development of research works in both universal algebra and theoretical computer science. In this paper, we establish a strong connection between semigroups of terms and tree languages, which provides the tools for studying monomorphisms between terms and generalized hypersubstitutions. A novel concept of a seminearring of non-deterministic generalized hypersubstitutions is introduced and some interesting properties among subsets of its are provided. Furthermore, we prove that there are monomorphisms from the power diagonal semigroup of tree languages and the monoid of generalized hypersubstitutions to the power diagonal semigroup of non-deterministic generalized hypersubstitutions and the monoid of non-deterministic generalized hypersubstitutions, respectively. Finally, the representation of terms using the theory of n-ary functions is defined. We then present the Cayley's theorem for Menger algebra of terms, which allows us to provide a concrete example via full transformation semigroups. [ABSTRACT FROM AUTHOR]

Axiomatically, symmetry is a fundamental property of mathematical functions defining similarity measures, where similarity measures are important tools in many areas of computer science, including machine learning and image processing. In this paper, we investigate a new technique to measure the similarity between two images, a fixed image and a moving image, in multi-modal image registration (MIR). MIR in medical image processing is essential and useful in diagnosis and therapy guidance, but still a very challenging task due to the lack of robustness against the rotational variance in the image transformation process. Our investigation leads to a novel, local self-similarity descriptor, called the modality-independent and rotation-invariant descriptor (miRID). By relying on the mean of the intensity values, an miRID is simply computable and can effectively handle the complicated intensity relationship between multi-modal images. Moreover, it can also overcome the problem of rotational variance by sorting the numerical values, each of which is the absolute difference between each pixel's intensity and the mean of all pixel intensities within a patch of the image. The experimental result shows that our method outperforms others in both multi-modal rigid and non-rigid image registrations. [ABSTRACT FROM AUTHOR]

Electronic Learning (e-learning) has made a great success and recently been estimated as a billion-dollar industry. The users of e-learning acquire knowledge of diversified content available in an application using innovative means. There is much e-learning software available—for example, LMS (Learning Management System) and Moodle. The functionalities of this software were reviewed and we recognized that learners have particular problems in getting relevant recommendations. For example, there might be essential discussions about a particular topic on social networks, such as Twitter, but that discussion is not linked up and recommended to the learners for getting the latest updates on technology-updated news related to their learning context. This has been set as the focus of the current project based on symmetry between user project specification. The developed project recommends relevant symmetric articles to e-learners from the social network of Twitter and the academic platform of DBLP. For recommendations, a Reinforcement learning model with optimization is employed, which utilizes the learners' local context, learners' profile available in the e-learning system, and the learners' historical views. The recommendations by the system are relevant tweets, popular relevant Twitter users, and research papers from DBLP. For matching the local context, profile, and history with the tweet text, we recognized that terms in the e-learning system need to be expanded to cover a wide range of concepts. However, this diversification should not include such terms which are irrelevant. To expand terms of the local context, profile and history, the software used the dataset of Grow-bag, which builds concept graphs of large-scale Computer Science topics based on the co-occurrence scores of Computer Science terms. This application demonstrated the need and success of e-learning software that is linked with social media and sends recommendations for the content being learned by the e-Learners in the e-learning environment. However, the current application only focuses on the Computer Science domain. There is a need for generalizing such applications to other domains in the future. [ABSTRACT FROM AUTHOR]

For a given mapping f in the framework of different spaces, the fixed-point equations of the form f x = x can model several problems in different areas, such as differential equations, optimization, and computer science. In this work, the aim is to find the best proximity point and to prove its uniqueness on partial metric spaces where the symmetry condition is preserved for several types of contractive non-self mapping endowed with a graph. Our theorems generalize different results in the literature. In addition, we will illustrate the usability of our outcomes with some examples. The proposed model can be considered as a theoretical foundation for applications to real cases. [ABSTRACT FROM AUTHOR]

The purpose of our bibliometric research was to capture and analyze the trends of two types of well-known classical artificial intelligence (AI) algorithms: neural networks (NNs) and genetic algorithms (GAs). Symmetry is a very popular international and interdisciplinary scientific journal that cover six major research subjects of mathematics, computer science, engineering science, physics, biology, and chemistry which are all related to our research on classical AI algorithms; therefore, we referred to the most innovative research articles of classical AI algorithms that have been published in Symmetry, which have also introduced new advanced applications for NNs and Gas. Furthermore, we used the keywords of "neural network algorithm" or "artificial neural network" to search the SSCI database from 2002 to 2021 and obtained 951 NN publications. For comparison purposes, we also analyzed GA trends by using the keywords "genetic algorithm" to search the SSCI database over the same period and we obtained 878 GA publications. All of the NN and GA publication results were categorized into eight groups for deep analyses so as to investigate their current trends and forecasts. Furthermore, we applied the Kolmogorov–Smirnov test (K–S test) to check whether our bibliometric research complied with Lotka's law. In summary, we found that the number of applications for both NNs and GAs are continuing to grow but the use of NNs is increasing more sharply than the use of GAs due to the boom in deep learning development. We hope that our research can serve as a roadmap for other NN and GA researchers to help them to save time and stay at the cutting edge of AI research trends. [ABSTRACT FROM AUTHOR]

This work introduces the concepts of rectangular Menger probabilistic metric ( R M P M ) space and rectangular Menger probabilistic b-metric ( R M P b M ) space as generalizations of the Menger probabilistic metric space and the Menger probabilistic b-metric space, respectively. Some nonunique fixed-point and coupled-fixed-point results for contractive mappings are provided. The findings extend and improve outcomes presented in the existing literature. The main results are illustrated with examples, and validated by means of an application to a system of integral equations. The importance of spaces with non-Hausdorff topology is high, as is the case of computer science, with the Tarskian approach to programming language semantics. [ABSTRACT FROM AUTHOR]

In the modern era, mathematical modeling consisting of graph theoretic parameters or invariants applied to solve the problems existing in various disciplines of physical sciences like computer sciences, physics, and chemistry. Topological indices (TIs) are one of the graph invariants which are frequently used to identify the different physicochemical and structural properties of molecular graphs. Wiener index is the first distance-based TI that is used to compute the boiling points of the paraffine. For a graph F, the recently developed Gutman Connection (GC) index is defined on all the unordered pairs of vertices as the sum of the multiplications of the connection numbers and the distance between them. In this note, the G C index of the operation-based symmetric networks called by first derived graph D 1 (F) (subdivision graph), second derived graph D 2 (F) (vertex-semitotal graph), third derived graph D 3 (F) (edge-semitotal graph) and fourth derived graph D 4 (F) (total graph) are computed in their general expressions consisting of various TIs of the parent graph F, where these operation-based symmetric graphs are obtained by applying the operations of subdivision, vertex semitotal, edge semitotal and the total on the graph F respectively. [ABSTRACT FROM AUTHOR]

Network traffic classification based on machine learning is an important branch of pattern recognition in computer science. It is a key technology for dynamic intelligent network management and enhanced network controllability. However, the traffic classification methods still facing severe challenges: The optimal set of features is difficult to determine. The classification method is highly dependent on the effective characteristic combination. Meanwhile, it is also important to balance the experience risk and generalization ability of the classifier. In this paper, an improved network traffic classification model based on a support vector machine is proposed. First, a filter-wrapper hybrid feature selection method is proposed to solve the false deletion of combined features caused by a traditional feature selection method. Second, to balance the empirical risk and generalization ability of support vector machine (SVM) traffic classification model, an improved parameter optimization algorithm is proposed. The algorithm can dynamically adjust the quadratic search area, reduce the density of quadratic mesh generation, improve the search efficiency of the algorithm, and prevent the over-fitting while optimizing the parameters. The experiments show that the improved traffic classification model achieves higher classification accuracy, lower dimension and shorter elapsed time and performs significantly better than traditional SVM and the other three typical supervised ML algorithms. [ABSTRACT FROM AUTHOR]

Vague graphs (VGs), belonging to the fuzzy graphs (FGs) family, have good capabilities when faced with problems that cannot be expressed by FGs. The notion of a VG is a new mathematical attitude to model the ambiguity and uncertainty in decision-making issues. A vague fuzzy graph structure (VFGS) is the generalization of the VG. It is a powerful and useful tool to find the influential person in various relations. VFGSs can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problems where fuzzy graphs may fail to reveal satisfactory results. Moreover, VGSs are very useful tools for the study of different domains of computer science such as networking, social systems, and other issues such as bioscience and medical science. The subject of energy in graph theory is one of the most attractive topics that is very important in biological and chemical sciences. Hence, in this work, we extend the notion of energy of a VG to the energy of a VFGS and also use the concept of energy in modeling problems related to VFGS. Actually, our purpose is to develop a notion of VFGS and investigate energy and Laplacian energy (LE) on this graph. We define the adjacency matrix (AM) concept, energy, and LE of a VFGS. Finally, we present three applications of the energy in decision-making problems. [ABSTRACT FROM AUTHOR]

In many real world problems, science fields such as biology, computer science, data mining, electrical and mechanical engineering, and signal processing, researchers aim to compare and classify several regression models. In this paper, a computational approach, based on the non-parametric methods, is used to investigate the similarities, and to classify several linear and non-linear regression models with symmetric errors. The ability of each given approach is then evaluated using simulated and real world practical datasets. [ABSTRACT FROM AUTHOR]

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S 3 . Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M 3 . More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group P S L (2 , Z) correspond to d-fold M 3 - coverings over the trefoil knot. In this paper, we also investigate quantum information on a few 'universal' knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M 3 's obtained from Dehn fillings are explored. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) is one of the most important topics that implements symmetry in computer science. As like humans, most AI also learns by trial-and-error approach which requires appropriate adversarial examples. In this study, we prove that adversarial training can be useful to verify the safety of classification model in early stage of development. We experimented with various amount of adversarial data and found that the safety can be significantly improved by appropriate ratio of adversarial training. [ABSTRACT FROM AUTHOR]

The intelligent production of sheet metal is a comprehensive technology involving control science, computer science, and sheet metal production. Intelligent rolling is an important development in the production process of sheet metal. In this paper, a new symmetrical four-roller bending (SFRB) process is introduced, which consists of feeding, pre-bending, reverse roll bending, second bending, and forward roll bending and unloading. A control strategy is proposed for the process, including on-line monitoring of curvature, on-line identification of the springback law, on-line prediction of final reduction, and control strategy. A convenient and reliable on-line curvature monitoring method is proposed. The quantitative relationship between the reduction and the curvature, in the form of a quadratic function, was established by physical experiments and numerical simulation, and the online identification of the springback law was realized. An on-line prediction method of the final reduction is proposed, and the determination principle of the reduction of three pre-bending processes is given. Finally, the control strategy of the SFRB process was verified by physical experiments. The relative error of the curvature radius of the final formed parts can be controlled within 0.8%. This research provides new insights into intelligent rolling. [ABSTRACT FROM AUTHOR]

The popularity and remarkable attractiveness of cryptocurrencies, especially Bitcoin, absorb countless enthusiasts every day. Although Blockchain technology prevents fraudulent behavior, it cannot detect fraud on its own. There are always unimaginable ways to commit fraud, and the need to use anomaly detection methods to identify abnormal and fraudulent behaviors has become a necessity. The main purpose of this study is to use the Blockchain technology of symmetry and asymmetry in computer and engineering science to present a new method for detecting anomalies in Bitcoin with more appropriate efficiency. In this study, a collective anomaly approach was used. Instead of detecting the anomaly of individual addresses and wallets, the anomaly of users was examined. In addition to using the collective anomaly detection method, the trimmed_Kmeans algorithm was used for clustering. The results of this study show the anomalies are more visible among users who had multiple wallets. The proposed method revealed 14 users who had committed fraud, including 26 addresses in 9 cases, whereas previous works detected a maximum of 7 addresses in 5 cases of fraud. The suggested approach, in addition to reducing the processing overhead for extracting features, detect more abnormal users and anomaly behavior. [ABSTRACT FROM AUTHOR]

Programming is a vital skill in computer science and engineering-related disciplines. However, developing source code is an error-prone task. Logical errors in code are particularly hard to identify for both students and professionals, and a single error is unexpected to end-users. At present, conventional compilers have difficulty identifying many of the errors (especially logical errors) that can occur in code. To mitigate this problem, we propose a language model for evaluating source codes using a bidirectional long short-term memory (BiLSTM) neural network. We trained the BiLSTM model with a large number of source codes with tuning various hyperparameters. We then used the model to evaluate incorrect code and assessed the model's performance in three principal areas: source code error detection, suggestions for incorrect code repair, and erroneous code classification. Experimental results showed that the proposed BiLSTM model achieved 50.88% correctness in identifying errors and providing suggestions. Moreover, the model achieved an F-score of approximately 97%, outperforming other state-of-the-art models (recurrent neural networks (RNNs) and long short-term memory (LSTM)). [ABSTRACT FROM AUTHOR]

Fuzzy graph models enjoy the ubiquity of being in natural and human-made structures, namely dynamic process in physical, biological and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems which are often uncertain, it is highly difficult for an expert to model those problems based on a fuzzy graph (FG). Vague graph structure (VGS) can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. Likewise, VGSs are very useful tools for the study of different domains of computer science such as networking, capturing the image, clustering, and also other issues like bioscience, medical science, and traffic plan. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGSs. Operations are conveniently used in many combinatorial applications. In various situations, they present a suitable construction means; therefore, in this research, three new operations on VGSs, namely, maximal product, rejection, residue product were presented, and some results concerning their degrees and total degrees were introduced. Irregularity definitions have been of high significance in the network heterogeneity study, which have implications in networks found across biology, ecology and economy; so special concepts of irregular VGSs with several key properties were explained. Today one of the most important applications of decision making is in medical science for diagnosing the patient's disease. Hence, we recommend an application of VGS in medical diagnosis. [ABSTRACT FROM AUTHOR]

As an important technology in computer science, data mining aims to mine hidden, previously unknown, and potentially valuable patterns from databases.High utility negative sequential rule (HUNSR) mining can provide more comprehensive decision-making information than high utility sequential rule (HUSR) mining by taking non-occurring events into account. HUNSR mining is much more difficult than HUSR mining because of two key intrinsic complexities. One is how to define the HUNSR mining problem and the other is how to calculate the antecedent's local utility value in a HUNSR, a key issue in calculating the utility-confidence of the HUNSR. To address the intrinsic complexities, we propose a comprehensive algorithm called e-HUNSR and the contributions are as follows. (1) We formalize the problem of HUNSR mining by proposing a series of concepts. (2) We propose a novel data structure to store the related information of HUNSR candidate (HUNSRC) and a method to efficiently calculate the local utility value and utility of HUNSRC's antecedent. (3) We propose an efficient method to generate HUNSRC based on high utility negative sequential pattern (HUNSP) and a pruning strategy to prune meaningless HUNSRC. To the best of our knowledge, e-HUNSR is the first algorithm to efficiently mine HUNSR. The experimental results on two real-life and 12 synthetic datasets show that e-HUNSR is very efficient. [ABSTRACT FROM AUTHOR]

Previous saliency detection methods usually focused on extracting powerful discriminative features to describe images with a complex background. Recently, the generative adversarial network (GAN) has shown a great ability in feature learning for synthesizing high quality natural images. Since the GAN shows a superior feature learning ability, we present a new multi-scale adversarial feature learning (MAFL) model for image saliency detection. In particular, we build this model, which is composed of two convolutional neural network (CNN) modules: the multi-scale G-network takes natural images as inputs and generates the corresponding synthetic saliency map, and we design a novel layer in the D-network, namely a correlation layer, which is used to determine whether one image is a synthetic saliency map or ground-truth saliency map. Quantitative and qualitative comparisons on several public datasets show the superiority of our approach. [ABSTRACT FROM AUTHOR]