• Korean Journal of Optics and Photonics
• /
• v.16 no.3
• /
• pp.182-190
• /
• 2005

The fiber Raman amplifier(FRA) is a distinctly advantageous technology. Due to its wider, flexible gain bandwidth, and intrinsically lower noise characteristics, FRA has become an indispensable technology of today. Various FRA modeling methods, with different levels of convergence speed and accuracy, have been proposed in order to gain valuable insights for the FRA dynamics and optimum design before real implementation. Still, all these approaches share the common platform of coupled ordinary differential equations(ODE) for the Raman equation set that must be solved along the long length of fiber propagation axis. The ODE platform has classically set the bar for achievable convergence speed, resulting exhaustive calculation efforts. In this work, we propose an alternative, highly efficient framework for FRA analysis. In treating the Raman gain as the perturbation factor in an adiabatic process, we achieved implementation of the algorithm by deriving a recursive relation for the integrals of power inside fiber with the effective length and by constructing a matrix formalism for the solution of the given FRA problem. Finally, by adiabatically turning on the Raman process in the fiber as increasing the order of iterations, the FRA solution can be obtained along the iteration axis for the whole length of fiber rather than along the fiber propagation axis, enabling faster convergence speed, at the equivalent accuracy achievable with the methods based on coupled ODEs. Performance comparison in all co-, counter-, bi-directionally pumped multi-channel FRA shows more than 102 times faster with the convergence speed of the Average power method at the same level of accuracy(relative deviation < 0.03dB).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.97-117
• /
• 2012

Nowadays, Internet users tend to do a variety of actions at the same time such as web browsing, social networking and multimedia consumption. While watching a video, once a user is interested in any product, the user has to do information searches to get to know more about the product. With a conventional approach, user has to search it separately with search engines like Bing or Google, which might be inconvenient and time-consuming. For this reason, a video annotation platform has been developed in order to provide users more convenient and more interactive ways with video content. In the future of smart TV environment, users can follow annotated information, for example, a link to a vendor to buy the product of interest. It is even better to enable users to search for information by directly discussing with friends. Users can effectively get useful and relevant information about the product from friends who share common interests or might have experienced it before, which is more reliable than the results from search engines. Social networking services provide an appropriate environment for people to share products so that they can show new things to their friends and to share their personal experiences on any specific product. Meanwhile, they can also absorb the most relevant information about the product that they are interested in by either comments or discussion amongst friends. However, within a very huge graph of friends, determining the most appropriate persons to ask for information about a specific product has still a limitation within the existing conventional approach. Once users want to share or discuss a product, they simply share it to all friends as new feeds. This means a newly posted article is blindly spread to all friends without considering their background interests or knowledge. In this way, the number of responses back will be huge. Users cannot easily absorb the relevant and useful responses from friends, since they are from various fields of interest and knowledge. In order to overcome this limitation, we propose a method to filter a user's friends for information search, which leverages semantic video annotation and social networking services. Our method filters and brings out who can give user useful information about a specific product. By examining the existing Facebook information regarding users and their social graph, we construct a user profile of product interest. With user's permission and authentication, user's particular activities are enriched with the domain-specific ontology such as GoodRelations and BestBuy Data sources. Besides, we assume that the object in the video is already annotated using Linked Data. Thus, the detail information of the product that user would like to ask for more information is retrieved via product URI. Our system calculates the similarities among them in order to identify the most suitable friends for seeking information about the mentioned product. The system filters a user's friends according to their score which tells the order of whom can highly likely give the user useful information about a specific product of interest. We have conducted an experiment with a group of respondents in order to verify and evaluate our system. First, the user profile accuracy evaluation is conducted to demonstrate how much our system constructed user profile of product interest represents user's interest correctly. Then, the evaluation on filtering method is made by inspecting the ranked results with human judgment. The results show that our method works effectively and efficiently in filtering. Our system fulfills user needs by supporting user to select appropriate friends for seeking useful information about a specific product that user is curious about. As a result, it helps to influence and convince user in purchase decisions.

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.147-157
• /
• 2010

