�ݺ�ߣshows by User: cseij

�ݺ�ߣshows by User: cseij / http://www.slideshare.net/images/logo.gif �ݺ�ߣshows by User: cseij / Wed, 29 Jan 2020 10:41:50 GMT �ݺ�ߣShare feed for �ݺ�ߣshows by User: cseij APPLICATION OF PARTICLE SWARM OPTIMIZATION TO MICROWAVE TAPERED MICROSTRIP LINES /slideshow/application-of-particle-swarm-optimization-to-microwave-tapered-microstrip-lines-225834040/225834040 4114cseij06-200129104150
Application of metaheuristic algorithms has been of continued interest in the field of electrical engineering because of their powerful features. In this work special design is done for a tapered transmission line used for matching an arbitrary real load to a 50Ω line. The problem at hand is to match this arbitray load to 50 Ω line using three section tapered transmission line with impedances in decreasing order from the load. So the problem becomes optimizing an equation with three unknowns with various conditions. The optimized values are obtained using Particle Swarm Optimization. It can easily be shown that PSO is very strong in solving this kind of multiobjective optimization problems.]]>
Application of metaheuristic algorithms has been of continued interest in the field of electrical engineering because of their powerful features. In this work special design is done for a tapered transmission line used for matching an arbitrary real load to a 50Ω line. The problem at hand is to match this arbitray load to 50 Ω line using three section tapered transmission line with impedances in decreasing order from the load. So the problem becomes optimizing an equation with three unknowns with various conditions. The optimized values are obtained using Particle Swarm Optimization. It can easily be shown that PSO is very strong in solving this kind of multiobjective optimization problems.]]> Wed, 29 Jan 2020 10:41:50 GMT /slideshow/application-of-particle-swarm-optimization-to-microwave-tapered-microstrip-lines-225834040/225834040 cseij@slideshare.net(cseij) APPLICATION OF PARTICLE SWARM OPTIMIZATION TO MICROWAVE TAPERED MICROSTRIP LINES cseij Application of metaheuristic algorithms has been of continued interest in the field of electrical engineering because of their powerful features. In this work special design is done for a tapered transmission line used for matching an arbitrary real load to a 50Ω line. The problem at hand is to match this arbitray load to 50 Ω line using three section tapered transmission line with impedances in decreasing order from the load. So the problem becomes optimizing an equation with three unknowns with various conditions. The optimized values are obtained using Particle Swarm Optimization. It can easily be shown that PSO is very strong in solving this kind of multiobjective optimization problems. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/4114cseij06-200129104150-thumbnail.jpg?width=120&height=120&fit=bounds" /> Application of metaheuristic algorithms has been of continued interest in the field of electrical engineering because of their powerful features. In this work special design is done for a tapered transmission line used for matching an arbitrary real load to a 50Ω line. The problem at hand is to match this arbitray load to 50 Ω line using three section tapered transmission line with impedances in decreasing order from the load. So the problem becomes optimizing an equation with three unknowns with various conditions. The optimized values are obtained using Particle Swarm Optimization. It can easily be shown that PSO is very strong in solving this kind of multiobjective optimization problems.

APPLICATION OF PARTICLE SWARM OPTIMIZATION TO MICROWAVE TAPERED MICROSTRIP LINES from cseij

]]> 23 0 https://cdn.slidesharecdn.com/ss_thumbnails/4114cseij06-200129104150-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 6th International Conference on Software Engineering (SOFE 2020) /slideshow/6th-international-conference-on-software-engineering-sofe-2020/222379284 sofewithoutdates-200121055100
6th International Conference on Software Engineering (SOFE 2020) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas.]]>
6th International Conference on Software Engineering (SOFE 2020) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas.]]> Tue, 21 Jan 2020 05:51:00 GMT /slideshow/6th-international-conference-on-software-engineering-sofe-2020/222379284 cseij@slideshare.net(cseij) 6th International Conference on Software Engineering (SOFE 2020) cseij 6th International Conference on Software Engineering (SOFE 2020) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/sofewithoutdates-200121055100-thumbnail.jpg?width=120&height=120&fit=bounds" /> 6th International Conference on Software Engineering (SOFE 2020) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Software Engineering. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern software engineering concepts and establishing new collaborations in these areas.

