TY - JOUR TI - Multi-Destination Communication in Broadcast WDM Networks: A Survey AU - Thaker, D. AU - Rouskas, G.N. T2 - Optical Networks DA - 2002/1// PY - 2002/1// VL - 3 IS - 1 SP - 34–44 ER - TY - CHAP TI - Formal description of the jumpstart just-in-time signaling protocol using EFSM AU - Zaim, AH AU - Baldine, I AU - Cassada, M AU - Rouskas, GN AU - Perros, HG AU - Stevenson, D AU - Ghani, N AU - Sivalingam, KM T2 - Opticomm 2002: Optical Networking and Communications AB - We present a formal protocol description for a Just-In-Time (JIT) signaling scheme running over a core dWDM network which utilizes Optical Burst Switches (OBS). We apply an eight-tuple extended finite state machine (EFSM) model to formally specify the protocol. Using the EFSM model, we define the communication between a source client node and a destination client node through an ingress and one or multiple intermediate switches. We worked on single burst connections that means setting up the connection just before sending a single burst and then closing the connection as soon as the burst is sent. The communication between the EFSMs is handled through message transfer between protocol entities. PY - 2002/// DO - 10.1117/12.475294 VL - 4874 SP - 160-173 PB - SE - ER - TY - JOUR TI - Access protocols for optical burst-switched ring networks AU - Xu, LS AU - Perros, HG AU - Rouskas, GN AU - Caulfield, HJ AU - Chen, SH AU - Duro, R AU - Honavar, V AU - Kerre, EE AU - Lu, M AU - Romay, MG AU - Shih, TK AU - Ventura, D AU - Wang, PP AU - Yang, YY T2 - Proceedings of the 6th Joint Conference on Information Sciences DA - 2002/// PY - 2002/// SP - 1287-1290 ER - TY - CHAP TI - A tutorial on optical networks AU - Rouskas, GN AU - Perros, HG AU - Gregori, E AU - Anastasi, G AU - Basagni, S T2 - Advanced Lectures on Networking PY - 2002/// VL - 2497 SP - 155-193 PB - SE - ER - TY - RPRT TI - Optical Burst Switching: A Survey AU - Battestilli, L. AU - Perros, H. A3 - North Carolina State University DA - 2002/// PY - 2002/// M1 - TR-2002-10 M3 - Technical report PB - North Carolina State University SN - TR-2002-10 ER - TY - CONF TI - 'Using Maple to grade Maple' assessment software from North Carolina State University AU - Kaltofen, Erich AU - McLean, Michael AU - Norris, Larry C2 - 2002/// C3 - Proceedings 2002 Maple Workshop DA - 2002/// PB - Waterloo Maple Inc. With Dmitriy Morozov, John May and William Turner ER - TY - JOUR TI - Integrating Agile Practices into Software Engineering Courses AU - Hislop, Gregory W. AU - Lutz, Michael J. AU - Naveda, J. Fernando AU - McCracken, W. Michael AU - Mead, Nancy R. AU - Williams, Laurie A. T2 - Computer Science Education AB - Agile software development methodologies are gaining popularity in industry although they comprise a mix of accepted and controversial software engineering practices. It is quite likely that the software industry will find that specific project characteristics will determine the prudence of using an agile or a plan-driven methodology – or a hybrid of the two. Educators must assess the value and applicability of these emerging agile practices and decide what role they have in software engineering curricula. This paper provides a brief overview of several agile methodologies, including a discussion of evaluative research of agile practices in academia. The paper also considers instructional issues related to agile methods and the impact of agile methodologies on existing curricular references such as SWEBOK. DA - 2002/9// PY - 2002/9// DO - 10.1076/csed.12.3.169.8619 VL - 12 IS - 3 SP - 169-185 J2 - Computer Science Education LA - en OP - SN - 0899-3408 1744-5175 UR - http://dx.doi.org/10.1076/csed.12.3.169.8619 DB - Crossref ER - TY - CONF TI - Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm AU - Giesbrecht, Mark AU - Kaltofen, Erich AU - Lee, Wen-shin T2 - ISSAC 02: International symposium on symbolic and algebraic computation AB - As a sub-procedure our algorithm executes the Berlekamp/Massey algorithm on a sequence of large integers or polynomials. We give a fraction-free version of the Berlekamp/Massey algorithm, which does not require rational numbers or functions and GCD operations on the arising numerators and denominators. The relationship between the solution of Toeplitz systems, Pade approximations, and the Euclidean algorithm is classical. Fraction-free versions [3] can be obtained from the subresultant PRS algorithm [2]. Dornstetter [6] gives an interpretation of the Berlekamp/Massey algorithm as a partial extended Euclidean algorithm. We map the subresultant PRS algorithm onto Dornstetter's formulation. We note that the Berlekamp/Massey algorithm is more efficient than the classical extended Euclidean algorithm. C2 - 2002/// C3 - Proceedings of the 2002 international symposium on Symbolic and algebraic computation - ISSAC '02 CY - Lille, France DA - 2002/// PY - 2002/7// DO - 10.1145/780506.780519 PB - ACM Press SN - 1581134843 9781581134841 UR - http://dx.doi.org/10.1145/780506.780519 ER - TY - CONF TI - Missing White House e-mail: A whistleblowing case study AU - Gehringer, Edward F. T2 - 2002 American Society of Engineering Education Annual Conference and Exposition C2 - 2002/// C3 - Proceedings of the 2002 American Society of Engineering Education Annual Conference and Exposition CY - Montreal, Quebec DA - 2002/// PY - 2002/6/16/ PB - American Society for Engineering Education ER - TY - CHAP TI - The Cooperative Contract in Interactive Entertainment AU - Young, R. Michael T2 - Socially Intelligent Agents, Multiagent Systems, Artificial Societies, and Simulated Organizations A2 - Dautenhahm, Kerstin A2 - Bond, Alan A2 - Canamero, Lola A2 - Edmonds, Bruce AB - Interactions with computer games demonstrate many of the same social and communicative c onventions that are seen in conversations between people. I propose that a co-operative contract exists between computer game players and game systems (or their designers) that licenses both the game players’ and the game designers’ understanding of what components of the game mean. As computer and console games become more story-oriented and interactivity within these games becomes more sophisticated, this co-operative contract will become even more central to the e njoyment of a game experience. This chapter describes the nature of the co-operative contract and one way that we are designing game systems to leverage the contract to create more compelling experiences. PY - 2002/// DO - 10.1007/0-306-47373-9_28 VL - 3 SP - 229–234 PB - Springer SN - 9780306473739 9781402070570 ER - TY - RPRT TI - The Medication Advisor Project: Preliminary Report AU - Ferguson, George AU - Allen, James AU - Blaylock, Nate AU - Byron, Donna AU - Chambers, Nate AU - Dzikovska, Myroslava AU - Galescu, Lucian AU - Shen, Xipeng AU - Swier, Robert AU - Swift, Mary A3 - Dept. of Computer Science, University of Rochester DA - 2002/5// PY - 2002/5// M1 - 776 M3 - Technical Report PB - Dept. of Computer Science, University of Rochester SN - 776 ER - TY - JOUR TI - Privacy for Telecom Services AU - Singh, Munindar P. T2 - IEEE Internet Computing AB - Third-party services have great potential value to users, service providers, and telecom operators, but significant challenges arise when subscribers can personalize them. DA - 2002/1// PY - 2002/1// DO - 10.1109/MIC.2002.978364 VL - 6 IS - 1 SP - 4–5 ER - TY - CONF TI - Composition Constraints for Semantic Web Services AU - Cheng, Zhengang AU - Singh, Munindar P. AU - Vouk, Mladen A. C2 - 2002/5// C3 - Proceedings of the WWW Conference Workshop on Real World RDF and Semantic Web Applications DA - 2002/5// ER - TY - CHAP TI - Embedded Technology (Ubiquitous Computing) AU - Singh, Munindar P. T2 - Computer Sciences A2 - Flynn, Roger R. PY - 2002/// PB - Macmillan ER - TY - CHAP TI - Agents AU - Singh, Munindar P. T2 - Computer Sciences A2 - Flynn, Roger R. PY - 2002/// PB - Macmillan ER - TY - CONF TI - Flexible Caching in Peer-to-Peer Information Systems AU - Yolum, Pınar AU - Singh, Munindar P. T3 - CEUR Workshop Proceedings C2 - 2002/7// C3 - Proceedings of the 4th International Bi-Conference Workshop on Agent-Oriented Information Systems (AOIS 2002) DA - 2002/7// ER - TY - CONF TI - Search in Referral Networks AU - Yu, Bin AU - Singh, Munindar P. C2 - 2002/7// C3 - Proceedings of AAMAS Workshop on Regulated Agent-Based Social Systems: Theories and Applications DA - 2002/7// ER - TY - CHAP TI - JumpStart: A Just-in-Time Signaling Architecture for WDM Burst-Switched Networks AU - Baldine, Ilia AU - Perros, Harry G. AU - Rouskas, George N. AU - Stevenson, Dan T2 - NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications A2 - Gregori, E. A2 - Conti, M. A2 - Campbell, A.T. A2 - Omidyar, G. A2 - Zukerman, M. T3 - Lecture Notes in Computer Science AB - We present an architecture for a core dWDM network which utilizes the concept of Optical Burst Switching (OBS) coupled with a Just-In-Time (JIT) signaling scheme. It is a reservation based architecture whose distinguishing characteristics are its relative simplicity, its amenability to hardware implementation, support for quality of service and multicast natively. Another important feature is data transparency - the network infrastructure is independent of the format of the data being transmitted on individual wavelengths. In this article we present a brief overview of the architecture and outline the most salient features. PY - 2002/// DO - 10.1007/3-540-47906-6_88 SP - 1081-1086 OP - PB - Springer Berlin Heidelberg SN - 9783540437093 9783540479062 SV - 2345 UR - http://dx.doi.org/10.1007/3-540-47906-6_88 DB - Crossref ER - TY - CHAP TI - Helios: A Broadcast Optical Architecture AU - Baldine, Ilia AU - Jackson, Laura E. AU - Rouskas, George N. T2 - NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications AB - In this article we present a new all-optical broadcast LAN architecture and an accompanying signaling protocol. The distinguishing characteristics of this architecture are its fault-tolerant design and its collision-free nature, which allows it to achieve high throughput in a broadcast environment. The flexibility of the design allows different schedulers to be used, which can introduce new features into the network (e.g. multicast and QoS) as well as optimize its behavior for the specific setting in which it is used. PY - 2002/// DO - 10.1007/3-540-47906-6_72 SP - 887-898 OP - PB - Springer Berlin Heidelberg SN - 9783540437093 9783540479062 UR - http://dx.doi.org/10.1007/3-540-47906-6_72 DB - Crossref ER - TY - CHAP TI - A Simulation Study of Access Protocols for Optical Burst-Switched Ring Networks AU - Xu, Lisong AU - Perros, Harry G. AU - Rouskas, George N. T2 - NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications A2 - Gregori, E. A2 - Conti, M. A2 - Campbell, A.T. A2 - Omidyar, G. A2 - Zukerman, M. T3 - Lecture Notes in Computer Science AB - In this paper, we consider a WDM metro ring architecture with optical burst switching. Several access protocols are proposed and their performance is analyzed by simulation. PY - 2002/// DO - 10.1007/3-540-47906-6_70 SP - 863-874 OP - PB - Springer Berlin Heidelberg SN - 9783540437093 9783540479062 SV - 2345 UR - http://dx.doi.org/10.1007/3-540-47906-6_70 DB - Crossref ER - TY - CHAP TI - Performance Analysis of LEO Satellite Networks AU - Zaim, A. Halim AU - Perros, Harry G. AU - Rouskas, George N. T2 - NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications A2 - Gregori, E. A2 - Conti, M. A2 - Campbell, A.T. A2 - Omidyar, G. A2 - Zukerman, M. T3 - Lecture Notes in Computer Science AB - We present an analytical model for computing call blocking probabilities in a LEO satellite network that carries voice calls. Both satellite-fixed and earth-fixed constellations with inter-orbit links and hand-offs are considered. The model is analyzed approximately by decomposing it into sub-systems. Each sub-system is solved in isolation exactly using a Markov process, and the individual results are combined together through an iterative method. Numerical results demonstrate that our method is accurate for a wide range of traffic patterns. PY - 2002/// DO - 10.1007/3-540-47906-6_64 SP - 790-801 OP - PB - Springer Berlin Heidelberg SN - 9783540437093 9783540479062 SV - 2345 UR - http://dx.doi.org/10.1007/3-540-47906-6_64 DB - Crossref ER - TY - CONF TI - LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA AU - Dumas, J. G. AU - Gautier, T. AU - Giesbrecht, M. AU - Giorgi, P. AU - Hovinen, B. AU - Kaltofen, E. AU - Saunders, B. D. AU - Turner, W. J. AU - Villard, G. T2 - Proceedings of the First International Congress of Mathematical Software AB - Black box techniques [12] are enabling exact linear algebra computations of a scale well beyond anything previously possible. The development of new and interesting algorithms has proceeded apace for the past two decades. It is time for the dissemination of these algorithms in an easily used software library so that the mathematical community may readily take advantage of their power. LinBox is that library. In this paper, we describe the design of this generic library, sketch its current range of capabilities, and give several examples of its use. The examples include a solution of Trefethen’s “Hundred Digit Challenge” problem #7 [14] and the computation of all the homology groups of simplicial complexes using the Smith normal form [8]. Exact black box methods are currently successful on sparse matrices with hundreds of thousands of rows and columns and having several million nonzero entries. The main reason large problems can be solved by black box methods is that they require much less memory in general than traditional eliminationbased methods do. This fact is widely used in the numerical computation area. We refer for instance to the templates for linear system solution and eigenvalue problems [2,1]. This has also led the computer algebra community to a considerable interest in black box methods. Since Wiedemann’s seminal paper [16], many developments have been proposed especially to adapt Krylov or Lanczos methods to fast exact algorithms. We refer to [5] and references therein for a review of problems and solutions. LinBox supplies efficient black box solutions for a variety of problems including linear equations and matrix normal forms with the guiding design principle of re-usability. The most essential and driving design criterion for LinBox is that it is generic with respect to the domain of computation. This is because there are many and various representations of finite fields each of which is advantageous to use for some algorithm under some circumstance. The integral and rational number capabilities depend heavily on modular C2 - 2002/7// C3 - Mathematical Software DA - 2002/7// DO - 10.1142/9789812777171_0005 PB - WORLD SCIENTIFIC SN - 9789812380487 9789812777171 UR - http://dx.doi.org/10.1142/9789812777171_0005 DB - Crossref ER - TY - CONF TI - An output-sensitive variant of the baby steps/giant steps determinant algorithm AU - Kaltofen, Erich T2 - the 2002 international symposium AB - In the first of 2000, two new algorithms were discovered for the efficient computation of the determinant of a (dense) matrix with integer entries. Suppose that the dimension of the matrix is n x n and that the maximum bit length of all entries is b. The algorithm by [10] requires (n3.5b2.5)1+o(1) fixed precision, that is, bit operations. Here and in the following we use the exponent +o(1) to capture missing polylogarithmic factors O((log n)C1(log b)C2), where C1, C2 are constants (soft-O). As it has turned out an algorithm in [15], which in turn is based on one by [31] and which uses the baby steps/giant steps algorithm design technique, can be adapted to the dense integer matrix determinant problem and then has bit complexity (n3.5b)1+o(1) [20, Section 2]. Both algorithms use randomization and the algorithm in [10] is Monte Carlo--always fast and probably correct--and the one in [20] is Las Vegas--always correct and probably fast. Both algorithms can be speeded by asymptotically fast subcubic matrix multiplication algorithms a la Strassen [8, 7, 14]. By blocking [6, 16, 29, 30] the baby steps/giant steps algorithm can be further improved, which yields the currently fastest known algorithms [20, Section 3] of bit complexity (n3+1/3b)1+o(1), that without subcubic matrix multiplication and without the FFT-based polynomial half GCD procedures a la Knuth [23; 2, Chapter 8], and of bit complexity n2.698b1+o(1) with subcubic matrix multiplication and FFT-based polynomial GCD procedures. C2 - 2002/// C3 - Proceedings of the 2002 international symposium on Symbolic and algebraic computation - ISSAC '02 DA - 2002/// DO - 10.1145/780506.780524 PB - ACM Press SN - 1581134843 UR - http://dx.doi.org/10.1145/780506.780524 DB - Crossref ER - TY - JOUR TI - The ρ operator T2 - ACM SIGMOD Record AB - In this paper, we introduce an approach that supports querying for Semantic Associations on the Semantic Web. Semantic Associations capture complex relationships between entities involving sequences of predicates, and sets of predicate sequences that interact in complex ways. Detecting such associations is at the heart of many research and analytical activities that are crucial to applications in national security and business intelligence. This in combination with the improving ability to identify entities in documents as part of automatic semantic annotation, gives a very powerful capability for semantic analysis of large amounts of heterogeneous content.The approach for supporting Semantic Associations discussed in this paper has four main facets. First, it generalizes these associations into three main classes based on their structural properties, allowing us to reason about them in a domain-independent manner. The second is the provision of an operator ρ for expressing queries about such associations. Third, it uses a graph data model for knowledge representation, allowing the semantic associations search techniques to be built upon the graph algorithms for paths, while integrating knowledge from the schema into the search process. The fourth facet is the use of a notion of context, which allows for restricting the search space and for context-driven ranking of results. Just as a Web search engine looks for relevant documents in the current Web, ρ can be seen as discovering and ranking complex relationships in the Semantic Web.In this paper, we demonstrate the need for supporting such complex semantic relationships. We also give a formal basis to the notion of Semantic Associations and give a brief discussion on our overall approach for discovering and ranking them. DA - 2002/12/1/ PY - 2002/12/1/ DO - 10.1145/637411.637418 UR - http://dx.doi.org/10.1145/637411.637418 ER - TY - JOUR TI - Working the flow T2 - IEEE Internet Computing DA - 2002/// PY - 2002/// UR - https://publons.com/publon/21294503/ ER - TY - JOUR TI - Who you gonna call? T2 - IEEE Internet Computing AB - Purpose: To develop a way to meet the safe staffing/call time guidelines issued in AORN, ASPAN and ISNA (Indiana State Nursing Association). DA - 2002/// PY - 2002/// DO - 10.1016/J.JOPAN.2009.05.046 UR - https://publons.com/publon/21294510/ ER - TY - JOUR TI - Treating health care T2 - IEEE Internet Computing DA - 2002/// PY - 2002/// UR - https://publons.com/publon/21294506/ ER - TY - JOUR TI - The pragmatic Web T2 - IEEE Internet Computing AB - Public administrations must communicate with a diverse citizenry concerning complex programs and initiatives. Because producing individual communications for a large citizenry is expensive, the communications are written generically, carefully discussing all possible contingencies and details. Because the programs are complex, these generic communications are difficult to understand. One way to communicate more effectively in this complex environment is to automatically tailor each communication based on the context of each individual citizen. This paper presents a prototype system that produces web presentations describing the programs offered by a public administration agency to the citizenry it serves. The work is presented as an example of work on the pragmatic web. Particular attention is focused on the system's authoring tool, which allows authors to produce and configure the resources required to drive the tailoring mechanism. DA - 2002/// PY - 2002/// DO - 10.1145/2507065.2507068 UR - https://publons.com/publon/14997407/ ER - TY - JOUR TI - Who you gonna call? AU - Singh, M.P. T2 - IEEE Internet Computing DA - 2002/// PY - 2002/// VL - 6 IS - 6 SP - 4-5 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036870154&partnerID=MN8TOARS ER - TY - JOUR TI - Treating health care AU - Singh, M.P. T2 - IEEE Internet Computing AB - The numbers are staggering. In a chilling report, the U.S. Institute of Medicine (10M) estimates that somewhere between 44,000 and 98,000 Americans die each year from avoidable medical costing the nation about US$17 billion to US$29 billion annually. Errors include failing to make timely and accurate diagnosis, selecting improper treatment, and following a treatment plan incorrectly. For example, hospital staff might give the wrong drug or dosage, or a surgeon might operate on the wrong body part. Errors in surgery or emergency treatment can be especially serious. The root causes of these errors are inadequate training, poor processes, and information systems that don't expose patient information at relevant times - sometimes leading to confusion about the patient's identity or the intended procedures. Network technologies show great promise in solving some of the dangerous and tragic avoidable medical that currently plague the health care industry. DA - 2002/// PY - 2002/// DO - 10.1109/MIC.2002.1020317 VL - 6 IS - 4 SP - 4-5 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036649265&partnerID=MN8TOARS ER - TY - JOUR TI - The pragmatic web AU - Singh, M.P. T2 - IEEE Internet Computing AB - People use the Web to share information. For machines to exploit information on theWeb, however, presupposes well-structured, meaningful markups, which is what the WorldWide Web Consortium's Semantic Web activities seek to develop (www.w3.org/2001/sw/). Currentapproaches are limited, however. They provide meaning only to the extent that it can be capturedstatically. I claim that successful approaches to creating the Semantic Web lie within the scope ofpragmatics. DA - 2002/// PY - 2002/// DO - 10.1109/MIC.2002.1003124 VL - 6 IS - 3 SP - 4-5 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036565269&partnerID=MN8TOARS ER - TY - JOUR TI - Deep Web structure T2 - IEEE Internet Computing DA - 2002/// PY - 2002/// UR - https://publons.com/publon/21294508/ ER - TY - CHAP TI - Commitment Machines AU - Yolum, Pınar AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social commitments of the participants. The content can be reasoned about by the agents thereby enabling flexible execution of the given protocol. We provide reasoning rules to capture the evolution of commitments through the agents’ actions. Because of its representation of content and its operational rules, a commitment machine effectively encodes a systematically enhanced version of the original protocol, which allows the original sequences of actions as well as other legal moves to accommodate exceptions and opportunities. We show how a commitment machine can be compiled into a finite state machine for efficient execution, and prove soundness and completeness of our compilation procedure. PY - 2002/// DO - 10.1007/3-540-45448-9_17 SP - 235-247 OP - PB - Springer Berlin Heidelberg SN - 9783540438588 9783540454489 UR - http://dx.doi.org/10.1007/3-540-45448-9_17 DB - Crossref ER - TY - CONF TI - Flexible protocol specification and execution: Applying event calculus planning using commitments AU - Yolum, P. AU - Singh, M.P. C2 - 2002/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2002/// SP - 527-534 M1 - 1 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036361523&partnerID=MN8TOARS ER - TY - JOUR TI - Distributed reputation management for electronic commerce AU - Yu, B. AU - Singh, M.P. T2 - Computational Intelligence DA - 2002/// PY - 2002/// VL - 18 IS - 4 SP - 535-549 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036862099&partnerID=MN8TOARS ER - TY - BOOK TI - Commitment machines AU - Yolum, P. AU - Singh, M.P. DA - 2002/// PY - 2002/// VL - 2333 LNAI SE - 235-247 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84901701271&partnerID=MN8TOARS ER - TY - CONF TI - An evidential model of distributed reputation management AU - Yu, B. AU - Singh, M.P. C2 - 2002/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2002/// SP - 294-301 M1 - 2 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036362188&partnerID=MN8TOARS ER - TY - CONF TI - An agent-based approach to knowledge management AU - Yu, B. AU - Singh, M.P. C2 - 2002/// C3 - International Conference on Information and Knowledge Management, Proceedings DA - 2002/// SP - 642-644 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0037480812&partnerID=MN8TOARS ER - TY - CONF TI - Efficient utility functions for ceteris paribus preferences AU - McGeachie, M. AU - Doyle, J. C2 - 2002/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2002/// SP - 279-284 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036926279&partnerID=MN8TOARS ER - TY - CONF TI - The role of a skeptic agent in testing and benchmarking of SAT algorithms AU - Brglez, Franc AU - Li, X AU - Stallmann, M T2 - Citeseer C2 - 2002/// C3 - Fifth International Symposium on theTheory and Applications of Satisfiability Testing DA - 2002/// ER - TY - CONF TI - An effective strategy for dynamic mapping of peer reviewers AU - Gehringer, Edward F. AU - Cui, Yun T2 - 2002 ASEE Annual Conference and Exposition C2 - 2002/// C3 - 2002 ASEE Annual Conference and Exposition CY - Montreal, Quebec DA - 2002/// PY - 2002/6/16/ PB - American Society for Engineering Education ER - TY - CONF TI - To see or not to see: Access restrictions on course Web sites AU - Gehringer, Edward F. T2 - 2002 ASEE Annual Conference and Exposition C2 - 2002/// C3 - Proceedings of the 2002 ASEE Annual Conference and Exposition CY - Montreal, Quebec DA - 2002/// PY - 2002/6/16/ PB - American Society for Engineering Education ER - TY - CONF TI - Exploring pair programming in distributed object-oriented team projects AU - Baheti, Prashant AU - Williams, Laurie A. AU - Gehringer, Edward F. AU - Stotts, David T2 - OOPSLA 2002 Educator's Symposium C2 - 2002/// C3 - Proceedings of the Object-Oriented Programming Systems, Languages, and Applications 2002 Educators’ Symposium CY - Seattle, WA DA - 2002/// PY - 2002/11/2/ ER - TY - CONF TI - A survey of web resources for teaching computer architecture AU - Yurcik, William AU - Gehringer, Edward F. T2 - the 2002 workshop AB - The use of Web resources is becoming a core part of teaching computer architecture. In this paper we identify five notable Web sites that specialize in teaching tools for computer architecture instructors and discuss the role they can play in facilitating learning. While these Web sites contain a wide range of valuable resources, there remain gaps in what is available online. Community support appears meager for making tools and resources available. We conclude that the computer-architecture community faces challenges both in the content of Web-based materials (accurate and appropriate information) and the process (making information known and available to academic community). C2 - 2002/// C3 - Proceedings of the 2002 workshop on Computer architecture education Held in conjunction with the 29th International Symposium on Computer Architecture - WCAE '02 DA - 2002/// DO - 10.1145/1275462.1275492 PB - ACM Press SN - 9781450347310 UR - http://dx.doi.org/10.1145/1275462.1275492 DB - Crossref ER - TY - CHAP TI - Exploring the Efficacy of Distributed Pair Programming AU - Baheti, Prashant AU - Gehringer, Edward AU - Stotts, David T2 - Extreme Programming and Agile Methods — XP/Agile Universe 2002 AB - Pair programming is one of the twelve practices of Extreme Programming (XP). Pair programming is usually performed by programmers that are collocated — working in front of the same monitor. But the inevitability of distributed development of software gives rise to important questions: How effective is pair programming if the pairs are not physically next to each other? What if the programmers are geographically distributed? An experiment was conducted at North Carolina State University to compare different working arrangements of student teams developing object-oriented software. Teams were both collocated and in distributed environments; some teams practiced pair programming while others did not. In particular, we compared the software developed by virtual teams using distributed pair programming against collocated teams using pair programming and against virtual teams that did not employ distributed pair programming. The results of the experiment indicate that it is feasible to develop software using distributed pair programming, and that the resulting software is comparable to software developed in collocated or virtual teams (without pair programming) in productivity and quality. PY - 2002/// DO - 10.1007/3-540-45672-4_20 SP - 208-220 OP - PB - Springer Berlin Heidelberg SN - 9783540440246 9783540456728 UR - http://dx.doi.org/10.1007/3-540-45672-4_20 DB - Crossref ER - TY - BOOK TI - Extreme programming and agile methods XP/Agile Universe 2002 : Second XP Universe and First Agile Universe Conference, Chicago, IL, USA, August 4-7, 2002 : proceedings DA - 2002/// PY - 2002/// PB - Berlin ;|aNew York: Springer ER - TY - RPRT TI - Visual factors affecting pilots' judgments of the position of the touchdown during emergency landings AU - Mershon, D. H. AU - Mayer, C. M. AU - McAlister, D. F. A3 - NASA-Ames C6 - NAG 2-1281 DA - 2002/// PY - 2002/// PB - NASA-Ames ER - TY - PAT TI - Field emission from bias-grown diamond thin films in a microwave plasma AU - Gruen, D. M. AU - Krauss, A. R. AU - Ding, M. Q. AU - Auciello, O. C2 - 2002/// DA - 2002/// PY - 2002/// ER - TY - CONF TI - Pair programming in an introductory computer science course: Initial results and recommendations AU - Williams, L. AU - Yang, K. AU - Wiebe, E. AU - Ferzli, M. AU - Miller, C. C2 - 2002/// C3 - OOPSLA 2002: 17th ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications : conference proceedings: November 4-8, 2002, Washington State Convention and Trade Center, Seattle, Washington, USA DA - 2002/// PB - New York, NY: ACM Press SN - 1581134711 ER - TY - JOUR TI - In support of paired programming in the introductory computer science course AU - Williams, L. AU - Wiebe, E. AU - Yang, K. AU - Ferzli, M. AU - Miller, C. T2 - Computer Science Education AB - A formal pair programming experiment was run at North Carolina to empirically assess the educational efficacy of the technique in a CS1 course. Results indicate that students who practice pair programming perform better on programming projects and are more likely to succeed by completing the class with a C or better. Student pairs are more self-sufficient which reduces their reliance on the teaching staff. Qualitatively, paired students demonstrate higher order thinking skills than students who work alone. These results are supportive of pair programming as a collaborative learning technique. DA - 2002/// PY - 2002/// DO - 10.1076/csed.12.3.197.8618 VL - 12 IS - 3 SP - 197-212 ER - TY - JOUR TI - High-throughput transgene copy number estimation by competitive PCR AU - Callaway, AS AU - Abranches, R AU - Scroggs, J AU - Allen, GC AU - Thompson, WF T2 - PLANT MOLECULAR BIOLOGY REPORTER DA - 2002/9// PY - 2002/9// DO - 10.1007/BF02782462 VL - 20 IS - 3 SP - 265-277 SN - 0735-9640 KW - competitive KW - copy number KW - high throughput KW - PCR KW - quantitative KW - transgenic ER - TY - CHAP TI - Performance adaptation in real-time intrusion detection systems AU - Lee, W. AU - Cabrera, J. B. D. AU - Thomas, A. AU - Balwalli, N. AU - Saluja, S. AU - Zhang, Y. T2 - Recent advances in intrusion detection, 5th international symposium, RAID 2002, Zurich, Switzerland, October 16-18, 2002: Proceedings A2 - A. Wespi, G. Vigna A2 - Deri, L. CN - QA76.9 .A25 R34 2002 PY - 2002/// VL - 2516 SP - 252-273 PB - Berlin; New York: Springer SN - 3540000208 ER - TY - CHAP TI - Analyzing intensive intrusion alerts via correlation AU - Ning, P. AU - Cui, Y. AU - Reeves, D. S. T2 - Recent advances in intrusion detection, 5th international symposium, RAID 2002, Zurich, Switzerland, October 16-18, 2002: Proceedings A2 - A. Wespi, G. Vigna A2 - Deri, L. AB - Traditional intrusion detection systems (IDSs) focus on low-level attacks or anomalies, and raise alerts independently, though there may be logical connections between them. In situations where there are intensive intrusions, not only will actual alerts be mixed with false alerts, but the amount of alerts will also become unmanageable. As a result, it is difficult for human users or intrusion response systems to understand the alerts and take appropriate actions. Several complementary alert correlation methods have been proposed to address this problem. As one of these methods, we have developed a framework to correlate intrusion alerts using prerequisites of intrusions. In this paper, we continue this work to study the feasibility of this method in analyzing real-world, intensive intrusions. In particular, we develop three utilities (called adjustable graph reduction, focused analysis, and graph decomposition) to facilitate the analysis of large sets of correlated alerts. We study the effectiveness of the alert correlation method and these utilities through a case study with the network traffic captured at the DEF CON 8 Capture the Flag (CTF) event. Our results show that these utilities can simplify the analysis of large amounts of alerts, and also reveals several attack strategies that were repeatedly used in the DEF CON 8 CTF event. CN - QA76.9 .A25 R34 2002 PY - 2002/// DO - 10.1007/3-540-36084-0_5 VL - 2516 SP - 74-94 PB - Berlin; New York: Springer SN - 3540000208 ER - TY - JOUR TI - What is Church's thesis? An outline AU - Doyle, J T2 - MINDS AND MACHINES DA - 2002/11// PY - 2002/11// DO - 10.1023/A:1021126521437 VL - 12 IS - 4 SP - 519-520 SN - 0924-6495 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036869514&partnerID=MN8TOARS ER - TY - JOUR TI - Linguistics and the law: how knowledge of, or ignorance of, elementary linguistics may affect the dispensing of justice AU - Rodman, R T2 - FORENSIC LINGUISTICS-THE INTERNATIONAL JOURNAL OF SPEECH LANGUAGE AND THE LAW AB - Ignorance of elementary linguistic concepts may have a bearing on justice. This thesis is drawn from the conviction appeal of a Haitian-born American sentenced to prison for 12 years for dealing cocaine. The verdict was based in part on a surreptitious recording of the drug deal. Although the drug dealer on the tape spoke a dialect of American Black English, and the defendant speaks English with a Creole accent, the State persuaded the jury that the Haitian disguised his voice by purposefully dropping his accent. His ability to perform this feat was attributed in testimony to the fact that he had been an interpreter for the United States Army in Haiti, and was therefore a linguist, and therefore understood ‘sound change’, and therefore could disguise his voice by dropping his foreign accent. This absurd chain of non sequiturs, and the resulting miscarriage of justice, is the result of linguistic naivety and would not have occurred if the court knew that an interpreter is not necessarily a linguist, and that sound change refers to the historical development of languages. DA - 2002/// PY - 2002/// DO - 10.1558/sll.2002.9.1.94 VL - 9 IS - 1 SP - 94-103 SN - 1350-1771 KW - linguistics KW - law KW - legal profession KW - justice system ER - TY - JOUR TI - Forensic speaker identification based on spectral moments AU - Rodman, R AU - McAllister, D AU - Bitzer, D AU - Cepeda, L AU - Abbitt, P T2 - FORENSIC LINGUISTICS-THE INTERNATIONAL JOURNAL OF SPEECH LANGUAGE AND THE LAW AB - A new method for doing text-independent speaker identification geared to forensic situations is presented. By analysing ‘isolexemic’ sequences, the method addresses the issues of very short criminal exemplars and the need for open-set identification. An algorithm is given that computes an average spectral shape of the speech to be analysed for each glottal pulse period. Each such spectrum is converted to a probability density function and the first moment (i.e. the mean) and the second moment about the mean (i.e. the variance) are computed. Sequences of moment values are used as the basis for extracting variables that discriminate among speakers. Ten variables are presented all of which have sufficiently high inter- to intraspeaker variation to be effective discriminators. A case study comprising a ten-speaker database, and ten unknown speakers, is presented. A discriminant analysis is performed and the statistical measurements that result suggest that the method is potentially effective. The report represents work in progress. DA - 2002/// PY - 2002/// DO - 10.1558/sll.2002.9.1.22 VL - 9 IS - 1 SP - 22-43 SN - 1350-1771 KW - speaker identification KW - spectral moments KW - isolexemic sequences KW - glottal pulse period ER - TY - CONF TI - Commitment machines AU - Yolum, P. AU - Singh, M. P. C2 - 2002/// C3 - Intelligent agents VIII: Agent theories, architectures, and languages (Lecture notes in computer science; 2333) CN - QA76.76 .I58 A83 2001 DA - 2002/// VL - 2333 SP - 235-247 PB - Berlin ; New York: Springer SN - 3540438580 ER - TY - CHAP TI - A tutorial on optical networks AU - Rouskas, G. N. AU - Perros, H. G. T2 - Advanced lectures on networking: Networking 2002 tutorials A2 - E. Gregori, G. Anastasi A2 - Basagni, S. CN - TK5105.5 .A327 2002 PY - 2002/// VL - 2497 SP - 155-193 PB - Berlin; New York: Springer SN - 3540001654 ER - TY - JOUR TI - Teaching PSP: Challenges and lessons learned AU - Borstler, J AU - Carrington, D AU - Hislop, GW AU - Lisack, S AU - Olson, K AU - Williams, L T2 - IEEE SOFTWARE AB - Software engineering educators need to provide environments where students learn about the size and complexity of modern software systems and the techniques available for managing these difficulties. Five universities used the personal software process to teach software engineering concepts in a variety of contexts. DA - 2002/// PY - 2002/// DO - 10.1109/MS.2002.1032853 VL - 19 IS - 5 SP - 42-+ SN - 0740-7459 ER - TY - CHAP TI - Applying the Generalized Vickrey Auction to pricing reliable multicasts AU - Sureka, A. AU - Wurman, P. R. T2 - Burkhard Stiller ...[et al.] (Eds.), From QoS provisioning to QoS charging: Third COST 263 International Workshop on Quality of Future Internet Services, QofIS 2002 and second International Workshop on Internet Charging and QoS Technologies, ICQT 2002, Zurich, Switzerland, October 16-18, 2002 CN - TK5105.875. I57 C67 2002 PY - 2002/// VL - 2511 SP - 283-292 PB - Berlin; New York: Springer SN - 3540443568 ER - TY - CHAP TI - The economic impact of network pricing intervals AU - Fulp, E. W. AU - Reeves, D. S. T2 - Burkhard Stiller ...[et al.] (Eds.), From QoS provisioning to QoS charging: Third COST 263 International Workshop on Quality of Future Internet Services, QofIS 2002 and second International Workshop on Internet Charging and QoS Technologies, ICQT 2002, Zurich, Switzerland, October 16-18, 2002 AB - Interval pricing can provide an effective means of congestion control as well as revenue generation. Using this method, prices are fixed over intervals of time, providing adaptability and predictability. An important issue is the interval duration associated with price updates. While previous research has discussed the effect of interval lengths on congestion control, this paper investigates the economic impact of price interval duration. Smaller intervals yield higher profits since prices are more responsive to changing demands. However, experimental results indicate only a modest profit gain (no more than 5%) is achieved when smaller intervals are used as opposed to larger intervals (for example 100 times longer). Given users preferences toward fewer price changes, smaller price intervals may hold few economic benefits. CN - TK5105.875. I57 C67 2002 PY - 2002/// DO - 10.1007/3-540-45859-x_30 VL - 2511 SP - 315-324 PB - Berlin; New York: Springer SN - 3540443568 ER - TY - JOUR TI - Design and implementation of a decentralized prototype system for detecting distributed attacks AU - Ning, P AU - Jajodia, S AU - Wang, XYS T2 - COMPUTER COMMUNICATIONS AB - This paper presents the design and implementation of a decentralized research prototype intrusion detection system (IDS) named coordinated attacks response and detection system (CARDS), which aims at detecting distributed attacks that cannot be detected using data collected at any single place. CARDS adopts a signature-based approach. It consists of three kinds of independent but cooperative components: signature manager, monitor, and directory service. Unlike traditional distributed IDSs, CARDS decomposes global representations of distributed attacks into smaller units (called detection tasks) that correspond to the distributed events indicating the attacks, and then executes and coordinates the detection tasks in the places where the corresponding events are observed. DA - 2002/9/15/ PY - 2002/9/15/ DO - 10.1016/S0140-3664(02)00039-7 VL - 25 IS - 15 SP - 1374-1391 SN - 1873-703X KW - decentralized intrusion detection KW - misuse detection KW - computer security KW - network security ER - TY - JOUR TI - The centroid decomposition: Relationships between discrete variational decompositions and SVDs AU - Chu, MT AU - Fundelic, RE T2 - SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS AB - The centroid decomposition, an approximation for the singular value decomposition (SVD), has a long history among the statistics/psychometrics community for factor analysis research. We revisit the centroid method in its original context of factor analysis and then adapt it to other than a covariance matrix. The centroid method can be cast as an ${\cal O}(n)$-step ascent method on a hypercube. It is shown empirically that the centroid decomposition provides a measurement of second order statistical information of the original data in the direction of the corresponding left centroid vectors. One major purpose of this work is to show fundamental relationships between the singular value, centroid, and semidiscrete decompositions. This unifies an entire class of truncated SVD approximations. Applications include semantic indexing in information retrieval. DA - 2002/5/10/ PY - 2002/5/10/ DO - 10.1137/S0895479800382555 VL - 23 IS - 4 SP - 1025-1044 SN - 1095-7162 KW - data matrix KW - loading matrix KW - scoring matrix KW - indexing matrix KW - factor analysis KW - centroid method KW - singular value decomposition KW - low rank approximation KW - semidiscrete decomposition KW - centroid decomposition KW - low rank decompositions KW - integer programming ER - TY - CONF TI - Inter-packet delay based correlation for tracing encrypted connections through stepping stones AU - Wang, X. Y. AU - Reeves, D. S. AU - Wu, S. F. A2 - D. Gollmann, G. Karjoth A2 - Waidner, M. C2 - 2002/// C3 - Computer security--ESORICS 2002: 7th European Symposium on Research in Computer Security, Zurich, Switzerland, October 14-16, 2002: proceedings (Lecture notes in computer science ; 2502) DA - 2002/// VL - 2502 SP - 244-263 PB - New York: Springer SN - 0750306114 ER - TY - JOUR TI - Conceptual model of web service reputation AU - Maximilien, E.M. AU - Singh, Munindar P. T2 - SIGMOD Record AB - Current Web services standards enable publishing service descriptions and finding services on a match based on criteria such as method signatures or service category. However, current approaches provide no basis for selecting a good service or for comparing ratings of services. We describe a conceptual model for reputation using which reputation information can be organized and shared and service selection can be facilitated and automated. DA - 2002/// PY - 2002/// DO - 10.1145/637411.637417 VL - 31 IS - 4 SP - 36-41 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-2542592296&partnerID=MN8TOARS ER - TY - JOUR TI - Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls AU - Ramesh, S AU - Rouskas, GN AU - Perros, HG T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - We present an approximate analytical method to compute efficiently the call-blocking probabilities in wavelength-routing networks with multiple classes of both unicast and multicast calls. Our approach involves the following steps. We start with an approximate solution to a linear single-class unicast network which we developed earlier. Next, all classes of calls on a particular route are aggregated to give an equivalent single-class model. We then extend the path decomposition algorithms that we have developed for single-class networks to handle mesh networks with multiple classes of calls. We show how to use these path decomposition algorithms to decompose large networks with multicast paths into smaller subsystems with only linear paths, which, in turn, are solved by the product-form approximation algorithm. We also consider a state-dependent Poisson arrival process for multicast calls which is more accurate in capturing the behavior of these calls. DA - 2002/1// PY - 2002/1// DO - 10.1109/49.974664 VL - 20 IS - 1 SP - 89-96 SN - 1558-0008 KW - blocking probabilities KW - multicast KW - multiclass networks KW - wavelength-division multiplexing (WDM) KW - wavelength routing ER - TY - JOUR TI - Two paths to modernity: Aspects of German-American relations, 1900-1918 AU - Mitchell, N. T2 - Journal of American History (Bloomington, Ind.) DA - 2002/// PY - 2002/// VL - 88 IS - 4 SP - 1561-1562 ER - TY - JOUR TI - Traffic grooming in WDM networks: past and future AU - Dutta, R. AU - Rouskas, G.N. T2 - IEEE Network AB - Traffic grooming refers to techniques used to combine low-speed traffic streams onto high-speed wavelengths in order to minimize the networkwide cost in terms of line terminating equipment and/or electronic switching. Such techniques become increasingly important for emerging network technologies, including SONET/WDM rings and MPLS/MP/spl lambda/S backbones, for which traffic grooming is essential. In this article we formally define the traffic grooming problem, and we provide a general formulation that captures the features of a wide range of problem variants. We then present a comprehensive comparative survey of the literature that unveils the significant amount of research on this subject (the traffic grooming past). We also offer a broad set of ambitious research directions (the traffic grooming future) that are motivated by the exciting new challenges arising with the advent of MP/spl lambda/S technology. DA - 2002/11// PY - 2002/11// DO - 10.1109/MNET.2002.1081765 VL - 16 IS - 6 SP - 46-56 J2 - IEEE Network LA - en OP - SN - 0890-8044 UR - http://dx.doi.org/10.1109/mnet.2002.1081765 DB - Crossref ER - TY - JOUR TI - Mathematical methods in imaging AU - Hero, AO AU - Krim, H T2 - IEEE SIGNAL PROCESSING MAGAZINE DA - 2002/9// PY - 2002/9// DO - 10.1109/MSP.2002.1028348 VL - 19 IS - 5 SP - 13-14 SN - 1053-5888 ER - TY - JOUR TI - Distributed reputation management for electronic commerce AU - Yu, B AU - Singh, MP T2 - COMPUTATIONAL INTELLIGENCE AB - One of the major challenges for electronic commerce is how to establish a relationship of trust between different parties. Establishing trust is nontrivial, because the traditional physical or social means of trust cannot apply directly in virtual settings. In many cases, the parties involved may not ever have interacted before. Reputation systems seek to address the development of trust by recording the reputations of different parties. However, most existing reputation systems are restricted to individual market websites. Further, relevant information about a party may come from several websites and from interactions that were not mediated by any website. This paper considers the problem of automatically collecting ratings about a given party from others. Our approach involves a distributed agent architecture and adapts the mathematical theory of evidence to represent and propagate the ratings that participants give to each other. When evaluating the trustworthiness of a given party, a peer combines its local evidence (based on direct prior interactions with the party) with the testimonies of others regarding the same party. This approach satisfies certain important properties of distributed reputation management and is experimentally evaluated through simulations. DA - 2002/11// PY - 2002/11// DO - 10.1111/1467-8640.00202 VL - 18 IS - 4 SP - 535-549 SN - 1467-8640 UR - https://publons.com/publon/21294511/ KW - distributed reputation management KW - trust networks KW - electronic commerce ER - TY - JOUR TI - Choosing passwords: Security and human factors AU - Gehringer, EF T2 - SOCIAL IMPLICATIONS OF INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS AB - Password security is essential to the security of information systems. Human fallibility makes it nearly impossible to follow all of the recommended rules simultaneously. A user with many different passwords, frequently changing, will be forced to write them down somewhere. Some systems constrain them to have a certain minimum length, or to require them to contain a combination of letters and numbers. Some systems also impose maximum lengths, and some prohibit special characters. The lack of common standards for passwords makes it difficult for a user to remember which password is used for which system. To make matters worse, systems frequently revoke a user's access after a password has been incorrectly entered as few as three times. What is needed, then, is an analysis of passwords that takes both human factors and security into account. We must recognize that what really matters is the security of the total system-offline as well as online. This paper explores the tradeoffs that need to be made to achieve maximum security in everyday use by forgetful users. DA - 2002/// PY - 2002/// DO - 10.1109/istas.2002.1013839 IS - 2002 Jun 6-8 SP - 369-373 ER - TY - BOOK TI - An introduction to ATM networks AU - Perros, H. G. CN - TK5105.35 .P48 2002 DA - 2002/// PY - 2002/// PB - New York: Wiley SN - 0471498270 ER - TY - JOUR TI - The impact of digital books upon print publishing AU - McAllister, D AU - McAllister, N AU - Vivian, S T2 - SOCIAL IMPLICATIONS OF INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS AB - This paper examines the concrete impact of digital publishing upon print publishing. The remarkable growth of the Internet is at the core of this impact, as the Internet forms the backbone for much of the digitization of print publishing, from commercial promotional efforts to e-book readers to alliances with education. Additionally, this paper offers short-term speculations-grounded in specific current developments-of the continuing effects of digital publishing on print publishing. DA - 2002/// PY - 2002/// DO - 10.1109/istas.2002.1013810 SP - 150-154 ER - TY - JOUR TI - Specifying rules for electronic auctions AU - Wurman, P. R. AU - Wellman, M. P. AU - Walsh, W. E. T2 - AI Magazine DA - 2002/// PY - 2002/// VL - 23 IS - 3 SP - 15-23 ER - TY - JOUR TI - Multiscale signal enhancement: Beyond the normality and independence assumption AU - He, Y AU - Krim, H T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - Current approaches to denoising or signal enhancement in a wavelet-based framework have generally relied on the assumption of normally distributed perturbations. In practice, this assumption is often violated and sometimes prior information of the probability distribution of a noise process is not even available. To relax this assumption, we propose a novel nonlinear filtering technique in this paper. The key idea is to project a noisy signal onto a wavelet domain and to suppress wavelet coefficients by a mask derived from curvature extrema in its scale space representation. For a piecewise smooth signal, it can be shown that filtering by this curvature mask is equivalent to preserving the signal pointwise Hölder exponents at the singular points and lifting its smoothness elsewhere. DA - 2002/4// PY - 2002/4// DO - 10.1109/TIP.2002.999676 VL - 11 IS - 4 SP - 423-433 SN - 1057-7149 KW - Holder space KW - multiscale analysis KW - nonlinear filtering KW - wavelet ER - TY - JOUR TI - Handling irreducible loops: Optimized node splitting versus DJ-Graphs AU - Unger, S AU - Mueller, F T2 - ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS AB - This paper addresses the question of how to handle irreducible regions during optimization, which has become even more relevant for contemporary processors since recent VLIW-like architectures highly rely on instruction scheduling. The contributions of this paper are twofold. First, a method of optimized node splitting to transform irreducible regions of control flow into reducible regions is formally defined and its correctness is shown. This method is superior to approaches previously published since it reduces the number of replicated nodes by comparison. Second, three methods that handle regions of irreducible control flow are evaluated with respect to their impact on compiler optimizations. First, traditional node splitting is evaluated. Second, optimized node splitting is implemented. Third, DJ-Graphs are utilized to recognize nesting of irreducible (and reducible) loops and apply common loop optimizations extended for irreducible loops. Experiments compare the performance of these approaches with unrecognized irreducible loops that cannot be subject to loop optimizations, which is typical for contemporary compilers. Measurements show improvements of 1 to 40% for these methods of handling irreducible loops over the unoptimized case. Optimized node splitting may be chosen to retrofit existing compilers since it has the advantage that it only requires few changes to an optimizing compiler while limiting the code growth of compiled programs compared to traditional node splitting. Recognizing loops via DJ-Graphs should be chosen for new compiler developments since it requires more changes to the optimizer but does not significantly change the code size of compiled programs while yielding comparable improvements. Handling irreducible loops should even yield more benefits for exploiting instruction-level parallelism of modern architectures in the context of global instruction scheduling and optimization techniques that may introduce irreducible loops, such as enhanced modulo scheduling. DA - 2002/7// PY - 2002/7// DO - 10.1145/567097.567098 VL - 24 IS - 4 SP - 299-333 SN - 1558-4593 KW - algorithms KW - languages KW - code optimization KW - compilation KW - control flow graphs KW - instruction-level parallelism KW - irreducible flowgraphs KW - loops KW - node splitting KW - reducible flowgraphs ER - TY - JOUR TI - Educators and pornography: The "unacceptable use" of school computers AU - Day, MG AU - Gehringer, EF T2 - SOCIAL IMPLICATIONS OF INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS AB - More companies are requiring their employees to sign acceptable-use policies for Internet computers. Some employees are unaware of the implications of the policies, and do not realize the extent to which their activities can be monitored by computer technicians. In academia, three important cases of "unacceptable use" are those of Dean Ronald F. Thiemann, Professor Eric Neil Angevine, and Superintendent Robert Herrold. All three lost, or resigned from, their positions after pornography was discovered on their employer-owned computers. Several issues regarding "acceptable use" are common to all the cases, including privacy rights, the right of the institution to control its equipment, and who might see what is stored on that equipment. This paper explores these questions, and suggests guidelines for employers and employees. DA - 2002/// PY - 2002/// DO - 10.1109/istas.2002.1013835 IS - 2002 Jun 6-8 SP - 340-344 ER - TY - JOUR TI - Stochastic differential equations and geometric flows AU - Unal, G AU - Krim, H AU - Yezzi, A T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - In previous years, curve evolution, applied to a single contour or to the level sets of an image via partial differential equations, has emerged as an important tool in image processing and computer vision. Curve evolution techniques have been utilized in problems such as image smoothing, segmentation, and shape analysis. We give a local stochastic interpretation of the basic curve smoothing equation, the so called geometric heat equation, and show that this evolution amounts to a tangential diffusion movement of the particles along the contour. Moreover, assuming that a priori information about the shapes of objects in an image is known, we present modifications of the geometric heat equation designed to preserve certain features in these shapes while removing noise. We also show how these new flows may be applied to smooth noisy curves without destroying their larger scale features, in contrast to the original geometric heat flow which tends to circularize any closed curve. DA - 2002/12// PY - 2002/12// DO - 10.1109/TIP.2002.804568 VL - 11 IS - 12 SP - 1405-1416 SN - 1057-7149 KW - geometric image and shape flows KW - stochastic differential equations KW - nonlinear filtering KW - shape analysis ER - TY - JOUR TI - JumpStart: A just-in-time signaling architecture for WDM burst-switched networks AU - Baldine, I AU - Rouskas, GN AU - Perros, HG AU - Stevenson, D T2 - IEEE COMMUNICATIONS MAGAZINE AB - We present an architecture for a core dWDM network which utilizes the concept of optical burst switching coupled with a just-in-time signaling scheme. It is a reservation-based architecture whose distinguishing characteristics are its relative simplicity, its amenability to hardware implementation, and the ability to support multicast natively. Another important feature is data transparency-the network infrastructure is independent of the format of the data being transmitted on individual wavelengths. We present the signaling protocol designed for this architecture, as well as an unified signaling message structure to be used in conjunction with the protocol. We also present the future directions of this research. DA - 2002/2// PY - 2002/2// DO - 10.1109/35.983912 VL - 40 IS - 2 SP - 82-89 SN - 0163-6804 ER - TY - JOUR TI - The scheduling and wavelength assignment problem in optical WDM networks AU - Bampis, E AU - Rouskas, GN T2 - Journal of Lightwave Technology DA - 2002/// PY - 2002/// VL - 20 IS - 5 SP - 754-761 ER - TY - JOUR TI - Incremental integration testing of concurrent programs AU - Koppol, PV AU - Carver, RH AU - Tai, KC T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING AB - We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS). A common approach to selecting test sequences from a set of LTSs is to derive a global LTS, called the reachability graph, and then force deterministic program executions according to paths selected from the graph. However, using a reachability graph for test path selection introduces a state explosion problem. To overcome this problem, a reduced graph can be generated using incremental reachability analysis, which consists of repeatedly generating a reachability graph for a subset of LTSs, reducing this graph, and using the reduced graph in place of the original LTSs. Unfortunately, existing incremental reachability analysis techniques generate reduced graphs with insufficient information for deterministic testing. We present an incremental approach to testing concurrent programs. Incremental testing consists of incremental reachability analysis for test path selection and deterministic testing for test execution. We define a new type of reachability graph for incremental analysis, called an annotated labeled transition system (ALTS). An ALTS is an LTS annotated with information necessary for deterministic testing. We propose practical coverage criteria for selecting tests paths from an ALTS and present an ALTS reduction algorithm. The results of several case studies are reported. DA - 2002/6// PY - 2002/6// DO - 10.1109/TSE.2002.1010062 VL - 28 IS - 6 SP - 607-623 SN - 1939-3520 KW - software testing KW - concurrent programs KW - structural testing KW - incremental testing ER - TY - JOUR TI - New bounds on the barycenter heuristic for bipartite graph drawing AU - Li, XY AU - Stallmann, MF T2 - INFORMATION PROCESSING LETTERS AB - The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well known that the barycenter heuristic can give solutions as bad as Ω(n) times the optimum, where n is the number of nodes in the graph. However, the example used in the proof has many isolated nodes. Mäkinen [EATCS Bull. 70 (2000) 156–158] conjectured that a better performance ratio is possible if isolated nodes are not present. We show that the performance ratio for the barycenter heuristic is still Ω(n) even for connected bipartite graphs. We also prove a tight constant ratio for the barycenter heuristic on bounded-degree graphs. The performance ratio is d−1, where d is the maximum degree of a node in the layer that can be permuted. DA - 2002/6/30/ PY - 2002/6/30/ DO - 10.1016/S0020-0190(01)00297-6 VL - 82 IS - 6 SP - 293-298 SN - 0020-0190 KW - barycenter heuristic KW - performance ratio KW - graph drawing ER - TY - JOUR TI - Equine rounds - Case presentation: Idiopathic eosinophilic enteritis in a 10-week-old colt AU - Stanar, L. S. AU - Little, D. AU - Redding, W. R. AU - Jones, S. L. T2 - Compendium on Continuing Education for the Practicing Veterinarian DA - 2002/// PY - 2002/// VL - 24 IS - 4 SP - 342-344 ER - TY - JOUR TI - Efficient conservative global transport schemes for climate and atmospheric chemistry models AU - Nair, RD AU - Scroggs, JS AU - Semazzi, FHM T2 - MONTHLY WEATHER REVIEW AB - A computationally efficient mass-conservative transport scheme over the sphere is proposed and tested. The scheme combines a conservative finite-volume method with an efficient semi-Lagrangian scheme based on the dimension splitting “cascade” method. In the regions near the poles where the conservative cascade procedure breaks down, a globally conservative, but locally approximate scheme is used. This procedure is currently restricted to polar meridional Courant numbers less than one. The resulting conservative cascade scheme is evaluated using a solid-body rotation test and deformational flow test, and found to be both accurate and efficient. Compared to the traditional semi-Lagrangian scheme employing a bicubic-Lagrange interpolator, the proposed scheme is considerably more accurate and almost twice as fast while conserving mass exactly. DA - 2002/8// PY - 2002/8// DO - 10.1175/1520-0493(2002)130<2059:ECGTSF>2.0.CO;2 VL - 130 IS - 8 SP - 2059-2073 SN - 0027-0644 ER - TY - RPRT TI - Distributed Pair Programming: Empirical Studies and Supporting Environments AU - Baheti, P. AU - Williams, L. AU - Gehringer, E. AU - Stotts, D. AU - Smith, J. A3 - Chapel Hill, NC: Dept. of Computer Science, University of North Carolina C6 - 2002 DA - 2002/3// PY - 2002/3// SP - TR02–010 PB - Chapel Hill, NC: Dept. of Computer Science, University of North Carolina ER - TY - JOUR TI - Computing call-blocking probabilities in LEO satellite networks: The single-orbit case AU - Zaim, AH AU - Rouskas, GN AU - Perros, HG T2 - IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY AB - We study the problem of carrying voice calls over a low-Earth-orbit satellite network and present an analytical model for computing call-blocking probabilities for a single orbit of a satellite constellation. We have devised a method to solve the corresponding Markov process efficiently for orbits of up to five satellites. For orbits consisting of a larger number of satellites, we have developed an approximate decomposition algorithm to compute the call-blocking probabilities by decomposing the system into smaller subsystems and iteratively solving each subsystem in isolation using the exact Markov process. Our approach can capture blocking due to handoffs for both satellite-fixed and Earth-fixed constellations. Numerical results demonstrate that our method is accurate for a wide range of traffic patterns and for orbits with a number of satellites that is representative of commercial satellite systems. DA - 2002/3// PY - 2002/3// DO - 10.1109/25.994809 VL - 51 IS - 2 SP - 332-347 SN - 1939-9359 KW - call blocking probability KW - decomposition algorithms KW - handoffs KW - low-earth-orbit (LEO) satellite networks ER - TY - JOUR TI - MTCP: scalable TCP-like congestion control for reliable multicast AU - Rhee, I AU - Balaguru, N AU - Rouskas, GN T2 - COMPUTER NETWORKS AB - We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet non-trivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree. Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link on the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp. DA - 2002/4/5/ PY - 2002/4/5/ DO - 10.1016/s1389-1286(01)00268-7 VL - 38 IS - 5 SP - 553-575 SN - 1872-7069 KW - reliable multicast KW - congestion control ER - TY - JOUR TI - Efficient matrix preconditioners for black box linear algebra AU - Chen, L AU - Eberly, W AU - Kaltofen, E AU - Saunders, BD AU - Turner, WJ AU - Villard, G T2 - LINEAR ALGEBRA AND ITS APPLICATIONS AB - The main idea of the “black box” approach in exact linear algebra is to reduce matrix problems to the computation of minimum polynomials. In most cases preconditioning is necessary to obtain the desired result. Here good preconditioners will be used to ensure geometrical/algebraic properties on matrices, rather than numerical ones, so we do not address a condition number. We offer a review of problems for which (algebraic) preconditioning is used, provide a bestiary of preconditioning problems, and discuss several preconditioner types to solve these problems. We present new conditioners, including conditioners to preserve low displacement rank for Toeplitz-like matrices. We also provide new analyses of preconditioner performance and results on the relations among preconditioning problems and with linear algebra problems. Thus, improvements are offered for the efficiency and applicability of preconditioners. The focus is on linear algebra problems over finite fields, but most results are valid for entries from arbitrary fields. DA - 2002/3/1/ PY - 2002/3/1/ DO - 10.1016/S0024-3795(01)00472-4 VL - 343 SP - 119-146 SN - 0024-3795 KW - black box matrix KW - sparse matrix KW - structured matrix KW - Toeplitz-like matrix KW - matrix preconditioner KW - exact arithmetic KW - finite field KW - symbolic computation KW - linear system solution KW - minimal polynomial KW - characteristic polynomial KW - rank KW - determinant KW - Wiedemann algorithm KW - randomized algorithm KW - butterfly network ER - TY - JOUR TI - On the number of graphical forest partitions AU - Frank, D. A. AU - Savage, C. D. AU - Sellers, J. A. T2 - Ars Combinatoria DA - 2002/// PY - 2002/// VL - 65 IS - 2002 Oct SP - 33-37 ER - TY - JOUR TI - An algebraic representation of calendars AU - Ning, P AU - Wang, XYS AU - Jajodia, S T2 - ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE DA - 2002/9// PY - 2002/9// DO - 10.1023/A:1015835418881 VL - 36 IS - 1-2 SP - 5-38 SN - 1573-7470 KW - temporal granularity KW - calendar KW - calendar algebra KW - granule conversion ER - TY - JOUR TI - Who you gonna call? AU - Singh, MP T2 - IEEE INTERNET COMPUTING AB - Our current understanding of Web structure is based on large graphs created by centralized crawlers and indexers. They obtain data almost exclusively from the so-called surface Web, which consists, loosely speaking, of interlinked HTML pages. The deep Web, by contrast, is information that is reachable over the Web, but that resides in databases; it is dynamically available in response to queries, not placed on static pages ahead of time. Recent estimates indicate that the deep Web has hundreds of times more data than the surface Web. The deep Web gives us reason to rethink much of the current doctrine of broad-based link analysis. Instead of looking up pages and finding links on them, Web crawlers would have to produce queries to generate relevant pages. Creating appropriate queries ahead of time is nontrivial without understanding the content of the queried sites. The deep Web's scale would also make it much harder to cache results than to merely index static pages. Whereas a static page presents its links for all to see, a deep Web site can decide whose queries to process and how well. It can, for example, authenticate the querying party before giving it any truly valuable information and links. It can build an understanding of the querying party's context in order to give proper responses, and it can engage in dialogues and negotiate for the information it reveals. The Web site can thus prevent its information from being used by unknown parties. What's more, the querying party can ensure that the information is meant for it. DA - 2002/// PY - 2002/// DO - 10.1109/MIC.2002.1036032 VL - 6 IS - 6 SP - 4-5 SN - 1089-7801 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0036755908&partnerID=MN8TOARS ER - TY - JOUR TI - Unifying probabilistic and variational estimation AU - Hamza, AB AU - Krim, H AU - Unal, GB T2 - IEEE SIGNAL PROCESSING MAGAZINE AB - A maximum a posteriori (MAP) estimator using a Markov or a maximum entropy random field model for a prior distribution may be viewed as a minimizer of a variational problem.Using notions from robust statistics, a variational filter referred to as a Huber gradient descent flow is proposed. It is a result of optimizing a Huber functional subject to some noise constraints and takes a hybrid form of a total variation diffusion for large gradient magnitudes and of a linear diffusion for small gradient magnitudes. Using the gained insight, and as a further extension, we propose an information-theoretic gradient descent flow which is a result of minimizing a functional that is a hybrid between a negentropy variational integral and a total variation. Illustrating examples demonstrate a much improved performance of the approach in the presence of Gaussian and heavy tailed noise. In this article, we present a variational approach to MAP estimation with a more qualitative and tutorial emphasis. The key idea behind this approach is to use geometric insight in helping construct regularizing functionals and avoiding a subjective choice of a prior in MAP estimation. Using tools from robust statistics and information theory, we show that we can extend this strategy and develop two gradient descent flows for image denoising with a demonstrated performance. DA - 2002/9// PY - 2002/9// DO - 10.1109/MSP.2002.1028351 VL - 19 IS - 5 SP - 37-47 SN - 1053-5888 ER - TY - JOUR TI - Perception and painting: A search for effective, engaging visualizations AU - Healey, CG AU - Enns, JT T2 - IEEE COMPUTER GRAPHICS AND APPLICATIONS AB - Scientific visualization represents information as images that let us explore, discover, analyze and validate large collections of data. Much research in this area is dedicated to designing effective visualizations that support specific analysis needs. Recently, though, we've considered visualizations from another angle. We've started asking, "Are visualizations beautiful? Can we consider visualizations works of art?" You might expect answers to these questions to vary widely depending on an individual's interpretation what it means to be artistic. We believe that the issues of effectiveness and aesthetics may not be as independent as they seem initially. We can learn much from studying two related disciplines - human psychophysics and art theory and history. Human psychophysics teaches us how we see the world around us. Art history shows us how artistic masters capture our attention by designing works that evoke an emotional response. The common interest in visual attention provides an important bridge between these domains. We're using this bridge to produce effective and engaging visualizations, and in this article, we share some of the lessons we've learned along the way. DA - 2002/// PY - 2002/// DO - 10.1109/38.988741 VL - 22 IS - 2 SP - 10-15 SN - 0272-1716 ER - TY - JOUR TI - On optimal traffic grooming in WDM rings AU - Dutta, R AU - Rouskas, GN T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. The full virtual topology design problem is NP-hard even in the restricted case where the physical topology is a ring, and various heuristics have been proposed in the literature for obtaining good solutions, usually for different classes of problem instances. We present a new framework which can be used to evaluate the performance of heuristics and which requires significantly less computation than evaluating the optimal solution. This framework is based on a general formulation of the virtual topology problem, and it consists of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path and adopting the locally optimal topology within each set. While we only consider the objective of minimizing electronic routing in this paper, our approach to obtaining the sequence of bounds can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions. DA - 2002/1// PY - 2002/1// DO - 10.1109/49.974666 VL - 20 IS - 1 SP - 110-121 SN - 1558-0008 KW - bounds KW - electronic grooming KW - heuristics KW - light-path KW - optical ring KW - SONET KW - traffic grooming KW - wavelength routing ER - TY - JOUR TI - Narrative prose generation AU - Callaway, CB AU - Lester, JC T2 - ARTIFICIAL INTELLIGENCE AB - Narrative generation has historically suffered from poor writing quality, stemming from a narrow focus on story grammars and plot design. Moreover, to-date natural language generation systems have not been capable of faithfully reproducing either the variety or complexity of naturally occurring narratives. In this article we first propose a model of narrative derived from work in narratology and grounded in observed linguistic phenomena. Next we describe the Author architecture for narrative generation and an end-to-end implementation of the Author model in the StoryBook narrative prose generation system. Finally, we present a formal evaluation of the narratives that StoryBook produces. DA - 2002/8// PY - 2002/8// DO - 10.1016/s0004-3702(02)00230-8 VL - 139 IS - 2 SP - 213-252 SN - 1872-7921 KW - narrative generation KW - story generation KW - natural language generation KW - revision KW - pronominalization KW - discourse history KW - narrative models KW - character dialogue KW - discourse markers ER - TY - JOUR TI - Mixed-effects modeling of the interspecies pharmacokinetic scaling of oxytetracycline AU - Martin-Jimenez, T AU - Riviere, JE T2 - JOURNAL OF PHARMACEUTICAL SCIENCES AB - Differences in the disposition of certain drugs across mammalian species often arise because of their diverse physiology and anatomical characteristics. Factors such as body mass, brain weight, and maximum lifespan are related to the way that different species of mammals handle drugs. Drug disposition data can be scaled across species when chronological time is substituted by the appropriate measure of pharmacokinetic time. In this study, we developed allometric scaling models for oxytetracycline, using serum disposition data obtained from the Food Animal Residue Avoidance Databank. The data were modeled using the mixed-effects modeling approach. The models obtained were validated using disposition data on swine. Oxytetracycline scaled across species based on body weight and the best interspecies model adequately predicted the value of the pharmacokinetic parameters across species. The population approach allows one to estimate the allometric coefficients and exponents of the pharmacokinetic parameters to obtain a model that best fits the multi-species pooled concentration-time data. Furthermore, this approach allows decisions to be made based on the statistical significance of the parameter estimates and the adequacy of the models that are not possible with traditional approaches. DA - 2002/2// PY - 2002/2// DO - 10.1002/jps.10001 VL - 91 IS - 2 SP - 331-341 SN - 0022-3549 KW - NONMEM KW - oxytetracycline KW - allometry KW - population pharmacokinetics ER - TY - PCOMM TI - Letters - Try it, you'll like it AU - Williams, L. DA - 2002/// PY - 2002/// SP - 7 ER - TY - JOUR TI - Energy-conserving feedback EDF scheduling for embedded systems with real-time constraints AU - Dudani, A AU - Mueller, F AU - Zhu, YF T2 - ACM SIGPLAN NOTICES AB - Embedded systems have limited energy resources. Hence, they should conserve these resources to extend their period of operation. Recently, dynamic frequency scaling (DFS) and dynamic voltage scaling (DVS) have been added to a various embedded processors as a means to increase battery life. A number of scheduling techniques have been developed to exploit DFS and DVS for real-time systems to reduce energy consumption. These techniques exploit idle and slack time of a schedule. Idle time can be consumed by lowering the processor frequency of selected tasks while slack time allows later tasks to execute at lower frequencies with reduced voltage demands.Our work delivers energy savings beyond the level of prior work. We enhance the earliest-deadline first (EDF) scheduling to exploit slack time generated by the invocation of the task at multiple frequency levels within the same invocation . The technique relies strictly on operating system support within the scheduler to implement the approach. Early scaling at a low frequency, determined by a feedback mechanism and facilitated by a slack-passing scheme, capitalizes on high probabilities of a task to finish its execution without utilizing its worst-case execution budget. If a task does not complete at a certain point in time within its low frequency range, the remainder of it continues to execute at a higher frequency. Our experiments demonstrate that the resulting energy savings exceed those of previously published work by up to 33%. In addition, our method only adds a constant complexity at each scheduling point, which has not been achieved by prior work, to the best of our knowledge. DA - 2002/7// PY - 2002/7// DO - 10.1145/566225.513865 VL - 37 IS - 7 SP - 213-222 SN - 1558-1160 KW - real-time systems KW - scheduling KW - dynamic voltage scaling ER - TY - JOUR TI - DMMX: Dynamic memory management extensions AU - Chang, JM AU - Srisa-an, W AU - Lo, CTD AU - Gehringer, EF T2 - JOURNAL OF SYSTEMS AND SOFTWARE AB - Dynamic memory management allows programmers to be more productive and increases system reliability and functionality. However, software algorithms for memory management are slow and non-deterministic. It is well known that object-oriented applications tend to be dynamic memory intensive. This has led programmers to eschew dynamic memory allocation for many real-time and embedded systems. Instead, programmers using Java or C++ as a development language frequently decide to allocate memory statically instead of dynamically. In this paper, we present the design of a bitmap-based memory allocator implemented primarily in combinational logic to allocate memory in a small, predictable amount of time. It works in conjunction with an application-specific instruction-set extension called the dynamic memory management extension (DMMX). Allocation is done through a complete binary tree of combinational logic, which allows constant-time object creation. The garbage collection algorithm is mark sweep, where the sweeping phase can be accomplished in constant time. This hardware scheme can greatly improve the speed and predictability of dynamic memory management. The proposed DMMX is an add-on approach, which allows easy integration into any CPU, hardware-implemented Java virtual machine, or processor in memory. DA - 2002/9/15/ PY - 2002/9/15/ DO - 10.1016/S0164-1212(02)00014-6 VL - 63 IS - 3 SP - 187-199 SN - 1873-1228 KW - client/server KW - hardware support for dynamic memory management KW - Java KW - garbage collection KW - SMP system KW - bitmap ER - TY - JOUR TI - A test generation strategy for pairwise testing AU - Tai, K. C. AU - Lei, Y. T2 - IEEE Transactions on Software Engineering DA - 2002/// PY - 2002/// VL - 28 IS - 1 SP - 109-111 ER - TY - JOUR TI - A lattice path approach to counting partitions with minimum rank t AU - Burstein, A AU - Corteel, S AU - Postnikov, A AU - Savage, CD T2 - DISCRETE MATHEMATICS AB - In this paper, we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t⩽1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2−t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve. DA - 2002/4/28/ PY - 2002/4/28/ DO - 10.1016/S0012-365X(01)00225-4 VL - 249 IS - 1-3 SP - 31-39 SN - 0012-365X KW - integer partitions KW - lattice paths ER - TY - JOUR TI - A generating functionology approach to a problem of Wilf AU - Hitczenko, P AU - Rousseau, C AU - Savage, CD T2 - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS AB - Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and Savage. In this paper, we study this question using the techniques of generating functions and singularity analysis. DA - 2002/5/1/ PY - 2002/5/1/ DO - 10.1016/S0377-0427(01)00462-9 VL - 142 IS - 1 SP - 107-114 SN - 0377-0427 ER - TY - JOUR TI - Deterministic preemptive scheduling of real-time tasks AU - Jackson, LE AU - Rouskas, GN T2 - COMPUTER AB - Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks. DA - 2002/5// PY - 2002/5// DO - 10.1109/MC.2002.999778 VL - 35 IS - 5 SP - 72-+ SN - 1558-0814 ER -