• 제목/요약/키워드: sequence number

검색결과 1,753건 처리시간 0.025초

AN APPLICATION OF MARKOV'S EXTENDED INTERVAL ARITHMETIC TO INTERVAL-VALUED SEQUENCE SPACES: A SPECIAL EXAMPLE

  • MEHMET SENGONUL
    • Journal of Applied and Pure Mathematics
    • /
    • 제6권3_4호
    • /
    • pp.105-117
    • /
    • 2024
  • In the classical sense, it is known that it is impossible to construct a vector space over the entire set of real numbers with the help of simple interval arithmetic. In this article, it has shown that a vector space can be constructed in the classical sense by helping Markov's extended interval arithmetic on the interval valued Cesaro sequence spaces of non-absolute type. As a result of the positive answers, this idea was extended by us with some theorems. Consequently, a new perspective was gained to the construction of new types of sequence spaces by using different algebraic operations on interval-valued sequence spaces.

View Scalability를 고려한 다시점 동영상 코덱 (Multiview Video Sequence CODEC with View Scalability)

  • 임정은;손광훈
    • 방송공학회논문지
    • /
    • 제9권3호
    • /
    • pp.236-245
    • /
    • 2004
  • 본 논문에서는 view scalability를 고려한 3차원 다시점 동영상 코덱을 제안한다. 다시점 동영상을 효율적으로 부호화하기 위하여 부호화의 기본 단위로는 GGOP (Group of GOP) 구조를 제안하며 그 GGOP 구조는 시점의 수와 카메라 사이의 베이스 라인의 간격에 따라 유동적으로 여러 가지 타입을 가질 수 있다 제안된 다시점 동영상 부호기는 전처리, 변이 추정/보상, 움직임 추정/보상, 차영상 부호화, 비트율 제어로 구성되며 다시점 동영상 비트열을 생성하게 된다. MPEG-2와의 호환성을 위하여 기준이 되는 동영상은 MPEG-2로 부호화를 수행하여 메인 비트열을 생성하였고, 나머지 시점들에 해당되는 동영상들은 변이 벡터 및 움직임 벡터를 이용하여 보조 비트열을 생성하여 복호단에 전송된다. 다시점 동영상 복호기는 메인 비트열을 복호하기 위한 MPEG-2 복호기와 보조 비트열을 복호하기 위한 복호기로 구성된다. 또한, 수신단에서 보유하고 있는 디스플레이의 특징에 따라 원하는 시점만을 선택하여 복호화를 가능하게 할 수 있는 view scalability 기능을 제안한다. 실험을 통하여 제안한 다시점 동영상 코덱의 GGOP 구조의 유동성, MPEG-2와의 호환성, view scalability의 성능을 확인하였다. 또한 view scalability로 원하는 시점만을 복원한 3차원 동영상을 여러 종류의 3차원 다시점 모니터에 디스플레이를 하여 주관적인 성능을 확인하였다

Molecular Cloning and Determination of the Nucleotide Sequence of Raw Starch Digesting α-Amylase from Aspergillus awamori KT-11

  • Matsubara, Takayoshi;Ammar, Youssef Ben;Anindyawati, Trisanti;Yamamoto, Satoru;Ito, Kazuo;Iizuka, Masaru;Minamiura, Noshi
    • BMB Reports
    • /
    • 제37권4호
    • /
    • pp.429-438
    • /
    • 2004
  • Complementary DNAs encoding $\alpha$-amylases (Amyl I, Amyl III) and glucoamylase (GA I) were cloned from Aspergillus awamori KT-11 and their nucleotide sequences were determined. The sequence of Amyl III that was a raw starch digesting $\alpha$-amylase was found to consist of a 1,902 bp open reading frame encoding 634 amino acids. The signal peptide of the enzyme was composed of 21 amino acids. On the other hand, the sequence of Amyl I, which cannot act on raw starch, consisted of a 1,500 bp ORF encoding 499 amino acids. The signal peptide of the enzyme was composed of 21 amino acids. The sequence of GA I consisted of a 1,920 bp ORF that encoded 639 amino acids. The signal peptide was composed of 24 amino acids. The amino acid sequence of Amyl III from the N-terminus to the amino acid number 499 showed 63.3% homology with Amyl I. However, the amino acid sequence from the amino acid number 501 to C-terminus, including the raw-starch-affinity site and the TS region rich in threonine and serine, showed 66.9% homology with GA I.

