Relevant bibliographies by topics / Bottleneck Paths

Contents

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

Academic literature on the topic 'Bottleneck Paths'

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 'Bottleneck Paths.'

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 "Bottleneck Paths"

1

Bose, Prosenjit, Anil Maheshwari, Giri Narasimhan, Michiel Smid, and Norbert Zeh. "Approximating geometric bottleneck shortest paths." Computational Geometry 29, no. 3 (November 2004): 233–49. http://dx.doi.org/10.1016/j.comgeo.2004.04.003.

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

Kim, Geon-Hwan, Yeong-Jun Song, Imtiaz Mahmud, and You-Ze Cho. "Adaptive Decrease Window for BALIA (ADW-BALIA): Congestion Control Algorithm for Throughput Improvement in Nonshared Bottlenecks." Electronics 10, no. 3 (January 26, 2021): 294. http://dx.doi.org/10.3390/electronics10030294.

Full text
Abstract:
The main design goals of the multipath transmission control protocol (MPTCP) are to improve the throughput and share a common bottleneck link fairly with a single-path transmission control protocol (TCP). The existing MPTCP congestion control algorithms achieve the goal of fairness with single-path TCP flows in a shared bottleneck, but they cannot maximize the throughput in nonshared bottlenecks, where multiple subflows traverse different bottleneck links. This is because the MPTCP is designed not to exceed the throughput of a single-path TCP competing in the bottleneck. Therefore, we believe that MPTCP congestion control should have different congestion window control mechanisms, depending on the bottleneck type. In this paper, we propose an adaptive decrease window (ADW) balanced linked adaptation (BALIA) congestion control algorithm that adaptively adjusts the congestion window decrease in order to achieve better throughput in nonshared bottlenecks while maintaining fairness with the single-path TCP flows in shared bottlenecks. The ADW-BALIA algorithm detects shared and nonshared bottlenecks based on delay fluctuations and it uses different congestion window decrease methods for the two types of bottleneck. When the delay fluctuations of the MPTCP subflows are similar, the ADW-BALIA algorithm behaves the same as the existing BALIA congestion control algorithm. If the delay fluctuations are dissimilar, then the ADW-BALIA algorithm adaptively modulates the congestion window reduction. We implement the ADW-BALIA algorithm in the Linux kernel and perform an emulation experiment that is based on various topologies. ADW-BALIA improves the aggregate MPTCP throughput by 20% in the nonshared bottleneck scenario, while maintaining fairness with the single-path TCP in the shared bottleneck scenario. Even in a triple bottleneck topology, where both types of bottlenecks exist together, the throughput increases significantly. We confirmed that the ADW-BALIA algorithm works stably for different delay paths, in competition with CUBIC flows, and with lossy links.
APA, Harvard, Vancouver, ISO, and other styles
3

Shinn, Tong-Wook, and Tadao Takaoka. "Variations on the bottleneck paths problem." Theoretical Computer Science 575 (April 2015): 10–16. http://dx.doi.org/10.1016/j.tcs.2014.10.049.

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

Yousaf, Muhammad Murtaza, and Michael Welzl. "On the Accurate Identification of Network Paths Having a Common Bottleneck." Scientific World Journal 2013 (2013): 1–15. http://dx.doi.org/10.1155/2013/890578.

Full text
Abstract:
We present a new mechanism for detecting shared bottlenecks between end-to-end paths in a network. Our mechanism, which only needs one-way delays from endpoints as an input, is based on the well-known linear algebraic approach: singular value decomposition (SVD). Clusters of flows which share a bottleneck are extracted from SVD results by applying an outlier detection method. Simulations with varying topologies and different network conditions show the high accuracy of our technique.
APA, Harvard, Vancouver, ISO, and other styles
5

Shapira, Asaf, Raphael Yuster, and Uri Zwick. "All-Pairs Bottleneck Paths in Vertex Weighted Graphs." Algorithmica 59, no. 4 (June 3, 2009): 621–33. http://dx.doi.org/10.1007/s00453-009-9328-x.

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

