Scheduling two agents with controllable processing times

We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost. The objective function for agent B is always the same, namely a regular function _fmax$f_{\text{max}}$. Several different objective functions are considered for agent A, including the total completion time plus compression cost, the maximum tardiness plus compression cost, the maximum lateness plus compression cost and the total compression cost subject to deadline constraints (the imprecise computation model). All problems are to minimize the objective function of agent A subject to a given upper bound on the objective function of agent B. These problems have various applications in computer systems as well as in operations management. We provide NP-hardness proofs for the more general problems and polynomial-time algorithms for several special cases of the problems.     

A penalty function method based on bilevel programming for solving inverse optimal value problems

In this work, we reformulate the inverse optimal value problem equivalently as a corresponding nonlinear bilevel programming (BLP) problem. For the nonlinear BLP problem, the duality gap of the lower level problem is appended to the upper level objective with a penalty, and then a penalized problem is obtained. On the basis of the concept of partial calmness, we prove that the penalty function is exact. Then, an algorithm is proposed and an inverse optimal value problem is resolved to illustrate the algorithm.     

Greedy approximations for minimum submodular cover with submodular cost

It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ)-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ) is the γ-th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonlinear) and/or fractional submodular potential function f.     

Cathodoluminescence investigation of residual stress in Er3+:YAlO3 thin films grown on (110) SrTiO3 substrate by metal-organic chemical vapor deposition

YAlO3 thin films doped with different amounts of Er3+ have been grown directly onto (110) SrTiO3 substrate using the metal-organic chemical vapor deposition method (MOCVD). X-ray diffraction patterns and the rocking curve of the (002) reflection point to the growth of <001>-oriented YAlO3 phase. Piezo-spectroscopic (PS) biaxial calibration was performed on two luminescence bands, related to transitions from the (4)S3/2 excited state, using a specially designed ball-on-ring loading jig. Such a PS calibration allowed us to retrieve the rate of wavelength shift with stress without separating the grown film from the substrate. The outcome of the PS calibration has been applied to build up in the field emission scanning electron microscope (FEG-SEM) high-resolution maps of the residual stress field developed in the film. Results indicate that the residual stress in Er3+:YAlO3 films were compressive in nature and increased with increasing Er3+ dopant concentration.     

股票价格的马氏链预测模型

本文探讨了马尔科夫链的预测技术,利用马氏链预测方法分析了申华控股(600653)价格的变动情况,对其价格进行短期预测和长期涨跌趋势、运动周期的预测,研究结果与实际情况比较一致。     

A new sieve for distinct coordinate counting

We present a new sieve for the distinct coordinate counting problem. This significantly improves the classical inclusion-exclusion sieve for this problem, in the sense that the number of terms is reduced from $ 2^{(_2^k )} $ to k!, and reduced further to p(k) in the symmetric case, where p(k) denotes the number of partitions of k. As an illustration of applications, we give an in-depth study of a basic example arising from coding theory and graph theory.     

The Dining Cryptographer Problem-Based Anonymous Quantum Communication via Non-maximally Entanglement State Analysis

We demonstrate an anonymous quantum communication (AQC) via the non-maximally entanglement state analysis (NESA) based on the dining cryptographer problem (DCP). The security of the present AQC is ensured due to the quantum-mechanical impossibility of local unitary transformations between non-maximally entanglement states, which provides random numbers for the secure AQC. The analysis shows that the DCP-based AQC can be performed without intractability through the NESA in the multi-photon entangled quantum system.     

Microstructure,Interfacial Interactions,and Rheological Properties of PC/AES/Montmorillonite Composites

Polycarbonate (PC) and acrylonitrile–EPDM (ethylene/propylene/diene elastomer)–styrene ter‐polymer (AES) blends and PC/AES/organically modified montmorillonite (OMMT) composites were prepared at 20%, 40%, 50% by weight of AES and 3% by weight of OMMT. The microstructure, interfacial interactions, and rheological properties of the PC/AES blends and PC/AES/OMMT composites were studied systematically. X‐ray diffractometer (XRD) results reveal that the AES is easier to intercalate into OMMT than PC, and the content of AES has a little effect on the interlayer distance of OMMT. Wetting coefficient calculation indicates that OMMT distributes primarily at the interface of the polymer blend. Field emission scanning electron microscope (FE‐SEM) observation indicates that the phase morphology of PC/AES blends and PC/AES/OMMT composites is not influenced by the OMMT. However, linear rheological properties suggest that the addition of OMMT has a great effect on the linear rheological property.     

Photo‐Degradable,Protein–Polyelectrolyte Complex‐Coated,Mesoporous Silica Nanoparticles for Controlled Co‐Release of Protein and Model Drugs

The fabrication of photo‐degradable, protein–polyelectrolyte complex (PPC)‐coated, mesoporous silica nanoparticles (MSNs) and their controlled co‐release of protein and model drugs is reported. Random copolymers composed of oligo(ethylene glycol) monomethyl ether methacrylate (OEGMA), and a photolabile o‐nitrobenzyl‐containing monomer, 5‐(2′‐(dimethylamino)ethoxy)‐2‐nitrobenzyl methacrylate (DENBMA), are first anchored onto the MSNs and then quaternary aminated, to obtain positively charged P(OEGMA‐co‐TENBMA) which exhibits photo‐induced charge conversion characteristics. PPCs consisting of P(OEGMA‐co‐TENBMA) and the protein bovine serum albumin (BSA) are utilized as capping agents for the nanopores of the MSNs. Upon UV irradiation, charge conversion of P(OEGMA‐co‐TENBMA) can lead to the disruption of PPCs on MSNs and co‐release of BSA and rhodamine B by electrostatic repulsion.     

Convenient One‐Pot Synthesis of α‐Amino Phosphonates in Water Using p‐Toluenesulfonic Acid as Catalyst for the Kabachnik–Fields Reaction

The three‐component Kabachnik–Fields reaction of substituted salicylaldehydes, aromatic amine, and triphenyl phosphite in water was effectively catalyzed by p‐toluenesulfonic acid to give various α‐amino phosphonates in good yields. The catalyst is easily available and inexpensive, and the process is green and mild. © 2013 Wiley Periodicals, Inc. Heteroatom Chem 24:110–115, 2013; View this article online at wileyonlinelibrary.com . DOI 10.1002/hc.21071