International Conference on Frontiers of Information Technology最新文献

{"title":"Development of database auditing infrastructure","authors":"Zubaria Noreen, I. Hameed, A. Usman","doi":"10.1145/1838002.1838092","DOIUrl":"https://doi.org/10.1145/1838002.1838092","url":null,"abstract":"A database is considered as a core asset of an organization. Information about customers, employees and employers of the organization is stored in the database. Allowing authorized access to information and it's shielding against unauthorized access is always given prime importance and is of great concern to the stakeholders of the organization. The work presented here outlines the development of a Database Auditing Infrastructure (DAI). The test bed for this infrastructure is chosen as MS SQL Server 2005. Database security is a vast and complicated discipline. Database auditing is the facilitating activity for implementing database security. Triggers, default trace, service brokers, queues, information from system databases are used in the implementation of DAI. Here a customized methodology, comprising of several ways has been adapted for implementing auditing in a database. The DAI presented in this paper is a generic one that can be easily integrated with an existing database. Once deployed the DAI starts providing auditing services to Information System Auditors (ISA) through its web based interface.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114927071","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":"Priority-based allocation of network resources in multi-class MPLS networks","authors":"Najmul Hassan, A. Baig, Junaid Qadir, Madeeha Owais","doi":"10.1145/1838002.1838016","DOIUrl":"https://doi.org/10.1145/1838002.1838016","url":null,"abstract":"Multi-Protocol Label Switching (MPLS) is an emerging technology used for the high speed and reliable data transfer, especially in the backbone network. MPLS provides Quality of Service (QoS) routing and Traffic Engineering (TE) mechanism to fulfill the end user requirements. In a multi-service network, different users or applications require different quality of services. The differentiated services (DiffServ) architecture has been proposed and considered as a scalable approach, which aims to provide differentiated services to different classes of traffic in a network. In this paper, we propose an approach called Priority based Allocation Scheme (PAS) that allocates network resources in multi-class MPLS networks based on priority class of LSP request. Simulation results show that our approach accepts, as a whole, higher number of LSP requests than Simple Allocation Scheme (SAS) and Medium Allocation Scheme (MAS). It uses almost same bandwidth as SAS. Our results also show that PAS is a priority based and balanced approach that accepts more premium class traffic requests than medium or low class requests.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"450 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122599921","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":"Analysing refactoring dependencies using unfolding of graph transformation systems","authors":"Fawad Qayum, R. Heckel","doi":"10.1145/1838002.1838019","DOIUrl":"https://doi.org/10.1145/1838002.1838019","url":null,"abstract":"Refactoring has emerged as a successful technique to reduce complexity of object oriented designs. But due to implicit dependencies not all sequences of refactorings are appropriate. In this paper we model refactoring steps as graph transformation and use the unfolding analysis technique to choose the sequence of refactorings best suited in order to improve the design. We use graphs to represent software architectures at the class level and graph transformation to formally describe their refactoring operations. This makes it possible to use concepts and techniques from the theory of graph transformation, such as unfolding to identify dependencies between refactoring steps.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593852","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 edge-wise linear shortest path algorithm for non negative weighted undirected graphs","authors":"M. Qureshi, M. Hassan, S. Safdar, R. Akbar, Rabia Sammi","doi":"10.1145/1838002.1838079","DOIUrl":"https://doi.org/10.1145/1838002.1838079","url":null,"abstract":"In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points---source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithm for calculating shortest path for nonnegative weighted undirected graphs. The algorithm completes its execution in O(|E|) for all targeted graphs---where no successor node updates predecessor node. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126218497","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 intelligent assistant for mathematical production","authors":"Z. Rehman, M. I. Sarwar, A. Muhammad, Muhammad Shaheen","doi":"10.1145/1838002.1838020","DOIUrl":"https://doi.org/10.1145/1838002.1838020","url":null,"abstract":"Many functionalities like text auto filling, spell checking, thesaurus, translation, grammar, and many others, have been introduced to check textual document production but no feature have been integrated to any computer application which can help a user to produce own mathematical formula or from the existing reusable shared resources. We address the issue by developing an assistant to be incorporated into computer applications which is used by different users to produce equations and statements. Our main objective is to facilitate a mathematician to build a database of well structured formulae that can be reused either by him or by any of his colleagues. The assistance is provided on the basis of a context stored in the form of a knowledge base which is dynamically enhanced /updated with an online learning functionality. Concurrent Versioning System (CVS) approach will be incorporated to facilitate users for sharing of knowledge and exploiting the potential advantage of internet and distributed computing.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"20 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132606260","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":"Multi-path video streaming with redundant frames over a MANET","authors":"N. Qadri, M. Altaf, M. Fleury, M. Ghanbari","doi":"10.1145/1838002.1838076","DOIUrl":"https://doi.org/10.1145/1838002.1838076","url":null,"abstract":"It has become feasible to stream video across a mobile network ad hoc network (MANET). This paper proposes using the H.264 codec's 'redundant frames' video delivery over multi-paths and compares their performance to Video Redundancy Coding, another multi-path technique. The paper reports that 'redundant frames' result in as much as 10 dB improvement in delivered video quality. An interesting secondary result that emerged from experiments was that for all performance indicators Location-Aided Routing (LAR) provides superior performance to the well-known AODV routing protocol.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130951711","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":"Integrating GSTRBAC spatial constraints in X-GTRBAC","authors":"H. Haseeb, A. Masood, Muataz Ahmed, A. Ghafoor","doi":"10.1145/1838002.1838059","DOIUrl":"https://doi.org/10.1145/1838002.1838059","url":null,"abstract":"In today's pervasive computing environment, access control exploiting spatial and temporal constraints has become imperative for information security. This paper suggests a framework to extend X-GTRBAC to include Generalized Spatio Temporal Role Based Access Control (GSTRBAC) spatial constraint construction and enforcement. This allows X-GTRBAC to exploit topological relationship between locations and provides it with formalism to construct rich spatial constraints. The extension provides X-GTRBAC with spatial role enabling, spatial role activation, spatial user role assignment and spatial role permission assignment capability. Since X-GTRBAC can be deployed across a variety of environments, such as web or heterogeneous, our contribution regarding spatial extension of X-GTRBAC could extend the use of spatial contextual parameters in these areas efficiently.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124429756","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":"Off-line signature verification using structural features","authors":"Sohail Zafar, R. Qureshi","doi":"10.1145/1838002.1838085","DOIUrl":"https://doi.org/10.1145/1838002.1838085","url":null,"abstract":"Biometric identification is an emerging technology that can solve the security problems in our networked society. A lot of work has been done in the field of automatic off-line signature verification. While a large portion of the work is focused on random forgery detection, more efforts are still needed to address the problem of skilled forgery detection. In this paper a novel method for signature verification is proposed. In this method, each pixel belonging to signature is studied and endpoints from the geometry of the signature are extracted. A polygonal closed shape is drawn by joining these endpoints. Various structural features from the shape including parameter, area, minimum enclosing rectangle, rectangularity measure, and circularity measure and form factors are computed. These features were combined to build a verification function, which is evaluated using statistical procedures.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123621721","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 schemes for supporting QoS and mobility in heterogeneous networks","authors":"F. W. Karam, T. Jensen","doi":"10.1145/1838002.1838005","DOIUrl":"https://doi.org/10.1145/1838002.1838005","url":null,"abstract":"This paper proposes a scheme to provide service mobility with required QoS for different applications in heterogeneous access networks. Some existing schemes and proposed schemes are surveyed and compared with respect to key QoS-related mechanisms and capabilities. We then introduce a proposed scheme supporting QoS and mobility across different access networks. This utilizes the Media-Independent Handover (MIH) Services and follows principles of the Next Generation Network (NGN) architecture. Correspondence among different service classes and parameters is also provided for service mobility using Media-Independent Handover (MIH) Services.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797839","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":"Self-organization methodologies for services placement in future mobile communication networks","authors":"Shahzad Ali, A. Mitschele-Thiel, Ali Diab","doi":"10.1145/1838002.1838062","DOIUrl":"https://doi.org/10.1145/1838002.1838062","url":null,"abstract":"Ubiquitous access to information and services anywhere, anytime and anyhow at low cost is one of the essential features of future mobile communication networks, which will interconnect a heterogeneity of various systems and be much more dynamic and flexible in terms of changes in access technology, topology, services, etc. In such networks, there will be a need to match resources supply with application demands continuously as these demands are expected to fluctuate over time. This makes an adequate service placement in such networks of a major importance. Handling this issue is the main purpose of our research, which will be carried out in the scope of the International Graduate School on Mobile Communications at Ilmenau University of Technology (www.gs-mobicom.de).\u0000 The paper proposes a novel distributed and self-organized service placement mechanism that enables minimizing the cost, retaining the Quality of Service (QoS) and balancing the load. Our proposal is called Mobile Agent-assisted Ant Colony Optimization (MA-ACO). The basic idea lies in enhancing the ACO technique with mechanisms from the MA-field, so that the speed, accuracy, and self-organization capabilities are improved. This has been achieved by means of ants carrying a set of MAs as a piece of food. As a replica of a service is created on a node, this node sends ants to put MAs on the 1-hop neighbors capable of hosting the offered service. When the serving cost increases, QoS degrades, etc., ants are sent towards the MAs to collect information about the current status of the network. Based on this information, the hosting node can take an accurate decision. Our approach can cope with dynamic networks, where network topology, load, clients' distribution, etc. often change. Moreover, it has self-healing capabilities since it is able to remove congestion situation, balance the load, etc. As MA-ACO works in a distributed manner, it does not require global knowledge of the network. Our proposal overcomes existing approaches with respect to self-organization capabilities, speed and accuracy.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116834375","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}