Academic literature on the topic 'Distributed Selection Schemes'

In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we apply sampling techniques in the design of selection algorithms on the hypercube and de Bruijn networks, and show that the message complexity of selecting an item from a set (file) is less sensitive to the cardinality of the set (file). Given a file with n keys, our algorithm performs a selection on a p-node de Bruijn network or hypercube using only O(p log log n) messages and suffering a delay of O(τ log p log log n), with high probability. Our selection scheme outperforms the existing approaches in terms of both message complexity and communication delay. Because of the lesser sensitivity of message complexity and communication delay of our algorithms to the file size, our distributed selection schemes are very attractive in applications where very large database systems are involved. Using our selection algorithms, we also show that both quicksort-based sorting scheme and enumeration sorting scheme can be developed for sorting large distributed files on the hypercube and de Bruijn networks. Both of our sorting algorithms outperform the existing distributed sorting schemes in terms of both message complexity and communication delay.

Relay selection, antenna selection, and link selection are three potent means to enrich network capacity in MIMO relaying networks. To reduce feedback overhead, in this paper, three distributed antenna-and-relay selection schemes are proposed for AF multiple-relay network, which is equipped with multiple antennas at nodes. Closed-form formulations of system outage probability are derived for these schemes, as well as the lower bounds and upper bounds. Furthermore, the approximate expressions of outage probability at high SNR regime are also derived, showing that the proposed optimal strategy can achieve full diversity order. In addition, link selection scheme can improve spectral efficiency since it saves one time slot when direct link is selected.

This paper is concerned with mitigating multimode buffeting of cable-stayed bridges by optimizing the placements of active tuned mass dampers (ATMDs) and sensors and developing a control model and schemes. The Third Nanjing Bridge over the Yangtze River was used to formulate a mathematical control model with distributed ATMDs under wind action. Hankel norms were combined with structural mode analysis to build placement indices of the ATMDs and sensors under a defined objective while considering the influence of exterior excitation. A selection index of modes was proposed. ATMD/sensor placement on the Third Nanjing Bridge and mode selection were simulated to determine the wind response control. A control design model with accurate mode selection was developed using modal superposition and it was used to investigate control schemes of distributed ATMDs for buffeting response control of the cable-stayed bridge. The results showed that the dynamic characteristics of the developed control design model agreed well with those of the original system model. Control scheme selection depends on the tradeoff between the control objective and actuator performance. Considering realistic engineering constraints, the distributed ATMDs are shown to perform well.

In a distributed deep learning system, a parameter server and workers must communicate to exchange gradients and parameters, and the communication cost increases as the number of workers increases. This paper presents a communication data optimization scheme to mitigate the decrease in throughput due to communication performance bottlenecks in distributed deep learning. To optimize communication, we propose two methods. The first is a layer dropping scheme to reduce communication data. The layer dropping scheme we propose compares the representative values of each hidden layer with a threshold value. Furthermore, to guarantee the training accuracy, we store the gradients that are not transmitted to the parameter server in the worker’s local cache. When the value of gradients stored in the worker’s local cache is greater than the threshold, the gradients stored in the worker’s local cache are transmitted to the parameter server. The second is an efficient threshold selection method. Our threshold selection method computes the threshold by replacing the gradients with the L1 norm of each hidden layer. Our data optimization scheme reduces the communication time by about 81% and the total training time by about 70% in a 56 Gbit network environment.

Various edge collaboration schemes that rely on reinforcement learning (RL) have been proposed to improve the quality of experience (QoE). Deep RL (DRL) maximizes cumulative rewards through large-scale exploration and exploitation. However, the existing DRL schemes do not consider the temporal states using a fully connected layer. Moreover, they learn the offloading policy regardless of the importance of experience. They also do not learn enough because of their limited experiences in distributed environments. To solve these problems, we proposed a distributed DRL-based computation offloading scheme for improving the QoE in edge computing environments. The proposed scheme selects the offloading target by modeling the task service time and load balance. We implemented three methods to improve the learning performance. Firstly, the DRL scheme used the least absolute shrinkage and selection operator (LASSO) regression and attention layer to consider the temporal states. Secondly, we learned the optimal policy based on the importance of experience using the TD error and loss of the critic network. Finally, we adaptively shared the experience between agents, based on the strategy gradient, to solve the data sparsity problem. The simulation results showed that the proposed scheme achieved lower variation and higher rewards than the existing schemes.

