• Journal of the Korean School Mathematics Society
• /
• v.16 no.4
• /
• pp.797-820
• /
• 2013

This study intended on analyzing the error patterns of mathematic problem posing sentences by the 100 elementary pre-teachers and discussing about the solutions. The results showed that the problem posing sentences have five error patterns: phonological error patterns, word error patterns, sentence error patterns, meaning error patterns, and notation error patterns. Divided into fourteen specific error patterns, they are as in the following. 1) Phonological error patterns are consisted of the 'ㄹ' addition error pattern and the abbreviated word error pattern. 2) Words error patterns are divided with the inappropriate usage of word error pattern and the inadequate abbreviation error pattern, which are formulized four subgroups such as the case maker, ending of the word, inappropriate usage of word, and inadequate abbreviation of article or word error pattern in detail. 3) Sentence error patterns are assumed four kinds of forms: the reference, ellipsis of sentence component, word order, and incomplete sentence error pattern. 4) Meaning error patterns are composed the logical contradiction and the ambiguous meaning. 5) Notation error patterns are formed four patterns as the spacing, punctuation, orthography of Hangul, and spelling rules of foreign words in Korean. Furthermore, the solutions for these error patterns were discussed: First, it has to be perceived the differences between spoken and written language. Second, it has to be rejected the spoken expressions in written contexts. Third, it should be focused on the learning of the basic sentence patterns during the class. Forth, it is suggested that the word meaning should have the logical development perception based on what it means. Finally, it is proposed that the system of spelling of Korean has to be learned. In addition to these suggestions, a new understanding is necessary regarding writing education for college students.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2630-2641
• /
• 1999

Most of the previous game development has proceeded in the approaches of the temporal-oriented synchronization because of producing game objects by using general authoring tools, and ad hoc or trial and error methods has been devised for representation of spatial concept. This paper is a study on the unification notation for spatio-temporal synchronization to conquest this fault. First of all, we classify game space as temporal object, spatial object, absolute/relative spatio-temporal space. The spatio-temporal relationships are divided into temporal extent, temporal location, spatial extent, and spatial location. In the paper the temporal and spatial relationships of game scene are defined to represent the synchronization, and we propose new unification notation by temporal and spatial concept to represent two concepts putting emphasis on space. Their relationships are presented on 3D by creating time axis related with time in scene unit of the two dimensional plane in the pivot on space. The usability of this representation method are shown by applying examples of game scenario.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.83-89
• /
• 1999

For the object-oriented development methods authorized by OMG a number of official methodologies such as Booch, Coad/Yourdon methods are used in the development of the object-oriented soft ware and each methodology represents its process of analysis and design using different symbols. Between those notation methodologies there exist some differences as a matter of development, information for transfer, accordingly they act on the transfer of the information in the object-oriented development as obstacle and give rise to they natural outcome of error. The aim of this study is in the presentation of ideas that decrease the probability of errors by means of verify8ing the transferring ability of information which the existing diagrammatic notation methodologies have had on the basis of cognitive science, minimizing the cognitive load from the object-oriented development through enhancing symbols in each obstacles to transferring information and removing them.

• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.471-475
• /
• 2005

Recently, development of digital technology is occupying a large part of multimedia information like character, voice, image, video, etc. Research about video indexing and retrieval progresses especially in research relative to video. This paper proposes the novel notation in order to retrieve MPEG video in the international standards of moving picture encoding For realizing the retrieval-system, we detect DCT DC coefficient, and then we obtain shot to apply MVC(Mean Value Comparative) notation to image constructed DC coefficient. We choose the key frame for start-frame of a shot, and we have the codebook index generating it using feature of DC image and applying PCA(principal Component Analysis) to the key frame. Also, we realize the retrieval-system through similarity after indexing. We could reduce error detection due to distinguish shot from conventional shot detection algorithm. In the mean time, speed of indexing is faster by PCA due to perform it in the compressed domain, and it has an advantage which is to generate codebook due to use statistical features. Finally, we could realize efficient retrieval-system using MVC and PCA to shot detection and indexing which is important step of retrieval-system, and we using retrieval-system over the internet.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of Broadcast Engineering
• /
• v.26 no.7
• /
• pp.838-843
• /
• 2021

This paper presents an algorithm for effective retrieval of score information to an input score image. The originality of the proposed algorithm is that it is designed to be robust to recognition errors by an OMR (Optical Music Recognition), while existing methods such as pitch histogram requires error induced OMR result be corrected before retrieval process. This approach helps people to retrieve score without training on music score for error correction. OMR takes a score image as input, recognizes musical symbols, and produces structural symbolic notation of the score as output, for example, in MusicXML format. Among the musical symbols on a score, it is observed that filled noteheads are rarely detected with errors with its simple black filled round shape for OMR processing. Barlines that separate measures also strong to OMR errors with its long uniform length vertical line characteristic. The proposed algorithm consists of a descriptor for a score and a similarity measure between a query score and a reference score. The descriptor is based on note-count, the number of filled noteheads in a measure. Each part of a score is represented by a sequence of note-count numbers. The descriptor is an n-gram sequence of the note-count sequence. Simulation results show that the proposed algorithm works successfully to a certain degree in score image-based retrieval for an erroneous OMR output.

• Journal of Biomedical Engineering Research
• /
• v.8 no.2
• /
• pp.171-176
• /
• 1987

Wiener filtering method was applied to the dual energy imaging procedure in digital radiography(D.R.). A linear scanning photodiode arrays with 1024 elements(0.6mm H 1.3mm pixel size) were used to obtain chest images in 0.7 sec. For high energy image acquisition, X-ray tube was set at 140KVp, 100mA with a rare-earth phosphor screen. Low energy image was obtained with X-ray tube setting at 70KVp, 150mA. These measured dual energy images are represented in the vector matrix notation as a linear discrete model including the additive random noise. Then, the object images are restored in the minimum mean square error sense using Wiener filtering method in the transformed domain. These restored high and low energy images are used for computation of the basis image decomposition. Then the basis images are linearly combined to produce bone or tissue selective images. Using this process, we could improve the signal to noise ratio characteristics in the material selective images.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.423-438
• /
• 1994

We employ the Galerkin method to solve the nonlinear Urysohn integral equation (1.1) x(t) = f(t) ＋ $∫_{D}$ k(t, s, x(s))ds (t $\in$ D), where D is a bounded domain in $R^{d}$ , the function f and k are known and x is the solution to be determined. We assume that D has a locally Lipschitz boundary ([1, p. 67]). We can rewrite (1.1) in operator notation as x = f ＋ Kx. We consider (1.1) as an operator equation on $L_{\infty$}$(D) and assume that K is defined on the closure $\Omega$ of a bounded open set $\Omega$ ⊂ $L_{\infty}$(D). Throughout our analysis we put the following assumptions on (1.1).(omitted)(1.1).(omitted)