6th International Conference on Software Engineering (SOFE 2020) from cseij

]]> 16 0 https://cdn.slidesharecdn.com/ss_thumbnails/sofewithoutdates-200121055100-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 A Novel Design of a Parallel Machine Learnt Generational Garbage Collector /slideshow/a-novel-design-of-a-parallel-machine-learnt-generational-garbage-collector/178773677 4614cseij02-191003130808
The Generational Garbage collection involves organizing the heap into different divisions of memory space in-order to filter long-lived objects from short-lived objects through moving the surviving object of each generation’s GC cycle to another memory space, updating its age and reclaiming space from the dead ones. The problem in this method is that, the longer an object is alive during its initial generations, the longer the garbage collector will have to deal with it by checking for its reachability from the root and promoting it to other space divisions, where as the ultimate goal of the GC is to reclaim memory from unreachable objects at a minimal time possible. This paper is a proposal of a method where the lifetime of every object getting into the heap will be predicted and will be placed in heap accordingly for the garbage collector to deal more with reclaiming space from dead object and less in promoting the live ones to the higher level. ]]>
The Generational Garbage collection involves organizing the heap into different divisions of memory space in-order to filter long-lived objects from short-lived objects through moving the surviving object of each generation’s GC cycle to another memory space, updating its age and reclaiming space from the dead ones. The problem in this method is that, the longer an object is alive during its initial generations, the longer the garbage collector will have to deal with it by checking for its reachability from the root and promoting it to other space divisions, where as the ultimate goal of the GC is to reclaim memory from unreachable objects at a minimal time possible. This paper is a proposal of a method where the lifetime of every object getting into the heap will be predicted and will be placed in heap accordingly for the garbage collector to deal more with reclaiming space from dead object and less in promoting the live ones to the higher level. ]]> Thu, 03 Oct 2019 13:08:08 GMT /slideshow/a-novel-design-of-a-parallel-machine-learnt-generational-garbage-collector/178773677 cseij@slideshare.net(cseij) A Novel Design of a Parallel Machine Learnt Generational Garbage Collector cseij The Generational Garbage collection involves organizing the heap into different divisions of memory space in-order to filter long-lived objects from short-lived objects through moving the surviving object of each generation’s GC cycle to another memory space, updating its age and reclaiming space from the dead ones. The problem in this method is that, the longer an object is alive during its initial generations, the longer the garbage collector will have to deal with it by checking for its reachability from the root and promoting it to other space divisions, where as the ultimate goal of the GC is to reclaim memory from unreachable objects at a minimal time possible. This paper is a proposal of a method where the lifetime of every object getting into the heap will be predicted and will be placed in heap accordingly for the garbage collector to deal more with reclaiming space from dead object and less in promoting the live ones to the higher level. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/4614cseij02-191003130808-thumbnail.jpg?width=120&height=120&fit=bounds" /> The Generational Garbage collection involves organizing the heap into different divisions of memory space in-order to filter long-lived objects from short-lived objects through moving the surviving object of each generation’s GC cycle to another memory space, updating its age and reclaiming space from the dead ones. The problem in this method is that, the longer an object is alive during its initial generations, the longer the garbage collector will have to deal with it by checking for its reachability from the root and promoting it to other space divisions, where as the ultimate goal of the GC is to reclaim memory from unreachable objects at a minimal time possible. This paper is a proposal of a method where the lifetime of every object getting into the heap will be predicted and will be placed in heap accordingly for the garbage collector to deal more with reclaiming space from dead object and less in promoting the live ones to the higher level.

A Novel Design of a Parallel Machine Learnt Generational Garbage Collector from cseij

]]> 10 0 https://cdn.slidesharecdn.com/ss_thumbnails/4614cseij02-191003130808-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 MRIIMAGE SEGMENTATION USING LEVEL SET METHOD AND IMPLEMENT AN MEDICAL DIAGNOSIS SYSTEM /cseij/mriimage-segmentation-using-level-set-method-and-implement-an-medical-diagnosis-system 1211cseij01-190919091635
Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results]]>
Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results]]> Thu, 19 Sep 2019 09:16:35 GMT /cseij/mriimage-segmentation-using-level-set-method-and-implement-an-medical-diagnosis-system cseij@slideshare.net(cseij) MRIIMAGE SEGMENTATION USING LEVEL SET METHOD AND IMPLEMENT AN MEDICAL DIAGNOSIS SYSTEM cseij Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/1211cseij01-190919091635-thumbnail.jpg?width=120&height=120&fit=bounds" /> Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results

MRIIMAGE SEGMENTATION USING LEVEL SET METHOD AND IMPLEMENT AN MEDICAL DIAGNOSIS SYSTEM from cseij

]]> 28 0 https://cdn.slidesharecdn.com/ss_thumbnails/1211cseij01-190919091635-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 VEHICLE RECOGNITION USING VIBE AND SVM /slideshow/vehicle-recognition-using-vibe-and-svm-173302835/173302835 6416cseij02-190918065336
Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard.]]>
Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard.]]> Wed, 18 Sep 2019 06:53:35 GMT /slideshow/vehicle-recognition-using-vibe-and-svm-173302835/173302835 cseij@slideshare.net(cseij) VEHICLE RECOGNITION USING VIBE AND SVM cseij Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij02-190918065336-thumbnail.jpg?width=120&height=120&fit=bounds" /> Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard.

VEHICLE RECOGNITION USING VIBE AND SVM from cseij

]]> 22 0 https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij02-190918065336-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 call for paper - Computer Science & Engineering: An International Journal (CSEIJ) /slideshow/call-for-paper-computer-science-engineering-an-international-journal-cseij-170226230/170226230 cseij-ppt-190909093330
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.]]>
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.]]> Mon, 09 Sep 2019 09:33:30 GMT /slideshow/call-for-paper-computer-science-engineering-an-international-journal-cseij-170226230/170226230 cseij@slideshare.net(cseij) call for paper - Computer Science & Engineering: An International Journal (CSEIJ) cseij Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/cseij-ppt-190909093330-thumbnail.jpg?width=120&height=120&fit=bounds" /> Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.

call for paper - Computer Science & Engineering: An International Journal (CSEIJ) from cseij

]]> 14 0 https://cdn.slidesharecdn.com/ss_thumbnails/cseij-ppt-190909093330-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 Top 1 cited papers - COMPUTER SCIENCE & ENGINEERING: AN INTERNATIONAL JOURNAL (CSEIJ) /slideshow/top-1-cited-papers-computer-science-engineering-an-international-journal-cseij/168981942 top1citedpapers-190904113226
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering. ]]>
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering. ]]> Wed, 04 Sep 2019 11:32:26 GMT /slideshow/top-1-cited-papers-computer-science-engineering-an-international-journal-cseij/168981942 cseij@slideshare.net(cseij) Top 1 cited papers - COMPUTER SCIENCE & ENGINEERING: AN INTERNATIONAL JOURNAL (CSEIJ) cseij Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/top1citedpapers-190904113226-thumbnail.jpg?width=120&height=120&fit=bounds" /> Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.

