bluuebunny/crossref_metadata_2025_split huggingface dataset:
Trans‐ileocecal portal vein embolization as a preoperative treatment for right trisegmentectomy with caudate lobectomy
Authors: Shimura Tatsuo , Suehiro Taketoshi , Suzuki Hideki , Okada Kohji , Araki Kenichiro , Kuwano Hiroyuki 
Published: May 2007

AbstractBackground and ObjectivesThe indication of preoperative portal vein embolization (PVE) has been expanded to hepatocellular carcinoma, cholangiocellular carcinoma (CCC), hepatic metastasis, and gallbladder (GB) cancer as well as hilar cholangiocarcinoma (hCC). However, biliary cancers sometimes cause peritoneal dissemination.Patients and MethodsWe performed our preoperative trans‐ileocecal‐vein PVE (TIPE) method on 14 (3 GB cancer, 1 CCC, and 10 hCC), whose estimated residual liver volume was <30%.ResultsOut of 14 patients, peritoneal dissemination was encountered in two patients with GB cancer and one with hCC (21.4%) during our procedure. The estimated residual liver volume was 37.4 ± 2.7% at 14 days after PVE in patients without predisposing cholangitis, while those in patients with cholangitis was 29.3 ± 1.3% (P = 0.0002). No major complication due to the procedure was encountered in this series.ConclusionsPTPE could be the first choice for patients with hCC, hepatocellular carcinoma, and hepatic metastases. Although the TIPE proposed here has some potential disadvantages, we would recommend it especially for patients with GB cancer because of its high potential to cause cancerous peritonitis. When a patient had predisposing cholangitis, radical operation should be scheduled on >21 days after PVE rather than on 14 days. J. Surg. Oncol. 2007;96:438–441. © 2007 Wiley‐Liss, Inc.
Orthogonal array design for the optimization of supercritical fluid extraction of baicalin from roots of Scutellaria baicalensis Georgi
Authors: Chang Yiling , Liu Ben , Shen Bo 
Published: May 2007

AbstractSupercritical fluid was used to extract baicalin from the roots of Scutellaria baicalensis Georgi. An orthogonal array design (OAD), OA9(34), was employed as a chemometric method for the optimization of the supercritical fluid extraction of baicalin from the herbal medicine. Four parameters, namely, modifiers, temperature and pressure of supercritical fluid, and the dynamic extraction time, were studied and optimized by a three‐level OAD in which the interactions between the parameters were neglected. Determinations of the extracts were performed by high‐performance liquid chromatography. The effects of parameters were studied using analysis of variance. The results showed that selection of the modifier was the main factor in attaining higher yields of baicalin. While the other three factors had some effect on the extraction of the compound, the effect was much less than that of the modifiers. 1,2‐Propanediol‐modified supercritical fluid was more effective than 95% ethanol‐modified supercritical carbon dioxide or methanol‐modified supercritical carbon dioxide for the extraction of baicalin from the solid matrix. Finally, experimental conditions were proposed which can provide the highest extraction yield with respect to the considered factors.
Zinc corrosion runoff process induced by humid tropical climate
Authors: Veleva L. , Meraz E. , Acosta M. 
Published: May 2007

AbstractZinc and hot dip galvanized steel are frecuently used metals in building application. They have relatively good atmospheric resistance to corrosion, due to its oxidation in air and formation of protective rust on its surface, which acts as barrier between the metal and environment. However, some part of the rust can be dissolved by pluvial precipitations and water condensed on the metal surface. This process, called metal runoff, contributes for zinc dispersion in soils and waters. In order to make accurate estimation of zinc runoff induced by atmosphere in humid tropical climate, samples of pure Zn and hot dip galvanized steel have been exposed in the Gulf of Mexico. The data reveal that this process is strongly influenced by factors which determine the aggressivity of the environment (pluvial precipitations, cycles of dry and rainy periods, atmospheric pollutants, air humidity). High annual rates of zinc runoff (6.5 – 8.5 ± 0.30 g Zn m−2yr−1) were released, being the runoff 63 – 87% of the zinc corrosion rust. The zinc mass loss has been related to several independent parameters, presenting linear equation, which indicates the air contaminant SO2as the major factor controlling the runoff of zinc. The reported results show higher runoff of zinc samples, compared to that of hot dip galvanized steel
Effect of aging time and temperature on exfoliation corrosion of aluminum alloys 2024‐T3 and 7075‐T6
Authors: Khoshnaw F. M. , Gardi R. H. 
Published: May 2007

