Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369151
Qing Xu, Marcia B. Costa e Silva, J. Danger, F. Mendieta, S. Guilley, P. Bellot, P. Gallion
In this work we present the principles and experimental demonstration of a BB84 quantum key distribution (QKD) one way system using fainted pulses and a quadrature phase-shift-keying (QPSK) format including a time- multiplexed unmodulated carrier reference at Alice's end, and a differential homodyne reception at Bob's end. We also describe the secure electronics interface subsystem concept for the interaction with upper layers in an IP application.
{"title":"Towards Quantum Key Distribution System using Homodyne Detection with Differential Time-Multiplexed Reference","authors":"Qing Xu, Marcia B. Costa e Silva, J. Danger, F. Mendieta, S. Guilley, P. Bellot, P. Gallion","doi":"10.1109/RIVF.2007.369151","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369151","url":null,"abstract":"In this work we present the principles and experimental demonstration of a BB84 quantum key distribution (QKD) one way system using fainted pulses and a quadrature phase-shift-keying (QPSK) format including a time- multiplexed unmodulated carrier reference at Alice's end, and a differential homodyne reception at Bob's end. We also describe the secure electronics interface subsystem concept for the interaction with upper layers in an IP application.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115019454","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369143
N. D. Nghia, Huynh Thi Thanh Binh
Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.
{"title":"New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem","authors":"N. D. Nghia, Huynh Thi Thanh Binh","doi":"10.1109/RIVF.2007.369143","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369143","url":null,"abstract":"Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114336072","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369146
S. B. Amor, Vincent Levorato, I. Lavallée
We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the concept of proximity, expressing different types of connections that may exist between the elements of a population. A modeling and simulation of forest fire using this approach shows the efficiency of this formalism to provide a realistic and powerful modeling of complex systems.
{"title":"Generalized Percolation Processes Using Pretopology Theory","authors":"S. B. Amor, Vincent Levorato, I. Lavallée","doi":"10.1109/RIVF.2007.369146","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369146","url":null,"abstract":"We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the concept of proximity, expressing different types of connections that may exist between the elements of a population. A modeling and simulation of forest fire using this approach shows the efficiency of this formalism to provide a realistic and powerful modeling of complex systems.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126261510","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369141
Ngo Phuong Nhung, Tu Minh Phuong
Spam e-mail with advertisement text embedded in images presents a great challenge to anti-spam filters. In this paper, we describe a fast method to detect image-based spam e- mail. Using simple edge-based features, the method computes a vector of similarity scores between an image and a set of templates. This similarity vector is then used with support vector machines to separate spam images from other common categories of images. Our method does not require computationally expensive OCR or even text extraction from images. Empirical results show that the method is fast and has good classification accuracy.
{"title":"An Efficient Method for Filtering Image-Based Spam","authors":"Ngo Phuong Nhung, Tu Minh Phuong","doi":"10.1109/RIVF.2007.369141","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369141","url":null,"abstract":"Spam e-mail with advertisement text embedded in images presents a great challenge to anti-spam filters. In this paper, we describe a fast method to detect image-based spam e- mail. Using simple edge-based features, the method computes a vector of similarity scores between an image and a set of templates. This similarity vector is then used with support vector machines to separate spam images from other common categories of images. Our method does not require computationally expensive OCR or even text extraction from images. Empirical results show that the method is fast and has good classification accuracy.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132007728","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369147
Y. Wang, T. Cheng, M. Ma
Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength channel usage or maximizing the number of connections established. In this paper, we formulate it as a priority and maximum revenue (MR) based optimization problem, which we believe will be more appealing to network operators. We describe an integer linear programming (ILP) solution which can be used to find the optimal solution for small networks. We also describe a simplified ILP (SILP) solution which can be used for both small and large networks. By means of computer simulations, the performance of the two ILP solutions are compared with the sequential R WA (SR) algorithm which we devise to mimic those algorithms commonly used for solving the maximum lightpath establishment (MLE) problem. Our results show that SILP outperforms SR significantly, and yields solutions close to the optimal solution obtained from ILP.
{"title":"Priority and Maximum Revenue based Routing and Wavelength Assignment for All-optical WDM Networks","authors":"Y. Wang, T. Cheng, M. Ma","doi":"10.1109/RIVF.2007.369147","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369147","url":null,"abstract":"Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength channel usage or maximizing the number of connections established. In this paper, we formulate it as a priority and maximum revenue (MR) based optimization problem, which we believe will be more appealing to network operators. We describe an integer linear programming (ILP) solution which can be used to find the optimal solution for small networks. We also describe a simplified ILP (SILP) solution which can be used for both small and large networks. By means of computer simulations, the performance of the two ILP solutions are compared with the sequential R WA (SR) algorithm which we devise to mimic those algorithms commonly used for solving the maximum lightpath establishment (MLE) problem. Our results show that SILP outperforms SR significantly, and yields solutions close to the optimal solution obtained from ILP.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"648 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116470034","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369132
I. Charon, O. Hudry
We study here the application of a metaheuristic, issued from the noising methods and that we call "descent with mutations", to a problem arising in the field of the aggregation of symmetric relations: the clique partitioning of a weighted graph. This local search metaheuristic, of which the design is very simple, is compared with another very efficient metaheuristic, which is a simulated annealing improved by the addition of some ingredients coming from the noising methods. These experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while, above all, it is much easier to design and to apply.
{"title":"Application of the \"descent with mutations\" metaheuristic to a clique partitioning problem","authors":"I. Charon, O. Hudry","doi":"10.1109/RIVF.2007.369132","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369132","url":null,"abstract":"We study here the application of a metaheuristic, issued from the noising methods and that we call \"descent with mutations\", to a problem arising in the field of the aggregation of symmetric relations: the clique partitioning of a weighted graph. This local search metaheuristic, of which the design is very simple, is compared with another very efficient metaheuristic, which is a simulated annealing improved by the addition of some ingredients coming from the noising methods. These experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while, above all, it is much easier to design and to apply.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"23 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132035058","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369131
T. Dinh, Tang-Ho Lê
Nowadays, enterprise modeling has to concern with not only modeling of information systems but also modeling interoperability of them. This paper proposes an approach for modeling interoperability of information systems (IS). The approach considers that each information system is operated by a responsibility zone in the living world. Interoperability of information systems is based on the information overlapped between responsibility zones. The first step is to specify overlap situations between responsibility zones. The second step is to specify overlap protocols and the use of those overlap protocols to operate the overlap situations. The third step is to implement the overlap protocols using the current interoperability technologies.
{"title":"Towards an Approach for Modeling Interoperability of Information Systems","authors":"T. Dinh, Tang-Ho Lê","doi":"10.1109/RIVF.2007.369131","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369131","url":null,"abstract":"Nowadays, enterprise modeling has to concern with not only modeling of information systems but also modeling interoperability of them. This paper proposes an approach for modeling interoperability of information systems (IS). The approach considers that each information system is operated by a responsibility zone in the living world. Interoperability of information systems is based on the information overlapped between responsibility zones. The first step is to specify overlap situations between responsibility zones. The second step is to specify overlap protocols and the use of those overlap protocols to operate the overlap situations. The third step is to implement the overlap protocols using the current interoperability technologies.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295666","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369153
S. Ghernaouti-Helie, M. Sfaxi
To protect the critical telecommunications, it is a must to enhance the ICT security level. To achieve an efficient use of cryptographic mechanisms to secure ICT infrastructures, we propose to integrate quantum key distribution into main communication protocols. In this paper, the weaknesses of classical cryptography and value added by quantum key distribution are analysed. Several feasibility ways to implement solutions based on quantum key distribution are proposed.
{"title":"Sharing information using quantum cryptography to reach the unconditional security","authors":"S. Ghernaouti-Helie, M. Sfaxi","doi":"10.1109/RIVF.2007.369153","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369153","url":null,"abstract":"To protect the critical telecommunications, it is a must to enhance the ICT security level. To achieve an efficient use of cryptographic mechanisms to secure ICT infrastructures, we propose to integrate quantum key distribution into main communication protocols. In this paper, the weaknesses of classical cryptography and value added by quantum key distribution are analysed. Several feasibility ways to implement solutions based on quantum key distribution are proposed.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128564114","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369163
Diem Thi Hoang Le, J. Chevallet, D. T. Thuy
UMLS is known as largest thesaurus in biomedical domain constructed by Library National of Medicine. In this paper, we aim to evaluate effect of the exploration of UMLS knowledge in medical domain information retrieval by mapping large text of collection ImageCLEFMed to UMLS concepts, and expanding queries and documents automatically base on semantic relations in the UMLS hierarchy. We get the encouraging result with the best enhancement on MAP of 66% compared to text only retrieval, and 34% compared to conceptual indexing baseline.
{"title":"Thesaurus-based query and document expansion in conceptual indexing with UMLS: Application in medical information retrieval","authors":"Diem Thi Hoang Le, J. Chevallet, D. T. Thuy","doi":"10.1109/RIVF.2007.369163","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369163","url":null,"abstract":"UMLS is known as largest thesaurus in biomedical domain constructed by Library National of Medicine. In this paper, we aim to evaluate effect of the exploration of UMLS knowledge in medical domain information retrieval by mapping large text of collection ImageCLEFMed to UMLS concepts, and expanding queries and documents automatically base on semantic relations in the UMLS hierarchy. We get the encouraging result with the best enhancement on MAP of 66% compared to text only retrieval, and 34% compared to conceptual indexing baseline.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124737762","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}
Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369154
P. Yupapin, S. Suchat, P. Phiphithirankarn
A new technique of an entangled photon pair generation using an all fiber optic scheme is presented. The proposed system is consisted of a fiber optic Mach-Zehnder interferometer (MZI) incorporating with a fiber optic ring resonator. The Kerr nonlinearity effect in the fiber ring resonator is exploited for the generation of two independent squeezed beams. The advantage of such a system is that it requires a simple arrangement without any optical pumping part and bulky optical components. Polarized light pulse trains are launched randomly into a MZI which one part of them is delayed in the longer path. The output pulses from both arms of the MZI are entered into a nonlinear fiber optic ring resonator. Where the superpositions of light pulses in a nonlinear fiber optics ring resonator are randomly occurred which is formed the entangled photon pairs. A polarization controller controls polarization states of light pulses while circulating in the ring resonator. The entangled photons are seen on the avalanche photo-detector, which is shown in good agreement with the previous works.
{"title":"Time-Bin Entangled Photons using an all Fiber Optic MZI Incorporating a Fiber Ring Resonator","authors":"P. Yupapin, S. Suchat, P. Phiphithirankarn","doi":"10.1109/RIVF.2007.369154","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369154","url":null,"abstract":"A new technique of an entangled photon pair generation using an all fiber optic scheme is presented. The proposed system is consisted of a fiber optic Mach-Zehnder interferometer (MZI) incorporating with a fiber optic ring resonator. The Kerr nonlinearity effect in the fiber ring resonator is exploited for the generation of two independent squeezed beams. The advantage of such a system is that it requires a simple arrangement without any optical pumping part and bulky optical components. Polarized light pulse trains are launched randomly into a MZI which one part of them is delayed in the longer path. The output pulses from both arms of the MZI are entered into a nonlinear fiber optic ring resonator. Where the superpositions of light pulses in a nonlinear fiber optics ring resonator are randomly occurred which is formed the entangled photon pairs. A polarization controller controls polarization states of light pulses while circulating in the ring resonator. The entangled photons are seen on the avalanche photo-detector, which is shown in good agreement with the previous works.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121540978","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：