Journal articles: '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

11

Tao, Yang, and Peng Huang. "MPTCP Congestion Control Algorithm Based on the Fairness of Bottleneck." Applied Mechanics and Materials 556-562 (May 2014): 3995–4000. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.3995.

Full text

Abstract:

Mobile devices equipped with multiple network interfaces can increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation, enabled by the multipath Transport Control Protocol (MPTCP). However, the existing MPTCP congestion control algorithm adopt a relatively strict definition of the fairness, although to some extent could ensure the fairness of traditional TCP connections, but the total throughput of MPTCP will be limited, which can not make full use of network resources. To solve this problem, this paper propose a congestion control algorithm (FBCC) based on the fairness of bottleneck. The core idea of FBCC is to set up individual fairness factor for each shared bottleneck. NS3 simulation results show that FBCC algorithm not only solves the problem of fairness, but also effectively improve the total throughput of MPTCP connection.

APA, Harvard, Vancouver, ISO, and other styles

12

Komatsuzaki, Tamiki, and R. Stephen Berry. "Regularity in chaotic reaction paths III: Ar6 local invariances at the reaction bottleneck." Journal of Chemical Physics 115, no. 9 (September 2001): 4105–17. http://dx.doi.org/10.1063/1.1385152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Komatsuzaki, Tamiki, and R. Stephen Berry. "Regularity in chaotic reaction paths II: Ar6. Energy dependence and visualization of the reaction bottleneck." Physical Chemistry Chemical Physics 1, no. 6 (1999): 1387–97. http://dx.doi.org/10.1039/a809424a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Verma, Rajesh, Arun Prakash, Rajeev Tripathi, and Neeraj Tyagi. "Improving Throughput of Starved TCP Flow by Sidestepping Bottleneck Nodes Using Concurrent Transmission." International Journal of Mobile Computing and Multimedia Communications 2, no. 1 (January 2010): 68–83. http://dx.doi.org/10.4018/jmcmc.2010103004.

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

15

Ye, Hai Chao, Guo Hua Qin, Cong Kang Wang, and Dong Lu. "A Simulation Study on the End Milling Operation with Multiple Process Steps of Aeronautical Frame Monolithic Components." Applied Mechanics and Materials 66-68 (July 2011): 569–72. http://dx.doi.org/10.4028/www.scientific.net/amm.66-68.569.

Full text

Abstract:

Machining deformation has always been a bottleneck issue in the manufacturing field of aeronautical monolithic components. On the base of finite element method, the effect of the process steps and tool paths on the workpiece stiffness and the redistribution of residual stress in the machining process of aeronautical frame monolithic component was investigated under the given fixturing scheme. Thus, the prediction of the workpiece deformation can be carried out in reason. The proposed simulation approach to deformation analysis can be used to observe the true characteristic of milling forces and machining deformations. Therefore, the proposed method can supply the theoretical basis for the determination of the optimal process parameters.

APA, Harvard, Vancouver, ISO, and other styles

16

Bürner, Johannes, Gerhard Kleineidam, Thomas Braun, Alexander Skibbe, and Jörg Franke. "SmartEco - An Approach Using Electric Storage Heaters for Demand Side Management." Advanced Engineering Forum 19 (October 2016): 27–34. http://dx.doi.org/10.4028/www.scientific.net/aef.19.27.

Full text

Abstract:

The transition from fossil generated energy towards regenerative energy sources is an important topic. Especially the generation from wind power plants and photovoltaic systems underlines the most important difference in comparison to conventional energy generation and distribution. One of the main characteristics of renewable energy sources is its decentralized generation, where existing distribution paths will become more and more a bottleneck in the future. The solution for this challenge is called smart grid and is driven by information, such as energy consumption, in order to match energy demand and supply. The SmartEco idea makes it possible to offload some of the energy’s surplus form the grid to individual customer homes in the context of the smart gird approach.

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Ling Xiu, and Ye Wen Cao. "Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks." Advanced Materials Research 204-210 (February 2011): 1399–402. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1399.

Full text

Abstract:

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.

APA, Harvard, Vancouver, ISO, and other styles

18

GUAN, YU, and GUANGHUI XU. "ALGEBRAIC CONNECTIVITY OF WEIGHED GRAPHS UNDER SHIFTING COMPONENTS." Discrete Mathematics, Algorithms and Applications 02, no. 03 (September 2010): 263–75. http://dx.doi.org/10.1142/s1793830910000656.

Full text

Abstract:

Integrating quadratic form of algebraic connectivity and Perron value of bottleneck matrices, we investigate how the algebraic connectivity of a connected weighted graph behaves under shifting components. Generally speaking, when shift components not containing characteristic vertex from less positive (larger negative) valuation vertices to larger positive (less negative) valuation vertices, or reduce weights of some edges, or add some new blocks, its algebraic connectivity is nonincreasing; when shift components along paths from blocks to other block closer to characteristic block (vertex), or increase weights of some edges, or delete some blocks, its algebraic connectivity is non-decreasing. Therefore, algebraic connectivity could be regarded as a measure of central tendency about blocks of a connected weighted graph with characteristic block (vertex) as its center.

APA, Harvard, Vancouver, ISO, and other styles

19

Sun, Feng, Ajith Kumar V, Guanci Yang, Ansi Zhang, and Yiyun Zhang. "Circle-U-Net: An Efficient Architecture for Semantic Segmentation." Algorithms 14, no. 6 (May 21, 2021): 159. http://dx.doi.org/10.3390/a14060159.

Full text

Abstract:

