Добірка наукової літератури з теми "Flood routing Computer programs"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Flood routing Computer programs".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Flood routing Computer programs"

1

Thandaveswara, B. S., and N. Sajikumar. "Flood Routing Using Spreadsheet." Computer-Aided Civil and Infrastructure Engineering 6, no. 2 (November 6, 2008): 161–72. http://dx.doi.org/10.1111/j.1467-8667.1991.tb00185.x.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Karahan, Halil. "Predicting Muskingum flood routing parameters using spreadsheets." Computer Applications in Engineering Education 20, no. 2 (December 28, 2009): 280–86. http://dx.doi.org/10.1002/cae.20394.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Pung, HK. "Simulation study of a flood routing technique for mesh-like LANs." Computer Communications 13, no. 6 (July 1990): 354–64. http://dx.doi.org/10.1016/0140-3664(90)90058-o.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kiczko, A., R. J. Romanowicz, M. Osuch, and E. Karamuz. "Maximizing the usefulness of flood risk assessment for the River Vistula in Warsaw." Natural Hazards and Earth System Sciences Discussions 1, no. 3 (June 13, 2013): 2695–730. http://dx.doi.org/10.5194/nhessd-1-2695-2013.

Повний текст джерела
Анотація:
Abstract. The derivation of flood risk maps requires an estimation of maximum inundation extent for a flood with a given return period, e.g. 100 or 500 yr. The results of numerical simulations of flood wave propagation are used to overcome the lack of relevant observations. In practice, deterministic 1-D models are used for flow routing, giving a simplified image of flood wave propagation. The solution of a 1-D model depends on the initial and boundary conditions and estimates of model parameters which are usually identified using the inverse problem based on the available noisy observations. Therefore, there is a large uncertainty involved in the derivation of flood risk maps. Bayesian conditioning based on multiple model simulations can be used to quantify this uncertainty; however, it is too computer-time demanding to be applied in flood risk assessment in practice, without further flow routing model simplifications. In order to speed up the computation times the assumption of a gradually varied flow and the application of a steady state flow routing model may be introduced. The aim of this work is an analysis of the influence of those simplifying model assumptions and uncertainty of observations and modelling errors on flood inundation mapping and a quantitative comparison with deterministic flood extent maps. Apart from the uncertainty related to the model structure and its parameters, the uncertainty of the estimated flood wave with a specified probability of return period (so-called 1-in-10 yr, or 1-in-100 yr flood) is also taken into account. In order to derive the uncertainty of inundation extent conditioned on the design flood wave, the probabilities related to the design wave and flow model uncertainties are integrated. In the present paper we take into account the dependence of roughness coefficients on discharge. The roughness is parameterised based on the available observed historical flood waves. The approach presented allows for the relationship between flood extent and flow values to be derived thus giving a cumulative assessment of flood risk. The methods are illustrated using the Warsaw reach of the River Vistula as a case study. The results indicate that the uncertainties have a substantial influence on flood risk assessment.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Liu, Si, Degan Zhang, Xiaohuan Liu, Ting Zhang, and Hao Wu. "Adaptive repair algorithm for TORA routing protocol based on flood control strategy." Computer Communications 151 (February 2020): 437–48. http://dx.doi.org/10.1016/j.comcom.2020.01.024.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Pung, HK. "Comparative performance study of flood routing LANs and a CSMA-CD bus." Computer Communications 14, no. 5 (June 1991): 298–304. http://dx.doi.org/10.1016/0140-3664(91)90005-l.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Abebe, A. J., and Roland K. Price. "Information Theory and Neural Networks for Managing Uncertainty in Flood Routing." Journal of Computing in Civil Engineering 18, no. 4 (October 2004): 373–80. http://dx.doi.org/10.1061/(asce)0887-3801(2004)18:4(373).

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Alansari, Zainab, Nor Badrul Anuar, Amirrudin Kamsin, and Mohammad Riyaz Belgaum. "A systematic review of routing attacks detection in wireless sensor networks." PeerJ Computer Science 8 (October 21, 2022): e1135. http://dx.doi.org/10.7717/peerj-cs.1135.

