The guidelines for Requirements Management have been documented many times formally but the actual problems faced by the software industry are quite different. Through research it is found that most of the software projects fail before they are completed or if they do reach completion their quality is not up to the mark. The aim of this Research study is to identify the loopholes in the requirements gathering practices and how they are affecting the entire SDLC including and final product. I have also tried to find solutions to these issues on basis of international research. The goal is towards making the requirements gathering practices effective by replacing these issues with respective solutions.
{"title":"Critical Requirements Engineering Issues and their Solution","authors":"Humaira Naz, M. N. Khokhar","doi":"10.1109/ICCMS.2009.50","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.50","url":null,"abstract":"The guidelines for Requirements Management have been documented many times formally but the actual problems faced by the software industry are quite different. Through research it is found that most of the software projects fail before they are completed or if they do reach completion their quality is not up to the mark. The aim of this Research study is to identify the loopholes in the requirements gathering practices and how they are affecting the entire SDLC including and final product. I have also tried to find solutions to these issues on basis of international research. The goal is towards making the requirements gathering practices effective by replacing these issues with respective solutions.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121229107","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 order to reduce the dimensionality of feature vector space and reduce the computing complexity of categorization, each document of the train set is summarized automatically and two approaches to text categorization based on these summaries are proposed: in the first approach, the text summarization is directly used for feature selection and categorization instead of the original text; in the second approach, each summary is used to select and weight features for each document, and free texts are classified using KNN algorithm. Experimental results show that the two proposed methods using automatic summarization can not only reduce the time of classifier training, but also improve the performance of text categorization.
{"title":"Improving the Performance of Text Categorization Using Automatic Summarization","authors":"Xiao-yu Jiang, Xiao-zhong Fan, Zhi-Fei Wang, Ke-liang Jia","doi":"10.1109/ICCMS.2009.29","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.29","url":null,"abstract":"In order to reduce the dimensionality of feature vector space and reduce the computing complexity of categorization, each document of the train set is summarized automatically and two approaches to text categorization based on these summaries are proposed: in the first approach, the text summarization is directly used for feature selection and categorization instead of the original text; in the second approach, each summary is used to select and weight features for each document, and free texts are classified using KNN algorithm. Experimental results show that the two proposed methods using automatic summarization can not only reduce the time of classifier training, but also improve the performance of text categorization.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016677","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 study develops an image-processing filter to enhance the visual defects such as particles, stains, and uneven intensity on polarizers in TFT-LCD industry. Each pixel in the subimage of a polarizer is initially processed to calculate its standard deviation (SD) of gray level, which is sampled by its neighbors within a window. The gray level of each pixel is re-scaled by the maximal and minimal SD values on entire subimage to determine its new gray level. Real polarizers with visual defects are tested in this study. Experimental results show that the proposed filter achieves better performance than conventional image enhancement filters do. Moreover, the proposed image enhancement scheme provides more information for potential defect detection and classification alternatives. The proposed filter is simple, straightforward, and requiring no high-resolution image. Therefore, it is practically suitable for large-polarizer manufacturers to increase inspection speed.
{"title":"An Image Enhancement Technique in Inspecting Visual Defects of Polarizers in TFT-LCD Industry","authors":"C. Yeh, Ful-Chiang Wu","doi":"10.1109/ICCMS.2009.73","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.73","url":null,"abstract":"This study develops an image-processing filter to enhance the visual defects such as particles, stains, and uneven intensity on polarizers in TFT-LCD industry. Each pixel in the subimage of a polarizer is initially processed to calculate its standard deviation (SD) of gray level, which is sampled by its neighbors within a window. The gray level of each pixel is re-scaled by the maximal and minimal SD values on entire subimage to determine its new gray level. Real polarizers with visual defects are tested in this study. Experimental results show that the proposed filter achieves better performance than conventional image enhancement filters do. Moreover, the proposed image enhancement scheme provides more information for potential defect detection and classification alternatives. The proposed filter is simple, straightforward, and requiring no high-resolution image. Therefore, it is practically suitable for large-polarizer manufacturers to increase inspection speed.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"367 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124603593","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}
A piston production line is built in virtual simulation environment based the existing processes and layout. Its simulation result is shown with figure and graphic. Based on those results, some reconfiguring advices are supplied and also simulated on virtual environment. After reconfiguring the piston production line, many results are obtained by simulation, and it is shown that: the work-piece in processing (WIP) is reduced obviously, and its machines, labors and processes are decreased evidently
{"title":"Research on Processes Simulation and Reconfiguration for Piston Production Lines","authors":"Jun Zhou, Shu-chun Zhao, Puhong Li, Hao Zhou, Qingyuan Zhang, Zihe Shang","doi":"10.1109/ICCMS.2009.13","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.13","url":null,"abstract":"A piston production line is built in virtual simulation environment based the existing processes and layout. Its simulation result is shown with figure and graphic. Based on those results, some reconfiguring advices are supplied and also simulated on virtual environment. After reconfiguring the piston production line, many results are obtained by simulation, and it is shown that: the work-piece in processing (WIP) is reduced obviously, and its machines, labors and processes are decreased evidently","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124688356","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}
Xie Zhiqiang, Guo Yukun, Hu Huoyan, Yang Jing, Tang Guangyu
Aiming at the problem that the utilization factor is affected by the processing sequence of products while many complex products are processed, a new Job Shop scheduling method is put forward by taking into account to reduce the blank on the machine as much as possible, and to improve the utilization factor. This method confirms the processing sequence of products by calculating the cumulative length of idle time on the machine. The method arranges product with shorter idle time firstly by comparing the cumulative length of idle time which is produced after products are processed. The objective is to short the whole scheduling idle time. The experiment shows that the method proposed can improve the utilization factor and short the total processing time probably.
{"title":"Notice of RetractionAn Algorithm of Confirming the Processing Sequence of Complex Multi-product","authors":"Xie Zhiqiang, Guo Yukun, Hu Huoyan, Yang Jing, Tang Guangyu","doi":"10.1109/ICCMS.2009.25","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.25","url":null,"abstract":"Aiming at the problem that the utilization factor is affected by the processing sequence of products while many complex products are processed, a new Job Shop scheduling method is put forward by taking into account to reduce the blank on the machine as much as possible, and to improve the utilization factor. This method confirms the processing sequence of products by calculating the cumulative length of idle time on the machine. The method arranges product with shorter idle time firstly by comparing the cumulative length of idle time which is produced after products are processed. The objective is to short the whole scheduling idle time. The experiment shows that the method proposed can improve the utilization factor and short the total processing time probably.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123859640","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}
Various network applications have different quality of service requirements. The capability to provide flow based QoS support has become very important for the design of modern switches and routers. GPS is an idealized fluid model that can provide flow based performance guarantees, various packet approximation algorithms of GPS were proposed in literatures. These packet fair queueing algorithms can provide the desired performance, and they are often regarded as reference for research on routers and switches. In this paper, we model and simulate OQ switches using various fair queueing algorithms in OPNET, and evaluate their delay and fairness performance in single switch node and multiple switch node case.
{"title":"Simulation and Analysis of Weighted Fair Queuing Algorithms in OPNET","authors":"Zirong Guo, Huaxin Zeng","doi":"10.1109/ICCMS.2009.51","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.51","url":null,"abstract":"Various network applications have different quality of service requirements. The capability to provide flow based QoS support has become very important for the design of modern switches and routers. GPS is an idealized fluid model that can provide flow based performance guarantees, various packet approximation algorithms of GPS were proposed in literatures. These packet fair queueing algorithms can provide the desired performance, and they are often regarded as reference for research on routers and switches. In this paper, we model and simulate OQ switches using various fair queueing algorithms in OPNET, and evaluate their delay and fairness performance in single switch node and multiple switch node case.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124452529","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 presents the modeling, simulation and hardware implementation of voltage/frequency control of induction motor which is the most widely used in industrial applications. In this paper, the voltage/frequency (V/Hz) control principle is used to the speed controller for 3-phase AC Induction motor. The DSP (TMS320F2812) controller is used to read the stator flux of motor (The AC machine stator flux is equal to the stator voltage). Then, PI controller gives the fitable PWM generation to the motor. The method have been implemented and tested both in simulation and real time conditions. Through compare the simulation and real-time works, it shows that this system make a good performance on the motor control. At the same time, this method does not need to look into induction motor's parameters only one sensor for the stator's flux is used which makes it inexpensive to implement in real time.
{"title":"Modeling, Simulation and Hardware Implementation of an Effective Induction Motor Controller","authors":"J. Zhao, J. Liu","doi":"10.1109/ICCMS.2009.68","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.68","url":null,"abstract":"This paper presents the modeling, simulation and hardware implementation of voltage/frequency control of induction motor which is the most widely used in industrial applications. In this paper, the voltage/frequency (V/Hz) control principle is used to the speed controller for 3-phase AC Induction motor. The DSP (TMS320F2812) controller is used to read the stator flux of motor (The AC machine stator flux is equal to the stator voltage). Then, PI controller gives the fitable PWM generation to the motor. The method have been implemented and tested both in simulation and real time conditions. Through compare the simulation and real-time works, it shows that this system make a good performance on the motor control. At the same time, this method does not need to look into induction motor's parameters only one sensor for the stator's flux is used which makes it inexpensive to implement in real time.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127679733","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}
For the mesh warping and simulation automatically cease in multi-stage drawing numerical simulation of ultra-thin sheet, the reasons are analyzed and solutions are presented. Through pen shell multi-stage drawing it can be seen that adaptive meshing and correct control mass factor is the key to resolve the problems.
{"title":"Study on Key Problems in Multi-stage Deep Drawing Numerical Simulation of Ultra-thin Sheet","authors":"F. Ruan, Langui Xu, Bo Wang","doi":"10.1109/ICCMS.2009.71","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.71","url":null,"abstract":"For the mesh warping and simulation automatically cease in multi-stage drawing numerical simulation of ultra-thin sheet, the reasons are analyzed and solutions are presented. Through pen shell multi-stage drawing it can be seen that adaptive meshing and correct control mass factor is the key to resolve the problems.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133406401","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}
Rate control (RC) is crucial for video codec to control bit-stream such that the coding efficiency is maximized without violating the constraints imposed by the bandwidth, buffer size and the constant end-to-end delay. To solve MAD dilemma caused by data-dependency between RC and rate-distortion optimization (RDO), a Macroblock (MB) level rate control algorithm with context-adaptive mean absolute difference (MAD) prediction model is proposed in this paper. 2D sliding window combined with temporal ordering is used for model update, and the reference MAD is computed by considering spatial information relativity. Simulations based on JM software show that the proposed model achieves higher peak-signal-noise-ratio (PSNR) and more accurate rate match than the original JVT-G012 algorithm. A gain up to 0.63dB is observed on luminance PSNR, and 0.58dB on PSNR includes both luminance and chrominance components. Average gains are 0.35dB and 0.29dB, respectively. Meanwhile, the average rate mismatch is reduced by 88%.
{"title":"A Macroblock-Level Rate Control Algorithm for H.264/AVC Video Coding with Context-Adaptive MAD Prediction Model","authors":"Shuijiong Wu, Yiqing Huang, T. Ikenaga","doi":"10.1109/ICCMS.2009.21","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.21","url":null,"abstract":"Rate control (RC) is crucial for video codec to control bit-stream such that the coding efficiency is maximized without violating the constraints imposed by the bandwidth, buffer size and the constant end-to-end delay. To solve MAD dilemma caused by data-dependency between RC and rate-distortion optimization (RDO), a Macroblock (MB) level rate control algorithm with context-adaptive mean absolute difference (MAD) prediction model is proposed in this paper. 2D sliding window combined with temporal ordering is used for model update, and the reference MAD is computed by considering spatial information relativity. Simulations based on JM software show that the proposed model achieves higher peak-signal-noise-ratio (PSNR) and more accurate rate match than the original JVT-G012 algorithm. A gain up to 0.63dB is observed on luminance PSNR, and 0.58dB on PSNR includes both luminance and chrominance components. Average gains are 0.35dB and 0.29dB, respectively. Meanwhile, the average rate mismatch is reduced by 88%.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131878795","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}
Junfeng Yu, Zhitang Li, Jun Hu, Feng Liu, Lingyun Zhou
Future network intruders are constantly changing, improving and extending the capabilities of their botnets. Peer to peer bots are now under widespread development and are quickly evolving into a much tougher species to kill. However, partly due to the lack of understanding of the structural potential of command and control mechanism a botnets can have, countering peer to peer botnets has been ineffective. In this paper, we explore the characteristic of communication networks created by peer to peer botnets. We propose a simulation approach to characterize the structural properties and robustness of P2P botnets, corresponding to different paradigms of forming botnets. Through calculation and simulation for topology construction procedures, we show that extremely resilient peer to peer botnets can be formed to deliver attack code quickly. Such a theory would help predict botnets containment for a given topology and help develop strategies to improve defense against P2P botnets, because applying those strategies can always translate into some network topology transformation.
{"title":"Using Simulation to Characterize Topology of Peer to Peer Botnets","authors":"Junfeng Yu, Zhitang Li, Jun Hu, Feng Liu, Lingyun Zhou","doi":"10.1109/ICCMS.2009.61","DOIUrl":"https://doi.org/10.1109/ICCMS.2009.61","url":null,"abstract":"Future network intruders are constantly changing, improving and extending the capabilities of their botnets. Peer to peer bots are now under widespread development and are quickly evolving into a much tougher species to kill. However, partly due to the lack of understanding of the structural potential of command and control mechanism a botnets can have, countering peer to peer botnets has been ineffective. In this paper, we explore the characteristic of communication networks created by peer to peer botnets. We propose a simulation approach to characterize the structural properties and robustness of P2P botnets, corresponding to different paradigms of forming botnets. Through calculation and simulation for topology construction procedures, we show that extremely resilient peer to peer botnets can be formed to deliver attack code quickly. Such a theory would help predict botnets containment for a given topology and help develop strategies to improve defense against P2P botnets, because applying those strategies can always translate into some network topology transformation.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124247194","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
扫码关注我们
求助内容：
应助结果提醒方式：