The Experts below are selected from a list of 3123 Experts worldwide ranked by ideXlab platform

P. Godlewski - One of the best experts on this subject based on the ideXlab platform.

  • Performance evaluation of a dynamic resource allocation algorithm for UMTS-TDD systems
    VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026), 2000
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the microcellular environment is investigated for the UMTS-TDD access scheme in the case of packet allocation. The concept of a bunch as a group of cells strongly interconnected is studied and its ability to cope with bursty interference is evaluated through simulations in the Manhattan environment.

  • Resource Allocation for Integrated Voice/WWW Traffic in UMTS/TDD Systems
    Multiaccess Mobility and Teletraffic in Wireless Communications: Volume 4, 1999
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the micro-cellular environment is investigated for the UMTS TD-CDMA access scheme. Integrated voice and bursty data (e.g. WWW sessions) transmission is studied. Then the performance of a dynamic resource allocation is evaluated through simulations.

  • Dynamic resource allocation for packet transmission in UMTS TDD-CDMA systems
    1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363), 1999
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the micro-cellular environment is investigated for the UMTS TDD access scheme in the case of packet allocation. The concept of bunch as a group of cells strongly interconnected is studied and its ability to cope with bursty interference is evaluated through simulations in a Manhattan environment.

Y. Sakai - One of the best experts on this subject based on the ideXlab platform.

  • A case study on freshness based scoring for fresh information retrieval
    IEEE International Symposium on Communications and Information Technology 2004. ISCIT 2004., 2004
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    For most businesses, fresh information retrieval is very important. However, it is difficult for conventional search engines based on Centralized Architecture to retrieve really fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site independently makes an index. As a result, distributed search engines can retrieve really fresh information. However, fast indexing is not enough to easily retrieve fresh information. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance; so, we proposed FTF-IDF (fresh term frequency multiplied by inverse document frequency) as a scoring method that considers both freshness and relevance. In this paper, we describe a verification of FTF-IDF on an actual Web diary.

  • AINA (1) - FTF-IDF scoring for fresh information retrieval
    18th International Conference on Advanced Information Networking and Applications 2004. AINA 2004., 2004
    Co-Authors: N. Sato, M. Euhara, Y. Sakai
    Abstract:

    For most businesses, fresh information retrieval is very important. However, it is difficult for conventional search engines based on Centralized Architecture to retrieve really fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site independently makes an index. As this result, distributed search engines can retrieve really fresh information. However, fast indexing is not enough to easily retrieve fresh information. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance; so, we proposed FTFIDF (fresh term frequency multiplied by inverse document frequency) as a scoring method that considers both freshness and relevance.

  • DEXA Workshops - Temporal information retrieval in cooperative search engine
    14th International Workshop on Database and Expert Systems Applications 2003. Proceedings., 2003
    Co-Authors: N. Sato, Masae Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-data, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support fro temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose a content-based comparison method to avoid spamming.

  • IRAL - Temporal Ranking for Fresh Information Retrieval
    Proceedings of the sixth international workshop on Information retrieval with Asian languages -, 2003
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support for temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose an implementation of temporal ranking.

  • Temporal information retrieval in cooperative search engine
    14th International Workshop on Database and Expert Systems Applications 2003. Proceedings., 2003
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-data, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support fro temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose a content-based comparison method to avoid spamming.

Borja Vidal - One of the best experts on this subject based on the ideXlab platform.

  • All-Fiber Centralized Architecture for Parallel Terahertz Sensors
    IEEE Transactions on Terahertz Science and Technology, 2015
    Co-Authors: Alexander Bockelt, Jesus Palací López, Borja Vidal
    Abstract:

    The use of optical fiber for signal distribution and remote operation of a set of parallel inspection units based on THz time-domain spectroscopy is presented and analyzed. A Centralized approach with optical source-sharing simplifies the implementation and cost of nondestructive inspection platforms, where several sensing units have to work in the same facility, such as factories and security controls. The cost of such a distribution system is evaluated, its feasibility experimentally demonstrated, and key features relevant to the system performance are discussed.

  • all fiber Centralized Architecture for parallel terahertz sensors
    IEEE Transactions on Terahertz Science and Technology, 2015
    Co-Authors: Alexander Bockelt, Jesus Lopez, Borja Vidal
    Abstract:

    ENSING instruments exploiting the THz band (0.3–10 THz) offer an attractive approach to nondestructive inspection of a wide range of materials with applications in an increasingly extensive variety of industries: in-line monitoring of plastics, compounds, glass, and paper; analytical sciences; biological, pharmaceutical, and medical sciences; quality control; and environmental monitoring; security [1], [2]. In many cases, these instruments sense features that are not accessible with sensors working in other spectral regions such as the optical, infrared or X-ray bands or complement the information obtained by these. Since THz radiation is located between the microwave and the optical regions of the electromagnetic spectrum, they exhibit merits of both bands: good penetration depth as well as submillimeter resolution. When exposed to terahertz radiation, neither scanned objects nor operators run considerable damage or health risk as opposed to X-ray-based inspection systems. Additionally, many materials that are opaque in the visible and near-infrared regime (such as plastics, paper, cardboard, and textiles) are transparent in the THz region, while many other materials present characteristic spectroscopic fingerprints in this band. Thus, the THz band allows the inspection of materials inside conventional packages. THz sources may be broadly classified depending on the generation technologiesas follows: up-conversion from microwave

