• Title/Summary/Keyword: binary notation

Search Result 10, Processing Time 0.032 seconds

The Study of the Extension of the Scale of Notation by Analogy and the Notation in History (역사 속의 진법과 유추를 통한 진법의 확장에 대한 연구)

  • Suh, Bo-Euk
    • Journal for History of Mathematics
    • /
    • v.22 no.3
    • /
    • pp.187-206
    • /
    • 2009
  • On this study, the historical flow of the notation was briefly examined and the direction of mathematical investigation activity of the content of notation by analogy was explored and teaching learning materials were developed. Diverse mathematical facts were investigated on the basis of decimal system and binary system which are learned in middle school. First, the way of progressing analytic activity with algebraic material was examined. Second, on the basis of the notation which are learned in the first grade of middle school, the definition of the scale of a -notation, -a -notation, $\frac{1}{a}$notation, $\sqrt{a}$-notation was extended by analogy. The result of this study will be expected to establish the curriculum of mathematics and provide teaching and learning with the meaningful current events.

  • PDF

Vector Map Data Watermarking Method using Binary Notation

  • Kim, Jung-Yeop;Park, Soo-Hong
    • Spatial Information Research
    • /
    • v.15 no.4
    • /
    • pp.385-395
    • /
    • 2007
  • As the growth of performance of the computer and the development of the Internet are exponential, sharing and using the information illegally have also increased to the same proportion. In this paper, we proposed a novel method on the vector map data among digital contents. Vector map data are used for GIS, navigation and web-based services etc. We embedded watermark into the coordinate of the vector map data using bit operation and extracted the watermark. This method helps to protect the copyright of the vector map data. This watermarking method is a spatial domain method and it embeds the watermark within an allowable error. Our experiment shows that the watermark produced by this method is resistant to simplification and translation.

  • PDF

Design of optimal multiplexed filter and an analysis on the similar discrimination for music notatins recognition (음악기보 인식을 위한 다중필터의 설계 및 유사판별 성능분석)

  • Yeun, Jin-Seon;Kim, Nam
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.34D no.6
    • /
    • pp.65-74
    • /
    • 1997
  • In this paper, SA-multiplexed filter is designed using SA (simulated ananealing) to recognize music notation patterns varying in size, shape, position and having considerably many similar shapes for optical pattern recognition system. This filter has correlation resutls at wanted location and can identify same class, classify similar class for scale-varianted or rotation-varianted music notation patterns havng learning process. Also, the optimum filter is oriented to analyze on the similar discrimination at acquired position using SA and enhances optical diffractive efficiency as well as peak beam intensity. Compared with POF *(phase only filter), cosine-BPOF(cosine-binary phase only filter), that has excellent discrimination capability even if the different rate is 0.1% quantitatively.

  • PDF

Design and Implementation of Binary XML Encoder using Fast Infoset (Fast Infoset을 이용한 Binary XML Encoder의 설계 및 구현)

  • Yu Seong-Jae;Choi Il-Sun;Yoon Haw-Mook;Ahn Byeong-Ho;Jung Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.943-946
    • /
    • 2006
  • XML is the most widely used document format by advantage that self-contained for platform. So, currently the most used among other document format. but XML appeared new problem that memory and transmission. And that be used in environment a request restriction memory and fast transmission as like mobile field. Although discussion of XML binarization is going on progress. And fast Infoset configuration using XML Information Set is receiving attention that a way to lower file size of hold down a existing usage. In this paper, we designed of module using fast Infoset and PER among ASN.1 Encoding Rule for XML binarization. And we implementation of encoder constructed interlace by stage of translation from XML into binary XML.

  • PDF

