• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.4
• /
• pp.17-24
• /
• 2023

In computer graphics and computer vision research and its applications, various representations of 3D objects, such as point clouds, voxels, or triangular meshes, are used depending on the purpose. The need for animating characters using these representations is also growing. In a typical animation pipeline called skeletal animation, "skinning weight painting" is required to determine how joints influence a vertex on the character's skin. In this paper, we introduce a neural network for automatically performing skinning weight painting for characters represented in various formats. We utilize signed distance fields (SDF) to handle different representations and employ graph neural networks and multi-layer perceptrons to predict the skinning weights for a given point.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.4
• /
• pp.79-86
• /
• 2016

About 75% of software security incidents are caused by software vulnerability. In addition, the after-market repairing cost of the software is higher by more than 30 times than that in the design stage. In this background, the secure coding has been proposed as one of the ways to solve this kind of maintenance problems. Various institutions have addressed the weakness patterns of the standard software. A new Korean programming language Saesark has been proposed to resolve the security weakness on the language level. However, the previous study on Saesark can not resolve the security weakness caused by the API. This paper proposes a way to resolve the security weakness due to the API. It adopts a static analyzer inspecting dangerous methods. It classifies the dangerous methods of the API into two groups: the methods of using tainted data and those accepting in-flowing tainted data. It analyses the security weakness in four steps: searching for the dangerous methods, configuring a call graph, navigating a path between the method for in-flowing tainted data and that uses tainted data on the call graph, and reporting the security weakness detected. To measure the effectiveness of this method, two experiments have been performed on the new version of Saesark adopting the static analysis. The first experiment is the comparison of it with the previous version of Saesark according to the Java Secure Coding Guide. The second experiment is the comparison of the improved Saesark with FindBugs, a Java program vulnerability analysis tool. According to the result, the improved Saesark is 15% more safe than the previous version of Saesark and the F-measure of it 68%, which shows the improvement of 9% point compared to 59%, that of FindBugs.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.894-903
• /
• 2003

Though XML is widely used, it is still hard for end users to write XML documents. A lot of XML documents are data-centric documents which have formal data format. Even novices can easily write the data-centric XML documents if they use form-based GUIs. In this paper, we introduce a new method for generating form-based XML editor for data-centric XML documents automatically and an XML editor generator called XED. The DTD consists of sequence, choice, and repetition, and this structure can be represented with Document Decomposition Graph(DDG). XED allows users to generate an XML editor by applying the presentation rules to DDG. It also permits users to modify generated editor through changing editor`s GUI properties with direct manipulation.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.117-124
• /
• 2006

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.4
• /
• pp.149-154
• /
• 2014

A user should pick up relevant answers by himself from various search results when using user participation question answering community like Knowledge-iN. If refined answers are automatically provided, usability of question answering community must be improved. This paper divides questions in Q&A documents into 4 types(word, list, graph and text), then proposes summarizing methods for each question type using document statistics. Summarized answers for word, list and text type are obtained by question clustering and calculating scores for words using frequency, proximity and confidence of answers. Answers for graph type is shown by extracting user opinion from answers.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3097-3110
• /
• 1997

As to the recent advances in computer technologies and high-speed networks, telecommunication services and provision of multimedia services will be provided on the basic of a new software architecture adapting networking infrastructure on open information networking architecture. In this paper, the video conference services has been selected as a target service example because it is expected to become one of the most important services on the full service network. In fact, it can be viewed as the basis for providing telecommunication services such as video telephony and video conferencing. This paper presents the prototyping of TINA (Telecommunication Information Networking Architecture) based desktop video conference system using the concepts of session management. The prototyping of desktop video conference system aims at assessing TINA concepts and refinement of the mapping between session graph and connection graph, and provides object modeling methodologies towards distribution and objected-orientation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2498-2511
• /
• 1997

Due to the recent advances in computer technologies and high-speed networks, telecommunication services and provision of multimedia services will be considered a new software architecture adapting networking infrastructure on information networking architecture. In this paper, the video conference services has been selected as a target service example because it is expected to become one of the most important services on the full service network. In fact, it can be viewed as the basis for providing telecommunication services such as video telephony and video conferencing. This paepr presents the prototyping of TINA(Telecommunication Information Networking Architecture) based desktop video conference system using the concepts of session management. The prototyping of deskop video conference system aims at assessing TINA concepts and refinement of the mapping between session graph and connection graph, and provides support of open service platform towards distribution and objected-orientation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1336-1356
• /
• 2017

The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.