نتائج البحث - "数学规划"

Relation: Brockwell, P. J., Brockwell, P. J., Davis, R. A., & Davis, R. A. (2016). Introduction to time series and forecasting. Springer.\nChatfield, C. (1993). Calculating interval forecasts. Journal of Business & Economic Statistics, 11(2), 121-135.\nClemen, R. T. (1989). Combining forecasts: A review and annotated bibliography. International Journal of Forecasting, 5(4), 559-583.\nElliott, G. (2011). Averaging and the optimal combination of forecasts.\nGaba, A., Tsetlin, I., & Winkler, R. L. (2017). Combining interval forecasts. Decision Analysis, 14(1), 1-20.\nGardner Jr, E. S., & McKenzie, E. (1985). Forecasting trends in time series. Management Science, 31(10), 1237-1246.\nGrushka-Cockayne, Y., & Jose, V. R. R. (2020). Combining prediction intervals in the m4 competition. International Journal of Forecasting, 36(1), 178-185.\nGrushka-Cockayne, Y., Jose, V. R. R., & Lichtendahl Jr, K. C. (2017). Ensembles of overfit and overconfident forecasts. Management Science, 63(4), 1110-1130.\nGuo, X., Lichtendahl, K. C., & Grushka-Cockayne, Y. (2019). An Exponential Smoothing Model with a Life Cycle Trend.\nHaran, U., & Moore, D. A. (2014). A better way to forecast. California Management Review, 57(1), 5-15.\nHolt, C. C. (2004). Forecasting seasonals and trends by exponentially weighted moving averages. International Journal of Forecasting, 20(1), 5-10.\nHora, S. C. (2004). Probability judgments for continuous quantities: Linear combinations and calibration. Management Science, 50(5), 597-604.\nHyndman, R., Koehler, A. B., Ord, J. K., & Snyder, R. D. (2008). Forecasting with Exponential Smoothing: the State space approach. Springer Science & Business Media.\nHyndman, R. J., & Khandakar, Y. (2008). Automatic time series forecasting: the forecast package for R. Journal of Statistical Software, 27(1), 1-22.\nKumar, S., & Srivastava, A. (2012). Bootstrap prediction intervals in non-parametric regression with applications to anomaly detection. Proc. 18th ACM SIGKDD Conf. Knowl. Discovery Data Mining,\nLee, Y. S., & Scholtes, S. (2014). Empirical prediction intervals revisited. International Journal of Forecasting, 30(2), 217-234.\nLi, G., Wu, D. C., Zhou, M., & Liu, A. (2019). The combination of interval forecasts in tourism. Annals of Tourism Research, 75, 363-378.\nLichtendahl Jr, K. C., Grushka-Cockayne, Y., & Winkler, R. L. (2013). Is it better to average probabilities or quantiles? Management Science, 59(7), 1594-1611.\nMakridakis, S., & Winkler, R. L. (1989). Sampling distributions of post‐sample forecasting errors. Journal of the Royal Statistical Society: Series C (Applied Statistics), 38(2), 331-342.\nManary, M. P., & Willems, S. P. (2021). Data Set: 187 Weeks of Customer Forecasts and Orders for Microprocessors from Intel Corporation. Manufacturing & Service Operations Management, forthcoming.\nMatsypura, D., Thompson, R., & Vasnev, A. L. (2018). Optimal selection of expert forecasts with integer programming. Omega, 78, 165-175.\nPark, S., & Budescu, D. V. (2015). Aggregating multiple probability intervals to improve calibration. Judgment and Decision Making, 10(2), 130.\nTong, H. (2012). Threshold models in non-linear time series analysis (Vol. 21). Springer Science & Business Media.\nVinod, H. D., & López-de-Lacalle, J. (2009). Maximum entropy bootstrap for time series: the meboot R package. Journal of statistical software, 29(1), 1-19.\nZivot, E., & Wang, J. (2007). Modeling financial time series with S-Plus® (Vol. 191). Springer Science & Business Media.; G0108356003; https://nccur.lib.nccu.edu.tw//handle/140.119/136338; https://nccur.lib.nccu.edu.tw/bitstream/140.119/136338/1/600301.pdf

الاتاحة: https://nccur.lib.nccu.edu.tw//handle/140.119/136338
https://doi.org/10.6814/NCCU202101054
https://nccur.lib.nccu.edu.tw/bitstream/140.119/136338/1/600301.pdf

View record in BASE

8

Academic Journal

以既有道路網布設都市綠廊道網絡之規劃模式 ; Planning Urban Greenways Along Existing Road Network

المؤلفون: 羅健文, 林楨家, Lo, Chien-Wen, Lin, Jen-Jia

مصطلحات موضوعية: 綠廊道網絡, 分析階層程序法, 0-1多目標數學規劃, 一階演算法, Greenway Network, Analytie Hierarchy Process, 0-1 Multi-objective Programming, One-stage Algorithm, archi, geo

Relation: http://nccur.lib.nccu.edu.tw/bitstream/140.119/100385/1/12(1)-83-123.pdf; http://nccur.lib.nccu.edu.tw//handle/140.119/100385

الاتاحة: http://nccur.lib.nccu.edu.tw/bitstream/140.119/100385/1/12(1)-83-123.pdf
http://nccur.lib.nccu.edu.tw//handle/140.119/100385

View record in BASE

9

Academic Journal

地域連攜規劃模式之設計與應用－臺灣東部區域之實例分析 ; Design and Application of A Planning Model for Regional Cooperation: A Case Study of Eastern Taiwan Region

المؤلفون: 林楨家, Lin, Jen-Jia

مصطلحات موضوعية: 地域連攜, 多準則評估, 數學規劃, 灰色理論, 區域規劃, Regional Cooperation, Multiple Criteria Evaluation, Mathematical Programming, Grey Theory, Regional Planning

وصف الملف: 4431733 bytes; application/pdf

Relation: 臺灣土地研究, 11(2), 61-104; Journal of Taiwan land research; http://nccur.lib.nccu.edu.tw//handle/140.119/100380; http://nccur.lib.nccu.edu.tw/bitstream/140.119/100380/1/11(2)-61-104.pdf

الاتاحة: http://nccur.lib.nccu.edu.tw//handle/140.119/100380
http://nccur.lib.nccu.edu.tw/bitstream/140.119/100380/1/11(2)-61-104.pdf

View record in BASE

10

Academic Journal

支援定位服務之感測器配置演算法 ; Sensor Deployment Algorithms for Target Positioning Services

المؤلفون: 邱佩玲, Chiu, Pei-Ling

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 感測器配置, 標的物定位, 完全覆蓋, 完全辨識, 服務品質, 電能效率, 拉格蘭日鬆弛法, 模擬退火法, 數學規劃, 網路最佳化, sensor deployment, target positioning, quality of positioning service, Energy-Efficiency, Lagrangean Relaxation, Simulated Annealing, Mathematical Modeling, Network Optimization

وصف الملف: 1363563 bytes; application/pdf

