• 제목/요약/키워드: Subspace

검색결과 742건 처리시간 0.023초

HORIZONTAL SUBSPACES IN THE BUNDLE OF LINEAR FRAMES

  • Park, Joon-Sik
    • 호남수학학술지
    • /
    • 제34권4호
    • /
    • pp.513-517
    • /
    • 2012
  • Let L(M) be the bundle of all linear frames over a smooth manifold M, $u$ an arbitrarily given point of L(M), and ${\nabla}:\mathfrak{X}(M){\times}\mathfrak{X}(M){\rightarrow}\mathfrak{X}(M)$ a linear connection on M. Then the following result is well known: the horizontal subspace at the point $u$ may be written in terms of local coordinates of $u{\in}L(M)$ and Christoel's symbols defined by ${\nabla}$. This result is very fundamental on the study of the theory of connections. In this paper we show that the local expression of the horizontal subspace at the point u does not depend on the choice of a local coordinate system around the point $u{\in}L(M)$, which is rarely seen.

Subspace Projection-Based Clustering and Temporal ACRs Mining on MapReduce for Direct Marketing Service

  • Lee, Heon Gyu;Choi, Yong Hoon;Jung, Hoon;Shin, Yong Ho
    • ETRI Journal
    • /
    • 제37권2호
    • /
    • pp.317-327
    • /
    • 2015
  • A reliable analysis of consumer preference from a large amount of purchase data acquired in real time and an accurate customer characterization technique are essential for successful direct marketing campaigns. In this study, an optimal segmentation of post office customers in Korea is performed using a subspace projection-based clustering method to generate an accurate customer characterization from a high-dimensional census dataset. Moreover, a traditional temporal mining method is extended to an algorithm using the MapReduce framework for a consumer preference analysis. The experimental results show that it is possible to use parallel mining through a MapReduce-based algorithm and that the execution time of the algorithm is faster than that of a traditional method.

Homomorphic Subspace MAC Scheme for Secure Network Coding

  • Liu, Guangjun;Wang, Xiao
    • ETRI Journal
    • /
    • 제35권1호
    • /
    • pp.173-176
    • /
    • 2013
  • Existing symmetric cryptography-based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against collusion. This letter presents a novel homomorphic subspace message authentication code (MAC) scheme that can thwart pollution attacks in an efficient way. The basic idea is to exploit the combination of the symmetric cryptography and linear subspace properties of network coding. The proposed scheme can tolerate the compromise of up to r-1 intermediate nodes when r source keys are used. Compared to previous MAC solutions, less secret keys are needed for the source and only one secret key is distributed to each intermediate node.

신호 부공간 기법을 이용한 영상화질 향상 (Image quality enhancement using signal subspace method)

  • 이기승;도원;윤대희
    • 전자공학회논문지B
    • /
    • 제33B권11호
    • /
    • pp.72-82
    • /
    • 1996
  • In this paper, newly developed algorithm for enhancing images corrupted by white gaussian noise is proposed. In the method proposed here, image is subdivided into a number of subblocks, and each block is separated into cimponents corresponding to signal and noise subspaces, respectively through the signal subspace method. A clean signal is then estimated form the signal subspace by the adaptive wiener filtering. The decomposition of noisy signal into noise and signal subspaces in is implemented by eigendecomposition of covariance matrix for noisy image, and by performing blockwise KLT (karhunen loeve transformation) using eigenvector. To reduce the perceptual noise level and distortion, wiener filtering is implementd by adaptively adjusting noise level according to activity characteristics of given block. Simulation results show the effectiveness of proposed method. In particular, edge bluring effects are reduced compared to the previous methods.

  • PDF

Steering the Dynamics within Reduced Space through Quantum Learning Control

  • Kim, Young-Sik
    • Bulletin of the Korean Chemical Society
    • /
    • 제24권6호
    • /
    • pp.744-750
    • /
    • 2003
  • In quantum dynamics of many-body systems, to identify the Hamiltonian becomes more difficult very rapidly as the number of degrees of freedom increases. In order to simplify the dynamics and to deduce dynamically relevant Hamiltonian information, it is desirable to control the dynamics to lie within a reduced space. With a judicious choice for the cost functional, the closed loop optimal control experiments can be manipulated efficiently to steer the dynamics to lie within a subspace of the system eigenstates without requiring any prior detailed knowledge about the system Hamiltonian. The procedure is simulated for optimally controlled population transfer experiments in the system of two degrees of freedom. To show the feasibility of steering the dynamics to lie in a specified subspace, the learning algorithms guiding the dynamics are presented along with frequency filtering. The results demonstrate that the optimal control fields derive the system to the desired target state through the desired subspace.

