RFID: Prospects for Europe: Item-level Tagging and Public Transportation

This report, which is part of the COMPLETE series of studies, investigates the current and future competitiveness of the European industry in RFID applications in general and in two specific cases: item-level tagging and public transportation. It analyses its constituent technologies, drivers and barriers to growth, actual and potential markets and economic impacts, the industrial position and innovative capabilities, and it concludes with policy implicationsJRC.DDG.J.4-Information Societ

Modelling Outcomes of Collaboration in Building Information Modelling Through Gaming Theory Lenses

Construction project performance is vulnerable to process fragmentation and weak frameworks for sustaining objectivity and value integration between stakeholders, including clients, involved in the project development processes. For centuries, conventional construction processes have endured the challenges associated with this phenomenon. Several industry reports have suggested this situation is responsive to effective communication, collaboration, thorough integration and a passion for objectivity in data sharing and information management between key players. While entity-based computer-aided design (CAD) lacks the framework to facilitate an effective result in this direction, Building Information Modelling (BIM) has shown the potential for major improvements over the limitations of manual and CAD design methods. Three Game Theory models (Prisoner’s dilemma, Pareto Optima and Hawk-dove) have been proposed to mirror certain implications of players’ actions in BIM environment. In all the gaming lenses used, the study suggests that stakeholders and industry will only benefit when BIM is fully adopted. It has been established that when BIM is partially adopted, the compliant party is likely to benefit more, while the non-compliant party may not necessarily gain the same benefits. The study concluded that BIM means a lot to the industry; the industry cannot afford the consequences of failing to adopt BIM potentials and allied innovations in an era where digital technology is revolutionising other industries. Recommendations are made on areas for further research

Integrating affordable housing and sustainable housing: bridging two merit goods in Australia

Interest among planning and policy makers in environmentally sustainable housing has risen in recent years as a response to the global goal of attaining sustainable development. In Australia, there has long been concern that the market might under-provide affordable housing and, more recently, concerns have been raised over the capacity of the market to provide sustainable housing. Governments in Australia have intervened through subsidies, tax incentives and more direct forms of support for the provision of affordable and sustainable housing. Providing environmentally sustainable housing is thus perceived to be a “merit good” in Australia. That is, a good that has social merit but one that is underprovided by markets. Contemporary housing policy debate in Australia has emphasised the need to respond to a growing housing affordability challenge. Affordable housing might also be seen to be a merit good in Australia. Nevertheless there has been a reluctance to consider housing sustainability in the same context as housing affordability. This chapter addresses the debate over affordable and sustainable housing in Australia by drawing on learnings from the Ecocents Living research project to suggest a conceptual basis to understand the issues at hand. Ecocents Living is a project that seeks to integrate the concepts of affordable and sustainable housing into a model to guide industrial implementation of sustainable and affordable housing. It is argued that the concepts of sustainable housing and affordable housing have synergies that warrant consideration and the further development of an embryonic model for integrating sustainable and affordable housing is offered in this chapter.George Zillante, Stephen Pullen, Lou Wilson, Kathryn Davidson, Nicholas Chileshe, Jian Zuo, Michael Arma

International Workshop on Description Logics : Bonn, May 28/29, 1994

