• 제목/요약/키워드: SET1A

검색결과 14,372건 처리시간 0.035초

Machining Tool Path Generation for Point Set

  • Park, Se-Youn;Shin, Ha-Yong
    • International Journal of CAD/CAM
    • /
    • 제8권1호
    • /
    • pp.45-53
    • /
    • 2009
  • As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

Efficient Exercise Volume Analysis through Number of Repetitions and EMG Response of Agonist Muscle During the Bench Press

  • Kim, Ki Hong
    • Medical Lasers
    • /
    • 제10권4호
    • /
    • pp.220-228
    • /
    • 2021
  • Background and Objectives In designing a resistance exercise program, intensity, rest, and exercise volume are important. Many studies have been conducted to find the most suitable resistance exercise program incorporating the above, and in particular, many prior studies have been conducted on intensity. This study attempted to determine the effective volume of exercise by analyzing the number of repetitions performed at intensities of 65% one-repetition maximum (1RM) and 75% 1RM during the bench press exercise, and the electromyography (EMG) response of the agonist muscle. Materials and Methods Eight males in their 20s were selected as study subjects and they performed five sets of bench presses at two levels of intensity (65% 1RM, 75% 1RM). The following results were obtained by measuring the number of repetitions and the EMG response according to the exercise intensity and sets during the workout. Results First, the number of repetitions showed a sharp drop from the first set to the third set at 65% 1RM intensity and showed no change in the fourth and fifth sets. At 75% 1RM intensity, the intensity of hypertrophy showed a gradual decrease from the first set to the fifth set. Second, at 75% 1RM exercise intensity, the pectoralis major, anterior deltoid and triceps brachii showed high muscle activity, and the activity of the anterior deltoid continued to increase from the first set to the fourth set at 65% 1RM intensity, and from the first set to the fifth set at 75% 1RM. Conclusion It was found that during the bench press exercise, three minutes of rest at 75% 1RM intensity, five sets of five sets, one minute rest at 65% 1RM intensity, and three sets of the exercise were effective.

MP2 Basis Set Limit Binding Energy Estimates of Hydrogen-bonded Complexes from Extrapolation-oriented Basis Sets

  • Park, Young-Choon;Lee, Jae-Shin
    • Bulletin of the Korean Chemical Society
    • /
    • 제28권3호
    • /
    • pp.386-390
    • /
    • 2007
  • By use of a simple two-point extrapolation scheme estimating the correlation energies of the molecules along with the basis sets specifically targeted for extrapolation, we have shown that the MP2 basis set limit binding energies of large hydrogen-bonded complexes can be accurately predicted with relatively small amount of computational cost. The basis sets employed for computation and extrapolation consist of the smallest correlation consistent basis set cc-pVDZ and another basis set made of the cc-pVDZ set plus highest angular momentum polarization functions from the cc-pVTZ set, both of which were then augmented by diffuse functions centered on the heavy atoms except hydrogen in the complex. The correlation energy extrapolation formula takes the (X+1)-3 form with X corresponding to 2.0 for the cc-pVDZ set and 2.3 for the other basis set. The estimated MP2 basis set limit binding energies for water hexamer, hydrogen fluoride pentamer, alaninewater, phenol-water, and guanine-cytosine base pair complexes of nucleic acid by this method are 45.2(45.9), 36.1(37.5), 10.9(10.7), 7.1(6.9), and 27.6(27.7) kcal/mol, respectively, with the values in parentheses representing the reference basis set limit values. A comparison with the DFT results by B3LYP method clearly manifests the effectiveness and accuracy of this method in the study of large hydrogen-bonded complexes.

