• Title/Summary/Keyword: 순서화

Search Result 1,127, Processing Time 0.034 seconds

Racemization of Optical Active tris-Oxalatocobaltate (III) Ion in Mixed Solvants (혼합용매내에서 광학활성인 tris-Oxalatocobaltate (III) ion의 라세미화에 관한 연구)

  • Dong Jin Lee;Doh Myung Ki
    • Journal of the Korean Chemical Society
    • /
    • v.30 no.4
    • /
    • pp.377-382
    • /
    • 1986
  • Racemic tris-oxalatocobaltate (III) complex ions were optically resolved by an optical active complex, ${\Delta}$-tris-ethylenediamine cobalt (III), and then racemization of ${\bigwedge}-[Co(ox)_3]^{3-}$ obtained was investigated in various mixed solvent such as water-organic solvent (organic solvents=ethanol, iso-propyl alcohol, acetone, and dioxane). The rate of racemization was increased with following order; water < ethanol < acetone < isopropyl alcohol < dioxane; which is the same order for polarizability of organic solvent added. Considering ${\Delta}H^{\neq},\;{\Delta}S^{\neq}$ and above facts for the racemization of ${\bigwedge}-[Co(ox)_3]^{3-}$, it seems to be twist mechanism of plausible mechanisms.

  • PDF

Comparison of several criteria for ordering independent components (독립성분의 순서화 방법 비교)

  • Choi, Eunbin;Cho, Sulim;Park, Mira
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.6
    • /
    • pp.889-899
    • /
    • 2017
  • Independent component analysis is a multivariate approach to separate mixed signals into original signals. It is the most widely used method of blind source separation technique. ICA uses linear transformations such as principal component analysis and factor analysis, but differs in that ICA requires statistical independence and non-Gaussian assumptions of original signals. PCA have a natural ordering based on cumulative proportion of explained variance; howerver, ICA algorithms cannot identify the unique optimal ordering of the components. It is meaningful to set order because major components can be used for further analysis such as clustering and low-dimensional graphs. In this paper, we compare the performance of several criteria to determine the order of the components. Kurtosis, absolute value of kurtosis, negentropy, Kolmogorov-Smirnov statistic and sum of squared coefficients are considered. The criteria are evaluated by their ability to classify known groups. Two types of data are analyzed for illustration.

Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery (인과적 순서 전달을 보장하는 전염형 그룹 통신 알고리즘)

  • Kim Chayoung;Ahn Jinho
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.137-144
    • /
    • 2005
  • Many reliable group communication algorithms were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithms with their strong reliability properties may be unappropriate for large-scale systems. To address this issue, some epidemic-style group communication algorithms were proposed for considerably improving scalability while guaranteeing the reasonably weaker reliability property than the existing ones. The algorithms are all designed for ensuring the atomic order message delivery property. But, some distributed applications such as multimedia systems and collaborative work, may require only the weaker message ordering property, i.e., causal order delivery. This paper proposes an efficient epidemic-style group communication algorithm ensuring causal order delivery to provide the indigenous scalability of the epidemic-style approach.

WT-Heuristics: An Efficient Filter Operator Ordering Technology in Stream Data Environments (WT-Heuristics: 스트림 데이터 환경에서의 효율적인 필터 연산자 순서화 기법)

  • Min, Jun-Ki
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.163-170
    • /
    • 2008
  • Due to the proliferation of the Internet and intranet, a new application domain called stream data processing has emerged. Stream data is real-timely and continuously generated. In this paper, we focus on the processing of stream data whose characteristics vary unpredictably by over time. Particularly, we suggest a method which generates an efficient operator execution order called WT-Heuristics. WT-Heuristics efficiently determines the operator execution order since it considers only two adjacent operators in the operator execution order. Also, our method changes the execution order with respect to the change of data characteristics with minimum overheads.

