Relevant bibliographies by topics / Spare Capacity Allocation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Spare Capacity Allocation'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Spare Capacity Allocation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Spare Capacity Allocation"

1

Liu, Yu, David Tipper, and Korn Vajanapoom. "Spare Capacity Allocation in Two-Layer Networks." IEEE Journal on Selected Areas in Communications 25, no. 5 (June 2007): 974–86. http://dx.doi.org/10.1109/jsac.2007.070610.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yu Liu, D. Tipper, and P. Siripongwutikorn. "Approximating optimal spare capacity allocation by successive survivable routing." IEEE/ACM Transactions on Networking 13, no. 1 (February 2005): 198–211. http://dx.doi.org/10.1109/tnet.2004.842220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shahriar, Nashid, Shihabur Rahman Chowdhury, Reaz Ahmed, Aimal Khan, Siavash Fathi, Raouf Boutaba, Jeebak Mitra, and Liu Liu. "Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding." IEEE Journal on Selected Areas in Communications 36, no. 3 (March 2018): 502–18. http://dx.doi.org/10.1109/jsac.2018.2815430.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, William, Krzysztof Pawlikowski, and Harsha Sirisena. "Algebraic connectivity metric for spare capacity allocation problem in survivable networks." Computer Communications 34, no. 12 (August 2011): 1425–35. http://dx.doi.org/10.1016/j.comcom.2010.12.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Victor Yu, and David Tipper. "Spare capacity allocation using shared backup path protection for dual link failures." Computer Communications 36, no. 6 (March 2013): 666–77. http://dx.doi.org/10.1016/j.comcom.2012.09.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jordán, Tibor, and Ildikó Schlotter. "Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem." Journal of Discrete Algorithms 30 (January 2015): 29–44. http://dx.doi.org/10.1016/j.jda.2014.11.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ho, Pin-Han, and H. T. Mouftah. "Framework of spare capacity re-allocation with S-SLSP for mesh WDM networks." Computer Networks 40, no. 1 (September 2002): 167–79. http://dx.doi.org/10.1016/s1389-1286(02)00272-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tridandapani, S., A. K. Somani, and U. R. Sandadi. "Low overhead multiprocessor allocation strategies exploiting system spare capacity for fault detection and location." IEEE Transactions on Computers 44, no. 7 (July 1995): 865–77. http://dx.doi.org/10.1109/12.392845.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Harle, D., and S. Albarrak. "Spare capacity allocation and optimisation in a distributed GMPLS-based IP/WDM mesh network." Computer Communications 30, no. 16 (November 2007): 3085–95. http://dx.doi.org/10.1016/j.comcom.2007.05.057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ahmad, Md Tanweer, and Sandeep Mondal. "Dynamic supplier selection approach for mining equipment company." Journal of Modelling in Management 14, no. 1 (February 11, 2019): 77–105. http://dx.doi.org/10.1108/jm2-04-2018-0046.

Full text
Abstract:
PurposeThis paper aims to address the supplier selection (SS) problem under dynamic business environments to optimize the procurement cost of spare-parts in the context of a mining equipment company (MEC). Practically, involved parameters’ value does not remain constant as planning periods due to fluctuation in the demand and their market dynamics. Therefore, dynamicity in the parameter is considered as an important factor when a company forms a responsive chain through most eligible suppliers with respect to planning periods. This area of study may be considered for their complexities to the approaches toward order-allocations with bi-products of unused and repair spare-parts.Design/methodology/approachAn integrated methodology of analytic hierarchy process (AHP) and mixed-integer non-linear programming (MILP) is implemented in the two stages during each planning periods. In the first stage, AHP is used to obtain the relative weights with respect to each spare-parts of each criterion and based on that, the ranking is evaluated in accordance with case considered. And in the second stage, MILP is formulated to find the allocations of each spare-part with two distinct approaches through Model-1 and Model-2 separately. Moreover, Model-1 and Model-2 are outlined based on the ranking and efficient parameters-value under cost, limited capacities, quality level and delay lead time respectively.FindingsThe ranking and their optimal order-allocation of potential suppliers are obtained during consecutive planning periods for both unused and repair spare-parts. Subsequently, sensitivity analysis is conducted to deduce the key nuggets with the comparison of Model-1 and Model-2 in the changing of capacity, demand and cost per spare-parts. From this analysis, it is found that suppliers who have optimal parameter settings would be better for order-allocations than ranking during the changing planning period.Practical implicationsThis paper points out the situation-specific approach for SS problem for a mining industry which often faces disruptive supplying environments. The managerial implication between ranking and parameters are highlighted through Model-1 and Model-2 by sensitivity analysis.Originality/valueIt provides useful directions for managers who are involved in the procurement of spare-parts in the mining environment. For this, suppliers are selected for order-allocation by using Model-1 and Model-2 in the dynamic business environment. The solvability of the model is presented using LINGO 17. Furthermore, the case company selected in this study can be extended to other sectors.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Spare Capacity Allocation"