With the immergence of the iPhone, the interest in Smartphones is getting higher as services can be provided directly between service providers and consumers without the network operators. As the number of international tourists increase, individual tourists are also increasing. According to the WTO's (World Tourism Organization) prediction, the number of international tourists will be 1.56 billion in 2020,and the average growth rate will be 4.1% a year. Chinese tourists, in particular, are increasing rapidly and about 100 million will travel the world in 2020. In 2009, about 7.8 million foreign tourists visited Korea and the Ministry of Culture, Sports and Tourism is trying to attract 12 million foreign tourists in 2014. A research institute carried out a survey targeting foreign tourists and the survey results showed that they felt uncomfortable with communication (about 55.8%) and directional signs (about 21.4%) when they traveled in Korea. To solve this inconvenience for foreign tourists, multilingual servicesfor traffic signs, tour information, shopping information and so forth should be enhanced. The appearance of the Smartphone comes just in time to provide a new service to address these inconveniences. Smartphones are especially useful because every Smartphone has GPS (Global Positioning System) that can provide users' location to the system, making it possible to provide location-based services. For improvement of tourists' convenience, Seoul Metropolitan Government hasinitiated the u-tour service using Kiosks and Smartphones, and several Province Governments have started the u-tourpia project using RFID (Radio Frequency IDentification) and an exclusive device. Even though the u-tour or u-tourpia service used the Smartphone and RFID, the tourist should know the location of the Kiosks and have previous information. So, this service did not give the solution yet. In this paper, I developed a new convenient service which can provide location based information for the individual tourists using GPS, WiFi, and 3G. The service was tested at Insa-dong in Seoul, and the service can provide tour information around the tourist using a push service without user selection. This self-tour service is designed for providing a travel guide service for foreign travelers from the airport to their destination and information about tourist attractions. The system reduced information traffic by constraining receipt of information to tourist themes and locations within a 20m or 40m radius of the device. In this case, service providers can provide targeted, just-in-time services to special customers by sending desired information. For evaluating the implemented system, the contents of 40 gift shops and traditional restaurants in Insa-dong are stored in the CMS (Content Management System). The service program shows a map displaying the current location of the tourist and displays a circle which shows the range to get the tourist information. If there is information for the tourist within range, the information viewer is activated. If there is only a single resultto display, the information viewer pops up directly, and if there are several results, the viewer shows a list of the contents and the user can choose content manually. As aresult, the proposed system can provide location-based tourist information to tourists without previous knowledge of the area. Currently, the GPS has a margin of error (about 10~20m) and this leads the location and information errors. However, because our Government is planning to provide DGPS (Differential GPS) information by DMB (Digital Multimedia Broadcasting) this error will be reduced to within 1m.

• Journal of Intelligence and Information Systems
• /
• v.20 no.3
• /
• pp.59-76
• /
• 2014

The revolution of smart media such as smart phone, smart TV and tablets has brought easiness for people to get contents and related information anywhere and anytime. The characteristics of the smart media have changed user behavior for watching the contents from passive attitude into active one. Video is a kind of multimedia resources and widely used to provide information effectively. People not only watch video contents, but also search for related information to specific objects appeared in the contents. However, people have to use extra views or devices to find the information because the existing video contents provide no information through the contents. Therefore, the interaction between user and media is becoming a major concern. The demand for direct interaction and instant information is much increasing. Digital media environment is no longer expected to serve as a one-way information service, which requires user to search manually on the internet finding information they need. To solve the current inconvenience, an interactive service is needed to provide the information exchange function between people and video contents, or between people themselves. Recently, many researchers have recognized the importance of the requirements for interactive services, but only few services provide interactive video within restricted functionality. Only cooking domain is chosen for an interactive cooking video query service in this research. Cooking is receiving lots of people attention continuously. By using smart media devices, user can easily watch a cooking video. One-way information nature of cooking video does not allow to interactively getting more information about the certain contents, although due to the characteristics of videos, cooking videos provide various information such as cooking scenes and explanation for each recipe step. Cooking video indeed attracts academic researches to study and solve several problems related to cooking. However, just few studies focused on interactive services in cooking video and they still not sufficient to provide the interaction with users. In this paper, an interactive cooking video query service system with linked data to provide the interaction functionalities to users. A linked recipe schema is used to handle the linked data. The linked data approach is applied to construct queries in systematic manner when user interacts with cooking videos. We add some classes, data properties, and relations to the linked recipe schema because the current version of the schema is not enough to serve user interaction. A web crawler extracts recipe information from allrecipes.com. All extracted recipe information is transformed into ontology instances by using developed instance generator. To provide a query function, hundreds of questions in cooking video web sites such as BBC food, Foodista, Fine cooking are investigated and analyzed. After the analysis of the investigated questions, we summary the questions into four categories by question generalization. For the question generalization, the questions are clustered in eleven questions. The proposed system provides an environment associating UI (User Interface) and UX (User Experience) that allow user to watch cooking videos while obtaining the necessary additional information using extra information layer. User can use the proposed interactive cooking video system at both PC and mobile environments because responsive web design is applied for the proposed system. In addition, the proposed system enables the interaction between user and video in various smart media devices by employing linked data to provide information matching with the current context. Two methods are used to evaluate the proposed system. First, through a questionnaire-based method, computer system usability is measured by comparing the proposed system with the existing web site. Second, the answer accuracy for user interaction is measured to inspect to-be-offered information. The experimental results show that the proposed system receives a favorable evaluation and provides accurate answers for user interaction.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.123-136
• /
• 2006

