• Biomolecules & Therapeutics
• /
• v.30 no.1
• /
• pp.98-116
• /
• 2022

The small GTPase RhoA has been studied extensively for its role in actin dynamics. In this study, multiple bioinformatics tools were applied cooperatively to the microarray dataset GSE64714 to explore previously unidentified functions of RhoA. Comparative gene expression analysis revealed 545 differentially expressed genes in RhoA-null cells versus controls. Gene set enrichment analysis (GSEA) was conducted with three gene set collections: (1) the hallmark, (2) the Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway, and (3) the Gene Ontology Biological Process. GSEA results showed that RhoA is related strongly to diverse pathways: cell cycle/growth, DNA repair, metabolism, keratinization, response to fungus, and vesicular transport. These functions were verified by heatmap analysis, KEGG pathway diagramming, and direct acyclic graphing. The use of multiple gene set collections restricted the leakage of information extracted. However, gene sets from individual collections are heterogenous in gene element composition, number, and the contextual meaning embraced in names. Indeed, there was a limit to deriving functions with high accuracy and reliability simply from gene set names. The comparison of multiple gene set collections showed that although the gene sets had similar names, the gene elements were extremely heterogeneous. Thus, the type of collection chosen and the analytical context influence the interpretation of GSEA results. Nonetheless, the analyses of multiple collections made it possible to derive robust and consistent function identifications. This study confirmed several well-described roles of RhoA and revealed less explored functions, suggesting future research directions.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.683-695
• /
• 2007

A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. In a recent article, the authors proved that a regular c-partite tournament with $r{\geq}2$ vertices in each partite set contains a cycle with exactly r-1 vertices from each partite set, with exception of the case that c=4 and r=2. Here we will examine the existence of cycles with r-2 vertices from each partite set in regular multipartite tournaments where the r-2 vertices are chosen arbitrarily. Let D be a regular c-partite tournament and let $X{\subseteq}V(D)$ be an arbitrary set with exactly 2 vertices of each partite set. For all $c{\geq}4$ we will determine the minimal value g(c) such that D-X is Hamiltonian for every regular multipartite tournament with $r{\geq}g(c)$.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.568-571
• /
• 2008

The computation of moving interface by the level set method typically requires reinitializations of level set function. An inaccurate estimation of level set function ${\phi}$ results in incorrect free-surface capturing and thus errors such as mass gain/loss. Therefore, accurate and robust reinitialization process is essential to the free-surface flows. In the present paper, we pursue further development of the reinitialization process, which evaluates directly level set function ${\phi}$ using a normal vector in the interface without solving the re-distancing equation of hyperbolic type. The Taylor-Galerkin approximation and P1P1splitting FEM are adopted to discretize advection equation of the level set function and the Navier-Stokes equation, respectively. Advection equation of free surface and re-initialization process are validated with benchmark problems, i.e., a broken dam flow and time-reversed single vortex flow. The simulation results are in good agreement with the existing results.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.32 no.10
• /
• pp.754-760
• /
• 2008

Computation of moving interface by the level set method typically requires the reinitialization of level set function. An inaccurate estimation of level set function $\phi$ results in incorrect free-surface capturing and thus errors such as mass gain/loss. Therefore, an accurate and robust reinitialization process is essential to the simulation of free-surface flows. In the present paper, we pursue further development of the reinitialization process, which evaluates level set function directly using a normal vector on the interface without solving there-distancing equation of hyperbolic type. The Taylor-Galerkin approximation and P1P1 splitting/SUPG (Streamline Upwind Petrov-Galerkin) FEM are adopted to discretize advection equation of the level set function and the incompressible Navier-Stokes equation, respectively. Advection equation and re-initialization process of free surface capturing are validated with benchmark problems, i.e., a broken dam flow and timereversed single vortex flow. The simulation results are in good agreement with the existing results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1743-1758
• /
• 2023