The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multiple-output (MIMO) systems, in particular, overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and the authors propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission with the full maximum-likelihood (ML) decoding and sphere decoding (SD) based on a wireless relay network. This strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves on the established one-sided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) based on different detectors and a scheme without relay selection, with the maximum-minimum and maximum-mean selection schemes confirm the performance advantage of relay selection. The proposed strategy yields the best performance of the three methods.

In this thesis new techniques are presented to achieve performance enhancement in wireless cooperative networks. In particular, techniques to improve transmission rate and maximise end-to-end signal-to-noise ratio are described. An offset transmission scheme with full interference cancellation for a wireless cooperative network with frequency flat links and four relays is introduced. This method can asymptotically, as the size of the symbol block increases, achieve maximum transmission rate together with full cooperative diversity provided the destination node has multiple antennas. A novel full inter-relay interference cancellation method that also achieves asymptotically maximum rate and full cooperative diversity is then designed for which the destination node only requires a single antenna. Two- and four-relay selection schemes for wireless cooperative amplify and forward type networks are then studied in order to overcome the degradation of end-to-end bit error rate performance in single-relay selection networks when there are feedback errors in the relay to destination node links. Outage probability analysis for a four-relay selection scheme without interference is undertaken. Outage probability analysis of a full rate distributed transmission scheme with inter-relay interference is also studied for best single- and two-relay selection networks. The advantage of multi-relay selection when no interference occurs and when adjacent cell interference is present at the relay nodes is then shown theoretically. Simulation results for outage probability analysis are included which support the theoretical expressions. Finally, outage probability analysis of a cognitive amplify and forward type relay network with cooperation between certain secondary users, chosen by best single-, two- and four-relay selection is presented. The cognitive amplify and forward relays are assumed to exploit an underlay approach, which requires adherence to an interference constraint on the primary user. The relay selection scheme is performed either with a max-min strategy or one based on maximising exact end-to-end signal-to-noise ratio. The outage probability analyses are again confirmed by numerical evaluations.

Recently, cooperative relay networks have emerged as an attractive communications technique that can generate a new form of spatial diversity which is known as cooperative diversity, that can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. To achieve cooperative diversity single-antenna terminals in a wireless relay network typically share their antennas to form a virtual antenna array on the basis of their distributed locations. As such, the same diversity gains as in multi-input multi-output systems can be achieved without requiring multiple-antenna terminals. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission, interference and outage. Therefore, the focus of this thesis is to exploit cooperative relay networks within two-way transmission schemes. Such schemes have the potential to double the data rate as compared to one-way transmission schemes. Firstly, a new approach to two-way cooperative communications via extended distributed orthogonal space-time block coding (E-DOSTBC) based on phase rotation feedback is proposed with four relay nodes. This scheme can achieve full cooperative diversity and full transmission rate in addition to array gain. Then, distributed orthogonal space-time block coding (DOSTBC) is applied within an asynchronous two-way cooperative wireless relay network using two relay nodes. A parallel interference cancelation (PIC) detection scheme with low structural and computational complexity is applied at the terminal nodes in order to overcome the effect of imperfect synchronization among the cooperative relay nodes. Next, a DOSTBC scheme based on cooperative orthogonal frequency division multiplexing (OFDM) type transmission is proposed for flat fading channels which can overcome imperfect synchronization in the network. As such, this technique can effectively cope with the effects of fading and timing errors. Moreover, to increase the end-to-end data rate, a closed-loop EDOSTBC approach using through a three-time slot framework is proposed. A full interference cancelation scheme with OFDM and cyclic prefix type transmission is used in a two-hop cooperative four relay network with asynchronism in the both hops to achieve full data rate and completely cancel the timing error. The topic of outage probability analysis in the context of multi-relay selection for one-way cooperative amplify and forward networks is then considered. Local measurements of the instantaneous channel conditions are used to select the best single and best two relays from a number of available relays. Asymptotical conventional polices are provided to select the best single and two relays from a number of available relays. Finally, the outage probability of a two-way amplify and forward relay network with best and Mth relay selection is analyzed. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods.

