• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.032 seconds

Analysis of technological competitiveness and technology-industry linkage structure of Korea, China and Japan utilizing the patent information in the field of biotechnology (생명공학분야 특허정보를 활용한 한.중.일 기술경쟁력 및 기술-산업연계구조 분석)

  • Cho, Sung-Do;Lee, Cheon-Mu;Hyun, Byung-Hwan
    • Journal of Technology Innovation
    • /
    • v.21 no.1
    • /
    • pp.141-163
    • /
    • 2013
  • As the importance of biotechnology has been increased as a growth engine for country, most countries get focused on securing technological competitiveness in the field of biotechnology. Under the fierce global competition, it is very important to identify technological competitiveness of Korea and our neighboring countries in order to carry out effective research and development. Expert opinion survey such as Delphi is mainly conducted to analyze the technological competitiveness, but the method based on experts' intuition may produce different results depending on survey respondents due to the strong subjective inclination. In this study, the patent registered in US was utilized to analyze the technological competitiveness based on objective data. Targeting countries were Korea, China and Japan which were leading nations in the Northeast Asia. As analytical indexes, NP(Number of Patents), CPP(Cites per Patent), PII(Patent Impact Index), TS(Technology Strength), TI(Technology Independence), PFS(Patent Family Size) were used for analysis. Moreover, the industrial linkage with biotechnology was analyzed by matching IPC code of patents with 44 industries. Based on this analysis, technological convergence and utilization were quantified. The findings can be utilized as basic data when policy is established to improve technological competitiveness in the field of biotechnology.

  • PDF

Integration of Motion Compensation Algorithm for Predictive Video Coding (예측 비디오 코딩을 위한 통합 움직임 보상 알고리즘)

  • Eum, Ho-Min;Park, Geun-Soo;Song, Moon-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.85-96
    • /
    • 1999
  • In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

  • PDF

A Robust Algorithm for Tracking Feature Points with Incomplete Trajectories (불완전한 궤적을 고려한 강건한 특징점 추적 알고리즘)

  • Jeong, Jong-Myeon;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.6
    • /
    • pp.25-37
    • /
    • 2000
  • The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

  • PDF

Shoes from Pinet to the Present

  • June, Swann
    • Proceedings of the Korea Society of Costume Conference
    • /
    • 2001.08a
    • /
    • pp.11-13
    • /
    • 2001
  • For those unfamiliar with the shoe world, Pinet (1817-1897) was a contemporary of Worth, the great Parisian couturier. So I look at the glamour shoes and the world of haute couture, and indeed the development of the named designer. That is a concept we are all familiar with now. So it is not easy to comprehend the lack of names for the exquisite work before 1850. Straightway I have to say that the number of noted shoe designers is far fewer than famous dress designers, but I will introduce you to some of them, against the background of contemporary shoe fashions. Franc;ois Pinet was born in the provinces (probably Touraine) in 1817, two years after the end of the Napoleonic Wars. His father, an ex-soldier, settled to shoemaking, a comparatively clean and quiet trade. It had a tradition of literacy, interest in politics, and was known as the gentle craft, which attracted intelligent people. We should presume father would be helped by the family. It was usual for a child to begin by the age of 5-6, tying knots, sweeping up, running errands and gradually learning the job. His mother died 1827, and father 1830 when he was 13, and at the time when exports of French shoes were flooding world markets. He went to live with a master shoemaker, was not well treated, and three years later set out on the tour-de- France. He worked with masters in Tours and Nantes, where he was received as Compagnon Cordonnier Bottier du Devoir as Tourangeau-Ia rose dAmour (a name to prove most appropriate). He went on to Bordeaux, where at 19 he became president of the local branch. In 1841 he went to Paris, and in 1848, revolution year, as delegate for his corporation, he managed to persuade them not to go on strike. By now the shoemakers either ran or worked for huge warehouses, and boots had replaced shoes as the main fashion. In 1855 Pinet at the age of 38 set up his own factory, as the first machines (for sewing just the uppers) were appearing. In 1863 he moved to new ateliers and shop at Rue ParadisPoissoniere 44, employing 120 people on the premises and 700 outworkers. The English Womans Domestic Magazine in 1867 records changes in the boots: the soles are now wider, so that it is no longer necessary to walk on the uppers. There is interest in eastern Europe, the Polonaise boots with rosette of cord and tassels and Bottines Hongroises withtwo rows of buttons, much ornamented. It comments on short dresses, and recommends that the chaussure should correspond to the rest of the toilet. This could already be seen in Pinets boots: tassels and superb flower embroidery on the higher bootleg, which he showed in the Paris Exposition that year. I think his more slender and elegant Pinet heel was also patented then or 1868. I found little evidence for colour-matching: an English fashion plate of 1860 shows emerald green boots with a violetcoloured dress.

  • PDF