A Novel Implementation of Rotation Detection Algorithm using a Polar Representation of Extreme Contour Point based on Sobel Edge

  • Han, Dong-Seok;Kim, Hi-Seok
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.800-807
    • /
    • 2016
  • We propose a fast algorithm using Extreme Contour Point (ECP) to detect the angle of rotated images, is implemented by rotation feature of one covered frame image that can be applied to correct the rotated images like in image processing for real time applications, while CORDIC is inefficient to calculate various points like high definition image since it is only possible to detect rotated angle between one point and the other point. The two advantages of this algorithm, namely compatibility to images in preprocessing by using Sobel edge process for pattern recognition. While the other one is its simplicity for rotated angle detection with cyclic shift of two $1{\times}n$ matrix set without complexity in calculation compared with CORDIC algorithm. In ECP, the edge features of the sample image of gray scale were determined using the Sobel Edge Process. Then, it was subjected to binary code conversion of 0 or 1 with circular boundary to constitute the rotation in invariant conditions. The results were extracted to extreme points of the binary image. Its components expressed not just only the features of angle ${\theta}$ but also the square of radius $r^2$ from the origin of the image. The detected angle of this algorithm is limited only to an angle below 10 degrees but it is appropriate for real time application because it can process a 200 degree with an assumption 20 frames per second. ECP algorithm has an O ($n^2$) in Big O notation that improves the execution time about 7 times the performance if CORDIC algorithm is used.

A Study on the Encoding between ASN.1 and XML for Fast Web Services (Fast Web Services를 위한 ASN.1과 XML간의 인코딩에 관한 연구)

  • Yu, Seong-Jae;Yoon, Haw-Mook;Song, Jong-Chul;Choi, Il-sun;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.959-962
    • /
    • 2005
  • Recently, business integration and interoperability of between the heterogeneous applications are requested by rapid growth of web. Web Services that self-contained for platform and programming language is appeared used to XML of standard data format. Such amid Fast Web Services attract attention at fields necessary to bring rapid communication like Mobile and RFID. In this paper, we inquired about ASN.1 of ITU-T and IS0/IEC standard that a central role of data transform. And we studied encoding process of between ASN.1 and XML for transform SOAP massage of a massage transfer mode of Web Services to binary data.

  • PDF

Geohashed Spatial Index Method for a Location-Aware WBAN Data Monitoring System Based on NoSQL

  • Li, Yan;Kim, Dongho;Shin, Byeong-Seok
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.263-274
    • /
    • 2016
  • The exceptional development of electronic device technology, the miniaturization of mobile devices, and the development of telecommunication technology has made it possible to monitor human biometric data anywhere and anytime by using different types of wearable or embedded sensors. In daily life, mobile devices can collect wireless body area network (WBAN) data, and the co-collected location data is also important for disease analysis. In order to efficiently analyze WBAN data, including location information and support medical analysis services, we propose a geohash-based spatial index method for a location-aware WBAN data monitoring system on the NoSQL database system, which uses an R-tree-based global tree to organize the real-time location data of a patient and a B-tree-based local tree to manage historical data. This type of spatial index method is a support cloud-based location-aware WBAN data monitoring system. In order to evaluate the proposed method, we built a system that can support a JavaScript Object Notation (JSON) and Binary JSON (BSON) document data on mobile gateway devices. The proposed spatial index method can efficiently process location-based queries for medical signal monitoring. In order to evaluate our index method, we simulated a small system on MongoDB with our proposed index method, which is a document-based NoSQL database system, and evaluated its performance.

Technique for production and encoding of New dot-type Print Watermark Pattern (새로운 도트형 프린트 워터마크 패턴의 생성 및 부호화 기법)

  • Lee, Boo-Hyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.5
    • /
    • pp.979-984
    • /
    • 2009
  • In this paper, the technique for production and encoding of new dot-type print watermark is proposed. The print watermark has characteristics similar to those of the digital watermark and function as link which change various first informations(texts, symbols, figures, etc) on the printed matter to secondary contents (sound, video, character, etc) corresponding each to informations on the printed matter. The proposed dot-type print watermark pattern is represented as $16{\times}16$ matrix in $0.4mm^2$ area and dots are printed on only 23 elements of $16{\times}16$ matrix. The size of each dot is so small(0.02mm)that it can not be seen. Because position of printed dots correspond to the position of each digit in binary notation in this paper, they are encoded easily and there are about 8,000,000 watermark patterns enough to express first information of printed matters. It was showed that the proposed print watermark patterns are recognized without difficulty by the own recognition device.

