• International Journal of Internet, Broadcasting and Communication
• /
• 제14권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.

• 한국국방경영분석학회지
• /
• 제8권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.

• 생명과학회지
• /
• 제27권10호
• /
• pp.1104-1110
• /
• 2017

히스톤 H3K4의 메칠화는 3T3-L1의 지방세포의 분화를 촉진하는 것으로 알려져 있으나, 히스톤 H3K4 메칠화 효소인 SET1A가 지방세포 분화를 조절하는지에 대해서는 보고된 바가 없다. 그러므로 본 연구에서는 SET1A의 3T3-L1 지방세포의 분화조절과 기전을 연구하였다. SET1A의 발현은 3T3-L1 지방세포 분화과정에서 증가함을 관찰하였다. 3T3-L1 지방전구세포에서 siRNA을 이용하여 SET1A의 발현을 감소시키면 3T3-L1 지방전구세포의 분화가 억제됨을 관찰하여 SET1A가 3T3-L1 지방전구세포의 분화를 촉진함을 알 수 있었다. 이에 대한 조절기전을 알기 위해, SET1A의 발현을 감소시킨 3T3-L1 지방전구세포의 세포증식을 측정한 결과, 분화 초기 단계인 분화 후 2일 동안 3T3-L1 지방세포의 증식이 감소하였다. 또한 분화 후 7일 동안 지방세포세포 분화 조절인자들의 발현을 측정한 결과, SET1A의 발현을 감소시킨 3T3-L1 지방세포에서 $PPAR{\gamma}$의 발현이 감소하였다. 위와 같은 연구결과를 바탕으로, SET1A는 분화초기단계에서는 mitotic clonal expansion 단계를 촉진하고, 분화후기단계에서는 $PPAR{\gamma}$의 발현을 증가시켜 3T3-L1 지방세포의 분화를 촉진함을 알 수 있었다.

• 충청수학회지
• /
• 제28권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.

• 대한수학회지
• /
• 제58권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).

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제14권1호
• /
• 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
• /
• 제22권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$.

• 대한수학회논문집
• /
• 제9권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.

• 미생물학회지
• /
• 제53권4호
• /
• pp.286-291
• /
• 2017

진핵 세포에서 히스톤의 변형은 크로마틴 구조를 조절하는 데에 있어서 중요한 메커니즘이다. Set1 복합체에 의한 히스톤 H3의 네 번째 라이신 잔기(H3K4)에 발생하는 메틸화는 다양하게 잘 알려져 있는 히스톤 변형 중 하나이다. Set1 complex는 H2B의 유비퀴틴화에 의존적으로 발생하는 H3K4 메틸화에 중요하다고 알려진 Swd2를 포함하여 7개의 소단위 단백질을 가지고 있다. Swd2는 Set1의 RNA recognition motif (RRM) 도메인 근처에 결합하여 Set1의 활성을 조절하고, 또 RNA의 3' 말단 형성에 관여하는 CPF (Cleavage and Polyadenylation Factors) 복합체의 구성성분이라고 보고되었다. 최근 보고들에 따르면, 이런 Swd2의 이중적인 기능이 서로 독립적으로 작용하며, Swd2 결실돌연변이 균주가 살지 못하는 이유가 CPF 복합체의 구성성분으로써의 기능 때문이라고 알려져 있다. 본 연구에서 우리는 Swd2가 Set1의 RRM 도메인에 결합하여 Set1의 활성을 조절할 수 있을 뿐만 아니라, Set1의 안정성에도 영향을 줄 수 있음을 발견하였다. 또 우리는 Swd2가 결합할 수 없는 truncated-Set1을 가지고 있는 ${\Delta}swd2$ 돌연변이가 사멸하지 않고 정상적으로 자라는 것을 관찰하였다. 이런 결과들은 Saccharomyces cerevisiae에서 H3K4 메틸화와 RNA 3' 말단 형성과정에서의 Swd2의 이중적인 기능이 서로 독립적인 것이 아님을 제안하다.

• Korean Journal of Mathematics
• /
• 제29권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.