Повний текст джерела
Анотація:
Wireless sensor networks (WSNs) consist of hundreds, or thousands of sensor nodes distributed over a wide area and used as the Internet of Things (IoT) devices to benefit many home users and autonomous systems industries. With many users adopting WSN-based IoT technology, ensuring that the sensor’s information is protected from attacks is essential. Many attacks interrupt WSNs, such as Quality of Service (QoS) attacks, malicious nodes, and routing attacks. To combat these attacks, especially on the routing attacks, we need to detect the attacker nodes and prevent them from any access to WSN. Although some survey studies on routing attacks have been published, a lack of systematic studies on detecting WSN routing attacks can be seen in the literature. This study enhances the topic with a taxonomy of current and emerging detection techniques for routing attacks in wireless sensor networks to improve QoS. This article uses a PRISMA flow diagram for a systematic review of 87 articles from 2016 to 2022 based on eight routing attacks: wormhole, sybil, Grayhole/selective forwarding, blackhole, sinkhole, replay, spoofing, and hello flood attacks. The review also includes an evaluation of the metrics and criteria used to evaluate performance. Researchers can use this article to fill in any information gaps within the WSN routing attack detection domain.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Karahan, Halil, Gurhan Gurarslan, and Zong Woo Geem. "A new nonlinear Muskingum flood routing model incorporating lateral flow." Engineering Optimization 47, no. 6 (May 20, 2014): 737–49. http://dx.doi.org/10.1080/0305215x.2014.918115.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Sil, Briti Sundar, Angana Borah, Shubrajyoti Deb, and Biplab Das. "DEVELOPMENT OF RIVER FLOOD ROUTING MODEL USING NON-LINEAR MUSKINGUM EQUATION AND EXCEL TOOL 'GANetXL'." Journal of Urban and Environmental Engineering 10, no. 2 (April 28, 2017): 214–20. http://dx.doi.org/10.4090/juee.2016.v10n2.214-220.

Повний текст джерела
Анотація:
Flood routing is of utmost importance to water resources engineers and hydrologist. Muskingum model is one of the popular methods for river flood routing which often require a huge computational work. To solve the routing parameters, most of the established methods require knowledge about different computer programmes and sophisticated models. So, it is beneficial to have a tool which is comfortable to users having more knowledge about everyday decision making problems rather than the development of computational models as the programmes. The use of micro-soft excel and its relevant tool like solver by the practicing engineers for normal modeling tasks has become common over the last few decades. In excel environment, tools are based on graphical user interface which are very comfortable for the users for handling database, modeling, data analysis and programming. GANetXL is an add-in for Microsoft Excel, a leading commercial spreadsheet application for Windows and MAC operating systems. GANetXL is a program that uses a Genetic Algorithm to solve a wide range of single and multi-objective problems. In this study, non-linear Muskingum routing parameters are solved using GANetXL. Statistical Model performances are compared with the earlier results and found satisfactory.
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Flood routing Computer programs"

1

Pung, H. K. "Flood routing techniques for fibre optic local area networks with arbitrartopology." Thesis, University of Kent, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.332715.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Harvesf, Cyrus Mehrabaun. "The design and implementation of a robust, cost-conscious peer-to-peer lookup service." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26559.

Повний текст джерела
Анотація:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Blough, Douglas; Committee Member: Liu, Ling; Committee Member: Owen, Henry; Committee Member: Riley, George; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Brownell, Dorie Lynn. "Application of a Geographical Information System to Estimate the Magnitude and Frequency of Floods in the Sandy and Clackamas River Basins, Oregon." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/4877.