Spatial diversity is an effective technique to combat the effects of severe fading in wireless environments. Recently, cooperative communications has emerged as an attractive communications paradigm that can introduce a new form of spatial diversity which is known as cooperative diversity, that can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. As such, the same diversity gains as in multi-input multi-output systems can be achieved without requiring multiple-antenna terminals. In this thesis, a new approach to cooperative communications via distributed extended orthogonal space-time block coding (D-EO-STBC) based on limited partial feedback is proposed for cooperative relay networks with three and four relay nodes and then generalized for an arbitrary number of relay nodes. This scheme can achieve full cooperative diversity and full transmission rate in addition to array gain, and it has certain properties that make it alluring for practical systems such as orthogonality, flexibility, low computational complexity and decoding delay, and high robustness to node failure. Versions of the closed-loop D-EO-STBC scheme based on cooperative orthogonal frequency division multiplexing type transmission are also proposed for both flat and frequency-selective fading channels which can overcome imperfect synchronization in the network. As such, this proposed technique can effectively cope with the effects of fading and timing errors. Moreover, to increase the end-to-end data rate, this scheme is extended for two-way relay networks through a three-time slot framework. On the other hand, to substantially reduce the feedback channel overhead, limited feedback approaches based on parameter quantization are proposed. In particular, an optimal one-bit partial feedback approach is proposed for the generalized D-O-STBC scheme to maximize the array gain. To further enhance the end-to-end bit error rate performance of the cooperative relay system, a relay selection scheme based on D-EO-STBC is then proposed. Finally, to highlight the utility of the proposed D-EO-STBC scheme, an application to cognitive radio is studied.

The problem of efficient parallelization of 2D Ising spin systems requires realistic algorithmic design and implementation based on an understanding of issues from computer science and statistical physics. In this work, we not only consider fundamental parallel computing issues but also ensure that the major constraints and criteria of 2D Ising spin systems are incorporated into our study. This realism in both parallel computation and statistical physics has rarely been reflected in previous research for this problem.

In this thesis,we designed and implemented a variety of parallel algorithms for both sweep spin selection and random spin selection. We analyzed our parallel algorithms on a portable and general parallel machine model, namely the LogP model. We were able to obtain rigorous theoretical run-times on LogP for all the parallel algorithms. Moreover, a guiding equation was derived for choosing data layouts (blocked vs. stripped) for sweep spin selection. In regards to random spin selection, we were able to develop parallel algorithms with efficient communication schemes. We analyzed randomness of our schemes using statistical methods and provided comparisons between the different schemes. Furthermore, algorithms were implemented and performance data gathered and analyzed in order to determine further design issues and validate theoretical analysis.

Master of Science

Wireless sensor networks (WSNs) are commonly used in many applications. The energy efficiency of the system has become the subject of extensive research lately. In this thesis we will introduce relay selection schemes that attempt to optimize the transmission of data. We use a two phase WSN model where a message is broadcasted from the source then relayed by the overhearing sensors (nodes) to a fusion center (FC). These schemes will reduce the number of bits transmitted from the sensors to the destination as well as minimize the activity of these sensors and lead to a more energy efficient system. The main idea is to have the smallest subset of sensors that contain the entire information relay the message; in an ideal situation the subset will only contain a pair of sensors. We then investigate the addition of error correcting codes (ECCs) to the node-FC channels. We observe the outage probability of the relay selection schemes using turbo codes on the node-FC channels. We also examine the expected number of bits (including extra parity bits) in the transmissions. We show that under certain channel conditions introducing turbo codes to the node-FC channels leads to longer sensor lifetimes.

Opportunistic selection is a practically appealing technique that is often used in multi-node wireless systems such as scheduling and rate adaptation in cellular systems and opportunistic wireless local area networks, wireless sensor networks, cooperative communications, and vehicular networks. In it, each node maintains a local preference number called metric that is function of its channel gains, and the best node with the highest metric is selected. Identifying the best node is challenging as the information about a node's metric is available only locally at each node. In our work, we focus on the popular, simple, and low feedback timer scheme for selection. In it, each node sets a timer as a function of its metric and transmits a packet when the timer expires. The metric-to-timer mapping maps larger metric values to smaller timer values, which ensures that the best node's timer expires first. However, it can fail to select the best node if another node transmits a packet within D s of the transmission by the best node. In this thesis, we make three contributions to the design and understanding of the timer-based selection scheme. Firstly, we introduce feedback overhead-aware contention resolution in the timer-based selection scheme. The outcome is a novel selection scheme that is faster than the splitting scheme and more reliable than the timer-based selection scheme. We analyze and minimize the average time required by the scheme to select the best node. Secondly, we characterize the optimal metric-to-timer mapping when the number of nodes in the system is not known, as is the case in several practical deployments. When the prior distribution of the nodes is known, we propose an optimal mapping that maximizes the success probability averaged over the distribution on the number of nodes. When even the prior distribution is not known, we propose a robust mapping that maximizes the worst case average success probability over all possible probability distributions on the number of nodes. In both cases, we show that the timers can expire only at 0, D, 2D, ... in the optimal timer mapping. For the known prior case, we develop recursive techniques to effectively compute the optimal timer mapping for binomial and Poisson priors. Lastly, we consider a discrete rate adaptive system and design an optimal timer scheme to maximize the end-to-end performance measure of system throughput. We derive several novel, insightful results about the optimal mapping that culminate in an iterative algorithm to compute it. We show that the design of the selection scheme is intimately related to the rate adaptation rule and the selection policy used. In all cases, extensive benchmarking with several ad hoc schemes proposed in the literature shows the significant gains that the proposed designs can deliver.

