The growth of a Ni(OH)2 coating on conductive carbon substrates is an efficient way to address issues related to their poor conductivity in electrochemical capacitor applications. However, the direct growth of nickel hydroxide coatings on a carbon substrate is challenging, because the surfaces of these systems are not compatible and a preoxidation treatment of the conductive carbon substrate is usually required. Herein, we present a facile preoxidation-free approach to fabricate a uniform Ni(OH)2 coating on carbon nanosheets (CNs) by an ion-exchange reaction to achieve the in situ transformation of a MgO/C composite to a Ni(OH)2/C one. The obtained Ni(OH)2/CNs hybrids possess nanosheet morphology, a large surface area (278 m2/g), and homogeneous elemental distributions. When employed as supercapacitors in a three-electrode configuration, the Ni(OH)2/CNs hybrid achieves a large capacitance of 2,218 F/g at a current density of 1.0 A/g. Moreover, asymmetric supercapacitors fabricated with the Ni(OH)2/CNs hybrid exhibit superior supercapacitive performances, with a large capacity of 198 F/g, and high energy density of 56.7 Wh/kg at a power density of 4.0 kW/kg. They show excellent cycling stability with 93% capacity retention after 10,000 cycles, making the Ni(OH)2/CNs hybrid a promising candidate for practical applications in supercapacitor devices.
In a real-time system with both hard real-time periodic jobs and soft real-time aperiodic jobs, it is important to guarantee that the deadline of each periodic job is met, as well as to provide a fast response time for each aperiodic job. We propose an algorithm, called Proportional Slack Reserve (PSR), that produces an efficient schedule for such an environment. For every execution unit of a periodic job, the PSR algorithm reserves time which can be used for execution of aperiodic jobs. If reserved time is not available, the algorithm assigns a deadline to an aperiodic job for achieving better responsiveness of aperiodic jobs. The proposed algorithm can fully utilize processing power while meeting all deadlines of periodic jobs. It can also easily reclaim the time unused by the periodic job. We analytically show that for each aperiodic job, the response time in a PSR schedule is no longer than that in a TBS schedule, which is known to be efficient for servicing aperiodic jobs. We also present simulation results in which the response time of PSR is significantly improved over that of TBS, and moreover the performance of PSR compares favorably with TB(N) considering scheduling overhead. 相似文献