Top 1 cited papers - COMPUTER SCIENCE & ENGINEERING: AN INTERNATIONAL JOURNAL (CSEIJ) from cseij

]]> 16 0 https://cdn.slidesharecdn.com/ss_thumbnails/top1citedpapers-190904113226-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 QUERY SENSITIVE COMPARATIVE SUMMARIZATION OF SEARCH RESULTS USING CONCEPT BASED SEGMENTATION /slideshow/query-sensitive-comparative-summarization-of-search-results-using-concept-based-segmentation/167731558 1211cseij03-190830130135
Query sensitive summarization aims at providing the users with the summary of the contents of single or multiple web pages based on the search query. This paper proposes a novel idea of generating a comparative summary from a set of URLs from the search result. User selects a set of web page links from the search result produced by search engine. Comparative summary of these selected web sites is generated. This method makes use of HTML DOM tree structure of these web pages. HTML documents are segmented into set of concept blocks. Sentence score of each concept block is computed with respect to the query and feature keywords. The important sentences from the concept blocks of different web pages are extracted to compose the comparative summary on the fly. This system reduces the time and effort required for the user to browse various web sites to compare the information. The comparative summary of the contents would help the users in quick decision making. ]]>
Query sensitive summarization aims at providing the users with the summary of the contents of single or multiple web pages based on the search query. This paper proposes a novel idea of generating a comparative summary from a set of URLs from the search result. User selects a set of web page links from the search result produced by search engine. Comparative summary of these selected web sites is generated. This method makes use of HTML DOM tree structure of these web pages. HTML documents are segmented into set of concept blocks. Sentence score of each concept block is computed with respect to the query and feature keywords. The important sentences from the concept blocks of different web pages are extracted to compose the comparative summary on the fly. This system reduces the time and effort required for the user to browse various web sites to compare the information. The comparative summary of the contents would help the users in quick decision making. ]]> Fri, 30 Aug 2019 13:01:35 GMT /slideshow/query-sensitive-comparative-summarization-of-search-results-using-concept-based-segmentation/167731558 cseij@slideshare.net(cseij) QUERY SENSITIVE COMPARATIVE SUMMARIZATION OF SEARCH RESULTS USING CONCEPT BASED SEGMENTATION cseij Query sensitive summarization aims at providing the users with the summary of the contents of single or multiple web pages based on the search query. This paper proposes a novel idea of generating a comparative summary from a set of URLs from the search result. User selects a set of web page links from the search result produced by search engine. Comparative summary of these selected web sites is generated. This method makes use of HTML DOM tree structure of these web pages. HTML documents are segmented into set of concept blocks. Sentence score of each concept block is computed with respect to the query and feature keywords. The important sentences from the concept blocks of different web pages are extracted to compose the comparative summary on the fly. This system reduces the time and effort required for the user to browse various web sites to compare the information. The comparative summary of the contents would help the users in quick decision making. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/1211cseij03-190830130135-thumbnail.jpg?width=120&height=120&fit=bounds" /> Query sensitive summarization aims at providing the users with the summary of the contents of single or multiple web pages based on the search query. This paper proposes a novel idea of generating a comparative summary from a set of URLs from the search result. User selects a set of web page links from the search result produced by search engine. Comparative summary of these selected web sites is generated. This method makes use of HTML DOM tree structure of these web pages. HTML documents are segmented into set of concept blocks. Sentence score of each concept block is computed with respect to the query and feature keywords. The important sentences from the concept blocks of different web pages are extracted to compose the comparative summary on the fly. This system reduces the time and effort required for the user to browse various web sites to compare the information. The comparative summary of the contents would help the users in quick decision making.

QUERY SENSITIVE COMPARATIVE SUMMARIZATION OF SEARCH RESULTS USING CONCEPT BASED SEGMENTATION from cseij

]]> 12 1 https://cdn.slidesharecdn.com/ss_thumbnails/1211cseij03-190830130135-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 call for paper - Computer Science & Engineering: An International Journal (CSEIJ) /slideshow/call-for-paper-computer-science-engineering-an-international-journal-cseij-166473424/166473424 cseij-ppt-190826073038
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.]]>
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.]]> Mon, 26 Aug 2019 07:30:38 GMT /slideshow/call-for-paper-computer-science-engineering-an-international-journal-cseij-166473424/166473424 cseij@slideshare.net(cseij) call for paper - Computer Science & Engineering: An International Journal (CSEIJ) cseij Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/cseij-ppt-190826073038-thumbnail.jpg?width=120&height=120&fit=bounds" /> Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.