Manea, Mihai. "Bottleneck links, essential intermediaries, and competing paths of diffusion in networks." Theoretical Economics 16, no. 3 (2021): 1017–53. http://dx.doi.org/10.3982/te4385.

Full text
Abstract:
We investigate how information goods are priced and diffused over links in a network. A new equivalence relation between nodes captures the effects of network architecture and locations of sellers on the division of profits, and characterizes the topology of competing (and potentially overlapping) diffusion paths. Sellers indirectly appropriate profits over intermediation chains from buyers in their equivalence classes. Links within the same class constitute bottlenecks for information diffusion and confer monopoly power. Links that bridge distinct classes are redundant for diffusion and generate competition among sellers. In dense networks, competition limits the scope of indirect appropriability and intellectual property rights foster innovation.
APA, Harvard, Vancouver, ISO, and other styles
7

Thomas, Sanu, and Thomaskutty Mathew. "Congestion bottleneck avoid routing in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (December 1, 2019): 4804. http://dx.doi.org/10.11591/ijece.v9i6.pp4804-4814.

Full text
Abstract:
A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles.
APA, Harvard, Vancouver, ISO, and other styles
8

Fernandez, Elena, Robert Garfinkel, and Roman Arbiol. "Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths." Operations Research 46, no. 3 (June 1998): 293–304. http://dx.doi.org/10.1287/opre.46.3.293.

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

Xu, Yan Ying, Wan Wan Duan, and Lu Chao Li. "Safety Evacuation at Metro Transit Station in Shenyang under Fire." Advanced Materials Research 864-867 (December 2013): 849–52. http://dx.doi.org/10.4028/www.scientific.net/amr.864-867.849.

Full text
Abstract:
It's necessary to pay much attention to the public safety issues of subway because of the rapid development of urban subway. Safety evacuation under different fire scenarios were simulated by using SIMULEX 2.0 at Metro transit station (Youth Street station) in Shenyang combined the actual structural characteristic. The results show that the evacuation capacity of Metro Line 1 is smaller than Metro Line 2; the staircase to the station hall of Metro Line 1 would be the bottleneck of the entire evacuation process; different paths have a great influence on the evacuation time; the staircase width from the platform to the station hall is the bottleneck in the evacuation procedure.
APA, Harvard, Vancouver, ISO, and other styles
10

Wan, Qun. "COMPARISON OF FOWLP VS QFN PACKAGE FROM THERMAL ASPECT." Additional Conferences (Device Packaging, HiTEC, HiTEN, and CICMT) 2015, DPC (January 1, 2015): 000248–71. http://dx.doi.org/10.4071/2015dpc-ta23.

Full text
Abstract:
The QFN package dominates IC industry with a small number of IOs due to its simplicity, maturity and low cost in mass production. However, as the industry progresses toward portability and smaller size, thinner and more compact packages such as Fan Out Wafer Level Package (FOWLP) is a better option/solution than QFN package. Due to its flip chip configuration, imbedded redistribution (RDL) interconnection and elimination of die attach layer, the FOWLP package has potential to surpass QFN package in thermal performance. This paper utilized a typical 3-stage RF power amplifier die as a thermal test vehicle, packaged with FOWLP and QFN, built FEA (Finite Element Analysis) thermal models and analyzed the thermal performance by thermal resistance breakdown and thermal bottleneck identification. Comparison of FOWLP and QFN shows that the heat paths and bottlenecks within each package are quite different. In QFN package, bottleneck lies in the die attach layer while in FOWLP package, it lies in the backend layers on the die and the RDL vias. FOWLP package may also require better thermal vias performance in PCB due to smaller footprint of LGA/Solder. Large horizontal heat spreading in a poorly design PCB may offset the thermal advantages in FOWLP package. The simulation results of both packages have good correlation with Infrared (IR) measurement of corresponding thermal test vehicles.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bottleneck Paths"