Повний текст джерела
Анотація:
A geographical information system (GIS) was used to develop a regression model designed to predict flood magnitudes in the Sandy and Clackamas river basins in Oregon. Manual methods of data assembly, input, storage, manipulation and analysis traditionally used to estimate basin characteristics were replaced with automated techniques using GIS-based computer hardware and software components. Separate GIS data layers representing (1) stream gage locations, (2) drainage basin boundaries, (3) hydrography, (4) water bodies, (5) precipitation, (6) landuse/land cover, (7) elevation and (8) soils were created and stored in a GIS data base. Several GIS computer programs were written to automate the spatial analysis process needed in the estimation of basin characteristic values using the various GIS data layers. Twelve basin characteristic data parameters were computed and used as independent variables in the regression model. Streamflow data from 19 gaged sites in the Sandy and Clackamas basins were used in a log Pearson Type III analysis to define flood magnitudes at 2-, 5-, 10-, 25-, 50- and 100-year recurrence intervals. Flood magnitudes were used as dependent variables and regressed against different sets of basin characteristics (independent variables) to determine the most significant independent variables used to explain peak discharge. Drainage area, average annual precipitation and percent area above 5000 feet proved to be the most significant explanatory variables for defining peak discharge characteristics in the Sandy and Clackamas river basins. The study demonstrated that a GIS can be successfully applied in the development of basin characteristics for a flood frequency analysis and can achieve the same level of accuracy as manual methods. Use of GIS technology reduced the time and cost associated with manual methods and allowed for more in-depth development and calibration of the regression model. With the development of GIS data layers and the use of GIS-based computer programs to automate the calculation of explanatory variables, regression equations can be developed and applied more quickly and easily. GIS proved to be ideally suited for flood frequency modeling applications by providing advanced computerized techniques for spatial analysis and data base management.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sarpong, Boadu Mensah. "Column generation for bi-objective integer linear programs : application to bi-objective vehicle routing problems." Phd thesis, INSA de Toulouse, 2013. http://tel.archives-ouvertes.fr/tel-00919861.

Повний текст джерела
Анотація:
L'optimisation multi-objectif concerne la résolution de problèmes pour lesquels plusieurs objectifs (ou critères) contradictoires sont pris en compte. Contrairement aux problèmes d'optimisation ayant un seul objectif, un problème multi-objectif ne possède pas une valeur optimale unique mais plutôt un ensemble de points appelés "ensemble non dominé". Les bornes inférieures et supérieures d'un problème multi-objectif peuvent être également décrites par des ensembles. Dans la pratique, les variables utilisées en optimisation multiobjectif représentent souvent des objets non fractionnables et on parle alors de problèmes multi-objectif en nombres entiers. Afin d'obtenir de meilleures bornes qui peuvent être utilisées dans la conception de méthodes exactes, certains problèmes sont formulés avec un nombre exponentiel de variables de décision et ces problèmes sont résolus par la méthode de génération de colonnes. Les travaux de cette thèse visent à contribuer à l'étude de l'utilisation de la génération de colonnes en programmation linéaires en nombres entiers multi-objectif. Pour cela nous étudions un problème de tournées de véhicules bi-objectif qui peut être considéré comme une généralisation de plusieurs autres problèmes de tournées de véhicules. Nous proposons des formulations mathématiques pour ce problème et des techniques pour accélérer le calcul des bornes inférieures par génération de colonnes. Les sous-problèmes qui doivent être résolus pour le calcul des bornes inférieures ont une structure similaire. Nous exploitons cette caractéristique pour traiter simultanément certains sous-problèmes plutôt qu'indépendamment.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Seo, Chung-Seok. "Physical Design of Optoelectronic System-on-a-Chip/Package Using Electrical and Optical Interconnects: CAD Tools and Algorithms." Diss., Available online, Georgia Institute of Technology, 2005, 2004. http://etd.gatech.edu/theses/available/etd-11102004-150844/.

Повний текст джерела
Анотація:
Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2005.
David E. Schimmel, Committee Member ; C.P. Wong, Committee Member ; John A. Buck, Committee Member ; Abhijit Chatterjee, Committee Chair ; Madhavan Swaminathan, Committee Member. Vita. Includes bibliographical references.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Pillay, Maldean. "Gabor filter parameter optimization for multi-textured images : a case study on water body extraction from satellite imagery." Thesis, 2012. http://hdl.handle.net/10413/11070.