Relation: [AGP04] Z. Abrams, A. Goel, and S. Plotkin, “Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks,” in Proc. 3rd International Symposium on Information Processing in Sensor Networks (IPSN’04), April 2004, pp. 424-432. [AS03] S. Adlakha and M. Srivastava, “Critical Density Thresholds for Coverage in Wireless Sensor Networks,” IEEE Wireless Communication and Networking, vol. 3, March 2003, pp. 1615-1620. [ASC02a] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: a Survey,” Computer Networks, vol. 38, March 2002, pp. 393-422. [ASC02b] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Communications Magazine, August 2002, pp. 102-114. [BG77] M. L. Bazarra and J. J. Goode, “The Traveling Salesman Problem: A Duality Approach,” Math. Programming, vol. 13, 1977, pp. 221-237. [BHE00] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less Low-Cost Outdoor Localization for Very Small Devices,” IEEE Personal Communications, October 2000. [BKX06] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, “Deploying Wireless Sensors to Achieve both Coverage and Connectivity,” in Proc. 7th International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc’06), 2006. [BP00] P. Bahl and V. N. Padmanabhan, “RADAR: an In-Building RF-based User Location and Tracking System,” in Proc. IEEE INFOCOM 2000, vol. 2, March 2000, pp. 775-784. [CCK06] Y. H. Cho, S. P. Choi, W. Y. Kim, and E. C. Choi, “Development of Sensor Network Nodes for Ultrasonic Sensor-Driven Position System Inside Buildings,” in Proc. IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, vol. 2, 2006, pp. 232–236. [CCR01] P. Castro, P. Chiu, T. Rremenek, and R. R. Muntz, “A Probabilistic Room Location Service for Wireless Networked Environments,” in Proc. ACM UbiComp 2001. [CCZ05] Y. Chen, C. N. Chuah, and Q. Zhao, “Sensor Placement for Maximizing Lifetime per Unit Cost in Wireless Sensor Networks,” in Proc. IEEE Conference on Military Communications (MILCOM2005), vol. 2, October 2005, pp. 1097-1102. [CD05] M. Cardei and D.-Z. Du, “Improving Wireless Sensor Network Lifetime through Power Aware Organization,” ACM Wireless Networks, vol. 11, Issue 3, May 2005, pp. 333-340. [CHL03] I. Charon , O. Hudry, and A. Lobstein, “Minimizing the Size of an Identifying or Locating-Dominating Code in a Graph is NP-hard,” Theoretical Computer Science, vol. 290, 2003, pp. 2109 – 2120. [CHS04] W. P. Chen, J. C. Hou, and L. Sha, “Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks,” IEEE Trans. on Mobile Computing, vol. 3, Issue 3, July 2004, pp. 258-271. [CIQ01] K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, “Coding Theory Framework for Target Location in Distributed Sensor Networks,” in Proc. IEEE International Conference on Information Technology: Coding and Computing, April 2001, pp. 130-134. [CIQ02] K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, “Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks,” IEEE Trans. on Computers, vol. 51, no. 12, Dec. 2002, pp. 1148-1153. [CKN07] Z. Chaczko, R. Klempous, J. Nikodem, and M. Nikodem,”Methods of Sensors Localization in Wireless Sensor Networks,” in Proc. 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), 2007. [CL04] P. L. Chiu and Frank Y. S. Lin, “A Simulated Annealing Algorithm to Support the Sensor Placement for Target Location,” in Proc. IEEE CCECE, May, 2004. [CMC02] M. Cardei, D. Maccallum, X. Cheng, M. Min, X. Jia, D. Li, and D.-Z. Du, “Wireless Sensor Networks with Energy Efficient Organization,” Journal of Interconnection Networks, vol 3, No 3-4, 2002, pp. 213-229. [CT06] T. M. Cover and J. A. Thomas, “Elements of Information Theory,” 2nd ed., published by John Wiley and Sons, Inc., New Jersey, 2006. [CTL05] M. Cardei, M. T. Thai, Y. Li, and W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Networks,” in Proc. IEEE INFOCOM 2005, vol. 3, March 2005, pp.1976-1984. [CW06] M. Cardei and J. Wu, “Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks,” Computer Communications, vol. 29, 2006, pp. 413-420. [CWL05] M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, “Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges,” in Proc. WiMob 2005, vol. 3, pp. 438-445. [DC03] S. S. Dhillon and K. Chakrabarty, “Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks,” in Proc. IEEE WCNC, vol. 3, March 2003, pp. 1609-1614. [DCI02] S. S. Dhillon, K. Chakrabarty, and S.S. Iyengar, “Sensor Placement for Grid Coverage under Imprecise Detections,” in Proc. 15th International Conference on Information Fusion, vol. 2, July 2002, pp. 1581-1587. [DCT05] M. Ding, D. Chen, A. Thaeler, and X. Cheng, “Fault-Tolerant Target Detection in Sensor Networks,” in Proc. IEEE Conference on Wireless Communications and Networking, vol. 4, March 2005, pp. 2362–2368. [DVZ06] A. Dhawan, C. T. Vu, A. Zelikovsky, Y. Li, and S. K. Prasad, “Maximum Lifetime of Sensor Networks with Adjustable Sensing Range,” in Proc. 7th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, (SNPD 2006), June 2006, pp. 285 – 289. [EGH99] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” in Proc. MOBICOM, 1999, pp. 263-270. [Egl90] R. W. Eglese, “Simulated Annealing: A tool for Operational Research,” European Journal of Operational Research, vol. 46, 1990. [Etc77] J. Etcheberry, “The Set-Covering Problem: A New Implicit Enumeration Algorithm,” Operations Res., vol. 25, 1977, pp. 760-772. [Fis73] M. L. Fisher, “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I,” Operations Res., vol. 21, pp. 1114-1127, 1973. [Fis76] M. L. Fisher, “A Dual Algorithm for One-Machine Scheduling Problem,” Math. Programming, vol. 11, 1976, pp. 229-251. [Fis81] M. L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problem,” Management Science, vol. 27, no. 1, January 1981, pp. 1-18. [Fis85] M. L. Fisher, “An Applications Oriented Guide to Lagrangian Relaxation,” Interfaces, vol. 15, no. 2, March-April 1985, pp. 10-21. [FS74] M. L. Fisher and J. F. Shapiro, “Constructive Duality in Integer Programming,” SIAM J. Appl. Math., vol. 27, pp. 31-52, 1974. [GCB06] D. Ganesan, R. Cristescu, and B. Beferull-Lozano, “Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constraints,” ACM Trans. on Sensor Networks, vol. 2, issue 2, May 2006. [Geo74] M. Geoffrion, “Lagrangean Relaxation and Its Uses in Integer Programming,” Math. Programming Study, vol. 2, 1974, pp. 82-114. [GJ79] M. R. Garey and D. S. Johnson, “Computers and intractability: A guide to the theory of NP-Completeness,” Freeman, New York, 1979. [Gof77] J. L. Goffin, “On the Convergence Rates of Subgradient Optimization Methods,” Mathematical Programming, vol. 13, 1977, pp. 329-347. [GT02] M. T. Goodrich and R. Tamassia, “Algorithm Design – Foundations, Analysis, and Internet Examples,” John Wiley & Sons, Inc., ISBN: 0-471-38365-1, 2002, p. 611. [HA07] M. Hefeeda and H. Ahmadi, “ Probabilistic Coverage in Wireless Sensor Networks,” Technical Report: TR 2006-21, Simon Fraser University, Surrey, Canada, March 2007. [HB01] J. Hightower and G. Borriello, “A Survey and Taxonomy of Location Systems for Ubiquitous Computing,” Technical Report UW-CSE 01-08-03, University of Washington, Computer Science and Engineering, August 24, 2001. [HWC74] M. Held, P. Wolfe, and H. D. Crowder, “Validation of Subgradient Optimization,” Math. Programming, vol. 6, 1974, pp. 62-88. [IMP05] A. Iranli, M. Maleki, and M. Pedram, “Energy Efficient Strategies for Deployment of a Two-Level Wireless Sensor Network,” in Proc. International Symposium on Low Power Electronics and Design (ISLPED’05), August 2005, pp. 233 – 238. [KCL98] M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, “On a New Class of Codes for Identifying Vertices in Graphs,” IEEE Transactions on Information Theory, vol. 44, no. 2, 1998, pp. 599-611. [KGG06] A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg, “Near-Optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost,” in Proc. 1st International Conference on Information Processing in Sensor Networks (IPSN2006), April 2006, pp. 2-10. [KGM83] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by Simulated Annealing,” Science, vol. 220, no. 4596, May 1983, pp. 671-680. [KKL06] Y. G. Kim, H. K. Kim, S. G. Lee, and K. D. Lee, “Ubiquitous Home Security Robot based on Sensor Network,” in Proc. IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT '06), December 2006, pp. 700–704. [LAR01] Q. Li, J. Aslam, and D. Rus, “Hierarchical Power-aware Routing in Sensor Networks,” in Proc. DIMACS Workshop on Pervasive Networking, May 2001. [LBA02] C. Lu, B. M. Blum, T. F. Abdelzaher, J. A. Stankovic, and T. He, “RAP: A Real Time Communication Architecture for Large-Scale Wireless Sensor Networks,” in Proc. IEEE RTAS 2002. [LC05] Frank Y. S. Lin and P. L. Chiu, “A Near-optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks,” IEEE Communications Letters, vol. 9, no. 1, January 2005. [LC06] M. H. Lu and T. Chen, “CMUseum: A Location-aware Wireless Video Streaming System,” in Proc. IEEE International Conference on Multimedia and Expo, July 2006, pp. 2129 – 213. [LP06] L. Lazos and R. Poovendran, “HiRLoc: High-Resolution Robust Localization for Wireless Sensor Networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 2, February 2006. [LRS05] M. Leoncini, G. Resta, and P. Santi, “Analysis of a Wireless Sensor Dropping Problem in Wide-Area Environmental Monitoring,” in Proc. 4th IEEE/ACM Symposium on Information Processing in Sensor Networks (IPSN’05), April 2005, pp. 239-245. [LT04] B. Liu and D. Towsley, “A Study of the Coverage of Large-scale Sensor Networks,” in Proc. IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’04), Fort Lauderdale, Florida, October 2004, pp. 475-483. [Lue84] D. G. Luenberger, “Linear and Nonlinear Programming,” 2nd edition, Addison-Wesley Publishing Company, 1984. [LXP05] S. Li, C. Xu, W. Pan, and Y. Pan, “Sensor Deployment Optimization for Detecting Maneuvering Targets,” in Proc. 7th International Conference on Information Fusion (FUSION), 2005, pp. 1629–1635. [MKP01] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” in Proc. IEEE INFOCOM 2001, pp. 1380–1387. [MP03] S. Megerian and M. Potkonjak, “Low power 0/1 coverage and scheduling techniques in sensor networks,” UCLA Technical Reports 030001, January 2003. [MP05] M. Maleki and M. Pedram, “QoM and Lifetime-Constrained Random Deployment of Sensor Networks for Minimum Energy Consumption,” in Proc. 4th International Conference on Information Processing in Sensor Networks (IPSN '05), April 2005. [MRK05] V. P. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, and N. Shroff, “A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint,” IEEE Trans. on Mobile Computing, vol. 4, no. 1, January/February, 2005, pp. 4-15. [MV04] M. J. Miller and N. H. Vaidya, “Minimizing Energy Consumption in Sensor Networks using a Wakeup Radio,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), vol. 4 , March 2004, pp.2335–2340. [NKJ05] A. Nadeem, S.S. Kanhere, and S. Jha, “Probanilistic Coverage in Wireless Sensor Networks”, in Proc. IEEE Conference on Local Computer Networks 30th Anniversary (LCN’05) , 2005. [NN04] R. E. Neapolitan and K. Naimipour, “Foundations of Algorithms using C++ Pseudocode,” 3rd edition, Jones and Bartlett Publishers, 2004. [PCB00] N. B. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket Location-Support System,” in Proc. ACM MOBICOM 2000. [PK00] G. J. Pottie and W.J. Kaiser, “Wireless Integrated Network Sensors,” Communications of the ACM, vol.43, no. 5, 2000, pp. 551-558. [PME00] A.Porret, T. Melly, C.C. Enz, and E.A. Vittoz, “A Low-power Low-voltage Transceiver Architecture Suitable for Wireless Distributed Sensors Network,” in Proc. IEEE International Symposium on Circuits and Systems, vol. 1, 2000, pp. 56-59. [QIC01] H. Qi, S. S. Iyengar, and K. Chakrabarty, “Distributed Sensor Networks-a Review of Recent Research,” Journal of the Franklin Institute, vol. 338, no. 6, September 2001, pp. 655-668. [Rap96] T. S. Rappaport, “Wireless Communications: Principles and Practice,” New Jersey: Prentice Hall, 1996. [RSP02] V. Raghunathan, C. Schurgers, S. Park, and B. Srivastava, “Energy Aware Wireless Microsensor Networks,” IEEE Signal Processing Magazine, pp. 40-50, March, 2002. [RST04] S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, “Robust Location Detection With Sensor Networks,” IEEE Journal on Selected Area in Communications, vol. 22, no. 6, August 2004. [RUP03] S. Ray, R. Ungrangsi, F. D. Pellegrini, A. Trachtenberg, and D. Starobinski, “Robust Location Detection In Emergency Sensor Networks,” in Proc. IEEE INFOCOM 2003. [SCI01] E. Shih, S.H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan, “Physical Layer Driven Protocol and Algorithm Design for Energy-Efficient Wireless Sensor Networks,” in Proc. 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking, July 2001, pp. 272-286. [SP01] S. Slijepcevic and M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks,” in Proc. IEEE International Conference on Communications (ICC’01), vol. 2, June 2001, pp. 472–476. [SR02] R.C. Shah and J. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor Networks,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), March 2002. [SS05] Y. Shang and H. Shi, “Coverage and Energy Tradeoff in Density Control on Sensor Networks,” in Proc. 11th International Conference on Parallel and Distributed Systems, vol. 1, July 2005, pp. 564–570. [SSS03] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable sensor grids: Coverage, connectivity and diameter,” in Proc. IEEE INFOCOM 2003. [VGD06] C. T. Vu, S. Gao, W. P. Deshmukh, and Y. Li, “Distributed Energy-Efficient Scheduling Approach for K-Coverage in Sensor Networks,” in Proc. MILCOM 2006. [VVB04] L. F. M. Vieira, M. A. M. Vieira, L. R. Beatriz, A. A. F. Loureiro, D. C. Silva, and A. O. Fernandes, “Efficient Incremental Sensor Network Deployment Algorithm,” in Proc. Brazilian Symposium on Computer Networks, 2004. [Wan06] B. Wang, “A Survey on Coverage Problems in Wireless Sensor Networks”, Tech. Rep., National University of Singapore, 2006. [WLY06] Y. Wang, X. Liu, and J. Yin, “Requirements of Quality of Service in Wireless Sensor Network,” in Proc. International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies ( ICN/ICONS/MCL 2006), April 2006. [WWS05] B. Wang, W. Wang, V. Srinivasan, and K. C. Chua, “Information Coverage for Wireless Sensor Networks,” IEEE Communications Letters, vol. 9, no. 11, 2005, pp. 967–969. [WX07] C. Wang and L. Xiao, “Sensor Localization under Limited Measurement Capabilities,” IEEE Network, vol. 21, Issue 3, May-June 2007, pp.16 – 23. [WXZ03] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated coverage and connectivity configuration in wireless sensor networks,” in Proc. 1st ACM Conference on Embedded Networked Sensor Systems (SenSys’03), November 2003. [WY04] J. Wu and S. Yang, “Coverage and Connectivity in Sensor Networks with Adjustable Ranges,” in Proc. International Workshop on Mobile and Wireless Networking (MWN), 2004. [Xu03] N. Xu, “A Survey of Sensor Network Applications,” Survey Paper for CS694a, Computer Science Department, University of Southern California, 2003. http: //enl.usc.edu/ ~ningxu/papers/survey.pdf [XWH05] K. Xu, Q. Wang, H. Hassanein, and G. Takahara, “Optimal Wireless Sensor Networks (WSNs) Deployment: Minimum Cost with Lifetime Constraint,” in Proc. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob’05), August 2005, pp. 454–461. [YHE02] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” in Proc. 21st International Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), June 2002. [YHS03] T. Yan, T. He, and J. A. Stankovic, “Differentiated Surveillance for Sensor Networks,” in Proc. 1st ACM Conference on Embedded Networked Sensor Systems (Sensys03), November 2003. [ZC03a] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization based on Virtual Forces,” in Proc. IEEE INFOCOM 2003, vol. 2, pp. 1293-1302. [ZC03b] Y. Zou and K. Chakrabarty, “Target Localization based on Energy Considerations in Distributed Sensor Networks,” Ad Hoc Networks, no. 1, 2003, pp. 261-272. [ZDG04] Z. Zhou, S. Das, and H. Gupta, “Connected k-Coverage Problem in Sensor Networks,” in Proc. ICCCN 2004.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54239; http://ntur.lib.ntu.edu.tw/bitstream/246246/54239/1/ntu-96-D87725001-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54239
http://ntur.lib.ntu.edu.tw/bitstream/246246/54239/1/ntu-96-D87725001-1.pdf

View record in BASE

11

Academic Journal

考量危害事件與惡意攻擊下系統脆弱度最小化之近似最佳化冗餘配置策略 ; A Near-Optimal Redundancy Allocation Policy to Minimize System Vulnerability against Hazardous Events and Malicious Attacks

المؤلفون: 江坤道, Jiang, Kun-Dao

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 冗餘配置問題, 網路最佳化, 數學規劃, 資源配置, 拉格蘭氏鬆弛法, 網路脆弱度, 網路存活度, Redundancy Allocation Problem, Network Optimization, Mathematical Programming, Resources Allocation, Lagrangean Relaxation, Network Vulnerability, Network Survivability

وصف الملف: 657714 bytes; application/pdf

Relation: [1] Wojciech Molisz, “Survivability Function ─ A Measure of Disaster-Based Routing Performance,” IEEE Journal on Selected Areas in Communication, vol. 22, no. 9, November 2004 [2] Howard F. Lipson, David A. Fish, “Survivability ─ A New Technical and Business Perspective on Security,” CERT ® Coordination Center Software Engineering Institute [3] Benjamin B.M. Shao, “Optimal Redundancy Allocation for Information Technology Disaster Recovery in the Network Economy,” IEEE Transactions on Dependable and Secure Computing, Vol. 2, No.3, July-September 2005 [4] David W. Coit, Abdullah Konak, “Multiple Weighted Objectives Heuristic for the Redundancy Allocation Problem,” IEEE Transactions on Reliability, Vol. 55, No. 3 September 2006 [5] Jose E. Ramirez-Marquez, David W. Coit, Abdullah Konak, “Redundancy Allocation for series-parallel systems using a max-min approach,” IIE Transactions (2004) 36, 891-898 [6] Yong Jiang, James D. McCalley, Tim Van Voorhis, “Risk-Based Resource Optimization for Transmission System Maintenace,” IEEE Transactions on Power Systems, Vol. 21, No. 3, August 2006 [7] Chunghun Ha, Way Kuo, “Multi-Path Heiristic for Redundancy Allocation: The Tree Heuristic,” IEEE Transactions on Reliability, Vol. 55, No. 1, March 2006 [8] Herve Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham, “Design of Capacitated Survivable Network with a Single Facility,” IEEE/ACM Transactions on Networking, Vol. 13, No. 2, April 2005 [9] Young-Soo Myung, Hyun-joon Kim, Dong-wan Tcha, “Design of Communication Networks with Survivability Constraints,” Management Science, Vol. 45, No. 2 (Feb., 1999), 238-252 [10] Soumyo D. Moitra, Suresh L. Konda, “A Simulation Model for Managing Survivability of Networked Information Systems,” Technical Report CMU/SEI-2000-Tr-020 ESC-TR-2000-020 [11] Chenxi Wang, “A Security Architecture for Survivability Mechanisms,” a dissertation presented to the School of Engineering and Applied Science at the University of Virginia [12] John Koroma, Wei Li, Demetrios Kazakos, “A Generalized Model for Network Survivability,” TAPIA’03 October 15-18, 2003, Atlanta, Georgia., USA [13] David M. Nicol, William H. Sanders, Kishor S. Trivedi, “Model-Based Evaluation: From Dependability to Security,” IEEE Transactions on Dependable and Secure Computing, Vol.1, No. 1, January-March 2004 [14] Zeev Zeitlin, “Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions,” Operation Research, Vol. 29, No. 1, January-February 1981 [15] John C. Knight, Elisabeth A. Strunk, Kevin J. Sullivan, “Towards a Rigorous Definition of Information System Survivability,” Proceedings of the DARPA Information Survivability Conference and Exposition (DISCEX’03) [16] J. McDermott,” Attack-Potential-Based Survivability Modeling for High-Consequence System,” Proceedings of the Third IEEE International Workshop on Information Assurance (IWIA’05) [17] M. S. Chern, “On The Computational Complexity of Reliability Redundancy Allocation in A Series System,” IEEE Transactions on Reliability, Vol. R-36, No. 5 pp.621-623, 1987 [18] Marshall L. Fisher, “An Applications Oriented Guide to Lagrangian Relaxation,” Interfaces, Vol. 15, No. 2, pp. 10-21, April 1985 [19] M. L. Fisher, “The Lagrangian Relaxation Method for Solving Integer Programming Problem,” Management Science, Vol. 27, No. 1, pp. 1-18, January 1981 [20] L.A. Gordon, M.P. Loeb, W. Lucyshyn, R. Richardson, “2006 CSI/FBI Computer Crime and Security Survey,” Computer Security Institute, 2006, http://GoCSI.com [21] Fotios Harmantzis, Manu Malek, “Security Risk Analysis and Evalution,” IEEE Communication Society [22] Ram Dantu, Kall Loper, Prakash Kolan, “Risk Management using Behavior based Attack Graphs,” Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’04) [23] Stefano Bistarelli, Fabio Fioravanti, Pamela Peretti, “Defense Tree for Economic Evaluation of Security Investments,” Proceedings of the First International Conference on Availability, Reliability and Security (ARES’06); en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54211; http://ntur.lib.ntu.edu.tw/bitstream/246246/54211/1/ntu-96-R94725018-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54211
http://ntur.lib.ntu.edu.tw/bitstream/246246/54211/1/ntu-96-R94725018-1.pdf

View record in BASE

12

Academic Journal

WTO杜哈回合關稅減讓對臺灣漁業的影響:漁業部門均衡模型之應用

المؤلفون: 孫金華, 吳苗芳, 江福松

المساهمون: 國立中興大學應用經濟學系

مصطلحات موضوعية: Fisheries sector model, 漁業部門模型, WTO, Mathematical programming, Swiss formula, Doha round, 世界貿易組織, 數學規劃, 瑞士公式, 杜哈回合

Relation: #PLACEHOLDER_PARENT_METADATA_VALUE#; 農業經濟半年刊, Issue 81, Page(s) 57-92.; http://hdl.handle.net/11455/79611

الاتاحة: http://hdl.handle.net/11455/79611

View record in BASE

13

Academic Journal

達成資訊洩漏程度最小化之近似最佳化防禦資源配置策略 ; Near Optimal Network Defense Resource Allocation Strategies for the Minimization of Information Leakage

المؤلفون: 曾中蓮, Tseng, Chung-lien

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 資訊竊取, 拉格蘭日鬆弛法, 數學規劃, 網路攻防, 網路存活度, 最佳化, 資源配置, 無尺度網路, Information Theft, Lagrangean Relaxation, Mathematical Programming, Network Attack and Defense, Network Survivability, Optimization, Resource Allocation, Scale-free Networks

وصف الملف: 775266 bytes; application/pdf

Relation: [1] L.A. Gordon, M.P. Loeb, W. Lucyshyn, and R. Richardson, “2005 CSI/FBI Computer Crime and Security Survey”, Computer Security Institute, 2005, http://GoCSI.com. [2] L.A. Gordon, M.P. Loeb, W. Lucyshyn, and R. Richardson, “2006 CSI/FBI Computer Crime and Security Survey”, Computer Security Institute, 2006, http://GoCSI.com. [3] J.C. Knight and K.J. Sullivan, “On the Definition of Survivability,” Technical Report CS-TR-33-00, Department of Computer Science, University of Virginia, December 2000. [4] J.C. Knight, E.A. Strunk, and K.J. Sullivan, “Towards a Rigorous Definition of Information System Survivability,” Proceedings of the DARPA Information Survivability Conference and Exposition (DISCEX 2003), Volume 1, pp.78-89, April 2003. [5] Y. Liu and K.S. Trivedi, “A General Framework for Network Survivability Quantification,” Proceedings of the 12th GI/ITG Conference on Measuring, Modeling and Evaluation of Computer and Communication Systems, September 2004. [6] R.J. Ellison, D.A. Fisher, R.C. Linger, H.F. Lipson, T.A. Longstaff, and N.R. Mead, “Survivable Network Systems: An Emerging Discipline,” Technical Report CMU/SEI-97-TR-013, Software Engineering Institute, Carnegie Mellon University, November 1997 (Revised: May 1999). [7] P. Tarvainen, “Survey of the Survivability of IT Systems,” The 9th Nordic Workshop on Secure IT-systems, November 2004. [8] “Technical Report on Enhanced Network Survivability Performance,” T1A1.2 Working Group on Network Survivability Performance, February 2001. [9] V.R. Westmark, “A Definition for Information System Survivability,” Proceedings of the 37th IEEE Hawaii International Conference on System Sciences, Volume 9, p. 90303.1, 2004. [10] M.S. Deutsch and R.R. Willis, Software Quality Engineering: A Total Technical and Management Approach, Englewood Cliffs, NJ: Prentice-Hall, 1988. [11] S.C. Liew and K.W. Lu, “A Framework for Network Survivability Characterization,” IEEE Journal on Selected Areas in Communications, Volume 12, No. 1, pp. 52-58, January 1994 (ICC, 1992). [12] S. Louca, A. Pitsillides and G. Samaras, “On Network Survivability Algorithms Based on Trellis Graph Transformations,” Fourth IEEE Symposium on Computers and Communications (ISCC”99), pp. 235-243, July 1999, [13] “Telecom Glossary 2000 (American National Standard, T1.523-2001),” Alliance for Telecommunications Industry Solutions, http://www.atis.org/tg2k/. [14] R. Albert, H. Jeong, and A.-L. Barabási, “Error and Attack Tolerance of Complex Networks,” Nature, Volume 406, pp. 378-382, July 2000. [15] A. Stewart, “On Risk: Perception and Direction,” Computers and Security, Volume 23, pp. 362-370, May 2004. [16] S.-T. Park, A. Khrabrov, D.M. Pennock, S. Lawrence, C.L. Giles, and L.H. Ungar, “Static and Dynamic Analysis of the Internet’s Susceptibility to Faults and Attacks,” Proceeding of the 22nd Annual Conference of the IEEE Computer and Communications Societies, 2003. [17] M. Keshtgary, F.A. Al-Zahrani, and A.P. Jayasumana, “Network Survivability Performance Evaluation with Applications in WDM Networks with Wavelength Conversion,” Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks, 2004. [18] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On Power-Law Relationships of the Internet Topology,” ACM SIGCOIMM Computer Communications Review, Volume 29, Number 4, pp. 251-263, September 1999. [19] G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, “Power-Laws and the AS-level Internet Topology,” IEEE/ACM Transactions on Networking, Volume 11, Issue 4, pp. 514-524, 2003. [20] A.-L. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, Volume 286, pp. 509-512, October 1999. [21] P. Magadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, K. Claffy, and A. Vahdat, “The Internet AS-level Topology: Three Data Sources and One Definitive Metric,” ACM SIGCOMM Computer Communication Review, Volume 36, Number 1, pp. 17-26, January 2006. [22] M.L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problems,” Management Science, Volume 27, Number 1, pp. 1-18, January 1981. [23] M.L. Fisher, “An Application Oriented Guide to Lagrangean Relaxation,” Interfaces, Volume 15, Number 2, pp. 10-21, April 1985. [24] A.M. Geoffrion, “Lagrangean Relaxation and its Use in Integer Programming,” Mathematical Programming Study, Volume 2, pp. 82-114, 1974. [25] M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, “Lagrangean Duality and Saddle Point Optimality Conditions”, Nonlinear Programming: Theory and Algorithms, 2nd Edition, pp. 199-242, John Wiley & Sons, Inc, Singapore, 1993. [26] S. Martello & P. Toth, “Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems,” Operations Research, Volume 45, Number 5, pp. 768-778, September 1997.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54254; http://ntur.lib.ntu.edu.tw/bitstream/246246/54254/1/ntu-95-R93725002-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54254
http://ntur.lib.ntu.edu.tw/bitstream/246246/54254/1/ntu-95-R93725002-1.pdf

View record in BASE

14

Academic Journal

有線電視網路規劃演算法之研究 ; Network Planning Algorithms in CATV Networks

المؤلفون: 彭國維, Peng, Kuo-Wei

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 有線電視網路, 史坦那樹, 修改式最陡梯度法, 多層解題程序, 網路規劃, 幾何規劃法, 數學規劃, 網路最佳化, CATV Network, Modified Steepest Descent Method, Multilayer Solution Procedure, Network Planning, Geometric Programming, Mathematical Modeling, Network Optimization

Relation: REFERENCES [1] William Grant, Cable Television, Prentice-Hall, 2nd Edition, 1988. [2] G. F. Hwang, The CATV systems and Measurement, Chen-Hwa Technical Books Inc., 1996. [3] James A. Chiddix, Herzel Laor, David M. Pangrac, Louis D. Williamson, and Ronald W. Wolfe, "AM Video on Fiber in CATV Systems: Need and Implementation," IEEE J. Select. Areas Commun., vol. 8, no. 7, pp. 1229-1239, Sep. 1990. [4] G. F. Hwang, The CATV systems, Chen-Hwa Technical Books Inc., 1995. [5] H. H. Lu, The Measurement and Testing of CATV systems, Ju-Lin Technical Books Inc., 1995. [6] G. G. Chu, J. G. Hu, L. Y. Kuhn, W. C. Lee, “The Implementation and Management of a Interactive CATV Network,” The Third Annual Conference on Taiwan Academic Network, 1997. [7] P.P. Yermolov, B. N. Shelkovnlkov, “Software for CATV Networks Design”, International Crimean Conference on Microwave and Telecommunication Technology, Sep., 2000. [8] Arthur I. Karshmer and James N. Thomas, “Computer Networking on Cable TV Plants,” IEEE Network, no. 6 (November 1992): 32-40 [9] Bernhard E. Keiser, Broadband Coding, Modulation, and Transmission Engineering, Prentice-Hall, Inc., 1989. [10] Ciciora, Walter S., Cable Television in the United States: An Overview, Louisville, CO: Cable Television Laboratories, 1995. [11] Hillier and Lieberman, Introduction to Operations Research, McGraw-Hill Inc., 6th Edition, pp. 571-572, 1995. [12] Mokhtar S. Bazaraa and C. M. Shetty, Nonlinear Programming Theory and Algorithms, G.S. Inc. [13] Hamdy A. Taha, Operations Research - An Introduction, Department of Industrial Engineering/University of Arkansas, Fayetteville, 3rd Edition, pp. 780-784. [14] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, McGraw-Hill Inc., pp. 504-510, 1993. [15] Richard J. Duffin, Elmor L. Peterson, and Clarence Zener, Geometric Programming - Theory and Application, John Wiley & Sons Inc., 1967. [16] Mordecai Avriel, Advances in Geometric Programming, Plenum Press, 1980. [17] Dimitri Bertsekas and Robert Gallager, Data Networks, Prentice Hall, 2nd Edition, pp. 465-467, 1992. [18] David G. Luenberger, Linear and Nonlinear Programming, Addison-Wesley Publishing Company Inc., pp. 214-220, 1984. [19] Eugene R. Bartlett, Cable Television Technology & Operations, McGraw-Hill, 1990 [20] Y. D. Lin, C. Y. Huang, and W. M. Yin, “Allocation and Scheduling Algorithm for IEEE 802.14 and MCNS in Hybrid Fiber Coaxial Networks,” IEEE Trans. Broadcasting, vol. 44, no. 4, Dec. 1998, pp. 427–35. [21] Eldering, Chales A., Nageen Himayat, and Floud M. Gardner, “CATV Return Path Characterization for Reliable Communications,” IEEE Communications, Vol. 33, no.8, pp. 62-69, August 1995. [22] Huei-Jiun Ju and Wanjiun Liao, “Adaptive Scheduling in DOCSIS-based CATV Networks,” Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on , 14-16 Oct. 2002 [23] Hue-Jiun Ju, Wanjiun Liao, “Fast request transmission in DOCSIS-based CATV networks,” Multimedia and Expo, 2002. ICME '02. Proceedings. 2002 IEEE International Conference on , Volume: 1 , 26-29 Aug. 2002. [24] H. J. Hsieh, Y. S. Lin, “Planning and Management of CATV Networks,” ISCOM, 1999. [25] Dymarsky Ya.S., Nourmiyeva M.V., “Optimization Task of Calculation of Multiservice CATV Network Having Minimum Cost,” The 11th International Conference on Microwave and Telecommunication Technology, Sevastopal, Ukraine, 2001 [26] K. W. Peng, J. F. Kwang, Y. S. Lin, “An Optimization-based Design Algorithm for CATV Networks,” IASTED The International Conference on Networks and Communication systems, 2006. [27] M. R. Garey and D. S. Johnson, Computers and Intractability--- a Guide to the Theory of NP-Completeness, Freeman: New York, 1979. [28] H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japon., pp. 573-577, 1980. [29] LINGO Users Guide, LINDO Systems Inc., 1995. [30] Imperl, B.; Kacic, Z.; Horvat, B.; Zgank, A., “Agglomerative vs. tree-based clustering for the definition of multilingual set of triphones,” IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '00, Volume 3, 5-9 June 2000 [31] B.T. Polyak., “A general method for solving extremal problems,” Soviet Mathematics Daklady, 8:593-597, 1967. [32] Nicholas F. Maxemchuk, "Video Distribution on Multicast Networks," IEEE J. Select. Areas Commun., vol. 15, no. 3, pp. 357-372, April 1997. [33] Jonathan Chien-Liang Lin, Jenwei Hsieh, David H. C. Du, and Meng-Jou Lin, "Performance of a Storage System for Supporting Different Video Types and Qualities," IEEE J. Select. Areas Commun., vol. 14, no. 7, pp. 1314-1331, Sep. 1996. [34] Zheng Wang and Jon Crowcroft, "Quality-of-Service Routing for Supporting Multimedia Applications," IEEE J. Select. Areas Commun., vol. 14, no. 7, pp. 1228-1234, Sep. 1996. [35] F. Y. S. Lin and J. Wang, "A Near-Optimal Minimax Routing Algorithm in Networks with Single-Path Routing," IEEE GLOBECOM, Houston, Texas, Nov. 1993. [36] F. Y. S. Lin and J. R. Yee, "A Distributed Multiplier Adjustment Method for the Virtual Circuit Routing Problem," ORSA J. Computing, Summer, 1992. [37] Fred Bauer and Anujan Varma, "Degree-Constrained Multicasting in Point-to-Point Networks," IEEE INFOCOM, pp. 369-376, 1995. [38] Qing Zhu, Mehrdad Parsa, and J.J. Garcia-Luna-Aceves, "A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting," IEEE INFOCOM, pp. 377-385, 1995. [39] James Kadirire and Graham Knight, "Comparison of Dynamic Multicast Routing Algorithms for Wide-Area Packet Switched (Asynchronous Transfer Mode) Networks," IEEE INFOCOM, pp. 212-219, 1995. [40] Whay Chiou Lee, "Spanning Tree Method for Link State Aggregation in Large Communication Networks," IEEE INFOCOM, pp. 297-302, 1995. [41] Nachum Shacham, "Multipoint Communication by Hierarchically Encoded Data," IEEE INFOCOM, pp. 2107-2114, 1990. [42] Claude E. Shannon and Warren Weaver, The Mathematical Theory of Communication, Chicago: University of Illinois Press, 1949. [43] Sharon Eisner Gillete, “Connecting Homes to the Internet: An Engineering Cost Model of Cable vs. ISDN,” Master’s thesis, Massachusetts Institute of Technology, 1995. [44] G. J. Lin, Fundamental of the CATV Systems, Chen-Hwa Technical Books Inc., 1996.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54241

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54241

View record in BASE

15

Academic Journal

營造業承包廠商自辦外包規模決策評估模式之研究 ; A Decision Support Model for Construction Job Outsourcing

المؤلفون: 顏上堯, 黃榮堯, 張子文

مصطلحات موضوعية: 營建管理, 外包, 分包, 數學規劃, 決策支援, construction management, outsourcing, subcontracting, mathematical programming, decision support

Relation: 技術學刊(Journal of Technology), Vol. 20, No.1, pp.21-32; http://ir.lib.ntust.edu.tw/handle/987654321/35522; http://ir.lib.ntust.edu.tw/bitstream/987654321/35522/-1/A Decision Support Model for Construction Job Outsourcing.pdf

الاتاحة: http://ir.lib.ntust.edu.tw/handle/987654321/35522
http://ir.lib.ntust.edu.tw/bitstream/987654321/35522/-1/A Decision Support Model for Construction Job Outsourcing.pdf

View record in BASE

16

Academic Journal

多媒體網路群播演算法 ; Multicasting Algorithms in Multimedia Networks

المؤلفون: 鄭旭成, Cheng, Hsu-Chen

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 群播網路, 多重速率群播, 多階層編碼技術, 史坦那樹, 允入控制, 網路規劃, 拉格蘭日鬆弛法, 數學規劃, 網路最佳化, Multicast Network, Multi-rate Multicasting, Layered encoding, Steiner Tree, Call Admission Control, Network Planning, Lagrangean Relaxation, Mathematical Modeling, Optimization

وصف الملف: 2387509 bytes; application/pdf

Relation: [1] M. R. Garey and D.S. Johnson, Computers and Intractability─a Guide to the Theory of NP-Completeness, Freeman: New York, 1979. [2] F. Kenji, O. Masataka and I. Katsuo, ”Integration of Multicast Routing and QoS Routing,” Proc. The 10th Annual Internet Society Conference, pp. 18-21, July 2000. [3] E. Crawley, R. Nair, B. Rajagopalan, H. Sandick, "A Framework for QoS-based Routing in the Internet", IETF RFC2386, Aug. 1998. [4] S. Chen and K. Nahrstedt, “An Overview of Quality-of-Service Routing for the Next Generation High-Speed Network: Problems and Solutions,” IEEE Network, Special Issue on Transmission and Distribution of Digital Video, November/December 1998. [5] J. Kleinberg, Y. Rabani and E. Tardos, “Fairness in Routing and Load Balancing,” Proc. the 40th Annual Symposium on Foundations of Computer Science, pp. 568-578, 1999. [6] D. Ghosh, V. Sarangan and R. Acharya, “Quality-of-Service Routing in IP Networks,” IEEE Transactions on Multimedia, vol. 3, Issue 2, June 2001. [7] Z. Wang and J. Crowcroft, “Quality-of-service routing for supporting multimedia applications”, IEEE JSAC, vol. 14, pp. 1228-1234, Sept. 1996. [8] F. Ergun, R. Sinha and L. Zhang, “QoS Routing with Performance-Dependent Costs”, Proc. IEEE INFOCOM 2000 , March, 2000. [9] H. Fang, E. W. Zegura, “On Scalable QoS Routing: Performance Evaluation of Topology Aggregation,” Proc. IEEE INFOCOM 2000, May 2000. [10] G. Apostolopoulos, R. Guérin, S. Kamat and S. K. Tripathi, “Quality of service based routing: a performance perspective,” ACM SIGCOMM Computer Communication Review, v.28 n.4, p.17-28, Oct. 1998. [11] B. Wang and J. C. Hou, "Multicast routing and its QoS extension: problems, algorithms, and protocols," IEEE Network, vol. 14, no. 1, pp. 22-36, Jan./Fab. 2000. [12] D. Waltzman, S. Deering, and C. Partridge, "Distance vector multicast routing protocol," IETF RFC 1075, Nov. 1988. [13] J. Moy, "Multicast extensions to OSPF," IETF RFC 1584, Mar. 1994. [14] A. Ballardie, "Core based trees multicast routing architecture," IETF RFC 2201, Sep. 1997. [15] A. Ballardie, "Core based trees (CBT version 2) multicast routing protocol specification," IETF RFC 2189, Sep. 1997. [16] D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma, and L. Wei, "Protocol independent multicast-sparse mode (PIM-SM): protocol specification," IETF RFC 2362, Jun. 1998. [17] K. L. Calvert, E. W. Zegura and M. J. Donahoo, "Core selection methods for multicast routing," Proc. Int. Conf. Computer Communications and Networks, pp. 638-642, Jul. 1995. [18] D. G. Thaler and C. V. Ravishankar, "Distributed center-location algorithms," IEEE JSAC, vol. 15, no. 3, pp. 291-303, Apr. 1997. [19] S. J. Koh, M. K. Shin, J. H. Yi, J. H. Hahm and C. H. Park, "Non-core based shared tree architecture for IP multicasting," Electronics Letters, vol. 35, no. 11, 27th May 1999. [20] D. Kosiur, IP multicasting: the complete guide to interactive corporate networks, John Wiley & Sons, 1998. [21] Q. Zhu, M. Parsa and J. J. Garcia-Luna-Aceves, "A source-bases algorithm for delay-constrained minimum-cost multicasting," Proc. IEEE INFOCOM '95, pp. 377-385, 1995. [22] G. N. Rouskas, and I. Baldine, "Multicast routing with end-to-end delay and delay variation constraints," IEEE JSAC, vol. 15, no. 3, Apr. 1997. [23] X. Jia, "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks," IEEE/ACM Transactions on Networking, vol. 6, no. 6, pp. 828-837, Dec. 1998. [24] S. Chen, and K. Nahrstedt, "Distributed quality-of-service routing in high-speed networks based on selective probing," Tech. Report, Dep. of Computer Science, UIUC, 1998. [25] J. Ignacio and P. Fraigniaud, “A survey of multicast protocols for Internet,” Proc. AlgoTel 2000, 2000. [26] S. Ramanathan, "Multicast Tree Generation in Networks with Asymmetric Links," IEEE/ACM Trans. on Networking, vol.4, No.4, pp.558-568, Aug. 1996. [27] F. Bauer and A. Varma, "Distributed Algorithms for Multicast Path Setup in Data Networks," IEEE/ACM Trans. on Networking, vol.4, No.2, pp.181-191, April 1996. [28] L. Wei and D. Estrin, "The Trade-Offs of Multicast Trees and Algorithms," Proc. Third Int. Conference on Computer Communications and Networking, pp.17-24, 1994. [29] Y. Tanaka and P.C. Huang, "Multiple Destination Routing Algorithms," IEICE Trans. on Communication, vol. E76-B, no.5, pp.544-552, May 1993. [30] X. Jiang, "Distributed Path Finding Algorithm for Stream Multicast," Computer Communication, vol.16, no.12, pp.767-775, Dec. 1993. [31] X. Jiang, "Routing Broadband Multicast Streams," Computer Communication, vol.15, no.1, pp.45-51, Jan./Feb., 1992. [32] K. Bharathi-Kumar and J.M. Jaffe, "Routing to Multiple Destinations in Computer Networks," IEEE Trans. on Communication, vol.COM-31, no.3, pp.343-351, March, 1983. [33] J. Lin and R.S. Chang, "A Comparison of the Internet Multicast Routing Protocols," Computer Communications, vol. 22, pp.144-155, 1999. [34] T. Asaka, T. Miyoshi and Y. Tanaka, "Dynamic Multicast Routing Algorithm Using Predetermined Path Search," IEICE Trans. Communication, vol. E83-B, no.5, pp. 1128-1135, May, 2000. [35] J. Cho and J. Breen, "Analysis of the Performance of Dynamic Multicast Routing Algorithms," Computer Communications, vol. 22, pp.667-674, 1999. [36] S. Raghavan, G. Manimaran and C. S. R. Murthy, "A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees," IEEE/ACM Trans. on Networking, vol.7, no.4, Aug., 1999. [37] W. Effelsberg and E. Muller-Menrad, "Dynamic Join and Leave for Real-Time Multicast," TR-93-056, International Computer Science Institute, Berkeley, October (1993). [38] M. Imase and B. Waxman, "Dynamic Steiner Tree Problem," SIAM J. Discrete Math., vol. 4, no. 3, pp.369-384, August 1991. [39] F. Aiguo and M. Gerla, "Receiver-Initiated Multicasting with Multiple QoS Constraints," Proc. IEEE INFOCOM 2000, vol. 1, pp.62-70, 2000. [40] X. Li, M. H. Ammar and S. Paul, “Video multicast over the Internet,” IEEE Network, March/April 1999. [41] M. Ghanbari, “Two-Layered Coding of Video Signals for VBR Networks,” IEEE JSAC, vol. 7, no. 5, pp. 771-781, June 1989. [42] F. Kishino, K. Manabe, Y. Hayashi and H. Yasuda, “Variable Bit-Rate Coding of Video Signals for ATM Networks,” IEEE JSAC, vol.7, pp.801-806, June 1989. [43] W. Li, “Overview of Fine Granularity Scalability in MPEG-4 video standard,” IEEE Trans. Circuits and Systems for Video Technology, vol. 11, no. 3, pp. 301-317, Mar. 2001. [44] W. Li, “Bit-Plane Coding of DCT Coefficients for Fine Granularity Scalability,” ISO/IEC JTC1/SC29/WG11, MPEG98/M3989, Oct. 1998. [45] J. Liang, J. Yu, Y. Wang, M. Srinath and M. Zhou, “Fine Granularity Scalability Video Coding using Combination of MPEG4 Video Objects and Still Texture Objects,” ISO/IEC JTC1/SC29/WG11, MPEG98/M4025, Oct. 1998. [46] W. Li, “Fine Granularity Scalability Using Bit-Plane Coding of DCT Coefficients,” ISO/IEC JTC1/SC29/WG11, MPEG98/M4204, Dec. 1998. [47] N. F. Maxemchuk, “Video Distribution on Multicast Networks”, IEEE JSAC, vol. 15, no. 3, pp. 357-372, April 1997. [48] M. Charikar, J. Naor, B. Schieber, “Resource Optimization in QoS Multicast Routing of Real-Time Multimedia,” IEEE/ACM Transactions on Networking, vol. 12, no. 2, pp. 340-348, April 2004. [49] H.G. Perros and K.M. Elsayed, “Call admission control schemes: A review,” IEEE Communications Magazine, pp. 82-91, Nov. 1996. [50] C. Cetinkaya and E. Knightly “Egress Admission Control”, Proc. INFOCOM 2000, Mar. 2000. [51] K. Lai and M. Baker, “Measuring Link Bandwidths Using a Deterministic Model of Packet Delay,” Proc. SIGCOMM 2000, pp. 283-294, 2000. [52] V. Fioriu and D. Towsley, “Call admission and resource reservation for multicast sessions,” Technical Report 95-17, University of Massachusetts, 1995. [53] X. Jia, Y. Zhang, N. Pissinoun and S. Makkis “An Integrated Routing andAdmission Control Mechanism for Real-time Multicast Connection Establishment,” International Journal of Communication Systems, vol. 14, no. 3, pp 287-303, April 2001. [54] E. Pagani and G. P. Rossi, “Distributed Bandwidth Broker for QoS Multicast Traffic”, Proc. 22nd IEEE ICDCS, Vienna, pp. 319-326, Jul. 2-5 2002. [55] N. Tang, S. Tsui and L. Wang, “A survey of admission control algorithms,” Technical Report, December 1998. [56] S. Jamin, P. B. Danzig, S. J. Shenker and L. Zhang, “A measurement-based admission control algorithm for integrated service packet networks,” IEEE/ACM Transactions on Networking, vol. 5, No. 1, Feb. 1997, pp. 56-70. [57] Berger, A. W. and Whitt, W., “Effective bandwidths with priorities,” IEEE Transactions on Networking, vol. 6, no. 4, pp. 447, Aug. 1998. [58] C. S. Chang and J. A. Thomas “Effective bandwidth in high-speed digital networks,” IEEE JSAC, vol. 13, no. 6, Aug. 1995. [59] R. Guerin, A. Ahmadi, and M. Nagshineh, “Equivalent capacity and its applications to bandwidth allocation in high-speed networks,” IEEE JSAC, vol. 9, no. 7, Sep. 1991. [60] D. Wu, Y. T. Hou, W. Zhu, T. Q. Zhang and J. Peha, “Streaming video over the Internet: approaches and directions,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, no. 3, pp. 282-300, March 2001. [61] G. Karlsson and M. Vetterli, “Packet video and its integration into the network architecture”, IEEE JSAC, vol. 7, pp. 739–751, 1989. [62] E. Amir, S. McCanne and H. Zhang, “An application level video gateway,” Proc. ACM Multimedia, pp. 255-265, Nov. 1995. [63] T. Turletti and J. C. Bolot, “Issues with multicast video distribution in heterogeneous packet networks”, Proc. the 6th International Workshop on Packet Video, pp. F3.1-F3.4, 1994. [64] L. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala, “RSVP: A new resource reservation protocol”, IEEE Network, vol. 7, pp. 8–18, 1993. [65] P. Winter, “Steiner problem in networks: A survey,” Networks, pp. 129-167, 1987. [66] F. K. Hwang, Steiner Tree Problems, Networks, pp. 55-89, 1992. [67] M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems”, Management Science, vol. 27, pp. 1-18, 1981. [68] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, ISBN0-13-027765-7, 1993. [69] H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math Japonica, vol. 6, pp. 573-577, 1980. [70] A. M. Geoffrion, “Lagrangean relaxation and its uses in integer programming,” Math. Programming Study, vol. 2, pp. 82-114, 1974. [71] M. Held and R. M. Karp, “The Traveling salesman problem and minimum spanning trees: Part I,” Operations Research, vol. 18, pp. 1138-62, 1970. [72] C. Faloutsos, P. Faloutsos, and M. Faloutsos, “On power-law relationships of the Internet topology,” Proc. of the ACM SIGCOMM, Sept. 1999. [73] A.-L. Barabasi and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286. pp. 509–512, Oct. 1999. [74] D. J. Watt and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, pp. 440-442, June 1998. [75] V. Batagelj and U. Brandes, “Efficient generation of large random networks,” Physical Review, 2005.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54359; http://ntur.lib.ntu.edu.tw/bitstream/246246/54359/1/ntu-94-D87725002-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54359
http://ntur.lib.ntu.edu.tw/bitstream/246246/54359/1/ntu-94-D87725002-1.pdf

View record in BASE

17

Academic Journal

異質性光波長多工光網路之交換器配置演算法 ; Switch Placement Algorithms in Optical WDM Heterogeneous Networks

المؤلفون: 張孝澤, Chang, Hsiao-Tse

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 光波長多工, 光網路規劃, 光纖交換, 光波段交換, 光波長交換, 最佳化, 拉格蘭日鬆弛法, 數學規劃, Fiber Switch, Lagrangean Relaxation Method, Lambda Switch, Mathematical Programming, Network Planning, Optimization, Waveband Switch, WDM

وصف الملف: 1684334 bytes; application/pdf

Relation: [1] L. Berger,” Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description”, IETF RFC 3471, January 2003. [2] R. Douville, D. Papadimitriou, and E. Dotaro,“ Extensions to Generalized Multi-Protocol Label Switching in support of Waveband Switching“, IETF Internet Draft, July 2004. [3] Y. Suemura, et al, “Hierarchical Routing in Layered Ring and Mesh Optical Networks”, IEEE ICC 2002, May 2002. [4] X. Cao, V. Anand, Y. Xiong, and C. Qiao, “A Study of Waveband Switching With Multilayer Multigranular Optical Cross-Connects, IEEE Journal on Selected Areas in Communications, Vol.21, No.7, September 2003. [5] X. Cao, V. Anand, and C. Qiao, “A Waveband Switching Architecture and Algorithm for Dynamic Traffic”, IEEE Communications Letters, Vol.7 No.8, August 2003. [6] P. H. Ho,and H. T. Mouftah, “Routing and Wavelength Assignment With Multigranularity Traffic in Optical Networks”, Journal of Lightwave Technology, Vol.20, No.8, August 2002. [7] K. Zhu, H. Zhu, and B. Mukherjee, “Traffic Engineering in Multigranularity Heterogeneous Optical WDM Mesh Networks through Dynamic Traffic Grooming”, IEEE Network, vol. 17, no. 2, March 2003. [8] S. S.W. Lee, M. C. Yuang, P. Tien, and S. Lin, “A Lagrangean Relaxation-Based Approach for Routing and Wavelength Assignment in Multigranularity Optical WDM Networks”, IEEE Journal on Selected Areas in Communications, Vol.22, No.9, November 2004. [9] J. W. Suurballe, R.E. Tarjan, “A Quick Method for Finding Shortest Pairs of Disjoint Paths”, Networks, Vol.14, 1984. [10]J. W. Suurballe, “Disjoint Paths in a Network”, Networks, Vol.4, 1974. [11]C. H. Papadimitriou, K. Steiglitz, “Combinatorial optimization : algorithms and complexity”, Prentice Hall, 1982. [12]R. K. Ahuja, T. L. Magnanti, J. B. Orlin, ”Network flows : theory, algorithms, and applications”, Prentice-Hall International, 1993. [13]S. S.W. Lee, “Introduction to IP over Wavelength Division Multiplexing (WDM) Network Technology” Presentation, March 2004. [14]J. Bowers, “Fiber Optics” lecture notes in UCSB, 2004. [15]R. Helkey, et al, ”Design of Large, MEMS-Based Photonic Switches”, Optics & Photonics News, May 2002 [16]P. H. Ho, H. T. Mouftah,and J. Wu, ”A Scalable Design of Multigranularity Optical Cross-Connects for the Next-Generation Optical Internet”, IEEE Journal on Selected Areas in Communications, Vol.21, No.7, Sep. 2003. [17]M. L. Fisher, “The Larganian Relaxation Method For Solving Integer Programming Problems”, Management Science, Vol.27, No.1, January 1981. [18]R. Parthiban, R. S. Tucker, “Waveband Grooming and IP Aggregation in Optical Networks”, IEEE Journal of Lightwave Technology, Vol.21, No.11, November 2003. [19]郭至鈞，以波長路由為基礎之多波長分工網路上群播樹合併演算法，國立台灣大學資訊管理學研究所碩士學位論文，民國九十二年七月。 [20]顏宏旭著，電腦網路與後勤網路之規劃與容量管理，國立台灣大學資訊管理學研究所博士學位論文，民國九十年六月。; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54375; http://ntur.lib.ntu.edu.tw/bitstream/246246/54375/1/ntu-94-R92725014-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54375
http://ntur.lib.ntu.edu.tw/bitstream/246246/54375/1/ntu-94-R92725014-1.pdf

View record in BASE

18

Academic Journal

無線移動網路下考量穩定叢聚網路拓樸建置與相關服務品質限制路由演算法 ; Reliable Cluster Construction and QoS-Constrained Routing Assignment in Wireless Mobile Ad Hoc Networks

المؤلفون: 林明源, Lin, Ming-Yuan

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 無線移動網路, 叢聚拓樸, 網路規劃, 考量服務品質之路由規劃, 穩定性, 最佳化, 拉格蘭日鬆弛法, 數學規劃, Mobile Ad Hoc Network, Reliable Cluster Construction, QoS Constrained Routing Assignment, Reliability, Mathematical Programming, Optimization, Lagrangean Relaxation

وصف الملف: 1232029 bytes; application/pdf

Relation: [1] B. An and S. Papavassiliou, “A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc networks”, International Journal of Network Management 200111 page 387-395. [2] B. An and S. Papavassiliou, “MHMR: mobility-based hybrid multicast routing protocol un mobile ad hoc wireless network”, Wireless Communication and Mobile Computing 2003 3 page 255-270. [3] B. An and S. Papavassiliou, “Geomulticast: architecture and protocols for mobile ad hoc wireless networks”, http://www.ComputerScienceWeb.com received 17 October 2002. [4] A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, “Max-min D-cluster formation in wireless ad hoc networks”, Inforcom 2000. [5] J.J. Garcai-Luna-Aceves and E. L. Madruga, “ A multicast routing protocol for ad hoc networks”, Processing of Inforcom99 March 99 page 784-792. [6] T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research“, Wireless Communication and Mobile Computing 2002 2 page 483-502 . [7] S. J. Lee, W. Su, and M. Gerla, “ODMRP On-demand multicast Routing Protocol in Multihop Wireless Mobile Networks”, Mobile Network and Application Dec 2002 7 6 ABI/INFORM Global. [8] Das, A. K. Marks, R. J. El-Sharkawi, M. Arabshahi, and P. Gray, “Minimum power broadcast trees for wireless networks: Integer programming formulations”, INFOCOM 2003, 30 March-3 April 2003, p1001- 1010 vol.2. [9] E. L. JOHNSON, A. MEHROTRA, and G. L. NEMHAUSER, “Cliques and clustering: A combinatorial approach”, Mathematical Programming, 62, 133-151. [10] Alan, D. Amis, and R. Prakash, “Load-balancing clusters in wireless ad hoc networks”, Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology 2000, P.25. [11] Jamal N. ,Al-Karaki Ahmed E. ,and K. Raza, “On the optimal clustering in mobile ad hoc networks”, Proceedings of IEEE Consumer Communications and Networking, Las Vegas, Nevada USA/ January 5-8, 2004. [12] JEFFREY E. , WIESELTHIER, and GAM D. NGUYEN, “Algorithms for energy-efficient multicasting in static ad hoc network”, Mobile Networks and Applications 6,251-263,2001. [13] W. Lou, Student Member, IEEE, and J. Wu Senior Member, “On reducing broadcasting redundancy in ad hoc network”, IEEE transactions on mobile computing April-June 2002. [14] J. Aslam, Q. Li*, and D. Rus, “Three power-aware routing algorithms for sensor networks”, WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2003; 3:187–208 (DOI:10.1002/wcm.111). [15] X.-Y. Li, ‘Algorithmic, geometric and graphic issues in wireless networks”, WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2003; 3:119–140 (DOI:10.1002/wcm.107). [16] Y. X. FENG, L. L. ZHAO, G. X. Wang, “A Clustering Algorithm Applied to Network Management in MANETS”, Info-tech and Info-net, 2001. Proceedings. ICII 2001-Beijing. 2001 International Conferences on Publication Date: 2001 Volume: 2, p. 626-631 vol.2. [17] K. Liu, J. D. Li, “Mobile cluster protocol in wireless ad hoc networks”, Proc. Intl. Conf. on Commun. Tech. (WCC - ICCT 2000), Vol. 1, 2000. [18] C. Y. Chiu, G. H. Chen, and Eric H. K. Wu, “A stability aware cluster routing protocol for mobile ad hoc networks”, Wireless Communications and Mobile Computing Volume 3, Issue 4 , Pages 503 – 515. [19] S. Harada and H. Higaki (Japan), “Sporadic communication protocol between clusters of mobile computers”, wireless networks and engineering technologies WNET 2004 Track - Wireless Technologies II 424-050. [20] M. L. Fisher, “The Largragian relaxation method for solving integer programming problems’, Management Science Vol. 27. N0. 1. January 1981 Printed in U.S.A.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54373; http://ntur.lib.ntu.edu.tw/bitstream/246246/54373/1/ntu-94-R92725034-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54373
http://ntur.lib.ntu.edu.tw/bitstream/246246/54373/1/ntu-94-R92725034-1.pdf