1

Liu, Zhiyong. "Ant Based Algorithm and Robustness Metric in Spare Capacity Allocation for Survivable Routing." Thesis, University of Canterbury. Electrical and Computer Engineering, 2010. http://hdl.handle.net/10092/4099.

Full text
Abstract:
Network resiliency pertains to the vulnerability of telecommunication networks in the case of failures and malicious attacks. With the increasing capacity catering of network for the booming multi-services in Next Generation Networks (NGNs), reducing recovery time and improving capacity efficiency while providing high quality and resiliency of services has become increasingly important for the future network development. Providing network resiliency means to rapidly and accurately reroute the traffic via diversely routed spare capacity in the network when a failure takes down links or nodes in the working path. Planning and optimization for NGNs require an efficient algorithm for spare capacity allocation (SCA) that assures restorability with a minimum of total capacity. This dissertation aims to understand and advance the state of knowledge on spare capacity allocation in network resiliency for telecommunication core networks. Optimal network resiliency design for restorability requires considering: network topology, working and protection paths routing and spare capacity allocation. Restorable networks should be highly efficient in terms of total capacity required for restorability and be able to support any target level of restorability. The SCA strategy is to decide how much spare capacity should be reserved on links and to pre-plan protection paths to protect traffic from a set of failures. This optimal capacity allocation problem for survivable routing is known as NP-complete. To expose the problem structure, we propose a model of the SCA problem using a matrix-based framework, named Distributed Resilience Matrix (DRM) to identify the dependencies between the working and protection capacities associated with each pair of links and also to capture the local capacity usage information in a distributed control environment. In addition, we introduce a novel ant-based heuristic algorithm, called Friend-or-Foe Resilient (FoF-R) ant-based routing algorithm to find the optimal protection cycle (i.e., two node-disjoint paths between a source-destination node pair) and explore the sharing ability among protection paths using a capacity headroom-dependent attraction and repulsion function. Simulation results based on the OMNeT++ and AMPL/CPLEX tools show that the FoF-R scheme with the DRM structure is a promising approach to solving the SCA problem for survivable routing and it gives a good trade off between solution optimality and computation speed. Furthermore, for the SCA studies of survivable networks, it is also important to be able to differentiate between network topologies by means of a robust numerical measure that indicates the level of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links, which are more important than others, for example, if their failure causes the network’s disintegration. Another contribution in this dissertation is to introduce an algebraic connectivity metric, adopted from the spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of the network topology, instead of the average nodal degree, to characterize network robustness in studies of the SCA problem. Extensive simulation studies confirm that this metric is a more informative parameter than the average nodal degree for characterizing network topologies in network resiliency studies.
APA, Harvard, Vancouver, ISO, and other styles
2

Atak, Erman. "Incentive, Subsidy, Penalty Mechanisms And Pooled, Unpooled Allocation Of Production Capacity In Service Parts Management Systems." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613408/index.pdf.

Full text
Abstract:
In this thesis, two systems are analyzed in order to gain insight to the following issues: (i) Effect of incentive, subsidy and penalty designs on decentralized system, (ii) effect of using production facility as pooled capacity (pooled system) and dedicated capacity (unpooled system) on capacity utilization and system profit. Regarding the first issue, three models are defined
decentralized model, centralized model and decentralized model with incentive, subsidy, penalty designs. In all models, there are two dealers and one item is under consideration and lateral transshipments are allowed. Dealers operate with four inventory level decision (strategies) that consists of base stock level, rationing level, transshipment request level and customer rejection level. Under the decentralized system, a dealer sets its operating strategy according to the strategy of the other dealer and maximizes its own infinite horizon discounted expected profit. In the centralized system, a central authority (say manufacturer) exists, which considers the system-wide infinite horizon discounted expected profit, and makes all decisions. Under decentralized system with incentive, subsidy, penalty designs, manufacturer tries different designs on decentralized system namely revenue sharing, holding cost subsidy, request rejection penalty, transportation cost subsidy and commission subsidy in order to v align decentralized system with centralized system. According to the results obtained, this alignment works best with nearly 40% revenue sharing percentage, low rejection penalty, high transportation cost subsidy under low transportation cost and commission subsidy under very low or very high commissions. Holding cost subsidy, on the other hand, is not a good strategy since it declines decentralized system profit. Considering the second issue, two systems are examined
pooled system and unpooled system. Both systems are centrally managed. In the pooled system, all capacity is dynamically allocated to either dealer considering maximization of system profit. In the unpooled system, capacity is shared among dealers and dealers are always allocated same percentage of the capacity. Infinite horizon average expected profit is maximized in both systems. The dealer having lower holding cost is allocated higher capacity in both pooled and unpooled system
however, exceptions exist in the unpooled system under low arrival rate. Highrevenue dealer is always allocated higher capacity in both pooled and unpooled system. Arrival rate affects both systems such that total capacity utilization increases with increasing arrival rate. From the profit point of view, pooled system has great advantage under low demand rate in general.
APA, Harvard, Vancouver, ISO, and other styles
3

