TY - JOUR
TI - Multicast and QoS in the Jumpstart Architecture for WDM Burst-Switched Networks
AU - Baldine, I.
AU - Rouskas, G.N.
AU - Perros, H.G.
AU - Stevenson, D.
T2 - Optical Networks
DA - 2003/11//
PY - 2003/11//
VL - 4
IS - 6
SP - 68–80
ER -
TY - CHAP
TI - Routing and Wavelength Assignment in Optical WDM Networks
AU - Rouskas, George N.
T2 - Wiley Encyclopedia of Telecommunications
A2 - Proakis, J.
AB - Abstract This article discusses the routing and wavelength assignment (RWA) problem in optical networks employing wavelength division multiplexing (WDM) technology. Two variants of the problem are studied: static RWA, whereby the traffic requirements are known in advance, and dynamic RWA in which connection requests arrive in some random fashion. Both point‐to‐point and multicast traffic demands are considered.
PY - 2003/4/15/
DO - 10.1002/0471219282.eot205
PB - John Wiley & Sons, Inc.
UR - http://dx.doi.org/10.1002/0471219282.eot205
ER -
TY - JOUR
TI - Performance modeling of an edge optical burst switching node
AU - Xu, LS
AU - Perros, HG
AU - Rouskas, GN
AU - Cicekli, I
AU - Cicekli, NK
AU - Gelenbe, E
T2 - Proceedings of the 17th International Symposium on Computer and Information Sciences
DA - 2003///
PY - 2003///
SP - 377-381
ER -
TY - CHAP
TI - Performance analysis of an edge optical burst switching node with a large number of wavelengths
AU - Xu, LS
AU - Perios, HG
AU - Rouskas, GN
AU - Charzinski, J
AU - Lehnert, R
AU - TranGia, P
T2 - Providing Quality of Service in Heterogeneous Environments, Vols 5a and 5b
PY - 2003///
VL - 5A-B
SP - 891-900
PB -
SE -
ER -
TY - CHAP
TI - Optimal granularity of MPLS tunnels
AU - Rouskas, GN
AU - Jackson, LE
AU - Charzinski, J
AU - Lehnert, R
AU - TranGia, P
T2 - Providing Quality of Service in Heterogeneous Environments, Vols 5a and 5b
PY - 2003///
VL - 5A-B
SP - 1-10
PB -
SE -
ER -
TY - CHAP
TI - On optimal traffic grooming in elemental network topologies
AU - Dutta, R
AU - Huang, S
AU - Rouskas, GN
AU - Somani, AK
AU - Zhang, Z
T2 - Opticomm 2003: Optical Networking and Communications
AB - We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Our contribution is two-fold. In the first part of the paper we settle the complexity of traffic grooming in path and star networks by proving that a number of variants of the problem are computationally hard. Since routing and wavelength assignment in these two topologies is trivial, these results demonstrate that traffic grooming is itself an inherently difficult problem. Our results have implications for ring and other more general topologies, which we explore. In the second part, we design practical grooming algorithms with provable properties. Specifically, for all three topologies, we obtain a series of lower and upper bounds which are increasingly tighter but have considerably higher computational requirements; the series of upper bounds form an algorithm for the traffic grooming problem with strong performance guarantees. We also present corresponding heuristics with good performance. Our work is a first step towards a formal and systematic approach to the grooming problem in general topologies that builds upon results and algorithms for more elementary networks.
PY - 2003///
DO - 10.1117/12.533162
VL - 5285
SP - 13-24
PB -
SE -
ER -
TY - CHAP
TI - A queueing network model of an edge optical burst switching node
AU - Xu, LS
AU - Perros, HG
AU - Rouskas, GN
AU - IEEE
T2 - Ieee Infocom 2003: the Conference on Computer Communications, Vols 1-3, Proceedings
PY - 2003///
SP - 2019-2029
PB -
SE -
ER -
TY - SOUND
TI - Capacity Modelling in Production and Supply Chain Planning
AU - Asmundsson, J.
AU - Uzsoy, R.
DA - 2003/1//
PY - 2003/1//
ER -
TY - SOUND
TI - Modelling in Production and Supply Chain Planning: History and a New Approach
AU - Asmundsson, J.
AU - Uzsoy, R.
DA - 2003/2//
PY - 2003/2//
ER -
TY - SOUND
TI - Supply Chain Management: Pursuing a System-Level Understanding
AU - Uzsoy, R.
DA - 2003/3//
PY - 2003/3//
ER -
TY - CONF
TI - Supply Chain Optimization and Protocol Environment (SCOPE) for Rapid Prototyping of Supply Chains
AU - Orcun, S.
AU - Asmundsson, J.
AU - Pekny, J.
AU - Rardin, R.L.
AU - Uzsoy, R.
T2 - Conference on Industrial Engineering and Production Management
C2 - 2003/5//
C3 - Proceedings of the Conference on Industrial Engineering and Production Management
CY - Porto, Portugal
DA - 2003/5//
PY - 2003/5//
ER -
TY - JOUR
TI - Observations on the interactions among deadlock avoidance policies and dispatching rules in automated manufacturing systems
AU - Aytug, H.
AU - Barua, A.
AU - Lawley, M.
AU - Uzsoy, R.
T2 - International Journal of Production Research
AB - In automated manufacturing systems, deadlock avoidance policies guarantee deadlock-free operation while performance controllers, such as dispatching rules, attempt to achieve performance thresholds. In an automated system, dispatching rules must work within the constraints imposed by the deadlock avoidance policy in order to assure continuing system operation, and thus, the deadlock avoidance logic defines the decision space over which the dispatching rule can work. This paper investigates the interactions that arise between deadlock avoidance flexibility and the effectiveness of dispatching rules in achieving good system performance. Two major findings are that the positive effects of intelligent dispatching are highly influenced by the flexibility of the deadlock avoidance policy, and that a naÿve dispatching rule can sometimes achieve better system performance under an inflexible deadlock avoidance policy.
DA - 2003/1//
PY - 2003/1//
DO - 10.1080/00207540210163955
VL - 41
IS - 1
SP - 81-95
J2 - International Journal of Production Research
LA - en
OP -
SN - 0020-7543 1366-588X
UR - http://dx.doi.org/10.1080/00207540210163955
DB - Crossref
ER -
TY - JOUR
TI - Measures of subproblem criticality in decomposition algorithms for shop scheduling
AU - Aytug, H.
AU - Kempf, K.
AU - Uzsoy, R.
T2 - International Journal of Production Research
AB - Work centre-based decomposition approaches, especially variants of the Shifting Bottleneck algorithm, have been very successful in solving job-shop-scheduling problems. These methods decompose the problem into subproblems involving a single work centre (usually a single machine), which they solve sequentially. We propose new measures of subproblem criticality and show via computational experiments that several of these provide solutions comparable in quality with those obtained from previous work in substantially less central processing unit time.
DA - 2003/1//
PY - 2003/1//
DO - 10.1080/0020754021000037856
VL - 41
IS - 5
SP - 865-882
J2 - International Journal of Production Research
LA - en
OP -
SN - 0020-7543 1366-588X
UR - http://dx.doi.org/10.1080/0020754021000037856
DB - Crossref
ER -
TY - JOUR
TI - Enhanced Neural Network Learning Using A Fuzzy Neuron Controller
AU - Fang, S.
AU - Wu, P.
AU - Nuttle, H.L.W.
T2 - Journal of Intelligent and Fuzzy Systems
DA - 2003///
PY - 2003///
VL - 14
IS - 2
SP - 109–118
ER -
TY - JOUR
TI - On the Resolution of Finite Fuzzy Relation Equations
AU - Fang, S.
AU - Li, G.
T2 - International Mathematical Journal
DA - 2003///
PY - 2003///
VL - 3
SP - 59–72
ER -
TY - CHAP
TI - Soft Computing for Softgoods Supply Chain Analysis and Decision Support
AU - Fang, S.
AU - Nuttle, H.L.W.
AU - King, R.E.
AU - Wilson, J.R.
T2 - Soft Computing in Textile Sciences
T3 - Studies in Fuzziness and Soft Computing
AB - Research on softt computing techniques for decision support for the design and management of the softgoods supply chain are presented. In particular, this work has been directed to creating and demonstrating a fuzzy-neural softt computing framework for supply chain modeling and optimization and creating and demonstrating softt computing based approaches to capacity allocation and delivery date assignment. The former has required the development of fuzzy system identiifiication procedures, a method for constructing membership functions for fuzzy sets, and a flexible supply chain simulation capability. The paper gives an overview of this work and the prototype tools we have developed.
PY - 2003///
DO - 10.1007/978-3-7908-1750-8_1
SP - 1–15
PB - Physica-Verlag
SN - 978-3-7908-2516-9; 978-3-7908-1750-8
SV - 108
ER -
TY - CHAP
TI - Quantitative Trait Loci Mapping
AU - Zeng, Z.-B.
T2 - Nature encyclopedia of the human genome
A2 - Cooper, David
PY - 2003///
PB - Nature Publishing Group
SN - 9780333803868
ER -
TY - JOUR
TI - A two-phase approach to fuzzy system identification
AU - Hung, Ta-Wei
AU - Fang, Shu-Cherng
AU - Nuttle, Henry L. W.
T2 - Journal of Systems Science and Systems Engineering
DA - 2003/12//
PY - 2003/12//
DO - 10.1007/s11518-006-0144-4
VL - 12
IS - 4
SP - 408-423
J2 - J. Syst. Sci. Syst. Eng.
LA - en
OP -
SN - 1004-3756 1861-9576
UR - http://dx.doi.org/10.1007/s11518-006-0144-4
DB - Crossref
ER -
TY - JOUR
TI - Solution Sets of Interval-Valued Fuzzy Relational Equations
AU - Wang, Shunmin
AU - Fang, Shu-Cherng
AU - Nuttle, Henry L.W.
T2 - Fuzzy Optimization and Decision Making
DA - 2003///
PY - 2003///
DO - 10.1023/a:1022800330844
VL - 2
IS - 1
SP - 41–60
SN - 1568-4539
UR - http://dx.doi.org/10.1023/a:1022800330844
ER -
TY - JOUR
TI - Generalized Snell's Law for Weighted Minimal Surface in Heterogeneous Media
AU - Li, Zhilin
AU - Lin, Xiaobiao
AU - Torres, Monica
AU - Zhao, Hongkai
T2 - Methods and Applications of Analysis
AB - The weighted minimal surface problem in heterogeneous media is studied in this paper. The solution to the weighted minimal surface problem is continuous but the derivatives have a jump across the interface where the medium property is discontinuous. The jump condition of the derivatives derived in this paper generalized the Snell's law in geometric optics to weighted minimal surfaces of co-dimension one in any dimensional space. A numerical method based on the gradient flow and the maximum principal preserving immersed interface method is developed to solve this nonlinear elliptic interface problem with jump conditions. Numerical computations are presented to verify both the analysis and the numerical algorithm. 1. Introduction. The minimal surface problem, that is, the problem of finding the surface of the least area among all surfaces having fixed boundary data, has been extensively studied. A recent workshop on minimal surfaces presented the latest re- search on minimal surface applications in chemistry and biology (5). Many phenomena that occur in nature relate to this problem which has been a motivation for devel- oping new mathematical theories and techniques to solve the problem analytically and numerically. Minimal surfaces were shown to be important in various chemical micro-structures and their corresponding phase transitions (5). Computer graphics and image analysis use minimal surfaces frequently for boundary detection, and to construct surfaces that are visually appealing (2), (15). Soap films and other mem- branes passing through a fixed boundary provide mechanical examples of minimal surfaces (14). A related concept is the idea of capillary surfaces, which result from surface tension in liquids. These surfaces are closely related to minimal surfaces (6). For a precise mathematical description of the minimal surface problem we refer, for example, to the classical treatises (7) and (16). The minimal surface problem can be described in two different ways, using the parametric or the non-parametric formulation. In the non-parametric setting the candidate surfaces are graphs of functions, while in the parametric setting the surfaces are treated as boundaries of sets (7). The former is usually seen in more physically- based treatments of the problem, whereas the later provides an excellent framework for the mathematical analysis of minimal surfaces. When the medium is homogeneous, the energy density at each point is constant, and therefore the surface energy is equivalent to the surface area. This is the standard minimal surface problem. In this paper, we consider the weighted minimal surface problem in a heterogeneous medium in which the energy density is piecewise smooth. For example this is the case for capillary interfaces in porous media or composite materials. In particular we derive a jump condition for the weighted minimal surface at the interface between two different media. The jump condition can be regarded as a generalized Snell's law which describes the refraction of minimal surfaces instead of light rays in geometric optics.
DA - 2003///
PY - 2003///
DO - 10.4310/maa.2003.v10.n2.a3
VL - 10
IS - 2
SP - 199-214
LA - en
OP -
SN - 1073-2772 1945-0001
UR - http://dx.doi.org/10.4310/maa.2003.v10.n2.a3
DB - Crossref
ER -
TY - JOUR
TI - A Fast Finite Differenc Method For Solving Navier-Stokes Equations on Irregular Domains
AU - Li, Zhilin
AU - Wang, Cheng
T2 - Communications in Mathematical Sciences
AB - A fast finite difference method is proposed to solve the incompressible
Navier-Stokes equations defined on a general domain. The method is based
on the voricity stream-function formulation and a fast Poisson solver defined
on a general domain using the immersed interface method. The key to the new
method is the fast Poisson solver for general domains and the interpolation
scheme for the boundary condition of the stream function. Numerical examples
thats show second order accuracy of the computed solution are also provided.
DA - 2003///
PY - 2003///
DO - 10.4310/cms.2003.v1.n1.a11
VL - 1
IS - 1
SP - 180-196
LA - en
OP -
SN - 1539-6746 1945-0796
UR - http://dx.doi.org/10.4310/cms.2003.v1.n1.a11
DB - Crossref
ER -
TY - JOUR
TI - Strategic objectives for good pharmaceutical procurement
AU - Handfield, R.B.
T2 - American Pharmaceutical Outsourcing
DA - 2003///
PY - 2003///
VL - 4
IS - 5
SP - 20-26
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0242300746&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A structural model analysis of the Malcolm Baldrige National Quality Award framework
AU - Ghosh, S.
AU - Handfield, R.B.
AU - Kannan, V.R.
AU - Choon Tan, K.
T2 - International Journal of Management and Decision Making
AB - The Malcolm Baldrige National Quality Award (MBNQA) has become a model for the deployment of quality programmes. While the framework underlying the award has been used extensively by organisations, both for award and self-assessment purposes, little empirical evidence exists regarding its validity as a predictor of organisational performance. This research presents a structural equation model that explicitly tests the relationships between strategic and operational quality planning implied by the framework, and their impact on performance. Results support the theory underlying the Baldrige award. Specifically, the strategic quality planning process, mediated by the effective use of information and analysis, is the driver of operational quality planning. Positive business results are the outcome of this planning process. Results also show that customer and market focus is a crucial input to strategic quality planning, the commitment of senior leadership is critical in securing a customer and market focus, and operational level business processes are driven by a strategic commitment to human resource management.
DA - 2003///
PY - 2003///
DO - 10.1504/IJMDM.2003.003996
VL - 4
IS - 4
SP - 289-311
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-34547709566&partnerID=MN8TOARS
ER -
TY - CONF
TI - Achieving Trust via Service Graphs
AU - Yolum, Pınar
AU - Singh, Munindar P.
C2 - 2003///
C3 - Proceedings of the 6th International Workshop on Trust, Privacy, Deception, and Fraud in Agent Societies (Trust)
DA - 2003///
ER -
TY - CONF
TI - Agent-Based Architecture for Autonomic Web Service Selection
AU - Maximilien, E.Michael
AU - Singh, Munindar P.
C2 - 2003/7//
C3 - Proceedings of the 1st International Workshop on Web Services and Agent-Based Engineering (WSABE)
DA - 2003/7//
SP - 1–10
PB - AAMAS
ER -
TY - CONF
TI - An Ontology for Web Service Ratings and Reputations
AU - Maximilien, E.Michael
AU - Singh, Munindar P.
C2 - 2003/7//
C3 - Proceedings of the 1st International Workshop on Ontologies and Agent Systems (OAS).
DA - 2003/7//
VL - 73
SP - 25–30
PB - CEUR
ER -
TY - CONF
TI - Emergent Personalized Communities in Referral Networks
AU - Yolum, Pınar
AU - Singh, Munindar P.
T2 - Proceedings of the IJCAI Workshop on Intelligent Techniques for Web Personalization (ITWP'03)
C2 - 2003/8//
C3 - Proceedings of the IJCAI Workshop on Intelligent Techniques for Web Personalization
CY - Acapuolo, Mexico
DA - 2003/8//
PY - 2003/8/9/
ER -
TY - CONF
TI - State Estimation and Tracking Control of Nonlinear Dynamical Systems
AU - Banks, H.T.
AU - Beeler, S.C.
AU - Tran, H.T.
T2 - 8th International Conference on Control of Diagnostics of Processes and Systems
A2 - Desch, W.
A2 - Kappel, F.
A2 - Kunisch, K.
T3 - ISNM International Series of Numerical Mathematics
AB - In this paper state estimation and feedback tracking control methods for nonlinear systems are presented. The methods, which are based on the “state-dependent Riccati equation”, allow the construction of nonlinear estimators and nonlinear feedback tracking controls for a wide class of systems. Our emphasis will be on development of computational methods that are easily implementable as well as efficient. Simulation results of the performance of the nonlinear estimator and tracking control are included. In addition, comparisons with the linear estimator and linear tracking control found through the linearized system are also made.
C2 - 2003/7//
C3 - Control and Estimation of Distributed Parameter Systems
CY - Graz, Austria
DA - 2003/7//
PY - 2001/7//
DO - 10.1007/978-3-0348-8001-5_1
VL - 143
SP - 1–24
PB - Basel/Springer
ER -
TY - BOOK
TI - Trust, Reputation, and Security: Theories and Practice
T2 - Lecture Notes in Computer Science
A3 - Falcone, Rino
A3 - Barber, Suzanne
A3 - Korba, Larry
A3 - Singh, Munindar
DA - 2003///
PY - 2003///
DO - 10.1007/3-540-36609-1
M1 - 2631
PB - Springer
SN - 9783540009887 9783540366096
UR - http://dx.doi.org/10.1007/3-540-36609-1
ER -
TY - CONF
TI - Early decision making when using proper auxiliary signals
AU - Campbell, S.L.
AU - Drake, K.
AU - Nikoukhah, R.
T2 - IEEE Conference on Decision and Control
AB - Recently an approach for multi-model identification and failure detection in the presence of bounded energy noise over finite time intervals has been introduced. This approach involved offline computation of an auxiliary signal and online application of a hyperplane test. This approach has several advantages but as presented, observation over the full time interval was required before a decision could be made. In this paper it is shown how to modify this approach to permit early decision making with the hyperplane test.
C2 - 2003/8/27/
C3 - Proceedings of the 41st IEEE Conference on Decision and Control, 2002.
DA - 2003/8/27/
DO - 10.1109/cdc.2002.1184790
PB - IEEE
SN - 0780375165
UR - http://dx.doi.org/10.1109/cdc.2002.1184790
DB - Crossref
ER -
TY - CONF
TI - Auxiliary signal design for failure detection in uncertain sampled-data systems
AU - Nikoukhah, R.
AU - Campbell, S. L.
T2 - 2003 European Control Conference (ECC)
AB - In this paper the normal and the failed behaviors of a sampleddata system are modeled using two distinct uncertain models. A proper auxiliary signal is an input signal for which the behaviors of the two systems do not intersect making guaranteed failure detection possible. Algorithms for the design of optimal proper auxiliary signals are developed.
C2 - 2003/9//
C3 - 2003 European Control Conference (ECC)
DA - 2003/9//
DO - 10.23919/ecc.2003.7085087
PB - IEEE
SN - 9783952417379
UR - http://dx.doi.org/10.23919/ecc.2003.7085087
DB - Crossref
ER -
TY - CHAP
TI - A well-posedness Result for a Shear Wave Propagation Model
AU - Banks, H. T.
AU - Tran, H.
AU - Wynne, S.
T2 - Control and Estimation of Distributed Parameter Systems
AB - We consider a nonlinear model for propagation of shear waves in viscoelastic tissue. Existence and uniqueness results for solutions are established.
PY - 2003///
DO - 10.1007/978-3-0348-8001-5_2
SP - 25-40
OP -
PB - Birkhäuser Basel
SN - 9783034893992 9783034880015
UR - http://dx.doi.org/10.1007/978-3-0348-8001-5_2
DB - Crossref
ER -
TY - CONF
TI - Beam optics analysis - a 3D finite element charged particle code with adaptive meshing
AU - Bui, T.
AU - Vogler, B.
AU - Ives, L.
AU - Shephard, M.
AU - Klaas, O.
AU - Remacle, J.-F.
AU - Kapraun, D.
AU - Tran, H.
T2 - Third IEEE International Vacuum Electronics Conference
AB - Development of the next generation of RF devices is in progress with research on sheet beam and multiple beam devices on-going at several institutions. Analysis of inherently three dimensional devices requires a new set of analytical tools to model the electromagnetic fields and the behavior of electron and ion beams. Existing codes, such as HFSS and MAFIA, are widely used to model the electromagnetic fields in these devices, but there is a need for simple, accurate, and efficient codes to model the behavior of charged particles in 3D geometries and fields. Calabazas Creek Research, Inc. (CCR) is funded by the U.S. Department of Energy to develop a finite element, charged particle, analysis code suitable for the next generation of RF devices. The principle feature of the new program is adaptive meshing, which removes the burden for mesh generation from the user and assigns responsibility to field solver and particle pusher routines.
C2 - 2003/6/25/
C3 - Third IEEE International Vacuum Electronics Conference (IEEE Cat. No.02EX524)
DA - 2003/6/25/
DO - 10.1109/ivelec.2002.999314
PB - IEEE
SN - 0780372565
UR - http://dx.doi.org/10.1109/ivelec.2002.999314
DB - Crossref
ER -
TY - CONF
TI - SCATTER - a new computer code for modeling reflected electrons from surfaces
AU - Kapraun, D.
AU - Tran, H.
AU - Ives, R.L.
AU - Vogler, W.
AU - Bui, T.
T2 - Third IEEE International Vacuum Electronics Conference
AB - Calabazas Creek Research, Inc. is funded by the U.S. Department of Energy to develop an advanced charged particle code using adaptive meshing. One of the tasks in that program is to model secondary and reflected electrons in collectors. The Center for Research in Scientific Computing (CRSC) received a subcontract to develop a 3D Monte Carlo technique for modeling these electrons. Taking into account the energy and direction of an incident electron, as well as the atomic number, atomic mass and density of the solid, the program calculates a statistically reasonable path for the electron through the solid via Monte Carlo techniques. When applied to large numbers of electrons, the algorithm provides statistically accurate results. The success of the effort resulted in a stand-alone code that could be use to investigate the effect of various materials and coatings to reduce the emission and there by achieve higher depressed collector efficiencies.
C2 - 2003/6/25/
C3 - Third IEEE International Vacuum Electronics Conference (IEEE Cat. No.02EX524)
DA - 2003/6/25/
DO - 10.1109/ivelec.2002.999300
PB - IEEE
SN - 0780372565
UR - http://dx.doi.org/10.1109/ivelec.2002.999300
DB - Crossref
ER -
TY - JOUR
TI - Agent communication languages: Rethinking the principles
T2 - Computer
AB - Agent communication languages have been used for years in proprietary multiagent systems. Yet agents from different vendors-or even different research projects-cannot communicate with each other. The author looks at the underlying reasons and proposes a conceptual shift from individual agent representations to social interaction.
DA - 2003///
PY - 2003///
DO - 10.1109/2.735849
UR - https://publons.com/publon/21294490/
ER -
TY - JOUR
TI - Trustworthy service caching: Cooperative search in P2P information systems
AU - Udupi, Y. B.
AU - Yolum, P.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - We are developing an approach for P2P information systems, where the peers are modelled as autonomous agents. Agents provide services or give referrals to one another to help find trustworthy services. We consider the important case of information services that can be cached. Agents request information services through high-level queries, not by describing specific objects as in caching in traditional distributed systems. Moreover, the agents autonomously decide whom to contact for a service, whom to provide a service or referral, whether to follow a referral and whether to cache a service. Thus the information system itself evolves as agents learn about each other and the contents of the caches of the agents change. We study here the effect of caching on service location and on the information system itself. Our main results are that, (1) even with a small cache, agents can locate services more easily; (2) since the agents that cache services can act like service providers, a small number of initial service providers are enough to serve the information needs of the consumers; and (3) agents benefit from being neighbours with others who have similar interests.
DA - 2003///
PY - 2003///
DO - 10.1007/978-3-540-25943-5_3
VL - 3030
SP - 32–44
UR - https://publons.com/publon/13073983/
ER -
TY - BOOK
TI - Trustworthy service composition: Challenges and research questions
AU - Singh, M.P.
DA - 2003///
PY - 2003///
VL - 2631
SE - 39-52
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-7044270651&partnerID=MN8TOARS
ER -
TY - CONF
TI - The future of agent communication
AU - Singh, M.P.
C2 - 2003///
C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
DA - 2003///
VL - 2650
SP - 318-322
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144467458&partnerID=MN8TOARS
ER -
TY - CONF
TI - Searching Social Networks
AU - Yu, B.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 65-72
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142305174&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Preface
AU - Falcone, R.
AU - Barber, S.
AU - Korba, L.
AU - Singh, M.
DA - 2003///
PY - 2003///
VL - 2631
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84945527959&partnerID=MN8TOARS
ER -
TY - CONF
TI - Peer-to-peer computing for information systems
AU - Singh, M.P.
C2 - 2003///
C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
DA - 2003///
VL - 2530
SP - 15-20
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144433600&partnerID=MN8TOARS
ER -
TY - CONF
TI - Engineering Commitment-Based Multiagent Systems: A Temporal Logic Approach
AU - Xing, J.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the International Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 891-898
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142292521&partnerID=MN8TOARS
ER -
TY - CONF
TI - Emergent Properties of Referral Systems
AU - Yolum, P.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 592-599
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142293029&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Dynamic communities in referral networks
AU - Yolum, P.
AU - Singh, M.P.
T2 - Web Intelligence and Agent Systems
DA - 2003///
PY - 2003///
VL - 1
IS - 2
SP - 105-116
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2942625505&partnerID=MN8TOARS
ER -
TY - CONF
TI - Distributed Enactment of Multiagent Workflows: Temporal Logic for Web Service Composition
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 907-914
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142268242&partnerID=MN8TOARS
ER -
TY - CONF
TI - Detecting Deception in Reputation Management
AU - Yu, B.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 73-80
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142293052&partnerID=MN8TOARS
ER -
TY - CONF
TI - Ladders of Success: An Empirical Approach to Trust
AU - Yolum, P.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 1168-1169
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142280376&partnerID=MN8TOARS
ER -
TY - CONF
TI - Incentive mechanisms for peer-to-peer systems
AU - Yu, B.
AU - Singh, M.P.
C2 - 2003///
C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
DA - 2003///
VL - 2872
SP - 77-88
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144440546&partnerID=MN8TOARS
ER -
TY - CONF
TI - Commitments and Causality for Multiagent Design
AU - Wan, F.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the Interantional Conference on Autonomous Agents
DA - 2003///
VL - 2
SP - 749-756
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1142280922&partnerID=MN8TOARS
ER -
TY - CONF
TI - Agent communication languages: Rethinking the principles
AU - Singh, M.P.
C2 - 2003///
C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
DA - 2003///
VL - 2650
SP - 37-50
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144466430&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A community-based approach for selecting service providers
T2 - ICWS'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON WEB SERVICES
DA - 2003///
PY - 2003///
UR - https://publons.com/publon/21294494/
ER -
TY - CONF
TI - An agent-based approach for trustworthy service location
AU - Yolum, P.
AU - Singh, M.P.
C2 - 2003///
C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
DA - 2003///
VL - 2530
SP - 45-56
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144447427&partnerID=MN8TOARS
ER -
TY - CONF
TI - A Community-Based Approach for Selecting Service Providers
AU - Sreenath, R.M.
AU - Singh, M.P.
C2 - 2003///
C3 - Proceedings of the International Conference on Web Services
DA - 2003///
SP - 177-183
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-1642355971&partnerID=MN8TOARS
ER -
TY - JOUR
TI - SATbed User Documentation
AU - Stallmann, Matthias F
AU - Brglez, Franc
AU - Li, Xiao Yu
DA - 2003///
PY - 2003///
UR - https://people.engr.ncsu.edu/mfms/Publications/2003-SATbed-home-guide.pdf
ER -
TY - CONF
TI - SATbed: A Configurable Environment for Reliable Performance Experiments with SAT Instance Classes and Algorithms
AU - Brglez, Franc
AU - Stallmann, Matthias F
AU - Li, Xiao Yu
T2 - Citeseer
C2 - 2003///
C3 - Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing
DA - 2003///
SP - 5-8
ER -
TY - CONF
TI - QingTing: a fast SAT solver using local search and efficient unit propagation
AU - Li, Xiao Yu
AU - Stallmann, Matthias F
AU - Brglez, Franc
C2 - 2003///
C3 - Sixth International Conference on Theory and Applications of Satisfiability Testing
DA - 2003///
VL - 1
ER -
TY - CONF
TI - A local search SAT solver using an effective switching strategy and an efficient unit propagation
AU - Li, Xiao Yu
AU - Stallmann, Matthias F
AU - Brglez, Franc
T2 - Springer, Berlin, Heidelberg
C2 - 2003///
C3 - International Conference on Theory and Applications of Satisfiability Testing
DA - 2003///
SP - 53-68
ER -
TY - CONF
TI - Numerical Tools for the Study of Instabilities within the Positive-Differential-Resistance Regions of Tunnelling Devices
AU - Lasater, M S
AU - Kelley, C T
AU - Zhao, P
AU - Woolard, D L
T2 - North Carolina State University, Center for Research in Scientific Computation
C2 - 2003///
C3 - Proceedings of 2003 3nd IEEE Conference on Nanotechnology, San Francisco, CA, August 12--14, 2003
DA - 2003///
SP - 390-393
M1 - CRSC-TR03-23
PB - IEEE
ER -
TY - BOOK
TI - Solving Nonlinear Equations with Newton's Method
AU - Kelley, C T
DA - 2003///
PY - 2003///
PB - SIAM
ER -
TY - JOUR
TI - Globally Convergent Algorithms for Nonsmooth Nonlinear Equations in Computational Fluid Dynamics
AU - Coffey, T S
AU - McMullan, R J
AU - Kelley, C T
AU - McRae, D S
T2 - J. Comp. Appl. Math.
DA - 2003///
PY - 2003///
VL - 152
SP - 69-81
ER -
TY - CONF
TI - Implicit filtering and nonlinear least squares problems
AU - Kelley, C T
A2 - Sachs, E W
A2 - Tichatschke, R
C2 - 2003///
C3 - System Modeling and Optimization XX
CY - Dordrecht
DA - 2003///
SP - 71-90
PB - Kluwer Academic Publishers
ER -
TY - RPRT
TI - Implicit filtering and nonlinear least squares problems
AU - Kelley, C T
A3 - Kluwer Academic Publishers
DA - 2003/7//
PY - 2003/7//
SP - 71-90
M1 - CRSC-TR01-17
PB - Kluwer Academic Publishers
SN - CRSC-TR01-17
ER -
TY - JOUR
TI - Electronic Supplement to ``{O}ptimal Design for Problems Involving Flow and Transport Phenomena in Saturated Subsurface Systems''
AU - Mayer, A S
AU - Kelley, C T
AU - Miller, C T
DA - 2003///
PY - 2003///
ER -
TY - JOUR
TI - Auxiliary signal design for robust active failure detection: the general cost case
AU - Nikoukhah, R.
AU - Campbell, S.L.
T2 - Proc. Safeprocess 2003
DA - 2003///
PY - 2003///
SP - 259–264
ER -
TY - CONF
TI - Minimizing WIP for job shop problems while satisfying due dates
AU - Schultz, S.R.
AU - Coley, A.L.
AU - Hodgson, T.J.
AU - King, R.E.
AU - Thoney, K.A.
C2 - 2003///
C3 - Proceedings of the 2003 Industrial Engineering Research Conference
DA - 2003///
ER -
TY - CHAP
TI - Fuzzy Data Envelopment Analysis: A Credibility Approach
AU - Lertworasirikul, Saowanee
AU - Fang, Shu-Cherng
AU - Joines, Jeffrey A.
AU - Nuttle, Henry L. W.
T2 - Fuzzy Sets Based Heuristics for Optimization
A2 - Verdegay, J.L.
T3 - Studies in Fuzziness and Soft Computing
AB - While the traditional data envelopment analysis (DEA) requires precise input and output data, available data is usually imprecise and vague. “Fuzzy DEA” integrates the concept of fuzzy set theory with the traditional DEA by representing imprecise and vague data with fuzzy sets. In this paper, a credibility approach is proposed as a way to solve the fuzzy DEA model. The approach transforms a fuzzy DEA model into a well-defined credibility programming model, in which fuzzy variables are replaced by “expected credits” in terms of credibility measures. It is shown that when the membership functions of fuzzy data are trapezoidal, the credibility programming model becomes a linear programming model. Numerical examples are given to illustrate the proposed approach and results are compared with those obtained with alternative approaches.
PY - 2003///
DO - 10.1007/978-3-540-36461-0_10
SP - 141–158
PB - Springer
SN - 9783642056116 9783540364610
SV - 126
UR - http://dx.doi.org/10.1007/978-3-540-36461-0_10
ER -
TY - CONF
TI - Factory scheduling: implementing a simulation-based scheduling system for a two-plant operation
AU - Joines, Jeffrey A
AU - Sutton, Andrew B
AU - Thoney, Kristin
AU - King, Russell E
AU - Hodgson, Thom J
T2 - Winter Simulation Conference
C2 - 2003///
C3 - Proceedings of the 35th conference on Winter simulation: driving innovation
DA - 2003///
SP - 1440-1448
ER -
TY - JOUR
TI - Fabric defect detection using a GA tuned wavelet filter
AU - Brenzovich, Joseph Andrew
DA - 2003///
PY - 2003///
ER -
TY - CONF
TI - Fabric Defect Detection Using a GA Tuned Wavelet Filter.
AU - Jasper, Warren
AU - Joines, Jeffrey A
AU - Brenzovich, Joe
C2 - 2003///
C3 - Computers and Their Applications
DA - 2003///
SP - 345-350
ER -
TY - JOUR
TI - A Genetic Algorithm for Function Optimization: A Matlab Implementation.
T2 - Research Journal of Microbiology
DA - 2003///
PY - 2003///
VL - 1
IS - 6
SP - 979-985
ER -
TY - CONF
TI - New GA approaches for pipe support optimization
C2 - 2003///
C3 - Proceedings of the Structures Congress and Exposition
DA - 2003///
SP - 61-62
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-22344433506&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Asynchronous genetic algorithms for heterogeneous networks using coarse-grained dataflow
DA - 2003///
PY - 2003///
VL - 2723
SE - 730-741
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35248893482&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Control Systems at ITMA 2003
AU - Barnhardt, R.
AU - Hinestroza, J.
AU - Joines, J.A.
T2 - Journal of Textile and Apparel, Technology and Management
DA - 2003///
PY - 2003///
VL - 3
IS - 3
ER -
TY - CONF
TI - Fabric Defect Detection Using a GA Tuned Wavelet Filter
AU - W., Jasper
AU - Joines, J.A.
AU - Brenzovich, J.
C2 - 2003///
C3 - Proceedings of the ISCA Conference on Computers and Applications
DA - 2003///
SP - 345–349
ER -
TY - CONF
TI - Fabric defect detection using a GA tuned wavelet filter
AU - Jasper W., Joines
AU - J. A.,
AU - Brenzovich, J.
C2 - 2003///
C3 - Computers and their applications : proceedings of the ISCA 18th international conference, Honolulu, Hawaii, USA March 26-28, 2003
DA - 2003///
SP - 345-349
PB - Cary, NC: International Society for Computers and Their Applications
SN - 9781880843468
ER -
TY - JOUR
TI - Rolling horizon scheduling of multi-factory supply chains
AU - Cho, EG
AU - Thoney, KA
AU - Hodgson, TJ
AU - King, RE
T2 - PROCEEDINGS OF THE 2003 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2
AB - The virtual factory is a job shop scheduling tool that was developed at NC State. It has been found to provide near-optimal solutions to industrial-sized problems in seconds. Recently, the virtual factory was expanded to include interfactory transportation operations, which enabled the detailed scheduling of entire multifactory manufacturing supply chains. Separately, a rolling horizon procedure was developed to test the virtual factory for single factory problems. This procedure allowed us to more accurately predict how the virtual factory would perform in industry. Consequently, the rolling horizon procedure was extended to multifactory settings to gauge industrial performance and eliminate transient effects found in previous multifactory experimentation. Experimental results, under a variety of different scenarios, indicate that the virtual factory also performs well in multifactory, rolling horizon settings.
DA - 2003///
PY - 2003///
DO - 10.1109/wsc.2003.1261583
SP - 1409-1416
ER -
TY - CONF
TI - Implementing a simulation-based scheduling system for a two-plant operation
AU - Joines, J.A.
AU - Sutton, A.W.
AU - Thoney, K.A
AU - King, R.E.
AU - Hodgson, T.J.
AB - Scheduling any complicated job shop becomes increasingly more difficult when the cycle time is reduced. We discuss the implementation of a simulation-based scheduling system that properly schedules parts in a two-plant operation. The system has allowed the company to reduce the cycle time by at least a week from two/three weeks to one/two weeks. As part of the project, the generation of the input data needed to drive the simulation is also discussed since this data did not exist in the correct form. The model generation, simulation development, and experimentation will be discussed. The system that is described is currently being used to generate the schedules.
C2 - 2003///
C3 - Proceedings of the 2003 Winter Simulation Conference: Fairmont Hotel, New Orleans, LA, U.S.A., December 7-10, 2003
DA - 2003///
DO - 10.1109/wsc.2003.1261587
PB - Association for Computing Machinery
SN - 9780780381315
ER -
TY - JOUR
TI - Fuzzy BCC Model for Data Envelopment Analysis
AU - Lertworasirikul, Saowanee
AU - Fang, Shu-Cherng
AU - Nuttle, Henry L. W.
AU - Joines, Jeffrey A.
T2 - Fuzzy Optimization and Decision Making
DA - 2003/12//
PY - 2003/12//
DO - 10.1023/b:fodm.0000003953.39947.b4
VL - 2
IS - 4
SP - 337-358
J2 - Fuzzy Optimization and Decision Making
LA - en
OP -
SN - 1568-4539
UR - http://dx.doi.org/10.1023/b:fodm.0000003953.39947.b4
DB - Crossref
ER -
TY - JOUR
TI - What's happening to the U. S. textile industry?: Reflections on NAFTA and U.S. corporate strategies
AU - Suh, M.
T2 - Journal of Fashion Marketing and Management
DA - 2003///
PY - 2003///
VL - 7
IS - 2
SP - 119-137
ER -
TY - JOUR
TI - Measuring the thickness variation of fiber bundle with twists by a flying laser spot scanning method
AU - Suh, M.
AU - Huh, Y.
T2 - Textile Research Journal
DA - 2003///
PY - 2003///
VL - 73
IS - 9
ER -
TY - CONF
TI - Traffic grooming in path, star and tree networks: complexity, bounds, and algorithms
AU - Dutta, Rudra
AU - Huang, S
AU - Rouskas, George
AB - No abstract available.
C2 - 2003///
C3 - Proceedings of the ACM Sigmetrics, International Conference on Measurement and Modeling of Computer Systems
DA - 2003///
DO - 10.1145/781027.781066
SP - 298–299
SN - 1581136641
ER -
TY - CONF
TI - On optimal traffic grooming in elemental network topologies.
AU - Dutta, R.
AU - Huang, S.
AU - Rouskas, G.
C2 - 2003///
C3 - Proceedings of Opticomm 2003
DA - 2003///
VL - 5285
ER -
TY - JOUR
TI - Anti-lecture hall compositions
AU - Corteel, S.
AU - Savage, Carla
T2 - Discrete Mathematics
AB - We study the set Ak of integer sequences λ=(λ1,…,λk), defined byλ11⩾λ22⩾⋯λkk⩾0and show that the generating function is∑λ∈Akq|λ|=∏i=1k1+qi1−qi+1,where |λ|=λ1+⋯+λk. We establish this by giving a bijective proof of the following refinement:∑λ∈Akq|λ|u|⌊λ⌋|vo(⌊λ⌋)=∏i=1k1+uvqi1−u2qi+1.To our knowledge this is a new result that complements the family of the Lecture Hall Theorems (Ramanujan J. 1(1,2) (1997) 101, 165; J. Combin. Theory Ser. A 86(1) (1999) 63).
DA - 2003///
PY - 2003///
DO - 10.1016/S0012-365X(02)00768-9
VL - 263
IS - 1-3
SP - 275–280
ER -
TY - BOOK
TI - Research Directions in Distributed Parameter Systems
AU - Smith, Ralph
AU - Demetriou, M.
A3 - Smith, Ralph C.
A3 - Demetriou, Michael A.
AB - Research Directions in Distributed Parameter Systems is composed of eleven chapters, written by experts in their respective fields, on topics ranging from control of the Navier-Stokes equations to nondestructive evaluation - all of which are modeled by distributed parameters systems. Written by the plenary speakers for the Conference on Future Directions in Distributed Parameter Systems (October 2000), the volume addresses the state of the art, open questions, and important research directions in applications modeled by partial differential equations and delay systems, with the ultimate goal of passing along these perspectives to researchers in the field.
CN - QA402.3 .R48 2003
DA - 2003/1//
PY - 2003/1//
DO - 10.1137/1.9780898717525
OP -
PB - Society for Industrial and Applied Mathematics
SN - 9780898715484 9780898717525
UR - http://dx.doi.org/10.1137/1.9780898717525
DB - Crossref
ER -
TY - JOUR
TI - Resolving commitments among autonomous agents
AU - Mallya, A. U.
AU - Yolum, P.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Commitments are a powerful representation for modeling multiagent interactions. Previous approaches have considered the semantics of commitments and how to check compliance with them. However, these approaches do not capture some of the subtleties that arise in real-life applications, e.g., e-commerce, where contracts and institutions have implicit temporal references. The present paper develops a rich representation for the temporal content of commitments. This enables us to capture realistic contracts and institutions rigorously, and avoid subtle ambiguities. Consequently, this approach enables us to reason about whether and when exactly a commitment is satisfied or breached and whether it is or ever becomes unenforceable.
CN - QA76.76 .I58 I5925 2003
DA - 2003///
PY - 2003///
DO - 10.1007/978-3-540-24608-4_10
VL - 2922
SP - 166–182
UR - https://publons.com/publon/13074008/
ER -
TY - JOUR
TI - Nonmonotonic commitment machines
AU - Chopra, A.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Protocols for multiagent interaction need to be flexible because of the open and dynamic nature of multiagent systems. Such protocols cannot be modeled adequately via finite state machines (FSMs) as FSM representations lead to rigid protocols. We propose a commitment-based formalism called Nonmonotonic Commitment Machines (NCMs) for representing multiagent interaction protocols. In this approach, we give semantics to states and actions in a protocol in terms of commitments. Protocols represented as NCMs afford the agent flexibility in interactions with other agents. In particular, situations in protocols when nonmonotonic reasoning is required can be efficiently represented in NCMs.
CN - QA76.76 .I58 I5925 2003
DA - 2003///
PY - 2003///
DO - 10.1007/978-3-540-24608-4_11
VL - 2922
SP - 183–200
UR - https://publons.com/publon/21294496/
ER -
TY - JOUR
TI - Estimating single cotton fiber tensile properties from the load-elongation curves of slack bundles
AU - Cui, XL
AU - Suh, MW
AU - Sasser, PE
T2 - TEXTILE RESEARCH JOURNAL
AB - A method has been developed to estimate single cotton fiber tensile properties from load-elongation curves of slack fiber bundles. The method is applied to bundle load- elongation curves from HVI tests to estimate the averages of fiber breaking strength, elongation, and crimp. The estimated values are compared with single fiber tensile properties obtained from a Mantis® single fiber tester.
DA - 2003/12//
PY - 2003/12//
DO - 10.1177/004051750307301207
VL - 73
IS - 12
SP - 1066-1070
SN - 1746-7748
ER -
TY - JOUR
TI - The future of agent communication
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - This short note discusses trends in computing environments where agent communication will have the most value. The main emerging trend in computing is toward openness, that is, toward large systems with dynamically changing, autonomous, heterogeneous components. This trend speaks the end of architecture in the traditional sense. More importantly, it emphasizes on declaratively specified interactions, that is, arms-length relationships, among independent components. Agents and multiagent systems provide key abstractions for computing in open settings. In particular, agent communications will be a key means for structuring distributed computations.
CN - QA76.76.I58 C64 2003
DA - 2003///
PY - 2003///
DO - 10.1007/978-3-540-44972-0_18
VL - 2650
SP - 318–322
UR - https://publons.com/publon/21294492/
ER -
TY - JOUR
TI - Spatial autoregression model: strong consistency
AU - Bhattacharyya, BB
AU - Ren, JJ
AU - Richardson, GD
AU - Zhang, J
T2 - STATISTICS & PROBABILITY LETTERS
AB - Abstract Let ( α n , β n ) denote the Gauss–Newton estimator of the parameter (α,β) in the autoregression model Zij=αZi−1,j+βZi,j−1−αβZi−1,j−1+eij. It is shown in an earlier paper that when α=β=1, {n 3/2 ( α n −α, β n −β)} converges in distribution to a bivariate normal random vector. A two-parameter strong martingale convergence theorem is employed here to prove that n r ( α n −α, β n −β)→ 0 almost surely when r 3 2 .
DA - 2003/11/1/
PY - 2003/11/1/
DO - 10.1016/j.spl.2003.07.004
VL - 65
IS - 2
SP - 71-77
SN - 0167-7152
KW - spatial autoregression
KW - unit roots
KW - two-parameter martingale
ER -
TY - JOUR
TI - Relaxed conditions for radial-basis function networks to be universal approximators
AU - Liao, Y
AU - Fang, SC
AU - Nuttle, HLW
T2 - NEURAL NETWORKS
AB - In this paper, we investigate the universal approximation property of Radial Basis Function (RBF) networks. We show that RBFs are not required to be integrable for the REF networks to be universal approximators. Instead, RBF networks can uniformly approximate any continuous function on a compact set provided that the radial basis activation function is continuous almost everywhere, locally essentially bounded, and not a polynomial. The approximation in L(p)(micro)(1 < or = p < infinity) space is also discussed. Some experimental results are reported to illustrate our findings.
DA - 2003/9//
PY - 2003/9//
DO - 10.1016/S0893-6080(02)00227-7
VL - 16
IS - 7
SP - 1019-1028
SN - 0893-6080
KW - universal approximation
KW - radial-basis function networks
ER -
TY - JOUR
TI - Recent results from the national spherical torus experiment
AU - Maingi, R
AU - Bell, MG
AU - Bell, RE
AU - Bialek, J
AU - Bourdelle, C
AU - Bush, CE
AU - Darrow, DS
AU - Fredrickson, ED
AU - Gates, DA
AU - Gilmore, M
AU - Gray, T
AU - Jarboe, TR
AU - Johnson, DW
AU - Kaita, R
AU - Kaye, SM
AU - Kubota, S
AU - Kugel, HW
AU - LeBlanc, BP
AU - Maqueda, RJ
AU - Mastrovito, D
AU - Medley, SS
AU - Menard, JE
AU - Mueller, D
AU - Nelson, BA
AU - Ono, M
AU - Paoletti, F
AU - Park, HK
AU - Paul, SF
AU - Peebles, T
AU - Peng, YKM
AU - Phillips, CK
AU - Raman, R
AU - Rosenberg, AL
AU - Roquemore, AL
AU - Ryan, PM
AU - Sabbagh, SA
AU - Skinner, CH
AU - Soukhanovskii, VA
AU - Stutman, D
AU - Swain, DW
AU - Synakowski, EJ
AU - Taylor, G
AU - Wilgen, J
AU - Wilson, , JR
AU - Wurden, GA
AU - Zweben, SJ
T2 - PLASMA PHYSICS AND CONTROLLED FUSION
AB - The National Spherical Torus Experiment (NSTX) is a low aspect-ratio fusion research facility whose research goal is to make a determination of the attractiveness of the spherical torus concept in the areas of high-β stability, confinement, current drive, and divertor physics. Remarkable progress was made in extending the operational regime of the device in FY 2002. In brief, βt of 34% and βN of 6.5 were achieved. H-mode became the main operational regime, and energy confinement exceeded conventional aspect-ratio tokamak scalings. Heating was demonstrated with the radiofrequency antenna, and signatures of current drive were observed. Current initiation with coaxial helicity injection produced discharges of 400 kA, and first measurements of divertor heat flux profiles in H-mode were made.
DA - 2003/5//
PY - 2003/5//
DO - 10.1088/0741-3335/45/5/310
VL - 45
IS - 5
SP - 657-669
SN - 1361-6587
ER -
TY - JOUR
TI - Peer-to-peer computing for information systems
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
CN - TK5105.525 .A615 2003
DA - 2003///
PY - 2003///
DO - 10.1007/3-540-45074-2_2
VL - 2530
SP - 15–20
UR - https://publons.com/publon/21294489/
ER -
TY - JOUR
TI - Identification of contact regions in semiconductor transistors by level-set methods
AU - Fang, WF
AU - Ito, K
T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
AB - In this paper we present the formulation of level-set methods for the inverse problem of identifying an interface in the coefficient of an elliptic equation from a boundary measurement. This problem arises from the modeling of the identification of contact regions by boundary measurements for semiconductor transistors. We propose the Gauss–Newton direction as the interface velocity, and implement the scheme for a parameterized class of interfaces.
DA - 2003/10/15/
PY - 2003/10/15/
DO - 10.1016/S0377-0427(03)00543-0
VL - 159
IS - 2
SP - 399-410
SN - 0377-0427
KW - inverse problem
KW - level-set methods
KW - semiconductor
ER -
TY - JOUR
TI - An agent-based approach for trustworthy service location
AU - Yolum, P.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
CN - TK5105.525 .A615 2003
DA - 2003///
PY - 2003///
DO - 10.1007/3-540-45074-2_5
VL - 2530
SP - 45–56
UR - https://publons.com/publon/13073998/
ER -
TY - CHAP
TI - Agent communication languages: Rethinking the principles
AU - Singh, M. P.
T2 - Communication in multiagent systems: Agent communication languages and conversation policies
AB - Agent communication languages have been used for years in proprietary multiagent systems. Yet agents from different vendors—or even different research projects—cannot communicate with each other. The author looks at the underlying reasons and proposes a conceptual shift from individual agent representations to social interaction.
CN - QA76.76.I58 C64 2003
PY - 2003///
DO - 10.1007/978-3-540-44972-0_2
VL - 2650
SP - 37-50
PB - Berlin; New York: Springer
SN - 354040385X
ER -
TY - JOUR
TI - A Free Energy Model for Hysteresis in Ferroelectric Materials
AU - Smith, Ralph C.
AU - Seelecke, Stefan
AU - Ounaies, Zoubeida
AU - Smith, Joshua
T2 - Journal of Intelligent Material Systems and Structures
AB - This paper provides a theory for quantifying the hysteresis and constitutive nonlinearities inherent to piezoceramic compounds through a combination of free energy analysis and stochastic homogenization techniques. In the first step of the model development, Helmholtz and Gibbs free energy relations are constructed at the lattice or domain level to quantify the relation between the field and polarization in homogeneous, single crystal compounds which exhibit uniform effective fields. The effects of material nonhomogeneities, polycrystallinity, and variable effective fields are subsequently incorporated through the assumption that certain physical parameters, including the local coercive and effective fields, are randomly distributed and hence manifestations of stochastic density functions associated with the material. Stochastic homogenization in this manner provides low-order macroscopic models with effective parameters that can be correlated with physical properties of the data. This facilitates the identification of parameters for model construction, model updating to accommodate changing operating conditions, and control design utilizing model-based inverse compensators. Attributes of the model, including the guaranteed closure of biased minor loops in quasistatic drive regimes, are illustrated through examples.
DA - 2003/11//
PY - 2003/11//
DO - 10.1177/1045389X03038841
VL - 14
IS - 11
SP - 719-739
J2 - Journal of Intelligent Material Systems and Structures
LA - en
OP -
SN - 1045-389X 1530-8138
UR - http://dx.doi.org/10.1177/1045389x03038841
DB - Crossref
KW - hysteresis model
KW - ferroelectric materials
KW - piezoceramic compounds
ER -
TY - JOUR
TI - A domain wall model for hysteresis in ferroelastic materials
AU - Massad, J. E.
AU - Smith, Ralph
T2 - Journal of Intelligent Material Systems and Structures
DA - 2003///
PY - 2003///
DO - 10.1177/104538903035235
VL - 14
IS - 7
SP - 455–471
ER -
TY - JOUR
TI - The immersed interface method for elasticity problems with interfaces
AU - Yang, X. Z.
AU - Li, B.
AU - Li, Z. L.
T2 - Dynamics of Continuous, Discrete & Impulsive Systems. Series A, Mathematical Analysis
DA - 2003///
PY - 2003///
VL - 10
IS - 5
SP - 783-808
ER -
TY - JOUR
TI - Optimal quantization of periodic task requests on multiple identical processors
AU - Jackson, LE
AU - Rouskas, GN
T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
AB - We simplify the periodic tasks scheduling problem by making a trade off between processor load and computational complexity. A set N of periodic tasks, each characterized by its density /spl rho//sub i/, contains n possibly unique values of /spl rho//sub i/. We transform N through a process called quantization, in which each /spl rho/i /spl isin/ N is mapped onto a service level s/sub j/ /spl isin/ L, where |L| = l /spl Lt/ n and /spl rho//sub i/ /spl les/ s/sub j/, (this second condition differentiates this problem from the p-median problem on the real line). We define the periodic task quantization problem with deterministic input (PTQ-D) and present an optimal polynomial time dynamic programming solution. We also introduce the problem PTQ-S (with stochastic input) and present an optimal solution. We examine, in a simulation study, the trade off penalty of excess processor load needed to service the set of quantized tasks over the original set, and find that, through quantization onto as few as 15 or 20 service levels, no more than 5 percent processor load is required above the amount requested. Finally, we demonstrate that the scheduling of a set of periodic tasks is greatly simplified through quantization and we present a fast online algorithm that schedules quantized periodic tasks.
DA - 2003/8//
PY - 2003/8//
DO - 10.1109/TPDS.2003.1225058
VL - 14
IS - 8
SP - 795-806
SN - 1045-9219
KW - multiprocessor scheduling
KW - periodic tasks scheduling
KW - quantization
ER -
TY - JOUR
TI - Optimal one-page tree embeddings in linear time
AU - Hochberg, RA
AU - Stallmann, MF
T2 - INFORMATION PROCESSING LETTERS
AB - In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for trees algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach [SIAM J. Comput. 8 (1979) 15-32] and Chung [Comput. Math. Appl. 10 (1984) 43-60], respectively. We present a linear-time algorithm for finding the optimal embedding (arrangement) in a restricted but important class of embeddings called one-page embeddings.
DA - 2003/7/31/
PY - 2003/7/31/
DO - 10.1016/S0020-0190(03)00261-8
VL - 87
IS - 2
SP - 59-66
SN - 1872-6119
KW - algorithms
KW - optimal embedding
KW - one-page embedding
KW - anchored tree
ER -
TY - JOUR
TI - On the physical and logical topology design of large-scale optical networks
AU - Xin, YF
AU - Rouskas, George
AU - Perros, HG
T2 - Journal of Lightwave Technology
DA - 2003///
PY - 2003///
DO - 10.1109/JLT.2002.810075
VL - 21
IS - 4
SP - 904-915
ER -
TY - JOUR
TI - Delay-based congestion avoidance for TCP
AU - Martin, J
AU - Nilsson, A
AU - Rhee, I
T2 - IEEE-ACM TRANSACTIONS ON NETWORKING
AB - The set of TCP congestion control algorithms associated with TCP-Reno (e.g., slow-start and congestion avoidance) have been crucial to ensuring the stability of the Internet. Algorithms such as TCP-NewReno (which has been deployed) and TCP-Vegas (which has not been deployed) represent incrementally deployable enhancements to TCP as they have been shown to improve a TCP connection's throughput without degrading performance to competing flows. Our research focuses on delay-based congestion avoidance algorithms (DCA), like TCP-Vegas, which attempt to utilize the congestion information contained in packet round-trip time (RTT) samples. Through measurement and simulation, we show evidence suggesting that a single deployment of DCA (i.e., a TCP connection enhanced with a DCA algorithm) is not a viable enhancement to TCP over high-speed paths. We define several performance metrics that quantify the level of correlation between packet loss and RTT. Based on our measurement analysis, we find that, although there is useful congestion information contained within RTT samples, the level of correlation between an increase in RTT and packet loss is not strong enough to allow a TCP-sender to improve throughput reliably. While DCA is able to reduce the packet loss rate experienced by a connection, in its attempts to avoid packet loss, the algorithm reacts unnecessarily to RTT variation that is not associated with packet loss. The result is degraded throughput as compared to a similar flow that does not support DCA.
DA - 2003/6//
PY - 2003/6//
DO - 10.1109/TNET.2003.813038
VL - 11
IS - 3
SP - 356-369
SN - 1558-2566
KW - TCP congestion control
KW - delay-based congestion avoidance (DCA)
KW - TCP/Vegas
KW - loss and round-trip time (RTT) correlation patterns
ER -
TY - CHAP
TI - Asynchronous genetic algorithms for heterogenous networks using course-grained dataflow
AU - Baugh, J. W.
AU - Kumar, S. V.
T2 - Genetic and evolutionary computation--GECCO 2003: Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003: Proceedings
AB - Genetic algorithms (GAs) are an attractive class of techniques for solving a variety of complex search and optimization problems. Their implementation on a distributed platform can provide the necessary computing power to address large-scale problems of practical importance. On heterogeneous networks, however, the performance of a global parallel GA can be limited by synchronization points during the computation, particularly those between generations. We present a new approach for implementing asynchronous GAs based on the dataflow model of computation — an approach that retains the functional properties of a global parallel GA. Experiments conducted with an air quality optimization problem and others show that the performance of GAs can be substantially improved through dataflow-based asynchrony.
CN - QA402.5 .G4563 2003 v.1-2
PY - 2003///
DO - 10.1007/3-540-45105-6_88
VL - 2723
SP - 730-741
PB - Berlin; New York: Springer
SN - 3540406026
ER -
TY - JOUR
TI - A model of supplier integration into new product development
AU - Petersen, KJ
AU - Handfield, RB
AU - Ragatz, GL
T2 - JOURNAL OF PRODUCT INNOVATION MANAGEMENT
AB - In many industries, firms are looking for ways to cut concept‐to‐customer development time, to improve quality, and to reduce the cost of new products. One approach shown to be successful in Japanese organizations involves the integration of material suppliers early in the new product development cycle. This involvement may range from simple consultation with suppliers on design ideas to making suppliers fully responsible for the design of components or systems they will supply. While prior research shows the benefit of using this approach, execution remains a problem. The processes for identifying and integrating suppliers into the new product development (NPD) process in North American organizations are not understood well. This problem is compounded by the fact that design team members often are reluctant to listen to the technology and cost ideas made by suppliers in new product development efforts. We suggest a model of the key activities required for successful supplier integration into NPD projects, based on case studies with 17 Japanese and American manufacturing organizations. The model is validated using data from a survey of purchasing executives in global corporations with at least one successful and one unsuccessful supplier integration experience. The results suggest that (1) increased knowledge of a supplier is more likely to result in greater information sharing and involvement of the supplier in the product development process; (2) sharing of technology information results in higher levels of supplier involvement and improved outcomes; (3) supplier involvement on teams generally results in a higher achievement of NPD team goals; (4) in cases when technology uncertainty is present, suppliers and buyers are more likely to share information on NPD teams; and (5) the problems associated with technology uncertainty can be mitigated by greater use of technology sharing and direct supplier participation on new product development teams. A supplier's participation as a true member of a new product development team seems to result in the highest level of benefits, especially in cases when a technology is in its formative stages.
DA - 2003/7//
PY - 2003/7//
DO - 10.1111/1540-5885.00028
VL - 20
IS - 4
SP - 284-299
SN - 0737-6782
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0344269023&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Semi-smooth Newton methods for variational inequalities of the first kind
AU - Ito, K
AU - Kunisch, K
T2 - ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE
AB - Semi–smooth Newton methods are analyzed for a class of variational inequalities in infinite dimensions. It is shown that they are equivalent to certain active set strategies. Global and local super-linear convergence are proved. To overcome the phenomenon of finite speed of propagation of discretized problems a penalty version is used as the basis for a continuation procedure to speed up convergence. The choice of the penalty parameter can be made on the basis of an L∞ estimate for the penalized solutions. Unilateral as well as bilateral problems are considered.
DA - 2003///
PY - 2003///
DO - 10.1051/m2an:2003021
VL - 37
IS - 1
SP - 41-62
SN - 1290-3841
KW - semi-smooth Newton methods
KW - contact problems
KW - variational inequalities
KW - bilateral constraints
KW - superlinear convergence
ER -
TY - JOUR
TI - Jumpstart just-in-time signaling protocol: a formal description using extended finite state machines
AU - Zaim, AH
AU - Baldine, I
AU - Cassada, M
AU - Rouskas, George
AU - Perros, HG
AU - Stevenson, D
T2 - Optical Engineering
AB - We present a formal protocol description for a just-in-time (JIT) signaling scheme running over a core dense wavelength division multiplexing (DWDM) network that utilizes optical burst switches (OBSs). We apply an eight-tuple extended finite state machine (EFSM) model to formally specify the protocol. Using the EFSM model, we define the communication between a source client node and a destination client node through an ingress and one or multiple intermediate switches. We work on on-the-fly and persistent unicast connections. The communication between the EFSMs is handled through messages.
DA - 2003///
PY - 2003///
DO - 10.1117/1.1533795
VL - 42
IS - 2
SP - 568-585
ER -
TY - JOUR
TI - Analyzing transformation-based simulation metamodels
AU - Irizarry, M. D. A.
AU - Kuhl, M. E.
AU - Lada, E. K.
AU - Subramanian, S.
AU - Wilson, J. R.
T2 - IIE Transactions
DA - 2003///
PY - 2003///
DO - 10.1080/07408170390175495
VL - 35
IS - 3
SP - 271-283
ER -
TY - JOUR
TI - Trustworthy service composition: Challenges and research questions
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
AB - Web services have been gathering an increasing amount of attention lately. The raison d’etre of Web services is that we compose them to create new services. For Web services to be effectively composed, however, requires that they be trustworthy and in fact be trusted by their users and other collaborating services. In our conceptual scheme, principals interact as autonomous peers to provide services to one another. Trust is captured as a composite relationship between the trusted and the trusting principal. Principals help each other discover and locate trustworthy services and weed out untrustworthy players. The interactions of the principals combined with the needs of different applications induce interesting structures on the network. We apply multiagent systems techniques to model interactions among the principals. By varying the requirements of different applications, the needs of different principals, the existence of special principals such as trusted authorities, and the mechanisms underlying the interactions, we draw attention to a variety of important settings where Web services would be composed. One, leading to superior methods through which trust can be evolved and managed in realistic service-composition settings. Two, studying the relationships between aspects of trust for Web services and the evolution of Web structure.
CN - QA76.76 .I58 D43 2003
DA - 2003///
PY - 2003///
DO - 10.1007/3-540-36609-1_5
VL - 2631
SP - 39–52
UR - https://publons.com/publon/21294488/
ER -
TY - JOUR
TI - Truncated Newton methods for optimization with inaccurate functions and gradients
AU - Kelley, CT
AU - Sachs, EW
T2 - JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
AB - We consider unconstrained minimization problems that have functions and gradients given by black box codes with error control. We discuss several modifications of the Steihaug truncated Newton method that can improve performance for such problems. We illustrate the ideas with two examples.
DA - 2003/1//
PY - 2003/1//
DO - 10.1023/A:1022110219090
VL - 116
IS - 1
SP - 83-98
SN - 0022-3239
KW - trust region methods
KW - inexact Newton methods
KW - optimal control
ER -
TY - CHAP
TI - The PEPS software tool
AU - Benoit, A.
AU - Brenner, L.
AU - Fernandes, P.
AU - Plateau, B.
AU - Stewart, W. J.
T2 - Computer performance evaluation: Modelling techniques and tools: 13th international conference, TOOLS 2003, Urbana, IL, USA, September 2-5, 2003
A2 - P. Kemper, W. H. Sanders
AB - Peps is a software package for solving very large Markov models expressed as Stochastic Automata Networks (San). The San formalism defines a compact storage scheme for the transition matrix of the Markov chain and it uses tensor algebra to handle the basic vector matrix multiplications. Among the diverse application areas to which Peps may be applied, we cite the areas of computer and communication performance modeling, distributed and parallel systems and finite capacity queueing networks. This paper presents the numerical techniques included in version 2003 of the Peps software, the basics of its interface and three practical examples.
CN - QA76.9 .E94 T66 2003
PY - 2003///
DO - 10.1007/978-3-540-45232-4_7
VL - 2794
SP - 98-115
PB - Berlin; New York: Springer
SN - 3540408142
ER -
TY - JOUR
TI - Optical layer multicast: Rationale, building blocks, and challenges
AU - Rouskas, GN
T2 - IEEE NETWORK
AB - Optical layer multicast refers to the support of point-to-multipoint connections directly at the physical layer by employing passive devices capable of splitting the power of an input signal among several outputs. Optical multicast technology enables a broad set of applications and opens new directions to network design. We examine the underlying principles and essential components for a practical optical multicast service. We also present a set of key research challenges along with a survey of the literature.
DA - 2003///
PY - 2003///
DO - 10.1109/MNET.2003.1174179
VL - 17
IS - 1
SP - 60-65
SN - 1558-156X
ER -
TY - JOUR
TI - New formulations for interface problems in polar coordinates
AU - Li, ZL
AU - Wang, WC
AU - Chern, IL
AU - Lai, MC
T2 - SIAM JOURNAL ON SCIENTIFIC COMPUTING
AB - In this paper, numerical methods are proposed for some interface problems in polar or Cartesian coordinates. The new methods are based on a formulation that transforms the interface problem with a nonsmooth or discontinuous solution into a problem with a smooth solution. The new formulation leads to a simple second order finite difference scheme for the partial differential equation and a new interpolation scheme for the normal derivative of the solution. In conjunction with the fast immersed interface method, a fast solver has been developed for the interface problems with a piecewise constant but a discontinuous coefficient using the new formulation in a polar coordinate system.
DA - 2003///
PY - 2003///
DO - 10.1137/S106482750139618X
VL - 25
IS - 1
SP - 224-245
SN - 1095-7197
KW - interface problems
KW - singular source
KW - delta function
KW - level set function
KW - discontinuous coefficients
KW - polar coordinates
KW - immersed interface method
KW - smooth extension
KW - fast Poisson solver
ER -
TY - CHAP
TI - Construction of reliable software in resource-constrained environments
AU - Vouk, M. A.
AU - Rivers, A. T.
T2 - Case studies in reliability and maintenance (Wiley series in probability and statistics)
A2 - W. R. Blischke,
A2 - Murthy, D. N. P.
AB - Current software development practices are often “business-driven” and therefore tend to encourage testing approaches that reduce verification and validation activities to shorten schedules. In this chapter, we focus on efficiency of testing and resulting software quality (reliability) in such an environment. We use a resource constrained testing model to analyze data from several projects. Our results indicate that in a practical resource constrained environment there is little room for improving testing during the actual process. Furthermore, there is likely to be considerable variability in the quality of testing, within a testing phase, that may stem from a variety of sources such as the human element, software development practices and the structure of the software itself. However, it is interesting to note that there are experimental results showing that testing efficiency can be improved over longer periods of time through process improvement, and that software quality does appear to be positively correlated with an increase in the average testing efficiency that stems from process improvements.
CN - TA169 .C37 2003
PY - 2003///
DO - 10.1002/0471393002.ch9
PB - Hoboken, N.J.: Wiley-Interscience
SN - 0471413739
ER -
TY - JOUR
TI - Versatile two-level Schwarz preconditioners for multiphase flow
AU - Kees, CE
AU - Miller, CT
AU - Jenkins, EW
AU - Kelley, CT
T2 - COMPUTATIONAL GEOSCIENCES
DA - 2003///
PY - 2003///
DO - 10.1023/A:1023514922877
VL - 7
IS - 2
SP - 91-114
SN - 1420-0597
KW - aggregation
KW - domain decomposition
KW - multilevel Schwarz
KW - multiphase flow
ER -
TY - JOUR
TI - Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan
AU - Soewandi, H.
AU - Elmaghraby, S. E.
T2 - IIE Transactions
DA - 2003///
PY - 2003///
DO - 10.1080/07408170390187915
VL - 35
IS - 5
SP - 467-477
ER -
TY - JOUR
TI - Satisfying due-dates in a job shop with sequence-dependent family set-ups
AU - Taner, MR
AU - Hodgson, TJ
AU - King, RE
AU - Thoney, KA
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed and tested using Markov Decision Processes. Then, a generalized scheduling policy for the job shop problem is established based on a characterization of the optimal policy. The policy is combined with a 'forecasting' mechanism to utilize global shop floor information for local dispatching decisions. Computational results show that performance is significantly better than that of existing alternative policies.
DA - 2003/11/20/
PY - 2003/11/20/
DO - 10.1080/0020754031000149167
VL - 41
IS - 17
SP - 4153-4169
SN - 0020-7543
ER -
TY - JOUR
TI - Inclusion regions for matrix eigenvalues
AU - Beattie, C
AU - Ipsen, ICF
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - We review Lehmann’s inclusion bounds and provide extensions to general (non-normal) matrices. Each inclusion region has a diameter related to the singular values of a restriction of the matrix to a subspace and dependent on either an eigenvector condition number or the departure of the matrix from normality. The inclusion regions are optimal for normal matrices. Similar considerations lead to inclusion bounds based on relative distances expressed analogously in terms of appropriately defined generalized singular values.
DA - 2003/1/1/
PY - 2003/1/1/
DO - 10.1016/S0024-3795(02)00279-3
VL - 358
IS - 1-3
SP - 281-291
SN - 0024-3795
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84867969159&partnerID=MN8TOARS
KW - eigenvalue bounds
KW - singular values
KW - inclusion regions
ER -
TY - JOUR
TI - H(infinity) and L(2)-to-L(infinity) gain control of linear parameter-varying systems with parameter-varying delays
AU - Tan, K
AU - Grigoriadis, KM
AU - Wu, F
T2 - IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS
AB - The analysis and state-feedback synthesis problems for linear parameter-varying systems with parameter-varying time delays are addressed. It is assumed that the state-space data and the time delays are dependent on parameters that are measurable in real-time and vary in a compact set with bounded variation rates. We explore the stability, L2 gain performance and L2 - to- L∞ gain performance for these systems using parameter-dependent Lyapunov functionals. In addition, the design of parameter-dependent state-feedback controllers that guarantee stability and desired induced norm performance are examined. Both analysis and synthesis conditions are formulated in terms of linear matrix inequalities that can be solved via efficient interior-point algorithms.
DA - 2003/9//
PY - 2003/9//
DO - 10.1049/ip-cta:20030708
VL - 150
IS - 5
SP - 509-517
SN - 1350-2379
ER -
TY - JOUR
TI - Distributed control for interconnected linear parameter dependent systems
AU - Wu, F
T2 - IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS
AB - Stability analysis and performance control problems for a class of interconnected parameter-dependent systems with linear fractional parameter dependency are considered. The time and spatially varying parameters are assumed measurable in real-time for controller use. The distributed controller inherits the spatial structure of the plant, which is implementable through parallel computation. The stability of the interconnected parameter-dependent systems is established using a distributed Lyapunov function. Moreover, the synthesis condition of distributed parameter-dependent control gain is formulated as a convex optimisation in the form of a linear matrix inequality. An explicit distributed controller formula is also provided by exploiting the connection between the continuous and the discrete interconnected system descriptions.
DA - 2003/9//
PY - 2003/9//
DO - 10.1049/ip-cta:20030706
VL - 150
IS - 5
SP - 518-527
SN - 1350-2379
ER -
TY - JOUR
TI - An adaptive social network for information access: Theoretical and experimental results
AU - Yu, B.
AU - Venkatraman, M.
AU - Singh, Munindar P.
T2 - Applied Artificial Intelligence
DA - 2003///
PY - 2003///
DO - 10.1080/08839510390169738
VL - 17
IS - 1
SP - 21–38
UR - https://publons.com/publon/21294487/
ER -
TY - JOUR
TI - Adaptive Bayesian inference on the mean of an infinite-dimensional normal distribution
AU - Belitser, E.
AU - Ghosal, S.
T2 - Annals of Statistics
DA - 2003///
PY - 2003///
VL - 31
IS - 2
SP - 536-559
ER -
TY - JOUR
TI - A note on unifying absolute and relative perturbation bounds
AU - Ipsen, ICF
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - Perturbation bounds for invariant subspaces and eigenvalues of complex matrices are presented that lead to absolute as well as a large class of relative bounds. In particular it is shown that absolute bounds (such as those by Davis and Kahan, Bauer and Fike, and Hoffman and Wielandt) and some relative bounds are special cases of `universal' bounds. As a consequence, we obtain a new relative bound for subspaces of normal matrices, which contains a deviation of the matrix from (positive-) definiteness. We also investigate how row scaling affects eigenvalues and their sensitivity to perturbations, and we illustrate how the departure from normality can affect the condition number (with respect to inversion) of the scaled eigenvectors.
DA - 2003/1/1/
PY - 2003/1/1/
DO - 10.1016/S0024-3795(01)00571-7
VL - 358
IS - 1-3
SP - 239-253
SN - 1873-1856
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84867926408&partnerID=MN8TOARS
KW - invariant subspace
KW - eigenvalue
KW - absolute bound
KW - relative bound
KW - subspace angle
KW - departure from normality
ER -
TY - JOUR
TI - Semi-smooth Newton methods for state-constrained optimal control problems
AU - Ito, K
AU - Kunisch, K
T2 - SYSTEMS & CONTROL LETTERS
AB - A regularized optimality system for state-constrained optimal control problems is introduced and semi-smooth Newton methods for its solution are analyzed. Convergence of the regularized problems is proved. Numerical tests confirm the theoretical results and demonstrate the efficiency of the proposed methodology.
DA - 2003/10/22/
PY - 2003/10/22/
DO - 10.1016/s0167-6911(03)00156-7
VL - 50
IS - 3
SP - 221-228
SN - 1872-7956
KW - semi-smooth Newton methods
KW - state-constrained optimal control
KW - superlinear convergence
KW - augmented Lagrangians
ER -
TY - JOUR
TI - New Cartesian grid methods for interface problems using the finite element formulation
AU - Li, ZL
AU - Lin, T
AU - Wu, XH
T2 - NUMERISCHE MATHEMATIK
AB - New finite element methods based on Cartesian triangulations are presented for two dimensional elliptic interface problems involving discontinuities in the coefficients. The triangulations in these methods do not need to fit the interfaces. The basis functions in these methods are constructed to satisfy the interface jump conditions either exactly or approximately. Both non-conforming and conforming finite element spaces are considered. Corresponding interpolation functions are proved to be second order accurate in the maximum norm. The conforming finite element method has been shown to be convergent. With Cartesian triangulations, these new methods can be used as finite difference methods. Numerical examples are provided to support the methods and the theoretical analysis.
DA - 2003/11//
PY - 2003/11//
DO - 10.1007/s00211-003-0473-x
VL - 96
IS - 1
SP - 61-98
SN - 0029-599X
ER -
TY - JOUR
TI - Invariant measures of nonholonomic flows with internal degrees of freedom
AU - Zenkov, DV
AU - Bloch, AM
T2 - NONLINEARITY
AB - In this paper we study measure preserving flows associated with nonholonomic systems with internal degrees of freedom. Our approach reveals geometric reasons for the existence of measures in the form of an integral invariant with smooth density that depends on the internal configuration of the system.
DA - 2003/9//
PY - 2003/9//
DO - 10.1088/0951-7715/16/5/313
VL - 16
IS - 5
SP - 1793-1807
SN - 1361-6544
ER -
TY - JOUR
TI - Genetic dissection of hybrid Incompatibilities between Drosophila simulansand D. mauritiana. II. Mapping hybrid male sterility loci on the third chromosome
AU - Tao, Y.
AU - Zeng, Z. B.
AU - Li, J.
AU - Hartl, D. L.
AU - Laurie, C. C.
T2 - Genetics
DA - 2003///
PY - 2003///
VL - 164
IS - 4
SP - 1399-1418
ER -
TY - JOUR
TI - Fuzzy data envelopment analysis (DEA): a possibility approach
AU - Lertworasirikul, S.
AU - Fang, S. C.
AU - Joines, J. A.
AU - Nuttle, H. L. W.
T2 - Fuzzy Sets and Systems
AB - Evaluating the performance of activities or organizations by traditional data envelopment analysis (DEA) models requires crisp input/output data. However, in real-world problems inputs and outputs are often imprecise. This paper develops DEA models using imprecise data represented by fuzzy sets (i.e., “fuzzy DEA” models). It is shown that fuzzy DEA models take the form of fuzzy linear programming which typically are solved with the aid of some methods to rank fuzzy sets. As an alternative, a possibility approach is introduced in which constraints are treated as fuzzy events. The approach transforms fuzzy DEA models into possibility DEA models by using possibility measures of fuzzy events (fuzzy constraints). We show that for the special case, in which fuzzy membership functions of fuzzy data are of trapezoidal types, possibility DEA models become linear programming models. A numerical experiment is used to illustrate the approach and compare the results with those obtained with alternative approaches.
DA - 2003///
PY - 2003///
DO - 10.1016/S0165-0114(02)00484-0
VL - 139
IS - 2
SP - 379–394
SN - 1872-6801
KW - data envelopment analysis
KW - fuzzy mathematical programming
KW - possibility theory
KW - efficiency analysis
ER -
TY - JOUR
TI - Error estimates for random boundary value problems with applications to a hanging cable problem
AU - Ladde, G. S.
AU - Medhin, N. G.
AU - Sambandham, M.
T2 - Mathematical and Computer Modelling
DA - 2003///
PY - 2003///
DO - 10.1016/S0895-7177(03)00315-7
VL - 38
IS - 10
SP - 1037-1050
ER -
TY - JOUR
TI - Computationally efficient algorithm for frequency-weighted optimal H-infinity model reduction
AU - Wu, F.
AU - Jaramillo, J. J.
T2 - Asian Journal of Control
AB - ABSTRACT In this paper, a frequency‐weighted optimal H ∞ model reduction problem for linear time‐invariant (LTI) systems is considered. The objective of this class of model reduction problems is to minimize H ∞ norm of the frequency‐weighted truncation error between a given LTI system and its lower order approximation. A necessary and sufficient solvability condition is derived in terms of LMIs with one extra coupling rank constraint, which generally leads to a non‐convex feasibility problem. Moreover, it has been shown that the reduced‐order model is stable when both stable input and output weights are included, and its state‐space data are given explicitly by the solution of the feasibility problem. An efficient model reduction scheme based on cone complementarity algorithm (CCA) is proposed to solve the non‐convex conditions involving rank constraint.
DA - 2003///
PY - 2003///
DO - 10.1111/j.1934-6093.2003.tb00126.x
VL - 5
IS - 3
SP - 341-349
ER -
TY - JOUR
TI - A genetic-based framework for solving (multi-criteria) weighted matching problems
AU - Medaglia, AL
AU - Fang, SC
T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
AB - The purpose of this paper is to present a flexible genetic-based framework for solving the multi-criteria weighted matching problem (mc-WMP). In the first part of this paper, we design a genetic-based framework for solving the ordinary weighted matching problem. We present an extensive analysis of the quality of the results and introduce a methodology for tuning its parameters. In the second part, we develop a modified genetic-based algorithm for solving the mc-WMP. The algorithm generates a significant and representative portion of the Pareto optimal set. To assess the performance of the algorithm, we conduct computational experiments with two and three criteria. The potential of the proposed algorithm is demonstrated by comparing to a multi-objective simulated annealing algorithm.
DA - 2003/8/16/
PY - 2003/8/16/
DO - 10.1016/S0377-2217(02)00484-8
VL - 149
IS - 1
SP - 77-101
SN - 1872-6860
KW - genetic algorithms
KW - multi-objective evolutionary algorithms
KW - multi-criteria optimization
KW - weighted matching
ER -
TY - JOUR
TI - On the existence of Hamiltonian paths in the cover graph of M(n)
AU - Savage, CD
AU - Shields, I
AU - West, DB
T2 - DISCRETE MATHEMATICS
AB - The poset M(n) has as its elements the n-tuples of integers a=(a1,a2,…,an) satisfying 0=a1=⋯=aj