TY - JOUR TI - Light-tree routing under optical power budget constraints [Invited] AU - Xin, Yufeng AU - Rouskas, George N. T2 - Journal of Optical Networking AB - Feature Issue on Next-Generation WDM Network Design and Routing (WDMN). It has been widely recognized that physical-layer impairments, including power losses, must be taken into account when optical connections are routed in transparent networks. We study the problem of constructing light-trees under optical-layer power budget constraints, with a focus on algorithms that can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms; one of the algorithms is appropriate for networks with sparse light splitting and/or limited splitting fanout. We find that, to guarantee an adequate signal quality and to scale to large destination sets, light-trees must be as balanced as possible. Numerical results demonstrate that existing algorithms tend to construct highly unbalanced trees and are thus expected to perform poorly in an optical network setting. Our algorithms, on the other hand, are designed to construct balanced trees that, in addition to having good performance in terms of signal quality, also ensure a certain degree of fairness among destination nodes. Although we consider only power loss here, the algorithms that we develop could be appropriately modified to account for other physical-layer impairments, such as dispersion. DA - 2004/// PY - 2004/// DO - 10.1364/jon.3.000282 VL - 3 IS - 5 SP - 282 J2 - J. Opt. Netw. LA - en OP - SN - 1536-5379 UR - http://dx.doi.org/10.1364/jon.3.000282 DB - Crossref ER - TY - CHAP TI - Optical Network Engineering AU - Rouskas, George N. T2 - IP over WDM A2 - Dixit, Sudhir AB - This chapter discusses the application of traffic engineering and planning methodologies to the design and operation of optical networks employing WDM technology. The routing and wavelength assignment (RWA) problem is first introduced as the fundamental control problem in WDM networks. The RWA problem is then studied in two different but complementary contexts. The static RWA arises in the network design phase where the objective is capacity planning and the sizing of network resources. The dynamic RWA is encountered during the real-time network operation phase and involves the dynamic provisioning of optical connections. Both the static and dynamic variants of the problem are explored in depth with an emphasis on solution approaches and algorithms. The chapter concludes with a discussion of control plane issues and related standardization activities in support of traffic engineering functionality. PY - 2004/1/29/ DO - 10.1002/0471478342.ch10 SP - 299-327 PB - John Wiley & Sons, Inc. UR - http://dx.doi.org/10.1002/0471478342.ch10 ER - TY - JOUR TI - On wavelength assignment in optical burst switched networks AU - Teng, J AU - Rouskas, GN AU - society, T2 - First International Conference on Broadband Networks, Proceedings DA - 2004/// PY - 2004/// SP - 24-33 ER - TY - CHAP TI - Multicast routing under optical layer constraints AU - Xin, YF AU - Rouskas, GN AU - IEEE T2 - Ieee Infocom 2004: the Conference on Computer Communications, Vols 1-4, Proceedings PY - 2004/// SP - 2731-2742 PB - SE - ER - TY - JOUR TI - Fault management with fast restoration for optical burst switched networks AU - Xin, YF AU - Teng, J AU - Karmous-Edwards, G AU - Rouskas, GN AU - Stevenson, D AU - society, T2 - First International Conference on Broadband Networks, Proceedings DA - 2004/// PY - 2004/// SP - 34-42 ER - TY - CHAP TI - Traffic grooming in WDM ring networks with the min-max objective AU - Chen, BS AU - Rouskas, GN AU - Dutta, R AU - Mitrou, N AU - Kontovasilis, K AU - Iliadis, I AU - Merakos, L T2 - Networking 2004 PY - 2004/// VL - 3042 SP - 174-185 PB - SE - ER - TY - SOUND TI - Modelling Capacity in Production and Supply Chain Planning AU - Uzsoy, R. DA - 2004/3// PY - 2004/3// ER - TY - SOUND TI - Modelling Capacity in Production and Supply Chain Planning AU - Uzsoy, R. DA - 2004/4// PY - 2004/4// ER - TY - SOUND TI - Modelling Capacity in Production and Supply Chain Planning AU - Uzsoy, R. DA - 2004/7// PY - 2004/7// ER - TY - SOUND TI - Transportation, Distribution and Logistics in Indiana AU - Uzsoy, R. DA - 2004/4// PY - 2004/4// ER - TY - SOUND TI - Center of Excellence in Competitive Global Logistics AU - Uzsoy, R. DA - 2004/5// PY - 2004/5// ER - TY - SOUND TI - Supply Chain Survival Strategies: Eat or Be Eaten AU - Uzsoy, R. DA - 2004/9// PY - 2004/9// ER - TY - SOUND TI - Transportation, Distribution and Logistics in Indiana AU - Uzsoy, R. DA - 2004/9// PY - 2004/9// ER - TY - BOOK TI - Optimization and Optimal Control (ICOOC) A3 - Wu, S. A3 - Fang, S. DA - 2004/11// PY - 2004/11// VL - 30 ER - TY - CONF TI - Heavy-tailed Non-Gaussian Nature of Terrain and Its Implications for Terrain Modeling by L1 Splines, with J AU - Fang, S. AU - Lavery, J. E. T2 - 24th Army Science Conference C2 - 2004/12// C3 - Proceedings of the 24th Army Science Conference CP-1 DA - 2004/12// PY - 2004/12// ER - TY - JOUR TI - Switching LPV control designs using multiple parameter-dependent Lyapunov functions AU - Lu, Bei AU - Wu, Fen T2 - Automatica AB - In this paper we study the switching control of linear parameter-varying (LPV) systems using multiple parameter-dependent Lyapunov functions to improve performance and enhance control design flexibility. A family of LPV controllers is designed, each suitable for a specific parameter subregion. They are switched so that the closed-loop system remains stable and its performance is optimized. Two switching logics, hysteresis switching and switching with average dwell time, are examined. The control synthesis conditions for both switching logics are formulated as matrix optimization problems, which are generally non-convex but can be convexified under some simplifying assumptions. The hysteresis switching LPV control scheme is then applied to an active magnetic bearing problem. DA - 2004/11// PY - 2004/11// DO - 10.1016/j.automatica.2004.06.011 VL - 40 IS - 11 SP - 1973-1980 J2 - Automatica LA - en OP - SN - 0005-1098 UR - http://dx.doi.org/10.1016/j.automatica.2004.06.011 DB - Crossref KW - switched linear parameter-varying system KW - multiple parameter-dependent Lyapunov functions KW - switching logics KW - linear matrix inequality KW - non-convexity ER - TY - JOUR TI - Extended anti-windup control schemes for LTI and LFT systems with actuator saturations AU - Wu, Fen AU - Soto, Marco T2 - International Journal of Robust and Nonlinear Control AB - Abstract In this paper, the popular anti‐windup control scheme will be extended in two important directions. The first scenario is the control of LTI systems subject to actuators with both magnitude and rate constraints. The second case of extension is LFT systems with input saturations. Based on the extended Circle criterion, we will develop convex anti‐windup control synthesis conditions in the form of LMIs for each class of systems. The explicit anti‐windup controller formula are also provided to facilitate compensator construction. The effectiveness of proposed anti‐windup control schemes will be demonstrated using a flight control example. Copyright © 2004 John Wiley & Sons, Ltd. DA - 2004/10// PY - 2004/10// DO - 10.1002/rnc.943 VL - 14 IS - 15 SP - 1255-1281 J2 - Int. J. Robust Nonlinear Control LA - en OP - SN - 1049-8923 1099-1239 UR - http://dx.doi.org/10.1002/rnc.943 DB - Crossref KW - input magnitude and rate saturations KW - anti-windup compensation KW - stability and performance KW - linear matrix inequality (LMI) KW - controller construction ER - TY - RPRT TI - Land and Resource Management Plan for the Daniel Boone National Forest AU - Roise, Joseph P. A3 - USDA Forest Service Southern Region DA - 2004/// PY - 2004/// M1 - R8-MB 117A M3 - Management Bulletin PB - USDA Forest Service Southern Region SN - R8-MB 117A UR - https://www.fs.usda.gov/Internet/FSE_DOCUMENTS/fsbdev3_032532.pdf ER - TY - CONF TI - Design of a Detection Signal for Fault Detection and Model Identification on Systems with Multiple Delays AU - Drake, K. AU - Campbell, S.L. T2 - American Society of Naval Engineers Day C2 - 2004/6/28/ C3 - Proceedings of the American Society of Naval Engineers Day 2004 CY - Alexandria, VA DA - 2004/6/28/ PY - 2004/6/28/ ER - TY - CONF TI - ODE and DAE integrators in Scicos environment AU - Najafi, M. AU - Nikoukhah, R. AU - Campbell, S.L. T2 - IASTED International Conference on Applied Simulation and Modeling A2 - Hamza, M.H. C2 - 2004/// C3 - Proceedings of the IASTED International Conference on Applied Simulation and Modelling and Simulation : June 28-30, 2004, Rhodes, Greece CY - Rhodes, Greece DA - 2004/// PY - 2004/6/28/ PB - ACTA Press SN - 0889863970 9780889863972 ER - TY - JOUR TI - Recursive approximation of the high dimensional max function AU - Birbil, S. I. AU - Fang, Shu-Cherng AU - Frenk, J. B. G. AU - Zhang, S. T2 - Operations Research Letters AB - This paper proposes a smoothing method for the general n-dimensional max function, based on a recursive extension of smoothing functions for the two-dimensional max function. A theoretical framework is introduced, and some applications are discussed. Finally, a numerical comparison with a well-known smoothing method is presented. DA - 2004/// PY - 2004/// DO - 10.1016/j.orl.2004.11.004 VL - 33 IS - 5 SP - 450–458 KW - smoothing methods KW - n-dimensional max function KW - recursive approximation ER - TY - MGZN TI - Accurate eigenvalues for fast trains AU - Ipsen, I.C.F. T2 - SIAM News DA - 2004/11// PY - 2004/11// VL - 37 SP - 1–2 M1 - 9 ER - TY - JOUR TI - Trust, power, dependence, and economics: can SCM research borrow paradigms? AU - Handfield, R.B. AU - Bechtel, C. T2 - International Journal of Integrated Supply Management AB - With the inaugural issue of this new journal, researchers have an opportunity to publish in a journal that is entirely devoted to the new paradigm of supply chain management. With this development as a new field, some researchers argue that it is an extension, or in some cases, a subset of operations management. We contend that neither of these is the case. In fact, the field of SCM spans multiple interdisciplinary areas, and thus must draw from a vast field or prior research in business, industrial psychology, economics, operations research, and organisational science. Researchers in this field are encouraged to broaden the span of their epistemological base to allow the field to grow in a manner that can best advance our knowledge in how to manage supply chains. DA - 2004/// PY - 2004/// DO - 10.1504/IJISM.2004.004595 VL - 1 IS - 1 SP - 3-32 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33746630705&partnerID=MN8TOARS ER - TY - JOUR TI - The impact of energy deregulation on sourcing strategy AU - Handfield, R.B. T2 - Journal of Supply Chain Management AB - SUMMARY Supply researchers predicted in 1999 that deregulation would change the landscape for the purchasers of energy. The current research was undertaken to determine the nature and direction of the predicted changes in energy sourcing behavior. Based on detailed interviews with managers, government officials, and lobbyists, the risks and rewards associated with recent events in deregulation are examined and analyzed. Next, a detailed process for developing and implementing an energy sourcing strategy for commercial businesses that considers these risks and rewards of alternative energy sourcing channels is developed. This is followed by a process that involves aggregating data, obtaining support, defining risk tolerance, and spending parameters that involved stake‐holders, evaluating proposals, executing the strategy and monitoring it overtime. Finally, insights into the future trends in deregulated energy markets are described. Results suggest that a focused approach to developing detailed supply market intelligence can assist sourcing managers in preparing for the deregulated era and achieve significant cost savings in energy spending. DA - 2004/// PY - 2004/// DO - 10.1111/j.1745-493X.2004.tb00168.x VL - 40 IS - 1 SP - 38-48 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85017138344&partnerID=MN8TOARS ER - TY - CONF TI - A Semantic Protocol-Based Approach for Developing Business Processes AU - Chopra, Amit K. AU - Desai, Nirmit V. AU - Mallya, Ashok U. AU - Wagle, Leena V. AU - Singh, Munindar P. C2 - 2004/11// C3 - Forum Proceedings of the 2nd International Conference on Service Oriented Computing (ICSOC) DA - 2004/11// SP - 99–107 PB - ACM ER - TY - CONF TI - Modeling Flexible Business Processes AU - Chopra, Amit K. AU - Desai, Nirmit V. AU - Mallya, Ashok U. AU - Singh, Munindar P. C2 - 2004/7// C3 - Proceedings of the 1st AAMAS Workshop on Declarative Agent Languages and Technologies (DALT) DA - 2004/7// ER - TY - CONF TI - From Concept to Real-time Implementation: POD Based Reduced Order Control of a Cantilever Beam AU - Tran, H. AU - Lewis, B.M. T2 - 16th International Symposium on Mathematical Theory of Networks and Systems(MTNS 2004) A2 - De Moor, B. A2 - Motmans, Bart A2 - Willems, J. A2 - Van Dooren, Paul A2 - Blondel, Vincent C2 - 2004/// C3 - Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2004) CY - Catholic University of Leuven (K.U.Leuven-Belgium) DA - 2004/// PY - 2004/7/5/ ER - TY - CHAP TI - Agent-Based Abstractions for Software Development AU - Singh, Munindar P. T2 - Methodologies and Software Engineering for Agent Systems A2 - Bergenti, F. A2 - Gleizes, MP A2 - Zambonelli, F. T3 - Multiagent Systems, Artificial Societies, and Simulated Organizations AB - This chapter provides the historical and conceptual basis needed to fully appreciate the tools and techniques for agent-based software development. It begins with a review of the historical development of software technology from standalone to open systems. It discusses the major challenge of increasing complexity as software systems become larger and more open. The chapter presents the features of the agent metaphor that make it ideally suited for large-scale open systems development as well as the key technical abstractions that emerge from the agents metaphor and their ramifications on software practice. PY - 2004/// DO - 10.1007/1-4020-8058-1_2 SP - 5–18 PB - Springer SN - 1402080573 SV - 11 UR - http://dx.doi.org/10.1007/1-4020-8058-1_2 ER - TY - BOOK TI - The Practical Handbook of Internet Computing T2 - Chapman & Hall/CRC Computer & Information Science Series A3 - Singh, Munindar AB - The Practical Handbook of Internet Computing analyzes a broad array of technologies and concerns related to the Internet, including corporate intranets. Fresh and insightful articles by recognized experts address the key challenges facing Internet users, designers, integrators, and policymakers. In addition to discussing major applications, it also DA - 2004/9/29/ PY - 2004/9/29/ DO - 10.1201/9780203507223 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223 ER - TY - CHAP TI - Introduction to Web Semantics AU - Singh, Munindar T2 - The Practical Handbook of Internet Computing A2 - Singh, Munindar PY - 2004/9/29/ DO - 10.1201/9780203507223.ch29 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223.ch29 ER - TY - CHAP TI - Concepts and Practice of Personalization AU - Singh, Munindar AU - Aparicio, Manuel, IV T2 - The Practical Handbook of Internet Computing A2 - Singh, Munindar PY - 2004/9/29/ DO - 10.1201/9780203507223.ch18 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223.ch18 ER - TY - CONF TI - Analysis of spline based auxiliary signal design for failure detection in delay systems AU - Campbell, SL AU - Drake, K. AU - Nikoukhah, R. T2 - SMC '03 2003IEEE International Conference on Systems, Man and Cybernetics AB - In an active approach for model detection and its use in failure detection, an auxiliary control is applied in order to assist in model identification. An active approach for robust multi-model identification and failure detection in the presence of disturbances over possibly short time intervals has been introduced. Previous papers extended the original design procedure to problems with several delays and additive noise. The infinite dimensional delay problem was approximated by a finite dimensional system without delays and numerical examples were worked. The numerical examples seemed to converge better than was expected. In this paper we explain that convergence. In addition we discuss the extension of the previous results for delay systems with additive noise to those with small model uncertainties and explain why this additional assumption of small uncertainty, which was not present in the case without delays, is now needed for the analysis. C2 - 2004/5/25/ C3 - SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483) DA - 2004/5/25/ DO - 10.1109/icsmc.2003.1244267 PB - IEEE SN - 0780379527 UR - http://dx.doi.org/10.1109/icsmc.2003.1244267 DB - Crossref ER - TY - CONF TI - Direct transcription solution of inequality constrained optimal control problems AU - Betts, J.T. AU - Campbell, S.L. AU - Engelsone, A. T2 - Proceedings of the 2004 American Control Conference AB - Direct transcription is a popular way to solve the complex optimal control problems that arise in industry. With a direct transcription approach, the problem is fully discretized and then the discrete problem is solved numerically. Recently, it has been shown that the theory for direct transcription differs in several key ways from the theory for other approaches. These differences have implications for numerical algorithms and the interpretation of solutions to practical problems. This paper examines some of those differences. C2 - 2004/// C3 - Proceedings of the 2004 American Control Conference DA - 2004/// DO - 10.23919/acc.2004.1386809 PB - IEEE SN - 0780383354 UR - http://dx.doi.org/10.23919/acc.2004.1386809 DB - Crossref ER - TY - JOUR TI - Deeper Inside PageRank AU - Langville, Amy AU - Meyer, Carl T2 - Internet Mathematics AB - This paper serves as a companion or extension to the "Inside PageRank" paper by Bianchini et al. [Bianchini et al. 03]. It is a comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, suggested alternatives to the traditional solution methods, sensitivity and conditioning, and finally the updating problem. We introduce a few new results, provide an extensive reference list, and speculate about exciting areas of future research. DA - 2004/1/1/ PY - 2004/1/1/ DO - 10.1080/15427951.2004.10129091 VL - 1 IS - 3 SP - 335-380 J2 - UINM LA - en OP - SN - 1542-7951 UR - http://dx.doi.org/10.1080/15427951.2004.10129091 DB - Crossref ER - TY - CONF TI - Pricing a public logistics network AU - Kay, M.G. AU - Jain, A. C2 - 2004/// C3 - IIE Annual Conference and Exhibition 2004 DA - 2004/// SP - 439 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-30044432006&partnerID=MN8TOARS ER - TY - JOUR TI - Practical methods for optimal control using nonlinear programming, John T. Betts, SIAM, Philadelphia, PA, 2001, ISBN 0-89871-488-5 AU - Campbell, Stephen L. T2 - International Journal of Robust and Nonlinear Control AB - International Journal of Robust and Nonlinear ControlVolume 14, Issue 11 p. 1019-1021 Book ReviewFree Access Practical methods for optimal control using nonlinear programming, John T. Betts, SIAM, Philadelphia, PA, 2001, ISBN 0-89871-488-5 Stephen L. Campbell, Stephen L. Campbell slc@math.ncsu.edu Department of Mathematics, North Carolina State University, Raleigh, NC 27695-8205, U.S.A.Search for more papers by this author Stephen L. Campbell, Stephen L. Campbell slc@math.ncsu.edu Department of Mathematics, North Carolina State University, Raleigh, NC 27695-8205, U.S.A.Search for more papers by this author First published: 11 June 2004 https://doi.org/10.1002/rnc.874AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat No abstract is available for this article. Volume14, Issue11Special Issue: Robust control design from data: direct and model-based approaches25 July 2004Pages 1019-1021 ReferencesRelatedInformation DA - 2004/6/18/ PY - 2004/6/18/ DO - 10.1002/rnc.874 VL - 14 IS - 11 SP - 1019-1021 J2 - Int. J. Robust Nonlinear Control LA - en OP - SN - 1049-8923 1099-1239 UR - http://dx.doi.org/10.1002/rnc.874 DB - Crossref ER - TY - JOUR TI - Scheduling non-similar groups on a flow line: multiple group setups AU - Wilson, A.D. AU - King, R.E. AU - Hodgson, T.J. T2 - Robotics and Computer-Integrated Manufacturing AB - This research addresses lead-time reduction and makespan minimization for cut and sew operations of upholstered furniture manufacturing through efficient scheduling. Jobs are grouped based on different characteristics at each operation of this two stage flow line. There are identical parallel machines at each stage and jobs proceed individually from the 1st stage to the 2nd. A heuristic for the case of multiple setups per group at the 2nd stage is developed, compared to a single setup per group at each stage, and integrated into a genetic algorithm. Results demonstrate that the heuristic effectively adds minimal setups to a single setup schedule while significantly improving schedule makespan. DA - 2004/12// PY - 2004/12// DO - 10.1016/j.rcim.2004.07.002 VL - 20 IS - 6 SP - 505-515 J2 - Robotics and Computer-Integrated Manufacturing LA - en OP - SN - 0736-5845 UR - http://dx.doi.org/10.1016/j.rcim.2004.07.002 DB - Crossref KW - scheduling KW - flow shops KW - heuristics KW - setup time ER - TY - JOUR TI - On SAT instance classes and a method for reliable performance experiments with SAT solvers AU - Brglez, Franc AU - Li, Xiao Yu AU - Stallmann, Matthias F. T2 - Annals of Mathematics and Artificial Intelligence DA - 2004/12/31/ PY - 2004/12/31/ DO - 10.1007/s10472-004-9417-0 VL - 43 IS - 1-4 SP - 1-34 J2 - Ann Math Artif Intell LA - en OP - SN - 1012-2443 1573-7470 UR - http://dx.doi.org/10.1007/s10472-005-0417-5 DB - Crossref ER - TY - JOUR TI - AN ASSESSMENT OF SUPPLIER - CUSTOMER RELATIONSHIPS AU - Rinehart, Lloyd M. AU - Eckert, James A. AU - Handfield, Robert B. AU - Page, Thomas J., Jr. AU - Atkin, Thomas T2 - Journal of Business Logistics AB - This research develops a classification framework of supplier‐customer relationships. Data were collected from active relationship managers and provided the empirical basis for the classification scheme. The resulting relationships were classified into seven groups. Names for each type of relationship were developed based on a set of Delphi group responses. DA - 2004/3// PY - 2004/3// DO - 10.1002/j.2158-1592.2004.tb00169.x VL - 25 IS - 1 SP - 25-62 LA - en OP - SN - 0735-3766 UR - http://dx.doi.org/10.1002/j.2158-1592.2004.tb00169.x DB - Crossref ER - TY - CHAP TI - Adding AI to Web Services AU - Petrie, Charles AU - Genesereth, Michael AU - Bjornsson, Hans AU - Chirkova, Rada AU - Ekstrom, Martin AU - Gomi, Hidehito AU - Hinrichs, Tim AU - Hoskins, Rob AU - Kassoff, Michael AU - Kato, Daishi AU - Kawazoe, Kyohei AU - Min, Jung Ung AU - Mohsin, Waqar T2 - Agent-Mediated Knowledge Management AB - The FX-Project consisted of members of the Stanford Logic Group industrial visitors from NEC and Intec Web & Genome working together to develop a new technologies based upon the combination of web services and techniques from artificial intelligence using our experience in AI-based software agents. This two-year project ran from April of 2001 until the end of March 2002 and explored the then emerging functionality of web services. This paper is a result of our findings. PY - 2004/// DO - 10.1007/978-3-540-24612-1_23 SP - 322-338 OP - PB - Springer Berlin Heidelberg SN - 9783540208686 9783540246121 UR - http://dx.doi.org/10.1007/978-3-540-24612-1_23 DB - Crossref ER - TY - JOUR TI - Flexible modelling of correlated operation times with application in product-reuse facilities AU - Stanfield, P. M. AU - Wilson, J. R. AU - King, R. E. T2 - International Journal of Production Research AB - For each job (product instance) to be serviced in a product-reuse production system, multiple operations are often scheduled. Typically, there is high variability in the same operation times required by different jobs; and for each individual job, there is often significant probabilistic dependence (correlation) between many of the job's required operation times. Well-conditioned jobs require fewer operations with shorter durations. Poorly conditioned jobs require more operations with longer durations. Accurate and rapid methods for representing the uncertainty of operation necessity and duration are required to use simulation effectively as a schedule evaluation tool. This paper develops such methods using an alternative to the conventional multivariate extension of the Johnson system of univariate probability distributions. The alternative methods match the first three, and often four, marginal moments of the random vector of operation times for a given job as well as all pairwise correlations between those operation times. A logistic regression model is used to estimate the distribution of the binary random variable indicating the necessity of an operation conditioned on the indicators for the job's preceding operations. The proposed overall mixed-distribution modelling technique is computationally efficient, useful in product-reuse system practice, and easily integrated into existing simulation software platforms. DA - 2004/6// PY - 2004/6// DO - 10.1080/0020754042000203903 VL - 42 IS - 11 SP - 2179-2196 J2 - International Journal of Production Research LA - en OP - SN - 0020-7543 1366-588X UR - http://dx.doi.org/10.1080/0020754042000203903 DB - Crossref ER - TY - CONF TI - Initialization of direct transcription optimal control software AU - Betts, J.T. AU - Campbell, S.L. AU - Kalla, N.N. T2 - 42nd IEEE International Conference on Decision and Control AB - Direct transcription optimal control codes have been very successful. One common source of numerical difficulty is getting a feasible solution on the first iteration. Overcoming this often requires a high level of expertise on the user's part. This paper discusses research aimed at the development of a collection of utilities to assist users in solving complex industrial optimal control problems with direct transcription codes. C2 - 2004/4/23/ C3 - 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) DA - 2004/4/23/ DO - 10.1109/cdc.2003.1271741 PB - IEEE SN - 0780379241 UR - http://dx.doi.org/10.1109/cdc.2003.1271741 DB - Crossref ER - TY - CONF TI - A numerical integrator for simulation of unstructured implicit models AU - Campbell, S.L. AU - Selva, M. AU - Arevalo, C. T2 - Proceedings of the 2004 American Control Conference AB - Object oriented modeling naturally leads to implicitly defined dynamical systems or, as they are also called, differential algebraic equations (DAEs). Most existing DAE integrators require the equations defining the dynamical system to have a special structure. Progress on the development of a new integrator for general unstructured DAEs is presented. The new integrator is called UCP. Computational tests are given to show that the new method can successfully integrate problems that other methods have trouble with. C2 - 2004/// C3 - Proceedings of the 2004 American Control Conference DA - 2004/// DO - 10.23919/acc.2004.1384754 PB - IEEE SN - 0780383354 UR - http://dx.doi.org/10.23919/acc.2004.1384754 DB - Crossref ER - TY - CONF TI - Software for auxiliary signal design AU - Campbell, S.L. AU - Nikoukhah, R. T2 - Proceedings of the 2004 American Control Conference AB - An approach for multi-model identification and failure detection in the presence of model uncertainty and bounded energy noise over finite time intervals has been introduced in the literature. This approach involved offline computation of an auxiliary signal and online application of a hyperplane test. This paper discusses progress in developing a software package to carry out this procedure. C2 - 2004/// C3 - Proceedings of the 2004 American Control Conference DA - 2004/// DO - 10.23919/acc.2004.1384004 PB - IEEE SN - 0780383354 UR - http://dx.doi.org/10.23919/acc.2004.1384004 DB - Crossref ER - TY - JOUR TI - Modeling Cerebral Blood Flow Control During Posture Change from Sitting to Standing AU - Olufsen, Mette AU - Tran, Hien AU - Ottesen, Johnny T2 - Cardiovascular Engineering AB - Hypertension, decreased cerebral blood flow, and diminished cerebral blood flow velocity regulation, are among the first signs indicating the presence of cerebral vascular disease. In this paper, we will present a mathematical model that can predict blood flow and pressure during posture change from sitting to standing. The mathematical model uses a compartmental approach to describe pulsatile blood flow velocity and pressure in a number of compartments representing the systemic circulation. Our model includes compartments representing the trunk and upper extremities, the lower extremities, the brain, and the heart. We use physiologically based control mechanisms to describe the regulation of cerebral blood flow velocity and arterial pressure in response to orthostatic hypotension resulting from postural change. To justify the fidelity of our mathematical model and control mechanisms development, we will show validation results of our model against experimental data from a young subject. DA - 2004/3// PY - 2004/3// DO - 10.1023/b:care.0000025122.46013.1a VL - 4 IS - 1 SP - 47-58 J2 - Cardiovascular Engineering LA - en OP - SN - 1567-8822 UR - http://dx.doi.org/10.1023/b:care.0000025122.46013.1a DB - Crossref ER - TY - BOOK TI - Trustworthy service caching: Cooperative search in P2P information systems AU - Udupi, Y.B. AU - Yolum, P. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3030 SE - 32-44 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-7444260312&partnerID=MN8TOARS ER - TY - CONF TI - Toward autonomic Web services trust and selection AU - Maximilien, E.M. AU - Singh, M.P. C2 - 2004/// C3 - ICSOC '04: Proceedings of the Second International Conference on Service Oriented Computing DA - 2004/// SP - 212-221 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-20444480301&partnerID=MN8TOARS ER - TY - BOOK TI - Service graphs for building trust AU - Yolum, P. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3290 SE - 509-525 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33846960261&partnerID=MN8TOARS ER - TY - CONF TI - Self-organizing referral networks: A process view of trust and authority AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2977 SP - 195-211 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144450099&partnerID=MN8TOARS ER - TY - CONF TI - Resolving commitments among autonomous agents AU - Mallya, A.U. AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2922 SP - 166-182 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144454066&partnerID=MN8TOARS ER - TY - CONF TI - Protocols for processes: Programming in the large for open systems (extended abstract) AU - Singh, M.P. AU - Chopra, A.K. AU - Desai, N.V. AU - Mallya, A.U. AB - The modeling and enactment of business processes is being recognized as key to modern information management. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their autonomy (freedom of action), heterogeneity (freedom of design), and dynamism (freedom of configuration). C2 - 2004/// C3 - Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA DA - 2004/// DO - 10.1145/1028664.1028712 SP - 120-123 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79951747233&partnerID=MN8TOARS ER - TY - CONF TI - Mapping Dooley graphs and commitment causality to the π-calculus AU - Wan, F. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 1 SP - 412-419 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544296343&partnerID=MN8TOARS ER - TY - JOUR TI - Developing trust in large-scale peer-to-peer systems T2 - IEEE 1ST SYMPOSIUM ON MULTI-AGENT SECURITY & SURVIVABILITY AB - In peer-to-peer (P2P) systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. A peer needs reputation mechanisms to incorporate the knowledge of others to decide whether to trust another party in P2P systems. This paper discusses the design of reputation mechanisms and proposes a distributed reputation mechanism to detect malicious or unreliable peers in P2P systems. It illustrates the process for rating gathering and aggregation and presents some experimental results to evaluate the proposed approach. Moreover, it considers how to effectively aggregate noisy (dishonest or inaccurate) ratings from independent or collusive peers using weighted majority techniques. Furthermore, it analyzes some possible attacks on reputation mechanisms and shows how to defend against such attacks. DA - 2004/// PY - 2004/// DO - 10.1109/MASSUR.2004.1368412 UR - https://publons.com/publon/21294484/ ER - TY - CONF TI - Commitments for flexible business processes AU - Chopra, A.K. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1362-1363 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544335679&partnerID=MN8TOARS ER - TY - CONF TI - Protocol-based business process modeling and enactment AU - Desai, N. AU - Singh, M.P. AB - Business processes are conventionally modeled as monolithic flows that capture the desired business logic. However, developing process flows is challenging. Because a flow specifies what its participants should do, it restricts the autonomy of its participants, thus limiting their ability to exploit opportunities or accommodate exceptions according to their business preferences. We take a dual perspective wherein business processes are modeled as compositions of (instantiated) business protocols. Each business protocol specifies interactions among its partners; each protocol serves a unique business purpose, e.g., processing a payment or shipping an item. Thus, modularizing a monolithic business process via business protocols allows clear separation of concerns for modeling and enacting the process. We develop an approach in which protocols are compiled into local skeletal flows for each participant that can be fleshed out with local business logic as needed. Such flows are naturally distributed but can be enacted using commercial business flow engines. Thus, our protocol-based approach combines the benefit of improved modeling with simplified implementations. C2 - 2004/// C3 - Proceedings - IEEE International Conference on Web Services DA - 2004/// DO - 10.1109/ICWS.2004.1314721 SP - 35-42 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4744344972&partnerID=MN8TOARS ER - TY - CONF TI - Nonmonotonic commitment machines AU - Chopra, A. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2922 SP - 183-200 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-22944442324&partnerID=MN8TOARS ER - TY - CONF TI - Developing trust in large-scale peer-to-peer systems AU - Yu, B. AU - Singh, M.P. AU - Sycara, K. C2 - 2004/// C3 - 2004 IEEE 1st Symposium on Multi-Agent Security and Survivability DA - 2004/// SP - 1-10 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-17644415405&partnerID=MN8TOARS ER - TY - BOOK TI - Deriving efficient SQL sequences via read-aheads AU - Bilgin, A.S. AU - Chirkova, R.Y. AU - Salo, T.J. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3181 SE - 299-308 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35048847119&partnerID=MN8TOARS ER - TY - CONF TI - Business Process Management: A Killer App for Agents? AU - Singh, Munindar P. C2 - 2004/7// C3 - Proceedings of the 3rd International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS) DA - 2004/7// VL - 1 SP - 26 PB - ACM Press UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544340500&partnerID=MN8TOARS ER - TY - CONF TI - Agent-based peer-to-peer service networks: A study of effectiveness and structure evolution AU - Udupi, Y.B. AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1336-1337 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544299541&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing commitment protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1364-1365 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544385537&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing business protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2004/// C3 - Thirteenth International World Wide Web Conference Proceedings, WWW2004 DA - 2004/// SP - 1040-1041 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-19944421093&partnerID=MN8TOARS ER - TY - JOUR TI - A framework and ontology for dynamic web, services selection AU - Maximilien, E.M. AU - Singh, M.P. T2 - IEEE Internet Computing AB - Current Web services standards lack the means for expressing a service's nonfunctional attributes - namely, its quality of service. QoS can be objective (encompassing reliability, availability, and request-to-response time) or subjective (focusing on user experience). QoS attributes are key to dynamically selecting the services that best meet user needs. This article addresses dynamic service selection via an agent framework coupled with a QoS ontology. With this approach, participants can collaborate to determine each other's service quality and trustworthiness. DA - 2004/// PY - 2004/// DO - 10.1109/MIC.2004.27 VL - 8 IS - 5 SP - 84-93 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-6944254513&partnerID=MN8TOARS ER - TY - CONF TI - A dynamic pricing mechanism for P2P referral systems AU - Yu, B. AU - Li, C. AU - Singh, M.P. AU - Sycara, K. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1426-1427 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544301282&partnerID=MN8TOARS ER - TY - JOUR TI - Agent-based service selection AU - Sreenath, R.M. AU - Singh, M.P. T2 - Web Semantics AB - The current infrastructure for Web services supports service discovery based on a common repository. However, the key challenge is not discovery but selection: ultimately, the service user must select one good provider. Whereas service descriptions are given from the perspective of providers, service selection must take the perspective of users. In this way, service selection involves pragmatics, which builds on but is deeper than semantics. Current approaches provide no support for this challenge. Importantly, service selection differs significantly from product selection, which is the problem addressed by traditional product recommender approaches. The assumptions underlying product recommender approaches do not hold for services. For example a vendor site knows of all product purchases made at it, whereas a service registry does not know of the service episodes that may involve services discovered from it. Also, traditional approaches assume that users are willing to reveal their evaluations to each vendor site. This paper formulates the problem of service selection. It reformulates two traditional recommender approaches for service selection and proposes a new agent-based approach in which agents cooperate to evaluate service providers. In this approach, the agents rate each other, and autonomously decide how much to weigh each other’s recommendations. The underlying algorithm with which the agents reason is developed in the context of a concept lattice, which enables finding relevant agents. Since large service selection datasets do not yet exist, for the purposes of evaluation, we reformulate the well-known product evaluations dataset MovieLens as a services dataset. We use it to compare the various approaches. Despite limiting the flow of information, the proposed approach compares well with the existing approaches in terms of some accuracy metrics defined within. DA - 2004/// PY - 2004/// DO - 10.1016/j.websem.2003.11.006 VL - 1 IS - 3 SP - 261-279 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-32544455685&partnerID=MN8TOARS ER - TY - CONF TI - A Semantic Approach for Designing E-Business Protocols AU - Mallya, Ashok U. AU - Singh, Munindar P. AB - Business processes involve interactions among autonomous partners. We propose that these interactions be specified modularly as protocols. Protocols can be published, enabling implementors to independently develop components that respect published protocols and yet serve diverse interests. A variety of business protocols would be needed to capture subtle business needs. We propose that the same kinds of conceptual abstractions be developed for protocols as for information models. Specifically, we consider (1) refinement: a subprotocol may satisfy the requirements of a superprotocol, but support additional properties; and (2) aggregation: a protocol may combine existing protocols. In support of the above, this paper develops a semantics of protocols and an operational characterization of them. This supports judgments about the potential subclass-superclass relations between protocols, which are a result of protocol refinement. It also enables protocol aggregation by splicing a protocol into another protocol. C2 - 2004/// C3 - Proceedings of the 2nd International Conference on Web Services (ICWS) DA - 2004/// DO - 10.1109/ICWS.2004.1314807 SP - 742–745 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544282690&partnerID=MN8TOARS ER - TY - CONF TI - A DAML-based repository for QoS-aware semantic Web service selection AU - Bilgin, A.S. AU - Singh, M.P. AB - The Web is moving toward a collection of interoperating Web services. Achieving this interoperability requires dynamic discovery of Web services on the basis of their capabilities. The capability of a service can be properly determined by using not only its functional description (or service interface), but also its quality attributes as judged by previous users of the service. We develop a service repository that extends UDDI registries. This repository combines an ontology of attributes with evaluation data. We base our repository on a new query and manipulation language based on DAML. Our language includes support for a rich set of operations, which are needed to maintain an attribute ontology, publish services, rate services, and select services based on their functional attributes as well as evaluations by others. We have implemented our approach and evaluated its practical completeness via a number of key query and manipulation templates. C2 - 2004/// C3 - Proceedings - IEEE International Conference on Web Services DA - 2004/// DO - 10.1109/ICWS.2004.1314759 SP - 368-375 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4744366399&partnerID=MN8TOARS ER - TY - JOUR TI - Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem AU - Brglez, Franc AU - Li, Xiao Y AU - Stallmann, Matthias F AU - Militzer, Burkhard T2 - Information Sciences DA - 2004/// PY - 2004/// ER - TY - CONF TI - Parallel Solution of the {Wigner-Poisson} Equations for {RTDs} AU - Lasater, M S AU - Kelley, C T AU - Salinger, A AU - Woolard, D L AU - Zhao, P A2 - Qingping, Quo C2 - 2004/// C3 - 2004 International Symposium on Distributed Computing and Applications to Business, Engineering and Science CY - Wuhan, China DA - 2004/// SP - 672-676 PB - Hubei Science and Technology Press ER - TY - CONF TI - Simulation of Nondifferentiable Models for Groundwater Flow and Transport AU - Kelley, C T AU - Fowler, K R AU - Kees, C E A2 - Miller, C T A2 - Farthing, M. W. A2 - Gray, W G A2 - Pinter, G F C2 - 2004/// C3 - Proceedings of Computational Methods in Water Resources XV CY - Amsterdam DA - 2004/// SP - 939-952 PB - Elsevier ER - TY - JOUR TI - Implicit Filtering Revisited AU - Conn, A R AU - Kelley, C T AU - Scheinberg, K AU - Vicente, L N DA - 2004/// PY - 2004/// ER - TY - CONF TI - Enhancement of Numerical Computations of the {W}igner-{P}oisson Equations for Application to the Simulation of {TH}z-Frequency {RTD} Oscillators AU - Lasater, M S AU - Kelley, C T AU - Salinger, A AU - Woolard, D L AU - Zhao, P T2 - North Carolina State University, Center for Research in Scientific Computation A2 - Jensen, J O A2 - Theriault, J-M C2 - 2004/// C3 - Proceedings of SPIE: Chemical and Biological Standoff Detection II Volume 5584, paper number 07 DA - 2004/// SP - 42-51 ER - TY - CONF TI - A Hydraulic Capture Application for Optimal Remeidation Design AU - Fowler, K R AU - Kelley, C T AU - Kees, C E AU - Miller, C T A2 - Miller, C T A2 - Farthing, M. W. A2 - Gray, W G A2 - Pinter, G F C2 - 2004/// C3 - Proceedings of Computational Methods in Water Resources XV CY - Amsterdam DA - 2004/// SP - 1149-1158 PB - Elsevier ER - TY - JOUR TI - A Fast Algorithm for the {Ornstein-Zernike} Equations AU - Kelley, C T AU - Pettitt, B Montgomery T2 - J. Comp. Phys. DA - 2004/// PY - 2004/// VL - 197 SP - 491-591 ER - TY - BOOK TI - Characterization and Computation of a "Good Control" AB - Models for physical systems often take the form of implicit or behavioral models. One important problem is the identification of which combinations of variables are good candidtates for control variables. This paper first provides one solution to this problem for linear time varying systems. The solution is shown to be related to a general optimization problem. It is then shown how these same algorithms can be extended to a large and important class of nonlinear systems. DA - 2004/5/3/ PY - 2004/5/3/ DO - 10.18452/2583 ER - TY - JOUR TI - The deployment scheduling analysis tool (DSAT) AU - Hodgson, T.J AU - Melendez, B AU - Thoney, K.A AU - Trainor, T T2 - Mathematical and Computer Modelling AB - The deployment scheduling analysis tool is an analysis tool for studying military deployment scenarios. The tool has a user interface through which the user selects the deploying units, equipment, and their required delivery dates. The user also selects the ports (air, rail, and sea) through which the units will travel to get to the final destination. Finally, the user selects the transportation assets on which the units will travel and assigns those assets to the routes in the deployment network. The system schedules the equipment for deployment by creating individual equipment routings and then repetitively simulating the deployment to determine the deployment closure time and the maximum lateness ( L max ) of any unit. The equipment is scheduled to minimize the maximum lateness of all deploying units. Deployment information is formatted into various graphs and reports. Finally, the user can modify various aspects of the deployment scenario to conduct sensitivity analysis. A valuable option is a heuristic procedure to reassign transportation assets in an attempt to further reduce the deployment closure time and L max . DA - 2004/3// PY - 2004/3// DO - 10.1016/s0895-7177(04)90561-4 VL - 39 IS - 6-8 SP - 905-924 J2 - Mathematical and Computer Modelling LA - en OP - SN - 0895-7177 UR - http://dx.doi.org/10.1016/s0895-7177(04)90561-4 DB - Crossref KW - military deployment KW - analysis tool KW - equipment routing KW - deployment network KW - equipment scheduling ER - TY - JOUR TI - Scheduling supply chains with batchwise fabric dyeing operations AU - Cho, Eunkyoung Gloria DA - 2004/// PY - 2004/// ER - TY - JOUR TI - Integrating Ideality with the System Operator Part 1: A Tutorial--Applied to the Bullwhip Effect AU - Martin, Benjamin AU - Clapp, Timothy G AU - Joines, Jeffrey A T2 - TRIZ Journal DA - 2004/// PY - 2004/// ER - TY - CONF TI - Vitri: A framework for environmental decision support on heterogeneous computer networks AB - Vitri is an object-oriented framework implemented in Java for high-performance distributed computing. Using Vitri, applications can engage in cooperative problem solving by dividing their tasks among heterogeneous clusters of workstations and PCs. Vitri's features include basic support for distributed computing and communication, as well as visual tools for evaluating run-time performance, and modules for heuristic optimization. It balances loads dynamically using a client-side task pool, allows the addition or removal of servers dating a run, and provides fault tolerance transparently for servers and networks. Among its more powerful features are modules for heuristic optimization, including an asynchronous global-parallel genetic algorithm that is particularly suited for coarse-grained tasks executing on processors with large variations in processor speeds. By using dataflow techniques, in which computations are explicitly based on the availability and forwarding of data, the usual end-of-generation synchronization points are removed from the algorithm. Results are presented for illustrative applications in water distribution network design and air quality management. C2 - 2004/// C3 - Bridging the Gap: Meeting the World's Water and Environmental Resources Challenges - Proceedings of the World Water and Environmental Resources Congress 2001 DA - 2004/// DO - 10.1061/40569(2001)111 VL - 111 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75649149870&partnerID=MN8TOARS ER - TY - CONF TI - Method for least cost design of looped pipe networks for different levels of redundancy using genetic algorithms AU - Kumar, S.V. AU - Doby, T.A. AU - Baugh, J.W. AU - Brill, E.D. AU - Ranjithan, S.R. AB - A new method is proposed for the least cost design of looped piped networks under various levels of redundancy using a genetic algorithm. Various levels of redundancy can be obtained by considering the number of pipes to be taken out of service at any one time. As a result, a tradeoff curve of redundancy and cost can be developed. The approach is being extended to consider different measures of redundancy as well as other performance criteria. Such extensions are more computationally demanding and are therefore being implemented using a distributed GA. C2 - 2004/// C3 - Joint Conference on Water Resource Engineering and Water Resources Planning and Management 2000: Building Partnerships DA - 2004/// DO - 10.1061/40517(2000)201 VL - 104 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-74949091879&partnerID=MN8TOARS ER - TY - CONF TI - Genetic algorithm search for least cost design of looped pipe networks using age as a quality surrogate and different levels of redundancy AU - Doby, T.A. AU - Kumar, S.V. AU - Baugh, J.W. AU - Brill, E.D. AU - Ranjithan, S.R. AB - A genetic algorithm- (GA-) based method is being investigated for determining the least cost design of looped networks while considering the residence time of the water in the network as a quality surrogate and various levels of redundancy. The conflict among the three design objectives, i.e., cost, redundancy, and water quality, is examined via multiobjective analysis. C2 - 2004/// C3 - Bridging the Gap: Meeting the World's Water and Environmental Resources Challenges - Proceedings of the World Water and Environmental Resources Congress 2001 DA - 2004/// DO - 10.1061/40569(2001)387 VL - 111 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75649129137&partnerID=MN8TOARS ER - TY - CONF TI - Solving a Real World Inventory Management Problem Using a Technique for Integrating Ideality with the System Operator AU - Martin, B.E. AU - Clapp, T.G. AU - Joines, J.A. C2 - 2004/// C3 - Proceedings of the 2004 Triz Conference DA - 2004/// ER - TY - JOUR TI - Applying Systems Approach and Ideality to the Supply Chain Bullwhip Effect AU - Martin, B. AU - Clapp, T. AU - Joines, J.A. T2 - The TRIZ Journal DA - 2004/6// PY - 2004/6// ER - TY - CONF TI - Steady-state simulation analysis using Asap3 AU - Lada, E. K. AU - J.R.Wilson, N.M. Steiger AU - Joines, J.A. C2 - 2004/// C3 - Proceedings of the 2004 Winter Simulation Conference: Washington Hilton and Towers, Washington, D.C., U.S.A., December 5-8, 20043 DA - 2004/// SP - 672-680 PB - New York, N.Y.: Association for Computing Machinery SN - 9780780387867 ER - TY - CONF TI - A Simulation-Based Scheduling System and Its Implementation in a Textile Operation AU - Joines, J.A. AU - Thoney, K. AU - King, R.E. AU - Hodgson, T. A2 - Marin, J. A2 - Koncar, V. C2 - 2004/// C3 - Proceedings of the 2nd International Industrial Simulation Conference DA - 2004/// PB - EUROSIS SN - 9789077381120 ER - TY - JOUR TI - Sensitivity analysis of transportation corridor location in wetland areas: A multiobjective programming and GIS approach AU - Roise, J. P. AU - Shear, T. H. AU - Bianco, J. V. T2 - Wetlands Ecology and Management DA - 2004/10// PY - 2004/10// DO - 10.1007/s11273-005-3949-x VL - 12 IS - 5 SP - 519-529 J2 - Wetlands Ecol Manage LA - en OP - SN - 0923-4861 1572-9834 UR - http://dx.doi.org/10.1007/s11273-005-3949-x DB - Crossref ER - TY - JOUR TI - An approach to optimal wetland mitigation using mathematical programming and geographic information system based wetland function estimation AU - Roise, Joseph AU - Gainey, K. W. AU - Shear, T. H. T2 - Wetlands Ecology and Management DA - 2004/// PY - 2004/// DO - 10.1007/s11273-004-2437-z VL - 12 IS - 5 SP - 321 ER - TY - JOUR TI - Modeling and optimal regulation of erythropoiesis subject to benzene intoxication AU - Banks, HT AU - Cole, CE AU - Schlosser, PM AU - Tran, HT T2 - MATHEMATICAL BIOSCIENCES AND ENGINEERING AB - Benzene (C(6)H(6)) is a highly flammable, colorless liquid. Ubiquitous exposures result from its presence in gasoline vapors, cigarette smoke, and industrial processes. Benzene increases the incidence of leukemia in humans when they are exposed to high doses for extended periods; however, leukemia risks in humans subjected to low exposures are uncertain. The exposure-dose- response relationship of benzene in humans is expected to be nonlinear because benzene undergoes a series of metabolic transformations, detoxifying and activating, resulting in various metabolites that exert toxic effects on the bone marrow. Since benzene is a known human leukemogen, the toxicity of benzene in the bone marrow is of most importance. And because blood cells are produced in the bone marrow, we investigated the effects of benzene on hematopoiesis (blood cell production and development). An age-structured model was used to examine the process of erythropoiesis, the development of red blood cells. This investigation proved the existence and uniqueness of the solution of the system of coupled partial and ordinary differential equations. In addition, we formulated an optimal control problem for the control of erythropoiesis and performed numerical simulations to compare the performance of the optimal feedback law and another feedback function based on the Hill function. DA - 2004/6// PY - 2004/6// DO - 10.3934/mbe.2004.1.15 VL - 1 IS - 1 SP - 15-48 SN - 1547-1063 KW - hematopoiesis KW - age-structured model KW - existence and uniqueness KW - optimal control ER - TY - JOUR TI - Dynamic multidrug therapies for HIV: Optimal and STI control approaches AU - Adams, B. M. AU - Banks, H. T. AU - Kwon, H. D. AU - Tran, Hien T2 - Mathematical Biosciences and Engineering AB - We formulate a dynamic mathematical model that describes the interaction of the immune system with the human immunodeficiency virus (HIV) and that permits drug ''cocktail'' therapies. We derive HIV therapeutic strategies by formulating and analyzing an optimal control problem using two types of dynamic treatments representing reverse transcriptase (RT) inhibitors and protease inhibitors (PIs). Continuous optimal therapies are found by solving the corresponding optimality systems. In addition, using ideas from dynamic programming, we formulate and derive suboptimal structured treatment interruptions (STI) in antiviral therapy that include drug-free periods of immune-mediated control of HIV. Our numerical results support a scenario in which STI therapies can lead to long-term control of HIV by the immune response system after discontinuation of therapy. DA - 2004/// PY - 2004/// DO - 10.3934/mbe.2004.1.223 VL - 1 IS - 2 SP - 223–241 ER - TY - JOUR TI - Control of mobile communication systems with time-varying channels via stability methods AU - Buche, R AU - Kushner, HJ T2 - IEEE TRANSACTIONS ON AUTOMATIC CONTROL AB - Consider the forward link of a mobile communications system with a single transmitter and connecting to K destinations via randomly varying channels. Data arrives in some random way and is queued according to the K destinations until transmitted. Time is divided into small scheduling intervals. Current systems can estimate the channel (e.g, via pilot signals) and use this information for scheduling. The issues are the allocation of transmitter power and/or time and bandwidth to the various queues in a queue and channel-state dependent way to assure stability and good operation. The decisions are made at the beginning of the scheduling intervals. Stochastic stability methods are used both to assure that the system is stable and to get appropriate allocations, under very weak conditions. The choice of Lyapunov function allows a choice of the effective performance criteria. The resulting controls are readily implementable and allow a range of tradeoffs between current rates and queue lengths. The various extensions allow a large variety of schemes of current interest to be covered. All essential factors are incorporated into a "mean rate" function, so that the results cover many different systems. Because of the non-Markovian nature of the problem, we use the perturbed Stochastic Lyapunov function method, which is well adapted to such problems. The method is simple and effective. DA - 2004/11// PY - 2004/11// DO - 10.1109/TAC.2004.837590 VL - 49 IS - 11 SP - 1954-1962 SN - 0018-9286 KW - mobile communications KW - perturbed Lyapunov function KW - stability KW - time-varying systems ER - TY - JOUR TI - Incentive mechanisms for peer-to-peer systems AU - Yu, B. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Most of the existing research in peer-to-peer systems focuses on protocol design and doesn’t consider the rationality of each peer. One phenomenon that should not be ignored is free riding. Some peers simply consume system resources but contribute nothing to the system. In this paper we present an agent-based peer-to-peer system, in which each peer is a software agent and the agents cooperate to search the whole system through referrals. We present a static and a dynamic pricing mechanism to motivate each agent to behave rationally while still achieving good overall system performance. We study the behavior of the agents under two pricing mechanisms and evaluate the impact of free riding using simulations. CN - TK5105.525 .A615 2002 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-25840-7_9 VL - 2872 SP - 77–88 UR - https://publons.com/publon/21294483/ ER - TY - JOUR TI - Lecture hall theorems, q-series and truncated objects AU - Corteel, S AU - Savage, CD T2 - JOURNAL OF COMBINATORIAL THEORY SERIES A AB - We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q -Chu Vandermonde identities, once an appropriate recurrence is derived. We use this approach to get new lecture hall-type theorems for truncated objects. The truncated lecture hall partitions are sequences ( λ 1 , … , λ k ) such that λ 1 n ⩾ λ 2 n - 1 ⩾ ⋯ ⩾ λ k n - k + 1 ⩾ 0 and we show that their generating function is ∑ m = 0 k n m q q m + 1 2 ( - q n - m + 1 ; q ) m ( q 2 n - m + 1 ; q ) m . From this, we are able to give a combinatorial characterization of truncated lecture hall partitions and new finite versions of refinements of Euler's theorem. The truncated anti-lecture hall compositions are sequences ( λ 1 , … , λ k ) such that λ 1 n - k + 1 ⩾ λ 2 n - k + 2 ⩾ ⋯ ⩾ λ k n ⩾ 0 . We show that their generating function is n k q ( - q n - k + 1 ; q ) k ( q 2 ( n - k + 1 ) ; q ) k , giving a finite version of a well-known partition identity. We give two different multivariate refinements of these new results: the q -calculus approach gives ( u , v , q ) -refinements, while a completely different approach gives odd / even ( x , y ) -refinements. DA - 2004/11// PY - 2004/11// DO - 10.1016/j.jcta.2004.05.006 VL - 108 IS - 2 SP - 217-245 SN - 1096-0899 KW - integer partitions KW - integer compositions KW - enumeration ER - TY - JOUR TI - Special issue on the International Conference on Optimization and Optimal Control (ICOOC), June 1-4, 2001 - Foreword AU - Wu, S. Y. AU - Fang, S. C. T2 - Journal of Global Optimization DA - 2004/// PY - 2004/// VL - 30 IS - 03-Feb SP - 119-120 ER - TY - JOUR TI - Service graphs for building trust AU - Yolum, P. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Information systems must establish trust to cooperate effectively in open environments. We are developing an agent-based approach for establishing trust, where information systems are modeled as agents that provide and consume services. Agents can help each other find trustworthy parties by providing referrals to those that they trust. We propose a graph-based representation of services for modeling the trustworthiness of agents. This representation captures natural relationships among service domains and provides a simple means to accommodate the accrual of trust placed in a given party. When interpreted as a lattice, it enables less important services (e.g., low-value transactions) to be used as gates to more important services (e.g., high-value transactions). We first show that, where applicable, this approach yields superior efficiency (needs fewer messages) and effectiveness (finds more providers) than a vector representation that does not capture the relationships between services. Next, we study trade-offs between various factors that affect the performance of this approach. CN - [Electronic Resource] DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-30468-5_32 VL - 3290 SP - 509–525 UR - https://publons.com/publon/13073985/ ER - TY - JOUR TI - Protocols for processes AU - Singh, Munindar P. AU - Chopra, Amit K. AU - Desai, Nirmit AU - Mallya, Ashok U. T2 - ACM SIGPLAN Notices AB - The modeling and enactment of business processes is being recognized as key to modern information managment. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their autonomy (freedom of action), heterogeneity (freedom of design), and dynamism (freedom of configuration).Flexibly represented protocols can provide a more natural basis for specifying processes. Protocols specify what rather than how ; thus they naturally maximize the authonomy, heterogeneity, and dynamism of the interacting parties. We are developing an approach for modeling and enacting business processes based on protocols. This paper describes some elements of (1) a conceptual model of processes that will incorporate abstractions based on protocols, roles, and commitments; (2)the semantics or mathematical foundations underlying the conceptual model and mapping global views of processes to the local actions of the parties involved; (3) methodologies involving rule-based reasoning to specify processes in terms of compositions of protocols. DA - 2004/12/1/ PY - 2004/12/1/ DO - 10.1145/1052883.1052893 VL - 39 IS - 12 SP - 73 J2 - SIGPLAN Not. LA - en OP - SN - 0362-1340 UR - http://dx.doi.org/10.1145/1052883.1052893 DB - Crossref KW - standardization KW - languages KW - design KW - open systems KW - interaction protocols KW - business processes ER - TY - JOUR TI - Deriving efficient SQL sequences via read-aheads AU - Bilgin, A. S. AU - Chirkova, R. Y. AU - Salo, T. J. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Modern information system architectures place applications in an application server and persistent objects in a relational database. In this setting, we consider the problem of improving application throughput; our proposed solution uses data prefetching (read-aheads) to minimize the total data-access time of an application, in a manner that affects neither the application code nor the backend DBMS. Our methodology is based on analyzing and automatically merging SQL queries to produce query sequences with low total response time, in ways that exploit the application’s data-access patterns. The proposed approach is independent of the application domain and can be viewed as a component of container managed persistence that can be implemented in middleware. This paper describes our proposed framework for using generic data-access patterns to improve application throughput and reports preliminary experimental results on discovering key parameters that influence the trade-offs in producing efficient merged SQL queries. The approach is evaluated in the context of a financial domain, which yields the kinds of natural conceptual relationships where our approach is valuable. CN - QA76.9 .D37 D396 2004 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-30076-2_30 VL - 3181 SP - 299–308 UR - https://publons.com/publon/21294482/ ER - TY - JOUR TI - Approximate solution of singular integro-differential equations by reduction over Faber-Laurent polynomials AU - Zolotarevskii, VA AU - Li, ZL AU - Caraus, I T2 - DIFFERENTIAL EQUATIONS DA - 2004/12// PY - 2004/12// DO - 10.1007/s10625-005-0108-3 VL - 40 IS - 12 SP - 1764-1769 SN - 0012-2661 ER - TY - JOUR TI - An efficient algorithm for generating univariate cubic L-1 splines AU - Cheng, H AU - Fang, SC AU - Lavery, JE T2 - COMPUTATIONAL OPTIMIZATION AND APPLICATIONS DA - 2004/11// PY - 2004/11// DO - 10.1023/B:COAP.0000042031.03626.1b VL - 29 IS - 2 SP - 219-253 SN - 0926-6003 KW - active set method KW - convex programming KW - cubic L-1 spline KW - geometric programming ER - TY - JOUR TI - The role of learning and technical capabilities in predicting adoption of B2B technologies AU - Zahay, DL AU - Handfield, RB T2 - INDUSTRIAL MARKETING MANAGEMENT AB - Using the resource-based view and the learning organization as its theoretical framework, this study hypothesized that organizations which possessed not only the technical capabilities for automation but also the ability to learn and share information would be most likely to automate their supply chain processes. An empirical study with the top suppliers of a major airline supported this hypothesis. As predicted, both learning capabilities and certain technical capabilities were important in predicting the likelihood of adoption of Ariba, a web-based e-procurement tool. DA - 2004/10// PY - 2004/10// DO - 10.1016/j.indmarman.2003.10.004 VL - 33 IS - 7 SP - 627-641 SN - 1873-2062 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4644347741&partnerID=MN8TOARS KW - supply chain management KW - information management KW - knowledge management KW - resource-based view KW - technology adoption ER - TY - JOUR TI - Reasoning about commitments in the event calculus: An approach for specifying and executing protocols AU - Yolum, P AU - Singh, MP T2 - ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE DA - 2004/9// PY - 2004/9// DO - 10.1023/B:AMAI.0000034528.55456.d9 VL - 42 IS - 1-3 SP - 227-253 SN - 1573-7470 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-3843082776&partnerID=MN8TOARS KW - commitments KW - agent communication languages and protocols KW - methodologies ER - TY - JOUR TI - LBIC imaging of semiconductor arrays: The cross-sectional model AU - Fang, WF AU - Ito, K AU - Redfern, DA T2 - MATHEMATICAL AND COMPUTER MODELLING AB - Laser beam induced current (LBIC)/nondestructive technique that has been used for a number of years to qualitatively examine large arrays of p-n junctions, especially in HgCdTe infrared focal plane arrays. In this paper, we quantitatively study the application of the LBIC imaging technique to semiconductor arrays Based on a previous mathematical model for LBIC applied to individual devices, we employ the homogenization method to derive approximations of the LBIC images of large arrays. Such approximations reduce the computational burden in simulations of these LBIC bouges. We then illustrate the application of our approximations for the purpose of recovering array parameters from the LBIC images. DA - 2004/7// PY - 2004/7// DO - 10.1016/j.mcm.2003.10.045 VL - 40 IS - 1-2 SP - 127-136 SN - 1872-9479 KW - homogenization KW - LBIC KW - semiconductor arrays KW - inverse problem KW - parameter identification ER - TY - JOUR TI - Kronecker product approximate preconditioner for SANs AU - Langville, AN AU - Stewart, WJ T2 - NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS AB - Abstract Many very large Markov chains can be modelled efficiently as stochastic automata networks (SANs). A SAN is composed of individual automata which, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov chain compactly as the sum of Kronecker products of smaller matrices. Thus, storage savings are immediate. The benefit of a SAN's compact representation, known as the descriptor, is often outweighed by its tendency to make analysis of the underlying Markov chain tough. While iterative or projections methods have been used to solve the system π Q =0, the time until these methods converge to the stationary solution π is still unsatisfactory. SAN's compact representation has made the next logical research step of preconditioning thorny. Several preconditioners for SANs have been proposed and tested, yet each has enjoyed little or no success. Encouraged by the recent success of approximate inverses as preconditioners, we have explored their potential as SAN preconditioners. One particularly relevant finding on approximate inverse preconditioning is the nearest Kronecker product approximation discovered by Pitsianis and Van Loan. In this paper, we extend the nearest Kronecker product technique to approximate the Q matrix for an SAN with a Kronecker product, A 1 ⊗ A 2 ⊗…⊗ A N . Then, we take M = A ⊗ A ⊗…⊗ A as our SAN NKP preconditioner. Copyright © 2004 John Wiley & Sons, Ltd. DA - 2004/// PY - 2004/// DO - 10.1002/nla.344 VL - 11 IS - 8-9 SP - 723-752 SN - 1099-1506 KW - stochastic automata networks KW - nearest Kronecker products KW - inultilinear alaebra KW - preconditioning ER - TY - JOUR TI - Coding theory based models for protein translation initiation in prokaryotic organisms AU - May, EE AU - Vouk, MA AU - Bitzer, DL AU - Rosnick, DI T2 - BIOSYSTEMS AB - Our research explores the feasibility of using communication theory, error control (EC) coding theory specifically, for quantitatively modeling the protein translation initiation mechanism. The messenger RNA (mRNA) of Escherichia coli K-12 is modeled as a noisy (errored), encoded signal and the ribosome as a minimum Hamming distance decoder, where the 16S ribosomal RNA (rRNA) serves as a template for generating a set of valid codewords (the codebook). We tested the E. coli based coding models on 5′ untranslated leader sequences of prokaryotic organisms of varying taxonomical relation to E. coli including: Salmonella typhimurium LT2, Bacillus subtilis, and Staphylococcus aureus Mu50. The model identified regions on the 5′ untranslated leader where the minimum Hamming distance values of translated mRNA sub-sequences and non-translated genomic sequences differ the most. These regions correspond to the Shine–Dalgarno domain and the non-random domain. Applying the EC coding-based models to B. subtilis, and S. aureus Mu50 yielded results similar to those for E. coli K-12. Contrary to our expectations, the behavior of S. typhimurium LT2, the more taxonomically related to E. coli, resembled that of the non-translated sequence group. DA - 2004/// PY - 2004/// DO - 10.1016/j.biosystems.2004.05.017 VL - 76 IS - 1-3 SP - 249-260 SN - 0303-2647 KW - coding theory KW - translation initiation KW - information theory KW - information processing ER - TY - JOUR TI - Bayesian estimation of the spectral density of a time series AU - Choudhuri, N AU - Ghosal, S AU - Roy, A T2 - JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION AB - AbstractThis article describes a Bayesian approach to estimating the spectral density of a stationary time series. A nonparametric prior on the spectral density is described through Bernstein polynomials. Because the actual likelihood is very complicated, a pseudoposterior distribution is obtained by updating the prior using the Whittle likelihood. A Markov chain Monte Carlo algorithm for sampling from this posterior distribution is described that is used for computing the posterior mean, variance, and other statistics. A consistency result is established for this pseudoposterior distribution that holds for a short-memory Gaussian time series and under some conditions on the prior. To prove this asymptotic result, a general consistency theorem of Schwartz is extended for a triangular array of independent, nonidentically distributed observations. This extension is also of independent interest. A simulation study is conducted to compare the proposed method with some existing methods. The method is illustrated with the well-studied sunspot dataset.KEY WORDS : Bernstein polynomialDirichlet processMetropolis algorithmPeriodogramPosterior consistencyPosterior distributionSpectral densityTime series DA - 2004/12// PY - 2004/12// DO - 10.1198/016214504000000557 VL - 99 IS - 468 SP - 1050-1059 SN - 1537-274X KW - Bernstein polynomial KW - Dirichlet process KW - metropolis algorithm KW - periodogram KW - posterior consistency KW - posterior distribution KW - spectral density KW - time series ER - TY - JOUR TI - Special issue devoted to papers presented at the Conference on the Numerical Solution of Markov Chains 2003 - Preface AU - Langville, AN AU - Stewart, WJ T2 - LINEAR ALGEBRA AND ITS APPLICATIONS DA - 2004/7/15/ PY - 2004/7/15/ DO - 10.1016/j.laa.2004.02.016 VL - 386 SP - 1-2 SN - 1873-1856 ER - TY - JOUR TI - Solution of a well-field design problem with implicit filtering AU - Fowler, KR AU - Kelley, CT AU - Miller, CT AU - Kees, CE AU - Darwin, RW AU - Reese, JP AU - Farthing, MW AU - Reed, MSC T2 - OPTIMIZATION AND ENGINEERING AB - Problems involving the management of groundwater resources occur routinely, and management decisions based upon optimization approaches offer the potential to save substantial amounts of money. However, this class of application is notoriously difficult to solve due to non-convex objective functions with multiple local minima and both nonlinear models and nonlinear constraints. We solve a subset of community test problems from this application field using MODFLOW, a standard groundwater flow model, and IFFCO, an implicit filtering algorithm that was designed to solve problems similar to those of focus in this work. While sampling methods have received only scant attention in the groundwater optimization literature, we show encouraging results that suggest they are deserving of more widespread consideration for this class of problems. In keeping with our objectives for the community problems, we have packaged the approaches used in this work to facilitate additional work on these problems by others and the application of implicit filtering to other problems in this field. We provide the data for our formulation and solution on the web. DA - 2004/6// PY - 2004/6// DO - 10.1023/B:OPTE.0000033375.33183.e7 VL - 5 IS - 2 SP - 207-234 SN - 1573-2924 KW - implicit filtering KW - well field design KW - groundwater flow and transport ER - TY - JOUR TI - Self-organizing referral networks: A process view of trust and authority AU - Yolum, P. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - We are developing a decentralized approach to trust based on referral systems, where agents adaptively give referrals to one another to find other trustworthy agents. Interestingly, referral systems provide us with a useful and intuitive model of how links may be generated: a referral corresponds to a customized link generated on demand by one agent for another. This gives us a basis for studying the processes underlying trust and authority, especially as they affect the structure of the evolving social network of agents. We explore key relationships between the policies and representations of the individual agents on the one hand and the aggregate structure of their social network on the other. CN - QA76.618 .E54 2004 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-24701-2_14 VL - 2977 SP - 195–211 UR - https://publons.com/publon/13074000/ ER - TY - JOUR TI - Scheduling non-similar groups on a flow line: multiple group setups AU - Wilson, A. D. AU - King, R. E. AU - Hodgson, Thom T2 - Robotics and Computer-Integrated Manufacturing DA - 2004/// PY - 2004/// DO - 10.1016/j.reim.2004.07.002 VL - 20 IS - 6 SP - 505–515 ER - TY - JOUR TI - On convexified robust control synthesis AU - Wu, F AU - Bei, L T2 - AUTOMATICA AB - In this paper, we study a convexified robust control problem and its relation to gain-scheduling control. It reveals that the robust control synthesis condition becomes convex under a special plant structure. Moreover, for this class of robust control problems, the gain-scheduling control approach from scaled small-gain theorem will not provide any performance improvement over convexified robust controllers. Based on this observation, a convexified robust control synthesis framework with stringent performance and computational efficacy is proposed. DA - 2004/6// PY - 2004/6// DO - 10.1016/j.automatica.2004.01.010 VL - 40 IS - 6 SP - 1003-1010 SN - 1873-2836 KW - robust control KW - gain-scheduling control KW - convexity KW - scaled H infinity optimization KW - linear matrix inequality ER - TY - JOUR TI - Minimizing L-max for the single machine scheduling problem with family set-ups AU - Schultz, , SR AU - Hodgson, TJ AU - King, RE AU - Taner, MR T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH AB - A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems. DA - 2004/10/15/ PY - 2004/10/15/ DO - 10.1080/00207540410001716561 VL - 42 IS - 20 SP - 4315-4330 SN - 1366-588X ER - TY - JOUR TI - Injective properties of complex matrices AU - Meyer, C. T2 - American Mathematical Monthly DA - 2004/// PY - 2004/// DO - 10.2307/4145059 VL - 111 IS - 8 SP - 728 ER - TY - JOUR TI - Determinantal identities over commutative semirings AU - Poplin, PL AU - Hartwig, RE T2 - LINEAR ALGEBRA AND ITS APPLICATIONS AB - We present a development of determinantal identities over commutative semirings. This includes a generalization of the Cauchy–Binet and Laplace Theorems, as well as results on compound matrices and adjoints. It is further shown that Laplace's Theorem is a special case of the grade-s-adjoint identity. DA - 2004/8/1/ PY - 2004/8/1/ DO - 10.1016/j.laa.2004.02.019 VL - 387 SP - 99-132 SN - 0024-3795 KW - semiring KW - determinant KW - laplace KW - Cauchy-Binet ER - TY - JOUR TI - Adaptive resource allocation in multimodal activity networks AU - Tereso, A. P. AU - Araujo, M. M. T. AU - ElMaghraby, S. E. T2 - International Journal of Production Economics DA - 2004/// PY - 2004/// VL - 92 IS - 1 SP - 10- ER - TY - JOUR TI - Accounting for input-model and input-parameter uncertainties in simulation AU - Zouaoui, F AU - Wilson, , JR T2 - IIE TRANSACTIONS AB - To account for the input-model and input-parameter uncertainties inherent in many simulations as well as the usual stochastic uncertainty, we present a Bayesian input-modeling technique that yields improved point and confidence-interval estimators for a selected posterior mean response. Exploiting prior information to specify the prior probabilities of the postulated input models and the associated prior input-parameter distributions, we use sample data to compute the posterior input-model and input-parameter distributions. Our Bayesian simulation replication algorithm involves: (i) estimating parameter uncertainty by randomly sampling the posterior input-parameter distributions; (ii) estimating stochastic uncertainty by running independent replications of the simulation using each set of input-model parameters sampled in (i); and (iii) estimating input-model uncertainty by weighting the responses generated in (ii) using the corresponding posterior input-model probabilities. Sampling effort is allocated among input models to minimize final point-estimator variance subject to a computing-budget constraint. A queueing simulation demonstrates the advantages of this approach. DA - 2004/11// PY - 2004/11// DO - 10.1080/07408170490500708 VL - 36 IS - 11 SP - 1135-1151 SN - 1545-8830 ER - TY - JOUR TI - A compressed accessibility map for XML AU - Yu, T AU - Srivastava, D AU - Lakshmanan, LVS AU - Jagadish, HV T2 - ACM TRANSACTIONS ON DATABASE SYSTEMS AB - XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets. DA - 2004/6// PY - 2004/6// DO - 10.1145/1005566.1005570 VL - 29 IS - 2 SP - 363-402 SN - 1557-4644 KW - algorithms KW - experimentation KW - performance KW - theory KW - access control KW - structural locality KW - XML ER - TY - JOUR TI - Regularly spaced subsums of integer partitions AU - Canfield, ER AU - Savage, CD AU - Wilf, HS T2 - ACTA ARITHMETICA AB - For integer partitions $\lambda :n=a_1+...+a_k$, where $a_1\ge a_2\ge >...\ge a_k\ge 1$, we study the sum $a_1+a_3+...$ of the parts of odd index. We show that the average of this sum, over all partitions $\lambda$ of $n$, is of the form $n/2+(\sqrt{6}/(8\pi))\sqrt{n}\log{n}+c_{2,1}\sqrt{n}+O(\log{n}).$ More generally, we study the sum $a_i+a_{m+i}+a_{2m+i}+...$ of the parts whose indices lie in a given arithmetic progression and we show that the average of this sum, over all partitions of $n$, is of the form $n/m+b_{m,i}\sqrt{n}\log{n}+c_{m,i}\sqrt{n}+O(\log{n})$, with explicitly given constants $b_{m,i},c_{m,i}$. Interestingly, for $m$ odd and $i=(m+1)/2$ we have $b_{m,i}=0$, so in this case the error term is of lower order. The methods used involve asymptotic formulas for the behavior of Lambert series and the Zeta function of Hurwitz. We also show that if $f(n,j)$ is the number of partitions of $n$ the sum of whose parts of even index is $j$, then for every $n$, $f(n,j)$ agrees with a certain universal sequence, Sloane's sequence \texttt{#A000712}, for $j\le n/3$ but not for any larger $j$. DA - 2004/// PY - 2004/// DO - 10.4064/aa115-3-1 VL - 115 IS - 3 SP - 205-216 SN - 0065-1036 ER - TY - JOUR TI - An error-correcting code framework for genetic sequence analysis AU - May, EE AU - Vouk, MA AU - Bitzer, DL AU - Rosnick, DI T2 - JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS AB - A fundamental challenge for engineering communication systems is the problem of transmitting information from the source to the receiver over a noisy channel. This same problem exists in a biological system. How can information required for the proper functioning of a cell, an organism, or a species be transmitted in an error introducing environment? Source codes (compression codes) and channel codes (error-correcting codes) address this problem in engineering communication systems. The ability to extend these information theory concepts to study information transmission in biological systems can contribute to the general understanding of biological communication mechanisms and extend the field of coding theory into the biological domain. In this work, we review and compare existing coding theoretic methods for modeling genetic systems. We introduce a new error-correcting code framework for understanding translation initiation, at the cellular level and present research results for Escherichia coli K-12. By studying translation initiation, we hope to gain insight into potential error-correcting aspects of genomic sequences and systems. DA - 2004/// PY - 2004/// DO - 10.1016/j.jfranklin.2003.12.009 VL - 341 IS - 1-2 SP - 89-109 SN - 1879-2693 KW - coding theory KW - translation initiation KW - information theory KW - biological coding theory KW - error correcting codes ER - TY - JOUR TI - A neural network model with bounded-weights for pattern classification AU - Liao, Yi AU - Fang, Shu-Cherng AU - L.W. Nuttle, Henry T2 - Computers & Operations Research AB - A new neural network model is proposed based on the concepts of multi-layer perceptrons, radial basis functions, and support vector machines (SVM). This neural network model is trained using the least squared error as the optimization criterion, with the magnitudes of the weights on the links being limited to a certain range. Like the SVM model, the weight specification problem is formulated as a convex quadratic programming problem. However, unlike the SVM model, it does not require that kernel functions satisfy Mercer's condition, and it can be readily extended to multi-class classification. Some experimental results are reported. Scopeandpurpose For the past decade, there has been increasing interest in solving nonlinear pattern classification problems. Among the various approaches, Multi-layer perceptrons, radial basis function networks and support vector machines have received most attention due to their tremendous success in real-world applications. Compared with the other two, The support vector machines approach is relatively new and often performs better in many applications. However, it also has some limitations, for example, kernel functions are required to satisfy Mercer's condition and it is not easily applicable for multi-class classification. In this paper, we propose a new neural network model which overcomes these limitations. DA - 2004/8// PY - 2004/8// DO - 10.1016/S0305-0548(03)00097-2 VL - 31 IS - 9 SP - 1411-1426 J2 - Computers & Operations Research LA - en OP - SN - 0305-0548 UR - http://dx.doi.org/10.1016/s0305-0548(03)00097-2 DB - Crossref KW - pattern classification KW - neural networks KW - multi-layer perceptrons KW - radial basis function networks KW - support vector machines ER - TY - JOUR TI - Reconstruction of magnetic charge densities using regularization of bounded variations under noisy observations AU - Kojima, F AU - Ito, K T2 - INTERNATIONAL JOURNAL OF APPLIED ELECTROMAGNETICS AND MECHANICS AB - This paper is concerned with computational and regularization techniques for recovering induced magnetic fields due to the existence of cracks. The problem is formulated as an inverse problem with a set of source functions of the distribution type. The regularization of bounded variatio n is effectively used for solving the severe ill-posed problem. A iterative solver is proposed by a integro-differential equation with time marching scheme. For the practical implementation of the numerical treatment, a finite difference scheme is adopted to the proposed method with the aid of discrete fast Fourier transform. Some successful numerical experiments are demonstrated for the validity of the proposed method. DA - 2004/// PY - 2004/// DO - 10.3233/jae-2004-582 VL - 19 IS - 1-4 SP - 309-313 SN - 1383-5416 KW - inverse problem KW - regularization KW - fast fourier transform ER - TY - JOUR TI - On the benefits of using functional transitions and Kronecker algebra AU - Benoit, A AU - Fernandes, P AU - Plateau, B AU - Stewart, WJ T2 - PERFORMANCE EVALUATION AB - Much attention has been paid recently to the use of Kronecker or tensor product modelling techniques for evaluating the performance of parallel and distributed systems. While this approach facilitates the description of such systems and mimimizes memory requirements, it has suffered in the past from the fact that computation times have been excessively long. In this paper we propose a suite of modelling strategems and numerical procedures that go a long way to alleviating this drawback. Of particular note are the benefits obtained by using functional transitions that are implemented via a generalized tensor algebra. Examples are presented which illustrate the reduction in computation time as each suggested improvement is deployed. DA - 2004/12// PY - 2004/12// DO - 10.1016/j.peva.2004.04.002 VL - 58 IS - 4 SP - 367-390 SN - 1872-745X KW - Markov chains KW - stochastic automata networks KW - generalized tensor algebra KW - vector-descriptor multiplication ER - TY - JOUR TI - Minimizing L-max for large-scale, job-shop scheduling problems AU - Schultz, , SR AU - Hodgson, TJ AU - King, RE AU - Thoney, KA T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH AB - The academic literature in 2000 presented a procedure for solving the job-shop-scheduling problem of minimizing L max. The iterative-adaptive simulation-based procedure is shown here to perform well on large-scale problems. However, there is potential for improvement in closing the gap between best-known solutions and the lower bound. In the present paper, a simulated annealing post-processing procedure is presented and evaluated on large-scale problems. A new neighbourhood structure for local searches in the job-shop scheduling problem is developed. The procedure is also evaluated using benchmark problems and new upper bounds are established. DA - 2004/12/1/ PY - 2004/12/1/ DO - 10.1080/00207540410001721754 VL - 42 IS - 23 SP - 4893-4907 SN - 1366-588X ER - TY - JOUR TI - Low temperature saturation of p-n junction laser beam induced current signals AU - Redfern, DA AU - Fang, W AU - Ito, K AU - Musca, CA AU - Dell, JM AU - Faraone, L T2 - SOLID-STATE ELECTRONICS AB - To date, most studies of the use of laser beam induced current (LBIC) for non-destructive characterisation of photodiodes have been qualitative and/or empirical, due in part to the difficulty of isolating the influence of the large number of material and device parameters on which the LBIC signal is dependent. The development of methodologies whereby these parameters can be determined quantitatively from the LBIC measurements is important for the technique to gain wider acceptance. This work describes, for the first time, the specific experimental conditions under which some of the variable parameters can be eliminated, substantially reducing the complexity of the analysis. In particular, temperature dependence of the peak-to-peak LBIC measurements on p–n junctions is examined for the first time, revealing that a saturation state is reached at low temperatures. When measurements are performed under these saturation conditions, the peak-to-peak LBIC signal becomes independent of doping density and bulk recombination parameters, allowing other parameters including device geometry to be examined with less ambiguity. This concept represents a crucial step towards a quantitative procedure for extraction of p–n junction material and device parameters using LBIC. DA - 2004/3// PY - 2004/3// DO - 10.1016/j.sse.2003.09.008 VL - 48 IS - 3 SP - 409-414 SN - 1879-2405 KW - laser beam induced current KW - LBIC KW - photodiode KW - non-destructive characterisation KW - temperature dependence ER - TY - JOUR TI - Existence-uniqueness and monotone approximation for an erythropoiesis age-structured model AU - Ackleh, AS AU - Deng, K AU - Cole, CE AU - Tran, HT T2 - JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS AB - We develop a monotone approximation to the solution of an age-structured model which describes the regulation of erythropoiesis, the process in which red blood cells are developed. The convergence of this approximation to the unique solution of the model is also established. DA - 2004/1/15/ PY - 2004/1/15/ DO - 10.1016/j.jmaa.2003.08.037 VL - 289 IS - 2 SP - 530-544 SN - 0022-247X KW - erythropoiesis KW - age-structured model KW - monotone approximation KW - existence uniqueness ER - TY - CHAP TI - Trustworthy service caching: Cooperative search in P2P information systems AU - Udupi, Y. B. AU - Yolum, P. AU - Singh, M. P. T2 - Agent-oriented information systems: 5th international bi-conference workshop, AOIS 2003, Melbourne, Australia, July 14, 2003 and Chicago, IL, USA, October 13, 2003 ; Revised selected papers A2 - P. Giorgini, B. Henderson-Sellers A2 - Winikoff, M. AB - We are developing an approach for P2P information systems, where the peers are modelled as autonomous agents. Agents provide services or give referrals to one another to help find trustworthy services. We consider the important case of information services that can be cached. Agents request information services through high-level queries, not by describing specific objects as in caching in traditional distributed systems. Moreover, the agents autonomously decide whom to contact for a service, whom to provide a service or referral, whether to follow a referral and whether to cache a service. Thus the information system itself evolves as agents learn about each other and the contents of the caches of the agents change. We study here the effect of caching on service location and on the information system itself. Our main results are that, (1) even with a small cache, agents can locate services more easily; (2) since the agents that cache services can act like service providers, a small number of initial service providers are enough to serve the information needs of the consumers; and (3) agents benefit from being neighbours with others who have similar interests. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-25943-5_3 VL - 3030 SP - 32-44 PB - Berlin; New York: Springer SN - 3540221271 ER - TY - CHAP TI - Traffic Grooming in WDM Ring Networks with the Min-Max Objective AU - Chen, Bensong AU - Rouskas, George N. AU - Dutta, Rudra T2 - Lecture Notes in Computer Science AB - We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the Min-Max objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_15 VL - 3042 SP - 174-185 OP - PB - Springer Berlin Heidelberg SN - 9783540219590 9783540246930 UR - http://dx.doi.org/10.1007/978-3-540-24693-0_15 DB - Crossref ER - TY - JOUR TI - Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks AU - Langville, AN AU - Stewart, WJ T2 - INFORMS JOURNAL ON COMPUTING AB - This paper is the experimental follow-up to Langville and Stewart (2002), where the theoretical background for the nearest Kronecker product (NKP) preconditioner was developed. Here we test the NKP preconditioner on both Markov chains (MCs) and stochastic automata networks (SANs). We conclude that the NKP preconditioner is not appropriate for general MCs, but is very effective for a MC stored as a SAN. DA - 2004/// PY - 2004/// DO - 10.1287/ijoc.1030.0041 VL - 16 IS - 3 SP - 300-315 SN - 1526-5528 KW - probability KW - Markov processes KW - queues KW - Markovian KW - algorithms ER - TY - JOUR TI - On-bark behavior of Dendroctonus frontalis: a Markov chain analysis AU - Bishir, J AU - Roberds, JH AU - Strom, BL T2 - JOURNAL OF INSECT BEHAVIOR DA - 2004/5// PY - 2004/5// DO - 10.1023/B:JOIR.0000031531.07035.10 VL - 17 IS - 3 SP - 281-301 SN - 0892-7553 KW - Scolytidae KW - southern pine beetle KW - host selection KW - host recognition KW - transition probabilities KW - absorbing states ER - TY - JOUR TI - Design of an electron gun using computer optimization AU - Lewis, BM AU - Tran, HT AU - Read, ME AU - Ives, RL T2 - IEEE TRANSACTIONS ON PLASMA SCIENCE AB - This paper considers an optimization technique in which the objective is attained via alterations to the physical geometry of the system. This optimization framework, to be considered in the context of electron guns, is known as optimal shape design. Optimal shape design has been used in a number of applications including wing design, magnetic tape design, and nozzle design, among others. In this investigation, we use the methods of shape optimization to design the cathode of an electron gun. The dynamical equations modeling the electron particle path as well as the generalized shape optimization problem will be presented. Illustrative examples of the technique on gun designs that were previously limited to spherical cathodes will be given. DA - 2004/6// PY - 2004/6// DO - 10.1109/TPS.2004.827572 VL - 32 IS - 3 SP - 1242-1250 SN - 1939-9375 KW - cathode shape optimization KW - electron gun KW - optimal shape design KW - optimization techniques ER - TY - CHAP TI - Access protocols to support different service classes in an optical burst switching ring AU - Puttasubbappa, V. S. AU - Perros, H. G. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - Several access protocols are proposed to support different service classes in an optical burst switched ring. Their performance is evaluated through simulation. Various performance metrics such as throughput, utilization, burst loss rate, end-to-end delay and fairness are used to analyze the behaviour of each protocol. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_72 VL - 3042 SP - 878-889 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - JOUR TI - A material allocation scheme for optical fibre cable manufacturing: a case study AU - Hodgson, TJ AU - Jackson, SD AU - Qu, P AU - Cannon, RE T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH AB - Optical fibre cable manufacturing is a multistep process that combines individual fibres into colour-coded buffer tubes. These tubes are grouped together to make cables in which individual fibres are protected from external loads and environmental factors. This assembly process has a tree structure in which components are progressively combined into a finished cable. The main component, optical fibre, is held in inventory on spools in varying lengths and in both pre-coloured and natural states. Orders are received for lengths of finished cable. Since the glass fibre is the highest cost component of the cable, the allocation of fibre inventory to orders should be accomplished so that fibre scrap is minimized. In this paper a heuristic procedure for minimizing glass fibre scrap is presented. Computational results are given. DA - 2004/8/15/ PY - 2004/8/15/ DO - 10.1080/00207540410001688400 VL - 42 IS - 16 SP - 3271-3279 SN - 0020-7543 ER - TY - CHAP TI - ORBIS: A reconfigurable hybrid optical metropolitan area network architecture AU - Xin, Y. F. AU - Baldine, I. AU - Cassada, M. AU - Stevenson, D. AU - Jackson, L. E. AU - Perros, H. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - In this paper, we propose a novel metropolitan area network (MAN) ring architecture, ORBIS, a multiple-service WDM platform that supports multiple transport techniques. The WDM ring is horizontally divided into multiple subnetworks, each of which supports one type of the traffic with a subset of the total wavelengths. The system and subnetwork control mechanism and reconfiguration issues are addressed in this paper. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_142 VL - 3042 SP - 1502-1507 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - CHAP TI - Experimental analysis of the SABUL congestion control algorithm AU - Oothongsap, P. AU - Viniotis, Y. AU - Vouk, M. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - Several new protocols such as RBUDP, User-Level UDP, Tsunami, and SABUL, have been proposed as alternatives to TCP for high-speed data transfer. The purpose of this paper is to analyze experimentally the effects of SABUL congeston control algorithm on SABUL and performance metrics such as bandwidth utilization, self-fairness, and aggressiveness. Our results confirm some expected behavior of SABUL and reveal some less expected one. Our experiments also indicate that SABUL implementation and design can result in an even more erratic behavior and degraded performance under high-congestion conditions. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_131 VL - 3042 SP - 1433-1439 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - JOUR TI - Case study on statistically estimating minimum makespan for flow line scheduling problems AU - Wilson, Amy D AU - King, Russell E AU - Wilson, James R T2 - European Journal of Operational Research AB - Lower bounds are typically used to evaluate the performance of heuristics for solving combinatorial minimization problems. In the absence of tight analytical lower bounds, optimal objective-function values may be estimated statistically. In this paper, extreme value theory is used to construct confidence-interval estimates of the minimum makespan achievable when scheduling nonsimilar groups of jobs on a two-stage flow line. Experimental results based on randomly sampled solutions to each of 180 randomly generated test problems revealed that (i) least-squares parameter estimators outperformed standard analytical estimators for the Weibull approximation to the distribution of the sample minimum makespan; (ii) to evaluate each Weibull fit reliably, both the Anderson–Darling and Kolmogorov–Smirnov goodness-of-fit tests should be used; and (iii) applying a local improvement procedure to a large sample of randomly generated initial solutions improved the probability that the resulting Weibull fit yielded a confidence interval covering the minimum makespan. DA - 2004/6// PY - 2004/6// DO - 10.1016/S0377-2217(02)00910-4 VL - 155 IS - 2 SP - 439-454 J2 - European Journal of Operational Research LA - en OP - SN - 0377-2217 UR - http://dx.doi.org/10.1016/S0377-2217(02)00910-4 DB - Crossref KW - heuristics KW - scheduling KW - confidence-interval estimation KW - flexible flow line ER - TY - JOUR TI - Call blocking probabilities in a traffic-groomed tandem optical network AU - Washington, AN AU - Perros, H T2 - COMPUTER NETWORKS AB - In this paper, we consider an optical network consisting of N nodes arranged in tandem. We assume traffic grooming, which permits multiple sub-rate traffic streams to be carried on the same wavelength. This optical network is modeled by a tandem queueing network of multi-rate Erlang loss nodes with simultaneous resource possession, with a view to calculating call blocking probabilities. The queueing network is analyzed by decomposition using a modified version of Courtois' algorithm. Numerical comparisons of the decomposition algorithm against simulation show that the algorithm has good accuracy. Also, it is shown that the proposed algorithm is an improvement over the well-known single-node decomposition algorithm based on the link-independence assumption. DA - 2004/6/21/ PY - 2004/6/21/ DO - 10.1016/j.comnet.2004.03.008 VL - 45 IS - 3 SP - 281-294 SN - 1872-7069 KW - call blocking probabilities KW - traffic grooming KW - optical networks KW - multi-rate Erlang loss network KW - decomposition algorithm ER - TY - JOUR TI - Anti-windup control design for exponentially unstable LTI systems with actuator saturation AU - Wu, F AU - Lu, B T2 - SYSTEMS & CONTROL LETTERS AB - In this paper, a new saturation control technique in the framework of anti-windup compensation is developed for exponentially unstable linear time-invariant systems subject to input nonlinearities. The proposed control algorithm guarantees regional stability in the existence of input saturation, and provides less conservative performance than most existing anti-windup schemes. Moreover, an explicit form of anti-windup controller with its order no more than the order of the plant is derived. An inverted pendulum example is used to demonstrate the advantages of the newly proposed anti-windup control technique. DA - 2004/7// PY - 2004/7// DO - 10.1016/j.sysconle.2004.02.007 VL - 52 IS - 3-4 SP - 305-322 SN - 1872-7956 KW - input saturation KW - sector-bounded nonlinearity KW - anti-windup compensation KW - linear matrix inequality ER - TY - JOUR TI - An immersed finite element space and its approximation capability AU - Li, Z. AU - Lin, T. AU - Lin, Y. AU - Rogers, R. C. T2 - Numerical Methods for Partial Differential Equations AB - Abstract This article discusses an immersed finite element (IFE) space introduced for solving a second‐order elliptic boundary value problem with discontinuous coefficients (interface problem). The IFE space is nonconforming and its partition can be independent of the interface. The error estimates for the interpolation of a function in the usual Sobolev space indicate that this IFE space has an approximation capability similar to that of the standard conforming linear finite element space based on body‐fit partitions. Numerical examples of the related finite element method based on this IFE space are provided. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 338–367, 2004 DA - 2004/// PY - 2004/// DO - 10.1002/num.10092 VL - 20 IS - 3 SP - 338-367 J2 - Numer. Methods Partial Differential Eq. LA - en OP - SN - 0749-159X 1098-2426 UR - http://dx.doi.org/10.1002/num.10092 DB - Crossref KW - interface problems KW - immersed interface KW - finite element KW - error estimates ER - TY - JOUR TI - A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities AU - Wardono, B AU - Fathi, Y T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH AB - We investigate the problem of scheduling N jobs on parallel machines in L successive stages with limited buffer capacities between stages. The primary objective is to find a schedule that would minimize the makespan. This problem is shown to be NP-hard in the strong sense. We develop a tabu search algorithm for this problem in which the search is limited to the space of permutation vectors of size N. This vector represents the order in which the given set of jobs are performed in the first stage, and we propose a procedure to construct a complete schedule associated with every permutation vector. We conduct an extensive computational experiment using randomly generated instances with different structures and different buffer capacities. We also solve several specific instances of the problem from the open literature. All empirical evidence suggest that the proposed algorithm is an effective method for solving this problem. DA - 2004/6/1/ PY - 2004/6/1/ DO - 10.1016/S0377-2217(02)00873-1 VL - 155 IS - 2 SP - 380-401 SN - 1872-6860 KW - flowshop scheduling KW - parallel machines KW - buffer constraints KW - minimizing makespan ER - TY - JOUR TI - Venn diagrams and symmetric chain decompositions in the Boolean lattice AU - Griggs, J. AU - Killian, C. E. AU - Savage, C. D. T2 - Electronic Journal of Combinatorics DA - 2004/// PY - 2004/// VL - 11 IS - 1 ER - TY - JOUR TI - Fuzzy formulation of auctions and optimal sequencing for multiple auctions AU - Fang, SC AU - Nuttle, HWL AU - Wang, DW T2 - FUZZY SETS AND SYSTEMS AB - Current research on auctions is mainly based on the game theory. In the first part of this paper, we propose a fuzzy set based formulation of auctions. We define fuzzy sets to represent the seller and buyers’ valuations, bid possibilities and win possibilities. Analyzing the properties of these fuzzy sets, we study fuzzy versions of discriminating and nondiscriminating bidding strategies for each bidder in a single-object auction by using Bellman and Zadeh's concept of confluence of fuzzy decisions instead of the game theoretic Nash equilibrium. The monotonically decreasing membership function replaces of the corresponding distribution density function in Milgrom and Weber's auction theory. In the second part of the paper, we develop a soft computing approach to maximize the seller's revenue in multiple-object auctions through the use of object sequencing. The proposed sequencing approach is based on “fuzzy rule quantification”. Numerical experience shows the potential of the proposed approach for application in practical auctions. DA - 2004/3/16/ PY - 2004/3/16/ DO - 10.1016/S0165-0114(03)00127-1 VL - 142 IS - 3 SP - 421-441 SN - 1872-6801 KW - auction KW - sequencing KW - fuzzy sets KW - electronic commerce ER - TY - JOUR TI - An entropic regularization approach for mathematical programs with equilibrium constraints AU - Birbil, SI AU - Fang, SC AU - Han, JY T2 - COMPUTERS & OPERATIONS RESEARCH AB - A new smoothing approach based on entropic regularization is proposed for solving a mathematical program with equilibrium constraints (MPEC). With some known smoothing properties of the entropy function and keeping real practice in mind, we reformulate an MPEC problem as a smooth nonlinear programming problem. In this way, a difficult MPEC problem becomes solvable by using available nonlinear optimization software. To support our claims, we use an online solver and test the performance of the proposed approach on a set of well-known test problems. DA - 2004/11// PY - 2004/11// DO - 10.1016/S0305-0548(03)00176-X VL - 31 IS - 13 SP - 2249-2262 SN - 1873-765X KW - mathematical programs with equilibrium constraints KW - smoothing approach KW - entropic regularization KW - online solvers ER - TY - JOUR TI - An analytic center cutting plane method for solving semi-infinite variational inequality problems AU - Fang, SC AU - Wu, SY AU - Sun, J T2 - JOURNAL OF GLOBAL OPTIMIZATION DA - 2004/2// PY - 2004/2// DO - 10.1023/B:JOGO.0000015308.49676.ea VL - 28 IS - 2 SP - 141-152 SN - 1573-2916 KW - analytic centers KW - cutting plane methods KW - variational inequalities ER - TY - JOUR TI - Performance analysis of buffered R-ALOHA systems using tagged user approach AU - Sheikh, AUH AU - Wan, T AU - Alakhdhar, SZ AU - Lambadaris, I AU - Devetsikiotis, M T2 - JOURNAL OF NETWORK AND COMPUTER APPLICATIONS AB - In this paper, R-ALOHA systems with propagation delay, finite buffer capacity and finite user population are analyzed using Tagged User Approach. The system throughput, message response time, message delay-time distribution and message blocking probability are obtained. It is assumed that each message consists of a random number of packets with a general distribution, and each user have a finite buffer capacity. To maintain the fairness to all users, it is assumed that each message in the buffer is transmitted independently that is, a user has to release the reserved slot after finishing the transmission of a message even if it has more messages waiting in the buffer. The analysis can be extended to R-ALOHA systems with infinite buffer capacity straightforwardly. The accuracy of the analysis is verified by simulations. DA - 2004/8// PY - 2004/8// DO - 10.1016/j.jnca.2003.11.002 VL - 27 IS - 3 SP - 131-150 SN - 1084-8045 ER - TY - BOOK TI - Auxiliary Signal Design for Failure Detection AU - Campbell, Stephen L. AU - Nikoukhah, Ramine CN - TA169.5 .C36 2004 DA - 2004/1// PY - 2004/1// DO - 10.1515/9781400880041 PB - Princeton University Press SN - 0691099871 ER - TY - JOUR TI - Unitary partitioning in general constraint preserving DAE integrators AU - Arevalo, C AU - Campbell, SL AU - Selva, M T2 - MATHEMATICAL AND COMPUTER MODELLING AB - A number of numerical algorithms have been developed for various special classes of DAEs. This paper describes a new variable step size, constraint preserving integrator for general nonlinear fully implicit higher index DAEs. Numerical implementation issues are discussed. Numerical examples illustrate the effectiveness of the new method. DA - 2004/12// PY - 2004/12// DO - 10.1016/j.mcm.2005.01.018 VL - 40 IS - 11-12 SP - 1273-1284 SN - 0895-7177 KW - differential algebraic equati ons KW - numerical integration KW - constraint preservation KW - singular system ER - TY - JOUR TI - The predictive user mobility profile framework for wireless multimedia networks AU - Akyildiz, IR AU - Wang, WY T2 - IEEE-ACM TRANSACTIONS ON NETWORKING AB - User mobility profile (UMP) is a combination of historic records and predictive patterns of mobile terminals, which serve as fundamental information for mobility management and enhancement of quality of service (QoS) in wireless multimedia networks. In this paper, a UMP framework is developed for estimating service patterns and tracking mobile users, including descriptions of location, mobility, and service requirements. For each mobile user, the service requirement is estimated using a mean-square error method. Moreover, a new mobility model is designed to characterize not only stochastic behaviors, but historical records and predictive future locations of mobile users as well. Therefore, our approach incorporates aggregate history and current system parameters to acquire UMP. In particular, an adaptive algorithm is designed to predict the future positions of mobile terminals in terms of location probabilities based on moving directions and residence time in a cell. Simulation results are shown to indicate that the proposed schemes are effective on mobility and resource management by evaluating blocking/dropping probabilities and location tracking costs in wireless networks. DA - 2004/12// PY - 2004/12// DO - 10.1109/tnet.2004.838604 VL - 12 IS - 6 SP - 1021-1035 SN - 1558-2566 KW - mobility and resource management KW - quality of service (QoS) KW - user mobility profile (UMP) KW - wireless network ER - TY - JOUR TI - Partitions and compositions defined by inequalities AU - Corteel, S AU - Savage, CD T2 - RAMANUJAN JOURNAL AB - We consider sequences of integers (λ1,..., λ k ) defined by a system of linear inequalities λ i ≥ ∑ j>iaijλ j with integer coefficients. We show that when the constraints are strong enough to guarantee that all λ i are nonnegative, the generating function for the integer solutions of weight n has a finite product form $$\prod_{i} (1-q^{b_i})^{-1}$$ , where the b i are positive integers that can be computed from the coefficients of the inequalities. The results are proved bijectively and are used to give several examples of interesting identities for integer partitions and compositions. The method can be adapted to accommodate equalities along with inequalities and can be used to obtain multivariate forms of the generating function. We show how to extend the technique to obtain the generating function when the coefficients ai,i+1 are allowed to be rational, generalizing the case of lecture hall partitions. Our initial results were conjectured thanks to the Omega package (G.E. Andrews, P. Paule, and A. Riese, European J. Comb. 22(7) (2001), 887–904). DA - 2004/9// PY - 2004/9// DO - 10.1007/s11139-004-0144-2 VL - 8 IS - 3 SP - 357-381 SN - 1572-9303 KW - integer partitions KW - integer compositions KW - enumeration ER - TY - JOUR TI - On the multiplicity of parts in a random composition of a large integer AU - Hitczenko, PL AU - Savage, CD T2 - SIAM JOURNAL ON DISCRETE MATHEMATICS AB - In this paper we study the following question posed by H. S. Wilf: what is, asymptotically as $n\rightarrow \infty$, the probability that a randomly chosen part size in a random composition of an integer n has multiplicity m? More specifically, given positive integers n and m, suppose that a composition $\lambda$ of n is selected uniformly at random and then, out of the set of part sizes in $\lambda$, a part size j is chosen uniformly at random. Let $\P(A_n^{(m)})$ be the probability that j has multiplicity m. We show that for fixed m, $\P(A_n^{(m)}$) goes to 0 at the rate $1/\ln n$. A more careful analysis uncovers an unexpected result: $(\ln n)\P(A_n^{(m)})$ does not have a limit but instead oscillates around the value $1/m$ as $n\to\infty$. This work is a counterpart of a recent paper of Corteel, Pittel, Savage, and Wilf, who studied the same problem in the case of partitions rather than compositions. DA - 2004/// PY - 2004/// DO - 10.1137/s0895480199363155 VL - 18 IS - 2 SP - 418-435 SN - 0895-4801 KW - compositions of an integer KW - random compositions KW - geometric random variables ER - TY - JOUR TI - On the convergence of a population-based global optimization algorithm AU - Birbil, SI AU - Fang, SC AU - Sheu, RL T2 - JOURNAL OF GLOBAL OPTIMIZATION DA - 2004/11// PY - 2004/11// DO - 10.1007/s10898-004-8270-3 VL - 30 IS - 2-3 SP - 301-318 SN - 0925-5001 KW - stochastic search method KW - population-based algorithm KW - convergence with probability one ER - TY - JOUR TI - Nonlinear reptation in molecular based hysteresis models for polymers AU - Banks, HT AU - Medhin, NG AU - Pinter, GA T2 - QUARTERLY OF APPLIED MATHEMATICS AB - We extend the linear “stick-slip” models of Doi-Edwards and Johnson-Stacer to nonlinear tube reptation models. We then show that such models, when combined with probabilistic formulations allowing distributions of relaxation times, provide a good description of dynamic experiments with highly filled rubber in tensile deformations. A connection to other applications including dielectric polarization and reptation in other viscoelastic materials (e.g., living tissue) is noted. DA - 2004/12// PY - 2004/12// DO - 10.1090/qam/2104273 VL - 62 IS - 4 SP - 767-779 SN - 1552-4485 KW - viscoelastic KW - hysteresis KW - polymers KW - molecular models KW - relaxation times KW - probability KW - distributions KW - uncertainty ER - TY - JOUR TI - IEPM: Focus on scheduling AU - Artiba, A. AU - Elmaghraby, S. E. T2 - European Journal of Operational Research DA - 2004/// PY - 2004/// VL - 161 IS - 1 SP - 02- ER - TY - JOUR TI - The utility business model and the future of computing services AU - Rappa, MA T2 - IBM SYSTEMS JOURNAL AB - The utility business model is shaped by a number of characteristics that are typical in public services: users consider the service a necessity, high reliability of service is critical, the ability to fully utilize capacity is limited, and services are scalable and benefit from economies of scale. This paper examines the utility business model and its future role in the provision of computing services. DA - 2004/// PY - 2004/// DO - 10.1147/sj.431.0032 VL - 43 IS - 1 SP - 32-42 SN - 0018-8670 ER - TY - JOUR TI - The deployment scheduling analysis tool (DSAT) AU - Hodgson, Thom AU - Melendez, B. AU - Trainor, T. T2 - Mathematical and Computer Modelling DA - 2004/// PY - 2004/// DO - 10.1016/j.mcm.2004.02.021 VL - 39 IS - 08-Jun SP - 905–924 ER - TY - JOUR TI - Solvability of variational inequality problems AU - Han, J AU - Huang, ZH AU - Fang, SC T2 - JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS DA - 2004/9// PY - 2004/9// DO - 10.1023/B:JOTA.0000042593.74934.b7 VL - 122 IS - 3 SP - 501-520 SN - 1573-2878 KW - variational inequalities KW - complementarity problems KW - exceptional family of elements KW - existence theorems ER - TY - JOUR TI - Portfolio optimization models on infinite-time horizon AU - Pang, T T2 - JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS DA - 2004/9// PY - 2004/9// DO - 10.1023/B:JOTA.0000042596.26927.2d VL - 122 IS - 3 SP - 573-597 SN - 1573-2878 KW - portfolio optimization KW - dynamic programming equations KW - subsolutions and supersolutions ER - TY - JOUR TI - Contiguity of the Whittle measure for a Gaussian time series AU - Choudhuri, N AU - Ghosal, S AU - Roy, A T2 - BIOMETRIKA AB - For a stationary time series, Whittle constructed a likelihood for the spectral density based on the approximate independence of the discrete Fourier transforms of the data at certain frequencies. Whittle's likelihood has been widely used in the literature for constructing estimators. In this paper, we show that, for a Gaussian time series, the Whittle measure is mutually contiguous with the actual distribution of the data. As a consequence, most asymptotic properties of estimators and test statistics derived under the Whittle measure can be carried over to the actual distribution. DA - 2004/3// PY - 2004/3// DO - 10.1093/biomet/91.1.211 VL - 91 IS - 1 SP - 211-218 SN - 1464-3510 KW - consistency KW - contiguity KW - discrete Fourier transform KW - periodogram KW - spectral density KW - whittle likelihood ER - TY - JOUR TI - Antipodal gray codes AU - Killian, CE AU - Savage, CD T2 - DISCRETE MATHEMATICS AB - An n-bit Gray code is a circular listing of the 2n n-bit strings so that successive strings differ only in one bit position. An n-bit antipodal Gray code has the additional property that the complement of any string appears exactly n steps away in the list. The problem of determining for which values of n antipodal Gray codes can exist was posed by Hunter Snevily, who showed them to be possible for n=1,2,3, and 4. In this paper, we show they are not possible for odd n>3 or for n=6. However, we provide a recursive construction to prove existence when n is a power of 2. The question remains open for any even n>6 which is not a power of 2. DA - 2004/4/28/ PY - 2004/4/28/ DO - 10.1016/j.disc.2003.07.012 VL - 281 IS - 1-3 SP - 221-236 SN - 0012-365X KW - gray code KW - Hamiltonian cycle KW - n-cube ER - TY - JOUR TI - An application of stochastic control theory to financial economics AU - Fleming, WH AU - Pang, T T2 - SIAM JOURNAL ON CONTROL AND OPTIMIZATION AB - We consider a portfolio optimization problem which is formulated as a stochastic control problem. Risky asset prices obey a logarithmic Brownian motion, and interest rates vary according to an ergodic Markov diffusion process. The goal is to choose optimal investment and consumption policies to maximize the infinite horizon expected discounted hyperbolic absolute risk aversion (HARA) utility of consumption. A dynamic programming principle is used to derive the dynamic programming equation (DPE). The subsolution--supersolution method is used to obtain existence of solutions of the DPE. The solutions are then used to derive the optimal investment and consumption policies. DA - 2004/// PY - 2004/// DO - 10.1137/S0363012902419060 VL - 43 IS - 2 SP - 502-531 SN - 1095-7138 KW - portfolio optimization KW - dynamic programming equations KW - subsolutions KW - supersolutions ER - TY - JOUR TI - Almost sure comparisons for first passage times of diffusion processes through boundaries AU - Sacerdote, L AU - Smith, CE T2 - METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY DA - 2004/9// PY - 2004/9// DO - 10.1023/B:MCAP.0000026563.27820.ff VL - 6 IS - 3 SP - 323-341 SN - 1573-7713 KW - diffusion process KW - first passage time KW - comparison theorem KW - Feller process KW - Ornstein-Uhlenbeck process ER - TY - JOUR TI - Algorithms for the model configuration problem AU - Morgan, SD AU - Fathi, Y AU - Taheri, J T2 - IIE TRANSACTIONS AB - The model configuration problem is a combinatorial optimization problem that arises in the context of switching cabinet manufacturing in the telecommunication industry. We discuss the manufacturing environment and define the q-model problem in this context, for q ≥ 1. We then discuss the structural properties of the q-model problem, and propose an efficient procedure for solving the 1-model problem. We also propose several heuristic procedures for solving the 2-model problem, and present an evaluation of these procedures through an extensive computational experiment. DA - 2004/2// PY - 2004/2// DO - 10.1080/07408170490245469 VL - 36 IS - 2 SP - 169-180 SN - 1545-8830 ER - TY - JOUR TI - A study of path protection in large-scale optical networks AU - Xin, YF AU - Rouskas, GN T2 - PHOTONIC NETWORK COMMUNICATIONS DA - 2004/5// PY - 2004/5// DO - 10.1023/B:PNET.0000026891.50610.48 VL - 7 IS - 3 SP - 267-278 SN - 1572-8188 KW - survivability KW - large-scale optical networks KW - topology design ER - TY - JOUR TI - A fast solver for the Ornstein-Zernike equations AU - Kelley, CT AU - Pettitt, BM T2 - JOURNAL OF COMPUTATIONAL PHYSICS AB - In this paper, we report on the design and analysis of a multilevel method for the solution of the Ornstein–Zernike Equations and related systems of integro-algebraic equations. Our approach is based on an extension of the Atkinson–Brakhage method, with Newton-GMRES used as the coarse mesh solver. We report on several numerical experiments to illustrate the effectiveness of the method. The problems chosen are related to simple short ranged fluids with continuous potentials. Speedups over traditional methods for a given accuracy are reported. The new multilevel method is roughly six times faster than Newton-GMRES and 40 times faster than Picard. DA - 2004/7/1/ PY - 2004/7/1/ DO - 10.1016/j.jcp.2003.12.006 VL - 197 IS - 2 SP - 491-501 SN - 1090-2716 ER - TY - CHAP TI - A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation AU - Li, Xiao Yu AU - Stallmann, Matthias F. AU - Brglez, Franc T2 - Theory and Applications of Satisfiability Testing AB - Advances in local-search SAT solvers have traditionally been presented in the context of local search solvers only. The most recent and rather comprehensive comparisons between UnitWalk and several versions of WalkSAT demonstrate that neither solver dominates on all benchmarks. QingTing2 (a ‘dragonfly’ in Mandarin) is a SAT solver script that relies on a novel switching strategy to invoke one of the two local search solvers: WalkSAT or QingTing1. The local search solver QingTing1 implements the UnitWalk algorithm with a new unit-propagation technique. The experimental methodology we use not only demonstrates the effectiveness of the switching strategy and the efficiency of the new unit-propagation implementation – it also supports, on the very same instances, statistically significant performance evaluation between local search and other state-of-the-art DPLL-based SAT solvers. The resulting comparisons show a surprising pattern of solver dominance, completely unanticipated when we began this work. CN - QA9.3 .S365 2003 PY - 2004/// DO - 10.1007/978-3-540-24605-3_5 VL - 2919 SP - 53-68 OP - PB - Springer Berlin Heidelberg SN - 9783540208518 9783540246053 UR - http://dx.doi.org/10.1007/978-3-540-24605-3_5 DB - Crossref ER - TY - JOUR TI - The primal-dual active set method for nonlinear optimal control problems with bilateral constraints AU - Ito, K AU - Kunisch, K T2 - SIAM JOURNAL ON CONTROL AND OPTIMIZATION AB - The primal-dual active set method has proved to be an efficient numerical tool in the context of diverse applications. So far it has been investigated mainly for linear problems. This paper is devoted to the study of global convergence of the primal-dual active set method for nonlinear problems with bilateral constraints. Utilizing the close relationship between the primal-dual active set method and semismooth Newton methods, local superlinear convergence of the method is investigated as well. DA - 2004/// PY - 2004/// DO - 10.1137/S0363012902411015 VL - 43 IS - 1 SP - 357-376 SN - 1095-7138 KW - primal-dual active set method KW - semismooth Newton method KW - optimal control KW - bilateral constraints ER - TY - JOUR TI - The Kronecker product and stochastic automata networks AU - Langville, AN AU - Stewart, WJ T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS AB - This paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Product paper (J. Comput. Appl. Math. 123 (2000) 85). We collect and catalog the most useful properties of the Kronecker product and present them in one place. We prove several new properties that we discovered in our search for a stochastic automata network preconditioner. We conclude by describing one application of the Kronecker product, omitted from Van Loan's list of applications, namely stochastic automata networks. DA - 2004/6/1/ PY - 2004/6/1/ DO - 10.1016/j.cam.2003.10.010 VL - 167 IS - 2 SP - 429-447 SN - 1879-1778 KW - stochastic automata networks KW - Kronecker products KW - Kronecker product properties KW - preconditioning ER - TY - JOUR TI - Key issues in global supply base management AU - Handfield, RB AU - Nichols, EL T2 - INDUSTRIAL MARKETING MANAGEMENT AB - Developing effective business relationships with suppliers is hard work, especially when suppliers are located in different parts of the globe. Doing business with a supplier in China entails a very different set of fundamental elements than with one in the United States or Europe. As such, managers cannot rely on information systems to conduct business with global suppliers, but in many cases must travel to the location and visit with the supplier face to face to build an effective business relationship. In this article, 11 key issues that buying organizations should consider in their efforts to manage a global supply base are presented. These issues focus on the need for the “human factor” in establishing positive supplier relationships and the development of a high-performing global supply base. DA - 2004/1// PY - 2004/1// DO - 10.1016/j.indmarman.2003.08.007 VL - 33 IS - 1 SP - 29-35 SN - 0019-8501 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0345490620&partnerID=MN8TOARS KW - global supply base KW - information systems KW - human factor ER - TY - JOUR TI - Heuristic methods for gang-rip saw arbor design AU - Fathi, Y AU - Aksakalli, V T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH AB - Abstract We consider the problem of design and scheduling of arbors for a computer assisted gang-rip saw system. Such systems are typically used within the furniture manufacturing industry for processing lumber. We discuss the computational complexity of the problem, and develop several heuristic procedures for solving it. These procedures are based on the principles of local improvement, simulated annealing, and genetic algorithms. The results of a computational experiment are also presented. DA - 2004/5/1/ PY - 2004/5/1/ DO - 10.1016/S0377-2217(02)00796-8 VL - 154 IS - 3 SP - 626-640 SN - 0377-2217 KW - lumber cutting KW - combinatorial optimization KW - computational complexity KW - heuristics ER -