C. Mihailescu - One of the best experts on this subject based on the ideXlab platform.

  • Performance evaluation of a dynamic resource allocation algorithm for UMTS-TDD systems
    VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026), 2000
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the microcellular environment is investigated for the UMTS-TDD access scheme in the case of packet allocation. The concept of a bunch as a group of cells strongly interconnected is studied and its ability to cope with bursty interference is evaluated through simulations in the Manhattan environment.

  • Resource Allocation for Integrated Voice/WWW Traffic in UMTS/TDD Systems
    Multiaccess Mobility and Teletraffic in Wireless Communications: Volume 4, 1999
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the micro-cellular environment is investigated for the UMTS TD-CDMA access scheme. Integrated voice and bursty data (e.g. WWW sessions) transmission is studied. Then the performance of a dynamic resource allocation is evaluated through simulations.

  • Dynamic resource allocation for packet transmission in UMTS TDD-CDMA systems
    1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363), 1999
    Co-Authors: C. Mihailescu, Xavier Lagrange, P. Godlewski
    Abstract:

    The benefit of a locally Centralized Architecture for resource allocation and management in the micro-cellular environment is investigated for the UMTS TDD access scheme in the case of packet allocation. The concept of bunch as a group of cells strongly interconnected is studied and its ability to cope with bursty interference is evaluated through simulations in a Manhattan environment.

N. Sato - One of the best experts on this subject based on the ideXlab platform.

  • A case study on freshness based scoring for fresh information retrieval
    IEEE International Symposium on Communications and Information Technology 2004. ISCIT 2004., 2004
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    For most businesses, fresh information retrieval is very important. However, it is difficult for conventional search engines based on Centralized Architecture to retrieve really fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site independently makes an index. As a result, distributed search engines can retrieve really fresh information. However, fast indexing is not enough to easily retrieve fresh information. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance; so, we proposed FTF-IDF (fresh term frequency multiplied by inverse document frequency) as a scoring method that considers both freshness and relevance. In this paper, we describe a verification of FTF-IDF on an actual Web diary.

  • AINA (1) - FTF-IDF scoring for fresh information retrieval
    18th International Conference on Advanced Information Networking and Applications 2004. AINA 2004., 2004
    Co-Authors: N. Sato, M. Euhara, Y. Sakai
    Abstract:

    For most businesses, fresh information retrieval is very important. However, it is difficult for conventional search engines based on Centralized Architecture to retrieve really fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site independently makes an index. As this result, distributed search engines can retrieve really fresh information. However, fast indexing is not enough to easily retrieve fresh information. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance; so, we proposed FTFIDF (fresh term frequency multiplied by inverse document frequency) as a scoring method that considers both freshness and relevance.

  • DEXA Workshops - Temporal information retrieval in cooperative search engine
    14th International Workshop on Database and Expert Systems Applications 2003. Proceedings., 2003
    Co-Authors: N. Sato, Masae Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-data, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support fro temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose a content-based comparison method to avoid spamming.

  • IRAL - Temporal Ranking for Fresh Information Retrieval
    Proceedings of the sixth international workshop on Information retrieval with Asian languages -, 2003
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support for temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose an implementation of temporal ranking.

  • Temporal information retrieval in cooperative search engine
    14th International Workshop on Database and Expert Systems Applications 2003. Proceedings., 2003
    Co-Authors: N. Sato, M. Uehara, Y. Sakai
    Abstract:

    In business, the retrieval of up-to-data, or fresh, information is very important. It is difficult for conventional search engines based on a Centralized Architecture to retrieve fresh information, because they take a long time to collect documents via Web robots. In contrast to a Centralized Architecture, a search engine based on a distributed Architecture does not need to collect documents, because each site makes an index independently. As a result, distributed search engines can be used to retrieve fresh information. However, fast indexing alone is not enough to retrieve fresh information, as support fro temporal information based retrieval is also required. In this paper, we describe temporal information retrieval in distributed search engines. In particular, we propose a content-based comparison method to avoid spamming.