• Educational Technology International
• /
• 제10권1호
• /
• pp.25-40
• /
• 2009

The purpose of this study was to explore procedures and modalities on collaborative visualization processing of text information for developing e-Learning contents. In order to investigate, two research questions were explored: 1) what are procedures on collaborative visualization processing of text information, 2) what kinds of patterns and modalities can be found in each procedure of collaborative visualization of text information. This research method was employed a qualitative research approaches by means of grounded theory. As a result of this research, collaborative visualization processing of text information were emerged six steps: identifying text, analyzing text, exploring visual clues, creating visuals, discussing visuals, elaborating visuals, and creating visuals. Collaborative visualization processing of text information came out the characteristic of systemic and systematic system like spiral sequencing. Also, another result of this study, modalities in collaborative visualization processing of text information was divided two dimensions: individual processing by internal representation, social processing by external representation. This case study suggested that collaborative visualization strategy has full possibility of providing ideal methods for sharing cognitive system or thinking system as using human visual intelligence.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.955-958
• /
• 2003

Nepal is a country of mountains The higher order geodetic points were mostly established on the top of mountains and these points were used for the geodetic network extension. Lower order geodetic control networks were established at different times and used for the surveying and mapping activities of the country.. It has been found that the rate of convergence between north and south borders of Nepal to be 21${\pm}$2 mm each year and the rate translation of Kathmandu to 55${\pm}$3 mm/year to the plates. The most intense deformation in Nepal occurs along the belt of high mountains along its northern border res ulting in a strain contraction rate normal to the Himalayan Arc. This belt is approximately 40 km wide and extends into southern Tibet.( 13). Recently Survey Department of Nepal has lunched a program of strengthening the existing geodetic network of Nepal and re-observed the position of higher order geodetic points by using geodetic GPS receivers to evaluate their position and thus to define the precision of the control points once again. This paper describes the observation procedure and the adjustment results of the existing higher order control network of Nepal established in different time using different types of equipment and techniques; and highlights the observation procedure and the result obtained after the post processing of the GPS observation results. Attempt has been made to give the procedure and identify the methodology for the re observation of existing higher order geodetic points by using GPS receiver and post processing the observed data so that the existing higher order geodetic points are within the given accuracy standard.

• 한국통신학회논문지
• /
• 제30권3C호
• /
• pp.158-166
• /
• 2005

POCS에 근거한 후처리 방식은 블록 결함 제거에 좋은 결과를 보여 주었지만, POCS는 반복적인 과정에 많은 연산을 요구하여 실시간 제약이 있는 실제적인 후처리를 위해서는 구현되기가 어렵다. 본 논문에서는 반복적인 기존의 POCS와 거의 비슷한 성능을 보이면서 계산 양을 획기적으로 감축한 DCT 영역에서의 POCS 방식을 제안한다. DCT 영역에서의 POCS 방식에서는 저역 통과 필터링을 DCT 영역에서 수행하여 역방향 DCT와 순방향 DCT 모듈을 제거하였다. 반복적인 POCS에서의 저역 통과 필터링을 분석하여, k번째 반복 과정에서의 필터링과 동일한 효과를 갖는 k차 저역 통과 필터링을 정의하고, 여기에 해당하는 k차 DCT 영역 POCS를 정의한다. 시뮬레이션 결과는 반복적 과정이 없는 k차 DCT 영역 POCS는 k번 반복적 과정을 거친 기존의 POCS 방식에 비하여 PSNR과 주관적 화질 면에서 거의 비슷한 성능을 보여 주면서, 훨씬 작은 계산 양을 필요로 한다. 본 논문에서 제안하는 DCT 영역에서의 POCS 방식은 실제적인 실시간 동작을 필요로 하는 후처리 구현을 위해서 효과적으로 사용될 수 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.3-6
• /
• 2005

