M. Hussain, Mushtaq Ahmad, Muhammad Abid, A. Khokhar
{"title":"Implementation of 2D parallel ALE mesh generation technique in FSI problems using OpenMP","authors":"M. Hussain, Mushtaq Ahmad, Muhammad Abid, A. Khokhar","doi":"10.1145/1838002.1838022","DOIUrl":"https://doi.org/10.1145/1838002.1838022","url":null,"abstract":"In the paper, high performance implementation of an existing Arbitrary Lagrangian and Eulerian (ALE) moving mesh generation technique for shared memory systems using OpenMP is discussed. Currently, there are various existing techniques for moving mesh, but in Fluid Structure Interaction (FSI) problems, adaptive techniques using ALE method of r-type are more applicable. A conjugate gradient method with preconditioned matrix has been used for constraint optimization of the non-linear problem. In the parallel algorithm first mesh is ordered using divide and conquer approach for the processors with small cache memory. Then it is solved using OpenMP. Experiments are carried out using four AMD Opteron processors and 98% efficiency of the code in term of speed up is achieved. Quality of mesh is also verified by using Jacobian (for area) and angles of triangle.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"4 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":"129532917","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":"Policy-based traffic management in home area networks: an elementary testbed model","authors":"Annie Ibrahim Rana, Mícheál Ó Foghlú","doi":"10.1145/1838002.1838009","DOIUrl":"https://doi.org/10.1145/1838002.1838009","url":null,"abstract":"Traffic management in home area networks (HANs) is different from the traditional traffic management in access and core networks. Traditionally HAN traffic works in best effort fashion and the HAN services are usually accommodated on the basis of first-in first-out rule. However quality can deteriorate when high number of users is connected to the HAN. Moreover the bursty traffic can also impact the quality by chocking the network traffic and blocking the network resources for all other traffic. Traffic management rules can be employed in HAN to prioritise different types of traffic according to user requirements. Dynamic configuration of network resources and services is multifaceted process, which requires many skills and knowledge. Policy-based Traffic Management (PBTM) can play a significant role in managing home networks and configuring the services dynamically according to HAN user requirements. This paper presents a testbed model for HAN to simplify traffic management process based on the principles of policy-based network management.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"32 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":"127008506","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":"Urdu text classification","authors":"Abbas Raza Ali, Maliha Ijaz","doi":"10.1145/1838002.1838025","DOIUrl":"https://doi.org/10.1145/1838002.1838025","url":null,"abstract":"This paper compares statistical techniques for text classification using Naïve Bayes and Support Vector Machines, in context of Urdu language. A large corpus is used for training and testing purpose of the classifiers. However, those classifiers cannot directly interpret the raw dataset, so language specific preprocessing techniques are applied on it to generate a standardized and reduced-feature lexicon. Urdu language is morphological rich language which makes those tasks complex. Statistical characteristics of corpus and lexicon are measured which show satisfactory results of text preprocessing module. The empirical results show that Support Vector Machines outperform Naïve Bayes classifier in terms of classification accuracy.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"22 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":"128959180","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":"Channel assignment in cognitive radio networks: comparison and analysis","authors":"M. E. Ahmed, Junaid Qadir, A. Baig","doi":"10.1145/1838002.1838015","DOIUrl":"https://doi.org/10.1145/1838002.1838015","url":null,"abstract":"Traditional wireless networks are characterized by fixed spectrum assignment policy where a new approach is cognitive radio networks. In a cognitive radio paradigm we opportunistically sense the spectrum and utilize the part of the spectrum which is available. However with the new paradigm of cognitive radio wireless networks we can use spectrum depending upon the licensed user spectrum usage. To utilize the white spaces (the band of frequency, which is not used by a licensed user at particular instance, space) we need to impart cognition to cognitive nodes. In the paradigm of cognitive radio networks the heterogeneity plays the main role. In this survey paper we explained different approaches to tackle the channel assignment in wireless as well in cognitive radio networks. Due to the heterogeneous characteristics of spectrum in cognitive radio networks, efficient channel assignment becomes a challenge. This is because these channels have different ranges, data rates and interference parameter in time and space. We discuss different approaches that cater for the channel assignment problem.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"10 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":"123727779","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":"Semi-automated service composition using visual contracts","authors":"M. Naeem, R. Heckel, F. Orejas","doi":"10.1145/1838002.1838057","DOIUrl":"https://doi.org/10.1145/1838002.1838057","url":null,"abstract":"Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support for finding and selecting services. In particular, it is unrealistic to expect that a single service will satisfy complex requirements, so services will have to be combined to match clients' requests.\u0000 In this paper, we propose a visual, interactive approach for the composition of services, in which we describe the requirements of a requester as a goal which is matched against multiple provider offers. After every match with an offer we decompose the goal into satisfied and remainder parts. We iterate the decomposition until the goal is satisfied or we run out of offers.\u0000 Finally, the individual offers are combined into a single combined offer and shown to the requester for feedback. Our approach is based on visual specifications of pre- and post conditions using the theory of graph transformations systems as a formal background.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"31 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":"130647721","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":"Vision based system for camera tracking in eye-in-hand configuration","authors":"Muhammad Umer Khan, N. Iqbal, Ibrar ullah Jan","doi":"10.1145/1838002.1838089","DOIUrl":"https://doi.org/10.1145/1838002.1838089","url":null,"abstract":"This paper presents an effective approach to estimate the fixed internal and varying external parameters of the camera for real time experiments using 2D-3D point correspondences. Images are acquired at each time step, a pose estimation algorithm is then employed to determine the camera pose w.r.t the object. A simple homogenous transformation is derived between the camera and end-effector to determine the position of the manipulator end-effector, as camera is mounted on the tool in eye-in-hand configuration. The paper focuses on determining the pose accurately and to look upon those issues that we encounter in real time. The major contribution of this paper is in two folds: camera pose parameters are easily and accurately recovered from 2D to 3D point correspondence; second is that experiments using real images are conducted, which presents good results.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"2 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":"132267711","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":"A 2D parallel algorithm using MPICH for calculation of ground water flux at evaporation from water table","authors":"M. Hussain, A. Kavokin","doi":"10.1145/1838002.1838080","DOIUrl":"https://doi.org/10.1145/1838002.1838080","url":null,"abstract":"This paper discusses the calculation of distribution of hydraulic head H (x, y), [m] in flux of ground water, which is described by the known steady state groundwater flow equation with nonlinear boundary condition at unknown surface boundary. A special iterative algorithm for a numerical solution of the finite-difference approximation of the above-stated problem using known Richardson's over-relaxation method has been developed. The algorithm for parallel calculation is developed using message passing interface (MPI) for two dimensional case. It has been shown by calculation that above insertion with small coefficient of filtration, a local depression of water surface has been formed. This is the area without outflow of ground water. It may substantially cause the growth of soil salinization above surface of that depression due to evaporation of ground water, as dissolved salt stays in soil layer. Dependencies of the process on evaporation rate and depth of insertion are also discussed. An approximate 58% efficiency in time was obtained using four processes in cluster using message passing interface.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"42 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":"133546411","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":"Optimization of 16-QAM constellation in the presence of nonlinear phase noise","authors":"M. N. Chughtai, L. Beygi","doi":"10.1145/1838002.1838073","DOIUrl":"https://doi.org/10.1145/1838002.1838073","url":null,"abstract":"Electronic post compensation of nonlinear phase noise (NLPN) in fiber optical communication is analyzed in this paper. An optimized 16-QAM constellation is proposed to further improve the performance of NLPN compensation in electronic domain.\u0000 With the proposed 16-QAM constellation the optimum launched power is increased by 2 dB while the minimum symbol error rate (SER) is reduced to 10-8. In terms of transmission distance the performance of system is improved by 540 km at the minimum SER of 10-6.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"76 11-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":"114014067","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":"SAuthMash: mobile agent based self authorization in mashups","authors":"Imran Khan, M. Nauman, Masoom Alam, Furqan Aziz","doi":"10.1145/1838002.1838049","DOIUrl":"https://doi.org/10.1145/1838002.1838049","url":null,"abstract":"Mashups are web based applications that merge contents (data and code) from multiple sources, and provide an integrated view to the user. One of the main requirements in mashup is the authorization of user to the backend services. Current protocols for authorization in mashup have obvious limitations. With strawman approach a malicious or compromised mashup can leak user credentials. OAuth approach has the scalability problem and requires a statefull server at the backend service. AuthSub issues only single use token and obtaining session token requires additional steps and also explicit revocation, which may not be possible in some situation. The problem with Permit based approach is that it requires separate permit for each backend service and also require renewal or obtaining new permit in case of mashup requirements changes (e.g. read to execute). Revocation is a problem in this approach as well.\u0000 In this paper we propose a new protocol for accessing backend services in mashup. Our protocol makes use of Java based mobile agent called Aglet. The main source of problem in above approaches is due to delegating the authorization process to mashup. In our approach, mashup that require content from backend services that content is accessed and provided to the mashup through Aglet, without delegating authorization rights or releasing credentails to the mashup. Aglet has the ability to move around the nodes of a network and to sense its environment and to perform the desire actions. So the stated limitation of above approaches can be overcome with our Aglet based approach by allowing the Aglet to move across different mashup and backend services and provides data and code as necessary.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"37 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":"121851778","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-organized togetherness in a crowd group","authors":"K. Zia, S. Madani, S. N. Aslam, A. Ferscha","doi":"10.1145/1838002.1838012","DOIUrl":"https://doi.org/10.1145/1838002.1838012","url":null,"abstract":"Self-organization is a computing paradigm in which participating entities proceed to execute a global goal strictly based on local information. In population dynamics, the sense of togetherness (due to social bindings or a common confinement) experienced by a group of individuals (i.e. 'crowd group') is an interesting phenomenon to explore in the context of self-organization. Given a mechanism supporting spatial awareness, many settings require individuals belonging to a group, not only, to stay together (togetherness), but also to account for personal goals (dispersion). Self-organization can help individuals within such a group to stay together and having dispersed at the same time, togetherness being the primary requirement. In this paper, we discussed the parameters defining togetherness and dispersion within a spatially aware crowd group. In this context, the factors affecting the interplay between togetherness and dispersion were examined and maximum tolerable limits of dispersion were tailored in diverse settings of collaboration range, number of individuals willing to diverge and density of a crowd group. Simulation results provide insight into the interplay between these parameters, hence resolving operational dependencies.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"14 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":"129964699","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}