Deterministic Scheme Research Articles

A Multiobjective Stochastic Optimization Scheme for the Problem of Chemical Production for Sugarcane Companies


 
 
 
 This paper presents a multiobjective optimization stochastic scheme for production planning for sugarcane companies under uncertainty. The proposed approach considers three stages. The first stage comprises the mass and energy balances for determining process flows. The second stage considers the formulation of a Multiobjective Deterministic Model (MODM) by considering two objective functions: maximizing the gross margin and minimizing the environmental impact. The MODM is given by different production plans that respond differently to the parameters’ variability under uncertainty. Finally, the last stage considers stochastic elements (i.e., product prices, demands, and costs) within the deterministic scheme to obtain a Multiobjective Stochastic Model (MOSM). A case study’s computational results based on the Colombian sugarcane industry show the proposed scheme’s effectiveness. Results include the investment strategy for optimal production planning with an analysis of the parameters’ uncertainty on the economic performance of the planning production configurations.
 
 
 

Unified generation and fast emission of arbitrary single-photon multimode W states

We propose a unified and deterministic scheme to generate arbitrary single-photon multimode $W$ states in circuit QED. A three-level system (qutrit) is driven by a pump-laser pulse and coupled to $N$ spatially separated resonators. The coupling strength for each spatial mode $g_i$ totally decide the generated single-photon N-mode $W$ state $\vert W_N \rangle=\frac{1}{A}\sum_{i=1}^N g_i|0_1 0_2 \cdots 1_i 0_{i+1}\cdots 0_N\rangle$, so arbitrary $\vert W_N \rangle$ can be generated just by tuning $g_i$. We could not only generate $W$ states inside resonators but also release them into transmission lines on demand. The time and fidelity for generating (or emitting) $\vert W_N \rangle$ can both be the same for arbitrary $N$. Remarkably, $\vert W_N\rangle$ can be emitted with probability reaching $98.9\%$ in $20-50$ ns depending on parameters, comparable to the recently reported fastest two-qubit gate ($30-45$ ns). Finally, the time evolution process is convenient to control since only the pump pulse is time-dependent.

A Probabilistic Chaotic Image Encryption Scheme

This paper proposes a probabilistic image encryption scheme that improves on existing deterministic schemes by using a chaining mode of chaotic maps in a permutation-masking process. Despite its simplicity, the permutation phase destroys any correlation between adjacent pixel values in a meaningful image. The masking phase, however, modifies the pixel values of the image at hand using pseudorandom numbers with some other initiated random numbers so that any slight change in the plain image spreads throughout the corresponding cipher image. These random numbers ensure the generation of distinct cipher images for the same plain image encryption, even if it is encrypted multiple times with the same key, thereby adding some security features. Simulations show that the proposed scheme is robust to common statistical and security threats. Furthermore, the scheme is shown to be competitive with existing image encryption schemes.

Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers

We consider the setting of a distributed storage system where a single file is subdivided into smaller fragments of same size which are then replicated with a common replication factor across servers of identical cache size. An incoming file download request is sent to all the servers, and the download is completed whenever the request gathers all the fragments. At each server, we are interested in determining the set of fragments to be stored, and the sequence in which fragments should be accessed, such that the mean file download time for a request is minimized. We model the fragment download time as an exponential random variable independent and identically distributed for all fragments across all servers, and show that the mean file download time can be lower bounded in terms of the expected number of useful servers summed over all distinct fragment downloads. We present deterministic storage schemes that attempt to maximize the number of useful servers. We show that finding the optimal sequence of accessing the fragments is a Markov decision problem, whose complexity grows exponentially with the number of fragments. We propose heuristic algorithms that determine the sequence of access to the fragments which are empirically shown to perform well.

Xenakis’ Sieve Theory

Iannis Xenakis sternly criticized serial music in the mid-fifties. In response, he proposed and developed a set of compositional procedures which were mainly based on probabilistic laws that he framed under the principle of indeterminism. The sieve theory he developed in the sixties represented a return to deterministic strategies for composing. Following examination of Xenakis’ notes and sketches from the period spanning his time auditing Messiaen’s classes to his composition of Nomos Alpha, I argue that sieve theory is better understood when viewed through the lens of his personal earlier speculations on twelve-tone music techniques.

Aggregator’s scheduling and offering strategy for renewable integration based on information gap decision theory

Due to the increasing penetration of renewable energy, the problem of curtailing wind and photovoltaic is becoming more and more prominent. Peak regulation market is established for renewable integration in China. Owing to the flexibility in demand side, the aggregator is able to participant in the peak regulation market. For this purpose, this paper aims to derive an optimal scheduling and offering strategy for the aggregator in the peak regulation market. The proposed strategy applies information gap decision theory (IGDT) to deal with the uncertainty of the market clearing price. First, the aggregator’s deterministic strategy is given which considers two types of load: temperature control load (TCL) and electric vehicle (EV). And based on IGDT, the robust strategy and the opportunistic strategy are presented. Then, in order to further reduce the profit loss caused by the forecasted error of the market clearing price, the step offering curve is developed. Finally, the results of case studies validate the effectiveness of the proposed strategy.

