{"title":"Content Based Image Retrieval Using Geometrical-Shape of Objects in Image","authors":"A. Adnan, S. Gul, M. Ali, A. Dar","doi":"10.1109/ICET.2007.4516347","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516347","url":null,"abstract":"Although some major advances have been made in text searching; only preliminary work has been done in image search. The field of Image search is rooted in Artificial intelligence, digital signal processing, statistics, natural language understanding, databases, psychology, computer vision, and pattern recognition. However none of these fields can solve the problem of image search alone but the solution lies at the crossroads of these parent fields. In our paper we are presenting a method of Contents Based Image Search where geometrical shapes of the objects in the image are considered as contents of image. Each object is separated from the image by segmentation. Then the geometrical shape of the object is estimated and compared with a predefine set of shapes of different categories. Number of objects in an image and geometrical shape of the objects are used as contents of the image which is used for retrieval and searching. Number on objects in the image is used for first level of indexing in search process. Currently we have restricted our objects to a fix number of basic geometrical shapes for simplicity but in futures these shapes can be extended and linked to the real world objects by using more complex equations and other features like color, texture and concept of correlation. Most of the existing image retrieval systems are based on text search using keywords that are annotated manually which involve the intellectual and emotional sides of the human. But in our proposed system this process is somewhat automatic.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131792699","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":"Dynamic and Self adaptive Resource Management: ÆTHER Operating Environment","authors":"F. Muhammad, F. Muller, M. Auguin","doi":"10.1109/ICET.2007.4516329","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516329","url":null,"abstract":"The development of reconfigurable devices that could make themselves domain-specialized at run time is becoming more and more common. Future reconfigurable architecture will have these computing devices as basic blocks, and reconfigurable architecture could make assemblies of these devices, on the fly, to execute concurrent applications. The migration from completely generic lookup tables and highly connected routing fabrics to self adaptive specialized coarse-grain reconfigurable devices and very structured communication resources presents designers with the problem of how to best customize the system based upon anticipated usage. Then there is a need of not only exploiting parallelism from applications at micro-thread level, dynamically, but system also starves for a dynamic and self adaptive middleware to schedule these micro-threads on thousands of such computing devices. This paper focuses at the problem of dynamic allocation and scheduling of resources to numbers of applications on such architecture.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115681396","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":"Non-Data Aided Approach for Carrier Recovery and Modulation Identification of an M-ary PSK System","authors":"I.A. Khokhar, R. Iftikhar, A. Nawaz, K. Shehzad","doi":"10.1109/ICET.2007.4516361","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516361","url":null,"abstract":"Modulation identification and the recovery of the carrier lead to many applications in the digital communication system. Techniques developed so far for carrier recovery and modulation identification are all statistical. In this paper efforts are made to use a deterministic method rather than statistical. Zero crossing detection method is recommended for use to recover carrier from frequency and amplitude modulated systems. In this paper some modifications have been suggested for the application of the same system to make it useful for QAM and PSK as well. Based on the method presented by R. W. Wall, a modified Zero Crossing Detection algorithm has been used for carrier and phase extraction from an M-ary PSK (differential and non-differential) system. In addition, method has been developed for M-ary PSK system identification.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122015733","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":"Video Based Effective Density Measurement for Wireless Traffic Control Application","authors":"R. Awan, F. Rani","doi":"10.1109/ICET.2007.4516324","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516324","url":null,"abstract":"In many countries, transport system basically works on the static scenario. There is a fix duration for which the red & green signals used to open and close and it remains same for almost all times of day whether the roads have heavy traffic or low. There is no real time timing calculation. Because of this situation the traffic is not so properly adjusted and handled on the roads. We have developed a new and relatively easier method for image processing of traffic. To monitor traffic flows is not new; this research is examining the integration of digital video and image processing to improve the transport system and try to reduce the traffic jams. A technique has been developed to process the digital data, in real time, to estimate traffic density directly from the video images. The algorithm is capable of detecting vehicles and calculates traffic density, using image processing techniques. We have named the application as \"IntelliSig\", Intelligent Signals.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129156481","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":"MMOD: A General Resource Scheduling Algorithm for Computational Grid","authors":"I. Ahmad, S. Faheem, G. Qasim","doi":"10.1109/ICET.2007.4516332","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516332","url":null,"abstract":"Task scheduling is a vital and challenging task in distributed computing specially in grid computing. The computational grid focuses on large-scale resource sharing. Because of heterogeneous resources in widely distributed autonomous domains, which makes task scheduling even more challenging. In this paper, a hybrid and general resource algorithm for computational grid, MMOD is presented. MMOD, a general resource scheduling algorithm for computational grid is proposed for task scheduling with time-cost minimization and with maximum resource utilization. The experiments show the performance improvement for applications and better resource utilization by this algorithm, raises the user satisfaction and minimizes time as well as cost.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130408534","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":"Category of Fuzzy Operators in SQL","authors":"T. Memon, M.M.U. Ghani, N. Iftikhar","doi":"10.1109/ICET.2007.4516327","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516327","url":null,"abstract":"Current database management systems have their limitations when it comes to handling imprecise data. Several DBMS prototypes emerged in this regard by merging the laws of fuzzy set theory with different database models; but it has been observed that these systems could not gain much popularity because of the hesitation by users' to replace the conventional and reliable DBMS with them. Therefore, instead of developing a new fuzzy DBMS, the focus of this paper is to find a way to enhance the current database management systems, and enabling them to handle precise as well as imprecise data. The approach taken here for this purpose is to embed fuzziness in SQL language without changing its underlying structure. As a first step, a new category of operators is being introduced in SQL, naming Fuzzy Operators. The paper introduces two fuzzy operators - NEAR and NOT NEAR, explaining their working and the algorithms to implement them.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130456167","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":"Ku Band Microstrip Patch Antenna Array","authors":"O. M. Khan, Z. Ahmad, D.Q. Islam","doi":"10.1109/ICET.2007.4516312","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516312","url":null,"abstract":"Design of a Microstrip single element and three different array antennas are presented in this paper. Two different array configurations are designed and simulated for 4 element arrays, along with a 2 element array. The design is done for Ku Band Applications at 16 GHz. The substrate height is 0.254 mm and the dielectric constant is 2.2 of RT/duroid 5880 (tm). Simulation is done in HFSS and the results are exhibited, which show increase in directivity and gain with the increase in patch elements.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122801090","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}
Sheeraz Ahmed, Muhammad Bilal, U. Farooq, Fazl-e-Hadi
{"title":"Performance Analysis of various routing strategies in Mobile Ad hoc Network using QualNet simulator","authors":"Sheeraz Ahmed, Muhammad Bilal, U. Farooq, Fazl-e-Hadi","doi":"10.1109/ICET.2007.4516317","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516317","url":null,"abstract":"The defining characteristic of MANET such as dynamically changing network topology, resource-poor devices and multi-hop nature makes the data transmission very computational. Keeping in view such constraints and complexities, a number of routing protocols have been developed. In this paper, three routing protocols AODV (Ad hoc On demand distance vector), OLSR (Optimized link state routing) and ZRP (Zone routing protocol) are analyzed and compared by using proposed technologies (QualNet simulator) on the basis of performance metrics such as PDR (packet delivery ratio), end-to-end delay and throughput. To test their efficiency under different network scenarios and provide a qualitative assessment of the applicability of the protocols. Simultaneously, evaluation is done by varying network size and traffic load for two different levels of node density and the results are examined and analyzed at different scenarios.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114753380","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":"Bluetooth Device Discovery and Hop Synchronization by the Eavesdropper","authors":"A. A. Tabassam, S. Heiss, M. Hoiing","doi":"10.1109/ICET.2007.4516305","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516305","url":null,"abstract":"Bluetooth radio system uses the Frequency Hopping Spread-Spectrum (FHSS) and Time Division Duplexing (TDD) for transmitting and receiving a packet at 79 different channels at 1,600 hop per/sec. The Bluetooth devices must be properly synchronized so that they can hopped together from channel to channel; this can be done by using the same channel set as well as the same hopping sequence within that channel set along with the time synchronized within hopping sequence. The Inquiry procedure is used to locate the Bluetooth devices in neighborhood, Page procedure is used to establish the connection for Bluetooth communication. This paper describes how to eavesdrop packets which can determine the pseudorandom seed for the inquiry and paging hopping sequence by scanning the inquiry and page frequencies, which is done by eavesdropping on the identity/control (FHS) packets that are exchanged during the inquiry procedure and page procedure. We can determine the pseudo-random seed for the channel hopping sequence of the piconet from the master's device address and its clock from the ongoing communication.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126821302","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}
M. Imran, I. A. Niaz, S. Haider, N. Hussain, M. Ansari
{"title":"Towards Optimal Fault Tolerant Scheduling in Computational Grid","authors":"M. Imran, I. A. Niaz, S. Haider, N. Hussain, M. Ansari","doi":"10.1109/ICET.2007.4516335","DOIUrl":"https://doi.org/10.1109/ICET.2007.4516335","url":null,"abstract":"Grid environment has significant challenges due to diverse failures encountered during job execution. Computational grids provide the main execution platform for long running jobs. Such jobs require long commitment of grid resources. Therefore fault tolerance in such an environment cannot be ignored. Most of the grid middleware have either ignored failure issues or have developed adhoc solutions. Most of the existing fault tolerance techniques are application dependant and causes cognitive problem. This paper examines existing fault detection and tolerance techniques in various middleware. We have proposed fault tolerant layered grid architecture with cross-layered design. In our approach Hybrid Particle Swarm Optimization (HPSO) algorithm and Anycast technique are used in conjunction with the Globus middleware. We have adopted a proactive and reactive fault management strategy for centralized and distributed environments. The proposed strategy is helpful in identifying root cause of failures and resolving cognitive problem. Our strategy minimizes computation and communication thus achieving higher reliability. Anycast limits the effect of Denial of Service/Distributed Denial of Service D(DoS) attacks nearest to the source of the attack thus achieving better security. Significant performance improvement is achieved through using Anycast before HPSO. The selection of more reliable nodes results in less overhead of checkpointing.","PeriodicalId":346773,"journal":{"name":"2007 International Conference on Emerging Technologies","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124965270","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}