call for paper - Computer Science & Engineering: An International Journal (CSEIJ) from cseij

]]> 11 1 https://cdn.slidesharecdn.com/ss_thumbnails/cseij-ppt-190826073038-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 ROMAN URDU OPINION MINING SYSTEM (RUOMIS) /slideshow/roman-urdu-opinion-mining-system-ruomis/120666048 4614cseij03-181025081641
Convincing a customer is always considered as a challenging task in every business. But when it comes to online business, this task becomes even more difficult. Online retailers try everything possible to gain the trust of the customer. One of the solutions is to provide an area for existing users to leave their comments. This service can effectively develop the trust of the customer however normally the customer comments about the product in their native language using Roman script. If there are hundreds of comments this makes difficulty even for the native customers to make a buying decision. This research proposes a system which extracts the comments posted in Roman Urdu, translate them, find their polarity and then gives us the rating of the product. This rating will help the native and non-native customers to make buying decision efficiently from the comments posted in Roman Urdu.]]>
Convincing a customer is always considered as a challenging task in every business. But when it comes to online business, this task becomes even more difficult. Online retailers try everything possible to gain the trust of the customer. One of the solutions is to provide an area for existing users to leave their comments. This service can effectively develop the trust of the customer however normally the customer comments about the product in their native language using Roman script. If there are hundreds of comments this makes difficulty even for the native customers to make a buying decision. This research proposes a system which extracts the comments posted in Roman Urdu, translate them, find their polarity and then gives us the rating of the product. This rating will help the native and non-native customers to make buying decision efficiently from the comments posted in Roman Urdu.]]> Thu, 25 Oct 2018 08:16:41 GMT /slideshow/roman-urdu-opinion-mining-system-ruomis/120666048 cseij@slideshare.net(cseij) ROMAN URDU OPINION MINING SYSTEM (RUOMIS) cseij Convincing a customer is always considered as a challenging task in every business. But when it comes to online business, this task becomes even more difficult. Online retailers try everything possible to gain the trust of the customer. One of the solutions is to provide an area for existing users to leave their comments. This service can effectively develop the trust of the customer however normally the customer comments about the product in their native language using Roman script. If there are hundreds of comments this makes difficulty even for the native customers to make a buying decision. This research proposes a system which extracts the comments posted in Roman Urdu, translate them, find their polarity and then gives us the rating of the product. This rating will help the native and non-native customers to make buying decision efficiently from the comments posted in Roman Urdu. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/4614cseij03-181025081641-thumbnail.jpg?width=120&height=120&fit=bounds" /> Convincing a customer is always considered as a challenging task in every business. But when it comes to online business, this task becomes even more difficult. Online retailers try everything possible to gain the trust of the customer. One of the solutions is to provide an area for existing users to leave their comments. This service can effectively develop the trust of the customer however normally the customer comments about the product in their native language using Roman script. If there are hundreds of comments this makes difficulty even for the native customers to make a buying decision. This research proposes a system which extracts the comments posted in Roman Urdu, translate them, find their polarity and then gives us the rating of the product. This rating will help the native and non-native customers to make buying decision efficiently from the comments posted in Roman Urdu.

ROMAN URDU OPINION MINING SYSTEM (RUOMIS) from cseij

]]> 14 1 https://cdn.slidesharecdn.com/ss_thumbnails/4614cseij03-181025081641-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS /slideshow/comparison-intelligent-electronic-assessment-with-traditional-assessment-for-subjective-exams-119695203/119695203 8318cseij01-181017053425
In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. ]]>
In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. ]]> Wed, 17 Oct 2018 05:34:25 GMT /slideshow/comparison-intelligent-electronic-assessment-with-traditional-assessment-for-subjective-exams-119695203/119695203 cseij@slideshare.net(cseij) COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS cseij In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/8318cseij01-181017053425-thumbnail.jpg?width=120&height=120&fit=bounds" /> In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.

COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS from cseij

]]> 17 1 https://cdn.slidesharecdn.com/ss_thumbnails/8318cseij01-181017053425-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 MIGRATING IN-HOUSE DATA CENTER TO PRIVATE CLOUD: A CASE STUDY /slideshow/migrating-inhouse-data-center-to-private-cloud-a-case-study-118959214/118959214 5315cseij02-181010060610
ABSTRACT Internet traffic has become vast in terms of data processing as well as storage which has occurred somelimitations on existing traditional infrastructure. Such limitations may include servers, data storage, andcomputing resources. This has consequently led most of organization to keep investing and expanding theirinfrastructure in periodical phases. Hence, two factors are always co-related to each other which areTCO (total cost of ownership) and ROT (return on investment) which are critically increased due to theamount of general investment including all expenses as well as human powers. Therefore, a new technologyhas emerged which is called “Cloud Computing”. This terminology has been released recently to work as asupportive to traditional infrastructure which is part of Datacenters. It offers reliability, improved QoS,and efficiency to end-users. This paper presents a novel case study of cloud computing on a large scaleenvironment. Various factors such as TOC and ROI have been taken in consideration on a comparativestudy with traditional Datacenter. Results have shown considerable improvement on performance,utilization, and investment. KEYWORDS Cloud computing, ROT, TCO, QoS, CAPEX, OPEX ]]>
ABSTRACT Internet traffic has become vast in terms of data processing as well as storage which has occurred somelimitations on existing traditional infrastructure. Such limitations may include servers, data storage, andcomputing resources. This has consequently led most of organization to keep investing and expanding theirinfrastructure in periodical phases. Hence, two factors are always co-related to each other which areTCO (total cost of ownership) and ROT (return on investment) which are critically increased due to theamount of general investment including all expenses as well as human powers. Therefore, a new technologyhas emerged which is called “Cloud Computing”. This terminology has been released recently to work as asupportive to traditional infrastructure which is part of Datacenters. It offers reliability, improved QoS,and efficiency to end-users. This paper presents a novel case study of cloud computing on a large scaleenvironment. Various factors such as TOC and ROI have been taken in consideration on a comparativestudy with traditional Datacenter. Results have shown considerable improvement on performance,utilization, and investment. KEYWORDS Cloud computing, ROT, TCO, QoS, CAPEX, OPEX ]]> Wed, 10 Oct 2018 06:06:10 GMT /slideshow/migrating-inhouse-data-center-to-private-cloud-a-case-study-118959214/118959214 cseij@slideshare.net(cseij) MIGRATING IN-HOUSE DATA CENTER TO PRIVATE CLOUD: A CASE STUDY cseij ABSTRACT Internet traffic has become vast in terms of data processing as well as storage which has occurred somelimitations on existing traditional infrastructure. Such limitations may include servers, data storage, andcomputing resources. This has consequently led most of organization to keep investing and expanding theirinfrastructure in periodical phases. Hence, two factors are always co-related to each other which areTCO (total cost of ownership) and ROT (return on investment) which are critically increased due to theamount of general investment including all expenses as well as human powers. Therefore, a new technologyhas emerged which is called “Cloud Computing”. This terminology has been released recently to work as asupportive to traditional infrastructure which is part of Datacenters. It offers reliability, improved QoS,and efficiency to end-users. This paper presents a novel case study of cloud computing on a large scaleenvironment. Various factors such as TOC and ROI have been taken in consideration on a comparativestudy with traditional Datacenter. Results have shown considerable improvement on performance,utilization, and investment. KEYWORDS Cloud computing, ROT, TCO, QoS, CAPEX, OPEX <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/5315cseij02-181010060610-thumbnail.jpg?width=120&height=120&fit=bounds" /> ABSTRACT Internet traffic has become vast in terms of data processing as well as storage which has occurred somelimitations on existing traditional infrastructure. Such limitations may include servers, data storage, andcomputing resources. This has consequently led most of organization to keep investing and expanding theirinfrastructure in periodical phases. Hence, two factors are always co-related to each other which areTCO (total cost of ownership) and ROT (return on investment) which are critically increased due to theamount of general investment including all expenses as well as human powers. Therefore, a new technologyhas emerged which is called “Cloud Computing”. This terminology has been released recently to work as asupportive to traditional infrastructure which is part of Datacenters. It offers reliability, improved QoS,and efficiency to end-users. This paper presents a novel case study of cloud computing on a large scaleenvironment. Various factors such as TOC and ROI have been taken in consideration on a comparativestudy with traditional Datacenter. Results have shown considerable improvement on performance,utilization, and investment. KEYWORDS Cloud computing, ROT, TCO, QoS, CAPEX, OPEX

