M. Mujumdar, Meenakshi Bheevgade, L. Malik, R. Patrikar
Many complex scientific, mathematical applications require large time for completion. To deal with this issue, parallelization is popularly used. Distributing an application onto several machines is one of the key aspects of grid-computing. This paper focuses on a check point/restart mechanism used to overcome the problem of job suspension at a failed node in a computational Grid. The ability to checkpoint a running application and restart it later can provide many useful benefits including fault recovery by rolling back an application to a previous checkpoint, advanced resources sharing, better application response time by restarting applications from checkpoints instead of from scratch, and improved system utilization, efficient high performance computing and improved service availability.
{"title":"High Performance Computational Grids Fault Tolerance at System Level","authors":"M. Mujumdar, Meenakshi Bheevgade, L. Malik, R. Patrikar","doi":"10.1109/ICETET.2008.21","DOIUrl":"https://doi.org/10.1109/ICETET.2008.21","url":null,"abstract":"Many complex scientific, mathematical applications require large time for completion. To deal with this issue, parallelization is popularly used. Distributing an application onto several machines is one of the key aspects of grid-computing. This paper focuses on a check point/restart mechanism used to overcome the problem of job suspension at a failed node in a computational Grid. The ability to checkpoint a running application and restart it later can provide many useful benefits including fault recovery by rolling back an application to a previous checkpoint, advanced resources sharing, better application response time by restarting applications from checkpoints instead of from scratch, and improved system utilization, efficient high performance computing and improved service availability.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517369","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}
Quantum cellular automata (QCA) circuits, the new generation nanotechnology with wide attention in recent years. In this we are proposing a framework based on QCA for finding out the stuck-at fault of a circuit. The existing technologies and methods are not guaranteed to detect the stuck-at faults. This work is motivated by the fact that the stuck-at fault test set of a circuit is not guaranteed to detect all defects that can occur in its QCA implementation.
{"title":"New Technique for Fault Detection in Quantum Cellular Automata","authors":"Binu K. Mathew, Shajimon K. John, C. Pradeep","doi":"10.1109/ICETET.2008.186","DOIUrl":"https://doi.org/10.1109/ICETET.2008.186","url":null,"abstract":"Quantum cellular automata (QCA) circuits, the new generation nanotechnology with wide attention in recent years. In this we are proposing a framework based on QCA for finding out the stuck-at fault of a circuit. The existing technologies and methods are not guaranteed to detect the stuck-at faults. This work is motivated by the fact that the stuck-at fault test set of a circuit is not guaranteed to detect all defects that can occur in its QCA implementation.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"117 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126306423","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}
General solutions for determining the stress intensity factors, for cracks emanating from circular hole in laminated composite infinite plate subjected to arbitrary loading, with layers of arbitrary fiber orientations and stacking sequence, are obtained using Muskhelishvilipsilas complex variable method. The stress functions are obtained by evaluating Schwarzpsilas integral for the given boundary conditions. The generalized formulation thus obtained is coded and numerical results are obtained using MATLAB 6.5. The effect of crack orientation, loading pattern and fiber orientation is studied for orthotropic and isotropic plates. For some of the cases half crack plane stress model are prepared in ANSYS and results are compared with present method.
{"title":"Stress Intensity Factors for Cracks Emanating from a Circular Hole in Laminated Composite Infinite Plate Under Different Loading Conditions","authors":"D. Sharma, V. G. Ukadgaonker","doi":"10.1109/ICETET.2008.98","DOIUrl":"https://doi.org/10.1109/ICETET.2008.98","url":null,"abstract":"General solutions for determining the stress intensity factors, for cracks emanating from circular hole in laminated composite infinite plate subjected to arbitrary loading, with layers of arbitrary fiber orientations and stacking sequence, are obtained using Muskhelishvilipsilas complex variable method. The stress functions are obtained by evaluating Schwarzpsilas integral for the given boundary conditions. The generalized formulation thus obtained is coded and numerical results are obtained using MATLAB 6.5. The effect of crack orientation, loading pattern and fiber orientation is studied for orthotropic and isotropic plates. For some of the cases half crack plane stress model are prepared in ANSYS and results are compared with present method.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864914","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}
This paper describes a gesture recognition system in which a hand gesture commands are recognized. A fuzzy C-means clustering method is used to classify hand postures as "gestures". The fuzzy recognition system was tested for both user dependent and user independent gestures vocabulary. Results revealed recognition rate (the ratio of user independent gestures to user dependent gestures) recognition accuracy the percent of he user dependent gestures recognized correctly of 100%. And user independent gestures recognized correctly of 54%. No gestures was recognized incorrectly. Performance times to carry out the pushing task showed rapid learning, reaching standard times within 4 to 6 trials by an inexperienced operator.
{"title":"Hand Gesture Recognition System Using Standard Fuzzy C-Means Algorithm for Recognizing Hand Gesture with Angle Variations for Unsupervised Users","authors":"Sachin K. Korde, K. Jondhale","doi":"10.1109/ICETET.2008.90","DOIUrl":"https://doi.org/10.1109/ICETET.2008.90","url":null,"abstract":"This paper describes a gesture recognition system in which a hand gesture commands are recognized. A fuzzy C-means clustering method is used to classify hand postures as \"gestures\". The fuzzy recognition system was tested for both user dependent and user independent gestures vocabulary. Results revealed recognition rate (the ratio of user independent gestures to user dependent gestures) recognition accuracy the percent of he user dependent gestures recognized correctly of 100%. And user independent gestures recognized correctly of 54%. No gestures was recognized incorrectly. Performance times to carry out the pushing task showed rapid learning, reaching standard times within 4 to 6 trials by an inexperienced operator.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131145296","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}
Nowadays, Internet has become the common media of communication. Many group communication applications can easily be conducted on the Internet. Some group communication applications pose strict requirement that in case of network partitions or on each join/leave event, a group key establishment protocol should not execute itself afresh. Although many group key establishment protocols have been proposed in the literature, yet nothing has been done to establish their suitability for aforementioned scenarios. In this paper, we present the succinct description of different decentralized group key establishment protocols based on independent subgroup key approach. And analyze them against parameters such as key independence, one-affects-all, local rekey, data transformation.
{"title":"Comparative Analysis of Distributed Group Key Establishment Protocols Based on Subgroup Approach","authors":"R. C. Gangwar, A. Sarje","doi":"10.1109/ICETET.2008.45","DOIUrl":"https://doi.org/10.1109/ICETET.2008.45","url":null,"abstract":"Nowadays, Internet has become the common media of communication. Many group communication applications can easily be conducted on the Internet. Some group communication applications pose strict requirement that in case of network partitions or on each join/leave event, a group key establishment protocol should not execute itself afresh. Although many group key establishment protocols have been proposed in the literature, yet nothing has been done to establish their suitability for aforementioned scenarios. In this paper, we present the succinct description of different decentralized group key establishment protocols based on independent subgroup key approach. And analyze them against parameters such as key independence, one-affects-all, local rekey, data transformation.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128917720","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}
Graphical user interface (GUI) is an integral part of any software system. It provides communication media between software program and human being. It usually consists of commands, menus, icons, images, graphs, tables, texts etc. The proper GUI presentation is influential in human-computer interaction. The present age commonly used GUIs are windows or web, which has improved usability compared to earlier text based UI. The usual way of GUI development is based on use of GUI builders, which needs understanding, and knowledge of using them. IT professionals more commonly use them. For other professional who are developing algorithms in their own domain may have to spend more time on development of GUI rather than spending more on their domain algorithm work. The novel way of using expert systems for GUI development can reduce a GUI development efforts and time for other domain professionals. In this paper a rule-based expert system is presented for use of GUI development of integrated watershed model (IWM).
{"title":"Using Rule Based Expert System to Wrap Procedural Code of Integrated Watershed Model","authors":"Manish Godse, R. Sonar, T. Eldho, E. P. Rao","doi":"10.1109/ICETET.2008.32","DOIUrl":"https://doi.org/10.1109/ICETET.2008.32","url":null,"abstract":"Graphical user interface (GUI) is an integral part of any software system. It provides communication media between software program and human being. It usually consists of commands, menus, icons, images, graphs, tables, texts etc. The proper GUI presentation is influential in human-computer interaction. The present age commonly used GUIs are windows or web, which has improved usability compared to earlier text based UI. The usual way of GUI development is based on use of GUI builders, which needs understanding, and knowledge of using them. IT professionals more commonly use them. For other professional who are developing algorithms in their own domain may have to spend more time on development of GUI rather than spending more on their domain algorithm work. The novel way of using expert systems for GUI development can reduce a GUI development efforts and time for other domain professionals. In this paper a rule-based expert system is presented for use of GUI development of integrated watershed model (IWM).","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489306","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}
Subrajeet Mohapatra, Ratnakar Dash, P. K. Sa, B. Majhi
Since noise smoothing and image enhancement are conflicting objectives in most image processing application, so it has to be dealt properly to preserve the quality of the image. The perceptual appearance of an image may be significantly improved by modifying the high frequency components to have better edge and detail information in the image. A simple method has been proposed to improve the pitfalls of the existing unsharp mask technique which removes impulsive noise while preserving the edges and provides better contrast for visual perception. Comparative analysis on standard images at different noise conditions shows that the proposed scheme, in general, outperforms the existing schemes.
{"title":"Improved Enhancement Scheme Using a RBFN Detector for Impulse Noise","authors":"Subrajeet Mohapatra, Ratnakar Dash, P. K. Sa, B. Majhi","doi":"10.1109/ICETET.2008.105","DOIUrl":"https://doi.org/10.1109/ICETET.2008.105","url":null,"abstract":"Since noise smoothing and image enhancement are conflicting objectives in most image processing application, so it has to be dealt properly to preserve the quality of the image. The perceptual appearance of an image may be significantly improved by modifying the high frequency components to have better edge and detail information in the image. A simple method has been proposed to improve the pitfalls of the existing unsharp mask technique which removes impulsive noise while preserving the edges and provides better contrast for visual perception. Comparative analysis on standard images at different noise conditions shows that the proposed scheme, in general, outperforms the existing schemes.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574187","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}
In the past, radio systems were designed to communicate using one or two wave forms. As a result, two groups of people with different types of traditional radio were not able to communicate due to incompatibility. The need to communicate with people using different types of equipment can only be solved by using software defined radio (SDR). SDR is a wireless device that works with any communication system, be it a cellular phone, a pager, a WI-FI transceiver an AM or FM radio, a satellite communications etc. In both hardware and software Digital Signal Processing (DSP) techniques are used to design a real time system. For SDR applications involving high complexity, it becomes impossible to stay with single sampling rate and so altering the sampling rate at different stages is required for low cost DSP hardware. Thus variable sampling rates i.e. Multirate Digital Signal Processing is required.
{"title":"Multirate Digital Signal Processing for Software Defined Radio (SDR) Technology","authors":"Gagandeep Kaur, V. Raj","doi":"10.1109/ICETET.2008.207","DOIUrl":"https://doi.org/10.1109/ICETET.2008.207","url":null,"abstract":"In the past, radio systems were designed to communicate using one or two wave forms. As a result, two groups of people with different types of traditional radio were not able to communicate due to incompatibility. The need to communicate with people using different types of equipment can only be solved by using software defined radio (SDR). SDR is a wireless device that works with any communication system, be it a cellular phone, a pager, a WI-FI transceiver an AM or FM radio, a satellite communications etc. In both hardware and software Digital Signal Processing (DSP) techniques are used to design a real time system. For SDR applications involving high complexity, it becomes impossible to stay with single sampling rate and so altering the sampling rate at different stages is required for low cost DSP hardware. Thus variable sampling rates i.e. Multirate Digital Signal Processing is required.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116311346","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}
In this paper, we present the design of a scalable, fault tolerant, heterogeneous and secured distributed storage framework named SCAVENGER which would aggregate the free storage spaces of the personal computers. The datasets are fragmented and stored with enough replication in different systems. Our design includes a SCAVENGER protocol suite to monitor the joining of new system to the framework, data storage, data retrieval, system failures and network failures. We use multiple managers to make our design scalable. A synchronization protocol is designed to synchronize the data among the multiple managers quickly using the Double Tree Algorithm. We have also designed a fault tolerance model based on the parameters like blackout time, overlap time, latency, trust, load and replication. This is a minimization model which will be a fitness function for Genetic Algorithm to make decision upon the fragment size, the location of storage and the number of replications. Security is provided throughout the SCAVENGER framework by using the cryptographic mechanisms.
{"title":"Design of a Scalable, Fault Tolerant, Heterogeneous and Secured Distributed Storage Framework","authors":"C.L.J. Jerre Louis, C. Aravindan","doi":"10.1109/ICETET.2008.114","DOIUrl":"https://doi.org/10.1109/ICETET.2008.114","url":null,"abstract":"In this paper, we present the design of a scalable, fault tolerant, heterogeneous and secured distributed storage framework named SCAVENGER which would aggregate the free storage spaces of the personal computers. The datasets are fragmented and stored with enough replication in different systems. Our design includes a SCAVENGER protocol suite to monitor the joining of new system to the framework, data storage, data retrieval, system failures and network failures. We use multiple managers to make our design scalable. A synchronization protocol is designed to synchronize the data among the multiple managers quickly using the Double Tree Algorithm. We have also designed a fault tolerance model based on the parameters like blackout time, overlap time, latency, trust, load and replication. This is a minimization model which will be a fitness function for Genetic Algorithm to make decision upon the fragment size, the location of storage and the number of replications. Security is provided throughout the SCAVENGER framework by using the cryptographic mechanisms.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125804985","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}
Environmental monitoring is an area of significant research in the field of wireless sensor networks. It has the potential to reveal fine-grained, dynamic changes in monitored variables of an outdoor landscape. A network of sensor nodes spread across a field has the capacity to provide temporal and spatial data regarding the properties of the environment. For example, sensor networks could provide precise information about crops with respect to the soil quality and water content, enabling better irrigation schedules, pesticide usage and enhancing environment protection. The current paper presents a snapshot of sensor network, which can be deployed to monitor vital properties like temperature, relative humidity & soil moisture and then report them through a routing tree to a base station for further analysis. The minimum delay scheduling algorithm is discussed & compared with V-blast algorithm. It has been observed that the later one gives the precise results to monitor an environment. The importance of monitoring our physical environment has never been higher. Many groups - from agricultural operators to natural resource developers to biological researchers to homeland security - all need to make reliable, sensitive measurements in remote or dispersed locations. Some of the harshest and most demanding applications are- irrigation management ,harvest timing ,bio-remediation and containment, water quality measurement and control . In this paper, the parameter that we have taken is environmental temperature.
{"title":"Environmental Monitoring Using Wireless Sensors: A Simulation Approach","authors":"B. Hardas, G. Asutkar, K. Kulat","doi":"10.1109/ICETET.2008.198","DOIUrl":"https://doi.org/10.1109/ICETET.2008.198","url":null,"abstract":"Environmental monitoring is an area of significant research in the field of wireless sensor networks. It has the potential to reveal fine-grained, dynamic changes in monitored variables of an outdoor landscape. A network of sensor nodes spread across a field has the capacity to provide temporal and spatial data regarding the properties of the environment. For example, sensor networks could provide precise information about crops with respect to the soil quality and water content, enabling better irrigation schedules, pesticide usage and enhancing environment protection. The current paper presents a snapshot of sensor network, which can be deployed to monitor vital properties like temperature, relative humidity & soil moisture and then report them through a routing tree to a base station for further analysis. The minimum delay scheduling algorithm is discussed & compared with V-blast algorithm. It has been observed that the later one gives the precise results to monitor an environment. The importance of monitoring our physical environment has never been higher. Many groups - from agricultural operators to natural resource developers to biological researchers to homeland security - all need to make reliable, sensitive measurements in remote or dispersed locations. Some of the harshest and most demanding applications are- irrigation management ,harvest timing ,bio-remediation and containment, water quality measurement and control . In this paper, the parameter that we have taken is environmental temperature.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822545","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
扫码关注我们
求助内容：
应助结果提醒方式：