AbstractTwo types of aluminum alloys, 2024‐T3 and 7075‐T6, have been selected in this study to investigate the effect of metallurgical aspects on exfoliation corrosion. To determine and evaluate the metallurgical effects of heat treatments on corrosion behaviour of these alloys, G34 ASTM test was selected to investigate the exfoliation corrosion behaviour. The results showed that with increasing the aging time for the aluminum alloy type 2024‐T3 the susceptibility to exfoliation corrosion increases, while for type 7075‐T6 decreased. These results refer to precipitation of the intermetallic compound phases such as CuAl2, and MgZn2, in 2024‐T3 and 7075‐T6 respectively. The amount of these phases increases with increasing the aging time for both alloys. The investigations showed the phases that initiate in 2024‐T3 act as anode sites while in 7075‐T6 they act as cathode sites.
An in situ FT‐IR evaluation of candidate organic corrosion inhibitors for carbon steel in contact with alkaline aqueous solutions
Authors: Bozzini B. , Mele C. , Romanello V. 
Published: May 2007

AbstractThe influence of some organic additives on the anodic behaviour of a carbon steel electrode in contact with alkaline aqueous solutions was studied by in situ Fourier transform infrared (FT‐IR) spectroscopy. FT‐IR spectroscopy allows to obtain information at the molecular level regarding the metal‐electrolyte interface. The following molecules have been considered: (i) benzyldimethylphenylammonium chloride (BDMPAC), (ii) glutamic acid, (iii) triethylenetetramine (TETA), (iv) sodium tartrate and (v) sodium benzoate. Potential‐dependent spectra have been recorded for the different investigated systems. Quantitative information about the formation kinetics of corrosion products was derived by numerical analysis of the peak area as a function of the applied potential for the different systems investigated.
Crevice corrosion monitoring of titanium and its alloys using microelectrodes
Authors: Rajendran N. , Nishimura T. 
Published: May 2007

AbstractCrevice corrosion of titanium and its alloys in 10% sodium chloride was investigated at 100°C with the aid of microelectrodes. Potential, pH and chloride ion concentration inside the crevice were monitored using an Ag/AgCl electrode, a tungsten microelectrode and a Ag/AgCl chloride ion selective microelectrode, respectively. The pH and Cl− concentrations within the crevice were calculated from the standard potential‐pH and potential‐log[Cl−] calibration curves. The effect of Mo on the crevice corrosion of titanium was also studied. The passivation behavior on the titanium and Ti‐15%Mo alloy was studied using electrochemical impedance studies. There was no apparent change in pH and Cl− ion activity inside the crevice for the alloy at 100°C, whereas a marginal decrease in pH and increase in Cl− ion concentration were observed for pure titanium. Thus pure titanium is susceptible to crevice corrosion in hot 10% NaCl solutions at 100°C. The chloride ion activity was found to be reduced for the alloy so that the pH inside the crevice increased. The corrosion reaction resistance (Rt) was found to increase with the addition of Mo as an alloying element. It also increases with externally applied anodic potential. Hence, Mo is an effective alloying element, which enhances the crevice corrosion resistance of titanium.
Preparation and Characterization of Hybrid Nanocomposite Coatings by Cationic UV‐Curing and the Sol‐Gel Process of a Vinyl Ether Based System
Authors: Sangermano Marco , Amerio Ezio , Epicoco Paolo , Priola Aldo , Rizza Giancarlo , Malucelli Giulio 
Published: May 2007

