Abstract: As disclosed herein a method, executed by a computer, for providing improved multi-protocol traffic processing includes receiving a data packet, determining if a big processor is activated, deactivating a little processor and activating the big processor if the big processor is not activated and an overflow queue is full, and deactivating the big processor and activating the little processor if the big processor is activated and a current throughput for the big processor is below a first threshold or a sustained throughput for the big processor remains below a second threshold. The big and little processors may be co-located on a single integrated circuit. An overflow queue, managed with a token bucket algorithm, may be used to enable the little processor to handle short burst of data packet traffic. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for providing improved multi-protocol traffic processing includes receiving a data packet, determining if a big processor is activated, deactivating a little processor and activating the big processor if the big processor is not activated and an overflow queue is full, and deactivating the big processor and activating the little processor if the big processor is activated and a current throughput for the big processor is below a first threshold or a sustained throughput for the big processor remains below a second threshold. The big and little processors may be co-located on a single integrated circuit. An overflow queue, managed with a token bucket algorithm, may be used to enable the little processor to handle short burst of data packet traffic. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for providing improved multi-protocol traffic processing includes receiving a data packet, determining if a big processor is activated, deactivating a little processor and activating the big processor if the big processor is not activated and an overflow queue is full, and deactivating the big processor and activating the little processor if the big processor is activated and a current throughput for the big processor is below a first threshold or a sustained throughput for the big processor remains below a second threshold. The big and little processors may be co-located on a single integrated circuit. An overflow queue, managed with a token bucket algorithm, may be used to enable the little processor to handle short burst of data packet traffic. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for providing improved multi-protocol traffic processing includes receiving a data packet, determining if a big processor is activated, deactivating a little processor and activating the big processor if the big processor is not activated and an overflow queue is full, and deactivating the big processor and activating the little processor if the big processor is activated and a current throughput for the big processor is below a first threshold or a sustained throughput for the big processor remains below a second threshold. The big and little processors may be co-located on a single integrated circuit. An overflow queue, managed with a token bucket algorithm, may be used to enable the little processor to handle short burst of data packet traffic. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: A method for diverting water flow of a drainage system is provided. The method comprises receiving monitored information from a plurality of sensors of a drainage system. In one aspect, the drainage system includes at least one valve to control water flow of the drainage system, and wherein the plurality of sensors and the at least one valve are communicatively connected to a controller of the drainage system. Moreover, the method comprises analyzing the monitored information of the plurality of sensors to resolve a maximum flow problem of water flow of the drainage system. The method further comprises identifying a path through the drainage system to divert water flow of the drainage system based on the resolved maximum flow problem. The method further comprises controlling a plurality of valves to divert the water flow in the drainage system based on the identified path of the drainage system.

Abstract: The illustrative embodiments described herein provide a computer implemented method, apparatus, and computer program product for managing a batch production system. In an illustrative embodiment, an application forecast is generated for a set of batch jobs in a critical path of a batch application. The application forecast comprises a sum of execution times for the batch jobs in the critical path. In response to detecting an abend from production data generated during the execution of the batch application, the abend is mapped against known abends in an abend database to identify a set of abend solutions. Thereafter, a notification is generated which comprises at least one of a status of the batch application and the set of abend solutions, wherein the status is generated based on the application forecast.

Abstract: The present disclosure relates generally to parking space allocation systems and methods, and particularly, to parking space allocation systems and methods for use in connection with parking at a mall.

Abstract: The present invention can increase the odds of choosing the right people for a team by considering their “rate of interest/knowledge” in multiple topics. Given a known contacts network, represented by nodes interconnected by links, several different sub-networks are identified within it, corresponding to different topics or areas of expertise required to a specific project. For each sub-network, there will be nodes with an associated grade, based on that person's knowledge/interest for the topic related to that sub-network. As such, each node/person receives a grade for each topic. Using these grades, a weight of each link between the nodes is calculated. This process is performed for every node for each topic and associated grade. After that, a superposition of all sub-networks is made and a multiple interest network is yielded.

Abstract: The illustrative embodiments described herein provide a computer implemented method, apparatus, and computer program product for managing a batch production system. In an illustrative embodiment, an application forecast is generated for a set of batch jobs in a critical path of a batch application. The application forecast comprises a sum of execution times for the batch jobs in the critical path. In response to detecting an abend from production data generated during the execution of the batch application, the abend is mapped against known abends in an abend database to identify a set of abend solutions. Thereafter, a notification is generated which comprises at least one of a status of the batch application and the set of abend solutions, wherein the status is generated based on the application forecast.

Abstract: An HVAC system includes a grid of intersecting ducts having one or more inlets, outlets, and intersections. Air may be received into the inlets and directed through the outlets into one or more zones of a building. One or more HVAC units may be connected to the inlets and mechanical valves may be located at the intersections to control the air flow through the grid. A control system may be provided to control the temperature of each zone by adjusting the mechanical valves (and/or turning selected HVAC units “on” or “off”). In certain embodiments, the HVAC system includes at least one reading device to read temperature preference information associated with an occupant of a zone. The control system may then align the temperature of the zone with the temperature preference information when the occupant is inside the zone. A corresponding method and apparatus are also disclosed herein.

Abstract: The present invention can increase the odds of choosing the right people for a team by considering their “rate of interest/knowledge” in multiple topics. Given a known contacts network, represented by nodes interconnected by links, several different sub-networks are identified within it, corresponding to different topics or areas of expertise required to a specific project. For each sub-network, there will be nodes with an associated grade, based on that person's knowledge/interest for the topic related to that sub-network. As such, each node/person receives a grade for each topic. Using these grades, a weight of each link between the nodes is calculated. This process is performed for every node for each topic and associated grade. After that, a superposition of all sub-networks is made and a multiple interest network is yielded.

Abstract: A periodical expense planning system, method and data model considers income, predicted and unpredicted expenses, in order to maximize final balance and profit for the analysis period. It applies multi-period linear optimization techniques, analyzing the expenses of a house cell over N periods for every period within N. The model analyzes the predicted expenses (known costs, but not necessarily the same amount on every period) of the k future periods to come, and also takes into account the actual costs incurred in the r previous periods (having that k+r=N). By doing that, the model calculates the optimal amount that can be taken away from the model in each period (i.e., money to be invested and thus give the user earnings) is achieved, and a planning for the expenses' payment is given. The variables under analysis for each period are how much to save for the next period, how much can be taken away from the model (i.e., the money to be invested), how much should be put into the system (i.e.