arXiv subjects

Cong Liu

Publications and source records attributed to Cong Liu.

At least 217 records · Page 12Linked to original sources

arXiv2018

New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors

The scheduling and schedulability analysis of real-time directed acyclic graph (DAG) task systems have received much recent attention. The DAG model can accurately represent intra-task parallelim and precedence constraints existing in many application domains. Existing techniques show that analyzing the DAG model is fundamentally more challenging compared to the ordinary sporadic task model, due to the complex intra-DAG precedence constraints which may cause rather pessimistic schedulability loss. However,such increased loss is counter-intuitive because the DAG structure shall better exploit the parallelism provided by the multiprocessor platform. Our observation is that the intra-DAG precedence constraints, if not carefully considered by the scheduling algorithm, may cause very unpredictable execution behaviors of subtasks in a DAG and further cause pessimistic analysis. In this paper, we present a set of novel scheduling and analysis techniques for better supporting hard real-time sporadic DAG tasks on multiprocessors, through smartly defining and analyzing the execution order of subtasks in each DAG. Evaluation demonstrates that our developed utilization-based schedulability test is highly efficient, which dramatically improves schedulability of existing utilization-based tests by over 60% on average. Interestingly, when each DAG in the system is an ordinary sporadic task, our test becomes identical to the classical density test designed for the sporadic task model.

cs.OS↗

arXiv2018

Probing single protein dynamics on liposome surfaces

It is crucial to measure position and conformational changes of a membrane-interacting protein relative to the membrane surface. This is however challenging because the thickness of a membrane is usually only about 4 nm. We developed a fluorescence method which makes use of the principle of FRET between a fluorophore and a cloud of quenchers encapsulated in a liposome, hence the name LipoFRET. LipoFRET can readily locate a fluorophore in different depths inside and at different heights above the membrane. We applied LipoFRET to study α-synuclein, a key player in the pathology of Parkinson's disease. Our approach yielded quantita-tive information about the dynamics of different regions of α-syn in lipid membranes, which has never been explored before.

physics.bio-ph↗

arXiv2018

DeepRoad: GAN-based Metamorphic Autonomous Driving System Testing

While Deep Neural Networks (DNNs) have established the fundamentals of DNN-based autonomous driving systems, they may exhibit erroneous behaviors and cause fatal accidents. To resolve the safety issues of autonomous driving systems, a recent set of testing techniques have been designed to automatically generate test cases, e.g., new input images transformed from the original ones. Unfortunately, many such generated input images often render inferior authenticity, lacking accurate semantic information of the driving scenes and hence compromising the resulting efficacy and reliability. In this paper, we propose DeepRoad, an unsupervised framework to automatically generate large amounts of accurate driving scenes to test the consistency of DNN-based autonomous driving systems across different scenes. In particular, DeepRoad delivers driving scenes with various weather conditions (including those with rather extreme conditions) by applying the Generative Adversarial Networks (GANs) along with the corresponding real-world weather scenes. Moreover, we have implemented DeepRoad to test three well-recognized DNN-based autonomous driving systems. Experimental results demonstrate that DeepRoad can detect thousands of behavioral inconsistencies in these systems.

cs.SE↗

arXiv2018

A novel superhard tungsten nitride predicted by machine-learning accelerated crystal structure searching

Transition metal nitrides have been suggested to have both high hardness and good thermal stability with large potential application value, but so far stable superhard transition metal nitrides have not been synthesized. Here, with our newly developed machine-learning accelerated crystal structure searching method, we designed a superhard tungsten nitride, h-WN6, which can be synthesized at pressure around 65 GPa and quenchable to ambient pressure. This h-WN6 is constructed with single-bonded N6 rings and presents ionic-like features, which can be formulated as W2.4+N62.4-. It has a band gap of 1.6 eV at 0 GPa and exhibits an abnormal gap broadening behavior under pressure. Excitingly, this h-WN6 is found to be the hardest among transition metal nitrides known so far (Vickers hardness around 57 GPa) and also has a very high melting temperature (around 1900 K). These predictions support the designing rules and may stimulate future experiments to synthesize superhard material.

cond-mat.mtrl-sci↗

arXiv2017

Superhard and Superconducting B6C

