Search Results - "Huo, Yumei"
-
1
Visible-light promoted regioselective amination and alkylation of remote C(sp3)-H bonds
Published in Nature communications (19-03-2020)“…The C-N cross coupling reaction has always been a fundamental task in organic synthesis. However, the direct use of N-H group of aryl amines to generate…”
Get full text
Journal Article -
2
Dual-Functional Chiral Cu-Catalyst-Induced Photoredox Asymmetric Cyanofluoroalkylation of Alkenes
Published in ACS catalysis (03-05-2019)“…In the past decades, the Cu-catalyzed asymmetric organic reactions have been well-developed. By contrast, the potential of Cu to serve as a chiral…”
Get full text
Journal Article -
3
Visible Light Induced Cu-Catalyzed Asymmetric C(sp3)–H Alkylation
Published in Journal of the American Chemical Society (18-08-2021)“…The asymmetric functionalization of C–H is one of the most attractive strategies in asymmetric synthesis. In the past decades, catalytic enantioselective…”
Get full text
Journal Article -
4
Visible-light-mediated catalyst-free synthesis of unnatural α-amino acids and peptide macrocycles
Published in Nature communications (25-11-2021)“…The visible light induced, photocatalysts or photoabsorbing EDA complexes mediated cleavage of pyridinium C-N bond were reported in the past years. Here, we…”
Get full text
Journal Article -
5
A Robust Procedure for Determination of Immunosuppressants Cyclosporine A and Tacrolimus in Blood Samples with Detection of LC–MS/MS
Published in Chromatographia (01-03-2023)“…The immunosuppressants monitoring is crucial in the treatment of transplant patients to avoid the risk of organ rejection. So it is vital to develop an…”
Get full text
Journal Article -
6
Body fluids should be identified before estimating the time since deposition (TsD) in microbiome-based stain analyses for forensics
Published in Microbiology spectrum (02-04-2024)“…Identification and the time since deposition (TsD) estimation of body fluid stains from a crime scene could provide valuable information for solving the cases…”
Get full text
Journal Article -
7
Improved computer-aided detection of pulmonary nodules via deep learning in the sinogram domain
Published in Visual computing for industry, biomedicine and art (22-11-2019)“…Computer aided detection (CADe) of pulmonary nodules plays an important role in assisting radiologists’ diagnosis and alleviating interpretation burden for…”
Get full text
Journal Article -
8
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
Published in Theoretical computer science (18-03-2011)“…In the past, research on multiple criteria scheduling assumes that the number of available machines is fixed during the whole scheduling horizon and research…”
Get full text
Journal Article -
9
Speciation of inorganic arsenic in a sequential injection dual mini-column system coupled with hydride generation atomic fluorescence spectrometry
Published in Talanta (Oxford) (15-04-2009)“…The separation and speciation of inorganic arsenic(III) and arsenic(V) are facilitated by employing a novel sequential injection system incorporating two…”
Get full text
Journal Article -
10
Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine
Published in Annals of Computer Science and Information Systems (03-11-2016)Get full text
Journal Article -
11
Fast approximation algorithms for job scheduling with processing set restrictions
Published in Theoretical computer science (25-10-2010)“…We consider the problem of scheduling n independent jobs on m parallel machines, where the machines differ in their functionality but not in their processing…”
Get full text
Journal Article -
12
Approximation schemes for parallel machine scheduling with availability constraints
Published in Discrete Applied Mathematics (06-09-2011)“…We investigate the problems of scheduling n weighted jobs to m parallel machines with availability constraints. We consider two different models of…”
Get full text
Journal Article -
13
Minimizing total completion time in two-machine flow shops with exact delays
Published in Computers & operations research (01-06-2009)“…We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait…”
Get full text
Journal Article -
14
Exponential inapproximability and FPTAS for scheduling with availability constraints
Published in Theoretical computer science (28-06-2009)“…We investigate the problems of scheduling n weighted jobs to one or more identical machines with the constraint that the machines may be unavailable in some…”
Get full text
Journal Article -
15
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Published in European journal of operational research (16-02-2007)“…Consider a single machine and a set of n jobs that are available for processing at time 0. Job j has a processing time p j , a due date d j and a weight w j …”
Get full text
Journal Article -
16
Parallel machine makespan minimization subject to machine availability and total completion time constraints
Published in Journal of scheduling (01-08-2019)“…In this paper, we study the parallel machine scheduling subject to machine availability constraint. The jobs can be resumed after being preempted by another…”
Get full text
Journal Article -
17
Integrated production and delivery scheduling with disjoint windows
Published in Discrete Applied Mathematics (28-04-2010)“…Consider a company that manufactures perishable goods. The company relies on a third party to deliver goods, which picks up delivery products at regular or…”
Get full text
Journal Article -
18
Two machine scheduling subject to arbitrary machine availability constraint
Published in Omega (Oxford) (01-04-2018)“…•We study two machine scheduling subject to arbitrary availability constraint.•Our goal is to optimize ∑Cj, ∑Cj/Cmax , and Cmax /∑Cj.•We show all three…”
Get full text
Journal Article -
19
Total completion time minimization on multiple machines subject to machine availability and makespan constraints
Published in European journal of operational research (01-06-2015)“…•We study bi-criteria scheduling with limited machine availability.•Our goal is to minimize ∑Cj subject to the condition that Cmax ≤ T.•We show the problem,…”
Get full text
Journal Article -
20
Online scheduling of equal-processing-time task systems
Published in Theoretical computer science (23-07-2008)“…We consider the problem of online scheduling a set of equal-processing-time tasks with precedence constraints so as to minimize the makespan. For arbitrary…”
Get full text
Journal Article