• 제목/요약/키워드: combinatorial model

검색결과 100건 처리시간 0.022초

A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction

  • Xia, Yunhao;Hong, Hanshu;Lin, Guofeng;Sun, Zhixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4197-4219
    • /
    • 2017
  • Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.

Quantitative Frameworks for Multivalent Macromolecular Interactions in Biological Linear Lattice Systems

  • Choi, Jaejun;Kim, Ryeonghyeon;Koh, Junseock
    • Molecules and Cells
    • /
    • 제45권7호
    • /
    • pp.444-453
    • /
    • 2022
  • Multivalent macromolecular interactions underlie dynamic regulation of diverse biological processes in ever-changing cellular states. These interactions often involve binding of multiple proteins to a linear lattice including intrinsically disordered proteins and the chromosomal DNA with many repeating recognition motifs. Quantitative understanding of such multivalent interactions on a linear lattice is crucial for exploring their unique regulatory potentials in the cellular processes. In this review, the distinctive molecular features of the linear lattice system are first discussed with a particular focus on the overlapping nature of potential protein binding sites within a lattice. Then, we introduce two general quantitative frameworks, combinatorial and conditional probability models, dealing with the overlap problem and relating the binding parameters to the experimentally measurable properties of the linear lattice-protein interactions. To this end, we present two specific examples where the quantitative models have been applied and further extended to provide biological insights into specific cellular processes. In the first case, the conditional probability model was extended to highlight the significant impact of nonspecific binding of transcription factors to the chromosomal DNA on gene-specific transcriptional activities. The second case presents the recently developed combinatorial models to unravel the complex organization of target protein binding sites within an intrinsically disordered region (IDR) of a nucleoporin. In particular, these models have suggested a unique function of IDRs as a molecular switch coupling distinct cellular processes. The quantitative models reviewed here are envisioned to further advance for dissection and functional studies of more complex systems including phase-separated biomolecular condensates.

Dynamic Collaborative Cloud Service Platform: Opportunities and Challenges

  • Yoon, Chang-Woo;Hassan, Mohammad Mehedi;Lee, Hyun-Woo;Ryu, Won;Huh, Eui-Nam
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.634-637
    • /
    • 2010
  • This letter presents a model for a dynamic collaboration (DC) platform among cloud providers (CPs) that prevents adverse business impacts, cloud vendor lock-in and violation of service level agreements with consumers, and also offers collaborative cloud services to consumers. We consider two major challenges. The first challenge is to find an appropriate market model in order to enable the DC platform. The second is to select suitable collaborative partners to provide services. We propose a novel combinatorial auction-based cloud market model that enables a DC platform among CPs. We also propose a new promising multi-objective optimization model to quantitatively evaluate the partners. Simulation experiments were conducted to verify both of the proposed models.

표적군 기반 공격 편대군 조합 최적화 모형 (Combinatorial Optimization Model of Air Strike Packages based on Target Groups)

  • 조상현;이문걸;장영배
    • 대한산업공학회지
    • /
    • 제42권6호
    • /
    • pp.386-394
    • /
    • 2016
  • In this research, in order to optimize the multi-objective function effectively, we suggested the optimization model to maximize the total destruction of ground targets and minimize the total damage of aircrafts and cost of air munitions by using goal programming. To satisfy the various variables and constraints of this mathematical model, the concept of air strike package is applied. As a consequence, effective attack can be possible by identifying the prior ground targets more quickly. This study can contribute to maximize the ROK air force's combat power and preservation of high value air asset in the war.

순열 조합 이해 과제에서의 안구 운동 추적 연구 (Eye Movements in Understanding Combinatorial Problems)

  • 최인용;조한혁
    • 대한수학교육학회지:수학교육학연구
    • /
    • 제26권4호
    • /
    • pp.635-662
    • /
    • 2016
  • 조합(combinatorics)은 확률적 사고의 기초가 되며 정보, 과학 등 타교과와 연계성이 높은 중요한 영역이지만, 학교 수학에서 학생들이 가장 어려워하는 단원 중 하나이다. 본 연구는 순열 조합 문제의 구조를 나타낼 수 있는 표현식을 도입하여, 문제를 표현식으로 변환하는 대학원생의 안구 운동을 분석함으로써 순열 조합 문장제의 이해 과정과 의미 구조에 따른 난이도 차이를 조사하였다. 연구 결과, 연구참여자들의 순열 조합 문장제 이해 전략은 문제에 대한 수학적 모델을 내적으로 직접 표상하는 전략과 보기에 주어진 표현식과 문제를 비교하여 답을 찾는 전략으로 분류할 수 있었다. 전문가 집단인 연구참여자들은 대상들의 구별성, 중복가능성, 의미 구조에 관한 단어나 수치 정보 등 문제의 핵심정보를 빠르게 파악하고 주의를 기울였다. 의미 구조의 변환이 필요한 문제를 풀 때 학생들은 문제의 핵심정보를 더 많이 보고, 보기의 표현식을 더 오래 응시하며, 문제와 보기 사이의 비교를 더 많이 하는 등 복잡한 인지 처리와 연관된 안구운동 지표가 나타났다. 안구 운동 데이터는 문제 이해 과정에서 연구참여자의 수학적 인지를 분석하는데 유의미한 정보를 제공하였다.