Single-Electron Logic Cells and SET/FET Hybrid Integrated Circuits

  • Kim, S.J.;Lee, C.K.;Lee, J.U.;Choi, S.J.;Hwang, J.H.;Lee, S.E.;Choi, J.B.;Park, K.S.;Lee, W.H.;Paik, I.B.;Kang, J.S.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제6권1호
    • /
    • pp.52-58
    • /
    • 2006
  • Single-electron transistor (SET)-based logic cells and SET/FET hybrid integrated circuits have been fabricated on SOI chips. The input-output voltage transfer characteristic of the SET-based complementary logic cell shows an inverting behavior where the output voltage gain is estimated to be about 1.2 at 4.2K. The SET/FET output driver, consisting of one SET and three FETs, yields a high voltage gain of 13 and power amplification with a wide-range output window for driving next circuit. Finally, the SET/FET literal gate for a multi-valued logic cell, comprising of an SET, an FET and a constant-current load, displays a periodic voltage output of high/low level multiple switching with a swing as high as 200mV. The multiple switching functionality of all the fabricated logic circuits could be enhanced by utilizing a side gate incorporated to each SET component to enable the phase control of Coulomb oscillations, which is one of the unique characteristics of the SET-based logic circuits.

A New Variational Level Set Evolving Algorithm for Image Segmentation

  • Fei, Yang;Park, Jong-Won
    • Journal of Information Processing Systems
    • /
    • 제5권1호
    • /
    • pp.1-4
    • /
    • 2009
  • Level set methods are the numerical techniques for tracking interfaces and shapes. They have been successfully used in image segmentation. A new variational level set evolving algorithm without re-initialization is presented in this paper. It consists of an internal energy term that penalizes deviations of the level set function from a signed distance function, and an external energy term that drives the motion of the zero level set toward the desired image feature. This algorithm can be easily implemented using a simple finite difference scheme. Meanwhile, not only can the initial contour can be shown anywhere in the image, but the interior contours can also be automatically detected.

HAUSDORFF DIMENSION OF DERANGED CANTOR SET WITHOUT SOME BOUNDEDNESS CONDITION

  • Baek, In-Soo
    • 대한수학회논문집
    • /
    • 제19권1호
    • /
    • pp.113-117
    • /
    • 2004
  • A deranged Cantor set (without the uniform bounded-ness condition away from zero of contraction ratios) whose weak local dimensions for all points coincide has its Hausdorff dimension of the same value of weak local dimension. We will show it using an energy theory instead of Frostman's density lemma which was used for the case of the deranged Cantor set with the uniform boundedness condition of contraction ratios. In the end, we will give an example of such a deranged Cantor set.

A NOTE ON WEAK EXCLUDED MIDDLE LAW

  • Chanyoung Sung
    • 충청수학회지
    • /
    • 제36권1호
    • /
    • pp.9-11
    • /
    • 2023
  • Intuitionistic Zermelo-Fraenkel (IZF) set theory is a set theory without the axiom of choice and the law of excluded middle (LEM). The weak excluded middle law (WEM) states that ¬𝜑∨¬¬𝜑 for any formula 𝜑. In IZF we show that LEM is equivalent to WEM plus the condition that any set not equal to the empty set has an element.

AN ESCAPE CRITERION FOR THE COMPLEX POLYNOMIAL, WITH APPLICATIONS TO THE DEGREE-n BIFURCATION SET

  • Kim, Young Ik
    • 충청수학회지
    • /
    • 제16권1호
    • /
    • pp.7-14
    • /
    • 2003
  • Let $P_c(z)=z^n+c$ be a complex polynomial with an integer $n{\geq}2$. We derive a criterion that the critical orbit of $P_c$ escapes to infinity and investigate its applications to the degree-n bifurcation set. The intersection of the degree-n bifurcation set with the real line as well as with a typical symmetric axis is explicitly written as a function of n. A well-defined escape-time algorithm is also included for the improved construction of the degree-n bifurcation set.

  • PDF

AN EXTENSION OF SOFT ROUGH FUZZY SETS

  • Beg, Ismat;Rashid, Tabasam
    • Korean Journal of Mathematics
    • /
    • 제25권1호
    • /
    • pp.71-85
    • /
    • 2017
  • This paper introduces a novel extension of soft rough fuzzy set so-called modified soft rough fuzzy set model in which new lower and upper approximation operators are presented together their related properties that are also investigated. Eventually it is shown that these new models of approximations are finer than previous ones developed by using soft rough fuzzy sets.

복수 최단 경로의 새로운 해법에 관한 연구 (A Study on a new Algorithm for K Shortest Paths Problem)

  • 장병만
    • 경영과학
    • /
    • 제25권2호
    • /
    • pp.81-88
    • /
    • 2008
  • This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.