고유모드 계산을 위한 초기 반복벡터의 효율성 연구 (Investigation of Efficiency of Starting Iteration Vectors for Calculating Natural Modes)

  • 김병완;경조현;홍사영;조석규;이인원
    • 한국소음진동공학회논문집
    • /
    • 제15권1호
    • /
    • pp.112-117
    • /
    • 2005
  • Two modified versions of subspace iteration method using accelerated starting vectors are proposed to efficiently calculate free vibration modes of structures. Proposed methods employ accelerated Lanczos vectors as starting iteration vectors in order to accelerate the convergence of the subspace iteration method. Proposed methods are divided into two forms according to the number of starting vectors. The first method composes 2p starting vectors when the number of required modes is p and the second method uses 1.5p starting vectors. To investigate the efficiency of proposed methods, two numerical examples are presented.

FOURTH ORDER ELLIPTIC BOUNDARY VALUE PROBLEM WITH SQUARE GROWTH NONLINEARITY

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • 제18권3호
    • /
    • pp.323-334
    • /
    • 2010
  • We give a theorem for the existence of at least three solutions for the fourth order elliptic boundary value problem with the square growth variable coefficient nonlinear term. We use the variational reduction method and the critical point theory for the associated functional on the finite dimensional subspace to prove our main result. We investigate the shape of the graph of the associated functional on the finite dimensional subspace, (P.S.) condition and the behavior of the associated functional in the neighborhood of the origin on the finite dimensional reduction subspace.

Identification of 18 flutter derivatives by covariance driven stochastic subspace method

  • Mishra, Shambhu Sharan;Kumar, Krishen;Krishna, Prem
    • Wind and Structures
    • /
    • 제9권2호
    • /
    • pp.159-178
    • /
    • 2006
  • For the slender and flexible cable supported bridges, identification of all the flutter derivatives for the vertical, lateral and torsional motions is essential for its stability investigation. In all, eighteen flutter derivatives may have to be considered, the identification of which using a three degree-of-freedom elastic suspension system has been a challenging task. In this paper, a system identification technique, known as covariance-driven stochastic subspace identification (COV-SSI) technique, has been utilized to extract the flutter derivatives for a typical bridge deck. This method identifies the stochastic state-space model from the covariances of the output-only (stochastic) data. All the eighteen flutter derivatives have been simultaneously extracted from the output response data obtained from wind tunnel test on a 3-DOF elastically suspended bridge deck section-model. Simplicity in model suspension and measurements of only output responses are additional motivating factors for adopting COV-SSI technique. The identified discrete values of flutter derivatives have been approximated by rational functions.

Investigation on efficiency and applicability of subspace iteration method with accelerated starting vectors for calculating natural modes of structures

  • Kim, B.W.;Jung, H.J.;Hong, S.Y.
    • Structural Engineering and Mechanics
    • /
    • 제37권5호
    • /
    • pp.561-573
    • /
    • 2011
  • For efficient calculation of natural modes of structures, a numerical scheme which accelerates convergence of the subspace iteration method by employing accelerated starting Lanczos vectors was proposed in 2005. This paper is an extension of the study. The previous study simply showed feasibility of the proposed method by analyzing structures with smaller degrees of freedom. While, the present study verifies efficiency of the proposed method more rigorously by comparing closeness of conventional and accelerated starting vectors to genuine eigenvectors. This study also analyzes an example structure with larger degrees of freedom and more complex constraints in order to investigate applicability of the proposed method.

A comparative study on the subspace based system identification techniques applied on civil engineering structures

  • Bakir, Pelin Gundes;Alkan, Serhat;Eksioglu, Ender Mete
    • Smart Structures and Systems
    • /
    • 제7권2호
    • /
    • pp.153-167
    • /
    • 2011
  • The Subspace based System Identification Techniques (SSIT) have been very popular within the research circles in the last decade due to their proven superiority over the other existing system identification techniques. For operational (output only) modal analysis, the stochastic SSIT and for operational modal analysis in the presence of exogenous inputs, the combined deterministic stochastic SSIT have been used in the literature. This study compares the application of the two alternative techniques on a typical school building in Istanbul using 100 Monte Carlo simulations. The study clearly shows that the combined deterministic stochastic SSIT performs superior to the stochastic SSIT when the techniques are applied on noisy data from low to mid rise stiff structures.