State-of-the-art semantic segmentation methods rely too much on complicated deep networks and thus cannot train efficiently. This paper introduces a novel Circle-U-Net architecture that exceeds the original U-Net on several standards. The proposed model includes circle connect layers, which is the backbone of ResUNet-a architecture. The model possesses a contracting part with residual bottleneck and circle connect layers that capture context and expanding paths, with sampling layers and merging layers for a pixel-wise localization. The results of the experiment show that the proposed Circle-U-Net achieves an improved accuracy of 5.6676%, 2.1587% IoU (Intersection of union, IoU) and can detect 67% classes greater than U-Net, which is better than current results.

APA, Harvard, Vancouver, ISO, and other styles

20

Lin, Carrie Ka Yuk, Teresa Wai Ching Ling, and Wing Kwan Yeung. "Resource Allocation and Outpatient Appointment Scheduling Using Simulation Optimization." Journal of Healthcare Engineering 2017 (2017): 1–19. http://dx.doi.org/10.1155/2017/9034737.

Full text

Abstract:

This paper studies the real-life problems of outpatient clinics having the multiple objectives of minimizing resource overtime, patient waiting time, and waiting area congestion. In the clinic, there are several patient classes, each of which follows different treatment procedure flow paths through a multiphase and multiserver queuing system with scarce staff and limited space. We incorporate the stochastic factors for the probabilities of the patients being diverted into different flow paths, patient punctuality, arrival times, procedure duration, and the number of accompanied visitors. We present a novel two-stage simulation-based heuristic algorithm to assess various tactical and operational decisions for optimizing the multiple objectives. In stage I, we search for a resource allocation plan, and in stage II, we determine a block appointment schedule by patient class and a service discipline for the daily operational level. We also explore the effects of the separate strategies and their integration to identify the best possible combination. The computational experiments are designed on the basis of data from a study of an ophthalmology clinic in a public hospital. Results show that our approach significantly mitigates the undesirable outcomes by integrating the strategies and increasing the resource flexibility at the bottleneck procedures without adding resources.

APA, Harvard, Vancouver, ISO, and other styles

21

Shin, Dong-Jin, and Jeong-Joon Kim. "Deep Reinforcement Learning-Based Network Routing Technology for Data Recovery in Exa-Scale Cloud Distributed Clustering Systems." Applied Sciences 11, no. 18 (September 18, 2021): 8727. http://dx.doi.org/10.3390/app11188727.

Full text

Abstract:

Research has been conducted to efficiently transfer blocks and reduce network costs when decoding and recovering data from an erasure coding-based distributed file system. Technologies using software-defined network (SDN) controllers can collect and more efficiently manage network data. However, the bandwidth depends dynamically on the number of data transmitted on the network, and the data transfer time is inefficient owing to the longer latency of existing routing paths when nodes and switches fail. We propose deep Q-network erasure coding (DQN-EC) to solve routing problems by converging erasure coding with DQN to learn dynamically changing network elements. Using the SDN controller, DQN-EC collects the status, number, and block size of nodes possessing stored blocks during erasure coding. The fat-tree network topology used for experimental evaluation collects elements of typical network packets, the bandwidth of the nodes and switches, and other information. The data collected undergo deep reinforcement learning to avoid node and switch failures and provide optimized routing paths by selecting switches that efficiently conduct block transfers. DQN-EC achieves a 2.5-times-faster block transmission time and 0.4-times-higher network throughput than open shortest path first (OSPF) routing algorithms. The bottleneck bandwidth and transmission link cost can be reduced, improving the recovery time approximately twofold.

APA, Harvard, Vancouver, ISO, and other styles

22

GARCIA, ROMAN, and JOSE DUATO. "SUBOPTIMAL-OPTIMAL ROUTING FOR LAN INTERNETWORKING USING TRANSPARENT BRIDGES." International Journal of Foundations of Computer Science 09, no. 02 (June 1998): 139–56. http://dx.doi.org/10.1142/s0129054198000118.

Full text

Abstract:

The current standard transparent bridge protocol IEEE-802.1D is based on the Spanning Tree (ST) algorithm. It has a very important restriction: it cannot work when the topology has active loops. Therefore, a tree is the only possible interconnection topology that can be used. The ST algorithm guarantees that the active topology is a tree discarding lines that form loops. However, because of this, network bandwidth cannot be fully utilized. Moreover, trees have a very serious bottleneck near the root. This paper proposes a new transparent bridge protocol for LAN interconnection that allows active loops. Therefore, strongly connected regular topologies like tori, hypercubes, meshes, etc., as well as irregular topologies can be used without wasting bandwidth. As loops provide alternative paths, the new protocol (named OSR for Optimal-Suboptimal Routing) uses optimal routing or, in the worst case, suboptimal routing.

APA, Harvard, Vancouver, ISO, and other styles

23

Hayes, Dermot, Bruce Babcock, Jacinto Fabiosa, Simla Tokgoz, Amani Elobeid, Tun-Hsiang Yu, Fengxia Dong, et al. "Biofuels: Potential Production Capacity, Effects on Grain and Livestock Sectors, and Implications for Food Prices and Consumers." Journal of Agricultural and Applied Economics 41, no. 2 (August 2009): 465–91. http://dx.doi.org/10.1017/s1074070800002935.

Full text

Abstract:

We examined four evolution paths of the biofuel sector using a partial equilibrium world agricultural sector model in CARD that includes the new RFS in the 2007 EISA, a two-way relationship between fossil energy and biofuel markets, and a new trend toward corn oil extraction in ethanol plants. At one extreme, one scenario eliminates all support to the biofuel sector when the energy price is low, while the other extreme assumes no distribution bottleneck in ethanol demand growth when the energy price is high. The third scenario considers a pure market force driving ethanol demand growth because of the high energy price, while the last is a policy-induced shock with removal of the biofuel tax credit when the energy price is high. Standard results hold where the biofuel sector expands with higher energy price, raising the prices of most agricultural commodities through demand side adjustment channels for primary feedstocks and supply side adjustment channels for substitute crops and livestock. On the other hand, the biofuel sector shrinks coupled with opposite impacts on agricultural commodities with the removal of all support including the tax credit. Also, we find that given distribution bottlenecks, cellulosic ethanol crowds marketing channels resulting in a corn-based ethanol price that is discounted. The blenders' credit and consumption mandates provide a price floor for ethanol and for corn. Finally, the tight linkage between the energy and agricultural sectors resulting from the expanding biofuel sector may raise the possibility of spillover effects of OPEC's market power on the agricultural sector.

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Shun-Miao, Sheng-Bo Gao, Thi-Kien Dao, De-Gen Huang, Jin Wang, Hong-Wei Yao, Osama Alfarraj, and Amr Tolba. "An Analysis Scheme of Balancing Energy Consumption with Mobile Velocity Control Strategy for Wireless Rechargeable Sensor Networks." Sensors 20, no. 16 (August 11, 2020): 4494. http://dx.doi.org/10.3390/s20164494.

Full text

Abstract:

Wireless Rechargeable Sensor Networks (WRSN) are not yet fully functional and robust due to the fact that their setting parameters assume fixed control velocity and location. This study proposes a novel scheme of the WRSN with mobile sink (MS) velocity control strategies for charging nodes and collecting its data in WRSN. Strip space of the deployed network area is divided into sub-locations for variant corresponding velocities based on nodes energy expenditure demands. The points of consumed energy bottleneck nodes in sub-locations are determined based on gathering data of residual energy and expenditure of nodes. A minimum reliable energy balanced spanning tree is constructed based on data collection to optimize the data transmission paths, balance energy consumption, and reduce data loss during transmission. Experimental results are compared with the other methods in the literature that show that the proposed scheme offers a more effective alternative in reducing the network packet loss rate, balancing the nodes’ energy consumption, and charging capacity of the nodes than the competitors.

APA, Harvard, Vancouver, ISO, and other styles

25

Bachireddy, Pavan, Christina Ennis, Vinhkhang N. Nguyen, Satyen H. Gohil, Kendell Clement, Sachet A. Shukla, Juliet Forman, et al. "Distinct evolutionary paths in chronic lymphocytic leukemia during resistance to the graft-versus-leukemia effect." Science Translational Medicine 12, no. 561 (September 16, 2020): eabb7661. http://dx.doi.org/10.1126/scitranslmed.abb7661.

Full text

Abstract:

Leukemic relapse remains a major barrier to successful allogeneic hematopoietic stem cell transplantation (allo-HSCT) for aggressive hematologic malignancies. The basis for relapse of advanced lymphoid malignancies remains incompletely understood and may involve escape from the graft-versus-leukemia (GvL) effect. We hypothesized that for patients with chronic lymphocytic leukemia (CLL) treated with allo-HSCT, leukemic cell–intrinsic features influence transplant outcomes by directing the evolutionary trajectories of CLL cells. Integrated genetic, transcriptomic, and epigenetic analyses of CLL cells from 10 patients revealed that the clinical kinetics of post-HSCT relapse are shaped by distinct molecular dynamics. Early relapses after allo-HSCT exhibited notable genetic stability; single CLL cell transcriptional analysis demonstrated a cellular heterogeneity that was static over time. In contrast, CLL cells relapsing late after allo-HSCT displayed notable genetic evolution and evidence of neoantigen depletion, consistent with marked single-cell transcriptional shifts that were unique to each patient. We observed a greater rate of epigenetic change for late relapses not seen in early relapses or relapses after chemotherapy alone, suggesting that the selection pressures of the GvL bottleneck are unlike those imposed by chemotherapy. No selective advantage for human leukocyte antigen (HLA) loss was observed, even when present in pretransplant subpopulations. Gain of stem cell modules was a common signature associated with leukemia relapse regardless of posttransplant relapse kinetics. These data elucidate the biological pathways that underlie GvL resistance and posttransplant relapse.

APA, Harvard, Vancouver, ISO, and other styles

26

Supianto, Ahmad Afif, Satrio Agung Wicaksono, Fitra A. Bachtiar, Admaja Dwi Herlambang, Yusuke Hayashi, and Tsukasa Hirashima. "Web-based Application for Visual Representation of Learners' Problem-Posing Learning Pattern." Journal of Information Technology and Computer Science 4, no. 1 (June 27, 2019): 103. http://dx.doi.org/10.25126/jitecs.20194172.

Full text

Abstract:

The analysis of learner’s learning process on an interactive learning media tends to involve a huge amount of data gathering. The analysis aims to explore patterns and relationship of such data to understand the learning experience and identifying learner’s trap states in the learning process. Such data analysis tends to be a nuisance for stakeholders such as class instructors (i.e., teachers) and educational researchers. This research suggests the development of a web-based software application that utilizes the use of visual artifacts as an approach of educational data mining to analyze learner’s learning process in an interactive learning media. The developed software aims to visualize the learner’s activity sequence, furthermore, to identify learning paths toward bottleneck states due to lack of understanding of a problem given. Such information is then passed to the instructors as key information to create proper feedback to the learners based on its results. As a case study, this research uses the data log of Monsakun, a digital learning environment that focuses on exercising arithmetic using story-based question by using a problem-posing approach with integration of mathematical sentences.

APA, Harvard, Vancouver, ISO, and other styles

27

Drábek, Michal, Vít Janoš, and Zdeněk Michl. "ON OPERATION OF 740 M LONG FREIGHT TRAINS ON CZECH TEN-T RAILWAY NETWORK." Acta Polytechnica CTU Proceedings 5 (September 15, 2016): 12. http://dx.doi.org/10.14311/app.2016.5.0012.

Full text

Abstract:

