A profit sharing scheme for a two-firm joint venture

Consider the scenario when two firms are setting up a joint venture. One firm has a set of technologies and knowhow for a new product while the other contributes the necessary capital for setting up and running the venture. The key issue that the two firms face in negotiating the joint venture is to determine a fair value for the technologies and knowhow. This paper presents an approach by which each firm bids a price for the technology with an objective to maximize their own profits from the joint venture. Provided that their bids satisfy a cooperation condition, the two firms settle on a price using a simple valuation formula. We analyze the impact of various factors on the decision process and provide numerical results to illustrate the bidding strategies. We conclude that in order to maximize their profits, it is often more important for both firms to increase the chance of cooperation than to increase their own shares of the joint venture.     

A storage allocation scheme for ALGOL 60

A storage allocation scheme for a machine with a 2048-instruction core store and a magnetic drum is described. The use of the drum for storing program blocks and/or data must be directed by the programmer through auxiliary information in the ALGOL program. The administrative routines controlling the storage at run time are described in full. A detailed example is given.     

基于线性码的新的秘密分享方案

A secret sharing system can be damaged when the dealer cheating occurs. In this paper,two kinds of secret sharing schemes based on linear code are proposed. One is a verifiable scheme which each participant can verify his own share from dealer‘s distribution and ensure each participant to receive valid share. Another does not have a trusted center, here, each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.     

A secret sharing scheme based on cellular automata

A new secret sharing scheme based on a particular type of discrete delay dynamical systems: memory cellular automata, is proposed. Specifically, such scheme consists of a (k, n)-threshold scheme where the text to be shared is considered as one of the k initial conditions of the memory cellular automata and the n shares to be distributed are n consecutive configurations of the evolution of such cellular automata. It is also proved to be perfect and ideal.     

Optimization of a minimal-storage strategy for cloud amount data

A strategy is proposed which reduces the storage requirements for cloud amount information by up to 50%. Archiving only the mean cloud amount, μ, is recommended. Retrieval of most of the original data is possible if observations are made at high resolution ( 1 km) and the processing system gives rise to predominantly binary (i.e. cloud or no-cloud) information. The strategy is applicable to cloud amount at any level and to total cloud cover. One year's global cloud data can be stored on 2.5 computer magnetic tapes in contrast to the 13 tapes suggested by GARP/JOC (1980) and ISCCP (1982). The resultant new cloud archive will have the advantage of being equally useful for all scientific users (e.g. remote sensing and climate modelling groups) and each group's post-processing time will be greatly reduced.     

A perfect threshold secret sharing scheme to identify cheaters

In this paper we consider the problem of identifying cheaters in secret sharing schemes. Rabin and Ben-Or presented a perfect and unconditionally secure secret sharing scheme in which the honest participants are able to identify the cheaters. We present a similar scheme, but one in which the information distributed to each participant is smaller.     

A storage model for data communication systems

We consider a storage model where the input and demand are modulated by an underlying Markov chain. Such models arise in data communication systems. The input is a Markov-compound Poisson process and the demand is a Markov linear process. The demand is satisfied if physically possible. We study the properties of the demand and its inverse, which may be viewed as transformed time clocks. We show that the unsatisfied demand is related to the infimum of the net input and that, under suitable conditions, it is an additive functional of the input process. The study of the storage level is based on a detailed analysis of the busy period, using techniques based on infinitesimal generators. The transform of the busy period is the unique solution of a certain matrix-functional equation. Steady state results are also obtained; these are not obvious generalizations of the results for simple storage models. In particular, a generalization of the Pollaczek-Khinchin formula brings new insight.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Cientifica e Tecnológica.     

An efficient multi-use multi-secret sharing scheme based on hash function

In this work, a renewable, multi-use, multi-secret sharing scheme for general access structure based on the one-way collision resistant hash function is presented in which each participant has to carry only one share. As it applies the collision resistant one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. Moreover, high complexity operations like modular multiplication, exponentiation and inversion are avoided to increase its efficiency. Finally, in the proposed scheme, both the combiner and the participants can verify the correctness of the information exchanged among themselves.     

Strong storage operators and data types

The storage operators were introduced by J.L. Krivine ([6]); they are closed -terms which, for some fixed data type (the integers for example), allow to simulate call by value while using call by name. J.L. Krivine showed that such operators can be typed, in the type system, using Gödel's translation from classical to intuitionistic logic ([8]).This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and iterative representation of data in -calculus. We obtain the following result: We can find typed strong storage operators for the recursive representations of data type, but that is not the case for the iterative representations of an infinite data type.We give the proof of this result in the case of integers.     

Buffer storage for continuous delivery of video data

The video communication requires considerable large bandwidth – a scarce resource and thus it needs be used efficiently. It can be traded for buffer storage, i.e. for maintaining more buffer storage the data downloading rate (bandwidth) can be reduced. In order to transmitting the videos, they are divided into segments and the bandwidth of the physical channel is divided into logical channels. A logical channel transmits only one segment of each video. When there is switching of the segments, some time delay, called jitter delay, occurs. The jitter delay, being independent, memoryless, and positive, can be modeled as exponentially distributed random variable. In this paper, we propose a stochastic model incorporating jitter delay for estimating the storage space required in the user’s system in order to maintain continuous delivery of the video data to the users.     

Uncertain random data envelopment analysis for technical efficiency