Opportunistic selection is a practically appealing technique that is often used in multi-node wireless systems such as scheduling and rate adaptation in cellular systems and opportunistic wireless local area networks, wireless sensor networks, cooperative communications, and vehicular networks. In it, each node maintains a local preference number called metric that is function of its channel gains, and the best node with the highest metric is selected. Identifying the best node is challenging as the information about a node's metric is available only locally at each node. In our work, we focus on the popular, simple, and low feedback timer scheme for selection. In it, each node sets a timer as a function of its metric and transmits a packet when the timer expires. The metric-to-timer mapping maps larger metric values to smaller timer values, which ensures that the best node's timer expires first. However, it can fail to select the best node if another node transmits a packet within D s of the transmission by the best node. In this thesis, we make three contributions to the design and understanding of the timer-based selection scheme. Firstly, we introduce feedback overhead-aware contention resolution in the timer-based selection scheme. The outcome is a novel selection scheme that is faster than the splitting scheme and more reliable than the timer-based selection scheme. We analyze and minimize the average time required by the scheme to select the best node. Secondly, we characterize the optimal metric-to-timer mapping when the number of nodes in the system is not known, as is the case in several practical deployments. When the prior distribution of the nodes is known, we propose an optimal mapping that maximizes the success probability averaged over the distribution on the number of nodes. When even the prior distribution is not known, we propose a robust mapping that maximizes the worst case average success probability over all possible probability distributions on the number of nodes. In both cases, we show that the timers can expire only at 0, D, 2D, ... in the optimal timer mapping. For the known prior case, we develop recursive techniques to effectively compute the optimal timer mapping for binomial and Poisson priors. Lastly, we consider a discrete rate adaptive system and design an optimal timer scheme to maximize the end-to-end performance measure of system throughput. We derive several novel, insightful results about the optimal mapping that culminate in an iterative algorithm to compute it. We show that the design of the selection scheme is intimately related to the rate adaptation rule and the selection policy used. In all cases, extensive benchmarking with several ad hoc schemes proposed in the literature shows the significant gains that the proposed designs can deliver.

Opportunistic selection reaps the benefits of multiuser diversity in many wireless applications. For example, it increases throughput of cellular networks, lifetime of wireless sensor networks, and improves diversity in cooperative relay systems. In it, the best node is selected for data transmission. The ability of a node to improve the system performance is quantified by a real-valued metric. The best node is the one with the highest metric. Since the nodes are geographically separated, no node in the network knows beforehand who the best node is. Hence, distributed selection schemes are required. We investigate the role of power control in distributed selection schemes. Power control allows the nodes to choose their target receive power from a set of pre-specified power levels. These levels are set such that a node can be selected even if some other nodes transmit with it but do so with lower power levels. Without power control, this would have resulted in a wasteful collision. First, we propose a new timer-based selection scheme with power control. In it, each node sets its timer and its target receive power level as a function of its metric. We develop several structural insights, about the optimal metric-to-timerand- power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding an optimal mapping and lead to valuable asymptotic insights. We show that the proposed scheme significantly outperforms the conventional timer-based selection scheme. Performance improvements as large as 28.2% are achieved even with only two target receive power levels. We also analyze the performance of the proposed scheme with imperfect power control, which is inevitable in practice. It randomly changes a node’s receive power and, thus, its signal-to-interference-and-noise ratio. Consequently, it affects the probability of selection of the best node and of no node getting selected. It can even lead to a sub-optimal node getting selected. We derive the probability of each of these effects. We observe that by increasing the lowest target receive power level enough, the reduction in probability of selection of the best node can be restricted to be within 9%. Lastly, we characterize the effect of imperfect power control on an alternate scheme known as the splitting-based selection scheme with power control. This scheme maintains a set of thresholds for each slot, which determine the nodes that transmit in that slot and their target receive power levels. The outcome of a slot is used to update the thresholds for the next slot. In case of a collision, the set of colliding nodes is split in two smaller subsets, the nodes in one of which transmit in the next slot. We analyze the average number of slots required for selection with perfect and imperfect power control. We also compute the probability that the best node or a sub-optimal node gets selected in each slot, and the probability that no node ever gets selected due to imperfect power control. The implications of imperfect power control on system throughput are also investigated. We show that imperfect power control reduces the system throughput. We also evaluate the effect of peak power constraint on the performance of the timer-based and splitting-based selection schemes with power control. We show that it can reduce the probability of selection of the two schemes by as much as 19.1% and 9.7%, respectively, when the metric and channel gain are uncorrelated depending on the system parameters.

