Interweaving the Principle of Least Potential Energy in School and Introductory University Physics Courses*Symmetry* **2017**, *9*(3), 45; doi:10.3390/sym9030045 - 22 March 2017**Abstract **

►
Figures
Understanding advanced physical phenomena such as vertically hanging elastic column, soap bubbles, crystals and cracks demands expressing and manipulating a system’s potential energy under equilibrium conditions. However, students at schools and universities are usually required to consider the forces acting on a system

[...] Read more.
Understanding advanced physical phenomena such as vertically hanging elastic column, soap bubbles, crystals and cracks demands expressing and manipulating a system’s potential energy under equilibrium conditions. However, students at schools and universities are usually required to consider the forces acting on a system under equilibrium conditions, rather than taking into account its potential energy. As a result, they find it difficult to express the system’s potential energy and use it for calculations when they do need to do so. The principle of least potential energy is a powerful idea for solving static equilibrium physics problems in various fields such as hydrostatics, mechanics, and electrostatics. In the current essay, the authors describe this principle and provide examples where students can apply it. For each problem, the authors provide both the force consideration solution approach and the energy consideration solution approach.
Full article

Symmetry in Domination for Hypergraphs with Choice

*Symmetry* **2017**, *9*(3), 46; doi:10.3390/sym9030046 - 22 March 2017**Abstract **

►
Figures
In this paper, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges. We are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs

[...] Read more.
In this paper, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges. We are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. Several open questions are posed.

Full article

Full article

Changes of Fluctuating Asymmetry with Age in Human Fetuses and Young Infants*Symmetry* **2017**, *9*(3), 44; doi:10.3390/sym9030044 - 21 March 2017**Abstract **

►
Figures
(1) Background: Developmental instability (DI), often measured by fluctuating asymmetry (FA), increases with stress in humans, yet little is known about how stress affects the changes of asymmetry with age. More specifically, it is unknown if fetuses experiencing a major congenital abnormality will

[...] Read more.
(1) Background: Developmental instability (DI), often measured by fluctuating asymmetry (FA), increases with stress in humans, yet little is known about how stress affects the changes of asymmetry with age. More specifically, it is unknown if fetuses experiencing a major congenital abnormality will express higher FA already during early development or only at a later age; (2) Methods: We combine two datasets to study associations between age and asymmetry in human fetuses and young infants. One population consists of fetuses from spontaneous abortions and early deceased infants where many experienced major congenital abnormalities, and a second from elicited abortions for social reasons; (3) Results: While the occurrence of major abnormalities did not seem to affect the way asymmetry decreased with age, differences between the two populations were observed; and (4) Conclusions: In one population where fetuses and young infants deceased of natural causes, asymmetry decreased rapidly until 20 weeks of age and then leveled off. Over the entire timespan (week 15–49), individuals with major congenital abnormalities showed higher FA, suggesting that developmental perturbations increase FA rapidly. In the second, more normal population with abortions solicited for social reasons, the decrease in asymmetry with age was less profound and not statistically significant, calling for further research toward understanding regional differences.
Full article

Reference-Dependent Aggregation in Multi-AttributeGroup Decision-Making

*Symmetry* **2017**, *9*(3), 43; doi:10.3390/sym9030043 - 16 March 2017**Abstract **

►
Figures
To characterize the influence of decision makers’ psychological factors on the group decisionprocess, this paper develops a new class of aggregation operators based on reference-dependentutility functions (RUs) in multi-attribute group decision analysis. We consider two types of RUs:S-shaped, representing decision makers who are

