Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273431
R. Kameshwari, K. Gopinath
PPM algorithm is used in this work to dynamically migrate and reorganize data in a three-tiered secondary storage hierarchy implemented using software RAID. The three levels implemented in the prototype named temperature sensitive storage (TSS) are RAID 10, RAID 5 and compressed RAID 5 levels. Our earlier study confirmed the usefulness of this algorithm in reducing performance degradation with compressed RAID 5 levels being 20% or more of the working-set size. The usefulness of PPM for such an application is gauged not only by using performance metrics such as throughput, residual compressed RAID 5 migrations, hit and miss ratios at different migration boundaries, but also by its space and compute requirements. Results using two file-system traces Sitar and Harp show that the worst case storage requirements of the PPM has been well below 10 MB and CPU usage has been moderate. The total migrations generated for 400000 accesses has been less than 3% of the total accesses seen by the TSS device driver.
{"title":"Space and compute requirements of PPM for migration within the secondary storage","authors":"R. Kameshwari, K. Gopinath","doi":"10.1109/TENCON.2003.1273431","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273431","url":null,"abstract":"PPM algorithm is used in this work to dynamically migrate and reorganize data in a three-tiered secondary storage hierarchy implemented using software RAID. The three levels implemented in the prototype named temperature sensitive storage (TSS) are RAID 10, RAID 5 and compressed RAID 5 levels. Our earlier study confirmed the usefulness of this algorithm in reducing performance degradation with compressed RAID 5 levels being 20% or more of the working-set size. The usefulness of PPM for such an application is gauged not only by using performance metrics such as throughput, residual compressed RAID 5 migrations, hit and miss ratios at different migration boundaries, but also by its space and compute requirements. Results using two file-system traces Sitar and Harp show that the worst case storage requirements of the PPM has been well below 10 MB and CPU usage has been moderate. The total migrations generated for 400000 accesses has been less than 3% of the total accesses seen by the TSS device driver.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"610 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115428653","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273305
H. Ueda, N. Iwane, K. Takahashi, T. Miyahara
We present a method that acquires a state transition graph (STG) from input/output sequences (training sequences) of an unknown finite state machine (FSM). Our method is based on the genetic network programming (GNP) framework. Here, STGs as individuals are evolved by applying genetic operations such as crossover and mutation. The goal of the method is acquisition of an STG that is consistent with training sequences, and the number of states is as small as possible. Next, we modify our method such that the method acquires rules for an agent's decision making. In the modified method, a directed graph is used to represent rules, where nodes indicate situations that an agent is placed in, and edges represent state transitions. Each edge has two sets of information - percepts and actions. An agent first refers to the initial node, and an edge is adopted according to its percepts. The agent does the actions associated with the edges and the next state is decided. Directed graphs are used as individuals and genetic operations are applied to them to obtain good rules. These methods have been implemented and some experimental results are shown.
{"title":"Acquisition of a state transition graph using genetic network programming techniques","authors":"H. Ueda, N. Iwane, K. Takahashi, T. Miyahara","doi":"10.1109/TENCON.2003.1273305","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273305","url":null,"abstract":"We present a method that acquires a state transition graph (STG) from input/output sequences (training sequences) of an unknown finite state machine (FSM). Our method is based on the genetic network programming (GNP) framework. Here, STGs as individuals are evolved by applying genetic operations such as crossover and mutation. The goal of the method is acquisition of an STG that is consistent with training sequences, and the number of states is as small as possible. Next, we modify our method such that the method acquires rules for an agent's decision making. In the modified method, a directed graph is used to represent rules, where nodes indicate situations that an agent is placed in, and edges represent state transitions. Each edge has two sets of information - percepts and actions. An agent first refers to the initial node, and an edge is adopted according to its percepts. The agent does the actions associated with the edges and the next state is decided. Directed graphs are used as individuals and genetic operations are applied to them to obtain good rules. These methods have been implemented and some experimental results are shown.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"382 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478265","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273328
Li Jianlin, Wang Liqiao, Li Yuling, Z. Zhongchao
A novel current-source active power filter (APF) based on multi-modular converter with carrier phase-shifted SPWM (CPS-SPWM) technique has been proposed. With this technique, the effect of an equivalent high switching frequency converter has been obtained with a low switching frequency converter. It is very promising in a current-source APF, which adopts a superconducting magnetic energy storage component.
{"title":"A novel current-source converter with carrier phase shifted SPWM for active power filter","authors":"Li Jianlin, Wang Liqiao, Li Yuling, Z. Zhongchao","doi":"10.1109/TENCON.2003.1273328","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273328","url":null,"abstract":"A novel current-source active power filter (APF) based on multi-modular converter with carrier phase-shifted SPWM (CPS-SPWM) technique has been proposed. With this technique, the effect of an equivalent high switching frequency converter has been obtained with a low switching frequency converter. It is very promising in a current-source APF, which adopts a superconducting magnetic energy storage component.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599306","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273122
M. Ashourian, F. Mesrinejad, M. Ershadi
Multiple description coding refers to encoding an information source into multiple bitstreams in a way to be able to trade oft between channel protection and decoding quality. In this paper we propose a two-description subband image coder. We use over-sampling to produce redundancy for the lowest frequency subband which has the highest visual quality, and then split the subbands samples among the two descriptions. In the quantization stage, we use optimized scalar quantizer for the two descriptions of the lowest frequency subband, and pyramid vector quantization for high frequency subbands. We provide the PSNR of reconstructed image in different situations.
{"title":"Design of a fixed-rate multiple description image coder","authors":"M. Ashourian, F. Mesrinejad, M. Ershadi","doi":"10.1109/TENCON.2003.1273122","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273122","url":null,"abstract":"Multiple description coding refers to encoding an information source into multiple bitstreams in a way to be able to trade oft between channel protection and decoding quality. In this paper we propose a two-description subband image coder. We use over-sampling to produce redundancy for the lowest frequency subband which has the highest visual quality, and then split the subbands samples among the two descriptions. In the quantization stage, we use optimized scalar quantizer for the two descriptions of the lowest frequency subband, and pyramid vector quantization for high frequency subbands. We provide the PSNR of reconstructed image in different situations.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117340028","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273332
P. Nataraj, S. Srivastava
The control logic of a modern jet engine is comprised of many control loops and the control system must account for the uncertainties in the model used in its design. The paper presents a quadratic inequality based methodology for designing a robust controller for a parametrically uncertain jet engine. The inequalities are used for the generation of controller bounds to achieve robust stability and tracking specifications prior to loop shaping. The design is done in the frequency domain and the evolved robust controller controls the system that does not have a distinct set of poles and zeros but a range over which each of the poles and zeros might lie. The methodology has multifarious advantages as it can be easily implemented, does not require template generation and provides the designer with a good insight into the QFT (quantitative feedback theory) bounds at any given design frequency and controller phase. The approach is demonstrated for the design of the speed control loop of a parametrically uncertain twin spool jet engine.
{"title":"A quadratic inequality approach for design of robust controller for a parametric uncertain jet engine","authors":"P. Nataraj, S. Srivastava","doi":"10.1109/TENCON.2003.1273332","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273332","url":null,"abstract":"The control logic of a modern jet engine is comprised of many control loops and the control system must account for the uncertainties in the model used in its design. The paper presents a quadratic inequality based methodology for designing a robust controller for a parametrically uncertain jet engine. The inequalities are used for the generation of controller bounds to achieve robust stability and tracking specifications prior to loop shaping. The design is done in the frequency domain and the evolved robust controller controls the system that does not have a distinct set of poles and zeros but a range over which each of the poles and zeros might lie. The methodology has multifarious advantages as it can be easily implemented, does not require template generation and provides the designer with a good insight into the QFT (quantitative feedback theory) bounds at any given design frequency and controller phase. The approach is demonstrated for the design of the speed control loop of a parametrically uncertain twin spool jet engine.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218803","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273281
K. Sharma, P. Sreedhar
Distribution systems play a vital role in providing an efficient service in terms of power quality, reliability, and economy. Distribution network reconfiguration can be used for planning as well as real time control. The paper presents an efficient approach for network reconfiguration based on artificial neural networks. A package, called "DISTFLOW", is developed adopting the proposed technique. The off-line simulation results and daily load curve data are used for training the neural network. Further, the distribution system operation is optimized by selecting an optimum compensation level computed by genetic algorithms (GA). The proposed integrated approach is applied to a practical 140 bus system in the Surathkal city subdivision of the power utility Mangalore Electricity Supply Company (MESCOM).
{"title":"Intelligent approach for efficient operation of electrical distribution automation systems","authors":"K. Sharma, P. Sreedhar","doi":"10.1109/TENCON.2003.1273281","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273281","url":null,"abstract":"Distribution systems play a vital role in providing an efficient service in terms of power quality, reliability, and economy. Distribution network reconfiguration can be used for planning as well as real time control. The paper presents an efficient approach for network reconfiguration based on artificial neural networks. A package, called \"DISTFLOW\", is developed adopting the proposed technique. The off-line simulation results and daily load curve data are used for training the neural network. Further, the distribution system operation is optimized by selecting an optimum compensation level computed by genetic algorithms (GA). The proposed integrated approach is applied to a practical 140 bus system in the Surathkal city subdivision of the power utility Mangalore Electricity Supply Company (MESCOM).","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172288","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273166
T. Sarma, P. Rao, A. Venugopal, C. Kulkarni, P. Kumar
The remote sensing satellites transmit the data in PCM (pulse code modulation) formatted mode while embedding a synchronization code word at regular intervals as a time marker for the receiver synchronization. The currently available correlator ICs (integrated circuits) has a bandwidth limitation up to 60 MHz. The paper discusses novel design technique adopted by the authors to design the high speed digital correlator that caters to the requirements of the remote sensing satellites, which are in the road map for the next decade. The multiplexing design approach helped in achieving the higher bandwidth of operation. The VLSI (very large scale integration) design methodology adopted, resulted in reducing the design cycle time, the design optimization techniques ushered in realizing the entire logic in a single 36 macro cell CPLD (complex programmable logic device). The system has been validated for operational use.
{"title":"Design of high bit rate digital correlator","authors":"T. Sarma, P. Rao, A. Venugopal, C. Kulkarni, P. Kumar","doi":"10.1109/TENCON.2003.1273166","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273166","url":null,"abstract":"The remote sensing satellites transmit the data in PCM (pulse code modulation) formatted mode while embedding a synchronization code word at regular intervals as a time marker for the receiver synchronization. The currently available correlator ICs (integrated circuits) has a bandwidth limitation up to 60 MHz. The paper discusses novel design technique adopted by the authors to design the high speed digital correlator that caters to the requirements of the remote sensing satellites, which are in the road map for the next decade. The multiplexing design approach helped in achieving the higher bandwidth of operation. The VLSI (very large scale integration) design methodology adopted, resulted in reducing the design cycle time, the design optimization techniques ushered in realizing the entire logic in a single 36 macro cell CPLD (complex programmable logic device). The system has been validated for operational use.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"26 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123578726","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273366
C. K. Ooi, K. N. Seetharamu, Z. Alauddin, G. Quadir, K. Sim, T. J. Goh
The implementation of the finite element method (FEM) in thermal analysis usually produces a formulation in the space/time domain. This kind of space/time domain formulation leads to a set of ordinary differential equations which have to be solved in the time domain. However, the size of the equations or matrices in FEM usually are large, thus the conventional algorithms involve considerable computational time. The conventional methods have to take a very small time step size to avoid undesirable numerically induced oscillations or numerical instabilities. Thus, a new solution algorithm, named the asymptotic waveform evaluation (AWE) scheme, is introduced to solve for transient problems.
{"title":"Fast transient solutions for heat transfer [FEM]","authors":"C. K. Ooi, K. N. Seetharamu, Z. Alauddin, G. Quadir, K. Sim, T. J. Goh","doi":"10.1109/TENCON.2003.1273366","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273366","url":null,"abstract":"The implementation of the finite element method (FEM) in thermal analysis usually produces a formulation in the space/time domain. This kind of space/time domain formulation leads to a set of ordinary differential equations which have to be solved in the time domain. However, the size of the equations or matrices in FEM usually are large, thus the conventional algorithms involve considerable computational time. The conventional methods have to take a very small time step size to avoid undesirable numerically induced oscillations or numerical instabilities. Thus, a new solution algorithm, named the asymptotic waveform evaluation (AWE) scheme, is introduced to solve for transient problems.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125305043","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273412
V. Sumathy, P. Narayanasmy, K. Baskaran, T. Purusothaman
An ad hoc network, a self-organizing wireless network is made up of mobile nodes, each node act as relay for providing data communication. The topology of the ad hoc networks changes often and needs large and frequent exchange of data among the network nodes for efficient routing. Existing routing protocols are distance vector method and link state routing protocols. The location information of the adhoc network nodes are broadcasted within the transmission range. The enemy can receive the location information of the nodes. Current position aided routing protocols were not designed for use in high risk environment. We have proposed a method for secured routing in adhoc network. It is a hierarchical method to solve the above problem. This method need not maintain the route information explicitly. This reduces the number of query control messages and suits well in dynamic environment. This method is better adaptive to dynamic environment than the present proactive, reactive and zone routing protocol methods (ZRP) and improves the security, efficiency and performance in ad-hoc routing.
{"title":"GLS with secure routing in ad-hoc networks","authors":"V. Sumathy, P. Narayanasmy, K. Baskaran, T. Purusothaman","doi":"10.1109/TENCON.2003.1273412","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273412","url":null,"abstract":"An ad hoc network, a self-organizing wireless network is made up of mobile nodes, each node act as relay for providing data communication. The topology of the ad hoc networks changes often and needs large and frequent exchange of data among the network nodes for efficient routing. Existing routing protocols are distance vector method and link state routing protocols. The location information of the adhoc network nodes are broadcasted within the transmission range. The enemy can receive the location information of the nodes. Current position aided routing protocols were not designed for use in high risk environment. We have proposed a method for secured routing in adhoc network. It is a hierarchical method to solve the above problem. This method need not maintain the route information explicitly. This reduces the number of query control messages and suits well in dynamic environment. This method is better adaptive to dynamic environment than the present proactive, reactive and zone routing protocol methods (ZRP) and improves the security, efficiency and performance in ad-hoc routing.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122517139","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}
Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273223
T. Ahamed, P. S. Sastry, P. Rao
Recently, we proposed a reinforcement learning (RL) based approach for designing an automatic generation controller for a two-area power system (Ahamed, T.P.I. et al., Electric Power Systems Research, vol.63, p.9-26, 2002), where we demonstrated the efficacy of the approach on an identical, simple, two-area model. This paper aims to demonstrate an alternative RL-AGC design which is simpler. Its effectiveness is demonstrated by considering a hydro-thermal system whose dynamics are more complicated than the system considered previously.
{"title":"A new reinforcement learning based automatic generation controller for hydro-thermal power systems","authors":"T. Ahamed, P. S. Sastry, P. Rao","doi":"10.1109/TENCON.2003.1273223","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273223","url":null,"abstract":"Recently, we proposed a reinforcement learning (RL) based approach for designing an automatic generation controller for a two-area power system (Ahamed, T.P.I. et al., Electric Power Systems Research, vol.63, p.9-26, 2002), where we demonstrated the efficacy of the approach on an identical, simple, two-area model. This paper aims to demonstrate an alternative RL-AGC design which is simpler. Its effectiveness is demonstrated by considering a hydro-thermal system whose dynamics are more complicated than the system considered previously.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114423607","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：