Quantum anonymous veto: a set of new protocols

We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based deterministic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.

Scatter search for the minimum leaf spanning tree problem

Given an undirected connected graph G, the Minimum Leaf Spanning Tree Problem (MLSTP) consists in finding a spanning tree T of G with minimum number of leaves. This is an NP-hard problem with applications in communication and water supply networks. In this paper, we propose a heuristic algorithm to provide high-quality solutions (spanning trees with low number of leaves) for an input graph. Our heuristic is based on the scatter search methodology, and it combines different elements to perform an efficient search of the solution space. In particular, it applies both randomized and deterministic strategies in the construction methods to generate an initial set of solutions. A combination method specifically designed for trees coupled with two local searches with a diversity evaluation function, provides a good balance between search intensification and diversification. Experiments conducted on a large set of graphs indicate that our algorithm is able to generate spanning trees with a lower number of leaves than previous methods. Additionally, it is able to match the optimal solution in most of the instances for which it is known, outperforming the existing methods.

Isomorphism testing of read-once functions and polynomials

In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of read-once formulas is complete for log-space. In contrast, we observe that the problem becomes polynomial-time equivalent to the graph isomorphism problem when the input formulas can be represented as OR of two or more read-once formulas.We address the polynomial isomorphism problem, a special case of polynomial equivalence problem which in turn is important from a cryptographic perspective [Patarin EUROCRYPT '96, and Kayal SODA '11]. As our main result, we propose a deterministic polynomial time canonization scheme for polynomials computed by read-once arithmetic formulas. In contrast, we show that when the arithmetic formula is allowed to read a variable twice, this problem is at least as hard as the graph isomorphism problem.

Deterministic enhancement for bright-seeded Mach–Zehnder interferometer using low-noise feed-forward amplifiers

We propose to use low-noise feed-forward amplifiers (LFAs) to enhance the phase sensitivity of a bright-seeded Mach–Zehnder interferometer (MZI). LFAs are performed on the two arms inside the MZI, which are based entirely on linear optics, off-line squeezed ancillary states, and homodyne detectors. We demonstrate the necessity of LFA-based topology in achieving sensitivity improvement beyond the standard quantum limit, compared with the deterministic linear amplification scheme. Remarkably, we find that the LFA-based MZI is advantageous over the standard MZI in robustness against the internal losses of the interferometer.

EDCCS: effective deterministic clustering scheme based compressive sensing to enhance IoT based WSNs

EDCCS: effective deterministic clustering scheme based compressive sensing to enhance IoT based WSNs

A new bound for the Maker–Breaker triangle game

The triangle game introduced by Chvátal and Erdős (1978) is one of the old and famous combinatorial games. For n,q∈N, the (n,q)-triangle game is played by two players, called Maker and Breaker, on the complete graph Kn. Alternately Maker claims one edge and thereafter Breaker claims q edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chvátal and Erdős (1978) proved that for q<2n+2−5/2≈1.414n Maker has a winning strategy, and for q≥2n Breaker has a winning strategy. Since then, the problem of finding the exact leading constant for the threshold bias of the triangle game has been one of the interesting open problems in combinatorial game theory. In fact, the constant is not known for any graph with a cycle and we do not even know if such a constant exists. Balogh and Samotij (2011) slightly improved the Chvátal–Erdős constant for Breaker’s winning strategy from 2 to 1.958 with a randomized approach. Since then no progress was made. In this work, we present a new deterministic strategy for Breaker’s win whenever n is sufficiently large and q≥(8/3+o(1))n≈1.633n, significantly reducing the gap towards the lower bound of the threshold bias. In previous strategies Breaker chooses his edges such that one node is part of the last edge chosen by Maker, whereas the remaining node is chosen more or less arbitrarily. In contrast, we introduce a suitable potential function on the set of nodes. Breaker aims to decrease the potential, and picks edges that connect the most ‘dangerous’ nodes. A crucial point of the analysis is that the total potential of the game may increase even for a constant number of rounds, but then drops down. At the end of the game it is below a critical level connected to Breaker’s win.

Optimal energy management of fuel cell hybrid electric vehicle based on model predictive control and on-line mass estimation

