Abstract: The invention provides an SOFC cooling system. For the feature that not all components work in the full operation process of an SOFC, a DC step-down transformer DCDC, a fan and a condenser are connected in parallel, and a solenoid valve is installed in each parallel pipeline for controlling on/off of each pipeline according to a corresponding signal. Compared with the traditional SOFC cooling system, the constant-flow serial cooling system will reduce pressure losses and the power of a water pump; a solenoid valve is installed in each parallel pipeline for controlling on/off of each branch according to a corresponding signal; considering the cooling requirements of SOFC during start-up, power generation and shutdown, all components are cooled in parallel through reasonable design of each parallel pipeline, consequently to improve the cooling effect and reduce the energy consumption; the invention also discloses a fuel cell and hybrid vehicle.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: The invention relates to a solid oxide fuel cell system and a steam generator thereof, wherein the steam generator comprises a water inlet pipe, a casing and a heat exchange device arranged in the casing; a heat exchange cavity is formed between the outer wall of the heat exchange device and the inner wall of the casing, the water inlet pipe communicates with the heat exchange cavity and is used for inputting liquid water into the heat exchange cavity, and the liquid water can exchange heat with the heat exchange device in the heat exchange cavity and form steam; the casing is further provided with a steam exhaust port for exhausting steam in the heat exchange cavity to a reforming device; a steam-water separation grid is arranged on the top wall of a side of the water inlet pipe facing the casing. The continuity and the uniformity of liquid water evaporation can be improved, so that the stability and the reliability of the solid oxide fuel cell system are ensured.

Abstract: A solid oxide fuel cell system and a water vapor generator and method of operation. The water vapor generator includes a tank body, a water inlet pipe that can introduce water flow into the tank body, and a heat exchanger located inside the tank body. A water flow can enter the tank body through the water inlet pipe and to exchange heat with the heat exchanger, the heated water forms water vapor. A top portion of the heat exchanger is provided with a recess, the water flow from the water inlet pipe flows into the recess, and the water flow is accumulated in the recess and overflows to exchange heat with the heat exchanger. With this arrangement, if the water flow in the water inlet pipe boils in advance, the recess provided can buffer the impact of the boiling water on the heat exchanger and reduce the pressure fluctuation inside the water vapor generator.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: The invention provides an SOFC cooling system. For the feature that not all components work in the full operation process of an SOFC, a DC step-down transformer DCDC, a fan and a condenser are connected in parallel, and a solenoid valve is installed in each parallel pipeline for controlling on/off of each pipeline according to a corresponding signal. Compared with the traditional SOFC cooling system, the constant-flow serial cooling system will reduce pressure losses and the power of a water pump; a solenoid valve is installed in each parallel pipeline for controlling on/off of each branch according to a corresponding signal; considering the cooling requirements of SOFC during start-up, power generation and shutdown, all components are cooled in parallel through reasonable design of each parallel pipeline, consequently to improve the cooling effect and reduce the energy consumption; the invention also discloses a fuel cell and hybrid vehicle.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.

Abstract: System and method to produce an anonymized cohort having less than a predetermined risk of re-identification. The method includes receiving a data query of requested traits for the anonymized cohort, querying a data source to find records that possess at least some of the traits, forming a dataset from at least some of the records, and grouping the dataset in time into a first boundary group, a second boundary group, and one or more non-boundary groups temporally between the first boundary group and second boundary group. For each non-boundary group, calculating maximum time limits the non-boundary group can be time-shifted without overlapping an adjacent group, calculating a group jitter amount, capping the group jitter amount by the maximum time limits and by respective predetermined jitter limits, and jittering said non-boundary group by the capped group jitter amount to produce an anonymized dataset. Return the anonymized dataset.