2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)最新文献

{"title":"Research on determining TFOMS of complex system","authors":"Z. Yansheng, Huang Kaoli","doi":"10.1109/ICACTE.2010.5579249","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579249","url":null,"abstract":"It is difficult to determine testability figures of merit (TFOMs) of complex system at the early development stage because they are affected by system function, performance, reliability, maintainability, life cycle costing, environment, and so on. We indexed a lot of literatures relevant to this research, and found only two models which can be used to determine the TFOMs. But every one has some shortcomings. The first one is based on fault coverage rate and can give a number value too perfect to unpractical; the second is based on Markov model and can only give a much rough value. So it is our object to build other models which would offset these disadvantages. We try to build three models, and the first calculates TFOMs by availability, reliability and maintainability; the second depends on experience of similar system; the last one synthesizes the other four models from indexed literatures and ours, and presents a more reasonable value by analytical hierarchy process (AHP).","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123076368","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 differentiated QoS supporting scheduling algorithm based on identifier","authors":"Liao Xiuqin, Yang Xi-liang, Lan Julong","doi":"10.1109/ICACTE.2010.5579135","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579135","url":null,"abstract":"All of the traditional switch can not distinguish the different traffic classes accurately, in order to provide a better QoS for various traffics existing already and potential unknown future traffic, we considers the problem from the all new angle and propose a novel CICQ scheduling mechanism for differentiated QoS based on identifier. The mechanism management the network data flow in denomination of traffic classes, which ensured the switch provide effective support for different traffic classes of high-layer. Meanwhile, theoretical analysis shows that the system has good dynamic and fair characteristic and can implement simply.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125216452","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":"Side information generation of multi-view distributed video coding based on feedback channel and fusion","authors":"Jifeng Sun, Wanzhang Huang","doi":"10.1109/ICACTE.2010.5579315","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579315","url":null,"abstract":"Recently, distributed video coding (DVC) has attracted much more attention with advances in low-complexity encoder and flexible architecture, which could be effectively applied in mobile video communication and video surveillance network. But the gap with the conventional video codecs is still large. One of the key factors is the quality of side information as it directly affects the system's rate distortion performance. In this paper, existing algorithms of side information generation in multi-view DVC system are compared, and a new scheme based on feedback channel and fusion will be proposed. Experimental results represent that the proposed scheme can provide better rate distortion performance with the existing ones.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117050708","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":"Rapid convergence for nonlinear fourth-order quasilinear elliptic equations","authors":"Zhzo Xue","doi":"10.1109/ICACTE.2010.5579651","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579651","url":null,"abstract":"Combining with variational method and lower and upper solutions, we get a quasilinearization method which construct an iterative scheme converging to a solution of a nonlinear fourth-order problem involving the p -Laplacian. At the same time, the result of K -th order convergence for the nonlinear fourth-order problem is obtained via the idea of Taylors approximation.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117062746","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":"Special software's development of spiral chute for design and expression based on the redevelopment of solidworks","authors":"Yann-Yih Song, Xiao-hong Jiang, Jian-xun Zhang, Li He, Kai Lv","doi":"10.1109/ICACTE.2010.5579004","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579004","url":null,"abstract":"The spiral chute installed coal storehouse is an advanced equipment that can keep lump coal from being stricken into pieces. The aim can be achieved that to increases effectively the lump coal rate by to limit the coal flow to move spirally through the chute instead of free-fall motion. The purposes of the entire design are the speed of impact point is as low as possible while it runs smoothly in the whole process and ensuring that no half-way down coal until the coal supply ends. In addition no coal accumulates in the chute if there is no more coal to transport. Because the bottom of the whole chute is an undevelopable surface, and all of the parameters including width, spiral angle and tilt angle are continuously variable for the purpose of controlling speed and direction in one segment. It is so complicated that it is almost impossible to get all of the reasonable parameters in every point, or to get its view or to draw the developing drawing by traditional drawing method. For this reason, we developed a special software commissioned by HanDan Design Engineering China Do., LTD. The software can give these important parameters of parts, such as the width, spiral angle, tilt angle, acceleration, speed, and the variation of each parameter and so on according to coal situation (different coals, different humidity, different grain size), and coal storage conditions (diameter, height). In this article, we first study the movement rules of coal in chute, create a mechanical model and introduce of coal flow in the chute in the run-time kinematic equation. Secondly according to the requirement to make sure the coal flow moves through the chute at a constant speed we calculate the parameters of the standard segment; thirdly we could have the parameters of the non-standard segment based on the speed and the state of the coal. So a series of the boundary equations for not only the standard and non-standard but also the interior and exterior panels of the spiral chute are derived. Finally 3D solid models, views and developing drawings based on redevelopment of Solidworks are come into being. All above are not only automatic, precise and parameterized, moreover, involves more technological information. So it has an important significance on its design, expression and processing.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221885","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":"FPGA processing technology on impact signal","authors":"Xiao-feng Li, Ming-jie Liu, Long Chen, Shi-hu Wang","doi":"10.1109/ICACTE.2010.5579207","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579207","url":null,"abstract":"The paper chooses the penetration impact signal as the research object. The matched filtering algorithm has been used to process the impact signal according to its frequency. On the analysis of the correlation algorithm and radix-4 FFT algorithm, the paper puts forward an implementation algorithm on FPGA of the fixed geometric structure addressing. By using fixed geometry addressing, pipeline design and block floating point structure, the data has the greater precision and dynamic range. The results show that the design is efficient, strong extensive and occupies less resource. It is an effective method to meet the high-speed digital signal processing requirements.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117257407","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 height-measuring algorithm applied to TERCOM radar altimeter","authors":"Zhang Hua, Hu Xiulin","doi":"10.1109/ICACTE.2010.5579215","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579215","url":null,"abstract":"Radar altimeter is applied to measure the height of an aircraft above the ground in terrain contour matching system(TERCOM). The total performance of the TERCOM is almost determined by the height-measuring algorithms embeded in the radar altimter. When facing a complex terrain area with a large degree of fluctuation, the traditional radar altimetry height-measuring algorithm performance will be greatly affected,for the reason that wide-beam pulse radar altimeter illuminates widely. In order to solve the problem, this paper proposes a new algorithm named average-height algorithm,and the detailed derivation is carried out. Simulation and flying test has shown that it has good performance and can be applied to any kind of terrain.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"11 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120863488","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":"Analysis of Myanmar Word boundary and segmentation by using Statistical Approach","authors":"A. M. Mon, M. Thein, S. S. Htay, Soe Lai Phyue, Thinn Thinn Win","doi":"10.1109/ICACTE.2010.5579805","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579805","url":null,"abstract":"This paper proposed a unified approach for Myanmar Word analysis using Finite State Automata (FSA), Rule Based Heuristic Approach and Statistical Approach. Myanmar has no inter-word space and it make the tokenizing task difficulties. Therefore, to recognize the word, we implement with FSA. Segmentation is a major problem because of no delimiter. If there were errors in segmentation, this will cause subsequence failure in further NLP processes. Segmentation is also an essential preprocessing task for Natural Language Processing, such as Machine Translation, Information Retrieval etc. In this system, the Rule Based Heuristic Approach and Statistical Approach are used with corpus based dictionary. Evaluation results showed that the method is very effective for the Myanmar language.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121089190","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":"Researches on inhibition mechanism in P2P networks","authors":"Dongwei Guo, Kangping Wang, Miao Liu, Tingting Shi, Jialun Du","doi":"10.1109/ICACTE.2010.5579519","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579519","url":null,"abstract":"A peer-to-peer (P2P) system will starve from resource if every user acts as a free rider who only takes resources from the system but never contributes. While developing a scheme, it is also important to inhibit free riders besides incentivizing users to contribute resources. In this paper, we adopt game theory to explore behaviors of nodes in P2P networks and present a Tit-for-Tat based mechanism. The reputation of one node is scored dispersedly and stored locally by its counterparts, according to its past reactions to their requests. Experimental results have prove that free riders are inhibited effectively since it takes more time for them to download resources than altruistic nodes.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127487703","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 efficient algorithm: CacheTwig for XML twig queries","authors":"Xin Peng, Yangyang Luo, Zhihui Huang","doi":"10.1109/ICACTE.2010.5579434","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579434","url":null,"abstract":"As the use of XML getting extensive, there is a popular research topic about how to find ours interested information in the XML database under a certain twig pattern. BrunoN proposed the concept of holistic twig in 2002 and brought up the algorithm of TwigStack. When processing the search which only contains ancestor-descendant relationships, this algorithm is the most superior. However, when the search contains parent-child relationships, there will come out with massive intermediate results. Trying to work out this problem, we will propose a improved twig pattern matching—cacheTwig, which is based on output detention theory. The experimental result indicates that our algorithm is not only the most superior for the queries that contains the ancestor-descendant relationships below branching nodes, and when comparing with the present algorithm, it is also highly effective when processing parent-child relationships below branching nodes.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734120","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}