• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.96-112
• /
• 2020

Solving the disclosure problem of sensitive information with the k-nearest neighbor query, location dummy technique, or interfering data in location-based services (LBSs) is a new research topic. Although they reduced security threats, previous studies will be ineffective in the case of sparse users or K-successive privacy, and additional calculations will deteriorate the performance of LBS application systems. Therefore, a model is proposed herein, which is based on geohash-encoding technology instead of latitude and longitude, memcached server cluster, encryption and decryption, and authentication. Simulation results based on PHP and MySQL show that the model offers approximately 10× speedup over the conventional approach. Two problems are solved using the model: sensitive information in LBS application is not disclosed, and the relationship between an individual and a track is not leaked.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.852-861
• /
• 2000

Software reliability growth models are used in testing stages of software development to model the error content and time intervals betwewn software failures. In this paper, using priors for the number of fault with the negative binomial distribution nd the error rate with gamma distribution, Bayesian inference and model selection method for Jelinski-Moranda and Goel-Okumoto and Schick-Wolverton models in software reliability. For model selection, we explored the sum of the relative error, Braun statistic and median variation. In Bayesian computation process, we could avoid the multiple integration by the use of Gibbs sampling, which is a kind of Markov Chain Monte Carolo method to compute the posterior distribution. Using simulated data, Bayesian inference and model selection is studied.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1281-1292
• /
• 2020

More and more cloud computing services are being applied in various fields; however, it is difficult for users and cloud computing service platforms to establish trust among each other. The trust value cannot be measured accurately or effectively. To solve this problem, we design a service-oriented cloud trust assessment model using a cloud model. We also design a subjective preference weight allocation (SPWA) algorithm. A flexible weight model is advanced by combining SPWA with the entropy method. Aiming at the fuzziness and subjectivity of trust, the cloud model is used to measure the trust value of various cloud computing services. The SPWA algorithm is used to integrate each evaluation result to obtain the trust evaluation value of the entire cloud service provider.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.397-400
• /
• 2021

To solve the problem that existing computing methods cannot adequately represent the semantic features of sentences, Siamese TRAT, a semantic feature extraction model based on Transformer encoder is proposed. The transformer model is used to fully extract the semantic information within sentences and carry out deep semantic coding for sentences. In addition, the interactive attention mechanism is introduced to extract the similar features of the association between two sentences, which makes the model better at capturing the important semantic information inside the sentence. As a result, it improves the semantic understanding and generalization ability of the model. The experimental results show that the proposed model can improve the accuracy significantly for the semantic similarity calculation task of English and Chinese, and is more effective than the existing methods.

• Journal of Information Processing Systems
• /
• v.19 no.5
• /
• pp.652-662
• /
• 2023

Identifying highly discriminating genes is a critical step in tumor recognition tasks based on microarray gene expression profile data and machine learning. Gene selection based on tree models has been the subject of several studies. However, these methods are based on a single-tree model, often not robust to ultra-highdimensional microarray datasets, resulting in the loss of useful information and unsatisfactory classification accuracy. Motivated by the limitations of single-tree-based gene selection, in this study, ensemble gene selection methods based on multiple-tree models were studied to improve the classification performance of tumor identification. Specifically, we selected the three most representative tree models: ID3, random forest, and gradient boosting decision tree. Each tree model selects top-n genes from the microarray dataset based on its intrinsic mechanism. Subsequently, three ensemble gene selection methods were investigated, namely multipletree model intersection, multiple-tree module union, and multiple-tree module cross-union, were investigated. Experimental results on five benchmark public microarray gene expression datasets proved that the multiple tree module union is significantly superior to gene selection based on a single tree model and other competitive gene selection methods in classification accuracy.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2072-2075
• /
• 2000

While object-oriented models are effective in achieving sharing and code reusability, they unfortunately lack a mechanism for giving scope to objects. We revisit an object-oriented model in which each object can be given a scope. We illustrate the usefulness of this model by showing that it supports the notion of parameterized modules without difficulty.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.130-134
• /
• 2006

In the distributed replicating server model, the provision of replicated services will improve the performance of the providing service and efficiency for clients. Efficiently composing the server selection algorithm decreases the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides an optimal service using the server-side downstream measurement and propose a server selection algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.773-780
• /
• 1999

In this paper, we explore a behavioral animation of artificial birds that have lived by doing an aggregate motion. We first model individual birds and then propose a behavioral model for an aggregate motion of a flock of birds. In order to represent realistically collision avoidance and flock centering among birds, which are necessary properties in a flock of birds, we consider motive of a flock of birds, and role, velocity, momentum, banking and internal characteristics of each bird. The paper presents the simulation result of the proposed model for a flock of 100 birds.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.1030-1031
• /
• 2014

본 논문에서는 3D Skeleton Model로 획득된 관절 정보를 이용하여 제스처를 인식 할 수 있는 방법을 제안한다. 사람마다 각기 다른 신체 비율을 가지지만 각 관절 또는 신체의 구조는 같다는 사실을 바탕으로 관절의 각도를 기반으로 제스처를 인식하는 방법에 대해 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.1342-1345
• /
• 2011

A valid scenario generation is essential for model checking software. This paper suggests an automated scenario generation technique through the analysis of function called-by graphs and call graphs of the program source code. We provide the verification process including the scenario generation and show application results on the Trampoline operating system using CBMC as a back-end model checker.