MIGRATING IN-HOUSE DATA CENTER TO PRIVATE CLOUD: A CASE STUDY from cseij

]]> 9 1 https://cdn.slidesharecdn.com/ss_thumbnails/5315cseij02-181010060610-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETS /slideshow/quality-of-service-stability-based-multicast-routing-protocol-for-manets-118644272/118644272 7117cseij01-181008054539
ABSTRACT : Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance. ]]>
ABSTRACT : Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance. ]]> Mon, 08 Oct 2018 05:45:39 GMT /slideshow/quality-of-service-stability-based-multicast-routing-protocol-for-manets-118644272/118644272 cseij@slideshare.net(cseij) QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETS cseij ABSTRACT : Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/7117cseij01-181008054539-thumbnail.jpg?width=120&height=120&fit=bounds" /> ABSTRACT : Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance.

QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETS from cseij

]]> 12 1 https://cdn.slidesharecdn.com/ss_thumbnails/7117cseij01-181008054539-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 VEHICLE RECOGNITION USING VIBE AND SVM /slideshow/vehicle-recognition-using-vibe-and-svm-117049263/117049263 6416cseij02-180928071236
Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard. ]]>
Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard. ]]> Fri, 28 Sep 2018 07:12:36 GMT /slideshow/vehicle-recognition-using-vibe-and-svm-117049263/117049263 cseij@slideshare.net(cseij) VEHICLE RECOGNITION USING VIBE AND SVM cseij Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij02-180928071236-thumbnail.jpg?width=120&height=120&fit=bounds" /> Video surveillance is becoming more and more important forsocial security, law enforcement, social order,military, and other social problems. In order to manage parking information effectively, this vehicle detection method is presented. In general, motion detection plays an important role in video surveillance systems. In this paper, firstly this system uses ViBe method to extract the foreground object, then extracts HOG features on the performance of the ROI of images. At last this paper presents Support vector machine for vehicle recognition. The results of this test show that, the recognition rate of vehicle’s model in this recognition system is up the industrial application standard.

