TY - CONF
TI - A Column Generation Approach for MultipleProduct Dynamic Lot Sizing with Congestion
AU - Kang, Y.
AU - Albey, E.
AU - Uzsoy, R.
T2 - International Workshop on Lot Sizing, Haute Etudes Commercial
C2 - 2015/8//
CY - Montreal, Canada
DA - 2015/8//
PY - 2015/8//
ER -
TY -
ER -
TY -
ER -
TY - JOUR
TI - A random keys genetic algorithm for a bicriterion project selection and scheduling problem
AU - Summerville, Natalia
AU - Uzsoy, Reha
AU - Gaytán, Juan
T2 - International Journal of Planning and Scheduling
AB - The project selection and scheduling problem involves the allocation of limited resources to competing projects over time to optimise a given objective function. However, in practical applications, multiple criteria need to be considered, leading us to formulate the problem as a multiple objective combinatorial optimisation (MOCO) model. Activities are subject to precedence constraints, as well as a budget limiting the capital available in each planning period. Interdependencies between projects by which the selection of specific subsets of projects may result in cost savings are also represented. We propose a genetic algorithm incorporating random keys and an efficient decoding procedure into the well-known NSGA-II procedure. The performance of this algorithm is evaluated in extensive computational experiments comparing the approximations of the Pareto-optimal set it obtains to those from NSGA-II.
DA - 2015///
PY - 2015///
DO - 10.1504/ijps.2015.072105
VL - 2
IS - 2
SP - 110
J2 - IJPS
LA - en
OP -
SN - 2044-494X 2044-4958
UR - http://dx.doi.org/10.1504/ijps.2015.072105
DB - Crossref
ER -
TY - JOUR
TI - A multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning approach
AU - Fan, Wen-Juan
AU - Yang, Shan-Lin
AU - Perros, Harry
AU - Pei, Jun
T2 - International Journal of Automation and Computing
AB - In the last few years, cloud computing as a new computing paradigm has gone through significant development, but it is also facing many problems. One of them is the cloud service selection problem. As increasingly boosting cloud services are offered through the internet and some of them may be not reliable or even malicious, how to select trustworthy cloud services for cloud users is a big challenge. In this paper, we propose a multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning (ER) approach that integrates both perception-based trust value and reputation based trust value, which are derived from direct and indirect trust evidence respectively, to identify trustworthy services. Here, multi-dimensional trust evidence, which reflects the trustworthiness of cloud services from different aspects, is elicited in the form of historical users’ feedback ratings. Then, the ER approach is applied to aggregate the multi-dimensional trust ratings to obtain the real-time trust value and select the most trustworthy cloud service of certain type for the active users. Finally, the fresh feedback from the active users will update the trust evidence for other service users in the future.
DA - 2015///
PY - 2015///
DO - 10.1007/S11633-014-0840-3
VL - 12
IS - 2
SP - 208–219
SN - 1476-8186 1751-8520
UR - http://dx.doi.org/10.1007/S11633-014-0840-3
KW - Cloud service selection
KW - multi-dimensional trust evidence
KW - trust and reputation evaluation
KW - evidential reasoning (ER)
KW - clond service trustworthiness
ER -
TY - CONF
TI - Optimization of Logging Residue Drying for Energy Products
AU - Hopkins, Chris
AU - Roise, Joseph
T2 - 16th Symposium on Systems Analysis in Forest Resources
C2 - 2015/8/19/
CY - Uppsala, Sweden
DA - 2015/8/19/
PY - 2015/8/19/
UR - https://www.skogforsk.se/cd_20190114162235/contentassets/d77a684b898a446b9bacdf086acae8ae/joseph-roise3-ssafr-2015.pdf
ER -
TY - CONF
TI - Multiple Objective Tradeoff Analysis between Timber NPV and Carbon Storage and Sequestration
AU - Roise, Joseph
AU - Mohan, M.
AU - Chung, Woodam
AU - Catts, Glenn
AU - Posse, Juan P.
AU - Shen
AU - Harnish, Kevin
AU - Scolforo, Henrique
AU - Kanieski da Silva, Bruno
AU - McCarter, James
T2 - Symposium on Systems Analysis in Forest Resources
C2 - 2015/8/19/
CY - Uppsala, Sweden
DA - 2015/8/19/
PY - 2015/8/19/
ER -
TY - CONF
TI - Implementation of Wildland Fire Science in the United States
AU - Roise, J.P.
T2 - 6th International Wildland Fire Conference
C2 - 2015/10/12/
CY - Pyeongchang, Gangwon, Republic of Korea
DA - 2015/10/12/
PY - 2015/10/12/
ER -
TY - JOUR
TI - Transportation System and Trade Flows in Port Cities of China: A Random Coefficient Model
AU - Xu, Lizhi
AU - Fang, Shu-Cherng
AU - Lai, Kin Keung
AU - Qiao, Han
AU - Wang, Shouyang
T2 - Journal of Systems Science and Information
AB - Abstract This paper quantitatively investigates the effect of transportation system on trade flows of four major port cities in China. Due to the significant country-pair heterogeneities in both intercept and slope terms, this paper introduced a random-coefficients model for parameters estimation. The empirical findings imply that the impact of the explanatory variables included in the gravity equation could be inaccurately estimated if the pair-wise heterogeneity biases in both intercept and slope terms are not accounted for during the econometric estimation of the model. In particular, in the presence of this heterogeneity, parameter estimates tend to be underestimated for country-pairs with higher trade volume and overestimated for those country-pairs with lower trade volume. In addition, the empirical results suggest that the improvement transportation system in port cities of China offers greater scope for its trade competitiveness.
DA - 2015/8/25/
PY - 2015/8/25/
DO - 10.1515/jssi-2015-0289
VL - 3
IS - 4
SP - 289-300
OP -
SN - 2512-6660
UR - http://dx.doi.org/10.1515/jssi-2015-0289
DB - Crossref
ER -
TY - JOUR
TI - The Biobased Products Industry: Reflections and Insights from a Multi-Year Empirical and Modeling Evaluation for the Congress of the United States
AU - Handfield, R.B.
AU - Golden, J.S.
T2 - Industrial Biotechnology
AB - Industrial BiotechnologyVol. 11, No. 4 CommentaryThe Biobased Products Industry: Reflections and Insights from a Multi-Year Empirical and Modeling Evaluation for the Congress of the United StatesRobert B. Handfield and Jay S. GoldenRobert B. HandfieldSupply Chain Resource Cooperative-Poole College of Management, North Carolina State University, Raleigh, NCSearch for more papers by this author and Jay S. GoldenDuke Center for Sustainability & Commerce-Nicholas School of the Environment, Duke University, Durham, NCSearch for more papers by this authorPublished Online:7 Aug 2015https://doi.org/10.1089/ind.2015.29006.rbhAboutSectionsView articleView Full TextPDF/EPUB Permissions & CitationsPermissionsDownload CitationsTrack CitationsAdd to favorites Back To Publication ShareShare onFacebookTwitterLinked InRedditEmail View articleFiguresReferencesRelatedDetailsCited byScaling up of renewable chemicalsCurrent Opinion in Biotechnology, Vol. 38 Volume 11Issue 4Aug 2015 InformationCopyright 2015, Mary Ann Liebert, Inc.To cite this article:Robert B. Handfield and Jay S. Golden.The Biobased Products Industry: Reflections and Insights from a Multi-Year Empirical and Modeling Evaluation for the Congress of the United States.Industrial Biotechnology.Aug 2015.183-187.http://doi.org/10.1089/ind.2015.29006.rbhPublished in Volume: 11 Issue 4: August 7, 2015PDF download
DA - 2015///
PY - 2015///
DO - 10.1089/ind.2015.29006.rbh
VL - 11
IS - 4
SP - 183-187
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84938856041&partnerID=MN8TOARS
ER -
TY - CONF
TI - The economic impact of the biobased products industry
AU - Lewis, E.E.
AU - Werner, A.S.
AU - Hester, C.I.
AU - Chu, J.
AU - Golden, J.S.
AU - Daystar, J.
AU - Handfield, R.B.
AU - McConnell, E.
AU - Buckhalt, R.B.
AU - Wheat, M.
C2 - 2015///
C3 - Proceedings of the Air and Waste Management Association's Annual Conference and Exhibition, AWMA
DA - 2015///
VL - 4
SP - 2787-2791
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84983565608&partnerID=MN8TOARS
ER -
TY - JOUR
TI - An Economic Impact Analysis of the US Biobased Products Industry: A Report to the Congress of the United States of America
AU - Golden, J.S.
AU - Handfield, R.B.
AU - Daystar, J.
AU - McConnell, T.E.
T2 - Industrial Biotechnology
AB - Industrial BiotechnologyVol. 11, No. 4 Industry ReportAn Economic Impact Analysis of the US Biobased Products Industry: A Report to the Congress of the United States of AmericaJay S. Golden, Robert B. Handfield, Jesse Daystar, and T. Eric McConnellJay S. GoldenCenter for Sustainability & Commerce, Duke University, Durham, NCSearch for more papers by this author, Robert B. HandfieldSupply Chain Resource Cooperative, North Carolina State University, Raleigh, NCSearch for more papers by this author, Jesse DaystarCenter for Sustainability & Commerce, Duke University, Durham, NCSearch for more papers by this author, and T. Eric McConnellDepartment of Forest Biomaterials, North Carolina State University, Raleigh, NCSearch for more papers by this authorPublished Online:7 Aug 2015https://doi.org/10.1089/ind.2015.29002.jsgAboutSectionsView articleView Full TextPDF/EPUB Permissions & CitationsPermissionsDownload CitationsTrack CitationsAdd to favorites Back To Publication ShareShare onFacebookTwitterLinked InRedditEmail View articleFiguresReferencesRelatedDetailsCited byProduction of Recombinant Biopharmaceuticals in Chlamydomonas reinhardtii29 December 2022 | International Journal of Plant Biology, Vol. 14, No. 1Mushroom Packages10 October 2022Consumer Preferences in Greece for Bio-Based Products: a Short Communication13 October 2022 | Circular Economy and Sustainability, Vol. 11Organic food and Instagram health and wellbeing influencers: an emerging country's perspective with gender as a moderator21 June 2022 | British Food Journal, Vol. 38Building blend from recycling acrylonitrile–butadiene–styrene and high impact-resistance polystyrene through dextro-glucoseReactive and Functional Polymers, Vol. 175Extremophiles as Gold Mines for Bioprospecting22 April 2022Inattention, availability bias, and attribute premium estimation for a biobased product20 September 2021 | Agricultural Economics, Vol. 53, No. 2Efficacy, economics, and sustainability of bio-based insecticides from thermochemical biorefineries1 January 2021 | Green Chemistry, Vol. 23, No. 24Remote Sensing-Based Estimation of Advanced Perennial Grass Biomass Yields for Bioenergy10 November 2021 | Land, Vol. 10, No. 11One-Pot Terpolymerization Synthesis of High Carbon Biocontent Recyclable Epoxy Thermosets and Their Composites with Flax Woven Fibers14 June 2021 | ACS Sustainable Chemistry & Engineering, Vol. 9, No. 25A Cross-Country Measurement of the EU Bioeconomy: An Input–Output Approach10 March 2021 | Sustainability, Vol. 13, No. 6Forest to Mill Timber Price Trends and Volatility for Mississippi Timber Products16 June 2021 | Forest Products Journal, Vol. 71, No. 2The Global Demand for Biofuels and Biotechnology‐Derived Commodity Chemicals3 April 2020Rank-Ordered Analysis of Consumer Preferences for the Attributes of a Value-Added Biofuel Co-Product18 March 2020 | Sustainability, Vol. 12, No. 6Enabling Bioeconomy with Offshore Macroalgae Biorefineries15 October 2019PerspectivesEconomic Impacts of Value Addition to Agricultural Byproducts18 November 2019Low-Carbon Futures for Bioethylene in the United States22 May 2019 | Energies, Vol. 12, No. 10Gender Perspectives on Forest Services in the Rise of a Bioeconomy Discourse6 November 2019TERMINOLOGICAL APPARATUS IN THE FIELD OF BIOECONOMY1 January 2019 | Trakia Journal of Sciences, Vol. 17, No. Suppl.1A framework for the identification of promising bio‐based chemicals10 July 2018 | Biotechnology and Bioengineering, Vol. 115, No. 9BioProducts Business, Vol. 3, No. 5Techno-economic analysis of butanol production from lignocellulosic biomass by concentrated acid pretreatment and hydrolysis plus continuous fermentationBiochemical Engineering Journal, Vol. 134Fast Pyrolysis of Opuntia ficus-indica (Prickly Pear) and Grindelia squarrosa (Gumweed)8 February 2018 | Energy & Fuels, Vol. 32, No. 3Bioprospecting of Extremophiles for Biotechnology Applications3 July 2018Measuring the Bioeconomy: Economics and PoliciesAnnual Review of Resource Economics, Vol. 9, No. 1Preparing for the Era of the Digitally Transparent Supply Chain: A Call to Research in a New Kind of Journal24 November 2016 | Logistics, Vol. 1, No. 1Risk management consideration in the bioeconomy10 April 2017 | Biofuels, Bioproducts and Biorefining, Vol. 11, No. 3Life cycle analysis of corn‐stover‐derived polymer‐grade l‐lactic acid and ethyl lactate: greenhouse gas emissions and fossil energy consumption15 December 2016 | Biofuels, Bioproducts and Biorefining, Vol. 11, No. 2BioProducts Business, Vol. 2, No. 2Collaborative Perspective in Bio-Economy Development: A Mixed Method Approach22 August 2017Conversion of SPORL pretreated Douglas fir forest residues into microbial lipids with oleaginous yeasts1 January 2016 | RSC Advances, Vol. 6, No. 25 Volume 11Issue 4Aug 2015 InformationCopyright 2015, Mary Ann Liebert, Inc.To cite this article:Jay S. Golden, Robert B. Handfield, Jesse Daystar, and T. Eric McConnell.An Economic Impact Analysis of the US Biobased Products Industry: A Report to the Congress of the United States of America.Industrial Biotechnology.Aug 2015.201-209.http://doi.org/10.1089/ind.2015.29002.jsgPublished in Volume: 11 Issue 4: August 7, 2015PDF download
DA - 2015///
PY - 2015///
DO - 10.1089/ind.2015.29002.jsg
VL - 11
IS - 4
SP - 201-209
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84938888651&partnerID=MN8TOARS
ER -
TY - CHAP
TI - Analysis of a Downward Substitution Strategy in a Manufacturing/Remanufacturing System
AU - Gocer, Fethullah
AU - Ahiska, S. Sebnem
AU - King, Russell E.
T2 - Operations Research and Enterprise Systems
A2 - Pinson, E.
A2 - Valente, F.
A2 - Vitoriano, B.
T3 - Communications in Computer and Information Science
AB - A hybrid production system is considered where both manufacture of new product and remanufacture of returned items is performed. Due to consumer perception, new and remanufactured products are treated as different products with different costs and selling prices as well as separate demand streams. Remanufactured products have a higher stock out risk because the remanufacturing capacity is limited by the amount of returns available for remanufacture. One way to cope with this risk is to use a downward substitution strategy, i.e. a higher valued manufactured product is substituted for an out of stock lower valued remanufactured product. We formulate this control problem as an infinite-horizon hybrid manufacturing/remanufacturing system with product substitution under stochastic demand and returns. We model it as a Markov Decision Process in order to determine the optimal manufacturing and remanufacturing decisions under product substitution. The effects of stochastic demand/return distributions on the profitability of the substitution strategy are investigated through numerical experimentation.
PY - 2015///
DO - 10.1007/978-3-319-17509-6_13
SP - 186–198
PB - Springer International Publishing
SN - 9783319175089 9783319175096
SV - 509
UR - http://dx.doi.org/10.1007/978-3-319-17509-6_13
KW - Product substitution
KW - Remanufacturing
KW - Manufacturing
KW - Inventory control
KW - Markov decision process
ER -
TY - CONF
TI - Cupid: Commitments in Relational Algebra
AU - Chopra, Amit K.
AU - Singh, Munindar P.
C2 - 2015/1//
C3 - Proceedings of the AAAI Conference on Artificial Intelligence
DA - 2015/1//
VL - 29
SP - 2052–2059
M1 - 1
PB - AAAI Press
UR - https://ojs.aaai.org/index.php/AAAI/article/view/9443
ER -
TY - CONF
TI - Norms as a Basis for Governing Sociotechnical Systems
AU - Singh, Munindar P.
C2 - 2015///
C3 - Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)
DA - 2015///
SP - 4207–4211
PB - IJCAI
ER -
TY - CONF
TI - Real-Time Implementation of a Power Series Based Nonlinear Controller for the Balance of a Single Inverted Pendulum
T2 - IMECS 2015
C2 - 2015///
C3 - International MultiConference of Engineers and Computer Scientists : IMECS 2015 : 18-20 March, 2015, the Royal Garden Hotel, Kowloon, Hong Kong
CY - Hong Kong
DA - 2015///
PY - 2015/3/18/
VL - 1
SP - 237–241
PB - Newswood Limited, International Association of Engineers
SN - 978-988-19253-2-9
ER -
TY - CONF
TI - Understanding sanction under variable observability in a secure, collaborative environment
AU - Du, Hongying
AU - Narron, Bennett
AU - Ajmeri, Nirav
AU - Berglund, Emily
AU - Doyle, Jon
AU - Singh, Munindar P.
T2 - the 2015 Symposium and Bootcamp
AB - Norms are a promising basis for governance in secure, collaborative environments---systems in which multiple principals interact. Yet, many aspects of norm-governance remain poorly understood, inhibiting adoption in real-life collaborative systems. This work focuses on the combined effects of sanction and the observability of the sanctioner in a secure, collaborative environment. We present CARLOS, a multiagent simulation of graduate students performing research within a university lab setting, to explore these phenomena. The simulation consists of agents maintaining to enforced security norms while remaining motivated as researchers. We hypothesize that (1) delayed observability of the environment would lead to greater motivation of agents to complete research tasks than immediate observability and (2) sanctioning a group for a violation would lead to greater compliance to security norms than sanctioning an individual. We find that only the latter hypothesis is supported. Group sanction is an interesting topic for future research regarding a means for norm-governance which yields significant compliance with enforced security policy at a lower cost. Our ultimate contribution is to apply social simulation as a way to explore environmental properties and policies to evaluate key transitions in outcome, as a basis for guiding further and more demanding empirical research.
C2 - 2015///
C3 - Proceedings of the 2015 Symposium and Bootcamp on the Science of Security - HotSoS '15
DA - 2015///
DO - 10.1145/2746194.2746206
PB - ACM Press
SN - 9781450333764
UR - http://dx.doi.org/10.1145/2746194.2746206
DB - Crossref
ER -
TY - JOUR
TI - Identifying potential bottlenecks in production systems using dual prices from a mathematical programming model
AU - Kefeli, Ali
AU - Uzsoy, Reha
T2 - International Journal of Production Research
AB - The importance of identifying bottlenecks in production systems for effective production control and continuous improvement is well recognised. A useful definition of a bottleneck is the station to whose performance the performance of the overall production system is most sensitive. However, obtaining accurate estimates of the impact of changes in a given station's performance on the performance of a production system is often difficult. This paper uses the dual prices associated with production resources in a production planning model to support the identification of bottlenecks as the product mix in the system changes over time. The planning model considers queueing behaviour at production resources using non-linear clearing functions. Relationships between the dual prices of different resources are derived, and the bottleneck information obtained is compared to that from a model that does not consider queueing behaviour.
DA - 2015/9/4/
PY - 2015/9/4/
DO - 10.1080/00207543.2015.1076182
VL - 54
IS - 7
SP - 2000-2018
J2 - International Journal of Production Research
LA - en
OP -
SN - 0020-7543 1366-588X
UR - http://dx.doi.org/10.1080/00207543.2015.1076182
DB - Crossref
KW - production planning
KW - linear programming
KW - bottlenecks
KW - duality theory
KW - clearing functions
ER -
TY - JOUR
TI - Characterizing corridor-level travel time distributions based on stochastic flows and segment capacities
AU - Lei, Hao
AU - Zhou, Xuesong
AU - List, George F.
AU - Taylor, Jeffrey
T2 - Cogent Engineering
AB - Trip travel time reliability is an important measure of transportation system performance and a key factor affecting travelers’ choices. This paper explores a method for estimating travel time distributions for corridors that contain multiple bottlenecks. A set of analytical equations are used to calculate the number of queued vehicles ahead of a probe vehicle and further capture many important factors affecting travel times: the prevailing congestion level, queue discharge rates at the bottlenecks, and flow rates associated with merges and diverges. Based on multiple random scenarios and a vector of arrival times, the lane-by-lane delay at each bottleneck along the corridor is recursively estimated to produce a route-level travel time distribution. The model incorporates stochastic variations of bottleneck capacity and demand and explains the travel time correlations between sequential links. Its data needs are the entering and exiting flow rates and a sense of the lane-by-lane distribution of traffic at each bottleneck. A detailed vehicle trajectory data-set from the Next Generation SIMulation (NGSIM) project has been used to verify that the estimated distributions are valid, and the sources of estimation error are examined.
DA - 2015/1/9/
PY - 2015/1/9/
DO - 10.1080/23311916.2014.990672
VL - 2
IS - 1
J2 - Cogent Engineering
LA - en
OP -
SN - 2331-1916
UR - http://dx.doi.org/10.1080/23311916.2014.990672
DB - Crossref
KW - travel time reliability
KW - stochastic capacity
KW - stochastic demand
KW - queue model
ER -
TY - CHAP
TI - Determining Query Readiness for Structured Data
AU - Alborzi, Farid
AU - Chirkova, Rada
AU - Doyle, Jon
AU - Fathi, Yahya
T2 - Big Data Analytics and Knowledge Discovery
AB - The outcomes and quality of organizational decisions depend on the characteristics of the data available for making the decisions and on the value of the data in the decision-making process. Toward enabling management of these aspects of data in analytics, we introduce and investigate Data Readiness Level (DRL), a quantitative measure of the value of a piece of data at a given point in a processing flow. Our DRL proposal is a multidimensional measure that takes into account the relevance, completeness, and utility of data with respect to a given analysis task. This study provides a formalization of DRL in a structured-data scenario, and illustrates how knowledge of rules and facts, both within and outside the given data, can be used to identify those transformations of the data that improve its DRL.
PY - 2015///
DO - 10.1007/978-3-319-22729-0_1
SP - 3-14
OP -
PB - Springer International Publishing
SN - 9783319227283 9783319227290
UR - http://dx.doi.org/10.1007/978-3-319-22729-0_1
DB - Crossref
KW - Big data quality
KW - Big data analytics and user interfaces
KW - Data readiness level
KW - Data quality measurement
KW - Data quality improvement
ER -
TY - JOUR
TI - SDIoT: a software defined based internet of things framework
AU - Jararweh, Yaser
AU - Al-Ayyoub, Mahmoud
AU - Darabseh, Ala’
AU - Benkhelifa, Elhadj
AU - Vouk, Mladen
AU - Rindos, Andy
T2 - Journal of Ambient Intelligence and Humanized Computing
DA - 2015/6/23/
PY - 2015/6/23/
DO - 10.1007/S12652-015-0290-Y
VL - 6
IS - 4
SP - 453-461
J2 - J Ambient Intell Human Comput
LA - en
OP -
SN - 1868-5137 1868-5145
UR - http://dx.doi.org/10.1007/S12652-015-0290-Y
DB - Crossref
KW - Internet of things (IoT)
KW - Software defined network (SDN)
KW - Software defined systems (SDSys)
KW - Software defined storage (SDStore)
KW - Software defined security (SDSec)
ER -
TY - JOUR
TI - Anti-lecture hall compositions and Andrews' generalization of the Watson–Whipple transformation
AU - Corteel, Sylvie
AU - Lovejoy, Jeremy
AU - Savage, Carla
T2 - Journal of Combinatorial Theory, Series A
AB - For fixed n and k, we find a three-variable generating function for the set of sequences (λ1,…,λn) satisfyingk≥λ1a1≥λ2a2≥…≥λnan≥0, where a:=(a1,…,an)=(1,2,…,n) or (n,n−1,…,1). When k→∞ we recover the refined anti-lecture hall and lecture hall theorems. When a=(1,2,…,n) and n→∞, we obtain a refinement of a recent result of Chen, Sang and Shi. The main tools are elementary combinatorics and Andrews' generalization of the Watson–Whipple transformation.
DA - 2015/8//
PY - 2015/8//
DO - 10.1016/J.JCTA.2015.03.002
VL - 134
SP - 188-195
J2 - Journal of Combinatorial Theory, Series A
LA - en
OP -
SN - 0097-3165
UR - http://dx.doi.org/10.1016/J.JCTA.2015.03.002
DB - Crossref
KW - Lecture hall partitions
KW - Andrews' transformation
KW - Watson-Whipple transformation
ER -
TY - JOUR
TI - Norms as a Basis for Governing Sociotechnical Systems
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 - 2015///
PY - 2015///
DO - 10.1145/2542182.2542203
UR - https://publons.com/publon/21294403/
KW - Algorithms
KW - Design
KW - Governance
KW - sociotechnical systems
KW - adaptation
ER -
TY - JOUR
TI - TRACE: A Dynamic Model of Trust for People-Driven Service Engagements Combining Trust with Risk, Commitments, and Emotions
T2 - Lecture Notes in Computer Science
AB - Trust is an important element of achieving secure collaboration that deals with human judgment and decision making. We consider trust as it arises in and influences people-driven service engagements. Existing approaches for estimating trust between people suffer from two important limitations. One, they consider only commitment as the primary means of estimating trust and omit additional significant factors, especially risk and emotions. Two, they typically estimate trust based either on fixed parameter models that require manual setting of parameters or based on Hidden Markov Models (HMM), which assume conditional independence and are thus ill-suited to capturing complex relationships between trust, risk, commitments, and emotions. We propose TRACE, a model based on Conditional Random Fields (CRF) that predicts trust from risk, commitments, and emotions. TRACE does not require manual parameter tuning and relaxes conditional independence assumptions among input variables. We evaluate TRACE on a dataset collected by the Intelligence Advanced Research Projects Activity (IARPA) in a human-subject study. We find that TRACE outperforms existing trust-estimation approaches and that incorporating risk, commitments, and emotions yields lower trust prediction error than incorporating commitments alone.
DA - 2015///
PY - 2015///
DO - 10.1007/978-3-662-48616-0_24
UR - https://publons.com/publon/21294398/
ER -
TY - JOUR
TI - Social Contexts and Social Pragmatics
T2 - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS)
DA - 2015///
PY - 2015///
UR - https://publons.com/publon/21294406/
ER -
TY - JOUR
TI - Positron: Composing Commitment-Based Protocols
T2 - Lecture Notes in Computer Science
AB - We understand a sociotechnical system (STS) as a microsociety in which social entities interact about and via technical entities. A protocol specifies an STS by describing how its members collaborate by giving meaning to their interactions. We restrict ourselves to protocols that specify messages between roles in terms of how they create and affect commitments among the roles. A key idea of our approach, Positron, is that a protocol specifies the accountability of one role to another in addition to the requirements from each role. Specifically, Positron incorporates role accountability and role requirements as two integral aspects of protocol composition. In this way, it seeks to promote collaboration in STSs through natural requirements elicitation; flexibility enactment; and compliance and validation (ascribing accountability for each requirement to a specific role). Positron maps composite protocols to the representations of a well-known model checker as a way to verify protocols to assist in their correct formulation. We evaluate Positron by demonstrating it on real-life protocols.
DA - 2015///
PY - 2015///
DO - 10.1007/978-3-662-48616-0_2
UR - https://publons.com/publon/21294397/
KW - Commitments
KW - Commitment protocols
KW - Agent communication
KW - Communication protocols
KW - Protocol composition
KW - Verification of multiagent systems
KW - Model checking
ER -
TY - CONF
TI - Social contexts and social pragmatics
AU - Baldoni, M.
AU - Baroglio, C.
AU - Chopra, A.K.
AU - Singh, M.R.
C2 - 2015///
C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
DA - 2015///
VL - 3
SP - 1739-1740
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84944706476&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Modeling Healthcare Processes Using Commitments: An Empirical Evaluation
T2 - Plos One
AB - The two primary objectives of this paper are: (a) to demonstrate how Comma, a business modeling methodology based on commitments, can be applied in healthcare process modeling, and (b) to evaluate the effectiveness of such an approach in producing healthcare process models. We apply the Comma approach on a breast cancer diagnosis process adapted from an HHS committee report, and presents the results of an empirical study that compares Comma with a traditional approach based on the HL7 Messaging Standard (Traditional-HL7). Our empirical study involved 47 subjects, and two phases. In the first phase, we partitioned the subjects into two approximately equal groups. We gave each group the same requirements based on a process scenario for breast cancer diagnosis. Members of one group first applied Traditional-HL7 and then Comma whereas members of the second group first applied Comma and then Traditional-HL7-each on the above-mentioned requirements. Thus, each subject produced two models, each model being a set of UML Sequence Diagrams. In the second phase, we repartitioned the subjects into two groups with approximately equal distributions from both original groups. We developed exemplar Traditional-HL7 and Comma models; we gave one repartitioned group our Traditional-HL7 model and the other repartitioned group our Comma model. We provided the same changed set of requirements to all subjects and asked them to modify the provided exemplar model to satisfy the new requirements. We assessed solutions produced by subjects in both phases with respect to measures of flexibility, time, difficulty, objective quality, and subjective quality. Our study found that Comma is superior to Traditional-HL7 in flexibility and objective quality as validated via Student's t-test to the 10% level of significance. Comma is a promising new approach for modeling healthcare processes. Further gains could be made through improved tooling and enhanced training of modeling personnel.
DA - 2015///
PY - 2015///
DO - 10.1371/JOURNAL.PONE.0141202
UR - https://publons.com/publon/21294394/
ER -
TY - CONF
TI - Generalized commitment alignment
AU - Chopra, A.K.
AU - Singh, M.P.
C2 - 2015///
C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
DA - 2015///
VL - 1
SP - 453-461
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84944086593&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Generalized Commitment Alignment
T2 - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS)
DA - 2015///
PY - 2015///
UR - https://publons.com/publon/21294404/
ER -
TY - JOUR
TI - Cybersecurity as an Application Domain for Multiagent Systems
T2 - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS)
DA - 2015///
PY - 2015///
UR - https://publons.com/publon/21294405/
ER -
TY - CONF
TI - Cybersecurity as an application domain for multiagent systems
AU - Singh, M.P.
C2 - 2015///
C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
DA - 2015///
VL - 2
SP - 1207-1212
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84945191478&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Crowdsourcing Cloud-Based Software Development Foreword
T2 - Crowdsourcing: Cloud-based Software Development
DA - 2015///
PY - 2015///
UR - https://publons.com/publon/21294395/
ER -
TY - JOUR
TI - Composing and Verifying Commitment-Based Multiagent Protocols
T2 - Proceedings of the Twenty-fourth International Joint Conference on Artificial Intelligence (ijcai)
DA - 2015///
PY - 2015///
UR - https://publons.com/publon/21294402/
ER -
TY - JOUR
TI - Combining Practical and Dialectical Commitments for Service Engagements
T2 - Lecture Notes in Computer Science
AB - We understand a service engagement as a form of collaboration arising in a sociotechnical system (STS). Although STSs are fruitfully modeled using normative abstractions such as commitments, a conventional (practical) commitment can capture only part of the story, namely, a debtor’s promise to the creditor to bring about the consequent if the antecedent holds. In contrast, in a dialectical commitment, which we highlight, a debtor asserts to the creditor that the consequent is true if the antecedent is. For example, a customer may dialectically commit to a seller that the product she received is damaged but may not practically commit to damaging the product. We introduce a novel bipartite operationalization of dialectical commitments that separates their objective and subjective aspects and thus avoids the problems arising if we merely treat dialectical like practical commitments. We express that operationalization in temporal logic, developing a verification tool based on NuSMV, a well-known model-checker, to verify if the participants’ interactions comply with the participants’ dialectical commitments. We present a set of modeling patterns that incorporate both practical and dialectical commitments. We validate our proposal using a real-world scenario of contradictory medical diagnoses by different specialists.
DA - 2015///
PY - 2015///
DO - 10.1007/978-3-662-48616-0_1
UR - https://publons.com/publon/21294396/
ER -
TY - CONF
TI - Analysis of Anderson acceleration on a simplified neutronics/thermal hydraulics system
AU - Toth, A.
AU - Kelley, C.T.
AU - Slattery, S.
AU - Hamilton, S.
AU - Clarno, K.
AU - Pawlowski, R.
C2 - 2015///
C3 - Joint International Conference on Mathematics and Computation (M&C), Supercomputing in Nuclear Applications (SNA) and the Monte Carlo (MC) Method
DA - 2015///
ER -
TY - JOUR
TI - Stochastic nonlinear mixed effects: a metformin case study
AU - Matzuka, Brett
AU - Chittenden, Jason
AU - Monteleone, Jonathan
AU - Tran, Hien
T2 - Journal of Pharmacokinetics and Pharmacodynamics
DA - 2015/11/19/
PY - 2015/11/19/
DO - 10.1007/s10928-015-9456-7
VL - 43
IS - 1
SP - 85-98
J2 - J Pharmacokinet Pharmacodyn
LA - en
OP -
SN - 1567-567X 1573-8744
UR - http://dx.doi.org/10.1007/s10928-015-9456-7
DB - Crossref
KW - Population pharmacokinetics
KW - Kalman filter
KW - tochastic differential equations
KW - Model development
KW - Parameter estimation
KW - Nonlinear mixed effects
ER -
TY - JOUR
TI - Reaction Path Following with Sparse Interpolation
AU - Nance, James
AU - Jakubikova, Elena
AU - Kelley, C T
T2 - J.Chem.Th. Comp.
AB - Computing the potential energy of an N-atom molecule is an expensive optimization process of 3N - 6 molecular coordinates, so following reaction pathways as a function of all 3N - 6 coordinates is unfeasible for large molecules. In this paper, we present a method that isolates d < 3N - 6 molecular coordinates and continuously follows reaction paths on d-dimensional potential energy surfaces approximated by a Smolyak's sparse grid interpolation algorithm.1 Compared to dense grids, sparse grids efficiently improve the ratio of invested storage and computing time to approximation accuracy and thus allow one to increase the number of coordinates d in molecular reaction path following simulations. Furthermore, evaluation of the interpolant is much less expensive than the evaluation of the actual energy function, so our technique offers a computationally efficient way to simulate reaction paths on ground and excited state potential energy surfaces. To demonstrate the capabilities of our method, we present simulation results for the isomerization of 2-butene with two, three, and six degrees of freedom.
DA - 2015///
PY - 2015///
DO - 10.1021/ct5004669
VL - 10
IS - 2
SP - 2942-2949
ER -
TY - JOUR
TI - Optimization with hidden constraints and embedded Monte Carlo computations
AU - Chen, Xiaojun
AU - Kelley, C. T.
T2 - Optimization and Engineering
AB - In this paper we explore the convergence properties of deterministic direct search methods when the objective function contains a stochastic or Monte Carlo simulation. We present new results for the case where the objective is only defined on a set with certain minimal regularity properties. We present two numerical examples to illustrate the ideas.
DA - 2015/12/22/
PY - 2015/12/22/
DO - 10.1007/s11081-015-9302-1
VL - 17
IS - 1
SP - 157-175
J2 - Optim Eng
LA - en
OP -
SN - 1389-4420 1573-2924
UR - http://dx.doi.org/10.1007/s11081-015-9302-1
DB - Crossref
KW - Sampling methods
KW - Monte Carlo simulation
KW - Water resource policy
KW - Hidden constraints
ER -
TY - JOUR
TI - Preface
AU - Barlow, J.L.
AU - Drma?, Z.
AU - Ipsen, I.
AU - Moro, J.
T2 - Linear Algebra and Its Applications
DA - 2015///
PY - 2015///
DO - 10.1016/j.laa.2014.10.006
VL - 464
SP - 1-2
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908326625&partnerID=MN8TOARS
ER -
TY - JOUR
TI - GARCH Models for Credit Risk and Market Risk of Relative Returns
AU - Pang, T.
AU - Yang, S.
T2 - Journal of Finance and Management Research
DA - 2015///
PY - 2015///
VL - 1
IS - 1
SP - 19–38
ER -
TY - JOUR
TI - CVA Wrong Way Risk Multiplier Decomposition and Efficient CVA Curve
AU - Pang, T.
AU - Chen, W.
AU - Li, L.
T2 - Journal of Risk Management in Financial Institutions
DA - 2015///
PY - 2015///
VL - 8
IS - 4
SP - 390–404
ER -
TY - CHAP
TI - An Application of Functional Ito's Formula to Stochastic Portfolio Optimization with Bounded Memory
AU - Pang, Tao
AU - Hussain, Azmat
T2 - 2015 Proceedings of the Conference on Control and its Applications
AB - We consider a stochastic portfolio optimization model in which the returns of risky asset depend on its past performance. The price of the risky asset is described by a stochastic delay differential equation. The investor's goal is to maximize the expected discounted utility by choosing optimal investment and consumption as controls. We use the functional Ito's formula to derive the associated Hamilton-Jacobi-Bellman equation. For logarithmic and exponential utility functions, we can obtain explicit solutions in a finite dimensional space.
PY - 2015/7//
DO - 10.1137/1.9781611974072.23
SP - 159-166
OP -
PB - Society for Industrial and Applied Mathematics
SN - 9781611974072
UR - http://dx.doi.org/10.1137/1.9781611974072.23
DB - Crossref
ER -
TY - JOUR
TI - Convergence Studies on Monte Carlo Methods for Pricing Mortgage-Backed Securities
AU - Pang, Tao
AU - Yang, Yipeng
AU - Zhao, Dai
T2 - International Journal of Financial Studies
AB - Monte Carlo methods are widely-used simulation tools for market practitioners from trading to risk management. When pricing complex instruments, like mortgage-backed securities (MBS), strong path-dependency and high dimensionality make the Monte Carlo method the most suitable, if not the only, numerical method. In practice, while simulation processes in option-adjusted valuation can be relatively easy to implement, it is a well-known challenge that the convergence and the desired accuracy can only be achieved at the cost of lengthy computational times. In this paper, we study the convergence of Monte Carlo methods in calculating the option-adjusted spread (OAS), effective duration (DUR) and effective convexity (CNVX) of MBS instruments. We further define two new concepts, absolute convergence and relative convergence, and show that while the convergence of OAS requires thousands of simulation paths (absolute convergence), only hundreds of paths may be needed to obtain the desired accuracy for effective duration and effective convexity (relative convergence). These results suggest that practitioners can reduce the computational time substantially without sacrificing simulation accuracy.
DA - 2015/5/5/
PY - 2015/5/5/
DO - 10.3390/ijfs3020136
VL - 3
IS - 2
SP - 136-150
J2 - IJFS
LA - en
OP -
SN - 2227-7072
UR - http://dx.doi.org/10.3390/ijfs3020136
DB - Crossref
KW - Monte Carlo method
KW - mortgage-backed securities (MBS)
KW - coefficient of variation (CV)
KW - absolute convergence
KW - relative convergence
KW - option-adjusted spread (OAS)
KW - effective duration (DUR)
KW - effective convexity (CNVX)
KW - Greeks
ER -
TY - CHAP
TI - The Flexibility of DAE Formulations
AU - Campbell, Stephen L.
T2 - Surveys in Differential-Algebraic Equations III
AB - There has been extensive research on DAEs and their applications. One major reason given for the usefulness of DAEs is that they are the initial way that many complex systems are most naturally modeled. But there are other ways that DAE formulations are useful. This survey focuses on a number of problems where the extra flexibility of a DAE formulation permits the solution of a problem that would be hard to solve otherwise.
PY - 2015///
DO - 10.1007/978-3-319-22428-2_1
SP - 1-59
OP -
PB - Springer International Publishing
SN - 9783319224275 9783319224282
UR - http://dx.doi.org/10.1007/978-3-319-22428-2_1
DB - Crossref
ER -
TY - JOUR
TI - Optimal Investment and Consumption for Portfolios with Stochastic Dividends
AU - Pang, T.
AU - Varga, K.
T2 - Journal of Finance and Management Research
DA - 2015///
PY - 2015///
VL - 1
IS - 2
SP - 1–22
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook V4
AU - Joines, J
AU - Roberts, S
DA - 2015///
PY - 2015///
PB - Raleigh, NC: SIMIO LLC
ER -
TY - BOOK
TI - Simulation modeling with SIMIO: A Workbook V4 (4th ed.)
AU - Joines, Jeffrey A.
AU - Roberts, Stephen D.
DA - 2015///
PY - 2015///
PB - Sewickley, PA: SIMIO LLC
SN - 9781519142207
ER -
TY - JOUR
TI - Reverse Logistics of US Carpet Recycling
AU - Sas, Iurii
AU - Thoney, Kristin A.
AU - Joines, Jeffrey A.
AU - King, Russell E.
AU - Woolard, Ryan
T2 - SUSTAINABLE FASHION SUPPLY CHAIN MANAGEMENT: FROM SOURCING TO RETAILING
AB - A high volume of post-consumer carpet (PCC) is discarded each year in the USA, placing significant pressure on landfills and leading to the loss of valuable materials contained in carpets. To explain factors that influence landfill diversion rates for different types of products, an overview of the reverse logistics framework in the literature is provided. The framework is used to analyze the current state of carpet recycling in the USA, and PCC recycling is shown to be a typical material recovery network. Therefore, because PCC recycling requires a high volume of carpet to be collected and transportation costs to be minimized for it to be economical, a well-organized reverse logistics network is critical. In this respect, a review of reverse network design studies for different products is provided and research conducted to design PCC collection and recycling networks is discussed in detail.
DA - 2015///
PY - 2015///
DO - 10.1007/978-3-319-12703-3_1
VL - 1
SP - 3-30
SN - 2365-6395
ER -
TY - BOOK
TI - Simulation Modeling with SIMIO: A Workbook
AU - Joines, J.A.
AU - Roberts, S.D.
DA - 2015/10//
PY - 2015/10//
ET - 4th, Economy Version
PB - Simio LLC
SN - 978-1-5193-3393-3
ER -
TY - JOUR
TI - Offline Distance-Adaptive Routing and Spectrum Assignment (DA-RSA) in Rings
AU - Talebi, Sahar
AU - Katib, Iyad
AU - Rouskas, George N.
T2 - 2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)
AB - Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. We first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem in mesh networks is a special case of a multiprocessor scheduling problem. We then develop a suite of efficient and effective DA-RSA algorithms that build upon list scheduling concepts. Our work explores the tradeoffs involved in DA-RSA algorithm design, and opens up new research directions that may leverage the vast literature in scheduling theory.
DA - 2015///
PY - 2015///
DO - 10.1109/glocom.2015.7417037
SP -
SN - 2334-0983
ER -
TY - CONF
TI - Robust switching output feedback control of discrete-time linear polytopic uncertain systems
AU - Yuan, C. Z.
AU - Wu, F.
AU - Duan, C.
AB - This paper presents a new switching control approach for robust output feedback control of a class of discrete-time linear systems subject to polytopic time-varying uncertainties. The proposed robust switching controller, which stabilizes the closed-loop system with a pre-specified H ∞ performance level, consists of a family of dynamic output feedback controllers (of an arbitrary state order) and a switching law (the relaxed min-switching strategy). Both stability analysis and control synthesis conditions are derived using a piecewise quadratic Lyapunov function. The switching law combined with the controller gain matrices are jointly synthesized by solving a convex linear matrix inequality (LMI) based optimization problem. An academic example has been used to demonstrate the effectiveness and advantages of the proposed approach.
C2 - 2015///
C3 - 2015 34th Chinese Control Conference (CCC)
DA - 2015///
DO - 10.1109/chicc.2015.7260096
SP - 2973-2978
ER -
TY - CONF
TI - Securing software application chains in a cloud
AU - Kim, D.
AU - Vouk, M. A.
C2 - 2015///
C3 - 2015 2nd International Conference on Information Science and Security (ICISS)
DA - 2015///
SP - 50-53
ER -
TY - CONF
TI - SDSecurity: A software defined security experimental framework
AU - Darabseh, A.
AU - Al-Ayyoub, M.
AU - Jararweh, Y.
AU - Benkhelifa, E.
AU - Vouk, M.
AU - Rindos, A.
AB - The emerging Software Defined Systems (SDSys) is a recent paradigm, which has been introduced to reduce the overhead in the control and management operations of complex computing systems. The main concept behind this technology is around isolating the data plane from the control plane. Traditional security mechanisms are facing more challenges in providing sufficient levels of protection and efficiency. SDSys for security has been proposed to address these challenges. Software Defined Security (SDSec) provides a flexible and centralized security solution by abstracting the security mechanisms from the hardware layer to a software layer. In this paper we present a novel experimental framework to provide a novel virtualized testbed environment for SDSec systems. This work builds on the Mininet simulator, where its core components, the host, switch and the controller, are customized to build the proposed experimental simulation framework for SDSec. To the best of the authors' knowledge, this is the first experimental framework and simulator for SDSec solutions. The developed simulator, will not only support the development and testing of SDSecurity solutions, it will also serve as an experimentation tool for researchers and for benchmarking purposes. The developed simulator could also be used as an educational tool to train students and novice researchers.
C2 - 2015///
C3 - 2015 IEEE International Conference on Communication Workshop
DA - 2015///
DO - 10.1109/iccw.2015.7247453
SP - 1871-1876
ER -
TY - CONF
TI - Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms
AU - Talebi, S.
AU - Alam, F.
AU - Katib, I.
AU - Rouskas, George
AB - We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlier work, we have shown that the SA problem can be viewed as a multiprocessor problem. Based on this insight, we prove that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and we develop constant-ratio approximation algorithms for large rings. For rings of size up to 16 nodes (the maximum size of a SONET/SDH ring), the approximation ratios of our algorithms are strictly smaller than the best known ratio to date.
C2 - 2015///
C3 - 2015 International Conference on Computing, Networking and Communications (ICNC)
DA - 2015///
DO - 10.1109/iccnc.2015.7069420
SP - 642–647
ER -
TY - JOUR
TI - The Helmholtz Conditions and the Method of Controlled Lagrangians
AU - Bloch, Anthony M.
AU - Krupka, Demeter
AU - Zenkov, Dmitry V.
T2 - INVERSE PROBLEM OF THE CALCULUS OF VARIATIONS: LOCAL AND GLOBAL THEORY
AB - In this chapter we consider the relationship between the classical inverse problem of the calculus of variations and the method of controlled Lagrangians. The latter is a technique for deriving stabilizing feedback controls for nonlinear controlled mechanical systems. It relies on deriving a Lagrangian which describes the feedback controlled dynamics. This is a nontrivial extension to the theory of the inverse problem as it involves controls. We discuss various aspects of both subjects and illustrate the theory with examples.
DA - 2015///
PY - 2015///
DO - 10.2991/978-94-6239-109-3_1
SP - 1-29
ER -
TY - JOUR
TI - Securing Scientific Workflows
AU - Kim, Donghoon
AU - Vouk, Mladen A.
T2 - 2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015)
AB - This paper investigates security of Kepler scientific workflow engine. We are especially interested in Kepler-based scientific workflows that may operate in cloud environments. We find that (1) three security properties (i.e., input validation, remote access validation, and data integrity) are essential for making Kepler-based workflows more secure, and (2) that use of the Kepler provenance module may help secure Kepler based workflows. We implemented a prototype security enhanced Kepler engine to demonstrate viability of use of the Kepler provenance module in provision and management of the desired security properties.
DA - 2015///
PY - 2015///
DO - 10.1109/qrs-c.2015.25
SP - 95-104
KW - Scientific workflow
KW - Kepler
KW - Vulnerability
KW - Provenance
KW - Cloud
ER -
TY - JOUR
TI - Safety Can Be Dangerous: Secure Communications Impair Smart Grid Stability Under Emergencies
AU - Wei, Mingkui
AU - Wang, Wenye
T2 - 2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)
AB - Smart grid features real-time monitoring and control by integrating advanced communication networks into traditional power grids. This integration, however, makes smart grid vulnerable to cyber attacks, i.e., the anomalies caused by attackers in the communication network can affect ordinary operations of the power grid and result in severe physical damage. To protect smart grid from cyber attacks, many traditional countermeasures, such as message encryption, have been proposed to be directly migrated to fit this system. In this regard, the very first fundamental questions that need to be addressed are how to evaluate and compare the physical impacts of cyber attacks and countermeasures, and whether traditional cyber security countermeasures can result in satisfactory performance in smart grid. Motivated by these questions, we establish a small-scale smart grid prototype, and use both experiments and cross-domain simulations to evaluate and compare the reaction of the power system under cyber attacks, with and without the presence of traditional countermeasures. Our study reveals that traditional countermeasures can not be readily migrated to protect smart grid in particular, and shows that during system emergencies where prompt system reactions are critical, the extra latency caused by message encryption and decryption can result in more than 10 times in the magnitude of voltage collapse. Our work indicates that traditional countermeasures may not fit smart grid, the newly emerging cyber- physical system, which has strict time constraint. Therefore it is essential for researchers to seek solutions to address smart grid specific security threats.
DA - 2015///
PY - 2015///
DO - 10.1109/glocom.2015.7417012
SP -
SN - 2334-0983
ER -
TY - JOUR
TI - SDStorage: A Software Defined Storage Experimental Framework
AU - Darabseh, Ala'
AU - Al-Ayyoub, Mahmoud
AU - Jararweh, Yaser
AU - Benkhelifa, Elhadj
AU - Vouk, Mladen
AU - Rindos, Andy
T2 - 2015 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING (IC2E 2015)
AB - With the rapid growth of data centers and the unprecedented increase in storage demands, the traditional storage control techniques are considered unsuitable to deal with this large volume of data in an efficient manner. The Software Defined Storage (SDStore) comes as a solution for this issue by abstracting the storage control operations from the storage devices and set it inside a centralized controller in the software layer. Building a real SDStore system without any simulation and emulation is considered an expensive solution and may have a lot of risks. Thus, there is a need to simulate such systems before the real-life implementation and deployment. In this paper we present SDStorage, an experimental framework to provide a novel virtualized test bed environment for SDStore systems. The main idea of SDStorage is based on the Mininet Software Defined Network (SDN) Open Flow simulator and is built over of it. The main components of Mininet, which are the host, the switch and the controller, are customized to serve the needs of SDStore simulation environments.
DA - 2015///
PY - 2015///
DO - 10.1109/ic2e.2015.60
SP - 341-346
ER -
TY - JOUR
TI - Resolving Goal Conflicts via Argumentation-Based Analysis of Competing Hypotheses
AU - Murukannaiah, P. K.
AU - Kalia, A. K.
AU - Telang, P. R.
AU - Singh, Munindar P.
T2 - IEEE 25TH INTERNATIONAL REQUIREMENTS ENGINEERING CONFERENCE (RE)
AB - A stakeholder's beliefs influence his or her goals. However, a stakeholder's beliefs may not be consistent with the goals of all stakeholders of a system being constructed. Such belief-goal inconsistencies could manifest themselves as conflicting goals of the system to be. We propose Arg-ACH, a novel approach for capturing inconsistencies between stakeholders' goals and beliefs, and resolving goal conflicts. Arg-ACH employs a hybrid of (1) the analysis of competing hypotheses (ACH), a structured analytic technique, for systematically eliciting stakeholders' goals and beliefs, and (2) rational argumentation for determining belief-goal inconsistencies to resolve conflicts. Arg-ACH treats conflicting goals as hypotheses that compete with each other and the winning hypothesis as a goal of the system to be. Arg-ACH systematically captures the trail of a requirements engineer's thought process in resolving conflicts. We evaluated Arg-ACH via a study in which 20 subjects applied Arg-ACH or ACH to resolve goal conflicts in a sociotechnical system concerning national security. We found that Arg-ACH is superior to ACH with respect to completeness and coverage of belief search; length of belief chaining; ease of use; explicitness of the assumptions made; and repeatability of conclusions across subjects. Not surprisingly, Arg-ACH required more time than ACH: although this is justified by improvements in quality, the gap could be reduced through better tooling.
DA - 2015///
PY - 2015///
DO - 10.1109/re.2015.7320418
SP - 156–165
UR - https://publons.com/publon/21294399/
ER -
TY - CONF
TI - Recent advances in beam optics analyzer
AU - Bui, T.
AU - Read, M.
AU - Lin, M. C.
AU - Ives, R. L.
AU - Tallis, B.
AU - Tran, Hien
AB - Beam Optics Analyzer (BOA) is a finite element, particle-in-cell, charged particle code. We will present its recent advances including methodologies and numerical results to simulate a gridded magnetron, study surface coating by investigating backscattered electron penetration depth, and use permanent magnets to focus doubly converged electron beams.
C2 - 2015///
C3 - 2015 ieee international vacuum electronics conference (ivec)
DA - 2015///
DO - 10.1109/ivec.2015.7223806
ER -
TY - CONF
TI - Modeling analytics as knowledge work: Computing meets organizational psychology
AU - Yuan, G.
AU - Ajmeri, Nirav
AU - Allred, C.
AU - Telang, P.R.
AU - Wilson, M.
AU - Singh, Munindar P.
AB - This paper reports on an ongoing interdisciplinary study of analytic workflow, describing our preliminary understanding and findings as well as some directions for further investigation and validation. Specifically, we exploit knowledge from organizational psychology to develop a computational organizational model. Our proposed organizational model provides a framework to understand the impact of organizational level variables and worker characteristics on workflow performance, providing a view to create justifiable interventions to improve performance. To evaluate the viability of the model, we develop a multiagent simulation framework and design an experimental study.
C2 - 2015///
C3 - Proceedings - International Conference on Research Challenges in Information Science
DA - 2015///
DO - 10.1109/rcis.2015.7128899
VL - 2015-June
SP - 382-387
M1 - June
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84937926189&partnerID=MN8TOARS
ER -
TY - CONF
TI - Enhancing security of Hadoop in a public cloud
AU - Yu, X. Q.
AU - Ning, P.
AU - Vouk, M. A.
AB - Hadoop has become increasingly popular as it rapidly processes data in parallel. Cloud computing gives reliability, flexibility, scalability, elasticity and cost saving to cloud users. Deploying Hadoop in cloud can benefit Hadoop users. Our evaluation exhibits that various internal cloud attacks can bypass current Hadoop security mechanisms, and compromised Hadoop components can be used to threaten overall Hadoop. It is urgent to improve compromise resilience, Hadoop can maintain a relative high security level when parts of Hadoop are compromised. Hadoop has two vulnerabilities that can dramatically impact its compromise resilience. The vulnerabilities are the overloaded authentication key, and the lack of fine-grained access control at the data access level. We developed a security enhancement for a public cloud-based Hadoop, named SEHadoop, to improve the compromise resilience through enhancing isolation among Hadoop components and enforcing least access privilege for Hadoop processes. We have implemented the SEHadoop model, and demonstrated that SEHadoop fixes the above vulnerabilities with minimal or no run-time overhead, and effectively resists related attacks.
C2 - 2015///
C3 - 2015 6th International Conference on Information and Communication Systems (ICICS)
DA - 2015///
DO - 10.1109/iacs.2015.7103198
SP - 38-43
ER -
TY - JOUR
TI - Claim What You Need: A Text-Mining Approach on Android Permission Request Authorization
AU - Wei, Mingkui
AU - Gong, , Xi
AU - Wang, Wenye
T2 - 2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)
AB - Android is one of the most popular mobile operating systems nowadays, whose popularity, however, also attracts even more crafty developers to develop malicious softwares, or malwares, to exploit illegitimate means for profit. As a basic countermeasure, Android enforces the permission request scheme, in which an application (App) is required to present to the user the system resources (permissions) it will access, and ask user's approval before installation. However, this approach has been proven ineffective as it delegates the whole responsibility of decision- making to the user, who usually lacks the professional knowledge to comprehend the interpretation of a permission. Alternatively, many current researches focus on identifying potential malwares based on attributes of individual Apps, such as inspecting their source code, which, unfortunately, fall in another extreme which tend to make the decision for the user. Nevertheless, from the user's perspective, a satisfactory solution should be an approach which assists users to make the decision of the App installation on their own, by providing them with lucid reasons and requiring minimum professional knowledge. Based on the observation that the description of an App is the most direct interface to communicate its functionality to the user, in this paper we are motivated to explore the relationship between the description and the requested permissions of an App, and further build a model to predict proper permissions based on its description. Our evaluation with Apps collected from the Google Play Market shows that our prediction can achieve as high as 87% accuracy. In this regard, provide a user has full understanding of the description of an App, our model can act as an effective reminder to the user if the App tries to stealthily request permissions that are inconsistent with its description, which is a major character commonly exploited by malwares.
DA - 2015///
PY - 2015///
DO - 10.1109/glocom.2015.7417472
SP -
SN - 2334-0983
ER -
TY - JOUR
TI - CS/SE Instructors Can Improve Student Writing without Reducing Class Time Devoted to Technical Content: Experimental Results
AU - Anderson, Paul V.
AU - Heckman, Sarah
AU - Vouk, Mladen
AU - Wright, David
AU - Carter, Michael
AU - Burge, Janet E.
AU - Gannod, Gerald C.
T2 - 2015 IEEE/ACM 37TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, VOL 2
AB - The Computer Science and Software Engineering (CS/SE) profession reports that new college graduates lack the communication skills needed for personal and organizational success. Many CS/SE faculty may omit communication instruction from their courses because they do not want to reduce technical content. We experimented in a software-engineering-intensive second-semester programming course with strategies for improving students' writing of black box test plans that included no instruction on writing the plans beyond the standard lecture on testing. The treatment version of the course used 1) a modified assignment that focused on the plan's readers, 2) a model plan students could consult online, and 3) a modified grading rubric that identified the readers' needs. Three external raters found that students in the treatment sections outperformed students in the control sections on writing for five of nine criteria on rubrics for evaluating the plans and on the raters' holistic impression of the students' technical and communication abilities from the perspectives of a manager and a tester.
DA - 2015///
PY - 2015///
DO - 10.1109/icse.2015.178
SP - 455-464
KW - communication across the curriculum
KW - software engineering education
KW - black box test plans
ER -
TY - CONF
TI - The future interaction between virtual aggregator-TSO-DSO to increase DG penetration
AU - Sbordone, D. A.
AU - Di Pietra, B.
AU - Carlini, E. M.
AU - Devetsikiotis, M.
AB - The increasing integration of massive quantities of generation from Renewable Energy Sources (RES) constitutes a challenge for the pan-European system. Reserve provision for the balancing of the network is an important service that, in principle, should be provided by all the units connected to the network, including RES generators themselves as well as flexible loads and storage systems. However, these resources have big peculiarities tied with their relevant technologies and could, beyond providing local services within the distribution grids (e.g. voltage regulation, congestion management), be available to provide reserve for the entire system, through the connection points to the transmission grid. This paper shows a more advanced dispatching management of distribution systems by resorting to more advanced Information and Communications Technology(ICT) systems able to transform distribution from a “passive” into an “active” system and market architectures able to incorporate scattered bids coming from distributed generation and active load. A delicate point is the interface between transmission and distribution that has to be managed in a coordinated manner between Transmission System Operators (TSO) and Distribution System Operators (DSOs) in order to achieve an overall efficiency target. ICT should also be key to allow a strict real-time coordination of the different subjects that are in charge to actuate the provision of ancillary services. Further, the paper shows as new actors could appear in the system like the “aggregators” who interface with the Market Operator to submit the bids for the provision of the services, with the local TSO to receive the consequent dispatching orders, with to the aggregated distributed resources (generation, flexible demand, storage) and with to the involved DSOs, in order to communicate how each dispatching order will in turn be dispatched among the distributed resources it aggregates.
C2 - 2015///
C3 - 2015 International Conference on Smart Grid and Clean Energy Technologies (ICSGCE)
DA - 2015///
DO - 10.1109/icsgce.2015.7454296
SP - 201-205
ER -
TY - CONF
TI - Spectrum assignment in mesh elastic optical networks
AU - Fayez, M.
AU - Katib, I.
AU - Rouskas, George
AU - Faheem, H. M.
AB - Spectrum assignment has emerged as the key design and control problem in elastic optical networks. We have shown that spectrum assignment in networks of general topology is a special case of scheduling multiprocessor tasks on dedicated processors. Based on this insight, we develop and evaluate efficient and effective algorithms for mesh and chain networks that build upon list scheduling concepts.
C2 - 2015///
C3 - 24th international conference on computer communications and networks icccn 2015
DA - 2015///
DO - 10.1109/icccn.2015.7288470
ER -
TY - JOUR
TI - SDDC: A Software Defined Datacenter Experimental Framework
AU - Darabseh, Ala'
AU - Al-Ayyoub, Mahmoud
AU - Jararweh, Yaser
AU - Benkhelifa, Elhadj
AU - Vouk, Mladen
AU - Rindos, Andy
AU - Awan, I
AU - Younas, M
AU - Mecella, M
T2 - 2015 3RD INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD (FICLOUD) AND INTERNATIONAL CONFERENCE ON OPEN AND BIG (OBD)
AB - The rapid growth and the distributed sites of the datacenters increase the complexity of control and management processes. A new paradigm which is called Software Defined Systems (SDSys) comes as a solution to reduce the overhead of datacenters management by abstracting all the control functionalities from the hardware devices and setting it inside a software layer. These functionalities are responsible for organizing and controlling the main blocks of the datacenter; network, storage, compute and security. The Software Defined Datacenter (SDD) integrates the software defined concepts into all of these main blocks. Transferring these concepts into workable systems requires checking several performance aspects and testing its correctness before building real systems. In this paper we introduce a novel experimental framework (SDDC) to provide a novel virtualized testbed environment for SDD systems. This work builds on the Mininet simulator, where its core components, the host, the switch and the controller, are customized to build the proposed experimental simulation framework for SDD. This simulator lets the users develop and test their own SDD solutions, and at the same time gives the researchers an experimentation tool for benchmarking purposes. The developed simulator could also be used as an educational tool to train students and novice researchers.
DA - 2015///
PY - 2015///
DO - 10.1109/ficloud.2015.127
SP - 189-194
ER -
TY - CONF
TI - G2G: Privacy-preserving group matching for proximity-based mobile social networks
AU - Zhu, X. Y.
AU - Chen, Z. B.
AU - Wang, Wenye
AB - The explosive development of mobile devices and position systems makes it possible and meaningful for Proximity-based Mobile Social Networks (PMSNs), in which social group networking is among the most prominent features. In order to choose a suitable friend group, a group needs to find another group in vicinity and computes the matching degree based on their attributes. Then, they decide whether to make new social interactions through WiFi/Bluetooth interfaces embedded in their mobile devices according to the matching information. However, since group attributes usually contain some sensitive information, users may have increasing privacy concerns and do not want to reveal them to strangers. In this paper, we propose G2G, a novel privacy-preserving group matching mechanism, which can support group matching with preserving the privacy of all group members by applying permutation function. Considering a few potential attacks, we design an enhanced version G2G+, which can further improve group privacy. By detailed analysis and evaluation, we demonstrate that the proposed schemes have a desirable performance on security, efficiency and communication traffic.
C2 - 2015///
C3 - 2015 IEEE/CIC International Conference on Communications in China (ICCC)
DA - 2015///
DO - 10.1109/iccchina.2015.7448721
ER -
TY - CONF
TI - Detecting opinion spammer groups through community discovery and sentiment analysis
AU - Choo, E.
AU - Yu, T.
AU - Chi, M.
C2 - 2015///
C3 - Data and applications security and privacy xxix
DA - 2015///
VL - 9149
SP - 170-187
ER -
TY - CONF
TI - The nonnegative matrix factorization and atomic deconvolution
AU - Ito, K.
AU - Landi, A. K.
AB - The Nonnegative Matrix Factorization is an unsupervised maching learning technique that finds a representation of measured data in terms of two low-rank factors. It has recently gained popularity in various applications as a feature selection and dimension reduction tool, e.g. text mining, signal processing, and image processing. Thus, the nonnegative matrix factorization is an increasingly important tool in big data analysis as data continues to grow not only in size but also in complexity. In this paper, we advance the NMF analysis in the case of the convolution. That is, the two factors have the clear roles of convolution kernel and signal. Specifically, for the case of the point-spread function, atoms are the weights that describe the kernel. Using proper atoms, we develop a method for the blind deconvolution based on an NMF representation so that we obtain an estimate of the signal and the kernel. In addition, with Magnetic Resonance Imaging (MRI). Specifically, we extend the idea of the two factors to the Fourier transform and develop a coordinate-descent method in order to determine phases.
C2 - 2015///
C3 - Proceedings 2015 ieee international conference on bioinformatics and biomedicine
DA - 2015///
DO - 10.1109/bibm.2015.7359923
SP - 1650-1657
ER -
TY - CONF
TI - Robust finite-time filtering for singular discrete-time stochastic systems
AU - Zhang, A. Q.
AU - Campbell, Stephen
AB - This paper addresses the problem of singular stochastic finite-time filter design for uncertain discrete-time singular stochastic systems. The stochastic Lyapunov function method is adopted to design a filter such that for all admissible uncertainties, the filtering error system is singular stochastic finite-time stable (SSFTS) and preserves a prescribed performance level. A sufficient condition for the existence of a filter for the system under consideration is developed and the corresponding filter parameters can be calculated by solving a sequence of linear matrix inequalities (LMI). Finally, a numerical example is given to illustrate the design procedure and the effectiveness of the proposed method.
C2 - 2015///
C3 - 2015 27th chinese control and decision conference (ccdc)
DA - 2015///
DO - 10.1109/ccdc.2015.7162049
SP - 913–918
ER -
TY - CONF
TI - Interactive preference-aware query optimization
AU - Ong, N. R.
AU - Rojcewicz, S. E.
AU - Farnan, N. L.
AU - Lee, A. J.
AU - Chrysanthis, P. K.
AU - Yu, T.
AB - PASQL is an extension to SQL that allows users of a distributed database to specify privacy constraints on an SQL query evaluation plan. However, privacy constraints can be difficult for users to specify, and worse yet, all possible situations that could lead to a privacy violation may not be known to the user a priori. To address these challenges, we propose a GUI-based interactive process for detecting such violations and generating appropriate constraints. In this work, we demonstrate two approaches to implementing such a GUI that provide different ways of analyzing and interactively optimizing a PASQL query plan.
C2 - 2015///
C3 - 2015 ieee 31st international conference on data engineering (icde)
DA - 2015///
DO - 10.1109/icde.2015.7113414
SP - 1512-1515
ER -
TY - JOUR
TI - Agent Based Framework For Modeling Operations at Isolated Signalized Intersections
AU - Isukapati, Isaac K.
AU - List, George F.
T2 - 2015 IEEE 18TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS
AB - An agent-based model of intersection control is presented. Drivers make payments to movement managers so that they can pass through the intersection. Movement managers collect fees from arriving drivers, receive voluntary contributions from those same drivers, and participate in a bidding process overseen by the municipality which determines which movement mangers get to discharge vehicles. Winning movement managers get to discharge vehicles from their queues for the duration of time associated with the win. A realization of the model is presented to illustrate these ideas. It involves two approaches, arriving drivers, two movement managers, and a municipality. The movement managers control the conflicting one-way traffic streams. They determine what bids to submit given the status of the system at each point in time, recalibrate those strategies based on past experience with their use, forecast the performance of those strategies, take actions based on those analyses, and then repeat the process in each time step as the simulation unfolds.
DA - 2015///
PY - 2015///
DO - 10.1109/itsc.2015.477
SP - 2900-2906
SN - 2153-0009
ER -
TY - JOUR
TI - A Collaborative Approach to Predicting Service Price for QoS-Aware Service Selection
AU - Wang, Puwei
AU - Kalia, Anup K.
AU - Singh, Munindar P.
AU - Zhu, H
T2 - 2015 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS)
AB - In QoS-aware service selection, a service requester seeks to maximize its utility by selecting a service provider that charges the lowest service price while meeting the requester's QoS requirements. In existing selection approaches, a service requester focuses on finding providers based on their QoS and thereby ignores their service prices that could change with their QoS. High QoS may provide more benefits, but may require a high service price. As a result, the highest QoS may not produce the maximum utility. A service requester and candidate service providers have a conflicting interest over service prices. Since a provider would not reveal its minimum acceptabl price, it is important for a requester to predict the minimum price for a service that meets its QoS requirements. We propose a collaborative approach to predicting a provider's minimum price for a desired QoS based on prior usage experience. The experimental results show our approach can find the optimal service providers efficiently and effectively.
DA - 2015///
PY - 2015///
DO - 10.1109/icws.2015.15
SP - 33-40
UR - https://publons.com/publon/21294400/
ER -
TY - CONF
TI - TRACE: A dynamic model of trust for people-driven service engagements combining trust with risk, commitments, and emotions
AU - Kalia, A. K.
AU - Murukannaiah, P. K.
AU - Singh, M. P.
C2 - 2015///
C3 - Service-oriented computing, (icsoc 2015)
DA - 2015///
VL - 9435
SP - 353-361
ER -
TY - CONF
TI - Positron: Composing commitment-based protocols
AU - Gerard, S. N.
AU - Telang, P. R.
AU - Kalia, A. K.
AU - Singh, M. P.
C2 - 2015///
C3 - Service-oriented computing, (icsoc 2015)
DA - 2015///
VL - 9435
SP - 19-35
ER -
TY - CONF
TI - On the impact of scheduler settings on the performance of multi-threaded SIP servers
AU - Krishnamurthy, R.
AU - Rouskas, George
AB - Multi-threading is a widely used program execution model, where each thread executes independently while sharing some of the process resources. Multi-threaded processes are used for a range of network application servers including web servers, mail servers and SIP proxy servers (SPS) for Voice over IP (VoIP). The process scheduler is a core part of any Operating System and the policy it uses may have a significant impact on the various applications executing on the system. In this work, we investigate the impact of the Linux scheduler on the performance of OpenSIPS, an open source SIP proxy server. The version of Linux used in our study uses a scheduling policy known as “Completely Fair Scheduler” (CFS), and the Linux kernel provides several parameters that may be used to tune the CFS policy. We have collected a large set of experimental data, in a methodical fashion, to characterize the performance of SPS as a function of the number of server threads and the call arrival rate under (1) default CFS setting and (2) with CFS parameters tuned for improved performance. By fine tuning the scheduler parameters, SPS performance is improved in all scenarios, in some cases significantly. To the best of our knowledge, this is the first study that takes into account the scheduler parameters in improving the performance of the SPS. Our results indicate that network operators may increase server capacity without additional capital expenditures, by applying insightful configuration changes to scheduler policy.
C2 - 2015///
C3 - 2015 ieee international conference on communications (icc)
DA - 2015///
DO - 10.1109/icc.2015.7249307
SP - 6175–6180
ER -
TY - CONF
TI - Design of a protocol to enable economic transactions for network services
AU - Chen, X. M.
AU - Wolf, T.
AU - Griffioen, J.
AU - Ascigil, O.
AU - Dutta, Rudra
AU - Rouskas, George
AU - Bhat, S.
AU - Baldin, I.
AU - Calvert, K.
AB - Deployment of innovative new networking services requires support by network providers. Since economic motivation plays an important role for network providers, it is critical that a network architecture intrinsically considers economic relationships. We present the design of a protocol that associates access to network services with economic contracts. We show how this protocol can be realized in fundamentally different ways, using out-of-band signaling and in-band signaling, based on two different prototype implementations. We present results that show the effectiveness of the proposed protocol and thus demonstrate a first step toward realizing an economy plane for the Internet.
C2 - 2015///
C3 - 2015 ieee international conference on communications (icc)
DA - 2015///
DO - 10.1109/icc.2015.7249175
SP - 5354–5359
ER -
TY - CONF
TI - Combining practical and dialectical commitments for service engagements
AU - Telang, P. R.
AU - Kalia, A. K.
AU - Madden, J. F.
AU - Singh, M. P.
C2 - 2015///
C3 - Service-oriented computing, (icsoc 2015)
DA - 2015///
VL - 9435
SP - 3-18
ER -
TY - JOUR
TI - Bayesian uncertainty analysis of finite deformation viscoelasticity
AU - Miles, Paul
AU - Hays, Michael
AU - Smith, Ralph
AU - Oates, William
T2 - MECHANICS OF MATERIALS
AB - The viscoelasticity of the dielectric elastomer, VHB 4910, is experimentally characterized, modeled, and analyzed using Bayesian uncertainty analysis. Whereas these materials are known for their large-field induced deformation and broad applications in smart structures, the rate-dependent viscoelastic effects are not well understood. To address this issue, we quantify both the hyperelastic and viscoelastic constitutive behavior and use Bayesian uncertainty analysis to assess several key modeling attributes. Specifically, we compare an Ogden-based phenomenological model to a nonaffine hyperelastic model and couple hyperelasticity to both linear and nonlinear viscoelasticity. The utilization of Bayesian statistics is shown to provide insight into quantifying nonlinear viscoelasticity behavior as a function of internal state variables. The results are validated experimentally in the finite deformation regime over a range of stretch rates spanning four orders of magnitude (6.7×10-5–0.67 Hz). A unique set of hyperelastic parameters are identified, independent of the stretch rate. In addition, comparisons of the linear and nonlinear viscoelastic models demonstrate a reduction in modeling error by approximately a factor of three. Finally, the viscoelastic time constant is shown to produce an inverse stretch rate power law dependence regardless of which hyperelastic model is used.
DA - 2015/12//
PY - 2015/12//
DO - 10.1016/j.mechmat.2015.07.002
VL - 91
SP - 35-49
SN - 1872-7743
KW - Viscoelasticity
KW - Uncertainty
KW - Dielectric elastomers
KW - Bayesian statistics
ER -
TY - CONF
TI - Analysis of a downward substitution strategy in a manufacturing/remanufacturing system
AU - Gocer, F.
AU - Ahiska, S. S.
AU - King, R. E.
C2 - 2015///
C3 - Operations research and enterprise systems, icores 2014
DA - 2015///
VL - 509
SP - 186-198
ER -
TY - BOOK
TI - The inverse problem of the calculus of variations: Local and global theory
DA - 2015///
PY - 2015///
DO - 10.2991/978-94-6239-109-3
PB - Amsterdam: Atlantis Press
SN - 9789462391086
ER -
TY - JOUR
TI - Some new analysis results for a class of interface problems
AU - Li, Zhilin
AU - Wang, Li
AU - Aspinwall, Eric
AU - Cooper, Racheal
AU - Kuberry, Paul
AU - Sanders, Ashley
AU - Zeng, Ke
T2 - MATHEMATICAL METHODS IN THE APPLIED SCIENCES
AB - Interface problems modeled by differential equations have many applications in mathematical biology, fluid mechanics, material sciences, and many other areas. Typically, interface problems are characterized by discontinuities in the coefficients and/or the Dirac delta function singularities in the source term. Because of these irregularities, solutions to the differential equations are not smooth or discontinuous. In this paper, some new results on the jump conditions of the solution across the interface are derived using the distribution theory and the theory of weak solutions. Some theoretical results on the boundary singularity in which the singular delta function is at the boundary are obtained. Finally, the proof of the convergency of the immersed boundary (IB) method is presented. The IB method is shown to be first‐order convergent in L ∞ norm. Copyright © 2013 John Wiley & Sons, Ltd.
DA - 2015/12//
PY - 2015/12//
DO - 10.1002/mma.2865
VL - 38
IS - 18
SP - 4530-4539
SN - 1099-1476
KW - immersed boundary (IB) method
KW - immersed interface method (IIM)
KW - jump conditions
KW - discontinuous coefficient
KW - Dirac delta function
KW - weak solution
KW - boundary singularity
KW - convergence of IB method
KW - equivalent boundary conditions
ER -
TY - JOUR
TI - Revenue Optimization Frameworks for Multi-Class PEV Charging Stations
AU - Kong, Cuiyu
AU - Bayram, Islam Safak
AU - Devetsikiotis, Michael
T2 - IEEE ACCESS
AB - The charging power of plug-in electric vehicles (PEVs) decreases significantly when the state of charge (SoC) gets closer to the fully charged state, which leads to a longer charging duration. Each time when the battery is charged at high rates, it incurs a significant degradation cost that shortens the battery life. Furthermore, the differences between demand preferences, battery types, and charging technologies make the operation of the charging stations a complex problem. Even though some of these issues have been addressed in the literature, the charging station modeling with battery models and different customer preferences have been neglected. To that end, this paper proposes two queueing-based optimization frameworks. In the first one, the goal is to maximize the system revenue for single class customers by limiting the requested SoC targets. The PEV cost function is composed of battery degradation cost, the waiting cost in the queue, and the admission fee. Under this framework, the charging station is modeled as a $M/G/S/K$ queue, and the system performance is assessed based on the numerical and simulation results. In the second framework, we describe an optimal revenue model for multi-class PEVs, building upon the approach utilized in the first framework. Two charging strategies are proposed: 1) a dedicated charger model and 2) a shared charger model for the multi-class PEVs. We evaluate and compare these strategies. Results show that the proposed frameworks improve both the station performance and quality of service provided to customers. The results show that the system revenue is more than doubled when compared with the baseline scenario which includes no limitations on the requested SoC.
DA - 2015///
PY - 2015///
DO - 10.1109/access.2015.2498105
VL - 3
SP - 2140-2150
SN - 2169-3536
KW - Electric vehicle
KW - queuing system
KW - multi-class
KW - dedicated chargers
KW - shared chargers
ER -
TY - JOUR
TI - Insights into the Spin-State Transitions in [Fe(tpy)2]2+: Importance of the Terpyridine Rocking Motion
AU - Nance, James
AU - Bowman, David N.
AU - Mukherjee, Sriparna
AU - Kelley, C. T.
AU - Jakubikova, Elena
T2 - Inorganic Chemistry
AB - Iron(II) polypyridine complexes have the potential for numerous applications on a global scale, such as sensitizers, sensors, and molecular memory. The excited-state properties of these systems, particularly the intersystem crossing (ISC) rates, are sensitive to the choice of ligands and can be significantly altered depending on the coordination environment. We employ density functional theory and Smolyak's sparse grid interpolation algorithm to construct potential energy surfaces (PESs) for the photophysically relevant states ((1)A, (3,5)MC, and (1,3)MLCT) of the [Fe(tpy)2](2+) (tpy = 2,2':6',2"-terpyridine) complex, with the goal of obtaining a deeper understanding of the ground- and excited-state electronic structure of this system. The three dimensions that define our adiabatic PESs consist of equatorial and axial metal-ligand bond length distortions and a terpyridine ligand "rocking angle", which has not previously been investigated. The intersection crossing seams and minimum energy crossing points (MECPs) between surfaces are also determined. Overall, we find that the PESs of all electronic excited states investigated are characterized by low-energy valleys along the tpy rocking-angle coordinate. This results in the presence of large low-energy areas around the MECPs on the intersection seams of different electronic states and indicates that inclusion of this third coordinate is crucial for an adequate description of the PESs and surface crossing seams of the [Fe(tpy)2](2+) complex. Finally, we suggest that tuning the energetics of the tpy ligand rocking motion could provide a way to control the ISC process in this complex.
DA - 2015/11/16/
PY - 2015/11/16/
DO - 10.1021/acs.inorgchem.5b01747
VL - 54
IS - 23
SP - 11259-11268
J2 - Inorg. Chem.
LA - en
OP -
SN - 0020-1669 1520-510X
UR - http://dx.doi.org/10.1021/acs.inorgchem.5b01747
DB - Crossref
ER -
TY - JOUR
TI - Adaptive Bayesian procedures using random series priors
AU - Shen, W. N.
AU - Ghosal, S.
T2 - Scandinavian Journal of Statistics: Theory and Applications
DA - 2015///
PY - 2015///
VL - 42
IS - 4
SP - 1194-1213
ER -
TY - JOUR
TI - Crowdsourcing cloud-based software development foreword
AU - Singh, M. P.
T2 - Crowdsourcing: cloud-based software development
DA - 2015///
PY - 2015///
SP - V-
ER -
TY - CONF
TI - A Dynamic Feature Selection Based LDA Approach to Baseball Pitch Prediction
AU - Hoang, P.
AU - Hamilton, M.
AU - Murray, J.
AU - Stafford, C.
AU - Tran, H.
T2 - PAKDD 2015 Workshops: BigPMA, VLSP, QIMIE, DAEBH
A2 - Li, Xiao-Li
A2 - Cao, Tru
A2 - Lim, Ee-Peng
A2 - Zhou, Zhi-Hua
A2 - Ho, Tu-Bao
A2 - Cheung, David
T3 - Lecture Notes in Computer Science
AB - Baseball, which is one of the most popular sports in the world, has a uniquely discrete gameplay structure. This stop-and-go style of play creates a natural ability for fans and observers to record information about the game in progress, resulting in a wealth of data that is available for analysis. Major League Baseball (MLB), the professional baseball league in the US and Canada, uses a system known as PITCHf/x to record information about every individual pitch that is thrown in league play. We extend the classification to pitch prediction (fastball or nonfastball) by restricting our analysis to pre-pitch features. By performing significant feature analysis and introducing a novel approach for feature selection, moderate improvement over published results is achieved.
C2 - 2015///
C3 - Trends and Applications in Knowledge Discovery and Data Mining
CY - Ho Chi Minh City, Vietnam
DA - 2015///
PY - 2015/5/19/
DO - 10.1007/978-3-319-25660-3_11
VL - 9441
SP - 125–137
PB - Springer
SN - 978-3-319-25659-7
KW - Machine learning
KW - Hypothesis testing
KW - Feature selection
KW - Pitch prediction
KW - PITCHf/x
KW - MLB
KW - LDA
KW - ROC
ER -
TY - CONF
TI - Robust fault detection filter design for linear uncertain systems with unknown inputs
AU - Liu, Y.
AU - Wu, F.
AU - Ban, X. J.
AB - In this paper, a robust fault detection filter design method for uncertain systems in linear fractional transformation (LFT) formulation with unknown inputs is proposed. The basic idea is to convert the complicated ℋ-/ℋ ∞ problem to an easier ℋ ∞ model following problem. Moreover, two major improvements have been made in this research. First, the uncertain systems in LFT formulation are studied. This class of uncertain models is capable of approximating complex nonlinear dynamics. Second, a more general form of filter is employed to achieve a better fault detection and disturbance rejection performance. It involves the widely used observer-based filter as a special case. With structured uncertainties, it has been shown the robust fault detection filter design can be solved by a convex optimization condition in terms of linear matrix inequalities (LMIs). An illustrative design example is used to demonstrate the effectiveness and better performance of the proposed approach.
C2 - 2015///
C3 - 2015 american control conference (acc)
DA - 2015///
DO - 10.1109/acc.2015.7170846
SP - 886-891
ER -
TY - JOUR
TI - On shape-preserving capability of cubic L-1 spline fits
AU - Wang, Ziteng
AU - Fang, Shu-Cherng
AU - Lavery, John E.
T2 - COMPUTER AIDED GEOMETRIC DESIGN
AB - Cubic L 1 spline fits have shown some favorable shape-preserving property for geometric data. To quantify the shape-preserving capability, we consider the basic shape of two parallel line segments in a given window. When one line segment is sufficiently longer than the other, the spline fit can preserve its linear shape in at least half of the window. We propose to use the minimum of such length difference as a shape-preserving metric because it represents the extra information that the spline fits need to preserve the shape. We analytically calculate this metric in a 3-node window for second-derivative-based, first-derivative-based and function-value-based spline fits. In a 5-node window, we compute this metric numerically. In both cases, the shape-preserving metric is rather small, which explains the observed strong shape-preserving capability of spline fits. Moreover, the function-value-based spline fits are indicated to preserve shape better than the other two types of spline fits. This study initiates a quantitative research on shape preservation of L 1 spline fits. We analytically quantify shape-preserving capability of cubic L1 spline fits.We propose a shape-preserving metric for the linear shape of Heaviside step function.We analytically calculate and numerically compute the metric.We find that function-value-based spline fits preserve linear shape best.
DA - 2015/12//
PY - 2015/12//
DO - 10.1016/j.cagd.2015.09.004
VL - 40
SP - 59-75
SN - 1879-2332
KW - L-1 spline
KW - Shape preservation
KW - Approximation
KW - Spline fit
KW - Univariate
ER -
TY - CONF
TI - Almost output regulation of discrete-time switched linear systems
AU - Yuan, C. Z.
AU - Duan, C.
AU - Wu, F.
AB - In this paper, we propose a new hybrid control approach for almost output regulation of a class of discrete-time switched linear systems with average dwell time (ADT). Both controlled plant and exosystem are described by switched linear systems. The proposed hybrid controller is constructed as a switching impulsive system, where the controller states will undergo impulsive jumps at each switching instant. By using the ADT technique incorporated with multiple quadratic Lyapunov functions, the hybrid synthesis conditions for almost output regulation with asymptotic stability and weighted ℋ ∞ performance are formulated as a set of linear matrix equations and linear matrix inequalities (LMIs), which can be solved effectively. The proposed hybrid control method has been demonstrated through a numerical example.
C2 - 2015///
C3 - 2015 american control conference (acc)
DA - 2015///
DO - 10.1109/acc.2015.7171961
SP - 4042-4047
ER -
TY - JOUR
TI - QoS-aware ant-based route, wavelength and timeslot assignment algorithm for optical burst switchednetworks
AU - Coulibaly, Yahaya
AU - Rouskas, George
AU - Abd Latiff, Muhammad Shafie
AU - Razzaque, M. A.
AU - Mandala, Satria
T2 - TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES
AB - Abstract All‐optical networks are the aspiration of bandwidth‐greedy applications providers and users such as telecom operators and scientific research centres. Because of the limitations of current network infrastructures, some optical switching paradigms have been proposed. Among these paradigms, optical burst switching (OBS) is seen as the most appropriate solution. However, OBS suffers from high burst loss ratio as a result of contention at the buffer‐less core node. According to current optical technology reviews, cost effective optical memories are yet to be cost effective. In this paper, an ant‐based route, wavelength and timeslot allocation algorithm is proposed to address high burst loss in OBS and improve the overall network performance. The solution was implemented in hierarchical time‐sliced OBS and was evaluated through computer simulation where it was compared with shortest path (SP) algorithm. Simulation results show that the proposed algorithm outperforms SP in terms of burst loss ratio and delay. Copyright © 2015 John Wiley & Sons, Ltd.
DA - 2015/11//
PY - 2015/11//
DO - 10.1002/ett.2919
VL - 26
IS - 11
SP - 1265-1277
SN - 2161-3915
ER -
TY - JOUR
TI - Newton's Method for Monte Carlo--Based Residuals
AU - Willert, Jeffrey
AU - Chen, Xiaojun
AU - Kelley, C. T.
T2 - SIAM Journal on Numerical Analysis
AB - We analyze the behavior of inexact Newton methods for problems where the nonlinear residual, Jacobian, and Jacobian-vector products are the outputs of Monte Carlo simulations. We propose algorithms which account for the randomness in the iteration, develop theory for the behavior of these algorithms, and illustrate the results with an example from neutronics.
DA - 2015/1//
PY - 2015/1//
DO - 10.1137/130905691
VL - 53
IS - 4
SP - 1738-1757
J2 - SIAM J. Numer. Anal.
LA - en
OP -
SN - 0036-1429 1095-7170
UR - http://dx.doi.org/10.1137/130905691
DB - Crossref
KW - Newton's method
KW - Monte Carlo simulation
KW - JFNK methods
KW - neutron transport
ER -
TY - JOUR
TI - Gain scheduling output feedback control of linear plants with actuator saturation
AU - Ban, Xiaojun
AU - Wu, Fen
T2 - JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
AB - From a gain-scheduling perspective, we will study the output feedback control problem for linear systems with some of control channels subject to actuator saturation. This includes the scenario of all actuator saturation as a special case. A feedback controller, expressed in the form of linear fractional transformation, is proposed to guarantee regional stability of the closed-loop system and provide disturbance/error attenuation measured in L2 gain. The resulting synthesis condition is formulated as linear matrix inequalities (LMIs) and can be solved efficiently. Moreover, explicit formulas are derived to calculate controller gains, which reduces the computational cost compared to the method of directly solving the LMI-based condition. Numerical examples are provided to demonstrate the proposed saturation control approach.
DA - 2015/10//
PY - 2015/10//
DO - 10.1016/j.jfranklin.2015.06.005
VL - 352
IS - 10
SP - 4163-4187
SN - 1879-2693
ER -
TY - JOUR
TI - Fast translation invariant multiscale image denoising
AU - Li, M.
AU - Ghosal, S.
T2 - IEEE Transactions on Image Processing
DA - 2015///
PY - 2015///
VL - 24
IS - 12
SP - 4876-4887
ER -
TY - JOUR
TI - Exact Detection of Information Leakage in Database Access Control
AU - Alborzi, Farid
AU - Chirkova, Rada
AU - Yu, Ting
T2 - BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY
AB - Elaborate security policies often require organizations to restrict user data access in a fine-grained manner, instead of traditional table- or column-level access control. Not surprisingly, managing fine-grained access control in software is rather challenging. In particular, if access is not configured carefully, information leakage may happen: Users may infer sensitive information through the data explicitly accessible to them in centralized systems or in the cloud. In this paper we formalize this information-leakage problem, by modeling sensitive information as answers to “secret queries,” and by modeling access-control rules as views. We focus on the scenario where sensitive information can be deterministically derived by adversaries. We review a natural data-exchange based inference model for detecting information leakage, and show its capabilities and limitation. We then introduce and formally study a new inference model, view-verified data exchange, that overcomes the limitation for the query language under consideration.
DA - 2015///
PY - 2015///
DO - 10.1007/978-3-319-22729-0_31
VL - 9263
SP - 403-415
SN - 1611-3349
KW - Privacy and security in cloud intelligence
KW - Data exchange
ER -
TY - JOUR
TI - Effective matrix-free preconditioning for the augmented immersed interface method
AU - Xia, Jianlin
AU - Li, Zhilin
AU - Ye, Xin
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - We present effective and efficient matrix-free preconditioning techniques for the augmented immersed interface method (AIIM). AIIM has been developed recently and is shown to be very effective for interface problems and problems on irregular domains. GMRES is often used to solve for the augmented variable(s) associated with a Schur complement A in AIIM that is defined along the interface or the irregular boundary. The efficiency of AIIM relies on how quickly the system for A can be solved. For some applications, there are substantial difficulties involved, such as the slow convergence of GMRES (particularly for free boundary and moving interface problems), and the inconvenience in finding a preconditioner (due to the situation that only the products of A and vectors are available). Here, we propose matrix-free structured preconditioning techniques for AIIM via adaptive randomized sampling, using only the products of A and vectors to construct a hierarchically semiseparable matrix approximation to A. Several improvements over existing schemes are shown so as to enhance the efficiency and also avoid potential instability. The significance of the preconditioners includes: (1) they do not require the entries of A or the multiplication of AT with vectors; (2) constructing the preconditioners needs only O(logN) matrix–vector products and O(N) storage, where N is the size of A; (3) applying the preconditioners needs only O(N) flops; (4) they are very flexible and do not require any a priori knowledge of the structure of A. The preconditioners are observed to significantly accelerate the convergence of GMRES, with heuristical justifications of the effectiveness. Comprehensive tests on several important applications are provided, such as Navier–Stokes equations on irregular domains with traction boundary conditions, interface problems in incompressible flows, mixed boundary problems, and free boundary problems. The preconditioning techniques are also useful for several other problems and methods.
DA - 2015/12/15/
PY - 2015/12/15/
DO - 10.1016/j.jcp.2015.09.050
VL - 303
SP - 295-312
SN - 1090-2716
KW - Augmented immersed interface method
KW - Schur complement system
KW - GMRES
KW - Matrix-free preconditioning
KW - Hierarchically semiseparable structure
KW - Adaptive randomized compression
ER -
TY - CONF
TI - Determining query readiness for structured data
AU - Alborzi, F.
AU - Chirkova, R.
AU - Doyle, J.
AU - Fathi, Y.
C2 - 2015///
C3 - Big data analytics and knowledge discovery
DA - 2015///
VL - 9263
SP - 3-14
ER -
TY - JOUR
TI - A diagnostic expert system for the dyeing of protein fibres
AU - Sawatwarakul, Weethima
AU - Joines, Jeff
AU - Shamey, Renzo
T2 - COLORATION TECHNOLOGY
AB - Coloration of protein fibres is characterised by many variables, each with a different effect on the final product. Because the process can be rather complicated, it is often difficult to achieve the right colour in the first dyeing attempt. Determining the root causes of a given problem tends to be even more challenging. While quality requirements in the textile industry have become increasingly rigorous, seasoned coloration experts have become rather scarce. This situation has exacerbated the need for the development and implementation of expert systems to augment available expertise in this domain. In addition, benefits associated with computer‐based diagnostic systems have become increasingly evident over the past few decades, and the field remains an active area of research. Here we report the design and development of a diagnostic expert system for the dyeing of protein fibres. The system is designed to aid in the identification of root causes of problems with a view to enabling users to arrive quickly at remedial solutions. The performance of the system has been tested and evaluated by human experts and deemed to be highly satisfactory. This diagnostic system can be used to teach students, may be utilised by novice colourists as a problem‐solving tool, and may be employed as a supplementary knowledge resource by seasoned dyers.
DA - 2015/10//
PY - 2015/10//
DO - 10.1111/cote.12166
VL - 131
IS - 5
SP - 389-395
SN - 1478-4408
ER -
TY - JOUR
TI - Special issue on Bayesian nonparametrics
AU - Ghoshal, S.
AU - Kleijn, B.
AU - Vaart, A.
AU - van
AU - Zanten, H.
T2 - Journal of Statistical Planning and Inference
DA - 2015///
PY - 2015///
VL - 166
SP - 1-1
ER -
TY - JOUR
TI - Set covering-based topsis method for sloving sup-T equation constrained multi-objective optimization problems
AU - Hu, Cheng-Feng
AU - Fang, Shu-Cherng
T2 - JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING
DA - 2015/9//
PY - 2015/9//
DO - 10.1007/s11518-014-5261-x
VL - 24
IS - 3
SP - 258-275
SN - 1861-9576
KW - Fuzzy relational equations
KW - fuzzy optimization
KW - set covering problems
ER -
TY - JOUR
TI - Preface
AU - Rui, Xiaoting
AU - Pfeiffer, Friedrich G.
AU - Zhang, Chuanzeng
AU - Wang, Shimin
AU - Wu, Fen
T2 - ADVANCES IN MECHANICAL ENGINEERING
DA - 2015/9//
PY - 2015/9//
DO - 10.1177/1687814015604802
VL - 7
IS - 9
SP -
SN - 1687-8140
ER -
TY - JOUR
TI - Prediction consistency of forward iterated regression and selection technique
AU - Luo, Shikai
AU - Ghosal, Subhashis
T2 - STATISTICS & PROBABILITY LETTERS
AB - Recently, Hwang et al. (2009) introduced a penalized forward selection technique for high dimensional linear regression which appears to possess excellent prediction and variable selection properties. In this article, we show that the procedure is prediction consistent.
DA - 2015/12//
PY - 2015/12//
DO - 10.1016/j.spl.2015.08.005
VL - 107
SP - 79-83
SN - 1879-2103
KW - Forward selection
KW - High dimension
KW - Sparsity
KW - Linear regression
KW - Penalization
KW - Prediction consistency
ER -
TY - JOUR
TI - On the Treatment of Trucks in Roundabout Analyses
AU - List, George F.
AU - Yang, Bo
AU - Schroeder, Bastian J.
T2 - TRANSPORTATION RESEARCH RECORD
AB - Trucks are not always addressed explicitly in planning studies and operational analyses, even though they are a very important part of the nation's economic engine. Most planning studies account for trucks as a percentage of the total traffic flow. The Highway Capacity Manual (HCM) converts trucks into autos through the use of a passenger car equivalency (PCE) factor. If the PCE is 2, then a truck is assumed to be equivalent to two autos. However, trucks are beginning to receive more attention, including that in the context of capacity assessments. A recent research effort focused on developing a level-of-service assessment for trucks and for enhancing the way that the impact of trucks is taken into account on freeways, arterials, and roundabouts. This paper focuses on the roundabout aspects of that research. The three roundabout-related objectives in the project were (a) to refine the PCE values used to convert trucks into auto equivalents for the flow on roundabout approaches, (b) to recalibrate the capacity equation so that it more appropriately accounts for trucks, and (c) to develop ways to estimate truck speeds so that travel times through the roundabout could be computed. The results of these analyses are presented as well as the methodology and data employed.
DA - 2015///
PY - 2015///
DO - 10.3141/2483-16
IS - 2483
SP - 140-147
SN - 2169-4052
ER -
TY - JOUR
TI - On the Treatment of Trucks for Analysis of Freeway Capacity
AU - List, George F.
AU - Yang, Bo
AU - Rouphail, Nagui M.
T2 - TRANSPORTATION RESEARCH RECORD
AB - The influence of trucks on highway performance has always been of interest. However, planning studies today tend to assume that a certain percentage of the traffic stream is trucks (e.g., 5%) and to make adjustments accordingly. The Highway Capacity Manual (HCM) converts trucks into passenger car equivalents by using a passenger car equivalent factor. For the HCM, however, this situation is changing. This paper describes changes to the basic freeway section methodology that are being developed to better address truck-related issues. Specifically, new models predict the space mean speeds of autos and trucks in mixed traffic streams for a variety of road grades. Also presented is a capacity adjustment factor that allows conversion of capacity values for auto-only conditions to be transformed into equivalent capacity values for mixed traffic conditions. The methodologies are presented, their development is described, and examples are given to illustrate how the procedure works.
DA - 2015///
PY - 2015///
DO - 10.3141/2483-14
IS - 2483
SP - 120-129
SN - 2169-4052
ER -
TY - JOUR
TI - DIRECT SAMPLING METHOD FOR DIFFUSIVE OPTICAL TOMOGRAPHY
AU - Chow, Yat Tin
AU - Ito, Kazufumi
AU - Liu, Keji
AU - Zou, Jun
T2 - SIAM JOURNAL ON SCIENTIFIC COMPUTING
AB - In this work, we are concerned with the diffusive optical tomography (DOT) problem in the case when only one or two pairs of Cauchy data are available. We propose a simple and efficient direct sampling method to locate inhomogeneities inside a homogeneous background and solve the DOT problem in both full and limited aperture cases. This new method is easy to implement and less expensive computationally. Numerical experiments demonstrate its effectiveness and robustness against noise in the data. This provides a new promising numerical strategy for the DOT problem.
DA - 2015///
PY - 2015///
DO - 10.1137/14097519x
VL - 37
IS - 4
SP - A1658-A1684
SN - 1095-7197
KW - direct sampling method
KW - diffusive optical tomography
ER -
TY - JOUR
TI - CONDITIONING OF LEVERAGE SCORES AND COMPUTATION BY QR DECOMPOSITION
AU - Holodnak, John T.
AU - Ipsen, Ilse C. F.
AU - Wentworth, Thomas
T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
AB - The leverage scores of a full-column rank matrix $A$ are the squared row norms of any orthonormal basis for $\mathrm{range}\,(A)$. We show that corresponding leverage scores of two matrices $A$ and $A+\Delta A$ are close in the relative sense if they have large magnitude and if all principal angles between the column spaces of $A$ and $A+\Delta A$ are small. We also show three classes of bounds that are based on perturbation results of QR decompositions. They demonstrate that relative differences between individual leverage scores strongly depend on the particular type of perturbation $\Delta A$. The bounds imply that the relative accuracy of an individual leverage score depends on its magnitude and the two-norm condition of $A$ if $\Delta A$ is a general perturbation; the two-norm condition number of $A$ if $\Delta A$ is a perturbation with the same normwise row-scaling as $A$; (to first order) neither condition number nor leverage score magnitude if $\Delta A$ is a componentwise row-scaled perturbation. Numerical experiments confirm the qualitative and quantitative accuracy of our bounds.
DA - 2015///
PY - 2015///
DO - 10.1137/140988541
VL - 36
IS - 3
SP - 1143-1163
SN - 1095-7162
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84944583307&partnerID=MN8TOARS
KW - principal angles
KW - stable rank
KW - condition number
KW - row-scaling
KW - componentwise perturbations
ER -
TY - JOUR
TI - A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
AU - Nance, J.
AU - Kelley, C. T.
T2 - SIAM Journal on Scientific Computing
AB - In this paper we present a new implementation of Smolyak's sparse grid interpolation algorithm designed for dynamical simulations. The implementation is motivated by an application to quantum chemistry where the goal is to simulate photo-induced molecular transformations. A molecule conforms to a geometry that minimizes its potential energy, and many molecules have multiple potential energy minima. These geometries correspond to local minima of the molecule's potential energy surface, and one can simulate how a molecule transitions from one geometry to another by following the steepest descent path, or reaction path, on potential energy surfaces. Molecular vibrations and thermal fluctuations cause randomness in dynamics, so one must follow several paths simultaneously to more accurately simulate possible reaction paths. Current algorithms for reaction path following are too computationally burdensome for molecules of moderate size, but Smolyak's interpolation algorithm offers a cheap surrogate for potential energy surfaces. While current implementations of Smolyak's algorithm are not designed to simultaneously follow multiple reaction paths efficiently, our implementation of Smolyak's algorithm achieves this efficiency by recursively defining Lagrange basis polynomials and making use of an efficient reformulation of Smolyak's algorithm. In this paper we describe our new implementation of Smolyak's algorithm and compare performance times to MATLAB's Sparse Grid Interpolation Toolbox to demonstrate its computational savings. We also present dynamical simulations for the photoisomerization of 2-butene as an example of our reaction path following method.
DA - 2015/1//
PY - 2015/1//
DO - 10.1137/140965284
VL - 37
IS - 5
SP - S137-S156
J2 - SIAM J. Sci. Comput.
LA - en
OP -
SN - 1064-8275 1095-7197
UR - http://dx.doi.org/10.1137/140965284
DB - Crossref
KW - sparse interpolation
KW - sparse grids
KW - Smolyak's algorithm
KW - dynamics
KW - reaction path following
ER -
TY - JOUR
TI - The immersed interface method for axis-symmetric problems and application to the Hele-Shaw flow
AU - Ruiz Alvarez, Juan
AU - Li, Zhilin
T2 - APPLIED MATHEMATICS AND COMPUTATION
AB - Many physical application problems are axis-symmetric. Using axis-symmetric properties, many three dimensional problems can be solved efficiently using two dimensional axis-symmetric coordinates. In this paper, the immersed interface method (IIM) in axis-symmetric coordinates is developed for elliptic interface problems that have a discontinuous coefficient, solution or flux. A staggered grid is used to overcome the pole singularity. Other challenges include deriving the jump relations in axis-symmetric coordinates, designing the numerical algorithm when the interface is close to the pole (r = 0); computing interface quantities such as the normal and tangential directions, surface derivatives, curvature information, etc. The numerical algorithm is based on a finite difference discretization and uniform grid in the axis-symmetric coordinates. The finite difference scheme is the standard one away from the interface but is modified at grid points near and on the interface. The method is shown to be second order accurate in the infinity norm. The developed new IIM is applied to the Hele-Shaw flow and compared with the results from the literature.
DA - 2015/8/1/
PY - 2015/8/1/
DO - 10.1016/j.amc.2015.03.131
VL - 264
SP - 179-197
SN - 1873-5649
KW - Immersed interface method
KW - Axis-symmetric interface problem
KW - Discontinuous coefficients
KW - Finite difference method
KW - Level set method
KW - Hele-Shaw flow
ER -
TY - CONF
TI - RFI modeling and prediction approach for SATOPS applications
AU - Nguyen, Tien M.
AU - Tran, Hien T.
AU - Wang, Zhonghai
AU - Coons, Amanda
AU - Nguyen, Charles C.
AU - Lane, Steven A.
AU - Pham, Khanh D.
AU - Chen, Genshe
AU - Wang, Gang
T2 - SPIE Defense + Security
A2 - Pham, Khanh D.
A2 - Chen, Genshe
AB - This paper describes innovative frameworks to develop RFI modeling and prediction models for (i) estimating the RFI characteristics, (ii) evaluating effectiveness of the existing Unified S-Band (USB) command waveforms employed by civil, commercial and military SATOPS ground stations, and (iii) predicting the impacts of RFI on USB command systems. The approach presented here will allow the communications designer to characterize both friendly and unfriendly RFI sources, and evaluate the impacts of RFI on civil, commercial and military USB SATOPS systems. In addition, the proposed frameworks allow the designer to estimate the optimum transmitted signal power to maintain a required USB SATOPS Quality-of-Service (QoS) in the presence of both friendly and unfriendly RFI sources.
C2 - 2015/5/22/
C3 - Sensors and Systems for Space Applications VIII
DA - 2015/5/22/
DO - 10.1117/12.2177955
VL - 9469
SP -
PB - SPIE
UR - http://dx.doi.org/10.1117/12.2177955
DB - Crossref
KW - Friendly RFI
KW - Unfriendly RFI
KW - Detection
KW - Prediction
KW - Satellite Operations
KW - Command
KW - Quality-of-Service
KW - Bit Error Rate
KW - Synchronization
KW - Unified-S-Band
KW - Satellite Control Network
KW - Interference Protection Criteria
ER -
TY - JOUR
TI - On the sectorial property of the Caputo derivative operator
AU - Ito, Kazufumi
AU - Jin, Bangti
AU - Takeuchi, Tomoya
T2 - APPLIED MATHEMATICS LETTERS
AB - In this note, we establish the sectorial property of the Caputo fractional derivative operator of order α∈(1,2) with a zero Dirichlet boundary condition.
DA - 2015/9//
PY - 2015/9//
DO - 10.1016/j.aml.2015.03.001
VL - 47
SP - 43-46
SN - 0893-9659
KW - Caputo fractional derivative
KW - Sectorial property
ER -
TY - JOUR
TI - Muon: designing multiagent communication protocols from interaction scenarios
AU - Kalia, Anup K.
AU - Singh, Munindar P.
T2 - AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
AB - Designing a suitable communication protocol is a key challenge in engineering a multiagent system. This paper proposes Muon, an approach that begins from representative samples of interactions or scenarios. Muon identifies key semantic structures and patterns based on (social) commitments to formally analyze the scenarios and offers a methodology for designing protocols that would meet stakeholder needs. Interestingly, Muon applies its formal representations to suggest ways to identify additional scenarios needed to address exceptions arising in the interactions. This paper contributes (1) a conceptual model of message types and causal relationships among them as a foundation for developing commitment-based communication protocols; (2) a robust, reusable characterization of semantic structures reflecting the above model; (3) a mapping from an annotated scenario to causally related interactions; and (4) a methodology to synthesize specifications of communication protocols. This paper reports on an empirical evaluation involving developers creating protocols from two real-life cases.
DA - 2015/7//
PY - 2015/7//
DO - 10.1007/s10458-014-9264-2
VL - 29
IS - 4
SP - 621-657
SN - 1573-7454
UR - https://publons.com/publon/21294392/
KW - Commitments
KW - Protocols
KW - Interactions
KW - Dooley graphs
ER -
TY - JOUR
TI - Lobatto IIIA methods, direct transcription, and DAEs with delays
AU - Betts, John T.
AU - Campbell, Stephen L.
AU - Thompson, Karmethia
T2 - NUMERICAL ALGORITHMS
DA - 2015/6//
PY - 2015/6//
DO - 10.1007/s11075-014-9896-y
VL - 69
IS - 2
SP - 291-300
SN - 1572-9265
KW - Optimal control
KW - Delays
KW - Direct transcription
KW - Numerical discretizations
KW - Stability
ER -
TY - JOUR
TI - Inventory policy characterisation methodologies for a single-product recoverable manufacturing system
AU - Ahiska, Semra Sebnem
AU - King, Russell E.
T2 - European J. of Industrial Engineering
AB - We consider the production/inventory control for a recoverable system with stochastic demand and returns where stock is replenished by manufacturing new items or remanufacturing returned items. The optimal control policy found by solving a Markov decision process (MDP) for a given problem instance can be represented by a list of the optimal manufacturing and remanufacturing decisions for each possible inventory state. This list does not provide any general structure or insight for the optimal control nor is it practical for implementation. We propose two heuristic methodologies which can be used together to provide intuitive, easy to implement, near–optimal to optimal policies. This allows the policy for new scenarios to be determined without requiring solution of the MDP model. Results from a numerical experimentation show that the characterisations provided by our proposed methodologies represent the optimal inventory policies well with small deviations from optimal cost. [Received 9 March 2013; Revised 15 July 2013; Revised 20 November 2013; Accepted 1 January 2014]
DA - 2015///
PY - 2015///
DO - 10.1504/ejie.2015.068652
VL - 9
IS - 2
SP - 222
J2 - EJIE
LA - en
OP -
SN - 1751-5254 1751-5262
UR - http://dx.doi.org/10.1504/EJIE.2015.068652
DB - Crossref
KW - inventory policy
KW - policy characterisation
KW - product recovery
KW - manufacturing
KW - remanufacturing
KW - Markov decision process
KW - MDP
KW - heuristic methods
KW - neural networks
ER -
TY - JOUR
TI - Expanded model of the project portfolio selection problem with divisibility, time profile factors and cardinality constraints
AU - Li, Xingmei
AU - Fang, Shu-Cherng
AU - Tian, Ye
AU - Guo, Xiaoling
T2 - JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
AB - This paper develops a new model for project portfolio selection over a planning horizon with multiple time periods. The model considers the divisibility of projects and combines reinvestment, set-up cost, cardinality constraints and precedence relationship in the scheduling, simultaneously. For efficient computation, an equivalent mixed integer linear programming representation is provided. One numerical example with three scenarios is given to highlight the capability and characteristics of the proposed model.
DA - 2015/7//
PY - 2015/7//
DO - 10.1057/jors.2014.75
VL - 66
IS - 7
SP - 1132-1139
SN - 1476-9360
KW - project portfolio selection problem
KW - multiple time periods
KW - divisibility
KW - time profile factors
KW - set-up cost
KW - cardinality constraints
ER -
TY - CONF
TI - A multi-agent auction-based approach for modeling of signalized intersections
AU - Mashayekhi, M.
AU - List, G.
C2 - 2015///
C3 - Workshop on Synergies Between Multiagent Systems, Machine Learning and Complex Systems
DA - 2015///
ER -
TY - JOUR
TI - p-Median and p-dispersion problems: A bi-criteria analysis
AU - Sayyady, Fatemeh
AU - Tutunchi, Golbarg K.
AU - Fathi, Yahya
T2 - COMPUTERS & OPERATIONS RESEARCH
AB - Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.
DA - 2015/9//
PY - 2015/9//
DO - 10.1016/j.cor.2015.02.007
VL - 61
SP - 46-55
SN - 1873-765X
KW - Location theory
KW - Max-min diversity
KW - p-Median partitioning
KW - Integer programming
KW - Lagrangian heuristic
ER -
TY - JOUR
TI - Unsplittable Load Balancing in a Network of Charging Stations Under QoS Guarantees
AU - Bayram, Islam Safak
AU - Michailidis, George
AU - Devetsikiotis, Michael
T2 - IEEE TRANSACTIONS ON SMART GRID
AB - The operation of the power grid is becoming more stressed, due to the addition of new large loads represented by Electric Vehicles (EVs) and a more intermittent supply due to the incorporation of renewable sources. As a consequence, the coordination and control of projected EV demand in a network of fast charging stations becomes a critical and challenging problem. In this paper, we introduce a game theoretic based decentralized control mechanism to alleviate negative impacts from the EV demand. The proposed mechanism takes into consideration the non-uniform spatial distribution of EVs that induces uneven power demand at each charging facility, and aims to: (i) avoid straining grid resources by offering price incentives so that customers accept being routed to less busy stations, (ii) maximize total revenue by serving more customers with the same amount of grid resources, and (iii) provide charging service to customers with a certain level of Quality-of-Service (QoS), the latter defined as the long term customer blocking probability. We examine three scenarios of increased complexity that gradually approximate real world settings. The obtained results show that the proposed framework leads to substantial performance improvements in terms of the aforementioned goals, when compared to current state of affairs.
DA - 2015/5//
PY - 2015/5//
DO - 10.1109/tsg.2014.2362994
VL - 6
IS - 3
SP - 1292-1302
SN - 1949-3061
KW - Demand response
KW - distributed control
KW - electric vehicles (EVs)
KW - game theory
KW - performance evaluation
ER -
TY - JOUR
TI - RANDOMIZED APPROXIMATION OF THE GRAM MATRIX: EXACT COMPUTATION AND PROBABILISTIC BOUNDS
AU - Holodnak, John T.
AU - Ipsen, Ilse C. F.
T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
AB - Given a real matrix $\mathbf{A}$ with $n$ columns, the problem is to approximate the Gram product $\mathbf{A}\mathbf{A}^T$ by $c\ll n$ weighted outer products of columns of $\mathbf{A}$. Necessary and sufficient conditions for the exact computation of $\mathbf{A}\mathbf{A}^T$ (in exact arithmetic) from $c\geq \mathrm{rank}(\mathbf{A})$ columns depend on the right singular vector matrix of $\mathbf{A}$. For a Monte Carlo matrix multiplication algorithm by Drineas et al. that samples outer products, we present probabilistic bounds for the two-norm relative error due to randomization. The bounds depend on the stable rank or the rank of $\mathbf{A}$, but not on the matrix dimensions. Numerical experiments illustrate that the bounds are informative, even for stringent success probabilities and matrices of small dimension. We also derive bounds for the smallest singular value and the condition number of matrices obtained by sampling rows from orthonormal matrices.
DA - 2015///
PY - 2015///
DO - 10.1137/130940116
VL - 36
IS - 1
SP - 110-137
SN - 1095-7162
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84925298413&partnerID=MN8TOARS
KW - leverage scores
KW - singular value decomposition
KW - stable rank
KW - coherence
KW - matrix concentration inequalities
KW - unbiased estimator
ER -
TY - JOUR
TI - Platys: An Active Learning Framework for Place-Aware Application Development and Its Evaluation
AU - Murukannaiah, Pradeep K.
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY
AB - We introduce a high-level abstraction of location called place . A place derives its meaning from a user's physical space, activities, or social context. In this manner, place can facilitate improved user experience compared to the traditional representation of location, which is spatial coordinates. We propose the Platys framework as a way to address the special challenges of place-aware application development. The core of Platys is a middleware that (1) learns a model of places specific to each user via active learning , a machine learning paradigm that seeks to reduce the user-effort required for training the middleware, and (2) exposes the learned user-specific model of places to applications at run time, insulating application developers from dealing with both low-level sensors and user idiosyncrasies in perceiving places. We evaluated Platys via two studies. First, we collected place labels and Android phone sensor readings from 10 users. We applied Platys' active learning approach to learn each user's places and found that Platys (1) requires fewer place labels to learn a user's places with a desired accuracy than do two traditional supervised approaches, and (2) learns places with higher accuracy than two unsupervised approaches. Second, we conducted a developer study to evaluate Platys' efficiency in assisting developers and its effectiveness in enabling usable applications. In this study, 46 developers employed either Platys or the Android location API to develop a place-aware application. Our results indicate that application developers employing Platys, when compared to those employing the Android API, (1) develop a place-aware application faster and perceive reduced difficulty and (2) produce applications that are easier to understand (for developers) and potentially more usable and privacy preserving (for application users).
DA - 2015/5//
PY - 2015/5//
DO - 10.1145/2729976
VL - 24
IS - 3
SP -
SN - 1557-7392
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84930154899&partnerID=MN8TOARS
KW - Experimentation
KW - Measurement
KW - Mobile application development
KW - location-aware
KW - place-aware
KW - context-aware
KW - middleware
KW - place recognition
KW - active learning
KW - semi-supervised learning
KW - usability
KW - privacy
ER -
TY - JOUR
TI - On the economic lot scheduling problem: stock-out prevention and system feasibility
AU - Hanson, Brian B.
AU - Hodgson, Thom J.
AU - Kay, Michael G.
AU - King, Russell E.
AU - Thoney-Barletta, Kristin A.
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - The Economic Lot Scheduling Problem is a classical scheduling problem with the objective of minimising the long-run inventory and set-up costs of a single machine, multi-product inventory system. Demand rates, production rates and set-up times are assumed to be deterministic. The problem has been extensively studied and methods exist to obtain cyclic schedules which minimise total cost. In order to apply a cyclic schedule without a stock-out occurring, certain initial inventory levels are required. This paper considers the scenario where inventory levels are critically low and the cyclic schedule cannot be applied. Analytical methods are developed to determine: if the initial inventory is sufficient to prevent a stock-out from occurring; the maximum time until a stock-out will occur if a stock-out is unavoidable; and the minimum time required to obtain the necessary inventory to resume the cyclic schedule if a stock-out can be avoided.
DA - 2015/8/18/
PY - 2015/8/18/
DO - 10.1080/00207543.2015.1005246
VL - 53
IS - 16
SP - 4903-4916
SN - 1366-588X
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84932193491&partnerID=MN8TOARS
KW - schedule disruption recovery
KW - ELSP
KW - lot size scheduling
ER -
TY - JOUR
TI - Monitoring nonlinear profiles adaptively with a wavelet-based distribution-free CUSUM chart
AU - Wang, Huizhu
AU - Kim, Seong-Hee
AU - Huo, Xiaoming
AU - Hur, Youngmi
AU - Wilson, James R.
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - A wavelet-based distribution-free tabular CUSUM chart based on adaptive thresholding, is designed for rapidly detecting shifts in the mean of a high-dimensional profile whose noise components have a continuous nonsingular multivariate distribution. First computing a discrete wavelet transform of the noise vectors for randomly sampled Phase I (in-control) profiles, uses a matrix-regularization method to estimate the covariance matrix of the wavelet-transformed noise vectors; then, those vectors are aggregated (batched) so that the non-overlapping batch means of the wavelet-transformed noise vectors have manageable covariances. Lower and upper in-control thresholds are computed for the resulting batch means of the wavelet-transformed noise vectors using the associated marginal Cornish–Fisher expansions that have been suitably adjusted for between-component correlations. From the thresholded batch means of the wavelet-transformed noise vectors, Hotelling’s -type statistics are computed to set the parameters of a CUSUM procedure. To monitor shifts in the mean profile during Phase II (regular) operation, computes a similar Hotelling’s -type statistic from successive thresholded batch means of the wavelet-transformed noise vectors using the in-control thresholds; then applies the CUSUM procedure to the resulting -type statistics. Experimentation with several normal and non-normal test processes revealed that outperformed existing non-adaptive profile-monitoring schemes.
DA - 2015/8/3/
PY - 2015/8/3/
DO - 10.1080/00207543.2015.1029085
VL - 53
IS - 15
SP - 4648-4667
SN - 1366-588X
KW - quality control
KW - high dimension
KW - profile
KW - CUSUM chart
KW - distribution-free
KW - discrete wavelet transform
ER -
TY - JOUR
TI - How Can Supply Management Really Improve Performance? A Knowledge-Based Model of Alignment Capabilities
AU - Handfield, Robert B.
AU - Cousins, Paul D.
AU - Lawson, Benn
AU - Petersen, Kenneth J.
T2 - JOURNAL OF SUPPLY CHAIN MANAGEMENT
AB - Prior research has underscored the importance of internal and external supply chain integration, but the growing role of the supply management organization in developing this capability is not well specified. In this research, we explore the concept of supply management alignment, defined as the behavioral characteristics and process requirements for understanding and explicitly outlining internal stakeholder needs, and linking these to supplier performance agreements. Using the lens of dynamic capabilities, we propose a theoretical model for creating supply management alignment . This model presents the synergistic effects derived through strong internal lines of communication combined with external supply relationships based on defined metrics and processes. The underlying set of requirements to achieve supply management alignment is proposed and tested in this model, thereby enhancing our understanding of the processes and behaviors required for integration of internal stakeholder needs with external suppliers, which can lead to improved performance. We explore the complementary effects of supply management alignment on network agility and supplier performance improvements. Data from 151 UK manufacturing firms are used to test the model. The results provide a unifying framework tying together many of the prescriptive elements of strategic sourcing into a more coherent theoretical model and establish the basis for future studies of supply management alignment capabilities.
DA - 2015/7//
PY - 2015/7//
DO - 10.1111/jscm.12066
VL - 51
IS - 3
SP - 3-17
SN - 1745-493X
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84936089418&partnerID=MN8TOARS
KW - strategy
KW - structure
KW - alignment
KW - capabilities
KW - performance
KW - supply management
ER -
TY - JOUR
TI - Estimating Clearing Functions for Production Resources Using Simulation Optimization
AU - Kacar, Necip Baris
AU - Uzsoy, Reha
T2 - IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
AB - We implement a gradient-based simulation optimization approach, the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm, to estimate clearing functions (CFs) that describe the expected output of a production resource as a function of its expected workload from empirical data. Instead of trying to optimize the fit of the CF to the data, we seek values of the CF parameters that optimize the expected performance for the system when the fitted CFs are used to develop release schedules. A simulation model of a scaled-down wafer fabrication facility is used to generate the data and evaluate the performance of the CFs obtained from the SPSA. We show that SPSA significantly improves the production plan by either searching for better CF parameters or by directly optimizing releases.
DA - 2015/4//
PY - 2015/4//
DO - 10.1109/tase.2014.2303316
VL - 12
IS - 2
SP - 539-552
SN - 1558-3783
KW - Clearing function
KW - linear programming
KW - production planning
KW - simulation optimization
KW - workload-dependent lead times
ER -
TY - JOUR
TI - Camouflage Traffic: Minimizing Message Delay for Smart Grid Applications under Jamming
AU - Lu, Zhuo
AU - Wang, Wenye
AU - Wang, Cliff
T2 - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
AB - Smart grid is a cyber-physical system that integrates power infrastructures with information technologies. To facilitate efficient information exchange, wireless networks have been proposed to be widely used in the smart grid. However, the jamming attack that constantly broadcasts radio interference is a primary security threat to prevent the deployment of wireless networks in the smart grid. Hence, spread spectrum systems, which provide jamming resilience via multiple frequency and code channels, must be adapted to the smart grid for secure wireless communications, while at the same time providing latency guarantee for control messages. An open question is how to minimize message delay for timely smart grid communication under any potential jamming attack. To address this issue, we provide a paradigm shift from the case-by-case methodology, which is widely used in existing works to investigate well-adopted attack models, to the worst-case methodology, which offers delay performance guarantee for smart grid applications under any attack. We first define a generic jamming process that characterizes a wide range of existing attack models. Then, we show that in all strategies under the generic process, the worst-case message delay is a U-shaped function of network traffic load. This indicates that, interestingly, increasing a fair amount of traffic can in fact improve the worst-case delay performance. As a result, we demonstrate a lightweight yet promising system, transmitting adaptive camouflage traffic (TACT), to combat jamming attacks. TACT minimizes the message delay by generating extra traffic called camouflage to balance the network load at the optimum. Experiments show that TACT can decrease the probability that a message is not delivered on time in order of magnitude.
DA - 2015///
PY - 2015///
DO - 10.1109/tdsc.2014.2316795
VL - 12
IS - 1
SP - 31-44
SN - 1941-0018
KW - Smart grid
KW - wireless applications
KW - performance modeling
KW - worst-case analysis
KW - message delay
KW - jamming attacks
ER -
TY - JOUR
TI - Bayesian structure learning in graphical models
AU - Banerjee, S.
AU - Ghosal, S.
T2 - Journal of Multivariate Analysis
DA - 2015///
PY - 2015///
VL - 136
SP - 147-162
ER -
TY - JOUR
TI - Asynchronous switching output feedback control of discrete-time switched linear systems
AU - Yuan, Chengzhi
AU - Wu, Fen
T2 - INTERNATIONAL JOURNAL OF CONTROL
AB - In this paper, the problem of dynamic output-feedback control synthesis is addressed for discrete-time switched linear systems under asynchronous switching. The proposed hybrid controller consists of a standard dynamic output-feedback switching control law and an impulsive reset law induced by controller state jumps. Using the average dwell time technique incorporating with multiple quadratic Lyapunov functions, the switching control synthesis conditions for asymptotic stability with guaranteed weighted ℓ2-gain performance are derived as a set of linear matrix inequalities (LMIs). The proposed hybrid synthesis scheme advances existing design methods for output-feedback asynchronous switching control of switched linear systems in two important aspects: LMI formulation of the synthesis problem; and arbitrary order of the controller state. A numerical example is used to illustrate the effectiveness and advantages of the proposed design technique.
DA - 2015/9/2/
PY - 2015/9/2/
DO - 10.1080/00207179.2015.1016454
VL - 88
IS - 9
SP - 1766-1774
SN - 1366-5820
KW - average dwell time
KW - asynchronous switching
KW - dynamic output feedback
KW - switched linear systems
KW - linear matrix inequality (LMI)
ER -
TY - JOUR
TI - An immersed finite volume element method for 2D PDEs with discontinuous coefficients and non-homogeneous jump conditions
AU - Zhu, Ling
AU - Zhang, Zhiyue
AU - Li, Zhilin
T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS
AB - An immersed finite volume element method is developed to solve 2D elliptic interface problems with a variable coefficient that has a finite jump across an interface. The solution and the flux may also have a finite jump across the interface. Using the source removal technique, an equivalent elliptic interface problem with homogeneous jump conditions is obtained. The nodal basis functions are constructed to satisfy the homogeneous jump conditions near the interface and the usual finite element nodal basis functions are applied away from the interface. The resulting linear problem is simple and easy to solve. A proof of the error estimate in the energy norm is given. Numerical experiments demonstrate the convergence rates of the proposed method with the usual O(h2) in the L2, the L∞ norms, and O(h) in the H1 norm.
DA - 2015/7//
PY - 2015/7//
DO - 10.1016/j.camwa.2015.04.012
VL - 70
IS - 2
SP - 89-103
SN - 1873-7668
KW - Finite volume element method
KW - Source removal technique
KW - Interface problem
KW - Jump conditions
ER -
TY - JOUR
TI - Using Kalman Filtering to Predict Time-Varying Parameters in a Model Predicting Baroreflex Regulation During Head-Up Tilt
AU - Matzuka, Brett
AU - Mehlsen, Jesper
AU - Tran, Hien
AU - Olufsen, Mette Sofie
T2 - IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING
AB - The cardiovascular control system is continuously engaged to maintain homeostasis, but it is known to fail in a large cohort of patients suffering from orthostatic intolerance. Numerous clinical studies have been put forward to understand how the system fails, yet noninvasive clinical data are sparse, typical studies only include measurements of heart rate and blood pressure, as a result it is difficult to determine what mechanisms that are impaired. It is known, that blood pressure regulation is mediated by changes in heart rate, vascular resistance, cardiac contractility, and a number of other factors. Given that numerous factors contribute to changing these quantities, it is difficult to devise a physiological model describing how they change in time. One way is to build a model that allows these controlled quantities to change and to compare dynamics between subject groups. To do so, it requires more knowledge of how these quantities change for healthy subjects. This study compares two methods predicting time-varying changes in cardiac contractility and vascular resistance during head-up tilt. Similar to the study by Williams et al.[51], the first method uses piecewise linear splines, while the second uses the ensemble transform Kalman filter (ETKF) [1] , [11], [12], [33]. In addition, we show that the delayed rejection adaptive Metropolis (DRAM) algorithm can be used for predicting parameter uncertainties within the spline methodology, which is compared with the variability obtained with the ETKF. While the spline method is easier to set up, this study shows that the ETKF has a significantly shorter computational time. Moreover, while uncertainty of predictions can be augmented to spline predictions using DRAM, these are readily available with the ETKF.
DA - 2015/8//
PY - 2015/8//
DO - 10.1109/tbme.2015.2409211
VL - 62
IS - 8
SP - 1992-2000
SN - 1558-2531
KW - Baroreflex regulation
KW - cardiovascular
KW - DRAM
KW - ensemble transform Kalman filter
KW - head-up tilt
KW - Kalman filtering
KW - parameter estimation
ER -
TY - JOUR
TI - On Topology and Resilience of Large-Scale Cognitive Radio Networks Under Generic Failures
AU - Sun, Lei
AU - Wang, Wenye
AU - Lu, Zhuo
T2 - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
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. 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.
DA - 2015/6//
PY - 2015/6//
DO - 10.1109/twc.2015.2404919
VL - 14
IS - 6
SP - 3390-3401
SN - 1558-2248
KW - Resilience
KW - cognitive radio networks
KW - topology
KW - generic failures
ER -
TY - JOUR
TI - Immersed finite elements for optimal control problems of elliptic PDEs with interfaces
AU - Zhang, Qian
AU - Ito, Kazufumi
AU - Li, Zhilin
AU - Zhang, Zhiyue
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - This paper presents a numerical method and analysis, based on the variational discretization concept, for optimal control problems governed by elliptic PDEs with interfaces. The method uses a simple uniform mesh which is independent of the interface. Due to the jump of the coefficient across the interface, the standard linear finite element method cannot achieve optimal convergence when the uniform mesh is used. Therefore the immersed finite element method (IFEM) developed in Li et al. [20] is used to discretize the state equation required in the variational discretization approach. Optimal error estimates for the control, state and adjoint state are derived. Numerical examples are provided to confirm the theoretical results.
DA - 2015/10/1/
PY - 2015/10/1/
DO - 10.1016/j.jcp.2015.05.050
VL - 298
SP - 305-319
SN - 1090-2716
KW - PDE-constrained optimization
KW - Variational discretization
KW - Immersed finite element
KW - Elliptic interface problem
ER -
TY - JOUR
TI - Discussion of "Frequentist coverage of adaptive nonparametric Bayesian credible sets"
AU - Ghosal, S.
T2 - Annals of Statistics
DA - 2015///
PY - 2015///
VL - 43
IS - 4
SP - 1455-1462
ER -
TY - JOUR
TI - Convergence Analysis for Anderson Acceleration
AU - Toth, Alex
AU - Kelley, C. T.
T2 - SIAM Journal on Numerical Analysis
AB - Anderson($m$) is a method for acceleration of fixed point iteration which stores m+1 prior evaluations of the fixed point map and computes the new iteration as a linear combination of those evaluations. Anderson(0) is fixed point iteration. In this paper we show that Anderson($m$) is locally r-linearly convergent if the fixed point map is a contraction and the coefficients in the linear combination remain bounded. Without assumptions on the coefficients, we prove q-linear convergence of Anderson(1) and, in the case of linear problems, Anderson($m$). We observe that the optimization problem for the coefficients can be formulated and solved in nonstandard ways and report on numerical experiments which illustrate the ideas.
DA - 2015/1//
PY - 2015/1//
DO - 10.1137/130919398
VL - 53
IS - 2
SP - 805-819
J2 - SIAM J. Numer. Anal.
LA - en
OP -
SN - 0036-1429 1095-7170
UR - http://dx.doi.org/10.1137/130919398
DB - Crossref
KW - nonlinear equations
KW - Anderson acceleration
KW - local convergence
ER -
TY - JOUR
TI - A semi-implicit augmented IIM for Navier-Stokes equations with open, traction, or free boundary conditions
AU - Li, Zhilin
AU - Xiao, Li
AU - Cai, Qin
AU - Zhao, Hongkai
AU - Luo, Ray
T2 - JOURNAL OF COMPUTATIONAL PHYSICS
AB - In this paper, a new Navier–Stokes solver based on a finite difference approximation is proposed to solve incompressible flows on irregular domains with open, traction, and free boundary conditions, which can be applied to simulations of fluid structure interaction, implicit solvent model for biomolecular applications and other free boundary or interface problems. For some problems of this type, the projection method and the augmented immersed interface method (IIM) do not work well or does not work at all. The proposed new Navier–Stokes solver is based on the local pressure boundary method, and a semi-implicit augmented IIM. A fast Poisson solver can be used in our algorithm which gives us the potential for developing fast overall solvers in the future. The time discretization is based on a second order multi-step method. Numerical tests with exact solutions are presented to validate the accuracy of the method. Application to fluid structure interaction between an incompressible fluid and a compressible gas bubble is also presented.
DA - 2015/9/15/
PY - 2015/9/15/
DO - 10.1016/j.jcp.2015.05.003
VL - 297
SP - 182-193
SN - 1090-2716
KW - Navier-Stokes Navier-Stokes equations
KW - Finite difference approximation
KW - Irregular domain
KW - Open and traction boundary conditions
KW - Local pressure boundary condition
KW - Augmented immersed interface method (IIM)
ER -
TY - JOUR
TI - Switching control of linear systems subject to asymmetric actuator saturation
AU - Yuan, Chengzhi
AU - Wu, Fen
T2 - INTERNATIONAL JOURNAL OF CONTROL
AB - In this paper, we study the saturation control problem for linear time-invariant (LTI) systems subject to asymmetric actuator saturation under a switching control framework. The LTI plant with asymmetric saturation is first transformed to an equivalent switched linear model with each subsystem subject to symmetric actuator saturation, based on which a dwell-time switching controller augmented with a controller state reset is then developed by using multiple Lyapunov functions. The controller synthesis conditions are formulated as linear matrix inequalities (LMIs), which can be solved efficiently. Simulation results are also included to illustrate the effectiveness and advantages of the proposed approach.
DA - 2015/1/2/
PY - 2015/1/2/
DO - 10.1080/00207179.2014.942884
VL - 88
IS - 1
SP - 204-215
SN - 1366-5820
KW - asymmetric actuator saturation
KW - controller state reset
KW - switching control
KW - LMI
ER -
TY - JOUR
TI - Platys: From Position to Place-Oriented Mobile Computing
AU - Zavala, Laura
AU - Murukannaiah, Pradeep K.
AU - Poosamani, Nithyananthan
AU - Finin, Tim
AU - Joshi, Anupam
AU - Rhee, Injong
AU - Singh, Munindar P.
T2 - AI MAGAZINE
AB - The Platys project focuses on developing a high‐level, semantic notion of location called place. A place, unlike a geospatial position, derives its meaning from a user's actions and interactions in addition to the physical location where it occurs. Our aim is to enable the construction of a large variety of applications that take advantage of place to render relevant content and functionality and, thus, improve user experience. We consider elements of context that are particularly related to mobile computing. The main problems we have addressed to realize our place‐oriented mobile computing vision are representing places, recognizing places, and engineering place‐aware applications. We describe the approaches we have developed for addressing these problems and related subproblems. A key element of our work is the use of collaborative information sharing where users' devices share and integrate knowledge about places. Our place ontology facilitates such collaboration. Declarative privacy policies allow users to specify contextual features under which they prefer to share or not share their information.
DA - 2015///
PY - 2015///
DO - 10.1609/aimag.v36i2.2584
VL - 36
IS - 2
SP - 50-62
SN - 0738-4602
UR - https://publons.com/publon/21294393/
ER -
TY - JOUR
TI - Demand Modeling With Forecast Evolution: An Application to Production Planning
AU - Albey, Erinc
AU - Norouzi, Amirhosein
AU - Kempf, Karl G.
AU - Uzsoy, Reha
T2 - IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING
AB - The value of demand forecast information has been the subject of numerous studies in the inventory literature, but has had limited application in production planning. This paper integrates ideas from forecast evolution and inventory theory to plan work releases into a production facility in the face of stochastic demand. The model, which is solved on a rolling horizon basis, manages the inventory, backorder, and shortfall levels at each planning epoch using chance constraints to represent desired service levels. The evolution of demand information over time is modeled using the Martingale Model of Forecast Evolution. The model is implemented using historical data from a major semiconductor manufacturer. The value of forecast evolution is quantified using a benchmark model that does not consider forecast evolution.
DA - 2015/8//
PY - 2015/8//
DO - 10.1109/tsm.2015.2453792
VL - 28
IS - 3
SP - 374-384
SN - 1558-2345
KW - Production planning
KW - demand modeling
KW - chance constraints
KW - forecast updating/evolution
KW - linear programming
KW - simulation
KW - rolling horizon
ER -
TY - JOUR
TI - Agent-based simulations of financial markets: zero- and positive-intelligence models
AU - Thompson, James R.
AU - Wilson, James R.
T2 - SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL
AB - To analyze the impact of intelligent traders with differing fundamental motivations on agent-based simulations of financial markets, we construct both zero-intelligence and positive-intelligence models of those markets using the MASON agent-based modeling framework. We exploit our software implementation of multifractal detrended fluctuation analysis (MF-DFA) to analyze the price paths generated by both simulation models as well as the price paths of selected stocks traded on the New York Stock Exchange. We study the changes in the models’ macrolevel price paths when altering some of the microlevel agent behaviors; and we compare and contrast the multifractal properties of the zero- and positive-intelligence price paths with those properties of the selected real price paths. For the positive-intelligence and real price paths, we generally observed long-range dependence in the small-magnitude fluctuations and short-range dependence in the large-magnitude fluctuations. On the other hand, the zero-intelligence price paths failed to exhibit the multifractal properties seen in the selected real price paths.
DA - 2015/6//
PY - 2015/6//
DO - 10.1177/0037549715582252
VL - 91
IS - 6
SP - 527-552
SN - 1741-3133
KW - agent-based simulation
KW - complex systems
KW - financial markets
KW - fractals
KW - multifractal detrended fluctuation analysis
KW - multifractal time series
ER -
TY - JOUR
TI - s-Lecture hall partitions, self-reciprocal polynomials, and Gorenstein cones
AU - Beck, Matthias
AU - Braun, Benjamin
AU - Koeppe, Matthias
AU - Savage, Carla D.
AU - Zafeirakopoulos, Zafeirakis
T2 - RAMANUJAN JOURNAL
AB - In 1997, Bousquet-Melou and Eriksson initiated the study of lecture hall partitions, a fascinating family of partitions that yield a finite version of Euler's celebrated odd/distinct partition theorem. In subsequent work on s-lecture hall partitions, they considered the self-reciprocal property for various associated generating functions, with the goal of characterizing those sequences s that give rise to generating functions of the form $((1-q^{e_1})(1-q^{e_2})...(1-q^{e_n}))^{-1}$. We continue this line of investigation, connecting their work to the more general context of Gorenstein cones. We focus on the Gorenstein condition for s-lecture hall cones when s is a positive integer sequence generated by a second-order homogeneous linear recurrence with initial values 0 and 1. Among such sequences s, we prove that the n-dimensional s-lecture hall cone is Gorenstein for all n greater than or equal to 1 if and only if s is an l-sequence. One consequence is that among such sequences s, unless s is an l-sequence, the generating function for the s-lecture hall partitions can have the form $((1-q^{e_1})(1-q^{e_2})...(1-q^{e_n}))^{-1}$ for at most finitely many n. We also apply the results to establish several conjectures by Pensyl and Savage regarding the symmetry of h*-vectors for s-lecture hall polytopes. We end with open questions and directions for further research.
DA - 2015/2//
PY - 2015/2//
DO - 10.1007/s11139-013-9538-3
VL - 36
IS - 1-2
SP - 123-147
SN - 1572-9303
KW - Lecture hall partition
KW - Polyhedral cone
KW - Generating function
KW - Gorenstein
KW - Self-reciprocal polynomial
ER -
TY - JOUR
TI - On Routing and Spectrum Assignment in Rings
AU - Talebi, Sahar
AU - Bampis, Evripidis
AU - Lucarelli, Giorgio
AU - Katib, Iyad
AU - Rouskas, George N.
T2 - JOURNAL OF LIGHTWAVE TECHNOLOGY
AB - We present a theoretical study of the routing and spectrum assignment (RSA) problem in ring networks. We first show that the RSA problem with fixed-alternate routing in general-topology (mesh) networks (and, hence, in rings as well) is a special case of a multiprocessor scheduling problem. We then consider bidirectional ring networks and investigate two problems: 1) the spectrum assignment problem under the assumption that each demand is routed along a single fixed path (e.g., the shortest path), and 2) the general case of the RSA problem whereby a routing decision along the clockwise and counter-clockwise directions must be made jointly with spectrum allocation. Based on insights from multiprocessor scheduling theory, we derive the complexity of the two problems and develop new constant-ratio approximation algorithms with a ratio that is strictly smaller than the best known ratio to date.
DA - 2015/1/1/
PY - 2015/1/1/
DO - 10.1109/jlt.2014.2376871
VL - 33
IS - 1
SP - 151-160
SN - 1558-2213
KW - Approximation algorithms
KW - multiprocessor scheduling
KW - optical fiber networks
KW - routing and spectrum assignment
KW - routing and wavelength assignment
KW - spectrum assignment
KW - wavelength assignment
ER -
TY - JOUR
TI - FINITE DIFFERENCE APPROXIMATIONS FOR MEASURE-VALUED SOLUTIONS OF A HIERARCHICALLY SIZE-STRUCTURED POPULATION MODEL
AU - Ackleh, Azmy S.
AU - Chellamuthu, Vinodh K.
AU - Ito, Kazufumi
T2 - MATHEMATICAL BIOSCIENCES AND ENGINEERING
AB - We study a quasilinear hierarchically size-structured population modelpresented in [4]. In this model the growth, mortality andreproduction rates are assumed to depend on a function of thepopulation density. In [4] we showed that solutions to thismodel can become singular (measure-valued) in finite time even ifall the individual parameters are smooth. Therefore, in this paperwe develop a first order finite difference scheme to compute thesemeasure-valued solutions. Convergence analysis for this method isprovided. We also develop a high resolution second order scheme tocompute the measure-valued solution of the model and perform a comparative study between thetwo schemes.
DA - 2015/4//
PY - 2015/4//
DO - 10.3934/mbe.2015.12.233
VL - 12
IS - 2
SP - 233-258
SN - 1551-0018
KW - Hierarchically size-structured population model
KW - measure-valued solutions
KW - finite-difference approximations
KW - convergence analysis
ER -
TY - JOUR
TI - Bandwidth estimation for video streaming under percentile delay, jitter, and packet loss rate constraints using traces
AU - Anjum, Bushra
AU - Perros, Harry
T2 - COMPUTER COMMUNICATIONS
AB - We present and use a CPU-efficient activity-based simulation model to calculate the sojourn time of a packet and the packet loss rate in a tandem queueing network that depicts the path of a video flow. The video flow is characterized by a packet trace. Background traffic, also characterized by a trace, is allowed in the tandem queueing network. In our analysis we used real video traces (Telepresence, WebEx, Jabber) and also generalized our results using traces generated by a theoretical model of a video arrival process depicted by a Markovian Arrival Process. Using this simulation model we calculate the bandwidth required for a video flow, so that a given set of constraints for the percentile end-to-end delay, jitter, and packet loss rate are satisfied. We also show that the bandwidth required for n identical video streams that follow the same path through an IP network, so that the end-to-end percentile delay remains the same, is a linear function of n. Further, it is experimentally depicted that for infinite-capacity queues the bandwidth required to satisfy the percentile end-to-end delay constraint also satisfies the jitter constraint. And for finite-capacity queues, the bandwidth required to satisfy both the percentile end-to-end delay and the packet loss rate constraints also satisfies the pair of jitter and packet loss rate constraints.
DA - 2015/2/15/
PY - 2015/2/15/
DO - 10.1016/j.comcom.2014.08.018
VL - 57
SP - 73-84
SN - 1873-703X
KW - Activity-based simulation
KW - Bandwidth estimation
KW - Video traces
KW - Percentile end-to-end delay
KW - Packet loss rate
ER -
TY - JOUR
TI - An exact reanalysis technique for storm surge and tides in a geographic region of interest
AU - Baugh, John
AU - Altuntas, Alper
AU - Dyer, Tristan
AU - Simon, Jason
T2 - COASTAL ENGINEERING
AB - Understanding the effects of storm surge in hurricane-prone regions is necessary for protecting public and lifeline services and improving resilience. While coastal ocean hydrodynamic models like ADCIRC may be used to assess the extent of inundation, the computational cost may be prohibitive since many local changes corresponding to design and failure scenarios would ideally be considered. We present an exact reanalysis technique and corresponding implementation that enable the assessment of local subdomain changes with less computational effort than would be required by a complete resimulation of the full domain. So long as the subdomain is large enough to fully contain the altered hydrodynamics, changes may be made and simulations performed within it without the need to calculate new boundary values. Accurate results are obtained even when subdomain boundary conditions are forced only intermittently, and convergence is demonstrated by progressively increasing the frequency at which they are applied. Descriptions of the overall methodology, performance results, and accuracy, as well as case studies, are presented.
DA - 2015/3//
PY - 2015/3//
DO - 10.1016/j.coastaleng.2014.12.003
VL - 97
SP - 60-77
SN - 1872-7379
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85027939365&partnerID=MN8TOARS
KW - Hurricane
KW - Storm surge
KW - Subdomain modeling
KW - ADCIRC
ER -
TY - JOUR
TI - A framework for incorporating ecological releases in single reservoir operation
AU - Wang, Hui
AU - Brill, Earl D.
AU - Ranjithan, Ranji S.
AU - Sankarasubramanian, A.
T2 - ADVANCES IN WATER RESOURCES
AB - Most reservoir operation practices consider downstream environmental flow as a constraint to meet a minimum release. The resulting flow regime may not necessarily provide downstream aquatic conditions to support healthy ecosystems. These effects can be quantified in terms of changes in values of parameters that represent the flow regimes. Numerous studies have focused on determining the ecological response to hydrological alteration caused by reservoir operation. To mitigate hydrological alteration and restore the natural flow regime as much as possible, a reservoir operation framework is proposed to explicitly incorporate ecological flow requirements. A general optimization-based decision model is presented to consider simultaneously the multiple anthropogenic uses of the reservoir and desirable ecological releases represented by parameters that capture the flow regime. Multiple uses of the reservoir, including water supply, hydropower generation, etc., are modeled as a mixed integer programming problem. Hydropower generation, which is represented by a nonlinear function that usually depends on head and water flow, is linearized using a two-dimensional function. Investigations using a reservoir in Virginia, located in the southeastern United States, demonstrate that compared to standard releases based on current operation practice, releases simulated using this framework perform better in mimicking pre-development flows. The tradeoff between anthropogenic use and ecological releases is investigated. The framework is first demonstrated for instances with perfect stream flow information. To examine the flexibility of this framework in reservoir release management, monthly flow forecasts and disaggregated daily flow conditions are incorporated. Retrospective monthly flow forecasts are obtained through regression models that use gridded precipitation forecasts and gridded soil moisture estimates as predictors. A nonparametric method is chosen to disaggregate monthly flow forecasts to daily flow conditions. Compared with daily flow climatology, forecasted monthly and daily flow better preserves flow variability and result in lower changes of flow parameters under the proposed framework.
DA - 2015/4//
PY - 2015/4//
DO - 10.1016/j.advwatres.2015.01.006
VL - 78
SP - 9-21
SN - 1872-9657
KW - Ecological flow requirements
KW - Natural flow regime
KW - Sustainable reservoir operation
KW - Mixed integer linear programming
ER -
TY - JOUR
TI - Measuring the benefits of ERP on supply management maturity model: a "big data" method
AU - Huang, Yung-Yun
AU - Handfield, Robert B.
T2 - INTERNATIONAL JOURNAL OF OPERATIONS & PRODUCTION MANAGEMENT
AB - Purpose – The purpose of this paper is to investigate the effects of implementing enterprise resource planning (ERP) systems and the selection of ERP vendors on supply management performance for Fortune 500. Design/methodology/approach – The paper adopts the supply chain maturity model adopted by Gupta and Handfield (2011) and used publicly available information such as articles, research report, newspapers to develop objective maturity ratings for four key indicators – strategic sourcing, category management, and supplier relationship management. Findings – The analysis results suggest ERP users are more mature than non-ERP users in three key indicators: strategic sourcing, category management, and supplier relationship management. Moreover, SAP ERP users are more mature than non-ERP users in strategic sourcing, category management, and supplier relationship management. Research limitations/implications – This study does not account for the longitudinal performance of ERP systems, nor does it account for differences between organizational scope of ERP deployment, global reach, or implementation duration. The authors also did not include other measures of supply chain performance outside of the procurement area. These factors could provide further insights to supply chain performance, and will be an interesting topic for future research. Practical implications – This study provides an extensive analysis of how the deployment of ERP systems and the selection of ERP vendors can benefit a company’s supply chain performance. This information is valuable for companies that are considering adapting an ERP system. Originality/value – This paper uses innovative an maturity assessment rating approach with publicly available resources to measure supply management performance across different companies. This method is novel and provides valuable insights to how ERP systems and their vendors’ impact supply chain management performance.
DA - 2015///
PY - 2015///
DO - 10.1108/ijopm-07-2013-0341
VL - 35
IS - 1
SP - 2-25
SN - 1758-6593
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84920653277&partnerID=MN8TOARS
KW - Procurement
KW - Information management
KW - Buyer-supplier relationships
ER -
TY - JOUR
TI - Hybrid Control for Switched Linear Systems With Average Dwell Time
AU - Yuan, Chengzhi
AU - Wu, Fen
T2 - IEEE TRANSACTIONS ON AUTOMATIC CONTROL
AB - This technical note presents a hybrid control scheme for the output-feedback control of switched linear systems with average dwell time. The proposed hybrid controller consists of a standard switching output-feedback control law and a supervisor enforcing a reset rule for the switching controller states at each switching instant. This hybrid control scheme provides an efficient and systematic way for designing average dwell time switched linear control systems in the sense that the boundary condition can be incorporated into the synthesis problem in a convex formulation. Specifically, both full-order and reduced-order controllers with guaranteed stability and optimal weighted H ∞ performance will be solved by linear matrix inequality (LMI) optimizations. Simulation studies are included to illustrate the effectiveness of the proposed approach.
DA - 2015/1//
PY - 2015/1//
DO - 10.1109/tac.2014.2322941
VL - 60
IS - 1
SP - 240-245
SN - 1558-2523
KW - Average dwell time
KW - controller state reset
KW - full-order and reduced-order controllers
KW - linear matrix inequalitie (LMI)
KW - switching control
ER -
TY - JOUR
TI - Continuity of the Perron root
AU - Meyer, Carl D.
T2 - LINEAR & MULTILINEAR ALGEBRA
AB - AbstractThat the Perron root of a square nonnegative matrix varies continuously with the entries in is a corollary of theorems regarding continuity of eigenvalues or roots of polynomial equations, the proofs of which necessarily involve complex numbers. But since continuity of the Perron root is a question that is entirely in the field of real numbers, it seems reasonable that there should exist a development involving only real analysis. This article presents a simple and completely self-contained development that depends only on real numbers and first principles.Keywords: Perron rootPerron–Frobenius theorynonnegative matricesAMS Subject Classifications: 150215A1815B48 AcknowledgementsThe author wishes to thank the referee for providing suggestions and corrections that enhanced the exposition. The referee is also responsible for example (Equation66 ), and for pointing out the work in [Citation4]. In addition, thanks are extended to Stephen Campbell for suggesting the simple explanation of why the convergence of (Equation55 ) is not uniform.
DA - 2015/7/3/
PY - 2015/7/3/
DO - 10.1080/03081087.2014.934233
VL - 63
IS - 7
SP - 1332-1336
SN - 1563-5139
KW - nonnegative matrices
KW - Perron-Frobenius theory
KW - Perron root
KW - 1502
KW - 15B48
KW - 15A18
ER -
TY - JOUR
TI - Conic approximation to nonconvex quadratic programming with convex quadratic constraints
AU - Deng, Zhibin
AU - Fang, Shu-Cherng
AU - Jin, Qingwei
AU - Lu, Cheng
T2 - JOURNAL OF GLOBAL OPTIMIZATION
DA - 2015/3//
PY - 2015/3//
DO - 10.1007/s10898-014-0195-x
VL - 61
IS - 3
SP - 459-478
SN - 1573-2916
KW - Nonconvex quadratic programming
KW - Adaptive scheme
KW - Cone of nonnegative quadratic functions
ER -
TY - JOUR
TI - Zero-order production planning models with stochastic demand and workload-dependent lead times
AU - Aouam, Tarik
AU - Uzsoy, Reha
T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
AB - We present three different formulations of a simple production planning problem that treat workload-dependent lead times, limited capacity and stochastic demand in an integrated fashion. We compare chance-constrained models, two-stage stochastic programming and robust optimisation using computational experiments. Our results show that the robust optimisation approach is promising, but all the different models face different but challenging issues in addressing this complex problem. We also conclude that successful approximations to this difficult problem with the potential for practical implementation can be developed.
DA - 2015/3/19/
PY - 2015/3/19/
DO - 10.1080/00207543.2014.935514
VL - 53
IS - 6
SP - 1661-1679
SN - 1366-588X
KW - robust optimisation
KW - clearing functions
KW - stochastic programming
KW - production planning
KW - chance constraints
KW - workload-dependent lead times
ER -
TY - JOUR
TI - The s-Eulerian polynomials have only real roots
AU - Savage, Carla
AU - Visontai, M.
T2 - Transactions of the American Mathematical Society
AB - We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or subexcedant functions) were recently generalized by Savage and Schuster, to arbitrary sequences s of positive integers, which they called s-inversion sequences. Our object of study is the generating polynomial of the ascent statistic over the set of s-inversion sequences of length n. Since this ascent statistic over inversion sequences is equidistributed with the descent statistic over permutations, we call this generalized polynomial the s-Eulerian polynomial. The main result of this paper is that, for any sequence s of positive integers, the s-Eulerian polynomial has only real roots. This result is first shown to generalize several existing results about the real-rootedness of various Eulerian polynomials. We then show that it can be used to settle a conjecture of Brenti, that Eulerian polynomials for all finite Coxeter groups have only real roots, and partially settle a conjecture of Dilks, Petersen, Stembridge on type B affine Eulerian polynomials. It is then extended to several q-analogs. We show that the MacMahon-Carlitz q-Eulerian polynomial has only real roots whenever q is a positive real number, confirming a conjecture of Chow and Gessel. The same holds true for the hyperoctahedral group and the wreath product groups, confirming further conjectures of Chow and Gessel, and Chow and Mansour, respectively. Our results have interesting geometric consequences as well.
DA - 2015///
PY - 2015///
DO - 10.1090/s0002-9947-2014-06256-9
VL - 367
IS - 2
SP - 1441–1466
ER -
TY - JOUR
TI - Performance evaluation of an OBS network as a IPP/M/W/W network
AU - Battestilli, Lina
AU - Perros, Harry
AU - Chukova, Stefanka
T2 - APPLIED MATHEMATICAL MODELLING
AB - We develop an analytical method for calculating the burst loss probabilities in a tandem Optical Burst Switched (OBS) network with a bursty arrival process, depicted by an Interrupted Poison Process (IPP). The OBS network is modeled as a tandem network of loss nodes which is analyzed using single-node decomposition, whereby each node is studied in isolation as an IPP/M/W/W. For this, we need the departure process from an IPP/M/W/W which we obtain using binomial moment techniques. Performance evaluation of an OBS network shows that our method gives results which are closer to simulation results than a Poisson arrival process.
DA - 2015/2//
PY - 2015/2//
DO - 10.1016/j.apm.2014.07.016
VL - 39
IS - 3-4
SP - 965-981
SN - 1872-8480
KW - Optical Burst Switched network
KW - Performance evaluation
KW - Interrupted Poison Process
KW - Loss nodes
ER -
TY - JOUR
TI - Optimization of Klystron Designs Using Deterministic Sampling Methods
AU - Tran, Hien
AU - Lankford, George
AU - Read, Michael E.
AU - Ives, R. Lawrence
AU - Reppert, Kelsey
AU - Cline, Kayla
AU - Guzman, Juan
T2 - IEEE Transactions on Electron Devices
AB - A method is presented for optimizing the design of klystron circuits. This automates the selection of cavity positions, resonant frequencies, quality factors, R/Q and other circuit parameters to maximize the efficiency with required gain. The method is based on deterministic sampling methods. In this paper, we describe the procedure and give several examples for both narrow-band and wideband klystrons, using the klystron codes AJDISK and TESLA.
DA - 2015/3//
PY - 2015/3//
DO - 10.1109/ted.2015.2394479
VL - 62
IS - 3
SP - 1032-1036
J2 - IEEE Trans. Electron Devices
OP -
SN - 0018-9383 1557-9646
UR - http://dx.doi.org/10.1109/ted.2015.2394479
DB - Crossref
KW - Design optimization
KW - klystrons
KW - numerical simulation
KW - sampling methods
ER -
TY - JOUR
TI - Combined DES/SD model of breast cancer screening for older women, I: Natural-history simulation
AU - Tejada, Jeremy J.
AU - Ivy, Julie S.
AU - Wilson, James R.
AU - Ballan, Matthew J.
AU - Diehl, Kathleen M.
AU - Yankaskas, Bonnie C.
T2 - IIE TRANSACTIONS
AB - Two companion articles develop and exploit a simulation modeling framework to evaluate the effectiveness of breast cancer screening policies for U.S. women who are at least 65 years old. This first article examines the main components in the breast cancer screening-and-treatment process for older women; then it introduces a two-phase simulation approach to defining and modeling those components. Finally this article discusses the first-phase simulation, a natural-history model of the incidence and progression of untreated breast cancer for randomly sampled individuals from the designated population of older U.S. women. The companion article details the second-phase simulation, an integrated 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 women afflicted with the disease. Both simulation models are composed of interacting sub-models that represent key aspects of the incidence, progression, screening, treatment, survival, and cost of breast cancer in the population of older U.S. women as well as the overall structure of the system for detecting and treating the disease.
DA - 2015/6/3/
PY - 2015/6/3/
DO - 10.1080/0740817x.2014.959671
VL - 47
IS - 6
SP - 600-619
SN - 1545-8830
KW - breast cancer
KW - combined discrete-continuous simulation
KW - medical decision making
KW - chronic disease
KW - screening older U.S. women
KW - system dynamics
KW - discrete-event simulation
KW - Health care
ER -
TY - JOUR
TI - Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint
AU - Xing, Wenxun
AU - Fang, Shu-Cherng
AU - Sheu, Ruey-Lin
AU - Zhang, Liping
T2 - ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
AB - A quadratic optimization problem with one nonconvex quadratic constraint is studied using the canonical dual approach. Under the dual Slater's condition, we show that the canonical dual has a smooth concave objective function over a convex feasible domain, and this dual has a finite supremum unless the original quadratic optimization problem is infeasible. This supremum, when it exists, always equals to the minimum value of the primal problem. Moreover, a global minimizer of the primal problem can be provided by a dual-to-primal conversion plus a "boundarification" technique. Application to solving a quadratic programming problem over a ball is included and an error bound estimation is provided.
DA - 2015/2//
PY - 2015/2//
DO - 10.1142/s0217595915400072
VL - 32
IS - 1
SP -
SN - 1793-7019
KW - Non-convex quadratic programming
KW - canonical duality
KW - Slater's condition
KW - error bound analysis
ER -
TY - JOUR
TI - A parallel Robin-Robin domain decomposition method for H(div)-elliptic problems
AU - Zeng, Yuping
AU - Chen, Jinru
AU - Li, Zhilin
T2 - INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
AB - In this paper, a parallel Robin–Robin domain decomposition method for H(div)-elliptic problems is proposed. The convergence of the method is proved for both the continuous problem and the finite element approximation. Some numerical testes are also presented to demonstrate the effectiveness of the method.
DA - 2015/2/1/
PY - 2015/2/1/
DO - 10.1080/00207160.2014.892587
VL - 92
IS - 2
SP - 394-410
SN - 1029-0265
KW - 65F10
KW - 65N55
KW - 65N30
KW - Robin-Robin domain decomposition method
KW - H(div)-elliptic problems
KW - Raviart-Thomas finite element
KW - convergence analysis
KW - non-overlapping domain decomposition
ER -
TY - JOUR
TI - A law of iterated logarithm for multiclass queues with preemptive priority service discipline
AU - Guo, Yongjiang
AU - Liu, Yunan
T2 - QUEUEING SYSTEMS
DA - 2015/4//
PY - 2015/4//
DO - 10.1007/s11134-014-9419-5
VL - 79
IS - 3-4
SP - 251-291
SN - 1572-9443
KW - Law of iterated logarithm
KW - Multiclass queues
KW - Priority queues
KW - Preemptive-resume discipline
KW - Non-Markovian queues
KW - Strong approximation
ER -
TY - JOUR
TI - Some regular sums
AU - Patricio, P.
AU - Hartwig, R. E.
T2 - LINEAR & MULTILINEAR ALGEBRA
AB - In this paper, we examine the question of regularity of sums of special elements that appear in the study of orthogonality and invertibility.
DA - 2015/1/2/
PY - 2015/1/2/
DO - 10.1080/03081087.2013.860592
VL - 63
IS - 1
SP - 185-200
SN - 1563-5139
KW - 16E50
KW - 15A09
KW - Pierce decomposition
KW - group inverse
KW - reflexive inverses
KW - outer inverses
KW - block matrices
KW - inverse
ER -
TY - JOUR
TI - A compromise programming model for developing the cost of including carbon pools and flux into forest management
AU - Gharis, L.
AU - Roise, J.
AU - McCarter, J.
T2 - ANNALS OF OPERATIONS RESEARCH
DA - 2015/9//
PY - 2015/9//
DO - 10.1007/s10479-013-1519-9
VL - 232
IS - 1
SP - 115-133
SN - 1572-9338
KW - Compromise programming
KW - Forest management
KW - Decision analysis model
KW - Policy
KW - Unit level analysis
KW - Product substitution
ER -