TY - JOUR TI - Light-tree routing under optical power budget constraints [Invited] AU - Xin, Yufeng AU - Rouskas, George N. T2 - Journal of Optical Networking AB - Feature Issue on Next-Generation WDM Network Design and Routing (WDMN). It has been widely recognized that physical-layer impairments, including power losses, must be taken into account when optical connections are routed in transparent networks. We study the problem of constructing light-trees under optical-layer power budget constraints, with a focus on algorithms that can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms; one of the algorithms is appropriate for networks with sparse light splitting and/or limited splitting fanout. We find that, to guarantee an adequate signal quality and to scale to large destination sets, light-trees must be as balanced as possible. Numerical results demonstrate that existing algorithms tend to construct highly unbalanced trees and are thus expected to perform poorly in an optical network setting. Our algorithms, on the other hand, are designed to construct balanced trees that, in addition to having good performance in terms of signal quality, also ensure a certain degree of fairness among destination nodes. Although we consider only power loss here, the algorithms that we develop could be appropriately modified to account for other physical-layer impairments, such as dispersion. DA - 2004/// PY - 2004/// DO - 10.1364/jon.3.000282 VL - 3 IS - 5 SP - 282 J2 - J. Opt. Netw. LA - en OP - SN - 1536-5379 UR - http://dx.doi.org/10.1364/jon.3.000282 DB - Crossref ER - TY - CHAP TI - Optical Network Engineering AU - Rouskas, George N. T2 - IP over WDM A2 - Dixit, Sudhir AB - This chapter discusses the application of traffic engineering and planning methodologies to the design and operation of optical networks employing WDM technology. The routing and wavelength assignment (RWA) problem is first introduced as the fundamental control problem in WDM networks. The RWA problem is then studied in two different but complementary contexts. The static RWA arises in the network design phase where the objective is capacity planning and the sizing of network resources. The dynamic RWA is encountered during the real-time network operation phase and involves the dynamic provisioning of optical connections. Both the static and dynamic variants of the problem are explored in depth with an emphasis on solution approaches and algorithms. The chapter concludes with a discussion of control plane issues and related standardization activities in support of traffic engineering functionality. PY - 2004/1/29/ DO - 10.1002/0471478342.ch10 SP - 299-327 PB - John Wiley & Sons, Inc. UR - http://dx.doi.org/10.1002/0471478342.ch10 ER - TY - CONF TI - Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings A2 - Davies, Jim A2 - Schulte, Wolfram A2 - Barnett, Michael AB - Formal engineering methods are changing the way that software systems are - veloped.Withlanguageandtoolsupport,theyarebeingusedforautomaticcode generation, and for the automatic abstraction and checki C2 - 2004/// DA - 2004/// DO - 10.1007/b102837 VL - 3308 PB - Springer UR - https://doi.org/10.1007/b102837 ER - TY - CONF TI - A Formal Monitoring-Based Framework for Software Development and Analysis AB - A formal framework for software development and analysis is presented, which aims at reducing the gap between formal specification and implementation by integrating the two and allowing them together to form a system. It is called monitoring-oriented programming (MOP), since runtime monitoring is supported and encouraged as a fundamental principle. Monitors are automatically synthesized from formal specifications and integrated at appropriate places in the program, according to user-configurable attributes. Violations and/or validations of specifications can trigger user-defined code at any points in the program, in particular recovery code, outputting/sending messages, or raising exceptions. The major novelty of MOP is its generality w.r.t. logical formalisms: it allows users to insert their favorite or domain-specific specification formalisms via logic plug-in modules. A WWW repository has been created, allowing MOP users to download and upload logic plug-ins. An experimental prototype tool, called Java-MOP, is also discussed, which currently supports most but not all of the desired MOP features. C2 - 2004/// C3 - Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings DA - 2004/// DO - 10.1007/978-3-540-30482-1_31 SP - 357-372 UR - https://doi.org/10.1007/978-3-540-30482-1_31 ER - TY - JOUR TI - On wavelength assignment in optical burst switched networks AU - Teng, J AU - Rouskas, GN AU - society, T2 - First International Conference on Broadband Networks, Proceedings DA - 2004/// PY - 2004/// SP - 24-33 ER - TY - CHAP TI - Multicast routing under optical layer constraints AU - Xin, YF AU - Rouskas, GN AU - IEEE T2 - Ieee Infocom 2004: the Conference on Computer Communications, Vols 1-4, Proceedings PY - 2004/// SP - 2731-2742 PB - SE - ER - TY - JOUR TI - Fault management with fast restoration for optical burst switched networks AU - Xin, YF AU - Teng, J AU - Karmous-Edwards, G AU - Rouskas, GN AU - Stevenson, D AU - society, T2 - First International Conference on Broadband Networks, Proceedings DA - 2004/// PY - 2004/// SP - 34-42 ER - TY - CHAP TI - Traffic grooming in WDM ring networks with the min-max objective AU - Chen, BS AU - Rouskas, GN AU - Dutta, R AU - Mitrou, N AU - Kontovasilis, K AU - Iliadis, I AU - Merakos, L T2 - Networking 2004 PY - 2004/// VL - 3042 SP - 174-185 PB - SE - ER - TY - JOUR TI - Three-failure match AU - Xu, Wenbing AU - Guo, Zhishan T2 - Mathematics in Practice and Theory DA - 2004/// PY - 2004/// VL - 34 IS - 11 SP - 14–19 ER - TY - CONF TI - Branching storylines in virtual reality environments for leadership development AU - Gordon, A. AU - Van Lent, M. AU - Van Velsen, M. AU - Carpenter, P. AU - Jhala, A. C2 - 2004/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2004/// SP - 844-851 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-9444283150&partnerID=MN8TOARS ER - TY - CONF TI - End-To-End Burst Loss Probabilities in an OBS Network with Simultaneous Link Possession AU - Battestilli, L. AU - Perros, H. C2 - 2004/// C3 - Proceedings of the Third International Workshop on Optical Burst Switching, WOBS3 DA - 2004/// ER - TY - JOUR TI - Early termination in Shoup's algorithm for the minimum polynomial of an algebraic AU - Eberly, Wayne AU - Kaltofen, Erich DA - 2004/// PY - 2004/// ER - TY - JOUR TI - An architecture for integrating plan-based behavior generation with interactive game environments AU - Young, R.Michael AU - Riedl, Mark AU - Branly, Mark AU - Jhala, Arnav AU - Martin, R.J. AU - Saretto, C.J. T2 - The Journal of Game Development DA - 2004/3// PY - 2004/3// VL - 1 IS - 1 SP - 51–70 ER - TY - CONF TI - Multi-label Machine Learning and Its Application to Semantic Scene Classification AU - Shen, Xipeng AU - Boutell, Matthew AU - Luo, Jiebo AU - Brown, Christopher T2 - IS&T/SPIE’s Sixteenth Annual Symposium on Electronic Imaging AB - In classic pattern recognition problems, classes are mutually exclusive by definition. Classification errors occur when the classes overlap in the feature space. We examine a different situation, occurring when the classes are, by definition, not mutually exclusive. Such problems arise in scene and document classification and in medical diagnosis. We present a framework to handle such problems and apply it to the problem of semantic scene classification, where a natural scene may contain multiple objects such that the scene can be described by multiple class labels (e.g., a field scene with a mountain in the background). Such a problem poses challenges to the classic pattern recognition paradigm and demands a different treatment. We discuss approaches for training and testing in this scenario and introduce new metrics for evaluating individual examples, class recall and precision, and overall accuracy. Experiments show that our methods are suitable for scene classification; furthermore, our work appears to generalize to other classification problems of the same nature. C2 - 2004/1// C3 - Proceedings of Storage and Retrieval Methods and Applications for Multimedia 2004 CY - San Jose, CA DA - 2004/1// PY - 2004/// DO - 10.1117/12.523428 VL - 5307 SP - 188–199 PB - SPIE ER - TY - RPRT TI - Characterizing Phases in Service-Oriented Applications AU - Shen, Xipeng AU - Ding, Chen AU - Dwarkdas, Sandhya AU - Scott, Michael L. A3 - Computer Science Dept., University of Rochester DA - 2004/11// PY - 2004/11// M1 - TR848 M3 - Technical Report PB - Computer Science Dept., University of Rochester SN - TR848 ER - TY - CONF TI - A Semantic Protocol-Based Approach for Developing Business Processes AU - Chopra, Amit K. AU - Desai, Nirmit V. AU - Mallya, Ashok U. AU - Wagle, Leena V. AU - Singh, Munindar P. C2 - 2004/11// C3 - Forum Proceedings of the 2nd International Conference on Service Oriented Computing (ICSOC) DA - 2004/11// SP - 99–107 PB - ACM ER - TY - CONF TI - Modeling Flexible Business Processes AU - Chopra, Amit K. AU - Desai, Nirmit V. AU - Mallya, Ashok U. AU - Singh, Munindar P. C2 - 2004/7// C3 - Proceedings of the 1st AAMAS Workshop on Declarative Agent Languages and Technologies (DALT) DA - 2004/7// ER - TY - CONF TI - Mining repositories to assist in project planning and resource allocation AU - Menzies, T. T2 - "International Workshop on Mining Software Repositories (MSR 2004)" W17S Workshop - 26th International Conference on Software Engineering AB - DOI: 10.1049/ic:20040480 ISBN: 0 86341 432 X Location: Edinburgh, UK Conference date: 25 May 2004 Format: PDF Software repositories plus defect logs are useful for learning defect detectors. Such defect detectors could be a useful resource allocation tool for software managers. One way to view our detectors is that they are a V&V tool for V&V; i.e. they can be used to assess if "too much" of the testing budget is going to "too little" of the system. Finding such detectors could become the business case that constructing a local repository is useful. Three counter arguments to such a proposal are (1) no general conclusions have been reported in any such repository despite years of effort; (2) if such general conclusions existed then there would be no need to build a local repository; (3) no such general conclusions ever exist, according to many researchers. This article is a reply to these three arguments. Inspec keywords: software engineering; program testing; software management; resource allocation; data warehouses; data mining Subjects: Software engineering techniques; Other DBMS; Diagnostic, testing, debugging and evaluating systems C2 - 2004/// C3 - "International Workshop on Mining Software Repositories (MSR 2004)" W17S Workshop - 26th International Conference on Software Engineering DA - 2004/// DO - 10.1049/IC:20040480 PB - IEE SN - 086341432X UR - http://dx.doi.org/10.1049/IC:20040480 DB - Crossref ER - TY - CHAP TI - Agent-Based Abstractions for Software Development AU - Singh, Munindar P. T2 - Methodologies and Software Engineering for Agent Systems A2 - Bergenti, F. A2 - Gleizes, MP A2 - Zambonelli, F. T3 - Multiagent Systems, Artificial Societies, and Simulated Organizations AB - This chapter provides the historical and conceptual basis needed to fully appreciate the tools and techniques for agent-based software development. It begins with a review of the historical development of software technology from standalone to open systems. It discusses the major challenge of increasing complexity as software systems become larger and more open. The chapter presents the features of the agent metaphor that make it ideally suited for large-scale open systems development as well as the key technical abstractions that emerge from the agents metaphor and their ramifications on software practice. PY - 2004/// DO - 10.1007/1-4020-8058-1_2 SP - 5–18 PB - Springer SN - 1402080573 SV - 11 UR - http://dx.doi.org/10.1007/1-4020-8058-1_2 ER - TY - BOOK TI - The Practical Handbook of Internet Computing T2 - Chapman & Hall/CRC Computer & Information Science Series A3 - Singh, Munindar AB - The Practical Handbook of Internet Computing analyzes a broad array of technologies and concerns related to the Internet, including corporate intranets. Fresh and insightful articles by recognized experts address the key challenges facing Internet users, designers, integrators, and policymakers. In addition to discussing major applications, it also DA - 2004/9/29/ PY - 2004/9/29/ DO - 10.1201/9780203507223 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223 ER - TY - CHAP TI - Introduction to Web Semantics AU - Singh, Munindar T2 - The Practical Handbook of Internet Computing A2 - Singh, Munindar PY - 2004/9/29/ DO - 10.1201/9780203507223.ch29 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223.ch29 ER - TY - CHAP TI - Concepts and Practice of Personalization AU - Singh, Munindar AU - Aparicio, Manuel, IV T2 - The Practical Handbook of Internet Computing A2 - Singh, Munindar PY - 2004/9/29/ DO - 10.1201/9780203507223.ch18 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223.ch18 ER - TY - CHAP TI - A Hierarchical Model of Reference Affinity AU - Zhong, Yutao AU - Shen, Xipeng AU - Ding, Chen T2 - Languages and Compilers for Parallel Computing AB - To improve performance, data reorganization needs locality models to identify groups of data that have reference affinity. Much past work is based on access frequency and does not consider accessing time directly. In this paper, we propose a new model of reference affinity. This model considers the distance between data accesses in addition to the frequency. Affinity groups defined by this model are consistent and have a hierarchical structure. The former property ensures the profitability of data packing, while the latter supports data packing for storage units of different sizes. We then present a statistical clustering method that identifies affinity groups among structure fields and data arrays by analyzing training runs of a program. When used by structure splitting and array regrouping, the new method improves the performance of two test programs by up to 31%. The new data layout is significantly better than that produced by the programmer or by static compiler analysis. PY - 2004/// DO - 10.1007/978-3-540-24644-2_4 SP - 48-63 OP - PB - Springer Berlin Heidelberg SN - 9783540211990 9783540246442 UR - http://dx.doi.org/10.1007/978-3-540-24644-2_4 DB - Crossref ER - TY - CHAP TI - Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis AU - Kazar, Baris M. AU - Shekhar, Shashi AU - Lilja, David J. AU - Vatsavai, Ranga R. AU - Pace, R. Kelley T2 - Geographic Information Science AB - The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions for estimating SAR parameters are computationally expensive due to the need to compute all the eigenvalues of a very large matrix. Recently we developed a dense-exact parallel formulation of the SAR parameter estimation procedure using data parallelism and a hybrid programming technique. Though this parallel implementation showed scalability up to eight processors, the exact solution still suffers from high computational complexity and memory requirements. These limitations have led us to investigate approximate solutions for SAR model parameter estimation with the main objective of scaling the SAR model for large spatial data analysis problems. In this paper we present two candidate approximate-semi-sparse solutions of the SAR model based on Taylor series expansion and Chebyshev polynomials. Our initial experiments showed that these new techniques scale well for very large data sets, such as remote sensing images having millions of pixels. The results also show that the differences between exact and approximate SAR parameter estimates are within 0.7% and 8.2% for Chebyshev polynomials and Taylor series expansion, respectively, and have no significant effect on the prediction accuracy. PY - 2004/// DO - 10.1007/978-3-540-30231-5_10 SP - 140-161 OP - PB - Springer Berlin Heidelberg SN - 9783540235583 9783540302315 UR - http://dx.doi.org/10.1007/978-3-540-30231-5_10 DB - Crossref ER - TY - JOUR TI - Learning multi-label scene classification AU - Boutell, Matthew R. AU - Luo, Jiebo AU - Shen, Xipeng AU - Brown, Christopher M. T2 - Pattern Recognition AB - In classic pattern recognition problems, classes are mutually exclusive by definition. Classification errors occur when the classes overlap in the feature space. We examine a different situation, occurring when the classes are, by definition, not mutually exclusive. Such problems arise in semantic scene and document classification and in medical diagnosis. We present a framework to handle such problems and apply it to the problem of semantic scene classification, where a natural scene may contain multiple objects such that the scene can be described by multiple class labels (e.g., a field scene with a mountain in the background). Such a problem poses challenges to the classic pattern recognition paradigm and demands a different treatment. We discuss approaches for training and testing in this scenario and introduce new metrics for evaluating individual examples, class recall and precision, and overall accuracy. Experiments show that our methods are suitable for scene classification; furthermore, our work appears to generalize to other classification problems of the same nature. DA - 2004/9// PY - 2004/9// DO - 10.1016/j.patcog.2004.03.009 VL - 37 IS - 9 SP - 1757-1771 J2 - Pattern Recognition LA - en OP - SN - 0031-3203 UR - http://dx.doi.org/10.1016/j.patcog.2004.03.009 DB - Crossref KW - image understanding KW - semantic scene classification KW - multi-label classification KW - multi-label training KW - multi-label evaluation KW - image organization KW - cross-training KW - Jaccard similarity ER - TY - CONF TI - Adaptive data partition for sorting using probability distribution AU - Shen, X. AU - Ding, C. T2 - International Conference on Parallel Processing, 2004. ICPP 2004. AB - Many computing problems benefit from dynamic partition of data into smaller chunks with better parallelism and locality. However, it is difficult to partition all types of inputs with the same high efficiency. This paper presents a new partition method in sorting scenario based on probability distribution, an idea first studied by Janus and Lamagna in early 1980's on a mainframe computer. The new technique makes three improvements. The first is a rigorous sampling technique that ensures accurate estimate of the probability distribution. The second is an efficient implementation on modern, cache-based machines. The last is the use of probability distribution in parallel sorting. Experiments show 10-30% improvement in partition balance and 20-70% reduction in partition overhead, compared to two commonly used techniques. The new method reduces the parallel sorting time by 33-50% and outperforms the previous fastest sequential sorting technique by up to 30%. C2 - 2004/// C3 - International Conference on Parallel Processing, 2004. ICPP 2004. DA - 2004/// DO - 10.1109/icpp.2004.1327928 PB - IEEE SN - 0769521975 UR - http://dx.doi.org/10.1109/icpp.2004.1327928 DB - Crossref ER - TY - CONF TI - Array regrouping and structure splitting using whole-program reference affinity AU - Zhong, Yutao AU - Orlovich, Maksim AU - Shen, Xipeng AU - Ding, Chen T2 - the ACM SIGPLAN 2004 conference AB - While the memory of most machines is organized as a hierarchy, program data are laid out in a uniform address space. This paper defines a model of reference affinity, which measures how close a group of data are accessed together in a reference trace. It proves that the model gives a hierarchical partition of program data. At the top is the set of all data with the weakest affinity. At the bottom is each data element with the strongest affinity. Based on the theoretical model, the paper presents k-distance analysis, a practical test for the hierarchical affinity of source-level data. When used for array regrouping and structure splitting, k-distance analysis consistently outperforms data organizations given by the programmer, compiler analysis, frequency profiling, statistical clustering, and all other methods we have tried. C2 - 2004/// C3 - Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04 DA - 2004/// PY - 2004/// DO - 10.1145/996841.996872 SP - 255 PB - ACM Press SN - 1581138075 UR - http://dx.doi.org/10.1145/996841.996872 DB - Crossref ER - TY - CONF TI - Locality phase prediction AU - Shen, Xipeng AU - Zhong, Yutao AU - Ding, Chen T2 - the 11th international conference AB - As computer memory hierarchy becomes adaptive, its performance increasingly depends on forecasting the dynamic program locality. This paper presents a method that predicts the locality phases of a program by a combination of locality profiling and run-time prediction. By profiling a training input, it identifies locality phases by sifting through all accesses to all data elements using variable-distance sampling, wavelet filtering, and optimal phase partitioning. It then constructs a phase hierarchy through grammar compression. Finally, it inserts phase markers into the program using binary rewriting. When the instrumented program runs, it uses the first few executions of a phase to predict all its later executions.Compared with existing methods based on program code and execution intervals, locality phase prediction is unique because it uses locality profiles, and it marks phase boundaries in program code. The second half of the paper presents a comprehensive evaluation. It measures the accuracy and the coverage of the new technique and compares it with best known run-time methods. It measures its benefit in adaptive cache resizing and memory remapping. Finally, it compares the automatic analysis with manual phase marking. The results show that locality phase prediction is well suited for identifying large, recurring phases in complex programs. C2 - 2004/// C3 - Proceedings of the 11th international conference on Architectural support for programming languages and operating systems - ASPLOS-XI DA - 2004/// DO - 10.1145/1024393.1024414 PB - ACM Press SN - 1581138040 UR - http://dx.doi.org/10.1145/1024393.1024414 DB - Crossref ER - TY - CHAP TI - Implicit Versus Explicit Learning of Strategies in a Non-procedural Cognitive Skill AU - VanLehn, Kurt AU - Bhembe, Dumiszewe AU - Chi, Min AU - Lynch, Collin AU - Schulze, Kay AU - Shelby, Robert AU - Taylor, Linwood AU - Treacy, Don AU - Weinstein, Anders AU - Wintersgill, Mary T2 - Intelligent Tutoring Systems AB - University physics is typical of many cognitive skills in that there is no standard procedure for solving problems, and yet a few students still master the skill. This suggests that their learning of problem solving strategies is implicit, and that an effective tutoring system need not teach problem solving strategies as explicitly as model-tracing tutors do. In order to compare implicit vs. explicit learning of problem solving strategies, we developed two physics tutoring systems, Andes and Pyrenees. Pyrenees is a model-tracing tutor that teaches a problem solving strategy explicitly, whereas Andes uses a novel pedagogy, developed over many years of use in the field, that provides virtually no explicit strategic instruction. Preliminary results from an experiment comparing the two systems are reported. PY - 2004/// DO - 10.1007/978-3-540-30139-4_49 SP - 521-530 OP - PB - Springer Berlin Heidelberg SN - 9783540229483 9783540301394 UR - http://dx.doi.org/10.1007/978-3-540-30139-4_49 DB - Crossref ER - TY - JOUR TI - On tangible user interfaces, humans and spatiality AU - Sharlin, Ehud AU - Watson, Benjamin AU - Kitamura, Yoshifumi AU - Kishino, Fumio AU - Itoh, Yuichi T2 - Personal and Ubiquitous Computing DA - 2004/7/24/ PY - 2004/7/24/ DO - 10.1007/S00779-004-0296-5 VL - 8 IS - 5 J2 - Pers Ubiquit Comput LA - en OP - SN - 1617-4909 1617-4917 UR - http://dx.doi.org/10.1007/S00779-004-0296-5 DB - Crossref KW - Tangible user interfaces KW - Design heuristics KW - Spatial mappings KW - Affordances ER - TY - CHAP TI - Spatial Tangible User Interfaces for Cognitive Assessment and Training AU - Sharlin, Ehud AU - Itoh, Yuichi AU - Watson, Benjamin AU - Kitamura, Yoshifumi AU - Sutphen, Steve AU - Liu, Lili AU - Kishino, Fumio T2 - Biologically Inspired Approaches to Advanced Information Technology AB - This paper discusses Tangible User Interfaces (TUIs) and their potential impact on cognitive assessment and cognitive training. We believe that TUIs, and particularly a subset that we dub spatial TUIs, can extend human computer interaction beyond some of its current limitations. Spatial TUIs exploit human innate spatial and tactile ability in an intuitive and direct manner, affording interaction paradigms that are practically impossible using current interface technology. As proof-of-concept we examine implementations in the field of cognitive assessment and training. In this paper we use Cognitive Cubes, a novel TUI we developed, as an applied test bed for our beliefs, presenting promising experimental results for cognitive assessment of spatial ability, and possibly for training purposes. PY - 2004/// DO - 10.1007/978-3-540-27835-1_11 SP - 137-152 OP - PB - Springer Berlin Heidelberg SN - 9783540233398 9783540278351 UR - http://dx.doi.org/10.1007/978-3-540-27835-1_11 DB - Crossref ER - TY - JOUR TI - Deeper Inside PageRank AU - Langville, Amy AU - Meyer, Carl T2 - Internet Mathematics AB - This paper serves as a companion or extension to the "Inside PageRank" paper by Bianchini et al. [Bianchini et al. 03]. It is a comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, suggested alternatives to the traditional solution methods, sensitivity and conditioning, and finally the updating problem. We introduce a few new results, provide an extensive reference list, and speculate about exciting areas of future research. DA - 2004/1/1/ PY - 2004/1/1/ DO - 10.1080/15427951.2004.10129091 VL - 1 IS - 3 SP - 335-380 J2 - UINM LA - en OP - SN - 1542-7951 UR - http://dx.doi.org/10.1080/15427951.2004.10129091 DB - Crossref ER - TY - CHAP TI - Workshop on Social and Emotional Intelligence in Learning Environments AU - Frasson, Claude AU - Porayska-Pomsta, Kaska AU - Conati, Cristina AU - Gouarderes, Guy AU - Johnson, Lewis AU - Pain, Helen AU - Andre, Elisabeth AU - Bickmore, Tim AU - Brna, Paul AU - de Castro, Isabel Fernandez AU - Cerri, Stephano AU - Costa, Cleide Jane AU - Lester, James AU - Lisetti, Christine AU - Marsella, Stacy AU - Mostow, Jack AU - Nkambou, Roger AU - Ochs, Magalie AU - Paiva, Ana AU - Paraguacu, Fabio AU - Person, Natalie AU - Picard, Rosalind AU - Sidner, Candice AU - de Vicente, Angel T2 - Intelligent Tutoring Systems AB - It has been long recognised in education that teaching and learning is a highly social and emotional activity. Students’ cognitive progress depends on their psychological predispositions such as their interest, confidence, sense of progress and achievement as well as on social interactions with their teachers and peers who provide them (or not) with both cognitive and emotional support. Until recently the ability to recognise students’ socio-affective needs constituted exclusively the realm of human tutors’ social competence. However, in recent years and with the development of more sophisticated computer-aided learning environments, the need for those environments to take into account the student’s affective states and traits and to place them within the context of the social activity of learning has become an important issue in the domain of building intelligent and effective learning environments. More recently, the notion of emotional intelligence has attracted increasing attention as one of tutors’ pre-requisites for improving students’ learning. PY - 2004/// DO - 10.1007/978-3-540-30139-4_125 SP - 913-913 OP - PB - Springer Berlin Heidelberg SN - 9783540229483 9783540301394 UR - http://dx.doi.org/10.1007/978-3-540-30139-4_125 DB - Crossref ER - TY - CHAP TI - Dialogue Management for Conversational Case-Based Reasoning AU - Branting, Karl AU - Lester, James AU - Mott, Bradford T2 - Lecture Notes in Computer Science AB - Two key objectives of conversational case-based reasoning (CCBR) systems are (1) eliciting case facts in a manner that minimizes the user’s burden in terms of resources such as time, information cost, and cognitive load, and (2) integrating CBR with other problem solving modalities. This paper proposes an architecture that addresses both these goals by integrating CBR with a discourse-oriented dialogue engine. The dialogue engine determines when CBR or other problem-solving techniques are needed to achieve pending discourse goals. Conversely, the CBR component has the full resources of a dialogue engine to handle topic changes, interruptions, clarification questions by either the user or the system, and other speech acts that arise in problem-solving dialogues. PY - 2004/// DO - 10.1007/978-3-540-28631-8_7 SP - 77-90 OP - PB - Springer Berlin Heidelberg SN - 9783540228820 9783540286318 UR - http://dx.doi.org/10.1007/978-3-540-28631-8_7 DB - Crossref ER - TY - CONF TI - Approximate factorization of multivariate polynomials via differential equations AU - Gao, Shuhong AU - Kaltofen, Erich AU - May, John AU - Yang, Zhengfeng AU - Zhi, Lihong T2 - the 2004 international symposium AB - The input to our algorithm is a multivariate polynomial, whose complex rational coefficients are considered imprecise with an unknown error that causes f to be irreducible over the complex numbers C. We seek to perturb the coefficients by a small quantitity such that the resulting polynomial factors over C. Ideally, one would like to minimize the perturbation in some selected distance measure, but no efficient algorithm for that is known. We give a numerical multivariate greatest common divisor algorithm and use it on a numerical variant of algorithms by W. M. Ruppert and S. Gao. Our numerical factorizer makes repeated use of singular value decompositions. We demonstrate on a significant body of experimental data that our algorithm is practical and can find factorizable polynomials within a distance that is about the same in relative magnitude as the input error, even when the relative error in the input is substantial (10-3). C2 - 2004/// C3 - Proceedings of the 2004 international symposium on Symbolic and algebraic computation - ISSAC '04 DA - 2004/// DO - 10.1145/1005285.1005311 PB - ACM Press SN - 158113827X UR - http://dx.doi.org/10.1145/1005285.1005311 DB - Crossref ER - TY - JOUR TI - On SAT instance classes and a method for reliable performance experiments with SAT solvers AU - Brglez, Franc AU - Li, Xiao Yu AU - Stallmann, Matthias F. T2 - Annals of Mathematics and Artificial Intelligence DA - 2004/12/31/ PY - 2004/12/31/ DO - 10.1007/s10472-004-9417-0 VL - 43 IS - 1-4 SP - 1-34 J2 - Ann Math Artif Intell LA - en OP - SN - 1012-2443 1573-7470 UR - http://dx.doi.org/10.1007/s10472-005-0417-5 DB - Crossref ER - TY - CHAP TI - Adding AI to Web Services AU - Petrie, Charles AU - Genesereth, Michael AU - Bjornsson, Hans AU - Chirkova, Rada AU - Ekstrom, Martin AU - Gomi, Hidehito AU - Hinrichs, Tim AU - Hoskins, Rob AU - Kassoff, Michael AU - Kato, Daishi AU - Kawazoe, Kyohei AU - Min, Jung Ung AU - Mohsin, Waqar T2 - Agent-Mediated Knowledge Management AB - The FX-Project consisted of members of the Stanford Logic Group industrial visitors from NEC and Intec Web & Genome working together to develop a new technologies based upon the combination of web services and techniques from artificial intelligence using our experience in AI-based software agents. This two-year project ran from April of 2001 until the end of March 2002 and explored the then emerging functionality of web services. This paper is a result of our findings. PY - 2004/// DO - 10.1007/978-3-540-24612-1_23 SP - 322-338 OP - PB - Springer Berlin Heidelberg SN - 9783540208686 9783540246121 UR - http://dx.doi.org/10.1007/978-3-540-24612-1_23 DB - Crossref ER - TY - JOUR TI - GRAMY: A geometry theorem prover capable of construction AU - Matsuda, N. AU - Vanlehn, K. T2 - Journal of Automated Reasoning DA - 2004/// PY - 2004/// DO - 10.1023/B:JARS.0000021960.39761.b7 VL - 32 IS - 1 SP - 3-33 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-3543078258&partnerID=MN8TOARS KW - automated geometry theorem proving KW - construction KW - search control KW - constraint satisfaction problem KW - intelligent tutoring system ER - TY - BOOK TI - Trustworthy service caching: Cooperative search in P2P information systems AU - Udupi, Y.B. AU - Yolum, P. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3030 SE - 32-44 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-7444260312&partnerID=MN8TOARS ER - TY - CONF TI - Toward autonomic Web services trust and selection AU - Maximilien, E.M. AU - Singh, M.P. C2 - 2004/// C3 - ICSOC '04: Proceedings of the Second International Conference on Service Oriented Computing DA - 2004/// SP - 212-221 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-20444480301&partnerID=MN8TOARS ER - TY - BOOK TI - Service graphs for building trust AU - Yolum, P. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3290 SE - 509-525 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33846960261&partnerID=MN8TOARS ER - TY - CONF TI - Self-organizing referral networks: A process view of trust and authority AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2977 SP - 195-211 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144450099&partnerID=MN8TOARS ER - TY - CONF TI - Resolving commitments among autonomous agents AU - Mallya, A.U. AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2922 SP - 166-182 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-23144454066&partnerID=MN8TOARS ER - TY - CONF TI - Protocols for processes: Programming in the large for open systems (extended abstract) AU - Singh, M.P. AU - Chopra, A.K. AU - Desai, N.V. AU - Mallya, A.U. AB - The modeling and enactment of business processes is being recognized as key to modern information management. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their autonomy (freedom of action), heterogeneity (freedom of design), and dynamism (freedom of configuration). C2 - 2004/// C3 - Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA DA - 2004/// DO - 10.1145/1028664.1028712 SP - 120-123 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79951747233&partnerID=MN8TOARS ER - TY - CONF TI - Mapping Dooley graphs and commitment causality to the π-calculus AU - Wan, F. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 1 SP - 412-419 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544296343&partnerID=MN8TOARS ER - TY - JOUR TI - Developing trust in large-scale peer-to-peer systems T2 - IEEE 1ST SYMPOSIUM ON MULTI-AGENT SECURITY & SURVIVABILITY AB - In peer-to-peer (P2P) systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. A peer needs reputation mechanisms to incorporate the knowledge of others to decide whether to trust another party in P2P systems. This paper discusses the design of reputation mechanisms and proposes a distributed reputation mechanism to detect malicious or unreliable peers in P2P systems. It illustrates the process for rating gathering and aggregation and presents some experimental results to evaluate the proposed approach. Moreover, it considers how to effectively aggregate noisy (dishonest or inaccurate) ratings from independent or collusive peers using weighted majority techniques. Furthermore, it analyzes some possible attacks on reputation mechanisms and shows how to defend against such attacks. DA - 2004/// PY - 2004/// DO - 10.1109/MASSUR.2004.1368412 UR - https://publons.com/publon/21294484/ ER - TY - CONF TI - Commitments for flexible business processes AU - Chopra, A.K. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1362-1363 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544335679&partnerID=MN8TOARS ER - TY - CONF TI - Protocol-based business process modeling and enactment AU - Desai, N. AU - Singh, M.P. AB - Business processes are conventionally modeled as monolithic flows that capture the desired business logic. However, developing process flows is challenging. Because a flow specifies what its participants should do, it restricts the autonomy of its participants, thus limiting their ability to exploit opportunities or accommodate exceptions according to their business preferences. We take a dual perspective wherein business processes are modeled as compositions of (instantiated) business protocols. Each business protocol specifies interactions among its partners; each protocol serves a unique business purpose, e.g., processing a payment or shipping an item. Thus, modularizing a monolithic business process via business protocols allows clear separation of concerns for modeling and enacting the process. We develop an approach in which protocols are compiled into local skeletal flows for each participant that can be fleshed out with local business logic as needed. Such flows are naturally distributed but can be enacted using commercial business flow engines. Thus, our protocol-based approach combines the benefit of improved modeling with simplified implementations. C2 - 2004/// C3 - Proceedings - IEEE International Conference on Web Services DA - 2004/// DO - 10.1109/ICWS.2004.1314721 SP - 35-42 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4744344972&partnerID=MN8TOARS ER - TY - CONF TI - Nonmonotonic commitment machines AU - Chopra, A. AU - Singh, M.P. C2 - 2004/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2004/// VL - 2922 SP - 183-200 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-22944442324&partnerID=MN8TOARS ER - TY - CONF TI - Developing trust in large-scale peer-to-peer systems AU - Yu, B. AU - Singh, M.P. AU - Sycara, K. C2 - 2004/// C3 - 2004 IEEE 1st Symposium on Multi-Agent Security and Survivability DA - 2004/// SP - 1-10 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-17644415405&partnerID=MN8TOARS ER - TY - BOOK TI - Deriving efficient SQL sequences via read-aheads AU - Bilgin, A.S. AU - Chirkova, R.Y. AU - Salo, T.J. AU - Singh, M.P. DA - 2004/// PY - 2004/// VL - 3181 SE - 299-308 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35048847119&partnerID=MN8TOARS ER - TY - CONF TI - Business Process Management: A Killer App for Agents? AU - Singh, Munindar P. C2 - 2004/7// C3 - Proceedings of the 3rd International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS) DA - 2004/7// VL - 1 SP - 26 PB - ACM Press UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544340500&partnerID=MN8TOARS ER - TY - CONF TI - Agent-based peer-to-peer service networks: A study of effectiveness and structure evolution AU - Udupi, Y.B. AU - Yolum, P. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1336-1337 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544299541&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing commitment protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1364-1365 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544385537&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing business protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2004/// C3 - Thirteenth International World Wide Web Conference Proceedings, WWW2004 DA - 2004/// SP - 1040-1041 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-19944421093&partnerID=MN8TOARS ER - TY - CONF TI - A dynamic pricing mechanism for P2P referral systems AU - Yu, B. AU - Li, C. AU - Singh, M.P. AU - Sycara, K. C2 - 2004/// C3 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 DA - 2004/// VL - 3 SP - 1426-1427 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544301282&partnerID=MN8TOARS ER - TY - JOUR TI - Agent-based service selection AU - Sreenath, R.M. AU - Singh, M.P. T2 - Web Semantics AB - The current infrastructure for Web services supports service discovery based on a common repository. However, the key challenge is not discovery but selection: ultimately, the service user must select one good provider. Whereas service descriptions are given from the perspective of providers, service selection must take the perspective of users. In this way, service selection involves pragmatics, which builds on but is deeper than semantics. Current approaches provide no support for this challenge. Importantly, service selection differs significantly from product selection, which is the problem addressed by traditional product recommender approaches. The assumptions underlying product recommender approaches do not hold for services. For example a vendor site knows of all product purchases made at it, whereas a service registry does not know of the service episodes that may involve services discovered from it. Also, traditional approaches assume that users are willing to reveal their evaluations to each vendor site. This paper formulates the problem of service selection. It reformulates two traditional recommender approaches for service selection and proposes a new agent-based approach in which agents cooperate to evaluate service providers. In this approach, the agents rate each other, and autonomously decide how much to weigh each other’s recommendations. The underlying algorithm with which the agents reason is developed in the context of a concept lattice, which enables finding relevant agents. Since large service selection datasets do not yet exist, for the purposes of evaluation, we reformulate the well-known product evaluations dataset MovieLens as a services dataset. We use it to compare the various approaches. Despite limiting the flow of information, the proposed approach compares well with the existing approaches in terms of some accuracy metrics defined within. DA - 2004/// PY - 2004/// DO - 10.1016/j.websem.2003.11.006 VL - 1 IS - 3 SP - 261-279 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-32544455685&partnerID=MN8TOARS ER - TY - CONF TI - A Semantic Approach for Designing E-Business Protocols AU - Mallya, Ashok U. AU - Singh, Munindar P. AB - Business processes involve interactions among autonomous partners. We propose that these interactions be specified modularly as protocols. Protocols can be published, enabling implementors to independently develop components that respect published protocols and yet serve diverse interests. A variety of business protocols would be needed to capture subtle business needs. We propose that the same kinds of conceptual abstractions be developed for protocols as for information models. Specifically, we consider (1) refinement: a subprotocol may satisfy the requirements of a superprotocol, but support additional properties; and (2) aggregation: a protocol may combine existing protocols. In support of the above, this paper develops a semantics of protocols and an operational characterization of them. This supports judgments about the potential subclass-superclass relations between protocols, which are a result of protocol refinement. It also enables protocol aggregation by splicing a protocol into another protocol. C2 - 2004/// C3 - Proceedings of the 2nd International Conference on Web Services (ICWS) DA - 2004/// DO - 10.1109/ICWS.2004.1314807 SP - 742–745 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4544282690&partnerID=MN8TOARS ER - TY - CONF TI - A DAML-based repository for QoS-aware semantic Web service selection AU - Bilgin, A.S. AU - Singh, M.P. AB - The Web is moving toward a collection of interoperating Web services. Achieving this interoperability requires dynamic discovery of Web services on the basis of their capabilities. The capability of a service can be properly determined by using not only its functional description (or service interface), but also its quality attributes as judged by previous users of the service. We develop a service repository that extends UDDI registries. This repository combines an ontology of attributes with evaluation data. We base our repository on a new query and manipulation language based on DAML. Our language includes support for a rich set of operations, which are needed to maintain an attribute ontology, publish services, rate services, and select services based on their functional attributes as well as evaluations by others. We have implemented our approach and evaluated its practical completeness via a number of key query and manipulation templates. C2 - 2004/// C3 - Proceedings - IEEE International Conference on Web Services DA - 2004/// DO - 10.1109/ICWS.2004.1314759 SP - 368-375 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4744366399&partnerID=MN8TOARS ER - TY - JOUR TI - Computational intelligence: Preface AU - Junker, U. AU - Delgrande, J. AU - Doyle, J. AU - Rossi, F. AU - Schaub, T. T2 - Computational Intelligence DA - 2004/// PY - 2004/// VL - 20 IS - 2 SP - 109-110 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2442596050&partnerID=MN8TOARS ER - TY - JOUR TI - Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem AU - Brglez, Franc AU - Li, Xiao Y AU - Stallmann, Matthias F AU - Militzer, Burkhard T2 - Information Sciences DA - 2004/// PY - 2004/// ER - TY - CONF TI - Sangam: A distributed pair-programming plugin for Eclipse AU - Ho, Chih-Wei AU - Raha, Somik AU - Gehringer, Edward AU - Williams, Laurie T2 - The 2004 OOPSLA Eclipse Technology Exchange AB - In pair programming, two programmers traditionally work side-by-side at one computer. However, in globally distributed organizations, long-distance collaboration is frequently necessary. Sangam is an Eclipse plug-in that allows Eclipse users in different locations to share a workspace so that they may work as if they were using the same computer. In this paper, we discuss the Sangam plug-in, and our experience developing it via distributed and collocated pair programming. C2 - 2004/// C3 - Proceedings of the 2004 OOPSLA workshop on eclipse technology eXchange - eclipse '04 CY - Vancouver, BC DA - 2004/// PY - 2004/10// DO - 10.1145/1066129.1066144 PB - ACM Press UR - http://dx.doi.org/10.1145/1066129.1066144 ER - TY - CONF TI - On the relative advantages of teaching Web services in J2EE vs. .NET AU - Kachru, Sandeep AU - Gehringer, Edward F. T2 - OOPSLA 2004 Educators' Symposium C2 - 2004/// C3 - Proceedings of the OOPSLA 2004 Educators' Symposium CY - Vancouver, BC DA - 2004/// PY - 2004/10/24/ ER - TY - CONF TI - Vitri: A framework for environmental decision support on heterogeneous computer networks AB - Vitri is an object-oriented framework implemented in Java for high-performance distributed computing. Using Vitri, applications can engage in cooperative problem solving by dividing their tasks among heterogeneous clusters of workstations and PCs. Vitri's features include basic support for distributed computing and communication, as well as visual tools for evaluating run-time performance, and modules for heuristic optimization. It balances loads dynamically using a client-side task pool, allows the addition or removal of servers dating a run, and provides fault tolerance transparently for servers and networks. Among its more powerful features are modules for heuristic optimization, including an asynchronous global-parallel genetic algorithm that is particularly suited for coarse-grained tasks executing on processors with large variations in processor speeds. By using dataflow techniques, in which computations are explicitly based on the availability and forwarding of data, the usual end-of-generation synchronization points are removed from the algorithm. Results are presented for illustrative applications in water distribution network design and air quality management. C2 - 2004/// C3 - Bridging the Gap: Meeting the World's Water and Environmental Resources Challenges - Proceedings of the World Water and Environmental Resources Congress 2001 DA - 2004/// DO - 10.1061/40569(2001)111 VL - 111 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75649149870&partnerID=MN8TOARS ER - TY - CONF TI - Method for least cost design of looped pipe networks for different levels of redundancy using genetic algorithms AU - Kumar, S.V. AU - Doby, T.A. AU - Baugh, J.W. AU - Brill, E.D. AU - Ranjithan, S.R. AB - A new method is proposed for the least cost design of looped piped networks under various levels of redundancy using a genetic algorithm. Various levels of redundancy can be obtained by considering the number of pipes to be taken out of service at any one time. As a result, a tradeoff curve of redundancy and cost can be developed. The approach is being extended to consider different measures of redundancy as well as other performance criteria. Such extensions are more computationally demanding and are therefore being implemented using a distributed GA. C2 - 2004/// C3 - Joint Conference on Water Resource Engineering and Water Resources Planning and Management 2000: Building Partnerships DA - 2004/// DO - 10.1061/40517(2000)201 VL - 104 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-74949091879&partnerID=MN8TOARS ER - TY - CONF TI - Genetic algorithm search for least cost design of looped pipe networks using age as a quality surrogate and different levels of redundancy AU - Doby, T.A. AU - Kumar, S.V. AU - Baugh, J.W. AU - Brill, E.D. AU - Ranjithan, S.R. AB - A genetic algorithm- (GA-) based method is being investigated for determining the least cost design of looped networks while considering the residence time of the water in the network as a quality surrogate and various levels of redundancy. The conflict among the three design objectives, i.e., cost, redundancy, and water quality, is examined via multiobjective analysis. C2 - 2004/// C3 - Bridging the Gap: Meeting the World's Water and Environmental Resources Challenges - Proceedings of the World Water and Environmental Resources Congress 2001 DA - 2004/// DO - 10.1061/40569(2001)387 VL - 111 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75649129137&partnerID=MN8TOARS ER - TY - CONF TI - On understanding compatibility of student pair programmers AU - Katira, Neha AU - Williams, Laurie AU - Wiebe, Eric AU - Miller, Carol AU - Balik, Suzanne AU - Gehringer, Ed T2 - the 35th SIGCSE technical symposium C2 - 2004/// C3 - Proceedings of the 35th SIGCSE technical symposium on Computer science education - SIGCSE '04 DA - 2004/// DO - 10.1145/971300.971307 PB - ACM Press SN - 1581137982 UR - http://dx.doi.org/10.1145/971300.971307 DB - Crossref ER - TY - CHAP TI - Shape representation with flexible skew-symmetric distributions AU - Baloch, S. H. AU - Krim, H. AU - Genton, M. G. T2 - Skew-elliptical distibutions and their applications: A journey beyond normality PY - 2004/// DO - 10.1201/9780203492000.ch17 PB - Boca Raton, FL: Chapman & Hall/CRC SN - 1584884312 ER - TY - JOUR TI - Enforcing safety of real-time schedules on contemporary processors using a virtual simple architecture (VISA) AU - Anantaraman, A AU - Seth, K AU - Rotenberg, E AU - Mueller, F T2 - 25TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS AB - Determining safe and tight upper bounds on the worst-case execution time (WCET) of hard real-time tasks running on contemporary microarchitectures is a difficult problem. Current trends in microarchitecture design have created a complexity wall: by enhancing performance through ever more complex architectural features, systems have become increasingly hard to analyze. This paper extends a framework, introduced previously as virtual simple architecture (VISA), to multitasking real-time systems. The objective of VISA is to obviate the need to statically analyze complex processors by instead shifting the burden of guaranteeing deadlines - in part - onto the hardware. The VISA framework exploits a complex processor that ordinarily operates with all of its advanced features enabled, called the complex mode, but which can also be downgraded to a simple mode by gating off the advanced features. A WCET bound is statically derived for a task assuming the simple mode. However, this abstraction is speculatively undermined at run-time by executing the task in the complex mode. The task's progress is continuously gauged to detect anomalous cases in which the complex mode underperforms, in which case the processor switches to the simple mode to explicitly enforce the overall contractual WCET. The processor typically operates in complex mode, generating significant slack, and the VISA safety mechanism ensures bounded timing in atypical cases. Extra slack can be exploited for reducing power consumption and/or enhancing functionality. By extending VISA from single-task to multi-tasking systems, this paper reveals the full extent of VISA'S powerful abstraction capability. Key missing pieces are filled in: (1) preserving integrity of the gauging mechanism despite disruptions caused by preemptions; (2) demonstrating compatibility with arbitrary scheduling and dynamic voltage scaling (DVS) policies; (3) formally describing VISA speculation overheads in terms of padding tasks' WCETs; and (4) developing a systematic method for minimizing these overheads. We also propose a VISA variant that dynamically accrues the slack needed to facilitate speculation in the complex mode, eliminating the need to statically pad WCETs and thereby enabling VISA-style speculation even in highly-utilized systems. DA - 2004/// PY - 2004/// DO - 10.1109/real.2004.19 SP - 114-125 SN - 1052-8725 ER - TY - JOUR TI - Reconfiguration of traffic grooming optical networks AU - Mahalati, R AU - Dutta, R T2 - FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS AB - Advances in optical data transmission and optical signal routing have caused wide expectation for optical networks to form tomorrow's backbone transport. One attractive feature of these networks is the ability to reconfigure the logical topology of the network seen by higher layers with comparative ease and speed by reconfiguring optical switches, without the need to modify the physical topology of the network. On the other hand, with the current mismatch of bandwidth available from individual wavelength channels and typical bandwidth demands, it is also widely recognized that grooming of subwavelength traffic into the full-wavelength channels is an indispensable component of optical network design. The topic of reconfiguration in optical networks that carry subwavelength traffic has received comparatively little attention. In this paper, we consider this problem. Our main contributions are as follows. We discuss the common basis on which grooming effectiveness and reconfiguration efficiency can be considered, and develop a reconfiguration cost function in keeping with this consideration. We formulate the joint problem of reconfiguration and grooming precisely, and offer a heuristic as well as an exact solution method to solve this problem. In offering numerical simulation results for our algorithms, we make the important observation that a disjoint sequential consideration of the two problems leads to solutions that are very inefficient in the joint sense. DA - 2004/// PY - 2004/// DO - 10.1109/broadnets.2004.72 SP - 170-179 ER - TY - JOUR TI - Incentive mechanisms for peer-to-peer systems AU - Yu, B. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Most of the existing research in peer-to-peer systems focuses on protocol design and doesn’t consider the rationality of each peer. One phenomenon that should not be ignored is free riding. Some peers simply consume system resources but contribute nothing to the system. In this paper we present an agent-based peer-to-peer system, in which each peer is a software agent and the agents cooperate to search the whole system through referrals. We present a static and a dynamic pricing mechanism to motivate each agent to behave rationally while still achieving good overall system performance. We study the behavior of the agents under two pricing mechanisms and evaluate the impact of free riding using simulations. CN - TK5105.525 .A615 2002 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-25840-7_9 VL - 2872 SP - 77–88 UR - https://publons.com/publon/21294483/ ER - TY - JOUR TI - A requirements taxonomy for reducing Web site privacy vulnerabilities AU - Anton, AI AU - Earp, JB T2 - REQUIREMENTS ENGINEERING DA - 2004/8// PY - 2004/8// DO - 10.1007/s00766-003-0183-z VL - 9 IS - 3 SP - 169-185 SN - 1432-010X KW - privacy requirements KW - security requirements ER - TY - JOUR TI - The alternative splicing gallery (ASG): bridging the gap between genome and transcriptome AU - Leipzig, J. AU - Pevzner, P. AU - Heber, Steffen T2 - Nucleic Acids Research DA - 2004/// PY - 2004/// DO - 10.1039/nar/gkh731 VL - 32 IS - 13 SP - 3977–3983 ER - TY - JOUR TI - Misuse and abuse cases: Getting past the positive AU - Hope, P AU - McGraw, G AU - Anton, AI T2 - IEEE SECURITY & PRIVACY AB - Software development is all about making software do something: when software vendors sell their products, they talk about what the products do to make customers' lives easier, such as encapsulating business processes or something similarly positive. Following this trend, most systems for designing software also tend to describe positive features. The authors provide a nonacademic introduction to the software security best practice of misuse and abuse cases, showing you how to put the basic science to work. DA - 2004/// PY - 2004/// DO - 10.1109/MSP.2004.17 VL - 2 IS - 3 SP - 90-92 SN - 1558-4046 ER - TY - JOUR TI - Lecture hall theorems, q-series and truncated objects AU - Corteel, S AU - Savage, CD T2 - JOURNAL OF COMBINATORIAL THEORY SERIES A AB - We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q -Chu Vandermonde identities, once an appropriate recurrence is derived. We use this approach to get new lecture hall-type theorems for truncated objects. The truncated lecture hall partitions are sequences ( λ 1 , … , λ k ) such that λ 1 n ⩾ λ 2 n - 1 ⩾ ⋯ ⩾ λ k n - k + 1 ⩾ 0 and we show that their generating function is ∑ m = 0 k n m q q m + 1 2 ( - q n - m + 1 ; q ) m ( q 2 n - m + 1 ; q ) m . From this, we are able to give a combinatorial characterization of truncated lecture hall partitions and new finite versions of refinements of Euler's theorem. The truncated anti-lecture hall compositions are sequences ( λ 1 , … , λ k ) such that λ 1 n - k + 1 ⩾ λ 2 n - k + 2 ⩾ ⋯ ⩾ λ k n ⩾ 0 . We show that their generating function is n k q ( - q n - k + 1 ; q ) k ( q 2 ( n - k + 1 ) ; q ) k , giving a finite version of a well-known partition identity. We give two different multivariate refinements of these new results: the q -calculus approach gives ( u , v , q ) -refinements, while a completely different approach gives odd / even ( x , y ) -refinements. DA - 2004/11// PY - 2004/11// DO - 10.1016/j.jcta.2004.05.006 VL - 108 IS - 2 SP - 217-245 SN - 1096-0899 KW - integer partitions KW - integer compositions KW - enumeration ER - TY - JOUR TI - Transaction policies for service-oriented computing AU - Tai, S AU - Mikalsen, T AU - Wohlstadter, E AU - Desai, N AU - Rouvellou, I T2 - DATA & KNOWLEDGE ENGINEERING AB - Service-oriented computing is emerging as a distributed computing model where autonomous services interact with each other using standard Internet technology. In addition to the application-specific functions that services provide (different) services may also support (different) sets of protocols and formats addressing extra-functional concerns such as transaction processing and reliable messaging. This raises the need for services to complement their functional service descriptions with descriptions of extra-functional capabilities, requirements, and/or preferences, which must be matched and enforced for service interactions. In this paper, we address the problem of transactional coordination in service-oriented computing. We argue for the use of declarative policy assertions to advertise and match support for different transaction styles (direct transaction processing, queued transaction processing, and compensation-based transaction processing), and introduce the concept of and system support for transaction coupling modes as the policy-based contracts guiding transactional business process execution. We focus on concrete, protocol-specific policies that apply to relevant Web services specifications. Using transaction policies and our middleware system, we are able to support a reliable SOC environment. DA - 2004/10// PY - 2004/10// DO - 10.1016/j.datak.2003.03.001 VL - 51 IS - 1 SP - 59-79 SN - 1872-6933 KW - service-oriented computing KW - transactional coordination KW - declarative policy assertions ER - TY - JOUR TI - Service graphs for building trust AU - Yolum, P. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Information systems must establish trust to cooperate effectively in open environments. We are developing an agent-based approach for establishing trust, where information systems are modeled as agents that provide and consume services. Agents can help each other find trustworthy parties by providing referrals to those that they trust. We propose a graph-based representation of services for modeling the trustworthiness of agents. This representation captures natural relationships among service domains and provides a simple means to accommodate the accrual of trust placed in a given party. When interpreted as a lattice, it enables less important services (e.g., low-value transactions) to be used as gates to more important services (e.g., high-value transactions). We first show that, where applicable, this approach yields superior efficiency (needs fewer messages) and effectiveness (finds more providers) than a vector representation that does not capture the relationships between services. Next, we study trade-offs between various factors that affect the performance of this approach. CN - [Electronic Resource] DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-30468-5_32 VL - 3290 SP - 509–525 UR - https://publons.com/publon/13073985/ ER - TY - JOUR TI - Protocols for processes AU - Singh, Munindar P. AU - Chopra, Amit K. AU - Desai, Nirmit AU - Mallya, Ashok U. T2 - ACM SIGPLAN Notices AB - The modeling and enactment of business processes is being recognized as key to modern information managment. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their autonomy (freedom of action), heterogeneity (freedom of design), and dynamism (freedom of configuration).Flexibly represented protocols can provide a more natural basis for specifying processes. Protocols specify what rather than how ; thus they naturally maximize the authonomy, heterogeneity, and dynamism of the interacting parties. We are developing an approach for modeling and enacting business processes based on protocols. This paper describes some elements of (1) a conceptual model of processes that will incorporate abstractions based on protocols, roles, and commitments; (2)the semantics or mathematical foundations underlying the conceptual model and mapping global views of processes to the local actions of the parties involved; (3) methodologies involving rule-based reasoning to specify processes in terms of compositions of protocols. DA - 2004/12/1/ PY - 2004/12/1/ DO - 10.1145/1052883.1052893 VL - 39 IS - 12 SP - 73 J2 - SIGPLAN Not. LA - en OP - SN - 0362-1340 UR - http://dx.doi.org/10.1145/1052883.1052893 DB - Crossref KW - standardization KW - languages KW - design KW - open systems KW - interaction protocols KW - business processes ER - TY - JOUR TI - Manipulation of microenvironment with a built-in electrochemical actuator in proximity of a dissolved oxygen microsensor AU - Kim, CS AU - Lee, CH AU - Fiering, JO AU - Ufer, S AU - Scarantino, CW AU - Nagle, HT T2 - IEEE SENSORS JOURNAL AB - Biochemical sensors for continuous monitoring require dependable periodic self diagnosis with acceptable simplicity to check its functionality during operation. An in-situ self-diagnostic technique for a dissolved oxygen microsensor is proposed in an effort to devise an intelligent microsensor system with an integrated electrochemical actuation electrode. With a built-in platinum microelectrode that surrounds the microsensor, two kinds of microenvironments, called the oxygen-saturated or oxygen-depleted phases, can be created by water electrolysis, depending on the polarity. The functionality of the microsensor can be checked during these microenvironment phases. The polarographic oxygen microsensor is fabricated on a flexible polyimide substrate (Kapton) and the feasibility of the proposed concept is demonstrated in a physiological solution. The sensor responds properly during the oxygen-generating and oxygen-depleting phases. The use of these microenvironments for in-situ self-calibration is discussed to achieve functional integration, as well as structural integration, of the microsensor system. DA - 2004/10// PY - 2004/10// DO - 10.1109/JSEN.2004.832857 VL - 4 IS - 5 SP - 568-575 SN - 1558-1748 KW - electrolysis KW - intelligent microsensor KW - polyimide KW - self calibration KW - self diagnosis ER - TY - BOOK TI - Intrusion detection in distributed systems: An abstraction-based approach AU - Ning, P. AU - Jajodia, S. AU - Wang, S. CN - TK5105.59 .N35 2004 DA - 2004/// PY - 2004/// PB - Boston: Kluwer Academic Publishers SN - 140207624X ER - TY - JOUR TI - Financial privacy policies and the need for standardization AU - Anton, AI AU - Earp, JB AU - He, QF AU - Stufflebeam, W AU - Bolchini, D AU - Jensen, C T2 - IEEE SECURITY & PRIVACY AB - The authors analyze 40 online privacy policy documents from nine financial institutions to examine their clarity and readability. Their findings show that compliance with the existing legislation and standards is, at best, questionable. DA - 2004/// PY - 2004/// DO - 10.1109/MSECP.2004.1281243 VL - 2 IS - 2 SP - 36-45 SN - 1558-4046 ER - TY - JOUR TI - Deriving efficient SQL sequences via read-aheads AU - Bilgin, A. S. AU - Chirkova, R. Y. AU - Salo, T. J. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Modern information system architectures place applications in an application server and persistent objects in a relational database. In this setting, we consider the problem of improving application throughput; our proposed solution uses data prefetching (read-aheads) to minimize the total data-access time of an application, in a manner that affects neither the application code nor the backend DBMS. Our methodology is based on analyzing and automatically merging SQL queries to produce query sequences with low total response time, in ways that exploit the application’s data-access patterns. The proposed approach is independent of the application domain and can be viewed as a component of container managed persistence that can be implemented in middleware. This paper describes our proposed framework for using generic data-access patterns to improve application throughput and reports preliminary experimental results on discovering key parameters that influence the trade-offs in producing efficient merged SQL queries. The approach is evaluated in the context of a financial domain, which yields the kinds of natural conceptual relationships where our approach is valuable. CN - QA76.9 .D37 D396 2004 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-30076-2_30 VL - 3181 SP - 299–308 UR - https://publons.com/publon/21294482/ ER - TY - CHAP TI - Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets AU - Abdulla, P. AU - Mahata, P. AU - Mayr, R. T2 - FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science: 24th international conference, Chennai, India, December 16-18, 2004: Proceedings (Lecture notes in computer science ; 3328) A2 - K. Lodaya, A2 - Mahajan, M. CN - QA76.758 .C684 2004 PY - 2004/// VL - 3328 SP - 58-70 PB - Berlin; New York: Springer SN - 3540240586 ER - TY - CHAP TI - Scanning tunneling microscope-quartz crystal microbalance studies of "real world" and model lubricants AU - Krim, J. AU - Abdelmaksoud, M. AU - Borovsky, B. AU - Winder, S. M. T2 - Dynamics and friction of submicrometer confining systems AB - Applications of the Quartz Crystal Microbalance (QCM) for studies of tribology at atomistic time and length scales are described herein. Employing QCM as the sole technique, we report measurements on vapor phase lubricants for "real world" applications, and rare-gas systems that are of more fundamental interest. We also report on QCM measurements that have been recorded in conjunction with a Scanning Tunneling Microscope (STM). The QCM-STM apparatus allows unique and detailed investigations of a simple nanomechanical system formed by a contacting tip and surface. Both STM images of the contact and the response of the QCM are monitored throughout the course of the measurements, which are performed at realistic sliding speeds of over 1 m/s. CN - QC176.8 .N35 D96 2004 [Hill] PY - 2004/// DO - 10.1021/bk-2004-0882.ch001 VL - 882 PB - Washington, D.C.: American Chemical Society ER - TY - JOUR TI - Reliable adaptive modulation aided by observations of another fading channel AU - Yang, TS AU - Duel-Hallen, A AU - Hallen, H T2 - IEEE TRANSACTIONS ON COMMUNICATIONS AB - Adaptive transmission techniques, such as adaptive modulation and coding, adaptive power control, adaptive transmitter antenna diversity, etc., generally require precise channel estimation and feedback of channel state information (CSI). For fast vehicle speeds, reliable adaptive transmission also requires long-range prediction of future CSI, since the channel conditions are rapidly time variant. In this paper, we propose using past channel observations of one carrier to predict future CSI and perform adaptive modulation without feedback for another correlated carrier. We derive the minimum mean-square error (MMSE) long-range channel prediction that uses the time- and frequency-domain correlation function of the Rayleigh fading channel. An adaptive MMSE prediction method is also proposed. A statistical model of the prediction error that depends on the frequency and time correlation is developed and is used in the design of reliable adaptive modulation methods. We use a standard stationary fading channel model (Jakes model) and a novel physical channel model to test our algorithm. Significant gains relative to nonadaptive techniques are demonstrated for sufficiently correlated channels and realistic prediction range. DA - 2004/4// PY - 2004/4// DO - 10.1109/TCOMM.2004.826369 VL - 52 IS - 4 SP - 605-611 SN - 1558-0857 KW - adaptive modulation KW - fading channel prediction KW - multipath fading KW - multiple carriers KW - physical channel modeling ER - TY - JOUR TI - Reasoning about commitments in the event calculus: An approach for specifying and executing protocols AU - Yolum, P AU - Singh, MP T2 - ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE DA - 2004/9// PY - 2004/9// DO - 10.1023/B:AMAI.0000034528.55456.d9 VL - 42 IS - 1-3 SP - 227-253 SN - 1573-7470 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-3843082776&partnerID=MN8TOARS KW - commitments KW - agent communication languages and protocols KW - methodologies ER - TY - JOUR TI - Modeling the anatomical distribution of sunlight AU - Streicher, JJ AU - Culverhouse, WC AU - Dulberg, MS AU - Fornaro, RJ T2 - PHOTOCHEMISTRY AND PHOTOBIOLOGY AB - ABSTRACT One of the major technical challenges in calculating solar irradiance on the human form has been the complexity of the surface geometry ( i.e. the surface‐normal vis‐a‐vis the incident radiation). Over 80% of skin cancers occur on the face, head, neck and back of the hands. The quantification, as well as the mapping of the anatomical distribution of solar radiation on the human form, is essential if we are to study the etiology of skin cancers or cataracts or immune system suppression. Using advances in computer graphics, including high‐resolution three‐dimensional mathematical representations of the human form, the calculation of irradiance has been attained to subcentimeter precision. Lighting detail included partitioning of direct beam and diffuse skylight, shadowing effects and gradations of model surface illumination depending on model surface geometry and incident light angle. With the incorporation of ray‐tracing and irradiance algorithms, the results are not only realistic renderings but also accurate representations of the distribution of light on the subject model. The calculation of light illumination at various receptor points across the anatomy provides information about differential radiant exposure as a function of subject posture, orientation relative to the sun and sun elevation. The integration of a geodesic sun‐tracking model into the lighting module enabled simulation of specific sun exposure scenarios, with instantaneous irradiance, as well as the cumulative radiant exposure, calculated for a given latitude, date, time of day and duration. Illustration of instantaneous irradiance or cumulative radiant exposure is achieved using a false‐color rendering—mapping light intensity to color—creating irradiance or exposure isopleths. This approach may find application in the determination of the reduction in exposure that one achieves by wearing a hat, shirt or sunglasses. More fundamentally, such an analysis tool could provide improved estimates of scenario‐specific dose ( i.e. absorbed radiant exposure) needed to develop dose‐response functions for sunlight‐induced disease. DA - 2004/1// PY - 2004/1// DO - 10.1111/j.1751-1097.2004.tb09855.x VL - 79 IS - 1 SP - 40-47 SN - 0031-8655 ER - TY - JOUR TI - Kronecker product approximate preconditioner for SANs AU - Langville, AN AU - Stewart, WJ T2 - NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS AB - Abstract Many very large Markov chains can be modelled efficiently as stochastic automata networks (SANs). A SAN is composed of individual automata which, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov chain compactly as the sum of Kronecker products of smaller matrices. Thus, storage savings are immediate. The benefit of a SAN's compact representation, known as the descriptor, is often outweighed by its tendency to make analysis of the underlying Markov chain tough. While iterative or projections methods have been used to solve the system π Q =0, the time until these methods converge to the stationary solution π is still unsatisfactory. SAN's compact representation has made the next logical research step of preconditioning thorny. Several preconditioners for SANs have been proposed and tested, yet each has enjoyed little or no success. Encouraged by the recent success of approximate inverses as preconditioners, we have explored their potential as SAN preconditioners. One particularly relevant finding on approximate inverse preconditioning is the nearest Kronecker product approximation discovered by Pitsianis and Van Loan. In this paper, we extend the nearest Kronecker product technique to approximate the Q matrix for an SAN with a Kronecker product, A 1 ⊗ A 2 ⊗…⊗ A N . Then, we take M = A ⊗ A ⊗…⊗ A as our SAN NKP preconditioner. Copyright © 2004 John Wiley & Sons, Ltd. DA - 2004/// PY - 2004/// DO - 10.1002/nla.344 VL - 11 IS - 8-9 SP - 723-752 SN - 1099-1506 KW - stochastic automata networks KW - nearest Kronecker products KW - inultilinear alaebra KW - preconditioning ER - TY - JOUR TI - Extended anti-windup control schemes for LTI and LFT systems with actuator saturations AU - Wu, F AU - Soto, M T2 - INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL AB - Abstract In this paper, the popular anti‐windup control scheme will be extended in two important directions. The first scenario is the control of LTI systems subject to actuators with both magnitude and rate constraints. The second case of extension is LFT systems with input saturations. Based on the extended Circle criterion, we will develop convex anti‐windup control synthesis conditions in the form of LMIs for each class of systems. The explicit anti‐windup controller formula are also provided to facilitate compensator construction. The effectiveness of proposed anti‐windup control schemes will be demonstrated using a flight control example. Copyright © 2004 John Wiley & Sons, Ltd. DA - 2004/10// PY - 2004/10// DO - 10.1002/rnc.943 VL - 14 IS - 15 SP - 1255-1281 SN - 1099-1239 KW - input magnitude and rate saturations KW - anti-windup compensation KW - stability and performance KW - linear matrix inequality (LMI) KW - controller construction ER - TY - JOUR TI - Coding theory based models for protein translation initiation in prokaryotic organisms AU - May, EE AU - Vouk, MA AU - Bitzer, DL AU - Rosnick, DI T2 - BIOSYSTEMS AB - Our research explores the feasibility of using communication theory, error control (EC) coding theory specifically, for quantitatively modeling the protein translation initiation mechanism. The messenger RNA (mRNA) of Escherichia coli K-12 is modeled as a noisy (errored), encoded signal and the ribosome as a minimum Hamming distance decoder, where the 16S ribosomal RNA (rRNA) serves as a template for generating a set of valid codewords (the codebook). We tested the E. coli based coding models on 5′ untranslated leader sequences of prokaryotic organisms of varying taxonomical relation to E. coli including: Salmonella typhimurium LT2, Bacillus subtilis, and Staphylococcus aureus Mu50. The model identified regions on the 5′ untranslated leader where the minimum Hamming distance values of translated mRNA sub-sequences and non-translated genomic sequences differ the most. These regions correspond to the Shine–Dalgarno domain and the non-random domain. Applying the EC coding-based models to B. subtilis, and S. aureus Mu50 yielded results similar to those for E. coli K-12. Contrary to our expectations, the behavior of S. typhimurium LT2, the more taxonomically related to E. coli, resembled that of the non-translated sequence group. DA - 2004/// PY - 2004/// DO - 10.1016/j.biosystems.2004.05.017 VL - 76 IS - 1-3 SP - 249-260 SN - 0303-2647 KW - coding theory KW - translation initiation KW - information theory KW - information processing ER - TY - CHAP TI - Storage-efficient stateless group key revocation AU - Wang, P. AU - Ning, P. AU - Reeves, D. S. T2 - Information security: 7th international conference, ISC 2004, Palo Alto, CA, USA, September 27-29, 2004: Proceedings A2 - K. Zhang, A2 - Zheng, Y. AB - Secure group communication relies on secure and robust distribution of group keys. A stateless group key distribution scheme is an ideal candidate when the communication channel is unreliable. Several stateless group key distribution schemes have been proposed. However, these schemes require all users store a certain number of auxiliary keys. The number of such keys increases as the group size grows. As a result, it is quite challenging to use these schemes when the users in a relatively large group have memory constraints. Thus, it is desirable to develop new schemes that can reduce the memory requirement. This paper introduces two novel stateless group key revocation schemes named key-chain tree (KCT) and layered key-chain tree (LKCT), which combine one-way key chains with a logical key tree. These schemes reduce the user storage requirements by trading off it with communication and computation costs. Specifically, these schemes can revoke any R users from a user group of size N by sending a key update message with at most 4R keys, while only requiring each user to store 2log N keys. CN - QA76.9 .A25 I85 2004 PY - 2004/// DO - 10.1007/978-3-540-30144-8_3 VL - 3225 SP - 25-38 PB - Berlin; New York: Springer SN - 3540232087 ER - TY - JOUR TI - Special issue devoted to papers presented at the Conference on the Numerical Solution of Markov Chains 2003 - Preface AU - Langville, AN AU - Stewart, WJ T2 - LINEAR ALGEBRA AND ITS APPLICATIONS DA - 2004/7/15/ PY - 2004/7/15/ DO - 10.1016/j.laa.2004.02.016 VL - 386 SP - 1-2 SN - 1873-1856 ER - TY - JOUR TI - Self-organizing referral networks: A process view of trust and authority AU - Yolum, P. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - We are developing a decentralized approach to trust based on referral systems, where agents adaptively give referrals to one another to find other trustworthy agents. Interestingly, referral systems provide us with a useful and intuitive model of how links may be generated: a referral corresponds to a customized link generated on demand by one agent for another. This gives us a basis for studying the processes underlying trust and authority, especially as they affect the structure of the evolving social network of agents. We explore key relationships between the policies and representations of the individual agents on the one hand and the aggregate structure of their social network on the other. CN - QA76.618 .E54 2004 DA - 2004/// PY - 2004/// DO - 10.1007/978-3-540-24701-2_14 VL - 2977 SP - 195–211 UR - https://publons.com/publon/13074000/ ER - TY - JOUR TI - Meta-analysis of pharmacokinetic data of veterinary drugs using the Food Animal Residue Avoidance Databank: oxytetracycline and procaine penicillin G AU - Craigmill, AL AU - Miller, GR AU - Gehring, R AU - Pierce, AN AU - Riviere, JE T2 - JOURNAL OF VETERINARY PHARMACOLOGY AND THERAPEUTICS AB - Investigators frequently face the quandary of how to interpret the often times disparate pharmacokinetic parameter values reported in the literature. Combining of data from multiple studies (meta-analysis) is a useful tool in pharmacokinetics. Few studies have explored the use of meta-analysis for veterinary species. Even fewer studies have explored the potential strengths and weaknesses of the various methods of performing a meta-analysis. Therefore, in this study we performed a meta-analysis for oxytetracycline (OTC) and procaine penicillin G (PPG) given intramuscularly to cattle. The analysis included 28 individual data sets from 18 published papers for PPG (288 data points), and 41 individual data sets from 25 published papers for OTC (489 data points). Three methods were used to calculate the parameters. The first was a simple statistical analysis of the parameter values reported in each paper. The second method was a standard Two-Stage Method (TSM) using the mean concentration vs. time data extracted from each paper. The third method was the use of nonlinear mixed effect modeling (NMEM) of the concentration vs. time data reported in the various papers, treating the mean data as if each set came from an individual animal. The results of this evaluation indicate that all three methods generate comparable mean parameter estimates for OTC and PPG. The only significant difference noted was for OTC absorption half-lives taken from the published literature, a difference attributable to the use of an alternative method of parameter calculation. The NMEM procedure offers the possibility of including covariates such as dose, age, and weight. In this study the covariates did not influence the derived parameters. A combination approach to meta-analysis of published mean data is recommended, where the TSM is the first step, followed by the NMEM approach. DA - 2004/10// PY - 2004/10// DO - 10.1111/j.1365-2885.2004.00606.x VL - 27 IS - 5 SP - 343-353 SN - 0140-7783 ER - TY - JOUR TI - Injective properties of complex matrices AU - Meyer, C. T2 - American Mathematical Monthly DA - 2004/// PY - 2004/// DO - 10.2307/4145059 VL - 111 IS - 8 SP - 728 ER - TY - CHAP TI - Improving robustness of PGP keyrings by conflict detection AU - Jiang, Q. L. AU - Reeves, D. S. AU - Ning, P. T2 - Topics in cryptology, CT-RSA 2004 AB - Secure authentication frequently depends on the correct recognition of a user’s public key. When there is no certificate authority, this key is obtained from other users using a web of trust. If users can be malicious, trusting the key information they provide is risky. Previous work has suggested the use of redundancy to improve the trustworthiness of user-provided key information. In this paper, we address two issues not previously considered. First, we solve the problem of users who claim multiple, false identities, or who possess multiple keys. Secondly, we show that conflicting certificate information can be exploited to improve trustworthiness. Our methods are demonstrated on both real and synthetic PGP keyrings, and their performance is discussed. CN - QA76.9 .A25 C822 2004 PY - 2004/// DO - 10.1007/978-3-540-24660-2_16 VL - 2964 SP - 194-207 PB - Berlin; New York: Springer SN - 3540209964 ER - TY - JOUR TI - Deterministic distinct-degree factorization of polynomials over finite fields AU - Gao, SH AU - Kaltofen, E AU - Lauder, AGB T2 - JOURNAL OF SYMBOLIC COMPUTATION AB - A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987. DA - 2004/12// PY - 2004/12// DO - 10.1016/j.jsc.2004.05.004 VL - 38 IS - 6 SP - 1461-1470 SN - 0747-7171 KW - multivariate polynomial KW - deterministic algorithm KW - distinct-degree factorization ER - TY - CHAP TI - Certificate recommendations to improve the robustness of web of trust AU - Jiang, Q. L. AU - Reeves, D. S. AU - Ning, P. T2 - Information security: 7th international conference, ISC 2004, Palo Alto, CA, USA, September 27-29, 2004: Proceedings A2 - K. Zhang, A2 - Zheng, Y. AB - Users in a distributed system establish webs of trust by issuing and exchanging certificates amont themselves. This approach does not require a central, trusted keyserver. The distributed web of trust, however, is susceptible to attack by malicious users, who may issue false certificates. In this work, we propose a method for generating certificate recommendations. These recommendations guide the users in creating webs of trust that are highly robust to attacks. To accomplish this we propose a heuristic method of graph augmentation for the certificate graph, and show experimentally that it is close to optimal. We also investigate the impact of user preferences and non-compliance with these recommendations, and demonstrate that our method helps identify malicious users if there are any. CN - QA76.9 .A25 I85 2004 PY - 2004/// DO - 10.1007/978-3-540-30144-8_25 VL - 3225 SP - 292-303 PB - Berlin; New York: Springer SN - 3540232087 ER - TY - JOUR TI - A compressed accessibility map for XML AU - Yu, T AU - Srivastava, D AU - Lakshmanan, LVS AU - Jagadish, HV T2 - ACM TRANSACTIONS ON DATABASE SYSTEMS AB - XML is the undisputed standard for data representation and exchange. As companies transact business over the Internet, letting authorized customers directly access, and even modify, XML data offers many advantages in terms of cost, accuracy, and timeliness. Given the complex business relationships between companies, and the sensitive nature of information, access must be provided selectively, using sophisticated access control specifications. Using the specification directly to determine if a user has access to an XML data item can be extremely inefficient. The alternative of fully materializing, for each data item, the users authorized to access it can be space-inefficient. In this article, we introduce a compressed accessibility map (CAM) as a space- and time-efficient solution to the access control problem for XML data. A CAM compactly identifies the XML data items to which a user has access, by exploiting structural locality of accessibility in tree-structured data. We present a CAM lookup algorithm for determining if a user has access to a data item that takes time proportional to the product of the depth of the item in the XML data and logarithm of the CAM size. We develop an algorithm for building an optimal size CAM that takes time linear in the size of the XML data set. While optimality cannot be preserved incrementally under data item updates, we provide an algorithm for incrementally maintaining near-optimality. Finally, we experimentally demonstrate the effectiveness of the CAM for multiple users on a variety of real and synthetic data sets. DA - 2004/6// PY - 2004/6// DO - 10.1145/1005566.1005570 VL - 29 IS - 2 SP - 363-402 SN - 1557-4644 KW - algorithms KW - experimentation KW - performance KW - theory KW - access control KW - structural locality KW - XML ER - TY - JOUR TI - Regularly spaced subsums of integer partitions AU - Canfield, ER AU - Savage, CD AU - Wilf, HS T2 - ACTA ARITHMETICA AB - For integer partitions $\lambda :n=a_1+...+a_k$, where $a_1\ge a_2\ge >...\ge a_k\ge 1$, we study the sum $a_1+a_3+...$ of the parts of odd index. We show that the average of this sum, over all partitions $\lambda$ of $n$, is of the form $n/2+(\sqrt{6}/(8\pi))\sqrt{n}\log{n}+c_{2,1}\sqrt{n}+O(\log{n}).$ More generally, we study the sum $a_i+a_{m+i}+a_{2m+i}+...$ of the parts whose indices lie in a given arithmetic progression and we show that the average of this sum, over all partitions of $n$, is of the form $n/m+b_{m,i}\sqrt{n}\log{n}+c_{m,i}\sqrt{n}+O(\log{n})$, with explicitly given constants $b_{m,i},c_{m,i}$. Interestingly, for $m$ odd and $i=(m+1)/2$ we have $b_{m,i}=0$, so in this case the error term is of lower order. The methods used involve asymptotic formulas for the behavior of Lambert series and the Zeta function of Hurwitz. We also show that if $f(n,j)$ is the number of partitions of $n$ the sum of whose parts of even index is $j$, then for every $n$, $f(n,j)$ agrees with a certain universal sequence, Sloane's sequence \texttt{#A000712}, for $j\le n/3$ but not for any larger $j$. DA - 2004/// PY - 2004/// DO - 10.4064/aa115-3-1 VL - 115 IS - 3 SP - 205-216 SN - 0065-1036 ER - TY - JOUR TI - Bandwidth provisioning and pricing for networks with multiple classes of service AU - Fulp, EW AU - Reeves, DS T2 - COMPUTER NETWORKS AB - Network service providers purchase large point-to-point connections from network owners, then offer individual users network access at a price. Appropriately provisioning (purchasing) and allocating (pricing) connections remains a difficult problem due to increasing demands and network dynamics. However, connection management is more complex with the deployment of Quality of Service (QoS). This paper describes a scalable connection management strategy for QoS-enabled networks. The management technique maximizes profit, while reducing blocking experienced by users. Important issues regarding demand estimation, connection duration, and pricing intervals, are addressed and analyzed. Simulation results are also provided to demonstrate the viability of the proposed system. DA - 2004/9/16/ PY - 2004/9/16/ DO - 10.1016/j.comnet.2004.03.018 VL - 46 IS - 1 SP - 41-52 SN - 1872-7069 KW - connection management KW - SLA KW - DiffServ KW - bandwidth pricing KW - microeconomics ER - TY - JOUR TI - An error-correcting code framework for genetic sequence analysis AU - May, EE AU - Vouk, MA AU - Bitzer, DL AU - Rosnick, DI T2 - JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS AB - A fundamental challenge for engineering communication systems is the problem of transmitting information from the source to the receiver over a noisy channel. This same problem exists in a biological system. How can information required for the proper functioning of a cell, an organism, or a species be transmitted in an error introducing environment? Source codes (compression codes) and channel codes (error-correcting codes) address this problem in engineering communication systems. The ability to extend these information theory concepts to study information transmission in biological systems can contribute to the general understanding of biological communication mechanisms and extend the field of coding theory into the biological domain. In this work, we review and compare existing coding theoretic methods for modeling genetic systems. We introduce a new error-correcting code framework for understanding translation initiation, at the cellular level and present research results for Escherichia coli K-12. By studying translation initiation, we hope to gain insight into potential error-correcting aspects of genomic sequences and systems. DA - 2004/// PY - 2004/// DO - 10.1016/j.jfranklin.2003.12.009 VL - 341 IS - 1-2 SP - 89-109 SN - 1879-2693 KW - coding theory KW - translation initiation KW - information theory KW - biological coding theory KW - error correcting codes ER - TY - JOUR TI - A nonlinear entropic variational model for image filtering AU - Ben Hamza, A AU - Krim, H AU - Zerubia, J T2 - EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING AB - We propose an information-theoretic variational filter for image denoising. It is a result of minimizing a functional subject to some noise constraints, and takes a hybrid form of a negentropy variational integral for small gradient magnitudes and a total variational integral for large gradient magnitudes. The core idea behind this approach is to use geometric insight in helping to construct regularizing functionals and avoiding a subjective choice of a prior in maximum a posteriori estimation. Illustrative experimental results demonstrate a much improved performance of the approach in the presence of Gaussian and heavy-tailed noise. DA - 2004/11/15/ PY - 2004/11/15/ DO - 10.1155/S1110865704407197 VL - 2004 IS - 16 SP - 2408-2422 SN - 1687-0433 KW - MAP estimation KW - variational methods KW - robust statistics KW - differential entropy KW - gradient descent flows KW - image denoising ER - TY - JOUR TI - Use of micromachined probes for the recording of cardiac electrograms in isolated heart tissues AU - Kim, CS AU - Ufer, S AU - Seagle, CM AU - Engle, CL AU - Nagle, HT AU - Johnson, TA AU - Cascio, WE T2 - BIOSENSORS & BIOELECTRONICS AB - Micromachined probes, with iridium (Ir) microelectrodes on silicon shanks, were evaluated to assess their suitability for cardiac electrogram recording. The electrochemical activation (anodic oxidation) procedure for the circular Ir microelectrode was investigated using the square wave potential according to the electrode size, number of cycles, and cathodic-anodic potential level of the square wave. Increase in the charge storage capacity was pronounced either in smaller electrodes or with higher potential level of the square wave. The electrode impedance reduced in a similar manner with increasing number of cycle irrespective of the electrode size. With either lower potential level (-0.70/+0.60 V) or smaller number of cycle (200 cycles) than those for the activation of stimulating electrode, the likelihood of overactivation of the recording microelectrode can be minimized. These anodic IrOx film (AIROF) microelectrodes were used for the recording of extracellular electrograms in two different ex vivo cardiac tissue preparations. A single-shank microprobe was applied to the left ventricle of a mouse heart. Both the spontaneous and paced transmural responses propagating between epicardium and endocardium were obtained. Longitudinal cardiac wavefronts propagating along the rabbit papillary muscle were also recorded with a unique multiple-shank design. The measured mean amplitude and the propagation velocity of the extracellular voltage were 12.2 +/- 1.8 mV and 58.9 +/- 2.2 cm/s, respectively (n = 27). These microprobes with precisely defined electrode spacing make a useful tool for the spatial and temporal mapping of electrical properties in isolated heart tissues ex vivo. DA - 2004/4/15/ PY - 2004/4/15/ DO - 10.1016/j.bios.2003.10.011 VL - 19 IS - 9 SP - 1109-1116 SN - 1873-4235 KW - iridium oxide KW - microelectrode KW - activation KW - papillary muscle KW - ventricle KW - cardiac mapping ER - TY - JOUR TI - On the benefits of using functional transitions and Kronecker algebra AU - Benoit, A AU - Fernandes, P AU - Plateau, B AU - Stewart, WJ T2 - PERFORMANCE EVALUATION AB - Much attention has been paid recently to the use of Kronecker or tensor product modelling techniques for evaluating the performance of parallel and distributed systems. While this approach facilitates the description of such systems and mimimizes memory requirements, it has suffered in the past from the fact that computation times have been excessively long. In this paper we propose a suite of modelling strategems and numerical procedures that go a long way to alleviating this drawback. Of particular note are the benefits obtained by using functional transitions that are implemented via a generalized tensor algebra. Examples are presented which illustrate the reduction in computation time as each suggested improvement is deployed. DA - 2004/12// PY - 2004/12// DO - 10.1016/j.peva.2004.04.002 VL - 58 IS - 4 SP - 367-390 SN - 1872-745X KW - Markov chains KW - stochastic automata networks KW - generalized tensor algebra KW - vector-descriptor multiplication ER - TY - CHAP TI - Incremental read-aheads AU - Bilgin, A. S. T2 - Current trends in database technology: EDBT 2004 Workshops, PhD, DataX, PIM, P2P&DB, and Clustweb, Heraklion, Crete, Greece, March 14-18, 2004: revised selected papers CN - [Electronic Resource] PY - 2004/// VL - 3268 SP - 144-153 PB - Berlin; New York: Springer SN - 3540233059 ER - TY - JOUR TI - Asynchronous software thread integration for efficient software implementations of embedded communication protocol controllers AU - Kumar, NJ AU - Shivshankar, S AU - Dean, AG T2 - ACM SIGPLAN NOTICES AB - The overhead of context-switching limits efficient scheduling of multiple concurrent threads on a uniprocessor when real-time requirements exist. Existing software thread integration (STI) methods reduce context switches, but only provide synchronous thread progress within integrated functions. For the remaining, non-integrated portions of the secondary threads to run and avoid starvation, the primary thread must have adequate amounts of coarse-grain idle time (longer than two context-switches). We have developed asynchronous software thread integration (ASTI) methods which address starvation through the efficient use of coroutine calls and integration. ASTI allows threads to make independent progress efficiently and reduces the number of context switches needed through integration.Software-implemented protocol controllers are crippled by this problem; the primary thread "bit-bangs" each bit of a message onto or off of the bus, leaving only fragments of idle time shorter than a bit time. This fragmented time may be too short to recover through context switching, so only the primary thread can execute during message transmission or reception, slowing the secondary threads and potentially making them miss their deadlines. ASTI simplifies the implementation of embedded communication protocols on low-cost, moderate speed (1 - 100 MHz, 8- and 16-bit) microcontrollers. We demonstrate ASTI by replacing a standard automotive communication protocol controller (J1850) with software and generic hardware. Secondary thread performance improves significantly when compared with a traditional interrupt-based software approach. DA - 2004/7// PY - 2004/7// DO - 10.1145/998300.997170 VL - 39 IS - 7 SP - 37-46 SN - 1558-1160 KW - algorithms KW - design KW - experimentation KW - asynchronous software thread integration KW - hardware to software migration KW - fine-grain concurrency KW - software-implemented communication protocol controllers KW - J1850 ER - TY - JOUR TI - An extensible, programmable, commercial-grade platform for Internet service architecture AU - Lavian, T AU - Hoang, DB AU - Travostino, F AU - Wang, PYH AU - Subramanian, S AU - Monga, I T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS AB - With their increasingly sophisticated applications, users promote the notion that there is more to a network (be it an intranet, or the Internet) than mere L1-3 connectivity. In what shapes a next generation service contract between users and the network, users want the network to offer services that are as ubiquitous and dependable as dial tones. Typical services include application-aware firewalls, directories, nomadic support, virtualization, load balancing, alternate site failover, etc. To fulfill this vision, a service architecture is needed. That is, an architecture wherein end-to-end services compose, on-demand, across network domains, technologies, and administration boundaries. Such an architecture requires programmable mechanisms and programmable network devices for service enabling, service negotiation, and service management. The bedrock foundation of the architecture, and also the key focus of the paper, is an open-source programmable service platform that is explicitly designed to best exploit commercial-grade network devices. The platform predicates a full separation of concerns, in that control-intensive operations are executed in software, whereas, data-intensive operations are delegated to hardware. This way, the platform is capable of performing wire-speed content filtering, and activating network services according to the state of data and control flows. The paper describes the platform and some distinguishing services realized on the platform. DA - 2004/2// PY - 2004/2// DO - 10.1109/TSMCC.2003.818497 VL - 34 IS - 1 SP - 58-68 SN - 1558-2442 KW - active networks KW - active services KW - programmable networks KW - service architecture KW - service platform ER - TY - CHAP TI - Trustworthy service caching: Cooperative search in P2P information systems AU - Udupi, Y. B. AU - Yolum, P. AU - Singh, M. P. T2 - Agent-oriented information systems: 5th international bi-conference workshop, AOIS 2003, Melbourne, Australia, July 14, 2003 and Chicago, IL, USA, October 13, 2003 ; Revised selected papers A2 - P. Giorgini, B. Henderson-Sellers A2 - Winikoff, M. AB - We are developing an approach for P2P information systems, where the peers are modelled as autonomous agents. Agents provide services or give referrals to one another to help find trustworthy services. We consider the important case of information services that can be cached. Agents request information services through high-level queries, not by describing specific objects as in caching in traditional distributed systems. Moreover, the agents autonomously decide whom to contact for a service, whom to provide a service or referral, whether to follow a referral and whether to cache a service. Thus the information system itself evolves as agents learn about each other and the contents of the caches of the agents change. We study here the effect of caching on service location and on the information system itself. Our main results are that, (1) even with a small cache, agents can locate services more easily; (2) since the agents that cache services can act like service providers, a small number of initial service providers are enough to serve the information needs of the consumers; and (3) agents benefit from being neighbours with others who have similar interests. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-25943-5_3 VL - 3030 SP - 32-44 PB - Berlin; New York: Springer SN - 3540221271 ER - TY - CHAP TI - Traffic Grooming in WDM Ring Networks with the Min-Max Objective AU - Chen, Bensong AU - Rouskas, George N. AU - Dutta, Rudra T2 - Lecture Notes in Computer Science AB - We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the Min-Max objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_15 VL - 3042 SP - 174-185 OP - PB - Springer Berlin Heidelberg SN - 9783540219590 9783540246930 UR - http://dx.doi.org/10.1007/978-3-540-24693-0_15 DB - Crossref ER - TY - JOUR TI - Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks AU - Langville, AN AU - Stewart, WJ T2 - INFORMS JOURNAL ON COMPUTING AB - This paper is the experimental follow-up to Langville and Stewart (2002), where the theoretical background for the nearest Kronecker product (NKP) preconditioner was developed. Here we test the NKP preconditioner on both Markov chains (MCs) and stochastic automata networks (SANs). We conclude that the NKP preconditioner is not appropriate for general MCs, but is very effective for a MC stored as a SAN. DA - 2004/// PY - 2004/// DO - 10.1287/ijoc.1030.0041 VL - 16 IS - 3 SP - 300-315 SN - 1526-5528 KW - probability KW - Markov processes KW - queues KW - Markovian KW - algorithms ER - TY - CHAP TI - Access protocols to support different service classes in an optical burst switching ring AU - Puttasubbappa, V. S. AU - Perros, H. G. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - Several access protocols are proposed to support different service classes in an optical burst switched ring. Their performance is evaluated through simulation. Various performance metrics such as throughput, utilization, burst loss rate, end-to-end delay and fairness are used to analyze the behaviour of each protocol. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_72 VL - 3042 SP - 878-889 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - JOUR TI - A web-based decision support system to estimate extended withdrawal intervals AU - Gehring, R AU - Baynes, RE AU - Wang, J AU - Craigmill, AL AU - Riviere, JE T2 - COMPUTERS AND ELECTRONICS IN AGRICULTURE AB - All drugs approved for use in food-producing animals have a withdrawal interval to prevent residues in food of animal origin that are potentially harmful to consumers. These withdrawal times must be appropriately extended if the drug is used in an extralabel manner. This paper describes a web-based application that was developed to facilitate the calculation of extended withdrawal intervals based on information in the databases maintained by members of the Food Animal Residue Avoidance Databank (FARAD) and using the Extrapolated Withdrawal Interval Estimator (EWE) algorithm. The implementation of this application was illustrated using a group of antimicrobials that are used in cattle and swine. The use of this application has been limited to staff veterinarians working for FARAD since limitations in the available pharmacokinetic data require that results are interpreted by personnel with in-depth knowledge of the pharmacokinetics of drugs in food-producing animals. DA - 2004/8// PY - 2004/8// DO - 10.1016/j.compag.2004.05.002 VL - 44 IS - 2 SP - 145-151 SN - 1872-7107 KW - withdrawal times KW - extralabel drug use KW - drug residues KW - veterinary medicine ER - TY - CHAP TI - ORBIS: A reconfigurable hybrid optical metropolitan area network architecture AU - Xin, Y. F. AU - Baldine, I. AU - Cassada, M. AU - Stevenson, D. AU - Jackson, L. E. AU - Perros, H. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - In this paper, we propose a novel metropolitan area network (MAN) ring architecture, ORBIS, a multiple-service WDM platform that supports multiple transport techniques. The WDM ring is horizontally divided into multiple subnetworks, each of which supports one type of the traffic with a subset of the total wavelengths. The system and subnetwork control mechanism and reconfiguration issues are addressed in this paper. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_142 VL - 3042 SP - 1502-1507 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - CHAP TI - Experimental analysis of the SABUL congestion control algorithm AU - Oothongsap, P. AU - Viniotis, Y. AU - Vouk, M. T2 - Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings AB - Several new protocols such as RBUDP, User-Level UDP, Tsunami, and SABUL, have been proposed as alternatives to TCP for high-speed data transfer. The purpose of this paper is to analyze experimentally the effects of SABUL congeston control algorithm on SABUL and performance metrics such as bandwidth utilization, self-fairness, and aggressiveness. Our results confirm some expected behavior of SABUL and reveal some less expected one. Our experiments also indicate that SABUL implementation and design can result in an even more erratic behavior and degraded performance under high-congestion conditions. CN - [Electronic Resource] PY - 2004/// DO - 10.1007/978-3-540-24693-0_131 VL - 3042 SP - 1433-1439 PB - Berlin; New York: Springer SN - 3540219595 ER - TY - JOUR TI - Call blocking probabilities in a traffic-groomed tandem optical network AU - Washington, AN AU - Perros, H T2 - COMPUTER NETWORKS AB - In this paper, we consider an optical network consisting of N nodes arranged in tandem. We assume traffic grooming, which permits multiple sub-rate traffic streams to be carried on the same wavelength. This optical network is modeled by a tandem queueing network of multi-rate Erlang loss nodes with simultaneous resource possession, with a view to calculating call blocking probabilities. The queueing network is analyzed by decomposition using a modified version of Courtois' algorithm. Numerical comparisons of the decomposition algorithm against simulation show that the algorithm has good accuracy. Also, it is shown that the proposed algorithm is an improvement over the well-known single-node decomposition algorithm based on the link-independence assumption. DA - 2004/6/21/ PY - 2004/6/21/ DO - 10.1016/j.comnet.2004.03.008 VL - 45 IS - 3 SP - 281-294 SN - 1872-7069 KW - call blocking probabilities KW - traffic grooming KW - optical networks KW - multi-rate Erlang loss network KW - decomposition algorithm ER - TY - JOUR TI - Venn diagrams and symmetric chain decompositions in the Boolean lattice AU - Griggs, J. AU - Killian, C. E. AU - Savage, C. D. T2 - Electronic Journal of Combinatorics DA - 2004/// PY - 2004/// VL - 11 IS - 1 ER - TY - JOUR TI - Computing the sign or the value of the determinant of an integer matrix, a complexity survey AU - Kaltofen, E AU - Villard, G T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS AB - Computation of the sign of the determinant of a matrix and the determinant itself is a challenge for both numerical and exact methods. We survey the complexity of existing methods to solve these problems when the input is an n×n matrix A with integer entries. We study the bit-complexities of the algorithms asymptotically in n and the norm of A. Existing approaches rely on numerical approximate computations, on exact computations, or on both types of arithmetic in combination. DA - 2004/1/1/ PY - 2004/1/1/ DO - 10.1016/j.cam.2003.08.019 VL - 162 IS - 1 SP - 133-146 SN - 1879-1778 KW - determinant KW - bit-complexity KW - integer matrix KW - approximate computation KW - exact computation KW - randomized algorithms ER - TY - JOUR TI - Capacity planning of DiffServ networks with best-effort and Expedited Forwarding traffic AU - Wu, KH AU - Reeves, DS T2 - TELECOMMUNICATION SYSTEMS AB - For networks providing a specific level of service guarantees, capacity planning is an imperative part of network management. Accurate dimensioning is especially important in DiffServ networks, where no per-flow signaling or control exists. In this paper, we address the problem of capacity planning for DiffServ networks with only Expedited Forwarding (EF) and best effort (BE) traffic classes. The problem is formulated as an optimization problem, where the total link cost is minimized, subject to the performance constraints of both EF and BE classes. The edge to edge EF demand pairs and the BE demands on each link are given. The variables to be determined are the non-bifurcated routing of EF traffic, and the discrete link capacities. We show that Lagrangian relaxation and subgradient optimization methods can be used to effectively solve the problem. Computational results show that the solution quality is verifiably good while the running time remains reasonable on practical-sized networks. This represents the first work for capacity planning of multi-class IP networks with non-linear performance constraints and discrete link capacity constraints. DA - 2004/// PY - 2004/// DO - 10.1023/B:TELS.0000014781.92903.7f VL - 25 IS - 3-4 SP - 193-207 SN - 1572-9451 KW - DiffServ KW - capacity planning KW - Lagrangian relaxation ER - TY - JOUR TI - Smart nonlinear diffusion: A probabilistic approach AU - Bao, Y. F. AU - Krim, H. T2 - IEEE Transactions on Pattern Analysis and Machine Intelligence AB - In this paper, a stochastic interpretation of nonlinear diffusion equations used for image filtering is proposed. This is achieved by relating the problem of evolving/smoothing images to that of tracking the transition probability density functions of an underlying random process. We show that such an interpretation of, e.g., Perona-Malik equation, in turn allows additional insight and sufficient flexibility to further investigate some outstanding problems of nonlinear diffusion techniques. In particular, upon unraveling the limitations as well as the advantages of such an equation, we are able to propose a new approach which is demonstrated to improve performance over existing approaches and, more importantly, to lift the longstanding problem of a stopping criterion for a nonlinear evolution equation with no data term constraint. Substantiating examples in image enhancement and segmentation are provided. DA - 2004/// PY - 2004/// DO - 10.1109/TPAMI.2004.1261079 VL - 26 IS - 1 SP - 63-72 ER - TY - JOUR TI - Partitions and compositions defined by inequalities AU - Corteel, S AU - Savage, CD T2 - RAMANUJAN JOURNAL AB - We consider sequences of integers (λ1,..., λ k ) defined by a system of linear inequalities λ i ≥ ∑ j>iaijλ j with integer coefficients. We show that when the constraints are strong enough to guarantee that all λ i are nonnegative, the generating function for the integer solutions of weight n has a finite product form $$\prod_{i} (1-q^{b_i})^{-1}$$ , where the b i are positive integers that can be computed from the coefficients of the inequalities. The results are proved bijectively and are used to give several examples of interesting identities for integer partitions and compositions. The method can be adapted to accommodate equalities along with inequalities and can be used to obtain multivariate forms of the generating function. We show how to extend the technique to obtain the generating function when the coefficients ai,i+1 are allowed to be rational, generalizing the case of lecture hall partitions. Our initial results were conjectured thanks to the Omega package (G.E. Andrews, P. Paule, and A. Riese, European J. Comb. 22(7) (2001), 887–904). DA - 2004/9// PY - 2004/9// DO - 10.1007/s11139-004-0144-2 VL - 8 IS - 3 SP - 357-381 SN - 1572-9303 KW - integer partitions KW - integer compositions KW - enumeration ER - TY - JOUR TI - On the multiplicity of parts in a random composition of a large integer AU - Hitczenko, PL AU - Savage, CD T2 - SIAM JOURNAL ON DISCRETE MATHEMATICS AB - In this paper we study the following question posed by H. S. Wilf: what is, asymptotically as $n\rightarrow \infty$, the probability that a randomly chosen part size in a random composition of an integer n has multiplicity m? More specifically, given positive integers n and m, suppose that a composition $\lambda$ of n is selected uniformly at random and then, out of the set of part sizes in $\lambda$, a part size j is chosen uniformly at random. Let $\P(A_n^{(m)})$ be the probability that j has multiplicity m. We show that for fixed m, $\P(A_n^{(m)}$) goes to 0 at the rate $1/\ln n$. A more careful analysis uncovers an unexpected result: $(\ln n)\P(A_n^{(m)})$ does not have a limit but instead oscillates around the value $1/m$ as $n\to\infty$. This work is a counterpart of a recent paper of Corteel, Pittel, Savage, and Wilf, who studied the same problem in the case of partitions rather than compositions. DA - 2004/// PY - 2004/// DO - 10.1137/s0895480199363155 VL - 18 IS - 2 SP - 418-435 SN - 0895-4801 KW - compositions of an integer KW - random compositions KW - geometric random variables ER - TY - JOUR TI - Inside JetBlue's privacy policy violations AU - Anton, A. I. AU - He, Q. F. AU - Baumer, D. L. T2 - IEEE Security & Privacy DA - 2004/// PY - 2004/// VL - 2 IS - 6 SP - 18- ER - TY - JOUR TI - Compositional static instruction cache simulation AU - Patil, K AU - Seth, K AU - Mueller, F T2 - ACM SIGPLAN NOTICES AB - Scheduling in hard real-time systems requires a priori knowledge of worst-case execution times (WCET). Obtaining the WCET of a task is a difficult problem. Static timing analysis techniques approach this problem via path analysis, pipeline simulation and cache simulation to derive safe WCET bounds. But such analysis has traditionally been constrained to only small programs due to the complexity of simulation, most notably the complexity of static cache simulation, which requires inter-procedural analysis.This paper describes a novel approach of compositional static cache simulation that alleviates the complexity problem, thereby making static timing analysis feasible for much larger programs than in the past. Specifically, a framework is contributed that facilitates static cache analysis by splitting it into two steps, a module-level analysis and a compositional phase, thus addressing the issue of complexity of inter-procedural analysis for an entire program. The module-level analysis parameterizes the data-flow information in terms of potential evictions from cache due to calls containing conflicting references. The compositional analysis stage uses the result of the parameterized data-flow for each module. Thus, the emphasis here is on handling most of the complexity in the module-level analysis and performing as little analysis as possible at the compositional level. The experimental results for direct-mapped instruction caches show that the compositional analysis framework outperforms prior analysis methods for larger programs by one to two orders of magnitude, depending on the reference for comparison, while providing equally accurate predictions. This novel approach to static cache analysis provides a promising solution to the complexity problem in timing analysis, which, for the first time, makes the analysis of larger programs feasible. DA - 2004/7// PY - 2004/7// DO - 10.1145/998300.997183 VL - 39 IS - 7 SP - 136-145 SN - 1558-1160 KW - algorithms KW - experimentation KW - real-time systems KW - caches KW - scheduling KW - worst-case execution time ER - TY - JOUR TI - SAT-solving the coverability problem for Petri nets AU - Abdulla, PA AU - Iyer, SP AU - Nylen, A T2 - FORMAL METHODS IN SYSTEM DESIGN DA - 2004/1// PY - 2004/1// DO - 10.1023/B:FORM.0000004786.30007.f8 VL - 24 IS - 1 SP - 25-43 SN - 1572-8102 KW - infinite state systems KW - Petri nets KW - coverability KW - partial-order methods KW - unfoldings ER - TY - JOUR TI - Antipodal gray codes AU - Killian, CE AU - Savage, CD T2 - DISCRETE MATHEMATICS AB - An n-bit Gray code is a circular listing of the 2n n-bit strings so that successive strings differ only in one bit position. An n-bit antipodal Gray code has the additional property that the complement of any string appears exactly n steps away in the list. The problem of determining for which values of n antipodal Gray codes can exist was posed by Hunter Snevily, who showed them to be possible for n=1,2,3, and 4. In this paper, we show they are not possible for odd n>3 or for n=6. However, we provide a recursive construction to prove existence when n is a power of 2. The question remains open for any even n>6 which is not a power of 2. DA - 2004/4/28/ PY - 2004/4/28/ DO - 10.1016/j.disc.2003.07.012 VL - 281 IS - 1-3 SP - 221-236 SN - 0012-365X KW - gray code KW - Hamiltonian cycle KW - n-cube ER - TY - JOUR TI - A study of path protection in large-scale optical networks AU - Xin, YF AU - Rouskas, GN T2 - PHOTONIC NETWORK COMMUNICATIONS DA - 2004/5// PY - 2004/5// DO - 10.1023/B:PNET.0000026891.50610.48 VL - 7 IS - 3 SP - 267-278 SN - 1572-8188 KW - survivability KW - large-scale optical networks KW - topology design ER - TY - JOUR TI - A structured experiment of test-driven development AU - George, B AU - Williams, L T2 - INFORMATION AND SOFTWARE TECHNOLOGY AB - Test Driven Development (TDD) is a software development practice in which unit test cases are incrementally written prior to code implementation. We ran a set of structured experiments with 24 professional pair programmers. One group developed a small Java program using TDD while the other (control group), used a waterfall-like approach. Experimental results, subject to external validity concerns, tend to indicate that TDD programmers produce higher quality code because they passed 18% more functional black-box test cases. However, the TDD programmers took 16% more time. Statistical analysis of the results showed that a moderate statistical correlation existed between time spent and the resulting quality. Lastly, the programmers in the control group often did not write the required automated test cases after completing their code. Hence it could be perceived that waterfall-like approaches do not encourage adequate testing. This intuitive observation supports the perception that TDD has the potential for increasing the level of unit testing in the software industry. DA - 2004/4/15/ PY - 2004/4/15/ DO - 10.1016/j.infsof.2003.09.011 VL - 46 IS - 5 SP - 337-342 SN - 1873-6025 KW - software engineering KW - test driven development KW - extreme programming KW - agile methodologies ER - TY - JOUR TI - A framework and ontology for dynamic Web services selection AU - Maximilien, EM AU - Singh, MP T2 - IEEE INTERNET COMPUTING AB - Current Web services standards lack the means for expressing a service's nonfunctional attributes - namely, its quality of service. QoS can be objective (encompassing reliability, availability, and request-to-response time) or subjective (focusing on user experience). QoS attributes are key to dynamically selecting the services that best meet user needs. This article addresses dynamic service selection via an agent framework coupled with a QoS ontology. With this approach, participants can collaborate to determine each other's service quality and trustworthiness. DA - 2004/// PY - 2004/// DO - 10.1109/MIC.2004.27 VL - 8 IS - 5 SP - 84-93 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-6944254513&partnerID=MN8TOARS ER - TY - CHAP TI - A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation AU - Li, Xiao Yu AU - Stallmann, Matthias F. AU - Brglez, Franc T2 - Theory and Applications of Satisfiability Testing AB - Advances in local-search SAT solvers have traditionally been presented in the context of local search solvers only. The most recent and rather comprehensive comparisons between UnitWalk and several versions of WalkSAT demonstrate that neither solver dominates on all benchmarks. QingTing2 (a ‘dragonfly’ in Mandarin) is a SAT solver script that relies on a novel switching strategy to invoke one of the two local search solvers: WalkSAT or QingTing1. The local search solver QingTing1 implements the UnitWalk algorithm with a new unit-propagation technique. The experimental methodology we use not only demonstrates the effectiveness of the switching strategy and the efficiency of the new unit-propagation implementation – it also supports, on the very same instances, statistically significant performance evaluation between local search and other state-of-the-art DPLL-based SAT solvers. The resulting comparisons show a surprising pattern of solver dominance, completely unanticipated when we began this work. CN - QA9.3 .S365 2003 PY - 2004/// DO - 10.1007/978-3-540-24605-3_5 VL - 2919 SP - 53-68 OP - PB - Springer Berlin Heidelberg SN - 9783540208518 9783540246053 UR - http://dx.doi.org/10.1007/978-3-540-24605-3_5 DB - Crossref ER - TY - JOUR TI - Utility functions for ceteris paribus preferences AU - McGeachie, M AU - Doyle, J T2 - COMPUTATIONAL INTELLIGENCE AB - Ceteris paribus (all‐else equal) preference statements concisely represent preferences over outcomes or goals in a way natural to human thinking. Although deduction in a logic of such statements can compare the desirability of specific conditions or goals, many decision‐making methods require numerical measures of degrees of desirability. To permit ceteris paribus specifications of preferences while providing quantitative comparisons, we present an algorithm that compiles a set of qualitative ceteris paribus preferences into an ordinal utility function. Our algorithm is complete for a finite universe of binary features. Constructing the utility function can, in the worst case, take time exponential in the number of features, but common independence conditions reduce the computational burden. We present heuristics using utility independence and constraint‐based search to obtain efficient utility functions. DA - 2004/5// PY - 2004/5// DO - 10.1111/j.0824-7935.2004.00235.x VL - 20 IS - 2 SP - 158-217 SN - 1467-8640 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2442539195&partnerID=MN8TOARS KW - qualitative decision theory KW - rationality KW - ceteris paribus preferences ER - TY - JOUR TI - The Kronecker product and stochastic automata networks AU - Langville, AN AU - Stewart, WJ T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS AB - This paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Product paper (J. Comput. Appl. Math. 123 (2000) 85). We collect and catalog the most useful properties of the Kronecker product and present them in one place. We prove several new properties that we discovered in our search for a stochastic automata network preconditioner. We conclude by describing one application of the Kronecker product, omitted from Van Loan's list of applications, namely stochastic automata networks. DA - 2004/6/1/ PY - 2004/6/1/ DO - 10.1016/j.cam.2003.10.010 VL - 167 IS - 2 SP - 429-447 SN - 1879-1778 KW - stochastic automata networks KW - Kronecker products KW - Kronecker product properties KW - preconditioning ER - TY - JOUR TI - Scalable hierarchical locking for distributed systems AU - Desai, N AU - Mueller, F T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such guarantees enables resource sharing and computing with distributed objects in systems with a large number of nodes. The objective of our work is to enhance middleware services to provide scalability of synchronization and to support state replication in distributed systems. We have designed and implemented a middleware protocol in support of these objectives. Its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our technical contribution is a novel, fully decentralized, hierarchical locking protocol to enhance concurrency in distributed resource allocation following the specification of general concurrency services for large-scale data and object repositories. Our experiments on an IBM SP show that the number oF messages approaches an asymptote at 15 node from which point on the message overhead is in the order of 3-9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. Specifically, in the range of up to 80 nodes, response times under 10 ms are observed for critical sections that are one 25th the size of noncritical code. The high degree of scalability and responsiveness of our protocol is due in large to a high level of concurrency upon resolving requests combined with dynamic path compression for request propagation paths. Our approach is not only applicable to CORBA, its principles are shown to provide benefits to general distributed concurrency services and transaction models. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging From large-scale clusters to server-style computing. DA - 2004/6// PY - 2004/6// DO - 10.1016/j.jpdc.2003.10.001 VL - 64 IS - 6 SP - 708-724 SN - 1096-0848 KW - distributed mutual exclusion KW - middleware services KW - distributed resource allocation KW - concurrency services KW - hierarchical locking KW - peer-to peer protocols KW - scalability KW - large-scale distributed computing KW - distributed agreement KW - distributed transactions ER - TY - JOUR TI - Prospects for preferences AU - Doyle, J T2 - COMPUTATIONAL INTELLIGENCE AB - This article examines prospects for theories and methods of preferences, both in the specific sense of the preferences of the ideal rational agents considered in economics and decision theory and in the broader interplay between reasoning and rationality considered in philosophy, psychology, and artificial intelligence. Modern applications seek to employ preferences as means for specifying, designing, and controlling rational behaviors as well as descriptive means for understanding behaviors. We seek to understand the nature and representation of preferences by examining the roles, origins, meaning, structure, evolution, and application of preferences. DA - 2004/5// PY - 2004/5// DO - 10.1111/j.0824-7935.2004.00233.x VL - 20 IS - 2 SP - 111-136 SN - 1467-8640 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2442654406&partnerID=MN8TOARS KW - decision theory KW - preference KW - utility KW - rationality KW - limited rationality KW - reasoning KW - learning KW - preference representation KW - preference structure KW - preference change ER -