Energy management strategies with prediction message show great potential in optimizing control objectives for fuel cell hybrid vehicles. This paper presents a novelty model-predictive-control based energy management framework for fuel cell commercial vehicle, in which the vehicle mass is firstly introduced as a variable parameter for controller. A vehicle mass identification model is established and embed in the framework based on recursive least square algorithm, and the influence of variable algorithm parameters on estimator is evaluated. Then the effects of mass varying on vehicle performance is talked about in detail. In addition, the performance for different drive cycles on different loaded is also given. The simulation results show that the fuel consumption is positively correlated with the mass identification error, and the designed controller can reduce the additional fuel consumption to around 0.1%, which is much batter to the deterministic parameters scheme. Finally, the shortcomings of the designed controller are given. This paper provides a reliable theoretical basis to address varying-mass vehicle energy management problems.

Dissipative optomechanical preparation of non-Gaussian mechanical entanglement

Entanglement had played a crucial role in developing frontier technologies as a critical resource, for instance, in quantum teleportation and quantum sensing schemes. Notably, thanks to the ability to cool down the vibrational modes of mechanical oscillators to its quantum regime, entanglement between mechanical modes and the production of nonclassical mechanical states have emerged as central resources for quantum technological applications. Thus, proposing deterministic schemes to achieve those tasks is of paramount importance. While the dominant scheme for bipartite mechanical entanglement involves Gaussian optomechanical interactions (linearized regime) to generate two-mode squeezed vacuum states, entangling two-modes exploiting the bare non-Gaussian optomechanical interaction (nonlinear strong single-photon regime) remains less covered. This work proposes an on-demand scheme to engineer phononic non-Gaussian bipartite entanglement in the nonlinear regime by exploiting cavity dissipation. Interestingly, our protocol (operating in the resolved sideband and photon blockade regime) renders the possibility of achieving a high degree of steady-state entanglement. We further show that our deterministic scheme is robust in the presence of decoherence and temperature within state-of-the-art optomechanics, along with the required conditions to obtain non-Gaussianity of the achieved bipartite mechanical steady-state.

Methodological Paradigm of Non-Classical Science

Scientific theories and methods developed within the framework of quantum and relativistic physics are the most representative paradigmatic instantiations of non-classical science. The profile of non-classical science is exposed through the analysis of a set of epistemic ideals and methodological principles. The adoption of the principle of operational relativity of phenomenal descriptions showed that a reference to the means of observation had become an intrinsic part of scientific description strategies. The transformation of the concept of objectivity can be seen in a specific combination of operationalism with interactional phenomenalism and constructivism. The introduction of the principle of complementarity marked the deviation from the standards of a monologic and linear description of the objects under study. This principle provides the operational basis for the integration of different parts of our knowledge with regard to non-trivial cognitive situations featured by the indeterminacy relations. Another prominent methodological trend is the reconsideration of the value of strict deterministic explanation strategies in favour of probabilistically oriented approaches. Scientists have encountered a new class of regularities that are typically analysed in terms of various types of statistical and non-causal determination. Nevertheless, it would be wrong to assume that any probabilistic account of natural phenomena implies indeterminism.

Forgetful updating and stubborn decision-makers

A decision-maker receives an informative signal each period and is randomly required to make a terminal action based on the signals received so far. The decision-maker is restricted to use a (stochastic) finite automaton no larger than a given size to process information. In contrast to the existing literature that focuses on very low probability of termination, I consider information structures with a (nearly) revealing signal, in which analytical solutions are available for all probability values of termination. Results from that model reveal two robust predictions regarding constrained optimal behaviour. First, it is optimal to ignore small (in terms of informativeness) signals. Second, when deterministic schemes are optimal, big signals with similar strengths should be treated similarly; otherwise, randomization takes a lexicographic order according to the strengths of the signals. I also identify a new behavioural bias, information stubbornness, according to which the decision maker does not respond to further informative signals after seeing a nearly revealing signal. As a result, the decision-maker can persistently choose the wrong action even after an unbounded number of informative signals.

Effects of Numerical Forcing on the Two-Time Correlation of Fluid Velocity Differences in Stationary Isotropic Turbulence

In direct numerical simulations (DNS) of homogeneous isotropic turbulence, numerical forcing is needed to achieve statistically stationary velocity fields. The Eulerian two-time correlation tensor of the fluid velocity difference field, Δu(r,t)=u(x+r,t)−u(x,t), characterizes the temporal evolution of turbulent eddies whose sizes scale with separation r=|r|. In this study, we investigate the effects of two spectral forcing schemes on the temporal decay of the Eulerian two-time correlation of fluid velocity differences ⟨Δu(r,t′)Δu(r,t)⟩. Accordingly, DNS of homogeneous isotropic turbulence were performed for two grid sizes, 1283 and 5123, corresponding to the Taylor micro-scale Reynolds numbers Reλ≈80 and 210, respectively. Statistical stationarity was achieved by employing deterministic and stochastic spectral forcing schemes. In the stochastic scheme, one needs to specify the time scale, Tf, of the Uhlenbeck–Ornstein (UO) processes that constitute the forcing. We considered four values of the UO time scale (Tf=TE/4,TE,2TE, and 4TE) for each Reλ, where TE is the large-eddy time scale obtained from the DNS run with deterministic forcing at the same Reλ. It is seen that the correlations ⟨Δu(r,t′)Δu(r,t)⟩ obtained from the deterministic-forcing DNS runs decay more slowly than those from stochastic-forcing DNS runs of all four Tf values. The slower decay of correlations in deterministic DNS runs is more pronounced at larger separations and for higher Reλ.

