• Title/Summary/Keyword: combinatorial approach

Search Result 116, Processing Time 0.027 seconds

Exploring Efficient Solutions for the 0/1 Knapsack Problem

  • Dalal M. Althawadi;Sara Aldossary;Aryam Alnemari;Malak Alghamdi;Fatema Alqahtani;Atta-ur Rahman;Aghiad Bakry;Sghaier Chabani
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.2
    • /
    • pp.15-24
    • /
    • 2024
  • One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

Game Based Cooperative Negotiation among Cloud Providers in a Dynamic Collaborative Cloud Services Platform (게임 이론 기반 동적 협력 클라우드 서비스 플랫폼에서의 클라우드 공급자간 협상 기법)

  • Hassan, Mohammad Mehedi;Huh, Eui-Nam
    • Journal of Internet Computing and Services
    • /
    • v.11 no.5
    • /
    • pp.105-117
    • /
    • 2010
  • In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.

Generation of single stranded DNA with selective affinity to bovine spermatozoa

  • Vinod, Sivadasan Pathiyil;Vignesh, Rajamani;Priyanka, Mani;Tirumurugaan, Krishnaswamy Gopalan;Sivaselvam, Salem Nagalingam;Raj, Gopal Dhinakar
    • Animal Bioscience
    • /
    • v.34 no.10
    • /
    • pp.1579-1589
    • /
    • 2021
  • Objective: This study was conducted to generate single stranded DNA oligonucleotides with selective affinity to bovine spermatozoa, assess its binding potential and explore its potential utility in trapping spermatozoa from suspensions. Methods: A combinatorial library of 94 mer long oligonucleotide was used for systematic evolution of ligands by exponential enrichment (SELEX) with bovine spermatozoa. The amplicons from sixth and seventh rounds of SELEX were sequenced, and the reads were clustered employing cluster database at high identity with tolerance (CD-HIT) and FASTAptamer. The enriched nucleotides were predicted for secondary structures by Mfold, motifs by Multiple Em for Motif Elicitation and 5' labelled with biotin/6-FAM to determine the binding potential and binding pattern. Results: We generated 14.1 and 17.7 million reads from sixth and seventh rounds of SELEX respectively to bovine spermatozoa. The CD-HIT clustered 78,098 and 21,196 reads in the top ten clusters and FASTAptamer identified 2,195 and 4,405 unique sequences in the top three clusters from the sixth and seventh rounds, respectively. The identified oligonucleotides formed secondary structures with delta G values between -1.17 to -26.18 kcal/mol indicating varied stability. Confocal imaging with the oligonucleotides from the seventh round revealed different patterns of binding to bovine spermatozoa (fluorescence of the whole head, spot of fluorescence in head and mid- piece and tail). Use of a 5'-biotin tagged oligonucleotide from the sixth round at 100 pmol with 4×106 spermatozoa could trap almost 80% from the suspension. Conclusion: The binding patterns and ability of the identified oligonucleotides confirms successful optimization of the SELEX process and generation of aptamers to bovine spermatozoa. These oligonucleotides provide a quick approach for selective capture of spermatozoa from complex samples. Future SELEX rounds with X- or Y- enriched sperm suspension will be used to generate oligonucleotides that bind to spermatozoa of a specific sex type.

Factors Influencing Innovation Performance through Industry-Research Institute Cooperation of Researchers at Government-Funded Research Institutes in Daedeok Innopolis: An fsQCA Approach (대덕연구개발특구 정부출연연연구기관 연구자의 산연협력 혁신성과 결정요인 분석: 퍼지집합 질적 비교분석 접근)

  • Hwang, Kyung-Yun;Sung, Eul-Hyun
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.7
    • /
    • pp.221-233
    • /
    • 2021
  • The purpose of this study is to analyze the effects of determinants of innovation performance on innovation performance in industry-research institute(IR) cooperation for researchers of government-funded research institutes in Daedeok Innopolis. We reviewed the existing literature on the determinants of innovation performance through cooperation, and established a conceptual framework to analyze the combinatorial effect of the determinants of innovation performance on innovation performance in IR cooperation. Data for empirical analysis were collected through a questionnaire survey targeting researchers at a government-funded research institute in Daedeok Innopolis. The fuzzy-set qualitative comparative analysis (fsQCA) was used to analyze the combined effect of determinants of innovation performance. The fsQCA results show that the configuration of high motivation, high trust, high commitment and high satisfaction of researchers of government-funded research institutes improve innovation performance. On the other hand, it shows that the configuration of high motivation, high trust, low commitment and low satisfaction of the researcher improves innovation performance.

A prognosis discovering lethal-related genes in plants for target identification and inhibitor design (식물 치사관련 유전자를 이용하는 신규 제초제 작용점 탐색 및 조절물질 개발동향)

  • Hwang, I.T.;Lee, D.H.;Choi, J.S.;Kim, T.J.;Kim, B.T.;Park, Y.S.;Cho, K.Y.
    • The Korean Journal of Pesticide Science
    • /
    • v.5 no.3
    • /
    • pp.1-11
    • /
    • 2001
  • New technologies will have a large impact on the discovery of new herbicide site of action. Genomics, combinatorial chemistry, and bioinformatics help take advantage of serendipity through tile sequencing of huge numbers of genes or the synthesis of large numbers of chemical compounds. There are approximately $10^{30}\;to\;10^{50}$ possible molecules in molecular space of which only a fraction have been synthesized. Combining this potential with having access to 50,000 plant genes in the future elevates tile probability of discovering flew herbicidal site of actions. If 0.1, 1.0 or 10% of total genes in a typical plant are valid for herbicide target, a plant with 50,000 genes would provide about 50, 500, and 5,000 targets, respectively. However, only 11 herbicide targets have been identified and commercialized. The successful design of novel herbicides depends on careful consideration of a number of factors including target enzyme selections and validations, inhibitor designs, and the metabolic fates. Biochemical information can be used to identify enzymes which produce lethal phenotypes. The identification of a lethal target site is an important step to this approach. An examination of the characteristics of known targets provides of crucial insight as to the definition of a lethal target. Recently, antisense RNA suppression of an enzyme translation has been used to determine the genes required for toxicity and offers a strategy for identifying lethal target sites. After the identification of a lethal target, detailed knowledge such as the enzyme kinetics and the protein structure may be used to design potent inhibitors. Various types of inhibitors may be designed for a given enzyme. Strategies for the selection of new enzyme targets giving the desired physiological response upon partial inhibition include identification of chemical leads, lethal mutants and the use of antisense technology. Enzyme inhibitors having agrochemical utility can be categorized into six major groups: ground-state analogues, group specific reagents, affinity labels, suicide substrates, reaction intermediate analogues, and extraneous site inhibitors. In this review, examples of each category, and their advantages and disadvantages, will be discussed. The target identification and construction of a potent inhibitor, in itself, may not lead to develop an effective herbicide. The desired in vivo activity, uptake and translocation, and metabolism of the inhibitor should be studied in detail to assess the full potential of the target. Strategies for delivery of the compound to the target enzyme and avoidance of premature detoxification may include a proherbicidal approach, especially when inhibitors are highly charged or when selective detoxification or activation can be exploited. Utilization of differences in detoxification or activation between weeds and crops may lead to enhance selectivity. Without a full appreciation of each of these facets of herbicide design, the chances for success with the target or enzyme-driven approach are reduced.

  • PDF

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.