[...] Read more.
To characterize the influence of decision makers’ psychological factors on the group decisionprocess, this paper develops a new class of aggregation operators based on reference-dependentutility functions (RUs) in multi-attribute group decision analysis. We consider two types of RUs:S-shaped, representing decision makers who are risk-seeking for relative losses, and non-S-shaped,representing those that are risk-averse for relative losses. Based on these RUs, we establish twonew classes of reference-dependent aggregation operators; we study their properties and showthat their generality covers a number of existing aggregation operators. To determine the optimalweights for these aggregation operators, we construct an attribute deviation weight model and adecision maker (DM) deviation weight model. Furthermore, we develop a new multi-attribute groupdecision-making (MAGDM) approach based on these RU aggregation operators and weight models.Finally, numerical examples are given to illustrate the application of the approach.

Full article

Full article

Two-Way Multi-Antenna Relaying with Simultaneous Wireless Information and Power Transfer*Symmetry* **2017**, *9*(3), 42; doi:10.3390/sym9030042 - 16 March 2017**Abstract **

►
Figures
In this paper, we propose various kinds of two-way multi-antenna relaying with simultaneous wireless information and power transfer (SWIPT) and investigate their performance. Specifically, we first consider a two-way relay network where two single-antenna end nodes communicate with each other through a multi-antenna

[...] Read more.
In this paper, we propose various kinds of two-way multi-antenna relaying with simultaneous wireless information and power transfer (SWIPT) and investigate their performance. Specifically, we first consider a two-way relay network where two single-antenna end nodes communicate with each other through a multi-antenna relay node that is energy constrained. This relay node harvests energy from the two end nodes and use the harvested energy for forwarding their information. Six relaying schemes that support the considered network then build on the power splitting-based relaying and time switching-based relaying protocols. The average bit error rates of these schemes are evaluated and compared by computer simulations considering several network parameters, including the number of relay antennas, power splitting ratio, and energy harvesting time. Such evaluation and comparison provide useful insights into the performance of SWIPT-based two-way multi-antenna relaying.
Full article

The Roundest Polyhedra with Symmetry Constraints*Symmetry* **2017**, *9*(3), 41; doi:10.3390/sym9030041 - 15 March 2017**Abstract **

►
Figures
Amongst the convex polyhedra with *n* faces circumscribed about the unit sphere, which has the minimum surface area? This is the isoperimetric problem in discrete geometry which is addressed in this study. The solution of this problem represents the closest approximation of the

[...] Read more.
Amongst the convex polyhedra with *n* faces circumscribed about the unit sphere, which has the minimum surface area? This is the isoperimetric problem in discrete geometry which is addressed in this study. The solution of this problem represents the closest approximation of the sphere, i.e., the roundest polyhedra. A new numerical optimization method developed previously by the authors has been applied to optimize polyhedra to best approximate a sphere if tetrahedral, octahedral, or icosahedral symmetry constraints are applied. In addition to evidence provided for various cases of face numbers, potentially optimal polyhedra are also shown for *n* up to 132.
Full article

Age-Dependent Sexually-Dimorphic Asymmetric Development of the Ferret Cerebellar Cortex*Symmetry* **2017**, *9*(3), 40; doi:10.3390/sym9030040 - 14 March 2017**Abstract **

►
Figures
A three-dimensional (3D) T_{1}-weighted Magnetic Resonance Imaging (MRI) at 7-Tesla system was acquired with a high spatial resolution from fixed brains of male and female ferrets at postnatal days (PDs) 4 to 90, and their age-related sexual difference and laterality were

