A product online marketplace's objective is to assist vendors in increasing their sales and profits. There are numerous ways used in goods online marketplaces, and none of them are definitively correct or incorrec...
详细信息
ISBN:
(纸本)9781665494755
A product online marketplace's objective is to assist vendors in increasing their sales and profits. There are numerous ways used in goods online marketplaces, and none of them are definitively correct or incorrect. This study explores the agricultural products using dynamic programming algorithm to design a software program named "Online Agricultural Marketplace System (DEMETER)". This software will assist farmers in raising their sales and revenues from harvests. The effects of integrating information communication technologies into the agricultural supply chain have been investigated. A dynamic algorithm can be used to solve complex optimization problems, such as those faced by computer programmers. Researchers employed descriptive research solely concerned with describing the nature of the segment in which the researchers are interested, rather than with explaining why a particular phenomenon occurs.
Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of re...
详细信息
ISBN:
(纸本)9783037850817
Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm Priority Inheritance Scheduling algorithm. Then we analyze the algorithm from two aspects: description and schedulability.
A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support mod...
详细信息
ISBN:
(纸本)9780769534718
A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support modifications (insertion or deletion) of nodes and edges in a network. Thus, in this paper we propose a fully dynamic distributed algorithm to maintain a b-coloring of a graph when its topology evolves. This method determines a b-coloring in time O(Delta(2)) and needs O(n Delta) changes of colors to maintain a b-coloring of a graph, where n is the number of nodes and A is the maximum degree in the graph.
"Static" Buchberger algorithms to compute a Grobner basis require as input both a set of polynomials and a term ordering. "dynamic" Buchberger algorithms do not require an ordering as input, but co...
详细信息
ISBN:
(纸本)9781450350648
"Static" Buchberger algorithms to compute a Grobner basis require as input both a set of polynomials and a term ordering. "dynamic" Buchberger algorithms do not require an ordering as input, but compute instead a Grobner basis with respect to a "discovered" ordering. A good heuristic usually results in a basis that is relatively small, a desirable property for many applications. This article uses a new C++ implementation to explore variants of the original algorithm. While the implementation is preliminary, and in general much slower than well-known static implementations, it still succeeds at computing some bases more quickly.
In this paper, a dynamic theorem proving (DTP) algorithm is proposed for dynamically judging whether a component set is consistency-based diagnosis in model-based diagnosis. Firstly, the model of the system to be diag...
详细信息
In this paper, a dynamic theorem proving (DTP) algorithm is proposed for dynamically judging whether a component set is consistency-based diagnosis in model-based diagnosis. Firstly, the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF), and the problem of diagnosis is translated into the satisfiability of the related clauses in the CNF files. Next. all the minimal consistency-based diagnostic sets are derived by calling DTP dynamically combining with the CSSE-tree. As the theorem about the number of components in minimal diagnosis is proposed, the majority of the non-minimal diagnosis can never be produced. Moreover, this approach can compute all the consistency-based diagnostic sets directly, without computing all the conflict sets and therefore the hitting sets of the collection of the corresponding conflict sets like the classical methods. Finally, the approach's soundness, completeness and complexity are analyzed and proved, and results show that the program is easy to be implemented, and the diagnosis efficiency is highly improved. (C) 2011 Elsevier Ltd. All rights reserved.
Snow cover plays an important role in climate, hydrology, and ecosystem. At present, passive microwave remote sensing is the most effective method for monitoring global and regional snow depth (SD). The traditional SD...
详细信息
Snow cover plays an important role in climate, hydrology, and ecosystem. At present, passive microwave remote sensing is the most effective method for monitoring global and regional snow depth (SD). The traditional SD inversion algorithms use empirical or semiempirical methods to establish a fixed relationship between the SD and brightness temperature difference, given snow particle size and snow density. However, the snow characteristics present large temporal heterogeneity in Northeast China, and it leads to the inadaptability of the SD retrieval algorithm;using a fixed empirical coefficient will lead to large errors in SD inversion. In this study, a novel dynamic method was proposed to retrieve SD based on AMSR2 brightness temperature data. A snow survey experiment was designed to collect snow characteristics in different periods in Northeast China, and the microwave emission model of layered snowpacks was applied to simulate brightness temperature with varying snow characteristics to determine the dynamic coefficients in the SD retrieval algorithm. The validation results at 98 meteorological stations demonstrate that the novel dynamic SD inversion algorithm achieved better stability in the long-term sequence, its RMSE, bias, and R are 7.79 cm, 1.07 cm, and 0.61, respectively. Furthermore, compared with Che SD products, Chang algorithm, and AMSR2 SD products, the novel algorithm can obtain specific dynamic coefficients considering the snow metamorphism and has a higher accuracy of SD inversion in the whole winter. In conclusion, this novel SD inversion algorithm is more applicable and accurate than the existing SD inversion products in Northeast China.
The F4 algorithm re-imagines Buchberger's algorithm as the row reduction of a Macaulay matrix: each row corresponds to a polynomial;each reduction of one row by another corresponds to one step of reducing anS-poly...
详细信息
The F4 algorithm re-imagines Buchberger's algorithm as the row reduction of a Macaulay matrix: each row corresponds to a polynomial;each reduction of one row by another corresponds to one step of reducing anS-polynomial;and any row that completes reduction with a new pivot position corresponds to a new element of the basis. On the other hand, each column corresponds to a term, so that while it is common in linear algebra to exchange a matrix's columns during row reduction, this has not been done in F4-style algorithms, as it runs the risk of producing an incorrect result. We show that it is possible to adapt an analogous, "dynamic" technique for Buchberger-style algorithms to F4-style algorithms, and we examine its behavior on some commonly referenced benchmark ideals.
The extremal sets of a family F of sets consist of all minimal and maximal sets of F that have no subset and superset in F respectively. We consider the problem of efficiently maintaining all extremal sets in F when i...
详细信息
The extremal sets of a family F of sets consist of all minimal and maximal sets of F that have no subset and superset in F respectively. We consider the problem of efficiently maintaining all extremal sets in F when it undergoes dynamic updates including set insertion, deletion and set-contents update (insertion, deletion and value update of elements). Given F containing k sets with N elements in total and domain (the union of these sets) size n, where clearly k, n less than or equal to N for any F. we present a set of algorithms that, requiring a space of O(N + kn/log N + k(2)) words, process in O(1) time a query on whether a set of F is minimal and/or maximal, and maintain all extremal sets of F in O(N) time per set insertion, deletion acid set-contents update in the worst. case. Our algorithms are the first linear-time fully dynamic algorithms for maintaining extremal sets, which, requiring O(kn/log N) extra words in space within the same bound O(N-2), improve the time complexity of the existing result [9] by a factor of O(N). C. R. Categories. F: 4.3, F. 2.2.
We introduce a dynamic model for maintaining permutation graph coloring. Our motivation comes from the strait type river routing problem in VLSI. This paper presents fully dynamic algorithms for the permutation graph ...
详细信息
We introduce a dynamic model for maintaining permutation graph coloring. Our motivation comes from the strait type river routing problem in VLSI. This paper presents fully dynamic algorithms for the permutation graph coloring problem. These algorithms are designed to handle Insert and Delete operations and answer some queries. The aim is to provide for running times that are asymptotically more efficient than recomputation (off-line algorithms that run in Theta(n logn) time are known [5,6,10,3]). First, the algorithm A(1) that runs in O(n) uniform running time per Insert/Delete operation is presented. Second, a more sophisticated data structure leads to the algorithm A(2) that runs in O(m logn) uniform running time per Insert/Delete, where in denotes the number of chains in the decomposition. It follows from [7,4] that the running time of A(2) when the points from the dynamically changing set are drawn independently from a uniform distribution on the unit square is O(root n logn) per Insert/Delete in probability. Third, we sketch a composite algorithm A(3) that switches between A(1) and A(2) guarantees an amortized running time of O(min(n,m logn)) per Insert/Delete. Finally, we outline a number of applications.
This paper presents a new deadline-based algorithm for dynamic task scheduling on multiprocessor real-time systems. The proposed algorithm was built based on the well-known dynamic scheduling algorithm the Earliest De...
详细信息
ISBN:
(纸本)9780889866379
This paper presents a new deadline-based algorithm for dynamic task scheduling on multiprocessor real-time systems. The proposed algorithm was built based on the well-known dynamic scheduling algorithm the Earliest Deadline First (EDF). We extend the EDF algorithm in three significant criterions: (1) The original EDF deals with set of periodic task. (2) It schedules only independent tasks. (3) It works best in the single processor system. Our contribution in this study is a creation of a new variation of EDF called EDF-pc that able to schedule set of non-periodic tasks. It also deals with tasks that may or may not have precedence constraints and it produced acceptable results in the multiprocessor systems.
暂无评论