TY - ER - TY - CONF TI - Secure reporting of traffic forwarding activity in mobile ad hoc networks AU - Choi, Heesook AU - Enck, William AU - Shin, Jaesheung AU - McDaniel, Patrick AU - La Porta, Thomas F T2 - IEEE C2 - 2005/// C3 - The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services DA - 2005/// SP - 12-21 ER - TY - CONF TI - Limiting sybil attacks in structured peer-to-peer networks AU - Rowaihy, Hosam AU - Enck, William AU - McDaniel, Patrick AU - La Porta, Thomas C2 - 2005/// C3 - IEEE Infocom Mini-Symposium DA - 2005/// ER - TY - CONF TI - Exploiting open functionality in SMS-capable cellular networks AU - Enck, William AU - Traynor, Patrick AU - McDaniel, Patrick AU - La Porta, Thomas T2 - ACM C2 - 2005/// C3 - Proceedings of the 12th ACM conference on Computer and communications security DA - 2005/// SP - 393-404 ER - TY - CHAP TI - Scheduling Algorithms for Unicast, Multicast, and Broadcast AU - Rouskas, George N. T2 - The International Series in Engineering and Computer Science A2 - Sivalingam, Krishna A2 - Subramanian, Suresh AB - In this chapter we present a survey of algorithms for scheduling packet traffic in broadcast optical WDM networks. We first describe the context and motivations of the scheduling problem. We then review the current literature in the field with an emphasis on scheduling techniques for providing best-effort service as well as guaranteed service for both unicast and multi-destination traffic. We provide alternative formulations of the problem, and we compare the formulations and theoretical results, as well as algorithms and heuristics. PY - 2005/12/16/ DO - 10.1007/0-306-47021-7_8 SP - 171–188 PB - Kluwer Academic Publishers SN - 0792378253 UR - http://dx.doi.org/10.1007/0-306-47021-7_8 ER - TY - JOUR TI - Event-based runtime verification of java programs AU - d’Amorim, Marcelo AU - Havelund, Klaus T2 - ACM SIGSOFT Software Engineering Notes AB - We introduce the temporal logic HAWK and its supporting tool for runtime verification of Java programs. A monitor for a HAWK formula checks if a finite trace of program events satisfies the formula. HAWK is a programming-oriented extension of the rule-based EAGLE logic that has been shown capable of defining and implementing a range of finite trace monitoring logics, including future and past time temporal logic, metric (real-time) temporal logics, interval logics, forms of quantified temporal logics, extended regular expressions, state machines, and others. Monitoring is achieved on a state-by-state basis avoiding any need to store the input trace. HAWK extends EAGLE with constructs for capturing parameterized program events such as method calls and method returns. Parameters can be executing thread, the objects that methods are called upon, arguments to methods, and return values. HAWK allows one to refer to these in formulae. The tool synthesizes monitors from formulae and automates program instrumentation. DA - 2005/// PY - 2005/// DO - 10.1145/1082983.1083249 VL - 30 IS - 4 SP - 1-7 UR - http://doi.acm.org/10.1145/1082983.1083249 ER - TY - CONF TI - Efficient Monitoring of omega-Languages AU - d’Amorim, Marcelo AU - Rosu, Grigore AB - We present a technique for generating efficient monitors for ω-regular-languages. We show how Büchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state machines (BTT-FSMs), which recognize precisely the minimal bad prefixes of the original ω-regular-language. The presented technique is implemented as part of a larger monitoring framework and is available for download. C2 - 2005/// C3 - Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings DA - 2005/// DO - 10.1007/11513988_36 SP - 364-378 UR - https://doi.org/10.1007/11513988_36 ER - TY - CONF TI - Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings A2 - Etessami, Kousha A2 - Rajamani, Sriram K. AB - This volume contains the proceedings of the International Conference on Computer Aided Veri?cation (CAV), held in Edinburgh, Scotland, July 6–10, 2005. CAV 2005 was the seventeenth in a series of conf C2 - 2005/// DA - 2005/// DO - 10.1007/b138445 VL - 3576 PB - Springer UR - https://doi.org/10.1007/b138445 ER - TY - JOUR TI - An Equational Specification for the Scheme Language AU - d’Amorim, Marcelo AU - Rosu, Grigore T2 - J. UCS DA - 2005/// PY - 2005/// DO - 10.3217/jucs-011-07-1327 VL - 11 IS - 7 SP - 1327-1348 UR - https://doi.org/10.3217/jucs-011-07-1327 ER - TY - JOUR TI - Routing path optimization in optical burst switched networks AU - Teng, J AU - Rouskas, GN AU - Pattavina, A T2 - 2005 Conference on Optical Network Design and Modelling, Proceedings DA - 2005/// PY - 2005/// SP - 1-10 ER - TY - CHAP TI - Path switching in OBS networks AU - Yang, L AU - Rouskas, GN AU - Boutaba, R AU - Almeroth, K AU - Puigjaner, R AU - Shen, S AU - Black, JP T2 - Networking 2005: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems PY - 2005/// VL - 3462 SP - 406-418 PB - SE - ER - TY - JOUR TI - On the Application of K-Center Algorithms to Hierarchical Traffic Grooming AU - Chen, Bensong AU - Dutta, Rudra AU - Rouskas, George N. AU - IEEE T2 - 2nd International Conference on Broadband Networks (Broadnets 2005) DA - 2005/// PY - 2005/// SP - 295-+ ER - TY - JOUR TI - An Intra- and Inter-Domain Routing Architecture for Optical Burst Switched (OBS) Networks AU - Baldine, Ilia AU - Mehrotra, Pronita AU - Rouskas, George AU - Bragg, Arnold AU - Stevenson, Dan AU - IEEE T2 - 2nd International Conference on Broadband Networks (Broadnets 2005) AB - We describe an intra- and inter-domain routing architecture for just-in-time (JIT) optical burst switched (OBS) networks. The architecture addresses the problem of routing optical signals of varying types across an all-optical burst-switched backbone network while maintaining the optical signal quality required by each application. The architecture distinguishes between routing for bursts and ancillary signaling messages ("data plane routing"), and routing for other management and control messages ("control plane routing") DA - 2005/// PY - 2005/// DO - 10.1109/ICBN.2005.1589726 SP - 150-+ ER - TY - JOUR TI - A Framework for Hierarchical Traffic Grooming in WDM Networks of General Topology AU - Chen, Bensong AU - Rouskas, George N. AU - Dutta, Rudra AU - IEEE T2 - 2nd International Conference on Broadband Networks (Broadnets 2005) DA - 2005/// PY - 2005/// SP - 167-+ ER - TY - CONF TI - A discourse planning approach to cinematic camera control for narratives in virtual environments AU - Jhala, A. AU - Young, R.M. C2 - 2005/// C3 - Proceedings of the National Conference on Artificial Intelligence DA - 2005/// VL - 1 SP - 307-312 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-29344452737&partnerID=MN8TOARS ER - TY - CONF TI - Towards an intelligent storyboarding tool for 3D games AU - Jhala, A. AU - Bares, W. AU - Young, R.M. AB - We present an intelligent storyboarding tool that takes as an input abstract annotated action specification to generate camera actions and geometric constraints for executing as a dynamic storyboard. C2 - 2005/// C3 - ACM International Conference Proceeding Series DA - 2005/// DO - 10.1145/1178477.1178551 VL - 265 SP - 367-368 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77953502013&partnerID=MN8TOARS ER - TY - CHAP TI - Natural language processing in educational systems AU - Matsuda, N. T2 - Encyclopedia of Artificial Intelligence A2 - Tanaka, Hozumi PY - 2005/// PB - Japan Society of Artificial Intelligence ER - TY - CHAP TI - Instructional strategies AU - Matsuda, N. T2 - Encyclopedia of Artificial Intelligence A2 - Tanaka, Hozumi PY - 2005/// PB - Japan Society of Artificial Intelligence ER - TY - CHAP TI - Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 AU - Kaltofen, Erich AU - Yui, Noriko T2 - EUROSAM 84 PY - 2005/12/1/ DO - 10.1007/bfb0032853 SP - 310-320 OP - PB - Springer-Verlag SN - 354013350X UR - http://dx.doi.org/10.1007/bfb0032853 DB - Crossref ER - TY - JOUR TI - Optical burst switching for the next generation Internet AU - Battest, T. AU - Perros, H. T2 - IEEE Potentials AB - Demands for network bandwidth increase daily. In order to meet our ever-increasing network bandwidth needs, one solution is to design and build the next generation Internet with an optical core infrastructure, with last connection provisioning time and unprecedented high data rates of 100 terabits per second and higher. An optical network is built by interconnecting various optical switches with wavelength-division multiplexing (WDM) fibers, i.e., fibers that can simultaneously transmit data over different wavelengths. Many of today's commercial optical networks, however, do not utilize the WDM technology efficiently. With respect to the current state of the technology, an Optical Burst Switched (OBS) Network is one of the most promising all-optical architectures for the next generation Internet. It efficiently supports the transmission of bursty traffic over an all-optical infrastructure. OBS is still being developed and it has not been standardized yet. This article describes the main features of an OBS network, its benefits as well as its challenges. DA - 2005/1// PY - 2005/1// DO - 10.1109/mp.2005.1368915 VL - 23 IS - 5 SP - 40-43 J2 - IEEE Potentials OP - SN - 0278-6648 UR - http://dx.doi.org/10.1109/mp.2005.1368915 DB - Crossref ER - TY - RPRT TI - Parallelization of Utility Programs Based on Behavior Phase Analysis AU - Shen, Xipeng AU - Ding, Chen A3 - Computer Science Dept., University of Rochester DA - 2005/3// PY - 2005/3// M1 - TR876 PB - Computer Science Dept., University of Rochester SN - TR876 ER - TY - CHAP TI - Internet-Based Games AU - Michael Young, R T2 - The Practical Handbook of Internet Computing A2 - Singh, Munindar P. T3 - Chapman & Hall/CRC computer and information science series PY - 2005/// DO - 10.1201/9780203507223.ch11 PB - Chapman and Hall/CRC SN - 9781584883814 9781466526907 UR - http://dx.doi.org/10.1201/9780203507223.ch11 ER - TY - CONF TI - Multiagent System for Dynamic Web Services Selection AU - Maximilien, E.Michael AU - Singh, Munindar P. C2 - 2005/// C3 - Proceedings of the AAMAS Workshop on Service-Oriented Computing and Agent-Based Engineering (SOCABE) DA - 2005/// SP - 1–10 PB - AAMAS ER - TY - CONF TI - Proceedings of the 4th International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS) A2 - Dignum, Frank A2 - Dignum, Virginia A2 - Koenig, Sven A2 - Kraus, Sarit A2 - Singh, Munindar P. A2 - Wooldridge, Michael C2 - 2005/// DA - 2005/// PB - ACM Press ER - TY - BOOK TI - Agents and Peer-to-Peer Computing T2 - Lecture Notes in Computer Science A3 - Moro, Gianluca A3 - Sartori, Claudio A3 - Singh, Munindar P. AB - Peer-to-peer (P2P) computing is currently attracting enormous public attention, spurred by the popularity of file-sharing systems such as Napster, Gnutella, Morpheus, Kaza, and several others. In P2P DA - 2005/// PY - 2005/// DO - 10.1007/b104265 M1 - 2872 PB - Springer SN - 9783540240532 9783540258407 UR - http://dx.doi.org/10.1007/b104265 ER - TY - CHAP TI - Phase-Based Miss Rate Prediction Across Program Inputs AU - Shen, Xipeng AU - Zhong, Yutao AU - Ding, Chen T2 - Lecture Notes in Computer Science AB - Previous work shows the possibility of predicting the cache miss rate (CMR) for all inputs of a program. However, most optimization techniques need to know more than the miss rate of the whole program. Many of them benefit from knowing miss rate of each execution phase of a program for all inputs. In this paper, we describe a method that divides a program into phases that have a regular locality pattern. Using a regression model, it predicts the reuse signature and then the cache miss rate of each phase for all inputs. We compare the prediction with the actual measurement. The average prediction is over 98% accurate for a set of floating-point programs. The predicted CMR-traces matches the simulated ones in spite of dramatic fluctuations of the miss rate over time. This technique can be used for improving dynamic optimization, benchmarking, and compiler design. PY - 2005/// DO - 10.1007/11532378_5 SP - 42-55 OP - PB - Springer Berlin Heidelberg SN - 9783540280095 9783540318132 UR - http://dx.doi.org/10.1007/11532378_5 DB - Crossref ER - TY - CONF TI - Gated memory control for memory monitoring, leak detection and garbage collection AU - Ding, Chen AU - Zhang, Chengliang AU - Shen, Xipeng AU - Ogihara, Mitsunori T2 - the 2005 workshop AB - In the past, program monitoring often operates at the code level, performing checks at function and loop boundaries. Recent research shows that profiling analysis can identify high-level phases in complex binary code. Examples are time steps in scientific simulations and service cycles in utility programs. Because of their larger size and more predictable behavior, program phases make it possible for more accurate and longer term predictions of program behavior, especially its memory usage. This paper describes a new approach that uses phase boundaries as the gates to monitor and control the memory usage. In particular, it presents three techniques: memory usage monitoring, object lifetime classification, and preventive memory management. They use phase-level patterns to predict the trend of the program's memory demand, identify and control memory leaks, improve the efficiency of garbage collection. The potential of the new techniques is demonstrated on two non-trivial applications---a C compiler and a Lisp interpreter. C2 - 2005/// C3 - Proceedings of the 2005 workshop on Memory system performance - MSP '05 DA - 2005/// DO - 10.1145/1111583.1111593 PB - ACM Press SN - 1595931473 UR - http://dx.doi.org/10.1145/1111583.1111593 DB - Crossref ER - TY - CONF TI - Lightweight reference affinity analysis AU - Shen, Xipen AU - Gao, Yaoqing AU - Ding, Chen AU - Archambault, Roch T2 - the 19th annual international conference AB - Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to every data element. The high overhead impedes its adoption in a general compiler, In this paper, we show that for array regrouping in scientific programs, the overhead is not needed since the same benefit can be obtained by pure program analysis.We present an interprocedural analysis technique for array regrouping. For each global array, the analysis summarizes the access pattern by access-frequency vectors and then groups arrays with similar vectors. The analysis is context sensitive, so it tracks the exact array access. For each loop or function call, it uses two methods to estimate the frequency of the execution. The first is symbolic analysis in the compiler. The second is lightweight profiling of the code. The same interprocedural analysis is used to cumulate the overall execution frequency by considering the calling context. We implemented a prototype of both the compiler and the profiling analysis in the IBM® compiler, evaluated array regrouping on the entire set of SPEC CPU2000 FORTRAN benchmarks, and compared different analysis methods. The pure compiler-based array regrouping improves the performance for the majority of programs, leaving little room for improvement by code or data profiling. C2 - 2005/// C3 - Proceedings of the 19th annual international conference on Supercomputing - ICS '05 DA - 2005/// DO - 10.1145/1088149.1088167 PB - ACM Press SN - 1595931678 UR - http://dx.doi.org/10.1145/1088149.1088167 DB - Crossref ER - TY - JOUR TI - In silico Discovery of Enzyme–Substrate Specificity-determining Residue Clusters AU - Yu, Gong-Xin AU - Park, Byung-Hoon AU - Chandramohan, Praveen AU - Munavalli, Rajesh AU - Geist, Al AU - Samatova, Nagiza F. T2 - Journal of Molecular Biology AB - The binding between an enzyme and its substrate is highly specific, despite the fact that many different enzymes show significant sequence and structure similarity. There must be, then, substrate specificity-determining residues that enable different enzymes to recognize their unique substrates. We reason that a coordinated, not independent, action of both conserved and non-conserved residues determine enzymatic activity and specificity. Here, we present a surface patch ranking (SPR) method for in silico discovery of substrate specificity-determining residue clusters by exploring both sequence conservation and correlated mutations. As case studies we apply SPR to several highly homologous enzymatic protein pairs, such as guanylyl versus adenylyl cyclases, lactate versus malate dehydrogenases, and trypsin versus chymotrypsin. Without using experimental data, we predict several single and multi-residue clusters that are consistent with previous mutagenesis experimental results. Most single-residue clusters are directly involved in enzyme–substrate interactions, whereas multi-residue clusters are vital for domain–domain and regulator–enzyme interactions, indicating their complementary role in specificity determination. These results demonstrate that SPR may help the selection of target residues for mutagenesis experiments and, thus, focus rational drug design, protein engineering, and functional annotation to the relevant regions of a protein. DA - 2005/10// PY - 2005/10// DO - 10.1016/j.jmb.2005.08.008 VL - 352 IS - 5 SP - 1105-1117 J2 - Journal of Molecular Biology LA - en OP - SN - 0022-2836 UR - http://dx.doi.org/10.1016/j.jmb.2005.08.008 DB - Crossref KW - surface patch ranking KW - enzyme-substrate specificity-determining residues KW - sequence conservation KW - correlated mutations KW - mutagenesis ER - TY - CHAP TI - A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem AU - Suters, W. Henry AU - Abu-Khzam, Faisal N. AU - Zhang, Yun AU - Symons, Christopher T. AU - Samatova, Nagiza F. AU - Langston, Michael A. T2 - Lecture Notes in Computer Science AB - The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the problem of finding a maximum clique in the order mn association graph, which is a particular form of product graph built from the inputs. In this paper a new algorithm, termed “clique branching,” is proposed that exploits a special structure inherent in the association graph. This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1) n ) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. PY - 2005/// DO - 10.1007/11533719_73 SP - 717-727 OP - PB - Springer Berlin Heidelberg SN - 9783540280613 9783540318064 UR - http://dx.doi.org/10.1007/11533719_73 DB - Crossref ER - TY - CHAP TI - Network Access Control for Mobile Ad-Hoc Networks AU - Wang, Pan AU - Ning, Peng AU - Reeves, Douglas S. T2 - Information and Communications Security AB - In this paper, we propose to enforce network access control in Mobile Ad Hoc Networks (MANETs) using cryptographic techniques. In the proposed approach, packets are authenticated by means of a network-wide symmetric (session) key. Because nodes are mobile and communication paths may change rapidly, timely distribution of new session keys is challenging (particularly if keys change frequently). Nodes wishing to communicate may therefore hold different session keys, which must somehow be synchronized. We present a fully distributed key synchronization method based on stateless group key distribution, and localized packet retransmission. If nodes A and B wish to communicate securely over a path P, all nodes on this path must synchronize keys with their immediately adjacent neighbors in the path. Any node which is unable to synchronize keys will not be allowed to forward packets. Simulations and a functioning prototype demonstrate the proposed system is practical and effective. PY - 2005/// DO - 10.1007/11602897_30 SP - 350-362 OP - PB - Springer Berlin Heidelberg SN - 9783540309345 9783540320999 UR - http://dx.doi.org/10.1007/11602897_30 DB - Crossref ER - TY - JOUR TI - Selected papers from Optical Network Design and Modeling (ONDM) 2005 conference AU - Rouskas, George N. AU - Neri, Fabio AU - Pattavina, Achille AU - Bregni, Stefano AU - Maier, Guido T2 - Optical Switching and Networking DA - 2005/12// PY - 2005/12// DO - 10.1016/j.osn.2006.02.001 VL - 2 IS - 4 SP - 199-200 J2 - Optical Switching and Networking LA - en OP - SN - 1573-4277 UR - http://dx.doi.org/10.1016/j.osn.2006.02.001 DB - Crossref ER - TY - JOUR TI - Selected papers from the BROADNETS 2004 Optical Networking Symposium AU - Rouskas, George N. AU - Neri, Fabio T2 - Optical Switching and Networking DA - 2005/9// PY - 2005/9// DO - 10.1016/j.osn.2005.06.002 VL - 2 IS - 2 SP - 71 J2 - Optical Switching and Networking LA - en OP - SN - 1573-4277 UR - http://dx.doi.org/10.1016/j.osn.2005.06.002 DB - Crossref ER - TY - JOUR TI - Traffic grooming in WDM ring networks to minimize the maximum electronic port cost AU - Chen, Bensong AU - Rouskas, George N. AU - Dutta, Rudra T2 - Optical Switching and Networking AB - We consider the problem of traffic grooming in WDM ring networks. Traffic grooming is a variant of the well-known logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Previous studies have focused on 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 high practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We present new theoretical results which demonstrate that traffic grooming with the Min–Max objective is NP-complete even when wavelength assignment is not an issue. We also present new polynomial-time traffic grooming algorithms for minimizing the maximum electronic port cost in both unidirectional and bidirectional rings. We evaluate our algorithms through experiments with a wide range of problem instances, by varying the network size, number of wavelengths, traffic load, and traffic pattern. Our results indicate that our algorithms produce 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. We also demonstrate that, despite the focus on minimizing the maximum cost, our algorithms also perform well in terms of the aggregate electronic port cost over all ring nodes. DA - 2005/5// PY - 2005/5// DO - 10.1016/j.osn.2005.01.002 VL - 2 IS - 1 SP - 1-18 J2 - Optical Switching and Networking LA - en OP - SN - 1573-4277 UR - http://dx.doi.org/10.1016/j.osn.2005.01.002 DB - Crossref ER - TY - JOUR TI - Editorial AU - Neri, Fabio AU - Rouskas, George N. T2 - Optical Switching and Networking DA - 2005/1// PY - 2005/1// DO - 10.1016/j.osn.2004.11.003 VL - 1 IS - 1 SP - 1-2 J2 - Optical Switching and Networking LA - en OP - SN - 1573-4277 UR - http://dx.doi.org/10.1016/j.osn.2004.11.003 DB - Crossref ER - TY - CONF TI - Generic matrix multiplication and memory management in linBox AU - Kaltofen, Erich AU - Morozov, Dmitriy AU - Yuhasz, George T2 - the 2005 international symposium AB - We describe the design and implementation of two components in the LinBox library. The first is an implementation of black box matrix multiplication as a lazy matrix-times-matrix product. The implementation uses template meta-programming to set the intermediate vector type used during application of the matrix product. We also describe an interface mechanism that allows incorporation of external components with native memory management such as garbage collection into LinBox. An implementation of the interface based on SACLIB's field arithmetic procedures is presented. C2 - 2005/// C3 - Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05 DA - 2005/// DO - 10.1145/1073884.1073915 PB - ACM Press SN - 1595930957 UR - http://dx.doi.org/10.1145/1073884.1073915 DB - Crossref ER - TY - CONF TI - On the complexity of factoring bivariate supersparse (Lacunary) polynomials AU - Kaltofen, Erich AU - Koiran, Pascal T2 - the 2005 international symposium AB - We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size. In supersparse polynomials, the term degrees can have hundreds of digits as binary numbers. Our algorithms are Monte Carlo randomized for quadratic factors and deterministic for linear factors. Our approach relies on the results by H. W. Lenstra, Jr., on computing factors of univariate supersparse polynomials over the rational numbers. Furthermore, we show that the problem of determining the irreducibility of a supersparse bivariate polynomial over a large finite field of any characteristic is co-NP-hard via randomized reductions. C2 - 2005/// C3 - Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05 DA - 2005/// DO - 10.1145/1073884.1073914 PB - ACM Press SN - 1595930957 UR - http://dx.doi.org/10.1145/1073884.1073914 DB - Crossref ER - TY - CHAP TI - Adaptive Load Diffusion for Stream Joins AU - Gu, Xiaohui AU - Yu, Philip S. T2 - Middleware 2005 AB - Data stream processing has become increasingly important as many emerging applications call for sophisticated realtime processing over data streams, such as stock trading surveillance, network traffic monitoring, and sensor data analysis. Stream joins are among the most important stream processing operations, which can be used to detect linkages and correlations between different data streams. One major challenge in processing stream joins is to handle continuous, high-volume, and time-varying data streams under resource constraints. In this paper, we present a novel load diffusion system to enable scalable execution of resource-intensive stream joins using an ensemble of server hosts. The load diffusion is achieved by a simple correlation-aware stream partition algorithm. Different from previous work, the load diffusion system can (1) achieve fine-grained load sharing in the distributed stream processing system; and (2) produce exact query answers without missing any join results or generate duplicate join results. Our experimental results show that the load diffusion scheme can greatly improve the system throughput and achieve more balanced load distribution. PY - 2005/// DO - 10.1007/11587552_22 SP - 411-420 OP - PB - Springer Berlin Heidelberg SN - 9783540303237 9783540322696 UR - http://dx.doi.org/10.1007/11587552_22 DB - Crossref ER - TY - JOUR TI - Semantic Association Identification and Knowledge Discovery for National Security Applications T2 - Journal of Database Management AB - Public and private organizations have access to a vast amount of internal, deep Web and open Web information. Transforming this heterogeneous and distributed information into actionable and insightful information is the key to the emerging new classes of business intelligence and national security applications. Although the role of semantics in search and integration has been often talked about, in this paper we discuss semantic approaches to support analytics on vast amounts of heterogeneous data. In particular, we bring together novel academic research and commercialized Semantic Web technology. The academic research related to semantic association identification is built upon commercial Semantic Web technology for semantic metadata extraction. A prototypical demonstration of this research and technology is presented in the context of an aviation security application of significance to national security. DA - 2005/1// PY - 2005/1// DO - 10.4018/jdm.2005010103 UR - http://dx.doi.org/10.4018/jdm.2005010103 KW - content analytics KW - knowledge discovery KW - ontology KW - RDF KW - semantic analytics KW - semantic applications for homeland security KW - semantic association KW - semantic metadata KW - semantic web technology ER - TY - CONF TI - SemRank AB - While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently gained some ground, the issue of how search results will be ranked remains largely unaddressed. Since it is expected that the number of relationships between entities in a knowledge base will be much larger than the number of entities themselves, the likelihood that Semantic Association searches would result in an overwhelming number of results for users is increased, therefore elevating the need for appropriate ranking schemes. Furthermore, it is unlikely that ranking schemes for ranking entities (documents, resources, etc.) may be applied to complex structures such as Semantic Associations.In this paper, we present an approach that ranks results based on how predictable a result might be for users. It is based on a relevance model SemRank, which is a rich blend of semantic and information-theoretic techniques with heuristics that supports the novel idea of modulative searches, where users may vary their search modes to effect changes in the ordering of results depending on their need. We also present the infrastructure used in the SSARK system to support the computation of SemRank values for resulting Semantic Associations and their ordering. C2 - 2005/// C3 - Proceedings of the 14th international conference on World Wide Web - WWW '05 DA - 2005/// DO - 10.1145/1060745.1060766 UR - http://dx.doi.org/10.1145/1060745.1060766 ER - TY - CHAP TI - A Formal Model for the Problem of View Selection for Aggregate Queries AU - Li, Jingni AU - Talebi, Zohreh Asgharzadeh AU - Chirkova, Rada AU - Fathi, Yahya T2 - Advances in Databases and Information Systems AB - We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, would reduce the evaluation costs of the queries. Optimizing the layout of stored data using view selection has a direct impact on the performance of the entire database system. At the same time, the optimization problem is intractable, even under natural restrictions on the types of queries of interest. In this paper we use an integer-programming model to obtain optimal solutions to the problem of view selection for aggregate queries on data warehouses. We also report the results of the post-optimality analysis that we performed to determine/observe the impact of changing certain input characteristics on the optimal solution. PY - 2005/// DO - 10.1007/11547686_10 SP - 125-138 OP - PB - Springer Berlin Heidelberg SN - 9783540285854 9783540318958 UR - http://dx.doi.org/10.1007/11547686_10 DB - Crossref ER - TY - JOUR TI - Intracranial vascular transfer function in acute stroke patients AU - Wu, Yang AU - An, Hongyu AU - Krim, Hamid AU - Vo, Katie AU - Lee, Jin-Moo AU - Lin, Weili T2 - Journal of Cerebral Blood Flow & Metabolism AB - Vascular transfer function (VTF) could potentially provide highly relevant physiological information, particularly in patients with cerebrovascular diseases. In this study, we aim to investigate potential alterations of intracranial VTF in patients with acute stroke. The widely employed dynamic susceptibility contrast (DSC) MR approach was employed to acquire images and spatial independent component analysis (ICA) was used to determine local arterial function (LAF) 1, reflecting MR signal changes resulted in the passage of the injected contrast. Subsequently, pixel-by-pixel VTF was derived through the deconvolution of the LAFs with a global artery function (GAF) obtained from the middle cerebral artery (MCA) using singular value decomposition (SVD). The ability to non-invasively depict VTF may offer new insights into blood flow related alterations in acute stroke patients. Perfusion images (PWI) were acquired using DSC from three healthy volunteers at 3 T and five acute stroke patients within 3-6 hrs from symptom onset at 1.5 T using a single shot T2*-weighted EPI sequence. In addition, diffusion-weighted (DWI) images were also acquired. GAF, Cga(t), was obtained through averaging contrast induced signal changes in the contralateral MCA with recirculation effects removed. The susceptibility related signal changes were converted to concentration curves. ICA analysis (ISP group, DTU, http://isp.imm.dtu.dk/toolbox) was applied to the concentration time curves throughout the entire brain 1. LAFs, Cla(x,t), were constructed based on both the spatial mappings and the temporal characteristics of the components, similar to that proposed in reference 1. Finally, VTF (T(x,t)) was obtained through SVD by deconvolving LAFs with GAF. In order to characterize how VTF differs between brain regions, DWI and PWI images were employed to define two region-of-interests (ROIs), namely, DWI-defined lesions and PWI/DWI mismatched regions while a normal ROI was defined in the contralateral hemisphere. In contrast, two ROIs were placed in the two hemispheres for the normal volunteers. Finally, the full-width-half-maximum (FWHM) and the power (EVTF) of the first harmonic of VTF were used to quantitatively determine the discrepancies between different ROIs. For comparison purposes, the ETVF obtained in stroke patients was normalized to that obtained from the normal volunteers. The FWHM obtained from normal volunteers is 5.8+/-0.2 s and 6.0+/-0.02 s, respectively, in the two ROIs. In contrast, for the stroke patients the DWI-defined lesions exhibit a much larger FWHM (9.0+/-8.8 s) while a similar FWHM was obtained for both the PWI/DWI mismatched regions (5.5+/-1.7 s) and the contralateral hemisphere (4.9+/-1.4 s) when compared with that obtained in normal subjects. In addition, the normalized power of the first harmonic of the VTF demonstrates that the DWI-defined lesion, PWI/DWI mismatched regions, and the contralateral hemisphere is 24.1+/-31.1%, 43.5+/-35.4%, and 153.5+/-103.8% with respect to that obtained in normal subjects, respectively. These findings suggest that the DWI-defined lesions exhibit the largest bolus dispersion and smallest power when compared with that obtained in the normal subjects as well as other brain regions in stroke patients. Although our study has a limited sample size, we have demonstrated a novel tool for obtaining VTF in acute stroke patients. DA - 2005/8// PY - 2005/8// DO - 10.1038/sj.jcbfm.9591524.0394 VL - 25 IS - 1_suppl SP - S394-S394 J2 - J Cereb Blood Flow Metab LA - en OP - SN - 0271-678X 1559-7016 UR - http://dx.doi.org/10.1038/sj.jcbfm.9591524.0394 DB - Crossref ER - TY - CHAP TI - Marve: A Prototype Virtual Human Interface Framework for Studying Human-Virtual Human Interaction AU - Babu, Sabarish AU - Schmugge, Stephen AU - Inugala, Raj AU - Rao, Srinivasa AU - Barnes, Tiffany AU - Hodges, Larry F. T2 - Intelligent Virtual Agents AB - Human to virtual human interaction is the next frontier in interface design, particularly for tasks that are social or collaborative in nature. Several embodied interface agents have been developed for specific social, place-related tasks, but empirical evaluations of these systems have been rare. In this work, we present Marve (Messaging And Recognition Virtual Entity), our general purpose Virtual Human Interface Framework, which integrates cutting-edge interface technologies into a seamless real-time system, to study human to virtual human interaction. Marve is a prototype of a real-time embodied, interactive, autonomous, virtual human interface agent framework. Marve “lives” next to the primary entrance of the Future Computing Lab. His primary tasks are to greet everyone who enters or leaves the lab, and to take and deliver messages to the students and faculty who work there. Marve uses computer vision techniques for passer-by detection, gaze tracking, and face recognition, and communicates via natural language. We present a preliminary empirical study of the basic elements of Marve, including interaction response times, recognition of friends, and ability to learn to recognize new people. PY - 2005/// DO - 10.1007/11550617_11 SP - 120-133 OP - PB - Springer Berlin Heidelberg SN - 9783540287384 9783540287391 UR - http://dx.doi.org/10.1007/11550617_11 DB - Crossref ER - TY - CONF TI - Applying programming by demonstration in an intelligent authoring tool for cognitive tutors AU - Matsuda, N. AU - Cohen, W.W. AU - Koedinger, K.R. C2 - 2005/// C3 - AAAI Workshop - Technical Report DA - 2005/// VL - WS-05-04 SP - 1-8 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33646048713&partnerID=MN8TOARS ER - TY - BOOK TI - Trusting agents for trusting electronic societies: Theory and applications in HCI and e-commerce - Preface AU - Falcone, R. AU - Barber, S. AU - Sabater-Mir, J. AU - Singh, M. DA - 2005/// PY - 2005/// VL - 3577 LNAI UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77049101012&partnerID=MN8TOARS ER - TY - CONF TI - Toward Web services interaction styles AU - Maximilien, E.M. AU - Singh, M.P. AB - Service-oriented architectures (SOAs) are fundamentally changing the way in which we conceptualize and design business applications. A SOA-based application typically composes various distributed functions, including some possibly provided by external parties such as independent businesses. The key advantage of SOAs is the resulting dynamism, since the composed parts can be readily swapped out in favor of others of like functionality. SOA environments thus reflect the dynamism of human socioeconomic environments where businesses interact, collaborate, and expose services to each other in order to jointly create value. This paper presents a multiagent model for Web services and catalogs architectural styles that are key for SOA applications. It conceptually evaluates the styles by showing the kinds of service usages and the resulting dynamic interactions that they enable. C2 - 2005/// C3 - Proceedings - 2005 IEEE International Conference onServices Computing, SCC 2005 DA - 2005/// DO - 10.1109/SCC.2005.101 VL - I SP - 147-154 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33749048933&partnerID=MN8TOARS ER - TY - CONF TI - Self-adjusting trust and selection for web services AU - Maximilien, E.M. AU - Singh, M.P. AB - Service-oriented architectures enable services to be dynamically selected and integrated at runtime, thus enabling system flexibility and adaptiveness - autonomic attributes that are key for modern business needs. However, current techniques provide no support for actually making rational selections, which are key to accomplishing autonomic behavior. We develop a multiagent framework based on an ontology for QoS and a new model of trust. The agents form an ecosystem in which they help each other select services best matching their preferences. We evaluate by simulation the agents' effectiveness in maintaining self-adjusting trust C2 - 2005/// C3 - Proceedings - Second International Conference on Autonomic Computing, ICAC 2005 DA - 2005/// DO - 10.1109/ICAC.2005.53 VL - 2005 SP - 385-386 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33745513089&partnerID=MN8TOARS ER - TY - CONF TI - OWL-P: OWL for protocol and processes AU - Mallya, A.U. AU - Desai, N. AU - Chopra, A.K. AU - Singh, M.P. C2 - 2005/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2005/// SP - 15-16 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33644797124&partnerID=MN8TOARS ER - TY - CONF TI - Proceedings of the International Conference on Autonomous Agents: Introduction AU - Kraus, S. AU - Singh, M.P. AU - Koenig, S. AU - Wooldridge, M. C2 - 2005/// C3 - Proceedings of the International Conference on Autonomous Agents DA - 2005/// SP - 1443-1444 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33644803821&partnerID=MN8TOARS ER - TY - CONF TI - Modeling exceptions via commitment protocols AU - Mallya, Ashok U. AU - Singh, Munindar P. T2 - the fourth international joint conference AB - This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for successful applications of multiagent systems. Protocols help build multiagent systems, but traditional representations (such as finite state machines or Petri nets) inadequately model complex interactions and exceptions therein. Emerging commitment-based representations are promising, because they declaratively reflect the semantics of an interaction. However, current approaches lack a strong treatment of exceptions.This paper treats both expected and unexpected exceptions. A commitment protocol is modeled as a set of computations, each representing an allowed interaction and showing the evolving commitments of the participants. Exceptions are modeled via preference structures induced on these sets of computations. The preference structures statically show how expected exceptions are handled whereas the structures must be enhanced dynamically to handle unexpected exceptions. Our approach includes operators for composing protocols and exception handlers, whereby appropriate exception handlers can be dynamically introduced into a protocol as needed.The main contributions of this paper are (1) a framework for modeling and handling exceptions intelligently in commitment protocols and (2) a demonstration of the benefits of commitment protocols over traditional formalisms in handling exceptions. C2 - 2005/// C3 - Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05 DA - 2005/// DO - 10.1145/1082473.1082492 SP - 273-280 PB - ACM Press SN - 1595930930 UR - http://dx.doi.org/10.1145/1082473.1082492 DB - Crossref ER - TY - CONF TI - Formalizing and achieving multiparty agreements via commitments AU - Wan, Feng AU - Singh, Munindar P. T2 - the fourth international joint conference AB - Multiparty agreements often arise in a multiagent system where autonomous agents interact with each other to achieve a global goal. Multiparty agreements are traditionally represented by messaging protocols or event-condition-action rule sets in which agents exchange messages in a predefined sequence to ensure both global and local consistency. However, these models do not readily incorporate agents' autonomy and heterogeneity, which limits their ability to help build a flexible open system. Commitments have been studied for modelling various agent interactions. They have also been used as the key elements for formulating multi-party agreements and centralized approaches for resolving potential conflicts. This paper extends the above results by refining the formalizations and the existing protocols and proposing a decentralized protocol which is more efficient in resolving conflicts. It also introduces the concept of protocol safety, which ensures that agents not only interact efficiently but also correctly. This approach is geared toward constructing business processes where agents are mutually constraints in a manner that preserves their autonomy and heterogeneity. C2 - 2005/// C3 - Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05 DA - 2005/// DO - 10.1145/1082473.1082591 SP - 899-906 PB - ACM Press SN - 1595930930 UR - http://dx.doi.org/10.1145/1082473.1082591 DB - Crossref ER - TY - JOUR TI - Enabling persistent Web services via commitments AU - Wan, F. AU - Singh, M.P. T2 - Information Technology and Management DA - 2005/// PY - 2005/// DO - 10.1007/s10799-004-7774-3 VL - 6 IS - 1 SP - 41-60 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-14544306447&partnerID=MN8TOARS ER - TY - BOOK TI - Analyzing multiparty agreements with commitments AU - Wan, F. AU - Singh, M.P. DA - 2005/// PY - 2005/// VL - 3508 LNAI SE - 85-96 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-26944458859&partnerID=MN8TOARS ER - TY - CONF TI - An evaluation of e-business metamodels AU - Singh, M.P. AU - Lei, Y. C2 - 2005/// C3 - 17th International Conference on Software Engineering and Knowledge Engineering, SEKE 2005 DA - 2005/// SP - 88-93 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84886893879&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing e-business protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2005/// C3 - Lecture Notes in Computer Science DA - 2005/// VL - 3387 SP - 111-123 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-24144480932&partnerID=MN8TOARS ER - TY - CONF TI - A semantic approach for designing commitment protocols AU - Mallya, A.U. AU - Singh, M.P. C2 - 2005/// C3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) DA - 2005/// VL - 3396 SP - 33-49 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-26844566333&partnerID=MN8TOARS ER - TY - BOOK TI - Service-Oriented Computing AU - Singh, Munindar P. AU - Huhns, Michael N. DA - 2005/1/1/ PY - 2005/1/1/ PB - John Wiley & Sons UR - http://www.csc.ncsu.edu/faculty/mpsingh/books/SOC/ ER - TY - CONF TI - Agent-based trust model involving multiple qualities AU - Maximilien, E. Michael AU - Singh, Munindar P. T2 - the fourth international joint conference AB - A key limitation of current Web services standards is the inability to differentiate service instances at runtime using (nonfunctional) qualities of services (QoS). Such differentiation is necessary to allow for runtime selection and binding to service instances in a manner that continually adapts selected services to the service consumer's preferences and needs. Quality values are volatile, depend on the trust associated with instances and service providers, and also depend on the needs of service consumers. We propose a multiagent framework where agents consider the consumers' QoS preferences, determine trust levels to associate to service instances and providers, and automatically select service instances on a consumer's behalf. The service agents use a trust model that is centered on a shared conceptualization for QoS (ontology) and a QoS preference model that considers consumer's tradeoffs among qualities as well as relationships between qualities. We evaluate our approach via simulations on simplified but realistic service instances and service consumers. Our results show that using these considerations for QoS, service agents are able to determine over time the 'best' service selection for a consumer. C2 - 2005/// C3 - Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05 DA - 2005/// DO - 10.1145/1082473.1082552 SP - 653-660 PB - ACM Press SN - 1595930930 UR - http://dx.doi.org/10.1145/1082473.1082552 DB - Crossref ER - TY - CONF TI - Effective bounding techniques for solving unate and binate covering problems AU - Li, Xiao Yu AU - Stallmann, Matthias F AU - Brglez, Franc T2 - ACM C2 - 2005/// C3 - Proceedings of the 42nd annual Design Automation Conference DA - 2005/// SP - 385-390 ER - TY - CONF TI - The Memogate affair: A case study on privacy in computer networks AU - Gehringer, Edward F. T2 - 2005 ASEE Annual Conference and Exposition C2 - 2005/// C3 - Proceedings of the 2005 ASEE Annual Conference and Exposition CY - Portland, OR DA - 2005/// PY - 2005/6/12/ PB - American Society for Engineering Education ER - TY - CONF TI - Reuse of homework and test questions: when, why, and how to maintain security? AU - Gehringer, E.F. T2 - 34th Annual Frontiers in Education, 2004. FIE 2004. AB - It is always difficult to obtain good homework problems and test questions. Instructors can save time - and polish their work - by using the same questions they used before. And they would do so semester after semester, except for one obvious risk: that students would simply copy or memorize the answers rather than learning the material. This paper presents the results of a survey of hundreds of postsecondary educators. How frequently do they reuse questions, and how do they prevent students from getting advance access to the answers? How much trouble have they had with "files" kept by fraternities, sororities, and ethnic groups? Do they consider it cheating to copy or memorize answers? Has the increasing use of electronic resources made it easier or harder to maintain security? Do they typically alter their policies when they begin to put material on line? The answers to these questions can guide all of us to more realistic and secure reuse policies. C2 - 2005/3/31/ C3 - 34th Annual Frontiers in Education, 2004. FIE 2004. DA - 2005/3/31/ DO - 10.1109/fie.2004.1408702 PB - IEEE SN - 0780385527 UR - http://dx.doi.org/10.1109/fie.2004.1408702 DB - Crossref ER - TY - CONF TI - A comparison of J2EE and .NET as platforms for teaching web services AU - Kachru, S. AU - Gehringer, E.F. T2 - 34th Annual Frontiers in Education, 2004. FIE 2004. AB - .NET and J2EE are the two leading technologies in enterprise-level application development. They are also the platforms of choice for developing Web services. We compare the two platforms using parameters such as features present in each platform, tools and resources offered by the two and compatibility with the rest of the curriculum. .NET offers integrated, native support for various phases of Web services development, while the Java platform achieves this with several new libraries. We compare the Web-services development process in IBM's Websphere (for J2EE) and Microsoft's visual studio .NET and find them remarkably similar. Arguments in favor of J2EE are platform independence, multiple vendor support, the popularity of Java in universities, and a larger number of tools and resources from which to choose. Points favoring .NET include support for multiple languages, and integrated (rather than add-on) support for Web services. The disadvantage of single-vendor support in .NET must be weighed against J2EE's single-language support. C2 - 2005/3/31/ C3 - 34th Annual Frontiers in Education, 2004. FIE 2004. DA - 2005/3/31/ DO - 10.1109/fie.2004.1408754 PB - IEEE SN - 0780385527 UR - http://dx.doi.org/10.1109/fie.2004.1408754 DB - Crossref ER - TY - JOUR TI - Performance Evaluation of an Optical Burst Switching Scheme for Grid Networks AU - Mountrouidou, Xenia AU - Perros, Harry G. AU - Beshai, Maged T2 - 2ND INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS (BROADNETS 2005) AB - We propose and evaluate a novel scheme, referred to as bimodal burst switching (BBS) scheme, for optical burst switching (OBS) star networks, which can be used in grid networks. The main feature of this scheme is that it has zero burst loss and a large geographical coverage. Using simulation techniques we show that the proposed scheme provides high bandwidth and outperforms OBS DA - 2005/// PY - 2005/// DO - 10.1109/icbn.2005.1589775 SP - 515-+ ER - TY - PAT TI - Gallium nitride materials including thermally conductive regions AU - Borges, R. AU - Linthicum, K. J. AU - Weeks, T. W. AU - Gehrke, T. C2 - 2005/// DA - 2005/// PY - 2005/// ER - TY - CHAP TI - Multivariate stream data reduction in sensor network applications AU - Seo, S. AU - Kang, J. AU - Ryu, K. H. T2 - Embedded and ubiquitous computing--EUC 2005 workshops: EUC 2005 workshops: UISW, NCUS, SecUbiq, USN and TAUES, Nagasaki, Japan, December 6-9, 2005: Proceedings CN - TK7895.E42 E55 2005 PY - 2005/// VL - 3823 SP - 198-207 PB - Berlin: Springer SN - 3540308032 ER - TY - JOUR TI - Network access control for mobile ad-hoc networks AU - Wang, P. AU - Ning, P. AU - Reeves, D. S. T2 - Information and Communications Security DA - 2005/// PY - 2005/// VL - 3783 SP - 350-362 ER - TY - CHAP TI - Safe overprovisioning: Using power limits to increase aggregate throughput AU - Femal, M. E. AU - Freeh, V. W. T2 - Power-aware computer systems: 4th International Workshop, PACS 2004, Portland, OR, USA, December 5, 2004 (Lecture notes in computer science; 3471) A2 - B. Falsafi, T.N. Vijaykumar AB - Management of power in data centers is driven by the need to not exceed circuit capacity. The methods employed in the oversight of these power circuits are typically static and ad-hoc. New power-scalable system components allow for dynamically controlling power consumption with an accompanying effect on performance. Because the incremental performance gain from operating in a higher performance state is less than the increase in power, it is possible to overprovision the hardware infrastructure to increase throughput and yet still remain below an aggregate power limit. In overprovisioning, if each component operates at maximum power the limit would be exceeded with disastrous results. However, safe overprovisioning regulates power consumption locally to meet the global power budget. Host-based and network-centric models are proposed to monitor and coordinate the distribution of power with the fundamental goal of increasing throughput. This research work presents the advantages of overprovisioning and describes a general framework and an initial prototype. Initial results with a synthetic benchmark indicate throughput increases of nearly 6% from a staticly assigned, power managed environment and over 30% from an unmanaged environment. CN - TK7895.P68 P33 2004 PY - 2005/// DO - 10.1007/11574859_11 VL - 3471 SP - 150-164 PB - Berlin: Springer ER - TY - JOUR TI - Fault-tolerant cluster-wise clock synchronization for wireless sensor networks AU - Sun, K AU - Ning, P AU - Wang, C T2 - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING AB - Wireless sensor networks have received a lot of attention recently due to their wide applications, such as target tracking, environment monitoring, and scientific exploration in dangerous environments. It is usually necessary to have a cluster of sensor nodes share a common view of a local clock time, so that all these nodes can coordinate in some important applications, such as time slotted MAC protocols, power-saving protocols with sleep/listen modes, etc. However, all the clock synchronization techniques proposed for sensor networks assume benign environments; they cannot survive malicious attacks in hostile environments. Fault-tolerant clock synchronization techniques are potential candidates to address this problem. However, existing approaches are all resource consuming and suffer from message collisions in most of cases. This paper presents a novel fault-tolerant clock synchronization scheme for clusters of nodes in sensor networks, where the nodes in each cluster can communicate through broadcast. The proposed scheme guarantees an upper bound of clock difference between any nonfaulty nodes in a cluster, provided that the malicious nodes are no more than one third of the cluster. Unlike the traditional fault-tolerant clock synchronization approaches, the proposed technique does not introduce collisions between synchronization messages, nor does it require costly digital signatures. DA - 2005/// PY - 2005/// DO - 10.1109/TDSC.2005.36 VL - 2 IS - 3 SP - 177-189 SN - 1941-0018 KW - clock synchronization KW - wireless sensor networks KW - fault tolerance ER - TY - CHAP TI - Integrating heterogeneous microarray data sources using correlation signatures AU - Kang, J. W. AU - Yang, J. O. AU - Xu, W. H. AU - Chopra, P. T2 - Data integration in the life sciences: Second international workshop, DILS 2005, San Diego, CA, USA, July 20-22, 2005: Proceedings A2 - B. Ludascher, A2 - Raschid, L. CN - [Electronic Resource] PY - 2005/// VL - 3615 SP - 105-120 PB - Berlin; New York: Springer SN - 3540279679 ER - TY - CHAP TI - Designing and using views to improve performance of aggregate queries (extended abstract) AU - Afrati, F. AU - Chirkova, R. AU - Gupta, S. AU - Loftis, C. T2 - Database systems for advanced applications: 10th international conference, DASFAA 2005, Beijing, China, April 17-20, 2005: Proceedings (Lecture notes in computer science ; 3454) A2 - L. Zhou, B.C. Ooi A2 - Meng, X. AB - Data-intensive systems routinely use derived data (e.g., indexes or materialized views) to improve query-evaluation performance. We present a system architecture for Query-Performance Enhancement by Tuning (QPET), which combines design and use of derived data in an end-to-end approach to automated query-performance tuning. Our focus is on a tradeo. between (1) the amount of system resources spent on designing derived data and on keeping the data up to date, and (2) the degree of the resulting improvement in query performance. From the technical point of view, the novelty that we introduce is that we combine aggregate query rewriting techniques [1, 2] and view selection techniques [3] to achieve our goal. CN - QA76.9 .D3 I5565 2005 PY - 2005/// DO - 10.1007/11408079_48 VL - 3453 SP - 548-554 PB - Berlin; New York: Springer SN - 3540253343 ER - TY - BOOK TI - Connection-Oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks AU - Perros, HG DA - 2005/// PY - 2005/// DO - 10.1002/0470016361 SE - 1-332 ER - TY - JOUR TI - A detailed analysis and performance comparison of wavelength reservation schemes for optical burst switched networks AU - Teng, J AU - Rouskas, G T2 - PHOTONIC NETWORK COMMUNICATIONS DA - 2005/5// PY - 2005/5// DO - 10.1007/s11107-004-6435-0 VL - 9 IS - 3 SP - 311-335 SN - 1572-8188 KW - optical burst switching KW - wavelength reservation KW - just-in-time signaling ER - TY - JOUR TI - A multiscale approach to pixel-level image fusion AU - Ben Hamza, A. AU - He, Y. AU - Krim, H. AU - Willsky, A. T2 - Integrated Computer-aided Engineering AB - Pixel level image fusion refers to the processing and synergistic combination of information gathered by various imaging sources to provide a better understanding of a scene. We formulate the image fusion as an optimization problem and propose an inf DA - 2005/// PY - 2005/// DO - 10.3233/ica-2005-12201 VL - 12 IS - 2 SP - 135-146 ER - TY - JOUR TI - Simulating perfect channels with probabilistic lossy channels AU - Abdulla, P AU - Baier, C AU - Iyer, SP AU - Jonsson, B T2 - INFORMATION AND COMPUTATION AB - We consider the problem of deciding whether an infinite-state system (expressed as a Markov chain) satisfies a correctness property with probability 1. This problem is, of course, undecidable for general infinite-state systems. We focus our attention on the model of probabilistic lossy channel systems consisting of finite-state processes that communicate over unbounded lossy FIFO channels. Abdulla and Jonsson have shown that safety properties are decidable while progress properties are undecidable for non-probabilistic lossy channel systems. Under assumptions of “sufficiently high” probability of loss, Baier and Engelen have shown how to check whether a property holds of probabilistic lossy channel system with probability 1. In this paper, we consider a model of probabilistic lossy channel systems, where messages can be lost only during send transitions. In contrast to the model of Baier and Engelen, once a message is successfully sent to channel, it can only be removed through a transition which receives the message. We show that checking whether safety properties hold with probability 1 is undecidable for this model. Our proof depends upon simulating a perfect channel, with a high degree of confidence, using lossy channels. DA - 2005/// PY - 2005/// DO - 10.1016/j.ic.2004.12.001 VL - 197 IS - 1-2 SP - 22-40 SN - 1090-2651 ER - TY - JOUR TI - SNAP: workbench management tool for evolutionary population genetic analysis AU - Price, EW AU - Carbone, I T2 - BIOINFORMATICS AB - Abstract Summary: The reconstruction of population processes from DNA sequence variation requires the coordinated implementation of several coalescent-based methods, each bound by specific assumptions and limitations. In practice, the application of these coalescent-based methods for parameter estimation is difficult because they make strict assumptions that must be verified a priori and their parameter-rich nature makes the estimation of all model parameters very complex and computationally intensive. A further complication is their distribution as console applications that require the user to navigate through console menus or specify complex command-line arguments. To facilitate the implementation of these coalescent-based tools we developed SNAP Workbench, a Java program that manages and coordinates a series of programs. The workbench enhances population parameter estimation by ensuring that the assumptions and program limitations of each method are met and by providing a step-by-step methodology for examining population processes that integrates both summary-statistic methods and coalescent-based population genetic models. Availability: SNAP Workbench is freely available at http://snap.cifr.ncsu.edu. The workbench and tools can be downloaded for Mac, Windows and Unix operating systems. Each package includes installation instructions, program documentation and a sample dataset. Contact: ignazio_carbone@ncsu.edu Supplementary information: A description of system requirements and installation instructions can be found at http://snap.cifr.ncsu.edu DA - 2005/2/1/ PY - 2005/2/1/ DO - 10.1093/bioinformatics/bti003 VL - 21 IS - 3 SP - 402-404 SN - 1460-2059 ER - TY - JOUR TI - Probabilistic temporal logics via the modal mu-calculus AU - Cleaveland, R AU - Iyer, SP AU - Narasimha, M T2 - THEORETICAL COMPUTER SCIENCE AB - This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a model-checking algorithm for determining whether or not states in finite-state RPLTSs satisfy formulas in the logic. The logic is based on the distinction between (probabilistic) “systems” and (nonprobabilistic) “observations”: using the modal mu-calculus, one may specify sets of observations, and the semantics of our logic then enable statements to be made about the measures of such sets at various system states. The logic may be used to encode a variety of probabilistic modal and temporal logics; in addition, the model-checking problem for it may be reduced to the calculation of solutions to systems of non-linear equations. Finally, the logic induces an equivalence on RPLTSs that coincides with accepted notions of probabilistic bisimulation in the literature. DA - 2005/9/7/ PY - 2005/9/7/ DO - 10.1016/j.tcs.2005.03.048 VL - 342 IS - 2-3 SP - 316-350 SN - 1879-2294 KW - probabilistic transition systems KW - reactive systems KW - probabilistic temporal logic KW - model-checking KW - Probabilistic bisimulation ER - TY - CHAP TI - Proactive mediation in plan-based narrative environments AU - Harris, J. AU - Young, R. M. T2 - Intelligent Virtual Agents: 5th International Working Conference, IVA 2005, Kos, Greece, September 12-14, 2005: Proceedings CN - [Electronic Resource] PY - 2005/// VL - 3661 SP - 292-304 PB - New York: Springer SN - 3540287388 ER - TY - JOUR TI - On the accuracy of semi-Lagrangian numerical simulation of internal gravity wave motion in the atmosphere AU - Semazzi, FHM AU - Scroggs, JS AU - Pouliot, GA AU - McKee-Burrows, AL AU - Norman, M AU - Poojary, V AU - Tsai, YM T2 - JOURNAL OF THE METEOROLOGICAL SOCIETY OF JAPAN AB - We have investigated the accuracy ofthe semi-implicit semi-Lagrangian (SISL) method in simulating internal gravity wave (IGW) motion. We have focused on the relative accuracy of the hydrostatic, and nonhydrostatic IGW solutions. The analysis is based on a linearized model and a Global Circulation Model-Dynamic Core (GCM-DC) with a stretched grid.The nonhydrostatic version of the GCM-DC model produces the familiar IGW train disturbance anchored to an isolated hypothetical mountain. The wave has a distinct tilt away from the vertical direction, which is consistent with classical theory. For the hydrostatic version of the model, the axis of the resulting IGW train rests nearly perpendicular to the mountain top, thus again consistent with classical theory. Increasing the time step from 10 s; Courant number (Cn) = 0.5; to 60 s (Cn = 3.0), results in stable solutions for both the hydrostatic and nonhydrostatic versions of the model. The nonhydrostatic solution is in close agreement with the control run however, the hydrostatic solution exhibits large phase truncation errors.The solutions for the one-dimensional linearized SISL model confirm the GCM-DC results that the nonhydrostatic IGW train is less damped and shifted by the SISL scheme than the corresponding hydrostatic IGW motion. The linear solutions indicate very high accuracy of the physical mode of the solution, but it rapidly deteriorates when Cn exceeds unity. As Δt → 0 the amplitude of the computational mode tends to zero and its frequency to infinity. However, as Δt → ∞, the frequency of the computational SISL mode asymptotically approaches the value of the frequency of the corresponding SISL physical mode. Furthermore, the amplitude of the SISL computational mode is directly proportional to the size of the time step. Therefore, at large time steps, the amplification of the computational mode could offset some of the numerical damping of the physical mode by the SISL scheme. DA - 2005/10// PY - 2005/10// DO - 10.2151/jmsj.83.851 VL - 83 IS - 5 SP - 851-869 SN - 2186-9057 ER - TY - CHAP TI - Identifying value mappings for data integration: An unsupervised approach AU - Kang, J. AU - Lee, D. AU - Mitra, P. T2 - Web information systems engineering--WISE 2005: 6th International Conference on Web Information Systems Engineering, New York, NY, USA, November 20-22, 2005: Proceedings (Lecture notes in computer science; 3806) CN - [Electronic Resource] PY - 2005/// VL - 3806 SP - 544-551 PB - Berlin: Springer-Verlag SN - 3540300171 ER - TY - CHAP TI - Efficient security mechanisms for overlay multicast-based content distribution AU - Zhu, S. C. AU - Yao, C. AU - Liu, D. G. AU - Setia, S. AU - Jajodia, S. T2 - Applied cryptography and network security: Third international conference, ACNS 2005, New York, NY, USA, June 7-10, 2005: Proceedings (Lecture notes in computer science; 3531) A2 - J. Ioannidis, A. Keromytis A2 - Yung, M. CN - [Electronic Resource] PY - 2005/// VL - 3531 SP - 40-55 PB - Berlin; New York: Springer SN - 3540262237 ER - TY - CHAP TI - Designing views to efficiently answer real SQL queries AU - Afrati, F. AU - Chirkova, R. AU - Gergatsoulis, M. AU - Pavlaki, V. T2 - Abstraction, reformulation and approximation: 6th international symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005: proceedings (Lecture notes in computer science, Lecture notes in artificial intelligence; 3607) A2 - J-D. Zucker, A2 - Saitta, L. AB - The problem of optimizing queries in the presence of materialized views and the related view-design problem have recently attracted a lot of attention. Significant research results have been reported, and materialized views are increasingly used in query evaluation in commercial data-management systems. At the same time, most results in the literature assume set-theoretic semantics, whereas SQL queries have bag-theoretic semantics (duplicates are not eliminated unless explicitly requested). This paper presents results on selecting views to answer queries in relational databases under set, bag, and bag-set semantics. The results can be used under each of the three assumptions, to find sound and complete algorithms for designing views and rewriting queries efficiently. CN - Electronic Resource PY - 2005/// DO - 10.1007/11527862_26 VL - 3607 SP - 332-346 PB - Berlin; New York: Springer SN - 3540278729 ER - TY - CHAP TI - An objective character believability evaluation procedure for multi-agent story generation systems AU - Riedl, M. O. AU - Young, R. M. T2 - Intelligent Virtual Agents: 5th International Working Conference, IVA 2005, Kos, Greece, September 12-14, 2005: Proceedings CN - [Electronic Resource] PY - 2005/// VL - 3661 SP - 278-291 PB - New York: Springer SN - 3540287388 ER - TY - CHAP TI - Selecting and using views to compute aggregate queries (extended abstract) AU - Afrati, F. AU - Chirkova, R. T2 - Database theory: ICDT 2005, 10th international conference, Edinburgh, UK, January 5-7, 2005: Proceedings (Lecture notes in computer science ; 3363) A2 - T. Eiter, A2 - Libkin, L. AB - We consider a workload of aggregate queries and investigate the problem of selecting views that (1) provide equivalent rewritings for all queries, and (2) are optimal, in that the cost of evaluating the query workload is minimized. We consider conjunctive views and rewritings, with or without aggregation; in each rewriting, only one view contributes to computing the aggregated query output. We look at query rewriting using existing views and at view selection. In the query-rewriting problem, we give su.cient and necessary conditions for a rewriting to exist. For view selection, we prove complexity results. Finally, we give algorithms for obtaining rewritings and selecting views. CN - [Electronic Resource] PY - 2005/// DO - 10.1007/978-3-540-30570-5_26 VL - 3363 SP - 383-397 PB - Berlin; New York: Springer SN - 3540242880 ER - TY - JOUR TI - Research directions for service-oriented multiagent systems AU - Huhns, MN AU - Singh, MP AU - Burstein, M AU - Decker, K AU - Durfee, E AU - Finin, D AU - Gasser, L AU - Goradia, H AU - Jennings, N AU - Lakkaraju, K AU - Nakashima, H AU - Parunak, HV AU - Rosenschein, JS AU - Ruvinsky, A AU - Sukthankar, G AU - Swarup, S AU - Sycara, K AU - Tambe, M AU - Wagner, T AU - Zavala, L T2 - IEEE INTERNET COMPUTING AB - Today's service-oriented systems realize many ideas from the research conducted a decade or so ago in multiagent systems. Because these two fields are so deeply connected, further advances in multiagent systems could feed into tomorrow's successful service-oriented computing approaches. This article describes a 15-year roadmap for service-oriented multiagent system research. DA - 2005/// PY - 2005/// DO - 10.1109/MIC.2005.132 VL - 9 IS - 6 SP - 65-70 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-30144443074&partnerID=MN8TOARS ER - TY - CHAP TI - On the application of k-center algorithms in heirarchical traffic grooming AU - Chen, B. AU - Dutta, R. AU - Rouskas, G. T2 - Proceedings of the Second International IEEE/Create-net workshop on traffic grooming PY - 2005/// SP - 167-176 PB - Los Alamitos, CA: IEEE Computer Society SN - 0780392779 ER - TY - JOUR TI - Identification of a discrete planar symmetric shape from a single noisy view AU - Poliannikov, OV AU - Krim, H T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - In this paper, we propose a method for identifying a discrete planar symmetric shape from an arbitrary viewpoint. Our algorithm is based on a newly proposed notion of a view's skeleton. We show that this concept yields projective invariants which facilitate the identification procedure. It is, furthermore, shown that the proposed method may be extended to the case of noisy data to yield an optimal estimate of a shape in question. Substantiating examples are provided. DA - 2005/12// PY - 2005/12// DO - 10.1109/TIP.2005.859387 VL - 14 IS - 12 SP - 2051-2059 SN - 1057-7149 ER - TY - JOUR TI - Feedback EDF scheduling of real-time tasks exploiting dynamic voltage scaling AU - Zhu, YF AU - Mueller, F T2 - REAL-TIME SYSTEMS AB - Many embedded systems are constrained by limits on power consumption, which are reflected in the design and implementation for conserving their energy utilization. Dynamic voltage scaling (DVS) has become a promising method for embedded systems to exploit multiple voltage and frequency levels and to prolong their battery life. However, pure DVS techniques do not perform well for systems with dynamic workloads where the job execution times vary significantly. In this paper, we present a novel approach combining feedback control with DVS schemes targeting hard real-time systems with dynamic workloads. Our method relies strictly on operating system support by integrating a DVS scheduler and a feedback controller within the earliest-deadline-first (EDF) scheduling algorithm. Each task is divided into two portions. The objective within the first portion is to exploit frequency scaling for the average execution time. Static and dynamic slack is accumulated for each task with slack-passing and preemption handling schemes. The objective within the second portion is to meet the hard real-time deadline requirements up to the worst-case execution time following a last-chance approach. Feedback control techniques make the system capable of selecting the right frequency and voltage settings for the first portion, as well as guaranteeing hard real-time requirements for the overall task. A feedback control model is given to describe our feedback DVS scheduler, which is used to analyze the system's stability. Simulation experiments demonstrate the ability of our algorithm to save up to 29% more energy than previous work for task sets with different dynamic workload characteristics. DA - 2005/12// PY - 2005/12// DO - 10.1007/s11241-005-2744-3 VL - 31 IS - 1-3 SP - 33-63 SN - 1573-1383 KW - real-time systems KW - scheduling KW - dynamic voltage scaling KW - feedback control ER - TY - JOUR TI - Designing a visualization framework for multidimensional data AU - Rhyne, T. M. AU - Dennis, B. AU - Kocherlakota, S. AU - Sawant, A. AU - Tateosian, L. AU - Healey, C. G. T2 - IEEE Computer Graphics and Applications DA - 2005/// PY - 2005/// VL - 25 IS - 6 SP - 15- ER - TY - JOUR TI - Checking inside the black box: Regression testing by comparing value spectra AU - Xie, T AU - Notkin, D T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING AB - Comparing behaviors of program versions has become an important task in software maintenance and regression testing. Black-box program outputs have been used to characterize program behaviors and they are compared over program versions in traditional regression testing. Program spectra have recently been proposed to characterize a program's behavior inside the black box. Comparing program spectra of program versions offers insights into the internal behavioral differences between versions. In this paper, we present a new class of program spectra, value spectra, that enriches the existing program spectra family. We compare the value spectra of a program's old version and new version to detect internal behavioral deviations in the new version. We use a deviation-propagation call tree to present the deviation details. Based on the deviation-propagation call tree, we propose two heuristics to locate deviation roots, which are program locations that trigger the behavioral deviations. We also use path spectra (previously proposed program spectra) to approximate the program states in value spectra. We then similarly compare path spectra to detect behavioral deviations and locate deviation roots in the new version. We have conducted an experiment on eight C programs to evaluate our spectra-comparison approach. The results show that both value-spectra-comparison and path-spectra-comparison approaches can effectively expose program behavioral differences between program versions even when their program outputs are the same, and our value-spectra-comparison approach reports deviation roots with high accuracy for most programs. DA - 2005/10// PY - 2005/10// DO - 10.1109/TSE.2005.107 VL - 31 IS - 10 SP - 869-883 SN - 1939-3520 KW - program spectra KW - regression testing KW - software testing KW - empirical studies KW - software maintenance ER - TY - CHAP TI - An approach to unfolding asynchronous communication protocols AU - Lei, Y. AU - Iyer, S. P. T2 - FM 2005: Formal methods: International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005: proceedings (Lecture notes in computer science ; 3582) A2 - J. Fitzgerald, I. J. Hayes A2 - Tarlecki, A. CN - [Electronic Resource] PY - 2005/// VL - 3582 SP - 334-349 PB - Berlin; New York: Springer SN - 3540278826 ER - TY - JOUR TI - Traffic engineering approach to path selection in optical burst switching networks AU - Teng, J AU - Rouskas, George T2 - Journal of Optical Networking AB - It is usually assumed that optical burst switching (OBS) networks use the shortest path routing along with next-hop burst forwarding. The shortest path routing minimizes delay and optimizes utilization of resources, however, it often causes certain links to become congested while others remain underutilized. In a bufferless OBS network in which burst drop probability is the primary metric of interest, the existence of a few highly congested links could lead to unacceptable performance for the entire network. We take a traffic engineering approach to path selection in OBS networks with the objective of balancing the traffic across the network links to reduce congestion and to improve overall performance. We present an approximate integer linear optimization problem as well as a simple integer relaxation heuristic to solve the problem efficiently for large networks. Numerical results demonstrate that our approach is effective in reducing the network-wide burst drop probability, in many cases significantly, over the shortest path routing. DA - 2005/// PY - 2005/// DO - 10.1364/JON.4.000759 VL - 4 IS - 11 SP - 759-777 ER - TY - CHAP TI - Path Switching in OBS Networks AU - Yang, Li AU - Rouskas, George N. T2 - NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems AB - We investigate the concept of path switching in optical burst switched (OBS) networks and its potential to reducing the overall burst drop probability.With path switching, each source maintains a list of alternate paths to each destination, and uses information regarding the recent congestion status of the network links to rank the paths; it then transmits bursts along the least congested path. We present a suite of path switching strategies, each utilizing a different type of information regarding the link congestion status, and evaluate them using simulation. Our results demonstrate that, in general, path switching outperforms shortest path routing, and, depending on the path strategy involved, the network topology, and the traffic pattern, this improvement can be significant. We also present a new framework for the development of hybrid path switching strategies, which make routing decisions based on a weighted combination of the decisions taken by several independent path switching strategies. We present two instances of such hybrid strategies, one that assigns static weights and one that dynamically adjusts the weights based on feedback from the network. CN - TK5105.5 .N49 2005 PY - 2005/// DO - 10.1007/11422778_33 VL - 3462 SP - 406-418 OP - PB - Springer Berlin Heidelberg SN - 9783540258094 9783540320173 UR - http://dx.doi.org/10.1007/11422778_33 DB - Crossref ER - TY - JOUR TI - Fast incorporation of optical flow into active polygons AU - Unal, G AU - Krim, H AU - Yezzi, A T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - In this paper, we first reconsider, in a different light, the addition of a prediction step to active contour-based visual tracking using an optical flow and clarify the local computation of the latter along the boundaries of continuous active contours with appropriate regularizers. We subsequently detail our contribution of computing an optical flow-based prediction step directly from the parameters of an active polygon, and of exploiting it in object tracking. This is in contrast to an explicitly separate computation of the optical flow and its ad hoc application. It also provides an inherent regularization effect resulting from integrating measurements along polygon edges. As a result, we completely avoid the need of adding ad hoc regularizing terms to the optical flow computations, and the inevitably arbitrary associated weighting parameters. This direct integration of optical flow into the active polygon framework distinguishes this technique from most previous contour-based approaches, where regularization terms are theoretically, as well as practically, essential. The greater robustness and speed due to a reduced number of parameters of this technique are additional and appealing features. DA - 2005/6// PY - 2005/6// DO - 10.1109/TIP.2005.847286 VL - 14 IS - 6 SP - 745-759 SN - 1941-0042 KW - level-set methods KW - motion estimation KW - object tracking KW - optical flow KW - polygon evolution KW - region-based active contours ER - TY - JOUR TI - Emergent behavior in two complex cellular automata rule sets AU - Hazard, CJ AU - Kimport, KR AU - Johnson, DH T2 - COMPLEXITY AB - Cellular automata systems often produce complex behavior from simple rule sets. The behaviors and results of two complex combinations of cellular automata rules are analyzed. Both two-dimensional rule sets add complexities to typical cellular automata systems by attaching attributes and rules to each cell. One of the rule sets produces gliders that reproduce upon collision, whereas the other grows into an intricate shape. Projection and entropy analysis classify the rule sets as complex for the intricate shape, but measurements indicate that the self-reproducing gliders fall between ordered and complex classification, despite their complex appearance. © 2005 Wiley Periodicals, Inc. Complexity 10: 45–55, 2005 DA - 2005/// PY - 2005/// DO - 10.1002/cplx.20089 VL - 10 IS - 5 SP - 45-55 SN - 1099-0526 KW - cellular automata KW - entropy KW - emergence KW - gliders KW - self-reproducers ER - TY - CHAP TI - Benefits of multiple battery levels for the lifetime of large wireless sensor networks AU - Sichitiu, Mihail L. AU - Dutta, Rudra T2 - Networking 2005: Networking technologies, services, and protocols: Performance of computer and communication networks: Mobile and wireless communication systems: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005: Proceedings (Lecture notes in computer science; 3462) AB - In large wireless sensor networks, the few nodes close to the monitoring station are likely to prove the bottleneck in the useful lifetime of the network. We examine a strategy of equipping these nodes with a larger share of the total initial energy (battery) than the others, and generalizing this notion to the rest of the network. We solve a design problem involving optimizing the network lifetime using no more than a given number of distinct battery levels, and verify the results from the model by direct simulation. CN - TK5105.5 .N49 2005 PY - 2005/// DO - 10.1007/11422778_133 VL - 3462 SP - 1440–1444 PB - Berlin; New York: Springer SN - 3540258094 ER - TY - CHAP TI - An approximate queueing model for limited-range wavelength conversion in an OBS switch AU - Puttasubbappa, V. S. AU - Perros, H. G. T2 - Networking 2005: Networking technologies, services, and protocols: Performance of computer and communication networks: Mobile and wireless communication systems: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005: Proceedings (Lecture notes in computer science; 3462) AB - We develop an analytical model for modeling limited-range wavelength conversion employed in an OBS switch. The system is modeled as a simultaneous resource possession problem. We propose a product-form solution which calculates approximate blocking probabilities for degree of conversion d = 1,2 and for large number of wavelengths. We then propose an approximate model for large values of d. The output of our model was verified with simulation results. CN - TK5105.5 .N49 2005 PY - 2005/// DO - 10.1007/11422778_56 VL - 3462 SP - 697-708 PB - Berlin; New York: Springer SN - 3540258094 ER - TY - JOUR TI - A semantic approach for designing commitment protocols AU - Mallya, A. U. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Protocols enable unambiguous and smooth interactions among agents, and commitments among agents are a powerful means of developing protocols. Commitments allow flexible execution of protocols and help agents reason about protocols and plan their actions accordingly, while at the same time providing a basis for compliance checking. Multiagent systems that employ commitment-based interaction can conveniently and effectively model business interactions because the autonomy and heterogeneity of agents mirrors real-world businesses. Such modeling, however, requires multiagent systems to host a rich variety of interaction protocols that can capture the needs of different applications. We show how a commitment-based semantics for protocols provides a basis for refining and aggregating protocols. We propose an approach for designing commitment protocols wherein traditional software engineering notions such as refinement and aggregation are extended to apply to protocols. We present an algebra of protocols that can be used to compose protocols by refining and merging existing ones, and does this at a level of abstraction high enough to be useful for real-world applications. CN - QA76.76 .I58 I592 2004 DA - 2005/// PY - 2005/// DO - 10.1007/978-3-540-32258-0_3 VL - 3396 SP - 33–49 UR - https://publons.com/publon/21294472/ ER - TY - JOUR TI - Examining Internet privacy policies within the context of user privacy values AU - Earp, JB AU - Anton, AI AU - Aiman-Smith, L AU - Stufflebeam, WH T2 - IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT AB - Internet privacy policies describe an organization's practices on data collection, use, and disclosure. These privacy policies both protect the organization and signal integrity commitment to site visitors. Consumers use the stated website policies to guide browsing and transaction decisions. This paper compares the classes of privacy protection goals (which express desired protection of consumer privacy rights) and vulnerabilities (which potentially threaten consumer privacy) with consumer privacy values. For this study, we looked at privacy policies from nearly 50 websites and surveyed over 1000 Internet users. We examined Internet users' major expectations about website privacy and revealed a notable discrepancy between what privacy policies are currently stating and what users deem most significant. Our findings suggest several implications to privacy managers and software project managers. Results from this study can help managers determine the kinds of policies needed to both satisfy user values and ensure privacy-aware website development efforts. DA - 2005/5// PY - 2005/5// DO - 10.1109/tem.2005.844927 VL - 52 IS - 2 SP - 227-237 SN - 1558-0040 KW - E-commerce KW - privacy management KW - privacy policy KW - software engineering ER - TY - JOUR TI - Engineering self-organizing referral networks for trustworthy service selection AU - Yolum, P AU - Singh, MP T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS AB - Developing, maintaining, and disseminating trust in open, dynamic environments is crucial. We propose self-organizing referral networks as a means for establishing trust in such environments. A referral network consists of autonomous agents that model others in terms of their trustworthiness and disseminate information on others' trustworthiness. An agent may request a service from another; a requested agent may provide the requested service or give a referral to someone else. Possibly with its user's help, each agent can judge the quality of service obtained. Importantly, the agents autonomously and adaptively decide with whom to interact and choose what referrals to issue, if any. The choices of the agents lead to the evolution of the referral network, whereby the agents move closer to those that they trust. This paper studies the guidelines for engineering self-organizing referral networks. To do so, it investigates properties of referral networks via simulation. By controlling the actions of the agents appropriately, different referral networks can be generated. This paper first shows how the exchange of referrals affects service selection. It identifies interesting network topologies and shows under which conditions these topologies emerge. Based on the link structure of the network, some agents can be identified as authorities. Finally, the paper shows how and when such authorities emerge. The observations of these simulations are then formulated into design recommendations that can be used to develop robust, self-organizing referral networks. DA - 2005/5// PY - 2005/5// DO - 10.1109/tsmca.2005.846401 VL - 35 IS - 3 SP - 396-407 SN - 1558-2426 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-18144381559&partnerID=MN8TOARS KW - adaptive systems KW - cooperative systems KW - distributed information systems KW - information services KW - multiagent systems KW - referrals KW - self-organizing control KW - software engineering KW - trust ER - TY - JOUR TI - A survey of eigenvector methods for Web information retrieval AU - Langville, AN AU - Meyer, CD T2 - SIAM REVIEW AB - Web information retrieval is significantly more challenging than traditional well-controlled, small document collection information retrieval. One main difference between traditional information retrieval and Web information retrieval is the Web's hyperlink structure. This structure has been exploited by several of today's leading Web search engines, particularly Google and Teoma. In this survey paper, we focus on Web information retrieval methods that use eigenvector computations, presenting the three popular methods of HITS, PageRank, and SALSA. DA - 2005/3// PY - 2005/3// DO - 10.1137/S0036144503424786 VL - 47 IS - 1 SP - 135-161 SN - 1095-7200 KW - eigenvector KW - Markov chain KW - information retrieval KW - HITS KW - PageRank KW - SALSA ER - TY - JOUR TI - Integration of authentication and mobility management in third generation and WLAN data networks AU - Wang, WY AU - Liang, W AU - Agarwal, AK T2 - WIRELESS COMMUNICATIONS & MOBILE COMPUTING AB - Abstract The successful deployment of wireless local area networks (WLAN) for high speed data transmission and cellular systems for wide coverage and global roaming has emerged to be a complementary platform for wireless data communications. In order to fully exploit potentials in 3G/WLAN integration, authentication of roaming users crossing different networks, must be coupled with mobility management, which is a challenging, yet not resolved issue. The focus of this paper is on state‐of‐art solutions to Wi‐Fi and cellular networks based on IP infrastructure. Moreover, we introduce a new authentication architecture for fast authentication during inter‐networking handoff and large‐scale heterogeneous networks. We show that the new architecture can reduce authentication latency significantly and be adaptive to user mobility and traffic. Copyright © 2005 John Wiley & Sons, Ltd. DA - 2005/9// PY - 2005/9// DO - 10.1002/wcm.335 VL - 5 IS - 6 SP - 665-678 SN - 1530-8677 KW - authentication KW - mobility management KW - 3G systems KW - wireless local area networks (WLANs) ER - TY - JOUR TI - Information-theoretic active polygons for unsupervised texture segmentation AU - Unal, G AU - Yezzi, A AU - Krim, H T2 - INTERNATIONAL JOURNAL OF COMPUTER VISION AB - Curve evolution models used in image segmentation and based on image region information usually utilize simple statistics such as means and variances, hence can not account for higher order nature of the textural characteristics of image regions. In addition, the object delineation by active contour methods, results in a contour representation which still requires a substantial amount of data to be stored for subsequent multimedia applications such as visual information retrieval from databases. Polygonal approximations of the extracted continuous curves are required to reduce the amount of data since polygons are powerful approximators of shapes for use in later recognition stages such as shape matching and coding. The key contribution of this paper is the development of a new active contour model which nicely ties the desirable polygonal representation of an object directly to the image segmentation process. This model can robustly capture texture boundaries by way of higher-order statistics of the data and using an information-theoretic measure and with its nature of the ordinary differential equations. This new variational texture segmentation model, is unsupervised since no prior knowledge on the textural properties of image regions is used. Another contribution in this sequel is a new polygon regularizer algorithm which uses electrostatics principles. This is a global regularizer and is more consistent than a local polygon regularization in preserving local features such as corners. DA - 2005/// PY - 2005/// DO - 10.1007/s11263-005-4880-6 VL - 62 IS - 3 SP - 199-220 SN - 1573-1405 KW - region-based active contours KW - unsupervised segmentation KW - texture segmentation KW - polygon evolution KW - information theoretic measure KW - electrostatic regularizer ER - TY - JOUR TI - Feedback EDF scheduling exploiting hardware-assisted asynchronous dynamic voltage scaling AU - Zhu, YF AU - Mueller, F T2 - ACM SIGPLAN NOTICES AB - Recent processor support for dynamic frequency and voltage scaling (DVS) allows software to affect power consumption by varying execution frequency and supply voltage on the fly. However, processors generally enter a sleep state while transitioning between frequencies/voltages. In this paper, we examine the merits of hardware/software co-design for a feedback DVS algorithm and a novel processor capable of executing instructions during frequency/voltage transitions. We study several power-aware feedback schemes based on earliest-deadline-first (EDF) scheduling that adjust the system behavior dynamically for different workload characteristics. An infrastructure for investigating several hard real-time DVS schemes, including our feedback DVS algorithm, is implemented on an IBM PowerPC 405LP embedded board. Architecture and algorithm overhead is assessed for different DVS schemes. Measurements on the experimentation board provide a quantitative assessment of the potential of energy savings for DVS algorithms as opposed to prior simulation work that could only provide trends. Energy consumption, measured through a data acquisition board, indicates a considerable potential for real-time DVS scheduling algorithms to lower energy up to 64% over the naïve DVS scheme. Our feedback DVS algorithm saves at least as much and often considerably more energy than previous DVS algorithms with peak savings of an additional 24% energy reduction. To the best of our knowledge, this is the first comparative study of real-time DVS algorithms on a concrete micro-architecture and the first evaluation of asynchronous DVS switching. DA - 2005/7// PY - 2005/7// DO - 10.1145/1070891.1065939 VL - 40 IS - 7 SP - 203-212 SN - 1558-1160 ER - TY - JOUR TI - A semantic approach for designing e-business protocols AU - Mallya, A. U. AU - Singh, Munindar P. T2 - IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS 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. CN - [Electronic Resource] DA - 2005/// PY - 2005/// DO - 10.1007/978-3-540-30581-1_10 VL - 3387 SP - 111–123 UR - https://publons.com/publon/21294471/ ER - TY - JOUR TI - RACE: Remote Analysis Computation for gene Expression data AU - Psarros, M AU - Heber, S AU - Sick, M AU - Thoppae, G AU - Harshman, K AU - Sick, B T2 - NUCLEIC ACIDS RESEARCH AB - The Remote Analysis Computation for gene Expression data ( RACE ) suite is a collection of bioinformatics web tools designed for the analysis of DNA microarray data. RACE performs probe-level data preprocessing, extensive quality checks, data visualization and data normalization for Affymetrix GeneChips. In addition, it offers differential expression analysis on normalized expression levels from any array platform. RACE estimates the false discovery rates of lists of potentially regulated genes and provides a Gene Ontology-term analysis tool for GeneChip data to support the biological interpretation and annotation of results. The analysis is fully automated but can be customized by flexible parameter settings. To offer a convenient starting point for subsequent analyses, and to provide maximum transparency, the R scripts used to generate the results can be downloaded along with the output files. RACE is freely available for use at http://race.unil.ch . DA - 2005/7/1/ PY - 2005/7/1/ DO - 10.1093/nar/gki490 VL - 33 SP - W638-W643 SN - 1362-4962 ER - TY - JOUR TI - Multivariate meta-analysis of pharmacokinetic studies of ampicillin trihydrate in cattle AU - Gehring, R AU - Merwe, D AU - Pierce, AN AU - Baynes, RE AU - Craigmill, AL AU - Riviere, JE T2 - AMERICAN JOURNAL OF VETERINARY RESEARCH AB - To investigate the feasibility of using multivariate cluster analysis to meta-analyze pharmacokinetic data obtained from studies of pharmacokinetics of ampicillin trihydrate in cattle and identify factors that could account for variability in pharmacokinetic parameters among studies.Data from original studies of the pharmacokinetics of ampicillin trihydrate in cattle in the database of the Food Animal Residue Avoidance Databank.Mean plasma or serum ampicillin concentration versus time data and potential factors that may have affected the pharmacokinetics of ampicillin trihydrate were obtained from each study. Noncompartmental pharmacokinetic analyses were performed, and values of pharmacokinetic parameters were clustered by use of multivariate cluster analysis. Practical importance of the clusters was evaluated by comparing the frequency of factors that may have affected the pharmacokinetics of ampicillin trihydrate among clusters.A single cluster with lower mean values for clearance and volume of distribution of ampicillin trihydrate administered PO, compared with other clusters, was identified. This cluster included studies that used preruminant calves in which feeding was withheld overnight and calves to which probenecid had been administered concurrently.Meta-analysis was successful in detecting a potential subpopulation of cattle for which factors that explained differences in pharmacokinetic parameters could be identified. Accurate estimates of pharmacokinetic parameters are important for the calculation of dosages and extended withdrawal intervals after extralabel drug administration. DA - 2005/1// PY - 2005/1// DO - 10.2460/ajvr.2005.66.108 VL - 66 IS - 1 SP - 108-112 SN - 1943-5681 ER - TY - JOUR TI - Monte Carlo approximation in incomplete information, sequential auction games AU - Cai, G. AU - Wurman, P. R. T2 - Decision Support Systems DA - 2005/// PY - 2005/// DO - 10.1016/j.das.2003.10.004 VL - 39 IS - 2 SP - 153-168 ER - TY - CHAP TI - Experimental Analysis of the Q-Matrix Method in Knowledge Discovery AU - Barnes, Tiffany AU - Bitzer, Donald AU - Vouk, Mladen T2 - Lecture Notes in Computer Science AB - The q-matrix method, a new method for data mining and knowledge discovery, is compared with factor analysis and cluster analysis in analyzing fourteen experimental data sets. This method creates a matrix-based model that extracts latent relationships among observed binary variables. Results show that the q-matrix method offers several advantages over factor analysis and cluster analysis for knowledge discovery. The q-matrix method can perform fully unsupervised clustering, where the number of clusters is not known in advance. It also yields better error rates than factor analysis, and is comparable in error to cluster analysis. The q-matrix method also allows for automatic interpretation of the data sets. These results suggest that the q-matrix method can be an important tool in automated knowledge discovery. CN - [Electronic Resource] PY - 2005/// DO - 10.1007/11425274_62 VL - 3488 SP - 603-611 OP - PB - Springer Berlin Heidelberg SN - 9783540258780 9783540319498 UR - http://dx.doi.org/10.1007/11425274_62 DB - Crossref ER - TY - JOUR TI - Analyzing multiparty agreements with commitments AU - Wan, F. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Multiparty agreements often arise in a multiagent system where autonomous agents interact with each other to achieve a global goal. Multiparty agreements are traditionally represented by messaging protocols or event- condition-action rule sets in which agents exchange messages in a predefined sequence to ensure both global and local consistencies. However, these models do not readily incorporate agents’ autonomy and heterogeneity, which limits their ability to help build a flexible open system. Commitments have been studied for modelling various agent interactions. This paper introduces commitments as the key elements in formulating multiparty agreements. Our model focuses on how agents may negotiate with each other to build a mutual agreement based on their individual constraints. The actual execution sequence is validated by checking the compliance of commitment casual relations. Our approach is geared toward constructing business processes where agents are mutually constrained in a manner that preserves their autonomy and heterogeneity. CN - [Electronic Resource] DA - 2005/// PY - 2005/// DO - 10.1007/11426714_6 VL - 3508 SP - 85–96 UR - https://publons.com/publon/21294473/ ER - TY - JOUR TI - Service-oriented computing: Key concepts and principles AU - Huhns, MN AU - Singh, MP T2 - IEEE INTERNET COMPUTING AB - Traditional approaches to software development - the ones embodied in CASE tools and modeling frameworks - are appropriate for building individual software components, but they are not designed to face the challenges of open environments. Service-oriented computing provides a way to create a new architecture that reflects components' trends toward autonomy and heterogeneity. We thus emphasize SOC concepts instead of how to deploy Web services in accord with current standards. To begin the series, we describe the key concepts and abstractions of SOC and the elements of a corresponding engineering methodology. DA - 2005/// PY - 2005/// DO - 10.1109/MIC.2005.21 VL - 9 IS - 1 SP - 75-81 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-14844363625&partnerID=MN8TOARS ER - TY - JOUR TI - Weak bisimilarity and regularity of context-free processes is EXPITIME-hard AU - Mayr, R T2 - THEORETICAL COMPUTER SCIENCE AB - We show that checking weak bisimulation equivalence of two context-free processes (also called BPA-processes) is EXPTIME-hard, even under the condition that the processes are normed. Furthermore, checking weak regularity (finiteness up to weak bisimilarity) for context-free processes is EXPTIME-hard as well. Adding a finite control of the minimal non-trivial size of 2 to the BPA process already makes weak bisimilarity undecidable. DA - 2005/2/9/ PY - 2005/2/9/ DO - 10.1016/j.tcs.2004.10.008 VL - 330 IS - 3 SP - 553-575 SN - 1879-2294 KW - context-free processes KW - BPA KW - pushdown automata KW - bisimulation ER - TY - JOUR TI - On the complexity of computing determinants AU - Kaltofen, E AU - Villard, G T2 - COMPUTATIONAL COMPLEXITY AB - We present new baby steps/giant steps algorithms of asymptotically fast running time for dense matrix problems. Our algorithms compute the determinant, characteristic polynomial, Frobenius normal form and Smith normal form of a dense n × n matrix A with integer entries in $$\left( {n^{3.2} \log \left\| A \right\|} \right)^{1 + o(1)} $$ and $$\left( {n^{2.697263} \log \left\| A \right\|} \right)^{1 + o(1)} $$ bit operations; here $$\left\| A \right\|$$ denotes the largest entry in absolute value and the exponent adjustment by “+o(1)” captures additional factors $$C_1 (\log n)^{C_2 } \left( {\log \log \left\| A \right\|} \right)^{C_3 } $$ for positive real constants C1, C2, C3. The bit complexity $$\left( {n^{3.2} \log \left\| A \right\|} \right)^{1 + o(1)} $$ results from using the classical cubic matrix multiplication algorithm. Our algorithms are randomized, and we can certify that the output is the determinant of A in a Las Vegas fashion. The second category of problems deals with the setting where the matrix A has elements from an abstract commutative ring, that is, when no divisions in the domain of entries are possible. We present algorithms that deterministically compute the determinant, characteristic polynomial and adjoint of A with n3.2+o(1) and O(n2.697263) ring additions, subtractions and multiplications. DA - 2005/2// PY - 2005/2// DO - 10.1007/s00037-004-0185-3 VL - 13 IS - 3-4 SP - 91-130 SN - 1420-8954 KW - integer matrix KW - matrix determinant KW - characteristic polynomial KW - Smith normal form KW - bit complexity KW - division-free complexity KW - randomized algorithm KW - multivariable control theory KW - realization KW - matrix sequence KW - block Wiedemann algorithm KW - block Lanczos algorithm ER - TY - JOUR TI - Genetic algorithm-based decision support for optimizing seismic response of piping systems AU - Gupta, A. AU - Kripakaran, P. AU - Mahinthakumar, G. K. AU - Baugh, J. W. T2 - Journal of Structural Engineering AB - This paper describes computational approaches used in a prototype decision support system (DSS) for seismic design and performance evaluation of piping supports. The DSS is primarily based on a genetic algorithm (GA) that uses finite element analyses, and an existing framework for high performance distributed computing on workstation clusters. A detailed discussion is presented on various issues related to the development of an efficient GA implementation for evaluating the trade-off between the number of supports and cost. An integer string representation of the type used in some existing studies, for instance, is shown to be inferior to a binary string representation, which is appropriate when supports are modeled as axially rigid. A novel seeding technique, which overcomes the inefficiencies of conventional methods in the context of pipe support optimization, is also presented. Finally, an efficient crossover scheme is proposed for generating trade-off curves and the approach is validated with respect to optimal solutions obtained by enumeration. In addition to computational enhancements, the role of joint-cognitive decision making is explored using “Modeling to Generate Alternatives - MGA,” a methodology based on optimization to produce alternatives that may spur creativity and offer new insights. These computational approaches are illustrated with applications to a simple, representative piping system, as well as an actual power plant piping system. DA - 2005/// PY - 2005/// DO - 10.1061/(asce)0733-9445(2005)131:3(389) VL - 131 IS - 3 SP - 389-398 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-14544294041&partnerID=MN8TOARS ER - TY - PAT TI - 2D/3D chemical sensors and methods of fabricating and operating the same AU - Ufer, S. C2 - 2005/// DA - 2005/// PY - 2005/// ER - TY - BOOK TI - The practical handbook of internet computing. AU - Singh, M. P. CN - QA76.625 .P63 2005 DA - 2005/// PY - 2005/// PB - Boca Raton, FL: Chapman & Hall/CRC SN - 1584883812 ER - TY - JOUR TI - On SAT instance classes and a method for reliable performance experiments with SAT solvers AU - Brglez, F AU - Li, XY AU - Stallmann, MF T2 - ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE DA - 2005/1// PY - 2005/1// DO - 10.1007/s10472-005-0417-5 VL - 43 IS - 1-4 SP - 1-34 SN - 1573-7470 KW - satisfiability KW - conjunctive normal form KW - equivalence classes KW - experimental design KW - exponential and heavy-tail distributions KW - reliability function ER - TY - BOOK TI - Service-oriented computing: Semantics, processes, agents AU - Singh, M. P. AU - Huhns, M. N. AB - Traditional approaches to software development - the ones embodied in CASE tools and modeling frameworks - are appropriate for building individual software components, but they are not designed to face the challenges of open environments. Service-oriented computing provides a way to create a new architecture that reflects components' trends toward autonomy and heterogeneity. We thus emphasize SOC concepts instead of how to deploy Web services in accord with current standards. To begin the series, we describe the key concepts and abstractions of SOC and the elements of a corresponding engineering methodology. CN - TK5105.88813 .S56 2005 DA - 2005/// PY - 2005/// DO - 10.1002/0470091509 PB - Chichester; Hoboken, NJ: Wiley SN - 0470091487 ER - TY - JOUR TI - Specifying ACT-R models of user interaction with a GOMS language AU - St Amant, R AU - Freed, AR AU - Ritter, FE T2 - COGNITIVE SYSTEMS RESEARCH AB - We describe a system, G2A, that produces ACT-R models from GOMS models. The GOMS models can contain hierarchical methods, visual and memory stores, and control constructs. G2A allows ACT-R models to be built much more quickly, in hours rather than weeks. Because GOMS is a more abstract formalism than ACT-R, most GOMS operators can be plausibly translated in different ways into ACT-R productions (e.g., a GOMS Look-for operator can be carried out by different visual search strategies in ACT-R). Given a GOMS model, G2A generates and evaluates alternative ACT-R models by systematically varying the mapping of GOMS operators to ACT-R productions. In experiments with a text editing task, G2A produces ACT-R models whose predictions are within 5% of GOMS model predictions. In the same domain, G2A also generates ACT-R models that give better predictions than GOMS, providing good predictions of overall task duration for actual users (within 2%), though the models are less accurate at a detailed level. In a separate experiment with a mouse-driven telephone dialing task, G2A produces models that do a better job of distinguishing between competing interfaces than a Fitts’ law model or an ACT-R model built by hand. G2A starts to describe the relationship between two major theories of cognition. This may have appeared a simple relationship, but the complexity of the translation illustrates why this was not done before. G2A shows a way forward for cognitive models, that of higher level languages that compile into more detailed specifications. DA - 2005/3// PY - 2005/3// DO - 10.1016/j.cogsys.2004.09.008 VL - 6 IS - 1 SP - 71-88 SN - 1389-0417 KW - cognitive models KW - GOMS KW - ACT-R KW - search ER - TY - JOUR TI - Wavelength selection in OBS networks using traffic engineering and priority-based concepts AU - Teng, J AU - Rouskas, GN T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - A fundamental assumption underlying most studies of optical burst switched (OBS) networks is that full wavelength conversion is available throughout the network. In practice, however, economic and technical considerations are likely to dictate a more limited and sparse deployment of wavelength converters in the optical network. Therefore, we expect wavelength assignment policies to be an important component of OBS networks. In this paper, we explain why wavelength selection schemes developed for wavelength routed (circuit-switched) networks are not appropriate for OBS. We then develop a suite of adaptive and nonadaptive policies for OBS switches. We also apply traffic engineering techniques to reduce wavelength contention through traffic isolation. Our performance study indicates that, in the absence of full conversion capabilities, intelligent choices in assigning wavelengths to bursts at the source can have a profound effect on the burst drop probability in an OBS network. DA - 2005/8// PY - 2005/8// DO - 10.1109/JSAC.2005.851794 VL - 23 IS - 8 SP - 1658-1669 SN - 1558-0008 KW - optical burst switching (OBS) KW - traffic engineering KW - wavelength assignment ER - TY - JOUR TI - The semi-iterative method applied to the hyper-power iteration AU - Chen, XZ AU - Hartwig, RE T2 - NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS AB - The semi-iterative method (SIM) is applied to the hyper-power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi-iterative–hyper-power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. DA - 2005/11// PY - 2005/11// DO - 10.1002/nla.429 VL - 12 IS - 9 SP - 895-910 SN - 1070-5325 KW - hyper-power iteration KW - semi-iterative method KW - asymptotic convergence rate KW - quotient convergence rate KW - root-convergence rate ER - TY - JOUR TI - Interaction Protocols as design abstractions for business processes AU - Desai, N AU - Mallya, AU AU - Chopra, AK AU - Singh, MP T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING AB - Business process modeling and enactment are notoriously complex, especially in open settings, where business partners are autonomous, requirements must be continually finessed, and exceptions frequently arise because of real-world or organizational problems. Traditional approaches, which attempt to capture processes as monolithic flows, have proven inadequate in addressing these challenges. We propose (business) protocols as components for developing business processes. A protocol is an abstract, modular, publishable specification of an interaction among different roles to be played by different participants. When instantiated with the participants' internal policies, protocols yield concrete business processes. Protocols are reusable and refinable, thus simplifying business process design. We show how protocols and their composition are theoretically founded in the phi;-calculus. DA - 2005/12// PY - 2005/12// DO - 10.1109/TSE.2005.140 VL - 31 IS - 12 SP - 1015-1027 SN - 1939-3520 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-33745865103&partnerID=MN8TOARS KW - multiagent systems KW - software reuse KW - interaction-based modeling KW - software design methodologies KW - rule-based processing KW - pi-calculus ER - TY - JOUR TI - Traffic-partitioning approaches to grooming ring access networks AU - Srinivasarao, K AU - Dutta, R T2 - JOURNAL OF OPTICAL NETWORKING AB - Feature Isue on Optical Access Networks (OAN) As networks have evolved in sophistication, the twin concerns of quality-of-service (QoS) and efficiency have propagated down the hierarchical levels of networking and are now considered important in access networks as well. Motivated by these two concerns, researchers have recognized traffic grooming as an increasingly important area in optical networking in recent years. Very recently, a min-max approach to network cost optimization has emerged as a new focus area. In this approach, the maximum electronic-switching capability at any network node is sought to be minimized. In this paper, we propose heuristics for traffic grooming with this objective in ring networks, which are of practical importance, especially in access network architectures. We advance two approaches, both based on the concept of partitioning the traffic matrix, but in different ways. The approaches are of complementary strength, being useful for different traffic patterns. We present numerical results validating the performance of the algorithms. DA - 2005/9// PY - 2005/9// DO - 10.1364/JON.4.000602 VL - 4 IS - 9 SP - 602-614 SN - 1536-5379 ER - TY - BOOK TI - Start where you are and use what you have AU - Janke, L. W. AU - Winstead, N. N. CN - CT274 .W56 2005 DA - 2005/// PY - 2005/// PB - Raleigh, N.C.: N.N. Winstead? ER - TY - JOUR TI - Quality of service in an optical burst switching ring AU - Puttasubbappa, VS AU - Perros, HG T2 - PHOTONIC NETWORK COMMUNICATIONS DA - 2005/5// PY - 2005/5// DO - 10.1007/s11107-004-6438-x VL - 9 IS - 3 SP - 357-371 SN - 1572-8188 KW - optical burst switching KW - MAN KW - access protocols KW - service classes ER - TY - JOUR TI - Limitations of equation-based congestion control AU - Rhee, I AU - Xu, LS T2 - ACM SIGCOMM COMPUTER COMMUNICATION REVIEW AB - We study limitations of an equation-based congestion control protocol, called TFRC (TCP Friendly Rate Control). It examines how the three main factors that determine TFRC throughput, namely, the TCP friendly equation, loss event rate estimation and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show that different sending rates of competing flows cause these flows to experience different loss event rates. There are several fundamental reasons why TFRC and TCP flows have different average sending rates, from the first place. Earlier work shows that the convexity of the TCP friendly equation used in TFRC causes the sending rate difference. We report two additional reasons in this paper: (1) the convexity of 1/ x where x is a loss event period and (2) different RTO (retransmission timeout period) estimations of TCP and TFRC. These factors can be the reasons for TCP and TFRC to experience initially different sending rates. But we find that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP. DA - 2005/10// PY - 2005/10// DO - 10.1145/1090191.1080099 VL - 35 IS - 4 SP - 49-60 SN - 1943-5819 KW - congestion control KW - equation-based rate control ER - TY - JOUR TI - Inference and labeling of metric-induced network topologies AU - Bestavros, A AU - Byers, JW AU - Harfoush, KA T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - The development and deployment of distributed network-aware applications and services require the ability to compile and maintain a model of the underlying network resources with respect to one or more characteristic properties of interest. To be manageable, such models must be compact; and to be general-purpose, should enable a representation of properties along temporal, spatial, and measurement resolution dimensions. In this paper, we propose MINT - a general framework for the construction of such metric-induced models using end-to-end measurements. We present the basic theoretical underpinnings of MINT for a broad class of performance metrics, and describe PERISCOPE, a Linux embodiment of MINT constructions. We instantiate MINT and PERISCOPE for a specific metric of interest - namely, packet loss rates - and present results of simulations and Internet measurements that confirm the effectiveness and robustness of our constructions over a wide range of network conditions. DA - 2005/11// PY - 2005/11// DO - 10.1109/tpds.2005.138 VL - 16 IS - 11 SP - 1053-1065 SN - 1558-2183 KW - end-to-end measurement KW - packet-pair probing KW - Bayesian probing KW - Internet tomography KW - performance evaluation ER - TY - JOUR TI - Common intervals of trees AU - Heber, S AU - Savage, CD T2 - INFORMATION PROCESSING LETTERS AB - In this survey, we review practical algorithms for graph-theoretic problems that are expressible in monadic second-order logic. Monadic second-order (MSO) logic allows quantifications over unary relations (sets) and can be used to express a host of useful graph properties such as connectivity, c-colorability (for a fixed c), Hamiltonicity and minor inclusion. A celebrated theorem in this area by Courcelle states that any graph problem expressible in MSO can be solved in linear time on graphs that admit a tree-decomposition of constant width. Courcelle’s Theorem has been used thus far as a theoretic tool to establish that linear-time algorithms exist for graph problems by demonstrating that the problem in question is expressible by an MSO formula. A straightforward implementation of the algorithm in the proof of Courcelle’s Theorem is useless as it runs into space-explosion problems even for small values of treewidth. Of late, there have been several attempts to circumvent these problems and we review some of these in this survey. This survey also introduces the reader to the notions of tree-decompositions and the basics of monadic second order logic. DA - 2005/1/31/ PY - 2005/1/31/ DO - 10.1016/j.ipl.2004.09.016 VL - 93 IS - 2 SP - 69-74 SN - 1872-6119 KW - combinatorial problems KW - algorithms KW - labeled trees ER - TY - CHAP TI - Applying clustering techniques to general topology traffic grooming AU - Chen, B. AU - Rouskas, G. AU - Dutta, R. T2 - Proceedings of IEEE / Create-net broadnets 2005 PY - 2005/// SP - 308-314 PB - Piscataway, N.J.: IEEE SN - 0780392779 ER - TY - JOUR TI - Antidotes in food animal practice AU - Haskell, SRR AU - Payne, M AU - Webb, A AU - Riviere, J AU - Craigmill, AL T2 - JAVMA-JOURNAL OF THE AMERICAN VETERINARY MEDICAL ASSOCIATION AB - 1Because there is little economic incentive for pharmaceutical companies to pursue antidote approval for a limited market, it is unlikely that this situation will change in the near future. In most instances, practitioners seeking to treat food animals for toxicoses are compelled to either use products in an extralabel manner or to compound antidotes from bulk sources. There are relatively few data from which scientifically based withdrawal intervals (WDIs) may be developed for the protection of human health. This Food Animal Residue Avoidance Databank (FARAD) Digest provides a summary of regulatory and scientific information regarding the most commonly recommended antidotes used in food animals. None of the drugs covered in this digest have been approved by the FDA Center for Veterinary Medicine (FDA/CVM) as New Animal Drugs. The information on residues presented in this digest is for the antidotes, not for the toxicants. When an antidote must be used to treat a food animal for a toxicosis, a WDI to ensure depletion of the toxicant is also required, and it may be longer than the WDI for the antidote. FARAD can provide WDI recommendations for a wide range of toxicants; however, these recommendations must be made on a case-by-case basis because of differences in exposure route, dose, and duration. Unapproved Veterinary Antidotes Marketed with Veterinary Labels The FDA/CVM has applied regulatory discretion and does not prohibit the commercial manufacture and marketing of several veterinary antidotes. These products do not have New Animal Drug Approval (NADA) numbers and have not been formally approved by the FDA/CVM. These products are manufactured under Good Manufacturing Practices, and their labels are reviewed and on file with the FDA/CVM. They may be used as antidotes in food animals, although higher dosages or more prolonged treatment than that indicated on the labels may be necessary. Animal Medicinal Drug Use Clarification Act requirements do not apply to these drugs because they are not approved drugs; however, veterinarians are strongly encouraged to follow AMDUCA requirements when using these drugs. 2 DA - 2005/3/15/ PY - 2005/3/15/ DO - 10.2460/javma.2005.226.884 VL - 226 IS - 6 SP - 884-887 SN - 0003-1488 ER -