[...] Read more.
A three-dimensional (3D) T_{1}-weighted Magnetic Resonance Imaging (MRI) at 7-Tesla system was acquired with a high spatial resolution from fixed brains of male and female ferrets at postnatal days (PDs) 4 to 90, and their age-related sexual difference and laterality were evaluated by MRI-based ex vivo volumetry. The volume of both left and right sides of cerebellar cortex was larger in males than in females on PD 10 and thereafter. When the cerebellar cortex was divided into four transverse domains, i.e., anterior zone (AZ; lobules I–V), central zone (CZ; lobules VI and VII), posterior zone (PZ; lobules VIII–IXa), and nodular zone (NZ; lobules IXb and X), an age-related significantly greater volume in males than in females was detected on either side of all four domains on PD 42 and of the AZ on PD 90, but only on the left side of the PZ on PD 90. Regarding the volume laterality, significant leftward asymmetry was obtained in the CZ and PZ volumes in males, but not in females on PD 90. From asymmetry quotient (AQ) analysis, AQ scores were rightward in the AZ in both sexes already on PD 21, but gradually left-lateralized only in males in the CZ, PZ, and NZ during PDs 42 to 90. The present study suggests that a characteristic counterclockwise torque asymmetry (rostrally right-biased, and caudally left-biased or symmetrical) is acquired in both sexes of ferrets during PDs 42 to 90, although the leftward laterality of the posterior half of the cerebellum was more enhanced in males.
Full article

Matching Visual and Acoustic Mirror Forms*Symmetry* **2017**, *9*(3), 39; doi:10.3390/sym9030039 - 10 March 2017**Abstract **

►
Figures
This paper presents a comparative analysis of the ability to recognize three mirror forms in visual and acoustic tasks: inversion (reflection on a horizontal axis), retrograde (reflection on a vertical axis) and retrograde inversion (reflection on both horizontal and vertical axes). Dynamic patterns

[...] Read more.
This paper presents a comparative analysis of the ability to recognize three mirror forms in visual and acoustic tasks: inversion (reflection on a horizontal axis), retrograde (reflection on a vertical axis) and retrograde inversion (reflection on both horizontal and vertical axes). Dynamic patterns consisting of five tones in succession in the acoustic condition and five square dots in succession in the visual condition were presented to 180 non‐musically expert participants. In a yes/no task, they were asked to ascertain whether a comparison stimulus represented the “target” transformation (i.e., inversion, retrograde or retrograde inversion). Three main results emerged. Firstly, the fact that symmetry pertaining to a vertical axis is the most easily perceived does not only apply to static visual configurations (as found in previous literature) but also applies to dynamic visual configurations and acoustic stimuli where it is in fact even more marked. Secondly, however, differences emerged between the facility with which the three mirror forms were recognized in the acoustic and visual tasks. Thirdly, when the five elements in the stimulus were not of the same duration and therefore a rhythmic structure emerged, performance improved not only in the acoustic but also (even more significantly) in the visual task.
Full article

Transmission Power Adaption for Full-Duplex Relay-Aided Device-to-Device Communication*Symmetry* **2017**, *9*(3), 38; doi:10.3390/sym9030038 - 9 March 2017**Abstract **

►
Figures
Device-to-device (D2D) communications bring significant improvements of spectral efficiency by underlaying cellular networks. However, they also lead to a more deteriorative interference environment for cellular users, especially the users in severely deep fading or shadowing. In this paper, we investigate a relay-based communication

[...] Read more.
Device-to-device (D2D) communications bring significant improvements of spectral efficiency by underlaying cellular networks. However, they also lead to a more deteriorative interference environment for cellular users, especially the users in severely deep fading or shadowing. In this paper, we investigate a relay-based communication scheme in cellular systems, where the D2D communications are exploited to aid the cellular downlink transmissions by acting as relay nodes with underlaying cellular networks. We modeled two-antenna infrastructure relays employed for D2D relay. The D2D transmitter is able to transmit and receive signals simultaneously over the same frequency band. Then we proposed an efficient power allocation algorithm for the base station (BS) and D2D relay to reduce the loopback interference which is inherent due to the two-antenna infrastructure in full-duplex (FD) mode. We derived the optimal power allocation problem in closed form under the independent power constraint. Simulation results show that the algorithm reduces the power consumption of D2D relay to the greatest extent and also guarantees cellular users’ minimum transmit rate. Moreover, it also outperforms the existing half-duplex (HD) relay mode in terms of achievable rate of D2D.
Full article

