Relevant bibliographies by topics / Channel routing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Channel routing'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 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 'Channel routing.'

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 "Channel routing"

1

Roychowdhury, V. P., J. W. Greene, and A. El Gamal. "Segmented channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12, no. 1 (1993): 79–95. http://dx.doi.org/10.1109/43.184845.

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

Leong, H. W., and C. L. Liu. "Discretionary channel routing." IEE Proceedings G (Electronic Circuits and Systems) 135, no. 2 (1988): 45. http://dx.doi.org/10.1049/ip-g-1.1988.0007.

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

Bhatia, Dinesh, and V. Shankar. "Greedy Segmented Channel Router." VLSI Design 5, no. 1 (January 1, 1996): 11–21. http://dx.doi.org/10.1155/1996/53512.

Full text
Abstract:
An efficient solution to the generalized detailed routing problem in segmented channels for row-based FPGAs is presented. A generalized detailed routing allows routing of each connection using an arbitrary number of tracks, i.e., doglegs are allowed. This approach is different from the normally followed method where each connection is routed on a single straight track. We present a router that performs generalized segmented channel routing using a greedy approach to route channels. The router also renders itself to limited tolerance against faults in the routing architecture.
APA, Harvard, Vancouver, ISO, and other styles
4

P. T. Nimbalkar, P. T. Nimbalkar, D. K. Mokashi D. K. Mokashi, and S. V. Kanitkar S. V. Kanitkar. "Channel Routing Model For Flood Zone Mapping." Indian Journal of Applied Research 1, no. 2 (October 1, 2011): 48–49. http://dx.doi.org/10.15373/2249555x/nov2011/15.

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

Chaudhary, K., and P. Robinson. "Channel routing by sorting." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10, no. 6 (June 1991): 754–60. http://dx.doi.org/10.1109/43.137504.

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

Haruyama, S., D. F. Wong, and D. S. Fussell. "Topological channel routing (VLSI)." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11, no. 10 (1992): 1177–97. http://dx.doi.org/10.1109/43.170984.

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

Tong Gao and C. L. Liu. "Minimum crosstalk channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, no. 5 (May 1996): 465–74. http://dx.doi.org/10.1109/43.506134.

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

Markosyan, S. E., and G. S. Gasparyan. "LSI channel routing algorithms." Cybernetics 27, no. 3 (1991): 349–53. http://dx.doi.org/10.1007/bf01068315.

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

Tragoudas, Spyros. "On Channel Routing Problems With Interchangeable Terminals." VLSI Design 2, no. 1 (January 1, 1994): 51–68. http://dx.doi.org/10.1155/1994/48137.

Full text
Abstract:
The use of programmable logic cells in VLSI design allows the terminals on these cells to be interchanged since their geometrics are programmable. Recently, many exact algorithms and heuristics have been proposed for channel routing with interchangeable terminals [18, 25, 4, 11, 12, 20, 17, 3]. Various optimization problems have also been shown to be NP—hard [25, 23]. In this paper, we consider channels with exits. Let m, D be the number of terminals in the channel and the maximum number of terminals on a net, respectively. We present an O(m) algorithm that obtains optimal density for channels with exits that have one cell on each side. The existing algorithm for this problem [5] guarantees only an approximate density. Moreover, if one of the two cells has fixed terminals, we show that the density minimization problem is NP-hard. The latter problem was introduced in [5]. For instances with any number of cells we present an O(m) time algorithm for the via minimization problem, an O(m2⋅D) algorithm for the problem of finding a maximum planar subset of nets in a channel, and an O(m) algorithm to determine whether the channel adopts external-internal layout. Also for the special case where there exists one cell per side, we present an alternative algorithm that finds a maximum planar set of nets in O(m) time.
APA, Harvard, Vancouver, ISO, and other styles
10

Zakaria, Omar M., Aisha-Hassan A. Hashim, Wan H. Hassan, Othman O. Khalifa, M. Azram, Lalitha B. Jivanadham, Mistura L. Sanni, and Mahdi Zareei. "Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches." Journal of Computer Networks and Communications 2016 (2016): 1–24. http://dx.doi.org/10.1155/2016/2769685.

Full text
Abstract:
Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Channel routing"

1

Domke, Jens. "Routing on the Channel Dependency Graph:." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902.

