Abstract: A method for node cluster assignment in a graph includes identifying neighboring nodes of a first node in the graph, calculating one or more elements of a graph Laplacian of the graph, the one or more elements of the graph Laplacian corresponding to the first node and the neighboring nodes, initializing a first wavefunction associated with the first node with an initial value, evolving the first wavefunction associated with the first node over time based on the initial value, the one or more elements of the graph Laplacian, and previous states of wavefunctions of the neighboring nodes to generate a time-evolved wavefunction vector, and identifying a cluster assignment of the first node based on the time-evolved wavefunction vector.

Abstract: A method for node cluster assignment in a graph includes initializing a plurality of wavefunctions, each one of the plurality of wavefunctions corresponding to nodes of the graph, constructing a plurality of quantum circuits, each corresponding to a graph Laplacian of the graph, evolving the plurality of wavefunctions at the plurality of quantum circuits, each one of the plurality of wavefunctions being evolved to a different time than other ones of the plurality of wavefunctions, measuring evolved states of the plurality of wavefunctions to generate a time-evolved wavefunction vector, and identifying a cluster assignment of a node of the graph based on the time-evolved wavefunction vector.

Abstract: A process for computing the optimal solution to the quadratic assignment problem (QAP) defined on lattices includes storing facility data as facilities in a facility grid with facility tiles. Location data are stored as locations in a location grid with location tiles. Each facility tile is associated with a location tile and each facility in each facility tile is associated with a location in an associated location tile. A flow function is identified as distances between the plurality of facilities in the facility grid, and a distance function is identified as distances between the plurality of locations in the location grid. An association function relating the facilities to the locations is identified such that a solution with a low-cost function depending on the flow function and the distance function is found.

Abstract: A method for planning a building system includes incorporating user requirements into a floor plan accessed through a mobile device. An installation map is generated of locations for components corresponding to the user requirements. The placement of components is displayed on the floor plan based on specifications of the components and the user requirements.

Abstract: A computer system is provided that generates a Graphical User Interface indicating one or more intruder threat levels for a building. The computer system includes a processor, which upon execution of stored instructions is configured to access a building floor plan having one or more entry and exit points and to access an intruder threat level associated with each of the one or more entry and exit points; to perform threat modeling to determine intruder threat levels at a plurality of locations within the building, contingent upon the building floor plan and the intruder threat level associated with the one or more building entry and exit points; and to provide a GUI on a display indicating, relative to the building floor plan, the determined intruder threat level within the building, at the plurality of points within the building and at the one or more entry and exit points.

Abstract: A method for planning a building system includes incorporating user requirements into a floor plan accessed through a mobile device. An installation map is generated of locations for components corresponding to the user requirements. The placement of components is displayed on the floor plan based on specifications of the components and the user requirements.

Abstract: A computer system is provided that generates a Graphical User Interface indicating one or more intruder threat levels for a building. The computer system includes a processor, which upon execution of stored instructions is configured to access a building floor plan having one or more entry and exit points and to access an intruder threat level associated with each of the one or more entry and exit points; to perform threat modeling to determine intruder threat levels at a plurality of locations within the building, contingent upon the building floor plan and the intruder threat level associated with the one or more building entry and exit points; and to provide a GUI on a display indicating, relative to the building floor plan, the determined intruder threat level within the building, at the plurality of points within the building and at the one or more entry and exit points.

Abstract: A method for providing comfort estimation for a space includes receiving sensor data identifying an environmental condition for the space; receiving comfort data from occupants of the space combining the sensor data and comfort data to provide combined data; generating a comfort relation network in response to the combined data; and performing network analysis on the comfort relation network to identify communities within the comfort relation network.

Abstract: A method of learning a structure of a Bayesian network includes computing an ordering of the random variables of the Bayesian network; wherein computing the ordering of the random variables of the Bayesian network is performed by computing an approximate solution to the history dependent traveling salesman problem.