Crystal structure searching and ab initio calculations have been used here to explore low-energy structures of boron carbides under high pressure. Under pressures of 85-110 GPa, a metastable B6C with R-3m symmetry is found to be energetically more stable than the mixture of previous B4C and elemental boron. This B6C is a rhombohedral structure and contains mooncake-like B24 clusters with stuffing of C2 pairs. The mechanical and dynamical stabilities of this structure at ambient pressure are confirmed by its elastic constants and phonon dispersions. The bulk modulus and shear modulus of this newly predicted B6C at ambient pressure reach high values of 291 GPa and 272 GPa, respectively. The Vickers hardness is calculated to be around 48 GPa, and its melting temperature at ambient pressure is estimated to be around 2500 K, indicating that this metastable B6C is a potential superhard material with very good thermal stability. Interestingly, this superhard B6C structure is also found to be superconducting and its superconducting critical temperature (Tc) is evaluated to be around 12.5 K at ambient pressure by electron-phonon coupling.

cond-mat.mtrl-sci↗

arXiv2017

Towards Software Development For Social Robotics Systems

In this paper we introduce the core results of the project on software development for social robotics systems. The usability of maintenance and control features is crucial for many kinds of systems, but in the case of social robotics we also have to take into account that (1) the humanoid robot physically interacts with humans, (2) the conversation with children might have different requirements in comparison to the conversation with adults. The results of our work were implement for the humanoid PAL REEM robot, but their core ideas can be applied for other types of humanoid robots. We developed a web-based solution that supports the management of robot-guided tours, provides recommendations for the users as well as allows for a visual analysis of the data on previous tours.

cs.RO↗

arXiv2017

BENCHIP: Benchmarking Intelligence Processors

The increasing attention on deep learning has tremendously spurred the design of intelligence processing hardware. The variety of emerging intelligence processors requires standard benchmarks for fair comparison and system optimization (in both software and hardware). However, existing benchmarks are unsuitable for benchmarking intelligence processors due to their non-diversity and nonrepresentativeness. Also, the lack of a standard benchmarking methodology further exacerbates this problem. In this paper, we propose BENCHIP, a benchmark suite and benchmarking methodology for intelligence processors. The benchmark suite in BENCHIP consists of two sets of benchmarks: microbenchmarks and macrobenchmarks. The microbenchmarks consist of single-layer networks. They are mainly designed for bottleneck analysis and system optimization. The macrobenchmarks contain state-of-the-art industrial networks, so as to offer a realistic comparison of different platforms. We also propose a standard benchmarking methodology built upon an industrial software stack and evaluation metrics that comprehensively reflect the various characteristics of the evaluated intelligence processors. BENCHIP is utilized for evaluating various hardware platforms, including CPUs, GPUs, and accelerators. BENCHIP will be open-sourced soon.

cs.PF↗

arXiv2017

An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks

Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same user, the cascade arriving first is the most likely to be taken by the user. Therefore, once misinformation or rumor is detected, a natural containment method is to introduce a positive cascade competing against the rumor. Given a budget $k$, the rumor blocking problem asks for $k$ seed users to trigger the spread of the positive cascade such that the number of the users who are not influenced by rumor can be maximized. The prior works have shown that the rumor blocking problem can be approximated within a factor of $(1-1/e-δ)$ by a classic greedy algorithm combined with Monte Carlo simulation with the running time of $O(\frac{k^3mn\ln n}{δ^2})$, where $n$ and $m$ are the number of users and edges, respectively. Unfortunately, the Monte-Carlo-simulation-based methods are extremely time consuming and the existing algorithms either trade performance guarantees for practical efficiency or vice versa. In this paper, we present a randomized algorithm which runs in $O(\frac{km\ln n}{δ^2})$ expected time and provides a $(1-1/e-δ)$-approximation with a high probability. The experimentally results on both the real-world and synthetic social networks have shown that the proposed randomized rumor blocking algorithm is much more efficient than the state-of-the-art method and it is able to find the seed nodes which are effective in limiting the spread of rumor.

cs.SI↗

arXiv2017

80-Gbit/s 100-m Free-Space Optical Data Transmission Link via a Flying UAV Using Multiplexing of Orbital-Angular-Momentum Beams

We explore the use of orbital-angular-momentum (OAM)-multiplexing to increase the capacity of free-space data transmission to moving platforms, with an added potential benefit of decreasing the probability of data intercept. Specifically, we experimentally demonstrate and characterize the performance of an OAM-multiplexed, free-space optical (FSO) communications link between a ground station and a moving unmanned-aerial-vehicle (UAV). We achieve a total capacity of 80 Gbit/s up to 100-m-roundtrip link by multiplexing 2 OAM beams, each carrying a 40-Gbit/s quadrature-phase-shift-keying (QPSK) signal. Moreover, we investigate for static, hovering, and moving conditions the effects of channel impairments, including: tracking errors, propeller-induced airflows, power loss, intermodal crosstalk, and system bit error rate (BER). We find the following: (a) when the UAV hovers in the air, the power on the desired mode fluctuates by 2.1 dB, while the crosstalk to the other mode is -19 dB below the power on the desired mode; and (b) when the UAV moves in the air, the power fluctuation on the desired mode increases to 4.3 dB and the crosstalk to the other mode increases to -10 dB. Furthermore, the channel crosstalk decreases with an increase in OAM mode spacing.

physics.optics↗

arXiv2017

Using a Complex Optical Orbital-Angular-Momentum Spectrum to Measure Object Parameters: A Spatial Domain Approach

Light beams can be characterized by their complex spatial profiles in both intensity and phase. Analogous to time signals, which can be decomposed into multiple orthogonal frequency functions, a light beam can also be decomposed into a set of spatial modes that are taken from an orthogonal basis. Such a decomposition can provide a tool for spatial spectrum analysis, which may allow the stable, accurate and robust extraction of physical object information that may not be readily achievable using traditional approaches. As an example, we measure the opening angle of an object using the complex spectrum of orbital angular momentum (OAM) modes as the basis, achieving a more than 15 dB signal-to-noise ratio. We find that the dip (i.e., notch) positions of the OAM intensity spectrum are dependent on an object's opening angle but independent of the object opening's angular orientation, whereas the slope of the OAM phase spectrum is dependent on the object opening's orientation but independent on the opening angle.

physics.optics↗

arXiv2016

Is the line-like optical afterglow SED of GRB 050709 due to a flare?

Recently Jin et al. (2016) reanalyzed the optical observation data of GRB 050709 and reported a line-like spectral energy distribution (SED) component observed by the Very Large Telescope at $t\sim 2.5$ days after the trigger of the burst, which had been interpreted as a broadened line signal arising from a macronova dominated by iron group. In this work we show that an optical flare origin of such a peculiar optical SED is still possible. Interestingly, even in such a model, an "unusual" origin of the late-time long-lasting Hubble Space Telescope F814W-band emission is still needed and a macronova/kilonova is the natural interpretation.

astro-ph.HE↗

arXiv2016

Modelling Sentence Pairs with Tree-structured Attentive Encoder

We describe an attentive encoder that combines tree-structured recursive neural networks and sequential recurrent neural networks for modelling sentence pairs. Since existing attentive models exert attention on the sequential structure, we propose a way to incorporate attention into the tree topology. Specially, given a pair of sentences, our attentive encoder uses the representation of one sentence, which generated via an RNN, to guide the structural encoding of the other sentence on the dependency parse tree. We evaluate the proposed attentive encoder on three tasks: semantic similarity, paraphrase identification and true-false question selection. Experimental results show that our encoder outperforms all baselines and achieves state-of-the-art results on two tasks.

cs.CL↗

arXiv2016

Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems

This report summarizes two general frameworks, namely k2Q and k2U, that have been recently developed by us. The purpose of this report is to provide detailed evaluations and comparisons of these two frameworks. These two frameworks share some similar characteristics, but they are useful for different application cases. These two frameworks together provide comprehensive means for the users to automatically convert the pseudo polynomial-time tests (or even exponential-time tests) into polynomial-time tests with closed mathematical forms. With the quadratic and hyperbolic forms, k2Q and k2U frameworks can be used to provide many quantitive features to be measured and evaluated, 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 "blackbox" interfaces for providing polynomial-time schedulability tests and response time analysis for real-time applications. We have already presented their advantages for being applied in some models in the previous papers. However, it was not possible to present a more comprehensive comparison between these two frameworks. We hope this report can help the readers and users clearly understand the difference of these two frameworks, their unique characteristics, and their advantages. We demonstrate their differences and properties by using the traditional sporadic realtime task models in uniprocessor scheduling and multiprocessor global scheduling.

cs.DS↗

arXiv2016

k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis

In this paper, we present a general response-time analysis and schedulability-test framework, called k2Q (k to Q). It provides automatic constructions of closed-form quadratic bounds or utilization bounds for a wide range of applications in real-time systems under fixed-priority scheduling. The key of the framework is a $k$-point schedulability test or a $k$-point response time analysis that is based on the utilizations and the execution times of $k-1$ higher-priority tasks. The natural condition of k2Q is a quadratic form for testing the schedulability or analyzing the response time. The response time analysis and the schedulability analysis provided by the framework can be viewed as a "blackbox" interface that can result in sufficient utilization-based analysis. Since the framework is independent from the task and platform models, it can be applied to a wide range of applications. We show the generality of k2Q by applying it to several different task models. k2Q produces better uniprocessor and/or multiprocessor schedulability tests not only for the traditional sporadic task model, but also more expressive task models such as the generalized multi-frame task model and the acyclic task model. Another interesting contribution is that in the past, exponential-time schedulability tests were typically not recommended and most of time ignored due to high complexity. We have successfully shown that exponential-time schedulability tests may lead to good polynomial-time tests (almost automatically) by using the k2Q framework.