1

Shinn, Tong-Wook. "Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication." Thesis, University of Canterbury. Computer Science and Software Engineering, 2014. http://hdl.handle.net/10092/9740.

Full text
Abstract:
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication. For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied in exactly 1.5n ‒ 1 communication steps. This halves the number of communication steps required by the well known Cannon’s algorithm that runs on the same sized mesh array. We provide two contributions for the SP problem. Firstly, we enhance the breakthrough algorithm by Alon, Galil and Margalit (AGM), which was the first algorithm to achieve a deeply sub-cubic time bound for solving the All Pairs Shortest Paths (APSP) problem on dense directed graphs. Our enhancement allows the algorithm by AGM to remain sub-cubic for larger upper bounds on integer edge costs. Secondly, we show that for graphs with n vertices, the APSP problem can be solved in exactly 3n ‒ 2 communication steps on an n-by-n 2D square mesh array. This improves on the previous result of 3.5n communication steps achieved by Takaoka and Umehara. For the BP problem, we show that we can compute the bottleneck of the entire graph without solving the All Pairs Bottleneck Paths (APBP) problem, resulting in a much more efficient time bound. Finally we define an algebraic structure called the distance/flow semi-ring to formally introduce the SP-AF problem, and we provide many algorithms for solving the Single Source SP-AF (SSSP-AF) problem and the All Pairs SP-AF (APSP-AF) problem. For the APSP-AF problem, algebraic algorithms are given that utilise faster matrix multiplication over a ring.
APA, Harvard, Vancouver, ISO, and other styles
2

YEH, JUNG-JUNG, and 葉蓉蓉. "The execution network of policies to solve bottleneck path problems in Hsinchu City." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/00943849507541778707.

Full text
Abstract:
碩士
中華大學
行政管理學系(所)
98
Abstract Taking into account urban planning and the need for construction, along with its aims to provide Hsinchu citizens with better living quality and to ensure the safety of their lives and properties, Hsinchu City Government steadily opens up and widens bottleneck paths that are less than 8 meters in width. Since Mr. Zheng-Ze, Lin acceded to the Mayor of Hsinchu City in 2001 up to 2009, 119 projects have been finished and more than 1,000 households have been resettled through peaceful processes. Hsinchu City broke the stereotype of ‘resettling equals conflicts,’ and the media called the operation ‘a quiet revolution.’ How is this possible? In this study, I am going to categorize the various parties that present the policies aiming to solve bottleneck path problems and to examine the communications and interactions between the interested parties based on the theories of policy network and civil participation; through this method, I want to have a better understanding of how the dynamics of policy network can affect the execution and forming of policies. I am going to investigate what Hsinchu City Government’s and other interested parties’ positions are in the City Government’s policy to open up and widen bottleneck paths that are less than 8 meters in width; how is their interactive and communicative situation? How do resource and authority work with each other? How to attain willing cooperation of the victims of policies without the interference of excavators? I am also going to elaborate on the difficulties encountered during the path building. Through interviews with the interested parties government, city councilors, and neighborhood magistrates etc, I can know the reasons why Hsinchi City Government can successfully launch and execute the policies to solve the bottleneck path (which is less than 8 meters) problems. According to my studies, the reasons are as followed: A. Most of the projects done by Hsinchu City Government belong to “Urban-planned paths;” they are categorized as planned paths but have not been acquired for decades which greatly affected the interest of the residents. B. Hsinchu is an ancient city; the early development left the city with many narrow alleys which cast a shadow on the city’s relief efforts, traffic and poor urban scenery, etc. The opening-up and widening of these paths are of urgent need. C. Support rate is the key to a successful execution of policies; therefore, listening to the opinion of the people is crucial to whether or not the government can earn approval from its people. Local representatives play a mediating role and it is with their support and assistance can a win-win situation be achieved. D. Regarding victims of the policy who are unwilling to be resettled, a soft approach should be adopted—through rational negotiation, and an equal channel of communication. Also, the opinions of all interested parties should be taken into account to help solve the conflicts and reach an agreement. In this way, the government not only realizes civil participation, but also demonstrates the legibility of policies and gains trust from its people. Land acquisition and bottleneck path problem in urban areas are common dilemmas faced by many local governments; with bad financial situations and tight budgets, the policy to solve bottleneck path problems makes the situation even direr. How to strike a balance is a common task that all local governments need to undertake.
APA, Harvard, Vancouver, ISO, and other styles
3

