2013 15th International Conference on Advanced Computing Technologies (ICACT)最新文献

筛选
英文 中文
A modified Ant Colony optimization algorithm with load balancing for job shop scheduling 一种改进的负载均衡蚁群优化算法用于作业车间调度
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710527
Rajesh Chaukwale, S. Kamath
{"title":"A modified Ant Colony optimization algorithm with load balancing for job shop scheduling","authors":"Rajesh Chaukwale, S. Kamath","doi":"10.1109/ICACT.2013.6710527","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710527","url":null,"abstract":"The problem of efficiently scheduling jobs on several machines is an important consideration when using Job Shop scheduling production system (JSP). JSP is known to be a NP-hard problem and hence methods that focus on producing an exact solution can prove insufficient in finding an optimal resolution to JSP. Hence, in such cases, heuristic methods can be employed to find a good solution within reasonable time. In this paper, we study the conventional ACO algorithm and propose a Load Balancing ACO algorithm for JSP. We also present the observed results, and discuss them with reference to the conventional ACO. It is observed that the proposed algorithm gives better results when compared to conventional ACO.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126236789","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}
引用次数: 13
Design development & performance analysis of high speed comparator for reconfigurable ΣΔ ADC with 180 nm TSMC technology 采用180纳米TSMC技术的可重构ΣΔ ADC高速比较器的设计开发与性能分析
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710507
HarshaVardhini Palagiri, M. Makkena, K. Chantigari
{"title":"Design development & performance analysis of high speed comparator for reconfigurable ΣΔ ADC with 180 nm TSMC technology","authors":"HarshaVardhini Palagiri, M. Makkena, K. Chantigari","doi":"10.1109/ICACT.2013.6710507","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710507","url":null,"abstract":"Comparator design has a crucial influence on the overall performance that can be achieved by Analog to Digital Converter (ADC). The need for programmable analog parts is in research from several years. The ADC's being mixed signal in nature requires novel architectures to achieve programmability by digital means. The work being carried out aims to bring out architecture of differential pin, which can give better performance when configured as comparator for reconfigurable Sigma Delta ΣΔ ADC, which fulfil an important role in today's mostly digital mixed-mode systems as interface circuits between the analog world and the powerful digital signal processing. This comparator for a ΣΔ ADC is designed using CMOS 180nm TSMC technology. The simulation is carried out with h-SPICE tool and results prove the circuit operates maximum up to 400 MHz clock speed with gain of 110K. The layout simulation results running up to 250MHz with a gain of 74K agree with the parasitic overhead.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114071309","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}
引用次数: 6
A multi level Grid File structure for mobile databases in GSM network GSM网络中移动数据库的多级网格文件结构
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710496
P. Seetharam, P. C. Babu
{"title":"A multi level Grid File structure for mobile databases in GSM network","authors":"P. Seetharam, P. C. Babu","doi":"10.1109/ICACT.2013.6710496","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710496","url":null,"abstract":"The next generation wireless networks will begin to implement mobility, personal mobility and service provider portability. A location independent personal Telecommunication scheme (PTN) is the right choice in mobile systems. However, the non-geographic PTN coupled with the anticipated large centralized database necessitate research in the design and performance of high-throughput database technologies used in mobile systems to ensure that future systems will be able to carry anticipated loads efficiently. Current techniques for location management involves in database architecture design and signal transmission between various components in a signaling network. As the numbers of mobile subscribers are increasing day by day, new or improved schemes need to effectively support a continuously increasing subscriber population. Other issues include: Security, Dynamic database updates, querying delays are also need to be considered. The study focuses on two indices, suitable for a variety of the intelligent database in mobile systems, the disk-oriented index (such as the Grid File) and the memory-resident index (such as the Multilevel Grid File Structure). To support the expected huge number of mobile subscribers in future mobile network and for efficient information retrieval, the proposed Intelligent Database architecture exploits localized nature of calling and mobility pattern and can reduce database loads and signaling traffic incurred by location registration and call delivery. The work is mainly focused on mobile networks, where call registration, call delivery, location management, information retrieval, data storage and file structures are the key points.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292565","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}
引用次数: 0
Minimizing transmission delay in IPv4 network to IPv6 network through ADSTM 通过ADSTM减少IPv4网络到IPv6网络的传输延迟
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710491
Rajesh Duvvuru, S. Singh
{"title":"Minimizing transmission delay in IPv4 network to IPv6 network through ADSTM","authors":"Rajesh Duvvuru, S. Singh","doi":"10.1109/ICACT.2013.6710491","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710491","url":null,"abstract":"Future of IP addressing is totally dependent on IPv6 rather than IPv4 to assure the Quality of Service (QoS) requirements and IPv6 have noteworthy advantages over present IPv4. Presently, the conversion mechanisms in Dual Stack Transition Mechanism (DSTM) is taking bit more time, which hampers the overall performance of the network. In this paper we have reduced the time delay of data packets transmission from IPv4 network to IPv6 network by using Fast Packet Transmission Algorithm (FTPA). In our proposed work, we have replaced DSTM with Advanced Dual Stack Transition Mechanism (ADSTM) by introducing IP header compression technique for the better performance of network. We have conducted some simulation experiments using GNS-3 tool on both the DSTM and ADSTM and in our result analysis we observed that ADSTM performed better than DSTM which minimizes the delay considerably.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126496281","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}
引用次数: 2
Acceleration of fractal video compression using FFT 利用FFT加速分形视频压缩
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710524
R. Chaudhari, S. B. Dhok
{"title":"Acceleration of fractal video compression using FFT","authors":"R. Chaudhari, S. B. Dhok","doi":"10.1109/ICACT.2013.6710524","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710524","url":null,"abstract":"Fractal based video compression promises to be an attractive technique due to its resolution independence and high compression property. The fractal video coding takes an advantage of self similarity within a frame and also between the successive frames in a video for compression. A new full search motion estimation algorithm is presented in this paper that uses FFT based circular cross-correlation as a full search block matching criteria. The processing speed of proposed block matching algorithm is higher in comparison with conventional full search block matching algorithm. This is done due to the elimination of repeated search in fractal encoding process for the best matching block in a large domain pool. Experimental results show that the proposed algorithm achieves higher processing speed as compared to conventional full search fractal encoder with equivalent quality of decompressed video for the same level of compression ratio.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127028897","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}
引用次数: 8
Priority algorithm based VLSI testing technique for BIST 基于优先级算法的大型集成电路测试技术
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710542
L. K. M. Ganesh, Lopamudra Pattanayak, K. Khare
{"title":"Priority algorithm based VLSI testing technique for BIST","authors":"L. K. M. Ganesh, Lopamudra Pattanayak, K. Khare","doi":"10.1109/ICACT.2013.6710542","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710542","url":null,"abstract":"The paper presents a low test time BIST based on Priority Algorithm (PA) is applied for the 32-bit Carry Look-Ahead Adder. This method assigns priority to the test patterns based on faulty coverage and independent faulty detecting test patterns. Experiment conducted on Cadences' RTL Compiler Tool and Cadences' Encounter Tool demonstrate that proposed scheme gives better performance with large reduction in test time and power dissipation during testing.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"206 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940640","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}
引用次数: 0
New high rate LDPC codes for radio applications 新的高速率LDPC码的无线电应用
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710530
A. Pramanik, G. Patil, L. Borman
{"title":"New high rate LDPC codes for radio applications","authors":"A. Pramanik, G. Patil, L. Borman","doi":"10.1109/ICACT.2013.6710530","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710530","url":null,"abstract":"Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. LDPC codes have found wide application in various fields like satellite transmission, recording in magnetic discs etc. because of their capability to reach near Shannon limit performance. This paper presents 3 new high rates - 0.81, 0.84 and 0.89 of length 2512, 1843 and 2619 respectively, LDPC codes for radio application. The codes are constructed using shifted identity matrix and a lower staircase matrix. The complexity of encoding of these codes is low and decoding can be done by belief propagation. Simulation results of the codes show good bit error rate performance with min-sum decoding algorithm.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123835209","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}
引用次数: 0
An improved unique canonical labeling for frequent subgraph mining 一种用于频繁子图挖掘的改进的唯一规范标记
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710534
D. Kavitha, D. Haritha, V. K. Prasad, J. Murthy
{"title":"An improved unique canonical labeling for frequent subgraph mining","authors":"D. Kavitha, D. Haritha, V. K. Prasad, J. Murthy","doi":"10.1109/ICACT.2013.6710534","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710534","url":null,"abstract":"Frequent subgraph mining is a fundamental task and widely explored in many research application domains such as computational biology, social network analysis, chemical structure analysis and web mining. The problem of frequent subgraph mining is a challenge as the number of possible subgraphs and verifying the isomorphism of the subgraphs is exponential problem. Canonical labeling is a standard approach to handle graph (subgraph) isomorphism that has high complexity and is NP-complete. In this paper we propose a systematic approach and formulate an algorithm to construct canonical label for a graph (subgraph) that uniquely identifies a graph based on the special invariant properties of graphs. Our experimental evaluation shows that this algorithm effectively addresses canonical labeling, isomorphism of graphs and reduces the computational cost.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125998963","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}
引用次数: 0
Estimating capacity credit of wind energy sources using probabilistic methods 用概率方法估计风能发电容量信用
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710488
Chandra Shekhar Reddy Atla, K. Balaraman, Aditya Patil
{"title":"Estimating capacity credit of wind energy sources using probabilistic methods","authors":"Chandra Shekhar Reddy Atla, K. Balaraman, Aditya Patil","doi":"10.1109/ICACT.2013.6710488","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710488","url":null,"abstract":"Power systems with high wind penetration undergo increased variability and uncertainty, this leads to significant research in finding the wind power capacity credit on generation adequacy. The deterministic methods used in the past does not reflect the stochastic or probabilistic nature of system behavior with regard to customer demands, component failures and intermittent nature of renewable energy sources in particular wind energy sources. It is observed that large scale integration of wind energy has an impact on power system planning and operation. The large scale wind integration calls for generation planning which is an important aspect in order to meet the customer demands with optimum mix of generation like thermal, hydro and renewable. In this paper, probabilistic method namely sequential Monte-Carlo simulation has been implemented and is validated with IEEE RTS for generation adequacy analysis. The wind model has been incorporated in Monte-Carlo simulation approach in order to find the impact of the intermittent energy sources on generation planning in terms of wind power capacity credit. In the present paper, one of the high wind penetration states in INDIA has been considered for case studies. The capacity credit of wind power has been estimated with the planned generation for next five years considering the reliability index as per GRIDCODE.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124986145","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}
引用次数: 1
Application of ACSA to solve single/multi objective OPF problem with FACTS devices ACSA在解决FACTS设备单/多目标OPF问题中的应用
2013 15th International Conference on Advanced Computing Technologies (ICACT) Pub Date : 2013-09-01 DOI: 10.1109/ICACT.2013.6710536
B. Rao, K. Vaisakh
{"title":"Application of ACSA to solve single/multi objective OPF problem with FACTS devices","authors":"B. Rao, K. Vaisakh","doi":"10.1109/ICACT.2013.6710536","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710536","url":null,"abstract":"This paper presents a multi-objective adaptive clonal selection algorithm (MOACSA) to minimise generation cost, transmission losses and voltage stability index (L-index) when voltage source converter (VSC) based flexible alternating current transmission systems (FACTS) devices are embedded in power systems. In this algorithm, a non-dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Further, a fuzzy based mechanism has been used to select best compromise solution from the Pareto set. Two types of VSC based FACTS devices such as static synchronous compensator (STATCOM) and static synchronous series compensator (SSSC) are considered and incorporated them as power injection models in multi-objective optimization problem. The proposed MOACSA has been tested on standard IEEE 30-bus test system with integration of these FACTS devices. The results are analyzed and compared with implementation of a standard nondominated sorting genetic algorithm-II(NSGA-II).","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128058488","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信