This collection of papers forms the permanent record of the 1994 Description Logic Workshop, that was held at the Gustav Stresemann Institut in Bonn, Germany on 28 and 29 May 1994, immediately after the Fourth International Conference on Principles of Knowledge Representation and Reasoning. The workshop was set up to be as informal as possible, so this collection cannot hope to capture the discussions associated with the workshop. However, we hope that it will serve to remind participants of their discussion at the workshop, and provide non-participants with indications of the topics that were discussed at the workshop. The workshop consisted of seven regular sessions and one panel session. Each regular session had about four short presentations on a single theme, but also had considerable time reserved for discussion. The themes of the sessions were Foundations of Description Logics, Architecture of Description Logics and Description Logic Systems, Language Extensions, Expanding Description Logics, General Applications of Description Logics, Natural Language Applications of Description Logics, Connections between Description Logics and Databases, and the Future of Description Logics and Description Logic Systems. The session on Foundations of Description Logics concentrated on computational properties of description logics, correspondences between description logics and other formalisms, and on semantics of description logics, Similarly, there is discussion on how to develop tractable desription logics, for some notion of tractable, and whether it is useful to worry about achieving tractability at all. Several of the participants argued in favour of a very expressive description logic. This obviously precludes tractability or even decidability of complete reasoning. Klaus Schild proposed that for some purposes one could employ "model checking" (i .e., a closed world assumption) instead of "theorem proving," and has shown that this is still tractable for very large languages. Maurizio Lenzerini's opinion was that it is important to have decidable languages. Tractability cannot be achieved in several application areas because there one needs very expressive constructs: e.g., axioms, complex role constructors, and cycles with fixed-point semantics. For Bob MacGregor, not even decidability is an issue since he claims that Loom's incomplete reasoner is sufficient for his applications. The discussion addressed the question of whether there is still need for foundations, and whether the work on foundation done until now really solved the problems that the designers of early DL systems had. Both questions were mostly answered in the affirmative, with the caveat that new research on foundations should make sure that it is concerned with "real" problems, and not just generates new problems. In the session on Architecture of Description Logics and Description Logic Systems the participants considered different ways of putting together description logics and description logic systems. One way of doing this is to have a different kind of inference strategy for description logics, such as one based on intuitionistic logics or one based directly on rules of inference-thus allowing variant systems. Another way of modifying description logic systems is to divide them up in different ways, such as making a terminology consist of a schema portion and a view portion. Some discussion in this session concerned whether architectures should be influenced by application areas, or even by particular applications. There was considerable discussion at the workshop on how Description Logics should be extended or expanded to make them more useful. There are several methods to do this. The first is to extend the language of descriptions, e.g ., to represent n-ary relations, temporal information, or whole-part relationships, all of which were discussed at the workshop. The second is to add in another kind of reasoning, such as default reasoning, while still keeping the general framework of description logic reasoning. The third is to incorporate descriptions or description-like constructs in a larger reasoner, such as a first order reasoner. This was the approach taken in OMEGA and is the approach being taken in the Loom project. There have been many extensions of the first two kinds proposed for description logics, including several presented at the workshop. One quest ion discussed at the workshop was whether these extensions fit in well with the philosophy of description logic. Another question was whether the presence of many proposals for extensions means that description logics are easy to expand, or that description logics are inadequate representation formalisms? The general consensus was that description logics adequately capture a certain kind of core reasoning and that they lend themselves to incorporation with other kinds of reasoning. Care must be taken, however, to keep the extended versions true to the goals of description logics. The sessions on Applications of Description Logics had presentations on applications of description logics in various areas, including configuration, tutoring, natural language processing, and domain modeling. Most of these applications are research applications, funded by government research programs. There was discussion of what is needed to have more fielded applications of description logics. The session on Connections between Description Logics and Databases considered three kinds of connections between Description Logics and Databases: 1. using Description Logics for expressing database schemas, including local schemas, integrated schemas, and views, integrity constraints, and queries; 2. using Description Logic reasoning for various database-related reasoning, including schema integration and validation, and query optimization, and query validation and organization; and 3. making Description Logic reasoners more like Database Mangagement Systems via optimization. All three of these connections are being actively investigated by the description logic community. The panel session on the Future of Description Logics and Description Logic Systems discussed where the future of description logics will lie. There seems to be a consensus that description logics must forge tighter connections with other formalisms, such as databases or object-oriented systems. In this way, perhaps, description logics will find more real applications

International Workshop on Description Logics : Bonn, May 28/29, 1994

