Abstract: A method for identifying a current context and determining a sensor combination based on the current environment. The method may comprise accepting a plurality of sensor outputs and implementing a CNN to convert the sensor outputs into a plurality of features that can be used to identify the context through use of a gating algorithm that additionally determines which sensors have the most importance and which have little or no importance. The method may further comprise executing sensor fusion in a manner corresponding to the context. For example, the context determines whether early fusion or late fusion should be implemented and which sensor outputs should be included in the said fusion.

Abstract: The present invention is directed to a Spatiotemporal scene-graph embedding methodology that models scene-graphs and resolves safety-focused tasks for autonomous vehicles. The present invention features a computing system comprising instructions for accepting the one or more images, extracting one or more objects from each image, computing an inverse-perspective mapping transformation of the image to generate a bird's-eye view (BEV) representation of each image, calculating relations between each object for each image, and generating a scene-graph for each image based on the aforementioned calculations. The system may further comprise instructions for calculating a confidence value for whether or not a collision will occur through the generation of a spatio-temporal graph embedding based on a spatial graph embedding and a temporal model.

Abstract: A structure for magnetic flux sensor conditioning is presented which partitions an input analog signal of unknown integrity into two: susceptible and insusceptible. The structure scrutinizes the susceptible signal partition, in view of additional guard sensor information, through a mixed-signal processing side-chain that employs a non-invasive physical magnetic attack detection algorithm. The side-chain either validates, or replaces with a best estimate, the susceptible signal partition, depending upon the absence or presence of attack, respectively. The structure finally recombines the scrutinized susceptible signal partition with the insusceptible signal partition. The result is an analog magnetic flux sensor signal that is robust against skillful, surreptitious, spoofing attacks. If unmitigated, such attacks may induce catastrophic consequences into systems relying upon the magnetic flux sensor.

Abstract: A structure for magnetic flux sensor conditioning is presented which partitions an input analog signal of unknown integrity into two: susceptible and insusceptible. The structure scrutinizes the susceptible signal partition, in view of additional guard sensor information, through a mixed-signal processing side-chain that employs a non-invasive physical magnetic attack detection algorithm. The side-chain either validates, or replaces with a best estimate, the susceptible signal partition, depending upon the absence or presence of attack, respectively. The structure finally recombines the scrutinized susceptible signal partition with the insusceptible signal partition. The result is an analog magnetic flux sensor signal that is robust against skillful, surreptitious, spoofing attacks. If unmitigated, such attacks may induce catastrophic consequences into systems relying upon the magnetic flux sensor.

Abstract: A methodology as described herein allows cyber-domain tools such as computer aided-manufacturing (CAM) to be aware of the existing information leakage. Then, either machine process or product design parameters in the cyber-domain are changed to minimize the information leakage. This methodology aids the existing cyber-domain and physical-domain security solution by utilizing the cross-domain relationship.

Abstract: A physical layer secret key generation scheme exploiting randomness of the road surface and driving behavior is described herein. A symmetric key generation scheme can be implemented in any existing V2V visible light communication. By analyzing and simulating numerous samples taken from NGSIM vehicle trajectory data, the natural driving behavior and road surface roughness can be exploited as a source of randomness to generate symmetric cryptographic security keys.

Abstract: Point Optical Link communication security to help resolve the high resource requirements and lack of a trustworthy source of high randomness of existing communication security solutions is described herein. The scheme includes a novel model and a physical layer symmetric cryptographic key generation technique that focuses on exploiting the physical randomness manifested by the Polarization Mode Dispersion effect. This randomness makes it extremely difficult for an adversary to generate the same cryptographic keys as the communicating parties. 128 bit keys with low final mismatch rates (.ltoreq.10%) can be generated, which could easily be truncated for 64-bit and 32-bit keys if necessary.

Abstract: Point Optical Link communication security to help resolve the high resource requirements and lack of a trustworthy source of high randomness of existing communication security solutions is described herein. The scheme includes a novel model and a physical layer symmetric cryptographic key generation technique that focuses on exploiting the physical randomness manifested by the PMD effect. This randomness made it extremely difficult for an adversary to generate the same cryptographic keys as the communicating parties. 128 bit keys with low final mismatch rates (?10%) were generated, which could easily be truncated for 64-bit and 32-bit keys if necessary.

Abstract: A physical layer secret key generation scheme exploiting randomness of the road surface and driving behavior is described herein. A symmetric key generation scheme can be implemented in any existing V2V visible light communication. By analyzing and simulating numerous samples taken from NGSIM vehicle trajectory data, the natural driving behavior and road surface roughness can be exploited as a source of randomness to generate symmetric cryptographic security keys.

Abstract: A novel methodology for providing security to maintain the confidentiality of additive manufacturing systems during the cyber-physical manufacturing process is featured. This solution is incorporated within the computer aided manufacturing tools such as slicing algorithms and the tool-path generation, which are in the cyber-domain. This effectively mitigates the cross domain physical-to-cyber domain attacks which can breach the confidentiality of the manufacturing system to leak valuable intellectual properties.