Regulation (EU) No 1315/2013 defines actual scope of core and comprehensive TEN-T network, including both networks for railway freight transport. For the core network, possibility to operate 740 m long freight trains is required. The aim of this paper is to analyse availability of appropriate overtaking tracks for 740 m long freight trains. Due to ETCS braking curves and odometry, such trains, after ETCS implementation, will require 780-800 m long overtaking tracks. For practical reasons (e.g. bypass lines), whole Czech railway TEN-T network is analysed. The overtaking track, whose occupation means influence on scheduled traffic or threat to boarding passengers, are excluded. The data was collected from station schemes from Collection of Official Requisites for 2015/16 Timetable, issued by SŽDC, Czech state Infrastructure Manager. Most of appropriate tracks are over 800 m long, but their density in the network and in particular directions varies considerably. For freight traffic, gradient of the line is important, so in the resulting figure, there are marked significant peaks for particular lines as well. Czech TEN-T lines are further segmented on the basis of number of tracks and their traffic character. Then, specific issues on overtaking or crossing of 740 m long freight trains are discussed. As a conclusion, for long-term development of Czech TEN-T lines, targeted investment is recommended not only for passenger railway, but also for freight railway. An attractive capacity offer for railway undertakings, which can stimulate freight traffic on European Rail freight corridors, can be represented by network-bound periodic freight train paths with suitable long overtaking tracks outside bottlenecks. After the overtaking by passenger trains, a freight train should run without stop through large node station or a bottleneck area. Before the sections with high gradients, coupling of additional locomotives should be connected with the overtaking process. Next suitable overtaking tracks should be available behind every significant peak of the line.

APA, Harvard, Vancouver, ISO, and other styles

28

Saeed, Ather, Andrew Stranieri, and Richard Dazeley. "Fault-Tolerant Energy-Efficient Priority-Based Routing Scheme for the Multisink Healthcare Sensor Networks." ISRN Sensor Networks 2012 (May 9, 2012): 1–11. http://dx.doi.org/10.5402/2012/196590.

Full text

Abstract:

Wireless sensor networks (WSNs) are widely used in battle fields, logistic applications, healthcare, habitat monitoring, environmental monitoring, home security, and variety of other areas. The existing routing algorithms focus on the delivery of data packets to the sink using the shortest path; however, calculating the shortest path is not a cost-effective solution while disseminating datasets of interest to the nearest sink node. The approach presented in this paper extends the existing PBR (priority-based routing) protocol by providing a new fault-tolerant multipath priority-based routing (FT-MPPBR) scheme, which not only balances the energy consumption while selecting multiple paths but also balances the workload of the node closest to the sink. The nodes closer to the sink dissipate more energy and can become the source of a communication bottleneck. Simulation results for the proposed routing scheme are encouraging and clearly show that the FT-MPPBR has outperformed the existing PBR schemes in terms of prolonging the network lifetime and reliability. In healthcare sensor networks, timely dissemination of datasets is critical for the well-being of a patient. This research further extends the PBR architecture for supporting computational intensive analysis by transferring datasets of interest to the sensor grid node for improved communication and better throughput.

APA, Harvard, Vancouver, ISO, and other styles

29

B. Jadhav, Sachin, Jayamala K. Patil, and Ramesh T. Patil. "Design and Implementation of Modified Partial Product Reduction Tree for High Speed Multiplication." International Journal of Reconfigurable and Embedded Systems (IJRES) 2, no. 1 (March 1, 2013): 15. http://dx.doi.org/10.11591/ijres.v2.i1.pp15-20.

Full text

Abstract:

This paper presents the details of hardware implementation of modified partial product reduction tree using 4:2 and 5:2 compressors. Speed of multiplication operation is improved by using higher compressors .In order to improve the speed of the multiplication process within the computational unit; there is a major bottleneck that is needed to be considered that is the partial products reduction network which is used in the multiplication block. For implementation of this stage require addition of large operands that involve long paths for carry propagation. The proposed architecture is based on binary tree constructed using modified 4:2 and 5:2 compressor circuits. Increasing the speed of operation is achieved by using higher modified compressors in critical path. Our objective of work is, to increase the speed of multiplication operation by minimizing the number of combinational gates using higher n:2 compressors. The experimental test of the proposed modified compressor is done using Spartan-3FPGA device (XC3S400 PQ-208). Using tree architectures for the partial products reduction network represent an attractive solution that is frequently applied to speed up the multiplication process. The simulation result shows 4:2 and 5:2 compressor output which is done using Questa Sim 6.4c Mentor Graphics tool.

APA, Harvard, Vancouver, ISO, and other styles

30

Faria, Margarida, Ricardo Marín, Marija Popović, Ivan Maza, and Antidio Viguria. "Efficient Lazy Theta* Path Planning over a Sparse Grid to Explore Large 3D Volumes with a Multirotor UAV." Sensors 19, no. 1 (January 5, 2019): 174. http://dx.doi.org/10.3390/s19010174.

Full text

Abstract:

Exploring large, unknown, and unstructured environments is challenging for Unmanned Aerial Vehicles (UAVs), but they are valuable tools to inspect large structures safely and efficiently. The Lazy Theta* path-planning algorithm is revisited and adapted to generate paths fast enough to be used in real time and outdoors in large 3D scenarios. In real unknown scenarios, a given minimum safety distance to the nearest obstacle or unknown space should be observed, increasing the associated obstacle detection queries, and creating a bottleneck in the path-planning algorithm. We have reduced the dimension of the problem by considering geometrical properties to speed up these computations. On the other hand, we have also applied a non-regular grid representation of the world to increase the performance of the path-planning algorithm. In particular, a sparse resolution grid in the form of an octree is used, organizing the measurements spatially, merging voxels when they are of the same state. Additionally, the number of neighbors is trimmed to match the sparse tree to reduce the number of obstacle detection queries. The development methodology adopted was Test-Driven Development (TDD) and the outcome was evaluated in real outdoors flights with a multirotor UAV. In the results, the performance shows over 90 percent decrease in overall path generation computation time. Furthermore, our approach scales well with the safety distance increases.

