• Journal of Digital Convergence
• /
• v.15 no.11
• /
• pp.261-269
• /
• 2017

The purpose of this paper is to provide a search system using a method of accessing the web in real time without using a database server in order to guarantee the up-to-date information in a single network, rather than using a plurality of bots connected by a wide area network Design. The method of the research is to design and analyze the system which can search the person and keyword quickly and accurately in crepe system. In the crepe server, when the user registers information, the body tag matching conversion process stores all the information as it is, since various styles are applied to each user, such as a font, a font size, and a color. The crepe server does not cause a problem of body tag matching. However, when executing the crepe retrieval system, the style and characteristics of users can not be formalized. This problem can be solved by using the html_img_parser function and the Go language html parser package. By applying queues and multiple threads to a general-purpose web crawler, rather than a web crawler design that targets a specific site, it is possible to utilize a multiplier that quickly and efficiently searches and collects various web sites in various applications.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.8
• /
• pp.694-700
• /
• 2009

In this paper, we propose a RFID tag antenna with low performance degradation due to nearby dielectric materials. The proposed antenna is designed to be appropriate for ink printing fabrication. The antenna is designed to operate in UHF band of $860{\sim}960$ MHz. The antenna uses a T-matching network in the middle of the main body and two parasitic patches in vicinity for complex conjugate matching with a commercial tag chip. In addition, the two parasitic patches induce currents at different dielectric constants of nearby dielectric materials. This can minimize the performance degradation due to nearby dielectric materials. The measured results show the half power matching bandwidth from 844 MHT to 1,268 MHz. It exhibits the reading distance of about 3.5 m in free space when the tag antenna is used with the commercial reader antenna (transmitting power of 20 dBm and the reader antenna gain of 6 dBi). When the tag is attached on dielectric materials of wood and FR4, the resulting reading distances are 2.61 m and 2.51 m, respectively.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.2
• /
• pp.64-70
• /
• 2011

Portable artificial electronic nose (E-nose) system suffers from noisy fluctuation in surroundings such as temperature, vapor concentration, and gas flow, because its measuring condition is not controled precisely as in the laboratory. It is important to develop a simple and robust vapor recognition technique applicable to this uncontrolled measurement, especially for the portable measuring and diagnostic system which are expanding its area with the improvements in micro bio sensor technology. This study used a PDA-based portable E-nose to collect the uncontrolled vapor measurement signals, and applied the image matching algorithm developed in the previous study on the measured signal to verify its robustness and improved accuracy in portable vapor recognition. The results showed not only its consistent performance under noisy fluctuation in the portable measurement signal, but also an advanced recognition accuracy for 2 similar vapor species which have been hard to discriminate with the conventional maximum sensitivity feature extraction method. The proposed method can be easily applied to the data processing of the ubiquitous sensor network (USN) which are usually exposed to various operating conditions. Furthermore, it will greatly help to realize portable medical diagnostic and environment monitoring system with its robust performance and high accuracy.

• Journal of the Korean Magnetics Society
• /
• v.19 no.6
• /
• pp.203-208
• /
• 2009

Magnetic and Ka-band absorbing properties have been investigated in Ti-Co substituted M-type barium hexaferrites with $BaTi_{0.5}Co_{0.5}Fe_{11}O_{19}$ composition. The ferrite powders were prepared by conventional ceramic processing technique and used as absorbent fillers in ferrite-rubber composites. The magnetic properties were measured by vibrating sample magnetometer. The complex permeability and dielectric constant were measured by using the WR-28 rectangular waveguide and network analyzer in the frequency range 26.5~40 GHz. For the Ti-Co substituted M-hexaferrites, the ferromagnetic resonance is observed at Ka-band (29.4 GHz). The matching frequency and matching thickness are determined by using the solution map of impedance matching. A wide band microwave absorbance is predicted with controlled ferrite volume fraction and absorber thickness.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.39-60
• /
• 2011

Since the introduction of web 2.0 technology, social network service has been recognized as the foundation of an important future information technology. The advent of web 2.0 has led to the change of content creators. In the existing web, content creators are service providers, whereas they have changed into service users in the recent web. Users share experiences with other users improving contents quality, thereby it has increased the importance of social network. As a result, diverse forms of social network service have been emerged from relations and experiences of users. Social network is a network to construct and express social relations among people who share interests and activities. Today's social network service has not merely confined itself to showing user interactions, but it has also developed into a level in which content generation and evaluation are interacting with each other. As the volume of contents generated from social network service and the number of connections between users have drastically increased, the social network extraction method becomes more complicated. Consequently the following problems for the social network extraction arise. First problem lies in insufficiency of representational power of object in the social network. Second problem is incapability of expressional power in the diverse connections among users. Third problem is the difficulty of creating dynamic change in the social network due to change in user interests. And lastly, lack of method capable of integrating and processing data efficiently in the heterogeneous distributed computing environment. The first and last problems can be solved by using FOAF, a tool for describing ontology-based user profiles for construction of social network. However, solving second and third problems require a novel technology to reflect dynamic change of user interests and relations. In this paper, we propose a novel method to overcome the above problems of existing social network extraction method by applying FOAF (a tool for describing user profiles) and RSS (a literary web work publishing mechanism) to OLAP system in order to dynamically innovate and manage FOAF. We employed data interoperability which is an important characteristic of FOAF in this paper. Next we used RSS to reflect such changes as time flow and user interests. RSS, a tool for literary web work, provides standard vocabulary for distribution at web sites and contents in the form of RDF/XML. In this paper, we collect personal information and relations of users by utilizing FOAF. We also collect user contents by utilizing RSS. Finally, collected data is inserted into the database by star schema. The system we proposed in this paper generates OLAP cube using data in the database. 'Dynamic FOAF Management Algorithm' processes generated OLAP cube. Dynamic FOAF Management Algorithm consists of two functions: one is find_id_interest() and the other is find_relation (). Find_id_interest() is used to extract user interests during the input period, and find-relation() extracts users matching user interests. Finally, the proposed system reconstructs FOAF by reflecting extracted relationships and interests of users. For the justification of the suggested idea, we showed the implemented result together with its analysis. We used C# language and MS-SQL database, and input FOAF and RSS as data collected from livejournal.com. The implemented result shows that foaf : interest of users has reached an average of 19 percent increase for four weeks. In proportion to the increased foaf : interest change, the number of foaf : knows of users has grown an average of 9 percent for four weeks. As we use FOAF and RSS as basic data which have a wide support in web 2.0 and social network service, we have a definite advantage in utilizing user data distributed in the diverse web sites and services regardless of language and types of computer. By using suggested method in this paper, we can provide better services coping with the rapid change of user interests with the automatic application of FOAF.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.10-21
• /
• 2008

