• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.163-172
• /
• 2022

The purpose of this study is to investigate the changes in the number of repetitions and the repetition rate according to the exercise mode when performing 65%1RM resistance exercise at the 1-minute rest interval and the 3-minute rest interval. Sixteen healthy male subjects were treated with Bench press and Biceps curl of 65%1RM intensity at 1 and 3 minute rest intervals. The number of repetitions for each set of 1 minute rest interval showed a significant decrease from 1set to 5set in bench press. biceps curl showed a significant decrease from 1set to 4set. The repetition rate according to the exercise mode with a 1-minute rest interval showed a significant difference from 2sets to 4sets. In the repetition rate for each set, bench press showed a significant decrease from 1set to 5set. biceps curl showed a significant decrease from set 1 to set 4. The number of repetitions according to the exercise mode with a 3-minute rest interval showed a significant difference from 2sets to 5sets. In the number of repetitions for each set, bench press showed a significant decrease from 1set to 5set. biceps curl showed a significant decrease from 1set to 4set. The repetition rate according to the exercise mode with a 3-minute rest interval showed a significant difference from 2sets to 5sets. In the repetition rate for each set, bench press showed a significant decrease from 1 set to 5 sets. biceps curl showed a significant decrease from 1set to 4set. In summary, the decrease in the number of repetitions according to the set progression in the resistance exercise of the endurance depends on the exercise mode, and the increase of the rest interval or the decrease of the weight-intensity should be considered when aiming for more exercise.

• Journal of the military operations research society of Korea
• /
• v.8 no.1
• /
• pp.53-70
• /
• 1982

This thesis develops a more realistic and applicable new set covering model that is adjusted and supplied by the existing set covering models, and induces an algorithm for solving the new set covering model, and applies the new model and the algorithm to an actual set covering problems. The new set covering model introduces a probabilistic covering aistance ($0{\eqslantless}p{\eqslantless}1$)or time($0{\eqslantless}p{\eqslantless}1$) instead of a deterministic covering distance(0 or 1) or time (0 or 1) of the existing set covering model. The existing set covering model has not considered the merit of the overcover of customers. But this new set covering model leads a concept of this overcover to a concept of the parallel system reliability. The algorithm has been programmed on the UNIVAC 9030 for solving large-scale covering problems. An application of the new set covering model is presented in order to determine the locations of the air surveillance radars as a set covering problem for a case-study.

• Journal of Life Science
• /
• v.27 no.10
• /
• pp.1104-1110
• /
• 2017

SET1A is a histone H3K4 methyltransferase that catalyzes di- and trimethylation of histone H3 at lysine 4 (H3K4). Mono-, di-, and trimethylations on H3K4 (H3K4me1, H3K4me2, and H3K4me3, respectively) are generally correlated with gene activation. Although H3K4 methylation is associated with the stimulation of adipogenesis of 3T3-L1 preadipocytes, it remains unknown whether SET1A plays a role in the regulation of adipogenesis of 3T3-L1 preadipocytes. Here, we investigated whether SET1A regulates 3T3-L1 preadipocytes' adipogenesis and characterized the mechanism involved in this regulation. SET1A expression increased during 3T3-L1 preadipocytes' adipogenesis. Consistent with the increased SET1A expression, the global H3K4me3 level had also increased on day 2 after the induction of adipogenesis in 3T3-L1 adipocytes. SET1A knockdown using siRNA in 3T3-L1 preadipocytes inhibited 3T3-L1 preadipocytes' adipogenesis, as assessed by Oil Red O staining and the expression of adipogenic genes, indicating that SET1A stimulates the adipogenesis of 3T3-L1 preadipocytes. SET1A knockdown inhibited the cell proliferation of 3T3-L1 cells during mitotic clonal expansion (MCE) via down-regulation of the cell cycle gene cyclin E1, as well as the DNA synthesis gene, dihydrofolate reductase. Furthermore, SET1A knockdown repressed peroxisome proliferator-activated receptor gamma ($PPAR{\gamma}$) expression during the late stage of adipogenesis. These results indicate that SET1A stimulates MCE and $PPAR{\gamma}$ expression, which leads to the promotion of 3T3-L1 preadipocytes' adipogenesis.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.1
• /
• pp.29-38
• /
• 2015

We compute the Hausdorff and packing dimensions of the cylindrical lower or upper local dimension set for a self-similar measure having different minimum and maximum of the local dimension on a self-similar set satisfying the open set condition.

• Journal of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1059-1079
• /
• 2021

