GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Inderscience Publishers ; 2021
    In:  International Journal of Mobile Communications Vol. 19, No. 6 ( 2021), p. 683-
    In: International Journal of Mobile Communications, Inderscience Publishers, Vol. 19, No. 6 ( 2021), p. 683-
    Type of Medium: Online Resource
    ISSN: 1470-949X , 1741-5217
    RVK:
    Language: English
    Publisher: Inderscience Publishers
    Publication Date: 2021
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    EDP Sciences ; 2023
    In:  RAIRO - Operations Research Vol. 57, No. 3 ( 2023-05), p. 1267-1284
    In: RAIRO - Operations Research, EDP Sciences, Vol. 57, No. 3 ( 2023-05), p. 1267-1284
    Abstract: Motivated by the soaking process under separate heating mode in iron and steel enterprises, we study the parallel batch machine scheduling problem with incompatible deteriorating jobs. The objective is to minimize makespan. A soaking furnace can be seen as a parallel batch processing machine. In order to avoid the thermal stress caused by excessive temperature difference, initial temperature is needed for the ingot before processing. With the increasing of waiting time, the ingot temperature decreases and the soaking time increases. This property is called deterioration. Setup time is needed between incompatible jobs. We show that if jobs have the same sizes, an optimal solution can be found within O ( n log n ) time. If jobs have identical processing times, the problem is proved to be NP-hard in the strong sense. We propose an approximate algorithm whose absolute and asymptotic worst-case ratios are less than 2 and 11/9, respectively. When the jobs have arbitrary sizes and arbitrary processing times, the model is also NP-hard in the strong sense. An approximate algorithm with an absolute and asymptotic worst-case ratio less than 2 is proposed. The time complexity is O ( n log n ).
    Type of Medium: Online Resource
    ISSN: 0399-0559 , 2804-7303
    RVK:
    Language: English
    Publisher: EDP Sciences
    Publication Date: 2023
    detail.hit.zdb_id: 1468388-X
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2020
    In:  AStA Advances in Statistical Analysis Vol. 104, No. 4 ( 2020-12), p. 577-596
    In: AStA Advances in Statistical Analysis, Springer Science and Business Media LLC, Vol. 104, No. 4 ( 2020-12), p. 577-596
    Type of Medium: Online Resource
    ISSN: 1863-8171 , 1863-818X
    RVK:
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2020
    detail.hit.zdb_id: 2277258-3
    detail.hit.zdb_id: 2276384-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Hindawi Limited ; 2018
    In:  Mobile Information Systems Vol. 2018 ( 2018-12-05), p. 1-10
    In: Mobile Information Systems, Hindawi Limited, Vol. 2018 ( 2018-12-05), p. 1-10
    Abstract: In this paper, the resource allocation problem for device-to-device (D2D) communications underlaying cellular networks is formulated and analyzed. In our scenario, we consider that the number of D2D user equipment (DUE) pairs is far larger than that of cellular user equipments (CUEs). Meanwhile, the resource blocks are divided into two types: resource blocks for CUEs and the ones for CUEs and DUEs. Firstly, the system model is presented, and the resource allocation problem is formulated. Then, a resource allocation scheme based on the genetic algorithm is proposed. To overcome the problem that the dedicated resource is not fully shared in the genetic algorithm, an improved harmony search algorithm is proposed for resource allocation. Finally, the analysis and simulation results show that the performances of the proposed genetic algorithm and the improved harmony search algorithm outperform than that of the random algorithm and are very close to that of the exhaustive algorithm. This result can provide an effective optimization for resource allocation of D2D communications.
    Type of Medium: Online Resource
    ISSN: 1574-017X , 1875-905X
    RVK:
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2018
    detail.hit.zdb_id: 2187808-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Hindawi Limited ; 2017
    In:  Mobile Information Systems Vol. 2017 ( 2017), p. 1-13
    In: Mobile Information Systems, Hindawi Limited, Vol. 2017 ( 2017), p. 1-13
    Abstract: Mobile-Edge Computing (MEC) is a novel and sustainable network architecture that enables energy conservation with cloud computing and network services offloading at the edge of mobile cellular networks. However, how to efficiently manage various real-time changing security functions is an essential issue which hinders the future MEC development. To address this problem, we propose a fuzzy security service chaining approach for MEC. In particular, a new architecture is designed to decouple the required security functions with the physical resources. Based on this, we present a security proxy to support compatibility to traditional security functions. Furthermore, to find the optimal order of the required security functions, we establish a fuzzy inference system (FIS) based mechanism to achieve multiple optimal objectives. Much work has been done to implement a prototype, which is used to analyze the performance by comparing with a widely used method. The results prove that the proposed FIS mechanism achieves an improved performance in terms of Inverted Generational Distance (IGD) values and execution time with respect to the compared solution.
    Type of Medium: Online Resource
    ISSN: 1574-017X , 1875-905X
    RVK:
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2017
    detail.hit.zdb_id: 2187808-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2016
    In:  INFORMS Journal on Computing Vol. 28, No. 4 ( 2016-11), p. 687-702
    In: INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 28, No. 4 ( 2016-11), p. 687-702
    Abstract: For a cost-sharing cooperative game with an empty core, we study the problem of calculating a near-optimal cost allocation that satisfies coalitional stability constraints and maximizes the total cost allocated to all players. One application of such a problem is finding the minimum level of subsidy required to stabilize the grand coalition. To obtain solutions, we propose a new generic framework based on Lagrangian relaxation, which has several advantages over existing work that exclusively relies on linear programming (LP) relaxation techniques. Our approach can generate better cost allocations than LP-based algorithms, and is also applicable to a broader range of problems. To illustrate the efficiency and performance of the Lagrangian relaxation framework, we investigate two different facility location games. The results demonstrate that our new approach can find better cost allocations than the LP-based algorithm, or provide alternative optimal cost allocations for cases that the LP-based algorithm can also solve to optimality.
    Type of Medium: Online Resource
    ISSN: 1091-9856 , 1526-5528
    RVK:
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2016
    detail.hit.zdb_id: 2070411-2
    detail.hit.zdb_id: 2004082-9
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Emerald ; 2024
    In:  Tourism Review Vol. 79, No. 2 ( 2024-02-06), p. 408-427
    In: Tourism Review, Emerald, Vol. 79, No. 2 ( 2024-02-06), p. 408-427
    Abstract: Los rumores negativos dañan la imagen del destino y la experiencia del turista. Este estudio compara cómo afectan las fuentes de corrección de rumores (gobierno vs empresas vs turista) en el comportamiento cívico online de los usuarios (CCOU). Diseño/metodología/enfoque Sobre la base del marco estímulo-organismo-respuesta, se estableció un modelo hipotético desde la corrección de rumores hasta el CCOU. Se diseñaron tres escenarios experimentales (más de 1.000 muestras válidas). El Estudio 1 ilustró los efectos de las diferentes correcciones de rumores, el Estudio 2 se diseñó para verificar los efectos mediadores de la simpatía y la autenticidad percibida de la información (API), y la solidez de los resultados se demostró en el Estudio 3. Hallazgos La corrección del gobierno obtuvo la mayor simpatía y API. La corrección de la empresa despertó menos simpatía que la corrección del turista, pero fue mejor para generar API. La simpatía y la API tuvieron un efecto mediador en la relación entre la corrección del rumor y el CCOU. Implicaciones practices Ayuda a identificar las diferentes ventajas de los correctores de rumores y proporciona información para prevenir el deterioro de los rumores turísticos negativos o incluso revertir estas crisis. Originalidad/valor Proporciona una nueva perspectiva de investigación de la gobernanza del rumor turístico negativo, amplía la comprensión del efecto y el proceso de corrección de rumores y enriquece el contenido de la investigación de la comunicación de crisis turísticas.
    Type of Medium: Online Resource
    ISSN: 1660-5373 , 1660-5373
    RVK:
    Language: English
    Publisher: Emerald
    Publication Date: 2024
    detail.hit.zdb_id: 2412174-5
    SSG: 3,2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Hindawi Limited ; 2022
    In:  Mobile Information Systems Vol. 2022 ( 2022-7-30), p. 1-12
    In: Mobile Information Systems, Hindawi Limited, Vol. 2022 ( 2022-7-30), p. 1-12
    Abstract: With the rapid development of the new manufacturing industry, 3D printing technology continues to make new technological breakthroughs, and new works emerge in the manufacturing, medical, construction, military, and other application fields. However, for ceramic materials, there are still many problems to be solved in 3D printing. In this study, a dual-scale lightweight interactive model based on lofted surface and periodic parameter curve embedding is proposed for ceramic 3D printing. Users can model and manufacture lofted surfaces with small-scale geometric textures. For the two closed curves entered by the user, the intermediate section sampling points are generated by interpolation between them, and the shape of the current surface is adjusted under ceramic 3D printing manufacturing constraints such as no support and path non-interference. complete large-scale surface modeling based on lofted surfaces. Then the straight line path between the sampling points is replaced by a periodic curve path, and the small-scale geometric texture modeling is completed by adjusting the period and amplitude of the curve function. Finally, each section sampling point is spirally connected layer by layer and directly generats a single continuous printing path and manufacture. The experimental results show that the tool provides users with sufficient modeling space and high efficiency of model generation and effectively generates G-code files with textured lofted surfaces that can directly print ceramic 3D. It can also avoid the collision between printer nozzles and printing models and can be directly used in 3D printing and manufacturing based on clay materials.
    Type of Medium: Online Resource
    ISSN: 1875-905X , 1574-017X
    RVK:
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2022
    detail.hit.zdb_id: 2187808-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Inderscience Publishers ; 2021
    In:  International Journal of Mobile Communications Vol. 19, No. 1 ( 2021), p. 1-
    In: International Journal of Mobile Communications, Inderscience Publishers, Vol. 19, No. 1 ( 2021), p. 1-
    Type of Medium: Online Resource
    ISSN: 1470-949X , 1741-5217
    RVK:
    Language: English
    Publisher: Inderscience Publishers
    Publication Date: 2021
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Hindawi Limited ; 2016
    In:  Mobile Information Systems Vol. 2016 ( 2016), p. 1-12
    In: Mobile Information Systems, Hindawi Limited, Vol. 2016 ( 2016), p. 1-12
    Abstract: With the advent of “Internet of Everything” (IoE) age, an excessive number of IoE services are emerging on the web, which places a heavy burden on the service selection decision of target users. In this situation, various recommendation techniques are introduced to alleviate the burden, for example, Collaborative Filtering- (CF-) based recommendation. Generally, CF-based recommendation approaches utilize similar friends or similar services to achieve the recommendation goal. However, due to the sparsity of user feedback, it is possible that a target user has no similar friends and similar services; in this situation, traditional CF-based approaches fail to produce a satisfying recommendation result. Besides, recommendation accuracy would be decreased if time factor is overlooked, as IoE service quality often varies with time. In view of these challenges, a time-aware service recommendation approach named S e r _ R e c t i m e is proposed in this paper. Concretely, we first calculate the time-aware user similarity; afterwards, indirect friends of the target user are inferred by Social Balance Theory (e.g., “enemy’s enemy is a friend” rule); finally, the services preferred by indirect friends of the target user are recommended to the target user. At last, through a set of experiments deployed on dataset WS-DREAM, we validate the feasibility of our proposal.
    Type of Medium: Online Resource
    ISSN: 1574-017X , 1875-905X
    RVK:
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2016
    detail.hit.zdb_id: 2187808-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...