{"title":"An Innovative Analyser for Email Classification Based on Grey List Analysis","authors":"R. Islam, Wanlei Zhou","doi":"10.1109/NPC.2007.152","DOIUrl":"https://doi.org/10.1109/NPC.2007.152","url":null,"abstract":"In this paper we propose a new technique of email classification based on grey list (GL) analysis of user emails. This technique is based on the analysis of output emails of an integrated model which uses multiple classifiers of statistical learning algorithms. The GL is a list of classifier/(s) output which is/are not considered as true positive (TP) and true negative (TN) but in the middle of them. Many works have been done to filter spam from legitimate emails using classification algorithm and substantial performance has been achieved with some amount of false positive (FP) tradeoffs. In the case of spam detection the FP problem is unacceptable, sometimes. The proposed technique will provide a list of output emails, called \"grey list (GL)\", to the analyser for making decisions about the status of these emails. It has been shown that the performance of our proposed technique for email classification is much better compare to existing systems, in order to reducing FP problems and accuracy.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"775 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134416150","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 Co-training Approach based TEF-WA technique","authors":"Tang Huanling, Lu Mingyu, Liu Na","doi":"10.1109/NPC.2007.104","DOIUrl":"https://doi.org/10.1109/NPC.2007.104","url":null,"abstract":"Traditional categorization algorithm suffers from not having sufficient labeled training data for learning, while large amount unlabeled data are easily available. We investigate co-training algorithm and its assumption that the features set can be split into two compatible and independent views. However, the assumption is usually violated to some degree in practice and sometimes the natural feature split does not exist. So we adopt TEF_WA technique which utilizes term evaluation functions to split features set and construct multiple views. We can choose a pair of views which are compatible and independent to certain degree. Based TEF_WA technique we develop a semi-supervised categorization algorithm Co_CLM. Experimental results show Co_CLM can significantly decrease the classification error utilizing unlabeled data especially labeled data is sparse. Our experimental results also indicate Co_CLM will achieve more satisfactory performance with the more independent view pairs.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133912350","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":"The Info-plosion Project","authors":"M. Kitsuregawa","doi":"10.1109/NPC.2007.181","DOIUrl":"https://doi.org/10.1109/NPC.2007.181","url":null,"abstract":"How much information project in California University examined the volume of information that have been produced so far, and revealed that actually very large volume of information has been produced, even if sensor information is not included in the target of this research. So, if such information is included, the amount becomes much larger. Therefore, we considered that it is a big challenge in information science to make value from such massive volume of data. Recently, it is said that knowledge worker waste more than 30 percent of their work time to search something. It is necessary to make information retrieval more efficient. This paper introduces info-plosion project, which tackles this challenge. In this paper we introduce four core subprojects.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130712651","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":"Ontology-Based Query System Design and Implementation","authors":"Guan-yu Li, Sultanova Yu., Shaozhi Dai","doi":"10.1109/NPC.2007.41","DOIUrl":"https://doi.org/10.1109/NPC.2007.41","url":null,"abstract":"In order to overcome the shortcomings arisen from the expression-only matching, the ontology-based semantic interpretation of concepts should be introduced into the retrieval process. Based on the study of ontology-based information retrieval, a query system oriented to EBM (Evidence-Based Medicine) data is designed and implemented. Meanwhile, OWL, RDF/RDFS and Jena are respectively employed as description language, semantic annotation language, and reasoning tool. Firstly, a medical ontology is established in this system. Secondly, the metadata is described and the semantic annotation for primitive data is achieved. Based on the above, the more ample semantic information is produced, the primitive data is more easily understood by computers and users. Finally, the goal prototype system and the semantic query using the semantic annotation are successfully implemented and verified. The experimental result reveals that not only the semantic pertinence of query results is improved, but also the query efficiency is promoted.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130855212","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 and realization of personalized search engine based on Ontology","authors":"Liao Yong, Li Guan-yu","doi":"10.1109/NPC.2007.159","DOIUrl":"https://doi.org/10.1109/NPC.2007.159","url":null,"abstract":"Lack of personalization, poor recall and precision ratios, and lower efficiency of search are main problems of the current search engines, while the application of personalized search engine is an efficient approach. This paper gives the design and implementation of a personalized search engine, including the establishment and application of the shared knowledge base, the collection and mining of the users' interest, the construction and use of the users' interest base, and the combination of semantic query and personalized one. The core of the shared knowledge base and personalized query is ontology technology, and the effective use of which can obviously advance the recall and precision ratios. Moreover, the application of the users' interest base can improve the quality and efficiency of customer service.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131219650","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 Context Quality Model for Ubiquitous Applications","authors":"Siliang Tang, Jianhua Yang, Zhaohui Wu","doi":"10.1109/NPC.2007.167","DOIUrl":"https://doi.org/10.1109/NPC.2007.167","url":null,"abstract":"Quality of Context (QoC) is critical in context reasoning, context refining, security policy configuring, etc. Many researches have been presented to model context and its quality by quantifying QoC-parameters. However, these quality models emphasis on the information-inherent QoC, while the influence of context-aware applications and environment situation on QoC is not well considered. In this paper, we will propose a novel context quality model based on OWL-DL, which is related with situation and can be specified by context-aware applications. Moreover, a context processing infrastructure is introduced, since QoC model is relevant to context processing. Furthermore, a context information service prototype is implemented to support application and situation related QoC rectification. Finally, we demonstrate the efficacy of this approach through a storeroom scenario and a case study of context file system application with the help of a Pioneer III -AT mobile robot and a FUSE-based Context file system.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128846690","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":"Further Cryptanalysis of a CRT-RSA Algorithm at CCS 2003","authors":"Ming Li, Baodong Qin, Fanyu Kong, Daxing Li","doi":"10.1109/NPC.2007.97","DOIUrl":"https://doi.org/10.1109/NPC.2007.97","url":null,"abstract":"At CCS 2003, Blomer, Otto, and Seifert proposed a new CRT-RSA signature algorithm, which was claimed to be secure against hardware fault attack. Unfortunately, one year later, Wagner presented a simple and practical fault attack on the so-called BOS algorithm. In this paper, we give a further cryptanalysis of the BOS algorithm and can completely break the security of it with a probability at least 25%. Compared to Wagner's attack, the new attack is much simpler and requires fewer faulty signatures. We further conclude that the BOS algorithm is not safe for use in its present form.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128899448","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":"Parallel Cache Model Based on Grid Memory","authors":"Qingkui Chen, Lichun Na","doi":"10.1109/NPC.2007.76","DOIUrl":"https://doi.org/10.1109/NPC.2007.76","url":null,"abstract":"For supporting the concurrent access for the hot segments of large files during the peak access phase in Internet, a parallel cache model based on the grid memory (PCMGM) was proposed in this paper. By using of the free memories of the idle computers in dynamic network environment (DNE) composed of multi-clusters, the grid memory was constructed. Through the division technique for large files, basing the ability of idle computer, and adopting the multiagent, we discussed the load balance allotting approach for grid memory. The PCMGM access process is described. The experiment results show that PCMGM resolves effectively the problems of peak access for hot segments and it can improve the use rate of resources in DNE. It can be applied for grid computing and VOD for hot segment.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115733175","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":"Collision Avoidance Multiple Access in Wireless Sensor Networks","authors":"Jianwei Wang, Yuping Zhao, Dong Wang, T. Korhonen","doi":"10.1109/NPC.2007.60","DOIUrl":"https://doi.org/10.1109/NPC.2007.60","url":null,"abstract":"Collision avoidance multiple access plays an important role in wireless sensor networks, especially for those composed of nodes having a simple access protocol functionality. Numerous protocols have been proposed for wireless sensor networks during the past decades. However, the majority of these proposals require too much actions to be taken by sensor nodes, which makes the sensor nodes too complex. In this paper, we focus on the sensor networks composed of simple function nodes and presented novel collision avoidance multiple access algorithms. Both suggested algorithms are based on two functional stages: the channel allocation stage and the actual data transmission by using TDMA and/or CDMA. Simulation results indicate that our algorithms significantly improve communication efficiency via collision avoidance scheme, comparing to existing proposals. In reference to this improvement, we also address user-fairness of our algorithms.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115766810","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":"Modeling and Performance Analysis of LFSN","authors":"Xianhai Tan, Ying Hu, Wei-dong Jin","doi":"10.1109/NPC.2007.75","DOIUrl":"https://doi.org/10.1109/NPC.2007.75","url":null,"abstract":"There is much experimental evidence that network traffic processes exhibit ubiquitous properties of self- similarity and long-range dependence (LRD). Modeling and performance evaluation of self-similar traffic is a research hotspot of computer network . The most commonly used model of self-similar traffic is fractional Brownian motion (FBM) process, which can only capture the self-similar and long-range dependent characteristics of the traffic. Recent experimental studies have shown that several traffic classes of real traffic exhibit higher variability than that captured by FBM model. In this paper, a fractional stable motion self-similar model, linear fractional stable noise (LFSN), which can capture both long-range dependent and bursty (heavy-tail) characteristics of the traffic, is studied. Based on the buffer size overflow given by the predecessors, the formulae of average queue length, queue length variance, average delay, jitter and effective bandwidth are derived. The variation of packet loss rate, average delay and effective bandwidth with the parameters of Hurst parameter, characteristic exponent and buffer size is investigated through simulation.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124260143","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}