A localization and deployment model for wireless sensor networks using arithmetic optimization algorithm

With the advancement of sensor technologies, Wireless Sensor Networks (WSN) are envisioning a rich variety of promising services in many fields. WSN is formed by the deployment of sensor nodes in the regions of interest using a deterministic or random deployment strategy. The random deployment strategy is more suitable in large monitoring areas and harsh environments. But, in this type of deployment, coverage holes and disconnected networks can exist. Important events may get unnoticed reducing the reliability of the networks. Since the locations of nodes are unknown in a randomly deployed WSN, it is difficult to locate the holes. For this, we are proposing a localization and deployment model. The localization algorithm uses Arithmetic Optimization Algorithm (AOA) and the results of this algorithm are further used to develop a deployment model to achieve a completely connected network. This algorithm is tested in various fields. The algorithm is able to localize nodes accurately and identify the coverage holes with an error rate of less than 0.27% when the Average Localization Error (ALE) is within 5m.

An Asynchronous Bundled-Data Barrel Shifter Design That Incorporates a Deterministic Completion Detection Technique

A design for an asynchronous bundled-data barrel shifter that incorporates a deterministic completion detection circuitry is proposed. A bundled-data asynchronous circuit is inherently free from challenges associated with clock signals, but it is devoid of information pertaining to propagation delay through the circuit. An obvious solution is to produce the acknowledge signal at least <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta $ </tex-math></inline-formula> delay units after the arrival of the request signal, where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta $ </tex-math></inline-formula> is the maximum propagation delay through the circuit. However, similar to synchronous circuits, such bundle-data asynchronous approach does not take advantage of times where the propagation delay through the circuit is less than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta $ </tex-math></inline-formula> . This brief proposes a design for a deterministic completion detection scheme for an asynchronous bundled-data barrel shifter. Once the request signal is active, the shifting operation begins, and the acknowledge signal is generated after a delay that matches the actual shifting delay associated with the shift amount using a deterministic completion detection scheme. The shifter can reduce the idle time between the time its output is ready and the start of the next shift cycle by using a deterministic completion detection circuit. In this brief, the proposed design of the asynchronous barrel shifter and its average delay is analyzed. Its performance is also compared against its synchronous counterpart.

The danger and indeterminacy of forfeiting perching space of bryophytes from climate shift: a case study for 115 species in China.

Identifying the danger and expressing the indeterminacy of forfeiting perching space of species induced by rapid climate warming is crucial for biodiversity risk management under future changes in climate conditions. The scenarios of climate shift named the representative concentration pathways, the categorizing technique with regard to fuzzy-set, and Monte Carlo scheme was employed to survey the indeterminacy and the danger of forfeiting perching space caused by climate warming for 115 bryophytes in China. For the deterministic scenarios of climate shift, the richness of 115 bryophytes improved in several areas in north-eastern China, while it dropped in some areas in southern, eastern, south-eastern, and central China. In addition, for the deterministic scheme of altering climatic state, the count for bryophytes with the proportion of contracting the present areal range as less than 20%, 20-40%, 40-60%, 60-80%, and over 80% was belike 34-38, 19-38, 24-35, 9-19, and 4-9, separately; the count of bryophytes with the ratio of the occupying entire areal range as over 80%, 60-80%, and less than 20% was roughly 97-109, 4-14, and 2-8, separately. For the scenarios of randomly change in climate state, the number of bryophytes with a various proportion of forfeiting the present perching space dropped with enhancing the possibility; with the likelihood beyond 0.6, the count of bryophytes with forfeiting present perching space as less than 20%, 20-40%, 40-60%, 60-80% and high than 80% of the present areal range was approximately 7-14, 2-10, 0-7, 2-9, and 13-20, separately; the number of bryophytes with the ratio of occupying the whole areal range as less than 20%, 20-40%, 40-60%, 60-80%, and over 80% was more or less 1-3, 0-3, 1-5, 1-3, and 38-44, separately. Roughly 48 bryophytes would face the risk of extinction from climate warming, including endemic and non-endemic species. Forfeiting perching space induced by climate warming would cause variations in species composition and the disappearance of some ecological functions associated with these bryophytes. The inconstancy of forfeiting areal range caused by climate warming should be incorporated into the policy-making of conservation bryophytes for adaptation of climate warming.