TY - CONF
TI - Production Planning using Nonlinear Clearing Functions: A Review of Recent Results
AU - Kacar, N.B.
AU - Moench, L.
AU - Uzsoy, R.
T2 - SIAM Conference on Computational Science and Engineering
C2 - 2013/2//
CY - Boston, MA
DA - 2013/2//
PY - 2013/2//
ER -
TY - CONF
TI - Improving Shop Floor Level Performance in a Dynamic Lot Sizing Environment with Congestion
AU - Albey, E.
AU - Uzsoy, R.
T2 - Industrial and Systems Engineering Research Conference
C2 - 2013/5//
CY - San Juan, PR
DA - 2013/5//
PY - 2013/5//
ER -
TY - CONF
TI - Using Clearing Functions for Production Planning in Large-Scale Wafer Fabs
AU - Kacar, N.B.
AU - Monch, L.
AU - Uzsoy, R.
T2 - Industrial and Systems Engineering Research Conference
C2 - 2013/5//
CY - San Juan, PR
DA - 2013/5//
PY - 2013/5//
ER -
TY - CONF
TI - Minimizing End Effects in Rolling Horizon Algorithms for Production Planning: An Experimental Study
AU - Lin, P.C.
AU - Uzsoy, R.
T2 - Industrial and Systems Engineering Research Conference
C2 - 2013/5//
CY - San Juan, PR
DA - 2013/5//
PY - 2013/5//
ER -
TY - CONF
TI - Production Planning with Load-Dependent Lead Times and Uncertain Demands
AU - Norouzi, A.
AU - Uzsoy, R.
T2 - Industrial and Systems Engineering Research Conference
C2 - 2013/5//
CY - San Juan, PR
DA - 2013/5//
PY - 2013/5//
ER -
TY - CONF
TI - Modeling for Equitable Food Distribution in North Carolina
AU - Sengul, I.
AU - Ivy, J.S.
AU - Uzsoy, R.
T2 - Industrial and Systems Engineering Research Conference
C2 - 2013/5//
CY - San Juan, PR
DA - 2013/5//
PY - 2013/5//
ER -
TY -
ER -
TY -
ER -
TY - JOUR
TI - Modeling and Analysis of Integrated Planning of Production and Engineering Process Improvement
AU - Kim, Sukgon
AU - Uzsoy, Reha
T2 - IEEE Transactions on Semiconductor Manufacturing
AB - A clearing function that can capture the nonlinear relationship between workloads and throughput and also reflect capacity improvement by engineering activities on a multioperation workcenter is developed. The clearing function is then used to formulate an integrated optimization model for planning both production and engineering process improvement. Marginal cost analysis using the Karush-Kuhn-Tucker optimality conditions provides useful insights into effective management of resources in a reentrant manufacturing system.
DA - 2013/8//
PY - 2013/8//
DO - 10.1109/tsm.2013.2261099
VL - 26
IS - 3
SP - 414-422
J2 - IEEE Trans. Semicond. Manufact.
OP -
SN - 0894-6507 1558-2345
UR - http://dx.doi.org/10.1109/tsm.2013.2261099
DB - Crossref
KW - Manufacturing planning
KW - production management
KW - semiconductor process modeling
ER -
TY - BOOK
TI - Linear Conic Optimization
AU - Fang, Shu-Cherng
AU - Xing, W.
DA - 2013///
PY - 2013///
PB - Science Press
SN - 97870381767
ER -
TY - JOUR
TI - ℓ1 Major Component Detection and Analysis (ℓ1 MCDA): Foundations in Two Dimensions
AU - Tian, Ye
AU - Jin, Qingwei
AU - Lavery, John
AU - Fang, Shu-Cherng
T2 - Algorithms
AB - Principal Component Analysis (PCA) is widely used for identifying the major components of statistically distributed point clouds. Robust versions of PCA, often based in part on the ℓ1 norm (rather than the ℓ2 norm), are increasingly used, especially for point clouds with many outliers. Neither standard PCA nor robust PCAs can provide, without additional assumptions, reliable information for outlier-rich point clouds and for distributions with several main directions (spokes). We carry out a fundamental and complete reformulation of the PCA approach in a framework based exclusively on the ℓ1 norm and heavy-tailed distributions. The ℓ1 Major Component Detection and Analysis (ℓ1 MCDA) that we propose can determine the main directions and the radial extent of 2D data from single or multiple superimposed Gaussian or heavy-tailed distributions without and with patterned artificial outliers (clutter). In nearly all cases in the computational results, 2D ℓ1 MCDA has accuracy superior to that of standard PCA and of two robust PCAs, namely, the projection-pursuit method of Croux and Ruiz-Gazen and the ℓ1 factorization method of Ke and Kanade. (Standard PCA is, of course, superior to ℓ1 MCDA for Gaussian-distributed point clouds.) The computing time of ℓ1 MCDA is competitive with the computing times of the two robust PCAs.
DA - 2013/1/17/
PY - 2013/1/17/
DO - 10.3390/a6010012
VL - 6
IS - 1
SP - 12-28
J2 - Algorithms
LA - en
OP -
SN - 1999-4893
UR - http://dx.doi.org/10.3390/a6010012
DB - Crossref
KW - heavy-tailed distribution
KW - l(1)
KW - l(2)
KW - major component
KW - multivariate statistics
KW - outliers
KW - principal component analysis
KW - 2D
ER -
TY - JOUR
TI - Insurance companies' perspectives on the orphan drug pipeline
AU - Handfield, R.
AU - Feldstein, J.
T2 - American Health and Drug Benefits
DA - 2013///
PY - 2013///
VL - 6
IS - 9
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894040406&partnerID=MN8TOARS
ER -
TY - CHAP
TI - Agent Communication
AU - Chopra, Amit K.
AU - Singh, Munindar P.
T2 - Multiagent Systems
A2 - Weiss, Gerhard
PY - 2013///
ET - 2nd
SP - 101–141
PB - MIT Press
ER -
TY - CHAP
TI - The Uses of Norms
AU - Singh, Munindar P.
AU - Arrott, Matthew
AU - Balke, Tina
AU - Chopra, Amit K.
AU - Christiaanse, Rob
AU - Cranefield, Stephen
AU - Dignum, Frank
AU - Eynard, Davide
AU - Farcas, Emilia
AU - Fornara, Nicoletta
AU - Gandon, Fabien
AU - Governatori, Guido
AU - Dam, Hoa Khanh
AU - Hulstijn, Joris
AU - Krüger, Ingolf
AU - Lam, Ho-Pun
AU - Meisinger, Michael
AU - Noriega, Pablo
AU - Savarimuthu, Bastin Tony Roy
AU - Tadanki, Kartik
AU - Verhagen, Harko
AU - Villata, Serena
T2 - Normative Multi-Agent Systems
A2 - Andrighetto, Giulia
A2 - Governatori, Guido
A2 - Noriega, Pablo
A2 - Torre, Leendert W.N.
AB - This chapter presents a variety of applications of norms. These applications include governance in sociotechnical systems, data licensing and data collection, understanding software development teams, requirements engineering, assurance, natural resource allocation, wireless grids, autonomous vehicles, serious games, and virtual worlds.
PY - 2013///
DO - 10.4230/DFU.Vol4.12111.191
VL - 4
SP - 191–229
PB - Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
ER -
TY - CHAP
TI - Regulated MAS: Social Perspective
AU - Noriega, Pablo
AU - Chopra, Amit K.
AU - Fornara, Nicoletta
AU - Cardoso, Henrique Lopes
AU - Singh, Munindar P.
T2 - Normative Multi-Agent Systems
A2 - Andrighetto, Giulia
A2 - Governatori, Guido
A2 - Noriega, Pablo
A2 - Torre, Leendert W.N.
AB - Munindar Singh’s effort was partially supported by the U.S. Army Research Office under grant W911NF-08-1-0105. The content of this paper does not necessarily reflect the position or policy of the U.S. Government; no official endorsement should be inferred or implied. Nicoletta Fornara’s effort is supported by the Hasler Foundation project nr. 11115-KG and
by the SER project nr. C08.0114 within the COST Action IC0801 Agreement Technologies. Henrique Lopes Cardoso’s effort is supported by Fundacao para a Ciencia e a Tecnologia (FCT), under project PTDC/EIA-EIA/104420/2008. Pablo Noriega’s effort has been partially supported by the Spanish Ministry of Science and Technology through the Agreement Technologies CONSOLIDER project under contract CSD2007-0022, and the Generalitat of Catalunya grant 2009-SGR-1434.
PY - 2013///
DO - 10.4230/DFU.Vol4.12111.93
VL - 4
SP - 93–133
PB - Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
ER -
TY - CONF
TI - Argumentation, Evidence, and Schemes: Abstract
AU - Hang, Chung-Wei
AU - Ajmeri, Nirav
AU - Singh, Munindar P.
AU - Parsons, Simon
T2 - International Workshop on Argumentation in Multi-Agent Systems
C2 - 2013/5//
C3 - Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems
CY - St. Paul, MN
DA - 2013/5//
PY - 2013/5/6/
SP - 37
ER -
TY - CONF
TI - Positron: Composing Commitment Protocols
AU - Gerard, Scott N.
AU - Telang, Pankaj R.
AU - Kalia, Anup K.
AU - Singh, Munindar P.
T2 - International Workshop on Engineering Multiagent Systems
C2 - 2013/5//
C3 - Proceedings of the 1st International Workshop on Engineering Multiagent Systems (EMAS)
CY - St. Paul, MN
DA - 2013/5//
PY - 2013/5/6/
ER -
TY - CONF
TI - Towards an Argumentation-Based Model of Social Interaction
AU - Sklar, Elizabeth I.
AU - Parsons, Simon D.
AU - Singh, Munindar P.
T2 - International Workshop on Argumentation in Multi-Agent Systems
C2 - 2013/5//
C3 - Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems (ArgMAS)
CY - St. Paul, MN
DA - 2013/5//
ER -
TY - CONF
TI - Trustworthy Decision Making via Commitments
AU - Kalia, Anup K.
AU - Zhang, Zhe
AU - Singh, Munindar P.
T2 - International Joint Conference on Autonomous Agents and Multiagent Systems
C2 - 2013/5//
C3 - Proceedings of the 15th AAMAS Workshop on Trust in Agent Societies (Trust)
CY - St. Paul, MN
DA - 2013/5//
SP - 24–35
ER -
TY - JOUR
TI - A Comparison of Feature Selection and Classification Algorithms in Identifying Baseball Pitches
AU - Tran, H.
AU - Attarian, A.
AU - Danis, G.
AU - Gronsbell, J.
AU - Iervolino, G.
T2 - International MultiConference of Engineers and Computer Scientists : IMECS 2013 : 13-15 March, 2013, the Royal Garden Hotel, Kowloon, Hong Kong
DA - 2013///
PY - 2013///
SP - 263–268
ER -
TY - BOOK
TI - Agents and Data Mining Interaction
T2 - Lecture Notes in Computer Science
A3 - Cao, Longbing
A3 - Zeng, Yifeng
A3 - Symeonidis, Andreas L.
A3 - Gorodetsky, Vladimir I.
A3 - Yu, Philip S.
A3 - Singh, Munindar P
AB - This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on Agents and Data Mining Interaction, ADMI 2012, held in Valencia, Spain, in June 2012. The 1
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-36288-0
VL - 7607
M1 - 7607
PB - Springer
SN - 9783642362873 9783642362880
UR - http://dx.doi.org/10.1007/978-3-642-36288-0
ER -
TY - CONF
TI - Simulation and Optimization of Systems with Delays
AU - Betts, J.T.
AU - Campbell, S.L.
AU - Thompson, K.
C2 - 2013///
C3 - Proceedings of the 2013 Spring Simulation Multiconference Poster Session
DA - 2013///
SP - 1084–1085
PB - Society for Computer Simulation International
ER -
TY - JOUR
TI - Comparing traditional and fuzzy-set solutions to (Q, r) inventory systems with discrete lead-time distributions
T2 - Journal of Intelligent and Fuzzy Systems
AB - Using a previously published approach to computing Q, r policies for an inventory system with uncertain parameters described by fuzzy sets, we compare thee methods for specifying lead-time demand for four different empirically-specified, non-normal distributions of replenishment lead time. This general distribution of lead time results in a situation in which the distribution of demand over the lead time, or lead-time demand LTD, is not easily specified. We compare Q, r policies generated by using a traditional normal approximation to LTD, a fuzzy-set approximation, and the optimal policy computed via a simulation-optimization approach that utilizes the explicit LTD distribution. We show that, on average, the results from the fuzzy-set model are significantly more accurate than the traditional normal approximation, especially when the LTD distribution is highly skewed.
DA - 2013///
PY - 2013///
DO - 10.3233/IFS-2012-0533
VL - 24
IS - 1
SP - 93-104
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84872357892&partnerID=MN8TOARS
KW - Inventory
KW - (Q, r) systems
KW - fuzzy sets
KW - optimization
KW - simulation
ER -
TY - CONF
TI - A newsvendor problem with replenishment
AU - Buch, N.
AU - King, R.E.
AU - Vila-Parrish, A.
AU - Warsing, D.P.
C2 - 2013///
C3 - IIE Annual Conference and Expo 2013
DA - 2013///
SP - 3934-3943
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84900327424&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Pricing policies for substitutable products in a supply chain with Internet and traditional channels
AU - Chen, Yun Chu
AU - Fang, Shu-Cherng
AU - Wen, Ue-Pyng
T2 - European Journal of Operational Research
AB - This study considers pricing policies in a supply chain with one manufacturer, who sells a product to an independent retailer and directly to consumers through an Internet channel. In addition to the manufacturer’s product, the retailer sells a substitute product produced by another manufacturer. Given the wholesale prices of the two substitute products, the manufacturer decides the retail price of the Internet channel, and the retailer decides the retail prices of the two substitute products. Both the manufacturer and the retailer choose their own decision variables to maximize their respective profits. This work formulates the price competition, using the settings of Nash and Stackelberg games, and derives the corresponding existence and uniqueness conditions for equilibrium solutions. A sensitivity analysis of an equilibrium solution is then conducted for the model parameters, and the profits are compared for two game settings. The findings show that improving brand loyalty is profitable for both of the manufacturer and retailer, and that an increased service value may alleviate the threat of the Internet channel for the retailer and increase the manufacturer’s profit. The study also derives some conditions under which the manufacturer and the retailer mutually prefer the Stackelberg game. Based on these results, this study proposes an appropriate cooperation strategy for the manufacturer and retailer.
DA - 2013/2//
PY - 2013/2//
DO - 10.1016/j.ejor.2012.09.003
VL - 224
IS - 3
SP - 542-551
J2 - European Journal of Operational Research
LA - en
OP -
SN - 0377-2217
UR - http://dx.doi.org/10.1016/j.ejor.2012.09.003
DB - Crossref
KW - Pricing
KW - Game theory
KW - Supply chain management
KW - Channel competition
ER -
TY - JOUR
TI - Exact Computable Representation of Some Second-Order Cone Constrained Quadratic Programming Problems
AU - Jin, Qingwei
AU - Tian, Ye
AU - Deng, Zhibin
AU - Fang, Shu-Cherng
AU - Xing, Wenxun
T2 - Journal of the Operations Research Society of China
AB - Solving the quadratically constrained quadratic programming (QCQP) problem is in general NP-hard. Only a few subclasses of the QCQP problem are known to be polynomial-time solvable. Recently, the QCQP problem with a nonconvex quadratic objective function over one ball and two parallel linear constraints is proven to have an exact computable representation, which reformulates the original problem as a linear semidefinite program with additional linear and second-order cone constraints. In this paper, we provide exact computable representations for some more subclasses of the QCQP problem, in particular, the subclass with one second-order cone constraint and two special linear constraints.
DA - 2013/3//
PY - 2013/3//
DO - 10.1007/S40305-013-0009-8
VL - 1
IS - 1
SP - 107-134
J2 - J. Oper. Res. Soc. China
LA - en
OP -
SN - 2194-668X 2194-6698
UR - http://dx.doi.org/10.1007/S40305-013-0009-8
DB - Crossref
KW - Linear conic program
KW - Semidefinite program
KW - Nonconvex quadratically constrained quadratic program
KW - Second-order cone
ER -
TY - CHAP
TI - Reallocation of Resources to Preserve Relative Efficiencies: Inverse CCR Model
AU - Lertworasirikul, Saowanee
AU - Fang, S. C.
T2 - The 19th International Conference on Industrial Engineering and Engineering Management
PY - 2013///
DO - 10.1007/978-3-642-37270-4_48
SP - 497-508
OP -
PB - Springer Berlin Heidelberg
SN - 9783642372698 9783642372704
UR - http://dx.doi.org/10.1007/978-3-642-37270-4_48
DB - Crossref
ER -
TY - CONF
TI - Combined DES/SD simulaton model of breast cancer screening for older women: An overview
AU - Tejada, J.J.
AU - Diehl, K.
AU - Ivy, J.S.
AU - Wilson, J.R.
AU - King, R.E.
AU - Ballan, M.J.
AU - Kay, M.G.
AU - Yankaskas, B.C.
AB - We develop a simulation modeling framework for evaluating the effectiveness of breast cancer screening policies for US women of age 65+. We introduce a two-phase simulation approach to modeling the main components in the breast cancer screening process. The first phase is a natural-history model of the incidence and progression of untreated breast cancer in randomly sampled individuals from the designated population. Combining discrete event simulation (DES) and system dynamics (SD) submodels, the second phase is a screening-and-treatment model that uses information about the genesis of breast cancer in the sampled individuals as generated by the natural-history model to estimate the benefits of different policies for screening the designated population and treating the affected women. Based on extensive simulation-based comparisons of alternative screening policies, we concluded that annual screening from age 65 to age 80 is the best policy for minimizing breast cancer deaths or for maximizing quality-adjusted life-years saved.
C2 - 2013///
C3 - Proceedings of the 2013 Winter Simulation Conference - Simulation: Making Decisions in a Complex World, WSC 2013
DA - 2013///
DO - 10.1109/WSC.2013.6721406
SP - 41-53
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894200756&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Investigating interventions for increasing colorectal cancer screening: Insights from a simulation model
AU - Hosking, Michael
AU - Roberts, Stephen
AU - Uzsoy, Reha
AU - Joseph, Talisa M.
T2 - Socio-Economic Planning Sciences
AB - We develop a discrete-event-continuous simulation model of colorectal cancer screening in North Carolina to examine the impact of six different interventions on the fraction of eligible patients receiving the clinically recommended screening. We find that demand side interventions alone are less effective than using only supply side interventions or a combination of both; the single most effective intervention is implementing a patient reminder system to reduce the number of no-show patients; and that all interventions studied are subject to significant diminishing returns.
DA - 2013/6//
PY - 2013/6//
DO - 10.1016/j.seps.2012.10.001
VL - 47
IS - 2
SP - 142-155
J2 - Socio-Economic Planning Sciences
LA - en
OP -
SN - 0038-0121
UR - http://dx.doi.org/10.1016/j.seps.2012.10.001
DB - Crossref
KW - Simulation
KW - Systems dynamics
KW - Colorectal cancer
KW - Cancer screening
KW - Screening barriers
KW - Cancer prevention policy
ER -
TY - JOUR
TI - Query optimization in information integration
AU - Chen, Dongfeng
AU - Chirkova, Rada
AU - Sadri, Fereidoon
AU - Salo, Tiia J.
T2 - Acta Informatica
DA - 2013/4/9/
PY - 2013/4/9/
DO - 10.1007/S00236-013-0179-1
VL - 50
IS - 4
SP - 257-287
J2 - Acta Informatica
LA - en
OP -
SN - 0001-5903 1432-0525
UR - http://dx.doi.org/10.1007/S00236-013-0179-1
DB - Crossref
ER -
TY - CONF
TI - Leak Detection in Water Distribution Systems Using the Dividing Rectangles (DIRECT) Search
AU - Jasper, Micah N.
AU - Mahinthakumar, Gnanamanikam (Kumar)
AU - Ranjithan, Sanmugavadivel (Ranji)
AU - Brill, Earl Downey
T2 - World Environmental and Water Resources Congress 2013
AB - Leak detection and management is an important problem in water distribution systems because it has been documented that up to 40% of the water may be lost to leaks in many aging systems. Small gradual leaks, which represent more than half of all leaks, are difficult to locate. Routinely measured pressure, flow, and water quality data in combination with a simulation-optimization inverse modeling approach could be used to characterize leakage. In this approach, the leak locations are found by minimizing the difference between real and simulated measurements for a known sensor configuration. Simulation-optimization approaches are computationally demanding because millions of simulations of a network simulator (e.g., EPANET) may be required to achieve a satisfactory solution. This problem is alleviated using a high-performance computing (HPC) framework that enables many parallel simulations of the water system using EPANET. This research is modifying an existing global search algorithm, called the Dividing Rectangles (DIRECT) Search that is traditionally used for continuous functions to enable parallel simulations and a mix of discrete variables (for leak locations) and continuous variables (for leak magnitudes). The modified algorithm is being tested with traditional continuous test functions, discrete test functions, and test water distribution networks.
C2 - 2013/5/28/
C3 - World Environmental and Water Resources Congress 2013
DA - 2013/5/28/
DO - 10.1061/9780784412947.078
PB - American Society of Civil Engineers
SN - 9780784412947
UR - http://dx.doi.org/10.1061/9780784412947.078
DB - Crossref
ER -
TY - CONF
TI - A Sensitivity Analysis of Data Measurement Types for Leak Detection in Water Distribution Systems
AU - Jasper, Micah N.
AU - Mahinthakumar, Gnanamanikam (Kumar)
AU - Ranjithan, Sanmugavadivel (Ranji)
AU - Brill, Earl Downey
T2 - World Environmental and Water Resources Congress 2013
AB - It is estimated that 15-40% of water is unaccounted for in urban water systems. This is mostly caused by small leaks, which are difficult to locate. Routinely measured pressure, flow, and water quality data can be used to locate leaks in the water network using an inverse modeling approach. For a known sensor configuration, the leak locations can be found by minimizing the difference between real and simulated measurements. However, when comparing measurement types (pressure, flow, or quality), some may be more sensitive to leak location than others. Furthermore, some measurement types may be more or less sensitive depending on the leak magnitude or the proximity of the leak to the sensors. The measurements types that are more sensitive to location will have a stronger signature and would need to be weighted more in an inverse modeling approach, especially in the presence of noise. Preliminary research suggests that water quality measurements are more sensitive to leak location when a leak is small, and that flow measurements are more sensitive when a leak is large. In this research, a series of sensitivity analyses are conducted on different networks to investigate the sensitivity of these measurements with respect to leak location, magnitude, and proximity of sensors to the leak location.
C2 - 2013/5/28/
C3 - World Environmental and Water Resources Congress 2013
DA - 2013/5/28/
DO - 10.1061/9780784412947.059
PB - American Society of Civil Engineers
SN - 9780784412947
UR - http://dx.doi.org/10.1061/9780784412947.059
DB - Crossref
ER -
TY - JOUR
TI - An integer programming approach for the view and index selection problem
AU - Asgharzadeh Talebi, Zohreh
AU - Chirkova, Rada
AU - Fathi, Yahya
T2 - Data & Knowledge Engineering
AB - The view- and index-selection problem is a combinatorial optimization problem that arises in the context of on-line analytical processing (OLAP) in database-management systems. We propose an integer programming (IP) model for this problem and study the properties of the views and indexes that appear in the optimal solution for this model. We then use these properties to remove a number of variables and constraints from the corresponding IP model and obtain a model that is significantly smaller, yet its optimal solution is guaranteed to be optimal for the original problem. This allows us to solve realistic-size instances of the problem in reasonable time using commercial IP solvers. Subsequently, we propose heuristic strategies to further reduce the size of this IP model and dramatically reduce its execution time, although we no longer guarantee that the reduced IP model offers a globally optimal solution for the original problem. Finally, we carry out an extensive computational study to evaluate the effectiveness of these IP models for solving the OLAP view- and index-selection problem.
DA - 2013/1//
PY - 2013/1//
DO - 10.1016/j.datak.2012.11.001
VL - 83
SP - 111-125
J2 - Data & Knowledge Engineering
LA - en
OP -
SN - 0169-023X
UR - http://dx.doi.org/10.1016/j.datak.2012.11.001
DB - Crossref
KW - Business intelligence
KW - Data warehouse and repository
KW - OLAP
KW - Materialized views
KW - View and index selection
KW - Integer programming
KW - Heuristics
ER -
TY - CHAP
TI - Two-Stage Stochastic View Selection for Data-Analysis Queries
AU - Huang, Rong
AU - Chirkova, Rada
AU - Fathi, Yahya
T2 - Advances in Intelligent Systems and Computing
AB - We consider the problem of selecting an optimal set of views to answer a given collection of queries at the present time (stage 1) as well as several collections of queries in the future (stage 2), with a given probability of occurrence associated with each collection, so as to minimize the expected value of the corresponding query response time, while keeping the total size of the views within a given limit. We formulate this problem as a two-stage stochastic programming problem. We show that this model is equivalent to an integer programming (IP) model that can be solved via various commercial IP solvers. We also study the relationship between the queries and the views in this context and use this relationship to reduce the size of the corresponding IP model, hence increase the scalability of our proposed approach.
PY - 2013///
DO - 10.1007/978-3-642-32741-4_11
SP - 115-123
OP -
PB - Springer Berlin Heidelberg
SN - 9783642327407 9783642327414
UR - http://dx.doi.org/10.1007/978-3-642-32741-4_11
DB - Crossref
ER -
TY - CHAP
TI - Hypergeometric Identities Associated with Statistics on Words
AU - Andrews, George E.
AU - Savage, Carla D.
AU - Wilf, Herbert S.
T2 - Advances in Combinatorics
PY - 2013///
DO - 10.1007/978-3-642-30979-3_4
SP - 77-100
OP -
PB - Springer Berlin Heidelberg
SN - 9783642309786 9783642309793
UR - http://dx.doi.org/10.1007/978-3-642-30979-3_4
DB - Crossref
ER -
TY - CONF
TI - Cardiovascular Dynamics during Head-up Tilt assessed Via a Pulsatile and Non-pulsatile Model
AU - Tran, H.
AU - Williams, N.
AU - Olufsen, M.S.
T2 - Special Session on Modelling and Simulation in Biology and Medicine
C2 - 2013///
C3 - Proceedings of the 3rd International Conference on Simulation and Modeling Methodologies, Technologies and Applications
DA - 2013///
DO - 10.5220/0004624006730680
VL - 1
SP - 673–680
PB - SciTePress - Science and and Technology Publications
SN - 9789898565693
UR - http://dx.doi.org/10.5220/0004624006730680
ER -
TY - CONF
TI - Platys: User-centric place recognition
AU - Hang, C.-W.
AU - Murukannaiah, P.K.
AU - Singh, M.P.
C2 - 2013///
C3 - AAAI Workshop - Technical Report
DA - 2013///
VL - WS-13-05
SP - 14-20
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84898908253&partnerID=MN8TOARS
ER -
TY - CONF
TI - Monitoring commitments in people-driven service engagements
AU - Kalia, A.K.
AU - Motahari-Nezhad, H.R.
AU - Bartolini, C.
AU - Singh, M.P.
AB - People-driven service engagements involve communication over channels such as chat and email. Such engagements should be understood at the level of the commitments that the participants create and manipulate. Doing so provides a grounding for the communications and yields a business-level accounting of the progress of a service engagement. Existing work on commitment-based service engagements is limited to design-time model creation and verification. In contrast, we present a novel approach for capturing commitment-based engagements that are created dynamically in conversations. We monitor commitments identifying their creation, delegation, completion, or cancellation in the conversations. We have developed a prototype and evaluated it on real-world chat and email datasets. Our prototype captures commitments with a high F-measure of 90% in emails (Enron email corpus) and 80% in chats (HP IT support chat dataset) and provides promising results for capturing additional commitment operations.
C2 - 2013///
C3 - Proceedings - IEEE 10th International Conference on Services Computing, SCC 2013
DA - 2013///
DO - 10.1109/SCC.2013.62
SP - 160-167
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891910428&partnerID=MN8TOARS
ER -
TY - CONF
TI - Macau: A basis for evaluating reputation systems
AU - Hazard, C.J.
AU - Singh, M.P.
C2 - 2013///
C3 - IJCAI International Joint Conference on Artificial Intelligence
DA - 2013///
SP - 191-197
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896061643&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Shin: Generalized trust propagation with limited evidence
AU - Hang, C.-W.
AU - Zhang, Z.
AU - Singh, M.P.
T2 - Computer
AB - Shin incorporates a probabilistic method for revising trust estimates in trustees, yielding higher prediction accuracy than traditional approaches that base trust exclusively on a series of referrals culminating with the trustee.
DA - 2013///
PY - 2013///
DO - 10.1109/MC.2012.116
VL - 46
IS - 3
SP - 78-85
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84875836507&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
AU - Yu, P.S.
AU - Singh, M.P.
AU - Cao, L.
AU - Zeng, Y.
AU - Symeonidis, A.L.
AU - Gorodetsky, V.
DA - 2013///
PY - 2013///
VL - 7607 LNAI
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84873816963&partnerID=MN8TOARS
ER -
TY - CONF
TI - Hierarchical planning about goals and commitments
AU - Telang, P.R.
AU - Meneguzzi, F.
AU - Singh, M.P.
C2 - 2013///
C3 - 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013
DA - 2013///
VL - 2
SP - 877-884
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899450331&partnerID=MN8TOARS
ER -
TY - CONF
TI - Evolving protocols and agents in multiagent systems
AU - Gerard, S.N.
AU - Singh, M.P.
C2 - 2013///
C3 - 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013
DA - 2013///
VL - 2
SP - 997-1004
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899458246&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Identifying business tasks and commitments from email and chat conversations
AU - Kalia, A.
AU - Nezhad, H.R.M.
AU - Bartolini, C.
AU - Singh, M.
T2 - HP Laboratories Technical Report
DA - 2013///
PY - 2013///
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84874818269&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Can't we all just get along? Agreement technologies and the science of security
AU - Singh, M.P.
AB - The science of security has been garnering much attention among researchers and practitioners tired of the ad hoc nature of much of existing work on cybersecurity. I motivate the science of security as an application area for agreement technologies, surveying some key challenges and foundational agreement technologies that provide the relevant representations and reasoning techniques.
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-39860-5_1
VL - 8068 LNAI
SE - 1-3
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84881128894&partnerID=MN8TOARS
ER -
TY - CONF
TI - Adaptive process execution in a service cloud: Service selection and scheduling based on machine learning
AU - Kang, D.S.
AU - Liu, H.
AU - Singh, M.P.
AU - Sun, T.
AB - Given a process specification, it is a complex task to dynamically select constituent services and compose them in an execution plan to satisfy users' non-functional preferences. Process scheduling approaches assume users can clearly specify their non-functional preferences and there are formulas (e.g., utility functions) to compute process level QoS from the QoS of constituent services and their connections. However, these assumptions are not always true. Users' preferences can be subjective, implicit, vague, mixed and different for various types of processes. Besides, not all the preferences for example easy-to-use can be computed using formulas. We proposed a machine learning based approach to evolutionarily learn user preferences according to their ratings on historical execution plans, recommend existing or generate new execution plans for business processes that adapt to user preferences.
C2 - 2013///
C3 - Proceedings - IEEE 20th International Conference on Web Services, ICWS 2013
DA - 2013///
DO - 10.1109/ICWS.2013.51
SP - 324-331
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891779162&partnerID=MN8TOARS
ER -
TY - CONF
TI - An argumentation-based approach to handling trust in distributed decision making
AU - Parsons, S.
AU - Sklar, E.
AU - Singh, M.
AU - Levitt, K.
AU - Rowe, J.
C2 - 2013///
C3 - AAAI Spring Symposium - Technical Report
DA - 2013///
VL - SS-13-07
SP - 66-71
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84883375594&partnerID=MN8TOARS
ER -
TY - CONF
TI - A first-order formalization of commitments and goals for planning
AU - Meneguzzi, F.
AU - Telang, P.R.
AU - Singh, M.P.
C2 - 2013///
C3 - Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013
DA - 2013///
SP - 697-703
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84893411920&partnerID=MN8TOARS
ER -
TY - CONF
TI - Integrating communication skills in data structures and algorithms courses
AU - Eberle, William
AU - Karro, John
AU - Lerner, Neal
AU - Stallmann, Matthias
T2 - IEEE
C2 - 2013///
C3 - 2013 IEEE Frontiers in Education Conference (FIE)
DA - 2013///
SP - 1503-1509
ER -
TY - CONF
TI - GSK: universally accessible graph sketching
AU - Balik, Suzanne P
AU - Mealin, Sean P
AU - Stallmann, Matthias F
AU - Rodman, Robert D
T2 - ACM
C2 - 2013///
C3 - Proceeding of the 44th ACM technical symposium on Computer science education
DA - 2013///
SP - 221-226
ER -
TY - CONF
TI - Efficient Solutions to the NDA-NCA Low-Order Eigenvalue Problem
AU - Willert, J.
AU - Kelley, C.T.
C2 - 2013///
C3 - Proceedings of International Conference on Mathematics and Computational Methods Applied to Nuclear Science & Engineering
DA - 2013///
SP - 2725–2735
ER -
TY - CONF
TI - An Efficient Parallel Solution to the Wigner-Poisson Equations
AU - Costolanski, A.S.
AU - Kelley, C.T.
AU - Howell, G.W.
AU - Salinger, A.G.
A2 - Liu, F.
C2 - 2013/4//
C3 - High Performance Computing Symposium (HPC 2013), Simulation Series Vol. 45, Society for Modeling & Simulation International
DA - 2013/4//
VL - 45
SP - 773–780
PB - Curran Associates Inc.
ER -
TY - CONF
TI - Mechanism of Drug Action on Alzheimer's Disease Protein
AU - Briggs, E.
AU - Hodak, M
AU - Rose, F
AU - Lu, W
AU - Kelley, C.T.
AU - Bernholc, J
C2 - 2013///
C3 - Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
CY - Denver CO
DA - 2013///
PB - IEEE Computer Society Press
ER -
TY - JOUR
TI - Hybrid Deterministic/Monte Carlo Neutronics
AU - Willert, Jeff
AU - Kelley, C T
AU - Knoll, D A
AU - Park, H K
T2 - SIAM J. Sci. Comp.
AB - In this paper we describe a hybrid deterministic/Monte Carlo algorithm for neutron transport simulation. The algorithm is based on nonlinear accelerators for source iteration, using Monte Carlo methods for the purely absorbing high-order problem and a Jacobian-free Newton--Krylov iteration for the low-order problem. We couple the Monte Carlo solution with the low-order problem using filtering to smooth the flux and current from the Monte Carlo solver and an analytic Jacobian-vector product to avoid numerical differentiation of the Monte Carlo results. We use a continuous energy deposition tally for the Monte Carlo simulation. We conclude the paper with numerical results which illustrate the effectiveness of the new algorithm.
DA - 2013///
PY - 2013///
DO - http://dx.doi.org/10.1137/120880021
VL - 35
IS - 5
SP - S62-S83
ER -
TY - JOUR
TI - Explicit Pseudo-Transient Continuation
AU - Kelley, C T
AU - Liao, Li-Zhi
T2 - Pacific J. Opt.
DA - 2013///
PY - 2013///
VL - 9
IS - 1
SP - 77-91
ER -
TY - JOUR
TI - Improved Sparse Multi-Class SVM and Its Application for Gene Selection in Cancer Classification
AU - Huang, Lingkang
AU - Zhang, Hao Helen
AU - Zeng, Zhao-Bang
AU - Bushel, Pierre R.
T2 - Cancer Informatics
AB - Microarray techniques provide promising tools for cancer diagnosis using gene expression profiles. However, molecular diagnosis based on high-throughput platforms presents great challenges due to the overwhelming number of variables versus the small sample size and the complex nature of multi-type tumors. Support vector machines (SVMs) have shown superior performance in cancer classification due to their ability to handle high dimensional low sample size data. The multi-class SVM algorithm of Crammer and Singer provides a natural framework for multi-class learning. Despite its effective performance, the procedure utilizes all variables without selection. In this paper, we propose to improve the procedure by imposing shrinkage penalties in learning to enforce solution sparsity.The original multi-class SVM of Crammer and Singer is effective for multi-class classification but does not conduct variable selection. We improved the method by introducing soft-thresholding type penalties to incorporate variable selection into multi-class classification for high dimensional data. The new methods were applied to simulated data and two cancer gene expression data sets. The results demonstrate that the new methods can select a small number of genes for building accurate multi-class classification rules. Furthermore, the important genes selected by the methods overlap significantly, suggesting general agreement among different variable selection schemes.High accuracy and sparsity make the new methods attractive for cancer diagnostics with gene expression data and defining targets of therapeutic intervention.The source MATLAB code are available from http://math.arizona.edu/~hzhang/software.html.
DA - 2013/1//
PY - 2013/1//
DO - 10.4137/cin.s10212
VL - 12
SP - CIN.S10212
J2 - Cancer Inform
LA - en
OP -
SN - 1176-9351 1176-9351
UR - http://dx.doi.org/10.4137/cin.s10212
DB - Crossref
KW - support vector machine (SVM)
KW - multi-class SVM
KW - variable selection
KW - shrinkage methods
KW - classification
KW - microarray
KW - cancer classification
ER -
TY - CONF
TI - Direct Transcription Solution of Optimal Control Problems with Differential Algebraic Equations with Delays
AU - Betts, John T.
AU - Campbell, Stephen L.
AU - Thompson, Karmethia C.
T2 - Power and Energy
AB - Many physical systems are naturally modeled as differential algebraic equations or DAEs. Many physical systems also possess delays either in the dynamics or in the application of the control. Direct transcription is a popular approach in industry for numerically solving nondelayed optimal control problems because of its ability to handle problems with constraints. This paper reports on progress in developing an industrial strength direct transcription optimal control software package that can solve many problems with delays and DAE models. In particular, we focus in this paper on how the use of the DAE formalism allows for the consideration of a much greater variety of delays.
C2 - 2013///
C3 - Power and Energy / 807: Intelligent Systems and Control / 808: Technology for Education and Learning
DA - 2013///
DO - 10.2316/p.2013.807-003
PB - ACTAPRESS
SN - 9780889869615
UR - http://dx.doi.org/10.2316/p.2013.807-003
DB - Crossref
ER -
TY - CONF
TI - A Hybrid Approach to the Neutron Transport k-Eigenvalue Problem using NDA-based Algorithms
AU - Willert, J.
AU - Kelley, C.T.
AU - Knoll, D.A.
AU - Park, H.K.
C2 - 2013///
C3 - Proceedings of International Conference on Mathematics and Computational Methods Applied to Nuclear Science & Engineering
DA - 2013///
SP - 1934–1941
ER -
TY - JOUR
TI - Comparison of Frequentist and Bayesian Confidence Analysis Methods on a Viscoelastic Stenosis Model
AU - Kenz, Zackary R.
AU - Banks, H. T.
AU - Smith, Ralph C.
T2 - SIAM/ASA Journal on Uncertainty Quantification
AB - We compare the performance of three methods for quantifying uncertainty in model parameters: asymptotic theory, bootstrapping, and Bayesian estimation. We study these methods on an existing model for one-dimensional wave propagation in a viscoelastic medium, as well as corresponding data from lab experiments using a homogeneous, tissue-mimicking gel phantom. In addition to parameter estimation, we use the results from the three algorithms to quantify complex correlations between our model parameters, which are best seen using the more computationally expensive bootstrapping or Bayesian methods. We also hold constant the parameter causing the most complex correlation, obtaining results from all three methods which are more consistent than those obtained when estimating all parameters. Concerns regarding computational time and algorithm complexity are incorporated into a discussion on differences between the frequentist and Bayesian perspectives.
DA - 2013/1//
PY - 2013/1//
DO - 10.1137/130917867
VL - 1
IS - 1
SP - 348-369
J2 - SIAM/ASA J. Uncertainty Quantification
LA - en
OP -
SN - 2166-2525
UR - http://dx.doi.org/10.1137/130917867
DB - Crossref
KW - viscoelastic model
KW - asymptotic theory
KW - bootstrapping
KW - Bayesian
KW - MCMC
KW - DRAM
ER -
TY - JOUR
TI - CONFIDENCE INTERVAL ESTIMATION FOR AN EMPIRICAL MODEL QUANTIFYING THE EFFECT OF SOIL MOISTURE AND PLANT DEVELOPMENT ON SOYBEAN (GLYCINE MAX (L.) MERR.) LEAF CONDUCTANCE
AU - Matthews, J.L.
AU - Smith, R.C.
AU - Fiscus, E.L.
T2 - International Journal of Pure and Apllied Mathematics
AB - In this work, we address uncertainty analysis for a model, pre- sented in a separate paper, quantifying the effect of soil moisture and plant age on soybean (Glycine max (L.) Merr.) leaf conductance. To achieve this we present several methods for confidence interval estimation. Estimation of confidence intervals for model parameters and predictions is investigated using asymptotic theory, Monte Carlo methods, and bootstrap methods. A compu- tationally feasible solution for estimating confidence intervals for model param- eters via asymptotic theory is unattainable. Confidence intervals for model
DA - 2013/3/12/
PY - 2013/3/12/
DO - 10.12732/ijpam.v83i3.6
VL - 83
IS - 3
J2 - Int. J. of Pure and Appl. Math.
LA - en
OP -
SN - 1311-8080 1314-3395
UR - http://dx.doi.org/10.12732/ijpam.v83i3.6
DB - Crossref
ER -
TY - JOUR
TI - A Probabilistic Characterization of Allocation Performance in a Worker-Constrained Job Shop
AU - Lobo, Benjamin J.
AU - Thoney, T. J.
AU - King, Russell E.
AU - Wilson, James R.
T2 - Essays in Production, Project Planning and Scheduling
AB - We analyze a dual resource constrained (DRC) job shop in which both machines and workers are limited, and we seek to minimize L max, the maximum job lateness. An allocation of workers to machine groups is required to generate a schedule, and determining a schedule that minimizes L max is NP-hard. This chapter details a probabilistic method for evaluating the quality of a specific (but arbitrary) allocation in a given DRC job shop scheduling problem based on two recent articles by Lobo et al. (2013a) The first article Lobo et al. (2013b) describes a lower bound on L max given an allocation, and an algorithm to find an allocation yielding the smallest such lower bound, while the second article Lobo et al. (2013b) establishes criteria for verifying the optimality of an allocation. For situations where the optimality criteria are not satisfied, Lobo et al. (2013c) presents HSP, a heuristic search procedure to find allocations enabling the Virtual Factory (a heuristic scheduler developed by Hodgson et al. in 1998) to generate schedules with smaller L max than can be achieved with allocations yielding article 1’s final lower bound. From simulation replications of the given DRC job shop scheduling problem, we estimate the distribution of the difference between (a) the “best” (smallest) L max value achievable with a Virtual Factory–generated schedule, taken over all feasible allocations; and (b) the final lower bound of Lobo et al. (2013b). To evaluate the quality of a specific allocation for the given problem, we compute the difference between L max for the Virtual Factory–generated schedule based on the specific allocation, and the associated lower bound (b) for the problem; then we refer this difference to the estimated distribution to judge the likelihood that the specific allocation yields the Virtual Factory’s “best” schedule (a) for the given problem. We present several examples illustrating the usefulness of our approach, and summarize the lessons learned in this work.
DA - 2013///
PY - 2013///
DO - 10.1007/978-1-4614-9056-2_13
SP - 301-341
ER -
TY - JOUR
TI - Allocating job-shop manpower to minimize : Optimality criteria, search heuristics, and probabilistic quality metrics
AU - Lobo, Benjamin J.
AU - Hodgson, Thom J.
AU - King, Russell E.
AU - Thoney, Kristin A.
AU - Wilson, James R.
T2 - Computers & Operations Research
AB - We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize Lmax, the maximum job lateness. Lobo et al. formulated a lower bound on Lmax given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower bound. In this article we establish optimality criteria to verify that a given allocation corresponds to a schedule that yields the minimum value of Lmax. For situations in which the optimality criteria are not satisfied, we present the Heuristic Search Procedure (HSP), which sequentially invokes three distinct search heuristics, the Local Neighborhood Search Strategy (LNSS), Queuing Time Search Strategy 1 (QSS1), and Queuing Time Search Strategy 2 (QSS2), before delivering the best allocation encountered by LNSS, QSS1, and QSS2. HSP is designed to find allocations allowing a heuristic scheduler to generate schedules with a smaller value of Lmax than that achieved via the allocation yielding the final lower bound of Lobo et al. Comprehensive experimentation indicated that HSP delivered significant reductions in Lmax. We also estimate a probability distribution for evaluating the quality (closeness to optimality) of an allocation delivered by a heuristic search procedure such as HSP. This distribution permits assessing the user's confidence that a given allocation will enable the heuristic scheduler to generate its best possible schedule—i.e., the schedule with the heuristic scheduler's smallest achievable Lmax value.
DA - 2013/10//
PY - 2013/10//
DO - 10.1016/J.COR.2013.02.008
VL - 40
IS - 10
SP - 2569-2584
J2 - Computers & Operations Research
LA - en
OP -
SN - 0305-0548
UR - http://dx.doi.org/10.1016/J.COR.2013.02.008
DB - Crossref
KW - Job shop scheduling
KW - Dual resource constrained systems
KW - Maximum lateness
KW - Worker allocation
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook
AU - Joines, J.A.
AU - Roberts, S.D.
DA - 2013///
PY - 2013///
ET - 3rd
PB - Simio LLC Sewickley, PA
ER -
TY - JOUR
TI - Constructing next generation academic cloud services
AU - Vouk, M. A.
AU - Averitt, S. F.
AU - Dreher, P.
AU - Kekas, D. H.
AU - Kurth, A.
AU - Hoit, M. A.
AU - Mugge, P.
AU - Peeler, A.
AU - Schaffer, H. E.
AU - Sills, E. D.
AU - Stein, S.
AU - Streck, J.
AU - Thompson, J.
AU - Wright, D.
T2 - International Journal of Cloud Computing
AB - NC State University (NCSU) is embarked on an ambitious vision to change the paradigm for higher education and research by ‘virtualising’ its award-winning Centennial Campus (creating so called vCentennial). Centennial Campus is a small city made up of NCSU research, teaching and outreach facilities, entrepreneurs, academic entities, private firms, and government agencies. NCSU wants the ability to replicate services and functionality of this physical environment and its virtual avatars ‘anywhere, anytime’ in the world using a cloud of clouds computing platform. The initial operating system for this platform is NCSU’s open source Virtual Computing Laboratory (VCL) technology. This paper provides an overview of the vision and discusses several vCentennial pilot projects.
DA - 2013///
PY - 2013///
DO - 10.1504/ijcc.2013.055290
VL - 2
IS - 2/3
SP - 104-122
ER -
TY - BOOK
TI - Patient-focused network integration in biopharma: Strategic imperatives for the years ahead
AU - Handfield, R. B.
DA - 2013///
PY - 2013///
PB - Boca Raton: CRC Press, Taylor & Francis Group
ER -
TY - BOOK
TI - Nonlinear optimal control theory
AU - Berkovitz, L. D.
AU - Medhin, N. G.
AB - Nonlinear Optimal Control Theory presents a deep, wide-ranging introduction to the mathematical theory of the optimal control of processes governed by ordinary differential equations and certain types of differential equations with memory. Many examples illustrate the mathematical issues that need to be addressed when using optimal control techniqu
DA - 2013///
PY - 2013///
DO - 10.1201/b12739
PB - Boca Raton: CRC Press
ER -
TY - BOOK
TI - Introduction to operations and supply chain management
AU - Bozarth, C. C.
AU - Handfield, R. B.
DA - 2013///
PY - 2013///
PB - Boston: Pearson
ER -
TY - JOUR
TI - Application of the Unscented Kalman Filtering to Parameter Estimation
AU - Attarian, Adam
AU - Batzel, Jerry J.
AU - Matzuka, Brett
AU - Tran, Hien
T2 - MATHEMATICAL MODELING AND VALIDATION IN PHYSIOLOGY: APPLICATIONS TO THE CARDIOVASCULAR AND RESPIRATORY SYSTEMS
AB - Filtering is a methodology used to combine a set of observations with a model to obtain the optimal state. This technique can be extended to estimate the state of the system as well as the unknown model parameters. Estimating the model parameters given a set of data is often referred to as the inverse problem. Filtering provides many benefits to the inverse problem by providing estimates in real time and allowing model errors to be taken into account. Assuming a linear model and Gaussian noises, the optimal filter is the Kalman filter. However, these assumptions rarely hold for many problems of interest, so a number of extensions have been proposed in the literature to deal with nonlinear dynamics. In this chapter, we illustrate the application of one approach to deal with nonlinear model dynamics, the so-called unscented Kalman filter. In addition, we will also show how some of the tools for model validation discussed in other chapters of this volume can be used to improve the estimation process.
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-32882-4_4
VL - 2064
SP - 75-88
SN - 0075-8434
ER -
TY - CONF
TI - Robust control of switched linear systems via min of quadratics
AU - Yuan, C. Z.
AU - Wu, F.
AB - In this paper, we will investigate the robust switching control problem for switched linear systems by using a class of composite quadratic functions, the min (of quadratics) function, to improve performance and enhance control design flexibility. The robustness is reflected in two prospectives including the ℋ ∞ performance and arbitrary switching of subsystems. A hysteresis min-switching strategy is employed to orchestrate the switching among a collection of controllers. The synthesis conditions for both state feedback and output feedback control problems are derived in terms of a set of linear matrix inequalities (LMIs) with linear search over scalar variables. The proposed min function based approach unifies the existing single Lyapunov function based method and multiple Lyapunov function based method in a general framework, and the derived LMI conditions cover the existing LMI conditions as special cases. Numerical studies are included to demonstrate the advantages of the proposed control design approach.
C2 - 2013///
C3 - Proceedings of the ASME 2013 Dynamic Systems and Control Conference (DSCC2013), vol. 1
DA - 2013///
DO - 10.1115/dscc2013-3715
ER -
TY - JOUR
TI - Synthesizing Route Travel Time Distributions from Segment Travel Time Distributions
AU - Isukapati, Isaac Kumar
AU - List, George F.
AU - Williams, Billy M.
AU - Karr, Alan F.
T2 - TRANSPORTATION RESEARCH RECORD
AB - This paper examines a way to synthesize route travel time probability density functions (PDFs) on the basis of segment-level PDFs. Real-world data from I-5 in Sacramento, California, are employed. The first finding is that careful filtering is required to extract useful travel times from the raw data because trip times, not travel times, are observed (i.e., the movement of vehicles between locations). The second finding is that significant correlations exist between individual vehicle travel times for adjacent segments. Two analyses are done in this regard: one predicts downstream travel times on the basis of upstream travel times, and the second checks for correlations in travel times between upstream and downstream segments. The results of these analyses suggest that strong positive correlations exist. The third finding is that comonotonicity, or perfect positive dependence, can be assumed when route travel time PDFs are generated from segment PDFs. Kolmogorov–Smirnov tests show that travel times synthesized from the segment-specific data are statistically different only under highly congested conditions, and even then, the percentage differences in the distributions of the synthesized and actual travel times are small. The fourth finding, somewhat tangential, is that there is little variation in individual driver travel times under given operating conditions. This is an important finding, because such an assumption serves as the basis for all traffic simulation models.
DA - 2013///
PY - 2013///
DO - 10.3141/2396-09
IS - 2396
SP - 71-81
SN - 2169-4052
ER -
TY - CHAP
TI - Observer based fault detection in differential algebraic equations
AU - Scott, Jason R.
AU - Campbell, Stephen L.
T2 - 2013 Proceedings of the Conference on Control and its Applications
AB - Previous chapter Next chapter Full AccessProceedings 2013 Proceedings of the Conference on Control and its Applications (CT)Observer based fault detection in differential algebraic equationsJason R. Scott and Stephen L. CampbellJason R. Scott and Stephen L. Campbellpp.176 - 183Chapter DOI:https://doi.org/10.1137/1.9781611973273.24PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Fault detection is an important part of most modern industrial systems and processes. One approach to fault detection is based on the use of observers. Many physical processes are most naturally modeled by differential algebraic equations. Recently there has been significant progress in the design of observers for complex differential algebraic equations. This paper examines the use of observers for fault detection in systems modeled by differential algebraic equations. Previous chapter Next chapter RelatedDetails Published:2013eISBN:978-1-61197-327-3 https://doi.org/10.1137/1.9781611973273Book Series Name:ProceedingsBook Code:PRCT13Book Pages:1-229
PY - 2013/7/8/
DO - 10.1137/1.9781611973273.24
SP - 176-183
OP -
PB - Society for Industrial and Applied Mathematics
SN - 9781611973273
UR - http://dx.doi.org/10.1137/1.9781611973273.24
DB - Crossref
ER -
TY - JOUR
TI - NEW RESULTS ON CONTINUOUS-TIME SWITCHED LINEAR SYSTEMS WITH ACTUATOR SATURATION
AU - Duan, Chang
AU - Wu, Fen
T2 - ASME 2013 DYNAMIC SYSTEMS AND CONTROL CONFERENCE, VOL 2
AB - This paper further studies the analysis and control problems of continuous-time switched linear systems subject to actuator saturation. Using the norm-bounded differential inclusion (NDI) description of the saturated systems and the minimal switching rule, a set of switched output feedback controllers is designed to minimize the disturbance attenuation level defined by the regional ℒ2 gain over a class of energy-bounded disturbances. The synthesis conditions are expressed as bilinear matrix inequalities (BMIs) and can be solved by numerical search coupled with linear matrix inequality (LMI) optimization. Compared to the previous method based on polytopic differential inclusion (PDI), the proposed approach has good scalability and potentially renders better performance. Numerical examples are provided to verify effectiveness of the proposed approach.
DA - 2013///
PY - 2013///
DO - 10.1115/dscc2013-3789
SP -
ER -
TY - CONF
TI - Converging choice and service in future commodity optical networks using traffic grooming
AU - Dutta, Rudra
AU - Rouskas, George
AU - Baldiney, I.
AB - The problem of providing an agile, energy-aware, flexible optical network architecture is one of the challenges in optical networking in the coming decade. A key element in this challenge is the balancing of the benefits to customer and provider, and creating an agile system capable of reflecting both provider and customer interests on an ongoing basis as network conditions change. In this paper, we articulate how the traditional optical networking research area of traffic grooming may be combined with recent advances in Internet architecture, specifically a proposed Future Internet architecture called ChoiceNet, and empowered by the recently emerged concept of software defined networking, to make some key contributions to this problem.
C2 - 2013///
C3 - 2013 15th international conference on transparent optical networks (icton 2013)
DA - 2013///
DO - 10.1109/icton.2013.6602954
ER -
TY - JOUR
TI - Locating Traffic Sensors on a Highway Network Models and Algorithms
AU - Sayyady, Fatemeh
AU - Fathi, Yahya
AU - List, George F.
AU - Stone, John R.
T2 - TRANSPORTATION RESEARCH RECORD
AB - This paper considers the problem of finding optimal sensor locations on a traffic network with the goal of characterizing system use overall. The problem is studied for two practical scenarios. In the first scenario, it is assumed that there is a given number of sensors (p) to be located on the highway network. In this context, the problem is to find a collection of p locations among a given collection of candidate locations. In the second scenario, it is assumed that there is a cost (c i ) associated with installing a sensor at each candidate location i and a total budget b. In this context, the problem is to find a collection of locations that provide the best possible characterization given the budget constraint. A metric is proposed for evaluating a potential solution, and then appropriate mathematical models are proposed for solving the problem for each scenario. It is shown that the budget-constrained problem is an extension of the well-known p-median problem. A new Lagrangian heuristic algorithm is presented for solving large instances of this problem when a budget constraint is imposed. A comprehensive computational experiment is used to demonstrate that the Lagrangian heuristic algorithm provides solutions for large-scale networks within reasonable execution times. Examples are based on locating weigh-in-motion sensors on a large-scale highway network.
DA - 2013///
PY - 2013///
DO - 10.3141/2339-04
IS - 2339
SP - 30-38
SN - 2169-4052
ER -
TY - RPRT
TI - Balancing biomass harvesting and drying tactics with delivered payment practice
AU - Roise, J. P.
AU - Catts, G.
AU - Hazel, D.
AU - A. Hobbs A.,
AU - Hopkins, C.
A3 - Greenville, S.C.: US Endowment for Forestry and Community
DA - 2013///
PY - 2013///
PB - Greenville, S.C.: US Endowment for Forestry and Community
ER -
TY - CONF
TI - Understanding blackholes in large-scale cognitive radio networks under generic failures
AU - Sun, L.
AU - Wang, Wenye
AB - It has been demonstrated that in wireless networks, Blackholes, which are typically generated by isolated node failures, and augmented by failure correlations, can easily result in devastating impact on network performance. Therefore, many solutions, such as routing protocols and restoration algorithms, are proposed to deal with Blackholes by identifying alternative paths to bypass these holes such that the effect of Blackholes can be mitigated. These advancements are based on an underlying premise that there exists at least one alternative path in the network. However, such a hypothesis remains an open question. In other words, we do not know whether the network is resilient to Blackholes or whether an alternative path exists. The answer to this question can complement our understanding of designing routing protocols, as well as topology evolution in the presence of random failures. In order to address this issue, we focus on the topology of Cognitive Radio Networks (CRNs) because of their phenomenal benefits in improving spectrum efficiency through opportunistic communications. Particularly, we first define two metrics, namely the failure occurrence probability p and failure connection function g(·), to characterize node failures and their spreading properties, respectively. Then we prove that each Blackhole is exponentially bounded based on percolation theory. By mapping failure spreading using a branching process, we further derive an upper bound on the expected size of Blackholes. With the observations from our analysis, we are able to find a sufficient condition for a resilient CRN in the presence of Blackholes through analysis and simulations.
C2 - 2013///
C3 - 2013 proceedings ieee infocom
DA - 2013///
DO - 10.1109/infcom.2013.6566859
SP - 728–736
ER -
TY - JOUR
TI - Exploring accurate Poisson-Boltzmann methods for biomolecular simulations
AU - Wang, Changhao
AU - Wang, Jun
AU - Cai, Qin
AU - Li, Zhilin
AU - Zhao, Hong-Kai
AU - Luo, Ray
T2 - COMPUTATIONAL AND THEORETICAL CHEMISTRY
AB - Accurate and efficient treatment of electrostatics is a crucial step in computational analyses of biomolecular structures and dynamics. In this study, we have explored a second-order finite-difference numerical method to solve the widely used Poisson-Boltzmann equation for electrostatic analyses of realistic bio-molecules. The so-called immersed interface method was first validated and found to be consistent with the classical weighted harmonic averaging method for a diversified set of test biomolecules. The numerical accuracy and convergence behaviors of the new method were next analyzed in its computation of numerical reaction field grid potentials, energies, and atomic solvation forces. Overall similar convergence behaviors were observed as those by the classical method. Interestingly, the new method was found to deliver more accurate and better-converged grid potentials than the classical method on or nearby the molecular surface, though the numerical advantage of the new method is reduced when grid potentials are extrapolated to the molecular surface. Our exploratory study indicates the need for further improving interpolation/extrapolation schemes in addition to the developments of higher-order numerical methods that have attracted most attention in the field.
DA - 2013/11/15/
PY - 2013/11/15/
DO - 10.1016/j.comptc.2013.09.021
VL - 1024
SP - 34-44
SN - 1872-7999
KW - Poisson-Boltzmann equation
KW - Finite difference method
KW - Immersed interface method
KW - Continuum solvent models
ER -
TY - JOUR
TI - An Empirical Study of Communication Infrastructures Towards the Smart Grid: Design, Implementation, and Evaluation
AU - Lu, Xiang
AU - Wang, Wenye
AU - Ma, Jianfeng
T2 - IEEE TRANSACTIONS ON SMART GRID
AB - The smart grid features ubiquitous interconnections of power equipments to enable two-way flows of electricity and information for various intelligent power management applications, such as accurate relay protection and timely demand response. To fulfill such pervasive equipment interconnects, a full-fledged communication infrastructure is of great importance in the smart grid. There have been extensive works on disparate layouts of communication infrastructures in the smart grid by surveying feasible wired or wireless communication technologies, such as power line communications and cellular networks. Nevertheless, towards an operable, cost-efficient and backward-compatible communication solution, more comprehensive and practical understandings are still urgently needed regarding communication requirements, applicable protocols, and system performance. Through such comprehensive understandings, we are prone to answer a fundamental question, how to design, implement and integrate communication infrastructures with power systems. In this paper, we address this issue in a case study of a smart grid demonstration project, the Future Renewable Electric Energy Delivery and Management (FREEDM) systems. By investigating communication scenarios, we first clarify communication requirements implied in FREEDM use cases. Then, we adopt a predominant protocol framework, Distributed Network Protocol 3.0 over TCP/IP (DNP3 over TCP/IP), to practically establish connections between electric devices for data exchanges in a small-scale FREEDM system setting, Green Hub. Within the real-setting testbed, we measure the message delivery performance of the DNP3-based communication infrastructure. Our results reveal that diverse timing requirements of message deliveries are arguably primary concerns in a way that dominates viabilities of protocols or schemes in the communication infrastructure of the smart grid. Accordingly, although DNP3 over TCP/IP is widely considered as a smart grid communication solution, it cannot satisfy communication requirements in some time-critical scenarios, such as relay protections, which claim a further optimization on the protocol efficiency of DNP3.
DA - 2013/3//
PY - 2013/3//
DO - 10.1109/tsg.2012.2225453
VL - 4
IS - 1
SP - 170-183
SN - 1949-3061
KW - Communication infrastructures
KW - DNP3 over TCP/IP
KW - field deployment and performance evaluations
KW - FREEDM systems
KW - smart grid
KW - system design
ER -
TY - JOUR
TI - A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems
AU - Li, Han-Lin
AU - Huang, Yao-Huei
AU - Fang, Shu-Cherng
T2 - INFORMS JOURNAL ON COMPUTING
AB - This paper studies the classical task assignment problem (TAP) in which M unbreakable tasks are assigned to N agents with the objective to minimize the communication and process costs subject to each agent's capacity constraint. Because a large-size TAP involves many binary variables, most, if not all, traditional methods experience the difficulty in solving the problem within a reasonable time period. Recent works present a logarithmic approach to reduce the number of binary variables in problems with mixed-integer variables. This study proposes a new logarithmic method that significantly reduces the numbers of binary variables and inequality constraints in solving task assignment problems. Our numerical experiments demonstrate that the proposed method is superior to other known methods of this kind for solving large-size TAPs.
DA - 2013///
PY - 2013///
DO - 10.1287/ijoc.1120.0527
VL - 25
IS - 4
SP - 643-653
SN - 1526-5528
KW - task assignment problem
KW - binary variables
KW - mixed-integer programming problem
ER -
TY - JOUR
TI - Scalable Hybrid Deterministic/Monte Carlo Neutronics Simulations in Two Space Dimensions
AU - Willert, Jeffrey
AU - Kelley, C. T.
AU - Knoll, D. A.
AU - Park, H.
T2 - 2013 12TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING & SCIENCE (DCABES)
AB - In this paper we discuss a parallel hybrid deterministic/Monte Carlo (MC) method for the solution of the neutron transport equation in two space dimensions. The algorithm uses an NDA formulation of the transport equation, with a MC solver for the high-order equation. The scalability arises from the concentration of work in the MC phase of the algorithm, while the overall run-time is a consequence of the deterministic phase.
DA - 2013///
PY - 2013///
DO - 10.1109/dcabes.2013.8
SP - 7-10
KW - Neutron Transport
KW - Jacobian-Free Newton-Krylov
KW - NDA
KW - Monte Carlo
ER -
TY - CONF
TI - Non-operational testing of software for security issues
AU - Subramani, S.
AU - Vouk, M.
AU - Williams, L.
AB - We are studying extension of the classical Software Reliability Engineering (SRE) methodology into the security space. We combine “classical” reliability modeling, when applied to reported vulnerabilities found under “normal” operational profile conditions, with safety oriented fault management processes. We illustrate with open source Fedora software.
C2 - 2013///
C3 - 2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)
DA - 2013///
DO - 10.1109/issrew.2013.6688857
SP - 21-22
ER -
TY - JOUR
TI - Eigenvalue placement in completions of DAES
AU - Campbell, Stephen L.
AU - Holte, Lise E.
T2 - Electronic Journal of Linear Algebra
AB - Differential algebraic equations (DAEs) are used to describe many physical processes. A completion of a DAE is an ordinary differential equation whose solutions include those of the DAE. Algorithms exists for designing stabilized completions of differential algebraic equations. Recent work on observers for DAEs has shown the need for more information on, and control of the placement of, the additional eigenvalues of the completion. This paper investigates this eigenvalue placement problem. Results are given relating the additional eigenvalues of the completion and the choice of stabilization matrix for certain important classes of linear DAEs.
DA - 2013/1/1/
PY - 2013/1/1/
DO - 10.13001/1081-3810.1667
VL - 26
IS - 1
SP - 520–534
ER -
TY - JOUR
TI - Identifying optimal mitigation strategies for responding to a mild influenza epidemic
AU - Yarmand, Hamed
AU - Ivy, Julie S.
AU - Roberts, Stephen D.
T2 - SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL
AB - Mathematical models have been developed to simulate influenza epidemics to help public health officials evaluate different control policies. In these models, often severe influenza epidemics with a considerable mortality rate are considered. However, as was the case for the 2009 H1N1 pandemic, some of the influenza epidemics are mild with insignificant mortality rates. In the case of a mild epidemic, the cost of different control policies becomes an important decision factor in addition to disease-related outcomes such as the attack rate. We develop a continuous-time simulation model for the spread of a mild influenza epidemic based on the SEIR model (an epidemiological model with four classes: susceptible, exposed, infective, and recovered) which includes different interventions. To determine the epidemic mitigation policy with the minimum cost, we also develop an optimization model with two decision variables, vaccination and self-isolation fractions, and an upper-bound constraint for the attack rate. We use this model to evaluate the cost-effectiveness of different mitigation policies. Furthermore, we integrate the simulation and optimization models to identify the optimal mitigation policy. Finally, we conduct sensitivity analysis on the key input parameters to ensure robust results. The optimal policy depends on the target population and, as our results show, in general is a combination of vaccination and self-isolation. Further, for low (high) levels of intervention, vaccination (self-isolation) is incrementally more cost-effective. Therefore, public health officials should concentrate on vaccination at the beginning of the epidemic. However, if the epidemic continues to spread, they should promote self-isolation as a more effective intervention.
DA - 2013/11//
PY - 2013/11//
DO - 10.1177/0037549713505334
VL - 89
IS - 11
SP - 1400-1415
SN - 1741-3133
KW - Simulation
KW - mild epidemic
KW - optimal control policy
KW - cost-effectiveness analysis
KW - vaccination
KW - self-isolation
ER -
TY - JOUR
TI - Planning Wafer Starts using Nonlinear Clearing Functions: A Large-Scale Experiment
AU - Kacar, Necip Baris
AU - Moench, Lars
AU - Uzsoy, Reha
T2 - IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING
AB - The nonlinear, circular dependency between workload and cycle times for production resources governed by queueing behavior has been a longstanding difficulty in the production planning domain. The issue is particularly important for semiconductor wafer fabrication facilities, which must operate at relatively high utilization to be profitable. Nonlinear clearing functions that relate the expected output of a resource in a planning period to the amount of work available to it have been proposed as an alternative approach. While computational tests on small systems have been promising, the question of whether the results remain valid for large-scale systems has remained open. In this paper we evaluate the performance of a clearing function based production planning model using a simulation of a large-scale wafer fab with two products and several hundred operations. Results indicate that, consistent with the results of previous experiments, the clearing function model yields substantial improvements in profit over conventional linear programming models.
DA - 2013/11//
PY - 2013/11//
DO - 10.1109/tsm.2013.2283038
VL - 26
IS - 4
SP - 602-612
SN - 1558-2345
KW - Clearing functions
KW - linear programming
KW - production planning
KW - release planning
KW - simulation
ER -
TY - JOUR
TI - Norms as a Basis for Governing Sociotechnical Systems
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - We understand a sociotechnical system as a multistakeholder cyber-physical system. We introduce governance as the administration of such a system by the stakeholders themselves. In this regard, governance is a peer-to-peer notion and contrasts with traditional management, which is a top-down hierarchical notion. Traditionally, there is no computational support for governance and it is achieved through out-of-band interactions among system administrators. Not surprisingly, traditional approaches simply do not scale up to large sociotechnical systems. We develop an approach for governance based on a computational representation of norms in organizations. Our approach is motivated by the Ocean Observatory Initiative, a thirty-year $400 million project, which supports a variety of resources dealing with monitoring and studying the world's oceans. These resources include autonomous underwater vehicles, ocean gliders, buoys, and other instrumentation as well as more traditional computational resources. Our approach has the benefit of directly reflecting stakeholder needs and assuring stakeholders of the correctness of the resulting governance decisions while yielding adaptive resource allocation in the face of changes in both stakeholder needs and physical circumstances.
DA - 2013/12//
PY - 2013/12//
DO - 10.1145/2542182.2542203
VL - 5
IS - 1
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891809035&partnerID=MN8TOARS
KW - Algorithms
KW - Design
KW - Governance
KW - sociotechnical systems
KW - adaptation
ER -
TY - CONF
TI - Gain-scheduling compensator synthesis for output regulation of nonlinear systems
AU - Song, X.
AU - Ren, Z.
AU - Wu, F.
AB - This paper addresses the gain-scheduling output regulation synthesis problem for nonlinear systems. For gain-scheduling control, the linear parameter-varying (LPV) model is obtained from nonlinear plant by plant linearization about zero-error trajectories upon which an LPV controller is synthesized. In practical engineering application, a key issue is to find a nonlinear output feedback compensator related to the designed LPV controller which can guarantee that the closed-loop system of nonlinear plant and compensator linearizes to the interconnection of LPV model and LPV controller. So the stability and performance about the zero-error trajectories can be inherited when the nonlinear compensator is implemented. By incorporating equilibrium input and measured output into the auxiliary LPV model, the compensator synthesis problem is reformulated as linear matrix inequalities (LMIs) which can be solved efficiently using the interior-point method. Consequently the proposed output feedback compensator can satisfy the linearization requirement. Finally, the validity of the proposed approach is demonstrated through a ball and beam design example.
C2 - 2013///
C3 - 2013 american control conference (acc)
DA - 2013///
DO - 10.1109/acc.2013.6580791
SP - 6078-6083
ER -
TY - CONF
TI - Comparison of an ℓ1-regression-based and a RANSAC-based planar segmentation procedure for urban terrain data with many outliers
AU - Luo, Jian
AU - Deng, Zhibin
AU - Bulatov, Dimitri
AU - Lavery, John E.
AU - Fang, Shu-Cherng
T2 - SPIE Remote Sensing
A2 - Bruzzone, Lorenzo
T3 - Proceedings of SPIE
AB - For urban terrain data with many outliers, we compare an ℓ1-regression-based and a RANSAC-based planar segmentation procedure. The procedure consists of 1) calculating the normal at each of the points using ℓ1 regression or RANSAC, 2) clustering the normals thus generated using DBSCAN or fuzzy c-means, 3) within each cluster, identifying segments (roofs, walls, ground) by DBSCAN-based-subclustering of the 3D points that correspond to each cluster of normals and 4) fitting the subclusters by the same method as that used in Step 1 (ℓ1 regression or RANSAC). Domain decomposition is used to handle data sets that are too large for processing as a whole. Computational results for a point cloud of a building complex in Bonnland, Germany obtained from a depth map of seven UAV-images are presented. The ℓ1-regression-based procedure is slightly over 25% faster than the RANSAC-based procedure and produces better dominant roof segments. However, the roof polygonalizations and cutlines based on these dominant segments are roughly equal in accuracy for the two procedures. For a set of artificial data, ℓ1 regression is much more accurate and much faster than RANSAC. We outline the complete building reconstruction procedure into which the ℓ1-regression-based and RANSAC-based segmentation procedures will be integrated in the future.
C2 - 2013/10/17/
C3 - Image and Signal Processing for Remote Sensing XIX
CY - Dresden, Germany
DA - 2013/10/17/
PY - 2013/9/23/
DO - 10.1117/12.2028627
VL - 8892
SP - 889209
PB - SPIE
UR - http://dx.doi.org/10.1117/12.2028627
KW - DBSCAN
KW - fuzzy c-means
KW - l(1) regression
KW - outlier-rich
KW - planar
KW - RANSAC
KW - segmentation
KW - urban terrain
ER -
TY - JOUR
TI - Augmented Reality Interfaces
AU - Singh, Mona
AU - Singh, Munindar P.
T2 - IEEE INTERNET COMPUTING
AB - Technological advances, exploding amounts of information, and user receptiveness are fueling augmented reality's (AR) rapid expansion from a novelty concept to potentially the default interface paradigm in coming years. This article briefly describes AR in terms of its application in natural Web interfaces. The authors discuss key concepts involved in AR, and the technical and social challenges that remain.
DA - 2013///
PY - 2013///
DO - 10.1109/mic.2013.107
VL - 17
IS - 6
SP - 66-70
SN - 1941-0131
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84890959306&partnerID=MN8TOARS
KW - usability
KW - augmented reality
KW - mobile applications
KW - mobile computing
KW - user experience
KW - user interfaces
ER -
TY - JOUR
TI - A branch-and-cut approach to portfolio selection with marginal risk control in a linear conic programming framework
AU - Deng, Zhibin
AU - Bai, Yanqin
AU - Fang, Shu-Cherng
AU - Tian, Ye
AU - Xing, Wenxun
T2 - JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING
DA - 2013/12//
PY - 2013/12//
DO - 10.1007/s11518-013-5234-5
VL - 22
IS - 4
SP - 385-400
SN - 1861-9576
KW - Portfolio selection
KW - linear conic programming
KW - branch-and-cut
ER -
TY - JOUR
TI - A Survey of VBR Video Traffic Models
AU - Tanwir, Savera
AU - Perros, Harry
T2 - IEEE COMMUNICATIONS SURVEYS AND TUTORIALS
AB - We have seen a phenomenal growth in video applications in the past few years. An accurate traffic model of VBR video is necessary for performance evaluation of a network design and also for creating synthetic loads that can be used for benchmarking a network. In view of this, various models for VBR video traffic have been proposed in the literature. In this paper, we classify and survey these models. In addition, we implemented four representative video traffic models and compared them using the H.264 AVC video traces available at the Arizona State University video traces library. These models are: the Markov Modulated Gamma (MMG) model, the Discrete Autoregressive (DAR) model, the second order Autoregressive AR(2) model, and a wavelet-based model. The results show that the MMG and the wavelet-based models are suitable for both video conference and IPTV, while the DAR model is good for video conference traffic only. According to our results, the AR(2) model is not suitable for generating any type of H.264 video. A brief overview of SVC, HD, and 3D video is also provided.
DA - 2013///
PY - 2013///
DO - 10.1109/surv.2013.010413.00071
VL - 15
IS - 4
SP - 1778-1802
SN - 1553-877X
KW - VBR video
KW - Video traffic model
KW - H.264
ER -
TY - JOUR
TI - Vision for TOIT
AU - Singh, Munindar P.
T2 - ACM Transactions on Internet Technology
AB - No abstract available.
DA - 2013///
PY - 2013///
DO - 10.1145/2499926.2499929
VL - 12
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896953416&partnerID=MN8TOARS
ER -
TY - JOUR
TI - TOIT administrative updates
AU - Singh, Munindar P.
T2 - ACM Transactions on Internet Technology
AB - No abstract available.
DA - 2013///
PY - 2013///
DO - 10.1145/2499926.2499930
VL - 12
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896985959&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Quantification of parameter uncertainty for robust control of shape memory alloy bending actuators
AU - Crews, John H.
AU - McMahan, Jerry A.
AU - Smith, Ralph C.
AU - Hannen, Jennifer C.
T2 - SMART MATERIALS AND STRUCTURES
AB - In this paper, we employ Bayesian parameter estimation techniques to derive gains for robust control of smart materials. Specifically, we demonstrate the feasibility of utilizing parameter uncertainty estimation provided by Markov chain Monte Carlo (MCMC) methods to determine controller gains for a shape memory alloy bending actuator. We treat the parameters in the equations governing the actuator's temperature dynamics as uncertain and use the MCMC method to construct the probability densities for these parameters. The densities are then used to derive parameter bounds for robust control algorithms. For illustrative purposes, we construct a sliding mode controller based on the homogenized energy model and experimentally compare its performance to a proportional-integral controller. While sliding mode control is used here, the techniques described in this paper provide a useful starting point for many robust control algorithms.
DA - 2013/11//
PY - 2013/11//
DO - 10.1088/0964-1726/22/11/115021
VL - 22
IS - 11
SP -
SN - 1361-665X
ER -
TY - JOUR
TI - Internode Mobility Correlation for Group Detection and Analysis in VANETs
AU - Li, Yujin
AU - Zhao, Ming
AU - Wang, Wenye
T2 - IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
AB - Recent studies on mobility-assisted schemes for routing and topology control and on mobility-induced link dynamics have presented significant findings on the properties of a pair of nodes (e.g., the intermeeting time and link life time) or a group of nodes (e.g., network connectivity and partitions). In contrast to the study on the properties of a set of nodes rather than individuals, many works share a common ground with respect to node mobility, i.e., independent mobility in multihop wireless networks. Nonetheless, in vehicular ad hoc networks (VANETs), mobile devices installed on vehicles or held by humans are not isolated; however, they are dependent on each other. For example, the speed of a vehicle is influenced by its close-by vehicles, and vehicles on the same road move at similar speeds. Therefore, the gap between our understanding of the impact of independent mobility and our interest in the properties of correlated mobility in VANETs, along with the real systems altogether, declare an interesting question. How can we measure the internode mobility correlation, such as to uncover the node groups and network components, and explore their impact on link dynamics and network connectivity? Bearing this question in mind, we first examine several traces and find that node mobility exhibits spatial locality and temporal locality correlations, which are closely related to node grouping. To study the properties of these groups on the fly, we introduce a new metric, i.e., dual-locality ratio (DLR), which quantifies mobility correlation of nodes. In light of taking spatial and temporal locality dimensions into account, the DLR can be used to effectively identify stable user groups, which in turn can be used for network performance enhancement.
DA - 2013/11//
PY - 2013/11//
DO - 10.1109/tvt.2013.2264689
VL - 62
IS - 9
SP - 4590-4601
SN - 1939-9359
KW - Correlated mobility
KW - group detection
KW - vehicular ad hoc networks
ER -
TY - JOUR
TI - HYBRID DETERMINISTIC/MONTE CARLO NEUTRONICS
AU - Willert, Jeffrey
AU - Kelley, C. T.
AU - Knoll, D. A.
AU - Park, H.
T2 - SIAM JOURNAL ON SCIENTIFIC COMPUTING
AB - In this paper we describe a hybrid deterministic/Monte Carlo algorithm for neutron transport simulation. The algorithm is based on nonlinear accelerators for source iteration, using Monte Carlo methods for the purely absorbing high-order problem and a Jacobian-free Newton--Krylov iteration for the low-order problem. We couple the Monte Carlo solution with the low-order problem using filtering to smooth the flux and current from the Monte Carlo solver and an analytic Jacobian-vector product to avoid numerical differentiation of the Monte Carlo results. We use a continuous energy deposition tally for the Monte Carlo simulation. We conclude the paper with numerical results which illustrate the effectiveness of the new algorithm.
DA - 2013///
PY - 2013///
DO - 10.1137/120880021
VL - 35
IS - 5
SP - S62-S83
SN - 1095-7197
KW - JFNK methods
KW - neutron transport
KW - Monte Carlo simulation
KW - hybrid methods
ER -
TY - JOUR
TI - Dynamic Service Contract Enforcement in Service-Oriented Networks
AU - Jarma, Yesid
AU - Boloor, Keerthana
AU - Amorim, Marcelo Dias
AU - Viniotis, Yannis
AU - Callaway, Robert D.
T2 - IEEE TRANSACTIONS ON SERVICES COMPUTING
AB - In recent years, service-oriented architectures (SOA) have emerged as the main solution for the integration of legacy systems with new technologies in the enterprise world. A service is usually governed by a client service contract (CSC) that specifies, among other requirements, the rate at which a service should be accessed, and limits it to no more than a number of service requests during an observation period. Several approaches, using both static and dynamic credit-based strategies, have been developed to enforce the rate specified in the CSC. Existing approaches have problems related to starvation, approximations used in calculations, and rapid credit consumption under certain conditions. In this paper, we propose and validate DoWSS, a doubly weighted algorithm for service traffic shaping. We show via simulation that DoWSS possesses several advantages: It eliminates the approximation issues, prevents starvation, and contains the rapid credit consumption issue in existing credit-based approaches.
DA - 2013///
PY - 2013///
DO - 10.1109/tsc.2011.45
VL - 6
IS - 1
SP - 130-142
SN - 1939-1374
KW - Service-oriented networks
KW - web services
KW - service traffic shaping
KW - contract enforcement
KW - middleware appliances
KW - appliance cluster
KW - credit-based algorithm
ER -
TY - JOUR
TI - Adaptive mesh refinement techniques for the immersed interface method applied to flow problems
AU - Li, Zhilin
AU - Song, Peng
T2 - COMPUTERS & STRUCTURES
AB - In this paper, we develop an adaptive mesh refinement strategy of the Immersed Interface Method for flow problems with a moving interface. The work is built on the AMR method developed for two-dimensional elliptic interface problems in the paper [12] (CiCP, 12(2012), 515–527). The interface is captured by the zero level set of a Lipschitz continuous function φ(x, y, t). Our adaptive mesh refinement is built within a small band of ∣φ(x, y, t)∣ ⩽ δ with finer Cartesian meshes. The AMR-IIM is validated for Stokes and Navier–Stokes equations with exact solutions, moving interfaces driven by the surface tension, and classical bubble deformation problems. A new simple area preserving strategy is also proposed in this paper for the level set method.
DA - 2013/6//
PY - 2013/6//
DO - 10.1016/j.compstruc.2013.03.013
VL - 122
SP - 249-258
SN - 0045-7949
KW - Adaptive mesh refinement method
KW - Immersed interface method
KW - Stokes and Navier-Stokes equations
KW - Surface tension
KW - Bubble deformation
KW - Level set method
ER -
TY - JOUR
TI - A Bounded and Discretized Nelder-Mead Algorithm Suitable for RFIC Calibration
AU - Wyers, Eric J.
AU - Steer, Michael B.
AU - Kelley, C. T.
AU - Franzon, Paul D.
T2 - IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS
AB - This paper describes a calibration technique for noisy and nonconvex circuit responses based on the Nelder-Mead direct search algorithm. As Nelder-Mead is intended for unconstrained optimization problems, we present an implementation of the algorithm which is suitable for bounded and discretized RFIC calibration problems. We apply the proposed algorithm to the problem of spurious tone reduction via VCO control line ripple minimization for a PLL operating at a frequency of 12 GHz. For this nonconvex calibration test case, we show that a gradient descent-based algorithm has difficulty in reducing the VCO control line ripple, while the proposed algorithm reduces the relative power of the first harmonic reference spurs by at least 10 dBc and effectively enables design complexity reduction in the supporting analog calibration circuitry.
DA - 2013/7//
PY - 2013/7//
DO - 10.1109/tcsi.2012.2230496
VL - 60
IS - 7
SP - 1787-1799
SN - 1558-0806
KW - Calibration
KW - derivative-free optimization
KW - Nelder-Mead direct search algorithm
KW - PLL spurious tone reduction
KW - radio frequency integrated circuit calibration
ER -
TY - JOUR
TI - Wireless Mesh Network in Smart Grid: Modeling and Analysis for Time Critical Communications
AU - Xu, Yi
AU - Wang, Wenye
T2 - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
AB - Communication networks are an indispensable component in the smart grid power systems by providing the essential information exchange functions among the electrical devices that are located distributively in the grid. In particular, wireless networks will be deployed widely in the smart grid for data collection and remote control purposes. In this paper, we model the smart grid wireless networks and present the communication delay analysis in typical wireless network deployment scenarios in the grid. As the time critical communications are coupled with the power system protections in the smart grid, it is important to understand the delay performance of the smart grid wireless networks. Our results provide the delay bounds that can help design satisfactory wireless networks to meet the demanding communication requirements in the smart grid.
DA - 2013/7//
PY - 2013/7//
DO - 10.1109/twc.2013.061713.121545
VL - 12
IS - 7
SP - 3360-3371
SN - 1536-1276
KW - Wireless network
KW - smart grid
KW - time critical communication
KW - network performance
KW - communication delay
ER -
TY - CONF
TI - The homogenized energy model for characterizing magnetization and strains in ferromagnetic materials
AU - Blaircum, L. Van
AU - Smith, Ralph
AB - Ferromagnetic materials exhibit rate-dependent hysteresis, creep and constitutive nonlinearities due to their inherent domain structure. For model-based control applications, these non-linear attributes must be incorporated in a models in a manner that facilitates model calibration and real-time control implementation. In this paper, we present a homogenized energy model for these materials. This is a multiscale framework that quantifies energy at the domain level and then employs stochastic homogenization techniques to provide macroscopic models that are highly efficient to implement. The accuracy of models will be validated using a variety of experimental data.
C2 - 2013///
C3 - Proceedings of the ASME Conference on Smart Materials, Adaptive Structures and Intelligent Systems, vol 1
DA - 2013///
DO - 10.1115/smasis2012-8137
SP - 489–496
ER -
TY - JOUR
TI - Stereo rendering of rain in real-time
AU - Hussain, Syed A.
AU - McAllister, David F.
T2 - STEREOSCOPIC DISPLAYS AND APPLICATIONS XXIV
AB - The rendering of photorealistic rain has been previously studied for monoscopic viewing. We extend the monoscopic statistical rain models to simulate the behavior and distribution of falling rain for stereo viewing. Our goal is to be able to render in real-time frame rates. In this investigation we ignore the complex issues of scene illumination and concentrate on the parameters that produce a realistic rain distribution. Using the concept of retinal persistence we render a visible falling raindrop as a linear streak. To speed rendering we use pre-computed images of such rain streaks. Rain streak positions for the left- and right-eye views are created by generating random numbers that depend on the view volume of the scene. We permit interactive but controlled modification of rain parameters such as density and wind gusts. We compare our approach to the use of existing 2D-3D conversion methods. The results demonstrate that using commercial 2D-3D converters are not sufficient in producing realistic stereo rain effects. Future research will concentrate on including complex lighting interactions.
DA - 2013///
PY - 2013///
DO - 10.1117/12.2001308
VL - 8648
SP -
SN - 1996-756X
KW - Rain
KW - photorealistic
KW - real-time
KW - 2D-3D conversion
KW - stereo
KW - 3D
ER -
TY - JOUR
TI - Steady states for chemical process plants: A legacy code, time-stepping approach
AU - Kavouras, Andreas
AU - Georgakis, Christos
AU - Kelley, C. T.
AU - Siettos, Constantinos
AU - Kevrekidis, Ioannis G.
T2 - AICHE JOURNAL
AB - Given a legacy dynamic simulator of a chemical process plant, we construct a computational procedure that can be “wrapped around” the simulator to compute its steady states (both stable and unstable) and their dependence on input parameters. We apply this approach to the Tennessee Eastman (TE) challenge problem presented by Downs and Vogel, who also provided a FORTRAN process model. Using the FORTRAN simulator as a black-box input-output map, we enable it to systematically converge to isolated solutions and study their stability and parametric dependence within the equation-free framework. The presence of neutrally stable modes in TE problem (due to so-called inventories), their interplay with the problem formulation and the convergence of the solution procedure is explored and rationalized. Interestingly, our time-stepper formulation can automatically take advantage of separation of time scales, when present, to enhance computational convergence. The approach enables legacy dynamic simulators to calculate several dynamic problem characteristics useful for controller design and/or process optimization. © 2013 American Institute of Chemical Engineers AIChE J, 59: 3308–3321, 2013
DA - 2013/9//
PY - 2013/9//
DO - 10.1002/aic.14199
VL - 59
IS - 9
SP - 3308-3321
SN - 0001-1541
KW - equation-free computations
KW - legacy dynamic simulator
KW - unstable processes
KW - inventories
KW - time-steppers
ER -
TY - CONF
TI - Sliding mode control for inverse compensated hysteretic smart systems
AU - McMahan, J. A.
AU - Smith, R. C.
C2 - 2013///
C3 - Proceedings of the ASME Conference on Smart Materials, Adaptive Structures and Intelligent Systems, vol 1
DA - 2013///
SP - 335–344
ER -
TY - JOUR
TI - Recovery of inclusions in 2D and 3D domains for Poisson's equation
AU - Ito, Kazufumi
AU - Liu, Ji-Chuan
T2 - INVERSE PROBLEMS
AB - In this paper, we consider the recovery problem of inclusions in three-dimensional and three-dimensional domains for Poisson's equation from noisy observation data. We propose effective reconstruction algorithms to recover hidden inclusions within a body when one can only make measurements of voltage and current on the external boundary. Our motivation is to detect the number, the location, the size and the shape of inclusions. This problem is nonlinear and severely ill posed, thus we should apply regularization techniques in our approaches in order to improve the corresponding approximation. We give several examples to show the viability of our proposed methods.
DA - 2013/7//
PY - 2013/7//
DO - 10.1088/0266-5611/29/7/075005
VL - 29
IS - 7
SP -
SN - 1361-6420
ER -
TY - JOUR
TI - Hybrid FRR/p-cycle design for link and node protection in MPLS networks
AU - Cao, Chang
AU - Rouskas, George N.
AU - Wang, Jianquan
AU - Tang, Xiongyan
T2 - AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS
AB - Survivable MPLS technologies are crucial in ensuring reliable communication services. The fast reroute (FRR) mechanism has been standardized to achieve fast local repair of label switched paths (LSPs) in the event of link or node failures. We present a suite of hybrid protection schemes for MPLS networks that combine the well-known p-cycle method with FRR technology. Whereas with pure FRR backup paths are planned by each node individually, the hybrid schemes employ a set of p-cycles that may be selected using techniques that take a holistic view of the network so as to share protection bandwidth effectively. The hybrid FRR/p-cycle methods are fully RFC 4090-compliant, yet allow network operators to leverage a large existing body of p-cycle design techniques. Numerical results on realistic network topologies indicate that the hybrid approach is successful in combining the advantages of p-cycle design and FRR.
DA - 2013///
PY - 2013///
DO - 10.1016/j.aeue.2012.11.005
VL - 67
IS - 6
SP - 470-478
SN - 1618-0399
KW - Multi-protocol label switching
KW - Fast reroute
KW - Pre-configure cycle
ER -
TY - CONF
TI - Homogenized energy model and markov chain Monte Carlo simulations for macro fiber composites operating in broadband regimes
AU - Hu, Z. Z.
AU - Smith, R. C.
AU - Burch, N.
AU - Hays, M.
AU - Oates, W. S.
C2 - 2013///
C3 - Proceedings of the ASME Conference on Smart Materials, Adaptive Structures and Intelligent Systems, vol 1
DA - 2013///
SP - 321–327
ER -
TY - CONF
TI - Development of robust control algorithms for shape memory alloy bending actuators
AU - Crews, J. H.
AU - Smith, Ralph
AU - Hannen, J. C.
AB - In this paper, we present a systematic approach to developing robust control algorithms for a single-tendon shape memory alloy (SMA) bending actuator. Parameter estimation and uncertainty quantification are accomplished using Bayesian techniques. Specifically, we utilize Markov Chain Monte Carlo (MCMC) methods to estimate parameter uncertainty. The Bayesian parameter estimation results are used to construct a sliding mode control (SMC) algorithm where the bounds on uncertainty are used to guarantee controller robustness. The sliding mode controller utilizes the homogenized energy model (HEM) for SMA. The inverse HEM compensates for hysteresis and converts a reference bending angle to a reference temperature. Temperature in the SMA actuator is estimated using an observer, and the sliding mode controller ensures that the observer temperature tracks the reference temperature. The SMC is augmented with proportional-integral (PI) control on the bending angle error.
C2 - 2013///
C3 - Proceedings of the ASME Conference on Smart Materials, Adaptive Structures and Intelligent Systems, vol 1
DA - 2013///
DO - 10.1115/smasis2012-7989
SP - 391–400
ER -
TY - JOUR
TI - Denoising three-dimensional and colored images using a Bayesian multi-scale model for photon counts
AU - White, J. T.
AU - Ghosal, S.
T2 - Signal Processing
DA - 2013///
PY - 2013///
VL - 93
IS - 11
SP - 2906-2914
ER -
TY - JOUR
TI - Computing optimal base-stock levels for an inventory system with imperfect supply
AU - Warsing, Donald P., Jr.
AU - Wangwatcharakul, Worawut
AU - King, Russell E.
T2 - Computers & Operations Research
AB - We study a single-item, single-site, periodic-review inventory system with negligible fixed ordering costs. The supplier to this system is not entirely reliable, such that each order is a Bernoulli trial, meaning that, with a given probability, the supplier delivers the current order and any accumulated backorders at the end of the current period, resulting in a Geometric distribution for the actual resupply lead time. We develop a recursive expression for the steady-state probability vector of a discrete-time Markov process (DTMP) model of this imperfect-supply inventory system. We use this recursive expression to prove the convexity of the inventory system objective function, and also to prove the optimality of our computational procedure for finding the optimal base-stock level. We present a service-constrained version of the problem and show how the computation of the optimal base-stock level using our DTMP method, incorporating the explicit distribution of demand over the lead time plus review (LTR) period, compares to approaches in the literature that approximate this distribution. We also show that the version of the problem employing an explicit penalty cost can be solved in closed-form for the optimal base-stock level for two specific period demand distributions, and we explore the behavior of the optimal base-stock level and the corresponding optimal service level under various values of the problem parameters.
DA - 2013/11//
PY - 2013/11//
DO - 10.1016/j.cor.2013.04.001
VL - 40
IS - 11
SP - 2786-2800
J2 - Computers & Operations Research
LA - en
OP -
SN - 0305-0548
UR - http://dx.doi.org/10.1016/j.cor.2013.04.001
DB - Crossref
KW - Inventory
KW - Base-stock policy
KW - Imperfect supply
KW - Supply risk
ER -
TY - JOUR
TI - A Fourier finite volume element method for solving two-dimensional quasi-geostrophic equations on a sphere
AU - Wang, Quanxiang
AU - Zhang, Zhiyue
AU - Li, Zhilin
T2 - APPLIED NUMERICAL MATHEMATICS
AB - A new Fourier finite volume element method for solving quasi-geostrophic (QG) equations on a sphere has been developed in this paper. Using the spherical coordinates, a Fourier discretization is used in the longitudinal direction while a finite volume element approximation is used in the latitudinal direction. In our proposed numerical method, the trial and test function spaces are carefully chosen to get accurate approximations. The pole singularity associated with the spherical coordinates is eliminated by changing the resolution near the pole. Some numerical experiments are presented to illustrate accuracy and efficiency of our method and some geostrophic implications of the QG model.
DA - 2013/9//
PY - 2013/9//
DO - 10.1016/j.apnum.2013.03.007
VL - 71
SP - 1-13
SN - 0168-9274
KW - Fourier finite volume element method
KW - Quasi-geostrophic equations on a sphere
KW - Trial and test function spaces
KW - Pole singularity
ER -
TY - JOUR
TI - Robust Switched Filtering for Time-Varying Polytopic Uncertain Systems
AU - Duan, Chang
AU - Wu, Fen
T2 - JOURNAL OF DYNAMIC SYSTEMS MEASUREMENT AND CONTROL-TRANSACTIONS OF THE ASME
AB - This paper studies the problem of designing robust switched filters for time-varying polytopic uncertain systems. The synthesis conditions for a set of filters under a min-switching rule are derived to guarantee globally asymptotical stability with optimized robust H∞ performance. Specifically, the conditions are expressed as bilinear matrix inequalities (BMIs) and can be solved by linear matrix inequality (LMI) optimization techniques. The proposed approach utilizes a piecewise quadratic Lyapunov function to reduce the conservativeness of robust filtering methods based on single Lyapunov function, thus better H∞ performance can be achieved. Both continuous and discrete-time robust filter designs are considered. To simplify filter implementation, a method to remove redundancy in min-switching filter members is also introduced. The advantages of the proposed robust switching filters are illustrated by several examples.
DA - 2013/11//
PY - 2013/11//
DO - 10.1115/1.4025027
VL - 135
IS - 6
SP -
SN - 1528-9028
KW - polytopic uncertain systems
KW - robust switching state estimation
KW - min-switching logic
KW - robust H-infinity performance
ER -
TY - JOUR
TI - ON CONSTRAINT QUALIFICATIONS: MOTIVATION, DESIGN AND INTER-RELATIONS
AU - Wang, Ziteng
AU - Fang, Shu-Cherng
AU - Xing, Wenxun
T2 - JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
AB - Constraint qualification (CQ) is an important concept in nonlinear programming. This paper investigates the motivation of introducing constraint qualifications in developing KKT conditions for solving nonlinear programs and provides a geometric meaning of constraint qualifications. A unified framework of designing constraint qualifications by imposing conditions to equate the so-called ``locally constrained directions' to certain subsets of ``tangent directions' is proposed. Based on the inclusion relations of the cones of tangent directions, attainable directions, feasible directions and interior constrained directions, constraint qualifications are categorized into four levels by their relative strengths. This paper reviews most, if not all, of the commonly seen constraint qualifications in the literature, identifies the categories they belong to, and summarizes the inter-relationship among them. The proposed framework also helps design new constraint qualifications of readers' specific interests.
DA - 2013/10//
PY - 2013/10//
DO - 10.3934/jimo.2013.9.983
VL - 9
IS - 4
SP - 983-1001
SN - 1547-5816
KW - Constraint qualification
KW - nonlinear programming
KW - optimality conditions
KW - optimization
KW - KKT conditions
ER -
TY - JOUR
TI - Nonlinear gain-scheduling output-feedback control for polynomial nonlinear systems subject to actuator saturation
AU - Wu, Fen
AU - Hays, Scott
T2 - INTERNATIONAL JOURNAL OF CONTROL
AB - This paper investigates nonlinear gain-scheduling control approaches for a class of polynomial nonlinear systems, containing an output-dependent vector field with input saturation. Using the polytopic differential inclusion and norm-bounded differential inclusion (NDI) of saturation and dead-zone functions, the nonlinear plants are transformed into systems with measurable parameters. For the polytopic differential inclusion description, a quasi-linear parameter varying (quasi-LPV) output-feedback controller will be sought for saturation control. On the other hand, the NDI model leads to a nonlinear fractional transformation (NFT) output-feedback controller for saturated nonlinear systems. The quasi-LPV and NFT output-feedback control synthesis conditions are derived in the forms of output-dependent matrix inequalities. They can be reformulated as sum-of-squares (SOS) optimisations and solved efficiently using SOS programming. The proposed nonlinear gain-scheduling saturation control approaches will be demonstrated using the Van der Pol equation.
DA - 2013/9/1/
PY - 2013/9/1/
DO - 10.1080/00207179.2013.792001
VL - 86
IS - 9
SP - 1607-1619
SN - 1366-5820
KW - actuator saturation
KW - gain-scheduling control
KW - output feedback
KW - polynomial nonlinear systems
KW - SOS programming
ER -
TY - JOUR
TI - Lattice point generating functions and symmetric cones
AU - Beck, Matthias
AU - Bliem, Thomas
AU - Braun, Benjamin
AU - Savage, Carla D.
T2 - JOURNAL OF ALGEBRAIC COMBINATORICS
AB - We show that a recent identity of Beck–Gessel–Lee–Savage on the generating function of symmetrically constrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a finite reflection group. We obtain general expressions for the multivariate generating functions of such cones, and work out their general form more specifically for all symmetry groups of type A (previously known) and types B and D (new). We obtain several applications of these expressions in type B, including identities involving permutation statistics and lecture hall partitions.
DA - 2013/11//
PY - 2013/11//
DO - 10.1007/s10801-012-0414-9
VL - 38
IS - 3
SP - 543-566
SN - 1572-9192
KW - Lattice point generating function
KW - Polyhedral cone
KW - Finite reflection group
KW - Coxeter group
KW - Symmetrically constrained composition
KW - Permutation statistics
KW - Lecture hall partition
ER -
TY - JOUR
TI - Inversion algorithms for the homogenized energy model for hysteresis in ferroelectric and shape memory alloy compounds
AU - McMahan, J. A.
AU - Crews, J. H.
AU - Smith, Ralph
T2 - Journal of Intelligent Material Systems and Structures
AB - Ferroelectric and ferromagnetic materials have the advantage of broadband and dual actuator and sensor capabilities. Ferroelastic compounds such as shape memory alloys have large energy densities and are biocompatible. However, to take full advantage of these properties, it is necessary to employ models and control designs that account for the rate-dependent hysteresis, creep, and constitutive nonlinearities inherent to the materials. Inverse compensation is one technique that achieves this purpose. We present an inversion algorithm based on a binary search of a discretized input grid and apply this to the homogenized energy model for modeling hysteresis. The inversion algorithm is shown to provide a reasonable balance between accuracy and computational speed. Numerical examples are presented for three specific cases of the homogenized energy model.
DA - 2013///
PY - 2013///
DO - 10.1177/1045389x12471868
VL - 24
IS - 15
SP - 1796–1821
ER -
TY - CONF
TI - Feedback design for saturated polynomial nonlinear systems via higher order Lyapunov functions
AU - Yang, S. W.
AU - Wu, F.
AB - In this work, we develop a new control design approach to deal with saturated polynomial nonlinear systems by using higher order Lyapunov functions. By combining power transformation with Sum-of-Squares (SOS) techniques, we can augment the systems with more state variables representing higher order combinations of the original ones. Then, the search of higher order Lyapunov functions for original systems can be recast to the design of quadratic Lyapunov functions for augmented systems. By computing for higher order Lyapunov functions using norm-bounded differential inclusion (NDI) LMI conditions, the flexible representations of augmented systems can help us to achieve better performance than quadratic based method. Two examples illustrate the improvements to enlarge the region of attraction and to improve the ℋ∞ performance for nonlinear systems subjected to saturation nonlinearity, respectively.© 2012 ASME
C2 - 2013///
C3 - Proceedings of the ASME 5th Annual Dynamic Systems and Control Division Conference and JSME 11th Motion and Vibration Conference, DSCC 2012, vol 2
DA - 2013///
DO - 10.1115/dscc2012-movic2012-8644
SP - 645-652
ER -
TY - JOUR
TI - Adaptive Bayesian multivariate density estimation with Dirichlet mixtures
AU - Shen, W. N.
AU - Tokdar, S. T.
AU - Ghosal, S.
T2 - Biometrika
DA - 2013///
PY - 2013///
VL - 100
IS - 3
SP - 623-640
ER -
TY - JOUR
TI - Using Common Random Numbers in Health Care Cost-Effectiveness Simulation Modeling
AU - Murphy, Daniel R.
AU - Klein, Robert W.
AU - Smolen, Lee J.
AU - Klein, Timothy M.
AU - Roberts, Stephen D.
T2 - HEALTH SERVICES RESEARCH
AB - Objectives To identify the problem of separating statistical noise from treatment effects in health outcomes modeling and analysis. To demonstrate the implementation of one technique, common random numbers ( CRN s), and to illustrate the value of CRN s to assess costs and outcomes under uncertainty. Methods A microsimulation model was designed to evaluate osteoporosis treatment, estimating cost and utility measures for patient cohorts at high risk of osteoporosis‐related fractures. Incremental cost‐effectiveness ratios ( ICER s) were estimated using a full implementation of CRN s, a partial implementation of CRN s, and no CRN s. A modification to traditional probabilistic sensitivity analysis ( PSA ) was used to determine how variance reduction can impact a decision maker's view of treatment efficacy and costs. Results The full use of CRN s provided a 93.6 percent reduction in variance compared to simulations not using the technique. The use of partial CRN s provided a 5.6 percent reduction. The PSA results using full CRN s demonstrated a substantially tighter range of cost‐benefit outcomes for teriparatide usage than the cost‐benefits generated without the technique. Conclusions CRN s provide substantial variance reduction for cost‐effectiveness studies. By reducing variability not associated with the treatment being evaluated, CRN s provide a better understanding of treatment effects and risks.
DA - 2013/8//
PY - 2013/8//
DO - 10.1111/1475-6773.12044
VL - 48
IS - 4
SP - 1508-1525
SN - 0017-9124
KW - Variance reduction
KW - common random numbers
KW - cost-effectiveness modeling
KW - osteoporosis
ER -
TY - JOUR
TI - Transport costs and China's exports: Some empirical evidences
AU - Lizhi, Xu
AU - Shu-Cherng, Fang
AU - Xun, Zhang
T2 - JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
DA - 2013/6//
PY - 2013/6//
DO - 10.1007/s11424-013-1259-6
VL - 26
IS - 3
SP - 365-382
SN - 1559-7067
KW - Container throughput
KW - port efficiency
KW - the gravity model
KW - transport costs
ER -
TY - JOUR
TI - Traffic grooming in optical networks: Decomposition and partial linear programming (LP) relaxation
AU - Wang, H.
AU - Rouskas, G. N.
T2 - Journal of Optical Communications and Networking
AB - We consider the traffic grooming problem, a fundamental network design problem in optical networks. We review a typical integer linear program formulation considered in the literature, and we identify two challenges related to this formulation in terms of scalability and wavelength fragmentation. We then propose a new (to our knowledge) solution approach that decomposes the traffic grooming problem into two subproblems that are solved sequentially: 1) the virtual topology and traffic routing (VTTR) subproblem, which does not take into account physical topology constraints, and 2) the routing and wavelength assignment subproblem, which reconciles the virtual topology determined by VTTR with the physical topology. The decomposition is exact when the network is not wavelength limited. We also propose an algorithm that uses a partial linear programming relaxation technique driven by lightpath utilization information to solve the VTTR subproblem efficiently. Our approach delivers a desirable tradeoff between running time and quality of the final solution.
DA - 2013///
PY - 2013///
DO - 10.1364/jocn.5.000825
VL - 5
IS - 8
SP - 825–835
ER -
TY - JOUR
TI - Research directions in agent communication
AU - Chopra, Amit K.
AU - Artikis, Alexander
AU - Bentahar, Jamal
AU - Colombetti, Marco
AU - Dignum, Frank
AU - Fornara, Nicoletta
AU - Jones, Andrew J. I.
AU - Singh, Munindar P.
AU - Yolum, Pinar
T2 - ACM Transactions on Intelligent Systems and Technology
AB - Increasingly, software engineering involves open systems consisting of autonomous and heterogeneous participants or agents who carry out loosely coupled interactions. Accordingly, understanding and specifying communications among agents is a key concern. A focus on ways to formalize meaning distinguishes agent communication from traditional distributed computing: meaning provides a basis for flexible interactions and compliance checking. Over the years, a number of approaches have emerged with some essential and some irrelevant distinctions drawn among them. As agent abstractions gain increasing traction in the software engineering of open systems, it is important to resolve the irrelevant and highlight the essential distinctions, so that future research can be focused in the most productive directions. This article is an outcome of extensive discussions among agent communication researchers, aimed at taking stock of the field and at developing, criticizing, and refining their positions on specific approaches and future challenges. This article serves some important purposes, including identifying (1) points of broad consensus; (2) points where substantive differences remain; and (3) interesting directions of future work.
DA - 2013/3/1/
PY - 2013/3/1/
DO - 10.1145/2438653.2438655
VL - 4
IS - 2
SP - 1-23
J2 - TIST
LA - en
OP -
SN - 2157-6904
UR - http://dx.doi.org/10.1145/2438653.2438655
DB - Crossref
KW - Theory
KW - Communication
ER -
TY - JOUR
TI - Quantifying Plant Age and Available Water Effects on Soybean Leaf Conductance
AU - Matthews, Jessica L.
AU - Fiscus, Edwin L.
AU - Smith, Ralph C.
AU - Heitman, Joshua L.
T2 - AGRONOMY JOURNAL
AB - Given the ever‐present threat of drought and the knowledge that water availability is the strongest limiting factor in vegetation growth, it is important to characterize the effect of water limitations on agricultural production. In this study, a small field plot technique for controlling soil moisture content suitable for physiological research in moist, humid areas was tested. We characterized the effect of water stress on total leaf conductance ( g l ) for two distinct determinate soybean [ Glycine max (L.) Merr.] genotypes. Based on these findings, a model of g l as a function of plant age and soil moisture content was formulated and validated. The dependency of g l on plant age was well represented by a parabolic function that increased throughout the vegetative period, peaked around anthesis, and decreased throughout the reproductive period and senescence. A sigmoidal function explained the relation of g l to plant‐available soil water content. This new empirical model effectively quantifies the response of g l to plant‐available soil water and plant age with a functional form similar to the abscisic acid related Tardieu–Davies model.
DA - 2013///
PY - 2013///
DO - 10.2134/agronj2012.0263
VL - 105
IS - 1
SP - 28-36
SN - 1435-0645
ER -
TY - JOUR
TI - Introduction to Special Section on Trust in Multiagent Systems
AU - Falcone, Rino
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - No abstract available.
DA - 2013/3//
PY - 2013/3//
DO - 10.1145/2438653.2438658
VL - 4
IS - 2
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84876152255&partnerID=MN8TOARS
KW - Theory
KW - Trust
ER -
TY - JOUR
TI - Formalizing and Verifying Protocol Refinements
AU - Gerard, Scott N.
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - A (business) protocol describes, in high-level terms, a pattern of communication between two or more participants, specifically via the creation and manipulation of the commitments between them. In this manner, a protocol offers both flexibility and rigor: a participant may communicate in any way it chooses as long as it discharges all of its activated commitments. Protocols thus promise benefits in engineering cross-organizational business processes. However, software engineering using protocols presupposes a formalization of protocols and a notion of the refinement of one protocol by another. Refinement for protocols is both intuitively obvious (e.g., PayViaCheck is clearly a kind of Pay ) and technically nontrivial (e.g., compared to Pay , PayViaCheck involves different participants exchanging different messages). This article formalizes protocols and their refinement. It develops Proton, an analysis tool for protocol specifications that overlays a model checker to compute whether one protocol refines another with respect to a stated mapping. Proton and its underlying theory are evaluated by formalizing several protocols from the literature and verifying all and only the expected refinements.
DA - 2013/3//
PY - 2013/3//
DO - 10.1145/2438653.2438656
VL - 4
IS - 2
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84876124077&partnerID=MN8TOARS
KW - Algorithms
KW - Languages
KW - Theory
KW - Verification
KW - Commitments
KW - agent communication
KW - verification of multiagent systems
ER -
TY - JOUR
TI - Electric Power Allocation in a Network of Fast Charging Stations
AU - Bayram, I. Safak
AU - Michailidis, George
AU - Devetsikiotis, Michael
AU - Granelli, Fabrizio
T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
AB - In order to increase the penetration of electric vehicles, a network of fast charging stations that can provide drivers with a certain level of quality of service (QoS) is needed. However, given the strain that such a network can exert on the power grid, and the mobility of loads represented by electric vehicles, operating it efficiently is a challenging and complex problem. In this paper, we examine a network of charging stations equipped with an energy storage device and propose a scheme that allocates power to them from the grid, as well as routes customers. We examine three scenarios, gradually increasing their complexity. In the first one, all stations have identical charging capabilities and energy storage devices, draw constant power from the grid and no routing decisions of customers are considered. It represents the current state of affairs and serves as a baseline for evaluating the performance of the proposed scheme. In the second scenario, power to the stations is allocated in an optimal manner from the grid and in addition a certain percentage of customers can be routed to nearby stations. In the final scenario, optimal allocation of both power from the grid and customers to stations is considered. The three scenarios are evaluated using real traffic traces corresponding to weekday rush hour from a large metropolitan area in the US. The results indicate that the proposed scheme offers substantial improvements of performance compared to the current mode of operation; namely, more customers can be served with the same amount of power, thus enabling the station operators to increase their profitability. Further, the scheme provides guarantees to customers in terms of the probability of being blocked (and hence not served) by the closest charging station to their location. Overall, the paper addresses key issues related to the efficient operation, both from the perspective of the power grid and the drivers satisfaction, of a network of charging stations.
DA - 2013/7//
PY - 2013/7//
DO - 10.1109/jsac.2013.130707
VL - 31
IS - 7
SP - 1235-1246
SN - 1558-0008
KW - Electric Vehicles
KW - Stochastic Charging Station Model
KW - Performance Evaluation
ER -
TY - JOUR
TI - A two-stage method for inverse medium scattering
AU - Ito, Kazufumi
AU - Jin, Bangti
AU - Zou, Jun
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - We present a novel numerical method to the time-harmonic inverse medium scattering problem of recovering the refractive index from near-field scattered data. The approach consists of two stages, one pruning step of detecting the scatterer support, and one resolution enhancing step with mixed regularization. The first step is strictly direct and of sampling type, and faithfully detects the scatterer support. The second step is an innovative application of nonsmooth mixed regularization, and it accurately resolves the scatterer sizes as well as intensities. The model is efficiently solved by a semi-smooth Newton-type method. Numerical results for two- and three-dimensional examples indicate that the approach is accurate, computationally efficient, and robust with respect to data noise.
DA - 2013/3/15/
PY - 2013/3/15/
DO - 10.1016/j.jcp.2012.12.004
VL - 237
SP - 211-223
SN - 0021-9991
KW - Inverse medium scattering problem
KW - Reconstruction algorithm
KW - Direct sampling method
KW - Mixed regularization
KW - Semi-smooth Newton method
ER -
TY - JOUR
TI - A direct sampling method for inverse electromagnetic medium scattering
AU - Ito, Kazufumi
AU - Jin, Bangti
AU - Zou, Jun
T2 - INVERSE PROBLEMS
AB - In this paper, we study the inverse electromagnetic medium scattering problem of estimating the support and shape of medium scatterers from scattered electric or magnetic near-field data. We shall develop a novel direct sampling method based on an analysis of electromagnetic scattering and the behavior of the fundamental solution. The method is applicable even with one incident field and needs only to compute inner products of the measured scattered field with the fundamental solutions located at sampling points. Hence it is strictly direct, computationally very efficient, and highly tolerant to the presence of noise in the data. Two- and three-dimensional numerical experiments indicate that it can provide reliable support estimates of one single and multiple scatterers in case of both exact and highly noisy data.
DA - 2013/9//
PY - 2013/9//
DO - 10.1088/0266-5611/29/9/095018
VL - 29
IS - 9
SP -
SN - 1361-6420
ER -
TY - JOUR
TI - A Markov decision process-based policy characterization approach for a stochastic inventory control problem with unreliable sourcing
AU - Ahiska, S. Sebnem
AU - Appaji, Samyuktha R.
AU - King, Russell E.
AU - Warsing, Donald P., Jr.
T2 - INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
AB - We consider a single-product periodic-review inventory system for a retailer who has adopted a dual sourcing strategy to cope with potential supply process interruptions. Orders are placed to a perfectly reliable supplier and/or to a less reliable supplier that offers a better price. The success of an order placed to the unreliable supplier depends on his supply status that has a Markovian nature. The inventory control problem for this unreliable supply chain is modeled as a discrete-time Markov decision process (MDP) in order to find the optimal ordering decisions. Through numerical experimentation, the structure of the optimal ordering policy under several cost scenarios and different supplier reliability levels is determined. Four basic policy structures are found and are referred as case 1: order only from the unreliable supplier; case 2: order simultaneously from both suppliers or only from the unreliable supplier depending on the inventory level; case 3: order from one or the other but not both suppliers simultaneously; and case 4: order only from the reliable supplier. For all cases, (s, S)-like policies characterize perfectly the optimal ordering decisions due to the existence of the fixed ordering cost. Further experimentation is done to study the effects of changes in several system parameters (cost parameters such as fixed ordering cost, unit purchasing cost, backorder cost as well as the supplier reliability level) on the ordering policy and cost of the system.
DA - 2013/8//
PY - 2013/8//
DO - 10.1016/j.ijpe.2013.03.021
VL - 144
IS - 2
SP - 485-496
SN - 1873-7579
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84878827602&partnerID=MN8TOARS
KW - Unreliable supply
KW - Dual sourcing
KW - Inventory policy characterization
KW - Markov decision process
ER -
TY - JOUR
TI - Explicit pseudo-transient continuation
AU - Kelley, C. T.
AU - Liao, L. Z.
T2 - Pacific Journal of Optimization
DA - 2013///
PY - 2013///
VL - 9
IS - 1
SP - 77-91
ER -
TY - JOUR
TI - Switching fault-tolerant control of a flexible air-breathing hypersonic vehicle
AU - Wu, Fen
AU - Cai, Xuejing
T2 - PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART I-JOURNAL OF SYSTEMS AND CONTROL ENGINEERING
AB - In this paper, we will apply a switching fault-tolerant control approach to an air-breathing hypersonic vehicle subject to time-varying actuator and sensor faults. The faults under consideration include loss of effectiveness of the actuators and sensors. Possible fault scenarios are categorized into different fault cases based on the fault type and its location. For each case, a parameter-dependent (or constant gain) fault-tolerant control controller is designed to stabilize the faulty system with an optimal controlled performance. The synthesis condition of each local fault-tolerant control law is formulated in terms of linear matrix inequalities. To achieve both local optimal performance and switching stability, Youla parameterization of each individual local fault-tolerant control controller is performed and the result is applied to the closed-loop system. The quadratic stability of a fast switching closed-loop system is guaranteed by a common Lyapunov function. Simulation results based on the non-linear flexible hypersonic vehicle model and fault-tolerant linear-parameter-varying controllers are presented and the reults of these studies demonstrate the effectiveness of the proposed switching fault-tolerant control approach for application to a hypersonic vehicle.
DA - 2013/1//
PY - 2013/1//
DO - 10.1177/0959651812453914
VL - 227
IS - I1
SP - 24-38
SN - 2041-3041
KW - Fault-tolerant control
KW - hypersonic vehicle
KW - actuator and sensor faults
KW - switching and gain-scheduling control
KW - Youla parametrization
KW - L-2-gain optimization
KW - linear matrix inequality
ER -
TY - JOUR
TI - Simulation of Longitudinal Exposure Data with Variance-Covariance Structures Based on Mixed Models
AU - Song, Peng
AU - Xue, Jianping
AU - Li, Zhilin
T2 - RISK ANALYSIS
AB - Longitudinal data are important in exposure and risk assessments, especially for pollutants with long half-lives in the human body and where chronic exposures to current levels in the environment raise concerns for human health effects. It is usually difficult and expensive to obtain large longitudinal data sets for human exposure studies. This article reports a new simulation method to generate longitudinal data with flexible numbers of subjects and days. Mixed models are used to describe the variance-covariance structures of input longitudinal data. Based on estimated model parameters, simulation data are generated with similar statistical characteristics compared to the input data. Three criteria are used to determine similarity: the overall mean and standard deviation, the variance components percentages, and the average autocorrelation coefficients. Upon the discussion of mixed models, a simulation procedure is produced and numerical results are shown through one human exposure study. Simulations of three sets of exposure data successfully meet above criteria. In particular, simulations can always retain correct weights of inter- and intrasubject variances as in the input data. Autocorrelations are also well followed. Compared with other simulation algorithms, this new method stores more information about the input overall distribution so as to satisfy the above multiple criteria for statistical targets. In addition, it generates values from numerous data sources and simulates continuous observed variables better than current data methods. This new method also provides flexible options in both modeling and simulation procedures according to various user requirements.
DA - 2013/3//
PY - 2013/3//
DO - 10.1111/j.1539-6924.2012.01869.x
VL - 33
IS - 3
SP - 469-479
SN - 0272-4332
KW - Autocorrelation
KW - longitudinal data
KW - mixed models
KW - simulation
KW - variance-covariance structure
ER -
TY - BOOK
TI - The Eighth Chinese Symposium on Mathematical Programming
AU - Bai, Yanqin
AU - Fang, Shu-Cherng
AU - Fang, Weiwu
AU - Han, Jiye
AU - Xiu, Naihua
A3 - Feng, Shu-Cherng
A3 - Bai, Y.
A3 - Fang, W.
A3 - Han, J.
A3 - Xiu, N.
DA - 2013///
PY - 2013///
DO - 10.1080/02331934.2013.795052
VL - 62
SE - 429-430
ER -
TY - JOUR
TI - Patient-specific modeling of cardiovascular and respiratory dynamics during hypercapnia
AU - Ellwein, L. M.
AU - Pope, S. R.
AU - Xie, A.
AU - Batzel, J. J.
AU - Kelley, C. T.
AU - Olufsen, M. S.
T2 - MATHEMATICAL BIOSCIENCES
AB - This study develops a lumped cardiovascular-respiratory system-level model that incorporates patient-specific data to predict cardiorespiratory response to hypercapnia (increased CO(2) partial pressure) for a patient with congestive heart failure (CHF). In particular, the study focuses on predicting cerebral CO(2) reactivity, which can be defined as the ability of vessels in the cerebral vasculature to expand or contract in response CO(2) induced challenges. It is difficult to characterize cerebral CO(2) reactivity directly from measurements, since no methods exist to dynamically measure vasomotion of vessels in the cerebral vasculature. In this study we show how mathematical modeling can be combined with available data to predict cerebral CO(2) reactivity via dynamic predictions of cerebral vascular resistance, which can be directly related to vasomotion of vessels in the cerebral vasculature. To this end we have developed a coupled cardiovascular and respiratory model that predicts blood pressure, flow, and concentration of gasses (CO(2) and O(2)) in the systemic, cerebral, and pulmonary arteries and veins. Cerebral vascular resistance is incorporated via a model parameter separating cerebral arteries and veins. The model was adapted to a specific patient using parameter estimation combined with sensitivity analysis and subset selection. These techniques allowed estimation of cerebral vascular resistance along with other cardiovascular and respiratory parameters. Parameter estimation was carried out during eucapnia (breathing room air), first for the cardiovascular model and then for the respiratory model. Then, hypercapnia was introduced by increasing inspired CO(2) partial pressure. During eucapnia, seven cardiovascular parameters and four respiratory parameters was be identified and estimated, including cerebral and systemic resistance. During the transition from eucapnia to hypercapnia, the model predicted a drop in cerebral vascular resistance consistent with cerebral vasodilation.
DA - 2013/1//
PY - 2013/1//
DO - 10.1016/j.mbs.2012.09.003
VL - 241
IS - 1
SP - 56-74
SN - 1879-3134
KW - Sensitivity analysis
KW - Parameter estimation
KW - Physiological models
KW - Cerebral blood flow
KW - Complex models
ER -
TY - JOUR
TI - Optimal control laws for traffic flow
AU - Aihara, K.
AU - Ito, K.
AU - Nakagawa, J.
AU - Takeuchi, T.
T2 - APPLIED MATHEMATICS LETTERS
AB - Optimal “on–off” laws for the traffic signals are developed based on the bilinear control problem with the binary constraints. A Lyapunov function based feedback law for regulating traffic congestions is developed. Also, a real-time optimal signal law is developed using a novel binary optimization method. Both methods are tested and compared, and our tests demonstrate that the both methods provide very effective and efficient traffic control laws.
DA - 2013/6//
PY - 2013/6//
DO - 10.1016/j.aml.2012.12.021
VL - 26
IS - 6
SP - 617-623
SN - 0893-9659
KW - Traffic signal control
KW - Binary optimization
KW - Lyapunov method
KW - Real time optimal control
ER -
TY - JOUR
TI - On the numerical treatment of linear-quadratic optimal control problems for general linear time-varying differential-algebraic equations
AU - Campbell, Stephen L.
AU - Kunkel, Peter
T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
AB - The development of numerical methods for finding optimal solutions of control problems modeled by differential-algebraic equations (DAEs) is an important task. Usually restrictions are placed on the DAE such as being semi-explicit. Here the numerical solution of optimal control problems with linear time-varying DAEs as the process and quadratic cost functionals is considered. The leading coefficient is allowed to be time-varying and the DAE may be of higher index. Both a direct transcription approach and the solution of the necessary conditions are examined for two important discretizations.
DA - 2013/4//
PY - 2013/4//
DO - 10.1016/j.cam.2012.10.011
VL - 242
SP - 213-231
SN - 1879-1778
KW - Differential-algebraic equation
KW - Optimal control
KW - Radau
KW - Gauss-Lobatto
KW - Direct transcription
KW - Numerical methods
ER -
TY - JOUR
TI - Numerical simulation of water resources problems: Models, methods, and trends
AU - Miller, Cass T.
AU - Dawson, Clint N.
AU - Farthing, Matthew W.
AU - Hou, Thomas Y.
AU - Huang, Jingfang
AU - Kees, Christopher E.
AU - Kelley, C. T.
AU - Langtangen, Hans Petter
T2 - ADVANCES IN WATER RESOURCES
AB - Mechanistic modeling of water resources systems is a broad field with abundant challenges. We consider classes of model formulations that are considered routine, the focus of current work, and the foundation of foreseeable work over the coming decade. These model formulations are used to assess the current and evolving state of solution algorithms, discretization methods, nonlinear and linear algebraic solution methods, computational environments, and hardware trends and implications. The goal of this work is to provide guidance to enable modelers of water resources systems to make sensible choices when developing solution methods based upon the current state of knowledge and to focus future collaborative work among water resources scientists, applied mathematicians, and computational scientists on productive areas.
DA - 2013/1//
PY - 2013/1//
DO - 10.1016/j.advwatres.2012.05.008
VL - 51
SP - 405-437
SN - 1872-9657
KW - Adaptive methods
KW - Problem solving environments
KW - Multiscale methods
KW - Integral methods
KW - GPUs
KW - Error estimation and control
ER -
TY - JOUR
TI - Network Virtualization: Technologies, Perspectives, and Frontiers
AU - Wang, Anjing
AU - Iyer, Mohan
AU - Dutta, Rudra
AU - Rouskas, George N.
AU - Baldine, Ilia
T2 - JOURNAL OF LIGHTWAVE TECHNOLOGY
AB - Network virtualization refers to a broad set of technologies. Commercial solutions have been offered by the industry for years, while more recently the academic community has emphasized virtualization as an enabler for network architecture research, deployment, and experimentation. We review the entire spectrum of relevant approaches with the goal of identifying the underlying commonalities. We offer a unifying definition of the term “network virtualization” and examine existing approaches to bring out this unifying perspective. We also discuss a set of challenges and research directions that we expect to come to the forefront as network virtualization technologies proliferate.
DA - 2013/2/15/
PY - 2013/2/15/
DO - 10.1109/jlt.2012.2213796
VL - 31
IS - 4
SP - 523-537
SN - 1558-2213
KW - Network architecture
KW - network virtualization
ER -
TY - JOUR
TI - Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
AU - Tian, Ye
AU - Fang, Shu-Cherng
AU - Deng, Zhibin
AU - Xing, Wenxun
T2 - Journal of Industrial and Management Optimization
AB - In this paper, we provide a computable representation of the cone of nonnegative quadratic forms over a general nontrivial second-order cone using linear matrix inequalities (LMI). By constructing a sequence of such computable cones over a union of second-order cones, an efficient algorithm is designed to find an approximate solution to a completely positive programming problem using semidefinite programming techniques. In order to accelerate the convergence of the approximation sequence, an adaptive scheme is adopted, and ``reformulation-linearization technique'' (RLT) constraints are added to further improve its efficiency.
DA - 2013/4//
PY - 2013/4//
DO - 10.3934/jimo.2013.9.701
VL - 9
IS - 3
SP - 701-719
J2 - JIMO
LA - en
OP -
SN - 1547-5816
UR - http://dx.doi.org/10.3934/jimo.2013.9.701
DB - Crossref
ER -
TY - JOUR
TI - Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers
AU - Jiang, Zhong-Zhong
AU - Fang, Shu-Cherng
AU - Fan, Zhi-Ping
AU - Wang, Dingwei
T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
AB - The advancement of Internet technology has enabled new formats for selling products in the B2C online auctions. At present, on the major online auction sites, there exist three popular selling formats, namely, the posted price, pure auction and buy-price auction formats. It is an important decision problem for a firm to select the most profitable format to sell its products through the Internet. The customer behavior is of course a crucial element of the decision process. To the best of our knowledge, most models available today assume that customers are perfectly rational. To better understand the decision process, in this paper, we incorporate the concept of bounded rationality into consideration. We first present a “behavior choice function” to characterize the behavior of the customers with bounded rationality. Then corresponding to each selling format, we construct a revenue model based on the bounded rationality for analysis. Finally, we conduct some elaborate computational experiments to investigate the performance of each revenue model for developing new managerial insights. Our computational results clearly demonstrate how the bounded rationality of customer behavior affects the choice of a preferable selling format for a B2C firm in an online auction.
DA - 2013/4/1/
PY - 2013/4/1/
DO - 10.1016/j.ejor.2012.10.003
VL - 226
IS - 1
SP - 139-153
SN - 1872-6860
KW - E-commerce
KW - Bounded rationality
KW - Customer behavior
KW - Online auctions
KW - Revenue management
ER -
TY - JOUR
TI - Scheduling Partition for Order Optimal Capacity in Large-Scale Wireless Networks
AU - Xu, Yi
AU - Wang, Wenye
T2 - IEEE TRANSACTIONS ON MOBILE COMPUTING
AB - The capacity scaling property specifies the change of network throughput when network size increases. It serves as an essential performance metric in large-scale wireless networks. Existing results have been obtained based on the assumption of using a globally planned link transmission schedule in the network, which is however not feasible in large wireless networks due to the scheduling complexity. The gap between the well-known capacity results and the infeasible assumption on link scheduling potentially undermines our understanding of the achievable network capacity. In this paper, we propose the scheduling partition methodology that decomposes a large network into small autonomous scheduling zones and implements a localized scheduling algorithm independently in each partition. We prove the sufficient and the necessary conditions for the scheduling partition approach to achieve the same order of capacity as the widely assumed global scheduling strategy. In comparison to the network dimension $(\sqrt{n})$, scheduling partition size $(\Theta (r(n)))$ is sufficient to obtain the optimal capacity scaling, where $(r(n))$ is the node transmission radius and much smaller than $(\sqrt{n})$. We finally propose a distributed partition protocol and a localized scheduling algorithm as our scheduling solution for maximum capacity in large wireless networks.
DA - 2013/4//
PY - 2013/4//
DO - 10.1109/tmc.2012.113
VL - 12
IS - 4
SP - 666-679
SN - 1536-1233
KW - Wireless multihop networks
KW - capacity scaling
KW - link scheduling
KW - network decomposition
KW - network design
ER -
TY - JOUR
TI - Rational lecture hall polytopes and inflated Eulerian polynomials
AU - Pensyl, ThomasW.
AU - Savage, Carla D.
T2 - RAMANUJAN JOURNAL
DA - 2013/6//
PY - 2013/6//
DO - 10.1007/s11139-012-9393-7
VL - 31
IS - 1-2
SP - 97-114
SN - 1382-4090
KW - Lecture hall partitions
KW - Eulerian polynomials
KW - Ehrhart theory
ER -
TY - JOUR
TI - Protecting Sensitive Labels in Social Network Data Anonymization
AU - Yuan, Mingxuan
AU - Chen, Lei
AU - Yu, Philip S.
AU - Yu, Ting
T2 - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
AB - Privacy is one of the major concerns when publishing or sharing social network data for social science research and business analysis. Recently, researchers have developed privacy models similar to k-anonymity to prevent node reidentification through structure information. However, even when these privacy models are enforced, an attacker may still be able to infer one's private information if a group of nodes largely share the same sensitive labels (i.e., attributes). In other words, the label-node relationship is not well protected by pure structure anonymization methods. Furthermore, existing approaches, which rely on edge editing or node clustering, may significantly alter key graph properties. In this paper, we define a k-degree-l-diversity anonymity model that considers the protection of structural information as well as sensitive labels of individuals. We further propose a novel anonymization methodology based on adding noise nodes. We develop a new algorithm by adding noise nodes into the original graph with the consideration of introducing the least distortion to graph properties. Most importantly, we provide a rigorous analysis of the theoretical bounds on the number of noise nodes added and their impacts on an important graph property. We conduct extensive experiments to evaluate the effectiveness of the proposed technique.
DA - 2013/3//
PY - 2013/3//
DO - 10.1109/tkde.2011.259
VL - 25
IS - 3
SP - 633-647
SN - 1558-2191
KW - Social networks
KW - privacy
KW - anonymous
ER -
TY - JOUR
TI - Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
AU - Deng, Zhibin
AU - Fang, Shu-Cherng
AU - Jin, Qingwei
AU - Xing, Wenxun
T2 - European Journal of Operational Research
AB - It is co-NP-complete to decide whether a given matrix is copositive or not. In this paper, this decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of nonnegative quadratic functions over the union of a collection of ellipsoids. Using linear matrix inequalities (LMI) representations, each corresponding problem in the sequence can be solved via semidefinite programming. In order to speed up the convergence of the approximation sequence and to relieve the computational effort of solving linear conic programming problems, an adaptive approximation scheme is adopted to refine the union of ellipsoids. The lower and upper bounds of the transformed quadratic programming problem are used to determine the copositivity of the given matrix.
DA - 2013/8//
PY - 2013/8//
DO - 10.1016/j.ejor.2013.02.031
VL - 229
IS - 1
SP - 21-28
J2 - European Journal of Operational Research
LA - en
OP -
SN - 0377-2217
UR - http://dx.doi.org/10.1016/j.ejor.2013.02.031
DB - Crossref
KW - Conic programming
KW - Copositive
KW - Cone of nonnegative quadratic functions
KW - Adaptive approximation scheme
ER -
TY - JOUR
TI - Cyber security in the Smart Grid: Survey and challenges
AU - Wang, Wenye
AU - Lu, Zhuo
T2 - COMPUTER NETWORKS
AB - The Smart Grid, generally referred to as the next-generation power system, is considered as a revolutionary and evolutionary regime of existing power grids. More importantly, with the integration of advanced computing and communication technologies, the Smart Grid is expected to greatly enhance efficiency and reliability of future power systems with renewable energy resources, as well as distributed intelligence and demand response. Along with the silent features of the Smart Grid, cyber security emerges to be a critical issue because millions of electronic devices are inter-connected via communication networks throughout critical power facilities, which has an immediate impact on reliability of such a widespread infrastructure. In this paper, we present a comprehensive survey of cyber security issues for the Smart Grid. Specifically, we focus on reviewing and discussing security requirements, network vulnerabilities, attack countermeasures, secure communication protocols and architectures in the Smart Grid. We aim to provide a deep understanding of security vulnerabilities and solutions in the Smart Grid and shed light on future research directions for Smart Grid security.
DA - 2013/4/7/
PY - 2013/4/7/
DO - 10.1016/j.comnet.2012.12.017
VL - 57
IS - 5
SP - 1344-1371
SN - 1872-7069
KW - Smart Grid
KW - Cyber security
KW - Attacks and countermeasures
KW - Cryptography
KW - Security protocols
ER -
TY - JOUR
TI - A Generalized Markov Graph Model: Application to Social Network Analysis
AU - Wang, Tian
AU - Krim, Hamid
AU - Viniotis, Yannis
T2 - IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
AB - In this paper we propose a generalized Markov Graph model for social networks and evaluate its application in social network synthesis, and in social network classification. The model reveals that the degree distribution, the clustering coefficient distribution as well as a newly discovered feature, a crowding coefficient distribution, are fundamental to characterizing a social network. The application of this model to social network synthesis leads to a capacity to generate networks dominated by the degree distribution and the clustering coefficient distribution. Another application is a new social network classification method based on comparing the statistics of their degree distributions and clustering coefficient distributions as well as their crowding coefficient distributions. In contrast to the widely held belief that a social network graph is solely defined by its degree distribution, the novelty of this paper consists in establishing the strong dependence of social networks on the degree distribution, the clustering coefficient distribution and the crowding coefficient distribution, and in demonstrating that they form minimal information to classify social networks as well as to design a new social network synthesis tool. We provide numerous experiments with published data and demonstrate very good performance on both counts.
DA - 2013/4//
PY - 2013/4//
DO - 10.1109/jstsp.2013.2246767
VL - 7
IS - 2
SP - 318-332
SN - 1941-0484
KW - Complex networks
KW - pattern recognition
KW - classification
KW - Markov graph model
ER -
TY - JOUR
TI - Numerical Poisson-Boltzmann model for continuum membrane systems
AU - Botello-Smith, Wesley M.
AU - Liu, Xingping
AU - Cai, Qin
AU - Li, Zhilin
AU - Zhao, Hongkai
AU - Luo, Ray
T2 - CHEMICAL PHYSICS LETTERS
AB - Membrane protein systems are important computational research topics due to their roles in rational drug design. In this study, we developed a continuum membrane model utilizing a level set formulation under the numerical Poisson-Boltzmann framework within the AMBER molecular mechanics suite for applications such as protein-ligand binding affinity and docking pose predictions. Two numerical solvers were adapted for periodic systems to alleviate possible edge effects. Validation on systems ranging from organic molecules to membrane proteins up to 200 residues, demonstrated good numerical properties. This lays foundations for sophisticated models with variable dielectric treatments and second-order accurate modeling of solvation interactions.
DA - 2013/1/3/
PY - 2013/1/3/
DO - 10.1016/j.cplett.2012.10.081
VL - 555
SP - 274-281
SN - 1873-4448
ER -
TY - JOUR
TI - An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems
AU - Zhang, LiPing
AU - Fang, Shu-Cherng
AU - Wu, Soon-Yi
T2 - Science China Mathematics
DA - 2013/1//
PY - 2013/1//
DO - 10.1007/s11425-012-4502-z
VL - 56
IS - 1
SP - 201–211
SN - 1674-7283 1869-1862
UR - http://dx.doi.org/10.1007/s11425-012-4502-z
KW - semi-infinite programming
KW - min-max problem
KW - central cutting plane
KW - entropy
ER -
TY - CONF
TI - Two-stage stochastic view selection for data-analysis queries
AU - Huang, R.
AU - Chirkova, R.
AU - Fathi, Y.
C2 - 2013///
C3 - Advances in databases and information systems
DA - 2013///
VL - 186
SP - 115-123
ER -
TY - JOUR
TI - The impact of simultaneous continuous improvement in setup time and repair time on manufacturing cycle times under uncertain conditions
AU - Godinho Filho, Moacir
AU - Uzsoy, Reha
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - We develop a system dynamics model to examine the cumulative effects of continuous improvement programmes for repair and setup times on the cycle time of a simple single-stage production system. The relationship between system performance and repair and setup times is captured using the Factory Physics approach. We find that modest rates of improvement in multiple areas in parallel yield cumulative benefits over time comparable with those obtained by a large reduction in a single parameter, especially when there is significant uncertainty in the degree of improvement that can be obtained, or in the degree to which improvements can be sustained over time. These results provide an insight into the success of the Toyota Production System and related lean manufacturing approaches where continuous improvement is an ongoing activity across the work environment.
DA - 2013///
PY - 2013///
DO - 10.1080/00207543.2011.652261
VL - 51
IS - 2
SP - 447-464
SN - 1366-588X
KW - continuous improvement
KW - setup time
KW - repair time
KW - manufacturing
KW - cycle times
KW - system dynamics
ER -
TY - JOUR
TI - Exploring a charge-central strategy in the solution of Poisson's equation for biomolecular applications
AU - Liu, Xingping
AU - Wang, Changhao
AU - Wang, Jun
AU - Li, Zhilin
AU - Zhao, Hongkai
AU - Luo, Ray
T2 - PHYSICAL CHEMISTRY CHEMICAL PHYSICS
AB - Continuum solvent treatments based on the Poisson–Boltzmann equation have been widely accepted for energetic analysis of biomolecular systems. In these approaches, the molecular solute is treated as a low dielectric region and the solvent is treated as a high dielectric continuum. The existence of a sharp dielectric jump at the solute–solvent interface poses a challenge to model the solvation energetics accurately with such a simple mathematical model. In this study, we explored and evaluated a strategy based on the “induced surface charge” to eliminate the dielectric jump within the finite-difference discretization scheme. In addition to the use of the induced surface charges in solving the equation, the second-order accurate immersed interface method is also incorporated to discretize the equation. The resultant linear system is solved with the GMRES algorithm to explicitly impose the flux conservation condition across the solvent–solute interface. The new strategy was evaluated on both analytical and realistic biomolecular systems. The numerical tests demonstrate the feasibility of utilizing induced surface charge in the finite-difference solution of the Poisson–Boltzmann equation. The analysis data further show that the strategy is consistent with theory and the classical finite-difference method on the tested systems. Limitations of the current implementations and further improvements are also analyzed and discussed to fully bring out its potential of achieving higher numerical accuracy.
DA - 2013///
PY - 2013///
DO - 10.1039/c2cp41894k
VL - 15
IS - 1
SP - 129-141
SN - 1463-9084
ER -
TY - JOUR
TI - Comparing traditional and fuzzy-set solutions to (Q, r) inventory systems with discrete lead-time distributions
AU - Wu, X. M.
AU - Warsing, D. P.
T2 - Journal of Intelligent & Fuzzy Systems
DA - 2013///
PY - 2013///
VL - 24
IS - 1
SP - 93-104
ER -
TY - JOUR
TI - An effective lower bound on Lmax in a worker-constrained job shop
AU - Lobo, Benjamin J.
AU - Hodgson, Thom J.
AU - King, Russell E.
AU - Thoney, Kristin A.
AU - Wilson, James R.
T2 - Computers & Operations Research
AB - A common industrial operation is a dual resource constrained job shop where: (a) the objective is to minimize L max , the maximum job lateness; (b) machines are organized into groups; and (c) each worker is assigned to a specific machine group. Because this problem is NP-hard, finding optimal solutions by enumeration is impractical. This paper details a procedure to compute a lower bound on L max that will be used in follow-up work to effectively evaluate the absolute performance of heuristic solutions. Given an allocation of workers to machine groups, a lower bound on L max is first computed for each machine group using a network-flow formulation. The lower bound on L max for the job shop is the largest of the lower bounds for the machine groups. A search algorithm then finds a worker allocation yielding the smallest such lower bound on L max for the job shop; and the latter quantity is our proposed lower bound on L max . Given a worker allocation, we use the Virtual Factory (a heuristic scheduler developed by Hodgson et al. in 1998) to generate a schedule. Experiments with a wide variety of job shops indicated that the proposed lower bound on L max could often be achieved by a Virtual Factory schedule based on the worker allocation yielding this lower bound. However, there were problem instances for which other worker allocations enabled the Virtual Factory to generate better schedules. Follow-up work provides optimality criteria, and heuristics to find improved allocations if these criteria are not satisfied.
DA - 2013/1//
PY - 2013/1//
DO - 10.1016/j.cor.2012.07.003
VL - 40
IS - 1
SP - 328-343
J2 - Computers & Operations Research
LA - en
OP -
SN - 0305-0548
UR - http://dx.doi.org/10.1016/j.cor.2012.07.003
DB - Crossref
KW - Job shop scheduling
KW - Dual resource constrained systems
KW - Maximum lateness
KW - Worker allocation
ER -