Full text
Abstract:
In the pursuit for ever-increasing compute power, and with Moore's law slowly coming to an end, high-performance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute nodes. These networks have a large influence on total cost, application performance, energy consumption, and overall system efficiency of the supercomputer. Unfortunately, state-of-the-art routing algorithms, which define the packet paths through the network, do not utilize this important resource efficiently. Topology-aware routing algorithms become increasingly inapplicable, due to irregular topologies, which either are irregular by design, or most often a result of hardware failures. Exchanging faulty network components potentially requires whole system downtime further increasing the cost of the failure. This management approach becomes more and more impractical due to the scale of today's networks and the accompanying steady decrease of the mean time between failures. Alternative methods of operating and maintaining these high-performance interconnects, both in terms of hardware- and software-management, are necessary to mitigate negative effects experienced by scientific applications executed on the supercomputer. However, existing topology-agnostic routing algorithms either suffer from poor load balancing or are not bounded in the number of virtual channels needed to resolve deadlocks in the routing tables. Using the fail-in-place strategy, a well-established method for storage systems to repair only critical component failures, is a feasible solution for current and future HPC interconnects as well as other large-scale installations such as data center networks. Although, an appropriate combination of topology and routing algorithm is required to minimize the throughput degradation for the entire system. This thesis contributes a network simulation toolchain to facilitate the process of finding a suitable combination, either during system design or while it is in operation. On top of this foundation, a key contribution is a novel scheduling-aware routing, which reduces fault-induced throughput degradation while improving overall network utilization. The scheduling-aware routing performs frequent property preserving routing updates to optimize the path balancing for simultaneously running batch jobs. The increased deployment of lossless interconnection networks, in conjunction with fail-in-place modes of operation and topology-agnostic, scheduling-aware routing algorithms, necessitates new solutions to solve the routing-deadlock problem. Therefore, this thesis further advances the state-of-the-art by introducing a novel concept of routing on the channel dependency graph, which allows the design of an universally applicable destination-based routing capable of optimizing the path balancing without exceeding a given number of virtual channels, which are a common hardware limitation. This disruptive innovation enables implicit deadlock-avoidance during path calculation, instead of solving both problems separately as all previous solutions.
APA, Harvard, Vancouver, ISO, and other styles
2

Lavén, Andreas. "Multi-Channel Anypath Routing for Multi-Channel Wireless Mesh Networks." Thesis, Karlstad University, Faculty of Economic Sciences, Communication and IT, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-5370.

Full text
Abstract:

Increasing capacity in wireless mesh networks can be achieved by using multiple channels and radios. By using different channels, two nodes can send packets at the same time without interfering with each other. To utilize diversity of available frequency, typically cards use channel-switching, which implies significant overhead in terms of delay. Assignment of which channels to use needs to be coupled with routing decisions as routing influences topology and traffic demands, which in turn impacts the channel assignment.

Routing algorithms for wireless mesh networks differ from routing algorithms that are used in wired networks. In wired networks, the number of hops is usually the only metric that matters. Wireless networks, on the other hand, must consider the quality of different links, as it is possible for a path with a larger amount of hops to be better than a path with fewer hops.

Typical routing protocols for wireless mesh networks such as Optimized Link State Routing (OLSR) use a single path to send packets from source to destination. This path is precomputed based on link state information received through control packets. The consideration of more information than hop-count in the routing process has shown to be beneficial as for example link quality and physical layer data rate determines the quality of the end-to-end path. In multi-channel mesh networks, also channel switching overhead and channel diversity need to be considered as a routing metric. However, a major drawback of current approaches is that a path is precomputed and used as long as the path is available and shows a good enough metric. As a result, short term variations on link quality or channel switching are not considered.

In this thesis, a new routing protocol is designed that provides a set of alternative forwarding candidates for each destination. To minimize delay (from both transmission and channel switching), a forwarding mechanism is developed to select one of the available forwarding candidates for each packet. The implementation was tested on an ARM based multi-radio platform, of which the results show that in a simple evaluation scenario the average delay was reduced by 22 % when compared to single path routing.

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

Chiu, Hon-sun, and 邵漢新. "Channel assignment and routing in multi-channel multi-interface wireless networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42182050.

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

Chiu, Hon-sun. "Channel assignment and routing in multi-channel multi-interface wireless networks." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B42182050.

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

McKay, Kristi Ann. "Hydraulic flood routing with minimal channel data." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq21190.pdf.

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

