• Korean journal of communication and information
• /
• v.17
• /
• pp.85-111
• /
• 2001

In this article, Channel 4 in Britain is the main theme since its alternative broadcasting system can shed the light to the Korean case. Korea is getting into the era of multimedia and including webcastings there are over thousands channels are available. However the infra-structure fur the broadcasting contents never seems to be matured to match its need. Instead Korean production system is rather vertically integrated into the Networks(KBS, MBC and SBS) which oligopolise the broadcasting in terms of supply. Even though 'Program Quota Regulation' has been established under the new Broadcasting Art(1999), the old habits die hard and still the independent producers have the unfair relationships with the Networks. Under this circumstance, Channel 4 can be the good example to show how well the alternative system can serve to the diversity of broadcasting and the taste of the minority. Channel 4 took almost 20 years to establish since there were enormous amount of debates about its public missions, ideal broadcasting system, whom it should serve for, etc. between all the social sectors including the independent producers. The social agreement was reached on the point that the new broadcaster should not produce but publish and it is called the 'publishing broadcaster'. In this sense, it can be managed effectively with comparatively little fund and at the same time, it can always have all different sorts of contents as well as genres very freely through 'commissioning process' or buying programs from even the most innovative producers. The 'commissioning process' is one of the key points which makes the Channel 4 so unique. The commissioning process is literally open to anybody, in particular, to the small scale producers with much innovative ideas. Channel 4 will support financially as well as with facilities and human resource to produce the program once after their program idea is accepted by the commissioning editor. Even better side of Channel 4 is about their financial success. From the beginning, the 'funding formula' helped in great deal to make the Channel 4 doing all sorts of innovative experiments. The history of 'funding formula' and its contribution are explained in the article, too. With all this effort, the article is hoped to bring discussion about the alternative broadcasting system which might help to prepare the new era of broadcasting.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.253-262
• /
• 2016

This paper proposes a balance-swap method for the dynamic economic load dispatch problem. Based on the premise that all generators shall be operated at valve-points, the proposed algorithm initially sets the maximum generation power at $P_i{\leftarrow}P_i^{max}$. As for generator i with $_{max}c_i$, which is the maximum operating cost $c_i=\frac{F(P_i)-F(P_{iv_k})}{(P_i-P_{iv_k})}$ produced when the generation power of each generator is reduced to the valve-point $v_k$, the algorithm reduces i's generation power down to $P_{iv_k}$, the valve-point operating cost. When ${\Sigma}P_i-P_d$ > 0, it reduces the generation power of a generator with $_{max}c_i$ of $c_i=F(P_i)-F(P_i-1)$ to $P_i{\leftarrow}P_i-1$ so as to restore the equilibrium ${\Sigma}P_i=P_d$. The algorithm subsequently optimizes by employing an adult-step method in which power in the range of $_{min}\{_{max}(P_i-P_i^{min}),\;_{max}(P_i^{max}-P_i)\}$>${\alpha}{\geq}10$ is reduced by 10; a baby step method in which power in the range of 10>${\alpha}{\geq}1$ is reduced by 1; and a swap method for $_{max}[F(P_i)-F(P_i-{\alpha})]$>$_{min}[F(P_j+{\alpha})-F(P_j)]$, $i{\neq}j$ of $P_i=P_i{\pm}{\alpha}$, in which power is swapped to $P_i=P_i-{\alpha}$, $P_j=P_j+{\alpha}$. It finally executes minute swap process for ${\alpha}=\text{0.1, 0.01, 0.001, 0.0001}$. When applied to various experimental cases of the dynamic economic load dispatch problems, the proposed algorithm has proved to maximize economic benefits by significantly reducing the optimal operating cost of the extant Heuristic algorithm.

• Asia pacific journal of information systems
• /
• v.17 no.2
• /
• pp.97-122
• /
• 2007