Повний текст джерела
Анотація:
The analysis and identification of texture is a key area in image processing and computer vision. One of the most prominent texture analysis algorithms is the Gabor Filter. These filters are used by convolving an image with a family of self similar filters or wavelets through the selection of a suitable number of scales and orientations, which are responsible for aiding in the identification of textures of differing coarseness and directions respectively. While extensively used in a variety of applications, including, biometrics such as iris and facial recognition, their effectiveness depend largely on the manual selection of different parameters values, i.e. the centre frequency, the number of scales and orientations, and the standard deviations. Previous studies have been conducted on how to determine optimal values. However the results are sometimes inconsistent and even contradictory. Furthermore, the selection of the mask size and tile size used in the convolution process has received little attention, presumably since they are image set dependent. This research attempts to verify specific claims made in previous studies about the influence of the number of scales and orientations, but also to investigate the variation of the filter mask size and tile size for water body extraction from satellite imagery. Optical satellite imagery may contain texture samples that are conceptually the same (belong to the same class), but are structurally different or differ due to changes in illumination, i.e. a texture may appear completely different when the intensity or position of a light source changes. A systematic testing of the effects of varying the parameter values on optical satellite imagery is conducted. Experiments are designed to verify claims made about the influence of varying the scales and orientations within predetermined ranges, but also to show the considerable changes in classification accuracy when varying the filter mask and tile size. Heuristic techniques such as Genetic Algorithms (GA) can be used to find optimum solutions in application domains where an enumeration approach is not feasible. Hence, the effectiveness of a GA to automate the process of determining optimum Gabor filter parameter values for a given image dataset is also investigated. The results of the research can be used to facilitate the selection of Gabor filter parameters for applications that involve multi-textured image segmentation or classification, and specifically to guide the selection of appropriate filter mask and tile sizes for automated analysis of satellite imagery.
Thesis (M.Sc.)-University of KwaZulu-Natal, Durban, 2012.
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Flood routing Computer programs"

1

Don, Slice, and Retana Alvaro CCIE, eds. Optimal routing design. Indianapolis, Ind: Cisco Press, 2005.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Flood forecasting using artificial neural networks. Lisse, Netherlands: Balkema, 2003.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Prettenthaler, Franz, and Hansjörg Albrecher. Hochwasserrisiko und dessen Versicherung in Österreich: Evaluierung und ökonomische Analyse des von der Versicherungswirtschaft vorgeschlagenen Modells NatKat. Wien: Verlag der österreichischen Akademie der Wissenschaften, 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Jones, Perry M. Characterization of rainfall-runoff response and estimation of the effect of wetland restoration on runoff, Heron Lake basin, southwestern Minnesota, 1991-97. Mounds View, Minn: U.S. Dept. of the Interior, U.S. Geological Survey, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Flynn, Kathleen M. User's manual for Program PeakFQ, annual flood-frequency analysis using Bulletin 17B guidelines. Reston, Va: U.S. Dept. of the Interior, U.S. Geological Survey, 2006.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Haruyama, Shigeko. Hydro GIS: theory and lessons from the Vietnamese delta. Hauppauge, N.Y: Nova Science Publishers, Inc., 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Haruyama, Shigeko. Hydro GIS: Theory and lessons from the Vietnamese delta. New York: Nova Science Publishers, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Hydro GIS: theory and lessons from the Vietnamese delta. Hauppauge, N.Y: Nova Science Publishers, Inc., 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zsuffa, István. Reservoir sizing by transition probabilities: Theory, methodology, application. Littleton, Colo., USA: Water Resources Publications, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

White, Russ, Alvaro Retana, and Don Slice. Optimal Routing Design. Cisco Press, 2005.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Flood routing Computer programs"

1

