Brands can be defined as psychological constructs residing in our minds. By analyzing brand associations, we can study the mental constructs around them. In this paper, we study brands as parts of an ...associative network based on a word association database. We explore the communities–closely-knit groups in the mind–around brand names in this structure using two community detection algorithms in the Hungarian word association database ConnectYourMind. We identify brand names inside the communities of a word association network and explain why these brand names are part of the community. Several detected communities contain brand names from the same product category, and the words in these categories were connected either to brands in the category or to words describing the product category. Based on our findings, we describe the mental position of brand names. We show that brand knowledge, product knowledge and real word knowledge interact with each other. We also show how the meaning of a product category arises and how this meaning is related to brand meaning. Our results suggest that words sharing the same community with brand names can be used in brand communication and brand positioning.
Full text
Available for:
DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, SIK, UILJ, UKNU, UL, UM, UPUK
As environmental awareness is becoming increasingly important, alternatives are needed for the traditional forward product flows of supply chains. The field of reverse logistics covers activities ...that aim to recover resources from their final destination, and acts as the foundation of the efficient backward flow of these materials. Designing the appropriate reverse logistics network for a given field is a crucial problem, as this provides the basis for all operations connected to the resource flow. This paper focuses on design questions in the supply network of waste wood, dealing with its collection and transportation to designated processing facilities. The facility location problem is studied for this use-case, and mathematical models are developed that consider economies of scale and the robustness of the problem. A novel approach based on bilevel optimization is used for computing the exact solutions of the robust problem on smaller instances. A local search and a tabu search method is also introduced for solving problems of realistic sizes. The developed models and methods are tested both on real-life and artificial instance sets in order to assess their performance.
Full text
Available for:
CEKLJ, EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
A confluent and terminating reduction system is introduced for graphs, which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost ...linear time. The König property is investigated in the context of reduction by introducing the König deficiency of a graph
G
as the difference between the vertex covering number and the matching number of
G
. It is shown that the problem of finding the König deficiency of a graph is NP-complete even if we know that the graph reduces to the empty graph. Finally, the König deficiency of graphs
G
having a vertex
v
such that
G
-
v
has a unique perfect matching is studied in connection with reduction.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
In this paper, we provide a simple forward-looking approach to compare rating methods with respect to their stability over time. Given a rating vector of entities involved in the comparison and a ...ranking indicated by the rating, the stability of the methods is measured by the change in rating vector and ranks of the entities over time from a forward-looking perspective. We investigate various linear algebraic rating methods and use the Euclidean distance and Kendall tau rank correlation to measure their stability in rating and ranking, respectively. The investigations are based on both rolling and expanding window approaches. We apply the methodology to sports as a widely known ranking and rating environment. The results suggest that PageRank and Massey rating methods provide better rating and ranking stability than simple methods, such as winning percentage, and more advanced ones, such as Colley’s least square and Keener’s eigenvector-based method. Finally, a simple way to examine the potential predictive power of the rating methods is also provided.
The detection and analysis of protein complexes is essential for understanding the functional mechanism and cellular integrity. Recently, several techniques for detecting and analysing protein ...complexes from Protein–Protein Interaction (PPI) dataset have been developed. Most of those techniques are inefficient in terms of detecting, overlapping complexes, exclusion of attachment protein in complex core, inability to detect inherent structures of underlying complexes, have high false-positive rates and an enrichment analysis. To address these limitations, we introduce a special structural-based weighted network approach for the analysis of protein complexes based on a Weighted Edge, Core-Attachment and Local Modularity structures (WECALM). Experimental results indicate that WECALM performs relatively better than existing algorithms in terms of accuracy, computational time, and p-value. A functional enrichment analysis also shows that WECALM is able to identify a large number of biologically significant protein complexes. Overall, WECALM outperforms other approaches by striking a better balance of accuracy and efficiency in the detection of protein complexes.
Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form of networks. In ...this paper we utilize known contact patterns from a public transit assignment model in a major metropolitan city, and propose the development of two novel network structures, each of which elucidate certain aspects of passenger travel behavior. We first propose the development of a transfer network, which can reveal passenger groups that travel together on a given day. Second, we propose the development of a community network, which is derived from the transfer network, and captures the similarity of travel patterns among passengers. We then explore the application of each of these network structures to identify the most frequently used travel paths, i.e., routes and transfers, in the public transit system, and model epidemic spreading risk among passengers of a public transit network, respectively. In the latter our conclusions reinforce previous observations, that routes crossing or connecting to the city center in the morning and afternoon peak hours are the most “dangerous” during an outbreak.
Aim
This study outlines an efficient weighted network centrality measure approach and its application in network pharmacology for exploring mechanisms of action of the
Ruellia prostrata
(RP) and
...Ruellia bignoniiflora
(RB) herbal formula for treating rheumatoid arthritis.
Method
In our proposed method we first calculated interconnectivity scores all the network targets then computed weighted centrality score for all targets to identify of major network targets based on centrality score. We apply our technology to network pharmacology by constructing herb-compound-putative target network; compound-putative targets-RA target network; and imbalance multi-level herb-compound-putative target-RA target-PPI network. We then identify the major targets in the network based on our centrality measure approach. Finally we validated the major identified network targets using the enrichment analysis and a molecular docking simulation.
Result
The results reveled our proposed weighted network centrality approach outperform classical centrality measure in identification of influential nodes in four real complex networks based on SI model simulation. Application of our approach to network pharmacology shows that 57 major targets of which 33 targets including 8 compositive compounds, 15 putative target and 10 therapeutic targets played an important role in the network and directly linked to rheumatoid arthritis. Enrichment analysis confirmed that putative targets were frequently involved in TNF, CCR5, IL-17 and G-protein coupled receptors signaling pathways which are critical in the progression of rheumatoid arthritis. The molecular docking simulation indicated four targets had significant binding affinity to major protein targets. Glyceryl diacetate-2-Oleate and Oleoyl chloride showed the best binding affinity to all targets proteins and were within Lipinski limits. ADMET prediction also confirm both compounds had no toxic effect on human hence potential lead drug compounds for treating rheumatoid arthritis.
Conclusion
This study developed an efficient weighted network centrality approach as tool for identification of major network targets. Network pharmacology findings provides promising results that could lead us to design and discover of alternative drug compounds. Though our approach is a purely in silico method, clinical experiments are required to test and validate the hypotheses of our computational methods.
This article introduces the schedule assignment problem for public transit, which aims to assign vehicle blocks of a planning period to buses in the fleet of a transportation company. This assignment ...has to satisfy several constraints, the most important of which is compatibility, meaning that certain blocks can only be serviced by buses belonging to given types. Other constraints come from the fact that the problem considers a long-term plan for several days or weeks, which means that daily parking and periodic maintenance activities also have to be taken into account. We give a state-expanded multi-commodity flow network for the above problem. This model takes parking constraints into account, and also assigns preventive maintenance tasks to buses after serving blocks for a fixed amount of time. The solutions of this model are presented for real-life and randomly generated instances.
Full text
Available for:
BFBNIB, GIS, IJS, KISLJ, NUK, PNG, UL, UM, UPUK
Mass timber construction systems, incorporating engineered wood products as structural elements, are gaining acceptance as a sustainable alternative to multi-story concrete or steel-frame structures. ...The relative novelty of these systems brings uncertainties on whether these buildings perform long-term as expected. Consequently, several structural health monitoring (SHM) projects have recently emerged to document their behavior. A wide and systematic use of this data by the mass timber industry is currently hindered by limitations of SHM programs. These limitations include scalability, difficulty of data integration, diverse strategies for data collection, scarcity of relevant data, complexity of data analysis, and limited usability of predictive tools. This perspective paper envisions the use of avatars as a Web-based layer on top of sensing devices to support SHM data and protocol interoperability, analysis, and reasoning capability and to improve life cycle management of mass timber buildings. The proposed approach supports robustness, high level and large-scale interoperability and data processing by leveraging the Web protocol stack, overcoming many limitations of conventional centralized SHM systems. The design of avatars is applied in an exemplary scenario of hygrothermal data reconstruction, and use of this data to compare different mold growth prediction models. The proposed approach demonstrates the ability of avatars to efficiently filter and enrich data from heterogeneous sensors, thus overcoming problems due to data gaps or insufficient spatial distribution of sensors. In addition, the designed avatars can provide prediction or reasoning capability about the building, thus acting as a digital twin solution to support building lifecycle management.
Copy number variation (CNV) is a form of structural variation in the human genome that provides medical insight into complex human diseases; while whole-genome sequencing is becoming more affordable, ...whole-exome sequencing (WES) remains an important tool in clinical diagnostics. Because of its discontinuous nature and unique characteristics of sparse target-enrichment-based WES data, the analysis and detection of CNV peaks remain difficult tasks. The Savitzky–Golay (SG) smoothing is well known as a fast and efficient smoothing method. However, no study has documented the use of this technique for CNV peak detection. It is well known that the effectiveness of the classical SG filter depends on the proper selection of the window length and polynomial degree, which should correspond with the scale of the peak because, in the case of peaks with a high rate of change, the effectiveness of the filter could be restricted. Based on the Savitzky–Golay algorithm, this paper introduces a novel adaptive method to smooth irregular peak distributions. The proposed method ensures high-precision noise reduction by dynamically modifying the results of the prior smoothing to automatically adjust parameters. Our method offers an additional feature extraction technique based on density and Euclidean distance. In comparison to classical Savitzky–Golay filtering and other peer filtering methods, the performance evaluation demonstrates that adaptive Savitzky–Golay filtering performs better. According to experimental results, our method effectively detects CNV peaks across all genomic segments for both short and long tags, with minimal peak height fidelity values (i.e., low estimation bias). As a result, we clearly demonstrate how well the adaptive Savitzky–Golay filtering method works and how its use in the detection of CNV peaks can complement the existing techniques used in CNV peak analysis.
PDF
