Modules identification in gene positive networks of hepatocellular carcinoma using pearson agglomerative method and Pearson cohesion coupling modularity

In this study, a gene positive network is proposed based on a weighted undirected graph, where the weight represents the positive correlation of the genes. A Pearson agglomerative clustering algorithm is employed to build a clustering tree, where dotted lines cut the tree from bottom to top leading to a number of subsets of the modules. In order to achieve better module partitions, the Pearson correlation coefficient modularity is addressed to seek optimal module decomposition by selecting an optimal threshold value. For the liver cancer gene network under study, we obtain a strong threshold value at 0.67302, and a very strong correlation threshold at 0.80086. On the basis of these threshold values, fourteen strong modules and thirteen very strong modules are obtained respectively. A certain degree of correspondence between the two types of modules is addressed as well. Finally, the biological significance of the two types of modules is analyzed and explained, which shows that these modules are closely related to the proliferation and metastasis of liver cancer. This discovery of the new modules may provide new clues and ideas for liver cancer treatment

Multiangle social network recommendation algorithms and similarity network evaluation

Multiangle social network recommendation algorithms (MSN) and a new assessmentmethod, called similarity network evaluation (SNE), are both proposed. From the viewpoint of six dimensions, the MSN are classified into six algorithms, including user-based algorithmfromresource point (UBR), user-based algorithmfromtag point (UBT), resource-based algorithm fromtag point (RBT), resource-based algorithm from user point (RBU), tag-based algorithm from resource point (TBR), and tag-based algorithm from user point (TBU). Compared with the traditional recall/precision (RP) method, the SNE is more simple, effective, and visualized. The simulation results show that TBR and UBR are the best algorithms, RBU and TBU are the worst ones, and UBT and RBT are in the medium levels

A Spatiotemporal-chaos-based Encryption Having Overall Properties Considerably Better Than Advanced Encryption Standard

Spatiotemporal chaos of a two-dimensional one-way coupled map lattice is used for chaotic cryptography. The chaotic outputs of many space units are used for encryption simultaneously. This system shows satisfactory cryptographic properties of high security; fast encryption (decryption) speed; and robustness against noise disturbances in communication channel. The overall features of this spatiotemporal-chaos-based cryptosystem are better than chaotic cryptosystems known so far, and also than currently used conventional cryptosystems, such as the Advanced Encryption Standard (AES).Comment: 11 pages, 3 figure

That’s “Who-I-Am!”: An Identity Regulatory Model of Narcissism

Despite advances in understanding narcissism, limited attention has been paid to articulating a higherorder construct that explicitly captures the multi-faceted nature of narcissistic motives and displays. To address this missing link, this study presents an identity-based self-regulatory model of narcissism. We draw from identity control theory (ICT) and propose that dominance identity, a personal identity central to the narcissistic self-concept, is the overarching psychological motive driving narcissistic beliefs and behaviors. Validating, promoting, and protecting this dominance identity is the primary goal that guide narcissistic self-regulatory processes. We identify grandiose self-views, narcissistic self-promotion, and interpersonal aggression as the primary intra-personal and interpersonal strategies employed to sustain narcissistic personal identity. Complementing the prominent self-esteem based regulatory model of narcissism, the central premise of this framework is that dominance identity acts much like a thermostat that sets identity goals. Meanwhile, self-esteem, like a thermometer, is an evaluative indicator of such identity -goal attainment. This identity regulatory model provides a parsimonious way to organize current understanding of the underpinning psychological drivers of narcissism

The Superior Me! An Empirical Examination of the Dominance-Self of Narcissism

To address the question of why a narcissistic individual thinks and behaves the way he or she does, it is important to take an intrapersonal approach to dissect the psychological motives. The aim of this study is to further develop the concept of the narcissistic self. To specify the content and structure of the narcissistic self-concept, which we label as the dominance self-concept, we draw from the interpersonal circumplex framework of personality theories and identity motive perspective in self-system literature. Furthermore, we develop a causal-chain process model to depict the motivated process of narcissism manifestations. We contend that narcissism personality is translated into narcissistic displays through two steps of motivated links, motivated self-construal, and self-concept motivated self-regulation. In addition, we empirically test part of the process model and hypothesize a mediating role of dominance self-concept in the link between narcissism and two cognitive strategies of self-enhancement (perceived fit for leader roles, personal sense of power)

Periodicity of chaotic trajectories in realizations of finite computer precisions and its implication in chaos communications

Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical power law relations of the period and transient iterations with the computation precisions and the sizes of coupled systems are obtained. For each computation we always find, by randomly choosing initial conditions, a single dominant periodic trajectory which is realized with major portion of probability. These understandings are useful for possible applications of chaos, e.g., chaotic cryptography in secure communication.Comment: 10 pages, 3 figures, 2 table