{"title":"DTrace the Solaris Doors in Inter-process Communication","authors":"Weizhen Sun, J. Geng","doi":"10.1109/ISCSCT.2008.103","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.103","url":null,"abstract":"By using DTrace tools in Solaris operating system. The behavior of doors IPC which is developed by Sun Microsystems is traced. Discussing with various kinds of Solaris IPCs, this paper mainly tests the Solaris doors in IPC programming. The test results illustrates that the door IPC in OS is thread safety by using core mutual exclusive in system.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126432528","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 System Architecture of SOA-Based Network Teaching System","authors":"Zhou Xuan, Gao Ling","doi":"10.1109/ISCSCT.2008.205","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.205","url":null,"abstract":"After the analysis of the existing network teaching system limitations, this paper indicated that the existing network education system could not adapt to the changes in management mode of teaching and could not share the information and resources in a wide range. Inspired by the advantages of service oriented architecture (SOA), SOA-based network teaching system was proposed. In the mean time, a J2EE-based implementation system was also illustrated in this paper.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497389","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":"Chinese Sign Language Recognition for a Vision-Based Multi-features Classifier","authors":"Yang Quan, Peng Jinye","doi":"10.1109/ISCSCT.2008.374","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.374","url":null,"abstract":"According to the global and local features of Chinese manual alphabet images, Fourier descriptor and other multi-features is introduced for the vision-based multi-features classifier of Chinese sign language recognition. At first, extracting features of letter images is done, then classification method of SVMs for recognition is brought into use. Experimentation with 30 groups of the Chinese manual alphabet images is conducted and the results prove that these global and local visual features, such as Fourier descriptors, are simple, efficient, and effective for characterize hand gestures, and the SVMs method has excellent classification and generalization ability in solving learning problem with small training set of sample in sign language recognition. The experimentation shows that linear kernel function is suitable for sign language recognition, and the best recognition rate of 99.4872% of letter ¿F¿ image group is achieved.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130666289","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}
Liman Zhang, Haiming Wang, Jinzhao Liang, Jianzhou Wang
{"title":"Decision Support in Cancer Base on Fuzzy Adaptive PSO for Feedforward Neural Network Training","authors":"Liman Zhang, Haiming Wang, Jinzhao Liang, Jianzhou Wang","doi":"10.1109/ISCSCT.2008.73","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.73","url":null,"abstract":"In the last decade, the use of artificial neural networks (ANN) has become widely accepted in medical applications for accuracy for predictive inference, with potential to support and flexible non-linear modelling of large data sets. Feedforward neural network (FNN) is a kind of artificial neural networks, which has a better structure and been widely used. But there are still many drawbacks if we simply use feedforward neural network, such as slow training rate, easy to trap into local minimum point, and bad ability on global search. In this paper, feedforward neural network trained by fuzzy adaptive particle swarm optimization (FPSO) algorithm is proposed for breast cancer diagnosis. The results which are compared with FNN trained by PSO algorithm show much more accurate and stable, converges quickly towards the optimal position and can avoid overfitting in some extent. In the computer-aided decision systems, the accurate and stable computer algorithms are very important to help a physician in diagnosing a patient.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720846","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":"Parallelized Network Coding with SIMD Instruction Sets","authors":"Han Li, Huan-yan Qian","doi":"10.1109/ISCSCT.2008.141","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.141","url":null,"abstract":"It is a well known result that network coding may achieve better network throughput in certain multicast topologies. However, the practicality of network coding has been questioned, due to its high computational complexity. This paper represents an attempt towards a high performance implementation of network coding. We first propose to implement progressive decoding with Gauss-Jordan elimination, such that blocks can be decoded as they are received. We then employ hardware acceleration with SIMD vector instructions. We also use a careful threading design to take advantage of symmetric multiprocessor (SMP) systems and multicore processors. Our core idea of optimization is the table-based multiplication in GF(28) ,which is able to process a row multiplication of random linear codes by searching previous built product tables with vector using the SSE3 instruction PSHUFB. Our high performance implementation is encapsulated as a C++ class library. On a dual-core Intel T5500 1.66G PC, the encoding bandwidth of our implementations able to reach 42.493 MB/second with 128 blocks of 4 KB each.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128442444","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}
Mingyue Feng, Xianqing Yi, Guohui Li, Zhanshuai Du, Xiangneng Wang
{"title":"Sensor Scheduling for Target Tracking in a Wireless Sensor Network Using Modified Particle Swarm Optimization","authors":"Mingyue Feng, Xianqing Yi, Guohui Li, Zhanshuai Du, Xiangneng Wang","doi":"10.1109/ISCSCT.2008.198","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.198","url":null,"abstract":"Sensor scheduling for target tracking in a sensor network is a research hotspot for its effectiveness in improving performance of the network. If numbers of targets and sensors are very large, the scale of the problem may be too large to solve using traditional methods. A method based on modified particle swarm optimization algorithm (MPSO) is proposed to solve the problem. Firstly, extended Kalman filter (EKF) is adopted for target tracking, and based on the tracking model, a mathematical model is founded to formulate the problem. Then MPSO is designed based on operator redefinition that modifies standard PSO to suit with this problem. Finally, feasibility and efficiency of the method presented are verified through numerical experiments by comparing it with a genetic algorithm (GA) based method and a rule-based method.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132136523","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":"Description of PDE Models in Modelica","authors":"Zhihua Li, Huili Zhang, Ling Zheng","doi":"10.1109/ISCSCT.2008.347","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.347","url":null,"abstract":"Modelica is a new object-oriented language for modeling of large, complex, and heterogeneous physical systems. It is designed to allow for convenient and efficient modeling and simulation of the differential-algebraic equations (DAEs) systems. However, in many engineering fields, partial differential equations (PDEs) are applied. So it is necessary to be able to handle PDE models in Modelica. In this paper, we present how the Modelica language can be extended to support object-oriented modeling with partial differential equations. The description of PDE models in Modelica is introduced, which uses a natural way to describe the PDE models so that the extending language is easier to be understood and more convenient to be used. The prototype implementation included external translator and processor is described. An example modeled with PDE in Modelica and solved using the prototype is presented.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122343259","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}
Xinchang Zhang, Xiaodong Li, Zheng Wang, Baoping Yan
{"title":"A Delivery Tree Building Approach for Application Layer Multicast","authors":"Xinchang Zhang, Xiaodong Li, Zheng Wang, Baoping Yan","doi":"10.1109/ISCSCT.2008.175","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.175","url":null,"abstract":"Many proposed solutions employ distributed depth-first-searching (DFS) approach to implement positioning in application layer multicast. In DFS-based delivery tree building approaches, the newcomer need not know the information of other members except the root, and positioning can be easily implemented. However, the DFS approach cannot effectively position a host in some cases because it usually selects a branch of active candidate parent to continue the searching procedure. This paper proposes a closest-first-searching (CFS) positioning means, and a CFS-based tree building approach name CFTB. In CFTB, the new active candidate parent is selected among all the candidate parents in terms of the known distance information. The simulation results show that CFTB can position a newcomer accurately, and build a multicast tree with good delivery performance.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124069071","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 Multipath Forwarding Algorithm Based-On Predictive Path Loss Rate for Real-Time Application","authors":"Cai Ling, Jinkuan Wang, Cuirong Wang","doi":"10.1109/ISCSCT.2008.30","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.30","url":null,"abstract":"Delivery of real time streaming applications, such as voice over IP (VoIP), in packet switched networks is based on dividing the stream into packets and transferring each of the packets on an individual basis to the destination. To study the effect of packet dispersion on the quality of VoIP applications, we focus on the effect of the packet loss rate on the applications, and present a model in which packets of a certain session are dispersed over multiple paths based on the concept of predictive path loss rate (PPLR). The proposed PPLR strategy requires the dynamic prediction of loss levels over all available network paths. This predictive information is then used as an input to adjust the allocation proportion for next prediction period. Through simulations, we show that the proposed PPLR forwarding strategy provides significantly better performance than ECMP.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128995493","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":"Energy-Efficient Dynamic Clustering Algorithm in Wireless Sensor Networks","authors":"Ming Zhang, Chenglong Gong","doi":"10.1109/ISCSCT.2008.83","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.83","url":null,"abstract":"Wireless sensor networks (WSNs) consists of unattended sensors with limited storage, energy (battery power) and computation and communication capabilities. Since battery power is the most crucial resource for sensor nodes, the utility of energy efficient and the maximum lifetime is special important. In this paper, we present an energy-efficient dynamic clustering algorithm(EE-DCA)for wireless sensor networks, it improves energy utility by changing the activity of wireless communication model of sensor nodes, residual energy computing model and state transition of sensor nodes, while employs dynamic clustering algorithm to prolong network lifetime when the residual energy of clustering-head is lower than threshold or node moving or deading or adding ect. Simulation results show that EE-DCA performs better than LEACH and BCDCP algorithm with high-density deployment and high traffic.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115962877","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}