876 resultados para delays


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Delay in the delivery of manufacturing projects is a major problem in manufacturing industries. This research investigates the factors that influence the lead time of new projects in manufacturing organisations. Employing a questionnaire survey and interview methodologies, this study collected data from five leading manufacturing organisations as well as their suppliers and contractors in Saudi Arabia to examine what, how and why the new project implementation delay occurs. Results show that the main factors contributing to manufacturing delays are related to people and material. On the other hand, social, political and cultural factors were the least significant factors as per the outcome of this study. Views of manufacturers, suppliers and contractors regarding causes of delays have also been analysed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

I-Methylcyclopropene (1-MCP) has the potential in tomato to reduce ethylene-associated changes in texture. Tomato cv. 'Revolution' was harvested at the 'pink' maturity stage and whole fruit treated with 0, 0.1, 1.0 or 10.0 µL.L-' 1-MCP at 20 "C for 12 h. Slices of 7-mm thickness were cut using a commercial slicer, and the slices stored in vertical stacks in plastic containers at 5°C for 7 days. The application of 1-MCP reduced both ethylene production and respiration rate of slices and resulted in firmer pericarp firmness. Ethylene production was 24%, 40%, and 62% lower following 0.1, 1.0, 10.0 µL L-' 1-MCP, respectively, compared with controls. In addition, respiration rate was reduced 6%, 10% and 20% by those 1-MCP treatments. 1-MCP treatments produced 20%, 34%, and 24% higher pericarp firmness, respectively, than in fruit not treated with 1-MCP.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Vegetative propagation programs internationally are affected by the significant decline of rooting success as trees mature. This study compared the cellular stages of root formation in stem cuttings from 15-week-old (juvenile) and 9-y-old (mature) stock plants of the slash x Caribbean pine hybrid (Pinus elliottii var. elliottii x P. caribaea van hondurensis). The cellular stages of root formation were the same in both juvenile and mature cuttings, beginning with cell divisions of the vascular cambium forming callus tissue. Within the callus, tracheids differentiated and elongated to form root primordia. Roots in juvenile cuttings developed faster than those in mature cuttings and the juvenile cuttings had a much higher rooting percent at the end of the study (92% and 26% respectively). Cuttings of the two juvenile genotypes had more primary roots (5.5 and 3.3) than the three mature genotypes (0.96, 0.18 and 0.07). The roots of juvenile cuttings were more evenly distributed around the basal circumference when compared with those on cuttings from the mature genotypes. Further work is needed to improve understanding of physiological changes with maturation so that the rooting success and the speed of development in cuttings from mature stock plants can be optimised, hence improving genetic gain.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer delays. Using enough memory at the nodes of an acyclic network with integer delays can effectively simulate instantaneous behavior, which is probably why only acyclic instantaneous networks have been primarily focused on thus far. However, nulling the effect of the network delays are not always uniformly advantageous, as we will show in this work. Essentially, we elaborate on issues ((a), (b) and (c) above) related to network coding for acyclic networks with integer delays, and show that using the delay network as is (without adding memory) turns out to be advantageous, disadvantageous or immaterial, depending on the topology of the network and the problem considered i.e., (a), (b) or (c).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The concept of interference alignment when extended to three-source three-destination instantaneous multiple unicast network for the case where, each source-destination pair has a min-cut of 1 and zero-interference conditions are not satisfied, is known to achieve a rate of half for every source-destination pair under certain conditions [6]. This was called network alignment. We generalize this concept of network alignment to three-source three-destination multiple unicast (3S-3D-MU) networks with delays, without making use of memory at the intermediate nodes (i.e., nodes other than the sources and destinations) and using time varying Local Encoding Kernels (LEKs). This achieves half the rate corresponding to the individual source-destination min-cut for some classes of 3S-3D-MU network with delays which do not satisfy the zero-interference conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Orthogonal frequency-division multiple access (OFDMA) systems divide the available bandwidth into orthogonal subchannels and exploit multiuser diversity and frequency selectivity to achieve high spectral efficiencies. However, they require a significant amount of channel state feedback for scheduling and rate adaptation and are sensitive to feedback delays. We develop a comprehensive analysis for OFDMA system throughput in the presence of feedback delays as a function of the feedback scheme, frequency-domain scheduler, and rate adaptation rule. Also derived are expressions for the outage probability, which captures the inability of a subchannel to successfully carry data due to the feedback scheme or feedback delays. Our model encompasses the popular best-n and threshold-based feedback schemes and the greedy, proportional fair, and round-robin schedulers that cover a wide range of throughput versus fairness tradeoff. It helps quantify the different robustness of the schedulers to feedback overhead and delays. Even at low vehicular speeds, it shows that small feedback delays markedly degrade the throughput and increase the outage probability. Further, given the feedback delay, the throughput degradation depends primarily on the feedback overhead and not on the feedback scheme itself. We also show how to optimize the rate adaptation thresholds as a function of feedback delay.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Orthogonal frequency division multiple access (OFDMA) systems exploit multiuser diversity and frequency-selectivity to achieve high spectral efficiencies. However, they require considerable feedback for scheduling and rate adaptation, and are sensitive to feedback delays. We develop a comprehensive analysis of the OFDMA system throughput as a function of the feedback scheme, frequency-domain scheduler, and discrete rate adaptation rule in the presence of feedback delays. We analyze the popular best-n and threshold-based feedback schemes. We show that for both the greedy and round-robin schedulers, the throughput degradation, given a feedback delay, depends primarily on the fraction of feedback reduced by the feedback scheme and not the feedback scheme itself. Even small feedback delays at low vehicular speeds are shown to significantly degrade the throughput. We also show that optimizing the link adaptation thresholds as a function of the feedback delay can effectively counteract the detrimental effect of delays.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A transform approach to network coding was in-troduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as k-instantaneous networks (for some large k). When the local encoding kernels (LEKs) of the network are varied with every time block of length k >1, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S3-D MUN-D). In a recent work, Menget al. (arXiv:1202.3405v1 [cs.IT]) reduced the infinite set of sufficient conditions for feasibility of PBNA in a three-source three-destination instantaneous multiple unicast network as given by Das et al. (arXiv:1008.0235v1 [cs.IT]) to a finite set and also showed that the conditions are necessary. We show that the conditions of Meng et al. are also necessary and sufficient conditions for feasibility of PBNA based on transform approach and block time varying LEKs for 3-S3-D MUN-D.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In contemporary orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), LTE-Advanced, and WiMAX, a codeword is transmitted over a group of subcarriers. Since different subcarriers see different channel gains in frequency-selective channels, the modulation and coding scheme (MCS) of the codeword must be selected based on the vector of signal-to-noise-ratios (SNRs) of these subcarriers. Exponential effective SNR mapping (EESM) maps the vector of SNRs into an equivalent flat-fading SNR, and is widely used to simplify this problem. We develop a new analytical framework to characterize the throughput of EESM-based rate adaptation in such wideband channels in the presence of feedback delays. We derive a novel accurate approximation for the throughput as a function of feedback delay. We also propose a novel bivariate gamma distribution to model the time evolution of EESM between the times of estimation and data transmission, which facilitates the analysis. These are then generalized to a multi-cell, multi-user scenario with various frequency-domain schedulers. Unlike prior work, most of which is simulation-based, our framework encompasses both correlated and independent subcarriers and various multiple antenna diversity modes; it is accurate over a wide range of delays.