碩士
國立中興大學
電機工程學系所
106
In an era of information explosion, cloud storage or P2P (Peer-to-Peer) distributed storage techniques are used to solve the problem of data storage and sharing. However, the distributed storages techniques still face the privacy issues. Although cloud storage stores data in a distributed manner, the administration and management are still centralized and thus poses the problem of trustworthy and being monitored. In addition, whether the administrator has the data protection capabilities is another problem. On the other hand, P2P distributed storage systems are vulnerable to privacy leakage because data are stored in multiple independent nodes that are not trustworthy nor stable. In this thesis, motivated by the privacy protection requirement of a traffic accident emergency rescue system, we propose a Collusion Avoidance Node Selection Scheme for Social Network-based Distributed Data Storage to protect privacy in a distributed and unstable environment. Specifically, we use Fountain Code to encode data and generate sufficient amount of coding symbols and store them distributed. By this approach, we solve the problems of privacy preserving and node unstable problem simultaneously. To improve the reliability, we propose to select node from one’s social network as the data keepers and design a trust score function to evaluate the nodes in the node selection algorithm. Besides, we further consider the concept of gamming theory to prevent the collusion between data-keepers. In the experiments, we use real datasets to study the performance of our proposed approach. The experimental results show that our approach outperforms the Best Score Selection and Random Selection methods and our approach can avoid collusion effectively and improve the data privacy.

