We present an algorithm for multi-hop routing and scheduling of requests in wireless networks in the SINR model. The goal of our algorithm is to maximize the throughput or maximize the minimum ratio between the flow and the demand. Our algorithm partitions the links into buckets. Every bucket consists of a set of links that have nearly equivalent reception powers. We denote the number of nonemp...

Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and produces an equivalent network with one less variable and one new constraint (the join of the variable bucket). This process is iterated until every variable is eliminated, and then all solutions can be computed without backtracking. A direct, naive imple...

Four sampling methods that included A-Vac, D-Vac, pole-bucket, and beat-net devices were evaluated for estimating relative densities of glassy-winged sharpshooter, Homalodisca vitri-pennis (Germar) (Hemiptera: Cicadellidae) nymphs and adults on citrus (Citrus spp.) trees. All four methods produced similar temporal and spatial distribution profiles, although significant differences in quantities...

Timing has a key role in several traffic control functions encountered in modern packet-switched networks. In order to be effective, a timing unit must provide fine resolution, be simple to implement and scale well with the number of controlled traffic streams. This paper addresses the design, implementation and evaluation of a timing unit that can support accurate and efficient implementations...

The hierarchical approach to production planning is classically used to handle the organization and logistics in complex production systems. It distinguishes several decision levels using different descriptions of the production process. The upper-level planning horizon is relatively long, and, since the number of time intervals (or buckets) of this horizon is restricted by computational limita...

3 Querying Encrypted Data 7 3.1 Bucket-Based Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 Hash-Based Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3 B+ Trees Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.4 Other Approaches . . . . . . . . . . . . ...

We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive trees and permutations, which relates the arising edge-weights in recursive trees with inversions of the corresponding permutations. Using this bijection we obtain exact and limiting distribution results for the number ...

In this paper are presented some theoretical and experimental research on the kinematics of planting seedlings vertical disc type buckets, variant directly in cultivated soil, that must ensure correlation between working speed equipment periphery bucket, so seedling is planted an upright position. After a brief presentation carried out worldwide field, kinematic scheme apparatus condition be fu...

Convolutional neural networks (CNN) are increasingly used in many areas of computer vision. They are particularly attractive because of their ability to “absorb” great quantities of labeled data through millions of parameters. However, as model sizes increase, so do the storage and memory requirements of the classifiers. We present a novel network architecture, Frequency-Sensitive Hashed Nets (...