Ramaswamy, Ramkumar, James B. Orlin, and Nilopal Chakravarty. "Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs." 2004. http://hdl.handle.net/1721.1/5065.

Full text
Abstract:
This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bottleneck Paths"

1

Shinn, Tong-Wook, and Tadao Takaoka. "Some Extensions of the Bottleneck Paths Problem." In Algorithms and Computation, 176–87. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04657-0_18.

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

Shinn, Tong-Wook, and Tadao Takaoka. "Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems." In LATIN 2014: Theoretical Informatics, 226–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54423-1_20.

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

Liu, Jingang, Wei Peng, Yonglei Yang, and Zhijian Huang. "A Delay-Based Analysis of Multiple Bottleneck Links of End-to-End Paths in the Internet." In Lecture Notes in Electrical Engineering, 93–103. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38466-0_11.

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

Bokhari, Shahid H. "The Sum-Bottleneck Path Algorithm." In The Kluwer International Series in Engineering and Computer Science, 95–116. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4613-2003-6_6.

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

AlSabah, Mashael, Kevin Bauer, Tariq Elahi, and Ian Goldberg. "The Path Less Travelled: Overcoming Tor’s Bottlenecks with Traffic Splitting." In Privacy Enhancing Technologies, 143–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39077-7_8.

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

Roser, Christoph, Kai Lorentzen, David Lenze, Jochen Deuse, Ferdinand Klenner, Ralph Richter, Jacqueline Schmitt, and Peter Willats. "Bottleneck Prediction Using the Active Period Method in Combination with Buffer Inventories." In Advances in Production Management Systems. The Path to Intelligent, Collaborative and Sustainable Manufacturing, 374–81. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66926-7_43.

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

Karimi, Mobarakeh, Massoud Aman, and Ardeshir Dolati. "Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance." In Topics in Theoretical Computer Science, 34–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68953-1_4.

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

Verma, Rajesh, Arun Prakash, Rajeev Tripathi, and Neeraj Tyagi. "Improving Throughput of Starved TCP Flow by Sidestepping Bottleneck Nodes Using Concurrent Transmission." In Advancing the Next-Generation of Mobile Computing, 47–60. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0119-2.ch004.

Full text
Abstract:
The TCP congestion control mechanism along with unfairness problem poses poor performance when IEEE 802.11 MAC protocol is used in multi-hop ad hoc networks because the traditional TCP has poor interaction with the IEEE 802.11 MAC protocol. Because of the greedy nature of TCP, starvation problem of TCP flows with longer paths is severe. In this paper, we first illustrate that the fairness, congestion control and medium contention are closely coupled issues and the spatial reuse of the channel can improve the performance of wireless ad hoc network. By using concurrent transmission protocol at the MAC layer, like CTMAC, in multi-hop networks we can achieve simultaneous transmissions within the interference regions. Further, we illustrate with extensive simulations in ns-2 that by scheduling multiple concurrent transmissions along the path links, the starvation problem due to greedy nature of TCP can be eliminated and ensuing higher flow throughput and lower end-to-end delay.
APA, Harvard, Vancouver, ISO, and other styles
9

"Introduction." In Enhanced Heat Transfer Mechanism of Nanofluid MQL Cooling Grinding, 1–19. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1546-4.ch001.

