S. Jegadeesan, Z. Mansouri, A. Veeramani, F. Zarrabi
{"title":"Ultra Wideband PIFA Antenna with Supporting GSM and WiMAX for Mobile Phone Applications","authors":"S. Jegadeesan, Z. Mansouri, A. Veeramani, F. Zarrabi","doi":"10.1109/ACCT.2015.111","DOIUrl":"https://doi.org/10.1109/ACCT.2015.111","url":null,"abstract":"In this paper the PIFA antenna with multiband resonance for GSM 900, GSM 1800, WLAN 2400MHz, Bluetooth, WiMAX, 3G, 4G and UWB frequency from 3.1-10.6 GHz application is presented. Slots or stubs on the ground plane produce lower frequency resonance. Taper feed line method has been used to achieve Ultra Wide Band. The final antenna results are compared by FEM and TDM techniques using HFSS and CST microwave studio 2011 simulation softwares. The antenna is built on FR-4 low cost substrate with dielectric constant εr = 4.4 and loss tangent tan δ=0.02. The substrate height is h=1.6 mm and the substrate dimensions are 120mm×60mm. Simulation results of Specific Absorption Rate (SAR) shows that antenna has 1.44 W/Kg and 2.65 W/Kg for GSM 900 and GSM 1800. The antenna has high gain between 2-6.5 dBi with Omni directional radiation pattern. The antenna results are compared with other pervious researches.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133309036","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}
Helidon Karcanaj, Mario Banushi, Igli Tafa, Julian Fejzaj, Denis Saatciu
{"title":"Virtual Memory Behavior around Physical and Virtual System Limits","authors":"Helidon Karcanaj, Mario Banushi, Igli Tafa, Julian Fejzaj, Denis Saatciu","doi":"10.1109/ACCT.2015.96","DOIUrl":"https://doi.org/10.1109/ACCT.2015.96","url":null,"abstract":"Virtual Memory is quite an old concept in computer science. Virtual memory management has been long implemented even in hardware. Despite the many advantages it brings into the table, virtual memory poses a few challenges that must be tackled. These challenges are better observed when machines come close to their physical or virtual memory limits. In this article, we will be pushing our machine to the limits and taking notes on its behavior, raising questions and assumptions on the way.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901425","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":"The Based on Rough Set Theory Development of Decision Tree after Redundant Dimensional Reduction","authors":"Priya Pal, Deepak Motwani","doi":"10.1109/ACCT.2015.12","DOIUrl":"https://doi.org/10.1109/ACCT.2015.12","url":null,"abstract":"Decision tree technologists have been examined to be a helpful way to find out the human decision making within a host. Decision tree performs variable screening or feature selection. It requires relatively lesser effort from the users for the preparation of the data. In the proposed algorithm firstly we have undertaken to minimize the unnecessary redundancy in the decision tree, reducing the volume of the data set decision tree is a fabrication through rough set. The main advantage of rough set theory is to press out the vagueness in terms of the boundary region of a set. Rough sets do not need the primitive conditions to decide the boundaries on time. The algorithm reduces a complexity and improve accuracy, then increase. The result experiment of better accuracy and diminished tree of the complexity proposed in this algorithm.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122968048","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":"Detecting Anomalies Efficiently in SDN Using Adaptive Mechanism","authors":"Gagandeep Garg, R. Garg","doi":"10.1109/ACCT.2015.98","DOIUrl":"https://doi.org/10.1109/ACCT.2015.98","url":null,"abstract":"Monitoring and measurement of network traffic flows in SDN is key requirement for maintaining the integrity of our data in network. It plays a vital role in management task of SDN controller for controlling the traffic. Anomaly detection considered as one of the important issues while monitoring the traffic. More efficiently we detect the anomalies, easier it will be for us, to manage the traffic. However we have to consider the workload, response time and overhead on network while applying the network monitoring policies, so that our network perform with similar efficiency. To reduce the overhead, it is required to perform analysis on certain portion of traffic instead of analyzing each and every packet in the network. This paper presents an adaptive mechanism for dynamically updating the policies for aggregation of flow entries and anomaly detection, so that monitoring overhead can be reduced and anomalies can be detected with greater accuracy. In previous work, rules for expansion and contraction of aggregation policies according to adaptive behavior are defined. This paper represents a work towards reducing the complexity of dynamic algorithm for updating policies of flow counting rules for anomaly detection.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124426689","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}
K. A. Opare, Yujun Kuang, J. J. Kponyo, K. Nwizege, P. I. Tebe
{"title":"The Effect of Receiver-Side Circular Antenna Arrays on Bit Error Probability in a Wireless Line-of-Sight OAM Communication System","authors":"K. A. Opare, Yujun Kuang, J. J. Kponyo, K. Nwizege, P. I. Tebe","doi":"10.1109/ACCT.2015.53","DOIUrl":"https://doi.org/10.1109/ACCT.2015.53","url":null,"abstract":"The use of multiple-input multiple-output (MIMO) techniques is one of the proposed methods for detecting message signals multiplexed on a single frequency using multiple wireless orbital angular momentum (OAM) states. In a recent study, the use of a uniform circular array (UCA) of conventional antennas at the receive side was used in an ideal wireless OAM communication system. In this paper, we show that, using non-uniform circular array is also feasible. However, the performance is sub-optimal, compared to the use of UCA. The performance is measured using the condition number of the channel matrix and the bit error probabilities of the zero-forcing (ZF) and minimum mean square error (MMSE) equalizers under the QPSK modulation scheme.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122811799","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":"Implementation of High Performance SRAM Cell Using Transmission Gate","authors":"Joshika Sharma, S. Khandelwal, S. Akashe","doi":"10.1109/ACCT.2015.83","DOIUrl":"https://doi.org/10.1109/ACCT.2015.83","url":null,"abstract":"Static Random Access Memory (SRAM) plays a most substantial role in the microprocessor world, but as the technology is scaling down in nanometers, leakage parameters and delay are the most common problems for SRAM cell which is basically designed for very low power application. Transmission gate is used to further reduced leakage current penetrating in the 8T SRAM cell. Comparative analysis is performed by using transmission gate. This paper represents a method for design a variability aware SRAM cell. The proposed architecture of the TG8T SRAM cell is analogous to the standard 6T SRAM cell, the only exception is that they possess full transmission gates which replace an access pass transistor. The paper studies the different parameters of TG8Twrite operation at 0.7 V like leakage current is 229.2fA, leakage power is 297.4nW, delay is 20.92ns and SNR is 4.77dB. This result performs on the cadence virtuoso tool at 45nm technology.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493648","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":"TSP Solution Using Dimensional Ant Colony Optimization","authors":"Pragya, M. Dutta, Pratyush","doi":"10.1109/ACCT.2015.61","DOIUrl":"https://doi.org/10.1109/ACCT.2015.61","url":null,"abstract":"This paper describes Dimensional Ant Colony Optimization (DACO), a distributed algorithm that will be applied to solve traveling salesman problem (TSP). In an Any Colony System (ACS), a set of co-operating agents called ants co-operate to find the good solutions of TSPs. Ants co-operate using an indirect form of communication that is mediated by pheromone they deposited on the edges of the TSP graph when building solutions. The proposed system (Dimensional ACO) based on basic ACO algorithm with well defined distribution strategy in which entire search space area is initially being divided into N numbers of hyper-cubic quadrants where N is the dimension of entire search space area for updation of heuristic parameter of ACO and to improve the performance while solving TSP. From our experiments, this proposed algorithm has better performance than other standard bench mark algorithms.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125277868","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 Survey Paper on Task Scheduling Methods in Cluster Computing Environment for High Performance","authors":"Harvinder Singh, Gurdev Singh","doi":"10.1109/ACCT.2015.64","DOIUrl":"https://doi.org/10.1109/ACCT.2015.64","url":null,"abstract":"Parallel computing perform concurrently execution tasks on distributed nodes. Large application split up into tasks and run on number on nodes for high performance computing. Cluster environment composed with heterogeneous devices and software components capable of cost effective and high performance computing on parallel application. In heterogeneous cluster environment proper scheduling of tasks and allocation to nodes is important for high performance computing. Many task scheduling algorithms proposed for achieving high performance computing on heterogeneous computing. We proposed swarm technique methodology for task scheduling on heterogeneous cluster environment, which can perform better results for minimize make span, high performance and resource utilization compared to others.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"85 31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125787738","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 Schema Support for Selection of Test Case Prioritization Techniques","authors":"Sujata, G. Purohit","doi":"10.1109/ACCT.2015.91","DOIUrl":"https://doi.org/10.1109/ACCT.2015.91","url":null,"abstract":"Regression testing is a vast field of research. It is very costly and time consuming process but on the other hand very important process in software testing. Retest all, Test case Selection, Hybrid and Test Case Prioritization are its various techniques which are used to reduce the efforts in maintenance phase. In technical literature several techniques are present with their different and vast number of goals which can be applied in software projects despite of that they have not proven their true efficiency in the testing process. The major problem in regression testing area is to select the test case prioritization technique/s that is effective in such a way that maximum project characteristics should be cover in a minimum time span. However, consideration of this decision be carefully done so that loss of resources can be avoided in a software project. Based on the above scenario, author proposes a selection schema to support the selection of TCP techniques for a given software project aiming at maximizing the coverage of software project characteristics considering aspect of prioritization of software project characteristics. At the end, preliminary results of an experimental evaluation are presented. The purpose of this research is decision should be based on the objective knowledge of the techniques rather than considering some perception and assumptions.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126558140","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":"Design and Implementation of an Efficient and Adaptive Asynchronous MPR MAC Protocol for WLAN","authors":"G. Sachdeva, G. Sharvani","doi":"10.1109/ACCT.2015.11","DOIUrl":"https://doi.org/10.1109/ACCT.2015.11","url":null,"abstract":"Multi-Packet Reception (MPR) technology helps in increasing throughput of Wireless Local Area Networks (WLANs) significantly by allowing multiple nodes to transmit even in the presence of ongoing transmissions in the wireless medium. Instead of discouraging overlapping transmissions as in 802.11 Distributed Coordinated Function (DCF) Medium Access Control (MAC), the proposed MAC layer must facilitate their occurrence in order to benefit from MPR. At the same time, the MAC should retain the distributed manner in which nodes access the medium, as this is a key reason behind the success of DCF MAC. The proposed algorithm for an efficient and adaptive asynchronous MPR MAC protocol uses the Back off Timer mechanism of DCF MAC. The MAC rules for a node in terms of freezing or decrementing its Back off Timer are modified to increase the system throughput, reduce collisions and reduce the ACK delays. The MAC protocols are simulated and their performance parameters like saturation throughput, packet delay, packet dropping probability and packet collision probability are analyzed.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122465402","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}