Microstructural Characteristics of III-Nitride Layers Grown on Si(110) Substrate by Molecular Beam Epitaxy

  • Kim, Young Heon;Ahn, Sang Jung;Noh, Young-Kyun;Oh, Jae-Eung
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2014.02a
    • /
    • pp.327.1-327.1
    • /
    • 2014
  • Nitrides-on-silicon structures are considered to be an excellent candidate for unique design architectures and creating devices for high-power applications. Therefore, a lot of effort has been concentrating on growing high-quality III-nitrides on Si substrates, mostly Si(111) and Si(001) substrates. However, there are several fundamental problems in the growth of nitride compound semiconductors on silicon. First, the large difference in lattice constants and thermal expansion coefficients will lead to misfit dislocation and stress in the epitaxial films. Second, the growth of polar compounds on a non-polar substrate can lead to antiphase domains or other defective structures. Even though the lattice mismatches are reached to 16.9 % to GaN and 19 % to AlN and a number of dislocations are originated, Si(111) has been selected as the substrate for the epitaxial growth of nitrides because it is always favored due to its three-fold symmetry at the surface, which gives a good rotational matching for the six-fold symmetry of the wurtzite structure of nitrides. Also, Si(001) has been used for the growth of nitrides due to a possible integration of nitride devices with silicon technology despite a four-fold symmetry and a surface reconstruction. Moreover, Si(110), one of surface orientations used in the silicon technology, begins to attract attention as a substrate for the epitaxial growth of nitrides due to an interesting interface structure. In this system, the close lattice match along the [-1100]AlN/[001]Si direction promotes the faster growth along a particular crystal orientation. However, there are insufficient until now on the studies for the growth of nitride compound semiconductors on Si(110) substrate from a microstructural point of view. In this work, the microstructural properties of nitride thin layers grown on Si(110) have been characterized using various TEM techniques. The main purpose of this study was to understand the atomic structure and the strain behavior of III-nitrides grown on Si(110) substrate by molecular beam epitaxy (MBE). Insight gained at the microscopic level regarding how thin layer grows at the interface is essential for the growth of high quality thin films for various applications.

  • PDF

Statistical Analysis of Projection-Based Face Recognition Algorithms (투사에 기초한 얼굴 인식 알고리즘들의 통계적 분석)

  • 문현준;백순화;전병민
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5A
    • /
    • pp.717-725
    • /
    • 2000
  • Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.

  • PDF

The Syllable Type and Token Frequency Effect in Naming Task (명명 과제에서 음절 토큰 및 타입 빈도 효과)

  • Kwon, Youan
    • Korean Journal of Cognitive Science
    • /
    • v.25 no.2
    • /
    • pp.91-107
    • /
    • 2014
  • The syllable frequency effect is defined as the inhibitory effect that words starting with high frequency syllable generate a longer lexical decision latency and a larger error rate than words starting with low frequency syllable do. Researchers agree that the reason of the inhibitory effect is the interference from syllable neighbors sharing a target's first syllable at the lexical level and the degree of the interference effect correlates with the number of syllable neighbors or stronger syllable neighbors which have a higher word frequency. However, although the syllable frequency can be classified as the syllable type and token frequency, previous studies in visual word recognition have used the syllable frequency without the classification. Recently Conrad, Carreiras, & Jacobs (2008) demonstrated that the syllable type frequency might reflect a sub-lexical processing level including matching from letters to syllables and the syllable token frequency might reflect competitions between a target and higher frequency words of syllable neighbors in the whole word lexical processing level. Therefore, the present study investigated their proposals using word naming tasks. Generally word naming tasks are more sensitive to sub-lexical processing. Thus, the present study expected a facilitative effect of high syllable type frequency and a null effect of high syllable token frequency. In Experiment 1, words starting with high syllable type frequency generated a faster naming latency than words starting with low syllable type frequency with holding syllable token frequency of them. In Experiment 2, high syllable token frequency also created a shorter naming time than low syllable token frequency with holding their syllable type frequency. For that reason, we rejected the propose of Conrad et al. and suggested that both type and token syllable frequency could relate to the sub-lexical processing.