Nascimento, Matheus Freire e. Silva do. "TV white space for digital inclusion in Brazil." reponame:Repositório Institucional da UFC, 2017. http://www.repositorio.ufc.br/handle/riufc/26430.

Full text
Abstract:
NASCIMENTO, M. F. S. TV white space for digital inclusion in Brazil. 2017. 72 f. Dissertação (Mestrado em Engenharia de Teleinformática)–Centro de Tecnologia, Universidade Federal do Ceará, Fortaleza, 2017.
Submitted by Renato Vasconcelos (ppgeti@ufc.br) on 2017-09-08T18:02:47Z No. of bitstreams: 1 2017_dis_mfnascimento.pdf: 5688076 bytes, checksum: 1cc24af829d0f32975a0885021225eb2 (MD5)
Rejected by Marlene Sousa (mmarlene@ufc.br), reason: Prezado Matheus: Existe uma orientação para que normalizemos as dissertações e teses da UFC, em suas paginas pré-textuais e lista de referencias, pelas regras da ABNT. Por esse motivo, sugerimos consultar o modelo de template, para ajudá-lo nesta tarefa, disponível em: http://www.biblioteca.ufc.br/educacao-de-usuarios/templates/ Vamos agora as correções sempre de acordo com o template: 1. Na capa as informações relativas a hierarquia institucional deve ser em língua portuguesa, Nome da INSTITUIÇÃO; do CENTRO; do DEPARTAMENTO e do PROGRAMA DE PÓS-GRADUAÇÃO. Nesta ordem. 2. Na folha de rosto (que segue a capa) Apenas o titulo deve ficar em inglês as demais informações são em português. A partir da folha de rosto, todas as outras devem ficar em inglês. 3. A dedicatória está fora da distancia necessária até o final da folha. 4. A palavra Acknowledgments é em caixa alta, negrito e centralizada na folha. 5. A epígrafe está fora da distancia necessária até o final da folha. 6. O resumo deve vir antes do Abstract, mesmo quando o trabalho for em língua inglesa. A palavra resumo é em caixa alta, negrito e centralizada na folha. E a expressão Palavras-chave deve ser em negrito. 7. O sumário deve ser todo em negrito e nas seções com 3 dígitos (2.2.1) além de negrito deve ser em itálico. 8. Na lista de referências, veja o espaço entre as linhas que a ABNT determina. Coloque os nomes dos autores entrando pelo sobrenome, seguido do pré nome. Ex. Coelho Junior, Hélio. Se vc optar por abreviar os nomes em toda a lista eles devem ser abreviados. Se vc optar em colocar por extenso em toda e lista deve ficar por extenso para haver uma padronização. Os títulos das publicações devem ser destacadas com o uso do negrito (não use aspas). Com exceção dos artigos de periódicos que devem ser destacados o nome das revistas e não o titulo do artigo. Ao citar os artigos coloque as abreviações v. n. p. e não vol. no e pp. Após essas correções, enviaremos o nada consta por e-mail. Att. Marlene Rocha mmarlene@ufc.br on 2017-09-11T11:58:36Z (GMT)
Submitted by Renato Vasconcelos (ppgeti@ufc.br) on 2017-10-03T13:58:21Z No. of bitstreams: 1 2017_dis_mfnascimento.pdf: 5700235 bytes, checksum: b2c4f7caca78f61b98f57321ad854e92 (MD5)
Rejected by Marlene Sousa (mmarlene@ufc.br), reason: Prezado Renato: CORRIGIR O NOME DO ARQUIVO PARA: 2017_dis_mfsnascimento Prezado Matheus: Falta ainda vc corrigir de acordo com template 1. No sumário quando colocar em itálico as seções terciárias ( 3 dígitos) os algarismos também ficam em itálico. Vc só colocou em itálico o título da seção. 2. Na lista de referencias, Vc colocou os sobrenomes na ordem correta como falei, mas esqueceu que são TODOS em caixa alta. Corrigir em toda a lista. Ex. MUECK, M. Att. Marlene on 2017-10-03T18:55:29Z (GMT)
Submitted by Renato Vasconcelos (ppgeti@ufc.br) on 2017-10-06T12:47:58Z No. of bitstreams: 1 2017_dis_mfsnascimento.pdf: 5699792 bytes, checksum: fe9750751514aac9e39d3926f7adb7ed (MD5)
Approved for entry into archive by Marlene Sousa (mmarlene@ufc.br) on 2017-10-06T17:35:53Z (GMT) No. of bitstreams: 1 2017_dis_mfsnascimento.pdf: 5699792 bytes, checksum: fe9750751514aac9e39d3926f7adb7ed (MD5)
Made available in DSpace on 2017-10-06T17:35:53Z (GMT). No. of bitstreams: 1 2017_dis_mfsnascimento.pdf: 5699792 bytes, checksum: fe9750751514aac9e39d3926f7adb7ed (MD5) Previous issue date: 2017-07-21
This work presents a technological opportunity to make efficient use of the spectrum and at the same time shows its importance to provide digital inclusion in Brazil. The method- ology is applied in a case study investigating the area of Cear ́a, a Brazilian state, where a significant amount of spectrum that can be unleashed via TV White Space exploitation is relevant to be considered, due to its geographic and economical conditions. These white spaces can fill up some holes in the state that do not present any mobile coverage and improve the telecommunication services in other areas. The technology concept, world regulation situation and possible applications using the resource are described throughout this work. The main purpose is to use TV White Spaces together with the LTE band, as a way to soften part of the poor coverage services of 3G, 4G.
Este trabalho apresenta uma oportunidade tecnológica para fazer o uso eficiente do espectro e, ao mesmo tempo, mostra sua importância para a inclusão digital no Brasil. A metodologia é aplicada em um estudo de caso que investiga a área do Ceará, estado brasileiro, onde uma quantidade significativa de espectro que pode ser desencadeada através da exploração dos Espaços em Brancos de TV é relevante a ser considerada, devido as suas condições geográficas e econômicas. Estes espaços em branco podem preencher alguns buracos no estado que não apresentam qualquer cobertura móvel e melhorar os serviços de telecomunicações em outras áreas. O conceito de tecnologia, situação de regulação mundial e possíveis aplicações usando o recurso são descritos ao longo deste trabalho. A principal finalidade é usar os Espaços em Brancos de TV juntamente com a banda do LTE, para tentar suavizar parte do péssimo serviço de cobertura das redes 3G e 4G.
APA, Harvard, Vancouver, ISO, and other styles
4

