• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.721-725
• /
• 2014

In this paper, we propose a fast adaptive power allocation method for an orthogonal frequency division multiple access (OFDMA) system that employs an adaptive modulation and coding (AMC) scheme. The proposed scheme aims to reduce the calculation complexity of greedy adaptive power allocation (APA), which is known as the optimal algorithm for maximizing the utility argument of power. Unlike greedy APA, which starts power allocation from "0", the proposed algorithm initially allocates a certain level of power determined by the water-filling scheme. We theoretically demonstrate that the proposed algorithm has almost the same capability of maximizing the utility argument as the greedy APA while reducing the number of operations by 2M, where M is the number of AMC levels.

• Language and Information
• /
• v.17 no.2
• /
• pp.67-91
• /
• 2013

This paper describes Korean Nominal Bank, a project that provides argument structure for instances of the predicative nouns in the Sejong parsed Corpus. We use the language resources of the Sejong project, so that the same set of data is annotated with more and more levels of annotation, since a new type of a language resource building project could bring new information of separate and isolated processing. We have based on the annotation scheme based on the Sejong electronic dictionary, semantically tagged corpus, and syntactically analyzed corpus. Our work also involves the deep linguistic knowledge of syntaxsemantic interface in general. We consider the semantic theories including the Frame Semantics of Fillmore (1976), argument structure of Grimshaw (1990) and argument alternation of Levin (1993), and Levin and Rappaport Hovav (2005). Various syntactic theories should be needed in explaining various sentence types, including empty categories, raising, left (or right dislocation). We also need an explanation on the idiosyncratic lexical feature, such as collocation and etc.

• Journal of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.691-699
• /
• 2009

In this paper, we establish a multiple existence result of T-periodic solutions for the semilinear parabolic boundary value problem with sublinear growth nonlinearities. We adapt sub-supersolution scheme and topological argument based on variational structure of functionals.

• Journal of Educational Research in Mathematics
• /
• v.27 no.4
• /
• pp.701-725
• /
• 2017

Students need to have opportunities to share their ideas with peers by taking part in the conversation voluntarily that is, by persuading others and reflecting the consequences. Recognizing the importance of this point, this study intended to examine students' argumentation occurring in the process of performing tasks in the math classroom. Also, it tried to explore the types of the argument that students used in the classroom and the reason why they employed them with a focus on 'rebuttal', which is one of the six elements of the argument scheme such as claim, data, warrent, backing, qualifiers, and rebuttal. The analysis of argumentation is based on the five argumentation schemes suggested by Verheij(2005). The experimental class was conducted twice a week with four participants who are third grade middle school students. In the argumentation class students were promoted to address two different kinds of geometrical tasks. After the second session of class, the researcher conducted the semi-structured interview. Accordingly, this study contributes to the existing research by making students to have concrete and active argumentation while obtaining the sound understanding of the argumentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.11-20
• /
• 2005

Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also blown that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

• Journal of The Korean Association For Science Education
• /
• v.38 no.2
• /
• pp.249-257
• /
• 2018

The purpose of this study was to analyze the knowledge and ability levels of middle school students in four areas: conceptual understanding, argument construction, justification schemes, and use of scientific knowledge in a causal explanation for a genetic phenomenon. A group of 162 middle school students who have taken a class titled Genetics and Evolution participated in the study. Each student answered-and justified the answer to-one question pertaining to genetics. Ability levels were rated from level 0 to level 4, with 4 being the top rating. Students were required to choose one of two competing arguments to explain whether green seed pimps and red seed pimps of the same size and shape were the same species or not. Analyzing conceptual understanding: 47% of the respondents provided the correct answer. Analyzing their abilities for constructing an argument: 75% of the students with the correct answer and 42% of the students with the incorrect answer were evaluated to be at ability level 3 or 4 for argument construction. Analyzing the students' justification schemes: "Scientific idea" and "Analogy" were the most frequently used schemes. Analyzing their use of scientific knowledge: of the students who selected the scientific idea justification scheme, 36% used the correct scientific knowledge, but the remainder used inaccurate or nonspecific scientific knowledge. These findings provide implication for encouraging argumentative writing explaining scientific phenomena regarding epistemic practice.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.618-627
• /
• 2014

Nowadays mobile users are using a popular service called Location-Based Services (LBS). LBS is very helpful for a mobile user in finding various Point of Interests (POIs) in their vicinity. To get these services, users must provide their personal information, such as user identity or current location, which severely risks the location privacy of the user. Many researchers are developing schemes that enable a user to use these LBS services anonymously, but these approaches have some limitations (i.e., either the privacy prevention mechanism is weak or the cost of the solution is too much). As such, we are presenting a robust scheme for mobile users that allows them to use LBS anonymously. Our scheme involves a client side application that interacts with an untrusted LBS server to find the nearest POI for a service required by a user. The scheme is not only efficient in its approach, but is also very practical with respect to the computations that are done on a client's resource constrained device. With our scheme, not only can a client anonymously use LBS without any use of a trusted third party, but also a server's database is completely secure from the client. We performed experiments by developing and testing an Android-based client side smartphone application to support our argument.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1191-1199
• /
• 2009

As the Internet service evolves from the best effort data service to a multimedia service such as a mix of voice, data and video, a need for the guarantee of the quality of service to network services became one of the hot issues for the network operators. On the other hand, the introduction of the multimedia services over the IP network requires a managed differentiated service that adopts a prioritized treatment of packets. This incurs a need for a differentiated pricing scheme for the packets that receive different level of quality of service. This work proposes an analytic framework about packet pricing scheme for these services, and investigate the effect of service differentiation to the packet price for each class. Via numerical experiment, we validate our argument and illustrate the implication of the work.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.49-60
• /
• 2023

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution.

• School Mathematics
• /
• v.18 no.1
• /
• pp.85-103
• /
• 2016

This study was to find characteristics of argumentation derived from a discourse in a math-gifted 5 grade class, which was held for finding a Pick's formula using Geoboard function of TI-73 calculator. For the analysis, a video record of the class, transcript of its voice record, and activity paper were used as data and Toulmin's argument schemes were applied as analysis standard. As a result of the study, we found that the graphing calculator helped the students to create an experimental environment that graphing a grid-polygon and figuring out its area. Furthermore, it also provided a basic demonstration through 'data->claim' composition and reasoning activities which consisted of guarantee, warrant, backing, qualifier and refutal for justifying. The basic argumentation during the process of deriving the Pick's theorem by the numbers of boundary points and inner points was developed into a 'collective argumentation' while a teacher took a role of a conductor of the argumentation and an authorizer on the knowledge at the same time.