TY - CHAP
TI - MTCP: Scalable TCP-like congestion control for reliable multicast
T2 - Ieee Infocom '99 - the Conference on Computer Communications, Vols 1-3, Proceedings
AB - We present MTCT, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important because of its wide applications in multimedia and collaborative computing, yet nontrivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner; but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree. Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay (RTD) concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link an the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp.
PY - 1999///
DO - 10.1109/INFCOM.1999.752144
SP - 1265-1273
PB -
SE -
ER -
TY - CHAP
TI - Dynamic reconfiguration policies for WDM networks
T2 - Ieee Infocom '99 - the Conference on Computer Communications, Vols 1-3, Proceedings
AB - We study the issues arising when considering the problem of reconfiguring broadcast optical networks in response to changes in the traffic patterns. Although the ability to dynamically optimize the network under changing traffic conditions has been recognized as one of the key features of multiwavelength optical networks, this is the first in-depth study of the tradeoffs involved in carrying out the reconfiguration process. We first identify the degree of load balancing and the number of retunings as two important, albeit conflicting, objectives in the design of reconfiguration policies. We then formulate the problem as a Markovian decision process and we develop a systematic and flexible framework in which to study reconfiguration policies. We apply results from Markov decision process theory to obtain optimal reconfiguration policies for networks of large size. The advantages of optimal policies over a class of threshold-bused policies are illustrated through numerical results.
PY - 1999///
DO - 10.1109/INFCOM.1999.749297
SP - 313-320
PB -
SE -
ER -
TY - CHAP
TI - Blocking in wavelength routing networks, part II: Mesh topologies
AU - Zhu, YH
AU - Rouskas, GN
AU - Perros, HG
AU - Key, P
AU - Smith, D
T2 - Teletraffic Engineering in a Competitive World
PY - 1999///
VL - 3
SP - 1321-1330
PB -
SE -
ER -
TY - CHAP
TI - Blocking in wavelength routing networks, part I: The single path case
T2 - Ieee Infocom '99 - the Conference on Computer Communications, Vols 1-3, Proceedings
PY - 1999///
SP - 321-328
PB -
SE -
ER -
TY - CHAP
TI - Production Engineering
AU - Uzsoy, R.
T2 - McGraw-Hill Encyclopedia of Science and Technology
PY - 1999///
PB - McGraw-Hill
ER -
TY - CONF
TI - A Fast Approximation Algorithm for Cycle Time Estimation in Wafer Fabrication Facilities
AU - Horiguchi, K.
AU - Uzsoy, R.
AU - Venkateswaran, S.
T2 - 8th Industrial Engineering Research Conference
C2 - 1999/5//
C3 - Proceedings of the 8th Industrial Engineering Research Conference
CY - Phoenix, AZ
DA - 1999/5//
PY - 1999/5//
ER -
TY - SOUND
TI - Current and Future Trends and Scheduling Semiconductor Manufacturing Systems
AU - Uzsoy, R.
DA - 1999/3//
PY - 1999/3//
ER -
TY - SOUND
TI - A Scheduling Architecture for Semiconductor Manufacturing
AU - Aytug, H.
AU - Uzsoy, R.
DA - 1999/11//
PY - 1999/11//
ER -
TY - JOUR
TI - Optimal disassembly configurations for single and multiple products
AU - Meacham, Anu
AU - Uzsoy, Reha
AU - Venkatadri, Uday
T2 - Journal of Manufacturing Systems
AB - This paper considers the problem of determining optimal disassembly configurations for single and multiple products, that is, which assemblies and subassemblies to disassemble and which to leave intact. The paper first examines the problem of determining revenue-maximizing disassembly configurations for a single product using the hierarchical product tree representation, and develops a linear time algorithm for its solution. This algorithm is then extended to the case where fixed costs may be associated with disassembly of some nodes in the product tree. Finally, the problem of meeting a specified demand for recovered components and subassemblies from an available inventory of recovered products, where disassembly capacity is limited and products may have common components, is formulated as an optimization problem. A column-generation algorithm for this problem is presented that is capable of solving reasonably sized problems in a few seconds of CPU time on average.
DA - 1999/1//
PY - 1999/1//
DO - 10.1016/s0278-6125(00)87634-7
VL - 18
IS - 5
SP - 311-322
J2 - Journal of Manufacturing Systems
LA - en
OP -
SN - 0278-6125
UR - http://dx.doi.org/10.1016/s0278-6125(00)87634-7
DB - Crossref
KW - disassembly planning
KW - column generation
KW - environmentally conscious manufacturing
ER -
TY - JOUR
TI - Predictable scheduling of a single machine with breakdowns and sensitive jobs
AU - O'Donovan, Ronan
AU - Uzsoy, Reha
AU - McKay, Kenneth N.
T2 - International Journal of Production Research
AB - Production schedules released to the shop floor have two important functions: allocating shop resources to different jobs to optimize some measure of shop performance and serving as a basis for planning external activities such as material procurement, preventive maintenance and delivery of orders to customers. Schedule modification may delay or render infeasible the execution of external activities planned on the basis of the predictive schedule. Thus it is of interest to develop predictive schedules that can absorb disruptions without affecting planned external activities while maintaining high shop performance. We present a predictable scheduling approach, that inserts additional idle time into the schedule to absorb the impacts of breakdowns. The effects of disruptions on planned support activities are measured by the deviations of job completion times in the realized schedule from those in the predictive schedule. We apply our approach to minimizing total tardiness on a single machine with stochastic machine failures. We then extend the procedure to consider the case where job processing times are affected by machine breakdowns, and provide specialized rescheduling heuristics. Extensive computational experiments show that this approach provides high predictability with minor sacrifices in shop performance.
DA - 1999/12//
PY - 1999/12//
DO - 10.1080/002075499189745
VL - 37
IS - 18
SP - 4217-4233
J2 - International Journal of Production Research
LA - en
OP -
SN - 0020-7543 1366-588X
UR - http://dx.doi.org/10.1080/002075499189745
DB - Crossref
ER -
TY - JOUR
TI - Media Streams Scheduling for Synchronization in Distributed Multimedia Systems
AU - Woo, Miae
AU - Uzsoy, Reha
AU - Ghafoor, Arif
T2 - Journal of Parallel and Distributed Computing
AB - In this paper, we consider the problem of multimedia synchronization based on scheduling the transmission of multimedia documents in a networked environment. Assuming channels with different bandwidth and delay characteristics are established between the multimedia server and the client, we formulate the scheduling problem to ensure interstream and intrastream synchronization as a parallel processor scheduling problem. Since the heterogeneous parallel processor scheduling problem is NP-hard, we propose two heuristic algorithms with time complexity ofO(n log n+nm), wherenis the number of data units to be scheduled andmthe number of channels available. We also develop an enumerative algorithm to obtain the exact solutions. Extensive computational simulations reveal that the heuristics consistently obtain near-optimal solutions. From the simulation results, we also identify special structures of multimedia documents along with characteristics of the available channels which affect the relative performance of the algorithms.
DA - 1999/3//
PY - 1999/3//
DO - 10.1006/jpdc.1998.1526
VL - 56
IS - 3
SP - 272-295
J2 - Journal of Parallel and Distributed Computing
LA - en
OP -
SN - 0743-7315
UR - http://dx.doi.org/10.1006/jpdc.1998.1526
DB - Crossref
KW - distributed multimedia systems
KW - multimedia documents
KW - synchronization
KW - heterogeneous channel systems
KW - transmission scheduling
KW - heuristic algorithms
ER -
TY - JOUR
TI - Predictable scheduling of a single machine subject to breakdowns
AU - Mehta, Sanjay V.
AU - Uzsoy, R.
T2 - International Journal of Computer Integrated Manufacturing
AB - The predictive production schedule has two important functions; allocating shop resources to the different jobs to optimize some measure of shop performance and serving as a basis for planning activities such as material procurement, preventive maintenance and delivery of orders to external or internal customers. This schedule is modified during execution on the occurrence of disruptions such as machine breakdowns. The schedule modification process may delay or render infeasible the execution of activities planned on the basis of the predictive schedule. Thus it is of interest to develop predictive schedules which can absorb disruptions without affecting planned activities while maintaining high shop performance. A predictable scheduling approach is presented, where the predictive schedule is built with such objectives. The effects of disruptions on planned activities are measured by the difference between planned and realized job completion times. The specific scheduling model considered is minimizing maximum lateness (L max) on a single machine with dynamic job arrivals and random machine breakdowns. It is shown that predictable scheduling provides high predictability with minor sacrifices in realized schedule performance.
DA - 1999/1//
PY - 1999/1//
DO - 10.1080/095119299130443
VL - 12
IS - 1
SP - 15–38
SN - 0951-192X 1362-3052
UR - http://dx.doi.org/10.1080/095119299130443
ER -
TY - JOUR
TI - Minimizing makespan on a single batch processing machine with dynamic job arrivals
AU - Lee, C.-Y.
AU - Uzsoy, R.
T2 - International Journal of Production Research
AB - We consider the problem of minimizing makespan Cmax on a single batch processing machine in the presence of dynamic job arrivals. The batch processing machine can process up to B jobs simultaneously. The processing time of a batch is given by the processing time of the longest job in the batch. We present polynomial and pseudopolynomial-time algorithms for several special cases, develop efficient heuristics for the general problem and evaluate their performance through extensive computational experiments. Our results indicate that several of the heuristics have an excellent average performance with a modest computational burden.
DA - 1999/1//
PY - 1999/1//
DO - 10.1080/002075499192020
VL - 37
IS - 1
SP - 219–236
SN - 0020-7543 1366-588X
UR - http://dx.doi.org/10.1080/002075499192020
ER -
TY - BOOK
TI - A review of: “The Planning and Scheduling of Production Systems” Edited by A. Arbita and S.E. Elmaghraby Chapman and Hall, 1997, 367 pages, ISBN 0-412-61020-5
AU - Uzsoy, R.
AU - Artiba, A.
AU - Elmaghraby, S.E.
DA - 1999///
PY - 1999///
DO - 10.1080/07408179908969819
VL - 31
SE - 190-193
ER -
TY - JOUR
TI - Numerical Study of Two Dimensional Electro-migration
AU - Gao, H
AU - Li, Zhilin
AU - Zhao, H
T2 - Journal of Computational Physics
DA - 1999///
PY - 1999///
VL - 152
SP - 281–304
ER -
TY - JOUR
TI - A numerical method for solving heat equations involving interfaces
AU - Li, Zhilin
AU - Shen, Yun-Qui
T2 - Electronic Journal of Differential Equations
DA - 1999///
PY - 1999///
VL - 3
SP - 100–108
ER -
TY - RPRT
TI - Industrial Mathematics Modeling Workshop for Graduate Students series
DA - 1999///
PY - 1999///
M3 - CRSC Technical Reports
ER -
TY - RPRT
TI - Exploiting order variation in mesh refinement for direct transcription methods
AU - Betts, John T.
AU - Huffman, William P.
AU - Biehn, Neil
AU - Campbell, Stephen L.
A3 - Boeing
DA - 1999///
PY - 1999///
M3 - Technical Report
PB - Boeing
ER -
TY - CONF
TI - Detection Signal Design for Failure Detection
AU - Nikoukhah, R.
AU - Campbell, S.L.
AU - Delebecque, F.
T2 - Iranian Conference on Electrical Engineering
C2 - 1999///
C3 - Proceedings of the Iranian Conference on Electrical Engineering
DA - 1999///
PY - 1999///
SP - 45–52
ER -
TY - JOUR
TI - Supply chain management: An empirical study of its impact on performance
AU - Tan, K.-C.
AU - Kannan, V.R.
AU - Handfield, R.B.
AU - Ghosh, S.
T2 - International Journal of Operations and Production Management
AB - Total quality management, supply base management, customer driven corporate policy, and other elements of supply chain management are frequently cited as strategic options to achieve competitive success in the 1990s. However, attempts by companies to implement these options have not been universally successful and have in many cases failed to yield the desired results. This study presents details of a survey carried out to determine whether particular quality management, supply base management, and customer relations practices can impact corporate performance. In addition it examines the impact analyzing the competitive environment has on performance. Regression models identify several factors that directly and positively impact corporate performance. These include the extent to which companies analyze the strategies of competitors and determine future customer requirements, and the commitment they have to evaluating performance throughout the supply chain.
DA - 1999///
PY - 1999///
DO - 10.1108/01443579910287064
VL - 19
IS - 10
SP - 1034-1052
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-3543059938&partnerID=MN8TOARS
KW - supply-chain management
KW - TQM
KW - customer service
ER -
TY - JOUR
TI - An empirical examination of quality tool deployment patterns and their impact on performance
AU - Handfield, R.
AU - Jayaram, J.
AU - Ghosh, S.
T2 - International Journal of Production Research
AB - Although research suggests that quality management initiatives often fail to meet managers' expectations, few studies consider that an inappropriate choice of quality tools may adversely affect the results. This paper analyses the pattern of quality tool deployment and its impact on performance using a sample of 313 North American and European firms. The analysis reveals that four primary types of quality tool applications occur: Human Resource (HR) tools, Design tools, Discipline tools and Measurement tools. Several significant relationships between these dimensions and quality performance were found, suggesting that successful tool deployment often depends on competitive conditions and internal strategies.
DA - 1999///
PY - 1999///
DO - 10.1080/002075499191328
VL - 37
IS - 6
SP - 1403-1426
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032667749&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Multiagent Systems for Workflow
AU - Singh, Munindar P.
AU - Huhns, Michael N.
T2 - International Journal of Intelligent Systems in Accounting, Finance & Management
DA - 1999/6//
PY - 1999/6//
VL - 8
IS - 2
SP - 105–117
ER -
TY - CHAP
TI - Formal Methods in DAI: Logic-Based Representation and Reasoning
AU - Singh, Munindar P.
AU - Rao, Anand S.
AU - Georgeff, Michael P.
T2 - Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
A2 - Weiss, Gerhard
PY - 1999///
SP - 331–376
PB - MIT Press
SN - 9780585108308
ER -
TY - CHAP
TI - Know-How
AU - Singh, Munindar P.
T2 - Foundations of Rational Agency
A2 - Wooldridge, Michael J.
A2 - Rao, Anand S.
T3 - Applied Logic Series
PY - 1999///
PB - Kluwer
SN - 9780792356011
SV - 14
ER -
TY - JOUR
TI - From the Editor-in-Chief: The End of the Supply Chain?
AU - Singh, Munindar P.
T2 - IEEE Internet Computing
DA - 1999/11//
PY - 1999/11//
DO - 10.1109/MIC.1999.10030
VL - 3
IS - 6
SP - 4–6
ER -
TY - CONF
TI - An Multiagent Referral System for Expertise Location
AU - Yu, Bin
AU - Venkatraman, Mahadevan
AU - Singh, Munindar P.
C2 - 1999/7//
C3 - Working Notes of the AAAI Workshop on Intelligent Information Systems
DA - 1999/7//
SP - 66–69
ER -
TY - CONF
TI - Applying Mixed-Initiative Interaction in User Interfaces for Communicators
AU - Singh, Mona
AU - Singh, Munindar P.
C2 - 1999/7//
C3 - Proceedings of the National Conference on Artificial Intelligence (AAAI) Workshop on Mixed-Initiative Intelligence
DA - 1999/7//
ER -
TY - CONF
TI - Multiagent Workflow Management
AU - Wan, Feng
AU - Rustogi, Sudhir K.
AU - Xing, Jie
AU - Singh, Munindar P.
C2 - 1999/8//
C3 - Proceedings of the IJCAI-99 Workshop on Intelligent Workflow and Process Management: The New Frontier for AI in Business
DA - 1999/8//
ER -
TY - CONF
TI - Communication as Agent Interaction: Toward a Public Semantics
AU - Singh, Munindar P.
C2 - 1999/5//
C3 - Preproceedings of the 3rd Workshop on the Semantics and Pragmatics of Dialogue (Amstelogue), Amsterdam
DA - 1999/5//
ER -
TY - JOUR
TI - Value-Oriented Electronic Commerce
AU - Singh, Munindar P.
T2 - IEEE Internet Computing
DA - 1999/5//
PY - 1999/5//
DO - 10.1109/MIC.1999.10017
VL - 3
IS - 3
SP - 6–7
ER -
TY - BOOK
TI - Intelligent Agents V: Agents Theories, Architectures, and Languages
T2 - Lecture Notes in Computer Science
A3 - Müller, Jörg P.
A3 - Rao, Anand S.
A3 - Singh, Munindar P.
DA - 1999///
PY - 1999///
DO - 10.1007/3-540-49057-4
M1 - 1555
PB - Springer
SN - 9783540657132 9783540490579
UR - http://dx.doi.org/10.1007/3-540-49057-4
ER -
TY - CHAP
TI - Conceptual Modeling for Multiagent Systems: Applying Interaction-Oriented Programming?
AU - Singh, Munindar P.
T2 - Conceptual Modeling
AB - Multiagent systems (MAS) are an important paradigm for building complex systems, especially cooperative information systems. Despite much interest in MAS construction, there has not been sufficient progress on the corresponding conceptual modeling representations and techniques. We believe that further extensions to conceptual modeling to include aspects of actions and organizations will be essential for MAS development. These goals are broader than conceptual modeling is traditionally understood, but are essential to deal with the interactive and dynamic aspects of modern applications. We describe an approach termed interaction-oriented programming, which incorporates functionality geared toward coordination, commitment management, and collaboration. This functionality is naturally thought of as providing a conceptual metamodel for describing MAS. We suggest some preliminary methodologies pertaining to the design of coordination and commitment requirements.
PY - 1999///
DO - 10.1007/3-540-48854-5_16
SP - 195-210
OP -
PB - Springer Berlin Heidelberg
SN - 9783540659266 9783540488545
UR - http://dx.doi.org/10.1007/3-540-48854-5_16
DB - Crossref
ER -
TY -
ER -
TY - CHAP
TI - Social Abstractions for Information Agents
AU - Singh, Munindar P.
AU - Huhns, Michael N.
T2 - Intelligent Information Agents
AB - Most of the modern applications of computing technology arise in large-scale, open, information-rich environments. Open environments are distinguished by fact of having a number of networked and interrelated, but heterogeneous, information resources. The applications include ubiquitous information access, electronic commerce, virtual enterprises, logistics, and sensor integration, to name but a few. These applications differ from conventional database applications not only in the nature and variety of information they involve, but also in including a significant component that is beyond the information system. An information system must inevitably perform its immediate duties: create, store, transform, use, and dispose of information. However, as the above applications suggest, there is a large world outside the realm of pure information where reside physical and economic objects and organizational processes that manipulate them.
PY - 1999///
DO - 10.1007/978-3-642-60018-0_3
SP - 37-52
OP -
PB - Springer Berlin Heidelberg
SN - 9783642642234 9783642600180
UR - http://dx.doi.org/10.1007/978-3-642-60018-0_3
DB - Crossref
ER -
TY - JOUR
TI - Evaluation of cylindricity using combinatorics
AU - Hodgson, T.J.
AU - Kay, M.G.
AU - Mittal, R.O.
AU - Tang, S.-Y.I.
T2 - IIE Transactions (Institute of Industrial Engineers)
AB - Several numerical methods have been developed for finding the minimum zone of a cylinder. This paper presents a combinatorial method termed the Minimum Shell for cylindricity evaluation. For a given set of measured data points, the method efficiently searches for the six points that determine the minimum zone of cylindricity. This method is self-contained, without the requirement of mathematical programming software support, and is equal to or superior to other methods of evaluating cylindricity in terms of accuracy, efficiency, and simplicity. Computational results are given.
DA - 1999///
PY - 1999///
DO - 10.1023/A:1007572617551
VL - 31
IS - 1
SP - 39-47
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032637123&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Information management for co-operative engineering
T2 - COOPERATIVE KNOWLEDGE PROCESSING FOR ENGINEERING DESIGN
DA - 1999///
PY - 1999///
UR - https://publons.com/publon/21294527/
ER -
TY - JOUR
TI - Verifying Compliance with Commitment Protocols: Enabling Open Web-Based Multiagent Systems
AU - Venkatraman, M.
AU - Singh, M.P.
T2 - Autonomous Agents and Multi-Agent Systems
DA - 1999///
PY - 1999///
VL - 2
IS - 3
SP - 217-236
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0041784059&partnerID=MN8TOARS
ER -
TY - CONF
TI - E-commerce over communicators: Challenges and solutions for user interfaces
AU - Singh, M.
AU - Jain, A.K.
AU - Singh, M.P.
C2 - 1999///
C3 - ACM International Conference Proceeding Series
DA - 1999///
DO - 10.1145/336992.337040
SP - 177-186
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0006600424&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Ontology for commitments in multiagent systems: toward a unification of normative concepts
AU - Singh, M.P.
T2 - Artificial Intelligence and Law
DA - 1999///
PY - 1999///
DO - 10.1023/A:1008319631231
VL - 7
IS - 1
SP - 97-113
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0032675444&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Degrees of separation
T2 - IEEE Internet Computing
AB - An all-graduate profession could bury the myth of nurses being doctors' handmaids. What are the arguments for and against?
DA - 1999///
PY - 1999///
DO - 10.7748/NS.12.29.14.S34
UR - https://publons.com/publon/21294530/
ER -
TY - JOUR
TI - Be patient and tolerate imprecision: How autonomous agents can coordinate effectively
T2 - IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2
DA - 1999///
PY - 1999///
UR - https://publons.com/publon/21294533/
ER -
TY - CONF
TI - Be patient and tolerate imprecision: How autonomous agents can coordinate effectively
AU - Rustogi, S.K.
AU - Singh, M.P.
C2 - 1999///
C3 - IJCAI International Joint Conference on Artificial Intelligence
DA - 1999///
VL - 1
SP - 512-517
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0005865187&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Agents for process coherence in virtual enterprises
T2 - Communications of the ACM
DA - 1999///
PY - 1999///
VL - 42
IS - 3
SP - 62-69
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0002572761&partnerID=MN8TOARS
ER -
TY - CONF
TI - Evaluating iterative improvement heuristics for bigraph crossing minimization
AU - Stallmann, Matthias
AU - Brglez, Franc
AU - Ghosh, Debabrata
T2 - IEEE
C2 - 1999///
C3 - ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349)
DA - 1999///
VL - 6
SP - 444-447
ER -
TY - JOUR
TI - The The lack of influence of the right-hand side on the accuracy of linear system solution
AU - Banoczi, J. M.
AU - Chiu, N. C.
AU - Cho, G. E.
AU - Ipsen, I. C. F.
T2 - SIAM Journal on Scientific Computing
AB - It is commonly believed that a fortunate right-hand side b can significantly reduce the sensitivity of a system of linear equations Ax=b. We show, both theoretically and experimentally, that this is not true when the system is solved (in floating point arithmetic) with Gaussian elimination or the QR factorization: the error bounds essentially do not depend on b, and the error itself seems to depend only weakly on b. Our error bounds are exact (rather than first-order); they are tight; and they are stronger than the bound of Chan and Foulser. We also present computable lower and upper bounds for the relative error. The lower bound gives rise to a stopping criterion for iterative methods that is better than the relative residual. This is because the relative residual can be much larger, and it may be impossible to reduce it to a desired tolerance.
DA - 1999///
PY - 1999///
DO - 10.1137/S106482759630526X
VL - 20
IS - 1
SP - 203–227
KW - linear system
KW - right-hand side
KW - condition number
KW - backward error
KW - stopping criterion
ER -
TY - RPRT
TI - IFFCO: Implicit Filtering for Constrained Optimization, Version 2
AU - Choi, T D
AU - Eslinger, O J
AU - Gilmore, P
AU - Patrick, A
AU - Kelley, C T
AU - Gablonsky, J M
A3 - North Carolina State University, Center for Research in Scientific Computation
DA - 1999/7//
PY - 1999/7//
M1 - CRSC-TR99-23
PB - North Carolina State University, Center for Research in Scientific Computation
SN - CRSC-TR99-23
ER -
TY - RPRT
TI - {Newton-Krylov-Schwarz} Methods for {R}ichards' Equation
AU - Jenkins, E W
AU - Berger, R C
AU - Hallberg, J P
AU - Howington, Stacy E
AU - Kelley, C T
AU - Schmidt, Joseph H
AU - Stagg, Alan
AU - Tocci, M D
A3 - North Carolina State University, Center for Research in Scientific Computation
DA - 1999/10//
PY - 1999/10//
M1 - CRSC-TR99-32
PB - North Carolina State University, Center for Research in Scientific Computation
SN - CRSC-TR99-32
ER -
TY - CONF
TI - A Model to Simulate the Interaction between Groundwater and Surface Water
AU - Howington, S E
AU - Berger, R C
AU - Hallberg, J P
AU - Peters, J F
AU - Stagg, A K
AU - Jenkins, E W
AU - Kelley, C T
T2 - North Carolina State University, Center for Research in Scientific Computation
C2 - 1999/8//
C3 - Proceedings of the High Performance Computing Users' Group Meeting
CY - Monterrey, CA
DA - 1999/8//
M1 - CRSC-TR99-27
ER -
TY - JOUR
TI - Global Smooth Solutions and Large Time Behavior of the One-Dimensional Navier–Stokes Equations
AU - Pang, Tao
T2 - Journal of Mathematical Analysis and Applications
AB - The system of balance laws of mass, momentum and energy for a viscous, heat-conductive, one-dimensional real gas (Navier-Stokes equations) is considered. The existence of globally defined smooth solution to an initial boundary value problem is established. Because of the boundary conditions' effect, vacuum will be developed as time tends to infinity.
DA - 1999/7//
PY - 1999/7//
DO - 10.1006/jmaa.1999.6287
VL - 235
IS - 2
SP - 395-417
J2 - Journal of Mathematical Analysis and Applications
LA - en
OP -
SN - 0022-247X
UR - http://dx.doi.org/10.1006/jmaa.1999.6287
DB - Crossref
ER -
TY - JOUR
TI - The two-machine stochastic flowshop problem with arbitrary processing time distributions
AU - ELMAGHRABY, SALAH E.
AU - THONEY, KRISTIN A.
T2 - IIE Transactions
AB - We treat the two-machine flowshop problem with the objective of minimizing the expected makespan when the jobs possess stochastic durations of arbitrary distributions. We make three contributions in this paper: (1) we propose an exact approach with exponential worst-case time complexity. We also propose approximations which are computationally modest in their requirements. Experimental results indicate that our procedure is within less than 1 % of the optimum; and (2) we provide a more elementary proof of the bounds on the project completion time based on the concepts of ‘control networks’; and (3) we extend the ‘reverse search’ procedure of Avis and Fukuda [1[ to the context of permutation schedules.
DA - 1999/5//
PY - 1999/5//
DO - 10.1080/07408179908969849
VL - 31
IS - 5
SP - 467-477
ER -
TY - RPRT
TI - North Carolina Wood Based Residue Inventory
AU - Deal, E.
AU - Roise, J.P.
A3 - Energy Division, N.C. Department of Commerce
DA - 1999///
PY - 1999///
M3 - Technical Report
PB - Energy Division, N.C. Department of Commerce
ER -
TY - JOUR
TI - Equations for Predicting Weight Loss of Stored Pulpwood in the Upper Southeastern States
AU - Roise, J.P.
AU - Whittow, P.
AU - Deal, E.
T2 - Forest Products Journal
DA - 1999///
PY - 1999///
VL - 49
IS - 1
SP - 77-81
ER -
TY - JOUR
TI - Formal specification of concurrent systems
T2 - Advances in Engineering Software
DA - 1999///
PY - 1999///
VL - 30
IS - 3
SP - 211-224
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0033098338&partnerID=MN8TOARS
ER -
TY - CONF
TI - A hybrid-GA approach for dry-kiln scheduling and inventory control
AU - Joines, J.A.
AU - Culbreth, C.T.
A2 - Tawara, N.
A2 - Hwang, H.
A2 - Xu, W.
A2 - Gen, M.
C2 - 1999/10//
C3 - Proceedings of the Second Asia-Pacific Conference on Industrial Engineering and Management Systems
DA - 1999/10//
SP - 193–196
ER -
TY - CONF
TI - A demand-based hybrid-GA approach for manufacturing cell design
AU - Joines, J.A.
AU - Culbreth, C.T.
AU - King, R.E.
A2 - Tawara, N.
A2 - Hwang, H.
A2 - Xu, W.
A2 - Gen, M.
C2 - 1999/10//
C3 - Proceedings of the Second Asia-Pacific Conference on Industrial Engineering and Management Systems
DA - 1999/10//
SP - 193–196
ER -
TY - CONF
TI - Modeling of U.S. men's apparel consumption trends and its implication on cotton consumption
AU - Suh, M.
AU - Lee, E.K.
C2 - 1999///
C3 - Beltwide Cotton Conferences. Proceedings
DA - 1999///
ER -
TY - CONF
TI - Development of optimal HVI quality index for prediction of yarn tensile strength
AU - Suh, M.
AU - Koo, H.J.
AU - Watson, M.D.
C2 - 1999///
C3 - Beltwide Cotton Conferences. Proceedings
DA - 1999///
ER -
TY - JOUR
TI - Tensile behaviors of slack fiber bundles - theory and application to HVI testing
AU - Sasser, P.E.
AU - Suh, M.
T2 - Textile Research Journal
DA - 1999///
PY - 1999///
VL - 69
SP - 497-502
ER -
TY - JOUR
TI - On numbers of clones needed for managing risks in clonal forestry
AU - Bishir, J.
AU - Roberds, J. H.
T2 - Forest Genetics
DA - 1999///
PY - 1999///
VL - 6
IS - 3
SP - 149
ER -
TY - JOUR
TI - Asymptotic normality of posterior distributions in high-dimensional linear models
AU - Ghosal, S
T2 - BERNOULLI
AB - We study consistency and asymptotic normality of posterior distributions of the regression coefficient in a linear model when the dimension of the parameter grows with increasing sample size. Under certain growth restrictions on the dimension (depending on the design matrix), we show that the posterior distributions concentrate in neighbourhoods of the true parameter and can be approximated by an appropriate normal distribution.
DA - 1999/4//
PY - 1999/4//
DO - 10.2307/3318438
VL - 5
IS - 2
SP - 315-331
SN - 1350-7265
KW - high dimension
KW - linear model
KW - normal approximation
KW - posterior consistency
KW - posterior distribution
ER -
TY - JOUR
TI - Crack jump conditions for elliptic problems
AU - Wiegmann, A
AU - Li, Z
AU - LeVeque, RJ
T2 - APPLIED MATHEMATICS LETTERS
AB - We derive jump conditions for a potential function and its derivatives across a crack. A crack is a “thin” region of very different conductivity, for example a fracture in otherwise homogeneous material. Such a sharp change of material properties introduces a discontinuity in the coefficient of the elliptic equation governing the potential. The crack cannot be neglected, because it substantially alters the behavior of the potential. Numerically, it is very difficult to resolve the potential near the crack. A strategy is to treat the crack as a lower dimensional interface (hypersurface). Jump conditions across the crack for the potential and its derivatives are necessary for the development of numerical schemes for this approach. Besides the jump conditions, we also give an analytic example of their validity.
DA - 1999/8//
PY - 1999/8//
DO - 10.1016/S0893-9659(99)00083-X
VL - 12
IS - 6
SP - 81-88
SN - 0893-9659
KW - jump conditions
KW - transmission problem
KW - elliptic crack problems
ER -
TY - BOOK
TI - Introduction to supply chain management
AU - Handfield, R. B.
AU - Nichols, E. L.
CN - HD38.5 .H36 1999
DA - 1999///
PY - 1999///
PB - Upper Saddle River, NJ: Prentice Hall
SN - 0136216161
ER -
TY - CONF
TI - Mesh refinement that exploits order variation
AU - Betts, J. T.
AU - Huffman, W. P.
AU - Biehn, N.
AU - Campbell, S.L.
C2 - 1999///
C3 - Proceedings of the Workshop: Optimalsteuerungsprobleme in der Luft- und Raumfahrt, Universitat Greifswald, 7/8 Oktober 1999 (Sonderforschungsbereich; 255)
DA - 1999///
SP - 1-12
PB - Munchen: Hieronymus
ER -
TY - CONF
TI - Quick response replenishment: A case study
AU - King, Russell
AU - Moon, K.
AB - We document a case study based upon an ongoing analysis for a U.S. fiber/fabric manufacturer who is expanding its operations vertically to include cut and sew operations in Mexico. We refer to this vertically integrated manufacturer as VIM. While some of the data have been changed to protect the sources, the story and results themselves are unchanged. More detail on this case can be found in Moon (1999).
C2 - 1999///
C3 - 1999 Winter Simulation Conference: proceedings: Pointe Hilton Squaw Peak Resort, Phoenix, AZ, U.S.A., 5-8 December 1999
CN - QA76.9.C65 W56 1998
DA - 1999///
DO - 10.1109/wsc.1999.816863
VL - 2
SP - 1341–1349
PB - Piscataway, New Jersey: IEEE; New York, NY: Association for Computing Machinery ; San Diego, California: Society for Computer Simulation International
ER -
TY - CONF
TI - Global strategies for improving yarn and fabric qualities in the 21st century
AU - Suh, M. W.
C2 - 1999///
C3 - 79th World Conference of the Textile Institute
CN - HD9850.5 .T38 1999
DA - 1999///
VL - 2
SP - 179-185
ER -
TY - CONF
TI - Use of HVI breaking elongation for maximization of yarn and fabric strengths
AU - Suh, M. W.
AU - Watson, M. D.
C2 - 1999///
C3 - Proceedings of International Committee on Cotton Testing Methods, Bremen, Germany, March, 1999
DA - 1999///
SP - 215-216
M1 - 1999 March
ER -
TY - JOUR
TI - Estimation of the effective permeability in magnetorheological fluids
AU - Simon, TM
AU - Ito, K
AU - Banks, HT
AU - Reitich, F
AU - Jolly, MR
T2 - JOURNAL OF INTELLIGENT MATERIAL SYSTEMS AND STRUCTURES
AB - Magnetorheological (MR) fluids constitute examples of controllable ("smart") fluids, whose Theological properties vary in response to an applied magnetic field. These fluids typically consist of micron-sized, magnetizable particles dispersed in a nonpermeable carrier fluid. The essential characteristic of MR fluids is that they may be continuously and reversibly varied from a state of free flowing liquids in the absence of an applied magnetic field to that of stiff semi-solids in a moderate field. Understanding the magnetic properties of MR fluids is crucial to the design of MR fluid-based devices and it also provides valuable insight into the character of the microstructure responsible for their field-dependent rheology. Prediction of the overall magnetic properties of MR composites is a challenging task, however, due to the highly nonlinear and strongly spatially variable nature of the magnetization of the constituents. In this paper we propose a model for this behavior that is based on the mathematical theory of homogenization. We derive effective equations that govern the magnetic response of (periodically arranged) particle-chains through magnetic saturation. Comparisons of numerical results for these equations with experimental data show good agreement which suggests that our approach could be useful in the design of improved MR fluids.
DA - 1999/11//
PY - 1999/11//
DO - 10.1106/6KW6-7V12-NRQ3-BW6V
VL - 10
IS - 11
SP - 872-879
SN - 1045-389X
ER -
TY - CHAP
TI - Nonlinear descriptor systems
AU - Campbell, Stephen
AU - Nikoukhah, R.
AU - DeLebecque, F.
T2 - Advances in control: Highlights of ECC '99
CN - TJ212.2 .E97 1999
PY - 1999///
DO - 10.1007/978-1-4471-0853-5_9
SP - 247–282
PB - London; New York: Springer-Verlag
ER -
TY - JOUR
TI - Modeling of U.S. men's apparel consumption trends and its implication on textil mill cotton consumption
AU - Suh, M. W.
AU - Lee, E.-K.
T2 - Beltwide Cotton Conferences. Proceedings
DA - 1999///
PY - 1999///
VL - 2
IS - 1999
SP - 339-343
ER -
TY - CHAP
TI - Heuristics and experimental design for bigraph crossing number minimization
AU - Stallmann, Matthias
AU - Brglez, F.
AU - Ghosh, D.
T2 - Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999.
CN - QA76.9.A43 A42 1999
PY - 1999///
DO - 10.1007/3-540-48518-x_5
VL - 1619
SP - 74–93
PB - Berlin; New York: Springer
SN - 3540662278
ER -
TY - JOUR
TI - Development of optimal HVI strength index for prediction of yarn tensile strength
AU - Suh, M. W.
AU - Koo, H.-J.
AU - Watson, M. D.
T2 - Beltwide Cotton Conferences. Proceedings
DA - 1999///
PY - 1999///
VL - 1
IS - 1999
SP - 706-708
ER -
TY - JOUR
TI - A trust region method for parabolic boundary control problems
AU - Kelley, CT
AU - Sachs, EW
T2 - SIAM JOURNAL ON OPTIMIZATION
AB - In this paper we develop a trust region algorithm for constrained parabolic boundary control problems. For the computation of a trust region step we propose an iterative scheme which is a projected form of the Steihaug trust region conjugate gradient method. To ensure the good local convergence properties in the terminal phase, a smoothing step at each iteration is added. This step and the projection require the modification of the standard trust region algorithm and its convergence proof. The algorithm has sup-norm convergence in the terminal phase and L2 convergence in the global phase. The results are illustrated for a parabolic boundary control problem.
DA - 1999///
PY - 1999///
DO - 10.1137/S1052623496308965
VL - 9
IS - 4
SP - 1064-1081
SN - 1052-6234
KW - trust region methods
KW - inexact Newton methods
KW - optimal control
ER -
TY - JOUR
TI - A high-order perturbation approach to profile reconstruction: I. Perfectly conducting gratings
AU - Ito, K
AU - Reitich, F
T2 - INVERSE PROBLEMS
AB - A new method for the reconstruction of two-dimensional periodic structures from scattered far-field data is presented. The approach is based on the recently developed `methods of variation of boundaries' (MVB) for the solution of forward-scattering problems. Here, the inverse problem is formulated as that of minimization of an appropriate nonlinear least-squares cost functional J. The analytic continuation ideas inherent to MVB are then advanced to enable a global line search at each step of a proposed conjugate gradients algorithm. Through a number of numerical examples it is demonstrated that such globalization may be necessary to overcome the non-convexity of J which, in turn, is shown to persist even when the global minimizer is known to be unique.
DA - 1999/8//
PY - 1999/8//
DO - 10.1088/0266-5611/15/4/315
VL - 15
IS - 4
SP - 1067-1085
SN - 0266-5611
ER -
TY - JOUR
TI - The two-machine stochastic flowshop problem with arbitrary processing time distributions
AU - Elmaghraby, S. E.
AU - Thoney, K. A.
T2 - IIE Transactions
AB - We treat the two-machine flowshop problem with the objective of minimizing the expected makespan when the jobs possess stochastic durations of arbitrary distributions. We make three contributions in this paper: (1) we propose an exact approach with exponential worst-case time complexity. We also propose approximations which are computationally modest in their requirements. Experimental results indicate that our procedure is within less than 1% of the optimum; and (2) we provide a more elementary proof of the bounds on the project completion time based on the concepts of 'control networks'; and (3) we extend the 'reverse search' procedure of Avis and Fukuda [1] to the context of permutation schedules.
DA - 1999///
PY - 1999///
DO - 10.1023/A:1007697625481
VL - 31
IS - 5
SP - 467–477
ER -
TY - JOUR
TI - Simulations of particle dynamics in magnetorheological fluids
AU - Ly, HV
AU - Reitich, E
AU - Jolly, MR
AU - Banks, HT
AU - Ito, K
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - We present particle dynamics simulations for the response of magnetorheological (MR) fluids upon application of a magnetic field. The particles motion is considered to be governed by magnetic, hydrodynamic, and repulsive interactions. Fluid-particle interactions are accounted for via Stokes' drag while inter-particle repulsions are modeled through approximate hard-sphere rejections. In accordance with their greater significance, on the other hand (linear) magnetic interactions are fully simulated. The time evolution is considered to be magnetically quasi-static and magnetostatic forces are derived from the solution of (steady) Maxwell's equations, recomputed at each instant in time. For this we use a potential theoretic formulation where the boundary integral equations are solved with a fast multipole approach. We show that the resulting numerical codes can be effectively used to study a number of experimental observables such as effective magnetic permeabilities and response time-scales which are of crucial importance in the design of MR fluids.
DA - 1999/10/10/
PY - 1999/10/10/
DO - 10.1006/jcph.1999.6335
VL - 155
IS - 1
SP - 160-177
SN - 1090-2716
KW - particle dynamics
KW - fast multipole method
KW - MR fluids
KW - effective permeability
KW - response time scale
ER -
TY - JOUR
TI - Real-time optical control of Ga1-xInxP film growth by p-polarized reflectance
AU - Dietz, N
AU - Woods, V
AU - Ito, K
AU - Lauko, I
T2 - JOURNAL OF VACUUM SCIENCE & TECHNOLOGY A
AB - The engineering of advanced optoelectronic integrated circuits implies the stringent control of thickness and composition. These demands led to the development of surface-sensitive real-time optical sensors that are able to move the control point close to the point where the growth occurs, which in a chemical beam epitaxy process is the surface reaction layer, built up of physisorbed and chemisorbed precursor fragments between the ambient and film interface. In this context, we explored the application of p-polarized reflectance spectroscopy (PRS) for real-time monitoring and control of pulsed chemical beam epitaxy during low-temperature growth of epitaxial Ga1−xInxP heterostructures on Si(001) substrates. A reduced order surface kinetics model has been developed to describe the decomposition and growth kinetics of the involved organometallic precursors and their incorporation in the film deposition. We demonstrate the linkage of the PRS response towards the surface reaction chemistry, composition, film growth rate, and film properties. Mathematical control algorithms are applied that link the PR signals to the growth process control parameters to control the composition and growth rate of epitaxial Ga1−xInxP heterostructures.
DA - 1999///
PY - 1999///
DO - 10.1116/1.581811
VL - 17
IS - 4
SP - 1300-1306
SN - 1520-8559
ER -
TY - JOUR
TI - Kalman filtering for general discrete-time linear systems
AU - Nikoukhah, R
AU - Campbell, SL
AU - Delebecque, F
T2 - IEEE TRANSACTIONS ON AUTOMATIC CONTROL
AB - Recursive state estimation problems for explicit and implicit time-invariant linear systems, both for systems with and without unknown inputs, can be formulated as a single problem usually referred to as descriptor Kalman filtering. Solutions to this problem have been proposed in the literature; however, these solutions either neglect possible contributions of future dynamics to the current estimate or make unnecessary assumptions on the structure of the system. In this paper, the authors propose a solution to this problem which leads to a constructive method lifting these unnecessary assumptions. This method uses a generalization of the shuffle algorithm.
DA - 1999/10//
PY - 1999/10//
DO - 10.1109/9.793722
VL - 44
IS - 10
SP - 1829-1839
SN - 0018-9286
KW - descriptor systems
KW - Kalman filtering
KW - linear systems
KW - singular systems
KW - stochastic systems
ER -
TY - CONF
TI - Fuzzy rule quantification and its application in fuzzy due-date bargaining
AU - Fang, S.-C.
AU - Wang, D.-W.
AU - Nuttle, H.
C2 - 1999///
C3 - Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999
DA - 1999///
M1 - 1999 Aug.
PB - Piscataway, N.J.: IEEE
ER -
TY - JOUR
TI - Estimating the genetic architecture of quantitative traits
AU - Zeng, ZB
AU - Kao, CH
AU - Basten, CJ
T2 - GENETICAL RESEARCH
AB - Understanding and estimating the structure and parameters associated with the genetic architecture of quantitative traits is a major research focus in quantitative genetics. With the availability of a well-saturated genetic map of molecular markers, it is possible to identify a major part of the structure of the genetic architecture of quantitative traits and to estimate the associated parameters. Multiple interval mapping, which was recently proposed for simultaneously mapping multiple quantitative trait loci (QTL), is well suited to the identification and estimation of the genetic architecture parameters, including the number, genomic positions, effects and interactions of significant QTL and their contribution to the genetic variance. With multiple traits and multiple environments involved in a QTL mapping experiment, pleiotropic effects and QTL by environment interactions can also be estimated. We review the method and discuss issues associated with multiple interval mapping, such as likelihood analysis, model selection, stopping rules and parameter estimation. The potential power and advantages of the method for mapping multiple QTL and estimating the genetic architecture are discussed. We also point out potential problems and difficulties in resolving the details of the genetic architecture as well as other areas that require further investigation. One application of the analysis is to improve genome-wide marker-assisted selection, particularly when the information about epistasis is used for selection with mating.
DA - 1999/12//
PY - 1999/12//
DO - 10.1017/S0016672399004255
VL - 74
IS - 3
SP - 279-289
SN - 0016-6723
ER -
TY - JOUR
TI - Dry kiln scheduling in furniture production
AU - Yaghubian, A. R.
AU - Hodgson, T. J.
AU - Joines, J. A.
AU - Culbreth, C. T.
AU - Huang, J. C.
T2 - IIE Transactions
AB - In this paper, a dry kiln scheduling problem from the furniture manufacturing industry is considered. Factory-specified due dates for orders, kiln availability, kiln capacity, and travel time from the kilns to the factories are all incorporated in a model which is formulated as an integer linear program. The objective of the formulation is to minimize the maximum tardiness of orders arriving at the plants by solving a special case of scheduling n independent jobs on m non-identical parallel ciachines. Because of the computational complexity, and the fact that standard integer programming packages appear to perform very poorly on the problem, a heuristic approach is developed. Computational experience is provided which indicates that the heuristic gives very high quality solutions to problems in near real-time.
DA - 1999///
PY - 1999///
DO - 10.1080/07408179908969872
VL - 31
IS - 8
SP - 733–738
ER -
TY - JOUR
TI - Domain wall theory for ferroelectric hysteresis
AU - Smith, RC
AU - Hom, CL
T2 - JOURNAL OF INTELLIGENT MATERIAL SYSTEMS AND STRUCTURES
AB - This paper addresses the modeling of hysteresis in ferroelectric materials through consideration of domain wall bending and translation. The development is considered in two steps. First, dielectric constitutive relations are obtained through consideration of Langevin, Ising spin and preferred orientation theories with domain interactions incorporated through mean field relations. This yields a model for the anhysteretic polarization that occurs in the absence of domain wall pinning. Second, hysteresis is incorporated through the consideration of domain wall dynamics and the quantification of energy losses due to inherent inclusions or pinning sites within the material. This yields a model analogous to that developed by Jiles and Atherton for ferromagnetic materials. The viability of the model is illustrated through comparison with experimental data from a PMN-PT-BT actuator operating at a temperature within the ferroelectric regime.
DA - 1999/3//
PY - 1999/3//
DO - 10.1106/LJBM-RW18-MXW1-QXD0
VL - 10
IS - 3
SP - 195-213
SN - 1530-8138
ER -
TY - CONF
TI - Curved search based neural network learning using fuzzy control
AU - Fang, S.-C.
AU - Wu, P.-T.
AU - Nuttle, H.
C2 - 1999///
C3 - Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999
DA - 1999///
M1 - 1999 Aug.
PB - Piscataway, N.J.: IEEE
ER -
TY - CONF
TI - An easily implemented approach to fuzzy systems identification
AU - Fang, S.-C.
AU - Hung, T.-W.
AU - Nuttle, H.
A2 - R. N. Dave, T. Sudkamp
C2 - 1999///
C3 - 18th International Conference of the North American Fuzzy Information Processing Society--NAFIPS: June 10-12, 1999, New York, N.Y., U.S.A.
CN - TJ212.2 .N68 1999
DA - 1999///
PB - New York, N.Y.; Piscataway, N.J.: IEEE
ER -
TY - JOUR
TI - An analysis of polygenes affecting wing shape on chromosome 3 in Drosophila melanogaster
AU - Weber, K.
AU - Eisman, R.
AU - Morey, L.
AU - Patty, A.
AU - Sparks, J.
AU - Tausek, M.
AU - Zeng, Z. B.
T2 - Genetics
DA - 1999///
PY - 1999///
VL - 153
IS - 2
SP - 773-786
ER -
TY - CONF
TI - A fuzzy expert system for a wave soldering process
AU - Fang, S.-C.
AU - Chen, S.-H.
AU - Wu, P.-T.
AU - Huang, M.
AU - Nuttle, H.
C2 - 1999///
C3 - Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999
DA - 1999///
M1 - 1999 Aug.
PB - Piscataway, N.J.: IEEE
ER -
TY - CONF
TI - A clustering-based approach to fuzzy systems identification
AU - Fang, S.-C.
AU - Hung, T.-W.
AU - Nuttle, H.
C2 - 1999///
C3 - Proceedings of the 8th International Fuzzy Systems Association World Congress, August 1999
DA - 1999///
M1 - 1999 Aug.
PB - Piscataway, N.J.: IEEE
ER -
TY - JOUR
TI - Performance modeling of a finite capacity polling system with ATM bursty and correlated input traffic
AU - Jou, Y. F.
AU - Nilsson, A. A.
AU - Lai, F. Y.
T2 - Journal of High Speed Networks
DA - 1999///
PY - 1999///
VL - 8
IS - 4
SP - 281-301
ER -
TY - JOUR
TI - An optimal assembly mode of multi-type printed circuit boards
AU - Ohno, K
AU - Jin, ZH
AU - Elmaghraby, SE
T2 - COMPUTERS & INDUSTRIAL ENGINEERING
AB - Abstract We deal with the problem of assembling several types of PCBs on a machine with multiple pick-insertion heads. We partition the PCB types into subsets, which constitute the modes of operation. The subsets are selected so that the components required for assembly on the PCBs in a subset fit within the limited capacity of the reel carrier. Each PCB type in the subset is assembled successivley lot-by-lot without setup between the lots. Setup is needed only in the changeover between subsets. An optimal assembly mode minimizes the sum of assembly times and setup times of all PCB types demanded. Our approach is to divide the overall problem into three sub-problems: an insertion sequence problem (ISP), a reel positioning problem (RPP), and an optimal assembly mode problem (OAMP). The ISP for each type of PCB is formulated as a traveling salesperson problem for a fixed reel positioning. The RPP is formulated as an assignment problem for which the assignment cost is the sum of the weighted tour costs of the traveling salesperson problems for the subsets of PCB types. The ISPs and RPP are solved by a heuristic algorithm based on the two-optimal local search heuristic for the traveling salesperson problem, and an evolution strategy for the RPP. The OAMP is formulated as a set partitioning problem with added traveling salesperson type constraints. The proposed algorithm was implemented on a real life problem, and the optimal assembly mode was determined.
DA - 1999/4//
PY - 1999/4//
DO - 10.1016/S0360-8352(99)00142-4
VL - 36
IS - 2
SP - 451-471
SN - 0360-8352
KW - multi-type printed circuit board assembly
KW - insertion sequencing
KW - reel positioning
KW - optimal assembly mode
KW - evolution strategy
KW - two-opt local search heuristics
KW - set partitioning
ER -
TY - JOUR
TI - Types of reductive monoids
AU - Li, Zhilin
AU - Putcha, M.
T2 - Journal of Algebra
AB - Let M be a reductive monoid with a reductive unit group G. Clearly there is a natural G × G action on M. The orbits are the J-classes (in the sense of semigroup theory) and form a finite lattice. The general problem of finding the lattice remains open. In this paper we study a new class of reductive monoids constructed by multilined closure. We obtain a general theorem to determine the lattices of these monoids. We find that the (J, σ)-irreducible monoids of Suzuki type and Ree type belong to this new class. Using the general theorem we then list all the lattices and type maps of the (J, σ)-irreducible monoids of Suzuki type and Ree type.
DA - 1999///
PY - 1999///
DO - 10.1006/jabr.1999.7946
VL - 221
IS - 1
SP - 102–116
ER -
TY - JOUR
TI - The immersed finite volume element methods for the elliptic interface problems
AU - Ewing, RE
AU - Li, ZL
AU - Lin, T
AU - Lin, YP
T2 - MATHEMATICS AND COMPUTERS IN SIMULATION
AB - An immersed finite element space is used to solve the elliptic interface problems by a finite volume element method. Special nodal basis functions are introduced in a triangle whose interior intersects with the interface so that the jump conditions across the interface are satisfied. Optimal error estimates in an energy norm are obtained. Numerical results are supplied to justify the theoretical work and to reveal some interesting features of the method.
DA - 1999/11//
PY - 1999/11//
DO - 10.1016/S0378-4754(99)00061-0
VL - 50
IS - 1-4
SP - 63-76
SN - 0378-4754
KW - finite volume
KW - convergence
KW - error estimate
KW - interface problems
ER -
TY - JOUR
TI - Solving fuzzy inequalities with piecewise linear membership functions
AU - Hu, CF
AU - Fang, SC
T2 - IEEE TRANSACTIONS ON FUZZY SYSTEMS
AB - This paper deals with systems of fuzzy inequalities. It shows that a system of fuzzy inequalities with piecewise linear membership functions can be converted to a one-constraint nonlinear programming problem by employing the concepts of surrogate constraints and maximum entropy. An augmented Lagrangean algorithm is then applied to solve the resulting problem. Some computational results are included.
DA - 1999/4//
PY - 1999/4//
DO - 10.1109/91.755403
VL - 7
IS - 2
SP - 230-235
SN - 1063-6706
KW - fuzzy mathematical programming
KW - nonlinear programming
KW - systems of fuzzy inequalities
ER -
TY - JOUR
TI - Performance analysis of broadcast WDM networks under IP traffic
AU - McKinnon, MW
AU - Perros, HG
AU - Rouskas, GN
T2 - PERFORMANCE EVALUATION
AB - We consider the problem of carrying IP packet traffic over a broadcast WDM network. The network operates under a schedule that masks the transceiver tuning latency. Variable length IP packets are segmented at the transmitting end, the fixed-size segments are transmitted in slots specified by the schedule and are then reassembled into the original packet at the receiving end. We develop and analyze approximately a queueing model of the network in order to obtain the queue-length distribution and loss probabilities at the transmitting and receiving side of nodes. The analysis is carried out assuming finite buffer sizes, non-uniform destination probabilities, and an appropriate arrival process model. Our work makes it possible to study the interactions among the various system parameters (such as load balancing and scheduling algorithms, the number of channels, and the buffer capacity) and to predict, explain, and fine tune the performance of the network. To the best of our knowledge, this is the first comprehensive performance study of optical local area networks under variable length packets.
DA - 1999/8//
PY - 1999/8//
DO - 10.1016/S0166-5316(99)00031-0
VL - 36-7
SP - 333-358
SN - 1872-745X
KW - optical networks
KW - wavelength division multiplexing (WDM)
KW - discrete-time queueing networks
KW - IP packets
ER -
TY - JOUR
TI - Involving suppliers in new product development
AU - Handfield, RB
AU - Ragatz, GL
AU - Petersen, KJ
AU - Monczka, RM
T2 - CALIFORNIA MANAGEMENT REVIEW
AB - Organizations have been quick to realize that involving suppliers in new product/process/service development efforts has the potential for significant results. Numerous studies have highlighted the fact that supplier participation in product development projects can help reduce cost, reduce concept to customer development time, improve quality, and provide innovative technologies that can help capture market share. However, not all efforts are successful. Supplier integration is most successful when driven by a formalized process that considers supplier capabilities, level of complexity of the technology, and degree of risk. Leading companies conduct a formal in-depth supplier evaluation and risk assessment prior to supplier involvement on the project team.
DA - 1999///
PY - 1999///
DO - 10.2307/41166019
VL - 42
IS - 1
SP - 59-+
SN - 0008-1256
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0033480108&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition
AU - Kelley, CT
T2 - SIAM JOURNAL ON OPTIMIZATION
AB - The Nelder--Mead algorithm can stagnate and converge to a nonoptimal point, even for very simple problems. In this note we propose a test for sufficient decrease which, if passed for all iterations, will guarantee convergence of the Nelder--Mead iteration to a stationary point if the objective function is smooth and the diameters of the Nelder--Mead simplices converge to zero. Failure of this condition is an indicator of potential stagnation. As a remedy we propose a new step, which we call an oriented restart, that reinitializes the simplex to a smaller one with orthogonal edges whose orientation is determined by an approximate descent direction from the current best point. We also give results that apply when the objective function is a low-amplitude perturbation of a smooth function. We illustrate our results with some numerical examples.
DA - 1999/11/29/
PY - 1999/11/29/
DO - 10.1137/S1052623497315203
VL - 10
IS - 1
SP - 43-55
SN - 1095-7189
KW - Nelder-Mead algorithm
KW - sufficient decrease
KW - stagnation
ER -
TY - JOUR
TI - Convergence of a dynamic policy for buffer management in shared buffer ATM switches
AU - Sharma, S
AU - Viniotis, Y
T2 - PERFORMANCE EVALUATION
AB - Lack of effective buffer management can lead to severe cell loss in shared buffer ATM switches. With the aim of reducing cell loss, we study a class of non-anticipative buffer management policies that always admit cells to the buffer while there is space in it and may pushout a cell when the buffer becomes full. We propose a dynamic algorithm that operates without any knowledge of the arrival process; we consider a two-class system and show that the algorithm is optimal when the arrivals to each class are a superposition of identically distributed and independent Bernoulli processes.
DA - 1999/8//
PY - 1999/8//
DO - 10.1016/S0166-5316(99)00021-8
VL - 36-7
SP - 249-266
SN - 0166-5316
KW - ATM shared buffer switches
KW - cell loss
KW - dynamic pushout algorithms
KW - convergence of Markov chains
KW - buffer management
ER -
TY - JOUR
TI - An active set strategy based on the augmented Lagrangian formulation for image restoration
AU - Ito, K.
AU - Kunisch, K.
T2 - RAIRO. Mathematical Modelling and Numerical Analysis
AB - Lagrangian and augmented Lagrangian methods for nondifferentiable optimization problems that arise from the total bounded variation formulation of image restoration problems are analyzed. Conditional convergence of the Uzawa algorithm and unconditional convergence of the first order augmented Lagrangian schemes are discussed. A Newton type method based on an active set strategy defined by means of the dual variables is developed and analyzed. Numerical examples for blocky signals and images perturbed by very high noise are included.
DA - 1999///
PY - 1999///
DO - 10.1051/m2an:1999102
VL - 33
IS - 1
SP - 1-21
ER -
TY - JOUR
TI - Simulation study of AAL type 2
AU - Han, MY
AU - Nilsson, AA
T2 - TELECOMMUNICATION SYSTEMS
DA - 1999///
PY - 1999///
DO - 10.1023/A:1019165822265
VL - 11
IS - 3-4
SP - 323-336
SN - 1018-4864
ER -
TY - JOUR
TI - A fast multilevel algorithm for the solution of nonlinear systems of conductive-radiative heat transfer equations in two space dimensions
AU - Banoczi, JM
AU - Kelley, CT
T2 - SIAM JOURNAL ON SCIENTIFIC COMPUTING
AB - In this paper we describe a fast multilevel algorithm for the solution of a system of nonlinear integro-differential equations that model steady-state combined conductive-radiative heat transfer in two space dimensions. This extends our previous work in one space dimension. We formulate the equations as a compact fixed point problem with the temperature as the unknown. The fixed point map requires both a Poisson solve and a transport solve for its evaluation. As a solver for both the transport problem and the full system we apply the Atkinson--Brakhage algorithm, using Newton-GMRES as the solver on the coarse mesh. We compare our solver choices with Newton-GMRES. Under modest stability and convergence assumptions on the transport solver, we prove convergence of the multilevel method for the complete system.
DA - 1999///
PY - 1999///
DO - 10.1137/S1064827597322756
VL - 20
IS - 4
SP - 1214-1228
SN - 1064-8275
KW - conductive-radiative heat transfer
KW - multilevel algorithm
KW - compact fixed point problems
ER -
TY - JOUR
TI - The bases of effective coordination in decentralized multi-agent systems
AU - Rustogi, S. K.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Coordination isa recurring theme in multiagent systems design.We consider the problem of achieving coordination in a system where the agents make autonomous decisions based solely on local knowledge.An open theoretical issue is what goes into achieving effective coordination? There is some folklore about the importance of the knowledge held by the different agents,but the rest of the rich agent landscape has not been explored in depth.The present paper seeks to delineate the different components of an abstract architecture for agents that influence the effectiveness of coordination.Specifically,it proposes that the extent of the choices available to the agents as well as the extent of the knowledge shared by them are both important for understanding coordination in general.These lead to a richer view of coordination that supports a more intuitive set of claims.This paper supports its conceptual conclusions with experimental results based on simulation.
CN - [Electronic resource]
DA - 1999///
PY - 1999///
DO - 10.1007/3-540-49057-4_10
VL - 1555
SP - 149–161
UR - https://publons.com/publon/21294531/
ER -
TY - JOUR
TI - Multiple interval mapping for quantitative trait loci
AU - Kao, C. H.
AU - Zeng, Z. B.
AU - Teasdale, R. D.
T2 - Genetics
DA - 1999///
PY - 1999///
VL - 152
IS - 3
SP - 1203-1216
ER -
TY - JOUR
TI - DAEs arising from traveling wave solutions of PDEs II
AU - Marszalek, W
AU - Campbell, SL
T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS
AB - The study of traveling wave solutions of PDEs sometimes leads to systems of Differential Algebraic Equations (DAEs). This paper examines a family of DAEs that arise in this manner from the Magnetohydrodynamics (MHD) equations. These DAEs are of interest in their own right, as a source of test problems for DAE numerical integrators, and because of their relationship to the MHD equations.
DA - 1999/1//
PY - 1999/1//
DO - 10.1016/S0898-1221(98)00238-7
VL - 37
IS - 1
SP - 15-34
SN - 0898-1221
KW - differential algebraic equation
KW - magnetohydrodynamics
KW - dynamical systems
ER -
TY - JOUR
TI - Workflow and end-user quality of service issues in Web-based education
AU - Vouk, MA
AU - Bitzer, DL
AU - Klevans, RL
T2 - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
AB - The option of obtaining education over networks is quickly becoming a reality for all those who have access to the Internet and the World Wide Web (WWW). However, at present, network-based education (NBE) over the WWW and the Internet in general faces a number of pitfalls. The problems range from inadequate end-user quality of service (QoS), to inadequate materials, to shortcomings in learning paradigms, and to missing or inappropriate student assessment and feedback mechanisms. In this paper, we discuss some major issues that, although mostly solved for NBE, still face Web-based education (WEE). These include the required workflow-oriented technological and quality of service support. In discussing the issues, we use examples from a wide-area NBE/WBE system called NovaNET and a WEE system called Web Lecture System (WLS). We recommend that WEE system developers construct operational user (workflow) profiles before building their content and interfaces. Our experience is that, especially for synchronous WEE systems, user-level round-trip keystroke delays should not exceed about 250 ms and the overall availability of the system (including network-related service failures) should be at least 0.95. We also suggest that a successful WEE system will have a sound auto-adaptive knowledge assessment component, a "virtual" laboratory capability, and a set of strong collaborative functions.
DA - 1999///
PY - 1999///
DO - 10.1109/69.790839
VL - 11
IS - 4
SP - 673-687
SN - 1558-2191
KW - network-based education
KW - end-user quality of service
KW - Web lecture system
KW - NovaNET
KW - education workflows
KW - distance education
KW - computer-based training
KW - system reliability
KW - keystroke response time
KW - Web-based instruction
ER -
TY - JOUR
TI - Tensile behavior of slack fiber bundles - Theory and application to HVI testing
AU - Cui, X. L.
AU - Suh, M. W.
AU - Sasser, P. E.
T2 - Textile Research Journal
AB - A statistical model for the tensile behavior of a bundle of slack fibers is developed in terms of its constituent single fiber properties. A large amount of data on single fiber tensile properties is obtained by a Mantis® tester. Application of this theory to HVI tensile test results shows much better agreement than other models developed earlier for bundles of straight, equal length fibers.
DA - 1999///
PY - 1999///
DO - 10.1177/004051759906900706
VL - 69
IS - 7
SP - 497-502
ER -
TY - JOUR
TI - Scheduling with alternatives: a link between process planning and scheduling
AU - Weintraub, A.
AU - Cormier, D.
AU - Hodgson, Thom
AU - King, R.
AU - Wilson, J.
AU - Zozom, A.
T2 - IIE Transactions
AB - The objective of this research is to develop and evaluate effective, computationally efficient procedures for scheduling jobs in a large-scale manufacturing system involving, for example, over 1000 jobs and over 100 machines. The main performance measure is maximum lateness; and a useful lower bound on maximum lateness is derived from a relaxed scheduling problem in which preemption of jobs is based on the latest finish time of each job at each machine. To construct a production schedule that minimizes maximum lateness, an iterative simulation-based scheduling algorithm operates as follows: (a) job queuing times observed at each machine in the previous simulation iteration are used to compute a refined estimate of the effective due date (slack) for each job at each machine; and (b) in the current simulation iteration, jobs are dispatched at each machine in order of increasing slack. Iterations of the scheduling algorithm terminate when the lower bound on maximum lateness is achieved or the iteration limit is reached. This scheduling algorithm is implemented in Virtual Factory, a Windows-based software package. The performance of Virtual Factory is demonstrated in a suite of randomly generated test problems as well as in a large furniture manufacturing facility. To further reduce maximum lateness, a second scheduling algorithm also incorporates a tabu search procedure that identifies process plans with alternative operations and routings for jobs. This enhancement yields improved schedules that minimize manufacturing costs while satisfying job due dates. An extensive experimental performance evaluation indicates that in a broad range of industrial settings, the second scheduling algorithm can rapidly identify optimal or nearly optimal schedules.
DA - 1999///
PY - 1999///
DO - 10.1080/07408179908969910
VL - 31
IS - 11
SP - 1093–1102
ER -
TY - JOUR
TI - Productivity analysis of object-oriented software developed in a commercial environment
AU - Potok, TE
AU - Vouk, M
AU - Rindos, A
T2 - SOFTWARE-PRACTICE & EXPERIENCE
AB - The introduction of object-oriented technology does not appear to hinder overall productivity on new large commercial projects, but nor does it seem to improve it in the first two product generations. In practice, the governing influence may be the business workflow, and not the methodology. Copyright © 1999 John Wiley & Sons, Ltd.
DA - 1999/8//
PY - 1999/8//
DO - 10.1002/(SICI)1097-024X(199908)29:10<833::AID-SPE258>3.0.CO;2-P
VL - 29
IS - 10
SP - 833-847
SN - 0038-0644
KW - object-oriented
KW - software development productivity
ER -
TY - JOUR
TI - Optimal buffer management policies for shared-buffer ATM switches
AU - Sharma, S
AU - Viniotis, Y
T2 - IEEE-ACM TRANSACTIONS ON NETWORKING
AB - Shared-buffer ATM switches can have severe cell loss under asymmetrical or heavy loading conditions, which makes buffer management essential. In this paper, we study the shared-buffer system under the class of all work-conserving pushout policies and derive the properties of the optimal policy, which gives the least-average expected total cell loss probability. In a 2/spl times/2 system with independent identically distributed Bernoulli arrivals, we show that the optimal policy can be characterized by a single threshold. In the case of correlated arrivals, modeled by a discrete batch Markovian arrival process, the optimal policy has multiple thresholds, one for each phase of the arrival process. For the N/spl times/N shared buffer ATM switch, we are unable to prove optimality of any policy, but we study the system via simulations. We provide a dynamic buffer management policy and compare its performance with that of static threshold-type policies.
DA - 1999/8//
PY - 1999/8//
DO - 10.1109/90.793030
VL - 7
IS - 4
SP - 575-587
SN - 1063-6692
KW - ATM switches
KW - buffer management
KW - optimal
KW - policies.
ER -
TY - JOUR
TI - On satisfying due-dates in large job shops: Idle time insertion
AU - Hodgson, Thom
AU - King, R. E.
AU - Thoney, K.
AU - Stanislaw, N.
AU - Weintraub, A. J.
AU - Zozom, A.
T2 - IIE Transactions
AB - We consider the problem of minimizing maximum lateness in a job shop. A conceptually simple simulation based procedure described in a recent paper by Hodgson et al [1] is modified to provide improved schedules. Computational experimentation is provided to identify the conditions under which the approach is most viable, and to report the procedure's performance on known test problems.
DA - 1999///
PY - 1999///
DO - 10.1080/07408170008963890
VL - 32
IS - 2
SP - 177–180
ER -
TY - JOUR
TI - Multiagent treatment of agenthood
AU - Huhns, MN
AU - Singh, MP
T2 - APPLIED ARTIFICIAL INTELLIGENCE
AB - There have been numerous attempts to provide a standardized definition ofa computational agent, but little consensus has emerged. We propose a simple test for agenthood that can be applied to a putative computational agent. Roughly, this test seeks to capture the intuition that an agent is an entity that can function as part ofa multiagent system. The test depends on the observed behavior of the supposed agent and not on the internals of it. We apply the test to some well-known kinds of systems of (supposed) agents and discuss the results. We present a formulation of the test and some variants with a semantics based on sociability. Our treatment of agenthood can thus serve as a methodological basis for evaluating putative agents and agent toolkits.
DA - 1999///
PY - 1999///
DO - 10.1080/088395199117469
VL - 13
IS - 1-2
SP - 3-10
SN - 0883-9514
UR - https://publons.com/publon/21294524/
ER -
TY - JOUR
TI - Maximizing yarn and fabric strength through variance of HVI elongation
AU - Koo, HJ
AU - Suh, MW
T2 - TEXTILE RESEARCH JOURNAL
AB - As a new method for maximizing yarn and fabric strengths, an exploratory blending experiment is completed in a 4-week period by processing 2117 bales of three different cottons in a textile mill to produce 94.4 tex (6.3/1 Ne) open-end spun yarns, and weaving them into a denim fabric. Bale selection is done in such a way that the variance of single fiber breaking elongations can be minimized within a laydown of 29 bales as well as among the fibers to be found within an arbitrary cross section of the yam produced from the laydown. The study shows that the variance of the HVI breaking elongations obtained from the cotton bales is useful for maximizing the resulting yarn strengths, especially when they are combined with the Mantis® single fiber test results. In addition, a follow-up study analyzes the HVI data and matching physical test data obtained from a 2-year production period. In all, 121,200 bales (4180 laydowns) are tested for HVI bundle strength, elongation, micronaire, length, and other properties. As in the exploratory study, the cotton bales are processed into 94.4 tex open-end spun yams and an identical denim fabric. The final analysis shows that the between-bale variance of HVI bundle breaking elongations within a laydown is quite useful as a criterion for bale selection and yarn and fabric strength maximization. An enhanced method is also developed to make use of the HVI elongation data together with the Mantis single fiber tensile test results. The new procedure is even more effective at maximizing yarn and fabric strengths.
DA - 1999/6//
PY - 1999/6//
DO - 10.1177/004051759906900609
VL - 69
IS - 6
SP - 447-456
SN - 0040-5175
ER -
TY - JOUR
TI - An efficient solution procedure for fuzzy relation equations with max-product composition
AU - Loetamonphong, J
AU - Fang, SC
T2 - IEEE TRANSACTIONS ON FUZZY SYSTEMS
AB - We study a system of fuzzy relation equations with max-product composition and present an efficient solution procedure to characterize the whole solution set by finding the maximum solution as well as the complete set of minimal solutions. Instead of solving the problem combinatorially, the procedure identifies the "nonminimal" solutions and eliminates them from the set of minimal solutions.
DA - 1999/8//
PY - 1999/8//
DO - 10.1109/91.784204
VL - 7
IS - 4
SP - 441-445
SN - 1063-6706
KW - fuzzy relation equations
KW - max-product composition
KW - minimal solutions
ER -
TY - JOUR
TI - Evaluation of cylindricity using combinatorics
AU - Hodgson, Thom
AU - Kay, M. G.
AU - Mittal, R. O.
AU - Tang, S. Y.
T2 - IIE Transactions
AB - Several numerical methods have been developed for finding the minimum zone of a cylinder. This paper presents a combinatorial method termed the Minimum Shell for cylindricity evaluation. For a given set of measured data points, the method efficiently searches for the six points that determine the minimum zone of cylindricity. This method is self-contained, without the requirement of mathematical programming software support, and is equal to or superior to other methods of evaluating cylindricity in terms of accuracy, efficiency, and simplicity. Computational results are given.
DA - 1999///
PY - 1999///
DO - 10.1080/07408179908969804
VL - 31
IS - 1
SP - 39–47
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85023862738&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Estimates for the Nash-Sofer preconditioner for the reduced Hessian for some elliptic variational inequalities
AU - Choi, TD
AU - Kelley, CT
T2 - SIAM JOURNAL ON OPTIMIZATION
AB - The purpose of this paper is to present a class of examples to show how the quality of the Nash--Sofer preconditioner can be directly estimated. This class of examples includes certain discretized elliptic variational inequalities. We use sparsity and locality properties of discretizations of elliptic operators and smoothing properties of their inverses to estimate the quality of the preconditioner. One consequence of our results is that if the Hessian is the five-point discretization of a certain type of strongly elliptic operator with homogeneous Dirichlet boundary conditions on an $n \times n$ mesh and the preconditioner is a fast Poisson solver for that discretization, then the condition number of the reduced Hessian can be lowered from O(n2 ) to O(n ln(n)). We illustrate these theoretical results with calculations.
DA - 1999/4/20/
PY - 1999/4/20/
DO - 10.1137/S1052623497323364
VL - 9
IS - 2
SP - 327-341
SN - 1052-6234
KW - preconditioners
KW - reduced Hessian
KW - elliptic variational inequalities
ER -
TY - JOUR
TI - A complete steady state model of solute and water transport in the kidney
AU - Kottler, NE
AU - Tran, HT
AU - Wessell, DE
T2 - MATHEMATICAL AND COMPUTER MODELLING
AB - The purpose of this paper is to incorporate a detailed model, along with an optimized set of parameters for the proximal tubule, into J. L. Stephenson's current central core model of the nephron. In this model a set of equations for the proximal tubule are combined with Stephenson's equations for the remaining four tubules and interstitium, to form a complete nonlinear system of 34 ordinary differential and algebraic equations governing fluid and solute flow in the kidney. These equations are then discretized by the Crank-Nicholson scheme to form an algebraic system of nonlinear equations for the unknown concentrations, flows, hydrostatic pressure, and potentials. The resulting system is solved via factored secant update with a finite-difference approximation to the Jacobian. Finally, numerical simulations performed on the model showed that the modeled behavior approximates, in a general way, the physiological mechanisms of solvent and solute flow in the kidney.
DA - 1999/3//
PY - 1999/3//
DO - 10.1016/S0895-7177(99)00055-2
VL - 29
IS - 6
SP - 63-82
SN - 1872-9479
KW - transport model
KW - biomathematics
KW - differential algebraic system
KW - inserve problem
KW - numerical methods
ER -
TY - JOUR
TI - Primal-dual strategy for constrained optimal control problems
AU - Bergounioux, M
AU - Ito, K
AU - Kunisch, K
T2 - SIAM JOURNAL ON CONTROL AND OPTIMIZATION
AB - An algorithm for efficient solution of control constrained optimal control problems is proposed and analyzed. It is based on an active set strategy involving primal as well as dual variables. For discretized problems sufficient conditions for convergence in finitely many iterations are given. Numerical examples are given and the role of the strict complementarity condition is discussed.
DA - 1999/5/26/
PY - 1999/5/26/
DO - 10.1137/S0363012997328609
VL - 37
IS - 4
SP - 1176-1194
SN - 0363-0129
KW - active set
KW - augmented Lagrangian
KW - primal-dual method
KW - optimal control
ER -
TY - JOUR
TI - On the multiplicity of parts in a random partition
AU - Corteel, S
AU - Pittel, B
AU - Savage, CD
AU - Wilf, HS
T2 - RANDOM STRUCTURES & ALGORITHMS
AB - Let λ be a partition of an integer n chosen uniformly at random among all such partitions. Let s(λ) be a part size chosen uniformly at random from the set of all part sizes that occur in λ. We prove that, for every fixed m≥1, the probability that s(λ) has multiplicity m in λ approaches 1/(m(m+1)) as n→∞. Thus, for example, the limiting probability that a random part size in a random partition is unrepeated is 1/2. In addition, (a) for the average number of different part sizes, we refine an asymptotic estimate given by Wilf, (b) we derive an asymptotic estimate of the average number of parts of given multiplicity m, and (c) we show that the expected multiplicity of a randomly chosen part size of a random partition of n is asymptotic to (log n)/2. The proofs of the main result and of (c) use a conditioning device of Fristedt. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 185–197, 1999
DA - 1999/3//
PY - 1999/3//
DO - 10.1002/(SICI)1098-2418(199903)14:2<185::AID-RSA4>3.0.CO;2-F
VL - 14
IS - 2
SP - 185-197
SN - 1042-9832
ER -
TY - JOUR
TI - Formal specification of concurrent systems
AU - Chadha, HS
AU - Baugh, JW
AU - Wing, JM
T2 - ADVANCES IN ENGINEERING SOFTWARE
AB - This paper presents a formal methodology for developing concurrent systems. We extend the Larch family of specification languages and tools with the CCS process algebra to support the specification and verification of concurrent systems. We present and follow a refinement strategy that relates an implementation in a programming language to a formal specification of such a system. We illustrate our methodology on an example that uses the preconditioned conjugate gradient method for solving a linear system of equations.
DA - 1999/3//
PY - 1999/3//
DO - 10.1016/S0965-9978(98)00058-1
VL - 30
IS - 3
SP - 211-224
SN - 0965-9978
KW - larch
KW - CCS
KW - equational specifications
KW - process algebra
KW - conjugate gradient method
KW - distributed systems
KW - concurrent systems
KW - programming languages
KW - formal methods
ER -
TY - JOUR
TI - Combinatorial families that are exponentially far from being listable in Gray code sequence
AU - Chinburg, T
AU - Savage, CD
AU - Wilf, HS
T2 - TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
AB - Let S ( n ) S(n) be a collection of subsets of { 1 , . . . , n } \{1,...,n\} . In this paper we study numerical obstructions to the existence of orderings of S ( n ) S(n) for which the cardinalities of successive subsets satisfy congruence conditions. Gray code orders provide an example of such orderings. We say that an ordering of S ( n ) S(n) is a Gray code order if successive subsets differ by the adjunction or deletion of a single element of { 1 , … , n } \{1,\ldots ,n\} . The cardinalities of successive subsets in a Gray code order must alternate in parity. It follows that if d ( S ( n ) ) d(S(n)) is the difference between the number of elements of S ( n ) S(n) having even (resp. odd) cardinality, then | d ( S ( n ) ) | − 1 |d(S(n))| - 1 is a lower bound for the cardinality of the complement of any subset of S ( n ) S(n) which can be listed in Gray code order. For g ≥ 2 g \ge 2 , the collection B ( n , g ) B(n,g) of g g -blockfree subsets of { 1 , … , n } \{1,\ldots ,n\} is defined to be the set of all subsets S S of { 1 , … , n } \{1,\ldots ,n\} such that | a − b | ≥ g |a-b| \ge g if a , b ∈ S a,b \in S and a ≠ b a \ne b . We will construct a Gray code order for B ( n , 2 ) B(n,2) . In contrast, for g > 2 g > 2 we find the precise (positive) exponential growth rate of d ( B ( n , g ) ) d(B(n,g)) with n n as n → ∞ n \to \infty . This implies B ( n , g ) B(n,g) is far from being listable in Gray code order if n n is large. Analogous results for other kinds of orderings of subsets of B ( n , g ) B(n,g) are proved using generalizations of d ( B ( n , g ) ) d(B(n,g)) . However, we will show that for all g g , one can order B ( n , g ) B(n,g) so that successive elements differ by the adjunction and/or deletion of an integer from { 1 , … , n } \{1,\ldots ,n\} . We show that, over an A A -letter alphabet, the words of length n n which contain no block of k k consecutive letters cannot, in general, be listed so that successive words differ by a single letter. However, if k > 2 k>2 and A > 2 A>2 or if k = 2 k=2 and A > 3 A>3 , such a listing is always possible.
DA - 1999/1//
PY - 1999/1//
DO - 10.1090/S0002-9947-99-02229-1
VL - 351
IS - 1
SP - 379-402
SN - 0002-9947
KW - Gray code
KW - nonexistence
ER -
TY - JOUR
TI - Agents for process coherence in virtual enterprises
AU - Jain, AK
AU - Aparicio, M
AU - Singh, MP
T2 - COMMUNICATIONS OF THE ACM
AB - article Free Access Share on Agents for process coherence in virtual enterprises Authors: Anuj K. Jain Ericsson New Concepts Group in Research Triangle Park, NC Ericsson New Concepts Group in Research Triangle Park, NCView Profile , Manuel Aparico IBM Intelligent Agents and Knowledge Management Group, Triangle Park, NC IBM Intelligent Agents and Knowledge Management Group, Triangle Park, NCView Profile , Munindar P. Singh North Carolina State Univ., Raleigh North Carolina State Univ., RaleighView Profile Authors Info & Claims Communications of the ACMVolume 42Issue 3March 1999 pp 62–69https://doi.org/10.1145/295685.295702Published:01 March 1999Publication History 80citation949DownloadsMetricsTotal Citations80Total Downloads949Last 12 Months39Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteView all FormatsPDF
DA - 1999/3//
PY - 1999/3//
DO - 10.1145/295685.295702
VL - 42
IS - 3
SP - 62-69
SN - 1557-7317
UR - https://publons.com/publon/21294528/
ER -
TY - JOUR
TI - A numerical study of large sparse matrix exponentials arising in Markov chains
AU - Sidje, R. B.
AU - Stewart, W. J.
T2 - Computational Statistics & Data Analysis
AB - Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models.
DA - 1999///
PY - 1999///
DO - 10.1016/S0167-9473(98)00062-0
VL - 29
IS - 3
SP - 345-368
ER -
TY - JOUR
TI - Solving fuzzy relation equations with a linear objective function
AU - Fang, SC
AU - Li, GZ
T2 - FUZZY SETS AND SYSTEMS
AB - An optimization model with a linear objective function subject to a system of fuzzy relation equations is presented. Due to the non-convexity of its feasible domain defined by fuzzy relation equations, designing an efficient solution procedure for solving such problems is not a trivial job. In this paper, we first characterize the feasible domain and then convert the problem to an equivalent problem involving 0–1 integer programming with a branch-and-bound solution technique. After presenting our solution procedure, a concrete example is included for illustration purpose.
DA - 1999/4/1/
PY - 1999/4/1/
DO - 10.1016/S0165-0114(97)00184-X
VL - 103
IS - 1
SP - 107-113
SN - 0165-0114
KW - fuzzy relation equations
KW - branch-and-bound method
KW - integer programming
ER -
TY - JOUR
TI - Linear programming with fuzzy coefficients in constraints
AU - Fang, SC
AU - Hu, CF
AU - Wang, HF
AU - Wu, SY
T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS
AB - This paper presents a new method for solving linear programming problems with fuzzy coefficients in constraints. It is shown that such problems can be reduced to a linear semi-infinite programming problem. The relations between optimal solutions and extreme points of the linear semi-infinite program are established. A cutting plane algorithm is introduced with a convergence proof, and a numerical example is included to illustrate the solution procedure.
DA - 1999/5//
PY - 1999/5//
DO - 10.1016/S0898-1221(99)00126-1
VL - 37
IS - 10
SP - 63-76
SN - 0898-1221
KW - fuzzy mathematical programming
KW - linear semi-infinite programming
ER -
TY - JOUR
TI - Fast and accurate numerical approaches for Stefan problems and crystal growth
AU - Li, ZL
AU - Soni, B
T2 - NUMERICAL HEAT TRANSFER PART B-FUNDAMENTALS
AB - New numerical approaches for moving boundary interface applications tailored for Stefan problems and crystal growth simulation are proposed in this article. The focus is on the issues of accuracy and speed-up. A modified Crank-Nicolson method that is second-order accurate and stable is developed. The alternating directional implicit (ADI) method is also developed to speed up the simulation for a certain class of problems. The ADI method is shown to be asymptotically stable and at least first-order accurate. Numerical results, however, show that the ADI method actually provides second-order accuracy if the velocity can be calculated accurately. The level set method is used to update the moving interface so that the topological changes can be handled easily. Numerical experiments are compared to exact solutions and results in the literature.
DA - 1999/6//
PY - 1999/6//
DO - 10.1080/104077999275848
VL - 35
IS - 4
SP - 461-484
SN - 1040-7790
ER -
TY - JOUR
TI - Representation of GaP formation by a reduced order surface kinetics model using p-polarized reflectance measurements
AU - Beeler, S
AU - Tran, HT
AU - Dietz, N
T2 - JOURNAL OF APPLIED PHYSICS
AB - This contribution presents results on the parameter estimation of rate constants and optical response factors in a reduced order surface kinetics (ROSK) model, which has been developed to describe the decomposition kinetics of the organometallic precursors involved and their incorporation into the film deposition. As a real-time characterization technique, we applied p-polarized reflectance spectroscopy (PRS) during low temperature growth of epitaxial GaP heterostructures on Si(001) substrates by pulsed chemical beam epitaxy. The high surface sensitivity of PRS allows us to follow alterations in the composition and thickness of the surface reaction layer as they are encountered during periodic precursor supply. Linkage of the PRS response to the ROSK model provides the base for the parameter estimation of the reduced order surface kinetics model, giving insights into the organometallic precursor decomposition and growth kinetics.
DA - 1999/7/1/
PY - 1999/7/1/
DO - 10.1063/1.370783
VL - 86
IS - 1
SP - 674-682
SN - 1089-7550
ER -
TY - JOUR
TI - A numerical study of electro-migration voiding by evolving level set functions on a fixed Cartesian grid
AU - Li, ZL
AU - Zhao, HK
AU - Gao, HJ
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - A numerical method for studying migration of voids driven by surface diffusion and electric current in a metal conducting line is developed. The mathematical model involves moving boundaries governed by a fourth order nonlinear partial differential equation which contains a nonlocal term corresponding to the electrical field and a nonlinear term corresponding to the curvature. Numerical challenges include efficient computation of the electrical field with sufficient accuracy to afford fourth order differentiation along the void boundary and to capture singularities arising in topological changes. We use the modified immersed interface method with a fixed Cartesian grid to solve for the electrical field, and the fast local level set method to update the position of moving voids. Numerical examples are performed to demonstrate the physical mechanisms by which voids interact under electromigration.
DA - 1999/6/10/
PY - 1999/6/10/
DO - 10.1006/jcph.1999.6249
VL - 152
IS - 1
SP - 281-304
SN - 0021-9991
ER -
TY - JOUR
TI - Soft computing for multicustomer due-date bargaining
AU - Wang, DW
AU - Fang, SC
AU - Nuttle, HLW
T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS
AB - The due-date bargainer is a useful tool to support negotiation on due dates between a manufacturer and its customers. To improve the computational performance of an earlier version of the due-date bargainer, we present a new soft computing approach. It uses a genetic algorithm to find the best priority sequence of customer orders for resource allocation, and fuzzy logic operations to allocate the resources and determine the order completion times, following the priority sequence of orders. To extend the due-date bargainer to accommodate bargaining with several customers at the same time, we propose a method to distribute the total penalty using marginal penalties for the individual bargainers. A demonstration software package implementing the improved due-date bargainer has been developed. It is targeted at apparel manufacturing enterprises. Experiments using realistic resource data and randomly generated orders have achieved satisfactory results.
DA - 1999/11//
PY - 1999/11//
DO - 10.1109/5326.798770
VL - 29
IS - 4
SP - 566-575
SN - 1558-2442
KW - due date assignment
KW - fuzzy optimization
KW - genetic algorithms
KW - JIT
KW - MRP-II
KW - production planning
KW - soft computing
ER -
TY - JOUR
TI - Reconfiguration and dynamic load balancing in broadcast WDM networks
AU - Baldine, I
AU - Rouskas, GN
T2 - PHOTONIC NETWORK COMMUNICATIONS
DA - 1999/6//
PY - 1999/6//
DO - 10.1023/A:1010029100403
VL - 1
IS - 1
SP - 49-64
SN - 1387-974X
KW - broadcast optical networks
KW - wavelength division multiplexing (WDM)
KW - reconfiguration
KW - dynamic load balancing
ER -
TY - BOOK
TI - Iterative Methods for Optimization
AU - Kelley, C T
AB - This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality, and while it provides pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to Kelley's book, Iterative Methods for Linear and Nonlinear Equations (SIAM, 1995), this book contains many exercises and examples and can be used as a text, a tutorial for self-study, or a reference. Iterative Methods for Optimization does more than cover traditional gradient-based optimization: it is the first book to treat sampling methods, including the Hooke& Jeeves, implicit filtering, MDS, and Nelder& Mead schemes in a unified way.
CN - QA402.5 .K44 1999
DA - 1999///
PY - 1999///
DO - 10.1137/1.9781611970920
PB - SIAM
SN - 0898714338
ER -
TY - CONF
TI - A new fuzzy due-date bargainer with soft computing
AU - Fang, S.-C.
AU - Wang, D.-W.
AU - Chen, S.-H.
AU - Nuttle, H.
C2 - 1999///
C3 - Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999
DA - 1999///
M1 - 1999 Aug.
PB - Piscataway, N.J.: IEEE
ER -
TY - JOUR
TI - The index of an infinite dimensional implicit system
AU - Campbell, SL
AU - Marszalek, W
T2 - MATHEMATICAL AND COMPUTER MODELLING OF DYNAMICAL SYSTEMS
AB - The idea of the index of a differential algebraic equation (DAE) (or implicit differential equation) has played a fundamental role in both the analysis of DAEs and the development of numerical algorithms for DAEs. DAEs frequently arise as partial discretizations of partial differential equations (PDEs). In order to relate properties of the PDE to those of the resulting DAE it is necessary to have a concept of the index of a possibly constrained PDE. Using the finite dimensional theory as motivation, this paper will examine what one appropriate analogue is for infinite dimensional systems. A general definition approach will be given motivated by the desire to consider numerical methods. Specific examples illustrating several kinds of behavior will be considered in some detail. It is seen that our definition differs from purely algebraic definitions. Numerical solutions, and simulation difficulties, can be misinterpreted if this index information is missing.
DA - 1999/3//
PY - 1999/3//
DO - 10.1076/mcmd.5.1.18.3625
VL - 5
IS - 1
SP - 18-42
SN - 1387-3954
KW - numerical analysis
KW - ordinary differential equations on manifolds
KW - overdetermined systems
KW - partial differential equations on manifolds (AMS Classification)
ER -
TY - JOUR
TI - The E-Commerce Inversion
AU - Singh, M.P.
T2 - IEEE Internet Computing
DA - 1999/9//
PY - 1999/9//
DO - 10.1109/MIC.1999.793453
VL - 3
IS - 5
SP - 4-5
J2 - IEEE Internet Comput.
OP -
SN - 1089-7801
UR - http://dx.doi.org/10.1109/mic.1999.793453
DB - Crossref
ER -
TY - JOUR
TI - Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
AU - Wu, SY
AU - Fang, SC
T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS
AB - One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut. In each iteration, the proposed scheme chooses a point at which the constraints are violated to a degree rather than at which the violation is maximized. A convergence proof is provided. The proposed scheme also exhibits the capability of generating an approximate solution to any level of accuracy in a finite number of iterations.
DA - 1999/8//
PY - 1999/8//
DO - 10.1016/S0898-1221(99)00203-5
VL - 38
IS - 3-4
SP - 23-33
SN - 1873-7668
KW - convex semi-infinite programming
KW - cutting plane method
KW - duality theory
ER -
TY - JOUR
TI - Sequencing parallel machining operations by genetic algorithms
AU - Chiu, NC
AU - Fang, SC
AU - Lee, YS
T2 - COMPUTERS & INDUSTRIAL ENGINEERING
AB - Parallel machines (mill/turn machining centers) provide a powerful and efficient machining alternative to the traditional sequential machining process. The underutilization of parallel machines due to their operating complexity has increased interest in developing an efficient methodology for sequencing the parallel machining operations. This paper presents a mixed integer programming model for sequencing parallel machining operations. A genetic-based algorithm for finding an optimal parallel operation sequence on parallel machines is proposed. Two new genetic operators for solving order-based genetic algorithms and computational experiments are also included.
DA - 1999/4//
PY - 1999/4//
DO - 10.1016/S0360-8352(99)00132-1
VL - 36
IS - 2
SP - 259-280
SN - 0360-8352
KW - parallel machines
KW - genetic algorithms
KW - mixed integer programming
ER -
TY - JOUR
TI - On the sensitivity of project variability to activity mean duration
AU - Elmaghraby, SE
AU - Fathi, Y
AU - Taner, MR
T2 - INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
AB - Traditionally the `importance' of an activity in the PERT model of projects is measured by its `criticality index', which is defined as the probability that the activity will be on the longest path. An insightful discussion by Williams (1992, Journal of Operational Research Society 43, 353–357) revealed that the classical criticality index is not always informative or intuitively appealing. In a recent study by Cho and Yum (1997, International Journal of Production Research 35, 2737–2757), a new `Uncertainty Importance Measure' is defined to measure the effect of the variability in an activity duration on the variability of the overall project duration. They propose Taguchi's sampling technique as a method for analyzing the network. The main contribution of this paper is to study the impact of changing the mean duration of an activity on the variability of the project duration. On the way to accomplish this, we further investigate the accuracy of Taguchi's sampling method for approximating the mean and standard deviation of the project duration, and propose steps that could result in computational savings in large networks.
DA - 1999/9/20/
PY - 1999/9/20/
DO - 10.1016/S0925-5273(98)00241-2
VL - 62
IS - 3
SP - 219-232
SN - 0925-5273
KW - activity networks
KW - Taguchi sampling
KW - sensitivity analysis
ER -
TY - JOUR
TI - Multiagent systems on the net
AU - Joshi, A
AU - Singh, MP
T2 - COMMUNICATIONS OF THE ACM
AB - article Free Access Share on Multiagent systems on the net Authors: Anupam Joshi Univ. of Maryland Baltimore County Univ. of Maryland Baltimore CountyView Profile , Munindar P. Singh North Carolina State Univ., Raleigh, NC North Carolina State Univ., Raleigh, NCView Profile Authors Info & Claims Communications of the ACMVolume 42Issue 3March 1999pp 38–40https://doi.org/10.1145/295685.295695Published:01 March 1999Publication History 26citation341DownloadsMetricsTotal Citations26Total Downloads341Last 12 Months11Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteView all FormatsPDF
DA - 1999/3//
PY - 1999/3//
DO - 10.1145/295685.295695
VL - 42
IS - 3
SP - 38-40
SN - 0001-0782
UR - https://publons.com/publon/21294526/
ER -
TY - JOUR
TI - Convergence analysis of the immersed interface method
AU - Huang, HX
AU - Li, ZL
T2 - IMA JOURNAL OF NUMERICAL ANALYSIS
AB - A rigorous error analysis is given for the immersed interface method (IIM) applied to elliptic problems with discontinuities and singularities. The finite difference scheme using IIM is shown to satisfy the conditions of a maximum principle for a certain class of problems. Comparison functions are constructed to obtain error bounds for some of the approximate solutions. The asymptotic error expansion provides further useful insights and details of the behaviour and convergence properties of IIM, which leads to a sharper estimate of the error bound. Second-order convergence of IIM is indicated by the analysis. Numerical examples are also given to support the analytical results.
DA - 1999/10//
PY - 1999/10//
DO - 10.1093/imanum/19.4.583
VL - 19
IS - 4
SP - 583-608
SN - 0272-4979
ER -
TY - JOUR
TI - Constrained convergence
AU - Hartwig, RE
AU - Semrl, P
T2 - ROCKY MOUNTAIN JOURNAL OF MATHEMATICS
DA - 1999///
PY - 1999///
DO - 10.1216/rmjm/1181071685
VL - 29
IS - 1
SP - 177-195
SN - 0035-7596
ER -
TY - JOUR
TI - Value-oriented electronic commerce
AU - Singh, MP
T2 - IEEE INTERNET COMPUTING
DA - 1999///
PY - 1999///
DO - 10.1109/MIC.1999.747316
VL - 3
IS - 3
SP - 6-7
SN - 1941-0131
UR - https://publons.com/publon/21294525/
ER -
TY - JOUR
TI - Equations for predicting weight loss in stored pulpwood for North Carolina and Virginia
AU - Roise, J. P.
AU - Whitlow, P. E.
AU - Deal, E. L.
T2 - Forest Products Journal
DA - 1999///
PY - 1999///
VL - 49
IS - 1
SP - 77-81
ER -
TY - JOUR
TI - A relaxed cutting plane algorithm for solving fuzzy inequality systems
AU - Hu, C.-F.
AU - Fang, Shu-Cherng
T2 - Optimization
AB - This paper studies a system of infinitely many fuzzy inequalities with concavemembership functions. By using the tolerance approach, we show that solving such system can be reduced to a semi-infinite programming problem. A relaxed cutting plane algorithm is proposed. In each iteration, we solve a finite convex optimization problem and add one or two more constraints. The proposed algorithm chooses a point at which the infinite constraints are violated to a degree rather than at which the violation is maximized. The iterative process ends when an optimal solution is identified. A convergence proof, under some mild conditions, is given. An efficient implementation based on the of centres with entropic regularization techniques is also included. Some computational results confirm the efficiency of the proposed method and show its potential for solving large scale problems.
DA - 1999///
PY - 1999///
DO - 10.1080/02331939908844428
VL - 45
IS - 1-4
SP - 89–106
ER -