@article {16431,
	title = {Estimating Functional Agent-Based Models: An Application to Bid Shading in Online Markets Format},
	journal = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2011)},
	year = {2011},
	month = {2011///},
	abstract = {Bid shading is a common strategy in online auctions to avoid the "winner{\textquoteright}s curse". While almost all bidders shade their bids, at least to some degree, it is impossible to infer the degree and volume of shaded bids directly from observed bidding data. In fact, most bidding data only allows us to observe the resulting price process, i.e. whether prices increase fast (due to little shading) or whether they slow down (when all bidders shade their bids). In this work, we propose an agent-based model that simulates bidders with different bidding strategies and their interaction with one another. We calibrate that model (and hence estimate properties about the propensity and degree of shaded bids) by matching the emerging simulated price process with that of the observed auction data using genetic algorithms. From a statistical point of view, this is challenging because we match functional draws from simulated and real price processes. We propose several competing fitness functions and explore how the choice alters the resulting ABM calibration. We apply our model to the context of eBay auctions for digital cameras and show that a balanced fitness function yields the best results.},
	keywords = {Agent-based modeling, business, Calibration, Genetic algorithms, internet auctions, simulation},
	url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1846639},
	author = {Guo,Wei and Jank,Wolfgang and Rand, William}
}
@article {17180,
	title = {Graph Analytics-Lessons Learned and Challenges Ahead},
	volume = {31},
	year = {2011},
	month = {2011///},
	pages = {18 - 29},
	abstract = {Graph analytics is one of the most influential and important R\&D topics in the visual analytics community. Researchers with diverse backgrounds from information visualization, human-computer interaction, computer graphics, graph drawing, and data mining have pursued graph analytics from scientific, technical, and social approaches. These studies have addressed both distinct and common challenges. Past successes and mistakes can provide valuable lessons for revising the research agenda. In this article, six researchers from four academic and research institutes identify graph analytics{\textquoteright} fundamental challenges and present both insightful lessons learned from their experience and good practices in graph analytics research. The goal is to critically assess those lessons and shed light on how they can stimulate research and draw attention to grand challenges for graph analytics. The article also establishes principles that could lead to measurable standards and criteria for research.},
	keywords = {citation analysis, citespace, Computer Graphics, document analysis, graphics and multimedia, greengrid, jigsaw system, modeling, power grid analysis, semantic substrates, simulation, social networks, text analysis, Visualization},
	isbn = {0272-1716},
	author = {Wong,Pak Chung and Chen,Chaomei and Gorg,Carsten and Shneiderman, Ben and Stasko,John and Thomas,Jim}
}
@conference {16416,
	title = {Evolving viral marketing strategies},
	booktitle = {Proceedings of the 12th annual conference on Genetic and evolutionary computation},
	series = {GECCO {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {1195 - 1202},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determining how many and which consumers within a particular social network should be seeded to maximize adoption is challenging. We define a strategy space for consumer seeding by weighting a combination of network characteristics such as average path length, clustering coefficient, and degree. We measure strategy effectiveness by simulating adoption on a Bass-like agent-based model, with five different social network structures: four classic theoretical models (random, lattice, small-world, and preferential attachment) and one empirical (extracted from Twitter friendship data). To discover good seeding strategies, we have developed a new tool, called BehaviorSearch, which uses genetic algorithms to search through the parameter-space of agent-based models. This evolutionary search also provides insight into the interaction between strategies and network structure. Our results show that one simple strategy (ranking by node degree) is near-optimal for the four theoretical networks, but that a more nuanced strategy performs significantly better on the empirical Twitter-based network. We also find a correlation between the optimal seeding budget for a network, and the inequality of the degree distribution.},
	keywords = {Agent-based modeling, business, diffusion, Genetic algorithms, simulation, social networks, viral marketing},
	isbn = {978-1-4503-0072-8},
	doi = {10.1145/1830483.1830701},
	url = {http://doi.acm.org/10.1145/1830483.1830701},
	author = {Stonedahl,Forrest and Rand, William and Wilensky,Uri}
}
@conference {15258,
	title = {Online allocation of display advertisements subject to advanced sales contracts},
	booktitle = {Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising},
	series = {ADKDD {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {69 - 77},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to both online and offline allocation of display advertisements. Next, we focus on a particular instance of the online allocation problem, and design a simple online algorithm with provable approximation guarantees. Our algorithm is near optimal as is shown by a matching lower bound. Finally, we report on experiments to establish actual case behavior on some real datasets, with encouraging results.},
	keywords = {display advertising, modeling, online algorithms, OPTIMIZATION, simulation},
	isbn = {978-1-60558-671-7},
	doi = {10.1145/1592748.1592758},
	url = {http://doi.acm.org/10.1145/1592748.1592758},
	author = {Alaei,Saeed and Arcaute,Esteban and Khuller, Samir and Ma,Wenjing and Malekian,Azarakhsh and Tomlin,John}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@conference {18461,
	title = {Efficient evaluation of reverberant sound fields},
	booktitle = {Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the},
	year = {2001},
	month = {2001///},
	pages = {203 - 206},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An image method due to Allen and Berkley (1979) is often used to simulate the effect of reverberation in rooms. This method is relatively expensive computationally. We present a fast method for conducting such simulations using multipole expansions. For M real and image sources and N evaluation points, while the image method requires O(MN) operations, our method achieves the calculations in O(M + N) operations, resulting in a substantial speedup. Applications of our technique are also expected in simulation of virtual audio},
	keywords = {AB algorithm, acoustic signal processing, architectural acoustics, audio signal processing, Computational modeling, Computer interfaces, Computer simulation, Educational institutions, image method, image sources, Impedance, Laboratories, microphone arrays, multipole expansions, Nails, performance evaluation, reverberant sound fields, reverberation, room reverberation, simulation, Simulations, speedup, virtual audio},
	isbn = {0-7803-7126-7},
	doi = {10.1109/ASPAA.2001.969578},
	author = {Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N and Davis, Larry S.}
}
@conference {16162,
	title = {Simulation based learning environments and the use of learning histories},
	booktitle = {CHI {\textquoteright}00 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {2 - 3},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We have developed an application framework for constructing simulation-based learning environments using dynamic simulations and visualizations to represent realistic time-dependent behavior. The development environment is described and many examples are given. In particular we will focus on the learning historian which provides users and learners with a manipulatable recording of their actions which facilitates the exchange of annotated history records among peers and mentors.},
	keywords = {education, engineering, History, learning, simulation},
	isbn = {1-58113-248-4},
	doi = {10.1145/633292.633294},
	url = {http://doi.acm.org/10.1145/633292.633294},
	author = {Rose,A. and Salter,R. and Keswani,S. and Kositsyna,N. and Plaisant, Catherine and Rubloff,G. and Shneiderman, Ben}
}
@conference {14818,
	title = {Speed vs. Accuracy in Simulation for I/O-Intensive Applications},
	booktitle = {Parallel and Distributed Processing Symposium, International},
	year = {2000},
	month = {2000///},
	pages = {315 - 315},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time.},
	keywords = {discrete-event simulation, i/o-intensive applications, parallel or distributed applications, performance prediction, simulation},
	doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2000.846001},
	author = {Eom, Hyeonsang and Hollingsworth, Jeffrey K}
}
@conference {16166,
	title = {The design of history mechanisms and their use in collaborative educational simulations},
	booktitle = {Proceedings of the 1999 conference on Computer support for collaborative learning},
	series = {CSCL {\textquoteright}99},
	year = {1999},
	month = {1999///},
	publisher = {International Society of the Learning Sciences},
	organization = {International Society of the Learning Sciences},
	abstract = {Reviewing past events has been useful in many domains. Videotapes and flight data recorders provide invaluable technological help to sports coaches or aviation engineers. Similarly, providing learners with a readable recording of their actions may help them monitor their behavior, reflect on their progress, and experiment with revisions of their experiences. It may also facilitate active collaboration among dispersed learning communities. Learning histories can help students and professionals make more effective use of digital library searching, word processing tasks, computer-assisted design tools, electronic performance support systems, and web navigation.This paper describes the design space and discusses the challenges of implementing learning histories. It presents guidelines for creating effective implementations, and the design tradeoffs between sparse and dense history records. The paper also presents a first implementation of learning histories for a simulation-based engineering learning environment called SimPLE (Simulated Processes in a Learning Environment) for the case of a semiconductor fabrication module, and reports on early user evaluation of learning histories implemented within SimPLE.},
	keywords = {hci, scaffolding, simulation},
	url = {http://dl.acm.org/citation.cfm?id=1150240.1150284},
	author = {Plaisant, Catherine and Rose,Anne and Rubloff,Gary and Salter,Richard and Shneiderman, Ben}
}
@conference {15691,
	title = {Integrated admission control in hierarchical video-on-demand systems},
	booktitle = {IEEE International Conference on Multimedia Computing and Systems, 1999},
	volume = {1},
	year = {1999},
	month = {1999/07//},
	pages = {220-225 vol.1 - 220-225 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We develop a unified model of a hierarchical video-on-demand (VoD) system by integrating the storage and the network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking},
	keywords = {Admission control, Bandwidth, blocking, Computer science, Design methodology, end-to-end system, hierarchical video-on-demand systems, integrated admission control, Intelligent networks, Load management, Motion pictures, Network servers, network subsystem, performance, Performance analysis, performance evaluation, quality of service, request handling, resource allocation, Resource management, simulation, storage subsystem, video on demand, video servers},
	isbn = {0-7695-0253-9},
	doi = {10.1109/MMCS.1999.779196},
	author = {Mundur, Padma and Simon,R. and Sood,A.}
}
@article {15369,
	title = {2-D MOSFET modeling including surface effects and impact ionization by self-consistent solution of the Boltzmann, Poisson, and hole-continuity equations},
	journal = {Electron Devices, IEEE Transactions on},
	volume = {44},
	year = {1997},
	month = {1997/02//},
	pages = {257 - 267},
	abstract = {We present a new two-dimensional (2-D) MOSFET simulation method achieved by directly solving the Boltzmann transport equation for electrons, the hole-current continuity equation, and the Poisson equation self-consistently. The spherical harmonic method is used for the solution of the Boltzmann equation. The solution directly gives the electron distribution function, electrostatic potential, and the hole concentration for the entire 2-D MOSFET. Average quantities such as electron concentration and electron temperature are obtained directly from the integration of the distribution function. The collision integral is formulated to arbitrarily high spherical harmonic order, and new collision terms are included that incorporate effects of surface scattering and electron-hole pair recombination/generation. I-V characteristics, which agree with experiment, are calculated directly from the distribution function for an LDD submicron MOSFET. Electron-hole pair generation due to impact ionization is also included by direct application of the collision integral. The calculations are efficient enough for day-to-day engineering design on workstation-type computers},
	keywords = {2D, characteristics;LDD, concentration;electron, concentration;hole-continuity, density;electron-hole, density;impact, device, distribution, effects;surface, equation;collision, equation;I-V, equation;MOSFET;electron, equations;impact, equations;semiconductor, function;electron, generation;electron-hole, harmonic, integral;electron, ionisation;integral, ionization;self-consistent, method;Boltzmann, method;surface, modeling;Boltzmann, models;surface, MOSFET, MOSFET;Poisson, pair, potential;hole, recombination;electrostatic, recombination;hole, scattering;, scattering;two-dimensional, simulation, solution;spherical, submicron, temperature;electron-hole, transport},
	isbn = {0018-9383},
	doi = {10.1109/16.557713},
	author = {Liang,Wenchao and Goldsman,N. and Mayergoyz, Issak D and Oldiges,P.J.}
}
@article {18435,
	title = {Striving for correctness},
	journal = {Computers \& Security},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {719 - 738},
	abstract = {In developing information technology, you want assurance that systems are secure and reliable, but you cannot have assurance or security without correctness. We discuss methods used to achieve correctness, focusing on weaknesses and approaches that management might take to increase belief in correctness. Formal methods, simulation, testing, and process modeling are addressed in detail. Structured programming, life-cycle modeling like the spiral model, use of CASE tools, use of formal methods, object-oriented design, reuse of existing code are also mentioned. Reliance on these methods involves some element of belief since no validated metrics on the effectiveness of these methods exist. Suggestions for using these methods as the basis for managerial decisions conclude the paper.},
	keywords = {Assurance, belief, correctness, Formal Methods, MATHEMATICAL MODELS, metrics, Process models, Risk management, Security testing, Silver bullets, simulation, Trustworthiness},
	isbn = {0167-4048},
	doi = {10.1016/0167-4048(95)00022-4},
	url = {http://www.sciencedirect.com/science/article/pii/0167404895000224},
	author = {Abrams,Marshall D. and Zelkowitz, Marvin V}
}
