Currently available application such Window Task Manger have the weakness, which the process running does not provides detail information include process size, path process running, product name and etc. Therefore, System Memory Monitoring (SMM) is developed to enhance this application, while at the same provides additional feature that has a graph flow to make the user more understand the computer’s memory flow. Windows Application Programming Interface (API) is used by SMM as the fundamental resources in Windows operating system. The SMM interface is developed by using the Visual Basic 6 software. The result shows our SMM able to help the users to recognize the running process by details information.
目前可用的窗口任务管理器等应用程序的缺点是进程运行不提供详细信息，包括进程大小、进程运行路径、产品名称等。因此，系统内存监控(SMM)的开发是为了增强这一应用程序，同时提供了额外的功能，具有图形流，使用户更了解计算机的内存流。Windows API (Application Programming Interface)是SMM使用的Windows操作系统的基础资源。SMM界面是用Visual Basic 6软件开发的。结果表明，SMM能够通过详细信息帮助用户识别运行过程。
{"title":"Development of Informative System Memory Monitoring","authors":"Noraziah Ahmad","doi":"10.1109/ICCTD.2009.118","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.118","url":null,"abstract":"Currently available application such Window Task Manger have the weakness, which the process running does not provides detail information include process size, path process running, product name and etc. Therefore, System Memory Monitoring (SMM) is developed to enhance this application, while at the same provides additional feature that has a graph flow to make the user more understand the computer’s memory flow. Windows Application Programming Interface (API) is used by SMM as the fundamental resources in Windows operating system. The SMM interface is developed by using the Visual Basic 6 software. The result shows our SMM able to help the users to recognize the running process by details information.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121625520","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}
A. Premadi, Boonchuan Ng, M. Mastang, M. Ab-Rahman, K. Jumari
This paper presented architecture approach to remote monitor and control for providing protection and self-restoration against fault in the distribution region of fiber-to-the-home passive optical network (FTTH-PON). The devices consist of optical switches and a microcontroller to handle the optical switch routing. It is employed at the customer end, just before the optical network units (ONUs) to ensure the data flow continuously due to breakdown occur in the network and instantly repair operation.
{"title":"Protection Access Network: An Architecture Approach to Remote Monitor and Control","authors":"A. Premadi, Boonchuan Ng, M. Mastang, M. Ab-Rahman, K. Jumari","doi":"10.1109/ICCTD.2009.185","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.185","url":null,"abstract":"This paper presented architecture approach to remote monitor and control for providing protection and self-restoration against fault in the distribution region of fiber-to-the-home passive optical network (FTTH-PON). The devices consist of optical switches and a microcontroller to handle the optical switch routing. It is employed at the customer end, just before the optical network units (ONUs) to ensure the data flow continuously due to breakdown occur in the network and instantly repair operation.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121958684","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}
Hazrina Yusof Hamdani, N. Rashid, M. F. Wajidi, A. Abdulrazzaq, Rana M. Ghadban
This paper is to study and identify suitable algorithm that use in searching regulatory element where PhyloCon algorithm is one of the algorithms. Since PhyloCon has complexity limitation, the time performance is reduced. Therefore, a parallel technique is identified to improve performance of PhyloCon algorithm. The identified parallel technique is implemented on multicore architecture using OpenMP. This technique use multilevel parallelism which consists of outer parallelism and inner parallelism implemented in Phylocon algorithm. In each level, the data decomposition technique is applied to achieve computational load balancing. The implementation result produced maximum speed up until 2.62 on four processors compared to the sequential PhyloCon results.
{"title":"Fast PhyloCon Algorithm Using OpenMP","authors":"Hazrina Yusof Hamdani, N. Rashid, M. F. Wajidi, A. Abdulrazzaq, Rana M. Ghadban","doi":"10.1109/ICCTD.2009.198","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.198","url":null,"abstract":"This paper is to study and identify suitable algorithm that use in searching regulatory element where PhyloCon algorithm is one of the algorithms. Since PhyloCon has complexity limitation, the time performance is reduced. Therefore, a parallel technique is identified to improve performance of PhyloCon algorithm. The identified parallel technique is implemented on multicore architecture using OpenMP. This technique use multilevel parallelism which consists of outer parallelism and inner parallelism implemented in Phylocon algorithm. In each level, the data decomposition technique is applied to achieve computational load balancing. The implementation result produced maximum speed up until 2.62 on four processors compared to the sequential PhyloCon results.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758200","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}
M. M. Qabajeh, A. H. Hashim, Othman Omran Khalifa, L. Qabajeh
Mobile Ad hoc NETworks (MANETs) are collection of mobile nodes communicate in a multi-hop manner without relaying on any infrastructure or central administration. Multimedia and group-oriented applications over MANETs gain high popularity, which makes providing Quality of Services (QoS) a key requirement. This work proposed a new efficient approach which aims to find paths between the source and all the multicast group members using paths that meet the bandwidth and delay requirements. Unlike some of multicast routing protocols, the proposed approach has limited maintaining the network topology to certain nodes to reduce communication overhead and provide scalability. The proposed protocol partitioned the network into equal size hexagonal cells and a leader and backup leader are elected inside each cell. The location information provided by GPS receivers are used at route discovery and route maintenance. This protocol allows multicast group members to join/leave the held session dynamically. The proposed protocol is scalable for large area networks with large multicast members. Also, it achieves a significant reduction in processing overhead than non hierarchical algorithms.
{"title":"Quality of Service Multicast Routing Protocol for Large Scale MANETs","authors":"M. M. Qabajeh, A. H. Hashim, Othman Omran Khalifa, L. Qabajeh","doi":"10.1109/ICCTD.2009.120","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.120","url":null,"abstract":"Mobile Ad hoc NETworks (MANETs) are collection of mobile nodes communicate in a multi-hop manner without relaying on any infrastructure or central administration. Multimedia and group-oriented applications over MANETs gain high popularity, which makes providing Quality of Services (QoS) a key requirement. This work proposed a new efficient approach which aims to find paths between the source and all the multicast group members using paths that meet the bandwidth and delay requirements. Unlike some of multicast routing protocols, the proposed approach has limited maintaining the network topology to certain nodes to reduce communication overhead and provide scalability. The proposed protocol partitioned the network into equal size hexagonal cells and a leader and backup leader are elected inside each cell. The location information provided by GPS receivers are used at route discovery and route maintenance. This protocol allows multicast group members to join/leave the held session dynamically. The proposed protocol is scalable for large area networks with large multicast members. Also, it achieves a significant reduction in processing overhead than non hierarchical algorithms.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122198715","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}
This article starts with an overview of natural resources, the status quo and problems of development ecotourism in Poyang Lake, and analyzes the necessity and feasibility of development of eco-tourism lastly, the paper point out the overall development of ideas and countermeasures.
{"title":"Notice of RetractionResearch on Development of Ecotourism in Poyang Lake","authors":"X.M. Han","doi":"10.1109/ICCTD.2009.253","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.253","url":null,"abstract":"This article starts with an overview of natural resources, the status quo and problems of development ecotourism in Poyang Lake, and analyzes the necessity and feasibility of development of eco-tourism lastly, the paper point out the overall development of ideas and countermeasures.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131302504","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}
Wireless Mobile Ad-Hoc Networks (MANETs) are becoming highly applicable in many fields. Due to MANETs special characteristics, secure routing may be one of the most difficult areas to deal with as opponents can add themselves to a MANET using the existing common routing protocols. This paper proposes a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Later, we will demonstrate that apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. We will reveal that via dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance.
{"title":"A Scalable Secure Routing Protocol for MANETs","authors":"L. Qabajeh, Laiha Binti Mat Kiah, M. M. Qabajeh","doi":"10.1109/ICCTD.2009.179","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.179","url":null,"abstract":"Wireless Mobile Ad-Hoc Networks (MANETs) are becoming highly applicable in many fields. Due to MANETs special characteristics, secure routing may be one of the most difficult areas to deal with as opponents can add themselves to a MANET using the existing common routing protocols. This paper proposes a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Later, we will demonstrate that apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. We will reveal that via dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690147","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 today’s challenging Aviation Industry, the role of high-speed and accurate Flight Planning cannot be over-emphasized. On time flight operation while maintaining the standard level of safety is a demanding task which airlines are facing recently. In our innovative flight performance planning, we have combined the applications of Maple 12 [1] (as a calculating software) with Delphi 6 [2] (programming Software) in order to have the most reliable and yet highest-speed flight performance planning procedure in the world. In lieu of drawing lines joining the performance chart, line equations are used to increase accuracy and swiftness of the flight performance planning. The study results show a 40% of elapsed time enhancement while increasing the accuracy by 30%.
{"title":"An Optimized, Mathematical-Based Flight Performance Planning","authors":"Arman Rezaee, S. Izadpanah","doi":"10.1109/ICCTD.2009.12","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.12","url":null,"abstract":"In today’s challenging Aviation Industry, the role of high-speed and accurate Flight Planning cannot be over-emphasized. On time flight operation while maintaining the standard level of safety is a demanding task which airlines are facing recently. In our innovative flight performance planning, we have combined the applications of Maple 12 [1] (as a calculating software) with Delphi 6 [2] (programming Software) in order to have the most reliable and yet highest-speed flight performance planning procedure in the world. In lieu of drawing lines joining the performance chart, line equations are used to increase accuracy and swiftness of the flight performance planning. The study results show a 40% of elapsed time enhancement while increasing the accuracy by 30%.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130426816","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 this paper, we study the Hermitian positive definite solutions of the nonlinear matrix equation $X+A* X^{-2} A+I$. Suppose $X$ is a Hermitian positive definite solution of this equation. We discuss the relation between $X$ and $A$ by the eigenvalue and eigenvector of $X$ and $A$ respectively.
{"title":"The Hermitian Positive Definite Solution of Nonlinear Matrix Equations","authors":"Guangyuan Zhao","doi":"10.1109/ICCTD.2009.217","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.217","url":null,"abstract":"In this paper, we study the Hermitian positive definite solutions of the nonlinear matrix equation $X+A* X^{-2} A+I$. Suppose $X$ is a Hermitian positive definite solution of this equation. We discuss the relation between $X$ and $A$ by the eigenvalue and eigenvector of $X$ and $A$ respectively.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128392958","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}
This paper is the continuation of previous work on the Systemic Water Analysis. It reflects a more complete version of the discussion on the Processes within the Systemic Water Analysis with more elaborated explanations on some of the ambiguous parts of the procedure.
{"title":"Systemic Water Analysis - The Procedure","authors":"L. Chew, Lim Poh Wing, N. Herman","doi":"10.1109/ICCTD.2009.137","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.137","url":null,"abstract":"This paper is the continuation of previous work on the Systemic Water Analysis. It reflects a more complete version of the discussion on the Processes within the Systemic Water Analysis with more elaborated explanations on some of the ambiguous parts of the procedure.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128884560","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 implications of read-write methodologies have been far-reaching and pervasive. Given the current status of wearable configurations, steganographers particularly desire the simulation of Markov models, which embodies the intuitive principles of cryptoanalysis. Our focus here is not on whether simulated annealing and online algorithms can synchronize to fulfill this objective, but rather on presenting an analysis of evolutionary programming (ZIBET).
{"title":"Flexible, Wearable Algorithms for Web Services","authors":"Xiwang Yang, Wang Hua","doi":"10.1109/ICCTD.2009.151","DOIUrl":"https://doi.org/10.1109/ICCTD.2009.151","url":null,"abstract":"The implications of read-write methodologies have been far-reaching and pervasive. Given the current status of wearable configurations, steganographers particularly desire the simulation of Markov models, which embodies the intuitive principles of cryptoanalysis. Our focus here is not on whether simulated annealing and online algorithms can synchronize to fulfill this objective, but rather on presenting an analysis of evolutionary programming (ZIBET).","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134173396","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
扫码关注我们
求助内容：
应助结果提醒方式：