Detailed derivation of the MF and BP algorithms We show here detailed derivation of the new MF and BP algorithms. In our main paper, we present simplified derivation which needs an assumption that the number S i of mixtures is the same for all sites, i.e., S i = S for any i. In what follows, we present complete derivation of the two algorithms which do not require this assumption; several equat...

abstract rainwater harvesting (rwh) is one of the most effective water resources management techniques for confrontation with water shortage condition. rwh which is basically known as a traditional method, has been developed rapidly and being used widely in dryland countries throughout the world. rwh is defined as collecting and storing rainwater from nearby catchment and delivering it to plant...

Supplementary Figure 1 Behavioral results from additional psychophysical tests Supplementary Figure 2 Percent signal change and composite data Supplementary Figure 3 Simulation results – effects of signal to noise ratios and cue reliability Supplementary Figure 4 Simulation results – effects of spatial organization Supplementary Figure 5 Subjective assessment of eye vergence results Supplementa...

Supplementary Figure 1 Annotated isoforms in human and mouse genomes. Supplementary Figure 2 Estimates of  using single‐end reads. Supplementary Figure 3 Steps of MISO statistical inference procedure Supplementary Figure 4 Evidence for exon size‐dependent qRT‐PCR bias. Supplementary Figure 5 MISO estimation for 52 alternative exons in breast cancer tissue. Supplementary Figure 6 mRNA‐Seq data...

Abstract: This paper presents reliability and availability analyses of a model representing a system having one robot and n-redundant safety units with common-cause failures. At least k safety units must function successfully for the robot system success. The robot and other failure rates and the partially failed system repair rates are assumed constant and the failed robot-safety system repair...

In this paper, we present a discrete-time single-server finite-buffer queue in which the server takes single/multiple vacations whenever the system becomes empty. The interarrival times are geometrically distributed and service, vacation times are independently identically distributed random variables and their durations are integral multiples of a slot duration. We obtain the state probabiliti...

We study a finite buffer N-policy GI/M(n)/1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive met...

This study investigates a random N-policy Geo/G/1 queue with startup and closedown times. N is newly determined every time a new cycle begins. When random N customers are accumulated, the server is immediately turned on but is temporarily unavailable to the waiting customers. It needs a startup time before starting providing service. After all customers in the system are served exhaustively, th...