The conclusion of contracts was known in ancient times and is still relevant today. Shares that are not distributed in kind can cause certain difficulties that force the interested parties to decide on distribution.Joint ownership of inherited property received from a family member necessitates joint decision-making on its maintenance, ownership, use, and disposal, and it is difficult to achieve such a consensus on all issues. Therefore, quite often a certain period may pass from the acquisition of the right to a share in the joint property to its distribution, but due to conflicts regarding the use of the property or in the case of the need to receive funds or for other reasons, the joint property is divided by the co-owners. That is, the reasons may even be questions of how to use agricultural land, for example, to rent it out, sow it yourself, plant a garden, etc. However, the complexity of the division of land plots is because it is difficult to «divide» agricultural lands at least. After all, their intended use depends on the size, etc. Quite often, disputes also arise regarding the use of residential buildings, since the size and location of the rooms make their use impossible or difficult, as well as the distribution in kind according to the inherited shares. In other words, there is a certain «trading» of assets. If the situation is related to the distribution of a small plot of land where the house is located, then questions also arise regarding the establishment of an easement, as well as mutual concessions for the compensation of a part of the house in exchange for most of the land. In general, there are protracted negotiations, from the point of view of which these parties, who are still in a family relationship, agree on the division of property.Factors that can affect the outcome of property division include unique family circumstances, the specific nature of assets, and traditional legal practices. The parties will use different mechanisms for the division of joint assets: sale, donation, or exchange, under the terms of which they «trade» with the consent of others their rights as co-owners of jointly owned objects. The various evolutionary stages of the agreement on the division of property by the testator’s family culminate in the final stage of agreeing. The agreement on the division of inheritance is a complex legal process. Potentially, in a single transaction, the beneficiaries can choose and implement the division by sale, exchange, or donation. These different legal constructions reflect the uniqueness of the decisions in each agreement and to some extent demonstrate the specific legal practice of the individual Old Babylonian city-state and the particular circumstances of each family.However, in addition to the division of property, there are other agreements regarding the division of inheritance. For example, an agreement on quasi-partition upon adoption (quasi-adoption), an agreement on the division of residential property by the owner between its future beneficiaries.The need to conclude such agreements arises when an agreement on the division of property is required, which differs from such concepts as sale, donation, exchange, etc.Domestic scientists consider the agreement on the distribution of joint property very broadly and include other types of agreements in the list of such agreements, establishing that the agreement on changing the succession of the right to inheritance by law is atypical. It was determined that the contract under investigation belongs to contracts on the distribution of inheritance. Agreements on the distribution of inheritance are concluded in the field of inheritance, which indicates that they belong to inheritance agreements. It is proposed to supplement the existing classifications of civil law contracts by distinguishing a new type of civil law contracts – contracts in the law of inheritance on the level with the selection of a new type of inheritance contracts – contracts on the distribution of inheritance.» This is a bold hypothesis, but it is difficult to agree with it for various reasons, not least because the distribution of inheritance has been known since ancient times.The factor that the term «distribution» of inheritance and giving it a broad legal meaning is analyzed is an interesting author’s hypothesis. At the same time, according to our position, the term «distribution of inheritance» is more balanced, since in Art. 1278 of the Civil Code does not quite successfully use the term «division», when in the content of this norm it is about the equality of shares in the inheritance and the allocation of a share in kind, and not about division. However, in Part 1 of Art. 1280 of the Civil Code, the term «distribution» is used with a direct meaning and «redistribution» as an opportunity to review the results of the distribution under new circumstances – in the case of acceptance of the inheritance by other heirs. In essence, the obvious meaning of the term «distribution» follows from this norm as the initial determination of the ownership of the share of each of the heirs. In this sense, the redistribution of the inheritance should be connected with the possible introduction of changes to the previously made distribution, that is, in this case, we do not limit the number of subsequent redistributions of the inheritance. This hypothesis is related to the fact that the number of heirs who missed the deadline for valid reasons is not limited by legislation and cannot be limited, but is determined by various legal circumstances.Therefore, it is hardly expedient and possible, to apply in Art. 1280 of the Civil Code, the concept of «distribution» should be given a wider meaning than it has in the Civil Code, as this would lead to its ambiguous perception and application both in theory and in legislation and practice. Usually, theoretical terms should be distinguished by being original and should accurately reflect the legal meaning of actions, events, or conditions.But an important element of the procedure for the distribution of common inheritance property or its redistribution are the subjects who must fix the relevant agreement or carry out such distribution according to their conviction.It is indicated that the practice of concluding contracts by the living owner with his future heirs is widespread in foreign countries. At the same time, German experts equate inheritance with what they consider to be contractual inheritance.It should be noted that the practice of concluding contracts on the distribution of inheritance in the practice of the Ukrainian notary is relatively new and does not have clear boundaries in regulation, which complicates the activity of notaries in certifying such contracts. There are several difficulties in the application of relevant legal norms in practice, as there is a lack of understanding of the legal nature and essence of the conclusion of contracts, the term of conclusion, and the procedure for notarization.The opinions of individual authors are studied, about legal relations regarding the division of inheritance characterized by a weak state policy, this obliges the participants of such relations to draw up the content of agreements on the division of inheritance independently. For agreements between heirs on the distribution of inheritance to be valid regulators of the relations of its participants (heirs), conditions (clauses) must be clarified and formulated, which will be disclosed with sufficient completeness and consistency of the content of the relevant agreement and the purpose of its conclusion.We do not agree with this point of view of the scientist regarding «weak state policy», since the Central Committee of Ukraine was not created by politicians or the Ministry of Justice of Ukraine, but by leading scientists of Ukraine. It is also difficult to agree with the statement that the lack of clear regulation of the terms of inheritance contracts «obliges the participants of such relationships to independently draw up the content of inheritance distribution contracts.» In Ukraine, some good notaries and lawyers can draw up high-quality contracts for the distribution of inheritance. Moreover, according to Art. 4 of the Law of Ukraine «On Notaries», notaries have the right to draw up relevant draft contracts. In our opinion, it is worth emphasizing here that this is a right, not a duty of a notary public. That is, the notary may not undertake the drafting of the relevant project, but this provision is positive for interested parties since the lack of experience in drafting original contracts will most likely lead to the drafting of a low-quality draft contract. Indeed, in this case, it is worth looking for an experienced notary who will be able to draw up a draft contract, but this will make it possible to prevent errors in its drafting with a high probability.Thus, the agreement on the distribution of inheritance enters into force if the parties reach an agreement in the proper form on all the essential terms of the agreement. The main essential condition for agreeing on the division of inheritance is the subject of the agreement. However, either party may consider this condition insufficient and propose to include additional conditions in the contract. In this case, these conditions become essential. In connection with the instability of the regulation of the content of contracts between heirs on the distribution of inheritance, it can be concluded that the inclusion of normal conditions in the contract is currently impossible. We believe that such a general scheme of perception of contract terms is not entirely rational, since how to perceive ordinary terms or essential terms of a contract quite often in practice depends on the judgments of the parties to the contract unless otherwise regulated by legislation. This issue can be approached more precisely if we take into account the possibility of interpreting transactions and contracts (Article 213 of the Civil Code).So, based on the essence of the process of concluding contracts, it should be taken into account that the notary who drafts the contract can edit it, therefore it is worth recognizing the right of the notary to interpret it, since according to Art. 5 of the Law of Ukraine «On Notaries», he is obliged to clarify the legal consequences that will arise for persons after his certification. It follows from this that the notary must be given the official right to interpret the contract upon its certification, then it will be clear that after its certification, the court can interpret the content of the contract. In this regard, Art. 213 of the Civil Code is proposed to be supplemented with a corresponding provision regarding the powers of the notary, namely: his duty to interpret the content of the deed or contract before and during its certification.The Inheritance Regulation, which envisages wide acceptance of the inheritance contract, is considered. It is noted that it is worth revising Ukrainian inheritance law in advance for compliance with European standards since after Ukraine accedes to the EU it will be necessary to inform all EU countries about what types of contracts in Ukraine will be related to the issuance of the European Certificate of Succession.This is also important for inheritance by law, because, in case of non-fulfillment of the terms of the lifetime maintenance (care) agreement and the inheritance agreement, they will have to be terminated or recognized as invalid or unfulfilled by the acquirer, so the property that was the subject of this agreement will be inherited by law. At the same time, if the terms of these agreements are fulfilled, the part of the property that belonged to the testator will not be inherited but will become the property of the acquirers.The process of accepting the inheritance is quite long, and the inheritance law allows for several agreements between the heirs, which can significantly affect the size of the inheritance shares and the real things in each share in the inheritance. Therefore, it is necessary to analyze the possibility of agreements between the heirs at different stages of accepting or not accepting the inheritance. From communication with one of the clients, the author learned that the notary unofficially advised the heirs to agree on the distribution of the inheritance, as well as for certain heirs to waive the right to inheritance, but to receive a proper share of the inheritance in household items. When the author was informed of all the circumstances of the inheritance case, it became clear that the notary could not solve the complex inheritance problem, since the inheritance took place based on a will and some heirs had the right to a mandatory share, as well as part of the property remained. So, in such a situation, it was necessary to solve an arithmetical and at the same time legal problem, the complexity of which was determined by the complex subject composition of numerous heirs. Therefore, the notary tried to simplify its solution by artificially «transforming» the heirs who have the right to a mandatory share into ordinary heirs who claim property that is not subject to recording in the certificate of the right to inheritance.A natural will was considered, when the testator bequeathed the specific property to each of the heirs, namely: a house to a daughter, a factory to one son, and a yacht to another let’s say. In such a case, the will of the testator is formulated in the Shodo of the objects of inheritance, so it is difficult to perceive the consequences of the refusal of one of the heirs to inherit, when the yacht will be divided into equal shares between the son and the daughter, because: firstly, the value of the factory and the house will be different, so someone from the testator gave the children a larger inheritance than the other. Secondly, in the case of the existence of a part of the inheritance not covered by the will, it can be assumed with a high degree of probability that the will of the testator was formulated about a certain property and nothing more. Therefore, in case of refusal of one of the heirs to inherit under the will, the property bequeathed to him should be considered as not covered by the will and should be inherited according to the law. That is, if the will of the testator regarding the entire property is revealed, it can be assumed that he thus intended to deprive one of the heirs of the right to inheritance.At the same time, the will must be interpreted not only by the heirs under the will but also by the heirs under the law, when its content concerns the right to a mandatory share in the inheritance, which belongs to the heirs under the law of the first rank, who due to incapacity have the right to claim it, as well as the recipients of the response. With a high degree of probability, it can be assumed that the inheritance, which consists of household items, will be divided even without a written agreement. However, the interpretation of a will, which concerns a substantial inheritance between a significant number of heirs, requires not only a written form of recording of agreements – a contract, but also, in our opinion, a notarial form that will allow recording the agreement more reliably, to explain to the parties to the contract the consequences of its conclusion. If all interested parties sign the agreement, and the notary recognizes it as legal, then it will be difficult to recognize it as illegal or invalid in the next one. Therefore, the agreement on the interpretation of the will, which will establish the specific rights of the heirs and their obligations regarding the coverage of the testator’s debts, is a rational form of specification of the terms of the inheritance, which will allow establishing the executor of the will, if he was not determined by the testator.We can assume with a high degree of probability that similar «simplified calculations» are made by other notaries, as well as directly by the heirs, and certain agreements are not necessary here.

