Abstract: A search-based heuristic for assigning frequencies to transmitters in a fixed spectrum frequency assignment (FS-FA) telecommunications network in order to satisfy a set of frequency constraints is described. Each connection in a network must have a frequency assigned from the spectrum which satisfies the set of constraints, which specify the frequency separation which is necessary between frequencies assigned to different transmitters. Violation of these constraints creates interference, which must be minimized. The exemplary heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves and a lookup table that classifies all possible one-change moves as positive or negative, which are chosen until a locally minimal solution is found. The compound move operation shifts the local search to a new location in the search space. The local search and compound move are iterated until a total interference cost function is minimized.

Abstract: A heuristic method for the data clustering problem includes a greedy algorithm, which selects the centroids of well-separated clusters, and a single-solution-based heuristic, which performs clustering with the objective of optimizing a cluster validity index. The attributes of the centroids of clusters are genes and a fitness is determined for each gene. A mutation operation changes the values of the genes of low fitness values and creates a mutant solution. The values of genes of the mutant can replace the values of the genes of the parent if they are better than the genes of the parent. Diversification in the search process is maintained by allowing, with a small probability, the genes of the mutant to replace the genes of the parent even if they are not better than them.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: A search-based heuristic for assigning frequencies to transmitters in a fixed spectrum frequency assignment (FS-FA) telecommunications network in order to satisfy a set of frequency constraints is described. Each connection in a network must have a frequency assigned from the spectrum which satisfies the set of constraints, which specify the frequency separation which is necessary between frequencies assigned to different transmitters. Violation of these constraints creates interference, which must be minimized. The exemplary heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves and a lookup table that classifies all possible one-change moves as positive or negative, which are chosen until a locally minimal solution is found. The compound move operation shifts the local search to a new location in the search space. The local search and compound move are iterated until a total interference cost function is minimized.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: A collaborative automation platform and associated method include a fault-tolerant control server hosting one or more virtual controllers, and a fault-tolerant input/output server hosting a virtual input/output system. The collaborative automation platform also includes a master autonomous process interface system connected to the virtual input/output system, via a local area input/output network. The collaborative automation platform also includes a plurality of distributed autonomous process interface systems connected to the master autonomous process interface system, wherein each distributed autonomous process interface system is hardwired to a plurality of field instruments. The collaborative automation platform also includes real-time DDS middleware configured for execution with the fault-tolerant control server, the fault-tolerant input/output server, the master autonomous process interface system, and the plurality of distributed autonomous process interface systems.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: A heuristic method for the data clustering problem includes a greedy algorithm, which selects the centroids of well-separated clusters, and a single-solution-based heuristic, which performs clustering with the objective of optimizing a cluster validity index. The attributes of the centroids of clusters are genes and a fitness is determined for each gene. A mutation operation changes the values of the genes of low fitness values and creates a mutant solution. The values of genes of the mutant can replace the values of the genes of the parent if they are better than the genes of the parent. Diversification in the search process is maintained by allowing, with a small probability, the genes of the mutant to replace the genes of the parent even if they are not better than them.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: A system and method for rip-up and re-routing a global routing solution includes determining, via processing circuitry, one or more rip-up and re-route (R&R) strategies for a net; decomposing, via the processing circuitry, multiple pins of the net into a plurality of subnets; decomposing a spanning tree of the net into paths for the plurality of subnets; determining, via the processing circuitry, a probability of success of each of the R&R strategies for one of minimizing a total overflow of a global routing solution or minimizing a wire length of the global routing solution; and applying one of the R&R strategies to the net based on the determined probability of success of said each of the R&R strategies towards improving the global routing solution, wherein the global routing solution includes a plurality of spanning trees for a respective plurality of nets of a global routing system.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Provided are systems and methods of attendance verification using mobile electronic devices (or “mobile devices”). In some embodiments, a person's biometric data is acquired and verified locally by a mobile device associated with the person while the mobile device is located in a geographic region associated with an event, and attendance data, including an indication of the verification of the biometric data along with a unique identifier of the mobile device, such as an international mobile equipment identity (IMEI) of the mobile device, is transmitted to an attendance server that makes a record of the person's attendance of the event based on the attendance data.

Abstract: Methods and apparatus to design collaborative automation systems based on Data Distribution Service middleware are described, which include a clustered automation platform having one or more control servers connected to a local area control network, and a plurality of self-contained process interface systems configured to receive electrical signals from one or more field instruments and forward resulting data via an uplink to a local area input/output network. The clustered automation platform also includes an input/output processing and inferential modeling server connected to the local area input/output network and configured to process input/output signals of the plurality of self-contained process interface systems.