Abstract: The disclosed computer-implemented method for protecting against unauthorized network intrusions may include (1) identifying a signal received by one or more antennas of a network from a transceiver of a device attempting to access the network, (2) detecting one or more signal strengths of the signal received by the antennas of the network in connection with the attempt to access the network, (3) determining, based at least in part on the signal strengths of the signal, that the attempt to access the network is potentially malicious, and then in response to determining that the attempt to access the network is potentially malicious, (4) initiating at least one security measure to address the potentially malicious attempt to access the network. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for protecting against unauthorized network intrusions may include (1) identifying a signal received by one or more antennas of a network from a transceiver of a device attempting to access the network, (2) detecting one or more signal strengths of the signal received by the antennas of the network in connection with the attempt to access the network, (3) determining, based at least in part on the signal strengths of the signal, that the attempt to access the network is potentially malicious, and then in response to determining that the attempt to access the network is potentially malicious, (4) initiating at least one security measure to address the potentially malicious attempt to access the network. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A storage reorganizing system subdivides a reorganizable storage space into tile areas. Each tile area either contains file data or does not contain file data. The data in a tile area that contains file data is referred to as a tile. A tile area that does not contain file data is referred to as a vacancy. Tiles that are not yet located in their goal positions, as defined by a recorded goal state definition, are opportunistically moved to available vacancies that are the goal positions for such tiles as the vacancies become available. Each tile move leaves behind it a new vacancy. The speed of opportunistic tile moving is optimized by first locating the largest vacancies that are each to be filled with the largest amount of tile data and by first moving tiles to such vacancies. One goal state produces a defragmented set of files. Another goal state produces an intentionally fragmented set of files.