APA, Harvard, Vancouver, ISO, and other styles

31

Zhan, Yuzhuo, Weimin Lei, Yunchong Guan, and Hao Li. "Research on the Load Distribution Strategy to Meet the QoE Requirements for Conversational Real-Time HD Video Service." Electronics 9, no. 5 (May 11, 2020): 790. http://dx.doi.org/10.3390/electronics9050790.

Full text

Abstract:

A reliable transmission with QoE (Quality of Experience) guarantee is crucial for internet conversational service applications. However, due to the limited network bandwidth bottleneck effect and the drawback of transmission technology, there exists no mature and open QoE technical solution for this service. In this paper, we focused our attention on a load distribution strategy for multipath relay transmission to meet the QoE requirements of conversational real-time HD video services. It consisted of three stages: First, a series of relay nodes was deployed in the backbone network, and a software defined overlay network was constructed to perform the multipath relay transmission for the service. Second, by an analysis of the QoE feature, a bijection was built for each quantitative QoE and its MOS (Mean Opinion Score) score. Finally, considering the influence of the coupling relation between paths on the service quality in multipath relay transmission, fuzzy cooperative game theory was used to design the service load distribution strategy. Many experiments showed that compared with state-of-the-art methods in the single-path transmission scene, the strategy we designed can dynamically adjust the load distribution of each sub-path according to the change in QoS (Quality of Service) information of the transmission path in real time. While meeting the strict real-time constraints of the service, it can effectively avoid the impact of network random congestion on the service QoE.

APA, Harvard, Vancouver, ISO, and other styles

32

Khaghani, Farnaz, and Farrokh Jazizadeh. "mD-Resilience: A Multi-Dimensional Approach for Resilience-Based Performance Assessment in Urban Transportation." Sustainability 12, no. 12 (June 15, 2020): 4879. http://dx.doi.org/10.3390/su12124879.

Full text

Abstract:

As demonstrated for extreme events, the resilience concept is used to evaluate the ability of a transportation system to resist and recover from disturbances. Motivated by the high cumulative impact of recurrent perturbations on transportation systems, we have investigated resilience quantification as a performance assessment method for high-probability low-impact (HPLI) disturbances such as traffic congestions. Resilience-based metrics are supplementary to conventional travel-time-based indices in literature. However, resilience is commonly quantified as a scalar variable despite its multi-dimensional nature. Accordingly, by hypothesizing increased information gain in performance assessment, we have investigated a multi-dimensional approach (mD-Resilience) for resilience quantification. Examining roadways’ resilience to recurrent congestions as a contributor to sustainable mobility, we proposed to measure resilience with several attributes that characterize the degradation stage, the recovery stage, and possible recovery paths. These attributes were integrated into a performance index by using Data Envelopment Analysis (DEA) as a non-parametric method. We demonstrated the increased information gain by quantifying the performance of major freeways in Los Angeles, California using Performance Measurement System (PeMS) data. The comparison of mD-Resilience approach with the method based on area under resilience curves showed its potential in distinguishing the severity of congestions. Furthermore, we showed that mD-Resilience also characterizes performance from the lens of delay and bottleneck severities.

APA, Harvard, Vancouver, ISO, and other styles

33

MONDAL, MOSIN, and YEHIA MASSOUD. "ACCURATE ANALYTICAL MODELING OF FREQUENCY DEPENDENT LOOP SELF-INDUCTANCE." Journal of Circuits, Systems and Computers 17, no. 01 (February 2008): 77–93. http://dx.doi.org/10.1142/s0218126608004150.

Full text

Abstract:

Parasitic inductance of global interconnects has gained much attention in the recent past since the inductance can no longer be neglected due to different design and fabrication issues. This has led to a paradigm shift from RC to RLC modeling of global interconnects in modern integrated circuits. However, the extraction of inductance is often expensive and presents a bottleneck in performing RLC analysis of interconnects. Unlike capacitance, the frequency dependence of current distribution through return paths present a major challenge in inductance extraction. In this paper, an efficient analytical model of frequency dependent self-inductance that can be applied to model a wide range of real design scenarios was presented. The model is based on the determination of the inductances at low and very high frequencies, an intermediate frequency point and the corresponding slope of the inductance frequency response. It is demonstrate that the approach is computationally efficient and it produces accurate values of frequency dependent inductance. It is also investigate how the frequency dependence of loop self-inductance affects the RLC delay and show that the pessimism in RLC propagation delay estimation could be as high as 49% if the frequency dependence of inductance is not considered properly. Thus, realistic (less pessimistic) delay values can be obtained using our model, leading to improved system performance.

APA, Harvard, Vancouver, ISO, and other styles

34

LIU, Yanhong. "China’s Implementation of Goal 9 of the 2030 Agenda for Sustainable Development: International Capacity Cooperation under the Belt and Road Initiative." Chinese Journal of Urban and Environmental Studies 07, no. 01 (March 2019): 1940004. http://dx.doi.org/10.1142/s2345748119400049.

Full text

Abstract:

The experience in reform and opening up shows that China’s achievements in industrialization are largely attributed to its industrial openness towards the outside world and the international cooperation. As it enters the second decade of the 21st century, China’s industry has stepped into a new era of leading international development cooperation and promoting inclusive and sustainable growth in global industry, namely a period of developing international capacity cooperation supported by the Belt and Road Initiative (BRI). As vigorously driven by the BRI, the international capacity cooperation has not only pushed forward the creation of new industrial cooperation models among developing countries, but also opened new paths and contributed Chinese approaches to regional and global industrial cooperations under the new situation, in particular for the implementation of the inclusive and sustainable industrial development goal set in the United Nations 2030 Agenda for Sustainable Development. This mainly manifests as: dovetailing the top-level design with planning to build new mechanism-based capacity cooperation models, achieving cross-border infrastructure connectivity to promote trade, investment and industrial cooperation, constructing cooperation zones as an important platform for small and medium-sized enterprises to participate in capacity cooperation, breaking the financial bottleneck of regional development through diversified and open financial cooperation, and leading the leapfrog development of countries along the Belt and Road through technological cooperation and collaborative innovation.

APA, Harvard, Vancouver, ISO, and other styles

35

Hammad, Mohammed, Alireza Abbasi, Ripon K. Chakrabortty, and Michael J. Ryan. "Predicting the critical path changes using sensitivity analysis: a delay analysis approach." International Journal of Managing Projects in Business 13, no. 5 (April 30, 2020): 1097–119. http://dx.doi.org/10.1108/ijmpb-07-2019-0184.

Full text

Abstract:

PurposeThis research presents a framework that allows project managers to predict the next critical paths (CP(s)) and to take extra care when planning and executing those activities that have the potential to cause changes in a project's current CP(s).Design/methodology/approachThe method presented here is based on an assessment of each activity's contribution to the overall schedule variance, which involves assigning a probability distribution function to each activity duration in the project. A sensitivity analysis is also carried out, which forms the basis of identifying which activity most affects the project completion date and therefore will have the greatest effect in changing the CP.FindingsThe authors’ analysis reveals that the most appropriate probability density function (PDF) for the targeted project is the normal distribution. However, the aim of this work is not to determine the most suitable distribution for each activity but rather to study the effect of the activity distribution type on the CP prediction. The results show that the selection of the appropriate probability distribution is very important, since it can impact the CP prediction and estimated project completion date.Originality/valueThis research work proposes a delay analysis scheme which can help the project manager to predict the next CP and to improve performance by identifying which activity is the bottleneck. On the other hand, the simplicity arises from the fact that this method does not require any expensive machines or software to generate results.

APA, Harvard, Vancouver, ISO, and other styles

36

Juniana, Paula, and Lukman Hakim. "TRAFFIC LIGHT CONTROL USING FUZZY LOGIC MAMDANI METHOD." Jurnal Terapan Teknologi Informasi 3, no. 1 (June 27, 2019): 1–10. http://dx.doi.org/10.21460/jutei.2019.31.126.

Full text

Abstract:

Traffic congestion is a common occurrence in Indonesia. Traffic congestion is increasing from year to year, causing many things to happen, such as longer travel time, increased transportation costs, serious disruptions to transporting products, decreasing levels of work productivity, and wasteful use of labor energy. Congestion is also caused by a traffic light control system that is made with a fixed time so it can not detect the density of certain paths. Traffic lights in Indonesia, frequent damage that makes the density and the flow of his road vehicles can not be controlled. From these problems, conducted research to reduce the density of vehicles using infrared sensors and see the waiting time of the vehicle when the red light. The traffic light control system will use Fuzzy Logic Mamdani method. In Mamdani method by applying fuzzy into each variable and will be done matching between rule with condition which fulfilled to determine contents of output to be executed by prototype. This congestion detection will help the system in controlling the green light time by looking at stable, medium, and traffic jams. When the bottleneck starts to detect, the prototype will add a green light time according to the condition that is 0 seconds, 5 seconds, 10 seconds, and 15 seconds. However, when the streets are not detected by traffic jams, the green light will be back to normal at 15 seconds without additional time

APA, Harvard, Vancouver, ISO, and other styles

37

Juniana, Paula, and Lukman Hakim. "TRAFFIC LIGHT CONTROL USING FUZZY LOGIC MAMDANI METHOD." Jurnal Terapan Teknologi Informasi 3, no. 1 (June 27, 2019): 1–10. http://dx.doi.org/10.21460/jutei.v3i1.126.

Full text

Abstract:

Traffic congestion is a common occurrence in Indonesia. Traffic congestion is increasing from year to year, causing many things to happen, such as longer travel time, increased transportation costs, serious disruptions to transporting products, decreasing levels of work productivity, and wasteful use of labor energy. Congestion is also caused by a traffic light control system that is made with a fixed time so it can not detect the density of certain paths. Traffic lights in Indonesia, frequent damage that makes the density and the flow of his road vehicles can not be controlled. From these problems, conducted research to reduce the density of vehicles using infrared sensors and see the waiting time of the vehicle when the red light. The traffic light control system will use Fuzzy Logic Mamdani method. In Mamdani method by applying fuzzy into each variable and will be done matching between rule with condition which fulfilled to determine contents of output to be executed by prototype. This congestion detection will help the system in controlling the green light time by looking at stable, medium, and traffic jams. When the bottleneck starts to detect, the prototype will add a green light time according to the condition that is 0 seconds, 5 seconds, 10 seconds, and 15 seconds. However, when the streets are not detected by traffic jams, the green light will be back to normal at 15 seconds without additional time

APA, Harvard, Vancouver, ISO, and other styles

38

Mudassir, Mumajjed Ul, and M. Iram Baig. "MFVL HCCA: A Modified Fast-Vegas-LIA Hybrid Congestion Control Algorithm for MPTCP Traffic Flows in Multihomed Smart Gas IoT Networks." Electronics 10, no. 6 (March 18, 2021): 711. http://dx.doi.org/10.3390/electronics10060711.

Full text

Abstract:

