2010 Second International Conference on Computer Research and Development最新文献

{"title":"Enhancing the Rapid Object Process for Embedded System (ROPES) Metamodel to Support Pattern Oriented Development","authors":"M. A. Isa, D. Jawawi","doi":"10.1109/ICCRD.2010.49","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.49","url":null,"abstract":"The complexity of Embedded Real Time (ERT) software development represents a challenging of analyzing, designing and building ERT software. From this standpoint, the complexity of ERT software development means a challenging to adopt all ERT software requirements such as timing and resource constraints into its software life cycle. Against these claims, a wide range of software development methodologies has been devised such as patterns. Patterns codify an effective solution for recurring problems, which allows software engineers to reuse. By applying patterns into ERT software development, the complexity of ERT software development may be decreased and at the same time promote a high degree of reuse through software patterns. This paper presents the integrated Rapid Object Process for Embedded System (ROPES) and Pattern-oriented Analysis and Design (POAD) methodology to show a promising way to build ERT software with software patterns reuse. To make the integrated methodology more compelling and confirm the rules of patterns oriented modeling, the integrated ROPES and POAD metamodel has been developed. The aim of the integrated metamodel is to conform to the correctness of the integrated methodology modeling rules together with patterns. To prove the correctness of the integrated metamodel, the mapping process between the Meta-Object Facility (MOF) and proposed metamodel by using graph theory has been conducted.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021764","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 an Asymptotic Case of the Complex Lorenz Model","authors":"Swetamber Das","doi":"10.1109/ICCRD.2010.122","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.122","url":null,"abstract":"In this paper The Complex Lorenz Model is considered and a particular asymptotic case has been analyzed. Fowler et al. (1982) has found this complex counterpart of the Lorenz Model and its analytic study was reported. Present paper deals with the stability analysis of the model for the simple condition when σ → ∞ We have followed the method used by Lorenz (1963) to study the set of differential equation modeling Nonperiodic flow followed by a brief study of large perturbation through numerical integration. We have been able to produce a few results in agreement with Fowler et al. (1983) and an important result regarding the critical value of one of the parameters.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125977823","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":"An Algorithm for Computing the Union, Intersection and Difference of Two Polygons","authors":"Zhang Shan-xin, Qiang Rui-lian","doi":"10.1109/ICCRD.2010.23","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.23","url":null,"abstract":"An new idea for setting operations on pairs of polygons algorithm is presented. The algorithm uses a boundary representation for the input and output polygons. Its domain includes polygons as well as polygons with holes within the area of the polygon. The algorithm runs in time O((n+m+k) ) in a worst presented case, where n and m are the vertex number of the two polygons respectively, and k is the number of point of intersection. The algorithm well resolves the issues in special cases, such as overlapped edges, edges intersection at the vertex of edges, etc. It is facilitated by the use of double circular linked list. The algorithm is easy to implement.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125984188","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":"Complexity Estimation Approach for Debugging in Parallel","authors":"M. Srivastav, Y. Singh, Chetna Gupta, D. Chauhan","doi":"10.1109/ICCRD.2010.14","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.14","url":null,"abstract":"Multiple faults in a software many times prevent debuggers from efficiently localizing a fault. This is mainly due to not knowing the exact number of faults in a failing program as some of the faults get obfuscated. Many techniques have been proposed to isolate different faults in a program thereby creating separate sets of failing program statements. To evenly divide these statements amongst debuggers we must know the level of work required to debug that slice. In this paper we propose a new technique to calculate the complexity of faulty program slices to efficiently distribute the work among debuggers for simultaneous debugging. The technique calculates the complexity of entire slice by taking into account the suspiciousness of every faulty statement. To establish the confidence in effectiveness and efficiency of proposed techniques we illustrate the whole idea with help of an example. Results of analysis indicate the technique will be helpful (a) for efficient distribution of work among debuggers (b) will allow simultaneous debugging of different faulty program slices (c) will help minimize the time and manual labor.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125985871","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":"Design of a Single-Anode MIG for High Voltage, Sub-Centimeter Gyrotron Traveling Wave Amplifier","authors":"Kasim Fawzy Ahmed Rawanduzy","doi":"10.1109/ICCRD.2010.136","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.136","url":null,"abstract":"According to the requirements of gyrotron traveling wave amplifier, a single-anode of electron gun designed. First, by adiabatic initial design parameters, such as the cathode angle, electron beam emission surface. Secondly, using electron been trajectory analysis program (EGUN) to determining the electron beam parameters. The results showed that the electron beam acceleration voltage of 70kV, operating current of 4.55A, electron beam horizontal and vertical velocity ratio of 1.0, the electron beam's axial velocity scattered 2.4%, to meet the return rotary traveling-wave tube amplifier scattered electron beam low-speed requirements.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126561484","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 Expected Busy Period of an Interdependent M/M/1:(Infinity; Gd) Queueing Model Using Bivariate Poisson Process and Controllable Arrival Rates","authors":"V. Maurya","doi":"10.1109/ICCRD.2010.119","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.119","url":null,"abstract":"Busy period analysis plays a vital role in the study of queueing problems for forecasting the behaviour of the queueing systems. Performance analysis including determination of the average length of busy period is entirely based on the busy period distribution of the queueing model. In the queueing literature, it has been observed that most of the previous researchers [2,5,7,8 & 9] have presumed that the parameters of arrival and service rates in the system are independent to each other. However, it is not so in general because we find many queueing situations in our real life where the arrival and service rates are correlated with an elevated extent. A large number of previous noteworthy researchers [2,5,7,8 & 9] and references therein confined their study to analyze a variety of queueing models taking into account that the arrival and service processes are independent. A very few number of worth mentioning researchers [11 & 13] of the current decade are found in the literature of queueing theory who have contributed their devotion to analyze an M/M/1 queueing model with consideration of interdependent arrival and service rates. In this context, Srinivasa Rao et al [13] have focused their attention to investigate the average system size and average waiting time of an M/M/1/infinity interdependent queueing model using controllable arrival rates under steady state conditions. Recently, Pal [11] considered the same queueing model with a version of its limited waiting space and he succeeded to investigate the cost per unit time of a served customer in the system. In our current study, we consider the same queueing model already analyzed by Srinivasa Rao et al [13] with a version that the arrival and service processes follow a bivariate Poisson distribution and our keen interest is to investigate the average length of busy periods in two different cases of slower and faster arrival rates. By the end of the present paper, a special stress on practical aspect of the investigated average busy period has also been given in our conclusion which reveals the application of both the realistic modeling enhancing as well as regulatory techniques.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124384453","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":"Using Captchas to Mitigate the VoIP Spam Problem","authors":"I. Ahmedy, M. Portmann","doi":"10.1109/ICCRD.2010.85","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.85","url":null,"abstract":"Voice over Internet Protocol (VoIP) is one of the emerging technologies today. This application offers the user a service by which one can call another person at a low cost as compare with traditional phone services. One drawback to the Internet is spam, which are unsolicited or unwanted objects which often appear as unwanted messages in various email applications. For VoIP, spam refers to unsolicited and unwanted calls by the VoIP user. In this paper, we have purposed a solution to prevent the spam in VoIP. The CAPTCHA (Completely Automated Public Turing Test to Tell Computers and Human Apart) method aims to determine whether the call is coming from a human or a machine. The key contribution of this paper is a proof-of-concept implementation of a CAPTCHA mechanism to prevent VoIP Spam.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123526699","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":"Augmented Reality Tourist Catalogue Using Mobile Technology","authors":"Arash Habibi Lashkari, Behrang Parhizkar, Mohamed Abdulkarim Mohamedali","doi":"10.1109/ICCRD.2010.57","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.57","url":null,"abstract":"Tourism studies have noted that insufficient attention has been paid to the experience and practices of the tourist. Tourism research does not help to explain the nature of modern mass tourism. The most detailed research that has been done is tourist information seeking, but the literature has tended to avoid detailed qualitative description, focusing more on broad categorizations of tourist practice [7]. The purpose of this article is to show how I will go about in creating a tourist catalogue that uses augmented reality. This catalogue will help tourists both domestic and foreign get visual aid for viewing objects on a simple map. This article shows the extent this new technology has been explored in to and how much has been implemented. This article focuses on explaining what augmented reality is and the methodology that will be used to go about this new and unexploited technology.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131306848","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":"Three Dimensional Mesh-Free Spectral Method Analysis of Optical Structures","authors":"F. Alharbi","doi":"10.1109/ICCRD.2010.112","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.112","url":null,"abstract":"A new and efficient three dimensional multi-domain spectral method formulation is developed to simulate and analyze optical structures. The formulation is mesh free and functional expansion based where the unknown physical quantities are approximated by expansions by preselected basis sets. The method is demonstrated by application to modal behavior in several optical structures. To demonstrate the validity and the accuracy of the presented method, it is compared with various published results and the comparisons validates the accuracy of the presented method.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"543 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123358754","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":"Horizontal Mapping of SCOR Model on Zachman Framework","authors":"H. Morady, Gholamreza Dehghani, Reza Hossein Afhsar","doi":"10.1109/ICCRD.2010.17","DOIUrl":"https://doi.org/10.1109/ICCRD.2010.17","url":null,"abstract":"Purpose of this article is mapping SCOR model which in fact is a framework for Architecting a supply chain on Zachman enterprise architecture framework. Because Zachman framework is most comprehensive framework in architecture field, in this article we put SCOR model beside Zachman framework, we are looking for Comprehensive assessment of SCOR model in Architecture of a supply chain and also we want to answer this question that how much SCOR model can cover the cells of Zachman framework.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128401219","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}