Weik, Martin H. "flood routing." In Computer Science and Communications Dictionary, 622. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_7334.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Weik, Martin H. "flood-search routing." In Computer Science and Communications Dictionary, 623. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_7335.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Price, Roland K. "Flood Routing Models." In Computer Modeling of Free-Surface and Pressurized Flows, 375–407. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-0964-2_13.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Diche, Zarah Jean, Cinmayii Manliguez, Maria Jezebel Jimenez, Maureen Agrazamendez, and Joseph Acosta. "Optimal Evacuation Routing Using LiDAR-Based Flood Models." In Communications in Computer and Information Science, 141–52. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-06010-7_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ruiz-Andino, Alvaro, and José J. Ruz. "Integration of constraint programming and evolution programs: Application to channel routing." In Lecture Notes in Computer Science, 448–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-64582-9_775.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Sánchez, Rebeca, Patricia Suárez, Akemi Gálvez, and Andrés Iglesias. "Swarm Intelligence Approach for Parametric Learning of a Nonlinear River Flood Routing Model." In Communications in Computer and Information Science, 276–86. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24299-2_24.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Sánchez, Rebeca, Patricia Suárez, Akemi Gálvez, and Andrés Iglesias. "Parameter Estimation of a Nonlinear Hydrologic Model for Channel Flood Routing with the Bat Algorithm." In Lecture Notes in Computer Science, 341–51. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26369-0_32.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Sobh, Tarek, and Heba Z. El-Fiqi. "Early Worm Detection for Minimizing Damage in E-Service Networks." In Handbook of Research on E-Services in the Public Sector, 336–58. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-61520-789-3.ch027.

Повний текст джерела
Анотація:
One of the most powerful weapons for attackers is the Internet worm. Specifically, a worm attacks vulnerable computer systems and employs self-propagating methods to flood the Internet rapidly. Since a “Worm” is self-propagated through the connected network, it doesn’t need human interaction or file transmission to replicate itself. It spreads in minutes; Slammer worms infect about 75,000 nodes through the internet in about 10 minutes. Since most of antivirus programs detect viruses based on their signature, then this approach can’t detect new viruses or worms till being updated with their signature, which can’t be known unless some systems had already been infected. This highlights worms are still on the top of malware threats attacking computer systems, although the evolution of worms detection techniques. Early detection of unknown worms is still a problem. This chapter produce a method for detecting unknown worms based on local victim information. The proposed system uses Artificial Neural Network (ANN) for classifying worm/ nonworm traffic and predicting the percentage of infection in the infected network. This prediction can be used to support decision making processes for network administrators to respond quickly to worm propagation in an accurate procedure.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Koza, John R. "Human-Competitive Machine Intelligence by Means of Genetic Algorithms." In Perspectives on Adaptation in Natural and Artificial Systems. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195162929.003.0007.

Повний текст джерела
Анотація:
The subtitle of John Holland's pioneering 1975 book Adaptation in Natural and Artificial Systems correctly anticipated that the genetic algorithm described in that book would have "applications to.. .artificial intelligence." When the entities in the evolving population are computer programs, Holland's genetic algorithm can be used to perform the task of searching the space of computer programs for a program that solves, or approximately solves, a problem. This variation of the genetic algorithm (called genetic programming) enables the genetic algorithm to address the long-standing challenge of getting a computer to solve a problem without explicitly programming it. Specifically, this challenge calls for an automatic system whose input is a high-level statement of a problem's requirements and whose output is a satisfactory solution to the given problem. Paraphrasing Arthur Samuel [33], this challenge concerns "How can computers be made to do what needs to be done, without being told exactly how to do it?" This challenge is the common goal of such fields of research as artificial intelligence and machine learning. Arthur Samuel [32] offered one measure for success in this pursuit, namely "The aim [is].. .to get machines to exhibit behavior, which if done by humans, would be assumed to involve the use of intelligence." Since a problem can generally be recast as a search for a computer program, genetic programming can potentially solve a wide range of problems, including problems of control, classification, system identification, and design. Section 2 describes genetic programming. Section 3 states what we mean when we say that an automatically created solution to a problem is competitive with the product of human creativity. Section 4 discusses the illustrative problem of automatically synthesizing both the topology and sizing for an analog electrical circuit. Section 5 discusses the problem of automatically determining the placement and routing (while simultaneously synthesizing the topology and sizing) of an electrical circuit. Section 6 discusses the problem of automatically synthesizing both the topology and tuning for a controller. Section 7 discusses the importance of illogic in achieving creativity and inventiveness.
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Flood routing Computer programs"

1

