Synthesis and characterization of poly(N‐vinyl‐2‐pyrrolidone) grafted sodium alginate hydrogel beads for the controlled release of indomethacin

Graft copolymers of sodium alginate (NaAlg) with N‐vinyl‐2‐pyrrolidone were prepared using azobisisobutyronitrile as initiator. The graft copolymers (NaAlg‐g‐PVP) were characterized with Fourier transform infrared spectroscopy, elemental analysis, and differential scanning calorimetry. Polymeric hydrogel beads of NaAlg and NaAlg‐g‐PVP were prepared by crosslinking method using glutaraldehyde (GA) as a crosslinker in the hydrochloric acid catalyst (HCl) and these beads were used to deliver anti‐inflammatory drug, indomethacin (IM). Chemical stability of the IM after encapsulation into beads was confirmed by FTIR. Preparation conditions of the NaAlg‐g‐PVP beads were optimized by considering the percentage entrapment efficiency, particle size, swelling capacity and their release data. In vitro release studies were performed in simulated gastric fluid (pH 1.2) for the initial 2 h, followed by simulated intestinal fluid (pH 7.4) for 4 h. Effects of GA concentration, exposure time to GA, drug/polymer (d/p) ratio, and concentration of HCl on the release of IM were discussed. It was observed that IM release from the beads decreased with increasing GA concentration and exposure time. IM release also decreases with increasing d/p ratio and HCl concentration. The highest IM release was obtained to be 77% for beads crosslinked with 0.027M GA. Swelling experiments were also performed to compute molecular mass between crosslinks of the beads. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

Chemical,thermal, and mechanical properties and ultraviolet transmittance of novel nano-hydroxyapatite/polyethylene terephthalate milk bottles

Polyethylene terephthalate (PET)/nano-hydroxyapatite (nHAp) composite granules were obtained using twin-screw extruder. Preforms were prepared by injection molding and then PET/nHAp bottles were produced by blow molding. For PET bottles with nHAp, the migration amounts of carboxylic acid (COOH), acetaldehyde (AA), diethylene glycol (DEG), and isophthalic acid (IPA); glass transition temperature (T_g); melting temperature (T_m); and the maximum crystallization temperature (T_cry) were measured. The load-carrying capacity, burst strength, stress cracking, and regional material distribution tests were carried out on the bottles. X-ray diffraction, scanning electron microscopy, Fourier transform infrared spectroscopy, differential scanning calorimetry, and ultraviolet transmittance analyses were conducted to explain the changes in mechanical, chemical, physical properties, and light transmission of bottles. It was found out that the COOH amount increased and the AA content decreased with increasing nHAp amount. On the other hand, no change was observed in the amounts of DEG and IPA. Although the mechanical properties such as load-carrying capacity and burst strength of the bottles have improved, it has been determined that the standard environmental stress crack resistance test procedure cannot be applied to such a composite. Experimental findings indicate that nHAp disrupts the chemical structure of PET and it isolates harmful chemicals such as AA by forming intermolecular bonds. Moreover, with the addition of up to 0.8% nHAp, PET bottles block the light transmission approximately 80% within 400–700 nm wave length zone. The study demonstrates that the PET/nHAp composite bottles can be used in the food industry, particularly in the packaging of milk and milk products which are vulnerable to light exposure.     

Fair referee assignments for professional football leagues

Assignment of referees to football games is an important problem faced in professional football leagues. Despite its importance, the problem has received limited academic attention. This paper presents a model and analysis of the problem for fair referee assignments, and develops a constructive heuristic and a local search procedure for its solution. Results from an extensive computational study show that the methods are effective in solving the problem in a second of computation time and yielding an excellent solution quality.     

Interpretation of MR images using self-organizing maps and knowledge-based expert systems

A new image segmentation system is presented to automatically segment and label brain magnetic resonance (MR) images to show normal and abnormal brain tissues using self-organizing maps (SOM) and knowledge-based expert systems. Elements of a feature vector are formed by image intensities, first-order features, texture features extracted from gray-level co-occurrence matrix and multiscale features. This feature vector is used as an input to the SOM. SOM is used to over segment images and a knowledge-based expert system is used to join and label the segments. Spatial distributions of segments extracted from the SOM are also considered as well as gray level properties. Segments are labeled as background, skull, white matter, gray matter, cerebrospinal fluid (CSF) and suspicious regions.     

Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints

Given an undirected network with positive edge costs and a positive integer $d>2$, the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least $d$. This problem is new to the literature while the related problem with upper bound constraints on degrees is well studied. Mixed-integer programs proposed for either type of problem is composed, in general, of a tree-defining part and a degree-enforcing part. In our formulation of the minimum-degree constrained minimum spanning tree problem, the tree-defining part is based on the Miller–Tucker–Zemlin constraints while the only earlier paper available in the literature on this problem uses single and multi-commodity flow-based formulations that are well studied for the case of upper degree constraints. We propose a new set of constraints for the degree-enforcing part that lead to significantly better solution times than earlier approaches when used in conjunction with Miller–Tucker–Zemlin constraints.     

Approximation by Stancu–Chlodowsky polynomials

In this paper, we investigate convergence and approximation properties of a Chlodowsky type generalization of Stancu polynomials (we called Stancu–Chlodowsky polynomials).The rates of convergence of this generalization are obtained by means of modulus of continuity and by using the $K$-functional of Peetre. We also present and prove theorems on weighted approximation and the order of approximation of continuous functions by these operators on all positive semi-axis.     

A stochastic neighborhood search approach for airport gate assignment problem

An appropriate and efficient gate assignment is of great importance in airports since it plays a major role in the revenue obtained from the airport operations. In this study, we have focused mainly on maximum gate employment, or in other words minimize the total duration of un-gated flights. Here, we propose a method that combines the benefits of heuristic approaches with some stochastic approach instead of using a purely probabilistic approach to top-down solution of the problem. The heuristic approaches are usually used in order to provide a fast solution of the problem and later stochastic searches are used in order to ameliorate the previous results of the heuristic approach whenever possible. The proposed method generates an assignment order for the whole planes that corresponds to assignment priority. The ordering process is followed by the allocation step. Since, in practice, each airport has its own physical architecture, there have been arisen many constraints mainly concerning airplane types and parking lots in this step. Sequentially handling the plane ordering and allocation phases provides us great modularity in handling the constraints. The effectiveness of the proposed methodology has been tried to be illustrated firstly on fictively generated flight schedule data and secondly on the real world data obtained from a real world application developed for ?stanbul Atatürk Airport.