Multihomed smart gas meters are Internet of Things (IoT) devices that transmit information wirelessly to a cloud or remote database via multiple network paths. The information is utilized by the smart gas grid for accurate load forecasting and several other important tasks. With the rapid growth in such smart IoT networks and data rates, reliable transport layer protocols with efficient congestion control algorithms are required. The small Transmission Control Protocol/Internet Protocol (TCP/IP) stacks designed for IoT devices still lack efficient congestion control schemes. Multipath transmission control protocol (MPTCP) based congestion control algorithms are among the recent research topics. Many coupled and uncoupled congestion control algorithms have been proposed by researchers. The default congestion control algorithm for MPTCP is coupled congestion control by using the linked-increases algorithm (LIA). In battery powered smart meters, packet retransmissions consume extra power and low goodput results in poor system performance. In this study, we propose a modified Fast-Vegas-LIA hybrid congestion control algorithm (MFVL HCCA) for MPTCP by considering the requirements of a smart gas grid. Our novel algorithm operates in uncoupled congestion control mode as long as there is no shared bottleneck and switches to coupled congestion control mode otherwise. We have presented the details of our proposed model and compared the simulation results with the default coupled congestion control for MPTCP. Our proposed algorithm in uncoupled mode shows a decrease in packet loss up to 50% and increase in average goodput up to 30%.

APA, Harvard, Vancouver, ISO, and other styles

39

Ravankar, Abhijeet, Ankit A. Ravankar, Yohei Hoshino, and Yukinori Kobayashi. "On Sharing Spatial Data with Uncertainty Integration Amongst Multiple Robots Having Different Maps." Applied Sciences 9, no. 13 (July 8, 2019): 2753. http://dx.doi.org/10.3390/app9132753.

Full text

Abstract:

Information sharing is a powerful feature of multi-robot systems. Sharing information precisely and accurately is important and has many benefits. Particularly, smart information sharing can improve robot path planning. If a robot finds a new obstacle or blocked path, it can share this information with other remote robots allowing them to plan better paths. However, there are two problems with such information sharing. First, the maps of the robots may be different in nature (e.g., 2D grid-map, 3D semantic map, feature map etc.) as the sensors used by the robots for mapping and localization may be different. Even the maps generated using the same sensor (e.g., Lidar) can vary in scale or rotation and the sensors used might have different specifications like resolution or range. In such scenarios, the ‘correspondence problem’ in different maps is a critical bottleneck in information sharing. Second, the transience of the obstacles has to be considered while also considering the positional uncertainty of the new obstacles while sharing information. In our previous work, we proposed a ‘node-map’ with a confidence decay mechanism to solve this problem. However, the previous work had many limitations due to the decoupling of new obstacle’s positional uncertainty and confidence decay. Moreover, the previous work applied only to homogeneous maps. In addition, the previous model worked only with static obstacles in the environment. The current work extends our previous work in three main ways: (1) we extend the previous work by integrating positional uncertainty in the confidence decay mechanism and mathematically model the transience of newly added or removed obstacles and discuss its merits; (2) we extend the previous work by considering information sharing in heterogeneous maps build using different sensors; and (3) we consider dynamic obstacles like moving people in the environment and test the proposed method in complex scenarios. All the experiments are performed in real environments and with actual robots and results are discussed.

APA, Harvard, Vancouver, ISO, and other styles

40

Averbakh, Igor, and Oded Berman. "Categorized bottleneck-minisum path problems on networks." Operations Research Letters 16, no. 5 (December 1994): 291–97. http://dx.doi.org/10.1016/0167-6377(94)90043-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wang, Liang, Gabe Guevara, Rey Co, Ron Zhang, and Roseann Alatorre. "Wafer level packaging for high-brightness LED lighting with optimized thermal dissipation and optical performance." Additional Conferences (Device Packaging, HiTEC, HiTEN, and CICMT) 2014, DPC (January 1, 2014): 001787–817. http://dx.doi.org/10.4071/2014dpc-wp35.

Full text

Abstract:

High-brightness LED lighting has gained high attention in the industry and its market share for general lighting has been rapidly expanding upon the continued progress on improving internal quantum efficiency, light extraction and wavelength conversion. In spite of these promising advances, some key breakthroughs must be made before this technology can be fully adopted into the broad market, such as efficient thermal dissipation and low manufacturing cost. A lion share of cost of an LED module is incurred during the packaging processes after the emissive device stack has been fabricated. Also given the thin thickness of device stack, the packaging structure remains the bottleneck for thermal dissipation. We address these two key challenges with a novel wafer-level packaging structure integrated into the device stack, which enables maximal thermal dissipation rate from active device stack to substrate while allowing high aperture ratio and optimized light output. Our approach applies full wafer-level batch process from epitaxial growth all the way down to packaging for internal and external light extraction as well as wavelength conversion, in order to achieve high throughput and high yield in a scalable and inexpensive manner. Initial prototypes of GaN based blue LED with big chip size have been fabricated without selective electrodes for minimal contact resistance, exhibiting high brightness at relatively low drive voltage (3.5V). As one key step in wafer level packaging, the wafer bonding process was characterized with Moire patterning and Topography and Deformation Measurement to understand the warpage profile and varying temperatures along both heat up and cool down paths, with simulation performed in guidance to final solution for compensating the warpage profile along the bonding process and afterwards. Different approaches were applied in learning the most effective bonding technique for this packaging structure. Further development is ongoing to improve the overall power efficiency and color quality, including optimal materials for ohmic contacts at both electrodes, current-spreading layer, large-area light extraction structure, and integrated phosphor material. This wafer-level packaging technology is scalable to large wafer size for high-throughput and low-cost manufacturing, to achieve both superior thermal management and optimized power efficiency.

APA, Harvard, Vancouver, ISO, and other styles

42