View record in BASE

19

Academic Journal

考慮智慧型惡意攻擊下之網路存活度最大化 ; Maximization of Network Survivability against Intelligent and Malicious Attacks

المؤلفون: 陳建宏, Chen, Chien-Hung

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 網路規劃, 最佳化, 拉格蘭日鬆弛法, 數學規劃, 存活度, 資訊安全, 網路攻防, 資源配置, 無尺度網路, Information Security, Lagrangean Relaxation, Mathematical Programming, Network Attack and Defense, Network Planning, Optimization, Resource Allocation, Scale-free Networks, Survivability

وصف الملف: 487031 bytes; application/pdf

Relation: [1] 雷定中, “資訊時代國家安全的基礎--通資網路存活率之研究,” 國防通信電子及資訊季刊第五期, 2004 [2] Sean P. Gorman, Laurie Schintler, Raj Kulkarni, and Roger Stough, “The Revenge of Distance: Vulnerability Analysis of Critical Information Infrastructure,” Journal of Contingencies and Crisis Management vol. 12, pp. 48-63, 2004 [3] Michael Faloutsos, Petros Faloutsos , and Christos Faloutsos , “On Power-Law Relationships of the Internet Topology,” Computer Communications Review 29, pp. 251-263, 1999 [4] A. Broida and K. C. Claffy, “Internet topology: Connectivity of IP graphs, in Scalability and Traffic Control in IP Networks,” S. Fahmy and K. Park, eds., Proc. SPIE 4526, International Society for Optical Engineering, Bellingham, WA, pp. 172–187, 2001 [5] Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, “The origin of power laws in Internet topologies revisited,” in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society, Los Alamitos, CA, 2002 [6] Murali Kodialam and T. V. Lakshman, “Detecting Network Intrusions via Sampling: A Game Theoretic Approach,” IEEE INFOCOM, 2003 [7] R. J. Ellison, D. A. Fisher, R. C. Linger, H. F. Lipson, T. Longstaff and N. R. Mead, “Survivable Network Systems: An Emerging Discipline,” Technical Report CMU/SEI-97-TR-013, Software Engineering Institute, Carnegie Mellon University, 1999 [8] Vickie R. Westmark, “A Definition for Information System Survivability,” IEEE Proceedings of the 37th Hawaii International Conference on System Sciences, 2004 [9] M, A. Schroeder, and K. T. Newport, “A Connectivity Using a Graph Theory Approach,” MTR 9278, The MITRE Corporation, Rome, NY, 1986 [10] M, A. Schroeder, “A Knowledge-Based Approach to the Computation of Network Nodal Survivability,” Military Communications Conference, MILCOM 90, 1990. [11] Haizhuang Kang, Clive Bulter, and Qingping Yang, “A New Survivability Measure for Military Communication Networks,” Military Communications Conference, MILCOM 98, 1998 [12] Tong Ze Jiang, “A New Definition on Survivability of Communication Networks,” MILCOM, 1991 [13] Jianxu Shi and John P. Fonseka, “Traffic-Based Survivability Analysis of Telecommunication Networks,” IEEE, 1995 [14] Ali Zolfaghari and Fred J. Kaudel, “Framework for Network Survivability Performance,” IEEE Journal on Selected Areas in Communications, vol. 12, No.1, 1994 [15] Erdos, P. & Renyi A., “On the evolution of random graphs,” Publ. Math. Inst. Sci. 5, pp. 17-60, 1960 [16] Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi, “Error and Attack Tolerance of Complex Networks,” Nature 406, pp. 378-381, 2000 [17] Duncan J. Watts and Steven H. Strogatz, “Collective Dynamics of ‘Small-World’ Networks,” Nature 393, pp. 440-442, 1998 [18] Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi, “Diamater of the World Wide Web,” Nature 401, pp. 130-131, 1999 [19] Albert-Laszlo Barabasi and Reka Albert, “Emergence of Scaling in Random Networks,” Science 286, pp. 509-512, 2001 [20] M. L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problems”, Management Science, vol. 27, pp. 1-18, 1981 [21] A. M. Geoffrion, “Lagrangean Relaxation and its use in Integer Programming,” Mathematical Programming Study, vol. 2, pp. 82-114, 1974 [22] M. Held, et al., “Validation of subgradient optimization,” Math. Programming, vol. 6, pp. 62-88; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54247; http://ntur.lib.ntu.edu.tw/bitstream/246246/54247/1/ntu-94-R92725012-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54247
http://ntur.lib.ntu.edu.tw/bitstream/246246/54247/1/ntu-94-R92725012-1.pdf

View record in BASE

20

Academic Journal

無線感應器網路系統生存時間最大化之高效能路由演算法 ; An Energy-efficient Routing Algorithm for the Maximization of System Lifetime in Wireless Sensor Networks

المؤلفون: 葉耿宏, Yeh, Keng-Hung

المساهمون: 林永松, 臺灣大學：資訊管理學研究所

مصطلحات موضوعية: 拉格蘭日鬆弛法, 高效能, 最佳化, 路由演算法, 數學規劃, 無線感應器網路, Wireless Sensor Network, Lagrangean Relaxation, Mathematical Programming, Optimization, Energy-efficient, Routing Algorithm

وصف الملف: 528651 bytes; application/pdf

Relation: [1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, Vol. 40, no. 8, pp. 102-114, Aug. 2002. [2] M. Bhardwaj and A. P. Chandrakasan, “Bounding the lifetime of sensor networks via optimal role assignments,” Proc. of INFOCOM 2002, Vol. 3, pp. 1587-1596, June 2002. [3] J. H. Chang and L. Tassiulas, “Energy conserving routing in wireless ad-hoc networks,” Proc. of INFOCOM 2000, Vol. 1, pp. 22-31, March 2000. [4] E. J. Duarte-Melo and M. Liu, “Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks,” Proc. of GLOBECOM '02, Vol. 1, pp. 21-25, Nov. 2002. [5] M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems”, Management Science, vol. 27, pp.1-18, 1981. [6] A. M. Geoffrion, “Lagrangean relaxation and its use in integer programming”, Math. Programming Study, vol. 2, pp.82-114, 1974. [7] W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” Proc. of the 33rd Annual Hawaii International Conference on System Sciences, pp. 3005-3014, Jan. 2000. [8] W. R. Heinzelman, J. Kulik and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Proc. of MobiCom’99, Aug. 1999. [9] M. Held, et al., “Validation of subgradient optimization,” Math. Programming, vol. 6, pp. 62-88, 1974. [10] C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Proc. of the 6th annual ACM/IEEE Conference on Mobile Computing and Networking (MOBICOM), pp.56-67, Aug. 2000. [11] A. Manjeshwar and D. P. Agrawal, “TEEN: a routing protocol for enhanced efficiency in wireless sensor networks,” Proc. of 15th International Parallel and Distributed Processing Symposium, pp. 2009-2015, April 2001. [12] A. Manjeshwar and D. P. Agrawal, “APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks,” Proc. International of Parallel and Distributed Processing Symposium (IPDPS 2002), pp.195-202, April 2002. [13] G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,” ACM Communications, Vol. 43, no. 5, pp.51-58, May 2000. [14] V. Raghunathan, C. Schurgers, S. Park and M. B. Srivastava, “Energy-aware wireless microsensor networks,” IEEE Signal Processing Magazine, Vol. 19, no. 2, pp. 40-50, March 2002. [15] C. Schurgers and M. B. Srivastava, “Energy efficient routing in wireless sensor networks,” IEEE Military Communications Conference (MILCOM 2001), Vol. 1, pp. 357-361, Oct. 2001. [16] M. A. M. Vieira, D. C. da Silva Jr., C. N. Coelho. Jr. and J. M. da Mata, “Survey on wireless sensor network devices,” Proc. of ETFA '03, Vol. 1, pp. 537-544, Sept. 2003. [17] J. Zhu and S. Papavassiliou, “On the energy-efficient organization and the lifetime of multi-hop sensor networks,” IEEE Communications Letters, Vol. 7, no. 11, pp. 537-539, Nov. 2003. [18] G. Zussman and A. Segall, “Energy efficient routing in ad hoc disaster recovery networks,” Proc. of INFOCOM 2003, Vol. 1, pp. 682-691, March/April 2003.; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/54270; http://ntur.lib.ntu.edu.tw/bitstream/246246/54270/1/ntu-93-R91725017-1.pdf

الاتاحة: http://ntur.lib.ntu.edu.tw/handle/246246/54270
http://ntur.lib.ntu.edu.tw/bitstream/246246/54270/1/ntu-93-R91725017-1.pdf

View record in BASE

تنقيح النتائج