• 충청수학회지
• /
• 제24권2호
• /
• pp.313-317
• /
• 2011

In this article, we consider an unbounded minimal graph $M{\subset}R^3$ which is contained in a slab. Assume that ${\partial}M$ consists of two Jordan curves lying in parallel planes, which is symmetric with the reflection under a plane. If the asymptotic behavior of M is also symmetric in some sense, then we prove that the minimal graph is itself symmetric along the same plane.

• 한국정보통신학회논문지
• /
• 제20권3호
• /
• pp.549-557
• /
• 2016

효과적인 시각화는 일반적으로 대용량의 디버깅 정보와 프로그램의 추상적 수행모델을 표현하는 것이 중요하다. 본 논문에서는 스레드들간의 논리적 병행성 관계를 나타내는 부분순서 수행그래프를 이용하여 내포병렬성과 임계구역을 가진 OpenMP 병렬 프로그램의 수행양상과 경합정보의 효과적 디버깅을 위해서 효과적으로 제공하는 추상적 시각화 도구를 제안한다. 본 도구는 수행중 추적선택 기법으로 시각화 정보를 위한 공간적 복잡성을 줄이고, 추적된 시각화 정보에 프로그램의 내포병렬성과 임계구역 동기화를 위한 그래프 추상화를 제공하여 시각적 복잡성을 해결한다. 그래프 추상화를 통한 스레드들간의 부분순서 관계와 경합탐지 정보는 프로그램의 제어흐름과 경합의 위치를 구조적으로 파악할 수 있게 하므로 프로그램 수행의 이해와 경합 탐지 및 수정에 효과적이다.

• 자원환경지질
• /
• 제33권4호
• /
• pp.249-260
• /
• 2000

한국 남부에서 섭입 해구의 방향과 나란히 쌍으로 발달한 화산대가 발견된다. 경상분지와 영동-광주 함몰대의 화산암류는 거의 나란한 양상을 보이며, 이들은 각각 동일한 섭입 체계에 따르는 첫 번째 화산대, 두 번째 화산대이다. 경상분지와 영동-광주 함몰대 화산암류의 불호정성 원소 함량은 호를 가로지르는 변화를 뚜렷하게 보인다. 즉, 첫 번째 화산대 (경상분지 및 남해안 도서지역)용암들의 불호정성 원소 함량은 두 번째 화산대 (영동-광주 함몰대)에 비해 더욱 결핍되며 두 번째 화산대에서 더욱 증가하는 경향을 보인다. 이와 같이 호를 가로지르는 변화를 보이는 것은, 탈수과정 동안 유체상과 공존하는 고체상의 차이에 기인한 것으로 보인다. 두 번째 화산대의 불호정성 원소의 함량, Zr/Y 비, Rb/K 비는 첫 번째 화산대에 비해 더 깊은 깊이에서 더 적은 정도의 부분 용융, 그리고 용융 과정에서의 잔류 석류석에 기인할 것이다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2737-2742
• /
• 2003

Kinematic calibration enhances absolute accuracy by compensating for the fabrication tolerances and installation errors. Effectiveness of calibration procedures depends greatly on the measurements performed. While the Cartesian postures are measured completely, all of the geometric parameters can be identified to their true values. With partial pose measurements, however, few geometric parameters may not be identifiable and effectiveness of the calibration results may vary significantly within the workspace. QR decomposition of the identification Jacobian matrix can reveal the non-identifiable parameters. Selecting postures for measurement is also an important issue for efficient calibration procedure. Typically, the condition number of the identification Jacobian is minimized to find optimum postures. This paper investigates identifiable parameters and optimum postures for four different calibration procedures - measuring postures completely with inverse kinematic residuals, measuring postures completely with forward kinematics residuals, measuring only the three position components, and restraining the mobility of the end-effector using a constraint link. The study is performed for a six degree-of-freedom fully parallel HexaSlide type paralle manipulator, HSM. Results verify that all parameters are identifiable with complete posture measurements. For the case of position measurements, one and for the case of constraint link, three parameters were found non-identifiable. Optimal postures showed the same trend of orienting themselves on the boundaries of the search space.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2011년도 제37회 추계학술대회논문집
• /
• pp.830-834
• /
• 2011