A Study on the Basic Mathematical Competency Levels of Freshmen Students in Radiology Department (방사선과 신입생의 기초 수리능력 수준에 대한 연구)

  • Jang, Hyon Chol;Cho, Pyong Kon
    • Journal of the Korean Society of Radiology
    • /
    • v.14 no.2
    • /
    • pp.121-127
    • /
    • 2020
  • The era of the Fourth Industrial Revolution is increasingly demanding mathematical competencies for virtual reality (VR), artificial intelligence (AI) and the like. In this context, this study intended to identify the basic mathematical competency levels of university freshman students in radiology department and to provide basic data thereon. For this, the diagnostic assessment of basic learning competencies for the domain of mathematics was conducted from June 17, 2019 to June 28, 2019 among 78 freshman students of radiology department at S university and D university. As a result, the university students' overall basic mathematical competency levels were diagnosed to be excellent. However, their levels in the sectors of the geometry and vector and the probability and statistics were diagnosed to be moderate, with the mean scores of 2.61 points and 2.64 points, respectively, which were found to be lower than those of the other sections. As for basic mathematical competency levels according to genders, the levels of male students and female students were diagnosed to be excellent, with the mean scores of 17.48 points and 16.29 points, respectively, showing no statistically significant difference (p>0.05). Given the small number of subjects and regional restriction, there might be some limitations in the generalization of the findings of the present study to all university freshman students and all departments. The above results suggest that it is necessary to implement various programs such as student level-based special lectures for enhancing basic mathematical competencies relating to major in order to improve the basic mathematical competencies of freshman students in radiology department, and that it is necessary to increase the students' mathematical competencies by offering major math courses in the curriculum and applying teaching-learning methods matching students' levels.

A Multi-thresholding Approach Improved with Otsu's Method (Otsu의 방법을 개선한 멀티 스래쉬홀딩 방법)

  • Li Zhe-Xue;Kim Sang-Woon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.5 s.311
    • /
    • pp.29-37
    • /
    • 2006
  • Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

Design of Hybrid Parallel Architecture for Fast IP Lookups (고속 IP Lookup을 위한 병렬적인 하이브리드 구조의 설계)

  • 서대식;윤성철;오재석;강성호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.5
    • /
    • pp.345-353
    • /
    • 2003
  • When designing network processors or implementing network equipments such as routers are implemented, IP lookup operations cause the major impact on their performance. As the organization of the IP address becomes simpler, the speed of the IP lookup operations can go faster. However, since the efficient management of IP address is inevitable due to the increasing number of network users, the address organization should become more complex. Therefore, for both IPv4(IP version 4) and IPv6(IP version 6), it is the essential fact that IP lookup operations are difficult and tedious. Lots of researcher for improving the performance of IP lookups have been presented, but the good solution has not been came out. Software approach alleviates the memory usage, but at the same time it si slow in terms of searching speed when performing an IP lookup. Hardware approach, on the other hand, is fast, however, it has disadvantages of producing hardware overheads and high memory usage. In this paper, conventional researches on IP lookups are shown and their advantages and disadvantages are explained. In addition, by mixing two representative structures, a new hybrid parallel architecture for fast IP lookups is proposed. The performance evaluation result shows that the proposed architecture provides better performance and lesser memory usage.