Singularity Formation in Fractional Burgers’ Equations

The formation of singularities in finite time in nonlocal Burgers’ equations, with time-fractional derivative, is studied in detail. The occurrence of finite-time singularity is proved, revealing the underlying mechanism, and precise estimates on the blowup time are provided. The employment of the present equation to model a problem arising in job market is also analyzed.

     

Multiplexed therapeutic drug monitoring of antipsychotics in dried plasma spots by LC‐MS/MS

In this work, a convenient method for the therapeutic monitoring of seven common antipsychotic drugs in “dried plasma spot” samples has been developed. It is based on the liquid chromatography tandem mass spectrometry technique, operating in multiple reaction monitoring mode, and a straightforward procedure for the simultaneous extraction of all antipsychotics in a single step, with high extraction yield. The method was fully validated with proper accuracy, precision, selectivity and sensitivity, for all the drugs. Limits of quantification were 0.12, 1.09, 1.46, 1.47, 5.70, 1.32, 1.33 µg/L for haloperidol, aripiprazole, olanzapine, quetiapine, clozapine, risperidone, and paliperidone, respectively. Accuracy, intra‐ and interday precision values were <10% for all drugs at all concentration levels examined. The method was tested in the analysis of 30 plasma samples from real patients for each drug. The proposed analytical approach, by combining practical and logistical advantages of microsampling with liquid chromatography tandem mass spectrometry analytical performance, could offer an ideal strategy for accurate and timely therapeutic drug monitoring of antipsychotic drugs in most clinical settings, even in remote centers and/or in out‐patient settings, bringing so many potential improvements in psychiatric patient care.     

Mixing method influence on compatibility and polymorphism studies by DSC and statistical analysis

Most of the pharmaceutical products are formulated as solid dosage form, which may present drug–excipient interactions that lead to changes in the chemical nature of the drug, such as solubility and bioavailability and may compromise its safety and effectiveness. Differential scanning calorimetry (DSC) is a widely used method for the rapid evaluation of the drug-excipient compatibility and the stability of the mixture formed; however, there is no consensus on the preparation methods of the drug–excipient mixtures. The aim of this study was to investigate the influence of the mixing method on the drug–excipient compatibility studies by means of DSC analysis, using tenofovir disoproxil fumarate as a drug model. Statistical analysis revealed significant differences in the heat of fusion of the drug in the mixtures prepared by several mixing methods. Vortex Mixer with a Pop-Off Cup used for 3 min proved to be very satisfactory for these studies. A polymorphic transition was observed in the mixture prepared with the mortar and pestle. Therefore, this method should be avoided since it may induce errors in the interpretation of DSC results. In this way, the mixing method used to prepare a mixture for studies of interactions between the API and the excipients in a pharmaceutical formulation has a great influence on the results and it must be chosen carefully.     

Hardy-type estimates for Dirac operators

We prove some Hardy type inequalities related to the Dirac operator by elementary methods, for a large class of potentials, which even includes measure valued potentials. Optimality is achieved by the Coulomb potential. When potentials are smooth enough, our estimates provide some spectral information on the operator.     

Metaheuristics for the team orienteering problem

The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances.     

Maximal partial spreads in PG (3, q)

We transfer the whole geometry of PG(3, q) over a non-singular quadric Q_4,q of PG(4, q) mapping suitably PG(3, q) over Q_4,q. More precisely the points of PG(3, q) are the lines of Q_4,q; the lines of PG(3, q) are the tangent cones of Q_4,q and the reguli of the hyperbolic quadrics hyperplane section of Q_4,q. A plane of PG(3, q) is the set of lines of Q_4,q meeting a fixed line of Q_4,q. We remark that this representation is valid also for a projective space over any field K and we apply the above representation to construct maximal partial spreads in PG(3, q). For q even we get new cardinalities for For q odd the cardinalities are partially known.     

On a Question of Haskell P. Rosenthal Concerning a Characterization of c0 and lp

The following property of a normalized basis in a Banach spaceis considered: any normalized block sequence of the basis hasa subsequence equivalent to the basis. Under uniformity or othernatural assumptions, a basis with this property is equivalentto the unit vector basis of c₀ or l_p. An analogous problem concerningspreading models is also addressed. 2000 Mathematics SubjectClassification 46B20 (primary), 46B15 (secondary).