프로세서의 수가 한정되어있는 병렬계산모델에서 유전알고리즘을 이용한 스케쥴링해법 (A Scheduling Method on Parallel Computation Models with Limited Number of Processors Using Genetic Algorithms)

  • 성기석;박지혁
    • 한국경영과학회지
    • /
    • 제23권2호
    • /
    • pp.15-27
    • /
    • 1998
  • In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

  • PDF

오프라인 매장에서 고객 순번 관리를 위한 스마트 시스템 (A Smart System for Customer Ordering Management at Offline Stores)

  • 정명범
    • 한국멀티미디어학회논문지
    • /
    • 제21권8호
    • /
    • pp.925-933
    • /
    • 2018
  • In this paper, we propose a new smart ordering application system for granting the customer numbers. The proposed system assigns sequence number of customers who visit at offline store as using speaker and microphone of smart device. This system has more advantage than the existing ordering system. Because the proposed system does not need any customer information like as phone number or SNS ID, it can protect customer privacy information. In this system, we use high frequency which is inaudible to the human ear as communication signal between speaker and microphone. To confirm performance evaluation, we perform a test with ten smart devices like as iPhone 6, 7, 8, Galaxy s8 and the result shown a success rate of 98.7 percent. Therefore, the proposed system can be useful service technology at the various offline store which need to assign a sequence number for customers, because many customers visit at the store.

점열 곡선의 꼬임을 효율적으로 찾는 알고리즘 (An efficient polygonal chian inersection algorithm)

  • 박상철;신하용;최병규
    • 한국CDE학회논문집
    • /
    • 제4권3호
    • /
    • pp.190-199
    • /
    • 1999
  • Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

  • PDF

THE WEAK LAW OF LARGE NUMBER FOR NORMED WEIGHTED SUMS OF STOCHASTICALLY DOMINATED AND PAIRWISE NEGATIVELY QUADRANT DEPENDENT RANDOM VARIABLES

  • KIM, TAE-SUNG;CHOI, JEONG-YEOL;KIM, HYUN-CHUL
    • 호남수학학술지
    • /
    • 제21권1호
    • /
    • pp.149-156
    • /
    • 1999
  • Let $\{X_n,\;n{\geq}1\}$ be a sequence of pairwise negative quadrant dependent (NQD) random variables which are stochastically dominated by X. Let $\{a_n,\;n{\geq}1\}$ and $\{b_n,\;n{\geq}1\}$ be sequences of constants such that $a_n>0$ and $0. In this note a weak law of large number of the form $({\sum}_{j=1}^na_jX_j-{\nu}_n)/b_n\rightarrow\limits^p0$ is established, where $\{{\nu}_n,\;n{\geq}1\}$ is a suitable sequence.

  • PDF

Nucleotide and Deduced Amino Acid Sequences of Rat Myosin Binding Protein H (MyBP-H)

  • Jung, Jae-Hoon;Oh, Ji-Hyun;Lee, Kyung-Lim
    • Archives of Pharmacal Research
    • /
    • 제21권6호
    • /
    • pp.712-717
    • /
    • 1998
  • The complete nucleotide sequence of the cDNA clone encoding rat skeletal muscle myosin- binding protein H (MyBP-H) was determined and amino acid sequence was deduced from the nucleotide sequence (GenBank accession number AF077338). The full-length cDNA of 1782 base pairs(bp) contains a single open reading frame of 1454 bp encoding a rat MyBP-H protein of the predicted molecular mass 52.7kDa and includes the common consensus 1CA__TG' protein binding motif. The cDNA sequence of rat MyBP-H show 92%, 84% and 41% homology with those of mouse, human and chicken, respectively. The protein contains tandem internal motifs array (-FN III-Ig C2-FN III- Ig C2-) in the C-terminal region which resembles to the immunoglobulin superfamily C2 and fibronectin type III motifs. The amino acid sequence of the C-terminal Ig C2 was highly conserved among MyBPs family and other thick filament binding proteins, suggesting that the C-terminal Ig C2 might play an important role in its function. All proteins belonging to MyBP-H member contains `RKPS` sequence which is assumed to be cAMP- and cGMP-dependent protein kinase A phosphorylation site. Computer analysis of the primary sequence of rat MyBP-H predicted 11 protein kinase C (PKC)phosphorylation site, 7 casein kinase II (CK2) phosphorylation site and 4N-myristoylation site.

  • PDF

