TY - CONF
TI - Planning of Work Releases and Safety Stocks with Forecast Evolution
AU - Norouzi, A.
AU - Uzsoy, R.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - CONF
TI - Multiobjective Combinatorial Optimization Model for Project Scheduling in the Tourism Sector
AU - Gaytan, J.
AU - Uzsoy, R.
AU - Viktorovna, N.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - CONF
TI - Comparing Production Planning with Clearing Functions and Iterative Simulation-LP Algorithms
AU - Kacar, N.B.
AU - Uzsoy, R.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - SOUND
TI - Production Planning with Resources Subject to Congestion
AU - Uzsoy, R.
DA - 2010/9//
PY - 2010/9//
ER -
TY - CONF
TI - Generating Problem Instances with Known Optima for Facility Location Problems: A Cautionary Tale
AU - Jarugumilli, K.
AU - Uzsoy, R.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - SOUND
TI - Production Planning with Resources Subject to Congestion
AU - Uzsoy, R.
DA - 2010/3//
PY - 2010/3//
ER -
TY - CONF
TI - A Dantzig-Wolfe Decomposition Approach to Dual-Rich Production Planning Models
AU - Kefeli, A.
AU - Uzsoy, R.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - CONF
TI - A Column Generation Approach for Multiple Product Dynamic Lot Sizing with Congestion
AU - Kang, Y.
AU - Uzsoy, R.
T2 - Industrial Engineering Research Conference
C2 - 2010/6//
CY - Cancun, Mexico
DA - 2010/6//
PY - 2010/6//
ER -
TY - CONF
TI - Production Planning with Resources Subject to Congestion
AU - Uzsoy, R.
T2 - Workshop on Stochastic Modelling of Manufacturing Systems
C2 - 2010/6//
CY - Eindhoven University of Technology, Netherlands
DA - 2010/6//
PY - 2010/6//
ER -
TY - CONF
TI - Production Planning with Resources Subject to Congestion
AU - Uzsoy, R.
T2 - Turkish Operational Research Society Conference
C2 - 2010/7//
CY - Istanbul, Turkey
DA - 2010/7//
PY - 2010/7//
ER -
TY - BOOK
TI - Planning in the Extended Enterprise: A State of the Art Handbook
A3 - Kempf, K.G.
A3 - Keskinocak, P.
A3 - Uzsoy, R.
DA - 2010///
PY - 2010///
VL - 1
PB - Springer
ER -
TY -
ER -
TY - CHAP
TI - Optimization Models of Production Planning Problems
AU - Missbauer, Hubert
AU - Uzsoy, Reha
T2 - Planning Production and Inventories in the Extended Enterprise
A2 - Kempf, K.G.
A2 - Keskinocak, P.
A2 - Uzsoy, R.
T3 - International Series in Operations Research & Management Science
PY - 2010/10/5/
DO - 10.1007/978-1-4419-6485-4_16
SP - 437-507
PB - Springer US
SN - 9781441964847 9781441964854
UR - http://dx.doi.org/10.1007/978-1-4419-6485-4_16
ER -
TY - RPRT
TI - Power, sample size and confidence interval for quantitative trait loci mapping on multiple traits
AU - E Silva, L.D.C.
AU - Chang, S.-M.
AU - Zeng, Z.-B.
DA - 2010///
PY - 2010///
ER -
TY - JOUR
TI - Univariate input models for stochastic simulation
AU - Kuhl, M E
AU - Ivy, J S
AU - Lada, E K
AU - Steiger, N M
AU - Wagner, M A
AU - Wilson, J R
T2 - Journal of Simulation
AB - Techniques are presented for modelling and then randomly sampling many of the continuous univariate probabilistic input processes that drive discrete-event simulation experiments. Emphasis is given to the generalized beta distribution family, the Johnson translation system of distributions, and the Bezier distribution family because of the flexibility of these families to model a wide range of distributional shapes that arise in practical applications. Methods are described for rapidly fitting these distributions to data or to subjective information (expert opinion) and for randomly sampling from the fitted distributions. Also discussed are applications ranging from pharmaceutical manufacturing and medical decision analysis to smart-materials research and health-care systems analysis.
DA - 2010/6//
PY - 2010/6//
DO - 10.1057/jos.2009.31
VL - 4
IS - 2
SP - 81-97
J2 - Journal of Simulation
LA - en
OP -
SN - 1747-7778 1747-7786
UR - http://dx.doi.org/10.1057/jos.2009.31
DB - Crossref
KW - simulation
KW - continuous univariate input models
KW - generalized beta distributions
KW - Johnson translation system of distributions
KW - Bezier distributions
ER -
TY - JOUR
TI - Univariate Cubic L1 Interpolating Splines: Spline Functional, Window Size and Analysis-based Algorithm
AU - Yu, Lu
AU - Jin, Qingwei
AU - Lavery, John E.
AU - Fang, Shu-Cherng
T2 - Algorithms
AB - We compare univariate L1 interpolating splines calculated on 5-point windows, on 7-point windows and on global data sets using four different spline functionals, namely, ones based on the second derivative, the first derivative, the function value and the antiderivative. Computational results indicate that second-derivative-based 5-point-window L1 splines preserve shape as well as or better than the other types of L1 splines. To calculate second-derivative-based 5-point-window L1 splines, we introduce an analysis-based, parallelizable algorithm. This algorithm is orders of magnitude faster than the previously widely used primal affine algorithm.
DA - 2010/8/20/
PY - 2010/8/20/
DO - 10.3390/a3030311
VL - 3
IS - 3
SP - 311-328
J2 - Algorithms
LA - en
OP -
SN - 1999-4893
UR - http://dx.doi.org/10.3390/a3030311
DB - Crossref
KW - antiderivative
KW - cubic L-1 spline
KW - first derivative
KW - 5 -point window
KW - function value
KW - global
KW - interpolation
KW - locally calculated
KW - second derivative
KW - univariate
ER -
TY - CHAP
TI - Chebyshev Approximation of Inconsistent Fuzzy Relational Equations with Max-T Composition
AU - Li, Pingke
AU - Fang, Shu-Cherng
T2 - Fuzzy Optimization
T3 - Studies in Fuzziness and Soft Computing
AB - This paper considers resolving the inconsistency of a system of fuzzy relational equations with max-T composition by simultaneously modifying the coefficient matrix and the right hand side vector. We show that resolving the inconsistency of fuzzy relational equations with max-T composition by means of Chebyshev approximation is closely related to the generalized solvability of interval-valued fuzzy relational equations with max-T composition. An efficient procedure is proposed to obtain a consistent system with the smallest perturbation in the sense of Chebyshev distance.
PY - 2010///
DO - 10.1007/978-3-642-13935-2_5
SP - 109–124
PB - Springer
SN - 9783642139345 9783642139352
SV - 254
UR - http://dx.doi.org/10.1007/978-3-642-13935-2_5
ER -
TY - JOUR
TI - Univariate Cubic L1 Interpolating Splines: Analytical Results for Linearity, Convexity and Oscillation on 5-Point Windows
AU - Jin, Qingwei
AU - Lavery, John E.
AU - Fang, Shu-Cherng
T2 - Algorithms
AB - We analytically investigate univariate C1 continuous cubic L1 interpolating splines calculated by minimizing an L1 spline functional based on the second derivative on 5-point windows. Specifically, we link geometric properties of the data points in the windows with linearity, convexity and oscillation properties of the resulting L1 spline. These analytical results provide the basis for a computationally efficient algorithm for calculation of L1 splines on 5-point windows.
DA - 2010/7/30/
PY - 2010/7/30/
DO - 10.3390/a3030276
VL - 3
IS - 3
SP - 276–293
SN - 1999-4893
UR - http://dx.doi.org/10.3390/a3030276
KW - convexity
KW - cubic L1 spline
KW - 5-point window
KW - interpolation
KW - linearity
KW - locally calculated
KW - oscillation
KW - second-derivative-based
KW - univariate
ER -
TY - CONF
TI - Stabilized Completions of Differential Algebraic Equations and the Design of Observers
AU - Bobinyec, K.
AU - Campbell, S.L.
AU - Kunkel, P.
T2 - Fourth International Conference on Neural, Parallel and Scientific Computation
C2 - 2010///
C3 - Proceedings of Neural, Parallel, and Scientific Computation
CY - Atlanta, GA
DA - 2010///
PY - 2010///
ER -
TY - CONF
TI - Rank-deficient and ill-conditioned nonlinear least squares problems
AU - Kelley, C.T.
AU - Ipsen, I.C.F.
AU - Pope, S.R.
T2 - East Asian Society of Industrial and Applied Mathematics Conference
C2 - 2010///
C3 - Proceedings of the 2010 East Asian SIAM Conference
DA - 2010///
PY - 2010///
ER -
TY - CHAP
TI - Preparing for the worst: Sustaining suppliers though the economic crisis
AU - Handfield, R.
T2 - Managing Global Supply Chain Relationships: Operations, Strategies and Practices
AB - The economic crisis has taken a major toll on almost every industry, as well as key customers and suppliers in all sectors of the economy. Supply chain managers are increasingly concerned about the financial impact on key customers and suppliers, deferred commitments and outstanding accounts. In an effort to probe into the underlying assumptions that their actions are based upon, the author surveyed supply chain executives, identifying key patterns that are beginning to emerge across industries and countermeasures that are being taken in response. Three key themes emerged. First, buyers and suppliers are co-dependent, and they should think within this context when faced with financial stress. Second, there is a need to better understand the warning signs and establish channels of communication, to address the key risks related to financial stress. Finally, managers should emphasize the need to better manage supplier relationships through modeling and event analysis, allowing them to take preventive actions before problems occur. These themes are discussed and developed into a set of propositions, as a foundation for future research.
PY - 2010///
DO - 10.4018/978-1-61692-862-9.ch001
SP - 1-15
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899291186&partnerID=MN8TOARS
ER -
TY - CONF
TI - Protocol Refinement: Formalization and Verification
AU - Gerard, Scott N.
AU - Singh, Munindar P.
C2 - 2010///
C3 - Proceedings of the AAMAS Workshop on Agent Communication (AC)
DA - 2010///
SP - 19–36
ER -
TY - CONF
TI - Governance of Services: A Natural Function for Agents
AU - Brazier, Frances
AU - Dignum, Frank
AU - Dignum, Virginia
AU - Huhns, Michael N.
AU - Lessner, Tim
AU - Padget, Julian
AU - Quillinan, Thomas
AU - Singh, Munindar P.
C2 - 2010///
C3 - Proceedings of the 8th AAMAS Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering (SOCASE)
DA - 2010///
SP - 8–22
ER -
TY - CONF
TI - Abstracting Business Modeling Patterns from Rosetta-Net
AU - Telang, Pankaj R.
AU - Singh, Munindar P.
C2 - 2010///
C3 - Proceedings of the 8th AAMAS Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering (SOCASE)
DA - 2010///
SP - 83–96
ER -
TY - CONF
TI - An Architectural Approach to Combining Trust and Reputation
AU - Hazard, Christopher J.
AU - Singh, Munindar P.
T2 - 9th Autonomous Agents and Multiagent Systems, the 13th International Workshop on Trust in Agent Societies
A2 - van der Hoek, Wiebe
A2 - Kaminka, Gal A.
A2 - Lesperance, Yves
A2 - Luck, Michael
A2 - Sen, Sandip
C2 - 2010///
C3 - Proceedings of the 9th Autonomous Agents and Multiagent Systems, the 13th International Workshop on Trust in Agent Societies
CY - Toronto, Canada
DA - 2010///
PY - 2010/5/19/
SP - 83–93
PB - AAMAS
ER -
TY - CONF
TI - Trust-based Recommendation Based on Graph Similarity
AU - Hang, Chung-Wei
AU - Singh, Munindar P.
T2 - 9th Autonomous Agents and Multi-Agent Systems, 13th International Workshop on Trust in Agent Societies
A2 - van der Hoek, Wiebe
A2 - Kaminka, Gal A.
A2 - Lesperance, Yves
A2 - Luck, Michael
A2 - Sen, Sandip
C2 - 2010///
C3 - Proceedings of the 9th Autonomous Agents and Multi-Agent Systems, 13th International Workshop on Trust in Agent Societies
CY - Toronto, Canada
DA - 2010///
PY - 2010/5/10/
SP - 71–81
PB - AAMAS
ER -
TY - CONF
TI - Optimal ordering policy characterization in an unreliable supply chain
AU - Ahıska, S.Ş.
AU - Appaji, S.R.
AU - King, R.E.
AU - Wang, Y.
AU - Warsing, D.P.
T2 - IIE Annual Conference & Expo
C2 - 2010///
C3 - IIE Annual Conference Proceedings
CY - Cancun, Mexico
DA - 2010///
PY - 2010/6/5/
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84901009083&partnerID=MN8TOARS
ER -
TY - CONF
TI - Three Dilemma Zone Strategies for High-Speed Rural Intersections: Comparison of Field Results
AU - Demers, Alixandra
AU - List, George F.
AU - Isukapati, Isaac K.
T2 - Seventh International Conference on Traffic and Transportation Studies (ICTTS) 2010
AB - High-speed, rural intersections with both passenger car and truck flows present dilemma zone challenges. Three signal-timing strategies were tested in the field at three intersections of varying geometries with the goal of minimizing the occurrence of dilemma zones without sacrificing efficient operation. The strategies focused on hardware changes impacting vehicle sensing as well as mainline green phase extension and termination. The base strategy was volume-density control. The second one (NQ4) added advance detection of high-speed trucks triggering a fixed green extension. The final strategy replaced the second system with a sophisticated advance detection and control system (D-CS) logic based on the work of Bonneson et al. (2002). Results indicate simple volume-density control is surpassed in safety by both other strategies; moreover, the detection-control system dramatically reduced the number of vehicles trapped in dilemma zones at the onset of amber. The second strategy works fairly well in the field. The drawbacks to the NQ4 system are most noticeable at high-volume intersections — it does not actually find times when no vehicles are in dilemma zones, vehicle speeds are not directly used for computing main street hold times (which is accomplished in the D-CS control strategy resulting in improved efficiency), and it is a bit cumbersome and expensive to install. Based on our findings, the addition of the DC-S algorithm into a controller is a worthwhile investment for mixed-traffic, high-speed, rural intersections with dilemma zone issues.
C2 - 2010/7/26/
C3 - Traffic and Transportation Studies 2010
DA - 2010/7/26/
DO - 10.1061/41123(383)99
PB - American Society of Civil Engineers
SN - 9780784411230
UR - http://dx.doi.org/10.1061/41123(383)99
DB - Crossref
ER -
TY - CONF
TI - Hardware-in-the-Loop Simulation: Challenges and Solutions
AU - Isukapati, Isaac K.
AU - Demers, Alixandra
AU - List, George F.
T2 - Seventh International Conference on Traffic and Transportation Studies (ICTTS) 2010
AB - This paper discusses some complex Hardware-In-the-Loop configurations used for evaluating three distinct control strategies aimed at minimizing dilemma zone problems at high-speed, rural intersections. Five intersections were studied; three configurations were tested. The authors show that effective Hardware-In-the-Loop Simulations can be created for complex signal control configurations. They demonstrate that it is important to become familiar with the electrical details of the components and then create software and hardware splices that tie the devices together in such a way that each one functions in the manner intended. The authors show that for speed traps, the time step in simulation models dictates longer-than-field-based separations, about 29 m (95’) instead of 6.6 m (20’) (as in the field). This clearly suggests that time step duration has a significant impact on the results obtained for HILS, and hence suggests it worthwhile to push that frontier further, striving for even smaller time steps so that HILS can be effective.
C2 - 2010/7/26/
C3 - Traffic and Transportation Studies 2010
DA - 2010/7/26/
DO - 10.1061/41123(383)86
PB - American Society of Civil Engineers
SN - 9780784411230
UR - http://dx.doi.org/10.1061/41123(383)86
DB - Crossref
ER -
TY - CONF
TI - Teaching IE: Common mistakes and reflections on an IE class
AU - Kefeli, A.
AU - Kay, M.
C2 - 2010///
C3 - IIE Annual Conference and Expo 2010 Proceedings
DA - 2010///
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84901037120&partnerID=MN8TOARS
ER -
TY - CONF
TI - Identification of Reactive Contaminant Sources in a Water Distribution System under the Conditions of Data Uncertainties
AU - Kumar, Jitendra
AU - Brill, E. Downey
AU - Mahinthakumar, G.
AU - Ranjithan, Ranji
T2 - World Environmental and Water Resources Congress 2010
C2 - 2010/5/14/
C3 - World Environmental and Water Resources Congress 2010
DA - 2010/5/14/
DO - 10.1061/41114(371)442
PB - American Society of Civil Engineers
SN - 9780784411148
UR - http://dx.doi.org/10.1061/41114(371)442
DB - Crossref
ER -
TY - CONF
TI - Detection of Leaks in Water Distribution System Using Routine Water Quality Measurements
AU - Kumar, Jitendra
AU - Sreepathi, Sarat
AU - Brill, E. Downey
AU - Ranjithan, Ranji
AU - Mahinthakumar, G.
T2 - World Environmental and Water Resources Congress 2010
C2 - 2010/5/14/
C3 - World Environmental and Water Resources Congress 2010
DA - 2010/5/14/
DO - 10.1061/41114(371)426
PB - American Society of Civil Engineers
SN - 9780784411148
UR - http://dx.doi.org/10.1061/41114(371)426
DB - Crossref
ER -
TY - CHAP
TI - A Fault-Tolerance Architecture for Kepler-Based Distributed Scientific Workflows
AU - Mouallem, Pierre
AU - Crawl, Daniel
AU - Altintas, Ilkay
AU - Vouk, Mladen
AU - Yildiz, Ustun
T2 - Lecture Notes in Computer Science
AB - Fault-tolerance and failure recovery in scientific workflows is still a relatively young topic. The work done in the domain so far mostly applies classic fault-tolerance mechanisms, such as "alternative versions" and "checkpointing", to scientific workflows. Often scientific workflow systems simply rely on the fault-tolerance capabilities provided by their third party subcomponents such as schedulers, Grid resources, or the underlying operating systems. When failures occur at the underlying layers, a workflow system typically sees them only as failed steps in the process without additional detail and the ability of the system to recover from those failures may be limited. In this paper, we present an architecture that tries to address this for Kepler-based scientific workflows by providing more information about failures and faults we have observed, and through a supporting implementation of more comprehensive failure coverage and recovery options. We discuss our framework in the context of the failures observed in two production-level Kepler-based workflows, specifically XGC and S3D. The framework is divided into three major components: (i) a general contingency Kepler actor that provides a recovery block functionality at the workflow level, (ii) an external monitoring module that tracks the underlying workflow components, and monitors the overall health of the workflow execution, and (iii) a checkpointing mechanism that provides smart resume capabilities for cases in which an unrecoverable error occurs. This framework takes advantage of the provenance data collected by the Kepler-based workflows to detect failures and help in fault-tolerance decision making.
PY - 2010///
DO - 10.1007/978-3-642-13818-8_31
SP - 452-460
OP -
PB - Springer Berlin Heidelberg
SN - 9783642138171 9783642138188
UR - http://dx.doi.org/10.1007/978-3-642-13818-8_31
DB - Crossref
ER -
TY - CHAP
TI - Characterizing the Effectiveness of Tutorial Dialogue with Hidden Markov Models
AU - Boyer, Kristy Elizabeth
AU - Phillips, Robert
AU - Ingram, Amy
AU - Ha, Eun Young
AU - Wallis, Michael
AU - Vouk, Mladen
AU - Lester, James
T2 - Intelligent Tutoring Systems
AB - Identifying effective tutorial dialogue strategies is a key issue for intelligent tutoring systems research. Human-human tutoring offers a valuable model for identifying effective tutorial strategies, but extracting them is a challenge because of the richness of human dialogue. This paper addresses that challenge through a machine learning approach that 1) learns tutorial strategies from a corpus of human tutoring, and 2) identifies the statistical relationships between student outcomes and the learned strategies. We have applied hidden Markov modeling to a corpus of annotated task-oriented tutorial dialogue to learn one model for each of two effective human tutors. We have identified significant correlations between the automatically extracted tutoring modes and student learning outcomes. This work has direct applications in authoring data-driven tutorial dialogue system behavior and in investigating the effectiveness of human tutoring.
PY - 2010///
DO - 10.1007/978-3-642-13388-6_10
SP - 55-64
OP -
PB - Springer Berlin Heidelberg
SN - 9783642133879 9783642133886
UR - http://dx.doi.org/10.1007/978-3-642-13388-6_10
DB - Crossref
ER -
TY - JOUR
TI - Expository research papers
AU - Ipsen, I.
T2 - SIAM Review
DA - 2010///
PY - 2010///
VL - 52
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79952956707&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Expository Research Papers
AU - Ipsen, Ilse
T2 - SIAM Review
AB - The two papers in this issue are concerned with analysis of differential equations: the first paper discusses the solution of partial differential equations that describe heat transfer, while the second one analyzes dynamical systems whose behavior alternates between continuous and discrete modes. The paper “Application of Standard and Refined Heat Balance Integral Methods to One-Dimensional Stefan Problems,” by Sarah Mitchell and Tim Myers, deals with a heat transfer problem, on a semi-infinite region. Consider an experiment on a long metal bar occupying the positive real-axis. The experiment starts by heating the origin, thereby raising the bar above the melting temperature. The bar melts near the origin, and as the heat diffuses, the solid-liquid interface propagates slowly but surely towards infinity. The temperature is modeled by heat equations across the two regions, and by a Stefan condition at their interface. The authors heat balance integral methods to solve for the temperature. These methods reduce a partial differential equation to an ordinary differential equation. The authors investigate different boundary conditions, and different approximating functions for the temperature. Readers interested in heat balance integral methods will find this to be a valuable survey with new results that preserve the simplicity of the method. The second paper is concerned with so-called hybrid dynamical systems. A bouncing ball, for instance, is a hybrid dynamical system. The movement of the ball above ground can be described by Newton's law. However, at the very moment the ball hits the ground and bounces, an instantaneous reversal of velocity occurs along with some dissipation of energy. After the bounce, the ball moves again according to Newton's law until the next bounce, and so on. Mathematically one can show that the time points at which the ball bounces represent a convergent sequence. The convergence of this sequence implies that infinitely many bounces occur in a finite amount of time. This is called “Zeno behavior”: infinitely many switches of mode in a finite amount of time. If Zeno behavior occurs in a control system, a numerical simulation of the system is extremely difficult, if not impossible. In the terminology of dynamical systems, the movement of the ball above ground is a “flow” and the bounce is a “jump.” Hybrid dynamical systems alternate between continuous (flow) and discrete (jump) modes. Rafal Goebel and Andrew Teel in their paper “Preasymptotic Stability and Homogeneous Approximations of Hybrid Dynamical Systems” model hybrid dynamical systems and approximate them by simpler systems obtained from linearization and tangent cones. The authors analyze preasymptotic stability, homogeneity, and convergence. A variety of well-chosen simple examples helps us to understand the general concepts and results.
DA - 2010/1//
PY - 2010/1//
DO - 10.1137/siread000052000001000055000001
VL - 52
IS - 1
SP - 55-55
ER -
TY - JOUR
TI - A comparison of nonlinear filtering approaches in the context of an HIV model
AU - Banks, H.
AU - Hu, Shuhua
AU - Kenz, Zackary
AU - Tran, Hien
T2 - Mathematical Biosciences and Engineering
AB - In this paper three different filtering methods, the Extended Kalman Filter (EKF), the Gauss-Hermite Filter (GHF), and the Unscented Kalman Filter (UKF), are compared for state-only and coupled state and parameter estimation when used with log state variables of a model of the immunologic response to the human immunodeficiency virus (HIV) in individuals. The filters are implemented to estimate model states as well as model parameters from simulated noisy data, and are compared in terms of estimation accuracy and computational time. Numerical experiments reveal that the GHF is the most computationally expensive algorithm, while the EKF is the least expensive one. In addition, computational experiments suggest that there is little difference in the estimation accuracy between the UKF and GHF. When measurements are taken as frequently as every week to two weeks, the EKF is the superior filter. When measurements are further apart, the UKF is the best choice in the problem under investigation.
DA - 2010/4//
PY - 2010/4//
DO - 10.3934/mbe.2010.7.213
VL - 7
IS - 2
SP - 213-236
J2 - MBE
LA - en
OP -
SN - 1551-0018
UR - http://dx.doi.org/10.3934/mbe.2010.7.213
DB - Crossref
KW - extended Kalman filter
KW - unscented Kalman filter
KW - Gauss-Hermite filter
KW - HIV
ER -
TY - JOUR
TI - Programming Multiagent Systems without Programming Agents
T2 - Lecture Notes in Computer Science
AB - Due to increased adoption of cloud computing, there is a growing need of addressing the data privacy during mining. On the other hand, knowledge sharing is a key to survive many business organizations. Several attempts have been made to mine the data in distributed environment however, maintaining the privacy while mining the data over cloud is a challenging task. In this paper, we present an efficient and practical cryptographic based scheme that preserves privacy and mine the cloud data which is distributed in nature. In order to address the classification task, our approach uses k-NN classifier. We extend the Jaccard measure to find the similarity between two encrypted and distributed records by conducting an equality test. In addition, our approach accelerates mining by finding nearest neighbours at local and then at global level. The proposed approach avoids transmitting the original data and sharing of the key that is required in traditional crypto based privacy preserving data mining solutions.
DA - 2010///
PY - 2010///
DO - 10.1145/1754288.1754302
UR - https://publons.com/publon/21294446/
ER -
TY - JOUR
TI - Multidisciplinary Views of Business Contracts
T2 - Lecture Notes in Computer Science
AB - Several major trends in the services industry drive toward an increasing importance of contracts. These include the formalization of business processes across the client and the provider organizations; resource administration in cloud computing environments; service-level agreements as they arise in infrastructure and networking services; and services viewed from the perspective of real-life engagements.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-17358-5_76
UR - https://publons.com/publon/21294445/
ER -
TY - BOOK
TI - Requirements as goals and commitments too
AU - Chopra, A.K.
AU - Mylopoulos, J.
AU - Dalpiaz, F.
AU - Giorgini, P.
AU - Singh, M.P.
AB - In traditional software engineering research and practice, requirements are classified either as functional or non-functional. Functional requirements consist of all functions the system-to-be ought to support, and have been modeled in terms of box-and-arrow diagrams in the spirit of SADT. Non-functional requirements include desired software qualities for the system-to-be and have been described either in natural language or in terms of metrics. This orthodoxy was challenged in the mid-90 s by a host of proposals that had a common theme: all requirements are initially stakeholder goals and ought to be elicited, modeled and analyzed as such. Through systematic processes, these goals can be refined into specifications of functions the system-to-be needs to deliver, while actions assigned to external actors need to be executed. This view is dominating Requirements Engineering (RE) research and is beginning to have an impact on RE practice. We propose a next step along this line of research, by adopting the concept of conditional commitment as companion concept to that of goal. Goals are intentional entities that capture the needs and wants of stakeholders. Commitments, on the other hand, are social concepts that define the willingness and capability of an actor A to fulfill a predicate ϕ for the benefit of actor B, provided B (in return) fulfills predicate ψ for the benefit of actor A. In our conceptualization, goals are mapped to collections of commitments rather than functions, qualities, or actor assignments. We motivate the importance of the concept of commitment for RE through examples and discussion. We also contrast our proposal with state-of-the-art requirements modeling and analysis frameworks, such as KAOS, MAP, i * and Tropos.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-12544-7_8
SE - 137-153
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84880532675&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Programming multiagent systems without programming agents
AU - Singh, M.P.
AU - Chopra, A.K.
AB - We consider the programming of multiagent systems from an architectural perspective. Our perspective emphasizes the autonomy and heterogeneity of agents, the components of multiagent systems, and focuses on how to specify their interconnections in terms of high-level protocols. In this manner, we show how to treat the programming of a multiagent system as an architectural endeavor, leaving aside the programming of individual agents who might feature in a multiagent system as a secondary concern.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-14843-9_1
VL - 5919 LNAI
SE - 1-14
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78649853140&partnerID=MN8TOARS
ER -
TY - CONF
TI - Governance of services: A natural function for agents
AU - Brazier, F.M.
AU - Dignum, F.
AU - Dignum, V.
AU - Huhns, M.H.
AU - Lessner, T.
AU - Padget, J.
AU - Quillinan, T.
AU - Singh, M.P.
C2 - 2010///
C3 - Belgian/Netherlands Artificial Intelligence Conference
DA - 2010///
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84873828353&partnerID=MN8TOARS
ER -
TY - BOOK
TI - From quality to utility: Adaptive service selection framework
AU - Hang, C.-W.
AU - Singh, M.P.
AB - We consider an approach to service selection wherein service consumers choose services with desired nonfunctional properties to maximize their utility. A consumer’s utility from using a service clearly depends upon the qualities offered by the service. Many existing service selection approaches support agents estimating trustworthiness of services based on their quality of service. However, existing approaches do not emphasize the relationship between a consumer’s interests and the utility the consumer draws from a service. Further, they do not properly support consumers being able to compose services with desired quality (and utility) profiles.We propose an adaptive service selection framework that offers three major benefits. First, our approach enables consumers to select services based on their individual utility functions, which reflect their preferences, and learn the providers’ quality distributions. Second, our approach guides consumers to construct service compositions that satisfy their quality requirements. Third, an extension of our approach with contracts approximates Pareto optimality without the use of a market mechanism.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-17358-5_31
VL - 6470 LNCS
SE - 456-470
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78650799447&partnerID=MN8TOARS
ER -
TY - CHAP
TI - Elements of a Business-Level Architecture for Multiagent Systems
AU - Chopra, Amit K.
AU - Singh, Munindar P.
T2 - Lecture Notes in Computer Science
PY - 2010///
DO - 10.1007/978-3-642-14843-9_2
VL - 5919 LNAI
SP - 15-30
OP -
PB - Springer Berlin Heidelberg
SN - 9783642148422 9783642148439
UR - http://dx.doi.org/10.1007/978-3-642-14843-9_2
DB - Crossref
ER -
TY - BOOK
TI - Information sharing among autonomous agents in referral networks
AU - Udupi, Y.B.
AU - Singh, M.P.
AB - Referral networks are a kind of P2P system consisting of autonomous agents who seek and provide services, or refer other service providers. Key applications include service discovery and selection, and knowledge sharing. An agent seeking a service contacts other agents to discover suitable service providers. An agent who is contacted may autonomously ignore the request or respond by providing the desired service or giving a referral. This use of referrals is inspired by human interactions, where referrals are a key basis for judging the trustworthiness of a given service. The use of referrals differentiates such networks from traditional P2P information sharing systems, which are based on request flooding. Not only does the use of referrals enable an agent to control how its request is processed, it also provides an architectural basis for four kinds of interaction policies. InterPol is a language and framework supporting such policies. InterPol provides an ability to specify requests with hard and soft constraints as well as a vocabulary of application-independent terms based on interaction concepts. Using these, InterPol enables agents to reveal private information and accept others’ information based on subtle relationships. In this manner, InterPol goes beyond traditional referral and other P2P systems in supporting practical applications. InterPol has been implemented using a Datalog-based policy engine for each agent. It has been applied on scenarios from a (multinational) health care project. The contribution of this paper is in a general referrals-based architecture for information sharing among autonomous agents, which is shown to effectively capture a variety of privacy and trust requirements of autonomous users.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-11368-0_2
VL - 5319 LNAI
SE - 13-26
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-76249097437&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Incorporating expectations as a basis for business service selection
AU - ElMessiry, A.M.
AU - Gao, X.
AU - Singh, M.P.
AB - The collaborative creation of value is the central tenet of services science. In particular, then, the quality of a service encounter would depend on the mutual expectations of the participants. Specifically, the quality of experience that a consumer derives from a service encounter would depend on how the consumer’s expectations are refined and how well they are met by the provider during the encounter. We postulate that incorporating expectations ought therefore be a crucial element of business service selection. Unfortunately, today’s technical approaches to service selection disregard the above. They emphasize reputation measured via numeric ratings that consumers provide about service providers. Such ratings are easy to process computationally, but beg the question as to what the raters’ frames of reference, i.e., expectations. When the frames of reference are not modeled, the resulting reputation scores are often not sufficiently predictive of a consumer’s satisfaction. We investigate the notion of expectations from a computational perspective. We claim that (1) expectations, despite being subjective, are a well-formed, reliably computable notion and (2) we can compute expectations and use them as a basis for improving the effectiveness of service selection. Our approach is as follows. First, we mine textual assessments of service encounters given by consumers to build a model of each consumer’s expectations along with a model of each provider’s ability to satisfy such expectations. Second, we apply expectations to predict a consumer’s satisfaction for engaging a particular provider. We validate our claims based on real data obtained from eBay.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-17358-5_33
VL - 6470 LNCS
SE - 486-500
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78650792928&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Correctness properties for multiagent systems
AU - Singh, M.P.
AU - Chopra, A.K.
DA - 2010///
PY - 2010///
DO - 10.1007/978-3-642-11355-0_12
VL - 5948 LNAI
SE - 192-207
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77949868106&partnerID=MN8TOARS
ER -
TY - CHAP
TI - Abstracting and Applying Business Modeling Patterns from RosettaNet
AU - Telang, Pankaj R.
AU - Singh, Munindar P.
T2 - Service-Oriented Computing
AB - RosettaNet is a leading industry effort that creates standards for business interactions among the participants in a supply chain. The RosettaNet standard defines over 100 Partner Interface Processes (PIPs) through which the participants can exchange business documents necessary to enact a supply chain. However, each PIP specifies the business interactions at a syntactic level, but fails to capture the business meaning of the interactions to which they apply. In contrast, this paper takes as its point of departure a commitment-based approach for business modeling that gives central position to interactions captured in terms of their meaning. This paper defines commitment-based business patterns abstracted from RosettaNet PIPs. Doing so yields models that are clearer, more flexible to changing requirements, and potentially enacted through multiple operationalizations. This paper validates the patterns by applying them to model the Order-to-Cash business process from the RosettaNet eBusiness Process Scenario Library.
PY - 2010///
DO - 10.1007/978-3-642-17358-5_29
VL - 6470 LNCS
SP - 426-440
OP -
PB - Springer Berlin Heidelberg
SN - 9783642173578 9783642173585
UR - http://dx.doi.org/10.1007/978-3-642-17358-5_29
DB - Crossref
ER -
TY - RPRT
TI - Bottleneck crossing minimization in layered graphs
AU - Stallmann, Matthias F
AU - Gupta, Saurabh
A3 - Dept of Computer Science, North Carolina State University
DA - 2010///
PY - 2010///
M1 - TR-2010-13
PB - Dept of Computer Science, North Carolina State University
SN - TR-2010-13
ER -
TY - RPRT
TI - High-contrast algorithm behavior: Observation, conjecture, and experimental design
AU - Stallmann, Matthias F
AU - Brglez, Franc
A3 - North Carolina State University. Dept. of Computer Science
DA - 2010///
PY - 2010///
PB - North Carolina State University. Dept. of Computer Science
ER -
TY - JOUR
TI - Rank-Deficient and Ill-Conditioned Nonlinear Least Squares Problems
AU - Kelley, C T
AU - Ipsen, I C F
AU - Pope, S R
DA - 2010///
PY - 2010///
ER -
TY - CONF
TI - Optimization of a Mathematical Model of Cerebral Autoregulation Using patient Data
AU - Aoi, M C
AU - Kelley, C T
AU - Novak, V
AU - Olufsen, M S
AB - This study presents an analysis of a cerebral autoregulation (CA) model developed by Ursino and Lodi Ursino and Lodi (1997). We have used this model to analyze non-invasive measurements of cerebral blood flow velocity (CBFV) and arterial blood pressure obtained during postural change from sitting to standing for a healthy young subject. This paper includes a sensitivity analysis, ranking model parameters from the most to the least sensitive, and an analysis (using a methodology called subset selection) that allows identification of correlations among model parameters. Finally, we estimated patient specific parameters using the Levenberg-Marquardt optimization method minimizing the least square errors between computed and measured values of CBFV.
C2 - 2010///
C3 - Proceedings of 7th IFAC Symposium on Modelling and Control in Biomedical Systems
DA - 2010///
DO - 10.3182/20090812-3-DK-2006.0088
SP - 6 pages
ER -
TY - CONF
TI - Parallel Computation of Surrogate Models for Potential Energy Surfaces
AU - Mokrauer, David
AU - Kelley, C T
AU - Bykhovski, Alexei
A2 - Qingping, Quo
A2 - Yucheng, Guo
C2 - 2010///
C3 - 2010 International Symposium on Distributed Computing and Applications to Business, Engineering and Science
CY - Los Alamitos, CA
DA - 2010///
SP - 1-4
PB - IEEE
ER -
TY - JOUR
TI - Expository Research Papers
AU - Ipsen, Ilse
T2 - SIAM Review
AB - The first paper in this issue is concerned with the numerical solution of an inverse problem, and the second one with detecting properties of networks. Alexander Graham Bell discovered the photoacoustic effect in the nineteenth century. He noticed that thin discs emit a sound when they are exposed to a light beam that is rapidly turned on and off. What happens is that the disks absorb the energy from the light, and convert it to heat. The heat then produces a momentary expansion, which in turn sets off a pressure wave or sound. The photoacoustic effect is exploited in biomedical applications, to help with the detection of lesions and cancer. The tissue is exposed to energy pulses and then expands. The expansion produces ultrasonic waves that propagate to the boundary and can be detected there. The objective of the paper “Mathematical Modeling in Photoacoustic Imaging of Small Absorbers” by Habib Ammari, Emmanuel Bossy, Vincent Jugnon, and Hyeonbae Kang is to identify energy absorbing regions from measurements taken at the boundary. This is an inverse problem, and the boundary conditions require special attention. The authors derive a reconstruction method, and present numerical experiments to illustrate its effectiveness. This is noteworthy paper, due to its potential contribution to medical imaging. Mathematicians like to gauge their position in the community via the so-called Erdös number, which represents the “collaborative distance” to Paul Erdös. Erdös (1913–1996) was a prolific Hungarian mathematician who worked in many areas, including combinatorics, graph theory, and number theory, and published by some accounts as many as 1400 papers. Erdös himself has an Erdös number of 0, while his coauthors have an Erdös number of 1. To compute your own Erdös number, take the lowest Erdös number among all of your coauthors, and then add one. If none of your coauthors has a finite Erdös number, neither do you, and your Erdös number is $\infty$. How can we express the influence of Paul Erdös in mathematical terms? There is his centrality, measured by the number of his coauthors and said to exceed 500. There is his communicability, which is the sum of all finite Erdös numbers, but with larger Erdös numbers given less weight (i.e., Erdös number k is divided by k!). And there is his betweenness, a measure of what would happen to the communicability of the other mathematicians had Erdös not existed. Concepts such as centrality, communicability, and betweenness quantify the connectivity and topology of general networks. Ernesto Estrada and Desmond Higham, in their paper “Network Properties Revealed through Matrix Functions,” express these concepts in terms of the exponential and resolvent of the adjacency matrix, and compare them on real test data from social science, ecology, and proteomics. This well-written paper gives us a glimpse into network science, a new area that studies patterns of interactions, and exposes the opportunities for contributions from linear algebra.
DA - 2010/1//
PY - 2010/1//
DO - 10.1137/siread000052000004000675000001
VL - 52
IS - 4
SP - 675-675
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79952956707&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Expository Research Papers
AU - Ipsen, Ilse
T2 - SIAM Review
AB - The two papers in this issue deal with differential equations, one with the numerical solution of partial differential equations, and the other one with analytic solutions for ordinary differential equations.
In his paper From Functional Analysis to Iterative Methods, Robert Kirby is concerned with linear systems arising from discretizations of partial differential equations (PDEs). Specifically, the PDEs are elliptic and describe boundary value problems; the discretizations are done via finite elements, and at issue is the convergence rate of iterative methods for solving the linear systems. The author's approach is to go back to the underlying variational problem in a Hilbert space, and to make ample use of the Riesz representation theorem. This point of view results in short and elegant proofs, as well as the construction of efficient preconditioners. The general theory is illustrated with two concrete model problems of PDEs for convection diffusion and planar elasticity. This paper will appeal to anybody who has an interest in the numerical solution of PDEs.
In 1963 the mathematician/meteorologist Edward Lorenz formulated a system of three coupled nonlinear ordinary differential equations, whose long-term behavior is described by an attractor with fractal structure. You can see a beautiful rendition of the thus named Lorenz attractor on the cover of this issue. Although it is easy to plot solutions of the Lorenz system, it is much harder to determine them mathematically. This is what motivated the paper Complex Singularities and the Lorenz Attractor by Divakar Viswanath and Sonmez Sahutoglu. Their idea is to allow the time variable to be complex, rather than real; to focus on singular solutions; and to express these singular solutions in terms of so-called psi series. After all is said and done, the authors end up with a two-parameter family of complex solutions to the Lorenz system. This a highly readable and very enjoyable paper, with concrete steps for future research, and connections to thunderstorms and analytic function theory.
DA - 2010/1//
PY - 2010/1//
DO - 10.1137/siread000052000002000267000001
VL - 52
IS - 2
SP - 267-267
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77249161188&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Expository Research Papers
AU - Ipsen, Ilse
T2 - SIAM Review
AB - The two papers in this issue have to do with matrices and sparsity—but from different points of view. Sparsity, in the first paper, means many zero elements in the matrix, while in the second paper it refers to many zero singular values, i.e., low rank. The context of the first paper, “On the Block Triangular Form of Symmetric Matrices” by Iain Duff and Bora Uçar, is the solution of linear systems of equations $Ax = b$ whose coefficient matrix A is sparse, i.e., has many zero elements. A direct method, such as Gaussian elimination, becomes more efficient if one can first permute the rows and columns of A into block triangular form. The classical method for permuting a matrix to block triangular form is due to Dulmage and Mendelsohn and dates back to 1963. The idea is to represent the matrix A as a bipartite graph whose nodes are columns and rows of A, and whose edges correspond to nonzero elements of A, and then to determine a matching of maximum cardinality in this graph. That means determining a maximal number of nonzero elements no two of which belong to the same row or column. Duff and Uçar analyze the block triangular form for a particular class of square matrices A: These matrices are structurally symmetric, i.e., their zero/nonzero structure is symmetric; and they can be structurally rank deficient, i.e., any rank deficiency is evident from the zero/nonzero structure of A. This paper illustrates nicely how graph theory can contribute to improving the efficiency of sparse matrix methods. The paper should appeal to those who need to solve large sparse linear systems, as well as those interested in graph theory. The second paper, “Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization” by Benjamin Recht, Maryam Fazel, and Pablo Parrilo, has applications to model reduction and system identification, machine learning, and image compression, just to name a few. Given a set of affine constraints for a matrix, the problem is to find a matrix of minimum rank that satisfies these constraints. The authors attack this hard nonconvex optimization problem by replacing it with a convex approximation: Instead of minimizing the rank, they minimize the sum of the singular values, the so-called nuclear norm. Nuclear norm minimization thus extends the compressed sensing framework from finding sparse vectors via $\ell_1$ minimization to finding low-rank matrices via $\ell_1$ minimization of the (vector of) singular values. The purpose of this paper is to justify mathematically why nuclear norm minimization does so well in practice. In addition to extending the restricted isometry property to matrices, the authors also discuss algorithms, computational performance, and numerical issues. This is a fascinating and well-written paper that combines results from compressed sensing, matrix theory, optimization, and probability.
DA - 2010/1//
PY - 2010/1//
DO - 10.1137/siread000052000003000453000001
VL - 52
IS - 3
SP - 453-453
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77954340593&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Modeling and Simulation in Scilab/Scicos with ScicosLab 4.4
AU - Campbell, Stephen L.
AU - Chancelier, Jean-Philippe
AU - Nikoukhah, Ramine
AB - Scilab is a free open-source software package for scientific computation. It includes hundreds of general purpose and specialized functions for numerical computation, organized in libraries called too
DA - 2010///
PY - 2010///
DO - 10.1007/978-1-4419-5527-2
PB - Springer New York
ER -
TY - JOUR
TI - Glycine and a Glycine Dehydrogenase (GLDC) SNP as Citalopram/Escitalopram Response Biomarkers in Depression: Pharmacometabolomics-Informed Pharmacogenomics
AU - Ji, Y
AU - Hebbring, S
AU - Zhu, H
AU - Jenkins, G D
AU - Biernacka, J
AU - Snyder, K
AU - Drews, M
AU - Fiehn, O
AU - Zeng, Z
AU - Schaid, D
AU - Mrazek, D A
AU - Kaddurah-Daouk, R
AU - Weinshilboum, R M
T2 - Clinical Pharmacology & Therapeutics
AB - Major depressive disorder (MDD) is a common psychiatric disease. Selective serotonin reuptake inhibitors (SSRIs) are an important class of drugs used in the treatment of MDD. However, many patients do not respond adequately to SSRI therapy. We used a pharmacometabolomics-informed pharmacogenomic research strategy to identify citalopram/escitalopram treatment outcome biomarkers. Metabolomic assay of plasma samples from 20 escitalopram remitters and 20 nonremitters showed that glycine was negatively associated with treatment outcome (P = 0.0054). This observation was pursued by genotyping tag single-nucleotide polymorphisms (SNPs) for genes encoding glycine synthesis and degradation enzymes, using 529 DNA samples from SSRI-treated MDD patients. The rs10975641 SNP in the glycine dehydrogenase (GLDC) gene was associated with treatment outcome phenotypes. Genotyping for rs10975641 was carried out in 1,245 MDD patients in the Sequenced Treatment Alternatives to Relieve Depression (STAR*D) study, and its presence was significant (P = 0.02) in DNA taken from these patients. These results highlight a possible role for glycine in SSRI response and illustrate the use of pharmacometabolomics to “inform” pharmacogenomics. Clinical Pharmacology & Therapeutics (2011) 89 1, 97–104. doi: 10.1038/clpt.2010.250
DA - 2010/11/24/
PY - 2010/11/24/
DO - 10.1038/clpt.2010.250
VL - 89
IS - 1
SP - 97-104
J2 - Clin Pharmacol Ther
OP -
SN - 0009-9236 1532-6535
UR - http://dx.doi.org/10.1038/clpt.2010.250
DB - Crossref
ER -
TY - JOUR
TI - Teaching Introductory Differential Equations with ScicosLab
AU - Campbell, Stephen
AU - Nikoukhah, Ramine
T2 - CODEE Journal
AB - Perhaps the largest and most capable open source software for doing applied mathematics is the open source package Scicoslab. Widely used in Europe and Asia it is less well known in the United States. In this article we will explain how ScicosLab can be easily used to help teach differential equations and to also introduce students to a software package that they can take with them for the rest of their careers.
DA - 2010///
PY - 2010///
DO - 10.5642/codee.201007.01.02
VL - 7
IS - 1
SP - 1-12
J2 - CODEE
OP -
SN - 2160-5211
UR - http://dx.doi.org/10.5642/codee.201007.01.02
DB - Crossref
ER -
TY - JOUR
TI - Lipidomic analysis of variation in response to simvastatin in the Cholesterol and Pharmacogenetics Study
AU - Kaddurah-Daouk, Rima
AU - Baillie, Rebecca A.
AU - Zhu, Hongjie
AU - Zeng, Zhao-Bang
AU - Wiest, Michelle M.
AU - Nguyen, Uyen Thao
AU - Watkins, Steven M.
AU - Krauss, Ronald M.
T2 - Metabolomics
AB - Statins are commonly used for reducing cardiovascular disease risk but therapeutic benefit and reductions in levels of low-density lipoprotein cholesterol (LDL-C) vary among individuals. Other effects, including reductions in C-reactive protein (CRP), also contribute to treatment response. Metabolomics provides powerful tools to map pathways implicated in variation in response to statin treatment. This could lead to mechanistic hypotheses that provide insight into the underlying basis for individual variation in drug response. Using a targeted lipidomics platform, we defined lipid changes in blood samples from the upper and lower tails of the LDL-C response distribution in the Cholesterol and Pharmacogenetics study. Metabolic changes in responders are more comprehensive than those seen in non-responders. Baseline cholesterol ester and phospholipid metabolites correlated with LDL-C response to treatment. CRP response to therapy correlated with baseline plasmalogens, lipids involved in inflammation. There was no overlap of lipids whose changes correlated with LDL-C or CRP responses to simvastatin suggesting that distinct metabolic pathways govern statin effects on these two biomarkers. Metabolic signatures could provide insights about variability in response and mechanisms of action of statins. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1007/s11306-010-0207-x) contains supplementary material, which is available to authorized users.
DA - 2010/4/1/
PY - 2010/4/1/
DO - 10.1007/s11306-010-0207-x
VL - 6
IS - 2
SP - 191-201
J2 - Metabolomics
LA - en
OP -
SN - 1573-3882 1573-3890
UR - http://dx.doi.org/10.1007/s11306-010-0207-x
DB - Crossref
KW - Cardiovascular disease
KW - Lipidomics
KW - Metabolomics
KW - Pharmacogenomics
KW - Pharmacometabolomics
KW - Simvastatin
ER -
TY - CHAP
TI - The Eigenproblem and Invariant Subspaces: Perturbation Theory
AU - Ipsen, Ilse C. F.
T2 - G.W. Stewart
AB - In this collection of papers, Pete Stewart established the foundations for the perturbation theory of invariant subspaces. He introduced two crucial concepts that allow a systematic approach toward such a perturbation theory: subspace rotation and operator separation. These two concepts form the guiding principle in most of these papers.
PY - 2010///
DO - 10.1007/978-0-8176-4968-5_7
SP - 71-93
OP -
PB - Birkhäuser Boston
SN - 9780817649678 9780817649685
UR - http://dx.doi.org/10.1007/978-0-8176-4968-5_7
DB - Crossref
ER -
TY - CONF
TI - Process and product data management for staple yarn manufacturing
AU - Hamilton, B.J.
AU - Oxenham, W.
AU - Hodge, G.L.
AU - Thoney, K.A.
C2 - 2010///
C3 - Proceedings of the Centenary Conference 2010 of the Textile Institute
DA - 2010///
ER -
TY - JOUR
TI - Development and application of expert systems in the textile industry
AU - Shamey, R.
AU - Shim, W.S.
AU - Joines, J.A.
T2 - Modelling and Predicting Textile Behaviour
AB - Abstract: North Carolina State University, USAAbstract: The textile and color industry has experienced many technological advances, which have resulted in improvements in quality and productivity. These advances have often accompanied reductions in personnel resources and a diminishing expertise base. Conversely, the resolution of problems in the global manufacturing complex increasingly go beyond the abilities of individual experts and can be very time consuming as the process is influenced by a large number of, often, interactive variables. The application of expert systems in the textile industry can help address many of these problems more effectively and economically. In this chapter, an overview of expert system technology is given and different types of expert systems including rule-based, fault trees, model-based, machine learning and hybrid approaches are described and compared. A brief review of system principles, strengths and shortcomings is given and the development strategy is described. Finally, various applications of expert systems in different sectors of the textile industry including product components (fibre, yarn and fabric), coloration and finishing as well as supply chain and management are highlighted and future trends are briefly portrayed.
DA - 2010///
PY - 2010///
DO - 10.1533/9781845697211.2.494
SP - 494-519
ER -
TY - JOUR
TI - Developing a Cost Model for Sourcing Products for Different Distribution Channels
AU - Fiallos, Max
DA - 2010///
PY - 2010///
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook (Spanish Version)
AU - Joines, J.A.
AU - Roberts, S.D.
AU - Otamendi, J.
DA - 2010///
PY - 2010///
PB - Simio LLC
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook (Portuguese Version)
AU - Joines, J.A.
AU - Roberts, S.D.
DA - 2010///
PY - 2010///
PB - Simio LLC
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook (Italian Version)
AU - Joines, J.A.
AU - Roberts, S.D.
AU - Rubio, M.
DA - 2010///
PY - 2010///
PB - Simio LLC
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook (Chinese Version)
AU - Joines, J.A.
AU - Roberts, S.D.
AU - Zhou, Z.
DA - 2010///
PY - 2010///
PB - Simio LLC
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook
AU - Joines, J.A.
AU - Roberts, S.D.
DA - 2010///
PY - 2010///
PB - Simio LLC
SN - 978-0-9829782-2-1
ER -
TY - CONF
TI - Programming multiagent systems without programming agents
AU - Singh, M. P.
AU - Chopra, A. K.
C2 - 2010///
C3 - Programming multi-agent systems
DA - 2010///
VL - 5919
SP - 1-14
ER -
TY - CONF
TI - Topology-incurred delay for information dissemination in large multi-channel cognitive radio networks
AU - Sun, L.
AU - Wang, Wenye
AB - Cognitive Radio (CR) networks have become an important component of the modern communication infrastructure due to their capability of improving spectrum usage efficiency by exploiting channels opportunistically. In CR networks, the network topology changes very frequently because of the temporarily available channels and dynamic transmitting parameters (e.g. transmission power and transmitting frequency), which may even result in network disconnectivity from time to time. Hence an interesting and open question is that: are there bounds on end-to-end delay between a source-destination pair with Euclidean distance d apart in such networks? These bounds are required for time-critical applications. This paper first investigates the nature of topology-incurred end-to-end delay in large multi-channel CR networks and then identifies the conditions under which the asymptotic topology-incurred delay scales linearly with the Euclidean distance (d); that is, the conditions under which the end-to-end delay is bounded. The results in this paper are validated through extensive simulations and can advance our understanding of CR network performance.
C2 - 2010///
C3 - 2010 ieee global telecommunications conference globecom 2010
DA - 2010///
DO - 10.1109/glocom.2010.5683925
ER -
TY - JOUR
TI - Performance Modeling of Virtual Collaborative Environments
AU - Gavaskar, Nilesh
AU - Kallitsis, Michael G.
AU - Devetsikiotis, Michael
AU - Michailidis, George
AU - Montoya, Mitzi
T2 - 2010 IEEE GLOBECOM WORKSHOPS
AB - In this paper, we present a framework for performance modeling of virtual collaborative environments (VCE). Our model could be used as benchmarking tool for assessing the quality of experience of participants in a virtual environment. Our framework is designed to assess Second Life type of environments but could easily be extended to any kind of virtual worlds. We examine the case of users communicating via chatting and voice. We capture the performance for both cases and using response surface methodology techniques we derive a utility function that yields the performance of the examined environment given the available computing and communication resources. We propose a pricing scheme and based on this we formulate optimization problems for optimal resource allocation for VCEs.
DA - 2010///
PY - 2010///
DO - 10.1109/glocomw.2010.5700165
SP - 1383-1387
SN - 2166-0069
ER -
TY - CONF
TI - Heuristic-based request scheduling subject to a percentile response time SLA in a distributed cloud
AU - Boloor, K.
AU - Chirkova, R.
AU - Salo, T.
AU - Viniotis, Y.
AB - We consider geographically distributed data centers forming a collectively managed cloud computing system hosting multiple applications, each subject to Service Level Agreements (SLA). The Service Level Agreements for each application require the response time of a certain percentile of the input requests to be less than a specified value, with the non-conforming requests being charged a penalty. We present a novel approach of heuristic-based request scheduling at each server, in each of the geographically distributed data centers, to globally minimize the penalty charged to the cloud computing system. We evaluate two variants of our heuristic-based approach, one based on the simulated annealing method of neighborhood searches and another based on gi-FIFO scheduling, which has been analytically proven to be the best schedule for percentile goals in a single machine, multi-class problem. We also compare our approaches with First In First Out (FIFO) and Weighted Round Robin (WRR) scheduling policies.
C2 - 2010///
C3 - 2010 ieee global telecommunications conference globecom 2010
DA - 2010///
DO - 10.1109/glocom.2010.5683946
ER -
TY - JOUR
TI - An apparatus for P2P classification in Netflow traces
AU - Gossett, Andrew M.
AU - Papapanagiotou, Ioannis
AU - Devetsikiotis, Michael
T2 - 2010 IEEE GLOBECOM WORKSHOPS
AB - Application classification from Netflow traces is a challenging process due to the lack of payload information. It is even becoming more challenging when the applications running in the network tend to hide under well known ports, encrypt packets and are distributed. In this paper, we propose an in-the-box apparatus for Netflow classification of Bit Torrent applications. The apparatus includes several device optimizations and requires low processing power. It was developed by reverse engineering the Bit Torrent protocol and by identifying connection patterns. The accuracy of the algorithm reaches high values specifically for Bit Torrent peers that use the DHT protocol.
DA - 2010///
PY - 2010///
DO - 10.1109/glocomw.2010.5700160
SP - 1361-1366
SN - 2166-0069
ER -
TY - CONF
TI - Multidisciplinary views of business contracts
AU - Singh, M. P.
AU - Desai, N.
C2 - 2010///
C3 - Service-oriented computing
DA - 2010///
VL - 6470
SP - 730-730
ER -
TY - CONF
TI - Incorporating expectations as a basis for business service selection
AU - ElMessiry, A. M.
AU - Gao, X. B.
AU - Singh, M. P.
C2 - 2010///
C3 - Service-oriented computing
DA - 2010///
VL - 6470
SP - 486-500
ER -
TY - JOUR
TI - QoS Control for NGN: A Survey of Techniques
AU - Yun, Changho
AU - Perros, Harry
T2 - JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT
DA - 2010/12//
PY - 2010/12//
DO - 10.1007/s10922-010-9157-x
VL - 18
IS - 4
SP - 447-461
SN - 1064-7570
KW - IMS
KW - NGN
KW - QoS control
KW - RACF
KW - RACS
KW - Service
ER -
TY - JOUR
TI - On the global optimality of generalized trust region subproblems
AU - Jin, Qingwei
AU - Fang, Shu-Cherng
AU - Xing, Wenxun
T2 - OPTIMIZATION
AB - Quadratically constrained quadratic programming is an important class of optimization problems. We consider the case with one quadratic constraint. Since both the objective function and its constraint can be neither convex nor concave, it is also known as the ‘generalized trust region subproblem.’ The theory and algorithms for this problem have been well studied under the Slater condition. In this article, we analyse the duality property between the primal problem and its Lagrangian dual problem, and discuss the attainability of the optimal primal solution without the Slater condition. The relations between the Lagrangian dual and semidefinite programming dual is also given.
DA - 2010///
PY - 2010///
DO - 10.1080/02331930902995236
VL - 59
IS - 8
SP - 1139-1151
SN - 0233-1934
KW - global optimization
KW - quadratic programming
KW - generalized trust region subproblems
KW - Lagrangian
ER -
TY - CONF
TI - On the connectivity analysis over large-scale hybrid wireless networks
AU - Yi, C.
AU - Wang, Wenye
AB - Many real systems are hybrid networks which include infrastructure nodes in multi-hop wireless networks, such as sinks in sensor networks and mesh routers in mesh networks. However, we have very little understanding of network connectivity in such networks. Therefore, in this paper, we consider hybrid networks denoted by H(¿, ß) with ad hoc nodes and base stations and prove how base stations can improve the connectivity of ad hoc nodes in subcritical phase, that is, the ad hoc node density, ¿ _{¿} is lower than the critical density ¿ _{¿} ^{c} . We find that with the existence of a positive density of base stations, i.e., the density of base stations ¿ _{ß} > 0 which have the same transmission range as ad hoc nodes, the number of connected ad hoc nodes is ¿(n) with probability nearly 1, where n is the number of ad hoc nodes. However, the size of connected ad hoc component scales linearly with ¿ _{ß} when it is lower than c _{1} (¿ _{¿} ) with probability nearly 1, which demonstrates a tremendous benefit of using base stations to enhance the connectivity of ad hoc nodes. Further, we study a hybrid network architecture that makes a significant connectivity improvement with transmission range r _{ß} larger than r _{¿} for ad hoc nodes. Therefore, our results provide a theoretical understanding of to what extent ad hoc nodes can benefit from base stations in multi-hop wireless networks.
C2 - 2010///
C3 - 2010 proceedings ieee infocom
DA - 2010///
DO - 10.1109/infcom.2010.5462106
ER -
TY - CONF
TI - On order gain of backoff misbehaving nodes in CSMA/CA-based wireless networks
AU - Lu, Z.
AU - Wang, Wenye
AU - Wang, C.
AB - Backoff misbehavior, in which a wireless node deliberately manipulates its backoff time, can induce significant network problems, such as severe unfairness and denial-of-service. Although great progress has been made towards the design of countermeasures to backoff misbehavior, little attention has been focused on quantifying the gain of backoff misbehaviors. In this paper, we define and study two general classes of backoff misbehavior to assess the gain that misbehaving nodes can obtain. The first class, called continuous misbehavior, keeps manipulating the backoff time unless it is disabled by countermeasures. The second class is referred to as intermittent misbehavior, which tends to evade the detection by countermeasures by performing misbehavior sporadically. Our approach is to introduce a new performance metric, namely order gain, which is to characterize the performance benefits of misbehaving nodes in comparison to legitimate nodes. Through analytical studies, simulations, and experiments, we demonstrate the impact of a wide range of backoff misbehaviors on network performance with respect to the number of users in CSMA/CA-based wireless networks.
C2 - 2010///
C3 - 2010 proceedings ieee infocom
DA - 2010///
DO - 10.1109/infcom.2010.5462002
ER -
TY - JOUR
TI - Guest Editors' Introduction: Special Issue on Modeling and Simulation of Cross-Layer Interactions in Communication Networks
AU - Devetsikiotis, Michael
AU - Granelli, Fabrizio
T2 - ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION
AB - introduction Share on Guest editors' introduction: Special issue on modeling and simulation of cross-layer interactions in communication networks Authors: Michael Devetsikiotis North carolina state university North carolina state universityView Profile , Fabrizio Granelli University of trento University of trentoView Profile Authors Info & Claims ACM Transactions on Modeling and Computer SimulationVolume 21Issue 1December 2010 Article No.: 1pp 1–4https://doi.org/10.1145/1870085.1870086Published:17 December 2010Publication History 0citation178DownloadsMetricsTotal Citations0Total Downloads178Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
DA - 2010/12//
PY - 2010/12//
DO - 10.1145/1870085.1870086
VL - 21
IS - 1
SP -
SN - 1049-3301
ER -
TY - JOUR
TI - Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks
AU - Chen, Bensong
AU - Rouskas, George N.
AU - Dutta, Rudra
T2 - JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING
AB - We consider a hierarchical approach for traffic grooming in large multiwavelength networks of a general topology. Inspired by similar concepts in the airline industry, we decompose the network into clusters, and select a hub node in each cluster to groom traffic originating and terminating locally. At the second level of the hierarchy, the hub nodes form a virtual cluster for the purpose of grooming intra-cluster traffic. Clustering and hierarchical grooming enables us to cope with large network sizes and facilitates the control and management of traffic and network resources. Yet, determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired trade-off among various goals. We also obtain lower bounds on two important objectives in traffic grooming: the number of lightpaths and wavelengths needed to carry the subwavelength traffic. We demonstrate the effectiveness of clustering and hierarchical grooming by presenting the results of experiments on two network topologies that are substantially larger than those considered in previous traffic grooming studies.
DA - 2010/8/1/
PY - 2010/8/1/
DO - 10.1364/jocn.2.000502
VL - 2
IS - 8
SP - 502-514
SN - 1943-0639
KW - Optical networking
KW - Traffic grooming
KW - Network design
KW - Resource provisioning
KW - Hierarchical grooming
KW - Routing
KW - Control plane algorithms
KW - Large networks
ER -
TY - CONF
TI - Characterizing the spread of correlated failures in large wireless networks
AU - Xu, Y.
AU - Wang, Wenye
AB - Correlated failures pose a great challenge for the normal functioning of large wireless networks, because an initial local failure may trigger a global sequence of related failures. Given their potentially devastating impact, we characterize the spread of correlated failures in this paper, which lays the foundation for evaluating and improving the failure resilience of existing wireless networks. We model the failure contagiousness as two generic functions: the failure impact radius distribution function f _{r} (x) and the failure connection function g(x). By using the percolation theory, we determine the respective characteristic regimes of f _{r} (x) and g(x) in which correlated failures will and will not percolate in the network. As our model represents various failure scenarios, the results are generally applicable in understanding the spread of a wide range of correlated failures.
C2 - 2010///
C3 - 2010 proceedings ieee infocom
DA - 2010///
DO - 10.1109/infcom.2010.5462009
ER -
TY - JOUR
TI - An optimal and near-optimal strategy to selecting individuals for transfer in captive breeding programs
AU - Allen, S. D.
AU - Fathi, Y.
AU - Gross, K.
AU - Mace, M.
T2 - BIOLOGICAL CONSERVATION
AB - As species extinction rates continue to rise, zoos have adopted a more active role in the conservation of endangered species. A central concern is to preserve genetic diversity of zoological populations. Accordingly, when selecting individuals to transfer to new or existing populations, zoo managers must consider the genetic effects on all populations involved. We propose a quadratic integer programming (IP) model to identify a group of individuals to transfer that maximizes genetic diversity within two subpopulations. We then reduce this model to a linear IP formulation and apply it to the California condor (Gymnogyps californianus) studbook. After simplifying the linear IP model, optimality is achieved within a reasonable time limit when a limited number of individuals are relocated. We also develop a local improvement algorithm (LIA) to efficiently provide near-optimal solutions when we increase the number of transferred individuals. The LIA quickly obtains optimal solutions when few individuals are transferred and in most cases, the LIA outperforms MetaMK, an existing program used to select animals for transfer.
DA - 2010/11//
PY - 2010/11//
DO - 10.1016/j.biocon.2010.08.003
VL - 143
IS - 11
SP - 2858-2863
SN - 1873-2917
KW - Minimum kinship
KW - Maximum genetic diversity
KW - Relocation
KW - Reintroductions
ER -
TY - JOUR
TI - An Exploratory Analysis of Two Iterative Linear Programming-Simulation Approaches for Production Planning
AU - Irdem, D. Fatih
AU - Kacar, N. Baris
AU - Uzsoy, Reha
T2 - IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING
AB - Production planning models that aim at determining optimal release schedules for production facilities face a fundamental circularity. In order to match supply to demand in an optimal manner, they must recognize the cycle time that elapses between material being released into the plant and its emergence as finished product. However, it is well known from queuing models that the mean cycle time increases nonlinearly with resource utilization, which is determined by the release schedule. To address this circularity, a number of authors have suggested algorithms which iterate between a linear programming model that determines releases for a set of flow time estimates, and a simulation model that evaluates the production realized from that release schedule. We present computational experiments examining the behavior of two such algorithms. We find that the convergence behavior of one is significantly more consistent than that of the other, and explore insights that may lead to improved algorithms.
DA - 2010/8//
PY - 2010/8//
DO - 10.1109/tsm.2010.2051751
VL - 23
IS - 3
SP - 442-455
SN - 1558-2345
KW - Flow times
KW - linear programming (LP)
KW - production planning
KW - simulation
ER -
TY - CONF
TI - Review and evaluation of security threats on the communication networks in the smart grid
AU - Lu, Z.
AU - Lu, X. A.
AU - Wang, Wenye
AU - Wang, C.
AB - The smart grid, generally referred to as the next-generation power electric system, relies on robust communication networks to provide efficient, secure, and reliable information delivery. Thus, the network security is of critical importance in the smart grid. In this paper, we aim at classifying and evaluating the security threats on the communication networks in the smart grid. Based on a top-down analysis, we categorize the goals of potential attacks against the smart grid communication networks into three types: network availability, data integrity and information privacy. We then qualitatively analyze both the impact and feasibility of the three types of attacks. Moreover, since network availability is the top priority in the security objectives for the smart grid, we use experiments to quantitatively evaluate the impact of denial-of-service (DoS) attacks on a power substation network. Our work provides initial experimental data of DoS attacks against a power network and shows that the network performance degrades dramatically only when the DoS attack intensity approaches to the maximum.
C2 - 2010///
C3 - Military communications conference, 2010 (milcom 2010)
DA - 2010///
DO - 10.1109/milcom.2010.5679551
SP - 1830–1835
ER -
TY - JOUR
TI - Proper Orthogonal Decomposition with Updates for Efficient Control Design in Smart Material Systems
AU - May, Stephen F.
AU - Smith, Ralph C.
T2 - BEHAVIOR AND MECHANICS OF MULTIFUNCTIONAL MATERIALS AND COMPOSITES 2010
AB - Proper orthogonal decomposition (POD) is a basis reduction technique that allows simulations of complicated systems to be calculated at faster speeds with minimal loss of accuracy. The reduced order basis is created from a set of system data called snapshots. The speed and information retention of POD make it an attractive method to implement reduced-order models of smart material systems. This can allow for the modeling of larger systems and the implementation of real time control, which may be impossible when using the full-order system. There are times when the dynamics of a system can change during a simulation, and the addition of more information to the set of snapshots would be beneficial. The implementation of control on a system is a time when adding new snapshots to the collection can increase the accuracy of the model. Using updates allows more flexibility when trying to balance the accuracy and the speed of the simulation. By updating the POD basis at specific times throughout the interval, we can increase the accuracy of the model and control by using a greater amount of the information given by the snapshots, while we can increase the speed of the simulation during times when using less information will still result in sufficient accuracy.
DA - 2010///
PY - 2010///
DO - 10.1117/12.847579
VL - 7644
SP -
SN - 0277-786X
KW - Smart materials
KW - proper orthogonal decomposition
KW - control
ER -
TY - JOUR
TI - PLANNING FOR INFECTIOUS DISEASE OUTBREAKS: A GEOGRAPHIC DISEASE SPREAD, CLINIC LOCATION, AND RESOURCE ALLOCATION SIMULATION
AU - Carr, Sean
AU - Roberts, Stephen
T2 - PROCEEDINGS OF THE 2010 WINTER SIMULATION CONFERENCE
AB - In the event of an outbreak of a highly contagious communicable disease, public health departments often open mass-vaccination or antiviral dispensing clinics to treat the infected population or reduce the further spread of disease. In this research, we have created a simulation of the disease spread process employing a SEIR compartmental model. The model includes employment patterns and separates the population into age groups and spatial location to more accurately describe disease spread behavior. The analysis involves measuring health-related performance as we change the number of days elapsing between clinic days. We open clinics in locations that maximize the infected population coverage subject to budget and resource-related constraints, using a MIP location-allocation model. An example case is provided in the context of an outbreak occurring in Wake County, NC. The simulation is coded in C++, using ILOG Concert Technology to implement the location-allocation model.
DA - 2010///
PY - 2010///
DO - 10.1109/wsc.2010.5678858
SP - 2171-2184
SN - 0891-7736
ER -
TY - JOUR
TI - PERFORMANCE COMPARISON OF MSER-5 AND N-SKART ON THE SIMULATION START-UP PROBLEM
AU - Mokashi, Anup C.
AU - Tejada, Jeremy J.
AU - Yousefi, Saeideh
AU - Xu, Tianxiang
AU - Wilson, James R.
AU - Tafazzoli, Ali
AU - Steiger, Natalie M.
T2 - PROCEEDINGS OF THE 2010 WINTER SIMULATION CONFERENCE
AB - We summarize some results from an extensive performance comparison of the procedures MSER-5 and N-Skart for handling the simulation start-up problem. We assume a fixed-length simulation-generated time series from which point and confidence-interval (CI) estimators of the steady-state mean are sought. MSER-5 uses the data-truncation point that minimizes the half-length of the usual batch-means CI computed from the truncated data set. N-Skart uses a randomness test to determine the data-truncation point beyond which spaced batch means are approximately independent of each other and the simulation's initial condition; then using truncated nonspaced batch means, N-Skart exploits separate adjustments to the CI half-length that account for the effects on the distribution of the underlying Student's t-statistic arising from skewness and autocorrelation of the batch means. In most of the test problems, N-Skart's point estimator had smaller bias than that of MSER-5; moreover in all cases, N-Skart's CI estimator outperformed that of MSER-5.
DA - 2010///
PY - 2010///
DO - 10.1109/wsc.2010.5679094
SP - 971-982
SN - 0891-7736
ER -
TY - JOUR
TI - Optimizing the use of public transit system during no-notice evacuation of urban areas
AU - Sayyady, Fatemeh
AU - Eksioglu, Sandra D.
T2 - COMPUTERS & INDUSTRIAL ENGINEERING
AB - This paper proposes a methodology that can be used to design plans for evacuating transit-dependent citizens during no-notice disasters. A mixed-integer linear program is proposed to model the problem of finding optimal evacuation routes. The objective of the problem is to minimize the total evacuation time and the number of casualties, simultaneously. A traffic simulation package is used to explicitly incorporate the traffic flow dynamics into our model in order to generate solutions which are consistent with the dynamics of traffic network. Due to the long running time of CPLEX, a Tabu search algorithm is designed that finds evacuation routes for transit vehicles. Computational experiments demonstrate that the solutions found are of high-quality. Numerical experiments are conducted using the transportation network of the city of Forth Worth, TX to illustrate the modeling procedure and solution approach.
DA - 2010/11//
PY - 2010/11//
DO - 10.1016/j.cie.2010.06.001
VL - 59
IS - 4
SP - 488-495
SN - 1879-0550
KW - No-notice disasters
KW - Emergency evacuation
KW - Public transit system
KW - Mixed-integer linear programming
ER -
TY - JOUR
TI - Inverse Model Construction for Control Implementation of Macro Fiber Composite Actuators Operating in Hysteretic Regimes
AU - Stuebner, Michael
AU - Smith, Ralph C.
T2 - BEHAVIOR AND MECHANICS OF MULTIFUNCTIONAL MATERIALS AND COMPOSITES 2010
AB - Macro Fiber Composite (MFC) actuators utilize PZT fibers embedded in an epoxy matrix for structural actuation.
Due to their construction, they are lightweight and provide broadband inputs. Significant advantages of
MFC actuators are their high performance, durability, and flexibility when compared to traditional piezoceramic
actuators. They are presently being considered for a range of applications including positioning of membrane
mirrors and structural control in the aerospace and automotive industry. However, they exhibit varying degrees of
hysteresis and constitutive nonlinearities throughout their operating range that must be incorporated in models
to achieve the full capabilities of the materials. In this paper, hysteresis is modeled using the homogenized energy
model. The inverse model is then used to construct an inverse compensator framework suitable for subsequent
control design. The performance of the inverse compensator is illustrated through a numerical example.
DA - 2010///
PY - 2010///
DO - 10.1117/12.848256
VL - 7644
SP -
SN - 0277-786X
KW - Hysteretic systems
KW - Inverse compensator
ER -
TY - CONF
TI - Estimating clearing functions from simulation data
AU - Kacar, N. B.
AU - Uzsoy, R.
C2 - 2010///
C3 - Proceedings of the 2010 winter simulation conference
DA - 2010///
SP - 1699-1710
ER -
TY - JOUR
TI - Design of RF MEMS Switches without Pull-in Instability
AU - Proctor, W. Cyrus
AU - Richards, Gregory P.
AU - Shen, Chongyi
AU - Skorczewski, Tyler
AU - Wang, Min
AU - Zhang, Jingyan
AU - Zhong, Peng
AU - Massad, Jordan E.
AU - Smith, Ralph
T2 - BEHAVIOR AND MECHANICS OF MULTIFUNCTIONAL MATERIALS AND COMPOSITES 2010
AB - Micro-electro-mechanical systems (MEMS) switches for radio-frequency (RF) signals have certain advantages over solid-state switches, such as lower insertion loss, higher isolation, and lower static power dissipation. Mechanical dynamics can be a determining factor for the reliability of RF MEMS. The RF MEMS ohmic switch discussed in this paper consists of a plate suspended over an actuation pad by four double-cantilever springs. Closing the switch with a simple step actuation voltage typically causes the plate to rebound from its electrical contacts. The rebound interrupts the signal continuity and degrades the performance, reliability and durability of the switch. The switching dynamics are complicated by a nonlinear, electrostatic pull-in instability that causes high accelerations. Slow actuation and tailored voltage control signals can mitigate switch bouncing and effects of the pull-in instability; however, slow switching speed and overly-complex input signals can significantly penalize overall system-level performance. Examination of a balanced and optimized alternative switching solution is sought. A step toward one solution is to consider a pull-in-free switch design. In this paper, determine how simple RC-circuit drive signals and particular structural properties influence the mechanical dynamics of an RF MEMS switch designed without a pull-in instability. The approach is to develop a validated modeling capability and subsequently study switch behavior for variable drive signals and switch design parameters. In support of project development, specifiable design parameters and constraints will be provided. Moreover, transient data of RF MEMS switches from laser Doppler velocimetry will be provided for model validation tasks. Analysis showed that a RF MEMS switch could feasibly be designed with a single pulse waveform and no pull-in instability and achieve comparable results to previous waveform designs. The switch design could reliably close in a timely manner, with small contact velocity, usually with little to no rebound even when considering manufacturing variability.
DA - 2010///
PY - 2010///
DO - 10.1117/12.848045
VL - 7644
SP -
SN - 1996-756X
ER -
TY - JOUR
TI - COST-EFFECTIVENESS ANALYSIS OF VACCINATION AND SELF-ISOLATION IN CASE OF H1N1
AU - Yarmand, Hamed
AU - Ivy, Julie S.
AU - Roberts, Stephen D.
AU - Bengtson, Mary W.
AU - Bengtson, Neal M.
T2 - PROCEEDINGS OF THE 2010 WINTER SIMULATION CONFERENCE
AB - In this research, we have conducted a cost-effectiveness analysis to examine the relative importance of vaccination and self-isolation, with respect to the current H1N1 outbreak. We have developed a continuous-time simulation model for the spread of H1N1 which allows for three types of interventions: antiviral prophylaxis and treatment, vaccination, and self-isolation and mandatory quarantine. The optimization model consists of two decision variables: vaccination fraction and self-isolation fraction among infectives. By considering the relative marginal costs associated with each of these decision variables, we have a linear objective function representing the total relative cost for each control policy. We have also considered upper bound constraints for maximum number of individuals under treatment (which is related to surge capacity) and percentage of infected individuals (which determines the attack rate). We have used grid search to obtain insight into the model, find the feasible region, and conduct the cost-effectiveness analysis.
DA - 2010///
PY - 2010///
DO - 10.1109/wsc.2010.5678918
SP - 2199-2210
SN - 0891-7736
ER -
TY - JOUR
TI - A new framework for GLIF Interdomain Resource Reservation Architecture (GIRRA)
AU - Karmous-Edwards, Gigi
AU - Polito, Silvana Greco
AU - Jukan, Admela
AU - Rouskas, George
T2 - ANNALS OF TELECOMMUNICATIONS
DA - 2010///
PY - 2010///
DO - 10.1007/s12243-010-0186-y
VL - 65
IS - 11-12
SP - 723-737
SN - 1958-9395
KW - Inter-domain networking
KW - Security
KW - Path computation
KW - GLIF
KW - Middleware
ER -
TY - CONF
TI - A fault-tolerance architecture for kepler-based distributed scientific workflows
AU - Mouallem, P.
AU - Crawl, D.
AU - Altintas, I.
AU - Vouk, M.
AU - Yildiz, U.
C2 - 2010///
C3 - Scientific and statistical database management
DA - 2010///
VL - 6187
SP - 452-460
ER -
TY - JOUR
TI - THE LINK BETWEEN REGULARITY AND STRONG-PI-REGULARITY
AU - Patricio, Pedro
AU - Hartwig, R. E.
T2 - JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY
AB - Abstract It is shown that if all powers of a ring element a are regular, then a is strongly pi-regular exactly when a suitable word in the powers of a and their inner inverses is a unit.
DA - 2010/8//
PY - 2010/8//
DO - 10.1017/s1446788710001448
VL - 89
IS - 1
SP - 17-22
SN - 1446-8107
KW - Drazin inverse
KW - strongly pi-regular
KW - Drazin index
ER -
TY - JOUR
TI - Reference priors for exponential families with increasing dimension
AU - Clarke, B.
AU - Ghosal, S.
T2 - Electronic Journal of Statistics
DA - 2010///
PY - 2010///
VL - 4
SP - 737-780
ER -
TY - JOUR
TI - Evidence-Based Trust: A Mathematical Model Geared for Multiagent Systems
AU - Wang, Yonghong
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS
AB - An evidence-based account of trust is essential for an appropriate treatment of application-level interactions among autonomous and adaptive parties. Key examples include social networks and service-oriented computing. Existing approaches either ignore evidence or only partially address the twin challenges of mapping evidence to trustworthiness and combining trust reports from imperfectly trusted sources. This article develops a mathematically well-formulated approach that naturally supports discounting and combining evidence-based trust reports. This article understands an agent Alice's trust in an agent Bob in terms of Alice's certainty in her belief that Bob is trustworthy. Unlike previous approaches, this article formulates certainty in terms of evidence based on a statistical measure defined over a probability distribution of the probability of positive outcomes. This definition supports important mathematical properties ensuring correct results despite conflicting evidence: (1) for a fixed amount of evidence, certainty increases as conflict in the evidence decreases and (2) for a fixed level of conflict, certainty increases as the amount of evidence increases. Moreover, despite a subtle definition of certainty, this work (3) establishes a bijection between evidence and trust spaces, enabling robust combination of trust reports and (4) provides an efficient algorithm for computing this bijection.
DA - 2010/11//
PY - 2010/11//
DO - 10.1145/1867713.1867715
VL - 5
IS - 4
SP -
SN - 1556-4703
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78649705255&partnerID=MN8TOARS
KW - Theory
KW - Algorithms
KW - Application-level trust
KW - evidence-based trust
ER -
TY - JOUR
TI - Efficient Solution of the Wigner-Poisson Equation for Modeling Resonant Tunneling Diodes
AU - Costolanski, Anne S
AU - Kelley, C T
T2 - IEEE Transactions on Nanotechnology
AB - A more efficient and accurate discretization of the Wigner-Poisson model for double barrier resonant tunneling diodes is presented. This new implementation uses nonuniform grids and higher order numerical methods to improve the accuracy of the solutions at a significantly lower computational cost. Using the new implementation, devices with short and long contact regions are analyzed as well as the effect of a correlation length parameter that defines the degree of nonlocality effects. The results show that devices with longer contact regions reduce numerical inconsistencies present when modeling shorter devices, and that longer correlation lengths generally improve the correspondence of the numerical solutions with those typically expected from experimental measurement. These new numerical simulation tools will enable researchers to successfully apply the Wigner-Poisson model to describe electron transport in nanoscale semiconductor tunneling devices. More specifically, the computationally more efficient numerical algorithms presented will be shown to allow for the quantum-based studies of resonant tunneling devices useful as sources and detectors at very high frequencies (e.g., THz regime). These types of devices are very important for use in sensors and sensing systems where very long wavelength characterization capabilities are important (e.g., interrogation of chemical and biological systems) as well as an array of other electronics applications.
DA - 2010///
PY - 2010///
DO - 10.1109/tnano.2010.2053214
VL - 9
IS - 6
SP - 708-715
ER -
TY - CONF
TI - All-terminal network reliability optimization in fading environment via cross entropy method
AU - Kharbash, S.
AU - Wang, Wenye
AB - This paper presents a new algorithm that can be readily applied to solve all-terminal network reliability optimization problem of a wireless network in a fading environment. The optimization problem solved considers finding the optimal topological layout of links at which the all-terminal network reliability is maximized by controlling the nodes' transmission powers. To that end, a link probabilistic model is developed to relate fading, attenuation, interference and nodes' transmission powers to link reliability. Then, the proposed algorithm utilized this probabilistic model to control nodes' transmission power to maximize links reliabilities and hence all-terminal network reliability. The proposed algorithm is based on two major steps that use a global stochastic optimization technique, Cross Entropy (CE) to generate the optimal network topology and control nodes transmission powers such that all-terminal network reliability is maximized. An illustrative example is used to illustrate the proposed algorithm.
C2 - 2010///
C3 - 2010 ieee international conference on communications - ICC 2010
DA - 2010///
DO - 10.1109/icc.2010.5501918
ER -
TY - JOUR
TI - The L-1-consistency of Dirichlet mixtures in multivariate Bayesian density estimation
AU - Wu, Y. F.
AU - Ghosal, S.
T2 - Journal of Multivariate Analysis
DA - 2010///
PY - 2010///
VL - 101
IS - 10
SP - 2411-2419
ER -
TY - JOUR
TI - Symmetrically constrained compositions
AU - Beck, Matthias
AU - Gessel, Ira M.
AU - Lee, Sunyoung
AU - Savage, Carla D.
T2 - RAMANUJAN JOURNAL
AB - Given integers a1,a2,…,an, with a1+a2+⋅⋅⋅+an≥1, a symmetrically constrained composition λ1+λ2+⋅⋅⋅+λn=M of M into n nonnegative parts is one that satisfies each of the n! constraints \(\{\sum_{i=1}^{n}a_{i}\lambda_{\pi(i)}\geq 0:\pi \in S_{n}\}\). We show how to compute the generating function of these compositions, combining methods from partition theory, permutation statistics, and lattice-point enumeration.
DA - 2010/12//
PY - 2010/12//
DO - 10.1007/s11139-010-9232-7
VL - 23
IS - 1-3
SP - 355-369
SN - 1572-9303
KW - Symmetrically constrained composition
KW - Partition analysis
KW - Permutation statistics
KW - Generating function
KW - Lattice-point enumeration
ER -
TY - JOUR
TI - SEMISMOOTH NEWTON METHODS FOR TIME-OPTIMAL CONTROL FOR A CLASS OF ODES
AU - Ito, Kazufumi
AU - Kunisch, Karl
T2 - SIAM JOURNAL ON CONTROL AND OPTIMIZATION
AB - Time-optimal control problems for a class of linear multi-input systems are considered. The problems are regularized and the asymptotic and monotone behavior of the regularization procedure is investigated. For the regularized problems the applicability of semismooth Newton methods is verified. First numerical tests are presented which show that the proposed approach is different from other methods in that it does not rely on a priori information about the switching structure.
DA - 2010///
PY - 2010///
DO - 10.1137/090753905
VL - 48
IS - 6
SP - 3997-4013
SN - 1095-7138
KW - semismooth Newton method
KW - time-optimal control
ER -
TY - JOUR
TI - Methods for computing color anaglyphs
AU - McAllister, David F.
AU - Zhou, Ya
AU - Sullivan, Sophia
T2 - STEREOSCOPIC DISPLAYS AND APPLICATIONS XXI
AB - A new computation technique is presented for calculating pixel colors in anaglyph images. The method depends upon knowing the RGB spectral distributions of the display device and the transmission functions of the filters in the viewing glasses. It requires the solution of a nonlinear least-squares program for each pixel in a stereo pair and is based on minimizing color distances in the CIEL*a*b* uniform color space. The method is compared with several techniques for computing anaglyphs including approximation in CIE space using the Euclidean and Uniform metrics, the Photoshop method and its variants, and a method proposed by Peter Wimmer. We also discuss the methods of desaturation and gamma correction for reducing retinal rivalry.
DA - 2010///
PY - 2010///
DO - 10.1117/12.837163
VL - 7524
SP -
SN - 1996-756X
ER -
TY - JOUR
TI - Current Progress on Statistical Methods for Mapping Quantitative Trait Loci from Inbred Line Crosses
AU - Silva, Luciano Da Costa E.
AU - Zeng, Zhao-Bang
T2 - JOURNAL OF BIOPHARMACEUTICAL STATISTICS
AB - Tremendous progress has been made in recent years on developing statistical methods for mapping quantitative trait loci (QTL) from crosses of inbred lines. Most of the recent research is focused on strategies for mapping multiple-QTL and associated model selection procedures and criterion. We review the progress of research in this area on one trait and multiple traits by maximum likelihood and Bayesian methods.
DA - 2010///
PY - 2010///
DO - 10.1080/10543400903572845
VL - 20
IS - 2
SP - 454-481
SN - 1520-5711
KW - Inbred lines
KW - Quantitative trait loci
KW - Statistical methods
ER -
TY - JOUR
TI - Clustering Analysis to Characterize Mechanistic-Empirical Pavement Design Guide Traffic Data in North Carolina
AU - Sayyady, Fatemeh
AU - Stone, John R.
AU - Taylor, Kent L.
AU - Jadoun, Fadi M.
AU - Kim, Y. Richard
T2 - TRANSPORTATION RESEARCH RECORD
AB - This paper presents attempts to generate regional average truck axle load distribution factors (ALFs), monthly adjustment factors (MAFs), hourly distribution factors (HDFs), and vehicle class distributions (VCDs) for North Carolina. The results support Mechanistic–Empirical Pavement Design Guide (MEPDG) procedures. Weigh-in-motion data support the analysis and generate seasonal factors. MEPDG damage-based sensitivity analysis shows that pavement performance is sensitive to North Carolina site-specific ALFs, MAFs, and VCDs. Similar results occur for national default values of ALF, MAF, and VCD. Hierarchical clustering analysis based on North Carolina ALFs and MAFs develops representative seasonal traffic patterns for different regions of the state. Findings show that seasonal truck traffic has distinct characteristics for the eastern coastal plain, the central Piedmont, and the western mountains. A simplified decision tree and a related table help the pavement designer select the proper representative patterns of ALF and MAF. To develop VCD factors, the approach uses 48–h classification counts and a seasonal factoring procedure to account for day-of-week and seasonal variations. The approach incorporates site-specific truck traffic to improve the accuracy of pavement design. On the basis of sensitivity analysis results, pavement performance is found to be insensitive to North Carolina site-specific and national default values of HDF; thus, the average statewide HDF values may be used as input to MEPDG. Specific contributions of this research are the relative insensitivity of pavement performance to HDF, the use of 48-h classification counts to estimate VCD inputs, and a decision tree and table to help pavement designers select the proper ALF and MAF inputs.
DA - 2010///
PY - 2010///
DO - 10.3141/2160-13
IS - 2160
SP - 118-127
SN - 2169-4052
ER -
TY - JOUR
TI - A method to generate autocorrelated stochastic signals based on the random phase spectrum
AU - Kim, Jong S.
AU - Huh, You
AU - Suh, Moon W.
T2 - JOURNAL OF THE TEXTILE INSTITUTE
AB - Most of the random signals used to analyze the quality of an industry product or process disturbance have properties that can be described by an autocorrelation function. This research suggests a novel method that can generate stochastic signals that have specific autocorrelated properties. On the basis of the power spectrum and the inverse Fourier transform, stochastic signals were generated by the new method, which applies the random phase angle distribution to the power spectrum of the signal. Then, the autocorrelation functions of the generated signals were compared with the assigned autocorrelation functions. Results showed that stochastic signals with five different types of autocorrelation functions could be effectively produced by the suggested method, which we have called the “Random Phase Spectral Method”. Ensembles of the generated stochastic signals could find applications in analyzing dynamic systems that work under perturbed circumstances. The effect of the autocorrelated perturbations in the model parameters or process conditions on the dynamic state of a process system could also be estimated by simulation using the stochastic signals generated by the RPS method.
DA - 2010///
PY - 2010///
DO - 10.1080/14685240802528443
VL - 101
IS - 5
SP - 471-479
SN - 1754-2340
KW - stochastic signal
KW - autocorrelation function
KW - perturbation
KW - random phase
KW - power spectrum
ER -
TY - JOUR
TI - A game-theoretic framework for estimating a health purchaser's willingness-to-pay for health and for expansion
AU - Yaesoubi, Reza
AU - Roberts, Stephen D.
T2 - HEALTH CARE MANAGEMENT SCIENCE
DA - 2010/12//
PY - 2010/12//
DO - 10.1007/s10729-010-9135-6
VL - 13
IS - 4
SP - 358-377
SN - 1572-9389
KW - Game theory
KW - Willingness-to-pay
KW - Health care
KW - Moral hazard
KW - Asymmetric information
KW - Resource allocation
KW - Implementation
KW - Colorectal cancer
ER -
TY - JOUR
TI - A Non-linear Optimal Control Design using Narrowband Perturbation Feedback for Magnetostrictive Actuators
AU - Oates, William S.
AU - Zrostlik, Rick
AU - Eichhorn, Scott
AU - Smith, Ralph
T2 - JOURNAL OF INTELLIGENT MATERIAL SYSTEMS AND STRUCTURES
AB - Non-linear optimal and narrowband feedback control designs are developed and experimentally implemented on a magnetostrictive Terfenol-D actuator. The non-linear optimal control design incorporates a non-linear and hysteretic ferromagnetic homogenized energy model within an optimal control formulation to reduce displacement tracking errors and increase bandwidth. Improvements in robustness in the steady-state regime are achieved by utilizing narrowband feedback. A narrowband filter is implemented by treating the nonlinear and hysteretic magnetostrictive constitutive behavior as higher-order harmonic disturbances which are mitigated by tuning the narrowband filter to penalize these harmonics for displacement tracking control problems. The control designs are then combined into a hybrid optimal controller with perturbation narrowband feedback. Both transient and steady-state tracking control is assessed to illustrate performance attributes in different operating regimes. Narrowband perturbation feedback is shown to mitigate errors in the steady-state operating regime, while non-linear optimal control provides enhanced tracking control in the transient regime. The hybrid control design is relevant to a broad number of smart material actuators that exhibit non-linear and hysteretic field-coupled constitutive behavior.
DA - 2010/11//
PY - 2010/11//
DO - 10.1177/1045389x10386398
VL - 21
IS - 16
SP - 1681-1693
SN - 1530-8138
KW - magnetostrictive
KW - narrowband control
KW - hysteresis
KW - non-linear optimal control
ER -
TY - JOUR
TI - Robust parameter-dependent fault-tolerant control for actuator and sensor faults
AU - Cai, Xuejing
AU - Wu, Fen
T2 - INTERNATIONAL JOURNAL OF CONTROL
AB - In this article, we study a robust fault-tolerant control (FTC) problem for linear systems subject to time-varying actuator and sensor faults. The faults under consideration are loss of effectiveness in actuators and sensors. Based on the estimated faults from a fault detection and isolation scheme, robust parameter-dependent FTC will be designed to stabilise the faulty system under all possible fault scenarios. The synthesis condition of such an FTC control law will be formulated in terms of linear matrix inequalities (LMIs) and can be solved efficiently by semi-definite programming. The proposed FTC approach will be demonstrated on a simple faulty system with different fault levels and fault estimation error bounds.
DA - 2010///
PY - 2010///
DO - 10.1080/00207179.2010.481024
VL - 83
IS - 7
SP - 1475-1484
SN - 1366-5820
KW - fault-tolerant control
KW - actuator and sensor faults
KW - gain-scheduling control
KW - L-2 gain optimisation
KW - LMI
ER -
TY - JOUR
TI - An economic model for pricing tiered network services
AU - Lv, Qian
AU - Rouskas, George N.
T2 - ANNALS OF TELECOMMUNICATIONS
DA - 2010/4//
PY - 2010/4//
DO - 10.1007/s12243-009-0149-3
VL - 65
IS - 3-4
SP - 147-161
SN - 1958-9395
KW - Tiered services
KW - Price structure
KW - Economic model
ER -
TY - JOUR
TI - The (2,2,0) group inverse problem
AU - Patricio, P.
AU - Hartwig, R. E.
T2 - APPLIED MATHEMATICS AND COMPUTATION
AB - Abstract We characterize the existence of the group inverse of a two by two matrix with zero (2, 2) entry, over a ring by means of the existence of the inverse of a suitable function of the other three entries. Some special cases are derived.
DA - 2010/9/15/
PY - 2010/9/15/
DO - 10.1016/j.amc.2010.05.084
VL - 217
IS - 2
SP - 516-520
SN - 0096-3003
KW - Group inverse
KW - Block matrices
ER -
TY - JOUR
TI - Robust fault detection and isolation for parameter-dependent LFT systems
AU - Cai, Xuejing
AU - Wu, Fen
T2 - INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
AB - In this paper, we consider robust fault detection and isolation (FDI) problems for faulty linear systems with linear fractional transformation (LFT) parameter dependency and propose an observer-based solution by using multiobjective optimization techniques. To simplify the design process, a general faulty LFT system will be constructed from the standard LFT description by converting actuator/system component faults into sensor faults first. Then a bank of parameter-dependent FDI filters will be designed to identify each fault. Each FDI filter will generate a residual signal to track an individual fault with minimum error and to suppress the effects of disturbances, time-varying parameters and other fault signals. The design of LFT parameter-dependent FDI filters, as a multiobjective optimization problem, will be formulated in terms of linear matrix inequalities (LMIs) and can be solved efficiently. A numerical example is used to demonstrate the proposed fault detection and isolation approach for LFT systems with different parametric structures. Copyright © 2009 John Wiley & Sons, Ltd.
DA - 2010/5/10/
PY - 2010/5/10/
DO - 10.1002/rnc.1468
VL - 20
IS - 7
SP - 764-776
SN - 1099-1239
KW - fault detection and isolation
KW - LFT systems
KW - actuator and sensor faults
KW - multiobjective optimization
KW - LMI
ER -
TY - JOUR
TI - QTL Identification Using Combined Linkage and Linkage Disequilibrium Mapping for Milk Production Traits on BTA6 in Chinese Holstein Population
AU - Hu, F.
AU - Liu, J. F.
AU - Zeng, Z. B.
AU - Ding, X. D.
AU - Yin, C. C.
AU - Gong, Y. Z.
AU - Zhang, Q.
T2 - ASIAN-AUSTRALASIAN JOURNAL OF ANIMAL SCIENCES
AB - Milk production traits are important economic traits for dairy cattle. The aim of the present study was to refine the position of previously detected quantitative trait loci (QTL) on bovine chromosome 6 affecting milk production traits in Chinese Holstein dairy cattle. A daughter design with 918 daughters from 8 elite sire families and 14 markers spanning the previously identified QTL region were used in the analysis. We employed a combined linkage and linkage disequilibrium analysis (LDLA) approach with two options for calculating the IBD probabilities, one was based on haplotypes of all 14 markers (named Method 1) and the other based on haplotypes with sliding windows of 5 markers (named Method 2). For milk fat yield, the two methods revealed a highly significant QTL located within a 6.5 cM interval (Method 1) and a 4.0 cM interval (Method 2), respectively. For milk protein yield, a highly significant QTL was detected within a 3.0 cM interval (Method 1) or a 2.5 cM interval (Method 2). These results confirmed the findings of our previous study and other studies, and greatly narrowed down the QTL positions.
DA - 2010/10//
PY - 2010/10//
DO - 10.5713/ajas.2010.10011
VL - 23
IS - 10
SP - 1261-1267
SN - 1976-5517
KW - Fine Mapping
KW - QTL
KW - Bos Taurus autosome 6
KW - Milk Production Traits
ER -
TY - JOUR
TI - Optimal control of parabolic variational inequalities
AU - Ito, Kazufumi
AU - Kunisch, Karl
T2 - JOURNAL DE MATHEMATIQUES PURES ET APPLIQUEES
AB - Optimal control of parabolic variational inequalities is studied in the case where the spatial domain is not necessarily bounded. First, strong and weak solutions concepts for the variational inequality are proposed and existence results are obtained by a monotone and a finite difference technique. An optimal control problem with the control appearing in the coefficient of the leading term is investigated and a first order optimality system in a Lagrangian framework is derived. On étudie le contrôle optimal d'inégalités variationnelles dans le cas où le domaine spatial n'est pas nécessairement borné. Tout d'abord, on introduit des concepts de solutions fortes et faibles pour l'inégalité variationnelle et on obtient des résultats d'existence par une méthode de différences finies et monotone. On examine ensuite un problème de contrôle optimal avec un contrôle apparaissant dans le coefficient du terme principal et on en déduit un système d'optimalité du premier ordre dans un cadre lagrangien.
DA - 2010/4//
PY - 2010/4//
DO - 10.1016/j.matpur.2009.10.005
VL - 93
IS - 4
SP - 329-360
SN - 0021-7824
KW - Variational inequalities
KW - Strong solutions
KW - Weak solutions
KW - Unbounded domain
KW - Difference schemes
KW - Optimal control
ER -
TY - JOUR
TI - APPROXIMATE NULLSPACE ITERATIONS FOR KKT SYSTEMS
AU - Ito, Kazufumi
AU - Kunisch, Karl
AU - Schulz, Volker
AU - Gherman, Ilia
T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
AB - We investigate a linear iteration scheme for solving Karush–Kuhn–Tucker systems arising from optimization problems with linear equality constraints. The iterations are motivated by the simplicity of the proposed combination of iterations for the forward and adjoint systems that need to be solved and for which efficient solvers may already be available. Convergence results are derived, and their practical relevance is investigated by means of a numerical example.
DA - 2010///
PY - 2010///
DO - 10.1137/080724952
VL - 31
IS - 4
SP - 1835-1847
SN - 1095-7162
KW - KKT systems
KW - iterative solvers
KW - optimization
ER -
TY - JOUR
TI - TWO-PERSON KNAPSACK GAME
AU - Wang, Zhenbo
AU - Xing, Wenxun
AU - Fang, Shu-Cherng
T2 - JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
AB - In this paper, we study a two-person knapsack game. Two investors,each with an individual budget, bid on a common pool of potentialprojects. To undertake a project, investors have their own costestimation to be charged against their budgets. Associated with eachproject, there is a potential market profit that can be taken by theonly bidder or shared proportionally by both bidders. The objectivefunction of each investor is assumed to be a linear combination ofthe two bidders' profits. Both investors act in a selfish mannerwith best-response to optimize their own objective functions bychoosing portfolios under the budget restriction. We show that pureNash equilibrium exists under certain conditions. In this case, noinvestor can improve the objective by changing individual bidunilaterally. A pseudo polynomial-time algorithm is presented forgenerating a pure Nash equilibrium. We also investigate the price ofanarchy (the ratio of the worst Nash equilibrium to the socialoptimum) associated with a simplified two-person knapsack game.
DA - 2010/11//
PY - 2010/11//
DO - 10.3934/jimo.2010.6.847
VL - 6
IS - 4
SP - 847-860
SN - 1553-166X
KW - Game theory
KW - Nash equilibrium
KW - price of anarchy
KW - knapsack problem
ER -
TY - JOUR
TI - On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
AU - Xing, Fei
AU - Wang, Wenye
T2 - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
AB - Network survivability is the ability of a network to stay connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad hoc networks. In this paper, we focus on the analysis of network survivability in the presence of node misbehaviors and failures. First, we propose a novel semi-Markov process model to characterize the evolution of node behaviors. As an immediate application of the proposed model, we investigate the problem of node isolation where the effects of denial-of-service (DoS) attacks are considered. Then, we present the derivation of network survivability and obtain the lower and upper bounds on the topological survivability for k-connected networks. We find that the network survivability degrades very quickly with the increasing likelihood of node misbehaviors, depending on the requirements of disjoint outgoing paths or network connectivity. Moreover, DoS attacks have a significant impact on the network survivability, especially in dense networks. Finally, we validate the proposed model and analytical result by simulations and numerical analysis, showing the effects of node misbehaviors on both topological survivability and network performance.
DA - 2010///
PY - 2010///
DO - 10.1109/tdsc.2008.71
VL - 7
IS - 3
SP - 284-299
SN - 1941-0018
KW - Network survivability
KW - node misbehaviors
KW - semi-Markov process
KW - node behavior modeling
KW - node isolation problem
KW - k-connectivity
KW - wireless ad hoc networks
ER -
TY - JOUR
TI - EXTENDED CANONICAL DUALITY AND CONIC PROGRAMMING FOR SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS
AU - Lu, Cheng
AU - Wang, Zhenbo
AU - Xing, Wenxun
AU - Fang, Shu-Cherng
T2 - JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
AB - An extended canonical dual approach for solving 0-1 quadraticprogramming problems is introduced. We derive the relationshipbetween the optimal solutions to the extended canonical dual problemand the original problem and prove that there exists no duality gapin-between. The extended canonical dual approach leads to asufficient condition for global optimality, which is more generalthan known results of this kind. To solve the extended canonicaldual problem, we construct corresponding conic programming problemsand study their relationship to the extended canonical dual problem.Using this relationship, we design an algorithm for solving theextended canonical dual problem. Our work extends the known solvablesub-class of 0-1 quadratic programming problems.
DA - 2010/11//
PY - 2010/11//
DO - 10.3934/jimo.2010.6.779
VL - 6
IS - 4
SP - 779-793
SN - 1553-166X
KW - 0-1 quadratic programming
KW - canonical duality
KW - conic relaxation
ER -
TY - JOUR
TI - Design of Doubly Convergent Multiple-Beam Electron Guns
AU - Ives, R. Lawrence
AU - Attarian, Adam
AU - Tallis, William
AU - Andujar, Cynthia
AU - Forstall, Virginia
AU - Tran, Hien
AU - Read, Michael
AU - Bui, Thuc
T2 - IEEE TRANSACTIONS ON PLASMA SCIENCE
AB - In an effort to achieve higher power RF source performance, designers are utilizing distributed beam devices, such as sheet beams and multiple beams. A limitation is the amount of current that can be emitted by the cathode while still achieving long cathode lifetimes. The desire is to develop distributed beam devices that utilize fundamental mode cavities in the RF circuit. For multiple-beam devices, where the individual beams propagate at the same radius as the cathode, a limitation is reached, where the size of the cathode becomes limited by the space available. A solution is to place the cathodes at a larger radius and compress the beams toward the radius required for fundamental mode cavities. This paper describes the design of a multiple-beam gun where the ensemble of beams is compressed toward the device axis while still achieving parallel propagation through the RF circuit.
DA - 2010/6//
PY - 2010/6//
DO - 10.1109/tps.2010.2046501
VL - 38
IS - 6
SP - 1337-1344
SN - 0093-3813
KW - Computer optimization
KW - electron guns
KW - multiple-beam gun
KW - multiple-beam klystron
ER -
TY - JOUR
TI - An augmented method for free boundary problems with moving contact lines
AU - Li, Zhilin
AU - Lai, Ming-Chih
AU - He, Guowei
AU - Zhao, Hongkai
T2 - COMPUTERS & FLUIDS
AB - An augmented immersed interface method (IIM) is proposed for simulating one-phase moving contact line problems in which a liquid drop spreads or recoils on a solid substrate. While the present two-dimensional mathematical model is a free boundary problem, in our new numerical method, the fluid domain enclosed by the free boundary is embedded into a rectangular one so that the problem can be solved by a regular Cartesian grid method. We introduce an augmented variable along the free boundary so that the stress balancing boundary condition is satisfied. A hybrid time discretization is used in the projection method for better stability. The resultant Helmholtz/Poisson equations with interfaces then are solved by the IIM in an efficient way. Several numerical tests including an accuracy check, and the spreading and recoiling processes of a liquid drop are presented in detail.
DA - 2010/6//
PY - 2010/6//
DO - 10.1016/j.compfluid.2010.01.013
VL - 39
IS - 6
SP - 1033-1040
SN - 1879-0747
KW - Moving contact line
KW - Free boundary problem
KW - Triple junction
KW - One-phase flow
KW - Navier-Stokes equations
KW - Embedding technique
KW - Immersed interface method
KW - Irregular domain
KW - Augmented method
ER -
TY - JOUR
TI - Special issue in Memory of Alexander Rubinov
AU - Fukushima, M.
AU - Kelley, C. T.
AU - Qi, L. Q.
AU - Sun, J.
AU - Ye, Y. Y.
T2 - Pacific Journal of Optimization
DA - 2010///
PY - 2010///
VL - 6
IS - 2
ER -
TY - CONF
TI - Information sharing among autonomous agents in referral networks
AU - Udupi, Y. B.
AU - Singh, M. P.
C2 - 2010///
C3 - Agents and peer-to-peer computing
DA - 2010///
VL - 5319
SP - 13-26
ER -
TY - JOUR
TI - Deadline-based connection setup in wavelength-routed WDM networks
AU - Fawaz, Wissam
AU - Ouaiss, Iyad
AU - Chen, Ken
AU - Perros, Harry
T2 - COMPUTER NETWORKS
AB - This article addresses the ubiquitous topic of quality of service (QoS) aware connection provisioning in wavelength-routed WDM optical networks. The impact of the connection setup time of an optical connection has not been adequately addressed in the open literature. As such, this paper presents a novel approach that uses the optical connection setup time as a service differentiator during connection provisioning. The proposed approach utilizes the Earliest Deadline First (EDF) queueing algorithm to achieve deadline-based connection setup management with the deadline being the setup time requirement of an optical connection. The proposed EDF-based approach would allow the network operator to improve the QoS perceived by the end clients. Performance of this novel scheme is analyzed by accurately calculating various parameters, such as the fraction of connections provisioned on-time (i.e. prior to deadline expiration) and the average time it takes to successfully setup a connection. In addition, the presented approach is validated by a simulation that analyzes the performance of the proposed connection setup scheme in the specific context of the National Science Foundation Network (NSFNET). The obtained results show that a deadline-based setup strategy can minimize blocking probability while achieving QoS differentiation.
DA - 2010/8/2/
PY - 2010/8/2/
DO - 10.1016/j.comnet.2010.02.008
VL - 54
IS - 11
SP - 1792-1804
SN - 1872-7069
KW - Optical networks
KW - Connection setup management
KW - Earliest Deadline First scheduling
KW - Performance analysis
ER -
TY - JOUR
TI - Community structure in time-dependent, multiscale, and multiplex networks
AU - Mucha, P. M.
AU - Richardson, T.
AU - Macon, K.
AU - Porter, M. A.
AU - Onnela, J.-K.
T2 - Science
DA - 2010///
PY - 2010///
VL - 328
IS - 5980
SP - 876-878
ER -
TY - JOUR
TI - An approximation scheme for Black-Scholes equations with delays
AU - Chang, Mou-Hsiung
AU - Pang, Tao
AU - Pemy, Moustapha
T2 - JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
DA - 2010/6//
PY - 2010/6//
DO - 10.1007/s11424-010-0139-6
VL - 23
IS - 3
SP - 438-455
SN - 1009-6124
KW - Black-Scholes equation
KW - finite difference
KW - stochastic functional differential equations
KW - viscosity solutions
ER -
TY - JOUR
TI - Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions
AU - Kianfar, Kiavash
AU - Fathi, Yahya
T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
AB - The n-step mixed integer rounding (MIR) functions generate n-step MIR inequalities for MIP problems and are facets for the infinite group problems. We show that the n-step MIR functions also directly generate facets for the finite master cyclic group polyhedra especially in many cases where the breakpoints of the n-step MIR function are not necessarily at the elements of the group (hence the linear interpolation of the facet coefficients obtained has more than two slopes).
DA - 2010/11/16/
PY - 2010/11/16/
DO - 10.1016/j.ejor.2010.04.021
VL - 207
IS - 1
SP - 105-109
SN - 0377-2217
KW - Integer programming
KW - Mixed integer rounding
KW - Group problem
KW - Polyhedra
KW - Facet
ER -
TY - JOUR
TI - An active approach for detection of incipient faults
AU - Nikoukhah, R.
AU - Campbell, S. L.
AU - Drake, K.
T2 - INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
AB - The methodology of auxiliary signal design for robust fault detection based on a multi-model (MM) formulation of normal and faulty systems is used to study the problem of incipient fault detection. The fault is modelled as a drift in a system parameter, and an auxiliary signal is to be designed to enhance the detection of variations in this parameter. It is shown that it is possible to consider the model of the system with a drifted parameter as a second model and use the MM framework for designing the auxiliary signal by considering the limiting case as the parameter variation goes to zero. The result can be applied very effectively to many early detection problems where small parameter variations should be detected. Two different approaches for computing the test signal are given and compared on several computational examples.
DA - 2010///
PY - 2010///
DO - 10.1080/00207720903045817
VL - 41
IS - 2
SP - 241-257
SN - 1464-5319
KW - incipient fault detection
KW - fault detection
KW - auxiliary signal design
KW - identification
ER -
TY - JOUR
TI - An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
AU - Zhou, Xuesong
AU - List, George F.
T2 - TRANSPORTATION SCIENCE
AB - To design a transportation sensor network, the decision maker needs to determine what sensor investments should be made, as well as when, how, where, and with what technologies. This paper focuses on locating a limited set of traffic counting stations and automatic vehicle identification (AVI) readers in a network, so as to maximize the expected information gain for the subsequent origin-destination (OD) demand estimation problem. The proposed sensor design model explicitly takes into account several important error sources in traffic OD demand estimation, such as the uncertainty in historical demand information, sensor measurement errors, as well as approximation errors associated with link proportions. Based on a mean square measure, this paper derives analytical formulations to describe estimation variance propagation for a set of linear measurement equations. A scenario-based (SB) stochastic optimization procedure and a beam search algorithm are developed to find suboptimal point and point-to-point sensor locations subject to budget constraints. This paper also provides a number of illustrative examples to demonstrate the effectiveness of the proposed methodology.
DA - 2010/5//
PY - 2010/5//
DO - 10.1287/trsc.1100.0319
VL - 44
IS - 2
SP - 254-273
SN - 0041-1655
KW - origin-destination demand estimation
KW - sensor network design
KW - traffic counts
KW - automatic vehicle identification counts
ER -
TY - JOUR
TI - A Multicompartment Liver-based Pharmacokinetic Model for Benzene and its Metabolites in Mice
AU - Manning, Cammey C.
AU - Schlosser, Paul M.
AU - Tran, Hien T.
T2 - BULLETIN OF MATHEMATICAL BIOLOGY
AB - Benzene is a highly flammable, colorless liquid. Ubiquitous exposures result from its presence in gasoline vapors, cigarette smoke, and industrial processes. After uptake into the body, benzene undergoes a series of metabolic transformations to multiple metabolites that exert toxic effects on the bone marrow. We developed a physiologically based pharmacokinetic model for the uptake and elimination of benzene in mice to relate the concentration of inhaled and orally administered benzene to the tissue doses of benzene and its key metabolites. This model takes into account the zonal distribution of enzymes and metabolism in the liver rather than treating the liver as one homogeneous compartment, and considers metabolism in tissues other than the liver. Analysis was done to examine the existence and uniqueness of solutions of the system. We then formulated an inverse problem to obtain estimates for the unknown parameters; data from multiple laboratories and experiments were used. Despite the sources of variability, the model simulations matched the data reasonably well in most cases. Our study shows that the multicompartment metabolism model does improve predictions over the previous model (Cole et al. in J. Toxicol. Environ. Health, 439–465, 2001) and that in vitro metabolic constants can be successfully extrapolated to predict in vivo data for benzene metabolism and dosimetry.
DA - 2010/4//
PY - 2010/4//
DO - 10.1007/s11538-009-9459-x
VL - 72
IS - 3
SP - 507-540
SN - 0092-8240
KW - Benzene metabolism model
KW - Ordinary differential equations
KW - Existence and uniqueness
KW - Inverse problems
ER -
TY - JOUR
TI - Two-group knapsack game
AU - Wang, Zhenbo
AU - Xing, Wenxun
AU - Fang, Shu-Cherng
T2 - THEORETICAL COMPUTER SCIENCE
AB - This paper presents a “two-group knapsack game”. A number of investors colligate into two groups to bid on a common pool of potential projects. Each investor has his/her own budget limit and a cost estimation for undertaking each possible project. Each group represents a power by its market share. Associated with each project, there is a potential profit that can be realized. Investors in the same group hold an internal agreement of putting the group’s collective interest ahead of the individual’s interest and not bidding on the same project by more than one investor in the group. The profit of a particular project can be wholly taken by the sole bidder or shared proportionally by two bidders in different groups according to their group power. The objective of each group may be based not only on its own group profit but also on the other group’s profit. Assuming that each investor acts in a selfish manner with the best response to optimize its group’s objective subject to the budget constraint, we show that a pure Nash equilibrium exists under certain conditions. We also have some interesting findings of the “price of anarchy” (the ratio of the worst Nash equilibrium to the social optimum) associated with a simplified version of the two-group knapsack game with three investors.
DA - 2010/2/28/
PY - 2010/2/28/
DO - 10.1016/j.tcs.2009.12.002
VL - 411
IS - 7-9
SP - 1094-1103
SN - 1879-2294
KW - Game theory
KW - Knapsack problem
KW - Nash equilibrium
KW - Price of anarchy
ER -
TY - JOUR
TI - Simulation-Optimization Framework to Support Sustainable Watershed Development by Mimicking the Predevelopment Flow Regime
AU - Reichold, Laurel
AU - Zechman, Emily M.
AU - Brill, E. Downey
AU - Holmes, Hillary
T2 - JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT
AB - The modification of land and water resources for human use alters the natural hydrologic flow regime of a downstream receiving body of water. The natural flow regime is essential for sustaining biotic structure and equilibrium within the ecosystem. Best management practices mitigate the increased storm water runoff due to increased imperviousness and are typically designed and located within a watershed to match peak and minimum flows for a small set of targeted design storms. Ecosystems are, however, affected by all the characteristics of a long-term flow regime, including the magnitude, duration, frequency, and timing of flows. A more environmentally sustainable approach for watershed development is presented based on the minimization of differences in the characteristics of the flow regime between predevelopment and postdevelopment conditions. The indicator of hydrologic alteration (IHA) is a set of 33 hydrologic indices that characterize a flow regime and, coupled with the range of variability approach (RVA), can be used to evaluate a development strategy for its alteration of the long-term hydrologic flow regime. This paper presents a methodology to identify watershed management strategies that will have a minimal impact on the flow regime and downstream ecosystems. This methodology utilizes a metric that evaluates development strategies based on an IHA/RVA analysis implemented within a simulation-optimization framework. Continuous simulation of urban runoff for different land use strategies is enabled through the use of the storm water management model, and the resulting long-term hydrograph is analyzed using IHA/RVA. Development is allocated within subcatchments to maintain a predefined minimum level of total development while minimizing the hydrologic alteration. A hybrid optimization approach based on genetic algorithm and Nelder-Meade approaches is used to identify optimal land use allocation. Further analysis is conducted to identify alternative development patterns that allocate impervious development maximally differently among subcatchments while achieving similarly low alteration in the hydrologic flow regime.
DA - 2010///
PY - 2010///
DO - 10.1061/(asce)wr.1943-5452.0000040
VL - 136
IS - 3
SP - 366-375
SN - 1943-5452
KW - Simulation optimization
KW - Watershed management
KW - Urbanization
KW - Modeling to generate alternatives
KW - Genetic algorithm
ER -
TY - JOUR
TI - Distribution of Fiber Intersections in Two-Dimensional Random Fiber Webs - A Basic Geometrical Probability Model
AU - Suh, Moon W.
AU - Chun, Heuiju
AU - Berger, Roger L.
AU - Bloomfield, Peter
T2 - TEXTILE RESEARCH JOURNAL
AB - Fundamental theories governing the number of fiber intersections in random nonwoven fiber webs were developed based on the planar geometry of fiber midpoints distributed in a two-dimensional Poisson field. First, the statistical expectation and variance for the number of fiber intersections in unit web area were obtained as functions of a fixed number of fibers with equal lengths. The theories were extended to the case of a two-dimensional Poisson field by assuming that the number and locations of the fibers are random. The theories are validated by a newly developed computer simulation method employing the concept of “seeding region” and “counting region.” Unlike all previously published papers, it was shown for the first time that the expectations and variances obtained theoretically matched that from computer simulations almost perfectly, validating both the theories and simulation algorithms developed.
DA - 2010/3//
PY - 2010/3//
DO - 10.1177/0040517509105071
VL - 80
IS - 4
SP - 301-311
SN - 1746-7748
KW - fiber intersections
KW - intersection geometry
KW - fiber web
KW - non-wovens
KW - expectation
KW - variance
KW - edge effect
KW - Poisson field
ER -
TY - JOUR
TI - Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium
problems
AU - Zhang, Liping
AU - Wu, Soon-Yi
AU - Fang, Shu-Cherng
T2 - Journal of Industrial & Management Optimization
AB - The D-gap function approach has been adopted for solving variationalinequality problems. In this paper, we extend the approach forsolving equilibrium problems. From the theoretical point, we studythe convergence and global error bound of a D-gap function basedNewton method. A general equilibrium problem is first formulated as an equivalentunconstrained minimization problem using a new D-gap function. Thenthe conditions of 'strict monotonicity' and 'strong monotonicity'for equilibrium problems are introduced. Under the strictmonotonicity condition, it is shown that a stationary point of theunconstrained minimization problem provides a solution to theoriginal equilibrium problem. Without the assumption of Lipschitzcontinuity, we further prove that strong monotonicity conditionguarantees the boundedness of the level sets of the new D-gapfunction and derive error bounds on the level sets. Combining thestrict monotonicity and strong monotonicity conditions, we show theexistence and uniqueness of a solution to the equilibrium problem,and establish the global convergence property of the proposedalgorithm with a global error bound.
DA - 2010///
PY - 2010///
DO - 10.3934/jimo.2010.6.333
VL - 6
IS - 2
SP - 333-346
LA - en
OP -
SN - 1553-166X
UR - http://dx.doi.org/10.3934/jimo.2010.6.333
DB - Crossref
KW - Equilibrium problem
KW - D-gap function
KW - Error bound
KW - Unconstrained optimization
KW - Convergence
ER -
TY - JOUR
TI - Anonymizing bipartite graph data using safe groupings
AU - Cormode, Graham
AU - Srivastava, Divesh
AU - Yu, Ting
AU - Zhang, Qing
T2 - VLDB JOURNAL
DA - 2010/2//
PY - 2010/2//
DO - 10.1007/s00778-009-0167-9
VL - 19
IS - 1
SP - 115-139
SN - 0949-877X
KW - Privacy
KW - Microdata
KW - Graph
KW - Query answering
ER -
TY - JOUR
TI - Internet Predictions
AU - Cerf, Vinton G.
AU - Singh, Munindar P.
T2 - IEEE INTERNET COMPUTING
AB - More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future.
DA - 2010///
PY - 2010///
DO - 10.1109/mic.2010.11
VL - 14
IS - 1
SP - 10-11
SN - 1089-7801
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75449105653&partnerID=MN8TOARS
KW - space technology
KW - Internet predictions
KW - participatory sensing
KW - Internet
KW - personal data vault
KW - ubiquitous data capture
KW - data processing
KW - data protection
KW - tussle
KW - socio-technical systems
KW - broadband
KW - global networks
KW - interactive entertainment
KW - cloud computing
KW - procedural content generation
KW - climate
KW - carbon emissions
KW - green
KW - Internet evolution
KW - wireless
KW - technology forecasting
KW - prognosticators
KW - vision
KW - tussle
KW - socio-technical systems
KW - broadband
KW - global networks
KW - information society
KW - future ICT for sustainable growth
KW - Internet of Things
KW - open machine translation
KW - intercultural collaboration
KW - services computing
KW - language grid
KW - cloud computing
KW - bottom of the pyramid
KW - quant revolution
KW - multinationals
KW - knowledge-worker
KW - profit-center
KW - creation net
KW - Software engineering
KW - telecommunications
ER -
TY - JOUR
TI - A SHADOW-PRICE BASED HEURISTIC FOR CAPACITY PLANNING OF TFT-LCD MANUFACTURING
AU - Chen, Tzu-Li
AU - Lin, James T.
AU - Fang, Shu-Cherng
T2 - JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
AB - This paper studies the capacity planning and expansion for the thin film transistor - liquid crystal display (TFT-LCD) manufacturing.Capacity planning is critical to TFT-LCD industry due to its complex product hierarchy and increasing product types;the coexistence of multiple generations of manufacturing technologies in a multi-site production environment;and the rapidly growing market demands.One key purpose of capacity planning is to simultaneously determine the profitable 'product mix' and 'production quantities' of each product group across various generation sites in a particular period and the optimal 'capacity expansion quantity' of specific product groups at a certain site to improve the limited flexibility configurations through the acquisition of new auxiliary tools.This paper proposes a mixed integer linear programming model for capacity planning that incorporates practical characteristics and constraints in TFT-LCD manufacturing. A shadow-price based heuristic is developed to find a near-optimal solution. Preliminary computational study shows that the proposed heuristic provides good quality solutions in a reasonable amount of time.The proposed heuristic outperforms the traditional branch and bound method as the data size becomes large.
DA - 2010/2//
PY - 2010/2//
DO - 10.3934/jimo.2010.6.209
VL - 6
IS - 1
SP - 209-239
SN - 1547-5816
KW - Capacity planning
KW - TFT-LCD manufacturing
KW - mixed integer linear programming
KW - shadow price
ER -
TY - JOUR
TI - Normative Multiagent Systems: Guest Editors' Introduction
AU - Boella, Guido
AU - Pigozzi, Gabriella
AU - Singh, Munindar P.
AU - Verhagen, Harko
T2 - LOGIC JOURNAL OF THE IGPL
DA - 2010/2//
PY - 2010/2//
DO - 10.1093/jigpal/jzp079
VL - 18
IS - 1
SP - 1-3
SN - 1367-0751
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77957233460&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Life cycle inventory policy characterizations for a single-product recoverable system
AU - Ahiska, S. Sebnem
AU - King, Russell E.
T2 - INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
AB - Abstract This paper investigates the optimal inventory policies over the life cycle of a remanufacturable product. The product is produced through manufacturing or remanufacturing. Benefiting from the long-run optimal policies found through Markov decision analysis, the optimal or near-optimal policy characterizations with practical structure are determined for every life cycle stage under several setup cost configurations. The effects of changes in the demand and return rates on the optimal inventory policies are investigated through these policies. Further, a performance comparison with a PULL strategy is provided. The performance of these long-run policies is evaluated as well in a finite-horizon setting, and the importance of frequent policy revision over the product life cycle is illustrated numerically.
DA - 2010/3//
PY - 2010/3//
DO - 10.1016/j.ijpe.2009.08.033
VL - 124
IS - 1
SP - 51-61
SN - 1873-7579
KW - Stochastic inventory control
KW - Policy characterization
KW - Recoverable system
KW - Remanufacturing
KW - Product life cycle
KW - Markov decision analysis
ER -
TY - JOUR
TI - Inventory optimization in a one product recoverable manufacturing system
AU - Ahiska, S. Sebnem
AU - King, Russell E.
T2 - INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
AB - Abstract Environmental regulations or the necessity for a ‘green image’ due to growing environmental concerns, as well as the potential economical benefits of product recovery, have pushed manufacturers to integrate product recovery management with their manufacturing process. Consequently, production planning and inventory control of recoverable manufacturing systems has gained significant interest among researchers who aim to contribute to industrial practice. This paper considers inventory optimization of a single product recoverable manufacturing system where customer demands are satisfied through either regular production (manufacturing) of new items or remanufacturing of returned items. We present robust, implementable characterizations of the optimal manufacturing/remanufacturing inventory policies found using Markov decision processes. We extend the results in the literature by considering setup costs and different lead time cases for manufacturing and remanufacturing.
DA - 2010/3//
PY - 2010/3//
DO - 10.1016/j.ijpe.2009.09.002
VL - 124
IS - 1
SP - 11-19
SN - 1873-7579
KW - Remanufacturing
KW - Recoverable manufacturing system
KW - Stochastic inventory control
KW - Markov decision process
KW - Setup cost
KW - Policy characterization
ER -
TY - JOUR
TI - Immersed Interface Finite Element Methods for Elasticity Interface Problems with Non-Homogeneous Jump Conditions
AU - Gong, Y.
AU - Li, Z. L.
T2 - Numerical Mathematics: Theory, Methods and Applications
DA - 2010///
PY - 2010///
VL - 3
IS - 1
SP - 23-39
ER -
TY - JOUR
TI - Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
AU - Matta, Marie E.
AU - Elmaghraby, Salah E.
T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
AB - This paper describes a complex scheduling problem taken from a hospital diagnostic testing center that schedules hundreds of patients in an open shop environment consisting of multiple facilities and multiple processors. This scheduling problem, known as the multiprocessor open shop (MPOS) problem, is strongly NP-hard with few published results. Realizing that in many MPOS environments processing times are stage-dependent, not both job and stage-dependent, this paper examines a new class of problems for the MPOS—proportionate ones. This paper exploits the structural nature of the proportionate MPOS and defines new terms. Despite the enormous complexity of the MPOS problem, this work demonstrates that polynomial time algorithms exist for two special cases. Since other applications of this problem exist in service and manufacturing environments, solving the proportionate MPOS problem is not only significant in the theory of optimization, but also in many real-world applications.
DA - 2010/3/16/
PY - 2010/3/16/
DO - 10.1016/j.ejor.2009.03.048
VL - 201
IS - 3
SP - 720-728
SN - 0377-2217
KW - Scheduling
KW - Sequencing
KW - Deterministic
KW - Proportionate multiprocessor open shop
KW - Polynomial time algorithms
ER -