Wyniki wyszukiwania dla: GRAPH PROCESSING - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: GRAPH PROCESSING

Filtry

wszystkich: 288
wybranych: 272

wyczyść wszystkie filtry


Filtry wybranego katalogu

  • Kategoria

  • Rok

  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Wyniki wyszukiwania dla: GRAPH PROCESSING

  • Determining and verifying the safety integrity level of the safety instrumented systems with the uncertainty and security aspects

    Safety and security aspects consist of two different group of functional requirements for the control and protection systems. In the paper it is proposed that the security analysis results can be used as a factor increasing or decreasing the risk level. It concerns a process of determining required safety integrity level of given safety functions. The authors propose a new approach for functional safety risk analysis. In this case...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm

    The paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Emotion Recognition from Physiological Channels Using Graph Neural Network

    In recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...

    Pełny tekst do pobrania w portalu

  • Energy-Efficient Self-Supervised Technique to Identify Abnormal User Over 5G Network for E-Commerce

    Within the realm of e-commerce networks, it is frequently observed that certain users exhibit behavior patterns that differ substantially from the normative behaviors exhibited by the majority of users. The identification of these atypical individuals and the understanding of their behavioral patterns are of significant practical significance in maintaining order on e-commerce platforms. One such method for accomplishing this objective...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets

    This paper continues the work by Wang et al. [17]. Its goal is to verify the robustness of the NGCF (Neural Graph Collaborative Filtering) technique by assessing its ability to generalize across different datasets. To achieve this, we first replicated the experiments conducted by Wang et al. [17] to ensure that their replication package is functional. We received sligthly better results for ndcg@20 and somewhat poorer results for...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Energy-Efficient Self-Supervised Technique to Identify Abnormal User Over 5G Network for E-Commerce

    Publikacja

    - Rok 2024

    Within the realm of e-commerce networks, it is frequently observed that certain users exhibit behavior patterns that differ substantially from the normative behaviors exhibited by the majority of users. The identification of these atypical individuals and the understanding of their behavioral patterns are of significant practical significance in maintaining order on e-commerce platforms. One such method for accomplishing this...

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

    Publikacja

    In this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Method of evaluation of lubricating ability of lube oils and fuels in energetistic formulation

    Publikacja

    The paper presents an interpretation of operation of a boundary layer of a lubricating medium. A model of the homogeneous Poisson process has been proposed to assess the deterioration process of the layer's operation. The assessment considers the original interpretation of operation of a boundary layer, as a lubricity measure of a boundary layer of any lubricant. In the submitted proposal the operation of a boundary layer is understood...

    Pełny tekst do pobrania w portalu

  • Experimental and theoretical investigation of conformational states and noncovalent interactions in crystalline sulfonamides with a methoxyphenyl moiety

    Publikacja

    - CRYSTENGCOMM - Rok 2021

    Four sulfonamide derivatives with a methoxyphenyl moiety, namely N-{4-[(2-methoxyphenyl)sulfamoyl] phenyl}acetamide (1a), N-{4-[(3-methoxyphenyl)sulfamoyl]phenyl}acetamide (1b), 4-amino-N-(2- methoxyphenyl)benzenesulfonamide (2a) and 4-amino-N-(3-methoxyphenyl)benzenesulfonamide (2b), have been synthesized and characterized physiochemically by CHNS, MS, FT-IR, 1H NMR, 13C NMR, PXRD and TG methods. Crystal structures were determined...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Collision-Free Network Exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - Rok 2014

    A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Detecting type of hearing loss with different AI classification methods: a performance review

    Publikacja
    • M. Kassjański
    • M. Kulawiak
    • T. Przewoźny
    • D. Tretiakow
    • J. Kuryłowicz
    • A. Molisz
    • K. Koźmiński
    • A. Kwaśniewska
    • P. Mierzwińska-Dolny
    • M. Grono

    - Rok 2023

    Hearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Distributed graph searching with a sense of direction

    In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...

    Pełny tekst do pobrania w portalu

  • Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs

    Publikacja

    - Rok 2022

    The problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Stereo vision with Equal Baseline Multiple Camera Set (EBMCS) for obtaining depth maps of plants

    This paper presents a method of improving the estimation of distances between an autonomous harvesting robot and plants with ripe fruits by using the vision system based on five cameras. The system is called Equal Baseline Multiple Camera Set (EBMCS). EBMCS has some features of a camera matrix and a camera array. EBMCS is regarded as a set of stereo cameras for estimating distances by obtaining disparity maps and depth maps. This...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Multi-Criteria Approach in Multifunctional Building Design Process

    Publikacja

    - Rok 2017

    The paper presents new approach in multifunctional building design process. Publication defines problems related to the design of complex multifunctional buildings. Currently, contemporary urban areas are characterized by very intensive use of space. Today, buildings are being built bigger and contain more diverse functions to meet the needs of a large number of users in one capacity. The trends show the need for recognition of...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Clonal selection in discrete optimization

    Publikacja

    - Rok 2009

    W rozprawie zajmujemy się efektywnymi metodami przybliżonego rozwiązywania problemów optymalizacji dyskretnej, a w szczególności algorytmami opartymi na metodzie selekcji klonalnej (SK), należącymi do kategorii sztucznych systemów immunologicznych. Techniki optymalizacji to znaczące pole badań w informatyce, a niektóre ze starszych technik, takie jak algorytmy genetyczne, symulowane wyżarzanie czy przeszukiwanie tabu, stały się...

  • Algorytm ekstrakcji cech biometrycznych twarzy

    Publikacja

    W referacie zawarto opis metody automatycznej lokalizacji oraz parametryzacji punktów charakterystycznych w obrazie twarzy. Do lokalizacji punktów charakterystycznych wykorzystano zmodyfikowany algorytm EBGM (ang. Elastic Bunch Graph Matching). Algorytm ten pozwala lokalizować punkty w obrazie przy założeniu niezmienności topologii grafu połączeń między nimi.W referacie przedstawiono podstawy teoretyczne metody oraz zaimplementowany...

  • SMART SHOP SERVICES FOR BUILDING CUSTOMER-ORIENTED SCENARIOS

    Publikacja

    The shops of today mostly support the customer by offering him or her products based on basic relationships between products viewed or ordered by users with similar tastes. This common approach may fail in many cases especially when the user does not have sufficient knowledge about the market, or when he or she wants to build a set of products in more than one shop. New categories of smart shop services are proposed in order to...

    Pełny tekst do pobrania w portalu

  • Brief Announcement: Energy Constrained Depth First Search

    Publikacja

    - Rok 2018

    Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A Framework for Searching in Graphs in the Presence of Errors

    Publikacja

    - Rok 2019

    We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling of compatible jobs on parallel machines

    Publikacja

    - Rok 2021

    The dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...

  • Agent-based social network as a simulation of a market behaviour

    Publikacja

    - Rok 2010

    Recent years and the outbreak of world's economic crisis in 2008 proved the crucial importance of reliable analysis of market dynamics. However, werarely apply models of proper detail level (the global prosperity forecast of 2007 can be seen as a grim proof). The behaviour of individuals and companies is far from being ideal and rational. Many claims that the economic paradigm of rational expectations (coming from J. Muth and R....