An Error Control for Media Multi-channel Running on Home Network Environment (홈 네트워크 환경에서 미디어 다중채널을 위한 오류 제어)

  • Ko Eung-Nam
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.161-164
    • /
    • 2006
  • 미디어 데이터는 별도의 채널을 할당하여 채널 별로 단일 미디어 정보를 순서대로 전송 함으로서 동일 미디어 데이터는 순서가 변할 우려는 없다. 그러나 이러한 다채널 방식에서는 미디어간 동기화 문제를 유발 시키는데 수신 측에서는 새로 발생된 데이터의 시작 시점을 서로 맞춤으로서 미디어간 동기화를 실현하였다. 새로운 미디어의 시작 시 항상 제어 데이터를 먼저 전송하여 새로운 미디어 데이터의 생성을 모든 참여자 프로세스에 알린다. 제안하는 오류 제어는 홈 네트워크 환경에서 멀티미디어 응용 개발 프레임워크에서 오류 발생시 오류를 하나의 미디어로 취급하며 멀티미디어 응용 개발 프레임워크에서 다채널 방식을 사용한다.

  • PDF

선형계획법 프로그램의 수치오차보정과 행렬희소도 유지

  • 서용원;김우제;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.09a
    • /
    • pp.363-369
    • /
    • 1995
  • 본 연구에서는 선형계획법 프로그램의 수치오차보정과 행렬희소도 유지를 통하여 수행 속도를 향상시키는 방안에 대해 다룬다. 수치오차를 줄이기 위 해 규모화를 도입하였으며, 계산 과정에서의 상하삼각행렬의 수치오차를 근 사적으로 측정하는 방법을 고려하였다. 기저행렬의 상하분해에 널리 사용되 는 Markowitz 순서화의 효율적인 구현에 대해 연구하였으며, Reid의 기저수 정방법의 효율성에 대해 실험적으로 검토하였다. 또, 행렬의 희소도에 의한 재역산 기준을 수립하여 수행 속도를 개선하였다.

  • PDF

Minimum Deficiency Ordering with the Clique Storage Structure (클릭저장구조에서 최소 부족수 순서화의 효율화)

  • Seol, Tong-Ryeol;Park, Chan-Kyoo;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.407-416
    • /
    • 1998
  • For fast Cholesky factorization, it is most important to reduce the number of nonzero elements by ordering methods. Generally, the minimum deficiency ordering produces less nonzero elements, but it is very slow. We propose an efficient implementation method. The minimum deficiency ordering requires much computations related to adjacent nodes. But, we reduce those computations by using indistinguishable nodes, the clique storage structures, and the explicit storage structures to compute deficiencies.

  • PDF

Synchronization of SMIL Documents using UML Use Case Diagrams and Sequence Diagrams (UML 사용 사례 다이어그램과 순서 다이어그램을 이용한 SMIL 문서 동기화)

  • Chae, Won-Seok;Ha, Yan;Kim, Yong-Sung
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.357-369
    • /
    • 2000
  • SMIL(Synchronized Multimedia integration Language) allows integrating a set of independent multimedia objects into a synchronized multimedia presentation. In this paper, I propose modeling rules, formal models, modeling function and an algorithm for SMIL documents using use case diagram and sequence diagram of UML(Unified Modeling Language), It will be used the use case diagram and collaboration diagram for object-oriented visualizing tool to describe the temporal behavior of the presentation. The main contribution of this paper is that developers of SMIL documents easily generate them using this rules and algorithm. And, the formal models and modeling functions provide an environment for processing object-oriented documents.

  • PDF

Nonparametric procedures based on aligned method and placement for ordered alternatives in randomized block design (랜덤화 블록 모형에서 정렬방법과 위치를 이용한 순서형 대립가설에 대한 비모수 검정법)

  • Kim, Hyosook;Kim, Dongjae
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.4
    • /
    • pp.707-717
    • /
    • 2016
  • Nonparametric procedures in a randomized block design was proposed by Friedman (1937) as a general alternative as well as suggested as a test for ordered alternatives by Page (1963). These methods are used for the rank of treatments in each block. In this paper, we proposed nonparametric procedures using aligned method proposed by Hodges and Lehmann (1962) to reduce among block information and based on placement suggested by Kim (1999) in a randomized block design. We also perform a Monte Carlo study to compare the empirical powers of the proposed procedures and established method.

Low-Complexity Soft-MIMO Detection Algorithm Based on Ordered Parallel Tree-Search Using Efficient Node Insertion (효율적인 노드 삽입을 이용한 순서화된 병렬 트리-탐색 기반 저복잡도 연판정 다중 안테나 검출 알고리즘)

  • Kim, Kilhwan;Park, Jangyong;Kim, Jaeseok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.841-849
    • /
    • 2012
  • This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.