본 연구에서는 액체로켓엔진의 터보펌프용 초음속 터빈 로터 블레이드에 스윕 각도 ${\pm}15^{\circ}$를 적용하여 전방스윕(FSW), 후방스윕(BSW)모델의 유동형태 및 성능을 기준모델(NSW)과 비교하여 스윕 적용의 효과를 살펴보았다. 3차원 Navier-Stokes 유동해석에는 상용 코드인 FLUENT 6.3 Parallel을 사용하였다. BSW 모델은 기준 모델(NSW)에 비해 팁 간극으로 빠져나가는 누설 손실량을 줄이는데 효과가 있었고 정효율 증가에도 영향을 미쳤다.

• Korean Journal of Mathematics
• /
• 제16권2호
• /
• pp.215-231
• /
• 2008

Let E be a uniformly convex Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm, C a nonempty closed convex subset of E, and $T:C{\rightarrow}{\mathcal{K}}(E)$ a multivalued nonself-mapping such that $P_T$ is nonexpansive, where $P_T(x)=\{u_x{\in}Tx:{\parallel}x-u_x{\parallel}=d(x,Tx)\}$. For $f:C{\rightarrow}C$ a contraction and $t{\in}(0,1)$, let $x_t$ be a fixed point of a contraction $S_t:C{\rightarrow}{\mathcal{K}}(E)$, defined by $S_tx:=tP_T(x)+(1-t)f(x)$, $x{\in}C$. It is proved that if C is a nonexpansive retract of E and $\{x_t\}$ is bounded, then the strong ${\lim}_{t{\rightarrow}1}x_t$ exists and belongs to the fixed point set of T. Moreover, we study the strong convergence of $\{x_t\}$ with the weak inwardness condition on T in a reflexive Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm. Our results provide a partial answer to Jung's question.

• 한국세라믹학회지
• /
• 제30권9호
• /
• pp.717-722
• /
• 1993

Effects of microstructures on the electrical properties of ZrO2 based ceramics were analyzed by modeling layer arrangements and mixed phase structures. Single layers and alternating multilayers were made from 3mol% and 8mol% Y2O3 doped ZrO2 powders, while mixed specimen was made by blending and compacting these raw powders. After sintering at 150$0^{\circ}C$ for 2hr in air, AC impedance characteristics were measured. Contributiion of bulk comonent to total resistivity and its temperature-dependence were larger in 8Y-ZrO2 single layer than in 3Y-ZrO2 single layer. The multilayered specimen connected in serial to electrodes showed partial characteristics of both 3Y-ZrO2 and 8Y-ZrO2 single layers. The multilayered specimen connected in parallel to electrodes and the mixed specimen exhibited characteristics mainly of 8Y-ZrO2 single layer. The multilayered specimen connected in parallel to electrodes revealed the highest electrical conductivity near the operating temperature of solid oxide fuel cell. However, it is expected that the mixed specimen is appropriate for the applications because of its relatively high electrical conductivity with high strength expected.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.77-91
• /
• 2007

In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

• 전자공학회논문지C
• /
• 제36C권3호
• /
• pp.17-25
• /
• 1999

본 논문에서는 기존의 bit-serial 방식 곱셈기 및 나눗셈기의 하드웨어 부담을 줄이고 동일한 연산 사이 클 수를 갖는 새로운 bit-serial 방식의 곱셈기 및 나눗셈기 아키텍쳐를 제안한다. 제안하는 bit-serial 곱셈 및 나눗셈기 아키텍쳐는 부분곱 또는 부분나머지를 구하기 위해 레지스터 및 가감산기의 비트 수를 2배 확장하지 않기 때문에 기존의 아키텍쳐에 비해 하드웨어의 부담을 줄였다. 또한 덧셈/뺄셈과 Shift 연산을 동시에 수행하므로써 {{{{ { N}_{ } }}}} 비트 곱셈 및 나눗셈 연산에 각각 ,{{{{ { N}_{ } }}}},{{{{ { N}_{ } }}}}＋ 2 사이클을 소모하며 이는 기존의 아키텍쳐와 동일한 연산 사이클 수를 지원한다. 제안하는 bit-serial 곱셈기 및 나눗셈기 아키텍쳐는 SliM Image Processor에 적용하여 실제 칩으로 구현하였으며 그 성능을 입증하였다.