Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

There are many resources and services in grid environment which may be distributed geographically. So, resource discovery methods with lower update and discovery costs are of vital significance. The centralized methods have the advantage of improved management of nodes, but in a grid with large number of nodes and resources, a bottleneck is caused in the server, which reduces the system efficac...

BACKGROUND AND AIMS Wild soybean (Glycine soja), a native species of East Asia, is the closest wild relative of the cultivated soybean (G. max) and supplies valuable genetic resources for cultivar breeding. Analyses of the genetic variation and population structure of wild soybean are fundamental for effective conservation studies and utilization of this valuable genetic resource. METHODS In ...

Because small dual-task costs with ideomotor-compatible tasks do not necessarily indicate the absence of a bottleneck, M.-C. Lien, R. S. McCann, E. Ruthruff, and R. W. Proctor (2005) considered additional sources of evidence regarding bottleneck bypass. This evidence argued against complete bottleneck bypass and, instead, supported an engage-bottleneck-later model in which early bottleneck subs...

Deep neural networks (DNNs) have shown extraordinary performance in recent years for various applications including image classification, object detection, speech recognition, natural language processing, etc. Accuracydriven DNN architectures tend to increase the model sizes and computations at a very fast pace, demanding massive amount of hardware resources. Frequent communication between proc...

Co-clustering has emerged as an important approach for mining contingency data matrices. We present a novel approach to co-clustering based on the Information Bottleneck principle, called Information Bottleneck Co-clustering (IBCC), which supports both soft-partition and hardpartition co-clusterings, and leverages an annealing-style strategy to bypass local optima. Existing co-clustering method...

The first positive trend is the slowing of global population growth. There is a significant shift in global fertility that will enable us at least to think about moving to a world of near stable populations within a century, maybe sooner. Fertility in about 40 per cent of the world’s countries is now below the replacement rate. Another 40 per cent are experiencing continued downward movement of...

A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...

We describe the diagnosis and treatment of bottlenecks in computer systems using decison theoretic techniques. The techniques rely on a high-level functional model of the interaction between application workloads, the operating system (Windows NT), and system hardware. Given a workload description, the model predicts the values of system counters observable with the Windows NT performance monit...