• 제목/요약/키워드: Solution Representation

검색결과 308건 처리시간 0.024초

지역고유의 상징성을 표현한 공동주택 계획 및 평가 - 경북 김천시를 중심으로 - (Planning and Evaluating Public House with Symbolic Representation Of Regional Feature)

  • 박영미;최정민
    • 한국주거학회:학술대회논문집
    • /
    • 한국주거학회 2008년 추계학술발표대회 논문집
    • /
    • pp.385-390
    • /
    • 2008
  • The residence plan of Korea has been formed with bias for quantitative growth and uniformity failing at obtaining human value. Also, rapid growth brought about severe problems of deteriorated human life and destruction of environment. The solution for these problems is pursued in many directions, but there is short of active plan yet. The residence shall develop into new direction to satisfy the demand by reflecting society and culture as well as residents. This study examines external design with symbolic representation of regional feature as an alternative for uniform residence environment problem. This study will be a basic data upon suggesting the direction for planning high quality residence environment. This study examined the elements which form external space of residence complex, designed plan for external space of residence complex, and examined how to reflect regional feature which is important element of local community and culture on the space plan for residence complex based on the evaluation by local residents centered on Gimcheon-si, Gyeongbuk which just started local specialty by fostering. 'Special Area for Grape Industry.'

  • PDF

System matrix를 사용한 고장진단 전문가 시스템 (A Fault Diagnosis Using System Matrix In Expert System)

  • 심국진;김건중;함완균;추진부;오성헌
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1989년도 하계종합학술대회 논문집
    • /
    • pp.233-236
    • /
    • 1989
  • This paper deals with the expert system using network configuration and input information composed of protective relays and tripped circuit breakers. This system has knowlegebase independent on network dimension because network representation consists of the type of the matrix. Therefore, the knowlege of network representation is simplified, the space of knowlege is reduced, the addition of facts to the knowlege is easy and the expansion of facts is possible. In this paper, the network representation is defined to system matrix. This expert system based on the system matrix diagnoses normal, abnormal operations of protective devices as well as possible fault sections. The brach and bound search technique is used: breadth first technique mixed with depth first technique of primitive PROLOG search technique. This system will be used for real time operations. This expert system obtaines the solution using the pattern matching in working memory without no listing approach for rule control. This paper is written in PROLOG, the A.I. language.

  • PDF

Mobile Web Service Architecture Using Context-store

  • Oh, Sang-Yoon;Aktas, Mehmet;Fox, Geoffrey C.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권5호
    • /
    • pp.836-858
    • /
    • 2010
  • Web Services allow a user to integrate applications from different platforms and languages. Since mobile applications often run on heterogeneous platforms and conditions, Web Service becomes a popular solution for integrating with server applications. However, because of its verbosity, XML based SOAP messaging gives the possible overhead to the less powerful mobile devices. Based on the mobile client's behavior that it usually exchanges messages with Web Service continuously in a session, we design the Handheld Flexible Representation architecture. Our proposed architecture consists of three main components: optimizing message representation by using a data format language (Simple_DFDL), streaming communication channel to reduce latency and the Context-store to store context information of a session as well as redundant parts of the messages. In this paper, we focus on the Context-store and describe the architecture with the Context-store for improving the performance of mobile Web Service messaging. We verify our approach by conducting various evaluations and investigate the performance and scalability of the proposed architecture. The empirical results show that we save 40% of transit time between a client and a service by reducing the message size. In contrast to solutions for a single problem such as the compression or binarization, our architecture addresses the problem at a system level. Thus, by using the Context-store, we expect reliable recovery from the fault condition and enhancing interoperability as well as improving the messaging performance.

자유시점 TV를 위한 다시점 비디오의 계층적 깊이 영상 표현과 H.264 부호화 (Layered Depth Image Representation And H.264 Encoding of Multi-view video For Free viewpoint TV)

  • 신종홍
    • 디지털산업정보학회논문지
    • /
    • 제7권2호
    • /
    • pp.91-100
    • /
    • 2011
  • Free viewpoint TV can provide multi-angle view point images for viewer needs. In the real world, But all angle view point images can not be captured by camera. Only a few any angle view point images are captured by each camera. Group of the captured images is called multi-view image. Therefore free viewpoint TV wants to production of virtual sub angle view point images form captured any angle view point images. Interpolation methods are known of this problem general solution. To product interpolated view point image of correct angle need to depth image of multi-view image. Unfortunately, multi-view video including depth image is necessary to develop a new compression encoding technique for storage and transmission because of a huge amount of data. Layered depth image is an efficient representation method of multi-view video data. This method makes a data structure that is synthesis of multi-view color and depth image. This paper proposed enhanced compression method using layered depth image representation and H.264/AVC video coding technology. In experimental results, confirmed high compression performance and good quality reconstructed image.