Fuzzy Optimization and Decision Making - Data envelopment analysis (DEA) is a classical and prevailing tool for estimating relative efficiencies of multiple decision making units (DMUs). However,...     

How to avoid the cheaters succeeding in the key sharing scheme

In this paper the Rational Interpolation is presented as a solution to the problem caused by a cheater using the Threshold Scheme. We will implement this scheme by using the Berlekamp-Massey algorithm.The first version we present does not try to detect the cheaters, as in [3], [9] or [10]. This version tries to prevent their knowledge of the correct keyD while the other participants are aware only of the false keyD computed in the threshold scheme.The second version we present is to detect the existence of cheaters.This work was partially supported by Spanish CICYT Grant TIC91-0472.     

A perceptually optimised bivariate visualisation scheme for high-dimensional fold-change data

Visualising data as diagrams using visual attributes such as colour, shape, size, and orientation is challenging. In particular, large data sets demand graphical display as an essential step in the analysis. In order to achieve comprehension often different attributes need to be displayed simultaneously. In this work a comprehensible bivariate, perceptually optimised visualisation scheme for high-dimensional data is proposed and evaluated. It can be used to show fold changes together with confidence values within a single diagram. The visualisation scheme consists of two parts: a uniform, symmetric, two-sided colour scale and a patch grid representation. Evaluation of uniformity and symmetry of the two-sided colour scale was performed in comparison to a standard RGB scale by twenty-five observers. Furthermore, the readability of the generated map was validated and compared to a bivariate heat map scheme.

     

Non-manifold surface reconstruction from high-dimensional point cloud data

We present an algorithm capable of reconstructing a non-manifold surface embedded as a point cloud in a high-dimensional space. Our algorithm extends a previously developed incremental method and produces a non-optimal triangulation, but will work for non-orientable surfaces, and for surfaces with certain types of self-intersection. The self-intersections must be ordinary double curves and are fitted locally by intersecting planes using a degenerate quadratic surface. We present the algorithm in detail and provide many examples, including a dataset describing molecular conformations of cyclo-octane.     

Collaborative airline revenue sharing game with grey demand data

Central European Journal of Operations Research - Airline alliances provide more flights, include different destinations, and maximize revenues. In an alliance, collaborating airlines can offer...     

Response surface methodology as a means for efficient data storage and retrieval

Managing the volume of experimental and/or simulation data required for large-scale design studies can be a significant problem. This paper describes a method for dealing with this problem, using response surface methodology. The method involves (1) determining a summary parameterization of the response of the underlying process mechanism generating the data, in order to characterize this response in terms of a manageable set of performance measures, and (2) deriving a model of the data, in order to summarize the dependence of the performance measures on selected predictor or design variables. The method is illustrated by its application to a problem in vehicle collision research.     

Goal programming approaches for data envelopment analysis cross efficiency evaluation

Cross efficiency evaluation has long been proposed as an alternative method for ranking the decision making units (DMUs) in data envelopment analysis (DEA). This study proposes goal programming models that could be used in the second stage of the cross evaluation. Proposed goal programming models have different efficiency concepts as classical DEA, minmax and minsum efficiency criteria. Numerical examples are provided to illustrate the applications of the proposed goal programming cross efficiency models.     

Gaining efficiency via weighted estimators for multivariate failure time data

Multivariate failure time data arise frequently in survival analysis. A commonly used technique is the working independence estimator for marginal hazard models. Two natural questions are how to improve the efficiency of the working independence estimator and how to identify the situations under which such an estimator has high statistical efficiency. In this paper, three weighted estimators are proposed based on three different optimal criteria in terms of the asymptotic covariance of weighted estimators. Simplified close-form solutions are found, which always outperform the working independence estimator. We also prove that the working independence estimator has high statistical efficiency, when asymptotic covariance of derivatives of partial log-likelihood functions is nearly exchangeable or diagonal. Simulations are conducted to compare the performance of the weighted estimator and working independence estimator. A data set from Busselton population health surveys is analyzed using the proposed estimators. This work was supported by National Natural Science Foundation of China (Grant No. 10628104), Fan was also supported by National Institutes of Health (Grant No. R01-GM072611) and Natural Science Foundation (Grant No. DMS-0714554), Zhou was supported by National Natural Science Funds for Distinguisheel Young Scholar (Grant No. 70825004), National Natural Science Foundation of China (Grant Nos. 10731010, 10628104), the National Basic Research Program (Grant No. 2007CB814902), Creative Research Groups of China (Grant No. 10721101) and Leading Academic Disipline Program, the 10 ^th five year plan of 211 Project for Shanghai University of Finance and Economics (the 3 ^rd phase), Cai was supported by National Institutes of Health (Grant No. R01-HL57444)     

Attribute dependency functions considering data efficiency

Pawlak’s attribute dependency degree model is applicable to feature selection in pattern recognition. However, the dependency degrees given by the model are often inadequately computed as a result of the indiscernibility relation. This paper discusses an improvement to Pawlak’s model and presents a new attribute dependency function. The proposed model is based on decision-relative discernibility matrices and measures how many times condition attributes are used to determine the decision value by referring to the matrix. The proposed dependency degree is computed by considering the two cases that two decision values are equal or unequal. A feature of the proposed model is that attribute dependency degrees have significant properties related to those of Armstrong’s axioms. An advantage of the proposed model is that data efficiency is considered in the computation of dependency degrees. It is shown through examples that the proposed model is able to compute dependency degrees more strictly than Pawlak’s model.