Vakulya, Gargely, and Gyula Simony. "Energy efficient percolation-driven flood routing for large-scale sensor networks." In 2008 International Multiconference on Computer Science and Information Technology (IMCSIT). IEEE, 2008. http://dx.doi.org/10.1109/imcsit.2008.4747345.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Li, Yuping, Liwu Pan, Ting Liu, and Chunxia Wei. "Three-dimensional GIS based dynamic visualization simulation system for flood routing." In 2012 2nd International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2012. http://dx.doi.org/10.1109/iccsnt.2012.6526184.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Khawsaard, Nuttida, and Chaiyachet Saivichit. "Path-reputation based technique in reactive AODV Ad Hoc sensor networks routing for flood warning application." In 2013 International Computer Science and Engineering Conference (ICSEC). IEEE, 2013. http://dx.doi.org/10.1109/icsec.2013.6694790.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Fletcher, C. A., J. M. Ritchie, and T. Lim. "The Generation of Machining Process Plans Using a Haptic Virtual Reality System." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70245.

Повний текст джерела
Анотація:
Computer Aided Process Planning (CAPP) links the design and manufacture of a machined product defining how the product itself will be manufactured. Decisions made during this phase can have a significant impact on product cost, quality and build time; therefore, it is important that process planners have intuitive tools to aid them in effectively creating process plans. However, in spite of being a strong research area, the actual application of CAPP systems in industry is limited and new modern 3D digital tools in this area have not been researched to any real degree. Traditional process planning is carried out either manually or via a CAPP interface and, from this activity, a set of instructions are generated for the shop floor. However, these CAPP processes can be time consuming and subject to inconsistencies. Current research seeks to automate the generation of work instructions by using previous designs and/or artificial intelligence. However, due to the complexity of manufacturing a wide range of products, the limited range of tools available and differing skills of the workforce, it is difficult to reach a generic solution for practical application. The novel pilot study given in this paper presents one of the first pieces of research comparing and contrasting a traditional manual approach to machined part process planning with an alternative haptic virtual environment. Within this, an operator can simulate the machining of a simple part using a virtual drilling and milling process via a haptic routing interface. All of the operator input is logged in the background with the system automatically generating shop floor instructions from this log file. Findings show that users found the virtual system to be more intuitive and required less mental workload than traditional manual methods. Also their perceptions for the future were that they would need less support for learning and would progress to final planning solutions more quickly.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Mao, Min-liang, Lian Li, and Shuai Zhao. "Notice of Retraction: Research on the Performance of Flood Routing in High-Speed Mobile Ad Hoc Networks." In 2010 2nd International Conference on Information Engineering and Computer Science (ICIECS). IEEE, 2010. http://dx.doi.org/10.1109/iciecs.2010.5678326.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Ranaee, Ehsan, Mohammad Mahmoodian Shoushtari, and Saeed Rahati Quchani. "The Combination of HEC-Geo-HMS, HEC-HMS and MIKE11 Software Utilize in a Two Branches River Flood Routing Modeling." In 2009 Second International Conference on Environmental and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/icecs.2009.62.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Chipperfield, Kurt A., and Judy M. Vance. "VRHose — Virtual Hydraulic Hose Routing Design." In ASME 1999 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/imece1999-0160.

Повний текст джерела
Анотація:
Abstract Hydraulic hoses, which are used to transport high pressure hydraulic fluid, are key components in many large industrial vehicles. In the design of an industrial vehicle, designers must allow sufficient space for hydraulic hoses to pass through the vehicle. Because these hoses are typically stiff and do not bend easily, planning the routing of the hoses around components in the vehicle is challenging. Currently designers use CAD programs to design vehicles and rely on past experience to plan hose routes and allow sufficient space for the hoses in a new vehicle. Later, during the prototype build, the actual hoses are fit and cut to length to determine exact specifications. This paper describes the program VRHose which provides the designer with a three-dimensional interface to aid in planning hose paths. VRHose allows designers to lay out hose routes through the vehicle by defining points in space which constrain the hose path. Virtual reality (VR) is used as the human-computer interface to provide three-dimensional viewing and interaction with the digital models. The initial development of VRHose has concentrated on providing the user with a three-dimensional input and evaluation tool to lay out hose routings. Future versions of VRHose will include hose material properties which will constrain the hose paths to those which are feasible.
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії