Abstract: Provided herein is a resource-independent and cost-efficient antimicrobial susceptibility testing (AST) system or apparatus that can rapidly process a large number of samples. The AST system includes a barcode-like cell sensor based on an adaptive linear filter array for implementing a fully automatic and microscope-free method for counting a very small volume of cells in samples, wherein suspended cells concentrate into microbars with various lengths proportional to the number of cells. The AST system also includes an on-chip culture that takes much less time than standard methods, thereby realizing a low-cost and resource-independent platform for portable AST, from which results can be obtained through a portable device such as a cell phone.

Abstract: The present invention relates to a system for efficient large-scale data distribution in a distributed and parallel processing environment. In particular, the present invention relates to global Top-k sparsification for low bandwidth networks. The present invention verifies that gTop-k S-SGD has nearly consistent convergence performance with S-SGD and evaluates the training efficiency of gTop-k on a cluster with 32 GPU machines which are inter-connected with 1 Gbps Ethernet. The experimental results show that the present invention achieves up to 2.7-12× higher scaling efficiency than S-SGD with dense gradients, and 1.1-1.7× improvement than the existing Top-k S-SGD.

Abstract: The present invention relates to a system for efficient large-scale data distribution in a distributed and parallel processing environment. In particular, the present invention relates to global Top-k sparsification for low bandwidth networks. The present invention verifies that gTop-k S-SGD has nearly consistent convergence performance with S-SGD and evaluates the training efficiency of gTop-k on a cluster with 32 GPU machines which are inter-connected with 1 Gbps Ethernet. The experimental results show that the present invention achieves up to 2.7-12× higher scaling efficiency than S-SGD with dense gradients, and 1.1-1.7× improvement than the existing Top-k S-SGD.

Abstract: A method for achieving rendezvous in a multiple access network having two or more access channels includes the steps of generating channel access sequences in rounds for each user of the multiple access network, wherein each round includes at least one jump-pattern and at least one stay-pattern, performing the at least one jump-pattern alternated by the at least one stay-pattern in each round, and whereupon the at least one jump-pattern alternated by the stay-pattern in each round are performed, continuously generate at least one channel access sequence rounds and perform the jump-pattern of the channel access sequence rounds until a user in the network achieves rendezvous with its intended neighbor user or users.

Abstract: A method for achieving rendezvous in a multiple access network having two or more access channels includes the steps of generating channel access sequences in rounds for each user of the multiple access network, wherein each round includes at least one jump-pattern and at least one stay-pattern, performing the at least one jump-pattern alternated by the at least one stay-pattern in each round, and whereupon the at least one jump-pattern alternated by the stay-pattern in each round are performed, continuously generate at least one channel access sequence rounds and perform the jump-pattern of the channel access sequence rounds until a user in the network achieves rendezvous with its intended neighbour user or users.