TY - CHAP
TI - Production Engineering
AU - Uzsoy, R.
T2 - McGraw-Hill Encyclopedia of Science and Technology
PY - 1997///
ET - 8
PB - McGraw-Hill
ER -
TY - CONF
TI - Decomposition Methods for Scheduling Complex Job Shops
AU - Demirkol, E.
AU - Uzsoy, R.
T2 - INFORMS National Meeting
C2 - 1997/10//
CY - Atlanta, GA
DA - 1997/10//
PY - 1997/10//
ER -
TY - CONF
TI - Performance of Decomposition Methods for Complex Workshops Under Multiple Criteria
AU - Demirkol, E.
AU - Uzsoy, R.
T2 - 21st International Conference on Computers and Industrial Engineering
C2 - 1997/3//
C3 - Proceedings of the 21st International Conference on Computers and Industrial Engineering
CY - San Juan, PR
DA - 1997/3//
PY - 1997/3//
ER -
TY - JOUR
TI - Focusing Maintenance Improvement Efforts in a Wafer Fabrication Facility Operating Under Theory of Constraints
AU - Kayton, D.
AU - Teyner, T.
AU - Schwartz, C.
AU - Uzsoy, R.
T2 - Production and Inventory Management
DA - 1997///
PY - 1997///
IS - Fourth Quarter
SP - 51-57
ER -
TY - SOUND
TI - Dispatching and Maintenance Management in a Wafer Fab Operating Under Theory of Constraints
AU - Teyner, T.
AU - Uzsoy, R.
DA - 1997/1//
PY - 1997/1//
ER -
TY - SOUND
TI - Disassembly Configurations and Supply Chain Management for Companies with Product Recovery and Remanufacturing
AU - Uzsoy, R.
DA - 1997/9//
PY - 1997/9//
ER -
TY - SOUND
TI - Supply Chain Management in Electronics Manufacturing with Remanufacturing Capability
AU - Uzsoy, R.
DA - 1997/11//
PY - 1997/11//
ER -
TY - BOOK
TI - QTL Cartographer: a reference manual and tutorial for QTL mapping
AU - Basten, C.J.
AU - Weir, B.S.
AU - Zeng, Z.-B.
DA - 1997///
PY - 1997///
PB - Department of Statistics, NC State University
ER -
TY - CONF
TI - Spare parts inventory management for semiconductor wafer fabrication facilities
AU - Akcali, E.
AU - Hamlin, R.D.
AU - Teyner, T.
AU - Uzsoy, R.
AU - Venkatachalam, G.
T2 - 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings
AB - We consider the problem of managing spare parts inventories in a semiconductor wafer fabrication facility. We study the performance of four different inventory control policies using simulation and mathematical models. Preliminary results show that two of the models yield significant improvements over the current inventory management policy.
C2 - 1997///
C3 - 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings (Cat. No.97CH36023)
DA - 1997///
PY - 1997/10//
DO - 10.1109/issm.1997.664484
PB - IEEE
UR - http://dx.doi.org/10.1109/issm.1997.664484
ER -
TY - CONF
TI - Decomposition procedures for global scheduling of complex job shops
AU - Uzsoy, R.
AU - Wang, Cheng-Shuo
T2 - Twenty First IEEE/CPMT International Electronics Manufacturing Technology Symposium 1997 IEMT Symposium
AB - We describe a prototype decomposition procedure which uses global information on shop status to develop improved schedules for wafer fabrication facilities. The system studied contains reentrant product flows, multiple products and both unit capacity and batch machines. Preliminary experiments show that the decomposition procedure yields significantly better schedules in reasonable CPU times.
C2 - 1997///
C3 - Twenty First IEEE/CPMT International Electronics Manufacturing Technology Symposium Proceedings 1997 IEMT Symposium
DA - 1997///
PY - 1997/10//
DO - 10.1109/iemt.1997.626955
PB - IEEE
UR - http://dx.doi.org/10.1109/iemt.1997.626955
ER -
TY - CONF
TI - Production planning for companies with product recovery and remanufacturing capability
AU - Uzsoy, R.
T2 - 1997 IEEE International Symposium on Electronics and the Environment. ISEE-1997
AB - We present an integrated set of models addressing issues of production planning in supply chains involving product recovery and disassembly. The supply chain models can be used to develop production plans in the short term, or examine the effects of different strategies in the long term. Uncertainty is addressed by using deterministic models to solve a range of different scenarios. We also develop models to determine profitable disassembly configurations for single and multiple products. Results to date are reported and future directions discussed.
C2 - 1997///
C3 - Proceedings of the 1997 IEEE International Symposium on Electronics and the Environment. ISEE-1997
DA - 1997///
PY - 1997/5//
DO - 10.1109/isee.1997.605342
PB - IEEE
UR - http://dx.doi.org/10.1109/isee.1997.605342
ER -
TY - JOUR
TI - MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE
AU - Uzsoy, Reha
AU - Yang, Yaoyu
T2 - Production and Operations Management
AB - We study the problem of scheduling jobs on a single batch processing machine to minimize the total weighted completion time. A batch processing machine is one that can process a number of jobs simultaneously as a batch. The processing time of a batch is given by the processing time of the longest job in the batch. We present a branch and bound algorithm to obtain optimal solutions and develop lower bounds and dominance conditions. We also develop a number of heuristics and evaluate their performance through extensive computational experiments. Results show that two of the heuristics consistently generate high-quality solutions in modest CPU times.
DA - 1997///
PY - 1997///
DO - 10.1111/j.1937-5956.1997.tb00415.x
VL - 6
IS - 1
SP - 57-73
SN - 1059-1478
UR - http://dx.doi.org/10.1111/j.1937-5956.1997.tb00415.x
ER -
TY - JOUR
TI - Rescheduling on a Single Machine with Part Type Dependent Setup Times and Due Dates
AU - Tamer Unal, Ali
AU - Uzsoy, Reha
AU - Kiran, Ali S.
T2 - Annals of Operations Research
DA - 1997///
PY - 1997///
DO - 10.1023/a:1018955111939
VL - 70
SP - 93-113
SN - 0254-5330
UR - http://dx.doi.org/10.1023/a:1018955111939
ER -
TY - JOUR
TI - A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems
AU - Demirkol, Ebru
AU - Mehta, Sanjay
AU - Uzsoy, Reha
T2 - Journal of Heuristics
DA - 1997/11//
PY - 1997/11//
DO - 10.1023/a:1009627429878
VL - 3
IS - 2
SP - 111–137
SN - 1381-1231
UR - http://dx.doi.org/10.1023/a:1009627429878
ER -
TY - JOUR
TI - Alternative facility layouts for semiconductor wafer fabrication facilities
AU - Geiger, C.D.
AU - Hase, R.
AU - Takoudis, C.G.
AU - Uzsoy, R.
T2 - IEEE Transactions on Components, Packaging, and Manufacturing Technology: Part C
AB - Semiconductor wafer fabrication facilities are widely acknowledged to be among the most complicated industrial systems from a production planning and control point of view. The design of most wafer fabrication facilities has followed the process layout, where similar machines are located together. This feeds to complex, reentrant product flows through the facility. In this paper, we examine the effects on fab cycle time of a number of alternative layouts or machine dedication policies using a process for manufacturing three-dimensional (3-D) complementary metal-oxide-semiconductor (CMOS) devices as a research vehicle. We examine the performance of the layouts under different levels of machine breakdown, utilization, transfer time between stations, and setup times. Results show that cellular layouts, where machines are dedicated to a limited number of process steps, require more machinery but perform well when setup and transfer times are high and machinery is reliable. As machines become more unreliable, the flexibility of the process layouts becomes a major advantage. An interesting result is that the addition of modest amounts of extra capacity at critical workstations can significantly improve the cycle time performance of a fab.
DA - 1997/4//
PY - 1997/4//
DO - 10.1109/3476.622885
VL - 20
IS - 2
SP - 152-163
J2 - IEEE Trans. Comp., Packag., Manufact. Technol. C
OP -
SN - 1083-4400
UR - http://dx.doi.org/10.1109/3476.622885
DB - Crossref
ER -
TY - JOUR
TI - Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
AU - Chand, Suresh
AU - Traub, Rodney
AU - Uzsoy, Reha
T2 - Annals of Operations Research
DA - 1997/4//
PY - 1997/4//
DO - 10.1023/a:1018961818782
VL - 70
SP - 115–125
SN - 0254-5330
UR - http://dx.doi.org/10.1023/a:1018961818782
KW - scheduling
KW - dynamic arrivals
KW - heuristics
KW - rolling horizon procedure
ER -
TY - JOUR
TI - A Tabu search approach to scheduling an automated wet etch station
AU - Geiger, Christopher D.
AU - Kempf, Karl G.
AU - Uzsoy, Reha
T2 - Journal of Manufacturing Systems
AB - Abstract This paper addresses a production scheduling problem arising at the wet etching process in a semiconductor wafer fabrication facility. Material handling capacity, material processing constraints, and mixed storage policies are considered in formulating the problem as a flow shop sequencing problem with the objective of minimizing makespan (Cmax). Efficient heuristics and a tabu search procedure are developed to generate high-quality solutions in reasonable computational time. Extensive computational experiments evaluating the performance of the heuristics are reported.
DA - 1997/1//
PY - 1997/1//
DO - 10.1016/s0278-6125(97)85674-9
VL - 16
IS - 2
SP - 102-116
J2 - Journal of Manufacturing Systems
LA - en
OP -
SN - 0278-6125
UR - http://dx.doi.org/10.1016/s0278-6125(97)85674-9
DB - Crossref
KW - scheduling
KW - semiconductor manufacturing
KW - heuristics
KW - flow Shop
KW - robotic workcells
ER -
TY - JOUR
TI - Immersed interface methods for moving interface problems
AU - Li, Zhilin
T2 - Numerical Algorithms
DA - 1997/5//
PY - 1997/5//
DO - 10.1023/A:1019173215885
VL - 14
SP - 269–293
KW - immersed interface method
KW - Stefan problem
KW - moving interface
KW - discontinuous coefficients
KW - singular source term
KW - immersed boundary method
KW - Cartesian grid
KW - heat conduction
ER -
TY - JOUR
TI - Front fixing vs. front tracking for diffusive transport with moving boundaries
AU - Heine, J. T.
AU - Li, Zhilin
AU - McTigue, D. F.
T2 - International Journal for Numerical & Analytical Methods in Geomechanics
DA - 1997///
PY - 1997///
VL - 21
SP - 653–662
ER -
TY - JOUR
TI - An Inverse Problem in a Parabolic Equation
AU - Li, Zhilin
AU - Zheng, K
T2 - Electronic Journal of Differential Equations
DA - 1997///
PY - 1997///
VL - 1
SP - 193–199
ER -
TY - JOUR
TI - Multiobjective stochastic scheduling of job ready times
AU - Stanfield, P.M.
AU - King, R.E.
AU - Hodgson, T.J.
T2 - Annals of Operations Research
DA - 1997///
PY - 1997///
DO - 10.1023/A:1018974221508
VL - 70
SP - 221–239
ER -
TY - CONF
TI - Mixed symbolic-numerical computations with general DAEs
AU - Campbell, Stephen L.
AU - Hollenbeck, R.
AU - Marszalek, W.
T2 - Symposium on Differential Algebraic Equations
C2 - 1997///
C3 - Proceedings of the Symposium on Differential-Algebraic Equations: Algebraic and Numerical Aspects
CY - Grenoble, France
DA - 1997///
PY - 1997/5/26/
SP - 23–34
ER -
TY - JOUR
TI - Observer design for linear time varying descriptor systems
AU - Campbell, Stephen L.
AU - Delebecque, F.
AU - Nikoukhah, R.
T2 - Proceedings of the Control Industrial Systems
DA - 1997///
PY - 1997///
VL - 1
SP - 507–512
ER -
TY - CONF
TI - Computer-Aided Design of Sawing Patterns: Evaluating Profit Before the First Log is Cut
AU - Roise, J.P.
T2 - Southern Forest Products Association - EXPO ’97
C2 - 1997/6/26/
CY - Atlanta, Georgia
DA - 1997/6/26/
PY - 1997/6/26/
ER -
TY - CONF
TI - The Pipeline problem: A Tactical Level Approach Linking Forest Level Planning to Project Planning
AU - Roise, J.P.
AU - Hayden, Lawrence
T2 - Seventh Symposium on Systems Analysis in Forest Resources
C2 - 1997/5/28/
CY - St. Paul, MN
DA - 1997/5/28/
PY - 1997/5/28/
PB - USDA Forest Service, Gen
UR - https://www.nrs.fs.fed.us/pubs/gtr/other/gtr-nc205/pdffiles/P73.pdf
ER -
TY - CONF
TI - Simulated Adaptive Management for Timber and Wildlife Under Uncertainty
AU - Hughell, D.
AU - Roise, J.P.
T2 - Seventh Symposium on Systems Analysis in Forest Resources
C2 - 1997/5/28/
CY - St. Paul, MN
DA - 1997/5/28/
PY - 1997/5/28/
PB - USDA Forest Service, Gen
UR - https://www.nrs.fs.fed.us/pubs/gtr/other/gtr-nc205/pdffiles/p56.pdf
ER -
TY - CONF
TI - Analysis of Road Locations in Wetlands and Mitigation Bank Development
AU - Roise, J.P.
AU - Gainey, K.
T2 - Seventh Symposium on Systems Analysis in Forest Resources
A2 - Vasievich, J. Michael
A2 - Fried, Jeremy S.
A2 - Leefers, Larry A.
AB - This international symposium included presentations by representatives from government, academic, and private institutions. Topics covered management objectives; information systems: modeling, optimization, simulation and decision support techniques; spatial methods; timber supply; and economic and operational analyses.
C2 - 1997/5/28/
CY - Traverse City, MI.
DA - 1997/5/28/
PY - 1997/5/28/
DO - 10.2737/NC-GTR-205
M1 - NC-205
PB - United States Department of Agriculture, Forest Service, North Central Forest Experiment Station
UR - https://www.nrs.fs.fed.us/pubs/gtr/other/gtr-nc205/pdffiles/p72.PDF
ER -
TY - BOOK
TI - Fuzzy Mathematics and Optimization
AU - Wang, D.
AU - Fang, S.
DA - 1997///
PY - 1997///
PB - Science Press
SN - 7-03-005829-1
ER -
TY - RPRT
TI - If a matrix has a single eigenvalue, how sensitive is this eigenvalue?
AU - Cho, G.E.
AU - Ipsen, I.C.F.
A3 - Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University
DA - 1997///
PY - 1997///
M1 - CRSC-TR97-20
M3 - Technical Report
PB - Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University
SN - CRSC-TR97-20
ER -
TY - JOUR
TI - Immersed Interface Methods for Stokes Flow with Elastic Boundaries or Surface Tension
AU - LeVeque, Randall J.
AU - Li, Zhilin
T2 - SIAM Journal on Scientific Computing
AB - A second-order accurate interface tracking method for the solution of incompressible Stokes flow problems with moving interfaces on a uniform Cartesian grid is presented. The interface may consist of an elastic boundary immersed in the fluid or an interface between two different fluids. The interface is represented by a cubic spline along which the singularly supported elastic or surface tension force can be computed. The Stokes equations are then discretized using the second-order accurate finite difference methods for elliptic equations with singular sources developed in our previous paper [SIAM J. Numer. Anal., 31(1994), pp. 1019--1044]. The resulting velocities are interpolated to the interface to determine the motion of the interface. An implicit quasi-Newton method is developed that allows reasonable time steps to be used.
DA - 1997/5//
PY - 1997/5//
DO - 10.1137/s1064827595282532
VL - 18
IS - 3
SP - 709-735
J2 - SIAM J. Sci. Comput.
LA - en
OP -
SN - 1064-8275 1095-7197
UR - http://dx.doi.org/10.1137/s1064827595282532
DB - Crossref
KW - Stokes flow
KW - creeping flow
KW - interface tracking
KW - discontinuous coefficients
KW - immersed interface methods
KW - Cartesian grids
KW - bubbles
ER -
TY - JOUR
TI - Success factors for integrating suppliers into new product development
AU - Ragatz, Gary L.
AU - Handfield, Robert B.
AU - Scannell, Thomas V.
T2 - Journal of Product Innovation Management
AB - Faster, better, cheaper—these marching orders summarize the challenge facing new product development (NPD). In other words, NPD teams must find the means for speeding time to market while also improving product quality and reducing product costs. Cross-functional teams have proved effective for meeting these challenges, and such teams may extend beyond company boundaries to include key materials suppliers. Effective integration of suppliers into NPD can yield such benefits as reduced cost and improved quality of purchased materials, reduced product development time, and improved access to and application of technology. As Gary Ragatz, Robert Handfield, and Thomas Scannell point out, however, those benefits do not automatically accrue to any NPD team that includes representatives from a supplier's company. In a study of 60 member companies from the Michigan State University Global Procurement and Supply Chain Electronic Benchmarking Network, they explore the management practices and the environmental factors that relate most closely to successful integration of suppliers into the NPD process. The study identifies supplier membership on the NPD project team as the greatest differentiator between most and least successful integration efforts. Although the respondents reported only moderate use of shared education and training, the study cites this management factor as another significant differentiator between most and least successful efforts. Respondents listed direct, cross-functional, intercompany communication as the most widely used technique for integrating suppliers into NPD. To integrate suppliers into NPD, a company must overcome such barriers as resistance to sharing proprietary information, and the not-invented-here syndrome. The results of this study suggest that overcoming such barriers depends on relationship structuring—that is, shared education and training, formal trust development processes, formalized risk/reward sharing agreements, joint agreement on performance measurements, top management commitment from both companies, and confidence in the supplier's capabilities. Overcoming these barriers also depends on assett sharing, including intellectual assets such as customer requirements, technology information, and cross-functional communication; physical assets such as linked information systems, technology, and shared plant and equipment; and human assets such as supplier participation on the project team and co-location of personnel.
DA - 1997///
PY - 1997///
DO - 10.1016/S0737-6782(97)00007-6
VL - 14
IS - 3
SP - 190-202
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031144295&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Just-in-time and logistics in global sourcing: An empirical study
AU - Das, A.
AU - Handfield, R.B.
T2 - International Journal of Physical Distribution & Logistics Management
AB - Just‐in‐time (JIT) has been written about since the early 1970s. Studies have investigated the growth of JIT sourcing and its implications. However, there has not been as much discussion of the issues faced by companies involved in the pursuit of JIT sourcing in a global supply chain. Undertakes a systematic review of the JIT sourcing and logistics literature and highlights key findings. Notes a number of key problems and best practice issues in the area, followed by an empirical examination of the potential benefits of adopting JIT policies in global sourcing and logistics relative to non‐JIT global buyers. Compares results attained with those of a group of buyers employing JIT sourcing and domestic suppliers. Significant differences in a number of performance areas are found in the sourcing and logistics practices between companies following JIT practices with their global suppliers, as compared to companies not doing so. Finds that some aspects of domestic JIT sourcing and logistics are applicable across borders, while others are not. Concludes with a research agenda for future investigations in the area.
DA - 1997///
PY - 1997///
DO - 10.1108/09600039710170601
VL - 27
IS - 3-4
SP - 244-259
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84986076270&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Success factors for integrating suppliers into new product development
AU - Ragatz, G.L.
AU - Handfield, R.B.
AU - Scannell, T.V.
T2 - Journal of Product Innovation Management
AB - Abstract Faster, better, cheaper—these marching orders summarize the challenge facing new product development (NPD). In other words, NPD teams must find the means for speeding time to market while also improving product quality and reducting product costs. Cross-functional teams have proved effective for meeting these challenges, and such teams may extend beyond company boundaries to include key materials suppliers. Effective integration of suppliers into NPD can yield such benefits as reduced cost and improved quality of purchased materials, reduced product development time, and improved access to and application of technology. As Gary Ragatz, Robert Handfield, and Thomas Scannell point out, however, those benefits do not automatically accrue to any NPD team that includes representatives from a supplier's company. In a study of 60 member companies from the Michigan State University Global Procurement and Supply Chain Electronic Benchmarking Network, they explore the management practices and the environmental factors that relate most closely to successful integration of suppliers into the NPD process. The study identifies supplier membership on the NPD project team as the greatest differentiator between most and least successful integration efforts. Although the respondents reported only moderate use of shared education and training, the study cites this management factor as another significant differentiator between most and least successful efforts. Respondents listed direct, cross-functional, intercompany communication as the most widely used technique for integrating suppliers into NPD. To integrate suppliers into NPD, a company must overcome such barriers as resistance to sharing proprietary information, and the not-invented-here syndrome. The results of this study suggest that overcoming such barriers depends on relationship structuring—that is, shared education and training, formal trust development processes, formalized risk/reward sharing agreements, joint agreement on performance measurements, top management commitment from both companies, and confidence in the supplier's capabilities. Overcoming these barriers also depends on assett sharing, including intellectual assets such as customer requirements, technology information, and cross-functional communication; physical assets such as linked information systems, technology, and shared plant and equipment; and human assets such as supplier participation on the project team and co-location of personnel.
DA - 1997///
PY - 1997///
DO - 10.1111/1540-5885.1430190
VL - 14
IS - 3
SP - 190-202
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85088544895&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A meta-analysis of doctoral dissertations in purchasing
AU - Das, A.
AU - Handfield, R.B.
T2 - Journal of Operations Management
AB - Purchasing, as a distinct business function, has grown immensely in strategic stature over the past decade. However, the academic development of the field has not paralleled this turn of events. While the academic evolution of any field can be assessed in a variety of ways, doctoral dissertation research provides a useful method of evaluating the intellectual health of a discipline. We analyze doctoral dissertation research in the field of purchasing since 1987, identify key areas of study, examine shifts in topical coverage, evaluate methodological sophistication and the extent of theory development and discuss gaps in research areas. We find that dissertation research in purchasing is still largely exploratory, lacking in dominant paradigms and unifying theories. On a more positive note, our analysis reveals an encouraging trend towards causal and confirmatory research designs and the growing use of organizational, marketing and economic theory to explain purchasing phenomena.
DA - 1997///
PY - 1997///
DO - 10.1016/S0272-6963(96)00101-5
VL - 15
IS - 2
SP - 101-121
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031142739&partnerID=MN8TOARS
ER -
TY - JOUR
TI - 'Green' value chain practices in the furniture industry
AU - Handfield, R.B.
AU - Walton, S.V.
AU - Seegers, L.K.
AU - Melnyk, S.A.
T2 - Journal of Operations Management
AB - Abstract This paper draws on the results of interviews with five environmental managers in the furniture industry to develop a taxonomy of environmentally-friendly (‘green’) best practices within the operations management value chain. This taxonomy is then extended to develop a group of propositions concerning the role of management in promoting environmentally-friendly practices. The results suggest that in order to be successful, environmental management strategies must be integrated into all stages of the value chain, which includes all of the processes spanning product design, procurement, manufacturing and assembly, packaging, logistics, and distribution. While the potential for environmental performance improvement in all five of the companies is evident, all of them demonstrated ‘pockets’ of environmentally-friendly practices (EFP) in different areas of their respective value chain functions. The propositions and results emerging from the analysis also suggests that reacting to regulations is no longer sufficient. World-class EFP must anticipate and pre-empt changing environmental regulations and customer expectations, and proactively prepare products, processes and infrastructure for these changes without sacrificing competitive advantage.
DA - 1997///
PY - 1997///
DO - 10.1016/S0272-6963(97)00004-1
VL - 15
IS - 4
SP - 293-315
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031276763&partnerID=MN8TOARS
ER -
TY - CONF
TI - Proceedings of the 2nd IFCIS International Conference on Cooperative Information Systems (CoopIS).
A2 - Chen, Arbee L.P.
A2 - Klas, Wolfgang
A2 - Singh, Munindar P.
C2 - 1997///
DA - 1997///
PB - IEEE Computer Society Press
ER -
TY - CONF
TI - Interaction-Oriented Programming for the Web
AU - Singh, M.
T2 - Second IFCIS International Conference on Cooperative Information Systems, CoopIS'97
A2 - Chen, Arbee L. P.
A2 - Singh, Munindar P.
A2 - Klas, Wolfgang
C2 - 1997/6//
C3 - Proceedings of the second IFCIS International Conference on Cooperative Information Systems, CoopIS'97 : Kiawah Island, South Carolina, June 24-27, 1997.
CY - Kiawah Island, South Carolina
DA - 1997/6//
PY - 1997/6/24/
PB - IEEE Computer Society
SN - 9780818679469
ER -
TY - CONF
TI - On the Temporal Structure of Events
AU - Singh, Mona
AU - Singh, Munindar P.
C2 - 1997/7//
C3 - Proceedings of the AAAI Workshop on Spatial and Temporal Reasoning
DA - 1997/7//
SP - 1–8
ER -
TY - CONF
TI - Enhancing Conversational Moves for Portable Dialogue Systems
AU - Singh, Mona
AU - Barnett, James
AU - Singh, Munindar P.
A2 - Traum, David
C2 - 1997/11//
C3 - Working Notes of the AAAI Fall Symposium on Communicative Action in Humans and Machines
DA - 1997/11//
SP - 90–96
PB - AAAI
UR - http://www.csc.ncsu.edu/faculty/mpsingh/ms/interfaces/c-moves.pdf
ER -
TY - CONF
TI - A Comparison of Workflow Metamodels
AU - Lei, Yu
AU - Singh, Munindar P.
C2 - 1997/11//
C3 - Proceedings of the ER-97 Workshop on Behavioral Modeling and Design Transformations: Issues and Opportunities in Conceptual Modeling
DA - 1997/11//
SP - 1–12
ER -
TY - JOUR
TI - A Hybrid Method for Moving Interface Problems with Application to the Hele–Shaw Flow
AU - Hou, Thomas Y.
AU - Li, Zhilin
AU - Osher, Stanley
AU - Zhao, Hongkai
T2 - Journal of Computational Physics
AB - In this paper, a hybrid approach which combines theimmersed interface methodwith thelevel set approachis presented. The fast version of the immersed interface method is used to solve the differential equations whose solutions and their derivatives may be discontinuous across the interfaces due to the discontinuity of the coefficients or/and singular sources along the interfaces. The moving interfaces then are updated using the newly developed fast level set formulation which involves computation only inside some small tubes containing the interfaces. This method combines the advantage of the two approaches and gives a second-order Eulerian discretization for interface problems. Several key steps in the implementation are addressed in detail. This new approach is then applied to Hele?Shaw flow, an unstable flow involving two fluids with very different viscosity.
DA - 1997/7//
PY - 1997/7//
DO - 10.1006/jcph.1997.5689
VL - 134
IS - 2
SP - 236-252
J2 - Journal of Computational Physics
LA - en
OP -
SN - 0021-9991
UR - http://dx.doi.org/10.1006/jcph.1997.5689
DB - Crossref
ER -
TY - CHAP
TI - Automating spoken dialogue systems
AU - Singh, Mona
AU - Barnett, James
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Spoken dialogue interfaces apply in a number of applications. Engaging in meaningful conversation presupposes the ability to recognize and generate different conversational moves, and to adaptively carry on a dialogue. Although the portability of dialogue interfaces is highly desirable, few current approaches address it seriously.We describe a portable toolkit for constructing spoken dialogue interfaces. We present the representations and techniques used to customize an interface to a particular domain and application. Our approach relies on shallow knowledge of the domain, and interprets a rule-based model of the dialogue.
PY - 1997///
DO - 10.1007/3-540-63614-5_20
SP - 207-216
OP -
PB - Springer Berlin Heidelberg
SN - 9783540636144 9783540696124
UR - http://dx.doi.org/10.1007/3-540-63614-5_20
DB - Crossref
ER -
TY - JOUR
TI - Autonomous mobile robot global motion planning and geometric beacon collection using traversability vectors
AU - Janét, J.A.
AU - Luo, R.C.
AU - Kay, M.G.
T2 - IEEE Transactions on Robotics and Automation
AB - Approaches in global motion planning (GMP) and geometric beacon collection (for self-localization) using traversability vectors have been developed and implemented in both computer simulation and actual experiments on mobile robots. Both approaches are based on the same simple, modular, and multifunctional traversability vector (t-vector). Through implementation it has been found that t-vectors reduce the computational requirements to detect path obstructions, Euclidean optimal via-points, and geometric beacons, as well as to identify which features are visible to sensors. Environments can be static or dynamic and polygons are permitted to overlap (i.e., intersect or be nested). While the t-vector model does require that polygons be convex, it is a much simpler matter to decompose concave polygons into convex polygon sets than it is to require that polygons not overlap, which is required for many other GMP models. T-vectors also reduce the data size and complexity of standard V-graphs and variations thereof. This paper presents the t-vector model so that the reader can apply it to mobile robot GMP and self-localization.
DA - 1997///
PY - 1997///
DO - 10.1109/70.554354
VL - 13
IS - 1
SP - 132-140
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031077257&partnerID=MN8TOARS
KW - computational geometry collision detection
KW - geometric beacon detection/collection
KW - mobile robot
KW - motion planning
KW - range sensor prediction
KW - self-localization
ER -
TY - CONF
TI - Multi-layered fuzzy behavior fusion for reactive control of an autonomous mobile robot
AU - Goodridge, Steven G.
AU - Kay, Michael G.
AU - Luo, Ren C.
C2 - 1997///
C3 - IEEE International Conference on Fuzzy Systems
DA - 1997///
VL - 1
SP - 579-584
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0030660961&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Dynamic lot size/sequencing policies in a multi-product, single-machine system
AU - Hodgson, Thom J.
AU - Ge, Gang
AU - King, Russell E.
AU - Said, Hamdy
T2 - IIE Transactions
AB - This paper is concerned with the modeling and analysis of a single-machine, multi-product, integrated production-inventory system. A semi-Markov model is developed that incorporates a state-dependent control system. Control optimization is achieved through the use of Markov-renewal programming. Three- and four-product models are developed. The model(s) are exercised over a range of parameters in order to determine the characteristics of the system, and to identify the structure of the optimal control rules of the system. The result is that one can identify simple basic rules of operation that are near-optimal in a dynamic environment, and that make sense intuitively.
DA - 1997/2//
PY - 1997/2//
DO - 10.1080/07408179708966320
VL - 29
IS - 2
SP - 127-137
J2 - IIE Transactions
LA - en
OP -
SN - 0740-817X 1545-8830
UR - http://dx.doi.org/10.1080/07408179708966320
DB - Crossref
ER -
TY - JOUR
TI - Quality of service and scientific workflows
T2 - Quality of Numerical Software - Assessment and Enhancement
AB - The advent of high-performance computing engines and networks is bringing serious numerical and problem-solving environments (PSEs) closer to a broad base of users with widely differing needs. From the perspective of these users, a key issue will be the quality of service (QoS) PSEs offer. In the broader sense, QoS includes parameters such as network delays and throughput, as well as end-user quality factors such as system availability, system functionality, content quality, and semantic interoperability. In order to facilitate integration of the QoS and PSE we introduce scientific workflows, to mean a series of structured activities and computations that arise in scientific problem-solving. Scientific workflows are expected to coexist and cooperate with other user workflows (e.g., business workflows, educational workflows, legislative workflows). As such they must support compatible QoS. We use data from existing systems and workflows to quantitatively bound some of the PSE QoS parameters. Use of multimedia imposes additional restrictions, while end-user risks impose bounds on the security and reliability of numerical computations and algorithms It is our belief that the next generation of PSEs must have QoS parameters designed into the system, or these PSEs will fail to live up to user needs and expectations.Key WordsQuality of serviceQoSproblem solving environmentPSEscientific workflowreliabilityavailabilityintra- and inter-net response delaysusersactivity management
DA - 1997///
PY - 1997///
DO - 10.1007/978-1-5041-2940-4_6
UR - https://publons.com/publon/21294552/
ER -
TY - JOUR
TI - Using spheres of commitment to support virtual enterprises
T2 - ADVANCES IN CONCURRENT ENGINEERING: CE97
DA - 1997///
PY - 1997///
UR - https://publons.com/publon/21294551/
ER -
TY - JOUR
TI - The next big thing: Position statements
T2 - IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2
DA - 1997///
PY - 1997///
UR - https://publons.com/publon/21294547/
ER -
TY - CONF
TI - The next big thing: Position statements
AU - Singh, M.P.
AU - Bobrow, D.G.
AU - Huhns, M.N.
AU - King, M.
AU - Kitano, H.
AU - Reiter, R.
C2 - 1997///
C3 - IJCAI International Joint Conference on Artificial Intelligence
DA - 1997///
VL - 2
SP - 1511-1522
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0347016528&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Conversational agents
AU - Huhns, M.N.
AU - Singh, M.P.
T2 - IEEE Internet Computing
DA - 1997///
PY - 1997///
VL - 1
IS - 2
SP - 73-77
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0344688730&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Commitments among autonomous agents in information-rich environments
T2 - Multi-agent Rationality
AB - Commitments are crucial to understanding and designing autonomous agents and multiagent systems. We propose a definition of commitments that applies especially well to agents in information-rich applications, such as electronic commerce and virtual enterprises. Our approach has a number of important features, including not gratuitously translating social concepts to psychological concepts distinguishing between satisfied and inapplicable commitments incorporating social policies to handle the creation, satisfaction, and cancelation of commitments relating commitments to organizational structure in a multiagent system showing how commitments are acquired by agents as a consequence of adopting a role. KeywordsMultiagent SystemContext GroupVirtual EnterpriseTransaction ModelGlobal TransactionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
DA - 1997///
PY - 1997///
DO - 10.1007/3-540-63077-5_31
UR - https://publons.com/publon/21294549/
ER -
TY - BOOK
TI - Challenges for machine learning in cooperative information systems
AU - Singh, M.P.
AU - Huhns, M.N.
AB - Cooperative Information Systems (CISs) are multiagent systems with organizational and database abstractions geared to the large open heterogeneous information environments of today. CIS is also the name of the associated research area, which has emerged from the synthesis of distributed databases and distributed artificial intelligence. In CIS, software agents mitigate an information environment's heterogeneity by interacting through common protocols, and manage its large size by making intelligent local decisions without centralized control. In order to cope with the dynamism presented by open environments, CIS agents must have the ability to adapt and learn. We discuss some of the most important problems involving learning and adaptivity in CISs, including requirements for reconciling semantics and improving coordination. We present a “customers' view” of learning technology as might find ready application in CISs.
DA - 1997///
PY - 1997///
DO - 10.1007/3-540-62934-3_38
VL - 1221 LNAI
SE - 11-24
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84890670719&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Automating spoken dialogue systems
AU - Singh, M.
AU - Barnett, J.
AU - Singh, M.P.
DA - 1997///
PY - 1997///
VL - 1325
SE - 207-216
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84947715567&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Agents on the Web: The agent test
AU - Huhns, M.N.
AU - Singh, M.P.
T2 - IEEE Internet Computing
AB - The authors consider agents on the World Wide Web, including information retrieval agents. They propose a test for agenthood, involving communication in multi-agent systems.
DA - 1997///
PY - 1997///
DO - 10.1109/4236.623972
VL - 1
IS - 5
SP - 78-79
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-5344277607&partnerID=MN8TOARS
ER -
TY - RPRT
TI - Optimal Design of High Speed Mechanical Systems
AU - David, J W
AU - Cheng, C Y
AU - Choi, T D
AU - Kelley, C T
AU - Gablonsky, J
A3 - North Carolina State University, Center for Research in Scientific Computation
DA - 1997/7//
PY - 1997/7//
M1 - CRSC-TR97-18
PB - North Carolina State University, Center for Research in Scientific Computation
SN - CRSC-TR97-18
ER -
TY - JOUR
TI - Damage Detection as Inverse Problems for Distributed Parameter Systems: Computational Approaches
AU - Banks, H.T.
AU - Smith, R.C.
AU - Zhang, Y.
T2 - International Journal of Applied Electromagnetics and Mechanics
DA - 1997///
PY - 1997///
VL - 8
SP - 61–76
ER -
TY - JOUR
TI - Numerical Recovery of Material Parameters in Euler-Bernoulli Beam Models
AU - Smith, R.C.
AU - Bowers, K.L.
AU - Vogel, C.R.
T2 - Journal of Mathematical Systems, Estimation and Control
DA - 1997///
PY - 1997///
VL - 7
IS - 2
SP - 157–195
ER -
TY - JOUR
TI - A Galerkin Method for Linear PDE Systems in Circular Geometries with Structural Acoustic Problems
AU - Smith, Ralph C.
T2 - SIAM Journal on Scientific Computing
AB - A Galerkin method for systems of PDEs in circular geometries is presented with motivating problems being drawn from structural, acoustic, and structural acoustic applications. Depending upon the application under consideration, piecewise splines or Legendre polynomials are used when approximating the system dynamics with modifications included to incorporate the analytic solution decay near the coordinate singularity. This provides an efficient method which retains its accuracy throughout the circular domain without degradation at the singularity. Because the problems under consideration are linear or weakly nonlinear with constant or piecewise constant coefficients, transform methods for the problems are not investigated. While the specific method is developed for the 2-D wave equation on a circular domain and the equation of transverse motion for a thin circular plate, examples demonstrating the extension of the techniques to a fully coupled structural acoustic system are used to illustrate the flexibility of the method when approximating the dynamics of more complex systems.
DA - 1997/3//
PY - 1997/3//
DO - 10.1137/s1064827594268531
VL - 18
IS - 2
SP - 371-402
J2 - SIAM J. Sci. Comput.
LA - en
OP -
SN - 1064-8275 1095-7197
UR - http://dx.doi.org/10.1137/s1064827594268531
DB - Crossref
KW - Galerkin method
KW - PDEs in circular geometries
KW - structural acoustics
ER -
TY - JOUR
TI - THE ESTIMATION OF MATERIAL AND PATCH PARAMETERS IN A PDE-BASED CIRCULAR PLATE MODEL
AU - Banks, H.T.
AU - Smith, R.C.
AU - Brown, D.E.
AU - Metcalf, V.L.
AU - Silcox, R.J.
T2 - Journal of Sound and Vibration
AB - The estimation of material and patch parameters for a system involving a circular plate, to which piezoceramic patches are bonded, is considered. A partial differential equation (PDE) model for the thin circular plate is used with the passive and active contributions form the patches included in the internal and external bending moments. This model contains piecewise constant parameters describing the density, flexural rigidity, Poisson ratio, and Kelvin-Voigt damping for the system as well as patch constants and a coefficient for viscous air damping. Examples demonstrating the estimation of these parameters with experimental acceleration data and a variety of inputs to the experimental plate are presented. By using a physically-derived PDE model to describe the system, parameter sets consistent across experiments are obtained, even when phenomena such as damping due to electric circuits affect the system dynamics.
DA - 1997/2//
PY - 1997/2//
DO - 10.1006/jsvi.1996.0649
VL - 199
IS - 5
SP - 777-799
J2 - Journal of Sound and Vibration
LA - en
OP -
SN - 0022-460X
UR - http://dx.doi.org/10.1006/jsvi.1996.0649
DB - Crossref
ER -
TY - JOUR
TI - The Pipeline Problem: Scheduling Project Plans
AU - Roise, J.P.
AU - Hayden, L.
T2 - Analysis Notes
DA - 1997///
PY - 1997///
VL - 7
IS - 2
SP - 16–21
ER -
TY - CONF
TI - An introduction to object-oriented simulation in C++
AU - Joines, Jeffrey A.
AU - Roberts, Stephen D.
AB - An object-oriented simulation (OOS) consists of a set of objects that interact with each other over time. This p aper provides a thorough introduction to OOS, addresses the important issue of composition versus inheritance, describes frames and frameworks for OOS, and presents an example of a network simulation language as an i llustration of OOS.
C2 - 1997///
C3 - Proceedings of the 29th conference on Winter simulation - WSC '97
DA - 1997///
DO - 10.1145/268437.268453
PB - ACM Press
ER -
TY - JOUR
TI - Modeling and verifying active structural control systems
T2 - Science of Computer Programming
DA - 1997///
PY - 1997///
VL - 29
IS - 1-2
SP - 99-122
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031185496&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A mathematical programming approach for generating alternatives in discrete structural optimization
T2 - Engineering Optimization
DA - 1997///
PY - 1997///
VL - 28
IS - 1-2
SP - 1-31
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0030703305&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Will the casual trend continue? Modeling of US men's apparel sales, 1990-96
AU - Suh, MW
AU - Funderburk, RE
T2 - JOURNAL OF THE TEXTILE INSTITUTE
AB - Since the late 1980s the buzz-word in the men's apparel industry has been casual. Tailored suits and coats have been replaced in the office by jeans, slacks and sport shirts. The evolution of this trend by itself is fascinating, but perhaps most important is the future direction of the evolving phenomenon. This paper presents a statistical methodology based on the use of indicator variables and time trend to model and forecast sales of various men's apparel items in order to determine the future direction of the casual trend in the United States.
DA - 1997///
PY - 1997///
DO - 10.1080/00405009708658573
VL - 88
IS - 1
SP - 82-97
SN - 0040-5000
ER -
TY - JOUR
TI - Generalized polynomial bases and the Bezoutian
AU - Mani, V
AU - Hartwig, RE
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - A foundation polynomial is used to induce polynomial bases for F n −1 [ x ], the vector space of polynomials of degree less than n over an arbitrary field F. The associated bases are then used to block diagonalize the Bezout matrix of two polynomials under congruence.
DA - 1997/1/15/
PY - 1997/1/15/
DO - 10.1016/0024-3795(95)00585-4
VL - 251
SP - 293-320
SN - 0024-3795
ER -
TY - JOUR
TI - Conduct, misconduct, and cargo cult science
AU - Wilson, , JR
T2 - PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE
DA - 1997///
PY - 1997///
DO - 10.1145/268437.268790
SP - 1405-1413
ER -
TY - JOUR
TI - Spinning quality/process improvement through variance tolerancing
AU - Suh, M. W.
AU - Woo, J. L.
AU - Koo, H. J.
T2 - Beltwide Cotton Conferences. Proceedings
DA - 1997///
PY - 1997///
VL - 1
IS - 1997
SP - 691-696
ER -
TY - JOUR
TI - Semantic validation of product and process models
AU - Baugh, J. W.
AU - Chadha, H. S.
T2 - Journal of Computing in Civil Engineering
AB - This paper describes the use of equational specifications and process algebras in developing product and process models. These formal approaches enable an abstract and precise description of products, where both syntactic and semantic checks are used for validation. In addition, refinement methodologies are provided that relate the abstract specifications to implementations in data modeling languages such as EXPRESS. We show how these formal approaches, initially designed for specifying software and hardware modules, relate to current standards and research in product and process modeling. Our approach is illustrated with examples of both product and process modeling. The general architecture engineering and construction reference model (GARM) is modeled in an equational style using the Larch family of specification languages. The partitioned engineering data flow model (PANDA), a graphical approach for describing process models in facility engineering, is modeled as a process algebraic system in calculus of communicating systems (CCS). Both examples are validated by proving that they satisfy certain syntactic and semantic properties.
DA - 1997///
PY - 1997///
DO - 10.1061/(ASCE)0887-3801(1997)11:1(26)
VL - 11
IS - 1
SP - 26-36
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0343536396&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Limit theorems and a general framework for risk analysis in clonal forestry
AU - Bishir, J
AU - Roberds, J
T2 - MATHEMATICAL BIOSCIENCES
AB - Use of clonally propagated plantings in reforestation offers management advantages of phenotypic uniformity and high yields. Disadvantages include low genetic diversity and the possibility that the clone or clones chosen are particularly susceptible to attack by an insect or pathogen unforeseen as a problem at the time of clonal selection. In this paper, we continue consideration of the problem of choosing an optimal number of clones to minimize the risk of plantation failure. We present an analysis in which risk of failure for a plantation is represented by the probability that the proportion, S, of ramets that survive until harvest is less than or equal to a prescribed value. Our approach includes most earlier treatments as special cases. We show that the proportion S converges in distribution and, furthermore, that, under general conditions, a moderate number of clones, usually no more than 20 to 40 and often fewer, provides equivalent or better protection against catastrophic loss than does a large number of clones.
DA - 1997/5//
PY - 1997/5//
DO - 10.1016/S0025-5564(96)00184-8
VL - 142
IS - 1
SP - 1-11
SN - 0025-5564
ER -
TY - CONF
TI - A neural network approach to solving convex programming problems
AU - Fang, S.-C.
AU - Chen, Y.-H.
C2 - 1997///
C3 - Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing
DA - 1997///
VL - 2
SP - 215-218
PB - Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory
ER -
TY - JOUR
TI - A global-filtering algorithm for linear programming problems with stochastic elements
AU - Wang, D. W.
AU - Fang, S. C.
T2 - IEEE Transactions on Systems, Man, and Cybernetics. Part A, Systems and Humans
DA - 1997///
PY - 1997///
VL - 27
IS - 5
SP - 636-645
ER -
TY - CONF
TI - A fuzzy-control-based quick response reorder scheme for retailing of seasonal apparel
AU - Fang, S.-C.
AU - Chen, T.-W.
AU - Nuttle, H.L.W.
AU - King, R. E.
C2 - 1997///
C3 - Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing
DA - 1997///
VL - 2
SP - 300-303
PB - Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory
ER -
TY - BOOK
TI - Mo hu shu hsueh yu mo hu yiu hua=Fuzzy mathematics and optimization
AU - Fang, S. C.
AU - Wang, D. C.
CN - QA248.5 .F36 1997
DA - 1997///
PY - 1997///
PB - Beijing, China: Ko hsueh chu pan she
SN - 7030058291
ER -
TY - JOUR
TI - Commitments in the architecture of a limited, rational agent
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Rationality is a useful metaphor for understanding autonomous, intelligent agents. A persuasive view of intelligent agents uses cognitive primitives such as intentions and beliefs to describe, explain, and specify their behavior. These primitives are often associated with a notion of commitment that is internal to the given agent. However, at first sight, there is a tension between commitments and rationality. We show how the two concepts can be reconciled for the important and interesting case of limited, intelligent agents. We show how our approach extends to handle more subtle issues such as precommitments, which have previously been assumed to be conceptually too complex. We close with a proposal to develop conative policies as a means to represent commitments in a generic, declarative manner.
CN - QA76.76.I58 I55 1997
DA - 1997///
PY - 1997///
DO - 10.1007/3-540-62686-7_29
VL - 1209
SP - 72–87
UR - https://publons.com/publon/21294550/
ER -
TY - JOUR
TI - Asymptotic inference for near unit roots in spatial autoregression
AU - Bhattacharyya, B. B.
AU - Richardson, G. D.
AU - Franklin, L. A.
T2 - Annals of Statistics
AB - Asymptotic inference for estimators of $(\alpha_n, \beta_n)$ in the spatial autoregressive model $Z_{ij}(n) = \alpha_n Z_{i-1, j}(n) + \beta_n Z_{i, j-1}(n) - \alpha_n \beta_n Z_{i-1, j-1}(n) + \varepsilon_{ij}$ is obtained when $\alpha_n$ and $\beta_n$ are near unit roots. When $\alpha_n$ and $\beta_n$ are reparameterized by $\alpha_n = e^{c/n}$ and $\beta_n = e^{d/n}$, it is shown that if the "one-step Gauss-Newton estimator" of $\lambda_1 \alpha_n + \lambda_2 \beta_n$ is properly normalized and embedded in the function space $D([0, 1]^2)$, the limiting distribution is a Gaussian process. The key idea in the proof relies on a maximal inequality for a two-parameter martingale which may be of independent interest. A simulation study illustrates the speed of convergence and goodness-of-fit of these estimators for various sample sizes.
DA - 1997///
PY - 1997///
DO - 10.1214/aos/1031594738
VL - 25
IS - 4
SP - 1709-1724
ER -
TY - CONF
TI - Lip synchronization of speech
AU - McAllister, D. F.
AU - Bitzer, D. L.
AU - Rodman, R. D.
C2 - 1997///
C3 - Proceedings of the Audio Visual Speech Processing Conference '97, October 1997
CN - QA402.5 .E53 2001
DA - 1997///
SP - 133-136
ER -
TY - CONF
TI - Lip synchronization for animation
AU - Rodman, R. D.
AU - McAllister, D. F.
AU - Bitzer, D. L.
C2 - 1997///
C3 - Computer graphics: Proceedings, annual conference series, 1997: SIGGRAPH 97 Conference proceedings, August 3-8, 1997
CN - T385 .S53 1997
DA - 1997///
SP - 225-226
PB - New York, N.Y.: Association for Computing Machinery
ER -
TY - CONF
TI - Lip synchronization as an aid to the hearing disabled
AU - Rodman, R. D.
AU - Bitzer, D. L.
AU - McAllister, D. F.
C2 - 1997///
C3 - AVIOS 97: Proceedings of the American Voice Input/Output Society (AVIOS), September 1997
CN - TE266 .P76 1997
DA - 1997///
SP - 233-248
M1 - 1997
PB - San Jose, Calif.: American Voice Input/Output Society Society
ER -
TY - JOUR
TI - Empirical Investigation of the Benefits of Partial Lamarckianism
AU - Houck, Christopher R.
AU - Joines, Jeffery A.
AU - Kay, Michael G.
AU - Wilson, James R.
T2 - EVOLUTIONARY COMPUTATION
AB - Genetic algorithms (GAs) are very efficient at exploring the entire search space; however, they are relatively poor at finding the precise local optimal solution in the region in which the algorithm converges. Hybrid GAs are the combination of improvement procedures, which are good at finding local optima, and GAs. There are two basic strategies for using hybrid GAs. In the first, Lamarckian learning, the genetic representation is updated to match the solution found by the improvement procedure. In the second, Baldwinian learning, improvement procedures are used to change the fitness landscape, but the solution that is found is not encoded back into the genetic string. This paper examines the issue of using partial Lamarckianism (i.e., the updating of the genetic representation for only a percentage of the individuals), as compared to pure Lamarckian and pure Baldwinian learning in hybrid GAs. Multiple instances of five bounded nonlinear problems, the location-allocation problem, and the cell formation problem were used as test problems in an empirical investigation. Neither a pure Lamarckian nor a pure Baldwinian search strategy was found to consistently lead to quicker convergence of the GA to the best known solution for the series of test problems. Based on a minimax criterion (i.e., minimizing the worst case performance across all test problem instances), the 20% and 40% partial Lamarckianism search strategies yielded the best mixture of solution quality and computational efficiency.
DA - 1997///
PY - 1997///
DO - 10.1162/evco.1997.5.1.31
VL - 5
IS - 1
SP - 31-60
SN - 1530-9304
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031082512&partnerID=MN8TOARS
KW - Lamarckian evolution
KW - Baldwin effect
KW - local improvement procedures
KW - hybrid genetic algorithms
ER -
TY - JOUR
TI - On the entropic regularization method for solving min-max problems with applications
AU - Li, XS
AU - Fang, SC
T2 - MATHEMATICAL METHODS OF OPERATIONS RESEARCH
DA - 1997///
PY - 1997///
DO - 10.1007/BF01199466
VL - 46
IS - 1
SP - 119-130
SN - 1432-2994
KW - min-max problem
KW - linear and nonlinear programming
KW - entropy optimization principles
ER -
TY - BOOK
TI - Entropy optimization and mathematical programming
AU - Fang, S. C.
AU - Rajasekera, J. R.
AU - Tsao, H. S. J.
CN - T57.6 .F35 1997
DA - 1997///
PY - 1997///
PB - Boston: Kluwer Academic Publishers
SN - 0792399390
ER -
TY - BOOK
TI - Readings in agents
AU - Huhns, M. N.
AU - Singh, M. P.
CN - QA76.76 .I58 R43 1997
DA - 1997///
PY - 1997///
PB - San Francisco, Calif.: Morgan Kaufmann
SN - 1558604952
ER -
TY - CONF
TI - Toward speaker independence in automated lip-sync
AU - Rodman, R. D.
AU - McAllister, D. F.
AU - Bitzer, D. L.
C2 - 1997///
C3 - Compugraphics '97: Proceedings of the International Conference on Computational Graphics and Visualization Techniques, December 1997
DA - 1997///
SP - 1-5
M1 - 1997
PB - Portugal
ER -
TY - JOUR
TI - Statistical issues in the search for genes?
AU - Doerge, R. W.
AU - Zeng, Z. B.
AU - Weir, B. S.
T2 - Statistical Science
DA - 1997///
PY - 1997///
VL - 12
IS - 1997
SP - 195-219
ER -
TY - JOUR
TI - Spline approximation of thin shell dynamics
AU - Rosario, R. C. Del
AU - Smith, Ralph
T2 - International Journal for Numerical Methods in Engineering
AB - A spline-based method for approximating thin shell dynamics is presented here. While the method is developed in the context of the Donnell–Mushtari thin shell equations, it can be easily extended to the Byrne–Flügge–Lur'ye equations or other models for shells of revolution as warranted by applications. The primary requirements for the method include accuracy, flexibility and efficiency in smart material applications. To accomplish this, the method was designed to be flexible with regard to boundary conditions, material non-homogeneities due to sensors and actuators, and inputs from smart material actuators such as piezoceramic patches. The accuracy of the method was also of primary concern, both to guarantee full resolution of structural dynamics and to facilitate the development of PDE-based controllers which ultimately require real-time implementation. Several numerical examples provide initial evidence demonstrating the efficacy of the method. © 1997 John Wiley & Sons, Ltd.
DA - 1997///
PY - 1997///
DO - 10.1002/(sici)1097-0207(19970815)40:15<2807::aid-nme192>3.0.co;2-h
VL - 40
IS - 15
SP - 2807–2840
ER -
TY - JOUR
TI - Quantitative genetic analysis of divergence in male secondary sexual traits between Drosophila simulans and Drosophila mauritiana
AU - True, , JR
AU - Liu, JJ
AU - Stam, LF
AU - Zeng, ZB
AU - Laurie, CC
T2 - EVOLUTION
DA - 1997/6//
PY - 1997/6//
DO - 10.2307/2411157
VL - 51
IS - 3
SP - 816-832
SN - 0014-3820
KW - genitalia
KW - interspecific divergence
KW - morphological evolution
KW - quantitative trait loci mapping
KW - sexual dimorphism
ER -
TY - CHAP
TI - Effluent charges and transferable discharge permits
AU - Brill, E. D.
T2 - Design and operation of civil and environmental engineering systems
A2 - C. ReVelle,
A2 - McGarity, A. E.
CN - TA153 .D47 1997
PY - 1997///
SP - 657-690
PB - New York: Wiley
ER -
TY - JOUR
TI - A survey of combinational Gray codes
AU - Savage, C
T2 - SIAM REVIEW
AB - The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that successive objects differ in some prespecified, small way. This notion generalizes the classical binary reflected Gray code scheme for listing n-bit binary numbers so that successive numbers differ in exactly one bit position, as well as work in the 1960s and 1970s on minimal change listings for other combinatorial families, including permutations and combinations. The area of combinatorial Gray codes was popularized by Herbert Wilf in his invited address at the SIAM Conference on Discrete Mathematics in 1988 and his subsequent SIAM monograph [Combinatorial Algorithms: An Update, 1989] in which he posed some open problems and variations on the theme. This resulted in much recent activity in the area, and most of the problems posed by Wilf are now solved. In this paper, we survey the area of combinatorial Gray codes, describe recent results, variations, and trends, and highlight some open problems.
DA - 1997/12//
PY - 1997/12//
DO - 10.1137/S0036144595295272
VL - 39
IS - 4
SP - 605-629
SN - 1095-7200
KW - Gray codes
KW - Hamilton cycles
KW - acyclic orientations
KW - binary strings
KW - Boolean lattice
KW - Catalan families
KW - Cayley graphs
KW - combinations
KW - compositions
KW - de Bruijn sequences
KW - integer partitions
KW - linear extensions
KW - necklaces
KW - permutations
KW - restricted growth functions
KW - set partitions
KW - vertex-transitive graphs
ER -
TY - JOUR
TI - The Carnot heterogeneous database project: Implemented applications
AU - Singh, MP
AU - Cannata, PE
AU - Huhns, MN
AU - Jacobs, N
AU - Ksiezyk, T
AU - Ong, K
AU - Sheth, AP
AU - Tomlinson, C
AU - Woelk, D
T2 - DISTRIBUTED AND PARALLEL DATABASES
DA - 1997/4//
PY - 1997/4//
DO - 10.1023/A:1008645509474
VL - 5
IS - 2
SP - 207-225
SN - 0926-8782
UR - https://publons.com/publon/21294554/
KW - enterprise integration
KW - workflow management
KW - agents interoperation
KW - heterogeneous databases
KW - scientific decision support
KW - data mining
ER -
TY - JOUR
TI - Sex-specific quantitative trait loci affecting longevity in Drosophila melanogaster
AU - Nuzhdin, SV
AU - Pasyukova, EG
AU - Dilda, CL
AU - Zeng, ZB
AU - Mackay, TFC
T2 - PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
AB - Senescence, the decline in survivorship and fertility with increasing age, is a near-universal property of organisms. Senescence and limited lifespan are thought to arise because weak natural selection late in life allows the accumulation of mutations with deleterious late-age effects that are either neutral (the mutation accumulation hypothesis) or beneficial (the antagonistic pleiotropy hypothesis) early in life. Analyses of Drosophila spontaneous mutations, patterns of segregating variation and covariation, and lines selected for late-age fertility have implicated both classes of mutation in the evolution of aging, but neither their relative contributions nor the properties of individual loci that cause aging in nature are known. To begin to dissect the multiple genetic causes of quantitative variation in lifespan, we have conducted a genome-wide screen for quantitative trait loci (QTLs) affecting lifespan that segregate among a panel of recombinant inbred lines using a dense molecular marker map. Five autosomal QTLs were mapped by composite interval mapping and by sequential multiple marker analysis. The QTLs had large sex-specific effects on lifespan and age-specific effects on survivorship and mortality and mapped to the same regions as candidate genes with fertility, cellular aging, stress resistance and male-specific effects. Late age-of-onset QTL effects are consistent with the mutation accumulation hypothesis for the evolution of senescence, and sex-specific QTL effects suggest a novel mechanism for maintaining genetic variation for lifespan.
DA - 1997/9/2/
PY - 1997/9/2/
DO - 10.1073/pnas.94.18.9734
VL - 94
IS - 18
SP - 9734-9739
SN - 0027-8424
ER -
TY - JOUR
TI - Ready-time scheduling with stochastic service times
AU - Hodgson, TJ
AU - King, RE
AU - Stanfield, PM
T2 - OPERATIONS RESEARCH
AB - A frequently encountered scheduling problem is to determine simultaneously a material and job ready time and production sequence based on customer-specified due dates. Each job has a stochastic production time and a deterministic due date. The ready time is constrained in that the probability that each job will be complete by its due date must meet some minimum level of confidence. The objective in such an instance is to postpone the ready time as late as possible without violating these constraints. The steps and effort necessary to determine the maximum ready time and optimal production sequence, and cases in which this effort may be significantly reduced are presented. The resulting model is applied directly to single-facility and flow-shop production environments. Methods are shown for scheduling in a dynamic environment.
DA - 1997///
PY - 1997///
DO - 10.1287/opre.45.5.779
VL - 45
IS - 5
SP - 779-783
SN - 0030-364X
ER -
TY - JOUR
TI - On the convergence of power scaled Cesaro sums
AU - Chen, XZ
AU - Hartwig, RE
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - Power scaling is combined with Cesáro summation, and necessary and sufficient local conditions are given for the resulting matrix sequence J N (T) to converge. It is shown that this convergence is closely related to path conditions on the one hand as well as suitable bilinear consistency conditions on the other hand.
DA - 1997/12//
PY - 1997/12//
DO - 10.1016/S0024-3795(97)80056-0
VL - 267
SP - 335-358
SN - 0024-3795
ER -
TY - JOUR
TI - On a variational formulation of the generalized singular value decomposition
AU - Chu, MT
AU - Funderlic, RE
AU - Golub, GH
T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
AB - A variational formulation for the generalized singular value decomposition (GSVD) of a pair of matrices $A \in R^{m \times n}$ and $B \in R^{p \times n}$ is presented. In particular, a duality theory analogous to that of the SVD provides new understanding of left and right generalized singular vectors. It is shown that the intersection of row spaces of A and B plays a key role in the GSVD duality theory. The main result that characterizes left GSVD vectors involves a generalized singular value deflation process.
DA - 1997/10//
PY - 1997/10//
DO - 10.1137/S0895479895287079
VL - 18
IS - 4
SP - 1082-1092
SN - 0895-4798
KW - generalized eigenvalue and eigenvector
KW - generalized singular value and singular vector
KW - stationary value and stationary point
KW - deflation
KW - duality
ER -
TY - JOUR
TI - Evaluation of multicast routing algorithms for real-time communication on high-speed networks
AU - Salama, HF
AU - Reeves, DS
AU - Viniotis, Y
T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
AB - Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained.
DA - 1997/4//
PY - 1997/4//
DO - 10.1109/49.564132
VL - 15
IS - 3
SP - 332-345
SN - 1558-0008
KW - admission control
KW - multicast routing
KW - quality of service
KW - reverse path multicasting
ER -
TY - JOUR
TI - Cycle time and residence time density approximations in a stochastic model for circulatory transport
AU - Smith, C. E.
AU - Lansky, P.
AU - Lung, T.-H.
T2 - Bulletin of Mathematical Biology
DA - 1997///
PY - 1997///
DO - 10.1007/bf02459468
VL - 59
IS - 1
SP - 1-22
ER -
TY - JOUR
TI - Accurate and economical solution of the pressure-head form of Richards' equation by the method of lines
AU - Tocci, MD
AU - Kelley, CT
AU - Miller, CT
T2 - ADVANCES IN WATER RESOURCES
AB - The pressure-head form of Richards' equation (RE) is difficult to solve accurately using standard time integration methods. For example, mass balance errors grow as the integration progresses unless very small time steps are taken. Further, RE may be solved for many problems more economically and robustly with variable-size time steps rather than with a constant time-step size, but variable step-size methods applied to date have relied upon empirical approaches to control step size, which do not explicitly control temporal truncation error of the solution. We show how a differential algebrain equation implementation of the method of lines can give solutions to RE that are accurate, have good mass balance properties, explicitly control temporal truncation error, and are more economical than standard approaches for a wide range of solution accuracy. We detail changes to a standard integrator, DASPK, that improves efficiency for the test problems considered, and we advocate the use of this approach for both RE and other problems involving subsurface flow and transport phenomena.
DA - 1997/2//
PY - 1997/2//
DO - 10.1016/S0309-1708(96)00008-5
VL - 20
IS - 1
SP - 1-14
SN - 0309-1708
ER -
TY - JOUR
TI - A genetics-based approach for aggregated production planning in a fuzzy environment
AU - Wang, DW
AU - Fang, SC
T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS
AB - Due to the nondeterministic nature of the business environment of a manufacturing enterprise, it is more appropriate to describe the aggregated production planning by using a fuzzy mathematical programming model. In this paper, a genetics-based inexact approach is proposed to imitate the human decision procedure for production planning. Instead of locating one exact optimal solution, the proposed approach finds a family of inexact solutions within an acceptable level by adopting a mutation operator to move along a weighted gradient direction. Then, a decision maker can select a preferred solution by examining a convex combination of the solutions in the family via the human-computer interaction. Our computational experiments illustrate how the enterprise managers can be more satisfied by this new approach than others.
DA - 1997/9//
PY - 1997/9//
DO - 10.1109/3468.618262
VL - 27
IS - 5
SP - 636-645
SN - 1558-2426
ER -
TY - JOUR
TI - Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains
AU - Dayar, T
AU - Stewart, WJ
T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
AB - In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi-lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the stationary probability of each NCD block. In doing so, a lower-bounding nonnegative coupling matrix is employed. The nature of the stationary probability bounds is closely related to the structure of this lower-bounding matrix. Irreducible lower-bounding matrices give tighter bounds compared with bounds obtained using reducible lower-bounding matrices. It is also noticed that the quasi-lumped chain of an NCD Markov chain is an ill-conditioned matrix and the bounds obtained generally will not be tight. However, under some circumstances, it is possible to compute the stationary probabilities of some NCD blocks exactly.
DA - 1997/4//
PY - 1997/4//
DO - 10.1137/S0895479895294277
VL - 18
IS - 2
SP - 482-498
SN - 0895-4798
KW - Markov chains
KW - quasi lumpability
KW - decomposability
KW - stationary probability
KW - aggregation-disaggregation schemes
ER -
TY - JOUR
TI - General formulas for obtaining the MLEs and the asymptotic variance-covariance matrix in mapping quantitative trait loci when using the EM algorithm
AU - Kao, CH
AU - Zeng, ZB
T2 - BIOMETRICS
AB - We present in this paper general formulas for deriving the maximum likelihood estimates and the asymptotic variance-covariance matrix of the positions and effects of quantitative trait loci (QTLs) in a finite normal mixture model when the EM algorithm is used for mapping QTLs. The general formulas are based on two matrices D and Q, where D is the genetic design matrix, characterizing the genetic effects of the QTLs, and Q is the conditional probability matrix of QTL genotypes given flanking marker genotypes, containing the information on QTL positions. With the general formulas, it is relatively easy to extend QTL mapping analysis to using multiple marker intervals simultaneously for mapping multiple QTLs, for analyzing QTL epistasis, and for estimating the heritability of quantitative traits. Simulations were performed to evaluate the performance of the estimates of the asymptotic variances of QTL positions and effects.
DA - 1997/6//
PY - 1997/6//
DO - 10.2307/2533965
VL - 53
IS - 2
SP - 653-665
SN - 0006-341X
KW - asymptotic variance-covariance matrix
KW - EM algorithm
KW - epistasis
KW - gene mapping
KW - general formulas
KW - heritability
KW - maximum likelihood
KW - normal mixture model
KW - quantitative trait loci
ER -
TY - JOUR
TI - Estimating and simulating Poisson processes having trends or multiple periodicities
AU - Kuhl, ME
AU - Wilson, , JR
AU - Johnson, MA
T2 - IIE TRANSACTIONS
AB - We develop and evaluate procedures for estimating and simulating nonhomogeneous Poisson processes having an exponential rate function, where the exponent may include a polynomial component or some trigonometric components or both. Maximum likelihood estimates of the unknown continuous parameters of the rate function are obtained numerically, and the degree of the polynomial rate component is determined by a likelihood ratio test. The experimental performance evaluation for this estimation procedure involves applying the procedure to 100 independent replications of nine selected point processes that possess up to four trigonometric rate components together with a polynomial rate component whose degree ranges from zero to three. On each replication of each process, the fitting procedure is applied to estimate the parameters of the process; and then the corresponding estimates of the rate and mean-value functions are computed over the observation interval. Evaluation of the fitting procedure is based on plotted tolerance bands for the rate and mean-value functions together with summary statistics for the maximum and average absolute estimation errors in these functions computed over the observation interval. The experimental results provide substantial evidence of the numerical stability and usefulness of the fitting procedure in simulation applications.
DA - 1997/3//
PY - 1997/3//
DO - 10.1080/07408179708966327
VL - 29
IS - 3
SP - 201-211
SN - 0740-817X
ER -
TY - JOUR
TI - Combining information from data in mapping analysis: use of multiple markers and multiple traits
AU - Zeng, Z. B.
T2 - Animal Biotechnology
DA - 1997///
PY - 1997///
DO - 10.1080/10495399709525876
VL - 8
IS - 1
SP - 145-150
ER -
TY - JOUR
TI - A fuzzy expert system model for RF receiver module testing
AU - Lu, J.-J.
AU - Brinkley, P.
AU - Fang, Shu-Cherng
T2 - International Journal of Systems Science
AB - Abstract An expert system for PCS-1900 radio frequency module test failure diagnostics that incorporates fuzzy logic has been implemented in the Wireless Networks manufacturing facility of Nortel in Research Triangle Park, North Carolina. Since the relations between the results of parametric test measurement and failure modes are neither certain nor definite, it is advantageous to employ fuzzy logic in building a knowledge base system. Instead of providing a definite conclusion that specifies a specific failure mode, this system gives a degree of failure for each mode, indicating the possibility of that mode being faulty.
DA - 1997///
PY - 1997///
DO - 10.1080/00207729708929439
VL - 28
IS - 8
SP - 791–798
ER -
TY - JOUR
TI - Weak solutions to a one-dimensional hydrodynamic model of two carrier types for semiconductors
AU - Fang, WF
AU - Ito, K
T2 - NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS
DA - 1997/3//
PY - 1997/3//
DO - 10.1016/0362-546X(95)00189-3
VL - 28
IS - 5
SP - 947-963
SN - 0362-546X
KW - hydrodynamic model for semiconductors
KW - hyperbolic systems
KW - viscosity method
KW - compensated compactness
ER -
TY - JOUR
TI - The point-to-point connection problem - analysis and algorithms
AU - Natu, M
AU - Fang, SC
T2 - DISCRETE APPLIED MATHEMATICS
AB - The point-to-point connection problem is to find a subset of arcs with minimal total cost connecting a fixed number of source-destination pairs. The problem has many variations for different applications. In this paper, we focus on a case where the source-destination pairs are prematched. We examine the structure of the problem with two source-destination pairs and provide an efficient implementation of a Dijkstra-like algorithm with time complexity O (mn + n 2 log n) . We also provide a dynamic programming algorithm with complexity O (n 11 ) for the case with three source-destination pairs. We conjecture that the same approach can be generalized for p source-destination pairs with complexity O (n 3p + 2 ) where p is fixed.
DA - 1997/10/21/
PY - 1997/10/21/
DO - 10.1016/s0166-218x(97)00010-3
VL - 78
IS - 1-3
SP - 207-226
SN - 0166-218X
KW - algorithms
KW - point-to-point connection problem
KW - dynamic programming
KW - computational complexity
ER -
TY - JOUR
TI - Technology for support of network-based education workflows in North Carolina: NC State-Fujitsu education partnership final report for the period June 1, 1996-December 31, 1996
AU - Rajala, S. A.
AU - Vouk, M. A.
AU - Nilsson, A. A.
AU - Miller, T. K.
AU - Schrag, R. L.
AU - Burke, J. R.
AU - Brawner, C. E.
AU - Viniotis, I.
AU - Perros, H. G.
T2 - TR (Center for Advanced Computing and Communication)
DA - 1997///
PY - 1997///
IS - 3
ER -
TY - JOUR
TI - Steady-state solutions of a one-dimensional hydrodynamic model for semiconductors
AU - Fang, WF
AU - Ito, K
T2 - JOURNAL OF DIFFERENTIAL EQUATIONS
AB - Steady-state BV solutions to a one-dimensional hydrodynamic model for semiconductors are shown to exist as limits of viscous solutions as the viscosity vanishes.
DA - 1997/1/20/
PY - 1997/1/20/
DO - 10.1006/jdeq.1996.3203
VL - 133
IS - 2
SP - 224-244
SN - 0022-0396
ER -
TY - JOUR
TI - Multicast routing with end-to-end delay and delay variation constraints
AU - Rouskas, GN
AU - Baldine, I
T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
AB - We study the problem or constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: (1) bounded delay along the paths from the source to each destination and (2) bounded variation among the delays along these paths. We first establish that the problem of determining such a constrained tree is NP-complete. We then present a heuristic that demonstrates good average case behavior in terms of the maximum interdestination delay variation. The heuristic achieves its best performance under conditions typical of multicast scenarios in high speed networks. We also show that it is possible to dynamically reorganize the initial tree in response to changes in the destination set, in a way that is minimally disruptive to the multicast session.
DA - 1997/4//
PY - 1997/4//
DO - 10.1109/49.564133
VL - 15
IS - 3
SP - 346-356
SN - 0733-8716
KW - delay constrained multicast communication
KW - multicast routing
ER -
TY - JOUR
TI - Molecular layer epitaxy by real-time optical process monitoring
AU - Bachmann, K. J.
AU - Hopfner, C.
AU - Sukidi, N.
AU - Miller, A. E.
AU - Harris, C. J.
AU - Aspnes, D. E.
AU - Dietz, N. A.
AU - Tran, Hien
AU - Beeler, S. C.
AU - Ito, K.
AU - Banks, H. T.
T2 - Applied Surface Science
AB - In this paper we consider modern methods of optical process monitoring and control in the context of atomic layer epitaxy. One specific method, p-polarized reflectance spectroscopy (PRS), is chosen to assess details of layer-by-layer growth. We show that PRS monitoring under conditions of steady-state growth by pulsed chemical beam epitaxy (PCBE) can achieve the deposition of molecular layers of GaP on silicon (100) deposited with a precision of 5%, which can be improved by reducing the growth rate and increasing the period of time averaging of the reflectance data. Since in the nucleation period prior to formation of a contiguous heteroepitaxial film inhomogeneous surface chemistry and roughening complicates the modeling of the overgrowth process, advances in both experimental methods and theory are required for extending the control to non-steady-state growth conditions. Results of simultaneous single-wavelength PR monitoring and laser light scattering measurements in conjunction with atomic force microscopy studies of short period heteroepitaxial overgrowth processes are presented. The extension of PRS to the monitoring of organometallic chemical vapor deposition at higher pressures is also discussed.
DA - 1997///
PY - 1997///
DO - 10.1016/S0169-4332(96)00975-0
VL - 112
IS - 1997 Mar.
SP - 38–47
ER -
TY - JOUR
TI - Mapping quantitative trait loci with dominant and missing markers in various crosses from two inbred lines
AU - Jiang, CJ
AU - Zeng, ZB
T2 - GENETICA
DA - 1997///
PY - 1997///
DO - 10.1023/A:1018394410659
VL - 101
IS - 1
SP - 47-58
SN - 0016-6707
KW - dominant markers
KW - genetic mapping
KW - Markov chain
KW - missing data
KW - quantitative trait loci
ER -
TY - JOUR
TI - A methodology for optimally designing console panels for use by a single operator
AU - Sargent, TA
AU - Kay, MG
AU - Sargent, RG
T2 - HUMAN FACTORS
AB - A seven-step methodology is presented to determine a dimensionally correct optimal layout of a console panel for a single operator. This methodology integrates the steps in the layout design process and uses a mathematical optimization model from facility design to obtain the optimal panel layout. A major difference in this methodology from previous work is that the mathematical optimization model incorporates factors that are only partially included in previous mathematical models. In addition, it includes the areas of the panel components as a new factor. This methodology is illustrated by the design of a nuclear power plant console panel.
DA - 1997/9//
PY - 1997/9//
DO - 10.1518/001872097778827052
VL - 39
IS - 3
SP - 389-409
SN - 0018-7208
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031410945&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A method for the incorporation of parametric uncertainty in the weighted evaluation multi-attribute decision analysis model
AU - Lavelle, JP
AU - Wilson, , JR
AU - Gold, HJ
AU - Canada, , JR
T2 - COMPUTERS & INDUSTRIAL ENGINEERING
AB - We develop an extension of the classic Weighted Evaluation (WE) Multi-Attribute Decision Analysis (MADA) model that allows for uncertainty in the parameters of the model. Uncertainties in attribute importance weights and alternative evaluation ratings are represented by independent uniform, triangular or beta random variables; and an iterative multi-variate integration scheme is used to evaluate the mean, variance and skewness of the resulting Probabilistic Weighted Evaluation (PWE). These moments are used to compute two-term Edgeworth and normal approximations to the distribution of: (a) the PWE for each of several alternatives that are to be analysed separately; or (b) the difference between PWEs for selected alternatives that are to be analysed on a pairwise basis. The proposed methodology is used to compare probabilistically three alternative solutions to the Mexico City Airport Siting Problem of Keeney and Raiffa (Keeney, R. L. and Raiffa, H., Decisions with Multiple Objectives. Wiley, New York, 1976).
DA - 1997/9//
PY - 1997/9//
DO - 10.1016/S0360-8352(97)00012-0
VL - 32
IS - 4
SP - 769-786
SN - 0360-8352
ER -
TY - JOUR
TI - The effects of computational delay in descriptor-based trajectory tracking control
AU - vonWissel, D
AU - Nikoukhah, R
AU - Campbell, SL
AU - Delebecque, F
T2 - INTERNATIONAL JOURNAL OF CONTROL
AB - Descriptor Predictive Control (DPC) has been shown to be a useful method for solving nonlinear tracking problems. A rigorous analysis of local stability and performance characteristics of this method has been achieved previously by studying the linear plant under the assumption that the delay introduced in the control due to numerical computation can be neglected. It was shown that, if the plant is controllable and minimum phase, stability is guaranteed and tracking is achieved exponentially with any desired rate of convergence. It was also shown that sometimes DPC must include a specially designed preliminary feedback. In this paper, we carry out a similar analysis by taking into account computational delay, which is unavoidable in actual implementation of DPC. We show, in particular, that under the same assumptions, and provided the special preliminary feedback is used, that the closed loop system remains stable as long as the delay is smaller than a threshold and that exponential tracking is achieved. However, the rate of convergence of the tracking error cannot be chosen arbitrarily because it is constrained by the plant zeros. The delay analysis is used to explain experimental observations in the literature about the occasional failure of previous implementations of the DPC approach at small sampling periods. A nonlinear robotics problem is worked in detail.
DA - 1997/5/20/
PY - 1997/5/20/
DO - 10.1080/002071797224289
VL - 67
IS - 2
SP - 251-273
SN - 1366-5820
ER -
TY - JOUR
TI - Perturbing the dual feasible region for solving convex quadratic programs
AU - Fang, SC
AU - Tsao, HSJ
T2 - JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
DA - 1997/7//
PY - 1997/7//
DO - 10.1023/A:1022655502360
VL - 94
IS - 1
SP - 73-85
SN - 1573-2878
KW - convex quadratic programming
KW - duality theory
KW - perturbation methods
ER -
TY - JOUR
TI - Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies
AU - Rouskas, GN
AU - Sivaraman, V
T2 - IEEE-ACM TRANSACTIONS ON NETWORKING
AB - We consider the problem of scheduling packet transmissions in a broadcast, single-hop wavelength-division multiplexing (WDM) network, with tunability provided only at one end. Our objective is to design schedules of minimum length to satisfy a set of traffic requirements given in the form of a demand matrix. We address a fairly general version of the problem as we allow arbitrary traffic demands and arbitrary transmitter tuning latencies. The contribution of our work is twofold, First we define a special class of schedules which permit an intuitive formulation of the scheduling problem. Based on this formulation we present algorithms which construct schedules of length equal to the lower bound provided that the traffic requirements satisfy certain optimality conditions. We also develop heuristics which, in the general case, give schedules of length equal or very close to the lower bound. Secondly, we identify two distinct regions of network operation. The first region is such that the schedule length is determined by the tuning requirements of transmitters; when the network operates within the second region however, the length of the schedule is determined by the traffic demands, not the tuning latency. The point at which the network switches between the two regions is identified in terms of system parameters such as the number of nodes and channels and the tuning latency. Accordingly, we show that it is possible to appropriately dimension the network to minimize the effects of even large values of the tuning latency.
DA - 1997/6//
PY - 1997/6//
DO - 10.1109/90.611101
VL - 5
IS - 3
SP - 359-370
SN - 1558-2566
KW - optical networks
KW - packet scheduling tuning latency
KW - wavelength-division multiplexing
ER -
TY - JOUR
TI - On the inhomogeneous system of isentropic gas dynamics by the viscosity method
AU - Fang, WF
AU - Ito, K
T2 - PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS
AB - The existence of global weak solutions is shown for the equations of isentropic gas dynamics with inhomogeneous terms by the viscosity method. A generalised version of the method of invariant regions is developed to obtain the uniform L ∞ bounds of the viscosity solutions, and the method of compensated compactness is applied to show the existence of weak solutions as limits of the viscosity solutions. The lower positive bound for the density function is also obtained. As an example, a hydrodynamic model for semiconductors is analysed
DA - 1997///
PY - 1997///
DO - 10.1017/s0308210500023647
VL - 127
SP - 261-280
SN - 0308-2105
ER -
TY - JOUR
TI - On products of EP matrices
AU - Hartwig, RE
AU - Katz, IJ
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - Necessary and sufficient conditions are given for the product of two EP matrices to be EP. Some special cases are considered.
DA - 1997/2//
PY - 1997/2//
DO - 10.1016/0024-3795(95)00693-1
VL - 252
SP - 339-345
SN - 0024-3795
ER -
TY - JOUR
TI - Modeling and verifying active structural control systems
AU - Elseaidy, WM
AU - Cleaveland, R
AU - Baugh, JW
T2 - SCIENCE OF COMPUTER PROGRAMMING
AB - This paper presents the results of a case study involving the use of a formal graphical notation, Modechart, and an automatic verification tool, the Concurrency Workbench, in the analysis of the design of a fault-tolerant active structural control system. Such control systems must satisfy strict requirements on their timing behavior; we show how to use various equivalence-based features supported by the Workbench to examine the timing behavior of different design alternatives, one of which has in excess of 10 19 states. The central insight arising from the study involves the importance of compositionality for reasoning about large and complex systems; in particular, the success of the case study depends integrally on our notation's and tool's support of componentwise minimization.
DA - 1997/7//
PY - 1997/7//
DO - 10.1016/S0167-6423(96)00031-7
VL - 29
IS - 1-2
SP - 99-122
SN - 1872-7964
KW - active structural control systems
KW - safety critical
KW - component-wise state space reduction
ER -
TY - JOUR
TI - Linear programming with stochastic elements: An on-line approach
AU - Guan, S
AU - Fang, SC
T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS
AB - In this paper, we study linear programming problems with both the cost and right-hand-side vectors being stochastic. Kalman filtering techniques are integrated into the infeasible-interior-point method to develop an on-line algorithm. We first build a “noisy dynamic model” based on the Newton equation developed in the infeasible-interior-point method. Then, we use Kalman filtering techniques to filter out the noise for a stable direction of movement. Under appropriate assumptions, we show a new result of the limiting property of Kalman filtering in this model and prove that the proposed on-line approach is globally convergent to a “true value solution” in the mode of quadratic mean.
DA - 1997/5//
PY - 1997/5//
DO - 10.1016/S0898-1221(97)00066-7
VL - 33
IS - 9
SP - 61-82
SN - 1873-7668
KW - linear programming
KW - infeasible-interior-point method
KW - stochastic programming
KW - Kalman filter
ER -
TY - JOUR
TI - Experimental confirmation of a PDE-based approach to design of feedback controls
AU - Banks, HT
AU - Smith, RC
AU - Brown, DE
AU - Silcox, RJ
AU - Metcalf, VL
T2 - SIAM JOURNAL ON CONTROL AND OPTIMIZATION
AB - Issues regarding the experimental implementation of PDE-based controllers are discussed in this work. While the motivating application involves the reduction of vibration levels for a circular plate through excitation of surface-mounted piezoceramic patches, the general techniques described here will extend to a variety of applications. The initial step is the development of a PDE model which accurately captures the physics of the underlying process. This model is then discretized to yield a vector-valued initial value problem. Optimal control theory is used to determine continuous-time voltages to the patches, and the approximations needed to facilitate discrete-time implementation are addressed. Finally, experimental results demonstrating the control of both transient and steady-state vibrations through these techniques are presented.
DA - 1997/7//
PY - 1997/7//
DO - 10.1137/S0363012995285909
VL - 35
IS - 4
SP - 1263-1296
SN - 0363-0129
KW - feedback control
KW - piezoceramic actuators
KW - PDE model
ER -
TY - JOUR
TI - Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach
AU - Balakrishnan, M
AU - Puliafito, A
AU - Trivedi, K
AU - Viniotis, Y
T2 - TELECOMMUNICATION SYSTEMS
DA - 1997///
PY - 1997///
DO - 10.1023/A:1019164110511
VL - 7
IS - 1-3
SP - 105-123
SN - 1018-4864
ER -
TY - JOUR
TI - Alternative manufacturing sequences and tolerance buildup: A point of view and a case study
AU - Fathi, Y
AU - Mittal, RO
AU - Cline, JE
AU - Martin, PM
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - We consider alternative sequences of operations for manufacturing a given part. Within each sequence, we study the relationship between the unit-to-unit variation in the machined dimensions and the resulting variation in one or more critical dimensions (i.e. tolerance buildup). We propose an objective criterion for comparing these sequences from the point of view of their impact on the tolerance buildup at the critical dimensions. This criterion, which we refer to as the 'total expected loss' (TEL), is based on the concept of continuous quality loss function. We use TEL as well as the tolerance cost to compare alternative sequences for manufacturing a specific part, and present the results.
DA - 1997/1//
PY - 1997/1//
DO - 10.1080/002075497196019
VL - 35
IS - 1
SP - 123-136
SN - 0020-7543
ER -
TY - JOUR
TI - A maximum entropy optimization approach to tandem queues with generalized blocking
AU - Mishra, S
AU - Fang, SC
T2 - PERFORMANCE EVALUATION
AB - Abstract We study a general blocking scheme for an open tandem queueing network with finite intermediate buffers. The service time at each node as well as interarrival time at the first node is assumed to be exponentially distributed. The interarrival and service time at each intermediate node of the tandem queue, under the general blocking scheme, depend upon three parameters at each node, namely, the maximum number of raw jobs, the upper limit on the number of finished but blocked jobs and the buffer capacity. This three-parameter analysis was introduced by Cheng and Yao (1993), and was shown, using Monte Carlo simulations, to provide good results. Our analysis is also based on this three-parameter approach, but with a different view. We first decompose the tandem queue into a group of two-node subsystems in order to derive a set of equations for the effective interarrival and service time distributions at each node. Each of these two-node subsystems is treated as a finite capacity queueing system with population size constraints. Then we apply the principle of maximum entropy to evaluate different parameters such as the blocking probabilities, starvation probabilities, etc., of each subsystem. We propose a step-by-step algorithm along with its convergence properties. A comparison of numerical results with the simulation results is also discussed.
DA - 1997/10//
PY - 1997/10//
DO - 10.1016/S0166-5316(96)00061-2
VL - 30
IS - 4
SP - 217-241
SN - 0166-5316
KW - queueing networks
KW - open tandem queue
KW - principle of maximum entropy
KW - nonlinear programming
KW - kanban blocking
KW - general blocking
KW - mean queue length distribution
ER -
TY - JOUR
TI - DAEs arising from traveling wave solutions of PDEs
AU - Campbell, SL
AU - Marszalek, W
T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
AB - The study of traveling waves for explicit and implicit PDEs can sometimes result in differential algebraic equations (DAEs) instead of ordinary differential equations. The advantages of using DAEs is discussed as are the implications of DAE theory for the study of traveling waves. A specific type of traveling wave that connects equilibria is examined in more detail. Specific examples are given.
DA - 1997/9/15/
PY - 1997/9/15/
DO - 10.1016/S0377-0427(97)00084-8
VL - 82
IS - 1-2
SP - 41-58
SN - 0377-0427
KW - differential algebraic equation
KW - DAE
KW - traveling waves
KW - equilibria
KW - magnetohydrodynamics
ER -
TY - JOUR
TI - Jacobian reuse in explicit integrators for higher index DAEs
AU - Campbell, SL
AU - Zhong, YC
T2 - APPLIED NUMERICAL MATHEMATICS
AB - Abstract Systems F(y′,y,t) = 0 with Fy′ identically singular are known as differential algebraic equations (DAEs) and occur in a variety of applications. The index v is one measure of numerical difficulty. Most numerical methods for DAEs either require special structure or low index. Two alternative approaches have been proposed for numerically integrating more general higher index DAEs. This paper examines some of the mathematical issues involved in the efficient implementation of the “explicit integration” method. It is first shown that the reuse of Jacobians can lead to the integration of discontinuous vector fields. It is then proven that these discontinuous fields can be successfully integrated. Computational examples back up the theory. A comparison to a standard integrator on an index three control problem illustrates that while the explicit approach can be somewhat more expensive computationally, it can be easier to apply, and does not suffer from order reduction in the higher index variables.
DA - 1997/12//
PY - 1997/12//
DO - 10.1016/S0168-9274(97)00052-4
VL - 25
IS - 4
SP - 391-412
SN - 0168-9274
KW - differential algebraic equation
KW - DAE
KW - numerical methods
ER -
TY - JOUR
TI - A mathematical programming approach for generating alternatives in discrete structural optimization
AU - Baugh, JW
AU - Caldwell, SC
AU - Brill, ED
T2 - ENGINEERING OPTIMIZATION
AB - Structural design, like other complex decision problems, involves many tradeoffs among competing criteria. While mathematical programming models are increasingly realistic, there are often relevant issues that cannot be easily captured, if at all, in a formal system. This paper describes an approach to modelling that recognizes these limitations and allows a designer to explore unmodelled issues in a joint human-computer cognitive system. A prototype based on this approach is presented for topological truss optimization, and three modelling techniques are contrasted for their effectiveness in producing “different” alternatives. The results show that alternatives produced using these techniques are good with respect to modelled objectives, and yet are different, and often better, with respect to interesting objectives not present in the model.
DA - 1997///
PY - 1997///
DO - 10.1080/03052159708941125
VL - 28
IS - 1-2
SP - 1-31
SN - 0305-215X
KW - multiple-objective programming
KW - decision-support systems
KW - mathematical modelling
KW - design
ER -
TY - JOUR
TI - In memoriam: Harold Highland (1917-1997)
AU - Schriber, T. J.
AU - Wilson, J. R.
T2 - OR/MS Today
DA - 1997///
PY - 1997///
VL - 24
IS - 6
SP - 55
ER -
TY - JOUR
TI - Efficient generation of graphical partitions
AU - Barnes, TM
AU - Savage, CD
T2 - DISCRETE APPLIED MATHEMATICS
AB - Given a positive even integer n, we show how to generate the set G(n) of graphical partitions of n, that is, those partitions of n which correspond to the degree sequences of simple, undirected graphs. The algorithm is based on a recurrence for G(n), and the total time used by the algorithm, independent of output, is O(¦G(n)¦), which is constant average time per graphical partition. This is the first algorithm shown to achieve such efficiency for generating G(n) and the direct approach differs from earlier ‘generate and reject’ schemes and the ‘interval/gap’ approach.
DA - 1997/10/21/
PY - 1997/10/21/
DO - 10.1016/s0166-218x(97)00022-x
VL - 78
IS - 1-3
SP - 17-26
SN - 0166-218X
KW - degree sequences
KW - integer partitions
ER -
TY - JOUR
TI - A linear approximation model for the parameter design problem
AU - Fathi, Y
T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
AB - Abstract We consider the problem of minimizing the variance of a nonlinear function of several random variables, where the decision variables are the mean values of these random variables. This problem arises in the context of robust design of manufactured products and/or manufacturing processes, where the decision variables are the set points for various design components. A nonlinear programming (NLP) model is developed to obtain approximate solutions for this problem. This model is based on a Taylor series expansion of the given function, up to its linear term. A case study pertaining to the design of a coil spring is discussed, and its corresponding NLP model is developed. Using this model, a non-inferior frontier curve is obtained that shows the trade-off between the minimum mass of the coil spring and the minimum variance of its performance characteristic. Results of applying the model to three other case studies are also presented.
DA - 1997/3/16/
PY - 1997/3/16/
DO - 10.1016/S0377-2217(96)00286-X
VL - 97
IS - 3
SP - 561-570
SN - 0377-2217
KW - quality
KW - modelling
KW - nonlinear programming
KW - manufacturing
ER -
TY - JOUR
TI - Selected papers from CoopIS-97 - Guest editors' introduction
AU - Klas, W
AU - Singh, MP
T2 - INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS
DA - 1997///
PY - 1997///
DO - 10.1142/S0218843097000100
VL - 6
IS - 3-4
SP - 217-218
SN - 0218-8430
ER -
TY - JOUR
TI - Risk analyses in clonal forestry
AU - Roberds, JH
AU - Bishir, JW
T2 - CANADIAN JOURNAL OF FOREST RESEARCH-REVUE CANADIENNE DE RECHERCHE FORESTIERE
AB - The number of clones to use in plantations is an important problem that must be addressed by practitioners of clonal forestry because of productivity and forest health considerations. This problem has been analyzed from a number of perspectives, but analyses based upon risk of plantation failure have provided special insight about effects produced by an increase in numbers of clones. In this paper, we describe alternative models and methods that have been proposed to investigate the effect of number of clones on risk of plantation failure following an unforeseen catastrophic event. Properties of these models are reviewed and conclusions resulting from the analysis of each model are given. Results from these analyses and recently developed theory indicate that use of 30 to 40 unrelated clones in plantations provides protection against catastrophic failure roughly equivalent to the use of large numbers of unrelated clones. A detailed description of the recently introduced time-to-failure model is also presented, and several examples that illustrate properties of this model are discussed. Finally, some implications regarding the development of breeding populations are identified and explored. Resume : La problOmatique du nombre de clones utilisOs dans les plantations clonales doit Œtre abordOe par les praticiens de la foresterie clonale en raison des implications quielle peut avoir pour la productivitO et la santO des forŒts. Ce problme a OtO OtudiO sous de nombreux angles, mais il siest avOrO que liapproche basOe sur le risque diOchec de plantation a permis de rOvOler les effets rOsultant diune augmentation du nombre de clones utilisOs. Les auteurs de liOtude font la description des mOthodes et modles alternatifs qui ont OtO proposOs pour Otudier lieffet du nombre de clones sur le risque diOchec de plantation suite ‡ un OvOnement catastrophique imprOvisible. Les auteurs prOsentent la revue des caractOristiques ainsi que les conclusions dOcoulant de lianalyse de chacun de ces modles. Les rOsultats de cette analyse ainsi que les considOrations thOoriques dOveloppOes rOcemment indiquent que liutilisation de 30 ‡ 40 clones non apparentOs par plantation procure une protection contre des Ochecs catastrophiques qui est ‡ peu prs Oquivalente ‡ celle qui dOcoule de liutilisation diun grand nombre de clones non apparentOs. Une description dOtaillOe du modle rOcent de «dOlai diOchec» est prOsentOe. Quelques exemples illustrant les caractOristiques de ce modle sont Ogalement discutOs. Enfin, certaines implications relatives au dOveloppement des populations diOlevage sont identifiOes et discutOes. (Traduit par la ROdaction)
DA - 1997/3//
PY - 1997/3//
DO - 10.1139/x96-202
VL - 27
IS - 3
SP - 425-432
SN - 0045-5067
ER -
TY - JOUR
TI - Multidestination communication over tunable-receiver single-hop WDM networks
AU - Rouskas, GN
AU - Ammar, MH
T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
AB - We address the issue of providing efficient mechanisms for multidestination communication over one class of lightwave wavelength division multiplexing (WDM) architectures, namely, single-hop networks with tunability provided only at the receiving side. We distinguish a number of multicast traffic types, we present a number of alternative broadcast/multicast time-division multiple-access (TDMA) schedules for each type, and we develop heuristics to obtain schedules that result in low average packet delay. One of our major contributions is the development of a suite of adaptive multicast protocols which are simple to implement, and have good performance under changing multicast traffic conditions.
DA - 1997/4//
PY - 1997/4//
DO - 10.1109/49.564145
VL - 15
IS - 3
SP - 501-511
SN - 1558-0008
KW - adaptive multicast protocols
KW - multidestination communication
KW - optical WDM networks
ER -
TY - JOUR
TI - Formal methods in CIS: Multiagent systems guest editors' introduction
AU - Huhns, MN
AU - Singh, MP
T2 - INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS
AB - International Journal of Cooperative Information SystemsVol. 06, No. 01, pp. 1-2 (1997) No AccessFormal Methods in CIS: Multiagent Systems Guest Editors' IntroductionMichael N. Huhns and Munindar P. SinghMichael N. HuhnsDepartment of Electrical and Computer Engineering, University of South Carolina, Columbia, SC 29208, USA and Munindar P. SinghDepartment of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, USAhttps://doi.org/10.1142/S0218843097000021Cited by:2 Next AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack CitationsRecommend to Library ShareShare onFacebookTwitterLinked InRedditEmail Remember to check out the Most Cited Articles! Check out these titles in digital security! FiguresReferencesRelatedDetailsCited By 2Analysis of multi-interpretable ecological monitoring informationFrances Brazier, Joeri Engelfriet and Jan Treur30 November 2010 | Applied Artificial Intelligence, Vol. 16, No. 1A compositional process control model and its application to biochemical processesCatholijn M. Jonker and Andjan Treur30 November 2010 | Applied Artificial Intelligence, Vol. 16, No. 1 Recommended Vol. 06, No. 01 Metrics History PDF download
DA - 1997/3//
PY - 1997/3//
DO - 10.1142/S0218843097000021
VL - 6
IS - 1
SP - 1-2
SN - 0218-8430
ER -
TY - JOUR
TI - Estimation of the convection coefficient in elliptic equations
AU - Ito, K
AU - Kunisch, K
T2 - INVERSE PROBLEMS
AB - The parameter estimation problem for the convection coefficient in elliptic equations is considered in the class of -vector fields. The optimality system is characterized and the convergence of the gradient method is proved. To apply the SQP-method to the singular optimality system, a modification involving a feasibility step in the primal and dual variables is introduced. The resulting algorithm has a second-order convergence rate. Numerical experiments are included.
DA - 1997/8//
PY - 1997/8//
DO - 10.1088/0266-5611/13/4/007
VL - 13
IS - 4
SP - 995-1013
SN - 0266-5611
ER -
TY - JOUR
TI - Computing an eigenvector with inverse iteration
AU - Ipsen, ICF
T2 - SIAM REVIEW
AB - The purpose of this paper is two-fold: to analyze the behavior of inverse iteration for computing a single eigenvector of a complex square matrix and to review Jim Wilkinson's contributions to the development of the method. In the process we derive several new results regarding the convergence of inverse iteration in exact arithmetic. In the case of normal matrices we show that residual norms decrease strictly monotonically. For eighty percent of the starting vectors a single iteration is enough. In the case of non-normal matrices, we show that the iterates converge asymptotically to an invariant subspace. However, the residual norms may not converge. The growth in residual norms from one iteration to the next can exceed the departure of the matrix from normality. We present an example where the residual growth is exponential in the departure of the matrix from normality. We also explain the often significant regress of the residuals after the first iteration: it occurs when the non-normal part of the matrix is large compared to the eigenvalues of smallest magnitude. In this case computing an eigenvector with inverse iteration is exponentially ill conditioned (in exact arithmetic). We conclude that the behavior of the residuals in inverse iteration is governed by the departure of the matrix from normality rather than by the conditioning of a Jordan basis or the defectiveness of eigenvalues.
DA - 1997/6//
PY - 1997/6//
DO - 10.1137/S0036144596300773
VL - 39
IS - 2
SP - 254-291
SN - 1095-7200
KW - eigenvector
KW - invariant subspace
KW - inverse iteration
KW - departure from normality
KW - ill-conditioned linear system
ER -