Islam, Taj-ul. "Channel routing : efficient solutions using neural networks /." Online version of thesis, 1993. http://hdl.handle.net/1850/11154.

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

Jackson, Crystal A. "Channel-access and routing protocols to utilize multiple heterogeneous channels for ad hoc networks." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1219849356/.

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

Roderick, Michael J. "Channel and switchbox routing using a greedy based channel algorithm with outward scanning technique." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/22939.

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

袁志勤 and Chi-kan Yuen. "A double-track greedy algorithm for VLSI channel routing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31220241.

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

Yuen, Chi-kan. "A double-track greedy algorithm for VLSI channel routing /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19656373.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Channel routing"

1

Multi-layer channel routing complexity and algorithms. Boca Raton, Fla: CRC Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zubow, A. Multi-channel opportunistic routing in multi-hop wireless networks. Berlin: Professoren des Institutes für Informatik, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Roderick, Michael J. Channel and switchbox routing using a greedy based channel algorithm with outward scanning technique. Monterey, Calif: Naval Postgraduate School, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Silver, Joshua M. A heuristic for two-layer channel routing with arbitrary overlap. Toronto: University of Toronto, Dept. of Computer Science, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Silver, Joshua M. A heuristic for two-layer channel routing with arbitrary overlap. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lindstadt, Gregory L. Comparison of linear and non-linear hydrologic flood routing models on four California rivers and relationship of model parameters to channel physical characteristics. Berkeley, Calif: Hydraulic Engineering Laboratory and Water Resources Center Archives, University of California, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sharon, Tucker, ed. Implementing routine and radical innovations. Lexington, Mass: Lexington Books, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Strategy, change, and defensive routines. Boston: Pitman, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Reform as routine: Organizational change and stability in the modern world. Oxford: Oxford University Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Akkoc, Hasan. A pro-active routing protocol for configuration of signaling channels in Server and Agent-based Active network Management (SAAM). Monterey, Calif: Naval Postgraduate School, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Channel routing"

1

Wong, D. F., H. W. Leong, and C. L. Liu. "Channel Routing." In The Kluwer International Series in Engineering and Computer Science, 73–97. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1677-0_4.

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

Wong, D. F., H. W. Leong, and C. L. Liu. "Permutation Channel Routing." In The Kluwer International Series in Engineering and Computer Science, 99–122. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1677-0_5.

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

Takefuji, Yoshiyasu. "Channel Routing Problems." In Neural Network Parallel Computing, 65–86. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3642-0_5.

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

Lodi, E., and F. P. Preparata. "A heuristic for channel routing." In Foundations of Data Organization and Algorithms, 155–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51295-0_125.

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

Lin, Xiao-Hui, Yu-Kwong Kwok, and Vincent K. N. Lau. "Channel-Adaptive Ad Hoc Routing." In Network Theory and Applications, 265–317. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4613-0223-0_8.

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

Savage, John E., and Markus G. Wloka. "A parallel algorithm for channel routing." In Graph-Theoretic Concepts in Computer Science, 288–303. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-50728-0_52.

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

Hong, Chuleui, Wonil Kim, and Yeongjoon Kim. "Distributed Channel Routing Using Genetic Algorithm." In Parallel and Distributed Computing: Applications and Technologies, 234–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30501-9_51.

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

Greenberg, Ronald I., Shih-Chuan Hung, and Jau-Der Shih. "Parallel algorithms for single-layer channel routing." In Algorithms and Computation, 456–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57568-5_277.

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

Hoenisch, Philipp, and Ingo Weber. "AODV–Based Routing for Payment Channel Networks." In Lecture Notes in Computer Science, 107–24. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94478-4_8.

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

Kwon, Jae Wan, and Eun Sok Kim. "Microfluidic Channel Routing with Protected Convex Corners." In Transducers ’01 Eurosensors XV, 644–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59497-7_153.

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

Conference papers on the topic "Channel routing"

1

Greene, Jonathan, Vwani Roychowdhury, Sinan Kaptanoglu, and Abbas El Gamal. "Segmented channel routing." In Conference proceedings. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/123186.123405.

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

Tai-Tsung Ho and S. S. Iyengar. "New results on channel routing." In [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design. IEEE, 1991. http://dx.doi.org/10.1109/isvd.1991.185113.

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

Condrat, Christopher, Priyank Kalla, and Steve Blair. "Channel routing for integrated optics." In 2013 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP). IEEE, 2013. http://dx.doi.org/10.1109/slip.2013.6681678.

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