VEHICLE RECOGNITION USING VIBE AND SVM from cseij

]]> 14 1 https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij02-180928071236-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 A REVIEW OF MEMORY ALLOCATION AND MANAGEMENT IN COMPUTER SYSTEMS /slideshow/a-review-of-memory-allocation-and-management-in-computer-systems/116649775 6416cseij01-180926090829
ABSTRACT : In this paper I have described the memory management and allocation techniques in computer systems. The purpose of writing this survey paper is to elaborate the concept of memory allocation and management in computer systems because of the significance of memory component in computer system’s hardware. It is apparent from the work of computer scientists that effective and efficient main memory management and virtual memory management in computer systems improves the computer system’s performance by increasing throughput and processor utilization and by decreasing the response time and turnaround time. Firstly I have compared Uniprogramming system with Multiprogramming system. After comparison I found that Multiprogramming systems are quite better than Uniprogramming systems from the point of view of memory utilization. Also the functionality of operating system routines which are responsible for user’s memory partitioning must be improved to get better system performance in Multiprogramming system .In Uniprogramming system , the processor remains idle most of the time but dividing the memory into partitions for holding multiple processes as in Multiprogramming system does not solve the problem of idleness of a processor. Mostly all of the processes need I/O access, therefore processor also remain idle in Multiprogramming system. We have also discussed resource memory in detail and compared fixed partitioning with variable partitioning. After in depth study we found that variable partitioning is more advantageous than fixed partitioning because reallocation of page frames is impossible in fixed partitioning for a set of active processes at time instant‘t’. In this paper we have also discussed MIPS R2/3000 machine virtual to real address mapping in detail so that virtual to real address mapping can be understood through a machine’s architecture and example. KEYWORDS: Queues, Long Term Queues, Short Term Queues, I/O Queues, Swapping, Processor Scheduling, Fixed Partitioning, Variable Partitioning, Page Frames, Pages, Virtual Memory, Physical Memory, Processor Utilization, Throughput, Response Time, Turnaround Time ]]>
ABSTRACT : In this paper I have described the memory management and allocation techniques in computer systems. The purpose of writing this survey paper is to elaborate the concept of memory allocation and management in computer systems because of the significance of memory component in computer system’s hardware. It is apparent from the work of computer scientists that effective and efficient main memory management and virtual memory management in computer systems improves the computer system’s performance by increasing throughput and processor utilization and by decreasing the response time and turnaround time. Firstly I have compared Uniprogramming system with Multiprogramming system. After comparison I found that Multiprogramming systems are quite better than Uniprogramming systems from the point of view of memory utilization. Also the functionality of operating system routines which are responsible for user’s memory partitioning must be improved to get better system performance in Multiprogramming system .In Uniprogramming system , the processor remains idle most of the time but dividing the memory into partitions for holding multiple processes as in Multiprogramming system does not solve the problem of idleness of a processor. Mostly all of the processes need I/O access, therefore processor also remain idle in Multiprogramming system. We have also discussed resource memory in detail and compared fixed partitioning with variable partitioning. After in depth study we found that variable partitioning is more advantageous than fixed partitioning because reallocation of page frames is impossible in fixed partitioning for a set of active processes at time instant‘t’. In this paper we have also discussed MIPS R2/3000 machine virtual to real address mapping in detail so that virtual to real address mapping can be understood through a machine’s architecture and example. KEYWORDS: Queues, Long Term Queues, Short Term Queues, I/O Queues, Swapping, Processor Scheduling, Fixed Partitioning, Variable Partitioning, Page Frames, Pages, Virtual Memory, Physical Memory, Processor Utilization, Throughput, Response Time, Turnaround Time ]]> Wed, 26 Sep 2018 09:08:29 GMT /slideshow/a-review-of-memory-allocation-and-management-in-computer-systems/116649775 cseij@slideshare.net(cseij) A REVIEW OF MEMORY ALLOCATION AND MANAGEMENT IN COMPUTER SYSTEMS cseij ABSTRACT : In this paper I have described the memory management and allocation techniques in computer systems. The purpose of writing this survey paper is to elaborate the concept of memory allocation and management in computer systems because of the significance of memory component in computer system’s hardware. It is apparent from the work of computer scientists that effective and efficient main memory management and virtual memory management in computer systems improves the computer system’s performance by increasing throughput and processor utilization and by decreasing the response time and turnaround time. Firstly I have compared Uniprogramming system with Multiprogramming system. After comparison I found that Multiprogramming systems are quite better than Uniprogramming systems from the point of view of memory utilization. Also the functionality of operating system routines which are responsible for user’s memory partitioning must be improved to get better system performance in Multiprogramming system .In Uniprogramming system , the processor remains idle most of the time but dividing the memory into partitions for holding multiple processes as in Multiprogramming system does not solve the problem of idleness of a processor. Mostly all of the processes need I/O access, therefore processor also remain idle in Multiprogramming system. We have also discussed resource memory in detail and compared fixed partitioning with variable partitioning. After in depth study we found that variable partitioning is more advantageous than fixed partitioning because reallocation of page frames is impossible in fixed partitioning for a set of active processes at time instant‘t’. In this paper we have also discussed MIPS R2/3000 machine virtual to real address mapping in detail so that virtual to real address mapping can be understood through a machine’s architecture and example. KEYWORDS: Queues, Long Term Queues, Short Term Queues, I/O Queues, Swapping, Processor Scheduling, Fixed Partitioning, Variable Partitioning, Page Frames, Pages, Virtual Memory, Physical Memory, Processor Utilization, Throughput, Response Time, Turnaround Time <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij01-180926090829-thumbnail.jpg?width=120&height=120&fit=bounds" /> ABSTRACT : In this paper I have described the memory management and allocation techniques in computer systems. The purpose of writing this survey paper is to elaborate the concept of memory allocation and management in computer systems because of the significance of memory component in computer system’s hardware. It is apparent from the work of computer scientists that effective and efficient main memory management and virtual memory management in computer systems improves the computer system’s performance by increasing throughput and processor utilization and by decreasing the response time and turnaround time. Firstly I have compared Uniprogramming system with Multiprogramming system. After comparison I found that Multiprogramming systems are quite better than Uniprogramming systems from the point of view of memory utilization. Also the functionality of operating system routines which are responsible for user’s memory partitioning must be improved to get better system performance in Multiprogramming system .In Uniprogramming system , the processor remains idle most of the time but dividing the memory into partitions for holding multiple processes as in Multiprogramming system does not solve the problem of idleness of a processor. Mostly all of the processes need I/O access, therefore processor also remain idle in Multiprogramming system. We have also discussed resource memory in detail and compared fixed partitioning with variable partitioning. After in depth study we found that variable partitioning is more advantageous than fixed partitioning because reallocation of page frames is impossible in fixed partitioning for a set of active processes at time instant‘t’. In this paper we have also discussed MIPS R2/3000 machine virtual to real address mapping in detail so that virtual to real address mapping can be understood through a machine’s architecture and example. KEYWORDS: Queues, Long Term Queues, Short Term Queues, I/O Queues, Swapping, Processor Scheduling, Fixed Partitioning, Variable Partitioning, Page Frames, Pages, Virtual Memory, Physical Memory, Processor Utilization, Throughput, Response Time, Turnaround Time

