947 resultados para Transport network optimization
Resumo:
DOCK180 is the archetype of the DOCK180-family guanine nucleotide exchange factor for small GTPases Rac1 and Cdc42. DOCK180-family proteins share two conserved domains, called DOCK homology region (DHR)-1 and -2. Although the function of DHR2 is to activate Rac1, DHR1 is required for binding to phosphoinositides. To better understand the function of DHR1, we searched for its binding partners by direct nanoflow liquid chromatography/tandem mass spectrometry, and we identified sorting nexins (SNX) 1, 2, 5, and 6, which make up a multimeric protein complex mediating endosome-to-trans-Golgi-network (TGN) retrograde transport of the cation-independent mannose 6-phosphate receptor (CI-MPR). Among these SNX proteins, SNX5 was coimmunoprecipitated with DOCK180 most efficiently. In agreement with this observation, DOCK180 colocalized with SNX5 at endosomes. The RNA interference-mediated knockdowns of SNX5 and DOCK180, but not Rac1, resulted in the redistribution of CI-MPR from TGN to endosomes. Furthermore, expression of the DOCK180 DHR1 domain was sufficient to restore the perturbed CI-MPR distribution in DOCK180 knockdown cells. These data suggest that DOCK180 regulates CI-MPR trafficking via SNX5 and that this function is independent of its guanine nucleotide exchange factor activity toward Rac1.
Resumo:
This paper explores the use of the optimization procedures in SAS/OR software with application to the contemporary logistics distribution network design using an integrated multiple criteria decision making approach. Unlike the traditional optimization techniques, the proposed approach, combining analytic hierarchy process (AHP) and goal programming (GP), considers both quantitative and qualitative factors. In the integrated approach, AHP is used to determine the relative importance weightings or priorities of alternative warehouses with respect to both deliverer oriented and customer oriented criteria. Then, a GP model incorporating the constraints of system, resource, and AHP priority is formulated to select the best set of warehouses without exceeding the limited available resources. To facilitate the use of integrated multiple criteria decision making approach by SAS users, an ORMCDM code was implemented in the SAS programming language. The SAS macro developed in this paper selects the chosen variables from a SAS data file and constructs sets of linear programming models based on the selected GP model. An example is given to illustrate how one could use the code to design the logistics distribution network.
Resumo:
This paper investigates a cross-layer design approach for minimizing energy consumption and maximizing network lifetime (NL) of a multiple-source and single-sink (MSSS) WSN with energy constraints. The optimization problem for MSSS WSN can be formulated as a mixed integer convex optimization problem with the adoption of time division multiple access (TDMA) in medium access control (MAC) layer, and it becomes a convex problem by relaxing the integer constraint on time slots. Impacts of data rate, link access and routing are jointly taken into account in the optimization problem formulation. Both linear and planar network topologies are considered for NL maximization (NLM). With linear MSSS and planar single-source and single-sink (SSSS) topologies, we successfully use Karush-Kuhn-Tucker (KKT) optimality conditions to derive analytical expressions of the optimal NL when all nodes are exhausted simultaneously. The problem for planar MSSS topology is more complicated, and a decomposition and combination (D&C) approach is proposed to compute suboptimal solutions. An analytical expression of the suboptimal NL is derived for a small scale planar network. To deal with larger scale planar network, an iterative algorithm is proposed for the D&C approach. Numerical results show that the upper-bounds of the network lifetime obtained by our proposed optimization models are tight. Important insights into the NL and benefits of cross-layer design for WSN NLM are obtained.
Resumo:
Inference and optimisation of real-value edge variables in sparse graphs are studied using the tree based Bethe approximation optimisation algorithms. Equilibrium states of general energy functions involving a large set of real edge-variables that interact at the network nodes are obtained for networks in various cases. These include different cost functions, connectivity values, constraints on the edge bandwidth and the case of multiclass optimisation.
Resumo:
We consider data losses in a single node of a packet- switched Internet-like network. We employ two distinct models, one with discrete and the other with continuous one-dimensional random walks, representing the state of a queue in a router. Both models have a built-in critical behavior with a sharp transition from exponentially small to finite losses. It turns out that the finite capacity of a buffer and the packet-dropping procedure give rise to specific boundary conditions which lead to strong loss rate fluctuations at the critical point even in the absence of such fluctuations in the data arrival process.
Resumo:
Background: Parkinson’s disease (PD) is an incurable neurological disease with approximately 0.3% prevalence. The hallmark symptom is gradual movement deterioration. Current scientific consensus about disease progression holds that symptoms will worsen smoothly over time unless treated. Accurate information about symptom dynamics is of critical importance to patients, caregivers, and the scientific community for the design of new treatments, clinical decision making, and individual disease management. Long-term studies characterize the typical time course of the disease as an early linear progression gradually reaching a plateau in later stages. However, symptom dynamics over durations of days to weeks remains unquantified. Currently, there is a scarcity of objective clinical information about symptom dynamics at intervals shorter than 3 months stretching over several years, but Internet-based patient self-report platforms may change this. Objective: To assess the clinical value of online self-reported PD symptom data recorded by users of the health-focused Internet social research platform PatientsLikeMe (PLM), in which patients quantify their symptoms on a regular basis on a subset of the Unified Parkinson’s Disease Ratings Scale (UPDRS). By analyzing this data, we aim for a scientific window on the nature of symptom dynamics for assessment intervals shorter than 3 months over durations of several years. Methods: Online self-reported data was validated against the gold standard Parkinson’s Disease Data and Organizing Center (PD-DOC) database, containing clinical symptom data at intervals greater than 3 months. The data were compared visually using quantile-quantile plots, and numerically using the Kolmogorov-Smirnov test. By using a simple piecewise linear trend estimation algorithm, the PLM data was smoothed to separate random fluctuations from continuous symptom dynamics. Subtracting the trends from the original data revealed random fluctuations in symptom severity. The average magnitude of fluctuations versus time since diagnosis was modeled by using a gamma generalized linear model. Results: Distributions of ages at diagnosis and UPDRS in the PLM and PD-DOC databases were broadly consistent. The PLM patients were systematically younger than the PD-DOC patients and showed increased symptom severity in the PD off state. The average fluctuation in symptoms (UPDRS Parts I and II) was 2.6 points at the time of diagnosis, rising to 5.9 points 16 years after diagnosis. This fluctuation exceeds the estimated minimal and moderate clinically important differences, respectively. Not all patients conformed to the current clinical picture of gradual, smooth changes: many patients had regimes where symptom severity varied in an unpredictable manner, or underwent large rapid changes in an otherwise more stable progression. Conclusions: This information about short-term PD symptom dynamics contributes new scientific understanding about the disease progression, currently very costly to obtain without self-administered Internet-based reporting. This understanding should have implications for the optimization of clinical trials into new treatments and for the choice of treatment decision timescales.
Resumo:
Distributed network utility maximization (NUM) is receiving increasing interests for cross-layer optimization problems in multihop wireless networks. Traditional distributed NUM algorithms rely heavily on feedback information between different network elements, such as traffic sources and routers. Because of the distinct features of multihop wireless networks such as time-varying channels and dynamic network topology, the feedback information is usually inaccurate, which represents as a major obstacle for distributed NUM application to wireless networks. The questions to be answered include if distributed NUM algorithm can converge with inaccurate feedback and how to design effective distributed NUM algorithm for wireless networks. In this paper, we first use the infinitesimal perturbation analysis technique to provide an unbiased gradient estimation on the aggregate rate of traffic sources at the routers based on locally available information. On the basis of that, we propose a stochastic approximation algorithm to solve the distributed NUM problem with inaccurate feedback. We then prove that the proposed algorithm can converge to the optimum solution of distributed NUM with perfect feedback under certain conditions. The proposed algorithm is applied to the joint rate and media access control problem for wireless networks. Numerical results demonstrate the convergence of the proposed algorithm. © 2013 John Wiley & Sons, Ltd.
Resumo:
The yeast gene fab1 and its mammalian orthologue Pip5k3 encode the phosphatidylinositol 3-phosphate [PtdIns(3)P] 5-kinases Fab1p and PIKfyve, respectively, enzymes that generates phosphatidylinositol 3,5-bisphosphate [PtdIns(3,5)P(2)]. A shared feature of fab1Delta yeast cells and mammalian cells overexpressing a kinase-dead PIKfyve mutant is the formation of a swollen vacuolar phenotype: a phenotype that is suggestive of a conserved function for these enzymes and their product, PtdIns(3,5)P(2), in the regulation of endomembrane homeostasis. In the current study, fixed and live cell imaging has established that, when overexpressed at low levels in HeLa cells, PIKfyve is predominantly associated with dynamic tubular and vesicular elements of the early endosomal compartment. Moreover, through the use of small interfering RNA, it has been shown that suppression of PIKfyve induces the formation of swollen endosomal structures that maintain their early and late endosomal identity. Although internalisation, recycling and degradative sorting of receptors for epidermal growth factor and transferrin was unperturbed in PIKfyve suppressed cells, a clear defect in endosome to trans-Golgi-network (TGN) retrograde traffic was observed. These data argue that PIKfyve is predominantly associated with the early endosome, from where it regulates retrograde membrane trafficking to the TGN. It follows that the swollen endosomal phenotype observed in PIKfyve-suppressed cells results primarily from a reduction in retrograde membrane fission rather than a defect in multivesicular body biogenesis.
Resumo:
The world is connected by a core network of long-haul optical communication systems that link countries and continents, enabling long-distance phone calls, data-center communications, and the Internet. The demands on information rates have been constantly driven up by applications such as online gaming, high-definition video, and cloud computing. All over the world, end-user connection speeds are being increased by replacing conventional digital subscriber line (DSL) and asymmetric DSL (ADSL) with fiber to the home. Clearly, the capacity of the core network must also increase proportionally. © 1991-2012 IEEE.
An agent approach to improving radio frequency identification enabled Returnable Transport Equipment
Resumo:
Returnable transport equipment (RTE) such as pallets form an integral part of the supply chain and poor management leads to costly losses. Companies often address this matter by outsourcing the management of RTE to logistics service providers (LSPs). LSPs are faced with the task to provide logistical expertise to reduce RTE related waste, whilst differentiating their own services to remain competitive. In the current challenging economic climate, the role of the LSP to deliver innovative ways to achieve competitive advantage has never been so important. It is reported that radio frequency identification (RFID) application to RTE enables LSPs such as DHL to gain competitive advantage and offer clients improvements such as loss reduction, process efficiency improvement and effective security. However, the increased visibility and functionality of RFID enabled RTE requires further investigation in regards to decision‐making. The distributed nature of the RTE network favours a decentralised decision‐making format. Agents are an effective way to represent objects from the bottom‐up, capturing the behaviour and enabling localised decision‐making. Therefore, an agent based system is proposed to represent the RTE network and utilise the visibility and data gathered from RFID tags. Two types of agents are developed in order to represent the trucks and RTE, which have bespoke rules and algorithms in order to facilitate negotiations. The aim is to create schedules, which integrate RTE pick‐ups as the trucks go back to the depot. The findings assert that: - agent based modelling provides an autonomous tool, which is effective in modelling RFID enabled RTE in a decentralised utilising the real‐time data facility. ‐ the RFID enabled RTE model developed enables autonomous agent interaction, which leads to a feasible schedule integrating both forward and reverse flows for each RTE batch. ‐ the RTE agent scheduling algorithm developed promotes the utilisation of RTE by including an automatic return flow for each batch of RTE, whilst considering the fleet costs andutilisation rates. ‐ the research conducted contributes an agent based platform, which LSPs can use in order to assess the most appropriate strategies to implement for RTE network improvement for each of their clients.
Resumo:
Distributed network utility maximization (NUM) is receiving increasing interests for cross-layer optimization problems in multihop wireless networks. Traditional distributed NUM algorithms rely heavily on feedback information between different network elements, such as traffic sources and routers. Because of the distinct features of multihop wireless networks such as time-varying channels and dynamic network topology, the feedback information is usually inaccurate, which represents as a major obstacle for distributed NUM application to wireless networks. The questions to be answered include if distributed NUM algorithm can converge with inaccurate feedback and how to design effective distributed NUM algorithm for wireless networks. In this paper, we first use the infinitesimal perturbation analysis technique to provide an unbiased gradient estimation on the aggregate rate of traffic sources at the routers based on locally available information. On the basis of that, we propose a stochastic approximation algorithm to solve the distributed NUM problem with inaccurate feedback. We then prove that the proposed algorithm can converge to the optimum solution of distributed NUM with perfect feedback under certain conditions. The proposed algorithm is applied to the joint rate and media access control problem for wireless networks. Numerical results demonstrate the convergence of the proposed algorithm. © 2013 John Wiley & Sons, Ltd.
Resumo:
Despite the fact that Germany has a well expanded traffic infrastructure, it confronts a strong growth in freight volumes and it is very likely that in the forthcoming years will not be able to reasonably cope with the increasing demand. The aim of this paper is to explore the developments of the transport sector, railways in particular, in North Germany. More specific, the paper explores whether the railway network could contribute to improved traffic development in North Germany and also whether or not the existing logistics practices are effective enough to cope with the traffic problems in the region. The research based on the Delphi technique, collected, analysed and summarised the opinions of a group of experts in the aforementioned issues. Results indicate that railways could represent the solution to the forecasted growing freight volumes in the next years. In spite of continuous efforts undertaken by the politics and the economy, the existing logistics and freight traffic concepts are not sufficient, financing is too scarce, while emerging issues like sustainability, environment protection and working conditions are taken into little consideration. Copyright © 2014 Inderscience Enterprises Ltd.
Resumo:
Fierce competition within the third party logistics (3PL) market has developed as providers compete to win customers and enhance their competitive advantage through cost reduction plans and creating service differentiation. 3PL providers are expected to develop advanced technological and logistical service applications that can support cost reduction while increasing service innovation. To enhance competitiveness, this paper proposes the implementation of radio-frequency identification (RFID) enabled returnable transport equipment (RTE) in combination with the consolidation of network assets and cross-docking. RFID enabled RTE can significantly improve network visibility of all assets with continuous real-time data updates. A four-level cyclic model aiding 3PL providers to achieve competitive advantage has been developed. The focus is to reduce assets, increase asset utilisation, reduce RTE cycle time and introduce real-time data in the 3PL network. Furthermore, this paper highlights the need for further research from the 3PL perspective. Copyright © 2013 Inderscience Enterprises Ltd.
Resumo:
The problem of MPLS networks survivability analysis is considered in this paper. The survivability indexes are defined which take into account the specificity of MPLS networks and the algorithm of its estimation is elaborated. The problem of MPLS network structure optimization under the constraints on the survivability indexes is considered and the algorithm of its solution is suggested. The experimental investigations were carried out and their results are presented.
Resumo:
The traffic carried by core optical networks grows at a steady but remarkable pace of 30-40% year-over-year. Optical transmissions and networking advancements continue to satisfy the traffic requirements by delivering the content over the network infrastructure in a cost and energy efficient manner. Such core optical networks serve the information traffic demands in a dynamic way, in response to requirements for shifting of traffics demands, both temporally (day/night) and spatially (business district/residential). However as we are approaching fundamental spectral efficiency limits of singlemode fibers, the scientific community is pursuing recently the development of an innovative, all-optical network architecture introducing the spatial degree of freedom when designing/operating future transport networks. Spacedivision- multiplexing through the use of bundled single mode fibers, and/or multi-core fibers and/or few-mode fibers can offer up to 100-fold capacity increase in future optical networks. The EU INSPACE project is working on the development of a complete spatial-spectral flexible optical networking solution, offering the network ultra-high capacity, flexibility and energy efficiency required to meet the challenges of delivering exponentially growing traffic demands in the internet over the next twenty years. In this paper we will present the motivation and main research activities of the INSPACE consortium towards the realization of the overall project solution. © 2014 Copyright SPIE.