본 논문에서는 Deway order기법을 이용하여 관계형 데이터베이스 환경에서 효율적으로 XML 문서를 저장, 검색, 결과값을 반환하기 위한 XQuery 질의 처리기를 설계하고 구현한다. 우선 첫 번째로 dewey order기법을 이용하여 XML문서를 저장하기 위한 색인 모델을 관계형 데이터 베이스에 설계하고 XML문서를 저장한다. 두 번째로 이를 기반으로 XML 전문검색 언어인 XPath식을 SQL로 변환하는 전체적인 알고리즘을 제시한다. 세 번째로 위에서 변환된 SQL문의 질의 결과값을 처 음에 저장될 당시의 XML문서의 형태와 Text를 그대로 유지하면서 사용자에게 반환하는 알고리즘을 제시한다. 이 부분은 기존의 발표된 논문에서는 좀처럼 보기 드문 내용으로 XQuery에 포함되는 다양 한 형태의 Xpath식을 SQL문으로 변환할 수 있는 정확한 방법 뿐만 아니라 각각 한번의 질의로 얻고 하는 엘리먼트들과 어트리뷰트들을 찾아 XML문서 그대로 출력하는 방법에 초점을 두어 본 논문을 기 술한다. 마지막으로 이를 실제로 구현하고 Test한 결과를 바탕으로 Dewey order기법을 이용하여 XML 색인 모델을 설계 할 경우 SQL문으로 변환하여 질의를 처리하는 측면에서나 질의한 결과값을 XML문서 형태로 반환하는 측면에서나 이 기법을 사용하지 않는 Local order방식보다 성능이 훨씬 우수하다라는 결론을 제시한다.

• 비파괴검사학회지
• /
• 제29권6호
• /
• pp.557-562
• /
• 2009

Abrupt change of cross-section in mechanical parts is one of significant causes of structural fracture. In this paper, a hybrid method is employed to analyze the stress distribution of a discontinuous plate. The plate with an inclined crack is utilized in our experiment and the stress field in the vicinity of crack tip is calculated through isochromatic fringe order of given points. This calculation can be made handy through least-squares method integrated with complex power series representation(Laurent series) implemented on a computer program for high-speed processing. In order to accurately compare calculated results with experimental ones, both of actual and regenerated photoelastic fringe patterns are doubled and sharpened by digital image processing. The experiment results show that regenerated patterns obtained by hybrid method are quite comparable to actual patterns.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2007년도 춘계학술대회A
• /
• pp.1601-1606
• /
• 2007

In order for high strength aluminum alloys to be used in transportation systems and the aerospace industry, excellent mechanical and physical properties are required. In particular, excellent anti-abrasion property is indispensable for parts that require driving force. In general, surface treatment technologies such as high frequency heat treatment, gas solid carburizing, surface rolling, shot peening are used as ways of improving anti-abrasion property. Among various surface treatment technologies, this research chose shot peening processing for Al7075-T6, which is well known as representative high-strength alloy steel. Wear characteristics were compared and analyzed after shot peening processing with shot ball velocities of 40m/s and 70m/s in order to investigate the effects of shot peening processing on wear characteristics.

• Journal of Mechanical Science and Technology
• /
• 제16권5호
• /
• pp.609-618
• /
• 2002

In practical designs, most of the multidisciplinary problems have a large-size and complicate design system. Since multidisciplinary problems have hundreds of analyses and thousands of variables, the grouping of analyses and the order of the analyses in the group affect the speed of the total design cycle. Therefore, it is very important to reorder and regroup the original design processes in order to minimize the total computational cost by decomposing large multidisciplinary problems into several multidisciplinary analysis subsystems (MDASS) and by processing them in parallel. In this study, a new decomposition method is proposed for parallel processing of multidisciplinary design optimization, such as collaborative optimization (CO) and individual discipline feasible (IDF) method. Numerical results for two example problems are presented to show the feasibility of the proposed method.

• 한국레이저가공학회지
• /
• 제10권3호
• /
• pp.11-14
• /
• 2007

A trepanning optics is the optical system which makes focus laser beam rotate and incline to the material processing surface. The trepanning optics is used in order to improve the quality of laser drilling process and control the taper of drilling diameter. In order to make trepanning optics, we can use the eccentricity of lens, scanner using two mirror, dove prism, or wedge. Among these method, in this paper wedge is used for trepanning optics. The wedge trepanning optics has advantage on the high speed of rotation. In this paper, we design the wedge trepanning optics using ray tracing. ements and engine design variables of system to satisfy the customer's requirements.

• International Journal of CAD/CAM
• /
• 제2권1호
• /
• pp.55-67
• /
• 2002

In many areas of industry, it is desirable to have fast and reliable systems in order to quickly obtain suitable solid models for computer- aided analyses. Nevertheless it is well known that the data exchange process between CAD modelers and CAE packages can require significative efforts. This paper presents an approach for geometrical data exchange through triangulated boundary models. The proposed framework is founded on the use of STL file specification as neutral format file. This work is principally focused on data exchange among CAD modelers and FEA packages via STL. The proposed approach involves the definition of a topological structure suitable for the STL representation and the development of algorithms for topology and geometry data processing in order to get a solid model suitable for finite element analysis or other computer aided engineering purposes. Different algorithms for model processing are considered and their pros and cons are discussed. As a case study, a prototype modeler which supports an exporting filter for a commercial CAE package has been implemented.