A REVIEW OF MEMORY ALLOCATION AND MANAGEMENT IN COMPUTER SYSTEMS from cseij

]]> 16 1 https://cdn.slidesharecdn.com/ss_thumbnails/6416cseij01-180926090829-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 ADAPTIVE STABILIZATION AND SYNCHRONIZATION OF HYPERCHAOTIC QI SYSTEM /slideshow/adaptive-stabilization-and-synchronization-of-hyperchaotic-qi-system/110252460 0611cseij02-180817102601
The hyperchaotic Qi system (Chen, Yang, Qi and Yuan, 2007) is one of the important models of fourdimensional hyperchaotic systems. This paper investigates the adaptive stabilization and synchronization of hyperchaotic Qi system with unknown parameters. First, adaptive control laws are designed to stabilize the hyperchaotic Qi system to its equilibrium point at the origin based on the adaptive control theory and Lyapunov stability theory. Then adaptive control laws are derived to achieve global chaos synchronization of identical hyperchaotic Qi systems with unknown parameters. Numerical simulations are shown to demonstrate the effectiveness of the proposed adaptive stabilization and synchronization schemes. ]]>
The hyperchaotic Qi system (Chen, Yang, Qi and Yuan, 2007) is one of the important models of fourdimensional hyperchaotic systems. This paper investigates the adaptive stabilization and synchronization of hyperchaotic Qi system with unknown parameters. First, adaptive control laws are designed to stabilize the hyperchaotic Qi system to its equilibrium point at the origin based on the adaptive control theory and Lyapunov stability theory. Then adaptive control laws are derived to achieve global chaos synchronization of identical hyperchaotic Qi systems with unknown parameters. Numerical simulations are shown to demonstrate the effectiveness of the proposed adaptive stabilization and synchronization schemes. ]]> Fri, 17 Aug 2018 10:26:01 GMT /slideshow/adaptive-stabilization-and-synchronization-of-hyperchaotic-qi-system/110252460 cseij@slideshare.net(cseij) ADAPTIVE STABILIZATION AND SYNCHRONIZATION OF HYPERCHAOTIC QI SYSTEM cseij The hyperchaotic Qi system (Chen, Yang, Qi and Yuan, 2007) is one of the important models of fourdimensional hyperchaotic systems. This paper investigates the adaptive stabilization and synchronization of hyperchaotic Qi system with unknown parameters. First, adaptive control laws are designed to stabilize the hyperchaotic Qi system to its equilibrium point at the origin based on the adaptive control theory and Lyapunov stability theory. Then adaptive control laws are derived to achieve global chaos synchronization of identical hyperchaotic Qi systems with unknown parameters. Numerical simulations are shown to demonstrate the effectiveness of the proposed adaptive stabilization and synchronization schemes. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/0611cseij02-180817102601-thumbnail.jpg?width=120&height=120&fit=bounds" /> The hyperchaotic Qi system (Chen, Yang, Qi and Yuan, 2007) is one of the important models of fourdimensional hyperchaotic systems. This paper investigates the adaptive stabilization and synchronization of hyperchaotic Qi system with unknown parameters. First, adaptive control laws are designed to stabilize the hyperchaotic Qi system to its equilibrium point at the origin based on the adaptive control theory and Lyapunov stability theory. Then adaptive control laws are derived to achieve global chaos synchronization of identical hyperchaotic Qi systems with unknown parameters. Numerical simulations are shown to demonstrate the effectiveness of the proposed adaptive stabilization and synchronization schemes.

ADAPTIVE STABILIZATION AND SYNCHRONIZATION OF HYPERCHAOTIC QI SYSTEM from cseij

]]> 21 2 https://cdn.slidesharecdn.com/ss_thumbnails/0611cseij02-180817102601-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS /slideshow/comparison-intelligent-electronic-assessment-with-traditional-assessment-for-subjective-exams-104481002/104481002 8318cseij01-180706053950
In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. ]]>
In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. ]]> Fri, 06 Jul 2018 05:39:50 GMT /slideshow/comparison-intelligent-electronic-assessment-with-traditional-assessment-for-subjective-exams-104481002/104481002 cseij@slideshare.net(cseij) COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS cseij In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/8318cseij01-180706053950-thumbnail.jpg?width=120&height=120&fit=bounds" /> In education, the use of electronic (E) examination systems is not a novel idea, as E-examination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.

COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS from cseij

]]> 24 2 https://cdn.slidesharecdn.com/ss_thumbnails/8318cseij01-180706053950-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

COMPARISON INTELLIGENT ELECTRONIC ASSESSMENT WITH TRADITIONAL ASSESSMENT FOR SUBJECTIVE EXAMS from cseij

]]> 25 3 https://cdn.slidesharecdn.com/ss_thumbnails/8318cseij011-180705053011-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 THE RESEARCH AND IMPLEMENTATION OF PASSENGER CAR'S TRANSPORTATION PLANNING PROBLEM /cseij/the-research-and-implementation-of-passenger-cars-transportation-planning-problem-100043549 5415cseij01-180602053142
In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values. ]]>
In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values. ]]> Sat, 02 Jun 2018 05:31:42 GMT /cseij/the-research-and-implementation-of-passenger-cars-transportation-planning-problem-100043549 cseij@slideshare.net(cseij) THE RESEARCH AND IMPLEMENTATION OF PASSENGER CAR'S TRANSPORTATION PLANNING PROBLEM cseij In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/5415cseij01-180602053142-thumbnail.jpg?width=120&height=120&fit=bounds" /> In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values.