Multi-Class Disease Classification in Brain MRIs Using a Computer-Aided Diagnostic System*Symmetry* **2017**, *9*(3), 37; doi:10.3390/sym9030037 - 8 March 2017**Abstract **

►
Figures
Background: An accurate and automatic computer-aided multi-class decision support system to classify the magnetic resonance imaging (MRI) scans of the human brain as normal, Alzheimer, AIDS, cerebral calcinosis, glioma, or metastatic, which helps the radiologists to diagnose the disease in brain MRIs is

[...] Read more.
Background: An accurate and automatic computer-aided multi-class decision support system to classify the magnetic resonance imaging (MRI) scans of the human brain as normal, Alzheimer, AIDS, cerebral calcinosis, glioma, or metastatic, which helps the radiologists to diagnose the disease in brain MRIs is created. Methods: The performance of the proposed system is validated by using benchmark MRI datasets (OASIS and Harvard) of 310 patients. Master features of the images are extracted using a fast discrete wavelet transform (DWT), then these discriminative features are further analysed by principal component analysis (PCA). Different subset sizes of principal feature vectors are provided to five different decision models. The classification models include the J48 decision tree, k-nearest neighbour (kNN), random forest (RF), and least-squares support vector machine (LS-SVM) with polynomial and radial basis kernels. Results: The RF-based classifier outperformed among all compared decision models and achieved an average accuracy of 96% with 4% standard deviation, and an area under the receiver operating characteristic (ROC) curve of 99%. LS-SVM (RBF) also shows promising results (i.e., 89% accuracy) when the least number of principal features was used. Furthermore, the performance of each classifier on different subset sizes of principal features was (80%–96%) for most performance metrics. Conclusion: The presented medical decision support system demonstrates the potential proof for accurate multi-class classification of brain abnormalities; therefore, it has a potential to use as a diagnostic tool for the medical practitioners.
Full article

Faithworthy Collaborative Spectrum Sensing Based on Credibility and Evidence Theory for Cognitive Radio Networks*Symmetry* **2017**, *9*(3), 36; doi:10.3390/sym9030036 - 4 March 2017**Abstract **

►
Figures
Cognitive radio (CR) has become a tempting technology that achieves significant improvement in spectrum utilization. To resolve the hidden terminal problem, collaborative spectrum sensing (CSS), which profits from spatial diversity, has been studied intensively in recent years. As CSS is vulnerable to the

[...] Read more.
Cognitive radio (CR) has become a tempting technology that achieves significant improvement in spectrum utilization. To resolve the hidden terminal problem, collaborative spectrum sensing (CSS), which profits from spatial diversity, has been studied intensively in recent years. As CSS is vulnerable to the attacks launched by malicious secondary users (SUs), certain CSS security schemes based on the Dempster–Shafer theory of evidence have been proposed. Nevertheless, the available works only focus on the real-time difference of SUs, like the difference in similarity degree or SNR, to evaluate the credibility of each SU. Since the real-time difference is unilateral and sometimes inexact, the statistical information comprised in SUs’ historical behaviors should not be ignored. In this paper, we propose a robust CSS method based on evidence theory and credibility calculation. It is executed in four consecutive procedures, which are basic probability assignment (BPA), holistic credibility calculation, option and amelioration of BPA and evidence combination via the Dempster–Shafer rule, respectively. Our scheme evaluates the holistic credibility of SUs from both the real-time difference and statistical sensing behavior of SUs. Moreover, considering that the transmitted data increase with the number of SUs increasing, we introduce the projection approximation approach to adjust the evidence theory to the binary hypothesis test in CSS; on this account, both the data volume to be transmitted and the workload at the data fusion center have been reduced. Malicious SUs can be distinguished from genuine ones based on their historical sensing behaviors, and SUs’ real-time difference can be reserved to acquire a superior current performance. Abounding simulation results have proven that the proposed method outperforms the existing ones under the effect of different attack modes and different numbers of malicious SUs.
Full article

