{"title":"Design and Experiments of Multiple Service Transport with Multi-Agent Negotiations","authors":"Bin Li, Yunxiao Zu, Shanguo Huang, W. Gu","doi":"10.1109/RIVF.2009.5174634","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174634","url":null,"abstract":"As most of the carriers have extended their circuit transport networks with packet transport capabilities due to the inefficient transport network architecture, the controlling manner developed silently. Multiple service transport platform is the newly proposed packet based transport technology and the standardization process is very fast. GMPLS is considered to be the future controlling technologies. In this paper, we proposed a QoS based architecture to implement the service level agreement (SLA), in which extended signaling mechanism can be utilized to support a multi-rank service. Whether a virtual connection request can be accepted or should be rejected is determined as the request come to the entry of a network router. Operation, administration, survivability, control and management of this emerging hybrid circuit/packet transport network are the same as of the original circuit transport network. User may generate different priority traffic flows based of their QoS requirement. Connection controller can selectively capture resource already subscribed by the service with low priority if necessary. The service of the highest priority never experiences severe distortion.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131561737","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":"Leader Ant Clustering with Constraints","authors":"V. Vu, Nicolas Labroche, B. Bouchon-Meunier","doi":"10.1109/RIVF.2009.5174648","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174648","url":null,"abstract":"In recent years, clustering with constraints has become a topic of significant interest for many researchers because it allows to take into account the knowledge from the domain, expressed as a set of constraints, and thus to improve the efficiency of the analysis. For example, these approaches can take place in an interactive process where a user iteratively expresses new constraints to refine previous clustering results. In this paper, we propose three new variants of the leader ant clustering with constraint algorithm (MCLA, MELA and CELA) that implements the following constraints: the must-link, cannot-link constraints and epsiv-constraints. These algorithms have been compared to other constraint based clustering algorithms such as K-means clustering with constraints and the original leader ant clustering algorithm. Our experiments show that, on UCI machine learning and artificial data sets, our approach compares well to the other algorithms.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130760547","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":"Boosted of Haar-like Features and Local Binary Pattern Based Face Detection","authors":"Toan Thanh Do, K. Doan, T. Le, H. Le","doi":"10.1109/RIVF.2009.5174627","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174627","url":null,"abstract":"Effective and real time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning and cascade of the strong classifiers since Viola and Jones' work. After that, Rainer Lienhart had improved Viola and Jones' work by extending set of Haar-like features. However, it still has drawbacks; the detection results often have high false positives. In A. Hadid et al. have used local binary pattern (LBP) method for face description and they applied effectively in face detection problem. However, it is slow. Therefore, it is difficult to apply in real time applications. In this work, we proposed an approach to combine a boosted of Haar-like features and LBP to achieve a good trade-off between two extreme. The system, which is built from proposed model, is conducted on MIT + CMU test set. Experimental results show that our method performs favorably compared to state of the art methods.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127174319","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":"On Evaluating Sport Event Recognition using Bag-of-Words Model","authors":"Vo Dinh Phong, Tran Ngoc Trung, Le Bac","doi":"10.1109/RIVF.2009.5174651","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174651","url":null,"abstract":"This paper presents extensive experiments on sport event images using the bag-of-words model. We propose a simple but effective combination of feature extraction and visual dictionary formation to boost the performance of naive Bayes classifier based on BOW model. Despite of not being a novel idea, our algorithm offers encouraging performance in event recognition domain. Moreover, in certain degrees, it can compete to typical works in event image clustering. Two challenge datasets are involved in discovering interesting facts needed to be concerned when designing a features sharing framework for event recognition.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129205337","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":"Coherence and Robustness in a Disturbed MAS","authors":"Q. Vu, B. Gaudou, Richard Canal, S. Hassas","doi":"10.1109/rivf.2009.5174630","DOIUrl":"https://doi.org/10.1109/rivf.2009.5174630","url":null,"abstract":"This paper presents a study on how to ensure the coherence of a distributed information system in which information is collected by a multi-agent system with the hypothesis that some agents of the system are dissonant, i.e. can produce or communicate incorrect information.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801997","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}
M. Fiedler, H. Zepernick, L. Lundberg, P. Arlos, M. Pettersson
{"title":"QoE-based Cross-Layer Design of Mobile Video Systems: Challenges and Concepts","authors":"M. Fiedler, H. Zepernick, L. Lundberg, P. Arlos, M. Pettersson","doi":"10.1109/RIVF.2009.5174655","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174655","url":null,"abstract":"This conceptual paper focuses on revealing challenges and offering concepts associated with the incorporation of the quality of experience (QoE) paradigm into the design of mobile video systems. The corresponding design framework combines application, middleware and networking layer in a unique cross-layer approach, in which all layers shall jointly analyse the quality of the video and its delivery in face of volatile conditions. Particular ingredients of the framework are efficient video processing, advanced realtime scheduling, and reduced-reference metrics on application and network layer.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121507491","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":"Using Belief Theory to Diagnose Control Knowledge Quality: Application to Cartographic Generalisation","authors":"P. Taillandier, C. Duchêne, A. Drogoul","doi":"10.1109/RIVF.2009.5174663","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174663","url":null,"abstract":"Both humans and artificial systems frequently use trial and error methods to problem solving. In order to be effective, this type of strategy implies having high quality control knowledge to guide the quest for the optimal solution. Unfortunately, this control knowledge is rarely perfect. Moreover, in artificial systems--as in humans--self-evaluation of one's own knowledge is often difficult. Yet, this self-evaluation can be very useful to manage knowledge and to determine when to revise it. The objective of our work is to propose an automated approach to evaluate the quality of control knowledge in artificial systems based on a specific trial and error strategy, namely the informed tree search strategy. Our revision approach consists in analysing the system's execution logs, and in using the belief theory to evaluate the global quality of the knowledge. We present a real-world industrial application in the form of an experiment using this approach in the domain of cartographic generalisation. Thus far, the results of using our approach have been encouraging. This paper deals with the problem of the automatic evaluation of the control knowledge quality. To face this problem, we propose an approach based on the analysis of the execution logs and on the belief theory. In Section II, we introduce the general context in which our work takes place and the difficulties we must face. Section III is devoted to the presentation of our approach. Section IV describes an application of our approach to the cartographic generalisation domain. In this context, we present a real case study that we carried out as well as its results. Section V concludes and presents perspectives of this work.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132734941","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":"Generating Request Web Services from Annotated BPEL","authors":"D. Le, Ngoc Son Nguyen, K. Mous, R. Ko, A. Goh","doi":"10.1109/RIVF.2009.5174641","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174641","url":null,"abstract":"Business Process Execution Language (BPEL) has been popularly used to describe a collaborative business processes which is executed by Web services. However, the original BPEL language is defined in a strict format which the developers must follow. This leads to difficulties to create or modify the BPEL documents. In order to overcome the problem, the original BPEL has been extended to an annotated-BPEL so that BPEL documents can be freely modified. One of the applications of annotated-BPEL is that it is employed to describe \"request\" Web service information. Since Web service discovery systems may support different Web service description languages, annotated BPEL must be translated into specific description languages so that it can be readable and understood. This paper introduces a system that generates \"request\" Web services from the annotated BPEL. The system supports the two most popular Web services description languages, namely, OWL-S and WSDL. The description is first translated into OWL-S since it contains semantics in describing the service. This is done by searching 'the best matched' OWL concepts in a OWL repository and then filling these concepts into an predefined OWL-S template. If we cannot find any suitable concepts, a WSDL document will be generated.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132196124","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":"Efficient Wavelet Lifting Scheme Based on Filter Optimization and Median Operator","authors":"Do Quan, Yo-Sung Ho","doi":"10.1109/RIVF.2009.5174636","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174636","url":null,"abstract":"In JPEG2000, the Cohen-Daubechies-Feauveau (CDF) 9/7-tap wavelet filter is implemented for lossy compression by a wavelet lifting scheme. However, the filter coefficients are remaining complex because they are irrational numbers. In addition, the conventional wavelet lifting scheme does not consider image edges. In this paper, we propose an efficient wavelet lifting scheme based on filter optimization and median operation and address these problems. For this purpose, we design optimal 9/7-tap wavelet filters by selecting appropriate filter coefficients. We also employ a median operator to consider image edges. Our proposed method, which is a combination of filter optimization and median lifting, improves the peak signal- to-noise ratio (PSNR) value up to 0.75 dB, compared to the well- known CDF 9/7-tap wavelet filter of JPEG2000.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115885151","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}
C. Tijus, S. Poitrenaud, Laure Léger, P. Brézillon
{"title":"Counterfactual Based Innovation: A Galois Lattice Approach of Creative Thinking","authors":"C. Tijus, S. Poitrenaud, Laure Léger, P. Brézillon","doi":"10.1109/RIVF.2009.5174633","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174633","url":null,"abstract":"Counterfactual reasoning is a form of modal reasoning about the way things could be (have been, would be) in contrast to reasoning about the way things actually are (were). This form of reasoning is elusive and provides reasoning bias. However, in the framework of a cognitive science theory that advocate that people reason using factual categories, counterfactuals being category counterfactuals, seen as same level collateral complementary categories of the factual category, provide a basis for innovation processes that differs from analogical thinking and case-based theory. The modeling shows how to implement tools for innovative solutions using Galois lattices and contextual graphs.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122820388","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}