Search results for "NETWORKING"
showing 10 items of 1776 documents
Seaport competitiveness research: the past, present and future
2019
This study presents a review of articles with a focus on seaport competitiveness from the maritime literature. We investigated how port competitiveness research has evolved during the last two decades using bibliometric citation analysis tools and techniques. Bibliography data, collected from the ISI Web of Science database, consisted of 267 research papers by 465 authors in 117 journals. Based on citation analysis, we identified the key universities, journals and articles and their impact on port competitiveness research. Also, seven key research streams with few sub-streams were revealed as a result of a mixed co-citation and in-depth content analysis of the most cited articles. A bibliom…
Encapsulation of black mulberry microcuttings: studies on capsules and synthetic seeds
2017
The encapsulation technology for plant tissue culture can be an efficient tool to optimize the plant management systems and to preserve valuable plant germplasm. In this paper, two experiments were carried out to evaluate the encapsulation efficiency in mulberry (Morus nigra L.). In the first experiment, gel capsules were stored at 4°C for different times (0, 30, 90, 180 and 360 days). The highest percentage of shoot viability (82.5%) and regrowth (72.5%) was scored after 180 days of storage, with an average development of 2.5 shoots/capsule. The second experiment was aimed to point out an efficient protocol to turn the capsules of black mulberry in synthetic seeds ready to develop into who…
Konforme Abbildung und Greensche Funktion
1949
Mit Hilfe des Additionstheorems Gl. (I, 31) und mit Hilfe der imaginaren Transformation von Jacobi Gl. (I, 33) folgt fur die durch die Funktion λ = sn (z, k) vermittelte, Abbildung der z-Ebene auf die λ-Ebene $$\lambda = {\lambda _1} + i{\lambda _2} = snz = sn\left( {x + iy} \right) = \frac{{snxcniydniy + sniycnxdnx}}{{1 - {k^2}s{n^2}xs{n^2}iy}}$$ .
Peer-to-peer cooperative GNSS-based localization for stationary reference nodes in wireless sensor networks
2017
Most localization algorithms in wireless sensor networks rely on a few reference nodes with known locations to estimate the locations of unknown nodes. The locations of reference nodes can be either manually configured or, more practically, obtained by means of some satellite-based positioning system(s). However, satellite-based locations may be inaccurate and imprecise, which results in reduced location accuracy of localization algorithms. This paper proposes a peer-to-peer cooperative GNSS-based localization algorithm for stationary reference nodes to improve their relative location accuracy and precision. The algorithm applies simple statistical methods and GNSS-based information from mu…
Hybrid P2P schemes for remote terrain interactive visualization systems
2013
Over the last few years, there has been a lot of development of interactive terrain visualization applications using remote databases. One of the main problems that these applications must face is scalability. These applications usually use a client-server model that cannot support a large number of concurrent requests without using a considerable number of servers. In this paper, we present a full comparative study of new hybrid P2P schemes for terrain interactive visualization systems. The performance evaluation results show that the best strategy consists of avoiding the periodical reporting among peer nodes about the current information contained in each node, while using some servers a…
Massively Parallel ANS Decoding on GPUs
2019
In recent years, graphics processors have enabled significant advances in the fields of big data and streamed deep learning. In order to keep control of rapidly growing amounts of data and to achieve sufficient throughput rates, compression features are a key part of many applications including popular deep learning pipelines. However, as most of the respective APIs rely on CPU-based preprocessing for decoding, data decompression frequently becomes a bottleneck in accelerated compute systems. This establishes the need for efficient GPU-based solutions for decompression. Asymmetric numeral systems (ANS) represent a modern approach to entropy coding, combining superior compression results wit…
Massively Parallel Huffman Decoding on GPUs
2018
Data compression is a fundamental building block in a wide range of applications. Besides its intended purpose to save valuable storage on hard disks, compression can be utilized to increase the effective bandwidth to attached storage as realized by state-of-the-art file systems. In the foreseeing future, on-the-fly compression and decompression will gain utmost importance for the processing of data-intensive applications such as streamed Deep Learning tasks or Next Generation Sequencing pipelines, which establishes the need for fast parallel implementations. Huffman coding is an integral part of a number of compression methods. However, efficient parallel implementation of Huffman decompre…
Security and Privacy in Wireless IoT
2018
The 13 articles in this special section focus on security and privacy in wireless Internet of Things (IoT). IoT is a paradigm that involves networked physical objects with embedded technologies to collect, communicate, sense, and interact with the external environment through wireless or wired connections. With rapid advancements in IoT technology, the number of IoT devices is expected to surpass 50 billion by 2020, which has also drawn the attention of attackers who seek to exploit the merits of this new technology for their own benefits. There are many potential security and privacy threats to IoT, such as attacks against IoT systems and unauthorized access to private information of end u…
Rings for Privacy: an Architecture for Large Scale Privacy-Preserving Data Mining
2021
This article proposes a new architecture for privacy-preserving data mining based on Multi Party Computation (MPC) and secure sums. While traditional MPC approaches rely on a small number of aggregation peers replacing a centralized trusted entity, the current study puts forth a distributed solution that involves all data sources in the aggregation process, with the help of a single server for storing intermediate results. A large-scale scenario is examined and the possibility that data become inaccessible during the aggregation process is considered, a possibility that traditional schemes often neglect. Here, it is explicitly examined, as it might be provoked by intermittent network connec…
Combining congested-flow isolation and injection throttling in HPC interconnection networks
2011
Existing congestion control mechanisms in interconnects can be divided into two general approaches. One is to throttle traffic injection at the sources that contribute to congestion, and the other is to isolate the congested traffic in specially designated resources. These two approaches have different, but non-overlapping weaknesses. In this paper we present in detail a method that combines injection throttling and congested-flow isolation. Through simulation studies we first demonstrate the respective flaws of the injection throttling and of flow isolation. Thereafter we show that our combined method extracts the best of both approaches in the sense that it gives fast reaction to congesti…