Full text
Abstract:
This chapter introduces the application background and characteristics of five kinds of grinding processing methods, briefly describes the enhanced heat transfer mechanism and tribological properties of nanofluids, and points out that nanofluids minimum quantity lubrication (NMQL) solves the technical bottleneck, namely minimum quantity lubrication (MQL) heat transfer capacity is insufficient and opening a new path for application of MQL to grinding process. The current status of exploratory research on the mechanism of minimum quantity lubrication grinding using nanofluids as cooling lubricants is analyzed. The research characteristics of the new green NMQL grinding technology are described, and the chapter puts forward some key problems such as the heat transfer enhancement process of NMQL, the anti-friction and anti-wear tribological mechanism of nanoparticles, and the controlled transport strategies of minimal quantity of lubricating droplets. It will be of great scientific significance and pragmatic value to perfecting NMQL grinding technical system.
APA, Harvard, Vancouver, ISO, and other styles
10

Priyatam, Kumar, R. M. Banakar, and B. Shankaranand. "ISI Cancellation in 4G Wireless Mobiles." In Handbook of Research in Mobile Business, Second Edition, 354–67. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-156-8.ch033.

Full text
Abstract:
Physical layer issues of broadband wireless communication systems form the bottleneck in providing fast and reliable communication over wireless channel. Critical performance limiting challenges are time selective fading channels, frequency selective fading channels, noise, inter symbol interference (ISI), inter carrier interference, power, and bandwidth. Addressing these challenges of wireless broadband communication systems, one can provide faster data processing with lower computational complexity, higher data throughput, and improved performance in terms of bit error rate (BER). In this chapter an effective technique (SISO estimation) to handle interference cancellation is developed. ISI is caused by multi-path propagation. It can be reduced by using a channel equalizer which provides the receiver with the prior knowledge of the channel. Channel estimation is a technique to acquire behavior of the channel. Accuracy of the channel estimation improves the system performance. At BER of 10-4 SISO estimator provide an improvement of 2dB as compared with MMSE DFE estimator.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bottleneck Paths"

1

Yang, Liang, Fan Wu, Zichen Zheng, Bingxin Niu, Junhua Gu, Chuan Wang, Xiaochun Cao, and Yuanfang Guo. "Heterogeneous Graph Information Bottleneck." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/226.

Full text
Abstract:
Most attempts on extending Graph Neural Networks (GNNs) to Heterogeneous Information Networks (HINs) implicitly take the direct assumption that the multiple homogeneous attributed networks induced by different meta-paths are complementary. The doubts about the hypothesis of complementary motivate an alternative assumption of consensus. That is, the aggregated node attributes shared by multiple homogeneous attributed networks are essential for node representations, while the specific ones in each homogeneous attributed network should be discarded. In this paper, a novel Heterogeneous Graph Information Bottleneck (HGIB) is proposed to implement the consensus hypothesis in an unsupervised manner. To this end, information bottleneck (IB) is extended to unsupervised representation learning by leveraging self-supervision strategy. Specifically, HGIB simultaneously maximizes the mutual information between one homogeneous network and the representation learned from another homogeneous network, while minimizes the mutual information between the specific information contained in one homogeneous network and the representation learned from this homogeneous network. Model analysis reveals that the two extreme cases of HGIB correspond to the supervised heterogeneous GNN and the infomax on homogeneous graph, respectively. Extensive experiments on real datasets demonstrate that the consensus-based unsupervised HGIB significantly outperforms most semi-supervised SOTA methods based on complementary assumption.
APA, Harvard, Vancouver, ISO, and other styles
2

Duan, Ran, and Seth Pettie. "Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.43.

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

Vassilevska, Virginia, Ryan Williams, and Raphael Yuster. "All-pairs bottleneck paths for general graphs in truly sub-cubic time." In the thirty-ninth annual ACM symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1250790.1250876.

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