This collection of papers forms the permanent record of the 1994 Description Logic Workshop, that was held at the Gustav Stresemann Institut in Bonn, Germany on 28 and 29 May 1994, immediately after the Fourth International Conference on Principles of Knowledge Representation and Reasoning. The workshop was set up to be as informal as possible, so this collection cannot hope to capture the discussions associated with the workshop. However, we hope that it will serve to remind participants of their discussion at the workshop, and provide non-participants with indications of the topics that were discussed at the workshop. The workshop consisted of seven regular sessions and one panel session. Each regular session had about four short presentations on a single theme, but also had considerable time reserved for discussion. The themes of the sessions were Foundations of Description Logics, Architecture of Description Logics and Description Logic Systems, Language Extensions, Expanding Description Logics, General Applications of Description Logics, Natural Language Applications of Description Logics, Connections between Description Logics and Databases, and the Future of Description Logics and Description Logic Systems. The session on Foundations of Description Logics concentrated on computational properties of description logics, correspondences between description logics and other formalisms, and on semantics of description logics, Similarly, there is discussion on how to develop tractable desription logics, for some notion of tractable, and whether it is useful to worry about achieving tractability at all. Several of the participants argued in favour of a very expressive description logic. This obviously precludes tractability or even decidability of complete reasoning. Klaus Schild proposed that for some purposes one could employ "model checking" (i .e., a closed world assumption) instead of "theorem proving," and has shown that this is still tractable for very large languages. Maurizio Lenzerini\u27s opinion was that it is important to have decidable languages. Tractability cannot be achieved in several application areas because there one needs very expressive constructs: e.g., axioms, complex role constructors, and cycles with fixed-point semantics. For Bob MacGregor, not even decidability is an issue since he claims that Loom\u27s incomplete reasoner is sufficient for his applications. The discussion addressed the question of whether there is still need for foundations, and whether the work on foundation done until now really solved the problems that the designers of early DL systems had. Both questions were mostly answered in the affirmative, with the caveat that new research on foundations should make sure that it is concerned with "real" problems, and not just generates new problems. In the session on Architecture of Description Logics and Description Logic Systems the participants considered different ways of putting together description logics and description logic systems. One way of doing this is to have a different kind of inference strategy for description logics, such as one based on intuitionistic logics or one based directly on rules of inference-thus allowing variant systems. Another way of modifying description logic systems is to divide them up in different ways, such as making a terminology consist of a schema portion and a view portion. Some discussion in this session concerned whether architectures should be influenced by application areas, or even by particular applications. There was considerable discussion at the workshop on how Description Logics should be extended or expanded to make them more useful. There are several methods to do this. The first is to extend the language of descriptions, e.g ., to represent n-ary relations, temporal information, or whole-part relationships, all of which were discussed at the workshop. The second is to add in another kind of reasoning, such as default reasoning, while still keeping the general framework of description logic reasoning. The third is to incorporate descriptions or description-like constructs in a larger reasoner, such as a first order reasoner. This was the approach taken in OMEGA and is the approach being taken in the Loom project. There have been many extensions of the first two kinds proposed for description logics, including several presented at the workshop. One quest ion discussed at the workshop was whether these extensions fit in well with the philosophy of description logic. Another question was whether the presence of many proposals for extensions means that description logics are easy to expand, or that description logics are inadequate representation formalisms? The general consensus was that description logics adequately capture a certain kind of core reasoning and that they lend themselves to incorporation with other kinds of reasoning. Care must be taken, however, to keep the extended versions true to the goals of description logics. The sessions on Applications of Description Logics had presentations on applications of description logics in various areas, including configuration, tutoring, natural language processing, and domain modeling. Most of these applications are research applications, funded by government research programs. There was discussion of what is needed to have more fielded applications of description logics. The session on Connections between Description Logics and Databases considered three kinds of connections between Description Logics and Databases: 1. using Description Logics for expressing database schemas, including local schemas, integrated schemas, and views, integrity constraints, and queries; 2. using Description Logic reasoning for various database-related reasoning, including schema integration and validation, and query optimization, and query validation and organization; and 3. making Description Logic reasoners more like Database Mangagement Systems via optimization. All three of these connections are being actively investigated by the description logic community. The panel session on the Future of Description Logics and Description Logic Systems discussed where the future of description logics will lie. There seems to be a consensus that description logics must forge tighter connections with other formalisms, such as databases or object-oriented systems. In this way, perhaps, description logics will find more real applications

International Workshop on Description Logics : Bonn, May 28/29, 1994

