Validation of the South Korean Version of the Beliefs about Emotions Scale

Background Beliefs about the unacceptability of experiencing or expressing negative emotions can contribute to diverse psychological symptoms and associated with poor treatment outcomes and low treatment attempts. The Beliefs about Emotions Scale (BES) was developed to assess such beliefs based on the cognitive-behavioral models; however, no study has reported on the psychometric properties of the BES in Korea. The present study aimed to cross-culturally adapt and validate the BES for the Korean population (BES-K). Methods The BES-K was administered to 592 Korean adults (323 men and 269 women) aged 20–59 years. Exploratory and confirmatory factor analysis were used to assess the factor model of the scale. Pearson correlation coefficients were used to evaluate the relationships between the BES-K and other psychological measures. Results The result showed a two-factor model of the BES-K, with Factor 1 relating to Interpersonal and Factor 2 representing Intrapersonal aspects. The scale had significant yet moderately low correlations with measures of depression, anxiety, and difficulties in emotion regulation. Conclusion The BES-K is a useful instrument in evaluating the beliefs about emotions in the Korean population

Technologies to Capture CO2_2 directly from Ambient Air

Building a carbon-neutral world needs to remove the excess CO$_2$ that has already been dumped into the atmosphere. The sea, soil, vegetation, and rocks on Earth all naturally uptake CO$_2$ from the atmosphere. Human beings can accelerate these processes in specific ways. The review summarizes the present Direct Air Capture (DAC) technology that contribute to Negative Emissions. Research currently being done has suggested future perspectives and directions of various methods for Negative Emission. New generations of technologies have emerged as a result of recent advancements in surface chemistry, material synthesis, and engineering design. These technologies may influence the large-scale deployment of existing CO$_2$ capture technologies in the future

Water-stable MOFs and Hydrophobically Encapsulated MOFs for CO2 Capture from Ambient Air and Wet Flue Gas

The extra CO2 that has already been released into the atmosphere has to be removed in order to create a world that is carbon neutral. Technologies have been created to remove carbon dioxide from wet flue gas or even directly from ambient air, however these technologies are not widely deployed yet. New generations of creative CO2 capture sorbents have been produced as a consequence of recent improvements in material assembly and surface chemistry. We summarize recent progress on water-stable and encapsulated metal-organic frameworks (MOFs) for CO2 capture under a wide range of environmental and operating conditions. In particular, newly developed water-stable MOFs and hydrophobic coating technologies are discussed with insights into their materials discovery and the synergistic effects between different components of these hybrid sorbent systems. The future perspectives and directions of water-stable and encapsulated MOFs are also given for Direct Air Capture of CO2 and CO2 capture from wet flue gas

Schottky Barrier Modulation of Metal/4H-SiC Junction with Thin Interface Spacer Driven by Surface Polarization Charge on 4H-SiC Substrate

The Au/Ni/Al2O3/4H-SiC junction with the Al2O3 film as a thin spacer layer was found to show the electrical characteristics of a typical rectifying Schottky contact, which is considered to be due to the leakiness of the spacer layer. The Schottky barrier of the junction was measured to be higher than an Au/Ni/4H-SiC junction with no spacer layer. It is believed that the negative surface bound charge originating from the spontaneous polarization of 4H-SiC causes the Schottky barrier increase. The use of a thin spacer layer can be an efficient experimental method to modulate Schottky barriers of metal/4H-SiC junctions.open

Ion-selective and chemical-protective elastic block copolymer interphase for durable zinc metal anode

Aqueous rechargeable batteries based on zinc anodes are among the most promising systems to replace conventional lithium-ion batteries owing to their intrinsic safety, high ionic conductivity, and economic benefits. However, inferior reversibility of zinc anode resulting from zinc dendrites and surface side reactions limits the practical realization of zinc-ion batteries. Herein, we develop a thin but robust polymeric artificial interphase to enhance reversibility of zinc anode. The grafted maleic anhydride groups in the polymer structure restrain the detrimental reactions through selective zinc-ion penetration and homogenize ion distribution, leading to a smooth electrode surface after plating-stripping processes. Consequently, the coated zinc anode shows excellent stability with a long-term symmetric cell lifespan (>3,000 h at 3 mA??cm???2) and maintains capacity retention of 80% after 2,500 cycles, paired with a manganese oxide cathode. This study provides a facile fabrication process and accessible analysis methods to rationalize the development of high-performance zinc-ion batteries

Profile of tries

Tries and suffix trees are the most popular data, structures on words. Tries were introduced in 1960 by Fredkin as an efficient method for searching and sorting digital data. Since then a myriad of novel trie applications has been found such as dynamic bashing, conflict resolution algorithms, leader election algorithms, IP addresses lookup, coding, polynomial factorization, and Lempel-Ziv compression schemes. Furthermore, various analyses of tries reveal new fundamental properties of strings appearing in those applications. Parameters of interest are the (partial) fillup level (the largest full level of the trie), shortest path, height (longest path), typical depth, and path length (sum of depths). All of these parameters are analyzed here in a unifying manner by studying the external and internal profiles. A profile of a tree at level k is the number of nodes (internal or external) at level k. We derive recurrences for both profiles and solve them asymptotically for various ranges of k when the strings stored in the trie are generated by a memoryless source (extension to a Markov source is possible). In particular, we present asymptotic results for the average profile, the variance and the limiting distribution. As consequences we find typical behaviors of the height, shortest path, fillup level, and the depth. These results are derived here by methods of analytic algorithmics such as generating functions, Mellin transform, poissonization and depoissonization, and the saddle point method

Analysis of biclusters with applications to gene expression data

For a given matrix of size $n \times m$ over a finite alphabet $\mathcal{A}$, a bicluster is a submatrix composed of selected columns and rows satisfying a certain property. In microarrays analysis one searches for largest biclusters in which selected rows constitute the same string (pattern); in another formulation of the problem one tries to find a maximally dense submatrix. In a conceptually similar problem, namely the bipartite clique problem on graphs, one looks for the largest binary submatrix with all '1'. In this paper, we assume that the original matrix is generated by a memoryless source over a finite alphabet $\mathcal{A}$. We first consider the case where the selected biclusters are square submatrices and prove that with high probability (whp) the largest (square) bicluster having the same row-pattern is of size $\log_Q^2 n m$ where $Q^{-1}$ is the (largest) probability of a symbol. We observe, however, that when we consider $\textit{any}$ submatrices (not just $\textit{square}$ submatrices), then the largest area of a bicluster jumps to $A_n$ (whp) where $A$ is an explicitly computable constant. These findings complete some recent results concerning maximal biclusters and maximum balanced bicliques for random bipartite graphs

Analysis of biclusters with applications to gene expression data

For a given matrix of size n × m over a finite alphabet A, a bicluster is a submatrix composed of selected columns and rows satisfying a certain property. In microarrays analysis one searches for largest biclusters in which selected rows constitute the same string (pattern); in another formulation of the problem one tries to find a maximally dense submatrix. In a conceptually similar problem, namely the bipartite clique problem on graphs, one looks for the largest binary submatrix with all ‘1’. In this paper, we assume that the original matrix is generated by a memoryless source over a finite alphabet A. We first consider the case where the selected biclusters are square submatrices and prove that with high probability (whp) the largest (square) bicluster having the same row-pattern is of size log 2 Q nm where Q −1 is the (largest) probability of a symbol. We observe, however, that when we consider any submatrices (not just square submatrices), then the largest area of a bicluster jumps to An (whp) where A is an explicitly computable constant. These findings complete some recent results concerning maximal biclusters and maximum balanced bicliques for random bipartite graphs