Abstract Purpose: To investigate contemporary results of percutaneous transluminal renal angioplasty (PTRA). Materials and Methods: A multicentre retrospective study analysing all patients treated with PTRA for primary symptomatic renal artery stenosis (RAS) between 2010 and 2013 at four tertiary centres. Procedures during the preceding four years were counted to evaluate for change in PTRA frequency. Results: The number of PTRA procedures decreased by approximately 50% from 2006 to 2013. Patients treated in the post-ASTRAL period (n = 224) had a significant reduction in mean systolic pressure (168 to 146 mmHg, p < 0.01), diastolic pressure (84 to 76 mmHg, p < 0.01), number of anti-hypertensive drugs (3.54 to 3.05, p < 0.01), and anti-hypertensive treatment index (21.75 to 16.92, p < 0.01) compared to before PTRA. These improvements were maintained at one year and at the last clinical evaluation after a mean follow-up of 4.31 years. Renal function increased transiently without sustained improvement, or deterioration, during later follow-up. Thirteen patients (5.8%) eventually required dialysis, nine of these had eGFR <20 ml/min/1.73 m2 before PTRA. There was no difference in outcomes between subgroups differentiated by different indications for PTRA. Conclusion: The frequency of PTRA has decreased, indicating a higher threshold for invasive treatment of RAS in recent years. The reduction in blood pressures, the reduced need for anti-hypertensive medication, and stabilization of renal function over time suggest a clinical benefit for most patients who are now being treated with PTRA.

We present a simple method to quickly explore C-spaces of robotic manipulators and thus facilitate path planning. The method is based on a novel geometrical structure called generalized bur. It is a star-like tree, rooted at a given point in free C-space, with an arbitrary number of guaranteed collision-free edges computed using distance information from the workspace and simple forward kinematics. Generalized bur captures large portions of free C-space, enabling accelerated exploration. The workspace is assumed to be decomposable into a finite set of (possibly overlapping) convex obstacles. When plugged in a suitable RRT-like planning algorithm, generalized burs enable significant performance improvements, while at the same time enabling exact collision-free paths.

The need for the exact overview of technology, which is the target for some purposes is often very crucial. Patent databases provide nowadays very suitable source of data and information which can be further analyzed. Global overview is thus possible to provide for any kind of technology. Smart Furniture is a very used term recently, which is related to current trends such as digitization, smart city or internet of things. Within these phenomena, Smart Furniture is used in different contexts, and so its concept is not clarified. The aim of the article is to show the technology analysis of Smart Furniture based on the patent data analysis and literature analysis by clustering and visualization. The definition of Smart Furniture was recently provided in literature based on previous research which was undertaken based on searching in scientific and patent databases. Thus, the term is defined by its technical properties and parameters. This definition is put into the context of actual trends of patents content with selected future trends. A patent analysis was undertaken between 20 October 2019 and 09 November 2019, while the Web of Science database was included, which was searched by keywords that included the phrase "Smart Furniture" and variants. Patent searching was performed in the PatentInspiration database. In total 31 articles from scientific database and 491 patent applications were examined against strict criteria containing meaningful definitions of Smart Furniture. Based on the analysis of key technologies and properties, clustering of results and their further analysis, it was found that the concept of smart furniture is specific to the following components: intelligent system, controller operated with user's data and energy sources, sensors and actuators.

The information sharing among vehicles provides intelligent transport applications in the Internet of Vehicles (IoV), such as self-driving and traffic awareness. However, due to the openness of the wireless communication (e.g., DSRC), the integrity, confidentiality and availability of information resources are easy to be hacked by illegal access, which threatens the security of the related IoV applications. In this paper, we propose a novel Risk Prediction-Based Access Control model, named RPBAC, which assigns the access rights to a node by predicting the risk level. Considering the impact of limited training datasets on prediction accuracy, we first introduce the Generative Adversarial Network (GAN) in our risk prediction module. The GAN increases the items of training sets to train the Neural Network, which is used to predict the risk level of vehicles. In addition, focusing on the problem of pattern collapse and gradient disappearance in the traditional GAN, we develop a combined GAN based on Wasserstein distance, named WCGAN, to improve the convergence time of the training model. The simulation results show that the WCGAN has a faster convergence speed than the traditional GAN, and the datasets generated by WCGAN have a higher similarity with real datasets. Moreover, the Neural Network (NN) trained with the datasets generated by WCGAN and real datasets (NN-WCGAN) performs a faster speed of training, a higher prediction accuracy and a lower false negative rate than the Neural Network trained with the datasets generated by GAN and real datasets (NN-GAN), and the Neural Network trained with the real datasets (NN). Additionally, the RPBAC model can improve the accuracy of access control to a great extent.

The HERe2Cure project, which involved a group of breast cancer experts, members of multidisciplinary tumor boards (MTB) from health-care institutions in Bosnia and Herzegovina, was initiated with the aim of defining an optimal approach to the diagnosis and treatment of HER2 positive breast cancer. After individual multidisciplinary consensus meetings were held in all oncology centers in Bosnia and Herzegovina, a final consensus meeting was held to reconcile the final conclusions discussed in individual meetings. Guidelines were adopted by consensus, based on the presentations and suggestions of experts, which were first discussed in a panel discussion and then agreed electronically between all the authors mentioned. The conclusions of the panel discussion represent the consensus of experts in the field of breast cancer diagnosis and treatment in Bosnia and Herzegovina. The objectives of the guidelines include the standardization, harmonization, and optimization of the procedures for the diagnosis, treatment, and monitoring of patients with HER2-positive breast cancer, all of which should lead to an improvement in the quality of health care of mentioned patients. The initial treatment plan for patients with HER2-positive breast cancer must be made by a MTB comprised of at least: A medical oncologist, a pathologist, a radiologist, a surgeon, and a radiation oncologist/radiotherapist.

Abstract The aim of this research is to segment foreign tourists to Sarajevo based on the frequency of visits in order to make a distinction between first-time and repeat foreign tourists. The purpose is to discover if repeat foreign tourists have more positive intention to revisit and recommend Sarajevo, if they have more positive attitude towards overall satisfaction with tourist destination and if they have more positive opinion about the general quality of this tourist destination offer than first-time foreign tourists. The study used a quantitative approach for research. The survey sample is a convenience sample of 250 foreign tourists who visited Sarajevo during the winter (from December 10, 2018 to January 31, 2019). To achieve scientific relevance, during the analysis and interpretation of the obtained data, descriptive statistics and Mann–Whitney U test were used. The results showed that there was no statistically significant difference, and that first-time and repeat foreign tourists had the same intention of recommending Sarajevo, had a positive attitude towards the overall satisfaction of the tourist destination and had the same opinion about the general quality of this tourist destination offer. The results also indicated that repeat foreign tourists had more positive intention to revisit Sarajevo.

In this short paper, we present goDASH, an infrastructure for headless streaming of HTTP adaptive streaming (HAS) video content, implemented in the language golang, an open-source programming language supported by Google. goDASH's main functionality is the ability to stream HAS content without decoding actual video (headless player). This results in low memory requirements and the ability to run multiple players in a large-scale-based evaluation setup. goDASH comes complete with numerous state-of-the-art HAS algorithms, and is fully written in the Google golang language, which simplifies the implementation of new adaptation algorithms and functions. goDASH supports two transportation protocols Transmission Control Protocol (TCP) and Quick UDP Internet Connections (QUIC). The QUIC protocol is a relatively new protocol with the promise of performance improvement over the widely used TCP. We believe that goDASH is the first emulation-based HAS player that supports QUIC. The main limitation in using QUIC protocol is the need for a security certificate setup on both ends (client and server) as QUIC demands an encrypted connection. This limitation is eased by providing our own testbed framework, known as goDASHbed. This framework uses a virtual environment to serve video content locally (which allows setting security certificates) through the Mininet virtual emulation tool. As part of Mininet, goDASH can be used in conjunction with other traffic generators.

The growth of online video-on-demand consumption continues unabated. Existing heuristic-based adaptive bit-rate (ABR) selection algorithms are typically designed to optimise video quality within a very narrow context. This may lead to video streaming providers implementing different ABR algorithms/players, based on a network connection, device capabilities, video content, etc., in order to serve the multitude of their users' streaming requirements. In this paper, we present SMASH: a Supervised Machine learning approach to Adaptive Streaming over HTTP, which takes a tentative step towards the goal of a one-size-fits-all approach to ABR. We utilise the streaming output from the adaptation logic of nine ABR algorithms across a variety of streaming scenarios (generating nearly one million records) and design a machine learning model, using systematically selected features, to predict the optimal choice of the bitrate of the next video segment to download. Our evaluation results show that SMASH guarantees a high QoE with consistent performance across a variety of streaming contexts.

LS-DYNA is a well-known multiphysics code with both explicit and implicit time stepping capabilities. Implicit simulations rely heavily on sparse matrix computations, in particular direct solvers, and are notoriously much harder to scale than explicit simulations. In this paper, we investigate the scalability challenges of the implicit structural mode of LS- DYNA. In particular, we focus on linear constraint analysis, sparse matrix reordering, symbolic factorization, and numerical factorization. Our problem of choice for this study is a thermomechanical simulation of jet engine models built by Rolls-Royce with up to 200 million degrees of freedom, or equations. The models are used for engine performance analysis and design optimization, in particular optimization of tip clearances in the compressor and turbine sections of the engine. We present results using as many as 131,072 cores on the Blue Waters Cray XE6/XK7 supercomputer at NCSA and the Titan Cray XK7 supercomputer at OLCF. Since the main focus is on general linear algebra problems, this work is of interest for all linear algebra practitioners, not only developers of implicit finite element codes.