Truhlar, G., and Bruce C. Garrett. "Dynamical bottlenecks and semiclassical tunneling paths for chemical reactions." Journal de Chimie Physique 84 (1987): 365–69. http://dx.doi.org/10.1051/jcp/1987840365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Aloupis, Greg, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, and Stefan Langerman. "Bottleneck detour tree of points on a path." Computational Geometry 79 (February 2019): 30–36. http://dx.doi.org/10.1016/j.comgeo.2019.01.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Datta, Alak K., and Ranjan K. Sen. "1-Approximation algorithm for bottleneck disjoint path matching." Information Processing Letters 55, no. 1 (July 1995): 41–44. http://dx.doi.org/10.1016/0020-0190(95)00031-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Milion, Raphael N., Thaís da C. L. Alves, José Carlos Paliari, and Luisa H. B. Liboni. "CBA-Based Evaluation Method of the Impact of Defects in Residential Buildings: Assessing Risks towards Making Sustainable Decisions on Continuous Improvement Activities." Sustainability 13, no. 12 (June 9, 2021): 6597. http://dx.doi.org/10.3390/su13126597.

Full text

Abstract:

Evaluating the impact of defects in buildings and ranking the most impactful ones enables construction companies to better choose which paths to take in light of continuous improvement activities to support more sustainable decisions regarding the design and operation of buildings. As a result, the risks of the different choices are more clearly identified while assessing all tangible and intangible aspects of residential building defects in a structured way. Although recent studies on managing construction defects in residential buildings have focused on monetary losses associated with maintenance activities based on the defect’s frequency and severity, these studies do not take into account the levels of customer satisfaction. To address this gap, this paper proposes a novel evaluation method of the impact of defects to support decision-making in managing defect occurrences in residential buildings. The goal is to rank the defects’ impact based on a combination of some critical aspects: frequency of occurrence, financial considerations on repairing such defects, the impact that these defects have on customer satisfaction, and the cost and complexity of preventing and minimizing these defect occurrences through continuous improvement activities. The method consists of a structured set of steps that use data from technical assistance departments and customer satisfaction surveys, where information about the users’ level of satisfaction and the occurrence of defects is available. In this paper, data obtained from a construction company were used to test and validate the proposed method. The method also examines the challenges and barriers associated with the technique and points out that difficulties in acquiring reliable data are a bottleneck for making conscious and sustainable decisions to address construciton defects. Moreover, the case study results highlight essential capabilities needed by companies to correctly assess the impact of defects, such as correctly logging data in a structured database and having skilled personnel to verify defects users might have complained about. The paper ends by proposing a set of guidelines to use the method and stressing that structured methods for decision-making are crucial to analyze construction defects in a structured way while also incorporating the user’s perspective. The proposed method is expected to improve sustainable managerial decisions where economic, environmental, social, and technical risks can be accounted for to enhance the quality of projects from the customer’s perspective. Such analysis can help optimize and prioritize the use of resources and minimize the economic impact of activities on the construction company.

APA, Harvard, Vancouver, ISO, and other styles

46

TANIMOTO, Teruo, Takatsugu ONO, and Koji INOUE. "Critical Path Based Microarchitectural Bottleneck Analysis for Out-of-Order Execution." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A, no. 6 (June 1, 2019): 758–66. http://dx.doi.org/10.1587/transfun.e102.a.758.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Onur Dogan. "Discovering Customer Paths from Location Data with Process Mining." European Journal of Engineering Science and Technology 3, no. 1 (April 21, 2020): 139–45. http://dx.doi.org/10.33422/ejest.v3i1.250.

Full text

Abstract:

customer paths can be used for several purposes, such as understanding customer needs, defining bottlenecks, improving system performance. Two of the principal difficulties depend on discovering customer paths due to dynamic human behaviors and collecting reliable tracking data. Although machine learning methods have contributed to individual tracking, they have complex iterations and problems to produce understandable visual results. Process mining is a methodology that can rapidly create process flows and graphical representations. In this study, customer flows are created with process mining in a supermarket. The differences between the paths of customers purchased and non-purchased are discussed. The results show that both groups have almost similar visit duration, which is 87.5 minutes for purchased customers and 86.6 minutes for non-purchased customers. However, the duration of aisles is relatively small in non-purchased customer flows because customers aim to return or change the item instead of buying.

APA, Harvard, Vancouver, ISO, and other styles

48

Rembold, Bernhard. "A Path-Specific Interpolation-and Weighting-Method to Speed up Ray-Tracer Path-Finding." Frequenz 73, no. 7-8 (July 26, 2019): 273–79. http://dx.doi.org/10.1515/freq-2018-0228.

Full text

Abstract:

Abstract Ray-tracers are used for modeling the propagation behavior of mobile communications or radar within a given scenario. The necessary CPU-time for the path-finding is often the bottleneck of the simulation. The paper shows a new interpolation method, which exploits the similarity of an incoming plane wave at a receiver position with that in the vicinity of the position. This is combined with a linear weighting, as in general the waves at other receiver positions can be used for the interpolation. Examples using a ray-tracer equipped with the method demonstrate the effectiveness of the method.

APA, Harvard, Vancouver, ISO, and other styles

49

Xu, Lijuan, Laura Dempere‐Marco, Fan Wang, Zhihang Ji, and Xiaopeng Hu. "Towards path‐based semantic dissimilarity estimation for scene representation using bottleneck analysis." IET Computer Vision 13, no. 8 (December 2019): 691–99. http://dx.doi.org/10.1049/iet-cvi.2018.5560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

de Lima Pinto, Leizer, Cláudio Thomás Bornstein, and Nelson Maculan. "The tricriterion shortest path problem with at least two bottleneck objective functions." European Journal of Operational Research 198, no. 2 (October 2009): 387–91. http://dx.doi.org/10.1016/j.ejor.2008.09.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Bottleneck Paths'

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