AbstractOrganic/inorganic hybrid nanocomposite coatings were prepared through a dual‐cure process involving the cationic photopolymerization of a vinyl ether based system and the condensation of an alkoxysilane inorganic precursor. All formulations produced transparent cured films characterized by high gel contents. An increase in glass transition temperature and an increase in storage modulus above Tg in the rubbery plateau were observed with increasing TEOS content in the photocurable formulation. TEM micrographs showed that the organic and inorganic phases were strictly interconnected with no macroscopic phase separation; the sizes of the silica domains in the polymeric matrix were 3–5 nm.magnified image
A network isolation algorithm
Authors: Bellmore M. , Bennington G. , Luhore S. 
Published: May 2007

AbstractA set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum.This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given.The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound.
A methodology for estimating expected usage of repair parts with application to parts with no usage history
Authors: Haber Sheldon E. , Sitgreaves Rosedith 
Published: May 2007

AbstractIn this paper a model is presented which focuses on the difficult problem of predicting demands for items with extremely low usage rates. These form the bulk of repair parts in military systems. The basic notion underlying the model is the pooling of usage data for common design items with movement for the purpose of estimating usage rates for similar items which have shown no movement.A unique feature of the model is that it also makes possible the estimation of usage rates for items newly introduced into a system for which no previous usage history is available.
A note on the calculation of expected time‐weighted backorders over a given interval
Authors: Ho Chung‐Mei 
Published: May 2007

AbstractTwo formulae are presented for calculating expected time‐weighted backorders over a fixed time interval. One formula is a more precise form of a result found in the literature and is found using a direct intuitive approach. The second formula is derived using the steady. State distribution of inventory and is directly compatible with the use of steady‐state (R, Q) models.The two formulae are compared and reconciled.
Optimal control of multi‐channel service systems
Authors: Magazine M. J. 
Published: May 2007

AbstractD. P. Heyman, M. Sobel, and M. J. Magazine among others have shown existence of an optimal policy for control of single server queuing systems. For queues under periodic review existence of an analogous rule is established for multi‐server systems. Formulation as a dynamic programming problem is given and proofs for existence are presented for finite horizon, infinite horizon and average cost criteria.
The transportation paradox
Authors: Szwarc Wlodzimierz 
Published: May 2007

AbstractA paradox arises when a transportation problem admits to a total cost solution which is lower than the optimum and is attainable by shipping larger quantities of goods over the same routes that were previously designated as optimal. That is, falling total costs are present in moving to the greater shipment quantities. Necessary conditions for this to occur are established and an algorithm for solving this expanded transportation problem is supplied.
The interface of computer science and statistics
Authors: Goodman A. F. 
Published: May 2007

AbstractCurrent scientific, technical, and management progress is characterized by the generation of a tremendous amount of data for analysis. This, in turn, poses a significant challenge: to effectively and efficiently extract meaningful information from the large volume of data. Two relatively young professions, computer science and statistics, are intimately linked in any response to the challenge. They have consequently become indispensable to scientific, technical, and management progress, occupying a position at its very heartComputer science and statistics have each been separately documented by many books as well as numerous papers. However, the interface of computer science and statistics, the area of their interaction, has been documented only in part. This paper begins characterization of the entire interface by providing a structure and an historical background for itA structure for the interface is introduced initially, followed by an historical background for the interface presented in two parts. First to be summarized is the evolution of the interface from an interweaving of the mechanical prerequisites to the computer and mathematical prerequisities to computer science and of the foundations for probability and statistics. Development of statistics prior to 1900 then is reviewed.
Statistical concepts in computational mathematics
Authors: Juncosa M. L. 
Published: May 2007

AbstractFor a young science and even for most old ones, the intensity and variety of activities involved in computer science are unsurpassed. In an effort to provide the extremely varied training needed in the field, curriculum planners have tended to slight probability and statistics. Rarely has it been a requisite and only occasionally a desired electiveHowever, not only is an adequate foundation in probability and statistics necessary for such external computer applications as tracking and other data reduction, Monte Carlo techniques, gaming, operations research, traffic analyses, etc., but it also plays an important role in internal applications to computer science and technologyThis effort in Rand's continuing study of computational mathematics and its applications offers a number of examples in various areas of computational mathematics and computing machine arithmetic‐to say nothing of computer design, time sharing, and the like‐to support the thesis that probability and statistics should be a requisite, not simply an elective or, even worse, ignored, at any institution offering a program in computer science. Further more, a potentially profitable source of research problems can be found in the interface between probability and statistics and computer science.
Hit probability for a chain‐like series of shots—a simple formula
Authors: Zahle T. U. 
Published: May 2007

