arXiv subjects

Cong Liu

Publications and source records attributed to Cong Liu.

224 records · Page 13Linked to original sources

arXiv2016

Evaluating Stochastic Methods in Power System Operations with Wind Power

Wind power is playing an increasingly important role in electricity markets. However, it's inherent variability and uncertainty cause operational challenges and costs as more operating reserves are needed to maintain system reliability. Several operational strategies have been proposed to address these challenges, including advanced probabilistic wind forecasting techniques, dynamic operating reserves, and various unit commitment (UC) and economic dispatch (ED) strategies under uncertainty. This paper presents a consistent framework to evaluate different operational strategies in power system operations with renewable energy. We use conditional Kernel Density Estimation (KDE) for probabilistic wind power forecasting. Forecast scenarios are generated considering spatio-temporal correlations, and further reduced to lower the computational burden. Scenario-based stochastic programming with different decomposition techniques and interval optimization are tested to examine economic, reliability, and computational performance compared to deterministic UC/ED benchmarks. We present numerical results for a modified IEEE-118 bus system with realistic system load and wind data.

math.OC↗

arXiv2016

Wafer-scale arrayed p-n junctions based on few-layer epitaxial GaTe

Two-dimensional (2D) materials have attracted substantial attention in electronic and optoelectronic applications with superior advantages of being flexible, transparent and highly tunable. Gapless graphene exhibits ultra-broadband and fast photoresponse while the 2D semiconducting MoS2 and GaTe unveil high sensitivity and tunable responsivity to visible light. However, the device yield and the repeatability call for a further improvement of the 2D materials to render large-scale uniformity. Here we report a layer-by-layer growth of wafer-scale GaTe with a hole mobility of 28.4 cm2/Vs by molecular beam epitaxy. The arrayed p-n junctions were developed by growing few-layer GaTe directly on three-inch Si wafers. The resultant diodes reveal good rectifying characteristics, photoresponse with a maximum photoresponsivity of 2.74 A/W and a high photovoltaic external quantum efficiency up to 62%. The photocurrent reaches saturation fast enough to capture a time constant of 22 μs and shows no sign of device degradation after 1.37 million cycles of operation. Most strikingly, such high performance has been achieved across the entire wafer, making the volume production of devices accessible. Finally, several photo-images were acquired by the GaTe/Si photodiodes with a reasonable contrast and spatial resolution, demonstrating for the first time the potential of integrating the 2D materials with the silicon technology for novel optoelectronic devices.

cond-mat.mtrl-sci↗

arXiv2016

Arrayed van der Waals Vertical Heterostructures based on 2D GaSe Grown by Molecular Beam Epitaxy

Vertically stacking two dimensional (2D) materials can enable the design of novel electronic and optoelectronic devices and realize complex functionality. However, the fabrication of such artificial heterostructures in wafer scale with an atomically-sharp interface poses an unprecedented challenge. Here, we demonstrate a convenient and controllable approach for the production of wafer-scale 2D GaSe thin films by molecular beam epitaxy. In-situ reflection high-energy electron diffraction oscillations and Raman spectroscopy reveal a layer-by-layer van der Waals epitaxial growth mode. Highly-efficient photodetector arrays were fabricated based on few-layer GaSe on Si. These photodiodes show steady rectifying characteristics and a relatively high external quantum efficiency of 23.6%. The resultant photoresponse is super-fast and robust with a response time of 60 us. Importantly, the device shows no sign of degradation after 1 million cycles of operation. Our study establishes a new approach to produce controllable, robust and large-area 2D heterostructures and presents a crucial step for further practical applications.

cond-mat.mes-hall↗

arXiv2016

Feedforward Sequential Memory Networks: A New Structure to Learn Long-term Dependency

In this paper, we propose a novel neural network structure, namely \emph{feedforward sequential memory networks (FSMN)}, to model long-term dependency in time series without using recurrent feedback. The proposed FSMN is a standard fully-connected feedforward neural network equipped with some learnable memory blocks in its hidden layers. The memory blocks use a tapped-delay line structure to encode the long context information into a fixed-size representation as short-term memory mechanism. We have evaluated the proposed FSMNs in several standard benchmark tasks, including speech recognition and language modelling. Experimental results have shown FSMNs significantly outperform the conventional recurrent neural networks (RNN), including LSTMs, in modeling sequential signals like speech or language. Moreover, FSMNs can be learned much more reliably and faster than RNNs or LSTMs due to the inherent non-recurrent model structure.

cs.NE↗

arXiv2015

k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests

To deal with a large variety of workloads in different application domains in real-time embedded systems, a number of expressive task models have been developed. For each individual task model, researchers tend to develop different types of techniques for deriving schedulability tests with different computation complexity and performance. In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessor and multiprocessor scheduling. The key to k2U is a k-point effective schedulability test, which can be viewed as a "blackbox" interface. For any task model, if a corresponding k-point effective schedulability test can be constructed, then a sufficient utilization-based test can be automatically derived. We show the generality of k2U by applying it to different task models, which results in new and improved tests compared to the state-of-the-art. Analogously, a similar concept by testing only k points with a different formulation has been studied by us in another framework, called k2Q, which provides quadratic bounds or utilization bounds based on a different formulation of schedulability test. With the quadratic and hyperbolic forms, k2Q and k2U frameworks can be used to provide many quantitive features to be measured, like the total utilization bounds, speed-up factors, etc., not only for uniprocessor scheduling but also for multiprocessor scheduling. These frameworks can be viewed as a "blackbox" interface for schedulability tests and response-time analysis.

cs.OS↗

arXiv2014

Supporting Read/Write Applications in Embedded Real-time Systems via Suspension-aware Analysis

In many embedded real-time systems, applications often interact with I/O devices via read/write operations, which may incur considerable suspension delays. Unfortunately, prior analysis methods for validating timing correctness in embedded systems become quite pessimistic when suspension delays are present. In this paper, we consider the problem of supporting two common types of I/O applications in a multiprocessor system, that is, write-only applications and read-write applications. For the write-only application model, we present a much improved analysis technique that results in only O(m) suspension-related utilization loss, where m is the number of processors. For the second application model, we present a flexible I/O placement strategy and a corresponding new scheduling algorithm, which can completely circumvent the negative impact due to read- and write-induced suspension delays. We illustrate the feasibility of the proposed I/O-placement-based schedule via a case study implementation. Furthermore, experiments presented herein show that the improvement with respect to system utilization over prior methods is often significant.

cs.OH↗

arXiv2014

Supporting Soft Real-Time Sporadic Task Systems on Heterogeneous Multiprocessors with No Utilization Loss

Heterogeneous multicore architectures are becoming increasingly popular due to their potential of achieving high performance and energy efficiency compared to the homogeneous multicore architectures. In such systems, the real-time scheduling problem becomes more challenging in that processors have different speeds. A job executing on a processor with speed $x$ for $t$ time units completes $(x \cdot t)$ units of execution. Prior research on heterogeneous multiprocessor real-time scheduling has focused on hard real-time systems, where, significant processing capacity may have to be sacrificed in the worst-case to ensure that all deadlines are met. As meeting hard deadlines is overkill for many soft real-time systems in practice, this paper shows that on soft real-time heterogeneous multiprocessors, bounded response times can be ensured for globally-scheduled sporadic task systems with no utilization loss. A GEDF-based scheduling algorithm, namely GEDF-H, is presented and response time bounds are established under both preemptive and non-preemptive GEDF-H scheduling. Extensive experiments show that the magnitude of the derived response time bound is reasonable, often smaller than three task periods. To the best of our knowledge, this paper is the first to show that soft real-time sporadic task systems can be supported on heterogeneous multiprocessors without utilization loss, and with reasonable predicted response time.

cs.OS↗

arXiv2010

An efficient algorithm for the parallel solution of high-dimensional differential equations

The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16.

cs.DC↗