Optimistic fair exchange with strong resolution-ambiguity

Optimistic fair exchange (OFE) allows two parties to exchange their digital items in a fair way. As one of the fundamental problems in secure electronic business and digital rights management, OFE has been studied intensively since its introduction. This paper introduces and defines a new property for OFE: Strong Resolution-Ambiguity. We show that many existing OFE protocols have the new property, but its formal investigation has been missing in those protocols. We prove that in the certified-key model, an OFE protocol is secure in the multi-user setting if it is secure in the single-user setting and has the property of strong resolution-ambiguity. Our result not only simplifies the security analysis of OFE protocols in the multi-user setting but also provides a new approach for the design of multi-user secure OFE protocols. Following this approach, a new OFE protocol with strong resolution-ambiguity is proposed. Our analysis shows that the protocol is setup-free, stand-alone and multi-user secure without random oracles.

Hybrid neural-evolutionary model for electricity price forecasting

Evolving artificial neural networks has attracted much attention among researchers recently, especially in the fields where plenty of data exist but explanatory theories and models are lacking or based upon too many simplifying assumptions. Financial time series forecasting is one of them. A hybrid model is used to forecast the hourly electricity price from the California Power Exchange. A collaborative approach is adopted to combine ANN and evolutionary algorithm. The main contributions of this thesis include: Investigated the effect of changing values of several important parameters on the performance of the model, and selected the best combination of these parameters; good forecasting results have been obtained with the implemented hybrid model when the best combination of parameters is used. The lowest MAPE through a single run is 5. 28134%. And the lowest averaged MAPE over 10 runs is 6.088%, over 30 runs is 6.786%; through the investigation of the parameter period, it is found that by including future values of the homogenous moments of the instant being forecasted into the input vector, forecasting accuracy is greatly enhanced. A comparison of results with other works reported in the literature shows that the proposed model gives superior performance on the same data set.

Can panel data really improve the predictability of the monetary exchange rate model?

A common explanation for the inability of the monetary model to beat the random walk in forecasting future exchange rates is that conventional time series tests may have low power, and that panel data should generate more powerful tests. This paper provides an extensive evaluation of this power argument to the use of panel data in the forecasting context. In particular, by using simulations it is shown that although pooling of the individual prediction tests can lead to substantial power gains, pooling only the parameters of the forecasting equation, as has been suggested in the previous literature, does not seem to generate more powerful tests. The simulation results are illustrated through an empirical application. Copyright © 2007 John Wiley & Sons, Ltd.

Panel cointegration and the monetary exchange rate model

This paper re-examines the validity of the monetary exchange rate model during the post-Bretton Woods era for 18 OECD countries. Our analysis simultaneously considers the presence of both cross-sectional dependence and multiple structural breaks, which have not received much attention in previous studies of the monetary model. The empirical results indicate that the monetary model emerges only when the presence of structural breaks and cross-country dependence has been taken into account. Evidence is also provided suggesting that the breaks in the monetary model can be derived from the underlying purchasing power parity relation. © 2008 Elsevier B.V. All rights reserved.

Testing the transferability of a coarse-grained model to intrinsically disordered proteins

The intermediate-resolution coarse-grained protein model PLUM [T. Bereau and M. Deserno, J. Chem. Phys., 2009, 130, 235106] is used to simulate small systems of intrinsically disordered proteins involved in biomineralisation. With minor adjustments to reduce bias toward stable secondary structure, the model generates conformational ensembles conforming to structural predictions from atomistic simulation. Without additional structural information as input, the model distinguishes regions of the chain by predicted degree of disorder, manifestation of structure, and involvement in chain dimerisation. The model is also able to distinguish dimerisation behaviour between one intrinsically disordered peptide and a closely related mutant. We contrast this against the poor ability of PLUM to model the S1 quartz-binding peptide.

On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

The Kidney Exchange Problem (KEP) is a combinatorial optimization problem and has attracted the attention from the community of integer programming/combinatorial optimisation in the past few years. Defined on a directed graph, the KEP has two variations: one concerns cycles only, and the other, cycles as well as chains on the same graph. We call the former a Cardinality Constrained Multi-cycle Problem (CCMcP) and the latter a Cardinality Constrained Cycles and Chains Problem (CCCCP). The cardinality for cycles is restricted in both CCMcP and CCCCP. As for chains, some studies in the literature considered cardinality restrictions, whereas others did not. The CCMcP can be viewed as an Asymmetric Travelling Salesman Problem that does allow subtours, however these subtours are constrained by cardinality, and that it is not necessary to visit all vertices. In existing literature of the KEP, the cardinality constraint for cycles is usually considered to be small (to the best of our knowledge, no more than six). In a CCCCP, each vertex on the directed graph can be included in at most one cycle or chain, but not both. The CCMcP and the CCCCP are interesting and challenging combinatorial optimization problems in their own rights, particularly due to their similarities to some travelling salesman- and vehicle routing-family of problems. In this paper, our main focus is to review the existing mathematical programming models and solution methods in the literature, analyse the performance of these models, and identify future research directions. Further, we propose a polynomial-sized and an exponential-sized mixed-integer linear programming model, discuss a number of stronger constraints for cardinality-infeasible-cycle elimination for the latter, and present some preliminary numerical results.