AbstractTo find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain‐like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target.
The bottleneck transportation problem
Authors: Garfinkel R. S. , Rao M. R. 
Published: May 2007

AbstractThe bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum timeTwo algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally.
Integer points on the Gomory fractional cut (hyperplane)
Authors: Salkin Harvey M. , Breining Patrice 
Published: May 2007

AbstractIn this paper we show that the Gomory fractional cut (hyperplane) for the integer program is either void of integer points or contains an infinite number of them. The conditions for each case are presented. Also, we derive a stronger cut from the hyperplane which does not intersect integer points.
Scheduling with earliest start and due date constraints
Authors: Bratley Paul , Florian Michael , Robillard Pierre 
Published: May 2007

AbstractWe consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time ai, must be completed by time bi, and requires di time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply.
A bivariate normal theory maximum‐likelihood technique when certain variances are known
Authors: Locks Mitchell O. 
Published: May 2007

AbstractA maximum‐likelihood technique is described for estimating the bivariate normal distribution of the estimates of two or more related values when data are obtained from several different sources, each having known variance. The problem is comparable, in the bivariate sense to estimating the mean of a normal population with known variance. The results tend to be dominated by those sources of data associated with the smallest variances.
On models for business failure data
Authors: Dubey Satya D. 
Published: May 2007

AbstractIt is pointed out in this paper that Lomax's hyperbolic function is a special case of both Compound Gamma and Compound Weibull distributions, and both of these distributions provide better models for Lomax's business failure data than his hyperbolic and exponential functions. Since his exponential function fails to yield a valid distribution function, a necessary condition is established to remedy this drawback. In the light of this result, his exponential function is modified in several ways. It is further shown that a natural complement of Lomax's exponential function does not suffer from this drawback.
The multicommodity network flow model revised to include vehicle per time period and node constraints
Authors: Weigel Henry S. , Cremeans John E. 
Published: May 2007

AbstractThe minimum‐cost formulation of the problem of determining multicommodity flows over a capacitated network subject to resource constraints has been treated in previobs papers. In those treatments only capacitated arcs were assumed and a uniform unit of measure like short tons was used for all commodities. This paper treats the effect of constraints on the nodes of the network, allows the commodities to be measured in their “natural” units and allows the network capacities to be expressed in vehicles per time period‐in some cases giving a more accurate representation of the capacities of the network. This paper describes the solution procedure which uses the column generation technique; it also discusses computational experience.
The payment scheduling problem
Authors: Grinold Richard C. 
Published: May 2007

AbstractLarge complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions.This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0.
Sequential bid selection by stochastic approximation
Authors: Agnew Robert A. 
Published: May 2007

AbstractSuppose that a contractor is faced with a sequence of “minimum bid wins contract” competitions. Assuming that a contractor knows his cost to fulfill the contract at each competition and that competitors are merely informed whether or not they have won, bids may be selected sequentially via a tailored stochastic approximation procedure. The efficacy of this approach in certain bidding environments is investigated.
Stochastic duels involving reliability
Authors: Thompson David E. 
Published: May 2007

AbstractThe reliability of weapons in combat has been treated by Bhashyam in the context of a stochastic duel characterized by fixed ammunition supplies. negative exponentially distributed firing times and weapon lifetimes, and a fixed number of spare weapons for each duelist. The present paper takes a different approach by starting with the fundamental duel of Ancker and Williams, characterized by unlimited ammunition and by ordinary renewal firing times, and adding to it weapon lifetimes which can be functions of time or of round position in the firing sequence. Probabilities of winning and tieing are derived and it is shown that under certain conditions the weapon lifetimes are equivalent to random time and ammunition limits.
An operator theory of parametric programming for the transportation problem‐I
Authors: Srinivasan V. , Thompson G. L. 
Published: May 2007

AbstractThis paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions‐i. e., the warehouse supplies and market demands‐the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved.