• Title/Summary/Keyword: IF domain

Search Result 892, Processing Time 0.026 seconds

CNC Tool Path Planning for Free-Form Sculptured Surface with a New Tool Path Interval Algorithm (새로운 공구경로간격 알고리듬을 이용한 자유곡면에서의 CNC 공구경로 계획)

  • Lee, Sung-Gun;Yang, Seung-Han
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.6
    • /
    • pp.43-49
    • /
    • 2001
  • A reduced machining time and increased accuracy for the sculptured surface are very important when producing complicated parts. The step-size and tool-path interval are essential components in high speed and high resolution machining. If they are small, the machining time will increase, whereas if they are large, rough surfaces will be caused. In particular, the machining time, which is key in high speed machining, is affected by the tool-path interval more than the step-size. The conventional method for calculating the tool=path interval is to select a small parametric increment of a small increment based on the curvature of the surface. However, this approach also has limitations. The first is that the tool-path interval can not be calculated precisely. The second is that a separate tool-path interval needs to be calculated in each of the three cases. The third is that the conversion from Cartesian domain to parametric domain or vice versa must be necessary. Accordingly, the current study proposes a new tool-path interval algorithm that do not involve a curvature and that is not necessary for any conversion and a variable step-size algorithm for NURBS.

  • PDF

EXTINCTION AND NON-EXTINCTION OF SOLUTIONS TO A FAST DIFFUSIVE p-LAPLACE EQUATION WITH A NONLOCAL SOURCE

  • Han, Yuzhu;Gao, Wenjie;Li, Haixia
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.1
    • /
    • pp.55-66
    • /
    • 2014
  • In this paper, the authors establish the conditions for the extinction of solutions, in finite time, of the fast diffusive p-Laplace equation $u_t=div({\mid}{\nabla}u{\mid}^{p-2}{\nabla}u)+a{\int}_{\Omega}u^q(y,t)dy$, 1 < p < 2, in a bounded domain ${\Omega}{\subset}R^N$ with $N{\geq}1$. More precisely, it is shown that if q > p-1, any solution vanishes in finite time when the initial datum or the coefficient a or the Lebesgue measure of the domain is small, and if 0 < q < p-1, there exists a solution which is positive in ${\Omega}$ for all t > 0. For the critical case q = p-1, whether the solutions vanish in finite time or not depends crucially on the value of $a{\mu}$, where ${\mu}{\int}_{\Omega}{\phi}^{p-1}(x)dx$ and ${\phi}$ is the unique positive solution of the elliptic problem -div(${\mid}{\nabla}{\phi}{\mid}^{p-2}{\nabla}{\phi}$) = 1, $x{\in}{\Omega}$; ${\phi}(x)$=0, $x{\in}{\partial}{\Omega}$. This is a main difference between equations with local and nonlocal sources.

Delay Determination of Cyclic Delay Diversity for Multi-user Scheduling in OFDMA Systems (OFDMA 시스템의 다중 사용자 스케줄링을 위한 순환지연 다이버시티의 지연값 결정)

  • Rim, Min-Joong;Hur, Seong-Ho;Song, Hyun-Joo;Lim, Dae-Woon;Jeong, Byung-Jang;Noh, Tae-Gyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.248-255
    • /
    • 2008
  • In an OFDMA system the performance of multi-user scheduling in the frequency domain is affected by the frequency selectivity of the channel. If the channel is too flat in the frequency domain, the multi-user scheduling gain might be degraded. On the contrary, if the frequency selectivity is too high and the magnitude of the frequency response severely fluctuates on the allocation bandwidth, it is also hard to get sufficient scheduling gain. For maximizing the multi-user scheduling gain, a cyclic delay diversity technique can be used to adjust the frequency selectivity of the channel. This paper proposes a method to determine the optimal delay value of cyclic delay diversity according to the allocation bandwidth and the channel characteristics.

