{"title":"Speech Detection Based on Hilbert-Huang Transform","authors":"Wu Wang, Xueyao Li, Rubo Zhang","doi":"10.1109/IMSCCS.2006.126","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.126","url":null,"abstract":"Under strong noise environments, the speech detection often performs bad, in order to make some improvements the Hilbert-Huang transform is used in the algorithm. The speech signal is decomposed into finite intrinsic mode functions, and then, with the Hilbert transform, the energy-frequency-time distribution of the original signal can be obtained. The EMD is used as a filter to remove unwanted noise, and then the feature was extracted to detect speech frames by investigating the distribution of energy depending on the time. Experiments show HHT is helpful to extract the characteristic parameters of the signals, and also is capable to improve the performance of speech detection","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131243403","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}
{"title":"An Open Distributed Real-time Environment Based on Variable Utilization Server","authors":"Pengliu Tan, Hai Jin, Minghu Zhang","doi":"10.1109/IMSCCS.2006.36","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.36","url":null,"abstract":"This paper extends the environment for open distributed real-time systems, where hard or soft real-time applications may run concurrently with non-real-time applications. We replace the top-level improved constant utilization server scheduler of the open system architecture in with variable utilization server scheduler. The proposed open real-time environment in this paper allows tasks in each application to share local and global nonpreemptive resources, which accommodates a much broader spectrum of real-time applications. Additionally, the extended environment assigns CPU bandwidth to each server in a more flexible and more adaptive way. The evaluation results show the performance of the open system is also improved considerably","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129900455","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}
{"title":"An Evaluation Model for Web Service","authors":"Tao Han, He-qing Guo, Dong Li, Ying Gao","doi":"10.1109/IMSCCS.2006.32","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.32","url":null,"abstract":"The evaluation for Web service is essential to select Web services from many candidates, but current evaluation models evaluate Web service only by common service attributes, which can not meet the requirements of end users. We propose an evaluation model for Web service, which customizes reasonable attributes in different domains as evaluation factors, and computes the weights of evaluation factors using machine learning algorithm. The model is implemented in Web service quality evaluation system (WS-QES), which can provide more accurate, reasonable results to end users","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126929190","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}
{"title":"Research on a Denoising Method Based on Wavelet Packet Shrinkage for Pulp","authors":"Peng Jiang, Qingbo Huang, Yaguang Kong, Li Chai","doi":"10.1109/IMSCCS.2006.115","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.115","url":null,"abstract":"A denoising method based on wavelet packet shrinkage for pulp thickness signals in paper-making processes was developed in this research. The principle of wavelet packet shrinkage for denoising and the selection of thresholds and threshold functions were analyzed. Comparison of denoising results was made with different thresholds and different threshold functions for pulp thickness signals. The effectiveness of the denoising method based on wavelet packet shrinkage was demonstrated by theoretical analysis and simulations","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125979999","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}
{"title":"Performance of Coherent Delay Lock Loop in the Presence of CW Interference and Additive Noise","authors":"L. Shen, Fangni Chen, Shiju Li","doi":"10.1109/IMSCCS.2006.103","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.103","url":null,"abstract":"In a coherent direct sequence spread spectrum system with a spreading sequence whose period is one bit long, the performance of a delay locked loop is analyzed in the presence of CW interference and additive noise. The impact of CW interference on DLL should be a discrete sinusoid more than Gaussian noise which is traditionally recognized. The frequency, amplitude and phase of the discrete sinusoid are proposed. The baseband model of DLL in the presence of CW is also proposed. According to the model, the steady-state tracking error of the first-order loop and the second-order loop is observed in the absence of noise. The Fokker-plank equation is utilized to analyze the steady-state tracking error probability distribution function (pdf) of the first-order loop in the presence of Gaussian noise. These expressions are then compared with computer simulations","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087259","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}
{"title":"Optimal All-to-All Personalized Communication in All-Port Tori","authors":"Gang Liu, Naijie Gu, Kaixin Ren, Yaodong Tao","doi":"10.1109/IMSCCS.2006.98","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.98","url":null,"abstract":"All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and tori. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message transmission, which has not been developed among other existing indirect algorithms. For 2D rtimesc (rlesc) all-port torus, the algorithm has time complexities of optimal transmission cost and O(c) startup cost. The algorithm for 4D torus follows a similar structure. In addition, the proposed algorithms accommodate non-power-of-two tori where the number of nodes in each dimension needs not be power-of-two or square. Finally, the algorithms are conceptually simple and symmetrical for every node so that they can be easily implemented and achieve the optimum in practice","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131866889","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}
{"title":"A Business Modeling Tools for Complex Enterprise Application Systems","authors":"Jin Li, D. Zhan, Zhongjie Wang","doi":"10.1109/IMSCCS.2006.1","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.1","url":null,"abstract":"A mode for modeling enterprise businesses is proposed based on the study of enterprise businesses and the relationships between enterprise businesses. This model focuses on the relationships between different kinds of business models and the mapping between business models and software models. Business models are organized by two levels: segment and content. Thus, multiple sub-organizations, multiple views and multiple life cycles can be supported by the proposed model. Further, basic functions of the business modeling tool are explained and demonstrated","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131765139","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}
{"title":"Performance Analysis of Workflow Model with Resource Constraints","authors":"Ping Sun, Junli Wang, Xiangmei Li, Changjun Jiang","doi":"10.1109/IMSCCS.2006.102","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.102","url":null,"abstract":"Performance analysis is one of the most important aspects in the research of workflow technology. In this paper, we put forward an approximate performance analysis method of workflow model with resource constraints, which combines queuing theory and stochastic Petri net. In the end, an example is given to illustrates our method can solve real-world problems efficiently","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121423128","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}
{"title":"A New Scheduling Algorithm for Servers","authors":"Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni","doi":"10.1109/IMSCCS.2006.17","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.17","url":null,"abstract":"Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather than being tired with system environment. An innovative fairness model is proposed named hereby to intuitively measure the fairness of a server within through a scheduling algorithm. The new scheduling algorithm is called MPQ-LP which compromises both the fairness of PS and the highest performance of SRPT. Namely, MPQ-LP can easily adjust the performance and fairness degree of the scheduling algorithm. In addition, MPQ-LP allows each job have the fixed completion time with less computational complexity compared to SRPT when assigning the jobs to the queues. Simulation tests have been conducted to support our model verification","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116390018","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}
{"title":"Research on Novel Dynamic Resource Management and Job Scheduling in Grid Computing*","authors":"Fufang Li, Deyu Qi, Limin Zhang, Xianguang Zhang, Zhili Zhang","doi":"10.1109/IMSCCS.2006.117","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.117","url":null,"abstract":"Grid computing has been a hot spot recent year. In grid computing applications, resource management and job scheduling are the most crucial problems in grid computing systems. In this paper, we try to present a novel agent-based dynamic grid resource management model considering both the resource management and job scheduling as a coalition integrity, so as to gain good robust, scalability, efficiency, and high performance. In our model, we use a carefully designed agent to obtain dynamic real time available computational ability of various nodes in the grid environment, so that new job could be assigned to the node that has the largest available computational power, and thus to improve system load ability and performance with good load balance. We construct all grid computational resources into two-layered heap sort tree (HST); this makes the system be more scalable, robust, fault-tolerant and high performance. By taking advantages of agents in constructing and reconstructing the two-layered HST, this model is well fitted with the unpredictable changing grid environment","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151407","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}