Conventional networking and telecommunications infrastructure characterized by wires, fixed location, and inflexibility is giving way to mobile technologies. Numerous research reports point to the ultimate domination of wireless communication. With the increasing prevalence of advanced cell-phones, various mobile data services (hereafter MDS) are gaining popularity. Although cellular networks were originally introduced for voice communications, statistics indicate that data services are replacing the matured voice service as the growth engine for telecom service providers. For example, SK Telecom, the Korea's largest mobile service provider, reported that 25.6% of revenue and 28.5% of profit came from MDS in 2006 and the share is growing. Statistics also indicate that, in 2006, the average revenue per user (ARPU) for voice didn't change but MDS grew seven percents from the previous year, further highlighting its growth potential. MDS is defined "as an assortment of digital data services that can be accessed using a mobile device over a wide geographic area." A variety of MDS have been deployed, with a few reaching the status of killer applications. Many of them need to access the Internet through the cellular-phone infrastructure. In the past, when the cellular network didn't have acceptable bandwidth for data services, SMS (short messaging service) dominated MDS. Now, Internet-ready, next-generation cell-phones are driving rich digital data services into the fabric of everyday life, These include news on various topics, Internet search, mapping and location-based information, mobile banking and gaming, downloading (i.e., screen savers), multimedia streaming, and various communication services (i.e., email, short messaging, messenger, and chaffing). The huge economic stake MDS has on its stakeholders warrants focused research to understand associated dynamics behind its adoption. Lyytinen and Yoo(2002) pointed out the limitation of traditional adoption models in explaining the rapid diffusion of innovations such as P2P or mobile services. Also, despite the increasing popularity of MDS, unexpected drop in its usage is observed among some people. Intrigued by these observations, an exploratory study was conducted to examine decision factors of MDS usage. Data analysis revealed that the increase and decrease of MDS use was influenced by different forces. The findings of the exploratory study triggered our confirmatory research effort to validate the uni-directionality of studied factors in affecting MDS usage. This differs from extant studies of IS/IT adoption that are largely grounded on the assumption of bi-directionality of explanatory variables in determining the level of dependent variables (i.e., user satisfaction, service usage). The research goal is, therefore, to examine if increase and decrease in the usage of MDS are explained by two separate groups of variables pertaining to information quality and system quality. For this, we investigate following research questions: (1) Does the information quality of MDS increase service usage?; (2) Does the system quality of MDS decrease service usage?; and (3) Does user motivation for subscribing MDS moderate the effect information and system quality have on service usage? The research questions and subsequent analysis are grounded on the two factor theory pioneered by Hertzberg et al(1959). To answer the research questions, in the first, an exploratory study based on 378 survey responses was conducted to learn about important decision factors of MDS usage. It revealed discrepancy between the influencing forces of usage increase and those of usage decrease. Based on the findings from the exploratory study and the two-factor theory, we postulated information quality as the motivator and system quality as the de-motivator (or hygiene) of MDS. Then, a confirmative study was undertaken on their respective role in encouraging and discouraging the usage of mobile data service.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. 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 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. 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 square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) 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 square root unit. Also, it can be used to construct optimized approximate reciprocal square root 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. 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 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{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 ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he 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 divider. 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

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.23-32
• /
• 2011

Design and Implementation of Clipcast Service via Terrestrial DMB This paper outlines the system design and the implementation process of clipcast service that can send clips of video, mp3, text, images, etc. to terrestrial DMB terminals. To provide clipcast service in terrestrial DMB, a separate data channel needs to be allocated and this requires changes in the existing bandwidth allocation. Clipcast contents can be sent after midnight at around 3 to 4 AM, when terrestrial DMB viewship is low. If the video service bit rate is lowered to 352 Kbps and the TPEG service band is fully used, then 320 Kbps bit rate can be allocated to clipcast. To enable clipcast service, the terminals' DMB program must be executed, and this can be done through SMS and EPG. Clipcast service applies MOT protocol to transmit multimedia objects, and transmits twice in carousel format for stable transmission of files. Therefore, 72Mbyte data can be transmitted in one hour, which corresponds to about 20 minutes of full motion video service at 500Kbps data rate. When running the clip transmitted through terrestrial DMB data channel, information regarding the length of each clip is received through communication with the CMS(Content Management Server), then error-free files are displayed. The clips can be provided to the users as preview contents of the complete VOD contents. In order to use the complete content, the user needs to access the URL allocated for that specific content and download the content by completing a billing process. This paper suggests the design and implementation of terrestrial DMB system to provide clipcast service, which enables file download services as provided in MediaFLO, DVB-H, and the other mobile broadcasting systems. Unlike the other mobile broadcasting systems, the proposed system applies more reliable SMS method to activate the DMB terminals for highly stable clipcast service. This allows hybrid, i.e, both SMS and EPG activations of terminals for clipcast services.

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

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