El trabajo futuro puede enfocarse en las siguientes líneas:
7.3.1.
Técnicas de indexación para repositorios de servicios
El soporte para la indexación es necesario para repositorios grandes ya que el número de servicios a comparar es muy alto. De esta manera, la búsqueda en repositorios grandes de servicios para analizar la similaridad entre dos servicios es un proceso computacional costoso [93]. Dado a que nuestra propuesta de descubrimiento basada en comportamiento, se basa en emparejamiento de grafos, y considerando que muchas aproximaciones han sido propuestas para la indexación de bases
100
de datos (Ver [186],[187] ), un trabajo futuro puede explorar cual es el mecanismo de indexación mas apropiado para el proceso de descubrimiento de servicios.
7.3.2.
Información semántica para el descubrimiento basado en QoS
Otros de los ejes en los cuales se puede mejorar el proceso de descubrimiento es la inclusión sobre semántica asociada con la calidad del servicio. Nuestra propuesta no incluye información semántica sobre los servicios. La inclusión de este tipo de información puede enriquecer la tanto la descrición de los servicios como la definición de los requerimientos de consulta del usuario [188].
7.3.3.
Evaluación de la calidad del descubrimiento
La evaluación de la calidad del proceso de descubrimiento de servicios es un proceso dispendioso debido a la cantidad de datos y la necesidad de la intervención humana. En este trabajo hacemos uso de la técnica de validez de construcción para validar los resultados de la herramienta de comparación de servicios basada en comportamiento y en calidad del servicio. Sin embargo, un futuro campo de investigación puede ser la exploración de nuevas técnicas que mejoren la evaluación de la calidad del proceso de descubrimiento.
7.3.4.
Composición de servicios geográficos ambientales
El descubrimiento es solo un parte del proceso de composición automático de servicios geográficos para el dominio de la gestión ambiental del recurso hídrico. En este trabajo solamente se presentan aportes en el área del descubrimiento de servicios. Por lo anterior, una línea muy importante de investigación futura se asocia con la composición automática de servicios geográficos, que involucra muchos otros aspectos, entre los que se encuentra la generación automática de adaptadores para resolver las diferencias entre los servicios emparejados de forma aproximada.
Bibliografía
[1]L. Burbano, “Indicadores Biológicos en Ecosistemas Acuáticos Continentales”. Universidad del Cauca. Tech, Rep. Ag. 2006. http://ariadna.unicauca.edu.co/indicadores.doc. Last accessed on June 5, 2007.
[2]Z. Peng, M. Tsou. “Internet GIS: Distributed Geographic Information Services for the Internet and Wireless Networks” John Wiley and Sons, 2003
[3] J. Zhang, et al. "Design and development of Distributed Virtual Geographic Environment system based on web services". Information Sciences: an International Journal 177(19): 3968-3980, 2007.
[4] "OpenGIS Abstract Specification, Topic 12: OpenGIS Service Architecture,". Jan. 2002; www.opengis.org/techno/abstract02-112.pdf. Last accesed: Jan 2007.
[5] J.C. Corrales, D. Grigori, M. Bouzeghoub, and A. Ordonez. Conversation protocol matchmaking. In Proc. of Euro American Conference on Telematics and Information Systems., pages 67–74, 2006.
[6] A. Ordoñez, et al. “Sistema Integrado de Información sobre el Recurso Agua SIRA”. Proc. GIS Day Universidad del Cauca. Popayán, Noviembre.2006.
[7] D. Grigori, J.C. Corrales, and M. Bouzeghoub. Behavioral matchmaking for service retrieval. In Proc. of The IEEE International Conference on Web Services (ICWS), pages 145–152, 2006.
[8] J.C. Corrales, D. Grigori, and M. Bouzeghoub. Behavioral matchmaking for service retrieval: application to conversation protocols. In Proc of 22e`mes Journe´es Bases de Donne´es Avance´es, BDA, 2006.
[9] J.C. Corrales, D. Grigori, and M. Bouzeghoub. Decouverte de services basee sur leurs protocolesde conversation. In Ingenierie des systemes d’information (ISI), volume 12, pages 9–32, 2007.
[10] A. Barros, M. Dumas, and P. Oaks. Standards for web service choreography and orchestration: Status and perspectives. In Proc. of Business Process Management Workshops, 2006.
[11] R. Milner. A calculus of communicating systems. Springer-Verlag NewYork, Inc, 1982. [12] C. A. R. Hoare. Communicating sequential processes. Prentice Hall International, 1985.
[13] J.A. Bergstra, A. Ponse, and S.A (eds) Smolka. Handbook of process algebra. North Holland, Elsevier, 2001.
[14]M. Mazzara and R. Lucchi. A pi-calculus based semantics for WS-BPEL. Journal of Logic and Algebraic Programming, 2006.
[15]J. L. Peterson. Petri net theory and the modeling of systems. In Prentice-Hall, 1981.
[16] J. Paananen. Tik-110.501 seminar on network security. http://www.tml.tkk.fi/Opinnot/Tik- 110.501/1995/intfo.html, 1995. Last accesed on January 2007.
[17] W. Van der Aalst and K. V. Hee. Workflow management- models, methods, and systems. In MIT Press, 2002.
[18] W. van der Aalst. Interorganizational workflows: An approach based on message sequence charts and petri nets. 1999.
[19] R. Hopcroft, J. E.and Motwani and J. D. Ullman. Introduction to automata theory, languages, and computation. 2001.
[20] D. Berardi, F. ROSA, L. SANTIS, and M. MECELLA. Finite state automata as conceptual model for e- services. 2003.
[21] G. Weikum. Towards guaranteed quality and dependability of information services. 1999.
[22] H. Bunke. Graph matching: Theoretical foundations, algorithms, and applications. pages 82–88, 2000. [23] O. Gerbe, R. Keller, , and G. Mineau. Conceptual graphs for representing business processes in corporate memories. 1998.
[24] J. Mendling and J. Ziemann. Transformation of bpel processes to epcs. In Proc. of the 4th GI Workshop on Event-Driven Process Chains (EPK2005), 2005.
[25] W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. PAMI 8, pages 749–764, 1995.
[26] R. Wilson and E. Hancock. Graph matching by discrete relaxation. Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems, pages 165–176, 1994.
[27] A. Branca, E. Stella, and A. Distante. Qualitative scene interpretation using planar surfaces. Au- tonomous Robots, 8(2):129139, 2000.
[28] C. Pautasso and G Alonso. Visual composition of web services. In Proceedings of the 2003 IEEE Symposium on Human Centric Computing Languages and Environments, pages 92–99, 2003.
[29] Special section on graph algorithms and computer vision. IEEE Trans. PAMI, 23(10):1049–1151,2001. [30] J.R. Ullman. An algorithm for subgraph isomorphism. Journal of the Association for Computing, 23(1):31–42, 1976.
[31] J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software- Practice and Experience, 12:23–34, 1982.
[32] G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341–354, 1972.
[33] M. Pelillo. A unifying framework for relational structure matching. In Proceedings of the 14th ICPR, 1998.
[34]M.A. Eshera and K.S. Fu. A graph distance measure for image analysis. IEEE Trans. SMC 14, pages 398–408, 1984.
[35] A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recog- nition. IEEE Transactions on Systems, Man, and Cybernetics, 13(5):353–363, 1983.
[36] L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell., 3, 1981.
[37] W.H. Tsai and K.S. Fu. Error-correcting isomorphisms of attributed relational graphs for pattern recognition. IEEE Trans. SMC, 9:757–768, 1979.
[38] E.K. Wong. Three-dimensional object recognition by attributed graphs. Syntactic and Structural Pattern Recognition-Theory and Applications, pages 381–414, 1990.
[39] H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3-4):255259, 1998.
[40] J. Llados, E. Marti, and J. Villanueva. Symbol recognition by error-tolerant subgraph matching be- tween region adjacency graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):11371143, 2001.
[41] H. Bunke. Error correcting graph matching: on the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9):917922, 1999.
[42] B. T. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(5):493504, 1998.
[43] H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18(8):689694, 1997.
[44] M. Fernandez and G. Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22(6-7):753758, 2001.
[45]J. F. Sowa. Conceptual structures: Information processing in mind and machine. Addison-Wesley,1984. [46]John F. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Foundations, Brooks Cole Publishing Co., Pacific Grove, CA, ©2000. Actual publication date, 16 August 1999.
[47] J. Baget and M. Mugnier. Extension of simple conceptual graphs: the complexity of rules and constraints. Artificial Intelligence Research, 16:425465, 2002.
[48] S. Gao and J. Shah. Automatic recognition of interacting machining features based on minimal condition subgraph. Computer Aided Design, 30(9):727739, 1998.
[49] R. Bacik. Structure of Graph Homomorphism. PhD thesis, Simon Fraser University, Canada, 2001. [50] H. Bunke and S. Gunter. Weighted mean of a pair of graphs. Computing, 67(3):209224, 2001.
[51] X. Jiang, A. Munger, and H. Bunke. On median graphs: Properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):11441151, 2001.
[52] B. T. Messmer and H. Bunke. Efficient subgraph isomorphism detection: a decomposition ap- proach. IEEE Transactions on Knowledge and Data Engineering, 12(2):307323, 2000.
[53] H. Bunke. Recent advances in structural pattern recognition with applications to visual form anal- ysis. In Proceedings of the Fourth International Workshop on Visual Form IWVF4, 2001.
[54]J. Feng, M. Laumy, and M. Dhome. Inexact matching using neural networks. Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems, pages 177–184, 1994.
[55] L. Xu and E. Oja. Improved simulated annealing, boltzmann machine, and attributed graph match- ing. In L.Almeida (ed): LNCS 41 Springer Verlag2, pages 151–161, 1990.
[56] D. Riviere, J. Mangin, D. Papadopoulos, J. Martinez, V. Frouin, and J. Regis. Automatic recogni- tion of cortical sulci of the human brain using a congregation of neural networks. Medical Image Analysis, 6(2):7792, 2002.
[57] A. Cross, R. Wilson, and E. Hancock. Genetic search for structural matching. In Proceedings of the Computer Vision - ECCV, pages 514–525, 1996.
[58] Y.-K. Wang, K.-C. Fan, and J.-T. Horng. Genetic-based search for error-correcting graph isomor- phism. IEEE Trans. SMC 27, 4:588–597, 1997.
[59] R. Myers and E. R. Hancock. Least-commitment graph matching with genetic algorithms. Pattern Recognition, 34(2):375394, 2001.
[60] S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. PAMI 10, pages 695–703, 1988.
[61] H. Almohamed. A linear programming approach for the weighted graph matching problem. IEEE Trans. PAMI 15, pages 522–525, 1993.
[62] V. et al. Cantoni. 2-d object recognition by multiscale tree matching. Pattern Recognition 31, pages 1443–1455, 1998.
[63] K. Oflazer. Error-tolerant retrieval of trees. IEEE Trans. PAMI 19, pages 1376–1380, 1997.
[64] M. Pelillo, K. Siddiqi, and S. Zucker. Matching hierarchical structures using associated graphs.IEEE Trans. PAMI 21, pages 1105–1120, 1999.
[65] J. et al. Wang. An algorithm for finding the largest approximately commen substructure of two trees. IEEE Trans. PAMI 20, pages 889–895, 1998.
[66] K. Shearer, H. Bunke, and S. Venkatesh. Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition, 34(5):10751091, 2001.
[67] B. T. Messmer and H. Bunke. Error-correcting graph isomorphism using decision trees. Interna- tional Journal of Pattern Recognition and Artificial Intelligence, 12(6):721742, 1998.
[68] B. T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detec- tion. Pattern Recognition, 32:1979–1998, 1999.
[69] N. Kokash, W. van den Heuvel, and V. D’Andrea. Leveraging web services discovery with cus- tomizable hybrid matching. In Proc. of ICSOC, pages 522–528, 2006.
[70] E. Stroulia and Y. Wang. Structural and semantic matching for assessing web-service similarity. Int. J. Cooperative Inf. Syst., 14(4):407–438, 2005.
[71] M. Saboua and J. Panb. Towards semantically enhanced web service repositories. Web Semantics: Science, Services and Agents on the World Wide Web, 5:142–150, 2007.
[72] L. Dong, A. Halevy, J. Madhavan, E. Nemes, , and J. Zhang. Similarity search for web services. In Proc. of VLDB, 2004.
[73]M. David, M. Paolucci, S. McIlraith, M. Burstein, D. McDermott, D. McGuinness, B. Parsia, T. Payne, M. Sabou, M. Solanki, N. Srinivasan, and K. Sycara. Bringing semantics to web services: The owl-s approach. In Proc of the First International Workshop on Semantic Web Services and Web Process Composition, 2004.
[74] M. Dean and G. Schreiber. Owl web ontology language reference. In w3c recommendation, pages http://www.w3.org/TR/owl–ref. Last accessed on September 2007, 2004.
[75] L. C. Chiat, L. Huang, and J. Xie. Matchmaking for semantic web services. In Proc of Services Computing, 2004 IEEE International Conference on (SCC’04), 2004.
[76] L. Li and I. Horrocks. A software framework for matchmaking based on semantic web technology. In Proc of WWW 2003, pages 331–339, 2003.
[77] M. Paolucci, T. Kawamura, T. R. Payne, and K. Sycara. Semantic matching of web services capa- bilities. In Proc. of ISWC, 2002.
[78] A. Bernstein and M. Klein. Towards high-precision service retrieval. In Proc. of ISWC, 2002.
[79] B. Benatallah, M.S. Hacid, C. Rey, and F. Toumani. Semantic reasoning for web services discovery.In Proc. of ESSW, 2003.
[80] D. Trastour, C. Bartolini, and J. Gonzalez-Castillo. A semantic web approach to service description for matchmaking of services. In Proc. of SWWS, 2001.
[81] Abhijit Patil, Swapna Oundhakar, A. Sheth, and Kunal Verna. Meteor-s web service annotation framework. In Proc. of WWW Conference, 2004.
[82] K. Sivashanmugam, K. Verma, A. Sheth, , and J. Miller. Adding semantics to web services stan- dards. In Proc of the the 1st International Conference on Web Services (ICWS’03), 2003.
[83] T. Kawamura, J.A. De Blasio, T. Hasegawa, M. Paolucci, and K. Sycara. A preliminary report of a public experiment of a semantic service matchmaker combined with a uddi business registry. In Proc. of ICSOC, 2003.
[84] J. Cardoso and A. Sheth. Semantic e-workflow composition. Journal of Intelligent Information Systems, 21:191–225, 2003.
[85] J. Wu and Z. Wu. Similarity-based web service matching. In Proc. of IEEE SCC, 2005.
[86]S. S. Bansal and J. M. Vidal. Matchmaking of web services based on the DAML-S service model. In Proc. of AAMAS, pages 926–927, 2003.
[87] G. Piccinelli, G. Di Vitantonio, and L. Mokrushin. Dynamic service aggregation in electronic marketplaces. Computer Networks, 2(37), 2001.
[88] A. Wombacher, B. Mahleko, P. Fankhauser, and E. Neuhold. Matchmaking for business processes based on choreographies. In Proc. of EEE, 2004.
[89]B. Benatallah, F. Casati, and F. Toumani. Analysis and management of web services protocols. In Proc. of ER, 2004.
[90] L. Bordeaux, G. Salan, D Berardi, and M. Mecella. When are two web services compatible? In Proc. of TES, 2004.
[91] N. Ould, A. M’Bareck, and S. Tata. Bpel behavioral abstraction and matching. In Business Process Management Workshops, pages 495–506, 2006.
[92] Li Kuang, Ying Li, Shuiguang Deng, Jian Wu, Wei Shi, and Zhaohui Wu. Expressing service and query behavior using pi-calculus for matchmaking. In Proc of the 2006 IEEE/WIC/ACM Interna- tional Conference on Web Intelligence, pages 629–632, 2006.
[93] B. Mahleko and A. Wombacher. Indexing business processes based on annotated finite state au- tomata. In Proc. of The IEEE International Conference on Web Services (ICWS’06), pages 303–311, 2006.
[94] Z. Shen and J. Su. Web services discovery based on behavior signatures. In Proc. of IEEE SCC,2005. [95] L.Fuentes y A.Vallecillo. “Una Introducción a los Perfiles UML”. Novática: Revista de la Asociación de Técnicos de Informática, ISSN 0211-2124, Nº. 168, 2004 (Ejemplar dedicado a: UML e Ingeniería de Modelos), pags. 6-11
[96] J. Davidson. 2001. OGC General Services Model GSM En Línea, disponible: http://www.intl- interfaces.net/servicemodel/gsm/gsm-2001-08-15.html. OGC.
[97]D. Gouscos, M. Kalikakis, and P. Georgiadis. 2003. “An Approach to Modeling Web Service QoS and Provision Price”. Proceedings of the 1st International Web Services Quality Workshop, Rome, Italy, pp.1-10, 2003.
[98] OpenGIS® Simple Features Implementation Specification for OLE/COM 1.0. [99] OpenGIS® Simple Features Implementation Specification for CORBA 1.0.
[100]S. Tu y M. Abdelguerfi 2006. Web Services for Geographic Information Systems. IEEE Internet Computing. Vol.10, No5.
[101] OGC 2005. Open GIS Web Services Architecture Description. Best Practices Paper Reference number OGC 05-042r2. Arliss Whiteside Ed.
[102]A. Rajabifard, F. Williamson, I.P. (2001). Spatial Data Infrastructures: Concept, SDI Hierarchy and Future directions, Proceedings of GEOMATICS’80 Conference, 29 April-2 May 2001, Tehran, Iran
[103] L. McKee. (1996) Building the GSDI—discussion paper for the September 1996 Emerging Global Spatial Data Infrastructure Conference. Proceedings of the 1996 Conference on Emerging Global Spatial Data Infrastructure, Konigswinter, Bundesrepublik, Deutschland (Germany). September, 1996. European Umbrella Organization for Geographical Information (EUROGI): 19 Pp
[104]D.Nebert. Whiteside, A. 2004. Open Gis Consortium: Open Gis Catalogue Services Specification. OGC- 04-021r2 .v.2.0.
[105]GeoNetwork. Geonetwork project. http://sourceforge. net/projects/geonetwork
[106] Deegree. Bloques de construcción para Infraestructuras de Datos Espaciales basados en las especificaciones del OGC. (http://www.deegree.org/)
[107]American National Standards Institute. (1985). American national standard Z39.2-1985: Bibliographic information interchange. New York:American National Standards Institute.
[108] A. Busch, F. Willrich, 2000. “Quality management of atkis data”. Paper presented at OEEPE/ISPRS joint workshop on Spatial Data Quality Management, Instanbul.
[109] ITU-T, 1994. “Terms and Definitions related to Quality of Service and Network Performance including Dependability”. ITU-T Recommendation E.800. ITU-T.
[110] L. Franken, 1996. Quality of Service Management: A Model-Based Approach. PhD thesis, Centre for Telematics and Information Technology.
[111]ITU/ISO, 1995. “Open Distributed Processing - Reference Model Part 2: Foundations” International standard 10746-2, ITU-T Recommendation X.902.
[112] M.Woodside, D. Menascé. Application-Level QoS. IEEE Internet Computing. Vol. 10, Num. 3. 2006 [113] D. Menascé. Composing Web Services: A QoS View. IEEE Internet Computing. 2004.
[114]R. Onchaga. 2004 Modelling For Quality Of Services In Distributed Geoprocessing. International Institute for Geo-Information Science and Earth Observation ITC. Netherlands
[115] ISO/TC211 2002. ISO/DIS 19119 Geographic Information Services. ISO.
[116]R. Al-Ali, O. Rana, D. Walker S. Jha & S. Sohail. 2002. “G-QoSM: Grid Service Discovery Using QoS Properties”. Department of Computer Science, Cardiff University. Department of Computer Science and Engineering, UNSW, Sydney, Australia.
[117] L. O’Brien, L. Bass, P. Merson., 2005 “Quality attributes and service oriented architectures” Software Architecture Technology Initiative. CMU-SEI.
[118] ISO/IEC, 1998. ISO/IEC 13236 “Information Technology – Quality of Service: Framework”, Geneva, Switzerland.
[119] R. Onchaga, 2005a. “On Quality of Service and Geo-service Compositions”. International Institute for Geo-Information Science and Earth Observation ITC.
[120]R. Devillers, M. Gervais, Y. Bedard, R. Jeansoulin, 2002. “Spatial data quality: From metadata to quality indicators and contextual end-user manual”. Paper presented at OEEPE/ISPRS joint workshop on Spatial Data Quality Management, Instanbul.
[121] A. Smith, 2002. “Spatial data quality management at ordinance survey”. Paper presented at OEEPE/ISPRS joint workshop on Spatial Data Quality Management, Instanbul.
[122] R. Onchaga. 2006 Modelling For Quality Of Services In Distributed Geoprocessing. International Institute for Geo-Information Science and Earth Observation ITC. Netherlands.
[123]D. Xu, 1994. “An integrated and QoS-Aware framework for multimedia service management”. Doctoral Thesis in philosophy in computer science. B.S Zhongshan University.
[124] M. Radwan. and Morales, J., 2002. “Extending geoinformation services: a virtual architecture for spatial data infrastructures”. The International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol. 34.
[125]A. Simonis. 2005. “Quality of Service in a Global SDI”. FIG Working Week 2005 and GSDI-8. Session TS 14 - SIM and Quality; Paper TS14.6 Cairo, Egypt April 16-21.
[126] S. Ran. 2004. “A Model for Web Services Discovery with QoS”. SIGEcom Exchanges, vol. 4, no. 1, 2004, pp. 1–10.
[127] E. Maximilien. y M. Singh. 2002. “Conceptual Model of Web Services Reputation”. ACM SIGMOD Record, 36-41, 2002.
[128] C. Zhou, L. Chia y B. Lee. 2004. “DAML-QoS Ontology for Web Services”. Proceedings. IEEE International Conference on Web Services, 472-479, 2004.
[129] A. Zeng, B. Benatallah, A. Ngu, M. Dumas, Kalagnanam, y J. Chang. “QoS-Aware Middleware for Web Services Composition”. IEEE Transactions on software Engineering. Vol. 30.N.5.
[130] F.Buschmann, R. Meunier, H. Rohnert, P. Sommerlad, M. Stal. 1996. Pattern-Oriented Software Architecture. 2da.Ed, Volume 1: A System of Patterns. Wiley.
[131] M. Rodríguez. “Arquitectura cognitiva para el diseño de entornos telemáticos de enseñanza y aprendizaje”. Tesis doctoral licenciado en informática. universidad nacional de educación a distancia escuela técnica superior de ingenieros industrialesdepartamento de ingeniería eléctrica, electrónica y de control 2002: [132] M. Niño. “Metamodelo de evaluacion la educacion en linea”. Tesis de maestría, escuela de ingeniería de sistemas universidad industrial de santander. 2003.
[133]J. Fuentes et al. "Errors in the uml metamodel?". ACMsigsoft software engineering notes, 28(6), nov 2003
[134]L. Plazaola, E. Silva, N. Vargas, J. Flores, M. Ekstedt, "A Metamodel for Strategic Business and IT Alignment Assesment" In proceeding of conference on systems engineering research (CSER 2006), Los Angeles, USA, Abril 2006.
[135] A. Kleppe, S. Warmer, W. Bast, "MDA Explained. The Model Driven Architecture: Practice and Promise", Addison- Wesley, April 2003
[136] J.M. Favre, "Foundations of Model (driven) (Reverse) Engineering - Episode I: Story of the Fidus Papyrus and the Solarus",post-proceedings of Dagsthul Seminar on Model Driven Approaches for Language Engineering, May 2004 in Series "From Ancient Egypt to Model Driven Engineering". http://www- adele.imag.fr/mda. Last accesed on January 2007.
[137] J.M. Favre, "Foundations of Meta-Pyramids: Languages and Metamodels - Episode II: Story of Thotis the Baboon", postproceedings of Dagsthul Seminar on Model Driven Approaches for Language Engineering, May 2004, in Series "From Ancient Egypt to Model Driven Engineering". http://www-adele.imag.fr/mda. Last accesed on January 2007.
[138] Meta Object Facility (MOF) Specification" Version 1.4, April 2002. [139] E. Seidewitz, "What Models Mean", IEEE Software, September 2003.
[140]J. Martínez et. al. “Cauca región líder en el manejo integral del agua, recurso articulador entre el entorno natural y la actividad humana para la competitividad regional,” Grupo de Estudios Ambientales, Universidad del Cauca, Ago. 2006. http:// ariadna.unicauca.edu.co/CAUCA_1.pdf. Last accessed on June 2007.
[141]GSDI. “Spatial Data Infrastructure Cookbook v2.0” GSDI, Jan. 2004. http://www.gsdi.org/gsdicookbookindex.asp. Last accessed on June 2007.
[142] UNESCO. 2006. Water a shared responsibility. The United Nations World Water Development Report 2. Berghahn Books.
[143] Minambiente. 2007. Ministerio de Ambiente, Vivienda y Desarrollo Territorial. Gestión Integral del Agua. Dirección de Agua Potable y Saneamiento Básico y Ambiental. En línea, disponible en: http://www.minambiente.gov.co/admin./contenido/documentos/gestionintegraldelagua.pdf. Bogotá.
[144] IDEAM. 2007. Instituto de Hidrología, Meteorología y Estudios Ambientales. Ministerio del Medio Ambiente. http://www.ideam.gov.co.
[145] IDEAM. 2006. Estudio Nacional del Agua. Instituto de Hidrología, Meteorología y Estudios Ambientales. Ministerio del Medio Ambiente. http://www.ideam.gov.co/biblio/paginaabierta/guia.pdf [146] M. Vargas. Nelson O. 2004. Monitoreo de Aguas Subterráneas. Documento sin publicar. [147] OGC 2006. OpenGIS® Catalogue Services - ebRIM ISO/TS 15000-3 profile of CSW. V 1.0.
[148]OMS. 2007. Guidelines for Drinking Water Quality: Vol.1 Recommendations. World Health Organization. Geneva. En línea. Disponible en: http://www.who.int/water_sanitation_health/dwq/gdwq3. [149] Cinara. 2002. Seminario Taller Aprovechamiento Integral del Recurso Hídrico con Énfasis en Riego, Drenaje y Sostenibilidad. Universidad del Valle. Santiago de Cali; CINARA; 540 p.
[150] N. Navarro. Congreso Ibérico sobre Gestión y Planificación de Aguas. 2001. 750 p. Universidad de Zaragoza. Zaragoza, España.
[151] M. Hernández, M. Estudio de la Calidad del Agua, Estado Trofico y Caracterización de Factores Físicos de la Laguna de Sonso. Universidad del Valle Escuela de Recursos Naturales y el Ambiente. Maestría en Ingeniería Énfasis en Ingeniería Sanitaria y Ambiental. Santiago de Cali.