Noise reduction method using a variance map of the phase differences in digital holographic microscopy

  • Hyun-Woo Kim;Myungjin Cho;Min-Chul Lee
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.131-137
    • /
    • 2023
  • The phase reconstruction process in digital holographic microscopy involves a trade-off between the phase error and the high-spatial-frequency components. In this reconstruction process, if the narrow region of the sideband is windowed in the Fourier domain, the phase error from the DC component will be reduced, but the high-spatial-frequency components will be lost. However, if the wide region is windowed, the 3D profile will include the high-spatial-frequency components, but the phase error will increase. To solve this trade-off, we propose the high-variance pixel averaging method, which uses the variance map of the reconstructed depth profiles of the windowed sidebands of different sizes in the Fourier domain to classify the phase error and the high-spatial-frequency components. Our proposed method calculates the average of the high-variance pixels because they include the noise from the DC component. In addition, for the nonaveraged pixels, the reconstructed phase data created by the spatial frequency components of the widest window are used to include the high-spatialfrequency components. We explain the mathematical algorithm of our proposed method and compare it with conventional methods to verify its advantages.

ON GRAPHS ASSOCIATED WITH MODULES OVER COMMUTATIVE RINGS

  • Pirzada, Shariefuddin;Raja, Rameez
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.5
    • /
    • pp.1167-1182
    • /
    • 2016
  • Let M be an R-module, where R is a commutative ring with identity 1 and let G(V,E) be a graph. In this paper, we study the graphs associated with modules over commutative rings. We associate three simple graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ to M called full annihilating, semi-annihilating and star-annihilating graph. When M is finite over R, we investigate metric dimensions in $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$. We show that M over R is finite if and only if the metric dimension of the graph $ann_f({\Gamma}(M_R))$ is finite. We further show that the graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ are empty if and only if M is a prime-multiplication-like R-module. We investigate the case when M is a free R-module, where R is an integral domain and show that the graphs $ann_f({\Gamma}(M_R))$, $ann_s({\Gamma}(M_R))$ and $ann_t({\Gamma}(M_R))$ are empty if and only if $$M{\sim_=}R$$. Finally, we characterize all the non-simple weakly virtually divisible modules M for which Ann(M) is a prime ideal and Soc(M) = 0.

A Study on Intention Exchange-based Ship Collision Avoidance by Changing the Safety Domain

  • Kim, Donggyun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.3
    • /
    • pp.259-268
    • /
    • 2019
  • Even if only two ships are encountered, a collision may occur due to the mistaken judgment of the positional relationship. In other words, if an officer does not know a target ship's intention, there is always a risk of collision. In this paper, the experiments are conducted to investigate how the intention affects the action of collision avoidance in cooperative and non-cooperative situations. In non-cooperative situation, each ship chooses a course that minimizes costs based on the current situation. That is, it always performs a selfish selection. In a cooperative situation, the information is exchanged with a target ship and a course is selected based on this information. Each ship uses the Distributed Stochastic Search Algorithm so that a next-intended course can be selected by a certain probability and determines the course. In the experimental method, four virtual ships are set up to analyze the action of collision avoidance. Then, using the actual AIS data of eight ships in the strait of Dover, I compared and analyzed the action of collision avoidance in cooperative and non-cooperative situations. As a result of the experiment, the ships showed smooth trajectories in the cooperative situation, but the ship in the non-cooperative situation made frequent big changes to avoid a collision. In the case of the experiment using four ships, there was no collision in the cooperative situation regardless of the size of the safety domain, but a collision occurred between the ships when the size of the safety domain increased in cases of non-cooperation. In the case of experiments using eight ships, it was found that there are optimal parameters for collision avoidance. Also, it was possible to grasp the variation of the sailing distance and the costs according to the combination of the parameters, and it was confirmed that the setting of the parameters can have a great influence on collision avoidance among ships.

