S. Asghar, M. Hafeez, U. A. Malik, Adeel-ur-Rehman, N. Riaz
{"title":"A-JUMP, architecture for Java universal message passing","authors":"S. Asghar, M. Hafeez, U. A. Malik, Adeel-ur-Rehman, N. Riaz","doi":"10.1145/1943628.1943662","DOIUrl":"https://doi.org/10.1145/1943628.1943662","url":null,"abstract":"Nowadays, there is a persistent demand of greater computational power to solve complex problems. High Performance Computing (HPC) with the modern trend to multi-core clusters accentuates the importance of parallelism and multithreading. This paper presents a Java based message passing implementation, named Architecture for Java Universal Message Passing (A-JUMP). A-JUMP provides flexibility to programmers in writing parallel applications using multiple programming languages. Moreover, it also provides facility to use different network protocols for message communication. The backbone of A-JUMP is HPC bus that facilitates the development of parallel applications. It provides the interoperability between different hardware resources, communication protocols and mediums. The HPC bus is built upon well-established industry standards; Java Messaging Service (JMS) and Java programming language. In HPC bus, ActiveMQ is solely responsible for communication and message passing in an asynchronous manner. The communication layer of A-JUMP is disentangled from the rest of HPC bus implementation that ensures that any changes in communication protocol and network topology will remain transparent to the end users. The components of A-JUMP includes; Job Scheduler, Monitoring, Machine Registry, and Code Migrator/Execution other than HPC bus. In addition, it includes a set of easy to use APIs for writing MPI-like code. The results demonstrate promising performance for standard benchmarks like ping pong latency tests and embarrassingly parallel (EP) code execution. The comparison of these results with MPICH and MPJ Express are also presented.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"89 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133758195","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":"High performance computing for energy efficient buildings","authors":"I. Akhtar, J. Borggaard, J. Burns","doi":"10.1145/1943628.1943664","DOIUrl":"https://doi.org/10.1145/1943628.1943664","url":null,"abstract":"Commercial buildings are the largest single consumer of energy in the United States. Energy efficient buildings will have a significant impact on overall energy consumption and greenhouse gas emissions. Buildings being multi-scale, multi-physics, highly uncertain dynamic systems, its energy efficiency is directly linked with the design and control of various systems in buildings. Achieving substantial levels of energy savings over the life-time of a building require not only the state-of-the-art hardware technology but also a thorough computational framework which includes mathematical algorithms, computational science methodologies and computer tools targeted for rapid analysis, optimization and control. Direct application of high fidelity simulation models to problems of optimal design and control is not feasible. Thus, reduced-order models are often developed for an efficient design and control. In this study, we present the application of high performance computing tools to perform high fidelity flow simulations in a typical room which serves as a basic unit in a building. Using a large data set of the flow and temperature field distributed among various processors, we compute optimal basis functions in parallel. These basis functions are used in developing reduced-order models of complex systems for control and optimization purposes.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134421361","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":"Parameter estimation of a DC motor using ordinary least squares and recursive least squares algorithms","authors":"S. Arshad, Saima Qamar, Tayba Jabbar, Ahsan Malik","doi":"10.1145/1943628.1943659","DOIUrl":"https://doi.org/10.1145/1943628.1943659","url":null,"abstract":"This paper gives an insight into the working and efficiency of the two basic algorithms used for parameter estimation: Ordinary Least Squares (OLS) and Recursive Least Squares (RLS). A simple DC motor is taken here as an example of a SISO system. The input voltage and the output in the form of rotations of the motor are given to the parameter estimator. The parameters of the motor are determined using both the algorithms and, hence, a comparison is given on the basis of those results.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131114711","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":"Building AS-IS process models from task descriptions","authors":"Azeem Lodhi, G. Kassem, V. Köppen, G. Saake","doi":"10.1145/1943628.1943642","DOIUrl":"https://doi.org/10.1145/1943628.1943642","url":null,"abstract":"Business processes have to adopt the changes driven by the market to remain competitive. This requires improvement of business processes, which can be carried out by understanding the existing business processes. For this AS-IS business process models are built that represent the actual situation of the enterprise. In this paper, we propose an approach to build an AS-IS process model from employee's descriptions instead of instance executions in information systems. We also present an algorithm that builds an AS-IS model from control flow perspective and we further elaborate it with the help of a case study.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114931361","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}
Aida Vosoughi, Kashif Bilal, S. Khan, N. Min-Allah, Juan Li, N. Ghani, P. Bouvry, S. Madani
{"title":"A multidimensional robust greedy algorithm for resource path finding in large-scale distributed networks","authors":"Aida Vosoughi, Kashif Bilal, S. Khan, N. Min-Allah, Juan Li, N. Ghani, P. Bouvry, S. Madani","doi":"10.1145/1943628.1943644","DOIUrl":"https://doi.org/10.1145/1943628.1943644","url":null,"abstract":"This paper proposes a robust greedy algorithm and four of its variants for the resource path finding problem in distributed networks. In contrast to the existing solutions that rely on a single minimum cost path for each request, the proposed algorithm makes use of finding \"robust\" paths for each request within the network. We give a mathematical definition of robustness for the resource path finding problem in distributed networks. The four proposed variants are then compared with each other and with a traditional \"non-robust\" path finding algorithm. The simulation results show interesting improvement in solution quality when robustness is incorporated into the path finding algorithm for distributed networks.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114884967","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}
Hammad Qureshi, Mahjabeen Khan, S. Quadri, R. Hafiz
{"title":"Association of pre-pregnancy weight and weight gain with perinatal mortality","authors":"Hammad Qureshi, Mahjabeen Khan, S. Quadri, R. Hafiz","doi":"10.1145/1943628.1943656","DOIUrl":"https://doi.org/10.1145/1943628.1943656","url":null,"abstract":"Reducing infant mortality is one of the primary Millennium Development Goals 2015. A lot of effort has been made to reduce infant mortality but it remains high in most of the developing countries and the underdeveloped world. Perinatal Mortality is a cause of great emotional pain and social unrest. The main cause of pregnancy failure in the developed world is obesity but in the under-developed world the main cause remains malnutrition. However, their are a mix of factors that affect pregnancy failure in the developing countries. Pakistan has a very high infant mortality rate which stands at 78 deaths per 1000 births. The reasons for this are many including lack of proper healthcare. This is because of a severe shortage of healthcare professionals and specialists in Pakistan. The gap in healthcare may be overcome by leveraging IT to provide automated healthcare. In this paper, we show how machine learning may be used to predict perinatal failure. We examine the relationship between pre-pregnancy weight, weight gain during pregnancy and the body mass index (BMI) to investigate how they relate to foetal failure. We employ the K Nearest Neighbor (K-NN) technique to automatically differentiate between successful and failed pregnancies. Our method is able to predict the the outcome of a pregnancy with about 95% accuracy.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122043469","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":"Real-time data warehousing for business intelligence","authors":"F. Farooq, S. M. Sarwar","doi":"10.1145/1943628.1943666","DOIUrl":"https://doi.org/10.1145/1943628.1943666","url":null,"abstract":"Real-time ETL and data warehouse multidimensional modeling (DMM) of business operational data has become an important research issue in the area of real-time data warehousing (RTDW). In this study, some of the recently proposed real-time ETL technologies from the perspectives of data volumes, frequency, latency, and mode have been discussed. In addition, we highlight several advantages of using semi-structured DMM (i.e. XML) in RTDW instead of traditional structured DMM (i.e., relational). We compare the two DMMs on the basis of four characteristics: heterogeneous data integration, types of measures supported, aggregate query processing, and incremental maintenance. We implemented the RTDW framework for an example telecommunication organization. Our experimental analysis shows that if the delay comes from the incremental maintenance of DMM, no ETL technology (full-reloading or incremental-loading) can help in real-time business intelligence.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121110854","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":"Configurable, low-power design for inverse integer transform in H.264/AVC","authors":"M. Nadeem, Stephan Wong, G. Kuzmanov","doi":"10.1145/1943628.1943660","DOIUrl":"https://doi.org/10.1145/1943628.1943660","url":null,"abstract":"The inverse integer transform is one of the compute-intensive processing units in an H.264/AVC video decoder. In this paper, we propose a configurable, low-power design for the inverse integer transform in an H.264/AVC decoder for video processing applications running on battery-powered electronic devices such as mobile phone. The proposed design is based on a data-driven computation algorithm for the inverse integer transform. It efficiently exploits the zero-valued coefficients in the input blocks to reduce dynamic power consumption. The area-requirement for the hardware implementation of the proposed design is reduced by designing configurable processing units to share the same hardware resources on the device. The proposed design is described in VHDL and is synthesized under 0.18μm CMOS standard cell technology. The experimental results show that the proposed design consumes significantly less dynamic power (up to 80% reduction) when compared with existing conventional design for the inverse integer transform, with a small area-overhead (approximately 2K gates).","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133171403","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":"Security issues related with DNS dynamic updates for mobile nodes: a survey","authors":"Sadaf Yasmin, M. Yousaf, A. Qayyum","doi":"10.1145/1943628.1943645","DOIUrl":"https://doi.org/10.1145/1943628.1943645","url":null,"abstract":"In today's heterogeneous wireless environment mobile nodes can move across different networks. This movement can cause to change the IP address of the mobile node thus, making it unreachable for other nodes in the network. In order to be available for other nodes, mobile node needs some location management mechanism. DNS dynamic updates have been proposed to be used as location manager for many transport layer mobility management protocols. Although secure dynamic DNS updates are used for location management however, we have found that these secure updates are also susceptible to certain security issues. In this paper, we have highlighted many of these issues and discussed solutions that address these security issues. It has also been found that many of these attacks are interdependent on each other.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130111860","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}
Muhammad Asad Khan, T. Ali, M. Irfan, Khurram Ali Shah, F. Ali
{"title":"A novel grid middleware architecture","authors":"Muhammad Asad Khan, T. Ali, M. Irfan, Khurram Ali Shah, F. Ali","doi":"10.1145/1943628.1943657","DOIUrl":"https://doi.org/10.1145/1943628.1943657","url":null,"abstract":"The important field associated to high throughput computing (HTC) [1] emerged as grid computing. With the development of cluster computing the overheads of the hardware required to execute rigorous computations has been reduced. The major drawback of such technology is that the cluster consists of dedicated systems. If a machine is idle, it remains idle as its processing cycles are not accessible to other users. At universities and corporations, computing recourses are available as most of the CPU remains idle for most of the time and its consumption is less then 10%. This paper provides a Generic Architecture for the Distribution, Allocation and Execution of threads across a network \"To Share Execution Power amongst systems in order to Utilize Maximum System Resources\" and to provide an Administrative Layer over Operating System to Distribute Threads in a Grid which is not provided in the existing architectures. A middleware responsible for thread parallelism at different levels but the parallelism will be controlled at application layer by allocating the threads dynamically, its distribution and execution through a grid.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128893226","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}