This collection of papers forms the permanent record of the 1994 Description Logic Workshop, that was held at the Gustav Stresemann Institut in Bonn, Germany on 28 and 29 May 1994, immediately after the Fourth International Conference on Principles of Knowledge Representation and Reasoning. The workshop was set up to be as informal as possible, so this collection cannot hope to capture the discussions associated with the workshop. However, we hope that it will serve to remind participants of their discussion at the workshop, and provide non-participants with indications of the topics that were discussed at the workshop. The workshop consisted of seven regular sessions and one panel session. Each regular session had about four short presentations on a single theme, but also had considerable time reserved for discussion. The themes of the sessions were Foundations of Description Logics, Architecture of Description Logics and Description Logic Systems, Language Extensions, Expanding Description Logics, General Applications of Description Logics, Natural Language Applications of Description Logics, Connections between Description Logics and Databases, and the Future of Description Logics and Description Logic Systems. The session on Foundations of Description Logics concentrated on computational properties of description logics, correspondences between description logics and other formalisms, and on semantics of description logics, Similarly, there is discussion on how to develop tractable desription logics, for some notion of tractable, and whether it is useful to worry about achieving tractability at all. Several of the participants argued in favour of a very expressive description logic. This obviously precludes tractability or even decidability of complete reasoning. Klaus Schild proposed that for some purposes one could employ "model checking" (i .e., a closed world assumption) instead of "theorem proving," and has shown that this is still tractable for very large languages. Maurizio Lenzerini's opinion was that it is important to have decidable languages. Tractability cannot be achieved in several application areas because there one needs very expressive constructs: e.g., axioms, complex role constructors, and cycles with fixed-point semantics. For Bob MacGregor, not even decidability is an issue since he claims that Loom's incomplete reasoner is sufficient for his applications. The discussion addressed the question of whether there is still need for foundations, and whether the work on foundation done until now really solved the problems that the designers of early DL systems had. Both questions were mostly answered in the affirmative, with the caveat that new research on foundations should make sure that it is concerned with "real" problems, and not just generates new problems. In the session on Architecture of Description Logics and Description Logic Systems the participants considered different ways of putting together description logics and description logic systems. One way of doing this is to have a different kind of inference strategy for description logics, such as one based on intuitionistic logics or one based directly on rules of inference-thus allowing variant systems. Another way of modifying description logic systems is to divide them up in different ways, such as making a terminology consist of a schema portion and a view portion. Some discussion in this session concerned whether architectures should be influenced by application areas, or even by particular applications. There was considerable discussion at the workshop on how Description Logics should be extended or expanded to make them more useful. There are several methods to do this. The first is to extend the language of descriptions, e.g ., to represent n-ary relations, temporal information, or whole-part relationships, all of which were discussed at the workshop. The second is to add in another kind of reasoning, such as default reasoning, while still keeping the general framework of description logic reasoning. The third is to incorporate descriptions or description-like constructs in a larger reasoner, such as a first order reasoner. This was the approach taken in OMEGA and is the approach being taken in the Loom project. There have been many extensions of the first two kinds proposed for description logics, including several presented at the workshop. One quest ion discussed at the workshop was whether these extensions fit in well with the philosophy of description logic. Another question was whether the presence of many proposals for extensions means that description logics are easy to expand, or that description logics are inadequate representation formalisms? The general consensus was that description logics adequately capture a certain kind of core reasoning and that they lend themselves to incorporation with other kinds of reasoning. Care must be taken, however, to keep the extended versions true to the goals of description logics. The sessions on Applications of Description Logics had presentations on applications of description logics in various areas, including configuration, tutoring, natural language processing, and domain modeling. Most of these applications are research applications, funded by government research programs. There was discussion of what is needed to have more fielded applications of description logics. The session on Connections between Description Logics and Databases considered three kinds of connections between Description Logics and Databases: 1. using Description Logics for expressing database schemas, including local schemas, integrated schemas, and views, integrity constraints, and queries; 2. using Description Logic reasoning for various database-related reasoning, including schema integration and validation, and query optimization, and query validation and organization; and 3. making Description Logic reasoners more like Database Mangagement Systems via optimization. All three of these connections are being actively investigated by the description logic community. The panel session on the Future of Description Logics and Description Logic Systems discussed where the future of description logics will lie. There seems to be a consensus that description logics must forge tighter connections with other formalisms, such as databases or object-oriented systems. In this way, perhaps, description logics will find more real applications

Sistemas RFID UHF