Inter-Domain Verifiable Self-certified public keys (상이한 도메인에서 검증 가능한 자체 인증 공개키)

  • 정영석;한종수;오수현;원동호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.4
    • /
    • pp.71-84
    • /
    • 2003
  • Self-certified public keys need not be accompanied with a separate certificate to be authenticated by other users because the public keys are computed by both the authority and the user. At this point, verifiable self-certified public keys are proposed that can determine which is wrong signatures or public keys if public keys are used in signature scheme and then verification of signatures does not succeed. To verify these public keys, key generation center's public key trusted by users is required. If all users trust same key generation center, public keys can be verified simply. But among users in different domains, rusty relationship between two key generation centers must be accomplished. In this paper we propose inter-domain verifiable self-certified public keys that can be verified without certificate between users under key generation centers whose trusty relationship is accomplished. Also we present the execution of signature and key distribution between users under key generation centers use different public key parameters.

Suppression of side lobe using distance weight in spectrum of channel signal in medical ultrasound imaging system (의료용 초음파 영상 시스템에서 채널신호의 스펙트럼에서 거리 가중치를 이용한 부엽의 억제)

  • Yu Rim Lee;Mok Kun Jeong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.3
    • /
    • pp.203-213
    • /
    • 2023
  • In medical ultrasound imaging systems, Side lobes may appear if signals outside the imaging point are not completely removed during receive focusing. If the time signal of the side lobe overlaps with the time signal (main lobe) from the image point, it is difficult to completely remove it using filter processing in the time domain. However, In the receive focusing process, when time-channel signals are Fourier-transformed, the main lobe and side lobe signals are spatially separated in the spectral domain. Therefore, the side lobes can be suppressed by multiplying the image with magnitude weights, which are determined by the magnitudes of the main and side lobes calculated in the spectral domain. In addition, when the main lobe and the side lobe spectrum are adjacent, the distance weight was applied based on the distance between them. In a 5 MHz ultrasound imaging system using a 64-channel linear transducer, point reflector and speckle images with cysts of various brightness were synthesized and weights were applied to the ultrasound image. Using computer simulations, we confirmed that the side lobes were greatly reduced without affecting the spatial resolution in the point reflector image, and the contrast was significantly improved in the cyst image with computer simulations.

A Study on National Defense Enterprise Architecture Framework (국방 전군적 아키텍처 프레임워크에 관한 연구)

  • 이태공;김진우
    • Journal of the military operations research society of Korea
    • /
    • v.29 no.2
    • /
    • pp.45-60
    • /
    • 2003
  • As we live in real If era, If become a mandatory component for nations and organizations to survive in severe competition. If is also thought of as strategic asset for effective business operations, yet there is no proved statement on the interoperability and system integration which causes serious problem in terms of requirement engineering among current systems. The National Defense Enterprise Architecture Framework is a strategic information asset base, which define the military operation activities for the mission, the information necessary for military operations, the technologies necessary for implementing new technology in response to changing operational needs. It is an integrated model or representation. Information Systems will be evolved by the National Defense Enterprise Architecture framework. The purpose of this framework is to present overall picture of national defense information system domain so that information systems are interoperated, integrated and information sharing is increased among affiliated organization of Defense Military.

Unique Continuation Property for C Functions

  • CHUNG, Young-Bok
    • Honam Mathematical Journal
    • /
    • v.25 no.1
    • /
    • pp.83-91
    • /
    • 2003
  • We prove a unique continuation theorem for $C^{\infty}$ functions in pseudoconvex domains in ${\mathbb{C}}^{n}$. More specifically, we show that if ${\Omega}$ is a pseudoconvex domain in ${\mathbb{C}}^n$, if f is in $C^{\infty}({\Omega})$ such that for all multi-indexes ${\alpha},{\beta}$ with ${\mid}{\beta}{\mid}{\geq}1$ and for any positive integer k, there exists a positive constant $C_{{\alpha},{\beta},{\kappa}}$ such that $$|{\frac{{\partial}^{{\mid}{\alpha}{\mid}+{\mid}{\beta}{\mid}}f}{{\partial}z^{\alpha}{\partial}{\bar{z}}^{\beta}}{\mid}{\leq}C_{{\alpha},{\beta},{\kappa}}{\mid}f{\mid}^{\kapp}}\;in\;{\Omega}$$, and if there exists $z_0{\in}{\Omega}$ such that f vanishes to infinite order at $z_0$, then f is identically zero. We also have a sharp result for the case of strongly pseudoconvex domains.

  • PDF