Zulhasnine, Mohammad. "Availability-Aware Spare Capacity Allocation with Partially Protected Rings." Thesis, 2008. http://hdl.handle.net/10012/3584.

Full text
Abstract:
This thesis work focuses on designing a survivable IP-core network with the minimal investment of spare capacity. A span-oriented spare capacity allocation (SCA) scheme is proposed to satisfy customers' availability requirements in the end-to-end (E2E) sense. The novelty of the proposed SCA scheme is that it meets the E2E availability requirements despite the lack of knowledge of E2E bandwidth by employing protection rings covering all links in the network. Different ring selection methods are presented and also compared from the aspect of network redundancy and LP feasibility which provide more flexibility to the design. The proposed SCA algorithm further minimizes total cost of spare capacity by incorporating partial protection within the proposed architecture. The simulation results show that it can significantly reduce the spare capacity consumption depending on the availability. The proposed SCA scheme also performs better in terms of redundancy than that of two other dominant methods available these days.
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Chen-Hsin, and 林政勳. "Spare Capacity Allocation in Self-Healing Communication Networks : Using Clustering Algorithm." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/15910265952061569279.

Full text
Abstract:
碩士
國立交通大學
資訊管理所
88
This study employs clustering algorithm to reduce the complexity of self-healing communication network spare capacity allocation problem. The self-healing communication network spare capacity allocation problem is NP-hard, implying exponential growth in execution time with network size increases. By using some attributes of node and link, some nodes of the network can form several “virtual nodes” and the original network can be transferred to a simple one, called “virtual network”. Comparing to the spare capacity allocation problem of original network, the new one of the “virtual network” is easier to solve. If the number of the links which covered by virtual nodes is higher, using clustering algorithm to solving spare capacity allocation problem is more efficiency.
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Jung-Kai, and 黃中鍇. "An Evaluative Genetic Algorithm for Spare Capacity Allocation in Survivable Provisioning Networks." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/31335378569836124872.

