• Journal of Korea Multimedia Society
• /
• v.20 no.6
• /
• pp.960-968
• /
• 2017

Machinima is a new medium of artistic expression that allows creators to produce faster and cheaper 3D animated works than ever before. However, the software owner controls all rights in the game. The principle of fair use allows for limited use of works without permission of the copyright owner for certain purposes. The application of the principle of fair use to any particular machinima will depend on the specific circumstances. In conclusion, in order to maintain the balance between the copyright owner and the user, the reasonable role of the court in Korea seems to be more important in interpreting the fair use clause.

• Journal of the Korean Society for Library and Information Science
• /
• v.48 no.1
• /
• pp.387-413
• /
• 2014

The purpose of this paper is to understand copyright exemption for libraries including Copyright Act Article 31. Especially, it is focused on the impacts on fair use article which is recently introduced in Korean Copyright Act. It looks into completely copyright exemption which libraries can make use of. And then it also rearranges the resources which library can use without the copyright owner's permission. Further, it explores the meanings of fair use and the detail requirements for adoption to library services. And it analyzed some cases which can be applied substantially for library services.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3269-3277
• /
• 1999

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.26 no.3
• /
• pp.151-175
• /
• 2015

The study aims to discuss on legal prospects of digital collections' fair use through an analysis of treaties and legislations domestic and international. Based on analysis of leading researches and literature, it discusses legal principles of fair use and defines digital collections' concept and types. For understanding the actual legal system on fair use, limitations and exceptions of copyrights which are presented in treaties, such as 'Berne Convention for the Protection of Literary and Artistic Works' and'Copyright Convention', each nation's laws, and judicial precedents. Especially, a legal dispute between 'Technische $Universit{\ddot{a}}t$ Darmstadt' and Eugen Ulmer KG, which debates on library's rights for digitizing their collections without the rightholder's permission, is analyzed. As a result, this study analyzes its implications for the improvement of the existing copyright system in Korea.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.11-19
• /
• 2022

Data mining has broad applications that reach beyond scholarly and scientific research and provide internet search engine services that are commonly used forms of Text and Data Mining('TDM') of websites. The exceptions and limitations for data mining provide a competitive advantage in the global race for policy innovation because it permits researchers to conduct computational analysis - TDM on any materials to which they have access. For this purpose, Japan and the EU added limitations on copyright to legalize some TDM research through amendments to copyright law, and the U.S. copyright law has allowed data mining by the fair use provision. On the other hand, there are no explicit exceptions and limitations for data mining under the Korean Copyright Act, and there are no cases considering data mining fair use. We review comparatively exceptions and limitations on copyright which will help to encourage AI-related business by using more data smoothly through the mining process and extracting more valuable information.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.624-633
• /
• 2018

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.910-917
• /
• 2000

Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.2
• /
• pp.217-222
• /
• 2020

The concept and discussion of copyright should reflect changes in using environments of digital properties and developments of technology. Further discussions are required about protection, transfer and usage of copyright for user created contents or digital activities. Digital archives should clarify the ranges of permitted usage or guides to quotation. One should not be biased toward regulating digital copying, but consider the value of diverse transformation of digital properties. This will trigger tension between private and public usage, or sharing of digital fabrications, which leads to the necessity of discussions on policy level. The interpretation of copyright is limited to protecting the copyright owner's right, but it should be suggested to widen the range to permitting fair use. The extended fair use of digital contents and by clarifying specific rules will activate creation and distribution of digital contents and contribute to more productive usage of innovation.

• Korean Journal of Health Education and Promotion
• /
• v.32 no.2
• /
• pp.75-84
• /
• 2015

Objectives: This study examines that the compatibilities between the health promotion programs in community health center and the leading health indicators in National Health Plan. Methods: We analyzed health promotion programs associated with three health indicators; smoking(smoking rate in male), alcohol use(alcohol use rate in adults), obesity(obesity rate) in twenty five community health centers in Seoul. First, we classified three groups(excellent, fair and poor groups) using average scores of Seoul, that of Korea and National Health Plan2010 goals in three health indicators. Afterwards, we examined the compatibility between contents of health promotion programs regarding leading health indicators and the specific program activities. Results: The compatibility levels between health indicators and contents of health promotion programs was 80 % for smoking among fair and poor groups while fair and poor for smoking reported 60% and 70%, respectively. For obesity, excellent group reported 80% and fair group had 91%. Conclusion: In conclusion, although all districts were able to access available data for health indicators and health statistics every year, it seems that they did not only utilize these data enough in conjunction with health promotion programs but also did not integrate specific activities according to National Health Plan systematically.