Cooperative diversity has the potential of implementing spatial diversity and mitigating the adverse effects of channel fading without requiring multiple antennas at transmitters and receivers. Traditionally, cooperative diversity is implemented using maximal ratio combining (MRC), where all available nodes relay signals between the source and destination. It has recently been proposed, however, that for each source-destination transmission, only a single best node should be selected to act as a relay. The resulting scheme, referred to as selection cooperation or opportunistic relaying, outperforms MRC schemes and can be implemented in a distributed fashion with limited feedback. This result is not unexpected, as selection requires some (though very limited) information regarding instantaneous channel conditions, while MRC does not. When implemented in a distributed network, however, MRC does require feedback for the synchronization of nodes, rendering a comparison of the two schemes worthwhile and fair. In this chapter, we provide a detailed overview of selection. We begin with a single source-destination pair, and discuss its implementation and performance under various constraints and scenarios. We then discuss a less-common scenario, a multisource network where nodes act both as sources and as relays.

This chapter introduces the Reed-Solomon (RS) codes and the distributed RS-coded cooperative system over the Rayleigh fading channel, where the encoding and decoding procedures of the RS codes are elaborated. Besides, two optimized selection approaches, i.e., the exhaustive search approach and partial search approach, are employed in the relay to obtain a resultant code at the destination with better weight distribution. Moreover, the two joint decoding algorithms, namely naive and smart algorithms, are presented that further improve the overall average bit error rate (BER) performance of the cooperative scheme. Also, the performance analysis of the distributed RS-coded cooperative scheme is provided in detailed.