누에 RFLP(제한단편 다형현상)마커 개발 (Development of Restriction Fragment Length Polymorphism(RELP) Markers in Silkworm, Bombyx mori)

  • 고승주;김태산;이영승;황재삼;이상몽
    • 한국응용곤충학회지
    • /
    • 제36권1호
    • /
    • pp.96-104
    • /
    • 1997
  • DNA 다형성을 이용한 누에 유전자 해석기술을 개발하기 위하여 광식성 누에 계통 J111과 비광식성계통 $C_3$의 DNA를 분리하여 유전자 은행을 제작하였다. 누에 유전자 은행은 genomic DNA를 EcoRI로 절단한후 pUC18에 ligation 시켜 DH5$\alpha$ E. coli에 형질전환 시켰다. 형질전환 후 얻어진 colony는 15개 누에 품종의 genomic DNA에 hybridization하였을 때 누에의 품종에 관계없이 highly repetitive, moderately repetitive 및 single 혹은 low copy number 로 구분되었다. RFLP마커에 적합한 single 및 low-copy number band만을 형성하는 colony probe을 신속하게 선발하고자 colony또는 genomic DNA로 hybridization하였다. Single 및 low-copy number의 특성을 가진 219개의 clone을 선발하여 Hind III등 8종의 제한효소별로 처리한 genomic DNA를 이용하여 다형성을 검정하여 J111과 $C_3$ 계통간 다형성을 보인 46개의 clone을 선발하였다. 선발된 clone의 일부를 J111과 $C_3$를 교배하여 얻은 $F_2$의 blot에 hybridization 결과 RFLP clone들이 양친검정에 이용가능하여 누에 RFLP 연관 지도 작성의 기반을 조성하게 되었다.

  • PDF

Genotyping of avian pathogenic Escherichia coli by DNA fragment analysis for the differences in simple sequence repeats

  • Han, Mi Na;Byeon, Hyeon Seop;Han, Seong Tae;Jang, Rae Hoon;Kim, Chang Seop;Choi, Seok Hwa
    • 한국동물위생학회지
    • /
    • 제41권4호
    • /
    • pp.257-262
    • /
    • 2018
  • Avian pathogenic E. coli (APEC) causes severe economic losses in the poultry farms, due to systemic infections leading to lethal colisepticemia. It causes a variety of diseases from air sac infection to systemic spread leading to septicemia. Secondary infection contains opportunistic infections due to immunosuppression disease. Collibacillosis causes the great problems in the poultry industry in Korea. Thus, it is necessary to identify and classify the characteristics of E. coli isolate of chicken origin to confirm the diversity of symptoms and whether they are transmitted among the farms. Fragment analysis is identify the difference in the number of Variable-Number Tandem-Repeats (VNTRs) for genotyping. VNTRs have repeating structure (Microsatellite, Short tandem repeats; STR, Simple sequence repeats; SSR) in the chromosome. This region can be used as a genetic marker because of its high mutation rate. And various lengths of the amplified DNA fragment cause the difference in the number of repetition of the DNA specific site. The number of repetition sequences indicates the separated size of fragments, so the each fragments can be distinguished by specific samples. The results of the sample show that there is no difference in six microsatellite loci (yjiD, aidB, molR_1, ftsZ, b1668, yibA). There are differences among the farms in relation of the number of repetitions of other six microsatellite loci (ycgW, yaiN, yiaB, mhpR, b0829, caiF). Four (ycgW, yiaB, b0829, caiF) of these six microsatellite loci show statistically significant differences (P<0.05). It means that the analysis using four microsatellite loci including ycgW, yiaB, b0829, and caiF can confirm among the farms. Five E. coli samples in one farm have same SSR repetition at all markers. But, there are significant differences from other farms at Four (ycgW, yiaB, b0829, caiF) microsatellite loci. These results emphasize again that the four microsatellite loci makes a difference in the amplified DNA fragments, enabling it to be used for E. coli genotyping.