• 제목/요약/키워드: Space Sequence

검색결과 960건 처리시간 0.037초

격자다면체 부피에 대한 역사적 고찰 및 그 응용 - 수열 단원에의 응용 - (Historical review and it's application on the volume of lattice polyhedron - Focused on sequence chapter -)

  • 김향숙;하형수
    • 한국수학사학회지
    • /
    • 제23권2호
    • /
    • pp.101-121
    • /
    • 2010
  • 본 연구는 격자평면에서의 Pick의 정리에 대한 의의와 증명소개, Pick의 정리를 확장한 3차원 격자다면체에서의 Reeve의 정리 및 n차원 격자다면체로 일반화시킨 Ehrhart 다항식에 대한 소개와 역사적 고찰을 바탕으로 이를 고등학교 교육과정에서 다루고 있는 수열단원에 응용하기위해, Reeve의 정리를 이용하여 3차원 격자다면체의 격자점의 개수와 부피와의 관계를 제시하고, 나아가 Pick의 정리와 Ehrhart 다항식을 적용하여 수열의 합을 구하는 공식들을 새로운 증명법으로 도출하고자 한다.

식혜(食醯) 생산(生産)라인의 공정(工程)/배치(配置) 설계(設計)에 대한 사례 연구 (A Case Study for a Process/Layout Design of a Sikhye Production Line)

  • 양문희
    • 산업공학
    • /
    • 제16권4호
    • /
    • pp.450-462
    • /
    • 2003
  • In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

An interactive and iterative control panel layout

  • 박성준;정의승;조항준
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.103-111
    • /
    • 1994
  • An interactive and iterative design method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound layout of a control panel. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constraints, and generate an optimal or, at least, a "satisfactory" solution through iterative interactions with the designer. The existing panel design and layout methods are mostly based on the optimization of single objective function formulated to reflect and trade off all ergonomic design objectives which are largely different in their nature. In fact, the problem of seeking an ergonomically sound panel design should be viewed as a multiple objective optimization problem. Furthermore, most of the design objectives should be understood as constraints rather than objectives to be optimized. Hence, a constraint satisfaction approach is proposed in this study as a framework for the panel designer to search through the design decision space effectively and make various design decisions iteratively. In order to apply the constraint satisfaction approach to the panel design procedure, the ergonomic principles such as frequency-of-use, importance, functional grouping, and sequence-of-use are formalized as CSP terms. With this formalization, a prototype system was implemented and applied to panel layout problems. The results clearly showed the effectiveness of the proposed approach since it permits designers to consider and iteratively evaluate various design constraints and ergonomic principles, and, therefore, aids the panel designer to come up with an ergonomically sound control panel layout.

Thermostable Xylanase Encoded by xynA of Streptomyces thermocyaneoviolaceus: Cloning, Purification, Characterization and Production of Xylooligosaccharides

  • CHOI JUN-HO;LEE OH-SEUK;SHIN JAE-HO;KWAK YUN-YOUNG;KIM YOUNG-MOG;RHEE IN-KOO
    • Journal of Microbiology and Biotechnology
    • /
    • 제16권1호
    • /
    • pp.57-63
    • /
    • 2006
  • We have cloned a xylanase gene (xynA) from Streptomyces thermocyaneoviolaceus. The deduced amino acid sequences of the XynA, including the active site sequences of glycosyl hydrolase family 10, showed high sequence homology with several xylanases assigned in this category. The XynA was overexpressed under an IPTG inducible T7 promoter control in E. coli BLR(DE3). The overproduced enzymes were excreted into culture supernatants and periplasmic space. The purified XynA had an apparent molecular mass of near 54 kDa, which corresponds to the molecular mass calculated from its gene. The optimum pH and temperature of the purified XynA were determined to be 5.0 and $65^{\circ}C$, respectively. The XynA retained over $90\%$ its activity after the heat treatment at $65^{\circ}C$ for 30 min. The XynA was highly efficient in producing xylose (X1), xylobiose (X2), xylotriose (X3), and xylotetraose (X4) from xylan.

문자의 빈도수를 고려한 Rank/Select 자료구조 구현 (Implementation of Rank/Select Data Structure using Alphabet Frequency)

  • 권유진;이선호;박근수
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제36권4호
    • /
    • pp.283-290
    • /
    • 2009
  • Rank/select 자료구조는 트리, 그래프, 문자열 인덱스 등의 다양한 자료구조를 간결하게 표현하는 기본 도구이다. Rank/select 자료구조는 주어진 문자열에 어느 위치까지 나타난 문자 개수를 세는 연산을 처리한다. 효율적인 rank/select 자료구조를 위해 이론적인 압축 방식들이 제안되었으나, 실제 구현에 있어 연산 시간 및 저장 공간의 효율을 보장할 수 없었다. 본 논문은 간단한 방법으로 이론적인 압축 크기를 보장하면서 연산 시간도 효율적인 rank/select 자료구조 구현 방법을 제시한다. 본 논문의 실험을 통해, 복잡한 인코딩 방법 없이도 이론적인 nH$_0$ + O(n) 비트 크기에 근접하면서 기존의 HSS 자료구조보다 빠른 rank/select 연산을 지원하는 구현 방법임을 보인다.

STRONG CONVERGENCE OF PATHS FOR NONEXPANSIVE SEMIGROUPS IN BANACH SPACES

  • Kang, Shin Min;Cho, Sun Young;Kwun, Young Chel
    • Korean Journal of Mathematics
    • /
    • 제19권3호
    • /
    • pp.279-289
    • /
    • 2011
  • Let E be a uniformly convex Banach space with a uniformly Gateaux differentiable norm, C be a nonempty closed convex subset of E and f : $C{\rightarrow}C$ be a fixed bounded continuous strong pseudocontraction with the coefficient ${\alpha}{\in}(0,1)$. Let $\{{\lambda}_t\}_{0<t<1}$ be a net of positive real numbers such that ${\lim}_{t{\rightarrow}0}{\lambda}_t={\infty}$ and S = {$T(s)$ : $0{\leq}s$ < ${\infty}$} be a nonexpansive semigroup on C such that $F(S){\neq}{\emptyset}$, where F(S) denotes the set of fixed points of the semigroup. Then sequence {$x_t$} defined by $x_t=tf(x_t)+(1-t)\frac{1}{{\lambda}_t}{\int_{0}}^{{\lambda}_t}T(s)x{_t}ds$ converges strongly as $t{\rightarrow}0$ to $\bar{x}{\in}F(S)$, which solves the following variational inequality ${\langle}(f-I)\bar{x},\;p-\bar{x}{\rangle}{\leq}0$ for all $p{\in}F(S)$.

Image Encryption Based on Quadruple Encryption using Henon and Circle Chaotic Maps

  • Hanchinamani, Gururaj;Kulkarni, Linganagouda
    • Journal of Multimedia Information System
    • /
    • 제2권2호
    • /
    • pp.193-206
    • /
    • 2015
  • In this paper a new approach for image encryption based on quadruple encryption with dual chaotic maps is proposed. The encryption process is performed with quadruple encryption by invoking the encrypt and decrypt routines with different keys in the sequence EDEE. The decryption process is performed in the reverse direction DDED. The key generation for the quadruple encryption is achieved with a 1D Circle map. The chaotic values for the encrypt and decrypt routines are generated by using a 2D Henon map. The Encrypt routine E is composed of three stages i.e. permutation, pixel value rotation and diffusion. The permutation is achieved by: row and column scrambling with chaotic values, exchanging the lower and the upper principal and secondary diagonal elements based on the chaotic values. The second stage circularly rotates all the pixel values based on the chaotic values. The last stage performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. The security and performance of the proposed scheme are assessed thoroughly by using the key space, statistical, differential, entropy and performance analysis. The proposed scheme is computationally fast with security intact.

MIMO Capacity, Level Crossing Rates and Fades: The Impact of Spatial/Temporal Channel Correlation

  • Giorgetti, Andrea;Smith, Peter J.;Shafi, Mansoor;Chiani, Marco
    • Journal of Communications and Networks
    • /
    • 제5권2호
    • /
    • pp.104-115
    • /
    • 2003
  • It is well known that Multiple Input Multiple Output (MIMO) systems offer the promise of achieving very high spectrum efficiencies (many tens of bit/s/Hz) in a mobile environment. The gains in MIMO capacity are sensitive to the presence of spatial and temporal correlation introduced by the radio environment. In this paper, we examine how MIMO capacity is influenced by a number of factors e.g., a) temporal correlation b) various combinations of low/high spatial correlations at either end, c) combined spatial and temporal correlations. In all cases, we compare the channel capacity that would be achievable under independent fading. We investigate the behaviour of "capacity fades," examine how often the capacity experiences the fades, develop a method to determine level crossing rates and average fade durations and relate these to antenna numbers. We also evaluate the influence of channel correlation on the capacity autocorrelation and assess the fit of a Gaussian random process to the temporal capacity sequence. Finally we note that the particular spatial correlation structure of the MIMO channel is influenced by a large number of factors. For simplicity, it is desirable to use a single overall correlation measure which parameterizes the effect of correlation on capacity. We verify this single parameter concept by simulating a large number of different spatially correlated channels.

