The Applicability Of Ordered Mesoporous Sba-15 And Its Hydrophobic Glutaraldehyde-bridge Derivative To Improve Ibuprofen-loading In Releasing System.

The mesoporous SBA-15 silica with uniform hexagonal pore, narrow pore size distribution and tuneable pore diameter was organofunctionalized with glutaraldehyde-bridged silylating agent. The precursor and its derivative silicas were ibuprofen-loaded for controlled delivery in simulated biological fluids. The synthesized silicas were characterized by elemental analysis, infrared spectroscopy, (13)C and (29)Si solid state NMR spectroscopy, nitrogen adsorption, X-ray diffractometry, thermogravimetry and scanning electron microscopy. Surface functionalization with amine containing bridged hydrophobic structure resulted in significantly decreased surface area from 802.4 to 63.0 m(2) g(-1) and pore diameter 8.0-6.0 nm, which ultimately increased the drug-loading capacity from 18.0% up to 28.3% and a very slow release rate of ibuprofen over the period of 72.5h. The in vitro drug release demonstrated that SBA-15 presented the fastest release from 25% to 27% and SBA-15GA gave near 10% of drug release in all fluids during 72.5 h. The Korsmeyer-Peppas model better fits the release data with the Fickian diffusion mechanism and zero order kinetics for synthesized mesoporous silicas. Both pore sizes and hydrophobicity influenced the rate of the release process, indicating that the chemically modified silica can be suggested to design formulation of slow and constant release over a defined period, to avoid repeated administration.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.