An improved online two-dimensional liquid chromatography-quadrupole time-of-flight mass spectrometry (2D LC-QToF MS) system was developed for the lipid profiling of human plasma, in which different lipid classes were separated by the first dimensional normal-phase (NP) LC and different lipid molecular species were separated by the second dimensional reversed-phase (RP) LC. This 2D LC-QToF MS sy...

The proof of Toda’s celebrated theorem that the polynomial hierarchy is contained in P relies on the fact that, under mild technical conditions on the complexity class C, we have ∃ C ⊂ BP · ⊕ C. More concretely, there is a randomized reduction which transforms nonempty sets and the empty set, respectively, into sets of odd or even size. The customary method is to invoke Valiant’s and Vazirani’s...

Recently, Watanabe proposed a framework for testing the correctAbstract-1 ness and average-case performance of algorithms that purport to solve a given NP search problem efficiently on average with respect to some distribution on the instances. The idea is to randomly generate certified instances under some distribution that resembles the input distribution. Watanabe showed that unless RE = NE,...

Notoginseng is a classical traditional Chinese medical herb, which is of high economic and medical value. Notoginseng powder (NP) could be easily adulterated with Sophora flavescens powder (SFP) or corn flour (CF), because of their similar tastes and appearances and much lower cost for these adulterants. The objective of this study is to quantify the NP content in adulterated NP by using a rapi...

There is a well-developed theory about the algorithmic complexity of optimization problems. Complexity theory provides negative results which typically are based on assumptions like NP 6=P or NP 6=RP. Positive results are obtained by the design and analysis of clever algorithms. These algorithms are well-tuned for their specific domain. Practitioners, however, prefer simple algorithms which are...

We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form “if a state with property Rq is visited, then later a state with property Rp is visited”. The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-comple...

The eld of Inductive Logic Programming (ILP), which is concerned with the induction of Horn clauses from examples and background knowledge , has received increased attention over the last time. Recently, some positive results concerning the learnability of restricted logic programs have been published. In this paper we review these restrictions and prove some lower-bounds of the computational c...