TY - ER - TY - CONF TI - Mitigating attacks on open functionality in SMS-capable cellular networks AU - Traynor, Patrick AU - Enck, William AU - McDaniel, Patrick AU - La Porta, Thomas T2 - ACM C2 - 2006/// C3 - Proceedings of the 12th annual international conference on Mobile computing and networking DA - 2006/// SP - 182-193 ER - TY - THES TI - Analysis of Open Functionality in SMS-capable Cellular Networks AU - Enck, William Harold DA - 2006/// PY - 2006/// PB - Pennsylvania State University ER - TY - CONF TI - Automated adaptive ranking and filtering of static analysis alerts AU - Heckman, Sarah AU - Williams, Laurie C2 - 2006/// C3 - Proc of the Fast abstract at the International Symposium on Software Reliability Engineering (ISSRE) DA - 2006/// ER - TY - CHAP TI - Optical Packet Switching (OPS) AU - Rouskas, G.N. AU - Xu, L. T2 - Optical Networks A2 - Sivalingam, Krishna A2 - Subramanian, Suresh PY - 2006/6/15/ DO - 10.1007/0-387-29188-1_17 SP - 797–843 PB - Kluwer Academic Publishers SN - 0387290559 UR - http://dx.doi.org/10.1007/0-387-29188-1_17 ER - TY - JOUR TI - Checking and Correcting Behaviors of Java Programs at Runtime with Java-MOP T2 - Electr. Notes Theor. Comput. Sci. AB - Monitoring-oriented programming (MOP) is a software development and analysis technique in which monitoring plays a fundamental role. MOP users can add their favorite or domain-specific requirements specification formalisms into the framework by means of logic plug-ins, which essentially comprise monitor synthesis algorithms for properties expressed as formulae. The properties are specified together with declarations stating where and how to automatically integrate the corresponding monitor into the system, as well as what to do if the property is violated or validated. In this paper we present Java-MOP, an MOP environment for developing robust Java applications. Based upon a carefully designed specification schema and upon several logic plug-ins, Java-MOP allows users to specify and monitor properties which can refer not only to the current program state, but also to the entire execution trace of a program, including past and future behaviors. DA - 2006/// PY - 2006/// DO - 10.1016/j.entcs.2006.02.002 VL - 144 IS - 4 SP - 3-20 UR - https://doi.org/10.1016/j.entcs.2006.02.002 ER - TY - CONF TI - An Empirical Comparison of Automated Generation and Classification Techniques for Object-Oriented Unit Testing AU - d’Amorim, Marcelo AU - Pacheco, Carlos AU - Xie, Tao AU - Marinov, Darko AU - Ernst, Michael D. AB - Testing involves two major activities: generating test inputs and determining whether they reveal faults. Automated test generation techniques include random generation and symbolic execution. Automated test classification techniques include ones based on uncaught exceptions and violations of operational models inferred from manually provided tests. Previous research on unit testing for object-oriented programs developed three pairs of these techniques: model-based random testing, exception-based random testing, and exception-based symbolic testing. We develop a novel pair, model-based symbolic testing. We also empirically compare all four pairs of these generation and classification techniques. The results show that the pairs are complementary (i.e., reveal faults differently), with their respective strengths and weaknesses C2 - 2006/// C3 - 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 18-22 September 2006, Tokyo, Japan DA - 2006/// DO - 10.1109/ASE.2006.13 SP - 59-68 UR - https://doi.org/10.1109/ASE.2006.13 ER - TY - CONF TI - 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 18-22 September 2006, Tokyo, Japan C2 - 2006/// DA - 2006/// PB - IEEE Computer Society UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4019543 ER - TY - CONF TI - 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 18-22 September 2006, Tokyo, Japan C2 - 2006/// DA - 2006/// PB - IEEE Computer Society UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4019543 ER - TY - JOUR TI - Dynamic Wavelength Sharing Policies for Absolute QoS in OBS Networks AU - Yang, Li AU - Rouskas, George N. AU - IEEE T2 - Globecom 2006 - 2006 Ieee Global Telecommunications Conference DA - 2006/// PY - 2006/// ER - TY - JOUR TI - Adaptive path selection in OBS networks AU - Yang, Li AU - Rouskas, George N. T2 - Journal of Lightwave Technology AB - In this paper, the authors investigate the concept of adaptive path selection in optical burst-switched networks and its potential to reducing the overall burst drop probability. Specifically, the authors assume that each source maintains a (short) list of alternate paths to each destination and uses information regarding the recent congestion status of the network links to rank the paths; it then transmits bursts along the least congested path. The authors present a suite of path selection strategies, each utilizing a different type of information regarding the link congestion status, and evaluate them using simulation. The results demonstrate that, in general, adaptive path selection outperforms shortest path routing, and, depending on the path strategy involved, the network topology, and the traffic pattern, this improvement can be significant. A new framework for the development of hybrid (or meta) path selection strategies, which make routing decisions based on a weighted combination of the decisions taken by several independent path selection strategies, has been presented. This paper presents two instances of such hybrid strategies, i.e., 1) one that assigns static weights and 2) one that dynamically adjusts the weights based on feedback from the network; it has been shown that these strategies can further improve the overall burst drop probability in the network. DA - 2006/// PY - 2006/// DO - 10.1109/JLT.2006.878087 VL - 24 IS - 8 SP - 3002-3011 ER - TY - JOUR TI - A framework for absolute QoS guarantees in optical burst switched networks AU - Yang, Li AU - Rouskas, George N. AU - IEEE T2 - 2006 3rd International Conference on Broadband Communications, Networks and Systems, Vols 1-3 DA - 2006/// PY - 2006/// SP - 1-10 ER - TY - CONF TI - Representational requirements for a plan based approach to automated camera control AU - Jhala, A. AU - Young, R.M. C2 - 2006/// C3 - Proceedings of the 2nd Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE 2006 DA - 2006/// SP - 36-41 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77955679106&partnerID=MN8TOARS ER - TY - CONF TI - Darshak - An intelligent cinematic camera planning system AU - Jhala, A. C2 - 2006/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2006/// VL - 2 SP - 1918-1919 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33750703153&partnerID=MN8TOARS ER - TY - RPRT TI - Grid Optical Burst Switched Networks GOBS AU - Battestilli, Lina A3 - Global Grid Forum, GHPN Group DA - 2006/// PY - 2006/// M3 - Technical Memo PB - Global Grid Forum, GHPN Group ER - TY - CONF TI - Monitoring and Discovery for EnLIGHTened Computing AU - Tanwir, S. AU - Battestilli, L. AU - Perros, H. AU - Karmous-Edwards, G. C2 - 2006/// C3 - Proceedings of IEEE High Capacity Optical Networks’06 Conference DA - 2006/// PB - IEEE ER - TY - CONF TI - Challenges in Symbolic Computation Software, number 06271 T2 - Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI) A2 - Decker, Wolfram A2 - Dewar, Mike A2 - Kaltofen, Erich A2 - Watt, Stephen C2 - 2006/// C3 - Dagstuhl Seminar Proceedings CY - Schloss Dagstuhl DA - 2006/// PB - Schloss Dagstuhl ER - TY - CHAP TI - How to get a Ph.D in America AU - Matsuda, N. T2 - University Authority A2 - Arimoto, Akira A2 - Kitagaki, Ikuo PY - 2006/// SP - 132–137 PB - Minervashobo Publishers Inc ER - TY - RPRT TI - A Key-Based Adaptive Transactional Memory Executor AU - Bai, Tongxin AU - Shen, Xipeng AU - Zhang, Chengliang AU - Scherer, William N. AU - Ding, Chen AU - Scott, Michael L. A3 - Computer Science Dept., University of Rochester DA - 2006/12// PY - 2006/12// M1 - TR909 PB - Computer Science Dept., University of Rochester SN - TR909 ER - TY - CHAP TI - Cognitive and Computational Models in Interactive Narratives AU - Young, R.Michael T2 - Cognitive Systems: Human Cognitive Models in Systems Design A2 - Forsythe, Chris A2 - Bernard, Michael L. A2 - Goldsmith, Timothy E. PY - 2006/// SP - 213–235 PB - Lawrence Erlbaum SN - 9781410617088 ER - TY - RPRT TI - Waste Not, Want Not: Adaptive Garbage Collection in a Shared Environment AU - Zhang, Chengliang AU - Kelsey, Kirk AU - Shen, Xipeng AU - Ding, Chen AU - Hertz, Matthew AU - Ogihara, Mitsu A3 - Computer Science Dept., University of Rochester DA - 2006/12// PY - 2006/12// M1 - TR908 M3 - Technical Report PB - Computer Science Dept., University of Rochester SN - TR908 ER - TY - RPRT TI - Behavior-Oriented Parallelization AU - Parallelization”, Behavior-Oriented AU - Ding, Chen AU - Shen, Xipeng AU - Kelsey, Kirk AU - Tice, Chris AU - Huang, Ruke AU - Zhang, Chengliang A3 - Computer Science Dept., University of Rochester DA - 2006/11// PY - 2006/11// M1 - TR904 M3 - Technical Report PB - Computer Science Dept., University of Rochester SN - TR904 ER - TY - RPRT TI - Accurate Approximation of Locality from Time Distance Histograms AU - Shen, Xipeng AU - Shaw, Jonathan AU - Meeker, Brian A3 - Computer Science Dept., University of Rochester DA - 2006/7// PY - 2006/7// M1 - TR902 M3 - Technical Report PB - Computer Science Dept., University of Rochester SN - TR902 ER - TY - RPRT TI - Locality Approximation Using Time AU - Shen, Xipeng AU - Shaw, Jonathan AU - Meeker, Brian AU - Ding, Chen A3 - Computer Science Dept., University of Rochester DA - 2006/7// PY - 2006/7// M1 - TR901 M3 - Technical Report PB - Computer Science Dept., University of Rochester SN - TR901 ER - TY - CONF TI - Stevens dot patterns for 2D flow visualization AU - Tateosian, Laura G. AU - Dennis, Brent M. AU - Healey, Christopher G. T2 - the 3rd symposium AB - This paper describes a new technique to visualize 2D flow fields with a sparse collection of dots. A cognitive model proposed by Kent Stevens describes how spatially local configurations of dots are processed in parallel by the low-level visual system to perceive orientations throughout the image. We integrate this model into a visualization algorithm that converts a sparse grid of dots into patterns that capture flow orientations in an underlying flow field. We describe how our algorithm supports large flow fields that exceed the capabilities of a display device, and demonstrate how to include properties like direction and velocity in our visualizations. We conclude by applying our technique to 2D slices from a simulated supernova collapse. C2 - 2006/// C3 - Proceedings of the 3rd symposium on Applied perception in graphics and visualization - APGV '06 DA - 2006/// DO - 10.1145/1140491.1140511 PB - ACM Press SN - 1595934294 UR - http://dx.doi.org/10.1145/1140491.1140511 DB - Crossref ER - TY - CHAP TI - Burst Loss Probabilities in an OBS Network with Dynamic Simultaneous Link Possession AU - Battestilli, Tzvetelina AU - Perros, Harry T2 - Advances in Computer Science and Engineering: Texts PY - 2006/9// DO - 10.1142/9781860948923_0012 SP - 205-225 OP - PB - PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO. SN - 9781860946615 9781860948923 UR - http://dx.doi.org/10.1142/9781860948923_0012 DB - Crossref ER - TY - CHAP TI - Grid Networks and Layer 1 Services AU - Karmous-Edwards, Gigi AU - Mambretti, Joe AU - Simeonidou, Dimitra AU - Jukan, Admela AU - Battestilli, Tzvetelina AU - Perros, Harry AU - Xin, Yufeng AU - Strand, John T2 - Grid Networks PY - 2006/7/24/ DO - 10.1002/0470028696.ch12 SP - 217-252 OP - PB - John Wiley & Sons, Ltd SN - 9780470028698 9780470017487 9780470028704 UR - http://dx.doi.org/10.1002/0470028696.ch12 DB - Crossref ER - TY - CHAP TI - UMN-MapServer: A High-Performance, Interoperable, and Open Source Web Mapping and Geo-spatial Analysis System AU - Vatsavai, Ranga Raju AU - Shekhar, Shashi AU - Burk, Thomas E. AU - Lime, Stephen T2 - Geographic Information Science AB - Recent advances in Internet technologies, coupled with wide adoption of the web services paradigm and interoperability standards, makes the World Wide Web a popular vehicle for geo-spatial information distribution and online geo-processing. Web GIS is rapidly evolving and adapting to advances in Internet technologies. Web GISes are predominantly designed under a “thin-client / fat-server” paradigm. This approach has several disadvantages. For example, as the number of users increases, the load on the server increases and system performance decreases. Recently the focus has been shifted towards client-side Web GISes, which are heavy-duty, stand-alone systems. We take an opposing approach and present a load balancing client/server Web-based spatial analysis system, UMN-MapServer, and evaluate its performance in a regional natural resource mapping and analysis (NRAMS) application which utilizes biweekly AVHRR imagery and several other raster and vector geo-spatial datasets. We also evaluate alternative approaches and assess the pros and cons of our design and implementation. UMN-MapServer also implements several open standards, such as, WMS, WCS, GML and WFS. In this paper, we also describe in detail the WMS, WCS,and GML extensions from the interoperability point of view, and discuss issues related to adoption of such standards. PY - 2006/// DO - 10.1007/11863939_26 SP - 400-417 OP - PB - Springer Berlin Heidelberg SN - 9783540445265 9783540445289 UR - http://dx.doi.org/10.1007/11863939_26 DB - Crossref ER - TY - CHAP TI - Improving DB2 Performance Expert – A Generic Analysis Framework AU - Mignet, Laurent AU - Basak, Jayanta AU - Bhide, Manish AU - Roy, Prasan AU - Roy, Sourashis AU - Sengar, Vibhuti S. AU - Vatsavai, Ranga R. AU - Reichert, Michael AU - Steinbach, Torsten AU - Ravikant, D. V. S. AU - Vadapalli, Soujanya T2 - Lecture Notes in Computer Science AB - The complexity of software has been dramatically increasing over the years. Database management systems have not escaped this complexity. On the contrary, this problem is aggravated in database systems because they try to integrate multiple paradigms (object, relational, XML) in one box and are supposed to perform well in every scenario unlike OLAP or OLTP. As a result, it is very difficult to fine tune the performance of a DBMS. Hence, there is a need for a external tool which can monitor and fine tune the DBMS. In this extended abstract, we describe a few techniques to improve DB2 Performance Expert, which helps in monitoring DB2. Specifically, we describe a component which is capable of doing early performance problem detection by analyzing the sensor values over a long period of time. We also showcase a trends plotter and workload characterizer which allows a DBA to have a better understanding of the resource usages. A prototype of these tools has been demonstrated to a few select customers and based on their feedback this paper outlines the various issues that still need to be addressed in the next versions of the tool. PY - 2006/// DO - 10.1007/11687238_68 SP - 1097-1101 OP - PB - Springer Berlin Heidelberg SN - 9783540329602 9783540329619 UR - http://dx.doi.org/10.1007/11687238_68 DB - Crossref ER - TY - CONF TI - Program-level adaptive memory management AU - Zhang, Chengliang AU - Kelsey, Kirk AU - Shen, Xipeng AU - Ding, Chen AU - Hertz, Matthew AU - Ogihara, Mitsunori T2 - the 2006 international symposium AB - Most application's performance is impacted by the amount of available memory. In a traditional application, which has a fixed working set size, increasing memory has a beneficial effect up until the application's working set is met. In the presence of garbage collection this relationship becomes more complex. While increasing the size of the program's heap reduces the frequency of collections, collecting a heap with memory paged to the backing store is very expensive. We first demonstrate the presence of an optimal heap size for a number of applications running on a machine with a specific configuration. We then introduce a scheme which adaptively finds this good heap size. In this scheme, we track the memory usage and number of page faults at a program's phase boundaries. Using this information, the system selects the soft heap size. By adapting itself dynamically, our scheme is independent of the underlying main memory size, code optimizations, and garbage collection algorithm. We present several experiments on real applications to show the effectiveness of our approach. Our results show that program-level heap control provides up to a factor of 7.8 overall speedup versus using the best possible fixed heap size controlled by the virtual machine on identical garbage collectors. C2 - 2006/// C3 - Proceedings of the 2006 international symposium on Memory management - ISMM '06 DA - 2006/// DO - 10.1145/1133956.1133979 PB - ACM Press SN - 1595932216 UR - http://dx.doi.org/10.1145/1133956.1133979 DB - Crossref ER - TY - JOUR TI - Just enough learning (of association rules): the TAR2 “Treatment” learner AU - Menzies, Tim AU - Hu, Ying T2 - Artificial Intelligence Review DA - 2006/5// PY - 2006/5// DO - 10.1007/s10462-007-9055-0 VL - 25 IS - 3 SP - 211-229 J2 - Artif Intell Rev LA - en OP - SN - 0269-2821 1573-7462 UR - http://dx.doi.org/10.1007/s10462-007-9055-0 DB - Crossref KW - TAR2 KW - treatment learning KW - contrast set learning ER - TY - CHAP TI - Toward Legal Argument Instruction with Graph Grammars and Collaborative Filtering Techniques AU - Pinkwart, Niels AU - Aleven, Vincent AU - Ashley, Kevin AU - Lynch, Collin T2 - Intelligent Tutoring Systems AB - This paper presents an approach for intelligent tutoring in the field of legal argumentation. In this approach, students study transcripts of US Supreme Court oral argument and create a graphical representation of argument flow as tests offered by attorneys being challenged by hypotheticals posed by Justices. The proposed system, which is based on the collaborative modeling framework Cool Modes, is capable of detecting three types of weaknesses in arguments; when it does, it presents the student with a self explanation prompt. This kind of feedback seems more appropriate than the “strong connective feedback” typically offered by model-tracing or constraint-based tutors. Structural and context weaknesses in arguments are handled by graph grammars, and the critical problem of detecting and dealing with content weaknesses in student contributions is addressed through a collaborative filtering approach, thereby avoiding the critical problem of natural language processing in legal argumentation. An early version of the system was pilot tested with two students. PY - 2006/// DO - 10.1007/11774303_23 SP - 227-236 OP - PB - Springer Berlin Heidelberg SN - 9783540351597 9783540351603 UR - http://dx.doi.org/10.1007/11774303_23 DB - Crossref ER - TY - CHAP TI - Privacy Preserving Web-Based Email AU - Butler, Kevin AU - Enck, William AU - Plasterr, Jennifer AU - Traynor, Patrick AU - McDaniel, Patrick T2 - Information Systems Security AB - Recent web-based applications offer users free service in exchange for access to personal communication, such as on-line email services and instant messaging. The inspection and retention of user communication is generally intended to enable targeted marketing. However, unless specifically stated otherwise by the collecting service’s privacy policy, such records have an indefinite lifetime and may be later used or sold without restriction. In this paper, we show that it is possible to protect a user’s privacy from these risks by exploiting mutually oblivious, competing communication channels. We create virtual channels over online services (e.g., Google’s Gmail, Microsoft’s Hotmail) through which messages and cryptographic keys are delivered. The message recipient uses a shared secret to identify the shares and ultimately recover the original plaintext. In so doing, we create a wired “spread-spectrum” mechanism for protecting the privacy of web-based communication. We discuss the design and implementation of our open-source Java applet, Aquinas, and consider ways that the myriad of communication channels present on the Internet can be exploited to preserve privacy. PY - 2006/// DO - 10.1007/11961635_8 SP - 116-131 OP - PB - Springer Berlin Heidelberg SN - 9783540689621 9783540689638 UR - http://dx.doi.org/10.1007/11961635_8 DB - Crossref ER - TY - CHAP TI - Password Exhaustion: Predicting the End of Password Usefulness AU - Clair, Luke St. AU - Johansen, Lisa AU - Enck, William AU - Pirretti, Matthew AU - Traynor, Patrick AU - McDaniel, Patrick AU - Jaeger, Trent T2 - Information Systems Security AB - Passwords are currently the dominant authentication mechanism in computing systems. However, users are unwilling or unable to retain passwords with a large amount of entropy. This reality is exacerbated by the increasing ability of systems to mount offline attacks. In this paper, we evaluate the degree to which the previous statements are true and attempt to ascertain the point at which passwords are no longer sufficient to securely mediate authentication. In order to demonstrate this, we develop an analytical model for computation to understand the time required to recover random passwords. Further, an empirical study suggests the situation is much worse. In fact, we found that past systems vulnerable to offline attacks will be obsolete in 5-15 years, and our study suggests that a large number of these systems are already obsolete. We conclude that we must discard or fundamentally change these systems, and to that effect, we suggest a number of ways to prevent offline attacks. PY - 2006/// DO - 10.1007/11961635_3 SP - 37-55 OP - PB - Springer Berlin Heidelberg SN - 9783540689621 9783540689638 UR - http://dx.doi.org/10.1007/11961635_3 DB - Crossref ER - TY - JOUR TI - Gene network shaping of inherent noise spectra AU - Austin, D. W. AU - Allen, M. S. AU - McCollum, J. M. AU - Dar, R. D. AU - Wilgus, J. R. AU - Sayler, G. S. AU - Samatova, N. F. AU - Cox, C. D. AU - Simpson, M. L. T2 - Nature DA - 2006/2// PY - 2006/2// DO - 10.1038/nature04194 VL - 439 IS - 7076 SP - 608-611 J2 - Nature LA - en OP - SN - 0028-0836 1476-4687 UR - http://dx.doi.org/10.1038/nature04194 DB - Crossref ER - TY - JOUR TI - Detecting Differential and Correlated Protein Expression in Label-Free Shotgun Proteomics AU - Zhang, Bing AU - VerBerkmoes, Nathan C. AU - Langston, Michael A. AU - Uberbacher, Edward AU - Hettich, Robert L. AU - Samatova, Nagiza F. T2 - Journal of Proteome Research AB - Recent studies have revealed a relationship between protein abundance and sampling statistics, such as sequence coverage, peptide count, and spectral count, in label-free liquid chromatography−tandem mass spectrometry (LC−MS/MS) shotgun proteomics. The use of sampling statistics offers a promising method of measuring relative protein abundance and detecting differentially expressed or coexpressed proteins. We performed a systematic analysis of various approaches to quantifying differential protein expression in eukaryotic Saccharomyces cerevisiae and prokaryotic Rhodopseudomonas palustris label-free LC−MS/MS data. First, we showed that, among three sampling statistics, the spectral count has the highest technical reproducibility, followed by the less-reproducible peptide count and relatively nonreproducible sequence coverage. Second, we used spectral count statistics to measure differential protein expression in pairwise experiments using five statistical tests: Fisher's exact test, G-test, AC test, t-test, and LPE test. Given the S. cerevisiae data set with spiked proteins as a benchmark and the false positive rate as a metric, our evaluation suggested that the Fisher's exact test, G-test, and AC test can be used when the number of replications is limited (one or two), whereas the t-test is useful with three or more replicates available. Third, we generalized the G-test to increase the sensitivity of detecting differential protein expression under multiple experimental conditions. Out of 1622 identified R. palustris proteins in the LC−MS/MS experiment, the generalized G-test detected 1119 differentially expressed proteins under six growth conditions. Finally, we studied correlated expression of these 1119 proteins by analyzing pairwise expression correlations and by delineating protein clusters according to expression patterns. Through pairwise expression correlation analysis, we demonstrated that proteins co-located in the same operon were much more strongly coexpressed than those from different operons. Combining cluster analysis with existing protein functional annotations, we identified six protein clusters with known biological significance. In summary, the proposed generalized G-test using spectral count sampling statistics is a viable methodology for robust quantification of relative protein abundance and for sensitive detection of biologically significant differential protein expression under multiple experimental conditions in label-free shotgun proteomics. Keywords: label-free • LC−MS/MS • shotgun proteomics • differential expression • correlated expression • clustering • Saccharomyces cerevisiae • Rhodopseudomonas palustris DA - 2006/11// PY - 2006/11// DO - 10.1021/pr0600273 VL - 5 IS - 11 SP - 2909-2918 J2 - J. Proteome Res. LA - en OP - SN - 1535-3893 1535-3907 UR - http://dx.doi.org/10.1021/pr0600273 DB - Crossref KW - label-free KW - LC-MS/MS KW - shotgun proteomics KW - differential expression KW - correlated expression KW - clustering KW - Saccharomyces cerevisiae KW - Rhodopseudomonas palustris ER - TY - JOUR TI - Robust Estimation of Peptide Abundance Ratios and Rigorous Scoring of Their Variability and Bias in Quantitative Shotgun Proteomics AU - Pan, Chongle AU - Kora, Guruprasad AU - Tabb, David L. AU - Pelletier, Dale A. AU - McDonald, W. Hayes AU - Hurst, Gregory B. AU - Hettich, Robert L. AU - Samatova, Nagiza F. T2 - Analytical Chemistry AB - The abundance ratio between the light and heavy isotopologues of an isotopically labeled peptide can be estimated from their selected ion chromatograms. However, quantitative shotgun proteomics measurements yield selected ion chromatograms at highly variable signal-to-noise ratios for tens of thousands of peptides. This challenge calls for algorithms that not only robustly estimate the abundance ratios of different peptides but also rigorously score each abundance ratio for the expected estimation bias and variability. Scoring of the abundance ratios, much like scoring of sequence assignment for tandem mass spectra by peptide identification algorithms, enables filtering of unreliable peptide quantification and use of formal statistical inference in the subsequent protein abundance ratio estimation. In this study, a parallel paired covariance algorithm is used for robust peak detection in selected ion chromatograms. A peak profile is generated for each peptide, which is a scatterplot of ion intensities measured for the two isotopologues within their chromatographic peaks. Principal component analysis of the peak profile is proposed to estimate the peptide abundance ratio and to score the estimation with the signal-to-noise ratio of the peak profile (profile signal-to-noise ratio). We demonstrate that the profile signal-to-noise ratio is inversely correlated with the variability and bias of peptide abundance ratio estimation. DA - 2006/10// PY - 2006/10// DO - 10.1021/ac0606554 VL - 78 IS - 20 SP - 7110-7120 J2 - Anal. Chem. LA - en OP - SN - 0003-2700 1520-6882 UR - http://dx.doi.org/10.1021/ac0606554 DB - Crossref ER - TY - JOUR TI - ProRata:  A Quantitative Proteomics Program for Accurate Protein Abundance Ratio Estimation with Confidence Interval Evaluation AU - Pan, Chongle AU - Kora, Guruprasad AU - McDonald, W. Hayes AU - Tabb, David L. AU - VerBerkmoes, Nathan C. AU - Hurst, Gregory B. AU - Pelletier, Dale A. AU - Samatova, Nagiza F. AU - Hettich, Robert L. T2 - Analytical Chemistry AB - A profile likelihood algorithm is proposed for quantitative shotgun proteomics to infer the abundance ratios of proteins from the abundance ratios of isotopically labeled peptides derived from proteolysis. Previously, we have shown that the estimation variability and bias of peptide abundance ratios can be predicted from their profile signal-to-noise ratios. Given multiple quantified peptides for a protein, the profile likelihood algorithm probabilistically weighs the peptide abundance ratios by their inferred estimation variability, accounts for their expected estimation bias, and suppresses contribution from outliers. This algorithm yields maximum likelihood point estimation and profile likelihood confidence interval estimation of protein abundance ratios. This point estimator is more accurate than an estimator based on the average of peptide abundance ratios. The confidence interval estimation provides an "error bar" for each protein abundance ratio that reflects its estimation precision and statistical uncertainty. The accuracy of the point estimation and the precision and confidence level of the interval estimation were benchmarked with standard mixtures of isotopically labeled proteomes. The profile likelihood algorithm was integrated into a quantitative proteomics program, called ProRata, freely available at www.MSProRata.org. DA - 2006/10// PY - 2006/10// DO - 10.1021/ac060654b VL - 78 IS - 20 SP - 7121-7131 J2 - Anal. Chem. LA - en OP - SN - 0003-2700 1520-6882 UR - http://dx.doi.org/10.1021/ac060654b DB - Crossref ER - TY - JOUR TI - The sorting direct method for stochastic simulation of biochemical systems with varying reaction execution behavior AU - McCollum, James M. AU - Peterson, Gregory D. AU - Cox, Chris D. AU - Simpson, Michael L. AU - Samatova, Nagiza F. T2 - Computational Biology and Chemistry AB - A key to advancing the understanding of molecular biology in the post-genomic age is the development of accurate predictive models for genetic regulation, protein interaction, metabolism, and other biochemical processes. To facilitate model development, simulation algorithms must provide an accurate representation of the system, while performing the simulation in a reasonable amount of time. Gillespie's stochastic simulation algorithm (SSA) accurately depicts spatially homogeneous models with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, we examine the performance of different versions of the SSA when applied to several biochemical models. Through our analysis, we discover that transient changes in reaction execution frequencies, which are typical of biochemical models with gene induction and repression, can dramatically affect simulator performance. To account for these shifts, we propose a new algorithm called the sorting direct method that maintains a loosely sorted order of the reactions as the simulation executes. Our measurements show that the sorting direct method performs favorably when compared to other well-known exact stochastic simulation algorithms. DA - 2006/2// PY - 2006/2// DO - 10.1016/j.compbiolchem.2005.10.007 VL - 30 IS - 1 SP - 39-49 J2 - Computational Biology and Chemistry LA - en OP - SN - 1476-9271 UR - http://dx.doi.org/10.1016/j.compbiolchem.2005.10.007 DB - Crossref KW - stochastic simulation KW - modeling biochemical systems KW - Gillespie algorithm KW - gene networks KW - systems biology ER - TY - CHAP TI - “What Would You Like to Talk About?” An Evaluation of Social Conversations with a Virtual Receptionist AU - Babu, Sabarish AU - Schmugge, Stephen AU - Barnes, Tiffany AU - Hodges, Larry F. T2 - Intelligent Virtual Agents AB - We describe an empirical study of Marve, a virtual receptionist located at the entrance of our research laboratory. Marve engages with lab members and visitors in natural face-to-face communication, takes and delivers messages, tells knock-knock jokes, conducts natural small talk on movies, and discusses the weather. In this research, we investigate the relative popularity of Marve’s social conversational capabilities and his role-specific messaging tasks, as well as his perceived social characteristics. Results indicate that users are interested in interacting with Marve, use social conversational conventions with Marve, and perceive and describe him as a social entity. PY - 2006/// DO - 10.1007/11821830_14 SP - 169-180 OP - PB - Springer Berlin Heidelberg SN - 9783540375937 9783540375944 UR - http://dx.doi.org/10.1007/11821830_14 DB - Crossref ER - TY - CONF TI - Hybrid symbolic-numeric computation AU - Kaltofen, Erich AU - Zhi, Lihong T2 - the 2006 international symposium AB - Several standard problems in symbolic computation, such as greatest common divisor and factorization of polynomials, sparse interpolation, or computing solutions to overdetermined systems of polynomial equations have non-trivial solutions only if the input coefficients satisfy certain algebraic constraints. Errors in the coefficients due to floating point round-off or through phsical measurement thus render the exact symbolic algorithms unusable. By symbolic-numeric methods one computes minimal deformations of the coefficients that yield non-trivial results. We will present hybrid algorithms and benchmark computations based on Gauss-Newton optimization, singular value decomposition(SVD) and structure-preserving total least squares (STLS) fitting for several of the above problems.A significant body of results to solve those "approximate computer algebra" problems has been discovered in the past 10 years. In the Computer Algebra Handbook the section on "Hybrid Methods" concludes as follows [2]: "The challenge of hybrid symbolic-numeric algorithms is to explore the effects of imprecision, discontinuity, and algorithmic complexity by applying mathematical optimization, perturbation theory, and inexact arithmetic and other tools in order to solve mathematical problems that today are not solvable by numerical or symbolic methods alone." The focus of our tutorial is on how to formulate several approximate symbolic computation problems as numerical problems in linear algebra and optimization and on software that realizes their solutions.Approximate Greatest Common Divisors [3]. Our paper at this conference presents a solution to the approximate GCD problem for several multivariate polynomials with real or complex coefficients. In addition, the coefficients of the minimally deformed input coefficients can be linearly constrained. In our tutorial we will give a precise definition of the approximate polynomial GCD problem and we will present techniques based on parametric optimization (slow) and STLS or Gauss/Newton iteration (fast) for its numerical solution. The fast methods can compute globally optimal solutions, but they cannot verify global optimality. We show how to apply the constrained approximate GCD problem to computing the nearest singular polynomial with a root of multiplicity at least k≥2.Approximate Factorization of Multivariate Polynomials [1]. Our solution and implementation of the approximate factorization problem follows our approach for the approximate GCD problem. Our algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use SVD or STLS and Gauss/Newton optimization to numerically compute the approximate multivariate factors.Solutions of Zero-dimensional Polynomial Systems [4]. We translate a system of polynomials into a system of linear partial differential equations (PDEs) with constant coefficients. The PDEs are brought to an involutive form by symbolic prolongations and numeric projections via SVD. The solutions of the polynomial system are obtained by solving an eigen-problem constructed from the null spaces of the involutive system and its geometric projections. C2 - 2006/// C3 - Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06 DA - 2006/// DO - 10.1145/1145768.1145775 PB - ACM Press SN - 1595932763 UR - http://dx.doi.org/10.1145/1145768.1145775 DB - Crossref ER - TY - CONF TI - Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields AU - Kaltofen, Erich AU - Koiran, Pascal T2 - the 2006 international symposium AB - We present algorithms that compute all irreducible factors of degree ≤ d of supersparse (lacunary) multivariate polynomials in n variables over an algebraic number field in deterministic polynomial-time in (l+d)n, where l is the size of the input polynomial. In supersparse polynomials, the term degrees enter logarithmically as their numbers of binary digits into the size measure l. The factors are again represented as supersparse polynomials. If the factors are represented as straight-line programs or black box polynomials, we can achieve randomized polynomial-time in (l+d)O(1). Our approach follows that by H. W. Lenstra, Jr., on computing factors of univariate supersparse polynomials over algebraic number fields. We generalize our ISSAC 2005 results for computing linear factors of supersparse bivariate polynomials over the rational numbers by appealing to recent lower bounds on the height of algebraic numbers and to a special case of the former Lang conjecture. C2 - 2006/// C3 - Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06 DA - 2006/// DO - 10.1145/1145768.1145798 PB - ACM Press SN - 1595932763 UR - http://dx.doi.org/10.1145/1145768.1145798 DB - Crossref ER - TY - CHAP TI - Synergy: Sharing-Aware Component Composition for Distributed Stream Processing Systems AU - Repantis, Thomas AU - Gu, Xiaohui AU - Kalogeraki, Vana T2 - Lecture Notes in Computer Science AB - Many emerging on-line data analysis applications require applying continuous query operations such as correlation, aggregation, and filtering to data streams in real-time. Distributed stream processing systems allow in-network stream processing to achieve better scalability and quality-of-service (QoS) provision. In this paper we present Synergy, a distributed stream processing middleware that provides sharing-aware component composition. Synergy enables efficient reuse of both data streams and processing components, while composing distributed stream processing applications with QoS demands. Synergy provides a set of fully distributed algorithms to discover and evaluate the reusability of available data streams and processing components when instantiating new stream applications. For QoS provision, Synergy performs QoS impact projection to examine whether the shared processing can cause QoS violations on currently running applications. We have implemented a prototype of the Synergy middleware and evaluated its performance on both PlanetLab and simulation testbeds. The experimental results show that Synergy can achieve much better resource utilization and QoS provision than previously proposed schemes, by judiciously sharing streams and processing components during application composition. PY - 2006/// DO - 10.1007/11925071_17 SP - 322-341 OP - PB - Springer Berlin Heidelberg SN - 9783540490234 9783540682561 UR - http://dx.doi.org/10.1007/11925071_17 DB - Crossref ER - TY - RPRT TI - All-Integer Dual Simplex for Binate Cover Problems (Draft) AU - Stallmann, M. DA - 2006/// PY - 2006/// DO - ER - TY - CHAP TI - Locally Invertible Multivariate Polynomial Matrices AU - Lobo, Ruben G. AU - Bitzer, Donald L. AU - Vouk, Mladen A. T2 - Coding and Cryptography AB - A new class of rectangular zero prime multivariate polynomial matrices are introduced and their inverses are computed. These matrices are ideal for use in multidimensional systems involving input-output transformations. We show that certain multivariate polynomial matrices, when transformed to the sequence space domain, have an invertible subsequence map between their input and output sequences. This invertible subsequence map can be used to derive the polynomial inverse matrix together with a set of pseudo-inverses. All computations are performed using elementary operations on the ground field without using any polynomial operations. PY - 2006/// DO - 10.1007/11779360_33 SP - 427-441 OP - PB - Springer Berlin Heidelberg SN - 9783540354819 9783540354826 UR - http://dx.doi.org/10.1007/11779360_33 DB - Crossref ER - TY - JOUR TI - Compatible triangulations and point partitions by series-triangular graphs AU - Danciger, Jeff AU - Devadoss, Satyan L. AU - Sheehy, Don T2 - Computational Geometry AB - We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a linear number of Steiner points added to each point set. Moreover, the compatible triangulations constructed by these methods are regular triangulations. DA - 2006/7// PY - 2006/7// DO - 10.1016/j.comgeo.2005.11.003 VL - 34 IS - 3 SP - 195-202 J2 - Computational Geometry LA - en OP - SN - 0925-7721 UR - http://dx.doi.org/10.1016/j.comgeo.2005.11.003 DB - Crossref KW - compatible triangulations KW - Steiner points KW - series-triangular graphs ER - TY - CONF TI - Expertiza: Students Helping to Write an OOD Text AU - Gehringer, Edward F. AU - Ehresman, Luke M. AU - Skrien, Dale J. T2 - OOPSLA 2006 Educators' Symposium AB - Students in a masters-level object-oriented design class participated in several exercises related to improving a not-yet-published textbook in object-oriented design. Each student was asked, sometime during the semester, to improve an explanation from the book, to make up an example of a concept described in the book, and to create an exercise for a chapter in the book. Their contributions were peer-reviewed by other members of the class. A strong majority of the students (29 of 49) indicated that they learned a lot from doing the assignments, and 27 of 49 of them agreed or strongly agreed that the assignments were enjoyable-a good measure of their engagement. The textbook author found the feedback very helpful in revising the textbook. C2 - 2006/// C3 - Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06 CY - Portland, OR DA - 2006/// PY - 2006/10/23/ DO - 10.1145/1176617.1176742 PB - ACM Press SN - 159593491X UR - http://dx.doi.org/10.1145/1176617.1176742 ER - TY - CONF TI - Trust representation and aggregation in a distributed agent system AU - Wang, Y. AU - Singh, M.P. C2 - 2006/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2006/// VL - 2 SP - 1425-1430 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33750688177&partnerID=MN8TOARS ER - TY - CONF TI - Specifying and resolving preferences among agent interaction patterns AU - Mallya, A.U. AU - Singh, M.P. AB - A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent weakness is that commitment protocols thus fail to distinguish between possible executions that are normal and those that may be allowed but are not ideal. This paper develops an approach for specifying preferences among executions that are allowed by a protocol. It captures sets of executions via an event constraint specification language and gives them a denotational characterization based on branching-time models. This paper develops algorithms for choosing the best execution path by considering the interplay between the preference specification of a protocol and local policies of agents interacting using the protocol, thereby giving the specifications a natural operational characterization. The value of the concepts developed is illustrated by its application to a recent practical framework for protocols called OWL-P. Further, the paper shows that the operational and denotational characterizations of preference specifications coincide. C2 - 2006/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2006/// DO - 10.1145/1160633.1160886 VL - 2006 SP - 1361-1368 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-34247231533&partnerID=MN8TOARS ER - TY - JOUR TI - Secure data management in reactive sensor networks T2 - Lecture Notes in Computer Science AB - A wireless sensor network (WSN), an ad hoc network of resource constrained sensor nodes, has become an attractive option for monitoring applications. The wide use of sensor networks is due to the cheap hardware and detailed information they provide to the end user. As with every network of every computing device, security is one of the key issue of sensor networks. The resource constrained nature of sensor nodes make the security quite challenging. The sensor networks are prone to many kinds of security attack viz. report fabrication attack, denial of service attack, Sybil attack, traffic analysis attack, node replication attack, physical attack etc. The report fabrication attack is a security attack in which the adversary tries to generate bogus reports by compromising the sensor nodes. This paper proposes a security solution that makes cluster based sensor networks resilient to report fabrication attacks. The proposed solution relies on symmetric key mechanisms, appropriate for random deployment and also handles the node failures. DA - 2006/// PY - 2006/// DO - 10.1007/11961635_16 UR - https://publons.com/publon/21294465/ ER - TY - CHAP TI - Producing Compliant Interactions: Conformance, Coverage, and Interoperability AU - Chopra, Amit K. AU - Singh, Munindar P. T2 - Declarative Agent Languages and Technologies IV AB - Agents in an open system interact with each other based on (typically, published) protocols. An agent may, however, deviate from the protocol because of its internal policies. Such deviations pose certain challenges: (1) the agent might no longer be conformant with the protocol—how do we determine if the agent is conformant? (2) the agent may no longer be able to interoperate with other agents—how do we determine if two agents are interoperable? (3) the agent may not be able to produce some protocol computations; in other words, it may not cover the protocol—how we determine if an agent covers a protocol?We formalize the notions of conformance, coverage and interoperability. A distinctive feature of our formalization is that the three are orthogonal to each other. Conformance and coverage are based on the semantics of runs (a run being a sequence of states), whereas interoperability among agents is based upon the traditional idea of blocking. We present a number of examples to comprehensively illustrate the orthogonality of conformance, coverage, and interoperability.Compliance is a property of an agent’s execution whereas conformance is a property of the agent’s design. In order to produce only compliant executions, first and foremost the agent must be conformant; second, it must also be able to interoperate with other agents. PY - 2006/// DO - 10.1007/11961536_1 SP - 1-15 OP - PB - Springer Berlin Heidelberg SN - 9783540689591 9783540689614 UR - http://dx.doi.org/10.1007/11961536_1 DB - Crossref ER - TY - BOOK TI - Service-Oriented Computing: Semantics, Processes, Agents AU - Singh, Munindar P. AU - Huhns, M.N. AB - Traditional approaches to software development - the ones embodied in CASE tools and modeling frameworks - are appropriate for building individual software components, but they are not designed to face the challenges of open environments. Service-oriented computing provides a way to create a new architecture that reflects components' trends toward autonomy and heterogeneity. We thus emphasize SOC concepts instead of how to deploy Web services in accord with current standards. To begin the series, we describe the key concepts and abstractions of SOC and the elements of a corresponding engineering methodology. DA - 2006/// PY - 2006/// DO - 10.1002/0470091509 PB - Chichester; Hoboken, NJ: Wiley SE - 1-549 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84947336240&partnerID=MN8TOARS ER - TY - JOUR TI - Report on the fourth international joint conference on Autonomous Agents and Multiagent Systems (AAMAS 2005) AU - Koenig, S. AU - Kraus, S. AU - Singh, M.P. AU - Wooldridge, M. T2 - AI Magazine DA - 2006/// PY - 2006/// VL - 27 IS - 1 SP - 103-107 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33645745843&partnerID=MN8TOARS ER - TY - CHAP TI - OWL-P: A Methodology for Business Process Development AU - Desai, Nirmit AU - Mallya, Ashok U. AU - Chopra, Amit K. AU - Singh, Munindar P. T2 - Agent-Oriented Information Systems III. AOIS 2005 A2 - Kolp, M. A2 - Bresciani, P. A2 - Henderson-Sellers, B. A2 - Winikoff, M. T3 - Lecture Notes in Computer Science AB - Business process modelling and enactment are notoriously complex, especially in open settings where the business partners are autonomous, requirements must be continually finessed, and exceptions frequently arise because of real-world or organizational problems. Traditional approaches, which attempt to capture processes as monolithic flows, have proved inadequate in addressing these challenges. We propose an agent-based approach for business process modelling and enactment which is centred around the concepts of commitment-based agent interaction protocols and policies. A (business) protocol is a modular, public specification of an interaction among different roles. Such protocols, when integrated with the internal business policies of the participants, yield concrete business processes. We show how this reusable, refinable and evolvable abstraction simplifies business process design and development. PY - 2006/// DO - 10.1007/11916291_6 VL - 3529 LNAI SP - 79–94 PB - Springer SN - 9783540482918 9783540482925 SV - 3529 UR - http://dx.doi.org/10.1007/11916291_6 ER - TY - CHAP TI - Introducing Preferences into Commitment Protocols AU - Mallya, Ashok U. AU - Singh, Munindar P. T2 - Agent Communication II A2 - Dignum, Frank P.M. A2 - van Eijk, Roger M. A2 - Flores, Roberto T3 - Lecture Notes in Computer Science AB - Commitment protocols enable flexibility in agent interactions by utilizing the semantics of commitments to develop succinct declarative specifications for protocols that allow a large number of executions. As a consequence, commitment protocols enable agents to accommodate varying local policies and respond to exceptions. A consequent weakness of such protocols is that commitment protocols thus fail to distinguish between possible executions that are normal and those that may be allowed but are not ideal. This paper develops an approach for specifying preferences among executions that are allowed by a protocol. It captures sets of executions via a simple language and gives them a denotational characterization based on branching-time models. It shows how to incorporate the specifications into rulesets, thereby giving the specifications a natural operational characterization. The rulesets embed into a recent practical framework for protocols called OWL-P. The paper shows that the operational and denotational characterizations coincide. PY - 2006/// DO - 10.1007/978-3-540-68143-4_10 SP - 136–149 PB - Springer SN - 9783540681427 9783540681434 SV - 3859 UR - http://dx.doi.org/10.1007/978-3-540-68143-4_10 ER - TY - CONF TI - Multiagent policy architecture for virtual business organizations AU - Udupi, Y.B. AU - Singh, M.P. AB - A virtual organization (VO) is a dynamic collection of entities (individuals, enterprises, and information resources) collaborating on some computational activity. VOs are an emerging means to model, enact, and manage large-scale service computations. VOs consist of autonomous, heterogeneous members, often exhibiting complex behaviors. Thus VOs are a natural match for policy-based approaches. Traditional policy-based frameworks emphasize reactive behaviors, wherein an external request causes a policy engine to compute a response. However, business service settings require richer policies and call for proactive behaviors. A business not only must respond to explicit requests, but also monitor its environment, collate events, and potentially act in anticipation of events in order to ensure that its policies are satisfied. Autonomous, heterogeneous, proactive entities are best modeled as agents and, therefore, VOs are best understood as multiagent systems. Our main contributions are (1) a proactive multiagent policy-based architecture, (2) a hierarchical model of policy monitoring, compliance checking, and enforcement for VOs, and (3) a formalization of VOs. We evaluate our approach using a real business service scenario C2 - 2006/// C3 - Proceedings - 2006 IEEE International Conference on Services Computing, SCC 2006 DA - 2006/// DO - 10.1109/SCC.2006.75 SP - 44-51 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35148823347&partnerID=MN8TOARS ER - TY - BOOK TI - Introducing preferences into commitment protocols AU - Mallya, A.U. AU - Singh, M.P. DA - 2006/// PY - 2006/// VL - 3859 LNAI SE - 136-149 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77956013565&partnerID=MN8TOARS ER - TY - JOUR TI - Interaction-oriented programming: Concepts, theories, and results on commitment protocols T2 - Lecture Notes in Computer Science AB - Unlike traditional information systems, modern systems are _open_, consisting of autonomous, heterogeneous parties interacting dynamically. Yet prevalent software techniques make few accommodations for this fundamental change. Multiagent systems are conceptualized for open environments. They give prominence to flexible reasoning and arms-length interactions captured via communications. On the backdrop of multiagent systems, Interaction-Oriented Programming is the idea of programming with interactions as first-class entities instead of, e.g., objects. Protocols are to interactions as classes are to objects: because of their key nature, protocols have obtained a lot of research attention. Modeling protocols suitably for open environments meant modeling their content, not just the surface communications. In a number of important cases, such as business processes and organizations, the content is best understood using the notion of commitments of an agent to another agent in an appropriate context. Our theory of protocols supports flexible enactment of protocols, a treatment of refinement and composition of protocols, and their relationship with organizations and contracts, thus reducing the gap between agents and conventional computer science. This talk will review the key concepts, theories, and results on commitment protocols, and some important challenges that remain.. DA - 2006/// PY - 2006/// DO - 10.1007/11941439_3 UR - https://publons.com/publon/21294469/ ER - TY - CONF TI - Contract enactment in virtual organizations: A commitment-based approach AU - Udupi, Y.B. AU - Singh, M.P. C2 - 2006/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2006/// VL - 1 SP - 722-727 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33750708550&partnerID=MN8TOARS ER - TY - CONF TI - An overview of business process adaptations via protocols AU - Desai, N. AU - Chopra, A.K. AU - Singh, M.P. AB - Business process management in open environments poses special challenges. In particular, such environments are dynamic, thereby requiring frequent changes in business processes. Current business process modeling approaches handle such changes in an ad hoc manner, and lack a principled means of determining what needs to be changed and where.This paper provides an overview of process adaptability through a novel application of business protocols, especially of protocol composition, introduced in our previous work. Through a real business scenario of auto-insurance claim processing, this paper briefly describes how a wide range of adaptations can be handled naturally and systematically via protocol composition. The illustrated adaptations have been evaluated via a prototype. C2 - 2006/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2006/// DO - 10.1145/1160633.1160879 VL - 2006 SP - 1326-1328 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-34247252465&partnerID=MN8TOARS ER - TY - CONF TI - Contextualizing commitment protocols AU - Chopra, A.K. AU - Singh, M.P. AB - Commitment protocols are modularized specifications of interactions understood in terms of commitments. Purchase is a classic example of a protocol. Although a typical protocol would capture the essence of the interactions desired, in practice, it should be adapted depending on the circumstances or context and the agents' preferences based on that context. For example, when applying purchase in different contexts, it may help to allow sending reminders for payments or returning goods to obtain a refund. We contextualize a protocol by adapting it via different transformations.Our contributions are the following: (1) a protocol is transformed by composing its specification with a transformer specification; (2) contextualization is characterized operationally by relating the original and transformed protocols; and (3) contextualization is related to protocol compliance. C2 - 2006/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2006/// DO - 10.1145/1160633.1160884 VL - 2006 SP - 1345-1352 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-34247185859&partnerID=MN8TOARS ER - TY - CONF TI - Business process adaptations via protocols AU - Desai, N. AU - Chopra, A.K. AU - Singh, M.P. AB - Business process management in service-oriented computing (SOC) environments poses special challenges. In particular, SOC environments are dynamic, thereby requiring frequent changes in business processes. Current business process modeling approaches handle such changes in an ad hoc manner, and lack a principled means of determining what needs to be changed and where. This paper addresses process adaptability through a novel application of business protocols, especially of protocol composition, introduced in our previous work. Through a real business scenario of auto-insurance claim processing, this paper demonstrates how a wide range of adaptations can be handled naturally and systematically via protocol composition. The illustrated adaptations have been evaluated via a prototype C2 - 2006/// C3 - Proceedings - 2006 IEEE International Conference on Services Computing, SCC 2006 DA - 2006/// DO - 10.1109/SCC.2006.30 SP - 103-110 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35148864924&partnerID=MN8TOARS ER - TY - JOUR TI - All-Integer Dual Simplex for Binate Cover Problems (Draft) AU - Stallmann, Matthias DA - 2006/// PY - 2006/// UR - https://people.engr.ncsu.edu/mfms/Publications/int-dual.pdf ER - TY - JOUR TI - The character of mechanical law AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - The axioms on forces given in the previous chapter characterize the nature of inertial forces and the structure of systems of forces in isolation, but otherwise say nothing about how forces arise in the evolution of mechanical systems. Although the special laws of forces depend on the specific class of material involved, Noll states three additional general axioms concerning dynamogenesis that bear on the general character of mechanical forces. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.009 SP - 173-222 ER - TY - JOUR TI - Uncertainty AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - The preceding development of mental mechanics does not require determinism of mechanical systems. It instead requires only that motion satisfy mechanical relationships independent of determinism requirements. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.016 SP - 346-370 ER - TY - JOUR TI - System of Notation AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.022 SP - 425-428 ER - TY - JOUR TI - Reflections AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Space and Time! now I see it is true, what I guess'd at,What I guess'd when I loafed on the grass,What I guess'd while I lay alone on my bed,And again as I walk'd alone the beach under the paling stars of the morning.(Walt Whitman, Song of Myself) DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.021 SP - 407-424 ER - TY - JOUR TI - Reductionism AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.018 SP - 379-391 ER - TY - JOUR TI - Why mechanics now? AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Mechanics has enjoyed some four centuries of sustained development without producing results in psychology or economics. The mental sciences have enjoyed a couple centuries of sustained development without requiring mechanical intervention. To use the standard economic argument, if there was a connection worth pursuing, would not one have already been made? DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.005 SP - 47-68 ER - TY - JOUR TI - What is mechanics? AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - The common picture of mechanics embodies many unfortunate misconceptions about the nature, scope, and structure of mechanics, with many people having the idea that mechanics consists of applying to physical systems the three axioms stated by Newton. Applying mechanics to psychology and economics requires a firmer theoretical basis than that provided by popular misconceptions. To proceed, we thus must confront and set aside mechanical misconceptions, lest the misconceptions prevent proper appreciation of the contribution mechanics makes to understanding the world. Accordingly, the present chapter examines the nature of mechanics at a high level, reconsidering the content and form of mechanical theories in light of the history of mechanical concepts and mathematical formalisms. This examination highlights the common misconceptions and how they divert one from the proper understanding needed for the following development. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.006 SP - 71-87 ER - TY - JOUR TI - Reasoning AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.013 SP - 276-294 ER - TY - JOUR TI - Rationality AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - The preceding treatment of reasoning indicates how we can interpret psychological rationality in terms of mechanical processes. Let us now look at the ways in which mechanical concepts enter into characterizing forms of economic rationality. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.014 SP - 295-325 ER - TY - JOUR TI - Preface AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - This book uses concepts from mechanics to help the reader understand and formalize theories of mind, with special concentration on understanding and formalizing notions of rationality and bounded rationality that underlie many parts of psychology and economics. The book provides evidence that mechanical notions including force and inertia play roles as important in understanding psychology and economics as they play in physics. Using this evidence, it attempts to clarify the nature of the concepts of motivation, effort, and habit in psychology and the ideas of rigidity, adaptation, and bounded rationality in economics. The investigation takes a mathematical approach. The mechanical interpretations developed to characterize mechanical reasoning and rationality also speak to other questions about mind, notably questions of dualism and materialism. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.001 SP - xi-xviii ER - TY - JOUR TI - Materialism AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Science and natural philosophy largely abandoned ideas about parallel worlds of mind and matter in the years following Descartes and his dualistic philosophy. By the twentieth century, most of science exhibited an unhesitant materialistic metaphysics. The present investigation occasions an opportunity to reexamine ideas about materialism. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.017 SP - 373-378 ER - TY - JOUR TI - Finitism AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Many should find familiar the notions of materialism and reductionism, and should recognize that these doctrines enjoy large numbers of adherents. Fewer need have heard of finitism because of its presently smaller number of adherents, though many should recognize some of its aspects in current scientific and technological trends. This chapter tries to collect and address some of these issues as they relate to a broadened mechanics. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.020 SP - 399-404 ER - TY - JOUR TI - Effectiveness AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - As was noted earlier, the traditional conception of what we call mechanical computation or computation by machine relies on a purely kinematical conception of mechanics. It entirely omits any notion of force and focuses attention only on abstract states and motion between them. In this it follows a trend in mechanical formalism that moved away from considering forces and spatial motions to considering mainly Hamiltonian motion through abstract spaces, with no mention of either the central notion of force or the key notion of mass (cf. Hermann 1990, Sussman & Wisdom 2001). DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.019 SP - 392-398 ER - TY - JOUR TI - Mind and body AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.011 SP - 241-250 ER - TY - JOUR TI - Mental varieties AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Understanding psychology and economics in mechanical terms requires looking at specific concepts of psychology and economics from the mechanical point of view. If we look to the literature, however, we find that the cognitive sciences study a wide range of possible or hypothesized psychological organizations as explanations of human thought. For example, the ideally rational agents of economics have one kind of mind, a kind very different from almost all known human minds. But even among humans, individual minds have very different characters, exhibiting different levels of intelligence at different tasks, different temperaments, different degrees of adaptability, and so on. The well-known Myers–Briggs test (Myers & Myers 1980), to give another example, sorts minds into sixteen well-populated classes. These classes correspond to recognizable and common types of personal character, types that give some insight and enable reasonable, though not perfect, predictions of individual behavior. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.010 SP - 225-240 ER - TY - JOUR TI - Learning AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - While reasoning can produce temporary changes of location, learning produces persistent changes of mass or configuration. When someone temporarily responds to instruction or threat but then reverts to an old behavior when the teacher or threat departs, we say that person did not learn anything. Mechanically, we would identify such response with an elastic material that rebounds on relief from compression, but such elastic behavior does not produce the permanent changes we associate with thought. True learning, involving change of mass or deformation of spatial configuration, constitutes plastic changes in the character of the material, including dynamogenetic changes that affect material response. In this chapter, let us consider learning involving changes of habits represented in the mass and changes of configuration represented in position. We distinguish types of reasoning and learning both by the types of changes involved and by the types of forces producing the change. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.015 SP - 326-345 ER - TY - JOUR TI - Kinematics AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.007 SP - 88-134 ER - TY - JOUR TI - Outline of the book AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.002 SP - xix-xxii ER - TY - JOUR TI - Mechanical intelligence AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.003 SP - 3-9 ER - TY - BOOK TI - Extending Mechanics to Minds AU - Doyle, Jon AB - This book deploys the mathematical axioms of modern rational mechanics to understand minds as mechanical systems that exhibit actual, not metaphorical, forces, inertia, and motion. Using precise mental models developed in artificial intelligence the author analyzes motivation, attention, reasoning, learning, and communication in mechanical terms. These analyses provide psychology and economics with new characterizations of bounded rationality; provide mechanics with new types of materials exhibiting the constitutive kinematic and dynamic properties characteristic of different kinds of minds; and provide philosophy with a rigorous theory of hybrid systems combining discrete and continuous mechanical quantities. The resulting mechanical reintegration of the physical sciences that characterize human bodies and the mental sciences that characterize human minds opens traditional philosophical and modern computational questions to new paths of technical analysis. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952 VL - 9780521861977 PB - Cambridge University Press (CUP) SE - 1-453 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84930704080&partnerID=MN8TOARS ER - TY - JOUR TI - Dynamics AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.008 SP - 135-172 ER - TY - JOUR TI - Bibliography AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.023 SP - 429-442 ER - TY - JOUR TI - Attitudes, outlook, and memory AU - Doyle, Jon T2 - Extending Mechanics to Minds AB - Many theories of psychological organization posit both long-term and short-term memories. The long-term memories serve as persistent (but not necessarily perfect) repositories of knowledge, skills, and other elements of human capital; the short-term memories serve to store the fleeting facts of present experience, which then either are discarded or incorporated into long-term memory. DA - 2006/// PY - 2006/// DO - 10.1017/cbo9780511546952.012 SP - 251-275 ER - TY - JOUR TI - Traffic-partitioning approaches to grooming ring access networks AU - Srinivasarao, K. AU - Dutta, Rudra T2 - Journal of Optical Networking AB - Feature Isue on Optical Access Networks (OAN) As networks have evolved in sophistication, the twin concerns of quality-of-service (QoS) and efficiency have propagated down the hierarchical levels of networking and are now considered important in access networks as well. Motivated by these two concerns, researchers have recognized traffic grooming as an increasingly important area in optical networking in recent years. Very recently, a min-max approach to network cost optimization has emerged as a new focus area. In this approach, the maximum electronic-switching capability at any network node is sought to be minimized. In this paper, we propose heuristics for traffic grooming with this objective in ring networks, which are of practical importance, especially in access network architectures. We advance two approaches, both based on the concept of partitioning the traffic matrix, but in different ways. The approaches are of complementary strength, being useful for different traffic patterns. We present numerical results validating the performance of the algorithms. DA - 2006/// PY - 2006/// DO - 10.1364/JON.4.000602 VL - 4 IS - 9 SP - 602–614 ER - TY - CONF TI - Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials AU - Kaltofen, Erich AU - Yang, Zhengfeng AU - Zhi, Lihong T2 - the 2006 international symposium AB - We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials have a greatest common divisor (GCD) of at least a given degree k. In addition, we restrict the deformed coefficients by a given set of linear constraints, thus introducing the linearly constrained approximate GCD problem. We present an algorithm based on a version of the structured total least norm (STLN) method and demonstrate on a diverse set of benchmark polynomials that the algorithm in practice computes globally minimal approximations. As an application of the linearly constrained approximate GCD problem we present an STLN-based method that computes a real or complex polynomial the nearest real or complex polynomial that has a root of multiplicity at least k. We demonstrate that the algorithm in practice computes on the benchmark polynomials given in the literature the known globally optimal nearest singular polynomials. Our algorithms can handle, via randomized preconditioning, the difficult case when the nearest solution to a list of real input polynomials actually has non-real complex coefficients. C2 - 2006/// C3 - Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06 DA - 2006/// DO - 10.1145/1145768.1145799 PB - ACM Press SN - 1595932763 UR - http://dx.doi.org/10.1145/1145768.1145799 DB - Crossref ER - TY - CONF TI - Expertiza: Reusable learning objects and active learning for distance education AU - Gehringer, Edward F. AU - Ehresman, Luke M. AU - Wagle, Prasad AU - Conger, Susan G. T2 - UNC Teaching and Learning with Technology conference C2 - 2006/// C3 - Proceedings of the UNC Teaching and Learning with Technology Conference CY - Raleigh, NC DA - 2006/// PY - 2006/3/15/ ER - TY - CONF TI - Next-generation DPP with Sangam and Facetop AU - Navoraphan, Kanyamas AU - Gehringer, Edward F. AU - Culp, James AU - Gyllstrom, Karl AU - Stotts, David T2 - the 2006 OOPSLA workshop AB - This paper describes a state-of-the-art environment for distributed Extreme Programming that results from combining the Sangam editor, developed at NCSU and the Facetop user interface, developed at UNC-Chapel Hill. Sangam facilitates distributed Extreme Programming by sending events back and forth between a driver and a navigator working under the Eclipse development environment. Concurrently, Facetop allows the distributed pair to recapture some of the face-to-face communications that are lost in no-video distributed pairing sessions. The integrated tool is a quantum leap forward for distributed Extreme Programming as well as distributed agile development. C2 - 2006/// C3 - Proceedings of the 2006 OOPSLA workshop on eclipse technology eXchange - eclipse '06 DA - 2006/// DO - 10.1145/1188835.1188837 PB - ACM Press SN - 1595936211 UR - http://dx.doi.org/10.1145/1188835.1188837 DB - Crossref ER - TY - CONF TI - Teaching Web Services with Water AU - Kendall, Matthew D. AU - Gehringer, Edward F. T2 - Frontiers in Education 36th Annual Conference AB - Web services have become important enough that all software professionals should know something about them. However, it can be challenging to fit Web services into a crowded curriculum. Common approaches require teaching a host of standards and APIs that all but obscure the simplicity of the concepts. The object-oriented Water language offers a way around these difficulties. Originally designed for rapidly prototyping XML-based Web services, it provides a very concise encoding of Web-services functionality. This makes it ideal for teaching, as students can learn to write real Web-services programs in two or three weeks. Moreover, Water helps students learn several patterns that are important to understanding object-oriented design but lacking - or not implemented well - in common o-o languages such as Java and C++. Among these are delegation and multiple inheritance. C2 - 2006/10// C3 - Proceedings. Frontiers in Education. 36th Annual Conference DA - 2006/10// DO - 10.1109/fie.2006.322493 PB - IEEE SN - 1424402565 UR - http://dx.doi.org/10.1109/fie.2006.322493 DB - Crossref ER - TY - CONF TI - Work in Progress: Reusable Learning Objects Through Peer Review: The Expertiza Approach AU - Gehringer, Edward AU - Ehresman, Luke AU - Conger, Susan AU - Wagle, Prasad T2 - Proceedings. Frontiers in Education. 36th Annual Conference AB - The Expertiza platform is a divide-and-conquer approach to producing reusable learning objects through active-learning exercises. Students select from a list of tasks to be performed, with several students selecting each task. Then they prepare their work and submit it to an electronic peer-review system. The work is then reviewed by other students, who offer comments to help the submitters improve their work. The best submissions for each task are then selected for use in later courses. Expertiza gets students working together to improve others' learning experiences. It helps them learn, by making them think through the lecture material and apply it to a real-world situation, just as they might do in an on-the-job situation. These learning objects can be improved iteratively; for example, the next year's class can be presented with the examples developed by students the previous year, and asked to identify shortcomings and develop improved examples. This paper presents numerous examples of how the platform can be used to allow each cohort of students to "stand on the shoulders" of their predecessors, building ever-more-effective resources to help themselves learn C2 - 2006/// C3 - Proceedings. Frontiers in Education. 36th Annual Conference DA - 2006/// DO - 10.1109/fie.2006.322542 PB - IEEE SN - 1424402565 UR - http://dx.doi.org/10.1109/fie.2006.322542 DB - Crossref ER - TY - CHAP TI - A Cache-Pinning Strategy for Improving Generational Garbage Collection AU - Reddy, Vimal K. AU - Sawyer, Richard K. AU - Gehringer, Edward F. T2 - High Performance Computing - HiPC 2006 AB - In generational garbage collection, the youngest generation of the heap is frequently traversed during garbage collection. Due to randomness of the traversal, memory access patterns are unpredictable and cache performance becomes crucial to garbage-collection efficiency. Our proposal to improve cache performance of garbage collection is to “pin” the youngest generation (sometimes called the nursery) in the cache, converting all nursery accesses to cache hits. To make the nursery fit inside the cache, we reduce its size, and, to prevent its eviction from the cache, we configure the operating system’s page-fault handler to disallow any page allocation that would cause cache conflicts to the nursery. We evaluated our scheme on a copying-style generational garbage collector using IBM VisualAge Smalltalk and Jikes research virtual machine. Our simulation results indicate that the increase in frequency of garbage collection due to a smaller nursery is overshadowed by gains of converting all nursery accesses to cache hits. PY - 2006/// DO - 10.1007/11945918_15 SP - 98-110 OP - PB - Springer Berlin Heidelberg SN - 9783540680390 9783540680406 UR - http://dx.doi.org/10.1007/11945918_15 DB - Crossref ER - TY - BOOK TI - Information and communications security 8th international conference, ICICS 2006, Raleigh, NC, USA, December 4-7, 2006 : proceedings DA - 2006/// PY - 2006/// PB - Berlin ;|aNew York: Springer ER - TY - CONF TI - Dynamic wavelength sharing policies for absolute QoS in OBS networks AU - Yang, L. AU - Rouskas, G. N. AB - We consider the problem of providing absolute QoS guarantees to multiple classes of users of an OBS network in terms of the end-to-end burst loss. We employ Markov decision process (MDP) theory to develop wavelength sharing policies that maximize throughput while meeting the QoS guarantees. The randomized threshold policies we obtain are simple to implement and operate, and make effective use of statistical multiplexing. C2 - 2006/// C3 - Globecom 2006 - 2006 ieee global telecommunications conference DA - 2006/// DO - 10.1109/glocom.2006.386 ER - TY - CONF TI - The relationship between high school mathematics and career choices among high achieving young women AU - Berenson, S. B. AU - Michael, J. J. AU - Vouk, M. C2 - 2006/// C3 - Pme 30: proceedings of the 30th conference of the international group for the psychology of mathematics education, vol 1, DA - 2006/// SP - 220-220 ER - TY - BOOK TI - Tabulation of FARAD Comparative and Veterinary Pharmacokinetic Data AU - Craigmill, A. L. AU - Riviere, J. E. AU - Webb, A. L. DA - 2006/// PY - 2006/// PB - Ames, IA: Blackwell Publishing SN - 0813813492 ER - TY - JOUR TI - Spin dimer analysis of the magnetic structures of Ba3Cr2O8, Ba3Mn2O8, Na4FeO4, and Ba2CoO4 with a three-dimensional network of isolated MO4 (M = Cr, Mn, Fe, Co) tetrahedra AU - Koo, Hyun-Joo AU - Lee, Kwang-Soon AU - Whangbo, Myung-Hwan T2 - INORGANIC CHEMISTRY AB - The spin exchange interactions of the magnetic oxides Ba3Cr2O8, Ba3Mn2O8, Na4FeO4, and Ba2CoO4 with a three-dimensional network of isolated MO4 (M = Cr, Mn, Fe, Co) tetrahedra were examined by performing spin dimer analysis on the basis of tight-binding electronic structure calculations. Although the shortest O...O distances between adjacent MO4 tetrahedra are longer than the van der Waals distance, our analysis shows that the super-superexchange interactions between adjacent MO4 tetrahedra are substantial and determine the magnetic structures of these oxides. In agreement with experiment, our analysis predicts a weakly interacting isolated AFM dimer model for both Ba3Cr2O8 and Ba3Mn2O8, the (0.0, 0.5, 0.0) magnetic superstructure for Na4FeO4, the (0.5, 0.0, 0.5) magnetic superstructure for Ba2CoO4, and the presence of magnetic frustration in Ba2CoO4. The comparison of the intra- and interdimer spin exchange interactions of Ba3Cr2O8 and Ba3Mn2O8 indicates that orbital ordering should be present in Ba3Cr2O8. DA - 2006/12/25/ PY - 2006/12/25/ DO - 10.1021/ic061773c VL - 45 IS - 26 SP - 10743-10749 SN - 1520-510X ER - TY - JOUR TI - Piagetian adaptation meets image schemas: The Jean system AU - Chang, Y. H. AU - Cohen, P. R. AU - Morrison, C. T. AU - St Amant, R. AU - Beal, C. T2 - Lecture Notes in Computer Science AB - Jean is a model of early cognitive development based loosely on Piaget’s theory of sensori-motor and pre-operational thought [1]. Like an infant, Jean repeatedly executes schemas, gradually extending its schemas to accommodate new experiences. Jean’s environment is a simulated “playpen” in which Jean and other objects move about and interact. Jean’s cognitive development depends on several integrated functions: a simple perceptual system, an action-selection system, a motivational system, a long-term memory, and learning methods. This paper provides an overview of Jean’s architecture and schemas, and it focuses on how Jean learns schemas and transfers them to new situations. DA - 2006/// PY - 2006/// DO - 10.1007/11840541_31 VL - 4095 SP - 369-380 ER - TY - JOUR TI - Solving dynamic geometric constraints involving inequalities AU - Hong, H. AU - Li, L. Y. AU - Liang, T. L. AU - Wang, D. M. T2 - Lecture Notes in Computer Science. Lecture Notes in Artificial Intelligence DA - 2006/// PY - 2006/// VL - 4120 SP - 181-195 ER - TY - JOUR TI - Adaptive ad hoc self-organizing scheduling for quasi-periodic sensor network lifetime AU - Visweswara, Sharat C. AU - Dutta, Rudra AU - Sichitiu, Mihail L. T2 - COMPUTER COMMUNICATIONS AB - Wireless sensor networks are poised to revolutionize our abilities in sensing and controlling our environment. Power conservation is a primary research concern for these networks. Often, the single most important savings can be obtained by switching off the wireless receiver when not needed. In this paper, we describe an algorithm which allows the nodes to learn the behavior of each other by only observing the transmission behaviors, and from this derive the schedule without external help. Our approach is robust to statistical variations in the nodal transmission periods. We draw important conclusions on the effect of quasi-periodicity on the scalability of the solution. We provide results of numerical simulations that show the effectiveness of our approach. DA - 2006/11/8/ PY - 2006/11/8/ DO - 10.1016/j.comcom.2006.01.037 VL - 29 IS - 17 SP - 3366-3384 SN - 1873-703X KW - sensor networks KW - lifetime KW - optimization KW - scheduling KW - lifetime extension KW - power conservation KW - power aware sensor networks ER - TY - JOUR TI - A semantics based approach to privacy languages AU - Li, N. AU - Yu, T. AU - Anton, A. T2 - Computer Systems Science and Engineering DA - 2006/// PY - 2006/// VL - 21 IS - 5 SP - 339-352 ER - TY - BOOK TI - Google's PageRank and beyond: The science of search engine rankings AU - Langville, A. N. AU - Meyer, C. D. AB - Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of web page rankings, Google's PageRank and Beyond supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. Many illustrative examples and entertaining asides MATLAB code Accessible and informal style Complete and self-contained section for mathematics review CN - TK5101.884 .L36 2006 DA - 2006/// PY - 2006/// DO - 10.1515/9781400830329 PB - Princeton, NJ: Princeton University Press SN - 0691122024 ER - TY - JOUR TI - FAST: Frequency-Aware Static Timing Analysis AU - Seth, K. AU - Anantaraman, A. AU - Mueller, F. AU - Rotenberg, E. T2 - ACM Transactions on Programming Languages and Systems DA - 2006/// PY - 2006/// VL - 5 IS - 1 SP - 200-224 ER - TY - JOUR TI - Updating Markov chains with an eye on Google's PageRank AU - Langville, AN AU - Meyer, CD T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS AB - An iterative algorithm based on aggregation/disaggregation principles is presented for updating the stationary distribution of a finite homogeneous irreducible Markov chain. The focus is on large-scale problems of the kind that are characterized by Google's PageRank application, but the algorithm is shown to work well in general contexts. The algorithm is flexible in that it allows for changes to the transition probabilities as well as for the creation or deletion of states. In addition to establishing the rate of convergence, it is proven that the algorithm is globally convergent. Results of numerical experiments are presented. DA - 2006/// PY - 2006/// DO - 10.1137/040619028 VL - 27 IS - 4 SP - 968-987 SN - 1095-7162 KW - Markov chains KW - updating KW - stationary vector KW - PageRank KW - stochastic complementation KW - aggregation/disaggregation KW - Google ER - TY - JOUR TI - SNAP: Combine and Map modules for multilocus population genetic analysis AU - Aylor, D. L. AU - Price, E. W. AU - Carbone, I. T2 - Bioinformatics DA - 2006/// PY - 2006/// DO - 10.1093/bioinformatics/bt/136 VL - 22 IS - 11 SP - 1399-1401 ER - TY - JOUR TI - Predicting Shine-Dalgarno sequence locations exposes genome annotation errors AU - Starmer, J. AU - Stomp, A. AU - Vouk, M. AU - Bitzer, D. T2 - PLOS COMPUTATIONAL BIOLOGY AB - In prokaryotes, Shine-Dalgarno (SD) sequences, nucleotides upstream from start codons on messenger RNAs (mRNAs) that are complementary to ribosomal RNA (rRNA), facilitate the initiation of protein synthesis. The location of SD sequences relative to start codons and the stability of the hybridization between the mRNA and the rRNA correlate with the rate of synthesis. Thus, accurate characterization of SD sequences enhances our understanding of how an organism's transcriptome relates to its cellular proteome. We implemented the Individual Nearest Neighbor Hydrogen Bond model for oligo-oligo hybridization and created a new metric, relative spacing (RS), to identify both the location and the hybridization potential of SD sequences by simulating the binding between mRNAs and single-stranded 16S rRNA 3' tails. In 18 prokaryote genomes, we identified 2,420 genes out of 58,550 where the strongest binding in the translation initiation region included the start codon, deviating from the expected location for the SD sequence of five to ten bases upstream. We designated these as RS+1 genes. Additional analysis uncovered an unusual bias of the start codon in that the majority of the RS+1 genes used GUG, not AUG. Furthermore, of the 624 RS+1 genes whose SD sequence was associated with a free energy release of less than -8.4 kcal/mol (strong RS+1 genes), 384 were within 12 nucleotides upstream of in-frame initiation codons. The most likely explanation for the unexpected location of the SD sequence for these 384 genes is mis-annotation of the start codon. In this way, the new RS metric provides an improved method for gene sequence annotation. The remaining strong RS+1 genes appear to have their SD sequences in an unexpected location that includes the start codon. Thus, our RS metric provides a new way to explore the role of rRNA-mRNA nucleotide hybridization in translation initiation. DA - 2006/5// PY - 2006/5// DO - 10.1371/journal.pcbi.0020057 VL - 2 IS - 5 SP - 454-466 SN - 1553-7358 ER - TY - JOUR TI - Motivations and measurements in an agile case study AU - Layman, Lucas AU - Williams, Laurie AU - Cunningham, Lynn T2 - JOURNAL OF SYSTEMS ARCHITECTURE AB - With the recent emergence of agile software development technologies, the software community is awaiting sound, empirical investigation of the impacts of agile practices in a live setting. One means of conducting such research is through industrial case studies. There are a number of influencing factors that contribute to the success of such a case study. In this paper, we describe a case study performed at Sabre Airline SolutionsTM evaluating the effects of adopting Extreme Programming (XP) practices with a team that had characteristically plan-driven risk factors. We compare the team’s business-related results (productivity and quality) to two published sources of industry averages. Our case study found that the Sabre team yielded above-average post-release quality and average to above-average productivity. We discuss our experience in conducting this case study, including specifics of how data was collected, the rationale behind our process of data collection, and what obstacles were encountered during the case study. We identify four factors that potentially impact the outcome of industrial case studies: availability of data, tool support, cooperative personnel and project status. Recognizing and planning for these factors is essential to conducting industrial case studies. DA - 2006/11// PY - 2006/11// DO - 10.1016/j.sysarc.2006.06.009 VL - 52 IS - 11 SP - 654-667 SN - 1873-6165 KW - software engineering KW - case study KW - agile software development KW - extreme programming ER - TY - JOUR TI - Locally invertible multivariate polynomial matrices AU - Lobo, R. G. AU - Bitzer, D. L. AU - Vouk, M. A. T2 - Lecture Notes in Computer Science DA - 2006/// PY - 2006/// IS - 3969 SP - 427-441 ER - TY - CHAP TI - Integrating IDS alert correlation and OS-level dependency tracking AU - Zhai, Y. AU - Ning, P. AU - Xu, J. T2 - Intelligence and Security Informatics: IEEE International Conference on Intelligence and Security Informatics, ISI 2006, San Diego, CA, USA, May 23-24, 2006. Proceedings (Lecture notes in computer science; 3975) AB - Intrusion alert correlation techniques correlate alerts into meaningful groups or attack scenarios for the ease to understand by human analysts. However, the performance of correlation is undermined by the imperfectness of intrusion detection techniques. Falsely correlated alerts can be misleading to analysis. This paper presents a practical technique to improve alert correlation by integrating alert correlation techniques with OS-level object dependency tracking. With the support of more detailed and precise information from OS-level event logs, higher accuracy in alert correlation can be achieved. The paper also discusses the application of such integration in improving the accuracy of hypotheses about possibly missed attacks while reducing the complexity of the hypothesizing process. A series of experiments are performed to evaluate the effectiveness of the methods, and the results demonstrate significant improvements on correlation results with the proposed techniques. PY - 2006/// DO - 10.1007/11760146_24 VL - 3975 SP - 272-284 PB - Berlin; New York: Springer ER - TY - JOUR TI - Improving WCET by applying worst-case path optimizations AU - Zhao, Wankang AU - Kreahling, William AU - Whalley, David AU - Healy, Christopher AU - Mueller, Frank T2 - REAL-TIME SYSTEMS AB - It is advantageous to perform compiler optimizations that attempt to lower the worst-case execution time (WCET) of an embedded application since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compiler writers in recent years have used profile information to detect the frequently executed paths in a program and there has been considerable effort to develop compiler optimizations to improve these paths in order to reduce the average-case execution time (ACET). In this paper, we describe an approach to reduce the WCET by adapting and applying optimizations designed for frequent paths to the worst-case (WC) paths in an application. Instead of profiling to find the frequent paths, our WCET path optimization uses feedback from a timing analyzer to detect the WC paths in a function. Since these path-based optimizations may increase code size, the subsequent effects on the WCET due to these optimizations are measured to ensure that the worst-case path optimizations actually improve the WCET before committing to a code size increase. We evaluate these WC path optimizations and present results showing the decrease in WCET versus the increase in code size. DA - 2006/10// PY - 2006/10// DO - 10.1007/s11241-006-8643-4 VL - 34 IS - 2 SP - 129-152 SN - 1573-1383 KW - WCET KW - path-based optimizations KW - embedded systems ER - TY - JOUR TI - High-level buffering for hiding periodic output cost in scientific simulations AU - Ma, XS AU - Lee, J AU - Winslett, M T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - Scientific applications often need to write out large arrays and associated metadata periodically for visualization or restart purposes. In this paper, we present active buffering, a high-level transparent buffering scheme for collective I/O, in which processors actively organize their idle memory into a hierarchy of buffers for periodic output data. It utilizes idle memory on the processors, yet makes no assumption regarding runtime memory availability. Active buffering can perform background I/O while the computation is going on, is extensible to remote I/O for more efficient data migration, and can be implemented in a portable style in today's parallel I/O libraries. It can also mask performance problems of scientific data formats used by many scientists. Performance experiments with both synthetic benchmarks and real simulation codes on multiple platforms show that active buffering can greatly reduce the visible I/O cost from the application's point of view. DA - 2006/3// PY - 2006/3// DO - 10.1109/TPDS.2006.36 VL - 17 IS - 3 SP - 193-204 SN - 1558-2183 KW - parallel I/O library design KW - performance optimization KW - experimentation ER - TY - CHAP TI - Characterization of the burst aggregation process in optical burst switching AU - Mountrouidou, X. AU - Perros, H. G. T2 - Networking 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems: 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006. Proceedings (Lecture notes in computer science; 3976) AB - We describe an analytic approach for the calculation of the departure process from a burst ggregation algorithm that uses both a timer and maximum/minimum burst size. The arrival process of packets is assumed to be Poisson or bursty modelled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy. PY - 2006/// DO - 10.1007/11753810_63 VL - 3976 SP - 752-764 PB - Berlin; New York: Springer ER - TY - JOUR TI - Answering queries using materialized views with minimum size AU - Chirkova, Rada AU - Li, Chen AU - Li, Jia T2 - VLDB JOURNAL AB - In this paper, we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amount of space, in bytes, required to store the viewset is minimum on the given database. (We also handle problem instances where the input has a set of database instances, as described by an oracle that returns the sizes of view relations for given view definitions.) This problem is important for applications such as distributed databases, data warehousing, and data integration. We explore the decidability and complexity of the problem for workloads of conjunctive queries. We show that results differ significantly depending on whether the workload queries have self-joins. Further, for queries without self-joins we describe a very compact search space of views, which contains all views in at least one optimal viewset. We present techniques for finding a minimum-size viewset for a single query without self-joins by using the shape of the query and its constraints, and validate the approach by extensive experiments. DA - 2006/9// PY - 2006/9// DO - 10.1007/s00778-005-0162-8 VL - 15 IS - 3 SP - 191-210 SN - 0949-877X KW - views KW - data warehouses KW - minimum-size viewsets KW - distributed systems ER - TY - JOUR TI - On the value of static analysis for fault detection in software AU - Zheng, J AU - Williams, L AU - Nagappan, N AU - Snipes, W AU - Hudepohl, JP AU - Vouk, MA T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING AB - No single software fault-detection technique is capable of addressing all fault-detection concerns. Similarly to software reviews and testing, static analysis tools (or automated static analysis) can be used to remove defects prior to release of a software product. To determine to what extent automated static analysis can help in the economic production of a high-quality product, we have analyzed static analysis faults and test and customer-reported failures for three large-scale industrial software systems developed at Nortel Networks. The data indicate that automated static analysis is an affordable means of software fault detection. Using the orthogonal defect classification scheme, we found that automated static analysis is effective at identifying assignment and checking faults, allowing the later software production phases to focus on more complex, functional, and algorithmic faults. A majority of the defects found by automated static analysis appear to be produced by a few key types of programmer errors and some of these types have the potential to cause security vulnerabilities. Statistical analysis results indicate the number of automated static analysis faults can be effective for identifying problem modules. Our results indicate static analysis tools are complementary to other fault-detection techniques for the economic production of a high-quality software product. DA - 2006/4// PY - 2006/4// DO - 10.1109/TSE.2006.38 VL - 32 IS - 4 SP - 240-253 SN - 1939-3520 KW - code inspections KW - walkthroughs ER - TY - JOUR TI - Narrative-centered tutorial planning for inquiry-based learning environments AU - Mott, B. W. AU - Lester, J. C. T2 - Lecture Notes in Computer Science AB - Recent years have seen growing interest in narrative-centered learning environments. Leveraging the inherent structure of narrative, narrative-centered learning environments offer significant potential for inquiry-based learning in which students actively participate in engaging story-based problem-solving. A key challenge posed by narrative-centered learning is orchestrating all of the events in the unfolding story to motivate students and promote effective learning. In this paper we present a narrative-centered tutorial planning architecture that integrates narrative planning and pedagogical control. The architecture continually constructs and updates narrative plans to support the hypothesis-generation-testing cycles that form the basis for inquiry-based learning. It is being used to implement a prototype narrative-centered inquiry-based learning environment for the domain of microbiology. The planner dynamically balances narrative and pedagogical goals while at the same time satisfying the real-time constraints of highly interactive learning environments. DA - 2006/// PY - 2006/// DO - 10.1007/11774303_67 IS - 4053 SP - 675-684 ER - TY - CHAP TI - Multivariate stream data classification using simple text classifiers AU - Seo, S. AU - Kang, J. AU - Lee, D. AU - Ryu, K. H. T2 - Database and expert systems applications: 17th international conference, DEXA 2006, Krakow, Poland, September 4-8, 2006: proceedings A2 - S. Bressan, J. Kung A2 - Wagner, R. PY - 2006/// SP - 420-429 PB - Berlin: Springer-Verlag SN - 03029743 ER - TY - JOUR TI - From linear story generation to branching story graphs AU - Riedl, M.O. AU - Young, R.M. T2 - IEEE Computer Graphics and Applications AB - Narrative intelligence refers to the ability - human or computer - to organize experience into narrative. Recently, researchers have applied narrative intelligence to create interactive narrative systems, virtual worlds in which a story unfolds and the user is considered a character in the story, able to interact with elements and other characters in the virtual world. The standard approach to incorporating storytelling into a computer system is to script a story at design time. However, this approach limits the computer system's ability to adapt to the user's preferences and abilities. The alternative approach is to generate stories dynamically or on a per-session basis (one story per time the system is engaged). Narrative generation is a process that involves the selection, ordering, and presentation through discourse of narrative content. A system that can generate stories can adapt narrative to the user's preferences and abilities, has expanded replay value, and can interact with users in ways that system designers didn't initially envision DA - 2006/5// PY - 2006/5// DO - 10.1109/MCG.2006.56 VL - 26 IS - 3 SP - 23-31 J2 - IEEE Comput. Grap. Appl. OP - SN - 0272-1716 UR - http://dx.doi.org/10.1109/mcg.2006.56 DB - Crossref ER - TY - JOUR TI - Eager Markov chains AU - Abdulla, P. A. AU - Henda, N. B. AU - Mayr, R. AU - Sandberg, S. T2 - Automated technology for verification and analysis : ?b 4th international symposium, ATVA 2006, Beijing, China, October 23-26, 2006 : proceedings / ?c Susanne Graf, Wenhui Zhang (eds.). DA - 2006/// PY - 2006/// VL - 4218 SP - 24-38 ER - TY - JOUR TI - Diagnosing self-efficacy in intelligent tutoring systems: An empirical study AU - McQuiggan, S. W. AU - Lester, J. C. T2 - Lecture Notes in Computer Science AB - Self-efficacy is an individual’s belief about her ability to perform well in a given situation. Because self-efficacious students are effective learners, endowing intelligent tutoring systems with the ability to diagnose self-efficacy could lead to improved pedagogy. Self-efficacy is influenced by (and influences) affective state. Thus, physiological data might be used to predict a students’ level of self-efficacy. This paper investigates an inductive approach to automatically constructing models of self-efficacy that can be used at runtime to inform pedagogical decisions. In an empirical study, two families of self-efficacy models were induced: a static model, learned solely from pre-test (non-intrusively collected) data, and a dynamic model, learned from both pre-test data as well as runtime physiological data collected with a biofeedback apparatus. The resulting static model is able to predict students’ real-time levels of self-efficacy with reasonable accuracy, while the physiologically informed dynamic model is even more accurate. DA - 2006/// PY - 2006/// DO - 10.1007/11774303_56 IS - 4053 SP - 565-574 ER - TY - JOUR TI - Augmenting automatically generated unit-test suites with regression oracle checking AU - Xie, T. T2 - Lecture Notes in Computer Science DA - 2006/// PY - 2006/// IS - 4067 SP - 380-403 ER - TY - JOUR TI - A reordering for the PageRank problem AU - Langville, AN AU - Meyer, CD T2 - SIAM JOURNAL ON SCIENTIFIC COMPUTING AB - We describe a reordering particularly suited to the PageRank problem, which reduces the computation of the PageRank vector to that of solving a much smaller system and then using forward substitution to get the full solution vector. We compare the theoretical rates of convergence of the original PageRank algorithm to that of the new reordered PageRank algorithm, showing that the new algorithm can do no worse than the original algorithm. We present results of an experimental comparison on five datasets, which demonstrate that the reordered PageRank algorithm can provide a speedup of as much as a factor of 6. We also note potential additional benefits that result from the proposed reordering. DA - 2006/// PY - 2006/// DO - 10.1137/040607551 VL - 27 IS - 6 SP - 2112-2120 SN - 1095-7197 KW - Markov chains KW - PageRank KW - reorderings KW - power method KW - convergence KW - stationary vector KW - dangling nodes ER - TY - JOUR TI - Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms AU - Huang, Shu AU - Dutta, Rudra AU - Rouskas, George N. T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS DA - 2006/4// PY - 2006/4// DO - 10.1109/jsac-ocn.2006.04006 VL - 24 IS - 4 SP - 66-82 SN - 1558-0008 KW - optical KW - networks KW - networking KW - traffic grooming KW - virtual topology ER - TY - JOUR TI - Optimal design of redundant water distribution networks using a cluster of workstations AU - Kumar, S. V. AU - Doby, T. A. AU - Baugh, J. W. AU - Brill, E. D. AU - Ranjithan, S. R. T2 - Journal of Water Resources Planning and Management AB - A genetic algorithm (GA)-based method for the least-cost design of looped pipe networks for various levels of redundancy is presented in this paper. Redundancy constraints are introduced in the optimization model by considering the number of pipes assumed to be out of service at any one time. Using this approach, trade-off relationships between cost and redundancy are developed. The GA-based approach is computationally intensive, and implementations on a custom fault-tolerant distributed computing framework, called Vitri, are used to satisfy the computational requirements. The design methodology is applied to two water distribution networks of different sizes, and a comparison of the performance of the distributed GAs for the design problems is also presented. We conclude that a GA-based approach to obtaining cost-effective, redundant solutions for the least-cost design of looped pipe networks can be effectively used on a heterogeneous network of nondedicated workstations. DA - 2006/// PY - 2006/// DO - 10.1061/(ASCE)0733-9496(2006)132:5(374) VL - 132 IS - 5 SP - 374-384 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33747304468&partnerID=MN8TOARS ER - TY - JOUR TI - Molecular modeling and adsorption properties of porous carbons AU - Jain, Surendra K. AU - Gubbins, Keith E. AU - Pellenq, Roland J. -M. AU - Pikunic, Jorge P. T2 - CARBON AB - In this work, we calculate the adsorption isotherms and isosteric heat of argon in molecular models of saccharose coke obtained via the Hybrid Reverse Monte Carlo method. In the first route (method A), the molecular models were built by considering only carbon atoms, and all other heteroatoms present were neglected. In the second route (method B), the molecular models were built by considering carbon and hydrogen atoms. We find that the models obtained via method B have smaller pores as compared to the models obtained via method A. This is reflected in the adsorption properties. The amount adsorbed is less in models obtained via method B as compared to method A. We also find that the isosteric heat calculated in the models obtained via method B match the experimental data more closely as compared to models obtained from method A. DA - 2006/10// PY - 2006/10// DO - 10.1016/j.carbon.2006.04.034 VL - 44 IS - 12 SP - 2445-2451 SN - 0008-6223 KW - porous carbon KW - modeling KW - molecular simulation KW - adsorption ER - TY - BOOK TI - Incorporating commitment protocols into Tropos AU - Mallya, A.U. AU - Singh, Munindar P. AB - This paper synthesizes two trends in the engineering of agent-based systems. One, modern agent-oriented methodologies deal with the key aspects of software development including requirements acquisition, architecture, and design, but can benefit from a stronger treatment of flexible interactions. Two, commitment protocols declaratively capture interactions among business partners, thus facilitating flexible behavior and a sophisticated notion of compliance. However, they lack support for engineering concerns such as inducing the desired roles and selecting the right protocols. This paper combines these two directions. For concreteness, we choose the Tropos methodology, which is strong in its requirements analysis, but our results can be ported to other agent-oriented methodologies. Our approach is as follows. First, using Tropos, analyze requirements based on dependencies between actors. Second, select top-level protocols based on the actors’ hard goals, while respecting the logical boundaries of their interactions. Third, select refined protocols based on the actors’ soft goals. Consequently, Tropos provides a rigorous basis for modeling and composing protocols whereas the protocols help produce perspicuous designs that respect the participants’ autonomy. We evaluate our approach using a large existing case. DA - 2006/// PY - 2006/// DO - 10.1007/11752660_6 VL - 3950 LNCS PB - Berlin: Springer SE - 69-80 SN - 3540340971 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33745861698&partnerID=MN8TOARS ER - TY - JOUR TI - Geodesic matching of triangulated surfaces AU - Ben Hamza, A. AU - Krim, Hamid T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - Recognition of images and shapes has long been the central theme of computer vision. Its importance is increasing rapidly in the field of computer graphics and multimedia communication because it is difficult to process information efficiently without its recognition. In this paper, we propose a new approach for object matching based on a global geodesic measure. The key idea behind our methodology is to represent an object by a probabilistic shape descriptor that measures the global geodesic distance between two arbitrary points on the surface of an object. In contrast to the Euclidean distance which is more suitable for linear spaces, the geodesic distance has the advantage to be able to capture the intrinsic geometric structure of the data. The matching task therefore becomes a one-dimensional comparison problem between probability distributions which is clearly much simpler than comparing three-dimensional structures. Object matching can then be carried out by an information-theoretic dissimilarity measure calculations between geodesic shape distributions, and is additionally computationally efficient and inexpensive. DA - 2006/8// PY - 2006/8// DO - 10.1109/TIP.2006.875250 VL - 15 IS - 8 SP - 2249-2258 SN - 1941-0042 KW - geodesic distance KW - object recognition KW - shape signature KW - three-dimensional (3-D) matching ER - TY - JOUR TI - Broadening our collaboration with design AU - Watson, Benjamin T2 - IEEE COMPUTER GRAPHICS AND APPLICATIONS AB - Computer graphics researchers have been collaborating successfully with engineers, architects, and artists for decades, focusing on better tools for model and image creation. Graphics researchers have already developed a wide range of procedural (automatic) modeling techniques, but with few exceptions, these focus on modeling natural objects, such as plants, terrains, and water. The next generation of tools must automate modeling of the most common and complex elements of digital content: manmade artifacts such as cities, buildings, vehicles, and furniture. Creating these tools require a new and close collaboration with architects as well as urban and industrial designers DA - 2006/// PY - 2006/// DO - 10.1109/mcg.2006.99 VL - 26 IS - 5 SP - 18-21 SN - 1558-1756 ER - TY - JOUR TI - An optical control plane for the grid community: Opportunities, challenges, and vision AU - Karmous-Edwards, G. AU - Jukan, A. T2 - IEEE Communications Magazine DA - 2006/// PY - 2006/// VL - 44 IS - 3 SP - 62- ER - TY - JOUR TI - Visual factors affecting touchdown point judgments during off-airport emergency landings AU - Mayer, Celeste M. AU - Mershon, Donald H. AU - Lim, Raymond W. AU - Chipley, M. Ryan AU - McAllister, David F. T2 - INTERNATIONAL JOURNAL OF AVIATION PSYCHOLOGY AB - This article provides a comprehensive discussion of research designed to examine the possible existence of consistent visual misperceptions that may occur during off-airport emergency landings. The importance of 2 particular visual experiences was evaluated: (a) the view of the world seen from the unusually steep bank at a low altitude, and (b) the visual distraction of a "windmilling" propeller. The influences of experience and environmental structure were also considered. Studies of these factors were conducted using a visually realistic cockpit mounted within a VisionDome® virtual reality environment. Behavioral responses were collected from both naive participants and pilot participants. The findings indicated that judgments of the position of the touchdown point made while the airplane is turning are underestimated in distance, whereas judgments made while the airplane is on a straight approach to the touchdown point are overestimated. In most cases, the windmilling propeller decreased touchdown point judgment accuracy. In addition, pilot experience was associated with improved judgment accuracy during the turning approaches. The presented environmental structure had a weak and inconsistent effect. DA - 2006/// PY - 2006/// DO - 10.1207/s15327108ijap1604_4 VL - 16 IS - 4 SP - 401-418 SN - 1050-8414 ER - TY - JOUR TI - Story planning as exploratory creativity: Techniques for expanding the narrative search space AU - Riedl, Mark O. AU - Young, R. Michael T2 - New Generation Computing DA - 2006/9// PY - 2006/9// DO - 10.1007/BF03037337 VL - 24 IS - 3 SP - 303-323 J2 - New Gener Comput LA - en OP - SN - 0288-3635 1882-7055 UR - http://dx.doi.org/10.1007/bf03037337 DB - Crossref KW - exploratory creativity KW - story generation KW - narrative intelligence ER - TY - BOOK TI - Statistics and analysis of shapes AB - Shapes have been among man’s fascinations from thestoneage to thespace age. The scienti?c study of shapes may indeed be traced back to D’Arcy Thompson in his pioneering book On Growth and Form where s DA - 2006/// PY - 2006/// DO - 10.1007/0-8176-4481-4 PB - Boston: Birkhauser SN - 0817643761 ER - TY - JOUR TI - Pattern avoidance in compositions and multiset permutations AU - Savage, CD AU - Wilf, HS T2 - ADVANCES IN APPLIED MATHEMATICS AB - We show that among the compositions of n into positive parts, the number g(n) that avoid a given pattern π of three letters is independent of π. We find the generating function of {g(n)}, and it shows that the sequence {g(n)} is not P-recursive. If S is a given multiset, we show that the number of permutations of S that avoid a pattern π of three letters is independent of π. Finally, we give a bijective proof of the fact that if M=1a1…kak is a given multiset then the number of permutations of M that avoid the pattern (123) is a symmetric function of the multiplicities a1,…,ak. The bijection uses the Greene–Kleitman symmetric chain decomposition of the Boolean lattice. DA - 2006/2// PY - 2006/2// DO - 10.1016/j.aam.2005.06.003 VL - 36 IS - 2 SP - 194-201 SN - 1090-2074 ER - TY - JOUR TI - Nonstationary analysis of circuit-switched communication networks AU - Alnowibet, Khalid Abdulaziz AU - Perros, Harry T2 - PERFORMANCE EVALUATION AB - Circuit-switched communication networks have been analyzed extensively in the stationary case, i.e. where the arrival and/or service rates are independent of time. In this paper, we study a circuit-switched network where the rates of external arrivals at the network are time-dependent functions. The circuit-switched network is modelled as a nonstationary queueing network with population constraints, which is analyzed approximately in order to obtain the blocking probability functions. Using this method we model two circuit-switched networks, namely, a traffic-groomed tandem optical network and a single-orbit LEO satellite network. DA - 2006/10// PY - 2006/10// DO - 10.1016/j.peva.2005.10.001 VL - 63 IS - 9-10 SP - 892-909 SN - 1872-745X KW - queueing networks KW - nonstationary arrivals KW - circuit-switched networks KW - traffic grooming KW - LEO satellite networks ER - TY - JOUR TI - Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems AU - Benoit, Anne AU - Plateau, Brigitte AU - Stewart, William J. T2 - FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE AB - We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of stochastic automata. The tensor structure inherently involves a product state space but, inside this product state space, the actual reachable state space can be much smaller. For such cases, we propose an improvement of the standard numerical algorithm, the so-called “shuffle algorithm”, which necessitates only vectors of the size of the actual state space. With this contribution, numerical algorithms based on tensor products can now handle larger models. DA - 2006/8// PY - 2006/8// DO - 10.1016/j.future.2006.02.006 VL - 22 IS - 7 SP - 838-847 SN - 1872-7115 KW - large and sparse Markov chains KW - stochastic automata networks KW - generalized tensor algebra KW - vector-descriptor multiplication KW - shuffle algorithm ER - TY - JOUR TI - LAD: Localization anomaly detection for wireless sensor networks AU - Du, Wenliang AU - Fang, Lei AU - Peng, Ning T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - In wireless sensor networks (WSNs), sensors’ locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed to provide correct reference information. However, when the sensor networks are deployed in a hostile environment, where beacon nodes can be compromised, such an assumption does not hold anymore. In this paper, we propose a general scheme to detect localization anomalies that are caused by adversaries. Our scheme is independent from the localization schemes. We formulate the problem as an anomaly intrusion detection problem, and we propose a number of ways to detect localization anomalies. We have conducted simulations to evaluate the performance of our scheme, including the false positive rates, the detection rates, and the resilience to node compromises. DA - 2006/7// PY - 2006/7// DO - 10.1016/j.jpdc.2005.12.011 VL - 66 IS - 7 SP - 874-886 SN - 1096-0848 KW - sensor networks KW - security KW - anomaly detection KW - location discovery ER - TY - JOUR TI - Integrating XML data sources using approximate joins AU - Guha, Sudipto AU - Jagadish, H. V. AU - Koudas, Nick AU - Srivastava, Divesh AU - Yu, Ting T2 - ACM TRANSACTIONS ON DATABASE SYSTEMS AB - XML is widely recognized as the data interchange standard of tomorrow because of its ability to represent data from a variety of sources. Hence, XML is likely to be the format through which data from multiple sources is integrated. In this article, we study the problem of integrating XML data sources through correlations realized as join operations. A challenging aspect of this operation is the XML document structure. Two documents might convey approximately or exactly the same information but may be quite different in structure. Consequently, an approximate match in structure, in addition to content, has to be folded into the join operation. We quantify an approximate match in structure and content for pairs of XML documents using well defined notions of distance. We show how notions of distance that have metric properties can be incorporated in a framework for joins between XML data sources and introduce the idea of reference sets to facilitate this operation. Intuitively, a reference set consists of data elements used to project the data space. We characterize what constitutes a good choice of a reference set, and we propose sampling-based algorithms to identify them. We then instantiate our join framework using the tree edit distance between a pair of trees. We next turn our attention to utilizing well known index structures to improve the performance of approximate XML join operations. We present a methodology enabling adaptation of index structures for this problem, and we instantiate it in terms of the R-tree. We demonstrate the practical utility of our solutions using large collections of real and synthetic XML data sets, varying parameters of interest, and highlighting the performance benefits of our approach. DA - 2006/3// PY - 2006/3// DO - 10.1145/1132863.1132868 VL - 31 IS - 1 SP - 161-207 SN - 1557-4644 KW - algorithms KW - experimentation KW - performance KW - theory KW - data integration KW - tree edit distance KW - XML KW - joins KW - approximate joins ER - TY - JOUR TI - Improved system integration for integrated gasification combined cycle (IGCC) systems AU - Frey, HC AU - Zhu, YH T2 - ENVIRONMENTAL SCIENCE & TECHNOLOGY AB - Integrated gasification combined cycle (IGCC) systems are a promising technology for power generation. They include an air separation unit (ASU), a gasification system, and a gas turbine combined cycle power block, and feature competitive efficiency and lower emissions compared to conventional power generation technology. IGCC systems are not yet in widespread commercial use and opportunities remain to improve system feasibility via improved process integration. A process simulation model was developed for IGCC systems with alternative types of ASU and gas turbine integration. The model is applied to evaluate integration schemes involving nitrogen injection, air extraction, and combinations of both, as well as different ASU pressure levels. The optimal nitrogen injection only case in combination with an elevated pressure ASU had the highest efficiency and power output and approximately the lowest emissions per unit output of all cases considered, and thus is a recommended design option. The optimal combination of air extraction coupled with nitrogen injection had slightly worse efficiency, power output, and emissions than the optimal nitrogen injection only case. Air extraction alone typically produced lower efficiency, lower power output, and higher emissions than all other cases. The recommended nitrogen injection only case is estimated to provide annualized cost savings compared to a nonintegrated design. Process simulation modeling is shown to be a useful tool for evaluation and screening of technology options. DA - 2006/3/1/ PY - 2006/3/1/ DO - 10.1021/es0515598 VL - 40 IS - 5 SP - 1693-1699 SN - 0013-936X ER - TY - JOUR TI - IDGraphs: Intrusion detection and analysis using stream compositing AU - Ren, P AU - Gao, Y AU - Li, ZC AU - Chen, Y AU - Watson, B T2 - IEEE COMPUTER GRAPHICS AND APPLICATIONS AB - IDGraphs is an interactive visualization system, supporting intrusion detection over massive network traffic streams. It features a novel time-versus-failed-connections mapping that aids in discovery of attack patterns. The number of failed connections (SYN-SYN/ACK) is a strong indicator of suspicious network flows. IDGraphs offers several flow aggregation methods that help reveal different attack patterns. The system also offers high visual scalability through the use of Histographs. The IDGraphs intrusion detection system detects and analyzes a variety of attacks and anomalies, including port scanning, worm outbreaks, stealthy TCP SYN flooding, and some distributed attacks. In this article, we demonstrate IDGraphs using a single day of NetFlow network traffic traces collected at edge routers at Northwestern University which has several OC-3 links. DA - 2006/// PY - 2006/// DO - 10.1109/MCG.2006.36 VL - 26 IS - 2 SP - 28-39 SN - 1558-1756 ER - TY - JOUR TI - Extralabel use of penicillin in food animals AU - Payne, Michael A. AU - Craigmill, Arthur AU - Riviere, Jim E. AU - Webb, Alistair I. T2 - JAVMA-JOURNAL OF THE AMERICAN VETERINARY MEDICAL ASSOCIATION AB - Penicillin is one of the most commonly detected drug residues in tissues and milk, and is the antimicrobial for which information is most often sought through FARAD. DA - 2006/11/1/ PY - 2006/11/1/ DO - 10.2460/javma.229.9.1401 VL - 229 IS - 9 SP - 1401-1403 SN - 1943-569X ER - TY - BOOK TI - Extending mechanics to minds: The mechanical foundations of psychology and economics AU - Doyle, J. DA - 2006/// PY - 2006/// PB - Cambridge; New York: Cambridge University Press SN - 0521861977 ER - TY - JOUR TI - Essential communication practices for Extreme Programming in a global software development team AU - Layman, Lucas AU - Williams, Laurie AU - Damian, Daniela AU - Bures, Hynek T2 - INFORMATION AND SOFTWARE TECHNOLOGY AB - We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distributed team created a successful project in a new problem domain using a methodology that is dependent on informal, face-to-face communication. We collected quantitative and qualitative data and used grounded theory to identify four key factors for communication in globally-distributed XP teams working within a new problem domain. Our study suggests that, if these critical enabling factors are addressed, methodologies dependent on informal communication can be used on global software development projects. DA - 2006/9// PY - 2006/9// DO - 10.1016/j.infsof.2006.01.004 VL - 48 IS - 9 SP - 781-794 SN - 1873-6025 KW - global software development KW - Extreme Programming KW - case study ER - TY - JOUR TI - Concealed data aggregation for reverse multicast traffic in sensor networks: Encryption, key distribution, and routing adaptation AU - Westhoff, D. AU - Girao, J. AU - Acharya, M. T2 - IEEE Transactions on Mobile Computing DA - 2006/// PY - 2006/// VL - 5 IS - 10 SP - 1417-1431 ER - TY - JOUR TI - Security vulnerabilities: From analysis to detection and masking techniques AU - Chen, S. AU - Xu, J. AU - Kalbarczyk, Z. AU - Iyer, R. K. T2 - Proceedings of the IEEE DA - 2006/// PY - 2006/// VL - 94 IS - 2 SP - 407-418 ER - TY - JOUR TI - Secure and resilient clock synchronization in wireless sensor networks AU - Sun, K AU - Ning, P AU - Wang, C T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - Wireless sensor networks have received a lot of attention recently due to its wide applications. An accurate and synchronized clock time is crucial in many sensor network applications. Several clock synchronization schemes have been proposed for wireless sensor networks recently to address the resource constraints in such networks. However, most of these techniques assume benign environments, but cannot survive malicious attacks in hostile environments, especially when there are compromised nodes. As an exception, a recent work attempts to detect malicious attacks against clock synchronization, and aborts when an attack is detected. Though this approach can prevent incorrect clock synchronization due to attacks, it will lead to denial of clock synchronization in such situations. This paper adopts a model where all the sensor nodes synchronize their clocks to a common source, which is assumed to be well synchronized to the external clock. This paper seeks techniques to provide redundant ways for each node to synchronize its clock with the common source, so that it can tolerate partially missing or false synchronization information provided by compromised nodes. Two types of techniques are developed using this general method: level-based clock synchronization and diffusion-based clock synchronization. Targeted at static sensor networks, the level-based clock synchronization constructs a level hierarchy initially, and uses (or reuses) this level hierarchy for multiple rounds of clock synchronization. The diffusion-based clock synchronization attempts to synchronize all the clocks without relying on any structure assumptions and, thus, can be used for dynamic sensor networks. This paper further investigates how to use multiple clock sources for both approaches to increase the resilience against compromise of source nodes. The analysis in this paper indicates that both level-based and diffusion-based approaches can tolerate up to s colluding malicious source nodes and t colluding malicious nodes among the neighbors of each normal node, where s and t are two system parameters. This paper also presents the results of simulation studies performed to evaluate the proposed techniques. These results demonstrate that the level-based approach has less overhead and higher precision, but less coverage, than the diffusion-based approach. DA - 2006/2// PY - 2006/2// DO - 10.1109/JSAC.2005.861396 VL - 24 IS - 2 SP - 395-408 SN - 1558-0008 KW - computer network security KW - fault tolerance KW - synchronization KW - wireless sensor networks ER - TY - JOUR TI - Classification of Escherichia coli K-12 ribosome binding sites AU - May, EE AU - Vouk, MA AU - Bitzer, DL T2 - IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE AB - Drawing on parallels between genetic information processing in living organisms and the processing of communications data, we develop an error-control coding-based translation initiation classification system that uses an eleven base classification window. An overview of channel codes and a summary of the translation initiation process are presented. Parallels between the two are drawn and a brief review of a channel code model for translation initiation is shown. A block-code Bayesian classifier is presented and the results of applying the system to the translation start site location problem for Escherichia coli K-12 is discussed. DA - 2006/// PY - 2006/// DO - 10.1109/memb.2006.1578668 VL - 25 IS - 1 SP - 90-97 SN - 0739-5175 ER - TY - JOUR TI - Traffic grooming in WDM ring networks to minimize the maximum electronic port cost. AU - Chen, B. AU - Rouskas, G. AU - Dutta, R. T2 - Optical Switching and Networking DA - 2006/// PY - 2006/// VL - 2 IS - 1 SP - 1-18 ER - TY - JOUR TI - A performance study of an optical burst switched network with dynamic simultaneous link possession AU - Battestilli, Tzvetelina AU - Perros, Harry T2 - Computer Networks AB - In optical burst switched (OBS) networks a burst may occupy a wavelength on one or more links as it travels through the network. In the literature, OBS networks have been analyzed assuming that each burst occupies only a wavelength on a single link. In this paper, we study analytically the performance of an OBS network with a mixture of different size bursts. The short bursts occupy a wavelength on a single link while the long bursts occupy simultaneously wavelengths on multiple consecutive links. We develop a queueing network, which models simultaneous link possession, and we calculate analytically the end-to-end burst loss probabilities over a path in the OBS network. Our results indicate that having a mix of various size bursts can greatly effect the burst loss probabilities in the network. DA - 2006/2// PY - 2006/2// DO - 10.1016/j.comnet.2005.05.021 VL - 50 IS - 2 SP - 219-236 J2 - Computer Networks LA - en OP - SN - 1389-1286 UR - http://dx.doi.org/10.1016/j.comnet.2005.05.021 DB - Crossref KW - optical burst switching (OBS) KW - optical networks KW - queueing network KW - simultaneous resource possession KW - burst loss probability KW - decomposition algorithm KW - traffic model ER - TY - JOUR TI - Providing user models direct access to interfaces: An exploratory study of a simple interface with implications for HRI and HCI AU - Ritter, Frank E. AU - Van Rooy, Dirk AU - St Amant, Robert AU - Simpson, Kate T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS AB - Models of users are a way to understand and improve the usability of computer interfaces. We present here a model in ACT-R cognitive-modeling language that interacts with a publicly available driving simulation as a simple analog for robot interfaces. The model interacts with the unmodified Java interface by incorporating a novel use of bitmap parsing. The model's structure starts to describe the knowledge a human operator of a robot must have. The model also indicates some of the aspects of the task will be difficult for the operator. For example, the model's performance makes quantitative predictions about how robot speed will influence navigation quality, correlating well to human performance. While the model does not cover all aspects of human-robot interaction, it illustrates how providing user models access to an interface through its bitmap can lead to more accurate and more widely applicable model users. DA - 2006/5// PY - 2006/5// DO - 10.1109/TSMCA.2005.853482 VL - 36 IS - 3 SP - 592-601 SN - 1558-2426 KW - graphical user interfaces KW - human-computer interaction (HCI) KW - human-robot interaction (HRI) KW - image processing KW - telerobotics KW - user interface human factors KW - user modeling ER - TY - JOUR TI - A* search: An efficient and flexible approach to materialized view selection AU - Gou, Gang AU - Yu, Jeffrey Xu AU - Lu, Hongjun T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS AB - Decision support systems issue a large number of online analytical processing (OLAP) queries to access very large databases. A data warehouse needs to precompute or materialize some of such OLAP queries in order to improve the system throughput, since many coming queries can benefit greatly from these materialized views. Materialized view selection with resource constraint is one of the most important issues in the management of data warehouses. It addresses how to fully utilize the limited resource, disk space, or maintenance time to minimize the total query processing cost. This paper revisits the problem of materialized view selection under a disk-space constraint S. Many efficient greedy algorithms have been developed to address this problem. The quality of greedy solutions is guaranteed by a lower bound. However, it is observed that, when S is small, this lower bound can be very small and even be negative. In such cases, their solution quality will not be guaranteed well. In order to improve further the solution quality in such cases, a new competitive A/sup */ algorithm is proposed. It is shown that it is just the distinctive topological structure of the dependent lattice that makes the A/sup */ search a very competitive strategy for this problem. Both theoretical and experimental results show that the proposed algorithm is a powerful, efficient, and flexible approach to this problem. DA - 2006/5// PY - 2006/5// DO - 10.1109/TSMCC.2004.843248 VL - 36 IS - 3 SP - 411-425 SN - 1558-2442 KW - A* search KW - materialized view selection KW - online analytical processing (OLAP) ER - TY - CHAP TI - Finding equivalent rewritings in the presence of arithmetic comparisons AU - Afrati, F. AU - Chirkova, R. AU - Gergatsoulis, M. AU - Pavlaki, V. T2 - Advances in database technology : EDBT 2006 : 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006: Proceedings (Lecture notes in computer science; 3896) AB - The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of data-management problems. For select-project-join SQL (a.k.a. conjunctive) queries and views, there are efficient algorithms in the literature, which find equivalent and maximally contained rewritings. In the presence of arithmetic comparisons (ACs) the problem becomes more complex. We do not know how to find maximally contained rewritings in the general case. There are algorithms which find maximally contained rewritings only for special cases such as when ACs are restricted to be semi-interval. However, we know that the problem of finding an equivalent rewriting (if there exists one) in the presence of ACs is decidable, yet still doubly exponential. This complexity calls for an efficient algorithm which will perform better on average than the complete enumeration algorithm. In this work we present such an algorithm which is sound and complete. Its efficiency lies in that it considers fewer candidate rewritings because it includes a preliminary test to decide for each view whether it is potentially useful in some rewriting. PY - 2006/// DO - 10.1007/11687238_55 VL - 3896 SP - 942-960 PB - Berlin: Springer ER - TY - JOUR TI - A formal methods approach to medical device review AU - Jetley, R AU - Iyer, SP AU - Jones, PL T2 - COMPUTER AB - With software playing an increasingly important role in medical devices, regulatory agencies such as the US Food and Drug Administration need effective means for assuring that this software is safe and reliable. The FDA has been striving for a more rigorous engineering-based review strategy to provide this assurance. The use of mathematics-based techniques in the development of software might help accomplish this. However, the lack of standard architectures for medical device software and integrated engineering-tool support for software analysis make a science-based software review process more difficult. The research presented here applies formal modeling methods and static analysis techniques to improve the review process. Regulation of medical device software encompasses reviews of device designs (premarket review) and device performance (postmarket surveillance). The FDA's Center for Devices and Radiological Health performs the premarket review on a device to evaluate its safety and effectiveness. As part of this process, the agency reviews software development life-cycle artifacts for appropriate quality-assurance attributes, which tend to reveal little about the device software integrity. DA - 2006/4// PY - 2006/4// DO - 10.1109/MC.2006.113 VL - 39 IS - 4 SP - 61-+ SN - 1558-0814 ER - TY - JOUR TI - Dynamic bandwidth allocation by using efficient threshold reporting for quality of service in Ethernet passive optical networks AU - Yang, Y. M. AU - Nho, J. M. AU - Perros, H. AU - Mahalik, N. P. AU - Kim, K. AU - Ahn, B. H. T2 - Optical Engineering (Redondo Beach, Calif.) DA - 2006/// PY - 2006/// VL - 45 IS - 3 ER - TY - JOUR TI - Theoretical analysis of the SABUL congestion control algorithm AU - Oothongsap, P AU - Viniotis, Y AU - Vouk, M T2 - TELECOMMUNICATION SYSTEMS DA - 2006/3// PY - 2006/3// DO - 10.1007/s11235-006-6516-8 VL - 31 IS - 2-3 SP - 115-139 SN - 1572-9451 ER - TY - JOUR TI - Performance analysis of limited-range wavelength conversion in an OBS switch AU - Puttasubbappa, VS AU - Perros, HG T2 - TELECOMMUNICATION SYSTEMS DA - 2006/3// PY - 2006/3// DO - 10.1007/s11235-006-6522-x VL - 31 IS - 2-3 SP - 227-246 SN - 1572-9451 KW - optical burst switching KW - limited-range wavelength conversion KW - performance evaluation KW - simultaneous resource allocation ER - TY - JOUR TI - Accessible proteomics space and its implications for peak capacity for zero-, one- and two-dimensional separations coupled with FT-ICR and TOF mass spectrometry AU - Frahm, JL AU - Howard, BE AU - Heber, S AU - Muddiman, DC T2 - JOURNAL OF MASS SPECTROMETRY AB - Abstract The number and wide dynamic range of components found in biological matrixes present several challenges for global proteomics. In this perspective, we will examine the potential of zero‐dimensional (0D), one‐dimensional (1D), and two‐dimensional (2D) separations coupled with Fourier‐transform ion cyclotron resonance (FT‐ICR) and time‐of‐flight (TOF) mass spectrometry (MS) for the analysis of complex mixtures. We describe and further develop previous reports on the space occupied by peptides, to calculate the theoretical peak capacity available to each separations‐mass spectrometry method examined. Briefly, the peak capacity attainable by each of the mass analyzers was determined from the mass resolving power (RP) and the m / z space occupied by peptides considered from the mass distribution of tryptic peptides from National Center for Biotechnology Information's (NCBI's) nonredundant database. Our results indicate that reverse‐phase‐nanoHPLC (RP‐nHPLC) separation coupled with FT‐ICR MS offers an order of magnitude improvement in peak capacity over RP‐nHPLC separation coupled with TOF MS. The addition of an orthogonal separation method, strong cation exchange (SCX), for 2D LC‐MS demonstrates an additional 10‐fold improvement in peak capacity over 1D LC‐MS methods. Peak capacity calculations for 0D LC, two different 1D RP‐HPLC methods, and 2D LC (with various numbers of SCX fractions) for both RP‐HPLC methods coupled to FT‐ICR and TOF MS are examined in detail. Peak capacity production rates, which take into account the total analysis time, are also considered for each of the methods. Furthermore, the significance of the space occupied by peptides is discussed. Copyright © 2006 John Wiley & Sons, Ltd. DA - 2006/3// PY - 2006/3// DO - 10.1002/jms.1024 VL - 41 IS - 3 SP - 281-288 SN - 1096-9888 ER - TY - JOUR TI - Optical networks AU - Perros, H T2 - COMPUTER NETWORKS DA - 2006/2/8/ PY - 2006/2/8/ DO - 10.1016/j.comnet.2005.05.020 VL - 50 IS - 2 SP - 145-148 SN - 1872-7069 ER -