The present paper propose a real-time moving object recognition and tracking method using the wavelet-based neural network and invariant moments. Candidate moving region detection phase which is the first step of the proposed method detects the candidate regions where a pixel value changes occur due to object movement based on the difference image analysis between continued two image frames. The object recognition phase which is second step of proposed method recognizes the vehicle regions from the detected candidate regions using wavelet neurual-network. From object tracking Phase which is third step the recognized vehicle regions tracks using matching methods of wavelet invariant moments bases to recognized object. To detect a moving object from image sequence the candidate regions detection phase uses an adaptive thresholding method between previous image and current image as result it was robust surroundings environmental change and moving object detections were possible. And by using wavelet features to recognize and tracking of vehicle, the proposed method decrease calculation time and not only it will be able to minimize the effect in compliance with noise of road image, vehicle recognition accuracy became improved. The result which it experiments from the image which it acquires from the general road image sequence and vehicle detection rate is 92.8%, the computing time per frame is 0.24 seconds. The proposed method can be efficiently apply to a real-time intelligence road traffic surveillance system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.333-340
• /
• 2011

KJJVC(Korea-Japan Joint VLBI Correlator) was installed at the KJCC(Korea-Japan Correlation Center) and has been operated by KASI(Korea Astronomy and Space Science Institute) from 2009. KJNC is able to correlate the VLBI observed data through KVN(Korean VLBI Network), VERA(VLBI Exploration of Radio Astrometry), and JVN(Japanese VLBI Network) and its joint network array. And it is used exclusively as computer in order to process the observed data for the scientific purpose KJJVC used the VSI(VLBI Standard Interface) as the VLBI international standard at the data input-output specification between each component. Especially, for correlating the observed data, the data is transmitted with 1024Mbps speed between Mark5B high-speed playback and RVDB(Raw VLBI Data Buffer). The EMI(Electromagnetic lnterference), which is occurred by data transmission with high-speed, cause the data loss and the loss occurrence is frequently often for long transmission cable. Finally it will be caused the data recognition error by decreasing the voltage level of digital data signal. In this paper, in order to minimize the data loss by measuring the EMI noise level in transmission of the VSI specification, the 3 methods such as 1) RC filtering method, 2) lmpedance matching using Microstrip line, and 3) Signal buffering method using Differential line driver, were proposed. To verify the effectiveness of each proposed method, the performance evaluation was conducted by implementing and simulations for each method. Each proposed method was effectively confirmed as the high-speed data transmission of the VSI specification.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.19-29
• /
• 2003

This paper presents a novel hybrid classifier for face recognition with artificially generated virtual training samples. We utilize both the nearest neighbor approach in feature angle space and a connectionist model to obtain a synergy effect by combining the results of two heterogeneous classifiers. First, a classifier called the nearest feature angle (NFA), based on angular information, finds the most similar feature to the query from a given training set. Second, a classifier has been developed based on the recall of stored frontal projection of the query feature. It uses a frontal recall network (FRN) that finds the most similar frontal one among the stored frontal feature set. For FRN, we used an ensemble neural network consisting of multiple multiplayer perceptrons (MLPs), each of which is trained independently to enhance generalization capability. Further, both classifiers used the virtual training set generated adaptively, according to the spatial distribution of each person's training samples. Finally, the results of the two classifiers are combined to comprise the best matching class, and a corresponding similarit measure is used to make the final decision. The proposed classifier achieved an average classification rate of 96.33% against a large group of different test sets of images, and its average error rate is 61.5% that of the nearest feature line (NFL) method, and achieves a more robust classification performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2920-2939
• /
• 2012

Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.60-69
• /
• 2017

Recently, with the rapid development of internet and smart phones, social network services that can create and share various information through relationships among users have been actively used. Especially as the amount of information becomes enormous and unreliable information increases, expert recommendation that can offer necessary information to users have been studied. In this paper, we propose an expert recommendation scheme considering users' interests, human relations, and response quality. The users' interests are evaluated by analyzing their past activities in social network. The human relations are evaluated by extracting the users who have the same interesting fields. The response quality is evaluated by considering the user's response speed and response contents. The proposed scheme determines the user's expert score by combining the users' interests, the human relations, and the response quality. Finally, we recommend proper experts by matching queries and expert groups. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.