Watson, Alistair, Scott Paton, and Andrew Cowell. "Swan Street Bridge Upgrade – Widening a 70-year old bridge." In IABSE Congress, Christchurch 2021: Resilient technologies for sustainable infrastructure. Zurich, Switzerland: International Association for Bridge and Structural Engineering (IABSE), 2021. http://dx.doi.org/10.2749/christchurch.2021.0647.

Full text
Abstract:
<p>The Swan Street Bridge is a reinforced concrete five-span arch bridge crossing the Yarra River in Melbourne, Australia. Constructed circa 1950, it provided four lanes of traffic and narrow pedestrian footpaths on both sides. The bridge forms part of a key route for vehicular access into the Central Business District, as well as pedestrian thoroughfare to the sporting and events precinct.</p><p>Substantial increases in traffic volumes meant the bridge had become a significant bottleneck and was hazardous for pedestrians. In response to this, a scheme was developed to widen the bridge – providing an additional lane of traffic and four-metre-wide Shared User Paths on both sides – all guided by an overlaying architectural vision created by the winner of a design competition.</p><p>This paper presents the structural technical solutions adopted for the strengthening and widening, which considered the original structural design, as well as the architectural intent for the widening.</p>
APA, Harvard, Vancouver, ISO, and other styles
5

Abu-Affash, A. Karim, Paz Carmi, Matthew J. Katz, and Michael Segal. "The euclidean bottleneck steiner path problem." In the 27th annual ACM symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1998196.1998268.

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

Liu, Qiong, and Gang Zhou. "Research on bottleneck resources focused flow path design." In 2009 IEEE International Conference on Control and Automation (ICCA). IEEE, 2009. http://dx.doi.org/10.1109/icca.2009.5410502.

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

Matsui, Toshihiro, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, and Hiroshi Matsuo. "Study of Route Optimization Considering Bottlenecks and Fairness Among Partial Paths." In 10th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006589000370047.

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

SA-YAKANIT, V., and S. BORIBARN. "PATH INTEGRAL APPROACH TO REACTION IN COMPLEX ENVIRONMENT: A BOTTLENECK PROBLEM." In Proceedings of the First Workshop. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812811301_0010.

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

Byška, Jan, Ivana Kolingerová, Barbora Kozlíková, and Jiří Sochor. "Path-planning algorithm for transportation of molecules through protein tunnel bottlenecks." In SCCG'15: Spring Conference on Computer Graphics. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2788539.2788550.

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

Ong, Zhun-Yong, and Eric Pop. "A Two-Temperature Model of Narrow-Body Silicon Transistors Under Steady State and Transient Operation." In ASME 2008 3rd Energy Nanotechnology International Conference collocated with the Heat Transfer, Fluids Engineering, and Energy Sustainability Conferences. ASMEDC, 2008. http://dx.doi.org/10.1115/enic2008-53025.

Full text
Abstract:
We present a simple theory of diffusive phonon heat transport in silicon thin films using the Two-Temperature Model (TTM). In silicon thin films, boundary scattering reduces the lifetime and hence, the mean free path of acoustic phonons. As acoustic phonons are responsible for heat transport in silicon, the latter effect leads to a reduction in the lattice thermal conductivity. However, optical phonons are unaffected by boundary scattering. As the boundary scattering rate exceeds the inverse lifetime of acoustic phonons and the energy relaxation rate between optical and acoustic phonons, it results in an energy transfer bottleneck. The reduced lattice thermal conductivity from boundary scattering and the energy transfer bottleneck are taken into account in the TTM. We apply the TTM to find the steady temperature distribution in a 2D model of a silicon-on-insulator (SOI) device. The numerical results are in good agreement with those obtained from the more sophisticated full dispersion model of the Boltzmann Transport Equation (BTE). We apply the TTM to calculate the steady state and transient temperature distributions in a simplified 1D model of a SOI device.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bottleneck Paths' 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