BCHP (Building Cooling, Heating and Power) system is an integrated energy system based on the energy cascade utilization and is used to supply heating, cooling and power synchronously. Normally the scale of BCHP system is smaller than that of the CCHP (Combined Cooling Heating and Power) system of thermal power plant. BCHP system is one of the most important directions of the second generation energy system and distributed energy system and has advantages of energy conservation, environment protection and safety performance, etc. In this paper with the example of an actual building, by using the theories of GRA (Grey Relation Analysis) and AHP (Analytical Hierarchy Process) the mathematical models for the comprehensive evaluation of BCHP system are established. Three schemes of BCHP systems are given and the indexes of economy, environment protection, energy conservation and reliability are considered as the main factors in the project selection of BCHP system. The optimal scheme is selected according to the cooling, heating and power loads of the building. In the optimization process, both the evaluation indexes and the weight coefficients are chosen objectively to improve the comprehensive and scientific performance of BCHP project selection.

Abstract Distributed Control System (DCS) is regarded as the “brain” of nuclear power plant due to its function required in guarding nuclear safety. Power supply system is vital to supply electric power for DCS to maintain normal operation. Distribution design requirements of DCS power supply system are discussed firstly on analyzing the requirements of IEEE, IEC, etc. Combining with the comparative analysis of power supply schemes of DCS system in typical nuclear power plants based on CPR1000, AP1000 and EPR, key factors restricting the reliability of DCS power supply system are analyzed based on relevant design rules and standards in this paper. The method of improving the reliability of DCS power supply system is explored by analyzing the type of power supply, system design, equipment selection and design of electrical raceway. Thus a new high reliability power supply scheme for DCS system is presented based on mature equipment manufacturing technology. The scheme enhances the reliability, stability and flexibility of the distribution system by reducing the converting process on distribution path, increasing the design of cross-tie between divisions, and making full use of the advantages of DC distribution system. Through system operation analysis, equipment analysis and fault response analysis, this paper discussed the high reliability and feasibility of the new scheme, providing a new research direction for the design of DC system in nuclear power plant.