경사지 경지정리지구의 등고선 구획 최적설계 (Optimal Design of Contour-Lined Plots for Land Consolidation Planning in Sloping Areas)

  • 강민구;박승우;강문성;김상민
    • 한국농공학회지
    • /
    • 제45권6호
    • /
    • pp.83-95
    • /
    • 2003
  • In this study, a new concept in a paddy consolidation project is introduced in that curved parallel terracing with contour-lined layout is adopted in sloping areas instead of conventional rectangular terracing. The contoured layout reduces earth-moving considerably compared to rectangular methods in consolidation projects. The objective of the paper is to develop a combinatorial optimization model using the network theory for the design of contour-lined plots which minimizes the volume of earth moving. The results showed that as the length of short side of plot is longer or the land slope is steeper, the volume of earth moving for land leveling increases. The developed optimization model is applied for three consolidated districts and the resulting optimal earth moving is compared with the volume of earth from the conventional method. The shorter is the minimum length of short side of a polt with increases the number of plots, the less is the volume of earth. As the minimum length of short side is 20 m for efficient field works by farm machinery, the volume of earth moving of optimal plot is less by 21.0∼27.1 % than that of the conventional consolidated plots.

다수요인을 가진 설비배치문제를 위한 모형과 simulated annealing 알고리즘 (A Model and Simulated Annealing Algorithm for the Multi-factor Plant Layout Problem)

  • 홍관수
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.63-81
    • /
    • 1995
  • This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

  • PDF

General Set Covering for Feature Selection in Data Mining

  • Ma, Zhengyu;Ryoo, Hong Seo
    • Management Science and Financial Engineering
    • /
    • 제18권2호
    • /
    • pp.13-17
    • /
    • 2012
  • Set covering has widely been accepted as a staple tool for feature selection in data mining. We present a generalized version of this classical combinatorial optimization model to make it better suited for the purpose and propose a surrogate relaxation-based procedure for its meta-heuristic solution. Mathematically and also numerically with experiments on 25 set covering instances, we demonstrate the utility of the proposed model and the proposed solution method.

SNP 조합 인자들의 진화적 학습 방법 기반 질병 관련 복합적 위험 요인 추출 (Identifying Compound Risk Factors of Disease by Evolutionary Learning of SNP Combinatorial Features)

  • 이제근;하정우;배설희;김수진;이민수;박근준;장병탁
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제15권12호
    • /
    • pp.928-932
    • /
    • 2009
  • 생체 내에서 질병 발생은 다양한 요인들의 복합적인 작용에 의해 발생한다. 하지만, 대부분의 질병 관련 원인을 발견하고자하는 연구들에서는 여러 요인들의 다양한 조합들을 복합적으로 고려하여 분석하기에는 한계가 있는 경우가 많다. 단 하나의 질병 관련 요인들을 찾는 것데 그치고 있다. 본 연구에서는 유전체 정보과 임상 정보를 이용하여 질병 분류 모델 기반 인자 조합들의 진화적 학습 방법을 제안한다. 이 방법을 이용하여 본 연구에서는 질병 관련 주요 인자를 찾고, 이를 시각화할 수 있는 시스템을 만드는 것을 목적으로 한다. 본 연구를 통해 정확도 높은 당뇨병 환자군 분류 모델을 만들고, 당뇨병 발생에 중요한 영향을 미치는 인자들의 조합을 찾을 수 있었다. 또한 생뭍학적인 분석을 통해 본 연구에서 찾은 인자들의 조합이 실제로도 당뇨병 발생에 영향을 미치는 인자가 될 수 있음을 확인하고, 특히 각 인자들이 하나씩 존재할 때보다. 조합으로 존재할 경우 당뇨병 발생 가능성이 높아질 수 있음을 확인할 수 있었다.