THE RESEARCH AND IMPLEMENTATION OF PASSENGER CAR'S TRANSPORTATION PLANNING PROBLEM from cseij

]]> 16 3 https://cdn.slidesharecdn.com/ss_thumbnails/5415cseij01-180602053142-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 DISEASE PREDICTION USING MACHINE LEARNING OVER BIG DATA /slideshow/disease-prediction-using-machine-learning-over-big-data/89785826 8118cseij01-180306121215
Due to big data progress in biomedical and healthcare communities, accurate study of medical data benefits early disease recognition, patient care and community services. When the quality of medical data is incomplete the exactness of study is reduced. Moreover, different regions exhibit unique appearances of certain regional diseases, which may results in weakening the prediction of disease outbreaks. In the proposed system, it provides machine learning algorithms for effective prediction of various disease occurrences in disease-frequent societies. It experiment the altered estimate models over real-life hospital data collected. To overcome the difficulty of incomplete data, it use a latent factor model to rebuild the missing data. It experiment on a regional chronic illness of cerebral infarction. Using structured and unstructured data from hospital it use Machine Learning Decision Tree algorithm and Map Reduce algorithm. To the best of our knowledge in the area of medical big data analytics none of the existing work focused on both data types. Compared to several typical estimate algorithms, the calculation exactness of our proposed algorithm reaches 94.8% with a convergence speed which is faster than that of the CNNbased unimodal disease risk prediction (CNN-UDRP) algorithm. ]]>
Due to big data progress in biomedical and healthcare communities, accurate study of medical data benefits early disease recognition, patient care and community services. When the quality of medical data is incomplete the exactness of study is reduced. Moreover, different regions exhibit unique appearances of certain regional diseases, which may results in weakening the prediction of disease outbreaks. In the proposed system, it provides machine learning algorithms for effective prediction of various disease occurrences in disease-frequent societies. It experiment the altered estimate models over real-life hospital data collected. To overcome the difficulty of incomplete data, it use a latent factor model to rebuild the missing data. It experiment on a regional chronic illness of cerebral infarction. Using structured and unstructured data from hospital it use Machine Learning Decision Tree algorithm and Map Reduce algorithm. To the best of our knowledge in the area of medical big data analytics none of the existing work focused on both data types. Compared to several typical estimate algorithms, the calculation exactness of our proposed algorithm reaches 94.8% with a convergence speed which is faster than that of the CNNbased unimodal disease risk prediction (CNN-UDRP) algorithm. ]]> Tue, 06 Mar 2018 12:12:15 GMT /slideshow/disease-prediction-using-machine-learning-over-big-data/89785826 cseij@slideshare.net(cseij) DISEASE PREDICTION USING MACHINE LEARNING OVER BIG DATA cseij Due to big data progress in biomedical and healthcare communities, accurate study of medical data benefits early disease recognition, patient care and community services. When the quality of medical data is incomplete the exactness of study is reduced. Moreover, different regions exhibit unique appearances of certain regional diseases, which may results in weakening the prediction of disease outbreaks. In the proposed system, it provides machine learning algorithms for effective prediction of various disease occurrences in disease-frequent societies. It experiment the altered estimate models over real-life hospital data collected. To overcome the difficulty of incomplete data, it use a latent factor model to rebuild the missing data. It experiment on a regional chronic illness of cerebral infarction. Using structured and unstructured data from hospital it use Machine Learning Decision Tree algorithm and Map Reduce algorithm. To the best of our knowledge in the area of medical big data analytics none of the existing work focused on both data types. Compared to several typical estimate algorithms, the calculation exactness of our proposed algorithm reaches 94.8% with a convergence speed which is faster than that of the CNNbased unimodal disease risk prediction (CNN-UDRP) algorithm. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/8118cseij01-180306121215-thumbnail.jpg?width=120&height=120&fit=bounds" /> Due to big data progress in biomedical and healthcare communities, accurate study of medical data benefits early disease recognition, patient care and community services. When the quality of medical data is incomplete the exactness of study is reduced. Moreover, different regions exhibit unique appearances of certain regional diseases, which may results in weakening the prediction of disease outbreaks. In the proposed system, it provides machine learning algorithms for effective prediction of various disease occurrences in disease-frequent societies. It experiment the altered estimate models over real-life hospital data collected. To overcome the difficulty of incomplete data, it use a latent factor model to rebuild the missing data. It experiment on a regional chronic illness of cerebral infarction. Using structured and unstructured data from hospital it use Machine Learning Decision Tree algorithm and Map Reduce algorithm. To the best of our knowledge in the area of medical big data analytics none of the existing work focused on both data types. Compared to several typical estimate algorithms, the calculation exactness of our proposed algorithm reaches 94.8% with a convergence speed which is faster than that of the CNNbased unimodal disease risk prediction (CNN-UDRP) algorithm.

DISEASE PREDICTION USING MACHINE LEARNING OVER BIG DATA from cseij

]]> 97 1 https://cdn.slidesharecdn.com/ss_thumbnails/8118cseij01-180306121215-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 https://public.slidesharecdn.com/v2/images/profile-picture.png https://cdn.slidesharecdn.com/ss_thumbnails/4114cseij06-200129104150-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/application-of-particle-swarm-optimization-to-microwave-tapered-microstrip-lines-225834040/225834040 APPLICATION OF PARTICL... https://cdn.slidesharecdn.com/ss_thumbnails/sofewithoutdates-200121055100-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/6th-international-conference-on-software-engineering-sofe-2020/222379284 6th International Conf... https://cdn.slidesharecdn.com/ss_thumbnails/4614cseij02-191003130808-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/a-novel-design-of-a-parallel-machine-learnt-generational-garbage-collector/178773677 A Novel Design of a Pa...