Pub Date : 2007-03-05DOI: 10.1109/RIVF.2007.369137
C. Tijus, S. Poitrenaud, E. Zibetti, F. Jouen, M. Bui, E. Pinska
Generalized Galois lattices formalism for computing contextual categorization allows metrics to evaluate complexity and efficiency as well as methods for simplifying or complicating the external object at hand. Such methods are adapted for virtual environments and augmented reality devices for which it is simple to change the distribution of features over categories. For real world objects, and human operators that operate on them, the online computation allows a survey of the complexity level and a "simplify it first" planning of operations.
{"title":"Complexity Reduction: theory, metrics and applications","authors":"C. Tijus, S. Poitrenaud, E. Zibetti, F. Jouen, M. Bui, E. Pinska","doi":"10.1109/RIVF.2007.369137","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369137","url":null,"abstract":"Generalized Galois lattices formalism for computing contextual categorization allows metrics to evaluate complexity and efficiency as well as methods for simplifying or complicating the external object at hand. Such methods are adapted for virtual environments and augmented reality devices for which it is simple to change the distribution of features over categories. For real world objects, and human operators that operate on them, the online computation allows a survey of the complexity level and a \"simplify it first\" planning of operations.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"57 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":"115629900","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.369134
E. Chiba, H. Fujiwara, Yoshiyuki Sekiguchi, T. Ibaraki
Flat panel displays (FPDs) are manufactured through many different processing equipments arranged sequentially in a line. Although the constant inter-arrival time (i.e., the tact time) of glass substrates in the line should be kept as short as possible, the collision probability between glass substrates increases as the time becomes shorter. Since the glass substrate is expensive and fragile, the collision should be avoided. In this paper, we derive a closed form formula of the collision probability for a model, in which the processing time on each equipment is assumed to follow the Erlang distribution. We also show some numerical results and computer simulation results of the collision probability.
{"title":"Collision Probability in an Automated Production Line under Erlang Distribution","authors":"E. Chiba, H. Fujiwara, Yoshiyuki Sekiguchi, T. Ibaraki","doi":"10.1109/RIVF.2007.369134","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369134","url":null,"abstract":"Flat panel displays (FPDs) are manufactured through many different processing equipments arranged sequentially in a line. Although the constant inter-arrival time (i.e., the tact time) of glass substrates in the line should be kept as short as possible, the collision probability between glass substrates increases as the time becomes shorter. Since the glass substrate is expensive and fragile, the collision should be avoided. In this paper, we derive a closed form formula of the collision probability for a model, in which the processing time on each equipment is assumed to follow the Erlang distribution. We also show some numerical results and computer simulation results of the collision probability.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"1 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":"130717041","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.369152
Cuong Le Quoc, P. Bellot, A. Demaille
This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in quantum key distribution (QKD)-based networks. We develop a realistic QKD- based network framework and we show that the key transmission problem on such a framework can be considered as a variant of the classical percolation problem. We also present an adaptive stochastic routing algorithm to protect users from inevitable eavesdroppers. Simulations were carried out not only to validate our approach, but also to compute critical parameters to ensure security. These results show that large quantum networks with eavesdroppers do provide security.
{"title":"Stochastic routing in large grid-shaped quantum networks","authors":"Cuong Le Quoc, P. Bellot, A. Demaille","doi":"10.1109/RIVF.2007.369152","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369152","url":null,"abstract":"This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in quantum key distribution (QKD)-based networks. We develop a realistic QKD- based network framework and we show that the key transmission problem on such a framework can be considered as a variant of the classical percolation problem. We also present an adaptive stochastic routing algorithm to protect users from inevitable eavesdroppers. Simulations were carried out not only to validate our approach, but also to compute critical parameters to ensure security. These results show that large quantum networks with eavesdroppers do provide security.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"65 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":"121531042","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.369149
Chung-Tien Nguyen, O. Camp, S. Loiseau
Functioning as fully decentralised distributed systems, without the need of predefined infrastructures, mobile ad hoc networks provide interesting solutions when setting up dynamic and flexible applications. However, these systems also bring up some problems. In such open environments, it is difficult to discover among the nodes, which are malicious and which are not, in order to be able to choose good partners for cooperation. One solution for this to be possible, is for the entities to be able to evaluate the trust they have in each other and, based on this trust, determine which entities they can cooperate with. In this paper, we present a trust model adapted to ad hoc networks and, more generally, to distributed systems. This model is based on Bayesian networks, a probabilistic tool which provides a flexible means of dealing with probabilistic problems involving causality. The model evaluates the trust in a server according, both, to direct experiences with the server and recommendations concerning its service. We show, through a simulation, that the proposed model can determine the best server out of a set of eligible servers offering a given service. Such a trust model, when applied to ad hoc networks, tends to increase the QoS of the various services used by a host. This, when applied to security related services thus increases the overall security of the hosts.
{"title":"A Bayesian network based trust model for improving collaboration in mobile ad hoc networks","authors":"Chung-Tien Nguyen, O. Camp, S. Loiseau","doi":"10.1109/RIVF.2007.369149","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369149","url":null,"abstract":"Functioning as fully decentralised distributed systems, without the need of predefined infrastructures, mobile ad hoc networks provide interesting solutions when setting up dynamic and flexible applications. However, these systems also bring up some problems. In such open environments, it is difficult to discover among the nodes, which are malicious and which are not, in order to be able to choose good partners for cooperation. One solution for this to be possible, is for the entities to be able to evaluate the trust they have in each other and, based on this trust, determine which entities they can cooperate with. In this paper, we present a trust model adapted to ad hoc networks and, more generally, to distributed systems. This model is based on Bayesian networks, a probabilistic tool which provides a flexible means of dealing with probabilistic problems involving causality. The model evaluates the trust in a server according, both, to direct experiences with the server and recommendations concerning its service. We show, through a simulation, that the proposed model can determine the best server out of a set of eligible servers offering a given service. Such a trust model, when applied to ad hoc networks, tends to increase the QoS of the various services used by a host. This, when applied to security related services thus increases the overall security of the hosts.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"33 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":"124592402","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.369155
Q. Vu, Tomonari Masada, A. Takasu, J. Adachi
Results of queries by personal names often contain documents related to several people because of the namesake problem. In order to differentiate documents related to different people, an effective method is needed to measure document similarities and to find documents related to the same person. Some previous researchers have used the vector space model or have tried to extract common named entities for measuring similarities. We propose a new method that uses Web directories as a knowledge base to find shared contexts in document pairs and uses the measurement of shared contexts to determine similarities between document pairs. Experimental results show that our proposed method outperforms the vector space model method and the named entity recognition method.
{"title":"Disambiguation of People in Web Search Using a Knowledge Base","authors":"Q. Vu, Tomonari Masada, A. Takasu, J. Adachi","doi":"10.1109/RIVF.2007.369155","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369155","url":null,"abstract":"Results of queries by personal names often contain documents related to several people because of the namesake problem. In order to differentiate documents related to different people, an effective method is needed to measure document similarities and to find documents related to the same person. Some previous researchers have used the vector space model or have tried to extract common named entities for measuring similarities. We propose a new method that uses Web directories as a knowledge base to find shared contexts in document pairs and uses the measurement of shared contexts to determine similarities between document pairs. Experimental results show that our proposed method outperforms the vector space model method and the named entity recognition method.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"7 4-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858958","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.369168
Minh-Tuan T. Hoang, H. T. Huynh, Nguyen H. Vo, Yonggwan Won, Jung-Ja Kim
2D-gel electrophoresis (2D-GE) is a central technique for separation of protein samples in proteomic research. A 2D-GE image usually contains hundreds of protein spots that should be detected by an image processing technique. Identifying the missing proteins by comparison of two samples such as from healthy person and patient can be helpful in developing medicine or disease control. This matching process is a laborious work that needs to be automatically done by computers with less user intervention as much as possible. In this paper, we propose a two-step iterative registration algorithm for protein spots in 2D-GE images. The algorithm estimates the geometrical differences between the corresponding landmarks and iteratively moves the spot points in the matched gel in order to be closer to its correspondence in the reference gel. The amount of movement of each spot is affected by the Euclidian distances from the spot to all landmarks. The single-step matching is defined with its pros and cons; then the motivation to a two-step iterative registration algorithm and its results are discussed.
{"title":"Two-Step Iterative Registration for 2D-Gel Electrophoresis Images","authors":"Minh-Tuan T. Hoang, H. T. Huynh, Nguyen H. Vo, Yonggwan Won, Jung-Ja Kim","doi":"10.1109/RIVF.2007.369168","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369168","url":null,"abstract":"2D-gel electrophoresis (2D-GE) is a central technique for separation of protein samples in proteomic research. A 2D-GE image usually contains hundreds of protein spots that should be detected by an image processing technique. Identifying the missing proteins by comparison of two samples such as from healthy person and patient can be helpful in developing medicine or disease control. This matching process is a laborious work that needs to be automatically done by computers with less user intervention as much as possible. In this paper, we propose a two-step iterative registration algorithm for protein spots in 2D-GE images. The algorithm estimates the geometrical differences between the corresponding landmarks and iteratively moves the spot points in the matched gel in order to be closer to its correspondence in the reference gel. The amount of movement of each spot is affected by the Euclidian distances from the spot to all landmarks. The single-step matching is defined with its pros and cons; then the motivation to a two-step iterative registration algorithm and its results are discussed.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"48 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":"133248602","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.369148
L. Decreusefond, Eduardo Ferreir, P. Martins
We consider a propagation model under path loss, shadowing and multipath effects, where each cell are a Voronoi tessellation and the generating points of this cells are a uniform Poisson point process in R2. In addition, the antennas are located in each point generated by the Poisson process. With this model, we calculate the mean interference to signal ratio ISR, which actually gives us a physical information, but once we are interest in apply this mean in the Shannon's formula, we simulated the real mean value of signal to interference ratio SIR and compared the result with the calculated ISR-1.
{"title":"Simple estimate of signal to interference ratio with randomly located antennas","authors":"L. Decreusefond, Eduardo Ferreir, P. Martins","doi":"10.1109/RIVF.2007.369148","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369148","url":null,"abstract":"We consider a propagation model under path loss, shadowing and multipath effects, where each cell are a Voronoi tessellation and the generating points of this cells are a uniform Poisson point process in R2. In addition, the antennas are located in each point generated by the Poisson process. With this model, we calculate the mean interference to signal ratio ISR, which actually gives us a physical information, but once we are interest in apply this mean in the Shannon's formula, we simulated the real mean value of signal to interference ratio SIR and compared the result with the calculated ISR-1.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"153 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":"123238208","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.369136
Anh-Vu Dinh-Duc, P. Vivet, A. Clouard
The specification on power consumption of a digital system is extremely important due to the growing relevance of the market of portable devices and must be taken into account since the early phases of a complex system-on-chip (SoC) design. Transaction level models for SoC are gaining increasing attention with emerging architectural modeling standards like SystemC. In this paper a transaction level modeling of asynchronous network-on-chip (NOC) architecture is presented. This modeling enables early system-level validation of circuit as well as energy evaluation of circuit, which will have important impact on high-level design decisions.
{"title":"A Transaction Level Modeling of Network-on-Chip Architecture for Energy Estimation","authors":"Anh-Vu Dinh-Duc, P. Vivet, A. Clouard","doi":"10.1109/RIVF.2007.369136","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369136","url":null,"abstract":"The specification on power consumption of a digital system is extremely important due to the growing relevance of the market of portable devices and must be taken into account since the early phases of a complex system-on-chip (SoC) design. Transaction level models for SoC are gaining increasing attention with emerging architectural modeling standards like SystemC. In this paper a transaction level modeling of asynchronous network-on-chip (NOC) architecture is presented. This modeling enables early system-level validation of circuit as well as energy evaluation of circuit, which will have important impact on high-level design decisions.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"1 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":"131306592","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.369130
Thanh Tran, Holger Lewen, P. Haase
Semantic Web research and recent efforts of large software companies have lead to mature technologies that can enable real-life semantic applications. While benefits such as advanced interoperability, search and data analysis are evident, little guidance is offered for the engineering of applications that can exploit them. To address this problem, the concept of an ontology, which is central to semantic applications, is compared to formalisms currently used in software engineering. More importantly, this paper proposes an extension to the three-tier architecture of enterprise information systems. The development of such a system is then demonstrated by the use of this architecture for an adaptive portal.
{"title":"On the Role and Application of Ontologies in Information Systems","authors":"Thanh Tran, Holger Lewen, P. Haase","doi":"10.1109/RIVF.2007.369130","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369130","url":null,"abstract":"Semantic Web research and recent efforts of large software companies have lead to mature technologies that can enable real-life semantic applications. While benefits such as advanced interoperability, search and data analysis are evident, little guidance is offered for the engineering of applications that can exploit them. To address this problem, the concept of an ontology, which is central to semantic applications, is compared to formalisms currently used in software engineering. More importantly, this paper proposes an extension to the three-tier architecture of enterprise information systems. The development of such a system is then demonstrated by the use of this architecture for an adaptive portal.","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":"134051644","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.369158
Saima Mushtaq, Liaquat Majeed Sheikh
Classification algorithms play a significant role in predicting the behavior of new data, based on the rules, which are extracted from the behavior of existing data in the database. This paper proposes optimal predictive approach with maximum accuracy and minimum risk factor involved. The main idea is to find best classification model for different real time domains by using a hybrid approach that is different from classical classification methodologies. Every classification data model has its accuracy measurement and error percentage or risk factor. We have focused on objective analysis of wrong prediction of these algorithms with some extended vision of including all possible groups of features. In other words our proposed approach facilitate the selection of most apt classification algorithm by adding an additional layer on classification model building process, in addition to data preprocessing step. The suitability of each classification algorithm is determined by optimal value analysis of algorithm accuracy and risk factor of accepting the wrong predictions as right ones.
{"title":"A Hybrid Approach for Real Time Domains","authors":"Saima Mushtaq, Liaquat Majeed Sheikh","doi":"10.1109/RIVF.2007.369158","DOIUrl":"https://doi.org/10.1109/RIVF.2007.369158","url":null,"abstract":"Classification algorithms play a significant role in predicting the behavior of new data, based on the rules, which are extracted from the behavior of existing data in the database. This paper proposes optimal predictive approach with maximum accuracy and minimum risk factor involved. The main idea is to find best classification model for different real time domains by using a hybrid approach that is different from classical classification methodologies. Every classification data model has its accuracy measurement and error percentage or risk factor. We have focused on objective analysis of wrong prediction of these algorithms with some extended vision of including all possible groups of features. In other words our proposed approach facilitate the selection of most apt classification algorithm by adding an additional layer on classification model building process, in addition to data preprocessing step. The suitability of each classification algorithm is determined by optimal value analysis of algorithm accuracy and risk factor of accepting the wrong predictions as right ones.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"44 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":"114691826","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
扫码关注我们
求助内容：
应助结果提醒方式：