The effect of social networks on the development of gastronomy – the way forward to the development of gastronomy tourism in Serbia

Purpose: To evaluate some of the current discussions about the possible impacts of social networks on the development of gastronomy in the Republic of Serbia. There could be either positive and/or negative impacts and this viewpoint provides some reflection on what the future might hold for some if not many tourism destinations in Serbia and the region when the tourism industry restarts after the pandemic of Covid-19 virus. Design/methodology/approach: The research was conducted in December 2021, on a total of 244 respondents in three cities in Serbia. SPSS software was used, version 26.00, and the obtained data were analyzed by descriptive statistics. Then, to determine the structure of the questionnaire and the percentage of variance, an exploratory factor analysis was performed together with a higher order factor analysis, in order to obtain the desired number of factors. Subsequently, the authors used multiple regression analysis to confirm the significance of the predictors. The goal of the research was to determine whether, and to what extent, social networks can predict the choice of restaurants and gastronomic offers in Serbia. Serbian gastronomy has a great influence on the development of tourism, so this research has a wide scientific and practical contribution. Findings: This paper provides a context and viewpoint on the possible implications of impacts of social networks on the development of gastronomy in the Republic of Serbia in the future. It has been proven that social networks can have an impact on the development of gastronomy and tourism itself. Research limitations/implications: To examine the impact of social networks on the development of gastronomy, the authors conducted a survey online due to the current Covid-19 pandemic. The limitation of this research was precisely that the authors did not have the opportunity to conduct the research live due to the Covid-19 pandemic. It is recommended that such surveys be conducted live in direct contact with respondents in the future in order to obtain a larger sample with fully completed questionnaires. Practical implications: The importance of social networks is increasingly a topic of study of world research, especially when it comes to gastronomy, which is becoming increasingly important as an activity in the tourism industry. The results indicate that the greatest importance in predicting the choice of restaurants and gastronomic offers has social networks and marketing. The importance of the work is reflected in the recognition of the importance of social networks, in order to better place Serbian gastronomy. Social implications: This paper offers a synthesis of views that fosters an understanding of the possibility of impacts of social networks on the development of gastronomy in the Republic of Serbia before and after the Covid-19 pandemic. Originality/value: The viewpoint proffered in this paper provides scope for a rapid evaluation of the current status of gastronomy tourism in Serbia which can help practitioners and researchers in the faster and better development of gastronomy and tourism

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view

Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems

The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev)

Antibody-mediated PCSK9 neutralization worsens outcome after bare-metal stent implantation in mice

AIMS Despite advances in pharmacotherapy and device innovation, in-stent restenosis (ISR) and stent thrombosis (ST) remain serious complications following percutaneous coronary intervention (PCI) procedure with stent implantation. Proprotein convertase subtilisin/kexin type 9 (PCSK9) is an enzyme involved in plasma cholesterol homeostasis and recently emerged as a therapeutic target for hypercholesterolemia. Antibody-based PCSK9 inhibition is increasingly used in different subsets of patients, including those undergoing PCI. However, whether PCSK9 inhibition affects outcome after stent implantation remains unknown. METHODS AND RESULTS 12 to 14 weeks old C57Bl/6 mice underwent carotid artery bare-metal stent implantation. Compared to sham intervention, stent implantation was associated with increased expression of several inflammatory mediators, including PCSK9. The increase in PCSK9 protein expression was confirmed in the stented vascular tissue, but not in plasma. To inhibit PCSK9, alirocumab was administered weekly to mice before stent implantation. After 6 weeks, histological examination revealed increased intimal hyperplasia in the stented segment of alirocumab-treated animals compared to controls. In vitro, alirocumab promoted migration and inhibited the onset of senescence in primary human vascular smooth muscle cells (VSMC). Conversely, it blunted the migration and increased the senescence of endothelial cells (EC). CONCLUSION Antibody-based PCSK9 inhibition promotes in-stent intimal hyperplasia and blunts vascular healing by increasing VSMC migration, while reducing that of EC. This effect is likely mediated, at least in part, by a differential effect on VSMC and EC senescence. The herein-reported data warrant additional investigations concerning the use of PCSK9 inhibitors in patients undergoing PCI with stent implantation

BOREALIS: Building Block for Sealed Bid Auctions on Blockchains

