• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.12
• /
• pp.2387-2393
• /
• 2017

The Moon government, launched in May 2017, regards telecommunication service as part of people's welfare and is trying to save telecommunication costs. However, the direction of policy presented is assessed as symptomatic approach. This is largely attributable to the a partial improvement approach from the framework of the present mobile telecommunication industry. However if we restart from an essential point of view, the result is likely to be much better. The nation's mobile communication costs are not adequate because the government's role was not sufficient. There is a problem with the mobile phone supply chain, the subsidy payment mechanism, and the billing system. Addressing these complex issues requires the establishment of an independent system of handset distribution from telecommunication companies, ban on discriminative subsidies payment, and adoption of volume rate system. Telecommunications Business Act that defines the service charges to normalize the market might be somewhat useful, but the normal application of the Fair Trade Act is more important.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1367-1374
• /
• 2004

For sharing XML data by many users, a way of concurrency and access control is required for isolating update actions such as inserting and deleting subtrees. Exisiting locking mechanisms as 2PL or MGL suffer low concurrency when applied to tree structures. In this paper, list data subtrees model is proposed based on the semantics expressed in DTD. In this model, tree updating actions such as inserting and deleting subtrees are considered only for the repetitive parts of XML trees. The proposed model guarantees that the result XML tree after applying a tree updating action is always valid, even when multiple users access the tree at the same time. Also, a new locking mechanism called list lock-ing protocol is proposed. The new locking protocol is expected to show better accessility with less number of locking objects compared to the Helmer's OO2PL model. Since update actions on a shared XML tree usually applied to the repetitive parts of the tree, the proposed model is expected to provide a useful way for efficient data sharing when combined with previous locking methods on terminal node data.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1417-1426
• /
• 2004

As Ubiquitous commerce is coming personalization service is getting interested. And also the recommendation method which offers useful information to customer becomes more important. However, most of them depend on specific method and are restricted to the E-commerce. For applying these recommendation methods into U-commerce, first it is necessary that the extended context modeling and systematic connection of the methods to complement strength and weakness of recommendation methods in each commercial transaction. Therefore, we propose a mod-eling technique of context information related to personal activation in commercial transaction and show incremental preference analysis method, using preference tree which is closely connected to recommendation method in each step. And also, we use an XML indexing technique to effi-ciently extract the recommendation information from a preference tree.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1205-1212
• /
• 2004

As electronic commerce systems have been widely used, the necessity of adaptive e-commerce agent systems has been increased. These kinds of adaptive e-commerce agents can monitor customer's behaviors and cluster thou in similar categories, and include user's preference from each category. In order to implement our adaptive e-commerce agent system, in this paper, we propose an adaptive e-commerce agent systems consider customer's information of interest and goodwill ratio about preference goods. Proposed system build user's profile more accurately to get adaptability for user's behavior of buying and provide useful product information without inefficient searching based on such user's profile. The proposed system composed with three parts , Monitor Agent which grasps user's intension using monitoring, similarity reference Agent which refers to similar group of behavior pattern after teamed behavior pattern of user, Interest Analyzing Agent which personalized behavior DB as a change of user's behavior.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.17-24
• /
• 2018

The HEC-HMS model was applied to identify the rainfall-runoff processes for the Anseongchun basin, where the lower part of the stream has been damaged severely by tropical storms in the past. Modeling processes include incorporating with the SCS-CN model for loss, Clark's UH model for transformation, exponential recession model for baseflow, and Muskingum model for channel routing. The parameters were calibrated through an optimization technique using a trial and error method. Sensitivity analysis after calibration was performed to understand the effects of parameters, such as the time of concentration, storage coefficient, and base flow related constants. Two storm water events were simulated by the model and compared with the corresponding observations. Good accuracy in predicting the runoff volume, peak flow, and the time to peak flow was achieved using the selected methods. The results of this study can be used as a useful tool for decision makers to determine a master plan for regional flood control management.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.293-302
• /
• 2007

The study of the web graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution, also it is useful for understanding the evolution process of web graph and predicting the scale of the Web. In this paper, we report experimental results on properties of the Korea web graph with over 116 million pages and 2.7 billion links. We indicate to study the Korea web properties such as the power law phenomenon and then to analyze the similarity and difference between the global and Korea web graph. Our analysis reveals the Korea web graph have different properties compared with the global web graph from the structure to the evolution of the Web. Finally, a number of measurements of the evolution of the Korea web graph ill be represented.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.325-332
• /
• 2011

Social Network Services(SNS) such as Twitter, Facebook and Myspace have gained popularity worldwide. Especially, sentiment analysis of SNS users' sentence is very important since it is very useful in the opinion mining. In this paper, we propose a new sentiment classification method of sentences which contains formal and informal vocabulary such as emoticons, and newly coined words. Previous methods used only formal vocabulary to classify sentiments of sentences. However, these methods are not quite effective because internet users use sentences that contain informal vocabulary. In addition, we construct suggest to construct domain sentiment vocabulary because the same word may represent different sentiments in different domains. Feature vectors are extracted from the sentiment vocabulary information and classified by Support Vector Machine(SVM). Our proposed method shows good performance in classification accuracy.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.543-554
• /
• 2009

The openness of the Web allows any user to access any type of information easily at any time and anywhere. However, with function of easy access for useful information, internet has dysfunctions of providing users with harmful contents indiscriminately. Some information, such as adult content, is not appropriate for children. To protect children from these harmful contents, many filtering softwares are developed. However, these softwares can not prevent harmful contents, perfectly, because of some limitations. In this paper, we analyze existing eleven filtering softwares and state the limitation of these softwares. Furthermore, we propose requirements for new filtering software which overcomes the limitations, and describe framework of the new software.