Results 111 to 120 of about 1,460 (284)
An asymptotic approximation for TCP CUBIC
In this paper, we derive an expression for computing the average window size of a single TCP CUBIC connection under random losses. For this we consider a throughput expression for TCP CUBIC computed earlier under deterministic periodic packet losses.
Sharma, Vinod, Poojary, Sudheer
core +1 more source
Abstract Graph drawing aesthetics have traditionally been optimized for human readers, leading to well‐established principles such as reducing edge crossings, enhancing symmetry, and minimizing bends. These criteria shape layout algorithms and define what “readability” means in network visualization.
Sara Di Bartolomeo +5 more
wiley +1 more source
Geometry‐Aware Alignment and Comparison of Hierarchical Morse Complexes with Applications
Abstract Scalar fields derived from 3D X‐ray CT scans of samples undergoing ex situ processes, such as thermal aging, chemical etching, or mechanical stress, pose unique challenges for characterizing similarities and differences across acquisitions. Typically, a sample A (source) is imaged, removed, and subjected to experimental conditions that alter ...
Aniketh Venkat +3 more
wiley +1 more source
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Limit Non-Stationary Behavior of Large Closed Queuing Networks With Bottlenecks
In this paper martingale methods are applied for analyzing asymptotes of queuing lengths of servers. We consider closed Jackson networks consisting of a large number of customers, an infinite server, and several single servers.
Yi-ju Chao
core
Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Compound geometric approximation under a failure rate constraint
We consider compound geometric approximation for a nonnegative, integer-valued random variable W. The bound we give is straightforward but relies on having a lower bound on the failure rate of W.
Daly, Fraser A, Fraser Daly
core +1 more source
Abstract The aim of this paper is to analyze the sociodemographic compositions and labor market entry of low‐educated youth in Japan. The paper specifically focuses on whether vocational education provides a safety net for labor market insecurities during an era of educational expansion.
Katsunori Ogawa
wiley +1 more source
Approximate analysis of load-dependent generally distributed queuing
In this paper, we present an approximate method for solution of load-dependent, closed queuing networks having general service time distributions with low variability. The proposed technique is an extension of Marie's (1980) method. In the methodology, conditional throughputs are obtained by an iterative procedure.
Ekren, BY, Heragu, SS
openaire +2 more sources
Cash for Transactions or Store‐of‐Value? A Comparative Study on Scandinavian Countries and Canada
ABSTRACT We estimate the demand for transactional and non‐transactional cash balances (banknotes and coins) in Canada, Denmark, Iceland, Sweden and Norway over the last decades exploiting the seasonality of cash demand. These countries share many features that are relevant for cash demand, but nevertheless show large differences in terms of aggregate ...
Carl Andreas Claussen +2 more
wiley +1 more source