산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망 (A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field)

  • 김종만;김원섭;김영민;황종선;박현철
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF

태권도 돌려차기 시 분절들의 반동동작 (Countermovement of the Segments During the Tae-kwon-do Roundhouse Kicking)

  • 황인승;이성철;임정
    • 한국운동역학회지
    • /
    • 제14권2호
    • /
    • pp.139-152
    • /
    • 2004
  • Two subjects, an expert and a novice, were carefully selected based upon their foot speed. Three dimensional videography was used in the assessment of roundhouse kicking of the Tae-kwon-Do. The local reference frames were imbedded at the trunk, pelvis, thigh and shank. Anatomical angular displacement at the joints were measured by projecting the upper segment's local axes to the lower segment's local reference planes. The local axes again projected to the global reference frames and absolved each segment's movement. The peaks of the anatomical angular displacement curve assessed as the countermovements and the angular movements of the segments in the global space absolved in light of the occurrence of the countermovements. The expert showed larger and more countermovements than the novice at the all segments. The counterrnovement occured more clearly at the trunk than the hip and knee joint and during the preparative movement phase. These countermovements occurrence were due to either by turning upper or lower segments and controlled by the turning direction and sequence of the two nearby segments. It was revealed that the countermovements of the trunk during the preparative movement phase was the important factor of the power kicking.