Philips, Nicholas C. "Channel routing by constraint logic." In the 1992 ACM/SIGAPP Symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/143559.143684.

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

Gao, Shaodi, and Michael Kaufmann. "Channel routing of multiterminal nets." In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.13.

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

Pal, Achira, Tarak N. Mandal, Alak K. Datta, Debojit Kundu, and Rajat K. Pal. "Generation of random channel specifications for channel routing problem." In 2008 11th International Conference on Computer and Information Technology (ICCIT). IEEE, 2008. http://dx.doi.org/10.1109/iccitechn.2008.4803033.

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

Jeesoo Lee and Yookun Cho. "HVH. . .VH multi-layer channel routing." In [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design. IEEE, 1991. http://dx.doi.org/10.1109/isvd.1991.185130.

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

Pao-Hsu Shih and Wu-Shung Feng. "A neural network for channel routing." In [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design. IEEE, 1991. http://dx.doi.org/10.1109/isvd.1991.185131.

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

Enbody, R. J., and H. C. Du. "Near-Optimal n-Layer Channel Routing." In 23rd ACM/IEEE Design Automation Conference. IEEE, 1986. http://dx.doi.org/10.1109/dac.1986.1586168.

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

Vakil, D., and M. R. Zargham. "An expert system for channel routing." In the first international conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/55674.55721.

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

Reports on the topic "Channel routing"

1

DeSanti, C., K. McCloghrie, S. Kode, and S. Gai. Fibre Channel Routing Information MIB. RFC Editor, September 2006. http://dx.doi.org/10.17487/rfc4625.

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

Leighton, Tom. A 2d - 1 Lower Bound 2-Layer Knock-Knee Channel Routing. Fort Belvoir, VA: Defense Technical Information Center, May 1989. http://dx.doi.org/10.21236/ada211948.

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

Wu, Fan, Vijay Raman, and Nitin Vaidya. A Channel Assignment Algorithm for Opportunistic Routing in Multichannel, Multi-Radio Wireless Mesh Networks. Fort Belvoir, VA: Defense Technical Information Center, November 2010. http://dx.doi.org/10.21236/ada555031.

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

Stevens, James A. Spatial Reuse through Dynamic Power and Routing Control in Common-Channel Random-Access Packet Radio Networks. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada197898.

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

Hershbein, Brad, and Lisa Kahn. Do Recessions Accelerate Routine-Biased Technological Change? Evidence from Vacancy Postings. Cambridge, MA: National Bureau of Economic Research, October 2016. http://dx.doi.org/10.3386/w22762.

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

Jaimovich, Nir, and Henry Siu. High-Skilled Immigration, STEM Employment, and Non-Routine-Biased Technical Change. Cambridge, MA: National Bureau of Economic Research, February 2017. http://dx.doi.org/10.3386/w23185.

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

Hershbein, Brad, and Lisa B. Kahn. Do Recessions Accelerate Routine-Biased Technological Change? Evidence from Vacancy Postings. W.E. Upjohn Institute, March 2016. http://dx.doi.org/10.17848/wp16-254.

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

Blundell, S. Micro-terrain and canopy feature extraction by breakline and differencing analysis of gridded elevation models : identifying terrain model discontinuities with application to off-road mobility modeling. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40185.

Full text
Abstract:
Elevation models derived from high-resolution airborne lidar scanners provide an added dimension for identification and extraction of micro-terrain features characterized by topographic discontinuities or breaklines. Gridded digital surface models created from first-return lidar pulses are often combined with lidar-derived bare-earth models to extract vegetation features by model differencing. However, vegetative canopy can also be extracted from the digital surface model alone through breakline analysis by taking advantage of the fine-scale changes in slope that are detectable in high-resolution elevation models of canopy. The identification and mapping of canopy cover and micro-terrain features in areas of sparse vegetation is demonstrated with an elevation model for a region of western Montana, using algorithms for breaklines, elevation differencing, slope, terrain ruggedness, and breakline gradient direction. These algorithms were created at the U.S. Army Engineer Research Center – Geospatial Research Laboratory (ERDC-GRL) and can be accessed through an in-house tool constructed in the ENVI/IDL environment. After breakline processing, products from these algorithms are brought into a Geographic Information System as analytical layers and applied to a mobility routing model, demonstrating the effect of breaklines as obstacles in the calculation of optimal, off-road routes. Elevation model breakline analysis can serve as significant added value to micro-terrain feature and canopy mapping, obstacle identification, and route planning.
APA, Harvard, Vancouver, ISO, and other styles
9

Piper, Benjamin, Yasmin Sitabkhan, Jessica Mejia, and Kellie Betts. Effectiveness of Teachers’ Guides in the Global South: Scripting, Learning Outcomes, and Classroom Utilization. RTI Press, May 2018. http://dx.doi.org/10.3768/rtipress.2018.op.0053.1805.

Full text
Abstract:
This report presents the results of RTI International Education’s study on teachers' guides across 13 countries and 19 projects. Using quantitative and qualitative methods, we examine how teachers’ guides across the projects differ and find substantial variation in the design and structure of the documents. We develop a scripting index so that the scripting levels of the guides can be compared across projects. The impact results of the programs that use teachers’ guides show significant impacts on learning outcomes, associated with approximately an additional half year of learning, showing that structured teachers’ guides contribute to improved learning outcomes. During observations, we find that teachers make a variety of changes in their classroom instruction from how the guides are written, showing that the utilization of structured teachers’ guides do not create robotic teachers unable to use their own professional skills to teach children. Unfortunately, many changes that teachers make reduce the amount of group work and interactivity that was described in the guides, suggesting that programs should encourage teachers to more heavily utilize the instructional routines designed in the guide. The report includes a set of research-based guidelines that material developers can use to develop teachers’ guides that will support effective instructional practices and help improve learning outcomes. The key takeaway from the report is that structured teachers' guides improve learning outcomes, but that overly scripted teachers' guides are somewhat less effective than simplified teachers' guides that give specific guidance to the teacher but are not written word for word for each lesson in the guide.
APA, Harvard, Vancouver, ISO, and other styles
10

Bano, Masooda, and Zeena Oberoi. Embedding Innovation in State Systems: Lessons from Pratham in India. Research on Improving Systems of Education (RISE), December 2020. http://dx.doi.org/10.35489/bsg-rise-wp_2020/058.

Full text
Abstract:
The learning crisis in many developing countries has led to searches for innovative teaching models. Adoption of innovation, however, disrupts routine and breaks institutional inertia, requiring government employees to change their way of working. Introducing and embedding innovative methods for improving learning outcomes within state institutions is thus a major challenge. For NGO-led innovation to have largescale impact, we need to understand: (1) what factors facilitate its adoption by senior bureaucracy and political elites; and (2) how to incentivise district-level field staff and school principals and teachers, who have to change their ways of working, to implement the innovation? This paper presents an ethnographic study of Pratham, one of the most influential NGOs in the domain of education in India today, which has attracted growing attention for introducing an innovative teaching methodology— Teaching at the Right Level (TaRL) – with evidence of improved learning outcomes among primary-school students and adoption by a number of states in India. The case study suggests that while a combination of factors, including evidence of success, ease of method, the presence of a committed bureaucrat, and political opportunity are key to state adoption of an innovation, exposure to ground realities, hand holding and confidence building, informal interactions, provision of new teaching resources, and using existing lines of communication are core to ensuring the co-operation of those responsible for actual implementation. The Pratham case, however, also confirms existing concerns that even when NGO-led innovations are successfully implemented at a large scale, their replication across the state and their sustainability remain a challenge. Embedding good practice takes time; the political commitment leading to adoption of an innovation is often, however, tied to an immediate political opportunity being exploited by the political elites. Thus, when political opportunity rather than a genuine political will creates space for adoption of an innovation, state support for that innovation fades away before the new ways of working can replace the old habits. In contexts where states lack political will to improve learning outcomes, NGOs can only hope to make systematic change in state systems if, as in the case of Pratham, they operate as semi-social movements with large cadres of volunteers. The network of volunteers enables them to slow down and pick up again in response to changing political contexts, instead of quitting when state actors withdraw. Involving the community itself does not automatically lead to greater political accountability. Time-bound donor-funded NGO projects aiming to introduce innovation, however large in scale, simply cannot succeed in bringing about systematic change, because embedding change in state institutions lacking political will requires years of sustained engagement.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Channel routing' for particular source types:
Journal articles Dissertations / Theses Books
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