intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Set Partitioning model

Xem 1-12 trên 12 kết quả Set Partitioning model
  • In this paper, in order to construct a 3D quantitative structure–activity relationship (QSAR) model with the chlorobenzene (CB) molecular structure parameter as an independent variable and the octanol-water partition coefficient (KOW ) as a dependent variable, 9 kinds of CB molecules were used as training sets and 3 kinds of CB molecules were used as test sets. We adopted the QSAR module in the Sybyl-X2.0 software from the Tripos Corporation (USA).

    pdf20p tudichquannguyet 29-11-2021 11 2   Download

  • The results obtained showed that the proposed algorithm was capable of finding the optimal solution in most cases when considering a time limit of 500 seconds. The methodology is also applied to solve a real-life instance that arises in the transportation system in Colombia (2 depots and 719 services), resulting in a decrease of the required fleet size and a balanced allocation of services, thus reducing deadhead trips.

    pdf14p toritori 11-05-2020 15 0   Download

  • During last years, lots of the fuzzy rule based classifier (FRBC) design methods have been proposed to improve the classification accuracy and the interpretability of the proposed classification models. In view of that trend, genetic design methods of linguistic terms along with their (triangular and trapezoidal) fuzzy sets based semantics for FRBCs, using hedge algebras as the mathematical formalism, have been proposed.

    pdf18p 12120609 23-03-2020 28 3   Download

  • n this study, a batch scheduling problem has been addressed to enable on-time completion of customer orders in a lean manufacturing environment. The problem is optimizing the partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components.

    pdf16p enzoenzo 29-01-2020 7 0   Download

  • We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classifier (used as reliable clustering seed pairs). In order to find out whether ILP optimization, which is NPcomplete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient Zero-One algorithm with the optimal solution. ...

    pdf9p bunthai_1 06-05-2013 42 1   Download

  • In this paper, we view coreference resolution as a problem of ranking candidate partitions generated by different coreference systems. We propose a set of partition-based features to learn a ranking model for distinguishing good and bad partitions. Our approach compares favorably to two state-of-the-art coreference systems when evaluated on three standard coreference data sets.

    pdf8p bunbo_1 17-04-2013 42 4   Download

  • SQL/LPP is a system that adds time-series extensions to SQL [Perng and Parker 1999]. SQL/LPP models time-series as attributed queues (queues aug- mented with attributes that are used to hold aggregate values and are updated uponmodifications to the queue). Each time-series is partitioned into segments that are stored in the database. The SQL/LPP optimizer uses pattern-length analysis to prune the search space and deduce properties of composite pat- terns from properties of the simple patterns.

    pdf64p nhacsihuytuan 13-04-2013 54 3   Download

  • Our technique determines per-application resource quo- tas in the database and storage caches, on the fly, in a transparent manner, with minimal changes to the DBMS, and no changes to existing interfaces between compo- nents. Towards this objective, we use an online perfor- mance estimation algorithm to dynamically determine the mapping between any given resource configuration setting and the corresponding application latency.

    pdf9p yasuyidol 02-04-2013 56 3   Download

  • Finally, we refine the accuracy of the computed per- formance model through experimental sampling. We use statistical interpolation between computed and ex- perimental sample points in order to re-approximate the per-application performance models, thus dynamically refining the model. We experimentally show that, by us- ing this method, convergence towards near-optimal con- figurations can be achieved in mere minutes, while an exhaustive exploration of the multi-dimensional search space, representing all possible partitioning configura- tions, would take weeks, or even months.

    pdf11p yasuyidol 02-04-2013 51 3   Download

  • In our conceptual DBMS model, there are many data nodes. The physical data is partitioned among the data nodes in a way that is optimized for the specific DBMS. Once the SQL node has formulated the execution plan, the plan is routed to the data nodes that manage the data partitions targeted by the SQL statement. Each data node performs the execution plan it is given and forms a result set. The result set from each data node is returned to the SQL node, where it is merged with the result set from the other data nodes. The final...

    pdf23p yasuyidol 02-04-2013 44 4   Download

  • For a more reliable assessment of future performance, the k-fold cross validation [Sto74] is often applied. An advantage of this technique is that all samples in the data set are fully utilized. In a k-fold cross validation, the data is randomly separated into k partitions of equal size. In each of the k runs, (k – 1) partitions are combined to form the training set and the remaining partition is held out as the testing set. This process repeats k times, each time with a different partition of training and testing sets. The average performance of the model...

    pdf51p lenh_hoi_xung 21-02-2013 51 4   Download

  • Designed to exploit Oracle 10g's SQL, this book takes a comprehensive look at Oracle 10g's analytical functions, MODEL statements, and regular expressions. In addition, Advanced SQL Functions in Oracle 10g covers collection objects and object-oriented structures and introduces new Oracle 10g topics such as XML and statistical functions. The authors' logical and developmental approach to query building includes a review of older Oracle tools to help in the transition to newer material. This text will teach the reader how to: Format result sets with SQL*Plus reporting tools.

    pdf417p suthebeo 17-07-2012 78 12   Download

CHỦ ĐỀ BẠN MUỐN TÌM

TOP DOWNLOAD
ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2