Mestrado em Engenharia Eletrónica e TelecomunicaçõesO interesse por sistemas de identificação por radiofrequência (RFID) tem aumentado de forma significativa nos últimos anos, principalmente na identificação e tracking de objectos, animais e pessoas através de um modo de comunicação sem fios. Esta comunicação é feita por ondas de rádio que são transmitidas por um leitor, através de uma antena a um identificador (etiqueta) que atribui a um objeto uma identidade única, o chamado código de identificação único. Esta tecnologia não só identifica, mas também armazena dados atribuídos a determinado objeto, animal ou pessoa. No entanto, o RFID apresenta ainda consideráveis limitações, que inviabilizam o seu uso. Duas importantes razões que tornam esta tecnologia menos interessante _e o seu excessivo custo, causado não só pelos preços dos leitores e das antenas, mas também pelo preço do processo de fabrico das etiquetas; e devido ao facto de serem usados leitores não-reconfiguráveis a novos protocolos de comunicação, novas etiquetas ou até mesmo alterações de frequências. O primeiro objetivo deste projeto foi então desenvolver um front end de radiofrequência para a construção de um leitor RFID UHF reconfigurável de baixo custo, baseado em circuitos programáveis DSP ou FPGA, com um processador embutido e software-defined radio. Com isto pretende-se que os leitores RFID não dependam de transceivers RFID comerciais. Além disso, com este estudo pretendeu-se também a desenvolver antenas e etiquetas RFID, em material orgânico flexível, com um processo de produção de etiquetas simples e de baixo custo. Na primeira parte deste projeto, foi proposto um front end para a banda RFID UHF Europeia e para a banda Americana, que poderá ser usado, no futuro, no desenvolvimento de um leitor RFID. Este front end foi desenhado para ser robusto, de baixo custo, e com o objetivo de emitir e receber sinais de rádio. Na segunda parte, foram desenvolvidas duas antenas para leitores, uma para a banda RFID UHF Americana e outra para a banda RFID UHF Europeia. Por _ultimo, foi alterada uma impressora convencional, comercialmente disponível, e foram feitas também alterações na tinta de impressão, tornando-a condutora, para impressão de antenas para etiquetas RFID em substratos _a base de papel. Todos os parâmetros fundamentais das antenas foram simulados numericamente e testados experimentalmente. As duas antenas testadas mostraram boas performances, em particular, a antena para a banda RFID UHF Europeia, cujos valores resultantes dos testes experimentais foram muitos similares aos encontrados computacionalmente, sendo mesmo melhores para alguns parâmetros. Esta antena, não só apresentou uma boa performance na banda mencionada, mas também na banda RFID UHF Americana. Foram desenvolvidas sete etiquetas RFID, ou seja, desenhadas e impressas usando a impressora jato de tinta modificada, e testadas posteriormente. Todas as etiquetas funcionaram, embora uma delas não tenha apresentado resultados tão satisfatórios. Podemos então concluir que a nossa tecnologia permitiu ter etiquetas impressas por uma impressora convencional e, desta forma, poderá oferecer uma maior independência ás empresas que as produzem, podendo mesmo ser utilizada em ambientes de I&D, em Universidades ou Escolas, de modo simples e barato.In recent years, Radio Frequency IDentification (RFID) technology has received special attention, especially for identifying and tracking objects, animals and people through a wireless communication connection. Radio waves transmitted from a reader, through an antenna to an identifier, called tag, which attributes an Unique Identification Number (UID) to a object, animal or person are used for this communication. This technology not only helps to identify, but also to collect data attributes about a certain person or object. However, RFID still has important limitations, which slows down its growth considerably. The two main reasons for that are related not only with the excessive cost of this system due to the readers and antennas, but also because it uses non-reconfigurable readers to new communication protocols, tags or even changes in frequencies. Therefore, the first purpose of this project was to develop a front-end to be included into a low-cost reconfigurable RFID UHF reader, based on FPGA or DSP, with an embedded processor and a software-defined radio. In a long-term, it is intended to have readers that does not require commercial RFID transceivers. The second purpose of this study was to develop a simple and low-cost manufacturing process of antennas and tags in exible and organic material. Firstly, a front end for RFID UHF bandwidth across the European Union and in the North America was proposed to be implemented in the future. This front end was designed to be low-cost, robust, in order to emit and receive radio signals. Secondly, two antennas, respectively, for an American and European UHF bandwidth RFID reader were developed in this project. Ultimately, an ordinary home inkjet-printer was modified to jet conductive ink, created as a part of this study, to print tag antennas in paper based substrate. All of the fundamental parameters that needed to be evaluated for antennas were experimentally simulated and tested for the two antennas. Both showed high performances, particularly, the antenna for a European UHF bandwidth RFID reader. This antenna obtained results more similar to the numerical model, and experimental findings were even better for some parameters. Its performance was found to be high even for an American UHF bandwidth RFID reader. Furthermore, seven RFID tags were developed, meaning they were designed and printed on the modified home inkjet-printer, and then its performance was tested. Although one of these tags showed not to be highly efficient, all tags worked adequately for the purpose. Therefore, we can conclude that our technology allowed to print RFID tags using a modified home inkjet-printer, indicating that this method can offer more independency to RFID tag manufacturers and, also allow an extensive use of this system in I&D environment, University or Schools, since it is simple and cheap