Detecting Sybil Attacks in Cloud Computing Environments Based on Fail‐Stop Signature*Symmetry* **2017**, *9*(3), 35; doi:10.3390/sym9030035 - 2 March 2017**Abstract **

►
Figures
Due to the loosely coupled property of cloud computing environments, no node has complete knowledge of the system. For this reason, detecting a Sybil attack in cloud computing environments is a non‐trivial task. In such a dynamic system, the use of algorithms based

[...] Read more.
Due to the loosely coupled property of cloud computing environments, no node has complete knowledge of the system. For this reason, detecting a Sybil attack in cloud computing environments is a non‐trivial task. In such a dynamic system, the use of algorithms based on tree or ring structures for collecting the global state of the system has unfortunate downsides, that is, the structure should be re‐constructed in the presence of node joining and leaving. In this paper, we propose an unstructured Sybil attack detection algorithm in cloud computing environments. Our proposed algorithm uses one‐to‐one communication primitives rather than broadcast primitives and, therefore, the message complexity can be reduced. In our algorithmic design, attacker nodes forging multiple identities are effectively detected by normal nodes with the fail‐stop signature scheme. We show that, regardless of the number of attacker nodes, our Sybil attack detection algorithm is able to reach consensus.
Full article

Generalized Degree-Based Graph Entropies*Symmetry* **2017**, *9*(3), 29; doi:10.3390/sym9030029 - 28 February 2017**Abstract **

►
Figures
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network.

[...] Read more.
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies by using the degree powers are proved. Moreover, the relationships among the entropies are studied. Finally, numerical results are presented to illustrate the features of the new entropies.
Full article

Game Algorithm for Resource Allocation Based on Intelligent Gradient in HetNet*Symmetry* **2017**, *9*(3), 34; doi:10.3390/sym9030034 - 28 February 2017**Abstract **

►
Figures
In order to improve system performance such as throughput, heterogeneous network (HetNet) has become an effective solution in Long Term Evolution-Advanced (LET-A). However, co-channel interference leads to degradation of the HetNet throughput, because femtocells are always arranged to share the spectrum with the

[...] Read more.
In order to improve system performance such as throughput, heterogeneous network (HetNet) has become an effective solution in Long Term Evolution-Advanced (LET-A). However, co-channel interference leads to degradation of the HetNet throughput, because femtocells are always arranged to share the spectrum with the macro base station. In this paper, in view of the serious cross-layer interference in double layer HetNet, the Stackelberg game model is adopted to analyze the resource allocation methods of the network. Unlike the traditional system models only focusing on macro base station performance improvement, we take into account the overall system performance and build a revenue function with convexity. System utility functions are defined as the average throughput, which does not adopt frequency spectrum trading method, so as to avoid excessive signaling overhead. Due to the value scope of continuous Nash equilibrium of the built game model, the gradient iterative algorithm is introduced to reduce the computational complexity. As for the solution of Nash equilibrium, one kind of gradient iterative algorithm is proposed, which is able to intelligently choose adjustment factors. The Nash equilibrium can be quickly solved; meanwhile, the step of presetting adjustment factors is avoided according to network parameters in traditional linear iterative model. Simulation results show that the proposed algorithm enhances the overall performance of the system.
Full article

On the Incompleteness of Ibragimov’s Conservation Law Theorem and Its Equivalence to a Standard Formula Using Symmetries and Adjoint-Symmetries*Symmetry* **2017**, *9*(3), 33; doi:10.3390/sym9030033 - 27 February 2017**Abstract **

A conservation law theorem stated by N. Ibragimov along with its subsequent extensions are shown to be a special case of a standard formula that uses a pair consisting of a symmetry and an adjoint-symmetry to produce a conservation law through a well-known