cs.DS↗

arXiv2016

Spatial Phase and Amplitude Structuring of Beams Using a Combination of Multiple Orthogonal Spatial Functions with Complex Coefficients

Analogous to time signals that can be composed of multiple frequency functions, we use uniquely structured orthogonal spatial modes to create different beam shapes. We tailor the spatial structure by judiciously choosing a weighted combination of multiple modal states within an orthogonal basis set, and we can tunably create beam phase and intensity "shapes" that are not otherwise readily achievable. As an example shape, we use a series of orbital-angular-momentum (OAM) functions with adjustable complex weights to create a reconfigurable spatial region of higher localized power as compared to traditional beam combining. We simulate a structured beam created by coherently combining several orthogonal OAM beams with different complex weights, and we achieve a >10X localized power density enhancement with 19 beams. Additionally, we can create unique shapes by passing a single beam through a specially designed phase and intensity mask that contains the combination of multiple OAM functions each with complex weights. Using this approach, we experimentally demonstrate a ~2.5X localized power density increase when utilizing 9 functions.

physics.optics↗

arXiv2016

Automatic Parameter Derivations in k2U Framework

We have recently developed a general schedulability test framework, called k2U, which can be applied to deal with a large variety of task models that have been widely studied in real-time embedded systems. The k2U framework provides several means for the users to convert arbitrary schedulability tests (regardless of platforms and task models) into polynomial-time tests with closed mathematical expressions. However, the applicability (as well as the performance) of the k2U framework relies on the users to index the tasks properly and define certain constant parameters. This report describes how to automatically index the tasks properly and derive those parameters. We will cover several typical schedulability tests in real-time systems to explain how to systematically and automatically derive those parameters required by the k2U framework. This automation significantly empowers the k2U framework to handle a wide range of classes of real-time execution platforms and task models, including uniprocessor scheduling, multiprocessor scheduling, self-suspending task systems, real-time tasks with arrival jitter, services and virtualizations with bounded delays, etc.

cs.DS↗

arXiv2016

Orbital Angular Momentum-based Space Division Multiplexing for High-capacity Underwater Optical Communications

To increase system capacity of underwater optical communications, we employ the spatial domain to simultaneously transmit multiple orthogonal spatial beams, each carrying an independent data channel. In this paper, we multiplex and transmit four green orbital angular momentum (OAM) beams through a single aperture. Moreover, we investigate the degrading effects of scattering/turbidity, water current, and thermal gradient-induced turbulence, and we find that thermal gradients cause the most distortions and turbidity causes the most loss. We show systems results using two different data generation techniques, one at 1064 nm for 10-Gbit/s/beam and one at 520 nm for 1-Gbit/s/beam, we use both techniques since present data-modulation technologies are faster for infrared (IR) than for green. For the higher-rate link, data is modulated in the IR, and OAM imprinting is performed in the green using a specially-designed metasurface phase mask. For the lower rates, a green laser diode is directly modulated. Finally, we show that inter-channel crosstalk induced by thermal gradients can be mitigated using multi-channel equalisation processing.

physics.optics↗

arXiv2016

Service Intelligence Oriented Distributed Data Stream Integration

Software as a service (SaaS) has recently enjoyed much attention as it makes the use of software more convenient and cost-effective. At the same time, the arising of users' expectation for high quality service such as real-time information or functionality provisioning brings about new challenges: to satisfy such (near) real-time requirements, real-time monitoring and effective processing of streaming data is necessary. However, due to the composition structure and multi-instance property of services, service data streams are often distributed, hard to synchronize and aggregate. We tackles these challenges by (1) proposing systematic associate strategies for relating distributed data; (2) introducing a new small window array mechanism for aggregating distributed data; (3) setting window parameters based on the cumulative distribution function (CDF) method; and (4) modeling streaming operators with queuing models for performance evaluation and prediction. Experiments show that our approach has good accuracy, completeness and acceptable performance measurement in processing distributed service data streams.

cs.SE↗