Abstract: A methodology as described herein allows cyber-domain tools such as computer aided-manufacturing (CAM) to be aware of the existing information leakage. Then, either machine process or product design parameters in the cyber-domain are changed to minimize the information leakage. This methodology aids the existing cyber-domain and physical-domain security solution by utilizing the cross-domain relationship.

Abstract: A novel methodology for providing security to maintain the confidentiality of additive manufacturing systems during the cyber-physical manufacturing process is featured. This solution is incorporated within the computer aided manufacturing tools such as slicing algorithms and the tool-path generation, which are in the cyber-domain. This effectively mitigates the cross domain physical-to-cyber domain attacks which can breach the confidentiality of the manufacturing system to leak valuable intellectual properties.

Abstract: A novel methodology for providing security to maintain the confidentiality of additive manufacturing systems during the cyber-physical manufacturing process is featured. This solution is incorporated within the computer aided manufacturing tools such as slicing algorithms and the tool-path generation, which are in the cyber-domain. This effectively mitigates the cross domain physical-to-cyber domain attacks which can breach the confidentiality of the manufacturing system to leak valuable intellectual properties.

Abstract: A key generation technique exploiting the randomness of a wireless channel to generate secret keys to secure automotive wireless communication using symmetric cryptography is presented. Moreover, the algorithm of the present technique solves the challenging key exchange problem in automotive wireless communication with low costs in terms of performance and code size. As demonstrated, the proposed algorithm can generate secret keys with 67% average min-entropy. Furthermore, the proposed technique can achieve up to 10× performance and 20× code size reduction in comparison to the state-of-the-art hybrid cryptographic algorithms.

Abstract: Adaptive demand response based on distributed load control may be provided. A demand response request indicative of a demand response event for an area may be received. A maximum power consumption for the area during the demand response event may be determined based on the demand response request. One or more set points for the area during the demand response event may be determined prior to the demand response event. The one or more set points are determined based on the maximum power consumption. Prior to or during the demand response event, a real-time power consumption for the area may be calculated. When the real-time power consumption exceeds the maximum power consumption, one or more loads in the area may be controlled to maintain the real-time power consumption at or below the maximum power consumption.

Abstract: A method for performing time-slack pipeline balancing for multi/many-core programmable logic controllers includes performing a runtime analysis of a plurality of pipeline stages of a program for a multi/many-core programmable logic controller (PLC) while the program is being executed, and of a plurality of system services, to compile a profile of performance statistics of the PLC program and the system services, calculating a time slack for each of the plurality of pipeline stages of the PLC program using the profile of performance statistics, and for all pipeline stages except a longest stage, donating the time slack of each pipeline stage to an operating system of the PLC. Donating the time slack of each pipeline stage includes generating donor code that includes a set of instructions that free a processor core for a given pipeline stage for a time period identified as the time slack period.

Abstract: Deployment of a plurality of services to a plurality of nodes in a communication network during fulfillment of a service request may be facilitated. A request for the services may be received from the service consumer via a first node of the plurality of nodes. The first node is associated with the service consumer. One or more second nodes of the plurality of nodes are identified in the communication network. Each of the one or more second nodes is associated with one or more service providers. It is determined whether the first node and the one or more second nodes are capable of providing the requested services. The provision of the requested services is assigned to the first node, one or more of the second nodes, or a combination thereof, based on the determination.

Abstract: A method for performing time-slack pipeline balancing for multi/many-core programmable logic controllers includes performing (411) a runtime analysis of a plurality multi/many-core programmable logic controller (PLC) while the program is being executed, and of a plurality of system services, to compile a profile of performance statistics of the PLC program and the system services, (413) calculating a time slack for each of the plurality of pipeline stages of the PLC program using the profile of performance statistics, and for all pipeline stages except a longest stage, donating (414) the time slack of each pipeline stage to an operating system of the PLC. Donating the time slack of each pipeline stage includes generating donor code that includes a set of instructions that free a processor core for a given pipeline stage for a time period identified as the time slack period.

Abstract: A system and method are provided for the collaborative charging of electric vehicles. The collaborative charging manages the disbursement of power from a neighborhood transformer so as to increase the efficiency of electric vehicle charging at the residences without significantly altering the existing power distribution and residential infrastructures. Time-flexible loads are shed in order to efficiently allocate energy distribution without compromising the comfort or security of the user. The identities of individual residential power demands can be concealed to protect the user's privacy or made available to further optimize power allocation. The power allocation negotiation may be performed in a residential local demand management client separate from the residential charging station.

Abstract: A method of identifying and extracting functional parallelism from a PLC program has been developed that results in the ability of the extracted program fragments to be executed in parallel across a plurality of separate resources, and a compiler configured to perform the functional parallelism (i.e., identification and extraction processes) and perform the scheduling of the separate fragments within a given set of resources. The inventive functional parallelism creates a larger number of separable elements than was possible with prior dataflow analysis methodologies.