Full text
Abstract:
碩士
中原大學
資訊管理研究所
96
This thesis uses one backup path to protect each primary path to against single link failure in communication networks. This study proposes an MEGA to cooperate with SSR algorithm to improve the stability and effectiveness of solve the SCA (Spare Capacity Allocation) problems for SRLG (Shared Risk Link Groups) especially for randomized traffic requirements. The objective of SCA problem is to minimize the total spare capacity when all traffic demands require a 100% survivability or restoration level on different network topologies. Two kinds of experiments are performed in this thesis, the experiment I focus on a non-constrained situation and concentrates on finding the optimal solution. Furthermore, several experimental analyses of operational parameters are executed in this first experiment. The second experiment focus on: (1) nonuniform demands of origin-destination pairs are allowed; (2) “Spilt Flow” scheme is adopted to set up multiple backup paths for protecting one working path; (3) Given network topology and each link cost, the value of redundancy value is significantly influenced by different flow pattern. The experimental results of the first experiment show that MEGA can efficiently approach the best solution. The results of the non-constrained SCA problems also compares with several existing SCA algorithms and reveals that MEGA can enhance the performance of SSR algorithm to prevent the randomized defect of initial route ordering from influencing the result of SCA problem.. The results of the experiment II show that backup path with “Spilt Flow” scheme can effectively reduce total spare capacity required.
APA, Harvard, Vancouver, ISO, and other styles
7

Nikjah, Reza. "Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks." Phd thesis, 2010. http://hdl.handle.net/10048/1674.

Full text
Abstract:
The importance of cooperative relaying communication in substituting for, or complementing, multiantenna systems is described, and a brief literature review is presented. Amplify-and-forward (AF) and decode-and-forward (DF) relaying are investigated and compared for a dual-hop relay channel. The optimal strategy, source and relay optimal power allocation, and maximum cooperative gain are determined for the relay channel. It is shown that while DF relaying is preferable to AF relaying for strong source-relay links, AF relaying leads to more gain for strong source-destination or relay-destination links. Superimposed and selection AF relaying are investigated for multirelay, dual-hop relaying. Selection AF relaying is shown to be globally strictly outage suboptimal. A necessary condition for the selection AF outage optimality, and an upper bound on the probability of this optimality are obtained. A near-optimal power allocation scheme is derived for superimposed AF relaying. The maximum instantaneous rates, outage probabilities, and average capacities of multirelay, dual-hop relaying schemes are obtained for superimposed, selection, and orthogonal DF relaying, each with parallel channel cooperation (PCC) or repetition-based cooperation (RC). It is observed that the PCC over RC gain can be as much as 4 dB for the outage probabilities and 8.5 dB for the average capacities. Increasing the number of relays deteriorates the capacity performance of orthogonal relaying, but improves the performances of the other schemes. The application of rateless codes to DF relaying networks is studied by investigating three single-relay protocols, one of which is new, and three novel, low complexity multirelay protocols for dual-hop networks. The maximum rate and minimum energy per bit and per symbol are derived for the single-relay protocols under a peak power and an average power constraint. The long-term average rate and energy per bit, and relay-to-source usage ratio (RSUR), a new performance measure, are evaluated for the single-relay and multirelay protocols. The new single-relay protocol is the most energy efficient single-relay scheme in most cases. All the multirelay protocols exhibit near-optimal rate performances, but are vastly different in the RSUR. Several future research directions for fixed-rate and rateless coded cooperative systems, and frameworks for comparing these systems, are suggested.
Communications
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Spare Capacity Allocation"

1

Mouftah, Hussein T., and Pin-Han Ho. "Spare Capacity Allocation." In Optical Networks, 149–210. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-1169-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Zuxi, Li Li, Gang Sun, and Hanping Hu. "An Optimization Algorithm of Spare Capacity Allocation by Dynamic Survivable Routing." In Lecture Notes in Computer Science, 439–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13498-2_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ma, Tao, Nairong Tan, Xiaolei Wang, Fanfan Zhang, and Hui Fang. "Spatial Carrying Capacity and Sustainability: Cities, Basins, Regional Transformation." In Environmental Change and Sustainability [Working Title]. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.94130.