We show that given any chain transitive set of a C¹ generic diffeomorphism f, if a diffeomorphism f has the eventual shadowing property on the locally maximal chain transitive set, then it is hyperbolic. Moreover, given any chain transitive set of a C¹ generic vector field X, if a vector field X has the eventual shadowing property on the locally maximal chain transitive set, then the chain transitive set does not contain a singular point and it is hyperbolic. We apply our results to conservative systems (volume-preserving diffeomorphisms and divergence-free vector fields).

• The Pure and Applied Mathematics
• /
• v.14 no.1 s.35
• /
• pp.1-5
• /
• 2007

We study the topological magnitude of a special subset from the distribution subsets in a self-similar Cantor set. The special subset whose every element has no accumulation point of a frequency sequence as some number related to the similarity dimension of the self-similar Cantor set is of the first category in the self-similar Cantor set.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.237-245
• /
• 2006

The set S of distinct scores (outdegrees) of the vertices of a k-partite tournament T($X_l,\;X_2, ..., X_k$) is called its score set. In this paper, we prove that every set of n non-negative integers, except {0} and {0, 1}, is a score set of some 3-partite tournament. We also prove that every set of n non-negative integers is a score set of some k-partite tournament for every $n{\ge}k{\ge}2$.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.687-700
• /
• 1994

Throughout this paper we will let H denote the complete Heyting algebra ($H, \vee, \wedge, *$) with order reversing involution *. 0 and 1 denote the supermum and the infimum of $\emptyset$, respectively. Given any set X, any element of $H^X$ is called H-fuzzy set (or, simply f.set) in X and will be denoted by small Greek letters, such as $\mu, \nu, \rho, \sigma$. $H^X$ inherits a structure of H with order reversing involution in natural way, by definding $\vee, \wedge, *$ pointwise (sam notations of H are usual). If $f$ is a map from a set X to a set Y and $\mu \in H^Y$, then $f^{-1}(\mu)$ is the f.set in X defined by f^{-1}(\mu)(x) = \mu(f(x))$. Also for $\sigma \in H^X, f(\sigma)$ is the f.set in Y defined by $f(\sigma)(y) = sup{\sigma(x) : f(x) = y}$ ([4]). A preorder R on a set X is reflexive and transitive relation on X, the pair (X,R) is called preordered set. A map $f$ from a preordered set (X, R) to another one (Y,T) is said to be preorder preserving (inverting) if for $x,y \in X, xRy$ implies $f(x)T f(y) (resp. f(y)Tf(x))$. For the terminology and notation, we refer to [10, 11, 13] for category theory and [7] for H-fuzzy semitopogenous spaces.

• Korean Journal of Microbiology
• /
• v.53 no.4
• /
• pp.286-291
• /
• 2017

In eukaryotic cells, histone modification is an important mechanism to regulate the chromatin structure. The methylation of the fourth lysine on histone H3 (H3K4) by Set1 complex is one of the various well-known histone modifications. Set1 complex has seven subunits including Swd2, which is known to be important for H2B ubiquitination dependent on H3K4 methylation. Swd2 was reported to regulate Set1's methyltransferase activity by binding to near RNA recognition motif (RRM) domain of Set1 and to act as a component of CPF (Cleavage and Polyadenylation Factors) complex involved in RNA 3' end processing. According to the recent reports, two functions of Swd2 work independently of each other and the lethality of Swd2 knockout strain was known to be caused by its function as a component of CPF complex. In this study, we found that Swd2 could influence the Set1's stability as well as histone methyltransferase activity through the association with RRM domain of Set1. Also, we found that ${\Delta}swd2$ mutant bearing truncated-Set1, which cannot interact with Swd2, lost its lethality and grew normally. These results suggest that the dual functions of Swd2 in H3K4 methylation and RNA 3' end processing are not independent in Saccharomyces cerevisiae.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.1-12
• /
• 2021

A dominating set S of a graph G is said to be nonsplit dominating set if the subgraph ⟨V - S⟩ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by ��ns(G). For a minimum nonsplit dominating set S of G, a set T ⊆ S is called a forcing subset for S if S is the unique ��ns-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing nonsplit domination number of S, denoted by f��ns(S), is the cardinality of a minimum forcing subset of S. The forcing nonsplit domination number of G, denoted by f��ns(G) is defined by f��ns(G) = min{f��ns(S)}, where the minimum is taken over all ��ns-sets S in G. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers a and b with 0 ≤ a ≤ b and b ≥ 1, there exists a connected graph G such that f��ns(G) = a and ��ns(G) = b. It is shown that, for every integer a ≥ 0, there exists a connected graph G with f��(G) = f��ns(G) = a, where f��(G) is the forcing domination number of the graph. Also, it is shown that, for every pair a, b of integers with a ≥ 0 and b ≥ 0 there exists a connected graph G such that f��(G) = a and f��ns(G) = b.