We focus on securely computing the ranks of sealed integers distributed among $n$ parties. For example, we securely compute the largest or smallest integer, the median, or in general the $k^{th}$-ranked integer. Such computations are a useful building block to securely implement a variety of sealed-bid auctions. Our objective is efficiency, specifically low interactivity between parties to support blockchains or other scenarios where multiple rounds are time-consuming. Hence, we dismiss powerful, yet highly-interactive MPC frameworks and propose BOREALIS, a special-purpose protocol for secure computation of ranks among integers. BOREALIS uses additively homomorphic encryption to implement core comparisons, but computes under distinct keys, chosen by each party to optimize the number of rounds. By carefully combining cryptographic primitives, such as ECC Elgamal encryption, encrypted comparisons, ciphertext blinding, secret sharing, and shuffling, BOREALIS sets up systems of multi-scalar equations which we efficiently prove with Groth-Sahai ZK proofs. Therewith, BOREALIS implements a multi-party computation of pairwise comparisons and rank zero-knowledge proofs secure against malicious adversaries. BOREALIS completes in at most $4$ rounds which is constant in both bit length $\ell$ of integers and the number of parties $n$. This is not only asymptotically optimal, but surpasses generic constant-round secure multi-party computation protocols, even those based on shared-key fully homomorphic encryption. Furthermore, our implementation shows that BOREALIS is very practical. Its main bottleneck, ZK proof computations, is small in practice. Even for a large number of parties ($n=200$) and high-precision integers ($\ell=32$), computation time of all proofs is less than a single Bitcoin block interval

HIF-driven SF3B1 induces KHK-C to enforce fructolysis and heart disease.

Fructose is a major component of dietary sugar and its overconsumption exacerbates key pathological features of metabolic syndrome. The central fructose-metabolising enzyme is ketohexokinase (KHK), which exists in two isoforms: KHK-A and KHK-C, generated through mutually exclusive alternative splicing of KHK pre-mRNAs. KHK-C displays superior affinity for fructose compared with KHK-A and is produced primarily in the liver, thus restricting fructose metabolism almost exclusively to this organ. Here we show that myocardial hypoxia actuates fructose metabolism in human and mouse models of pathological cardiac hypertrophy through hypoxia-inducible factor 1α (HIF1α) activation of SF3B1 and SF3B1-mediated splice switching of KHK-A to KHK-C. Heart-specific depletion of SF3B1 or genetic ablation of Khk, but not Khk-A alone, in mice, suppresses pathological stress-induced fructose metabolism, growth and contractile dysfunction, thus defining signalling components and molecular underpinnings of a fructose metabolism regulatory system crucial for pathological growth

A trust architecture for blockchain in IoT

Blockchain is a promising technology for establishing trust in IoT networks, where network nodes do not necessarily trust each other. Cryptographic hash links and distributed consensus mechanisms ensure that the data stored on an immutable blockchain can not be altered or deleted. However, blockchain mechanisms do not guarantee the trustworthiness of data at the origin. We propose a layered architecture for improving the end-to-end trust that can be applied to a diverse range of blockchain-based IoT applications. Our architecture evaluates the trustworthiness of sensor observations at the data layer and adapts block verification at the blockchain layer through the proposed data trust and gateway reputation modules. We present the performance evaluation of the data trust module using a simulated indoor target localization and the gateway reputation module using an end-to-end blockchain implementation, together with a qualitative security analysis for the architecture.</p

Hierarchical consensus: A horizontal scaling framework for blockchains

We present the Filecoin Hierarchical Consensus framework, which aims to overcome the throughput challenges of blockchain consensus by horizontally scaling the network. Unlike traditional sharding designs, based on partitioning the state of the network, our solution centers on the concept of subnets -which are organized hierarchically- and can be spawned on-demand to manage new state. Child sub nets are firewalled from parent subnets, have their own specific policies, and run a different consensus algorithm, increasing the network capacity and enabling new applications. Moreover, they benefit from the security of parent subnets by periodically checkpointing state. In this paper, we introduce the overall system architecture, our detailed designs for cross-net transaction handling, and the open questions that we are still exploring

Folk theorems on the correspondence between state-based and event-based systems

Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in concurrency theory. Both models are commonly believed to be equi-expressive. One can find many ad-hoc embeddings of one of these models into the other. We build upon the seminal work of De Nicola and Vaandrager that firmly established the correspondence between stuttering equivalence in Kripke Structures and divergence-sensitive branching bisimulation in Labelled Transition Systems. We show that their embeddings can also be used for a range of other equivalences of interest, such as strong bisimilarity, simulation equivalence, and trace equivalence. Furthermore, we extend the results by De Nicola and Vaandrager by showing that there are additional translations that allow one to use minimisation techniques in one semantic domain to obtain minimal representatives in the other semantic domain for these equivalences