Full text
Abstract:
This chapter focuses on the spatial carrying capacity of different types of space units. Based on the characteristics of different units, it discusses how resource carrying capacity, environmental carrying capacity, ecological carrying capacity, and infrastructure carrying capacity together affect the spatial carrying capacity and allocation efficiency of space units. Cities need agglomeration of economic and demographic elements to expand the scale of spatial carrying capacity. Basins need to allocate water resources rationally under the condition of limited water resources for the sustainable development of river basin ecosystem. Regions need to explore regional comparative advantages and transformation paths from regional industries. The case studies discuss how the spatial carrying capacity of cities, river basins, and regional transformation adapt to environmental changes and the direction of carrying capacity improvement.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Spare Capacity Allocation"

1

He, Jianwu, Wenyan Jin, Mianfeng Lin, Wanyi Gu, and Jie Zhang. "Spare capacity allocation in optical networks." In Asia-Pacific Optical and Wireless Communications 2002, edited by Qian Mao, Shoa-Kai Liu, and Kwok-wai Cheung. SPIE, 2002. http://dx.doi.org/10.1117/12.481085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gonzalez-Montoro, Nehuen, and Jorge M. Finochietto. "Incremental spare capacity allocation for optical networks restoration." In 2015 XVI Workshop on Information Processing and Control (RPIC). IEEE, 2015. http://dx.doi.org/10.1109/rpic.2015.7497142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, William, Harsha Sirisena, and Krzysztof Pawlikowski. "Efficacy of Fiedler value versus nodal degree in spare capacity allocation." In 2009 15th Asia-Pacific Conference on Communications (APCC). IEEE, 2009. http://dx.doi.org/10.1109/apcc.2009.5375511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Victor Yu, and David Tipper. "Spare capacity allocation using shared backup path protection for dual link failures." In 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN). IEEE, 2011. http://dx.doi.org/10.1109/drcn.2011.6076893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bril, Reinder J., and Erik J. Luit. "Experience Report: Combining Mixed-Criticality Support with Resource Reservation and Spare Capacity Allocation." In 2019 IEEE International Conference on Software Architecture Companion (ICSA-C). IEEE, 2019. http://dx.doi.org/10.1109/icsa-c.2019.00019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, William, Harsha Sirisena, and Krzysztof Pawlikowski. "A novel distributed resilience matrix for arbitrary failures in spare capacity allocation problem." In Signal Processing (ICICS). IEEE, 2009. http://dx.doi.org/10.1109/icics.2009.5397721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, X., and Q. Li. "Utilization of the spare capacity of exclusive bus lanes based on a dynamic allocation strategy." In URBAN TRANSPORT 2014. Southampton, UK: WIT Press, 2014. http://dx.doi.org/10.2495/ut140151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zizhou, Wang, Zhu Guiwei, Wang Yafeng, and Dacheng Yang. "Adaptive Power Allocation for Regenerative Multi-Relay System Based on Capacity-Approaching Distributed Space-Time Codes." In 2007 IEEE 65th Vehicular Technology Conference. IEEE, 2007. http://dx.doi.org/10.1109/vetecs.2007.443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Djurdjanovic, Dragan, and Jie Zhu. "Stream of Variation Based Error Compensation Strategy in Multi-Stage Manufacturing Processes." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81550.

Full text
Abstract:
Linear state space Stream of Variation (SoV) models of error flow in multistation assembly and machining systems have been well studied in the past decade. SoV models were utilized for identification of process-level root causes of manufacturing errors, quantitative characterization of measurements in multistation manufacturing systems, systematic selection of measurement points and features, as well as tolerance allocation and process design. Nevertheless, natural connection of the linear state space form of SoV models with traditional control theory has not been utilized to automatically compensate observed manufacturing errors and thus close the quality control loop. Recent advances in measurement technology and flexible fixtures make such operations possible and in this paper, we propose a method for strategic elimination of root causes of quality problems based on the SoV models of the flow of manufacturing errors. Furthermore, the concept of compensability that quantitatively depicts the capacity of error compensation in a specific system is proposed. Based on this concept analogous to the controllability in the traditional control theory, compensable and non-compensable subspaces of dimensional errors are identified and quantitatively described. Theoretical results have been demonstrated using the SoV model of a real industrial process used for machining of automotive cylinder heads.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Spare Capacity Allocation' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography