Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez, Dionisio de Niz
In this paper we analyze the traditional model of interrupt management and its incapacity to incorporate reliability and temporal predictability demanded on realtime systems. As a result of this analysis, we propose a model that integrates interrupts and tasks handling. We make a schedulability analysis to evaluate and distinguish the circumstances under which this integrated model improves the traditional model. The design of a flexible and portable kernel interrupt subsystem for this integrated model is presented. In addition, we present the rationale for the implementation of our design over conventional PC hardware and the analysis of its overhead. Finally, experimental results are conducted to show the deterministic behavior of our integrated model
{"title":"Real-Time Scheduling of Interrupt Requests over Conventional PC Hardware","authors":"Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez, Dionisio de Niz","doi":"10.1109/ENC.2006.26","DOIUrl":"https://doi.org/10.1109/ENC.2006.26","url":null,"abstract":"In this paper we analyze the traditional model of interrupt management and its incapacity to incorporate reliability and temporal predictability demanded on realtime systems. As a result of this analysis, we propose a model that integrates interrupts and tasks handling. We make a schedulability analysis to evaluate and distinguish the circumstances under which this integrated model improves the traditional model. The design of a flexible and portable kernel interrupt subsystem for this integrated model is presented. In addition, we present the rationale for the implementation of our design over conventional PC hardware and the analysis of its overhead. Finally, experimental results are conducted to show the deterministic behavior of our integrated model","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129130825","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}
Markus Aulkemeier, Emilio García Roselló, M. Lado, A. Méndez, J. G. Dacosta, David Martinez Torres, M. P. Cota
In many scientific and engineering domains it is necessary to develop specific software to solve complex problems. Nowadays a lot of complex algorithms and required functionalities are already provided by de facto standard CAD, CAE or CAM environments in several domains. But they often are inadequate in other concerns, particularly when specific user interfaces or integration with other systems are needed. To reuse their required functionality without those drawbacks, component-based software development appears as an interesting technology. It guaranties a faster and lower-cost development of ad-hoc software solutions, and a higher quality. Anyway, just by providing the desired functions, a software environment is not automatically a fully reusable component. In addition, some very specific features are necessary. A solution can be to encapsulate those robust software environments including their large functionality into a framework that provides fully reusable components. Even more, beyond local software development, nowadays it could be very interesting to support distributed applications development. This work presents a concrete application of that solution: a software component framework that encapsulates Matlab - a widely used system of the engineering domain - as a true set of object-oriented components. The described framework permits the developer to reuse Matlab in local and distributed application development. This framework is developed using .NET technology, being accessible within .NET software development environments, what allows the usage of the component in design-time development
{"title":"Encapsulating an engineering calculus environment in a reusable component framework","authors":"Markus Aulkemeier, Emilio García Roselló, M. Lado, A. Méndez, J. G. Dacosta, David Martinez Torres, M. P. Cota","doi":"10.1109/ENC.2006.12","DOIUrl":"https://doi.org/10.1109/ENC.2006.12","url":null,"abstract":"In many scientific and engineering domains it is necessary to develop specific software to solve complex problems. Nowadays a lot of complex algorithms and required functionalities are already provided by de facto standard CAD, CAE or CAM environments in several domains. But they often are inadequate in other concerns, particularly when specific user interfaces or integration with other systems are needed. To reuse their required functionality without those drawbacks, component-based software development appears as an interesting technology. It guaranties a faster and lower-cost development of ad-hoc software solutions, and a higher quality. Anyway, just by providing the desired functions, a software environment is not automatically a fully reusable component. In addition, some very specific features are necessary. A solution can be to encapsulate those robust software environments including their large functionality into a framework that provides fully reusable components. Even more, beyond local software development, nowadays it could be very interesting to support distributed applications development. This work presents a concrete application of that solution: a software component framework that encapsulates Matlab - a widely used system of the engineering domain - as a true set of object-oriented components. The described framework permits the developer to reuse Matlab in local and distributed application development. This framework is developed using .NET technology, being accessible within .NET software development environments, what allows the usage of the component in design-time development","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124464208","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}
The population of older people is growing rapidly worldwide, so it is necessary for all governments to provide them more services in order to improve their quality of life. In a digital era, most of these services can be provided by information technologies. However, older people have a very limited computer use due to economical, physical, sensory and cognitive barriers. In addition, few efforts have been dedicated to the design of specialized computer interfaces for them despite the fact that they have computer interaction problems with the WIMP standard (windows, icons, menus, and pointers). Recently, some researchers have shown that older people have a better computer interaction with the use of direct-manipulation devices such as digital pens than with indirect-manipulation devices such as the mouse. This research goes one step further, proposing and analyzing a pen-based interface for older people in order to explore the usability of gesture paradigm for them
{"title":"The Design and Evaluation of a Pen-Based Computer Interface for Novice Older Users","authors":"D. Arias-Torres","doi":"10.1109/ENC.2006.34","DOIUrl":"https://doi.org/10.1109/ENC.2006.34","url":null,"abstract":"The population of older people is growing rapidly worldwide, so it is necessary for all governments to provide them more services in order to improve their quality of life. In a digital era, most of these services can be provided by information technologies. However, older people have a very limited computer use due to economical, physical, sensory and cognitive barriers. In addition, few efforts have been dedicated to the design of specialized computer interfaces for them despite the fact that they have computer interaction problems with the WIMP standard (windows, icons, menus, and pointers). Recently, some researchers have shown that older people have a better computer interaction with the use of direct-manipulation devices such as digital pens than with indirect-manipulation devices such as the mouse. This research goes one step further, proposing and analyzing a pen-based interface for older people in order to explore the usability of gesture paradigm for them","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048667","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}
Ubiquitous computing seems to be an important trend to consider in the development of the next-generation software. This software will be typically distributed and embedded in a variety of devices involving a wide range of intelligence and computing power. In this trend, adequately modeling context as a mean of developing smarter applications and simplifying their interaction with users becomes a central issue in software engineering. In this paper we first outline our own comparison framework based on the level of abstraction that models allow when representing context. Later we review different approaches to model context as they have been proposed by authors in the recent years and summarize their contributions and potential weakness. Finally we classify the reviewed approaches according to the suggested comparison framework
{"title":"A Comparison of Context-Modeling Representations for Context-Aware Applications","authors":"J. S. González-Campos","doi":"10.1109/ENC.2006.1","DOIUrl":"https://doi.org/10.1109/ENC.2006.1","url":null,"abstract":"Ubiquitous computing seems to be an important trend to consider in the development of the next-generation software. This software will be typically distributed and embedded in a variety of devices involving a wide range of intelligence and computing power. In this trend, adequately modeling context as a mean of developing smarter applications and simplifying their interaction with users becomes a central issue in software engineering. In this paper we first outline our own comparison framework based on the level of abstraction that models allow when representing context. Later we review different approaches to model context as they have been proposed by authors in the recent years and summarize their contributions and potential weakness. Finally we classify the reviewed approaches according to the suggested comparison framework","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126029954","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}
In many robotic applications, the end effector consists of a gripper which has to execute a stable grasping while the manipulator is moving it in the workspace. Stable grasping is important to ensure the integrity of the object as well as the success of the overall performance. Accordingly, the end effector operation must be insensitive to external disturbances. End effector vertical acceleration is considered as a disturbance as it is able to induce slip on the grasped object. If the controller has information about this disturbance, the grasping can be more stable. In addition, if the controller can limit the disturbance, the grasping operation can be improved even more. Accordingly, an algorithm for limiting the end effector vertical acceleration to assurance stable grasping is proposed. The controller has an hierarchical architecture in order to avoid the curse of dimensionality and to deal with the information which is hierarchical in nature. The limit is calculated by a fuzzy controller which uses information from both the current applied force to the object and the actuator applied energy
{"title":"Hierarchical fuzzy control to ensure stable grasping","authors":"J. A. Domínguez-López, D. Vila-Rosado","doi":"10.1109/ENC.2006.17","DOIUrl":"https://doi.org/10.1109/ENC.2006.17","url":null,"abstract":"In many robotic applications, the end effector consists of a gripper which has to execute a stable grasping while the manipulator is moving it in the workspace. Stable grasping is important to ensure the integrity of the object as well as the success of the overall performance. Accordingly, the end effector operation must be insensitive to external disturbances. End effector vertical acceleration is considered as a disturbance as it is able to induce slip on the grasped object. If the controller has information about this disturbance, the grasping can be more stable. In addition, if the controller can limit the disturbance, the grasping operation can be improved even more. Accordingly, an algorithm for limiting the end effector vertical acceleration to assurance stable grasping is proposed. The controller has an hierarchical architecture in order to avoid the curse of dimensionality and to deal with the information which is hierarchical in nature. The limit is calculated by a fuzzy controller which uses information from both the current applied force to the object and the actuator applied energy","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130612648","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}
G. Sandoval, J. Juárez, L. G. Martínez, Leocundo Aguilar
This paper describes the experience and results obtained in teaching non-common Java features, in advanced undergraduate object-oriented programming courses. The teaching approach proposed helps students to reach a deeper level of programming expertise, while accomplishing specific assignments that integrate a class framework that supports implementation of small and medium size client-server applications
{"title":"Toward a Deeper Level of Programming Expertise for Engineering Students","authors":"G. Sandoval, J. Juárez, L. G. Martínez, Leocundo Aguilar","doi":"10.1109/ENC.2006.35","DOIUrl":"https://doi.org/10.1109/ENC.2006.35","url":null,"abstract":"This paper describes the experience and results obtained in teaching non-common Java features, in advanced undergraduate object-oriented programming courses. The teaching approach proposed helps students to reach a deeper level of programming expertise, while accomplishing specific assignments that integrate a class framework that supports implementation of small and medium size client-server applications","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121235549","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}
Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez, Dionisio de Niz
In this paper, we analyze the difficulties of handling abnormal events. We introduce a framework that integrate the concepts of design by contract, exception safety and fault tolerance and from then, obtain a set of criterions for the design of a mechanism that integrate error code, exception and executable assertions for the handling of different types of abnormal events. From these criterions, a proposal for a novel exception mechanism adequate for C written embedded systems is presented. Finally, we analyze the advantages of our mechanism over the existing mechanisms and over other languages or previous extension to C
{"title":"Abnormal Events Handling for Dependable Embedded Systems","authors":"Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez, Dionisio de Niz","doi":"10.1109/ENC.2006.3","DOIUrl":"https://doi.org/10.1109/ENC.2006.3","url":null,"abstract":"In this paper, we analyze the difficulties of handling abnormal events. We introduce a framework that integrate the concepts of design by contract, exception safety and fault tolerance and from then, obtain a set of criterions for the design of a mechanism that integrate error code, exception and executable assertions for the handling of different types of abnormal events. From these criterions, a proposal for a novel exception mechanism adequate for C written embedded systems is presented. Finally, we analyze the advantages of our mechanism over the existing mechanisms and over other languages or previous extension to C","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116145962","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}
Edgar Alberto Portilla-Flores, Genoveva Vargas-Solar, J. Zechinelli-Martini, C. Collet, L. García-Bañuelos
This paper introduces key dimensions to analyze how transactional behavior is addressed in service based applications. In such applications, transactional behavior cannot be provided in the sense of DBMS ACID transactions. A review of existing concepts and requirements is required for proposing an approach that addresses them. Although several approaches concerning transactional behavior have been proposed, we think that it is necessary to clarify what is needed for current information systems and what remains as an open issue. In that sense, we propose some aspects for characterizing the transactional behavior and furthermore we introduce a critical review of current approaches
{"title":"A survey for analyzing transactional behavior in service based applications","authors":"Edgar Alberto Portilla-Flores, Genoveva Vargas-Solar, J. Zechinelli-Martini, C. Collet, L. García-Bañuelos","doi":"10.1109/ENC.2006.2","DOIUrl":"https://doi.org/10.1109/ENC.2006.2","url":null,"abstract":"This paper introduces key dimensions to analyze how transactional behavior is addressed in service based applications. In such applications, transactional behavior cannot be provided in the sense of DBMS ACID transactions. A review of existing concepts and requirements is required for proposing an approach that addresses them. Although several approaches concerning transactional behavior have been proposed, we think that it is necessary to clarify what is needed for current information systems and what remains as an open issue. In that sense, we propose some aspects for characterizing the transactional behavior and furthermore we introduce a critical review of current approaches","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446018","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}
The mixed postman problem consists of finding a minimum cost tour of a connected mixed graph traversing all its vertices, edges, and arcs at least once. We consider the variant of the mixed postman problem where all edges must be traversed exactly once. We prove that the feasibility version of this problem is NP-complete. We introduce a necessary condition for feasibility and show that it can be tested in polynomial time. We prove that this condition is also sufficient if the directed components of the mixed graph form a directed walk. Finally, we give a linear programming formulation to solve the minimization version of this problem if the directed components of the mixed graph form a forest
{"title":"Complexity of the Mixed Postman Problem with Restrictions on the Edges","authors":"F. Martínez","doi":"10.1109/ENC.2006.9","DOIUrl":"https://doi.org/10.1109/ENC.2006.9","url":null,"abstract":"The mixed postman problem consists of finding a minimum cost tour of a connected mixed graph traversing all its vertices, edges, and arcs at least once. We consider the variant of the mixed postman problem where all edges must be traversed exactly once. We prove that the feasibility version of this problem is NP-complete. We introduce a necessary condition for feasibility and show that it can be tested in polynomial time. We prove that this condition is also sufficient if the directed components of the mixed graph form a directed walk. Finally, we give a linear programming formulation to solve the minimization version of this problem if the directed components of the mixed graph form a forest","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131059429","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}
José Antonio Muñoz-Gómez, Pedro González-Casanova, G. Gómez
In this work, by using the local node refinement technique proposed by Behrens and Iske (2002) and Behrens et al. (2001), and a quad-tree type algorithm (Berger and Jameson, 1985; Keats and Lien, 2004), we built a global refinement technique for Kansa's unsymmetric collocation approach. The proposed scheme is based on a cell by cell data structure, which by using the former local error estimator, iteratively refines the node density in regions with insufficient accuracy. We test our algorithm for steady state partial differential equations in one and two dimensions. By using thin-plate spline kernel functions, we found that the node refinement let us to reduce the approximation error and that the node insertion is only performed in regions where the analytical solution shows a high spatial variation. In addition, we found that the node refinement outperform in accuracy and number of nodes in comparison with the global classical Cartesian h-refinement technique
在这项工作中，通过使用Behrens和Iske(2002)以及Behrens等人(2001)提出的局部节点细化技术，以及四叉树类型算法(Berger和Jameson, 1985;Keats and Lien, 2004)，我们为Kansa的不对称搭配方法建立了一个全局优化技术。该方案基于逐单元的数据结构，利用先前的局部误差估计器，迭代地细化精度不足区域的节点密度。我们在一维和二维的稳态偏微分方程中测试了我们的算法。通过使用薄板样条核函数，我们发现节点细化使我们减小了近似误差，并且节点插入只在解析解显示出高空间变化的区域进行。此外，我们发现节点细化在精度和节点数量上优于全局经典笛卡尔h-细化技术
{"title":"Adaptive Node Refinement Collocation Method for Partial Differential Equations","authors":"José Antonio Muñoz-Gómez, Pedro González-Casanova, G. Gómez","doi":"10.1109/ENC.2006.4","DOIUrl":"https://doi.org/10.1109/ENC.2006.4","url":null,"abstract":"In this work, by using the local node refinement technique proposed by Behrens and Iske (2002) and Behrens et al. (2001), and a quad-tree type algorithm (Berger and Jameson, 1985; Keats and Lien, 2004), we built a global refinement technique for Kansa's unsymmetric collocation approach. The proposed scheme is based on a cell by cell data structure, which by using the former local error estimator, iteratively refines the node density in regions with insufficient accuracy. We test our algorithm for steady state partial differential equations in one and two dimensions. By using thin-plate spline kernel functions, we found that the node refinement let us to reduce the approximation error and that the node insertion is only performed in regions where the analytical solution shows a high spatial variation. In addition, we found that the node refinement outperform in accuracy and number of nodes in comparison with the global classical Cartesian h-refinement technique","PeriodicalId":432491,"journal":{"name":"2006 Seventh Mexican International Conference on Computer Science","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114531099","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：