O. Dominguez-Ramirez, L. R. Samperio-Llano, V. López-Morales, M. I. Rivera-Gonzalez, M. J. Pozas-Cárdenas, R. Lopez-Hernandez, L. Sanchez-Reyes, J. S. Cansino, Gustavo Núñez Esquer, E. A. Escotto-Cordova, M. Perez-Mendoza, N. A. Sanchez-Cortes
{"title":"Technology of haptics interfaces with purposes of diagnosis of patient with neuropsychological illnesses","authors":"O. Dominguez-Ramirez, L. R. Samperio-Llano, V. López-Morales, M. I. Rivera-Gonzalez, M. J. Pozas-Cárdenas, R. Lopez-Hernandez, L. Sanchez-Reyes, J. S. Cansino, Gustavo Núñez Esquer, E. A. Escotto-Cordova, M. Perez-Mendoza, N. A. Sanchez-Cortes","doi":"10.1109/ENC.2004.1342615","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342615","url":null,"abstract":"Several disfunctions exist in the haptic perception as a consequence of lesions in the cerebral crust and have been studied by the neuropsychology for many years. The stored information of the experiment, with the classic procedure that allows to make a diagnosis, doesn't exist. To solve this problem, our proposal it is to use a realistic active haptic interface based on a dynamic virtual environment and a haptic device with high electromechanical properties.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127435728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A programming language for local computations in graphs! Computational completeness","authors":"M. Mosbah, R. Ossamy","doi":"10.1109/ENC.2004.1342583","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342583","url":null,"abstract":"We have developed a new programming language for implementing distributed algorithms encoded by means of local computations. This language, called Lidia, is based on a two-level transition system model: the first level is used to specify the behavior of each single component, whereas the second level captures their interactions. Transitions are basically expressed in a precondition-effect style. Lidia depends on a logic L/sub /spl infin//* that is used to express the preconditions of each transition. The main topic of This work is to present the L/sub /spl infin//* language and to bring out some of its basic properties. Moreover, we take advantage of these properties to define a class of distributed algorithms encoded by means of local computations that can be implemented in our programming language. The completeness of Lidia, related to the use of users defined functions, represents the main result of This work.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126559058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimization of time series forecasting by combination of models with evolutionary heuristic and error-correlation parameters","authors":"E. Bautista-Thompson, J. Figueroa-Nazuno","doi":"10.1109/ENC.2004.1342622","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342622","url":null,"abstract":"Two algorithms for the optimization of time series forecasting by combination of models are proposed and evaluated. The first named GABoost, exploits the heuristic of genetic algorithm in order to search the optimal weights for the mixing of forecasting models. The second named CombFEC, extracts information provided by the forecast errors (RMSE, BE and MAE) of each model to be combined, and the correlation between each model and the forecasted time series, in order to build an error-correlation function (FEC) used to calculate the weights with a SOFTMAX function. The results show that both algorithms are able to improve the forecasting of different time series, reducing the forecast error (RMSE) and increasing the modeling capability expressed by a reduction of the bias error (BE).","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122041007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sensor-based probabilistic roadmaps for car-like robots","authors":"Abraham Sánchez López, R. Zapata","doi":"10.1109/ENC.2004.1342618","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342618","url":null,"abstract":"This work deals with the sensor-based motion planning problem for car-like robots. Sensor-based versions of PRM and Lazy-PRM are used to exploit the information obtained from sensors and to compute a feasible collision-free path. The algorithm tries to reach the goal by executing the local method in the known free region. If it succeeds, a feasible path to the goal is found and the algorithm finishes. Otherwise, the algorithm executes more scans to extend its free space, and so on. Experimental results are promising.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatic metadata-based development","authors":"G. Padilla, Yuri Paez","doi":"10.1109/ENC.2004.1342625","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342625","url":null,"abstract":"Time-to-release is a challenge for organizations which develop software systems. A special kind of system, called information system (IS), can be modeled as a set of data catalogues. A data catalogue can be conceived as a functional data-depending unit composing the IS. An IS usually contains hundreds of data catalogues. Each data catalogue has its own user interface, constraints, and functionalities such as a built-in query tool, a printer tool, a filter tool, etc. This work describes a successful technical strategy developed to reduce the system coding and testing time. The technical strategy is based on metadata descriptions of data catalogues and a run-time component-based framework called data catalogue infrastructure (DCI). This work describes the most important elements of the DCI. Some measurements about the coding and testing time in real projects are presented. These measurements show a significant reduction in coding and testing time with a rate around 80%.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Genoveva Vargas-Solar, L. García-Bañuelos, J. Zechinelli-Martini
{"title":"Toward aspect oriented services coordination for building modern information systems","authors":"Genoveva Vargas-Solar, L. García-Bañuelos, J. Zechinelli-Martini","doi":"10.1109/ENC.2004.1342627","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342627","url":null,"abstract":"This work analyzes current challenges for building modern information systems (e.g., e-commerce, B2B, E2E). Indeed the emergence of Internet, data exchange and communication protocol standards for the Internet has lead to a new paradigm for the construction of information systems. Similar to orchestra partitions, information systems are built by coordinating existing distributed and autonomous building blocks called services. Existing technology and academic efforts have tackled application logic (functional aspects) description and enactment. Yet, nonfunctional aspects such as persistence, security, exception handling and transactions have been poorly analyzed. Currently, nonfunctional aspects are implemented as ad-hoc solutions and they are hard coded within the application logic code. This approach leads to systems which are difficult to maintain and scale which essentially contradicts the spirit of construction of service based systems today. In order to tackle, this problem, This work presents how aspect oriented programming (AOP) can be used for enabling the separation of nonfunctional and functional code from application logic specified as a coordination of services.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A UML sequence diagram extension to handle multiplicities","authors":"G. Padilla, Miguel A. Serrano, C. M. D. Oca","doi":"10.1109/ENC.2004.1342592","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342592","url":null,"abstract":"The use of UML diagrams to specify a system is a well-known practice among software engineers. UML sequence diagrams (SDs) are commonly used to specify scenarios describing message exchanging among objects. A multiplicity is an important modeling attribute that can be used to define cardinalities between classes in class diagrams. The UML metamodel, which is contained within the UML specification version 1.5, specifies that SDs can be constructed at two levels of abstraction: the instance level (i.e., using objects or concrete instances of classes) and the classifier level (i.e., using classes or classifiers). The UML specification states that SDs at classifier level can be constrained with multiplicities but it is not prescribed how to denote the multiplicities neither how to interpret them (i.e., its semantics). We propose a notation to specify multiplicities in SDs at classifier level of abstraction as well as an interpretation based on a UML metamodel extension. This extension uses inline expressions which are constructs provided by a similar notation called message sequence charts.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"707 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132353436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CaLi, efficient library for cache implementation","authors":"J. Zola","doi":"10.1109/ENC.2004.1342636","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342636","url":null,"abstract":"We present CaLi, a C++ framework for distributed and local cache systems. Following the paradigm of generic programming the library provides a set of concepts to allow flexible and efficient implementations of caching systems. We describe the principal abstractions comprising CaLi, the data structures and management policies, and provide a brief description of basic models implemented in the library. Finally, we give the experimental results that demonstrate efficiency of the basic operations performed on the cache.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132312675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the algorithm of Berztiss for tree pattern matching","authors":"G. Valiente","doi":"10.1109/ENC.2004.1342587","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342587","url":null,"abstract":"The tree pattern matching problem over labeled trees is addressed in This work. Several tree pattern matching algorithms are known which are based on the decomposition of the pattern into strings, with each string representing a root-to-leaf path. Among these, Alfs T. Berztiss gave a simple tree pattern matching algorithm which remained unknown to the research community. The tree pattern matching algorithm of Berztiss is reviewed, its correctness is established, and its complexity is shown to be O(mn) time and space in the worst case and O(n) on the average, where n is the text size and m is the pattern size.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132482901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Neural networks and machine learning: towards fully automated learning","authors":"T. Martinez","doi":"10.1109/ENC.2004.1342580","DOIUrl":"https://doi.org/10.1109/ENC.2004.1342580","url":null,"abstract":"Neural networks and machine learning algorithms (hereafter NN) represent a dramatic departure from conventional programming techniques. Rather than explicitly build a program to solve a problem, one presents examples (training set) of a particular application to the NN and the NN adjusts itself in a self-organizing fashion to solve the training set. It can then be presented new examples on which it was not trained (test set) and the NN will generalize to give a good answer. For example, a doctor goes through years of training to learn to diagnose disease on the basis of a set of symptoms. An NN would solve this problem by first learning a training set made up of symptoms with the correct diagnoses, and then generalizing to a diagnosis when presented with new symptoms on which it was not trained. For many tasks the NN approaches outperform human experts and other automated techniques. This general approach is amenable to many difficult problems being faced today. This talk will review basic approaches in machine learning algorithms and then discuss latest challenges and goals. In particular, I will discuss the challenge of fully automated learning which allows minimal input from a user and requires the machine learning model to automatically discover how best to learn the problem. This includes not only deciding on features and learning parameters, but also the automatic selection of an inductive bias which will allow the learning model to achieve the highest possible accuracy.","PeriodicalId":103999,"journal":{"name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132143573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}