Gas Sensors on Plastic Foil with Reduced Power Consumption for Wireless Applications

Recently, there is a growing interest in developing so-called "smart" RFID tags for logistic applications. These smart tags incorporate sensing devices to monitor environmental parameters such as humidity and temperature throughout the supply chain. To fulfill these requirements cost-effectively, RFID tags were produced on plastic foil through large scale manufacturing techniques. To benefit from sensing capabilities on these systems, the integration of gas sensors directly produced on plastic foil was explored. Their gas sensing performances were investigated when fabricated on same polymeric substrates than the labels. To be compatible with wireless applications, all sensors were designed to operate in the sub-milliwatt power range. The integration of three different transducers on plastic foil for the detection of different gaseous species was investigated. First, the direct use of the PET or PEN foil as an optical waveguide for the fabrication of a selective colorimetric ammonia gas sensor was carried out. It led to a simplified processing based on additive fabrication techniques compatible with large scale manufacturing. Second, the impact of miniaturization on drop-coated metal-oxide gas sensors when fabricated on polyimide foil on their sensing performances was investigated. They took advantage from the low thermal conductivity of the substrate to reduce the power consumption with a simplified processing. The detection of oxidizing and reducing gases was achieved at low power consumption when pulsing the sensors. Lastly, the benefits brought by the gas absorption in a polyimide foil were exploited with the design of a simple capacitive structure. By operating it in a differential mode with a second functionalized capacitor, the discrimination between low-concentrations of volatile organic compounds and humidity was achieved. The design and fabrication of these sensors were developed with a vision of their future production performed by large scale manufacturing techniques. The gas sensing performances of all three transducers were assessed and revealed sensitivities comparable to standard devices made on silicon. Each sensor was associated with low-power electronics targeting an integration on wireless systems. The concept of a smart gas sensing system was demonstrated with the interfacing of a capacitive humidity sensor on a passive RFID label

The LOGIDATA- Prototype System

In this paper we present a prototype system developed within LOGIDATA-/-, a national project funded by the Italian National Research Council (CNR). The prototype supports a rule based language on a data model with structured data types, object identity and sharing. The system has an interactive user interface, with a unit of interaction consisting of a LOGIDATA-/- program, used to extract information from the knowledge base and/or modify the schema. A program consists of a set of rules, and of additional directives to handle the data output and/or the updates to the schema. The intermediate results and the updates to the schema, affect a temporary working environment connected to the working session, but can also be saved in a (user or global) permanent environment. The system uses LOA (LOGIDATA+ Object Algebra) as an intermediate internal language. User programs are compiled, with a set of transformations including rewriting and stratification, and then translated into LOA programs, i.e. sequences of fixpoint systems of algebraic equations. The object oriented schema is mapped into a relational schema, and the database is actually managed by a relational DBMS, that provides the basic support for the permanent storage of data as well as for concurrency control and recovery. The object algebra expressions can then be mapped into relational algebra expressions, thus relying on the efficiency of the RDBMS for the access to mass storage structures and the efficient execution of set-oriented operations. Moreover a main memory database has been included in the architecture, to improve the performance in the evaluation of the fixpoint systems, by keeping in main memory the intermediate results