A Study on Prevention of Collision and Data Loss of the RFID System Using a Full-Length Instruction Code Method (무선인식 시스템의 완전 명령 코드 기법을 이용한 데이터 충돌 및 손실 방지에 관한 연구)

  • 강민수;신석균;이재호;박면규;이기서
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.756-765
    • /
    • 2004
  • Using single carrier frequency RFID system in one-to-multiple wireless communications, might be generated data loss because of data collisions. Conventional Anti-collision method prevent data loss from data collisions which are binary tree method and ALOHA. However, those two preventive measures also have week points which are strongly dependent on the time and space when passing through the recognition area. This paper suggests the full-length instruction code method which fits in to half-duplex method, prevents data collision effectively by calculating the non-transmitting time of multiple tags considering approaching time to the recognition area. After full-length instruction code method test using 13.56MHz bandwidth RFID system shows that full-length instruction code method could make better result than any other methods. Moreover, the record shows O(n) result after analyzing O-notation of conventional time-domain procedure.

A new feature specification for vowel height (모음 높이의 새로운 표기법에 대하여)

  • Park Cheon-Bae
    • MALSORI
    • /
    • no.27_28
    • /
    • pp.27-56
    • /
    • 1994
  • Processes involving the change of vowel height are natural enough to be found in many languages. It is essential to have a better feature specification for vowel height to grasp these processes properly, Standard Phonology adopts the binary feature system, and vowel height is represented by the two features, i.e., [\pm high] and [\pm low]. This has its own merits. But it is defective because it is misleading when we count the number of features used in a rule to compare the naturalness of rules. This feature system also cannot represent more than three degrees of height, We wi31 discard the binary features for vowel height. We consider to adopt the multivalued feature [n high] for the property of height. However, this feature cannot avoid the arbitrariness resulting from the number values denoting vowel height. It is not easy to expect whether the number in question is the largest or not It also is impossible to decide whether a larger number denotes a higher vowel or a lower vowel. Furthermore this feature specification requires an ad hoc condition such as n > 3 or n \geq 2, whenever we want to refer to a natural class including more than one degree of height The altelnative might be Particle Phonology, or Dependency Phonology. These might be apt for multivalued vowel height systems, as their supporters argue. However, the feature specification of Particle Phonology will be discarded because it does not observe strictly the assumption that the number of the particle a is decisive in representing the height. One a in a representation can denote variant degrees of height such as [e], [I], [a], [a ] and [e ]. This also means that we cannot represent natural classes in terms of the number of the particle a, Dependency Phonology also has problems in specifying a degree of vowel height by the dependency relations between the elements. There is no unique element to represent vowel height since every property has to be defined in terms of the dependency relations between two or more elements, As a result it is difficult to formulate a rule for vowel height change, especially when the phenomenon involves a chain of vowel shifts. Therefore, we suggest a new feature specification for vowel height (see Chapter 3). This specification resorts to a single feature H and a few >'s which refer exclusively to the degree of the tongue height when a vowel is pronounced. It can cope with more than three degrees of height because it is fundamentally a multivalued scalar feature. This feature also obviates the ad hoc condition for a natural class while the [n high] type of multivalued feature suffers from it. Also this feature specification conforms to our expection that the notation should become simpler as the generality of the class increases, in that the fewer angled brackets are used, the more vowels are included, Incidentally, it has also to be noted that, by adopting a single feature for vowel height, it is possible to formulate a simpler version of rules involving the changes of vowel height especially when they involve vowel shifts found in many languages.

  • PDF