Automatic modulation classification is a critical algorithm for non-cooperative communication systems. This paper addresses the challenging problem of closed-set and open-set signal modulation classification in complex channels. We propose a novel approach that incorporates a self-learning filter and center-loss in Deep Residual Shrinking Networks (DRSN) for closed-set modulation classification, and the Opendistance method for open-set modulation classification. Our approach achieves better performance than existing methods in both closed-set and open-set recognition. In closed-set recognition, the self-learning filter and center-loss combination improves recognition performance, with a maximum accuracy of over 92.18%. In open-set recognition, the use of a self-learning filter and center-loss provide an effective feature vector for open-set recognition, and the Opendistance method outperforms SoftMax and OpenMax in F1 scores and mean average accuracy under high openness. Overall, our proposed approach demonstrates promising results for automatic modulation classification, providing better performance in non-cooperative communication systems.

• Textile Coloration and Finishing
• /
• v.1 no.1
• /
• pp.1-6
• /
• 1989

The reaction of silk with a disulfide-containing crosslinking agent, i.e. bis($\beta$-isocyanatoethyl)disulfide(BIED), was studied in an attempt to obtain disulfide-crosslinked silk. The setting properties of disulfide-crosslinked silk fibers were studied. The permanent set values of single fibers were evaluated after the set fibers were relaxed in boiling water. When single fibers were set in boiling water or in boiling alkaline solution, the permanent set values of BIED-treated silk fibers were less than those of untreated silk fibers. When the fibers were treated with 2% thioglycolic acid solution at $60^\circ{C}$ followed by oxidation, settability of BIED-treated silk was better than that of untreated silk. The rearrangement of secondary bonds faciliated by cleavage of crosslinks as well as the rearrangement of crosslinks itself seems to be an important role in the set stability.

• Korean Journal of Human Ecology
• /
• v.17 no.2
• /
• pp.305-313
• /
• 2008

This subject investigated visual evaluation of preference and fitness level of set-in sleeve in sleeve types(form)and studied suitable sleeve type at silhouette and targeted female students in twenties. The results of study were as follows: 1. Visual evaluation factors in set-in sleeve of sleeve types were selected 6 factors; the 1st factor is decorativeness, the 2nd factor is attractiveness, the 3rd factor was activeness, the 4th factor was feminine, the 5th factor was charming and 6th factor was a figural element. Decorativeness and attractiveness factors in visual evaluation of sleeve types were the most important level. 2. The visual evaluation differences of sleeve types in set-in sleeve were as follows; in the 1st factor, S and P2 were the most decorative sleeve type. in the 2nd factor, S, P2 and P3 are the most attractive sleeve type. in the 3rd factor, B and P3 were the most active sleeve type. in the 4th factor, L was the most feminine sleeve type. in the 5th factor, P1, L and P3 were charming sleeve type. in the 6th factor, P3 was evaluated that it shows narrowened shoulder sleeve types. 3. The analysis result of preference and wearing level in each sleeve types were as follows. 20's female university students like to wear S, P1, P2 and P3 sleeve types and the most favorite sleeve types are S, P2 and P3. 4. The analysis result of silhouette set-in sleeve in sleeve types; S, B and P2 in H-type silhouette, P2, S and P1 in A-type silhouette, B and P3 in O-type silhouette, L and P3 in X-types silhouette were show the most suitable sleeve types.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.341-355
• /
• 2003

The fuzzification of ${\bigotimes}-closed$ set is considered, and its basic properties we investigated. Characterizations of fuazzy ${\bigotimes}-closed$ set we given. Using a collection of ${\bigotimes}-closed$ sets with additional conditions, a fuzzy ${\bigotimes}-closed$ set is stated. The theory of fuzzy topological ${\bigotimes}-closed$ sets is discussed.

• Communications of the Korean Mathematical Society
• /
• v.21 no.3
• /
• pp.429-432
• /
• 2006

We use Cauchy's functional equation to construct a new non-measurable set which is a (vector) subspace of \mathbb{R}$ and is of a codimensiion 1, considering \mathbb{R}$, the set of real numbers, as a vector space over a field \mathbb{Q}$ of rational numbers. Moreover, we show that \mathbb{R}$ can be partitioned into a countable family of disjoint non-measurable subsets.