Identity Integration and Innovation

Three studies examined the psychological antecedents and processes related to individual-level innovation. We propose that individuals who can integrate multiple social identities are better at combining knowledge systems associated with each identity, and thus exhibit higher levels of innovation. Three studies, each probing different types of social identities, provide evidence for this proposition. Study 1 showed that Asian American biculturals with high identity integration between their Asian and American identities exhibited higher levels of innovation in creating Asian-American fusion cuisine compared to biculturals with low identity integration. Study 2 showed that women engineers with high identity integration between their gender and professional identities were more innovative than those with low identity integration. Finally, Study 3 showed that innovation among faculty members with two disciplinary affiliations is similarly related to individual differences in identity integration between their disciplinary affiliations. These findings suggest that the psychological management of multiple identities affects individual innovation.http://deepblue.lib.umich.edu/bitstream/2027.42/49542/1/1070-Sanchez-Burks.pd

On Path Memory in List Successive Cancellation Decoder of Polar Codes

Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the state-of-the-art designs, the memories are implemented with registers and a large crossbar is used for copying the partial decoded vectors from one block of memory to another during the update. The architectures are quite area-costly when the code length and list size are large. To solve this problem, we propose two optimization schemes for the path memory in this work. First, a folded path memory architecture is presented to reduce the area cost. Second, we show a scheme that the path memory can be totally removed from the architecture. Experimental results show that these schemes effectively reduce the area of path memory.Comment: 5 pages, 6 figures, 2 table

Low Complexity Belief Propagation Polar Code Decoders

Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compared to BPD. However SCDs suffer from long latency and low throughput due to the serial nature of the successive cancellation algorithm. BPD is parallel in nature and hence is more attractive for high throughput applications. However since it is iterative in nature, the required latency and energy dissipation increases linearly with the number of iterations. In this work, we borrow the idea of SCD and propose a novel scheme based on sub-factor-graph freezing to reduce the average number of computations as well as the average number of iterations required by BPD, which directly translates into lower latency and energy dissipation. Simulation results show that the proposed scheme has no performance degradation and achieves significant reduction in computation complexity over the existing methods.Comment: 6 page

Moderating Effects of Information-Oriented versus Escapism-Oriented Motivations on the Relationship Between Psychological Well-Being and Problematic Use of Video Game Live-Streaming services

Background and aims: Video game live-streaming platforms are widely used by gamers. However, the excessive use of such services has rarely been examined. Although psychosocial well-being and motivations for use have been demonstrated to play major roles in online addiction, understanding the moderating mechanism of these two factors is warranted. Video game live-streaming platforms are an ideal context for studying the moderating role of both informational and escapism motivations, because viewers on such platforms can learn gaming strategies or escape from the reality. Methods: This study collected survey data from 508 users of the highly popular game-streaming service Twitch. The sample was divided into two groups based on the respondents’ use motivations. Regression models with interaction terms were fitted, followed by a simple slope test, to verify the hypotheses. Results: For the escapism-oriented group, a moderating effect of escapism on the relationship between loneliness and negative outcomes was found; the relationship was positive for low and moderate levels of escapism, but it was non-significant for individuals with high levels of escapism. For the information-oriented group, information seeking was observed to exert a moderating effect on the relationship between stress and negative outcomes; the relationship was negative for low and moderate levels of information seeking, but it was non-significant for individuals demonstrating high levels of information seeking. Discussion and conclusions: The findings promote understanding regarding how individuals using similar Internet-related coping strategies to deal with problems differ in their propensity for experiencing negative consequences when motivation levels and online environments are considered

AtPAN: an integrated system for reconstructing transcriptional regulatory networks in Arabidopsis thaliana

<p>Abstract</p> <p>Background</p> <p>Construction of transcriptional regulatory networks (TRNs) is of priority concern in systems biology. Numerous high-throughput approaches, including microarray and next-generation sequencing, are extensively adopted to examine transcriptional expression patterns on the whole-genome scale; those data are helpful in reconstructing TRNs. Identifying transcription factor binding sites (TFBSs) in a gene promoter is the initial step in elucidating the transcriptional regulation mechanism. Since transcription factors usually co-regulate a common group of genes by forming regulatory modules with similar TFBSs. Therefore, the combinatorial interactions of transcription factors must be modeled to reconstruct the gene regulatory networks.</p> <p>Description For systems biology applications, this work develops a novel database called <it>Arabidopsis thaliana </it>Promoter Analysis Net (AtPAN), capable of detecting TFBSs and their corresponding transcription factors (TFs) in a promoter or a set of promoters in <it>Arabidopsis</it>. For further analysis, according to the microarray expression data and literature, the co-expressed TFs and their target genes can be retrieved from AtPAN. Additionally, proteins interacting with the co-expressed TFs are also incorporated to reconstruct co-expressed TRNs. Moreover, combinatorial TFs can be detected by the frequency of TFBSs co-occurrence in a group of gene promoters. In addition, TFBSs in the conserved regions between the two input sequences or homologous genes in <it>Arabidopsis </it>and rice are also provided in AtPAN. The output results also suggest conducting wet experiments in the future.</p> <p>Conclusions</p> <p>The AtPAN, which has a user-friendly input/output interface and provide graphical view of the TRNs. This novel and creative resource is freely available online at <url>http://AtPAN.itps.ncku.edu.tw/</url>.</p

Substitution reactions of carbon nanotube template

Substitution reactions between carbon nanotube (CNT) template and SiO with the formation of carbon rich silicon oxide nanowires (SiO&ndash;C-NWs) have been investigated using transmission electron microscopy and x-ray energy dispersive spectroscopy. The reaction was carried out by thermal annealing at 1200 &deg;C for 1 h of a mixture of silicon monoxide (SiO) and iron (II) phthalocyanine, FeC32N8H16 (FePc) powders. Multiwalled CNTs were produced first via pyrolysis of FePc at a lower temperature (1000 &deg;C). SiO vapors reacted with the CNTs at higher temperatures to produce amorphous SiO&ndash;C-NWs with a uniform diameter and a length in tens of micrometers. The special bamboolike structure of the CNTs allows the reaction to start from the external surface of the tubes and transform each CNT into a solid nanowire section by section.<br /

Accelerating Large Kernel Convolutions with Nested Winograd Transformation.pdf

Recent literature has shown that convolutional neural networks (CNNs) with large kernels outperform vision transformers (ViTs) and CNNs with stacked small kernels in many computer vision tasks, such as object detection and image restoration. The Winograd transformation helps reduce the number of repetitive multiplications in convolution and is widely supported by many commercial AI processors. Researchers have proposed accelerating large kernel convolutions by linearly decomposing them into many small kernel convolutions and then sequentially accelerating each small kernel convolution with the Winograd algorithm. This work proposes a nested Winograd algorithm that iteratively decomposes a large kernel convolution into small kernel convolutions and proves it to be more effective than the linear decomposition Winograd transformation algorithm. Experiments show that compared to the linear decomposition Winograd algorithm, the proposed algorithm reduces the total number of multiplications by 1.4 to 10.5 times for computing 4x4 to 31x31 convolutions.Comment: published ref to https://ieeexplore.ieee.org/document/1032193