[...] Read more.
A conservation law theorem stated by N. Ibragimov along with its subsequent extensions are shown to be a special case of a standard formula that uses a pair consisting of a symmetry and an adjoint-symmetry to produce a conservation law through a well-known Fréchet derivative identity. Furthermore, the connection of this formula (and of Ibragimov’s theorem) to the standard action of symmetries on conservation laws is explained, which accounts for a number of major drawbacks that have appeared in recent work using the formula to generate conservation laws. In particular, the formula can generate trivial conservation laws and does not always yield all non-trivial conservation laws unless the symmetry action on the set of these conservation laws is transitive. It is emphasized that all local conservation laws for any given system of differential equations can be found instead by a general method using adjoint-symmetries. This general method is a kind of adjoint version of the standard Lie method to find all local symmetries and is completely algorithmic. The relationship between this method, Noether’s theorem and the symmetry/adjoint-symmetry formula is discussed.
Full article

BSLIC: SLIC Superpixels Based on Boundary Term*Symmetry* **2017**, *9*(3), 31; doi:10.3390/sym9030031 - 26 February 2017**Abstract **

►
Figures
A modified method for better superpixel generation based on simple linear iterative clustering (SLIC) is presented and named BSLIC in this paper. By initializing cluster centers in hexagon distribution and performing k-means clustering in a limited region, the generated superpixels are shaped into

[...] Read more.
A modified method for better superpixel generation based on simple linear iterative clustering (SLIC) is presented and named BSLIC in this paper. By initializing cluster centers in hexagon distribution and performing k-means clustering in a limited region, the generated superpixels are shaped into regular and compact hexagons. The additional cluster centers are initialized as edge pixels to improve boundary adherence, which is further promoted by incorporating the boundary term into the distance calculation of the k-means clustering. Berkeley Segmentation Dataset BSDS500 is used to qualitatively and quantitatively evaluate the proposed BSLIC method. Experimental results show that BSLIC achieves an excellent compromise between boundary adherence and regularity of size and shape. In comparison with SLIC, the boundary adherence of BSLIC is increased by at most 12.43% for boundary recall and 3.51% for under segmentation error.
Full article

Intelligent RFID Indoor Localization System Using a Gaussian Filtering Based Extreme Learning Machine*Symmetry* **2017**, *9*(3), 30; doi:10.3390/sym9030030 - 26 February 2017**Abstract **

►
Figures
Nowadays, the increasing demands of location-based services (LBS) have spurred the rapid development of indoor positioning systems (IPS). However, the performance of IPSs is affected by the fluctuation of the measured signal. In this study, a Gaussian filtering algorithm based on an extreme

[...] Read more.
Nowadays, the increasing demands of location-based services (LBS) have spurred the rapid development of indoor positioning systems (IPS). However, the performance of IPSs is affected by the fluctuation of the measured signal. In this study, a Gaussian filtering algorithm based on an extreme learning machine (ELM) is proposed to address the problem of inaccurate indoor positioning when significant Received Signal Strength Indication (RSSI) fluctuations happen during the measurement process. The Gaussian filtering method is analyzed and compared, which can effectively filter out the fluctuant signals that were caused by the environment effects in an RFID-based positioning system. Meanwhile, the fast learning ability of the proposed ELM algorithm can reduce the time consumption for the offline and online service, and establishes the network positioning regression model between the signal strengths of the tags and their corresponding positions. The proposed positioning system is tested in a real experimental environment. In addition, system test results demonstrate that the positioning algorithms can not only provide higher positioning accuracy, but also achieve a faster computational efficiency compared with other previous algorithms.
Full article

Evaluation of Cyber Security and Modelling of Risk Propagation with Petri Nets*Symmetry* **2017**, *9*(3), 32; doi:10.3390/sym9030032 - 26 February 2017**Abstract **

►
Figures
This article presents a new method of risk propagation among associated elements. On the

basis of coloured Petri nets, a new class called propagation nets is defined. This class provides

a formal model of a risk propagation. The proposed method allows for model

