Pub Date : 2015-12-01DOI: 10.7763/IJCTE.2015.V7.1003
C. Han, Lianzhong Liu, Zhouyang Li
Time-based delegation transfers privileges between users and reduce the work load of administrators. But there are defectives on the researches of time-based delegation model: incomplete time constraints and name space explosion problem of delegation model. To solve these two problems, following researches has been done: firstly, this paper proposes a time constraint policy including time representation and the time state change algorithm; secondly, based on the time constraint policy, this paper puts forward the Complete Time Constraint Based Delegation Model(CTCDM) to solve the name explosion problem from a certain extent.
{"title":"CTCDM: A Complete Time Constraint Based Delegation Model","authors":"C. Han, Lianzhong Liu, Zhouyang Li","doi":"10.7763/IJCTE.2015.V7.1003","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.1003","url":null,"abstract":"Time-based delegation transfers privileges between users and reduce the work load of administrators. But there are defectives on the researches of time-based delegation model: incomplete time constraints and name space explosion problem of delegation model. To solve these two problems, following researches has been done: firstly, this paper proposes a time constraint policy including time representation and the time state change algorithm; secondly, based on the time constraint policy, this paper puts forward the Complete Time Constraint Based Delegation Model(CTCDM) to solve the name explosion problem from a certain extent.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113959154","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}
Pub Date : 2015-12-01DOI: 10.7763/IJCTE.2015.V7.1000
Yoondeuk Seo, Jinho Ahn
Abstract—This paper presents a monitoring and notification system based on risk analysis using map-reduce framework that can do risk prediction using big data. By using social media and access records of their users, the proposed system determines their risks. Also, it monitors the restricted area through setting them and notifies the administrator as soon as the intrusions are detected. So, it will provide a control situation for administrator in real time and can detect the risky moments that may occur in advance. Therefore it can reduce the probability of risk of security penetration. Also, since it receives the control situation and provides real-time control screen via smartphone, it is possible to improve the convenience of intrusion management in a very fast and effective way.
{"title":"Monitoring and Notification System Based on Risk Analysis Using Map-Reduce Framework","authors":"Yoondeuk Seo, Jinho Ahn","doi":"10.7763/IJCTE.2015.V7.1000","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.1000","url":null,"abstract":" Abstract—This paper presents a monitoring and notification system based on risk analysis using map-reduce framework that can do risk prediction using big data. By using social media and access records of their users, the proposed system determines their risks. Also, it monitors the restricted area through setting them and notifies the administrator as soon as the intrusions are detected. So, it will provide a control situation for administrator in real time and can detect the risky moments that may occur in advance. Therefore it can reduce the probability of risk of security penetration. Also, since it receives the control situation and provides real-time control screen via smartphone, it is possible to improve the convenience of intrusion management in a very fast and effective way.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124105734","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}
Pub Date : 2015-12-01DOI: 10.7763/IJCTE.2015.V7.1008
S. Sadhu, Niraj Kumar
{"title":"Computing Convex Layers of a Dynamic Point Set","authors":"S. Sadhu, Niraj Kumar","doi":"10.7763/IJCTE.2015.V7.1008","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.1008","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123479642","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.989
I. Kozma, I. Zsoldos, G. Dorogi, S. Papp
In order to create 3D models used in finite element analysis, a reconstruction of the structure of metal foam composites reinforced with ceramic spherical shells is necessary. A new algorithm has been developed for reconstruction. The input of the algorithm consists of CT layer images which were created at the Szechenyi Istvan University, Gyor, Hungary. The CT images were analyzed by the new algorithm. The algorithm seeks the contours of the spherical shells by gradually increasing the radii, also in CT images. A suitably accurate 3D CAD model can be created with algorithm.
{"title":"Application of Computed Tomography in Structure Analyses of Metal Matrix Syntactic Foams","authors":"I. Kozma, I. Zsoldos, G. Dorogi, S. Papp","doi":"10.7763/IJCTE.2015.V7.989","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.989","url":null,"abstract":"In order to create 3D models used in finite element analysis, a reconstruction of the structure of metal foam composites reinforced with ceramic spherical shells is necessary. A new algorithm has been developed for reconstruction. The input of the algorithm consists of CT layer images which were created at the Szechenyi Istvan University, Gyor, Hungary. The CT images were analyzed by the new algorithm. The algorithm seeks the contours of the spherical shells by gradually increasing the radii, also in CT images. A suitably accurate 3D CAD model can be created with algorithm.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116764961","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.991
Han-Yu Lin
{"title":"ID-Based Non-Interactive Universal Designated Verifier Signature for Privacy-Preserving Applications","authors":"Han-Yu Lin","doi":"10.7763/IJCTE.2015.V7.991","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.991","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250634","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2016.V8.1075
A. S. Lokman, N. A. Ghani, L. L. Leong
This paper critically reviews several Special Relativity simulation applications and proposes a method to dynamically simulate Time Dilation effect. To the authors’ knowledge, this has not yet been studied by other researchers. Dynamic in the context of this paper is defined by the ability to persistently simulate Time Dilation effect based on specific parameter that can be controlled by user/viewer in real-time interactive simulation. Said parameter is the value of speed from acceleration and deceleration of moving observer. In relativistic environment, changing the speed’s value will also change the Lorentz Factor value thus directly affect the Time Dilation value. One can simply calculate the dilated time by using Time Dilation equation, however if the velocity is not constant (from implying Special Relativity), one must repeatedly calculate the dilated time considering the changing value of displacement/distance and time. This paper discusses the proposed method by dissecting Time Dilation equation and relates it to computational method available nowadays in order to dynamically calculate and ultimately simulate Time Dilation effect in relativistic virtual environment.
{"title":"Simulating Dynamic Time Dilation in Relativistic Virtual Environment","authors":"A. S. Lokman, N. A. Ghani, L. L. Leong","doi":"10.7763/IJCTE.2016.V8.1075","DOIUrl":"https://doi.org/10.7763/IJCTE.2016.V8.1075","url":null,"abstract":"This paper critically reviews several Special Relativity simulation applications and proposes a method to dynamically simulate Time Dilation effect. To the authors’ knowledge, this has not yet been studied by other researchers. Dynamic in the context of this paper is defined by the ability to persistently simulate Time Dilation effect based on specific parameter that can be controlled by user/viewer in real-time interactive simulation. Said parameter is the value of speed from acceleration and deceleration of moving observer. In \u0000relativistic environment, changing the speed’s value will also change the Lorentz Factor value thus directly affect the Time Dilation value. One can simply calculate the dilated time by using Time Dilation equation, however if the velocity is not constant (from implying Special Relativity), one must repeatedly calculate the dilated time considering the changing value of displacement/distance and time. This paper discusses the proposed method by dissecting Time Dilation equation and relates it to computational method available nowadays in order to dynamically calculate and ultimately simulate Time Dilation \u0000effect in relativistic virtual environment.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130140145","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.987
M. M. Casas, R. L. Avitia, Alexandra Gomez-Caraveo, M. Reyna, J. A. Cárdenas-Haro
{"title":"A Complete Study of Variability in Time and Amplitude of a Standard ECG Database","authors":"M. M. Casas, R. L. Avitia, Alexandra Gomez-Caraveo, M. Reyna, J. A. Cárdenas-Haro","doi":"10.7763/IJCTE.2015.V7.987","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.987","url":null,"abstract":"","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753833","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.992
N. Koyuncu
The sampling literature contains many examples of estimators of population parameter. To deal with this problem many authors have suggested family of estimators of population parameter. But in the case of generalization of these estimators, estimation of optimum values is a problem. Some authors can define estimator replacing the unknown parameters by their sample estimates. To get the optimum estimator, one need to solve complex mean square error equation with many parameters and nonlinear constraints. In this study we have tried to get these optimum parameter in stratified random sampling using genetic algorithms and sequential quadratic programming. A numerical example is also done to compare these algorithms. The results show that genetic algorithm is more efficient than sequential quadratic programming to solve the complex model with more parameters under non-linear constraints.
{"title":"Computation of Parameters Using Genetic Algorithm and Sequential Quadratic Programming in Sampling","authors":"N. Koyuncu","doi":"10.7763/IJCTE.2015.V7.992","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.992","url":null,"abstract":"The sampling literature contains many examples of estimators of population parameter. To deal with this problem many authors have suggested family of estimators of population parameter. But in the case of generalization of these estimators, estimation of optimum values is a problem. Some authors can define estimator replacing the unknown parameters by their sample estimates. To get the optimum estimator, one need to solve complex mean square error equation with many parameters and nonlinear constraints. In this study we have tried to get these optimum parameter in stratified random sampling using genetic algorithms and sequential quadratic programming. A numerical example is also done to compare these algorithms. The results show that genetic algorithm is more efficient than sequential quadratic programming to solve the complex model with more parameters under non-linear constraints.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797969","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.984
Mustafa Musa Jaber, Mohd Khanapi Abd. Ghani, N. Suryana, Mohammed Aal Mohammed, Thamir Abbas
Clinical databases have gathered a huge amount of information about patients and their medical conditions. Relationships and patterns within this data could provide new medical knowledge. Thus it is a difficult task focusing to model a data warehouse, very often, into internal structures and implementation applications. The aim of is project is to find the parameters of medical data warehouse which will be able to construct a flexible framework by analyze the approaches of data warehouse architectures and compare them regarding the cost and integrity. The proposed parameters may assist in achieving continual access to the common data warehouse. The important consideration, however, is that the clinical data record should contain not only longitudinal health summary information but also be used for business intelligence tool such as data mining and OLAP
{"title":"Flexible Data Warehouse Parameters: Toward Building an Integrated Architecture","authors":"Mustafa Musa Jaber, Mohd Khanapi Abd. Ghani, N. Suryana, Mohammed Aal Mohammed, Thamir Abbas","doi":"10.7763/IJCTE.2015.V7.984","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.984","url":null,"abstract":"Clinical databases have gathered a huge amount of information about patients and their medical conditions. Relationships and patterns within this data could provide new medical knowledge. Thus it is a difficult task focusing to model a data warehouse, very often, into internal structures and implementation applications. The aim of is project is to find the parameters of medical data warehouse which will be able to construct a flexible framework by analyze the approaches of data warehouse architectures and compare them regarding the cost and integrity. The proposed parameters may assist in achieving continual access to the common data warehouse. The important consideration, however, is that the clinical data record should contain not only longitudinal health summary information but also be used for business intelligence tool such as data mining and OLAP","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129857950","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}
Pub Date : 2015-10-01DOI: 10.7763/IJCTE.2015.V7.994
C. Su
Abstract—Traditional Service-Oriented Architecture (SOA) has consistently promised more than it has delivered, but Web-Oriented Architecture (WOA) promises to deliver the robust outcomes formerly expected of SOA. WOA extends SOA to web-based applications. The architecture hides the protocol complexity in the application state and provides simpler methods for the deployment of interoperable web services. However, this pragmatic and effective approach has only been rarely implemented, limiting the body of formal knowledge and support available to enterprises which want to exploit this profoundly useful and simple way of developing interoperable systems. In this paper, we describe the development of a novel customer-centric collaborative commerce platform (WCCP) on WOA in a virtual environment. The classification from the United Nations Standard Products and Services Code (USNPSC) was adopted to achieve the interoperability between differential enterprises.
{"title":"Web-Oriented Architecture (WOA) Enabled Customer-Centric Collaborative Commerce Platform (WCCP)","authors":"C. Su","doi":"10.7763/IJCTE.2015.V7.994","DOIUrl":"https://doi.org/10.7763/IJCTE.2015.V7.994","url":null,"abstract":" Abstract—Traditional Service-Oriented Architecture (SOA) has consistently promised more than it has delivered, but Web-Oriented Architecture (WOA) promises to deliver the robust outcomes formerly expected of SOA. WOA extends SOA to web-based applications. The architecture hides the protocol complexity in the application state and provides simpler methods for the deployment of interoperable web services. However, this pragmatic and effective approach has only been rarely implemented, limiting the body of formal knowledge and support available to enterprises which want to exploit this profoundly useful and simple way of developing interoperable systems. In this paper, we describe the development of a novel customer-centric collaborative commerce platform (WCCP) on WOA in a virtual environment. The classification from the United Nations Standard Products and Services Code (USNPSC) was adopted to achieve the interoperability between differential enterprises.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129818591","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
扫码关注我们
求助内容：
应助结果提醒方式：