The prefetching technique is an effective way to reduce the latency caused memory access. However, excessively aggressive prefetch not only leads to cache pollution so as to cancel out the benefits of prefetch but also increase bus traffic leading to overall performance degradation. In this thesis, a prefetch filtering scheme is proposed which dynamically decides whether to commence prefetching by referring a filtering table to reduce the cache pollution due to unnecessary prefetches In this thesis, First, prefetch hashing table 1bitSC filtering scheme(PHT1bSC) has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete block address table filtering scheme(CBAT) has been introduced to be used as a reference for the comparative study. A prefetch block address lookup table scheme(PBALT) has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the PHT1bSC scheme, the contents of each entry have the fields the same as CBAT scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. On commonly used prefetch schemes and general benchmarks and multimedia programs simulates change cache parameters. The PBALT scheme compared with no filtering has shown enhanced the greatest 22%, the cache miss ratio has been decreased by 7.9% by virtue of enhanced filtering accuracy compared with conventional PHT2bSC. The MADT of the proposed PBALT scheme has been decreased by 6.1% compared with conventional schemes to reduce the total execution time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.6
• /
• pp.757-772
• /
• 2019

The purpose of this paper is to measure the clustering change and analyze empirical results, and choose the clustering ports for Busan, Incheon, and Gwangyang ports by using Artificial Neural Network, Social Network, and Tabu Search models on 38 Asian container ports over the period 2007-2016. The models consider number of cranes, depth, birth length, and total area as inputs and container throughput as output. Followings are the main empirical results. First, the variables ranking order which affects the clustering according to artificial neural network are TEU, birth length, depth, total area, and number of cranes. Second, social network analysis shows the same clustering in the benevolent and aggressive models. Third, the efficiency of domestic ports are worsened after clustering using social network analysis and tabu search models. Forth, social network and tabu search models can increase the efficiency by 37% compared to that of the general CCR model. Fifth, according to the social network analysis and tabu search models, 3 Korean ports could be clustered with Asian ports like Busan Port(Kobe, Osaka, Port Klang, Tanjung Pelepas, and Manila), Incheon Port(Shahid Rajaee, and Gwangyang), and Gwangyang Port(Aqaba, Port Sulatan Qaboos, Dammam, Khor Fakkan, and Incheon). Korean seaport authority should introduce port improvement plans by using the methods used in this paper.

• Journal of the Korean Chemical Society
• /
• v.64 no.6
• /
• pp.416-428
• /
• 2020

This study analyzed the uses of external representations presented in the matter units of the 7th-grade science digital textbooks developed under the 2015 revised national curriculum. The level, form, presentation, and interactivity of external representations presented in 5 types of digital textbooks were analyzed. As for the level, the macroscopic level of representations was mainly presented. The macroscopic level and microscopic level of representations were presented together in the particle description. As for the form, visual-verbal and visual-nonverbal representations were usually presented across the board. Very few audial-verbal and audial-nonverbal representations were presented. Visual-verbal and audial-verbal representations were mostly presented in formal form, and visual-nonverbal representations were mostly presented in illustration without movement. The presentation of representations was analyzed in three aspects. First, visual-verbal and visual-nonverbal representations were mainly presented together and none of audial-verbal and visual-nonverbal representations were presented together. When the representations of the audial-verbal, visual-nonverbal, and visual-verbal were presented together, some of the information presented in audial-verbal representations was repeatedly presented in the visual-verbal representations. Second, audial-nonverbal representations not related to learning content were presented along with other representations. Third, there were few cases of arranging visual-verbal and visual-nonverbal representations on the next pages. Audialverbal and visual-nonverbal representations were always presented synchronized. As for the interactivity, the manipulation level was mainly presented in the main area, and the feedback level was mainly presented in the activity area. The adaptation level and the communication level of interactivity were presented very few. Based on the results, the implications for the direction of constructing digital textbooks were discussed.