845 resultados para Constraint solving
Resumo:
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors’ private random bits.
A good quorum is a set of O(logn) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time and Õ(vn) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(logn) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model.
The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model.
Resumo:
Since the first launch of the new engineering contract (NEC) in 1993, early warning of problems has been widely recognized as an important approach of proactive management during a construction or engineering project. Is early warning really effective for the improvement of problem solving and project performance? This is a research question that still lacks a good answer. For this reason, an empirical investigation was made in the United Kingdom (U.K.) to answer the question. This study adopts a combination of literature review, expert interview, and questionnaire survey. Nearly 100 questionnaire responses were collected from the U.K. construction industry, based on which the use of early warning under different forms of contract is compared in this paper. Problem solving and project performance are further compared between the projects using early warning and the projects not using early warning. The comparison provides clear evidence for the significant effect of early warning on problem solving and project performance in terms of time, cost, and quality. Subsequently, an input-process-output model is developed in this paper to explore the relationship among early warning, problem solving, and project
performance. All these help construction researchers and practitioners to better understand the role of early warning in ensuring project success.
Resumo:
In this paper we describe the design of a parallel solution of the inhomogeneous Schrodinger equation, which arises in the construction of continuum orbitals in the R-matrix theory of atomic continuum processes. A prototype system is described which has been programmed in occam2 and implemented on a bi-directional pipeline of transputers. Some timing results for the prototype system are presented, and the development of a full production system is discussed.
Resumo:
This paper investigates the impacts of offshore wind power forecast error on the operation and management of a pool-based electricity market in 2050. The impact from offshore wind power forecast errors of up to 2000 MW on system generation costs, emission costs, dispatch-down of wind, number of start-ups and system marginal price are analysed. The main findings of this research are an increase in system marginal prices of approximately 1% for every percentage point rise in the offshore wind power forecast error regardless of the average forecast error sign. If offshore wind power generates less than forecasted (−13%) generation costs and system marginal prices increases by 10%. However, if offshore wind power generates more than forecasted (4%) the generation costs decrease yet the system marginal prices increase by 3%. The dispatch down of large quantities of wind power highlights the need for flexible interconnector capacity. From a system operator's perspective it is more beneficial when scheduling wind ahead of the trading period to forecast less wind than will be generated.
Resumo:
In this paper, we analyze the performance of cognitive amplify-and-forward (AF) relay networks with beamforming under the peak interference power constraint of the primary user (PU). We focus on the scenario that beamforming is applied at the multi-antenna secondary transmitter and receiver. Also, the secondary relay network operates in channel state information-assisted AF mode, and the signals undergo independent Nakagami-m fading. In particular, closed-form expressions for the outage probability and symbol error rate (SER) of the considered network over Nakagami-m fading are presented. More importantly, asymptotic closed-form expressions for the outage probability and SER are derived. These tractable closed-form expressions for the network performance readily enable us to evaluate and examine the impact of network parameters on the system performance. Specifically, the impact of the number of antennas, the fading severity parameters, the channel mean powers, and the peak interference power is addressed. The asymptotic analysis manifests that the peak interference power constraint imposed on the secondary relay network has no effect on the diversity gain. However, the coding gain is affected by the fading parameters of the links from the primary receiver to the secondary relay network
Resumo:
On formal credit markets, access to formal credit and reasonable credit terms of smallholder farmers
in rural sub-Saharan Africa is limited due to adverse selection. Financial institutions operating in
rural areas often cannot distinguish between borrowers (farmers) that are creditworthy and those that
are not, thus, allocate limited resource to agriculture to reduce credit risk. In the presence of limited business quality signaling by smallholder farmers, financial institutions shall demand for collateral and/or offer unfavorable contract terms. Moreover, agricultural productivity of rural sub-Saharan
Africa, dominated by subsistence or small-scale farmers, is also negatively impacted by the adverse
effect of climate change. A strategy that may make the farming practices of smallholder farmer’s
climate resilient and profitable may also improve smallholder farmer's access to formal credit. This
study investigates to what extent participating in ecosystem and extension services (EES) programs
signals business quality of smallholders, thus granting them credit accessibility. We collected data
on 210 smallholder farmers in 2013, comprising farmers that receive payments for ecosystem
services (PES) and farm management training from the International Small Group Tree Planting
Program (TIST) Kenya to test the aforementioned theory empirically. We use game theory,
particularly a screening and sorting model, to illustrate the prospects for farmers with EES to access
formal credit and to improve their credit terms given that they receive PES and banking services
training. Furthermore, the PES’ long term duration (10 – 30 years) generates stable cash-flow which
may be perceived as collateral substitute. Results suggest that smallholder farmers in the TIST
program were less likely to be credit constraint compared to non-TIST farmers. Distance to market,
education, livestock and farm income are factors that determine access to credit from microfinance
institutions in rural Kenya. Amongst farmers that have obtained loans, those keeping business records
enjoy more favorable formal credit conditions. These farmers were observed to pay ca. 5 percent less
interest rate in microfinance charges. For TIST farmers, this type of farm management practices may
be attributed to the banking services and other training they receive within the program. While the
availability of classical collateral (farmlands) and PES may reduce interest rate, the latter was found
to be statistically insignificant. This research underlines the importance of an effective extension
services in rural areas of developing countries and the need to improve gains from conservation
agriculture and ensuing PES. The benefits associated with EES and PES may encompass agricultural
financing.
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
Resumo:
Influence diagrams are intuitive and concise representations of structured decision problems. When the problem is non-Markovian, an optimal strategy can be exponentially large in the size of the diagram. We can avoid the inherent intractability by constraining the size of admissible strategies, giving rise to limited memory influence diagrams. A valuable question is then how small do strategies need to be to enable efficient optimal planning. Arguably, the smallest strategies one can conceive simply prescribe an action for each time step, without considering past decisions or observations. Previous work has shown that finding such optimal strategies even for polytree-shaped diagrams with ternary variables and a single value node is NP-hard, but the case of binary variables was left open. In this paper we address such a case, by first noting that optimal strategies can be obtained in polynomial time for polytree-shaped diagrams with binary variables and a single value node. We then show that the same problem is NP-hard if the diagram has multiple value nodes. These two results close the fixed-parameter complexity analysis of optimal strategy selection in influence diagrams parametrized by the shape of the diagram, the number of value nodes and the maximum variable cardinality.
Resumo:
We present a new algorithm for exactly solving decision-making problems represented as an influence diagram. We do not require the usual assumptions of no forgetting and regularity, which allows us to solve problems with limited information. The algorithm, which implements a sophisticated variable elimination procedure, is empirically shown to outperform a state-of-the-art algorithm in randomly generated problems of up to 150 variables and 10^64 strategies.