• Bulletin of the Korean Chemical Society
• /
• 제17권7호
• /
• pp.648-653
• /
• 1996

We have shown several examples of characterization of multicomponent polymer systems by size exclusion chromatography coupled with a light scattering detector. Although SEC cannot provide a complete information for such systems due to its intrinsic limitation, one can extend its capability by combining multiple detection in order to get relevant information to some extent.

• 한국정보처리학회논문지
• /
• 제5권11호
• /
• pp.2855-2861
• /
• 1998

선거는 분산 컴퓨팅에서 기본적인 문제에 해당한다. $f{\le}{\llcorner}(n-1/2){\lrcorner}$ 일때 우리는 한 노드에 연결된 최대 f링크를 가지는 네트워크에서 n개의 노드를 고려한다. 보통 지도자를 선거로 뽑거나, 최대 인식자을 찾거나, 스패닝 츄리를 구성하는 것은 메시지 복잡도가 같은 차수를 가지기 때문에 동일 문제의 범주에 속한다. 본 논문은 스패닝 츄리를 이용하여 간헐 링크 고자이 있는 비동기 완전 네트워크에서 지도자 선거 알고리즘을 위한 복잡도의 낮은 경계가 $O(n^3)$ 임을 증명한다.

• 한국정보처리학회논문지
• /
• 제4권1호
• /
• pp.161-166
• /
• 1997

블럭세계는 인공지능연구에서 대표적인 문제영역인 바 지금까지 많은 계획자들이 제안되어 이용되어 왔다. Gupta 블럭세계에서의 교착상태를 정의하였으며, 이로 인하 여 블럭세계의 의사결정문제는 NP-Complete임을 밝혔다. 본 연구에서는 블럭세계에서 의 교착상태 성질을 분석하였으며, Gupta의 비결정적 알고리즘을 휴리스틱하게 접근 하여 블럭세계에 대한 계획자에 이용가능하게 하였다.

• 교육시설 논문지
• /
• 제19권5호
• /
• pp.37-43
• /
• 2012

Results of experiments conducted in university-based design studio suggests that Building information Modeling invites the adoption of a dramatically different design process, traditional design process and BIM-aided design process. Experiment method is used the actual experiment by students. In contrast to traditional design process rooted in successive refinement of abstractions and dependence on tacit knowledge, the studio BIM-aided design process depends on a complete and comprehensive date base and alterative solutions by complete analysis for helping choice of finial result. BIM viewed as provocateur of design education provides great potential for the critical analysis of how architectural design is taught. The results reflect new ways of teaching and addressing BIM methods and process in the design studio project.

• International Journal of Control, Automation, and Systems
• /
• 제4권4호
• /
• pp.486-494
• /
• 2006

In this paper, we present the complete isotropy analysis of a caster wheeled omnidirectional mobile robot (COMR) with nonredundant/redundant actuation. It is desirable for robust motion control to keep a COMR close to the isotropy but away from the singularity as much as possible. First, with the characteristic length introduced, the kinematic model of a COMR is obtained based on the orthogonal decomposition of the wheel velocities. Second, a general form of the isotropy conditions of a COMR is given in terms of physically meaningful vector quantities which specify the wheel configuration. Third, for all possible nonredundant and redundant actuation sets, the algebraic expressions of the isotropy conditions are derived so as to identify the isotropic configurations of a COMR. Fourth, the number of the isotropic configurations, the isotropic characteristic length, and the optimal initial configuration are discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2356-2361
• /
• 2005

In this paper, we present a complete isotropy analysis of a caster wheeled omnidirectional mobile robot(COMR) with nonredundant/redundant actuation. The motivation of this work is that the omnidirectional mobility loses significance in motion control unless the isotropy characteristics is maintained well. First, with the characteristic length introduced, the kinematic model of a COMR is obtained based on the orthogonal decomposition of the wheel velocities. Second, a general form of the isotropy conditions of a COMR is given in terms of physically meaningful vector quantities which describe the wheel configurations. Third, for all possible nonredundant and redundant actuation sets, the algebraic expressions of the isotropy conditions are derived to completely identify the isotropic configurations of a COMR. Fourth, the number of the isotropic configurations and the characteristic length required for the isotropy are discussed.

• 한국컴퓨터정보학회논문지
• /
• 제21권4호
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제21권7호
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• Biotechnology and Bioprocess Engineering:BBE
• /
• 제5권3호
• /
• pp.159-163
• /
• 2000

The genome sequencing project has generated and will contitute to generate enormous amounts of sequence data. Since the first complete genome sequence of bacterium Haemophilus in fluenzae was published in 1995, the complete genome sequences of 2 eukaryotic and about 22 prokaryotic organisms have detemined. Given this everincreasing amounts of sequence information, new strategies are necessary to efficiently pursue the phase of the geome project- the elucidation of gene expression patterns and gene product function on a whole genome scale. In order to assign functional information to the genome sequence, DNA chip technology was developed to efficienfly identify the differential expression pattern of indepondent biogical samples. DNA chip provides a new tool for genome expreesion analysis that may revolutionize revolutionize many aspects of human kife including mew surg discovery and human disease diagnostics.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (중)
• /
• pp.911-914
• /
• 2003

D-DoS 공격을 차단하기 위해서는 AS 경계 라우터에 필터 설치가 필요하며, 이는 최소한의 라우터에 필터를 설치하기 위해 VC(Vertex Cover)를 찾아내는 NP-complete 문제로 귀결된다. 따라서 실제 AS 망구성의 특성을 이용해 이에 적합한 VC 근사기법을 찾아내는 알고리즘을 제안한다. 실험 결과, 제안된 알고리즘(Improved 'Approximated VC')은 기존의 'Approximated VC'에 의해 필요한 노드수의 26%를 줄였다.