유전알고리즘에 기반한 Job Shop 일정계획 기법 (A Genetic Algorithm-based Scheduling Method for Job Shop Scheduling Problem)

  • 박병주;최형림;김현수
    • 경영과학
    • /
    • 제20권1호
    • /
    • pp.51-64
    • /
    • 2003
  • The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

해리엇의 기호주의와 방정식론 (Harriot's Symbolism and the Theory of Equation)

  • 계영희;신경희
    • 한국수학사학회지
    • /
    • 제26권5_6호
    • /
    • pp.355-370
    • /
    • 2013
  • Thomas Harriot has been introduced in middle school textbooks as a great mathematician who created the sign of inequality. This study is about Harriot's symbolism and the theory of equation. Harriot made symbols of mathematical concepts and operations and used the algebraic visual representation which were combinations of symbols. He also stated solving equations in numbers, canonical, and by reduction. His epoch-making inventions of algebraic equation using notation of operation and letters are similar to recent mathematical representation. This study which reveals Harriot's contribution to general and structural approach of mathematical solution shows many developments of algebra in 16th and 17th centuries from Viete to Harriot and from Harriot to Descartes.

유전자 알고리즘을 이용한 비균일 트래픽 환경에서의 셀 최적화 알고리즘 (Network Optimization in the Inhomogeneous Distribution Using Genetic Algorithm Traffic)

  • 박병성;한진규;최용석;조민경;박한규
    • 한국통신학회논문지
    • /
    • 제27권2B호
    • /
    • pp.137-144
    • /
    • 2002
  • 본 논문에서는 유전자 알고리즘의 진화 연산을 이용하여 기지국의 위치와 송신전력을 최적화하는 알고리즘을 구현하였다. 기지국의 위치와 송신 전력을 실수형 파라미터로 정의하며 관련된 유전 연산자를 설계하였다. 최적화의 방향은 커버리지, 송신 전력, 경제성 효율이 고려되도록 다중 목적함수를 제안하였다. 본 논문에서 구현한 알고리즘음 최적 해를 직관적으로 알 수 있는 상황에 적용하여 검증하였으며 비균일 트래픽 분포를 가정한 상황에 대해 목적함수의 가중치에 따라 최적화를 수행하였다.

POSITION VECTOR OF SPACELIKE SLANT HELICES IN MINKOWSKI 3-SPACE

  • Ali, Ahmad T.;Mahmoud, S.R.
    • 호남수학학술지
    • /
    • 제36권2호
    • /
    • pp.233-251
    • /
    • 2014
  • In this paper, position vector of a spacelike slant helix with respect to standard frame are deduced in Minkowski space $E^3_1$. Some new characterizations of a spacelike slant helices are presented. Also, a vector differential equation of third order is constructed to determine position vector of an arbitrary spacelike curve. In terms of solution, we determine the parametric representation of the spacelike slant helices from the intrinsic equations. Thereafter, we apply this method to find the parametric representation of some special spacelike slant helices such as: Salkowski and anti-Salkowski curves.

Finite element modeling of multiplyconnected three-dimensional areas

  • Polatov, Askhad M.;Ikramov, Akhmat M.;Razmukhamedov, Daniyarbek D.
    • Advances in Computational Design
    • /
    • 제5권3호
    • /
    • pp.277-289
    • /
    • 2020
  • This article describes the technology for constructing of a multiply-connected three-dimensional area's finite element representation. Representation of finite-element configuration of an area is described by a discrete set that consist of the number of nodes and elements of the finite-element grid, that are orderly set of nodes' coordinates and numbers of finite elements. Corresponding theorems are given, to prove the correctness of the solution method. The adequacy of multiply-connected area topology's finite element model is shown. The merging of subareas is based on the criterion of boundary nodes' coincidence by establishing a simple hierarchy of volumes, surfaces, lines and points. Renumbering nodes is carried out by the frontal method, where nodes located on the outer edges of the structure are used as the initial front.

Effects of Drilling Degrees of Freedom in the Finite Element Modeling of P- and SV-wave Scattering Problems

  • Kim, Jae-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • 제18권1E호
    • /
    • pp.37-43
    • /
    • 1999
  • This paper deals with a hybrid finite element method for wave scattering problems in infinite domains. Scattering of waves involving complex geometries, in conjunction with infinite domains is modeled by introducing a mathematical boundary within which a finite element representation is employed. On the mathematical boundary, the finite element representation is matched with a known analytical solution in the infinite domain in terms of fields and their derivatives. The derivative continuity is implemented by using a slope constraint. Drilling degrees of freedom at each node of the finite element model are introduced to make the numerical model more sensitive to the transverse component of the elastodynamic field. To verify the effects of drilling degrees freedom and slope constraints individually, reflection of normally incident P and SV waves on a traction free half spaces is considered. For the P-wave incidence, the results indicate that the use of slope constraint is more effective because it suppresses artificial reflection at the mathematical boundary. For the SV-wave case, the use of drilling degrees freedom is more effective by reducing numerical error at irregular frequencies.

  • PDF