[...] Read more.basis of coloured Petri nets, a new class called propagation nets is defined. This class provides

a formal model of a risk propagation. The proposed method allows for model

This article presents a new method of risk propagation among associated elements. On the

basis of coloured Petri nets, a new class called propagation nets is defined. This class provides

a formal model of a risk propagation. The proposed method allows for model relations between

nodes forming the network structure. Additionally, it takes into account the bidirectional relations

between components as well as relations between isomorphic, symmetrical components in various

branches of the network. This method is agnostic in terms of use in various systems and it can

be adapted to the propagation model of any systems’ characteristics; however, it is intentionally

proposed to assess the risk of critical infrastructures. In this paper, as a proof of concept example, we

show the formal model of risk propagation proposed within the project Cyberspace Security Threats

Evaluation System of the Republic of Poland. In the article, the idea of the method is presented as

well as its use case for evaluation of risk for cyber threats. With the adaptation of Petri nets, it is

possible to evaluate the risk for the particular node and assess the impact of this risk for all related

nodes including hierarchic relations of components as well as isomorphism of elements. Full article

basis of coloured Petri nets, a new class called propagation nets is defined. This class provides

a formal model of a risk propagation. The proposed method allows for model relations between

nodes forming the network structure. Additionally, it takes into account the bidirectional relations

between components as well as relations between isomorphic, symmetrical components in various

branches of the network. This method is agnostic in terms of use in various systems and it can

be adapted to the propagation model of any systems’ characteristics; however, it is intentionally

proposed to assess the risk of critical infrastructures. In this paper, as a proof of concept example, we

show the formal model of risk propagation proposed within the project Cyberspace Security Threats

Evaluation System of the Republic of Poland. In the article, the idea of the method is presented as

well as its use case for evaluation of risk for cyber threats. With the adaptation of Petri nets, it is

possible to evaluate the risk for the particular node and assess the impact of this risk for all related

nodes including hierarchic relations of components as well as isomorphism of elements. Full article

On the Legibility of Mirror-Reflected and Rotated Text*Symmetry* **2017**, *9*(3), 28; doi:10.3390/sym9030028 - 23 February 2017**Abstract **

►
Figures
We happened to observe that text that was reflected about either the horizontal or vertical axis was more difficult to read than text that was reflected about first one and then the other, which amounts to a 180-degree rotation. In this article, we

[...] Read more.
We happened to observe that text that was reflected about either the horizontal or vertical axis was more difficult to read than text that was reflected about first one and then the other, which amounts to a 180-degree rotation. In this article, we review a number of studies that examine the nature of recognizing reflected and inverted letters, and the frequency of mirror reversal errors (e.g., confusing 'b' for 'd') in children and adults. We explore recent ideas linking the acquisition of literacy with the loss of mirror-invariance, not just for text, but for objects in general. We try to connect these various literatures to examine why certain transformations of text are more difficult to read than others for adults.
Full article

Symmetry Analysis and Conservation Laws of the Zoomeron Equation*Symmetry* **2017**, *9*(2), 27; doi:10.3390/sym9020027 - 21 February 2017**Abstract **

In this work, we study the (2 + 1)-dimensional Zoomeron equation which is an extension of the famous (1 + 1)-dimensional Zoomeron equation that has been studied extensively in the literature. Using classical Lie point symmetries admitted by the equation, for the ﬁrst

[...] Read more.
In this work, we study the (2 + 1)-dimensional Zoomeron equation which is an extension of the famous (1 + 1)-dimensional Zoomeron equation that has been studied extensively in the literature. Using classical Lie point symmetries admitted by the equation, for the ﬁrst time we develop an optimal system of one-dimensional subalgebras. Based on this optimal system, we obtain symmetry reductions and new group-invariant solutions. Again for the ﬁrst time, we construct the conservation laws of the underlying equation using the multiplier method.
Full article