bluuebunny/crossref_metadata_2025_split huggingface dataset:
Immobilized ECM molecules and the effects of concentration and surface type on the control of NSC differentiation
Authors: Wilkinson Ashley E. , Kobelt Liza J. , Leipzig Nic D. 
Published: October 2013

AbstractNew developments in growth factor and pharmaceutical control of cells for neural regenerative strategies have built a need for high throughput assays to conveniently screen these treatments in vitro before moving to more complex experiments. Towards this application, we have studied an easy and highly reproducible culture regime with a renewable cell source for central nervous system (CNS) strategies. Adult neural stem cells (NSCs) derived from the CNS are attractive for use in screening assay because they are easily expanded and can differentiate into all major CNS cell types. NSCs were cultured on glass alone or methacrylamide chitosan (MAC) hydrogel coated glass substrates, immobilized with extracellular matrix (ECM) proteins collagen and laminin at varying densities. Proteins were also adsorbed on the surfaces as a control. We found that adsorbed protein on hydrogel coated glass resulted in the highest cell densities after 8 d, over twice the density of immobilized groups or adsorbed protein on glass. No significant differences were observed between collagen, laminin, or both proteins together regarding cell differentiation (p > 0.05); however, the morphological spreading and branching of differentiated NSC processes was enhanced on MAC substrates with covalently immobilized laminin protein. The results of this study suggest that a soft MAC hydrogel surface with adsorbed protein would be most desirable for specifying neuronal differentiation of large numbers of stem cells due to the high cellularities they supported. © 2013 Wiley Periodicals, Inc. J Biomed Mater Res Part A: 102A: 3419–3428, 2014.
Development of polycaprolactone porous scaffolds by combining solvent casting, particulate leaching, and polymer leaching techniques for bone tissue engineering
Authors: Thadavirul Napapaphat , Pavasant Prasit , Supaphol Pitt 
Published: October 2013

AbstractSodium chloride and polyethylene glycol (PEG) were used as water‐soluble porogens for the formation of porous polycaprolactone (PCL) scaffolds. The main purpose was to prepare and evaluate in vitro efficacy of highly interconnected, three‐dimensional, porous polymeric scaffolds, as obtained from the combined particulate and polymer leaching techniques. Microscopic analysis confirmed the high interconnectivity of the pores and relatively uniform pore size of 378–435 μm. The PCL scaffolds were further characterized for their density and pore characteristics, water absorption and flow behaviors, and mechanical properties and the potential for their use as bone scaffolding materials was evaluated in vitro using mouse calvaria‐derived preosteoblastic cells (MC3T3‐E1). Evidently, the use of PEG as the secondary porogen not only improved the interconnectivity of the pore structures but also resulted in the PCL scaffolds that exhibited much better support for the proliferation and differentiation of the cultured bone cells. © 2013 Wiley Periodicals, Inc. J Biomed Mater Res Part A: 102A: 3379–3392, 2014.
Exploration of Potential Tumor Markers for Lung Adenocarcinomas by Two‐Dimensional Gel Electrophoresis Coupled with Nano‐LC/MS/MS
Authors: Harn Horng‐Jyh , Chen Yi‐Lin , Lin Po‐Cheng , Cheng Yeung‐Leung , Lee Shin‐Chun , Chiou Tzyy‐Wen , Yang Hsueh‐Hui 
Published: October 2013

AbstractTo explore the potential tumor markers for lung adenocarcinoma, two‐dimensional gel electrophoresis (2DE) coupled with nano‐LC/MS/MS was used to analyze the differentially expressed proteins in 10 surgical resected lung adenocarcinoma tissues. 16 proteins were significantly different between the cancer tissue and adjacent normal tissue. Galectin‐1, peroxiredoxin II (Prx II), proapolipoprotein, glyceraldehyde‐3‐phosphate dehydrogenase (GAPDH), aldolase A, enolase 1, neuropolypeptide h3, Prx V, cyclophilin A, vimentin, protein disulfide isomerase (PDI), tropomyosin 3 (TPM 3), glutathione S‐transferase Pi (GST‐Pi), manganese superoxide dismutase (MnSOD), and cofilin 1 were up‐regulated in the cancer tissue. On the other hand, profilin was down‐regulated in the cancer tissue. Among these proteins, six proteins were validated by Western blot analysis. The identified proteins contributing to the spectrum of cancer progression may be used as potential diagnostic biomarkers for lung adenocarcinomas.
Host (Nano Cage NaY)/Guest Mn(II), Co(II), Ni(II) and Cu(II) Complexes of N,N‐Bis(3,5‐Di‐Tert‐Butylsalicyidene)‐2,2‐Dimethyle‐1,3‐Diaminopropane: Synthesis and Catalyst Activity
Authors: Zendehdel M. , Khanmohamadi H. , Mokhtari M. 
Published: October 2013

AbstractMn(II), Co(II), Ni(II) and Cu(II) and N,N‐bis(3,5‐di‐tert‐butylsalicyidene)‐2,2‐dimethyle‐1,3‐diaminopropane complexes have been synthesized in Y zeolite cavity by the reaction of ion‐exchanged metal ions with the flexible ligand molecules. The host‐guest materials obtained have been characterized by elemental analysis, XRD, surface area, pore volume, TGA, FT‐IR and UV‐Vis techniques. Analysis of data indicates that formation of complexes in the pores Y zeolite without affecting the zeolite framework structure. Also, we report the oxidation of cyclohexanol catalyzed by host‐guest catalyst with tert‐buthyl hydrogen peroxide as oxygen donor. The activity of benzyl alcohol oxidation decreases in the series‐[Co(L)]/NaY > [Cu(L)]/NaY > [Mn(L)]/NaY > [Ni(L)]/NaY and the percent of product completely depend to catalyst. Zeolite complexes are stable enough to be reused and are suitable to be utilized as partial oxidation catalysts.
On the minimization of a certain convex function arising in applied decision theory
Authors: Ericson W. A. 
Published: October 2013

AbstractThe author, in an expository paper [4], has presented an algorithm for choosing a non‐negative vector magnified image to minimize the function magnified image subject to the constraint magnified image, where magnified image are given vectors and {\rm \vec M} is positive definite symmetric. In this paper a derivation of this algorithm is presented, including an exact solution in a degenerate case, only alluded to in [4], Several applications, in addition to that of [4], are briefly indicated.
On some sequencing problems
Authors: Szwarc Wlodzimierz 
Published: October 2013

AbstractThe (mxn) sequencing problem may be characterized as follows: There are m machines which can produce a piece consisting of n parts. Each part has a determined order in which it is processed through the machines. It is assumed that each machine cannot deal with more than one part at a time and that the processing required for each part can be accomplished only on one machine. That is, the machines are all specialized so that alternate machines for the same processing on a part is not possible. The problem is to find the best production plan consisting in sequencing the different parts so as to make the whole amount of time from the beginning of work till the piece is completed the shortest possible. Such a plan is called an optimum one. In the first 4 sections of this paper, the problem (2xn) is solved for the (2xn) case in which the order in which parts come on the machine is not constrained by further assumptions. The remainder of the paper then takes up: 1) the (3xn) problem of Bellman‐Johnson (viz. the technological processing order through the machine is the same for all parts) for several new special cases; 2) the 2xn problem of sequencing when delay times must also be considered; and, 3) some properties of an approximating method for solving (mxn) problems, including a delineation of cases when the approximating method will yield optimal solutions.
Schedule algebra: A progress report
Authors: Giffler Bernard 
Published: October 2013

AbstractThe following paper is the first part of a summary of the schedule algebraic method and its applications to date. It covers the origin and motivation of the schedule algebraic technique, the current status of the algebra as a mathematical system, and a brief outline of the theory of scheduling which the algebra is used to support. Part II of the Progress Report will be published at a later time. It will review applications of the algebra to practical problems and experience gained in the use of the algebra to schedule on‐going production systems.
Adaptive competitive decision in repeated play of a matrix game with uncertain entries
Authors: Sweat Calvin W. 
Published: October 2013

AbstractThis study is concerned with a game model involving repeated play of a matrix game with unknown entries; it is a two‐person, zero‐sum, infinite game of perfect recall. The entries of the matrix ((pij)) are selected according to a joint probability distribution known by both players and this unknown matrix is played repeatedly. If the pure strategy pair (i, j) is employed on day k, k = 1, 2, …, the maximizing player receives a discounted income of βk ‐ 1 Xij, where β is a constant, 0 ≤ β ⩽ 1, and Xij assumes the value one with probability pij or the value zero with probability 1 ‐ pij. After each trial, the players are informed of the triple (i, j, Xij) and retain this knowledge. The payoff to the maximizing player is the expected total discounted income.It is shown that a solution exists, the value being characterized as the unique solution of a functional equation and optimal strategies consisting of locally optimal play in an auxiliary matrix determined by the past history.A definition of an ϵ‐learning strategy pair is formulated and a theorem obtained exhibiting ϵ‐optimal strategies which are ϵ‐learning. The asymptotic behavior of the value is obtained as the discount tends to one.
Derivation and application of unit cost expressions perturbed by design changes
Authors: James Paul Meyer 
Published: October 2013

AbstractLearning curves have been used extensively to predict future costs in the airframe and other industries. This paper deals with the effect of perturbations induced by design changes on the learning curves. Equations that are developed and applied make it possible to predict future costs accurately in a perturbed environment. The formulations can be used effectively in EDP programs.
On maximization of the integral of a bell‐shaped function over a symmetric set
Authors: Gilliland Dennis C. 
Published: October 2013

AbstractGiven a target T in Euclidean n‐space Rn and a point bomb whose point of impact in Rn is governed by a probability distribution about the aim point a, what choice of a maximizes the probability of a hit va(T)? Of course, only in special cases is an exact solution of this problem obtainable. This paper treats targets T which are symmetric about the origin o and demonstrates conditions on the extent of T and the impact density f, a density with respect to Lebesgue measure, sufficient for va(T) to be monotone in the distance from a to o and maximized at a = o. The results are applied to various tactical situations.
On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
Authors: Charnes A. , Cooper W. W. , Kortanek K. O. 
Published: October 2013

AbstractWe first present a survey on the theory of semi‐infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi‐infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n‐space with maximization of a linear function in non‐negative variables of a generalized finite sequence space subject to a finite system of linear equations.We then present a new generalization of the Kuhn‐Tucker saddle‐point equivalence theorem for arbitrary convex functions in n‐space where differentiability is no longer assumed.
On two nonprobabilistic utility measures for weapon systems
Authors: Enzer Hermann 
Published: October 2013

AbstractIn this paper an attempt is made to derive two interval utility measures for public goods. The domain of the measures is partitioned into priority classes in such a way that each class contains an element, called a kernel, which can be moved by parameter variation to the immediately preceding class. The “expansion path” from priority class to priority class is determined by an optimality criterion. The measures themselves are based on optimality conditions that are similar to the familiar first‐order conditions of consumer analysis. One is a product measure and the other one is additive.
Inventory control of by‐products
Authors: Evans Richard V. 
Published: October 2013

AbstractThe system to be controlled produces n products simultaneously in fixed proportions every time it is activated. Demands for the products in any period are components of an n dimensional vector random variable with known distribution function. Cases of excess demands backlogged and excess demands lost are considered. In the former the notion of k convexity can be generalized to guarantee relatively simple form for the optimal policy in an n decision problem. In the latter, this generalization was not successful although when there is no setup cost, a convexity argument can be used to show that the optimal policy has a simple form.
Problems in life cycle support cost estimation
Authors: Goldman A. S. 
Published: October 2013

AbstractAlthough industry is expected to design hardware to fit into a general support system and to be capable of arguing life‐cycle system costs, adequate information has not been available on the support system in terms of policies and operating decision rules. Policies and operating decisions by users dominate engineering design decisions in determining life‐cycle support costs. The relative effect of each of these decision areas on support costs has yet to be resolved empirically. Without an understanding of the sensitivity of support costs to alternative designs, capability is limited in design improvement and support of end items. Life‐cycle costing of analysis under cost‐effectiveness and the maintainability of integrated logistics support is open to question.
Bayes sequential design of stock levels
Authors: Zacks S. 
Published: October 2013

AbstractBayesian determination of optimal stock levels is studied for the case of Poisson distribution of the demand variable, and prior gamma distribution of the expected demand. Bayes sequential procedure is derived, assuming that stock level can be adjusted at the beginning of each period so that a shortage can be immediately replenished and an overstock can be corrected. The Bayes sequential procedure is more difficult to obtain if this assumption is removed. A dynamic programming method for obtaining the general Bayes sequential procedure is outlined. Finally, an empiric Bayes estimation procedure of the optimal Bayesian stock level is presented.
A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables
Authors: Gross Donald , Soland Richard M. 
Published: October 2013

AbstractA branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least‐cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made.
A test for the hypothesis that two extreme‐value scale parameters are equal
Authors: Mann Nancy R. 
Published: October 2013

AbstractA statistic is determined for testing the hypothesis of equality for scale parameters from two populations, each of which has the first asymptotic distribution of smallest (extreme) values. The probability distribution is derived for this statistic, and critical values are determined and given in tabular form for a one‐sided or two‐sided alternative, for censored samples of size n1 and n2, n1 = 2, 3, …. 6, n2 = 2, 3, …. 6. The power function of the test for certain alternatives is also calculated and listed in each case considered.
The discrete max‐min problem
Authors: Randolph P. H. , Swinson G. E. 
Published: October 2013

AbstractThe historic max‐min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max‐min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max‐min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max‐min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.
Optimum quantiles for the linear estimation of the parameters of the extreme value distribution in complete and censored samples
Authors: Chan Lai K. , Kabir A. B. M. Lutful 
Published: October 2013

AbstractThe present study is concerned with the determination of a few observations from a sufficiently large complete or censored sample from the extreme value distribution with location and scale parameters μ and σ, respectively, such that the asymptotically best linear unbiased estimators (ABLUE) of the parameters in Ref. [24] yield high efficiencies among other choices of the same number of observations. (All efficiencies considered are relative to the Cramér‐Rao lower bounds for regular unbiased estimators.) The study is on the asymptotic theory and under Type II censoring scheme.For the estimation of μ when σ is known, it has been proved that there exists a unique optimum spacing whether the sample is complete, right censored, left censored, or doubly censored. Several tables are prepared to aid in the numerical computation of the estimates as well as to furnish their efficiencies.For the estimation of σ when μ is known, it has been observed that there does not exist a unique optimum spacing. Accordingly we have obtained a spacing based on a complete sample which yields high efficiency. A similar table as above is prepared.When both μ and σ are unknown, we have considered four different spacings based on a complete sample and chosen the one yielding highest efficiency. A table of the efficiencies is also prepared.Finally we apply the above results for the estimation of the scale and/or shape parameters of the Weibull distribution.
Optimal policies under the shortage probability criterion for an inventory model with unknown dependent demands
Authors: Iglehart Donald L. , Jaquette Stratton C. 
Published: October 2013

AbstractThe principal innovation in this paper is the consideration of a new objective function for inventory models which we call the shortage probability criterion. Under this criterion we seek to minimize the total expected discounted cost of ordering subject to the probability that the stock level at the end of the period being less than some fixed quantity not exceed some prescribed number. For three different models we show that the minimum order policy is optimal. This result is then applied to a particular inventory model in which the demand distribution is not completely known. A Bayesian procedure is discussed for obtaining optimal policies.
On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem
Authors: Jarvis John J. 
Published: October 2013

AbstractThe purpose of this article is to formulate the multi‐commodity maximal flow problem into a node‐arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc‐chain formulation. A generalization to the problem is then considered which can potentially speed its convergence.
Applications of a generalized combinatorial problem of smirnov
Authors: Alter Ronald , Lientz B. P. 
Published: October 2013

AbstractIn this paper applications of results obtained by these authors for a generalized version of a problem proposed by Smirnov, are considered. The areas of application explored are system interface, queueing, transportation flow, and sequential analysis. The included table should be invaluable to the reader in applying these results. Finally the relationship between the limiting and exact expressions relating to this table is also explored.
An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
Authors: Pegden Claude Dennis , Petersen Clifford C. 
Published: October 2013

AbstractThis paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.
On the existence of joint production functions
Authors: Al‐Ayat Rokaya , Färe Rolf 
Published: October 2013

AbstractWithin a general framework of production correspondences satisfying a set of weak axioms necessary and sufficient conditions for the existence of a joint production function are given. Without enforcing the strong disposability of inputs or outputs it is shown that a joint production function exists if and only if both input and output correspondences are strictly increasing along rays.