A Bad Day Surfing Is Better Than A Good Day Working: How To Revise A Total Preorder K Wong, T Meyer, R Booth, Proceedings of the 10th International Conference on Knowledge Representation (KR'06), Doherty, Mylopoulos. AAAI Press, Menlo Park, 2006, pp. 230 - 238
A Call Handling Assistant For Mobile Devices R Chan, A Limaru, W Wobcke, Proceedings of the 2006 IEEE/WIC/ACM Conference on Intelligent Agent Technology, Y. Nishida. IEEE Computer Society Press, Los Alamitos, CA, 2006, pp. 717 - 720
A Congestion-Aware Medium Access Control Protocol For Multi-Rate Ad-Hoc Networks L Haslett, W Hu, S Jha, C Sreenan, T Zauner, The 31st IEEE Conference on Local Computer Networks LCN '06, Hossam Hassanein. IEEE, 2006, pp. 97 - 104
A Dynamic Caching Algorithm Based On Internal Popularity Distribution Of Streaming Media C Chou, X Du, T Wang, Z Yang, J Yu, Multimedia Systems, Klara Nahrstedt. Springer Verlag, Heidelberg, Germany, 2006, pp. 135 - 149
A Flexible Framework For Shared Plans M Nguyen, W Wobcke, AI 2006: Advances in Artificial Intelligence, Sattar, A. & Kang, B.. Springer-Verlag, Berlin, 2006, pp. 393 - 402
A Fresh Look At Pre As A Maximum Flow Problem J Xue, J Knoop, International conference on compiler construction, A. Mycroft, A. Zeller. Springer Verlag, Germany, 2006, pp. 139 - 154
A Hybrid Browsing Mechanism Using Conceptual Scales P Compton, M Kim, Advances in knowledge acquisition and management, A. Hoffman, B. Kang. Springer, Heidelberg, 2006, pp. 132 - 143
A Lifetime Optimal Algorithm For Speculative Pre Q Cai, J Xue, ACM Transactions on Architecture and Code Optimization, Brad Calder and Dean Tullsen. ACM Press, New York, USA, 2006, pp. 115 - 155
A Low-Cost,Compact, Lightweight 3d Range Sensor N Jamali, M Kadous, C Sammut, R Sheh, Proceedings of the 2006 Australasian Conference on Robotics and Automation, Bruce McDonald. Australian Robotics & Automation Association, Auckland, New Zealand, 2006
A Machine-Checked Model For A Java-Like Language, Virtual Machine, And Compiler G Klein, T Nipkow, ACM Transactions on Programming Languages and Systems, Assoc Computing Machinery, New York, 2006, pp. 619 - 695
We introduce Jinja, a Java-like programming language with a formal semantics designed to exhibit core features of the Java language architecture. Jinja is a compromise between the realism of the language and the tractability and clarity of its formal semantics. The following aspects are formalised: a big and a small step operational semantics for Jinja and a proof of their equivalence, a type system and a definite initialisation analysis, a type safety proof of the small step semantics, a virtual machine (JVM), its operational semantics and its type system, a type safety proof for the JVM; a bytecode verifier, that is, a data flow analyser for the JVM, a correctness proof of the bytecode verifier with respect to the type system, and a compiler and a proof that it preserves semantics and well-typedness. The emphasis of this work is not on particular language features but on providing a unified model of the source language, the virtual machine, and the compiler. The whole development has been carried out in the theorem prover Isabelle/HOL. Java; operational semantics; theorem proving
A Multiresolution Terrain Model For Efficient Visualization Query Processing X Lin, K Deng, H Shen, K Xu, X Zhou, IEEE Transactions on Knowledge and Data Engineering, X. Wu, C. Faloutsos. IEEE Computer Soc, Los Alamitos, 2006, pp. 1382 - 1396
Multiresolution Triangular Mesh (MTM) models are widely used to improve the performance of large terrain visualization by replacing the original model with a simplified one. MTM models, which consist of both original and simplified data, are commonly stored in spatial database systems due to their size. The relatively slow access speed of disks makes data retrieval the bottleneck of such terrain visualization systems. Existing spatial access methods proposed to address this problem rely on main-memory MTM models, which leads to significant overhead during query processing. In this paper, we approach the problem from a new perspective and propose a novel MTM called direct mesh that is designed specifically for secondary storage. It supports available indexing methods natively and requires no modification to MTM structure. Experiment results, which are based on two real-world data sets, show an average performance improvement of 5-10 times over the existing methods. multiresolution visualization; spatial database systems
A New Approach For The Incremental Development Of Retrieval Functions For Cbr A Hoffmann, A Khan, Applied Artificial Intelligence, Robert Trappl. Taylor and Francis, 2006, pp. 507 - 541
A Novel Instruction Scratchpad Memory Optimization Method Based On Concomitance Metric A Janapsatya, A Ignjatovic, S Parameswaran, ASPDAC 2006, Proceedings, H. Onodera, Y. Matsunaga. IEEE, USA, 2006, pp. 612 - 617
A Novel Sound Localization Experiment For Mobile Audio Augmented Reality Applications N Mariette, Advances in Artificial Reality and Tele-Existence, Z.Pan, A.Cheok, M.Haller, R.Lau, H Saito, R.Liang. Springer, Berlin-Heidelberg, 2006, pp. 132 - 142
A Novel Stochastic Game Via The Quantitative Modal Mu-Calculus C Morgan, A McIver, ENTCS 153: Proceedings QAPL 2005, Cerone and Wiklicky. Elsevier, online, 2006, pp. 195 - 212
A Privacy Preserving Gps-Based Pay-As-You-Drvie Insurance Scheme M Iqbal, S Lim, IGNSS 2006, Proceedings, IGNSS Inc.
, 2006
A Relaxation Of A Semiring Constraint Satisfaction Problem Using Combined Semirings T Meyer, A Ghose, P Harvey, L Leenen, Lecture Notes in Artificial Intelligence, Yang, Webb. Springer-Verlag Berlin, Berlin, 2006, pp. 907 - 911
The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences (semiring values) can be associated with tuples of values of the variable domains. Bistarelli et al. [1] define an abstract solution to a SCSP which consists of the best set of solution tuples for the variables in the problem. Sometimes this abstract solution may not be good enough, and in this case we want to change the constraints so that we solve a problem that is slightly different from the original problem but has an acceptable solution. In [2] we propose a relaxation of a SCSP where we define a measure of distance (a semiring value from a second semiring) between the original SCSP and a relaxed SCSP. In this paper we show how the two semirings can be combined into a single semiring. This combined semiring structure will allow us to use existing tools for SCSPs to solve Combined Semiring Relaxations of SCSPs. At this stage our work is preliminary and needs further investigation to develop into a useful algorithm.
A Self-Selecting Crossover Operator A Blair, R Harper, 2006 IEEE congress on evolutionary computation, L. Wang, et al.. IEEE omnipress, Madison, WI, USA, 2006, pp. 1420 - 1427
A Sniffer Based Approach To Ws Protocols Conformance Checking P Ramsokul, A Sowmya, International symposium on prallel and dsitributed computing, Proceedings, D. Petcu, et al. IEEE computer society, Los Alamitos, CA, USA, 2006, pp. 58 - 65
A Syntax-Based Approach To Reasoning About Action And Belief Update N Foo, A Nayak, B Vo, Journal of Logic and Computation, Gabbay. Oxford University Press, Oxford, 2006, pp. 315 - 338
A Systematic Approach To Process Enactment Analysis As Input To Software Process Improvement Or Tailoring M Huo, D Jeffery, H Zhang, Proceedings of the 13th Asia Pacific Software Engineering Conference, Pankaj Jalote. IEEE Computer Society, Los Alamitos, California, 2006, pp. 401 - 408
A Timing Model For Synchronous Language Implementations In Simulink T Bourke, A Sowmya, Proc. 6th ACM & IEEE Int. Conf. on Embedded Software, Sang Lyul Min, Wang Yi. ACM, New York, USA, 2006, pp. 93 - 101
Active Contour With Neural Networks-Based Information Fusion Kernel X Cai, A Sowmya, Lecture Notes in Computer Science, King et al. Springer, Berlin/Heidelberg, 2006, pp. 324 - 333
Adapting Distributed Shared Memory Applications In Diverse Environments D Potts, I Kuz, 6th IEEE international symposium on cluster computing and the grid workshops, Proceedings, S. Kawanda. IEEE computer society, USA, 2006
Adaptive And Scalable Onboard Mobile Communication: Opportunities And Challenges B Benatallah, M Hassan, QShine 2006/WNEPT 2006, B. Li, P. Mohapatra. ACM, Canada, 2006
Adaptive Position Update In Geographic Routing Q Chen, M Hassan, S Kanhere, K Lan, 2006 IEEE international conference on communications, Proceedings, E. Panayirei. IEEE, USA, 2006
Adaptively Indexing Dynamic Xml D Fisher, R Wong, Database systems for advanced applications, Proceedings, M. Lee, K. Tan. Springer Verlag, Berlin/Heidelberg, Germany, 2006, pp. 233 - 248
Adc Precision Requirement For Digital Ultra-Wideband Receivers With Sublinear Front-Ends: A Power And Performance Perspective I Lu, S Parameswaran, N Weste, 19th Conference on VLSI Design, Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, 2006, pp. 575 - 580
Admissible And Restrained Revision T Meyer, R Booth, Journal of Artificial Intelligence Research, Ai Access Foundation, Marina Del Rey, 2006, pp. 127 - 151
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier`s natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that the penultimate input is not ignored completely, thereby eliminating natural revision, but includes the Darwiche-Pearl operator, Nayak`s lexicographic revision operator, and a newly introduced operator called restrained revision. We demonstrate that restrained revision is the most conservative of admissible revision operators, effecting as few changes as possible, while lexicographic revision is the least conservative, and point out that restrained revision can also be viewed as a composite operator, consisting of natural revision preceded by an application of a `backwards revision` operator previously studied by Papini. Finally, we propose the establishment of a principled approach for choosing an appropriate revision operator in different contexts and discuss future work.
Among, Common And Disjoint Constraints E Hebrard, T Walsh, C Bessiere, B Hnich, Z Kiziltan, Lecture Notes in Artificial Intelligence, Springer-Verlag Berlin, Berlin, 2006, pp. 29 - 43
AMONG, COMMON and DISJOINT are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and set variables. We show how computational complexity can be used to determine whether achieving the highest level of consistency is tractable. For tractable constraints, we present a polynomial propagation algorithm and compare it to logical decompositions with respect to the amount of constraint propagation. For intractable cases, we show in many cases that a propagation algorithm can be adapted from a propagation algorithm of a similar tractable one.
An Adaptive Plan-Based Dialogue Agent: Integrating Learning Into A Bdi Architecture A Nguyen, W Wobcke, 5th international joint conference on autonomous agents and multiagent systems, Proceedings, P. Stone, G. Weiss. ACM press, New York, NY, 2006, pp. 786 - 788
An Analysis Of Three Puzzles In The Logic Of Intention W Wobcke, AI 2006: Advances in Artificial Intelligence, Sattar, A. & Kang, B.. Springer-Verlag, Berlin, 2006, pp. 403 - 412
An Aspect-Oriented Framework For Service Adaptation B Benatallah, W Kongdenfha, R Saint-Paul, F Casati, Service oriented computing---ICSOC 2006, A. Dan, W. Lamersdorf. Springer, Germany, 2006, pp. 15 - 26
An Exploratory Study Of Process Enactment Is Input To Software Process Improvement M Huo, R Jeffery, H Zhang, 28th international conference on software engineering and co-located workshops, Proceedings, B. Boehm, et al.. ACM, New York, NY, USA, 2006, pp. 39 - 44
Analysis And Management Of Web Service Protocols B Benatallah, F Casati, F Toumani, Data and knowledge engineering, P. Atzeni, W. Chu. Elsevier, Amsterdam, The Netherlands, 2006, pp. 327 - 357
Approximate Processing Of Massive Continuous Quantile Queries Over High-Speed Data Streams J Xu, Y Yuan, Q Zhang, X Lin, J Yu, X Zhou, IEEE Transactions on Knowledge and Data Engineering, X. Wu, C. Faloutsos. IEEE Computer society, Piscataway, NJ, USA, 2006, pp. 683 - 697
Aseha: A Framework For Modelling And Verification Of Web Services Protocols P Ramsokul, A Sowmya, 4th IEEE international conference on software engineering and formal methods, Proceedings, D. Hung, P. Pandya. IEEE computer society, Los Alamitos, CA, USA, 2006, pp. 196 - 205
Automatic Detection Of Tram Tracks On Hrct Images P Amaratunga, M Prasad, M Rudrapatna, A Sowmya, P Wilson, 2006 IEEE International Conference on Image Processing Proceedings, Monson Hayes. IEEE Signal Processing Society, Piscataway, NJ, USA, 2006, pp. 885 - 888
Autonomous Traversal Of Rough Terrain Using Behavioural Cloning M Kadous, C Sammut, R Sheh, 3rd international conference on autonomous robots, Proceedings, G. Gupta, S. Mukhopadhyay. Institute of IST, Masey University, New Zealand, 2006, pp. 219 - 224
Bandwidth-Aware Slot Allocation In Hybrid Mac S Jha, B Liu, A Nyandoro, Y Rana, IEEE local computer networks conference, 2006, Proeecings, H. Hassanein. IEEE, USA, 2006, pp. 89 - 96
Bootstrapping Word Sense Disambiguation Using Dynamic Web Knowledge A Hoffmann, Y Wang, PRICAI 2006: Trends in artificial intelligence, Q. Yang, G. Webb. Springer Verlag, Heidelberg, D-69121, Germany, Germany, 2006, pp. 1150 - 1154
Building And Querying E-Catalog Networks Using P2p And Data Summarisation Techniques B Benatallah, M Hassan, H Paik, N Mouaddib, F Toumani, Journal of Intelligent Information Systems, H.Christiansen, M.Hacid. Springer, Berlin, 2006, pp. 7 - 24
Caps: Energy-Efficient Processing Of Continuous Aggregate Queries In Sensor Networks W Hu, A Misra, R Shorey, Proceedings of the 4th International Conference on Pervasive Computing and Communications (PerCom 2006), Marco Conti. IEEE, Pisa, Italy, 2006, pp. 190 - 199
Classification Of Hidden Network Streams M Gebski, A Penev, R Wong, Data warehousing and knowledge discovery, A. Min Tjoa, J. Trujillo. Springer, Germany, 2006, pp. 332 - 341
Classification Of Lung Disease Pattern Using Seeded Region Growing J Wong, T Zrimec, AI 2006: Advances in Artificial Intelligence, Abdul Sattar, Byeong-Ho Kang. Springer, Berlin, Germany, 2006, pp. 233 - 242
Clustering-Based Relevance Feedback For Web Pages S Yoo, A Hoffmann, PRICAI 2006: trends in artificial intelligence, Porceedings, Q. Yang, G. Webb. Springer, Germany, 2006, pp. 464 - 473
Co-Ordinated Control Of Electrical Machines Over Internet N Parameswaran, S Sathiakumar, ISIE 2006 international symposium on industrial electronics, Proceedings, M. Lavoie, et al.. IEEE, New Jersey, USA, 2006, pp. 130 - 135
Code Tiling: One Size Fits All Q Huang, J Xue, High-performance computing: paradigm and infrastructure, L. Yang, M. Guo. Wiley, USA, 2006
Comma: A Communications Methodology For Dynamic Module-Based Reconfiguration Of Fpgas O Diessel, S Koh, ARCS'06: 19th international conference on architecture of computing systems, W. Karl, et al.. Gesellschaft fur informatik, Bonn, Germany, 2006, pp. 173 - 182
Communications Infrastructure Generation For Modular Fpga Reconfiguration O Diessel, S Koh, Proceedings of the IEEE International Conference in Field Programmable Technology '06, G.Constantinides, W.Mak, P.Sirisuk, T.Wiangtong. IEEE, New Jersey, 2006, pp. 321 - 324
Comparison Of Numeral Strings Interpretation: Rule-Based And Feature-Based N-Gram Methods W Wilson, K Min, AI 2006: Advances in Artificial Intelligence, A.Sattar & B-H. Kang. Springer, Berlin, 2006, pp. 1226 - 1230
Compositionality Of Hennessy-Milner Logic By Structural Operational Semantics R van Glabbeek, P de Wind, W Fokkink, Theoretical Computer Science, A. Lingas, L. Gasieniec. Elsevier Science Bv, Amsterdam, 2006, pp. 421 - 440
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulas, obtained by decomposing the original formula. The method uses the structural operational semantics of the process algebra. The main contribution of this paper is the extension of an earlier decomposition method for the De Simone format from the Ph.D. thesis of Larsen in 1986, to more general formats. (c) 2005 Published by Elsevier B.V. structural operational semantics; modal logic; compositional proof, system; congruence; ntyft/ntyxt format
Computational Quantification Of Trust Updates A Ramer, 1st International Workshop Proceedings: Integrating Ai and Data Mining, K.Ong, K.Smith-Miles, V.Lee, W.Ng. Computer Society IEEE, Los Alamitos, CA, USA, 2006, pp. 73 - 78
Computing Possible And Necessary Winners From Incomplete Partially-Ordered Preferences T Walsh, M Pini, F Rossi, B Venable, ECAI 2006 17th European Conference on Artificial Intelligence, Gerhard Brewka, Silvia Coradeschi, Anna Perini, Paolo Traverso. IOS Press, Netherlands, 2006, pp. 767 - 768
Controlling Heterogeneous Semi-Autonomous Rescue Robot Teams M Kadous, C Sammut, R Sheh, 2006 IEEE international conference on systems, mand and cybernetics, Proceedings, T. Lee, M. Zhou. IEEE, USA, 2006, pp. 3204 - 3209
Cooperative And Dialog Based Multiagent Clobal Software Delivery Management A Kurniawan, N Parameswaran, R Gorthi, Emerging Trends and Challenges in IT Management, M. Khosrow-Pour. Idea Group Publishing, Hershey, USA, 2006, pp. 377 - 380
Coopstream: A Cooperative Cache Based Streaming Schedule Scheme For On-Demand Media Services On Overlay Networks J Xue, B Bao, M Guo, International conference on parallel processing, Proceedings, W. Feng. IEEE computer society, USA, 2006, pp. 577 - 584
Customization Of Application Specific Heterogeneous Multi-Pipeline Processors S Radhakrishnan, H Guo, S Parameswaran, Design, automation and test in europe, Proceedings, K. Preas. ACM press, New York, 2006, pp. 746 - 751
Customized Benchmark Generation Using Mda L Zhu, B Bui, I Gorton, Y Liu, 5th working IEEE/IFIP conference on software architecture, Proceedings, R. Nord, et al.. IEEE computer society, Los Alamitos, USA, 2006, pp. 35 - 44
Deducing Logic Programs K Wong, Logic Programming, S.Etalle, M.Truszcuynski. Springer, Germany, 2006, pp. 471 - 472
Deploying Long-Lived And Cost-Effective Hybrid Sensor Networks C Chou, W Hu, S Jha, N Bulusu, Ad Hoc Networks, Ian Akilydiz. Elsevier, Netherlands, 2006, pp. 749 - 767
Detecting Anomalies And Intruders A Prayote, P Compton, AI 2006: advances in artificial intelligence, A. Sattar, B. Kang. Springer, Germany, 2006, pp. 1084 - 1088
Detecting Event Patterns In E-Markets: A Case Study In Financial Market Surveillance P Mangkorntong, F Rabhi, Proceedings of the IADIS International Conference E-Commerce 2006, Sandeep Krishnamurthy and Pedro Isaias. International Association for Development of the Informationo Society (IADIS) Press, Porto, Portugal, 2006, pp. 112 - 119
Developing And Reasoning About Probabilistic Programs In Pgcl C Morgan, A McIver, Refinement Techniques in Software Engineering, Cavalcanti, Sampaio, Woodcock. Springer, Germany, 2006
Differential Qos Support In Web Services Management A Erradi, S Padmanabhuni, N Varadharajan, Proceedings of the 2006 IEEE International Conference on Web Services, ICWS 2006, Frank Leymann, Liang-Jie. IEEE Computer Society, Los Alamitos, California, 2006, pp. 781 - 788
Distinctness Analysis On Natural Landmark Descriptors K Kiang, A Blair, R Willgoss, Field and service robotics: results of the 5th international conference, P. Corke, S. Sukkarieh. Springer, Berlin, 2006, pp. 67 - 78
Divide And Congruence Applied To N-Bisimulation R van Glabbeek, P de Wind, W Fokkink, Electronic Notes in Theoretical Computer Science 156 2006 (1-2), Mislove. Elsevier, Amsterdam, 2006, pp. 97 - 113
Divide And Congruence: From Decomposition Of Modalities To Preservation Of Branching Bisimulation R van Glabbeek, P de Wind, W Fokkink, Formal methods for components and objects, F. de Boer, et al.. Springer-Verlag Berlin, Berlin, 2006, pp. 195 - 218
We present a method for decomposing modal formulas for processes with the internal action tau. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.
Dslbench: Applying Dsl In Benchmark Generation B Bui, D Jeffery, Proceedings of the 1st Workdhop on Model Driven Development for Middleware, Gorton, Zhu, Liu, Chen. ACM Press, New York, USA, 2006
Dynamic Registration Selection For Fingerprint Verification N Yager, A Amin, Pattern Recognition, R.Ledley, C.Suen. Elsevier, The Netherlands, 2006, pp. 2141 - 2148
Dynamically Defined Functions In Grammatical Evolution A Blair, R Harper, 2006 IEEE Congress on Evolutionary Computation, Wang, Bonissone, Lucas. IEEE, Omnipress, Madison, WI, USA, 2006, pp. 2638 - 2645
Efficient Boundary Estimation For Practical Deployment Of Mobile Sensors In Hybrid Sensor Networks N Ahmed, S Jha, S Kanhere, Proceedings of the 3rd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Ruiz, Dai. IEEE, USA, 2006, pp. 662 - 667
Efficient Computation Of K-Medians Over Data Streams Under Memory Constraints Z Zhang, X Lin, W Wang, J Yu, Z Chong, A Zhou, Journal of Computer Science and Technology, Science Press, Beijing, 2006, pp. 284 - 296
In this paper, we study the problem of efficiently computing k-medians over high-dimensional and high speed data streams. The focus of this paper is on the issue of minimizing CPU time to handle high speed data streams on top of the requirements of high accuracy and small memory. Our work is motivated by the following observation: the existing algorithms have similar approximation behaviors in practice, even though they make noticeably different worst case theoretical guarantees. The underlying reason is that in order to achieve high approximation level with the smallest possible memory, they need rather complex techniques to maintain a sketch, along time dimension, by using some existing off-line clustering algorithms. Those clustering algorithms cannot guarantee the optimal clustering result over data segments in a data stream but accumulate errors over segments, which makes most algorithms behave the same in terms of approximation level, in practice. We propose a new grid-based approach which divides the entire data set into cells (not along time dimension). We can achieve high approximation level based on a novel concept called (1 - epsilon)-dominant. We further extend the method to the data stream context, by leveraging a density-based heuristic and frequent item mining techniques over data streams. We only need to apply an existing clustering once to computing k-medians, on demand, which reduces CPU time significantly. We conducted extensive experimental studies, and show that our approaches outperform other well-known approaches. data streams; k-medians; cluster; data mining
Efficient Knowledge Acquisition For Extracting Temporal Relations S Pham, A Hoffmann, ECAI 2006, Brewka, Coradeschi, Perini, Traverso. IOS Press, Amsterdam, 2006, pp. 521 - 525
Embedding Defeasible Logic In Logic Programming M Maher, G Antoniou, D Billington, G Governatori, Theory and practice of logic programming, A. Bossi. Cambridge university press, Cambridge, UK, 2006, pp. 703 - 735
Enforcing Business Rules And Information Security
Policies Through Compliance Audits
Xissf - A Compliance Specification Mechanism F Yip, N Paramesh, P Ray, The First IEEE/IFIP International Workshop on
Business-Driven IT Management (BDIM 2006)- Information Technology Management from a Business Perspective, Claudio Bartolini, Akhil Sahai and Jacques Sauve. The Institute of Electrical and Electronics Engineers, Inc., Piscataway, NJ, USA, 2006, pp. 81 - 90
Corporate enterprises are facing increased requirements to fulfill different regulations. Requirements such as routine compliance with security standards can provide risk mitigation and process performance benefits. However, compliance management is a manual and labor-intensive process and creates additional overheads to any businesses. To make matter worse, the growing number and constant changes of security standards such as CobiT and ISO17799 contributes to increased complexity. This paper presents XISSF, an extensible information security specification format that acts as a compliance audit mechanism for enforcing business rules and information security policies. A mechanism designed to alleviate the routine and manual task of compliance auditing and assessment as well as increasing the accuracy of audit results. The notion of checkpoints is subsequently introduced and modeled in high level finite state machines in this paper. Compliance, Information Security Policies, Audit,
Information Security Specifications
Estimating Search Tree Size T Walsh, P KIlby, J Slaney, S Thiebaux, Proceedings of the 21st national conference on AI (AAAI-06), AAAI press, Mnlo Park, CA, USA, 2006, pp. 1014 - 1019
Evaluating Guidelines For Empirical Software Engineering Studies H Al-Kilidar, M Ali Babar, W Keung, M Berry, M Staples, H Zhang, K Cox, B Kitchenham, F kurniawati, L Zhu, Proceedings of the 2006 ACM/IEEE International Symposium on Empirical Software Engineering, Claes Wohlin, José Carlos Maldonado. ACM Press, New York, NY, USA, 2006, pp. 38 - 47
Evaluation Of Incremental Knowledge Acquisition With Simulated Experts T Cao, P Compton, AI 2006: advances in artificial intelligence, A. Sattar, B. Kang. Springer, Heidelberg, 2006, pp. 39 - 48
Evaluation Strategies For Integrating Legacy Applications As Services In A Service Oriented Architecture A Erradi, S Anand, N Kulkarni, Proceedings of the 2006 IEEE International Conference in Services Computing, Hemant Jain, Zhiwei Xu, Liang-Jie Zhang. IEEE Computer Society, Los Alamitos, California, 2006, pp. 257 - 260
Event-Driven Sensor Network Localization S Jha, M Nawaz, M Peters, 13th international conferen on telecommunications, Proceedings, L. Correia. Intituto Telecomunicacoes, Aveiro, Portugal, 2006
Experience With Ripple-Down Rules P Compton, G Edwards, T Lavers, L Peters, Knowledge-Based Systems, E. Edmonds. Elsevier, USA, 2006, pp. 356 - 362
Ripple-Down Rules (RDR) is an approach to building knowledge-based systems (KBS) incrementally, while the KBS is in routine use. Domain experts build rules as a minor extension to their normal duties, and are able to keep refining rules as KBS requirements evolve. Commercial RDR systems are now used routinely in some Chemical Pathology laboratories to provide interpretative comments to assist clinicians make the best use of laboratory reports. This paper presents usage data from one laboratory where, over a 29 month period, over 16,000 rules were added and 6,000,000 cases interpreted. The clearest evidence that this facility is highly valuable to the laboratory is the on-going addition of new knowledge bases and refinement of existing knowledge bases by the chemical pathologists. � 2006 Elsevier B.V. All rights reserved. Knowledge based systems, Expert systems, Knowledge acquisition, Pathology, Logic programming
Exploiting Rate Diversity For Broadcasting In Wireless Mesh Networks C Chou, J Qadir, A Misra, IEEE local computer networks conference, Proceedings, K. Christensen, M. Frank. IEEE, USA, 2006, pp. 287 - 295
Exploiting Statistical Information For Implementation Of Instruction Scratchpad Memory In Embedded Systems A Janapsatya, A Ignjatovic, S Parameswaran, IEEE transactions on VLSI systems, P. Eles, A. Jantsch. IEEE, USA, 2006, pp. 816 - 829
Exploring Group Size On Software Inspection Performance: Report From 2 Controlled Experiments P Patara, N Yaw, L Land, Proceedings of the 24th IASTED International Multi-Conference Software Engineering, P. Kokol. ACTA Press, Anaheim/Calgary/Zurich, 2006, pp. 171 - 176
Software inspection/review is recognized as an effective technique to improve software quality. Current literature has examined inspection performance, mostly through the introduction of different defect detection methods. However not much work has been done on exploring the relative effective group varying group size. There seems to be a variety of prescription for group size across different software artifacts (ranging 2-6) [1]. We explored the relative performance of varying group size for an ER model inspection in this study via 2 controlled laboratory experiments. Our findings showed no significant differences between interacting size of 2 and 4. Practical implication and limitations for this work are also discussed. Software inspection entity relationship diagram (ERD), inspection team size, requirements specification.
Extensibility And Reuse In An Agent-Based Dialogue Model A Nguyen, W Wobcke, Proceedings of the International Workshop on Communication Between Human and Artificial Agents, Cory Butz, Ngoc Thanh Nguyen, Yasufuni Takama. IEEE Computer Society Press, Hong Kong, 2006, pp. 367 - 371
Fast And Scalable Access To Advance Resource Reservation Data In Future Cellular Networks B Benatallah, M Hassan, M Hassan, P Pham, A Sun, 2006 IEEE international conference on communications, Proceedings, E. Panayirei. IEEE, USA, 2006, pp. 108 - 114
Fast Computation Of Reachability Labeling For Large Graphs X Lin, J Cheng, H Wang, J Yu, P Yu, Advances in database technology EDBT 2007, Y. Ioannidis, et al.. Springer-Verlag Berlin, Berlin, 2006, pp. 961 - 979
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic analyzing, Web navigation, semantic web, chemical informatics and bio-informatics systems, and computer vision. A graph reachability query, as one of the primary tasks, is to find whether two given data objects, u and v, are related in any ways in a large and complex dataset. Formally, the query is about to find if v is reachable from u in a directed graph which is large in size. In this paper, we focus ourselves on building a reachability labeling for a large directed graph, in order to process reachability queries efficiently. Such a labeling needs to be minimized in Size for the efficiency of answering the queries, and needs to be computed fast for the efficiency of constructing such a labeling. As such a labeling, 2-hop cover was proposed for arbitrary graphs with theoretical bounds on both the construction cost and the size of the resulting labeling. However, in practice, as reported, the construction cost of 2-hop cover is very high even with super power machines. In this paper, we propose a novel geometry-based algorithm which computes high-quality 2-hop cover fast. Our experimental results verify the effectiveness of our techniques over large real and synthetic graph datasets.
Feasibility Study Of Using Mobile Gateways For Providing Internet Connectivity In Public Transport Vehicles S Iskander, G Setiwan, Q Chen, S Kanhere, K Lan, IWCMC 2006, Proceedings, M. Guizani. ACM press, USA, 2006, pp. 1097 - 1102
Feature Weighted Minimum Distance Classifier With Multi-Class Confidence Estimation M Rudrapatna, A Sowmya, Lecture Notes in Artificial Intelligence LNAI Volume 4304: AI 2006: Advances in Artificial Intelligence, Abdul Sattar and Byeong-Ho Kang. Springer, Germany, 2006, pp. 253 - 263
Filtering Algorithms For The Nvalue Constraint E Hebrard, T Walsh, C Bessiere, B Hnich, Z Kiziltan, Constraints An International Journal, Peter van Beck. Springer Science+Business Media LCC, Norwell, MA USA, 2006, pp. 271 - 293
Finding Maximally Satisfiable Terminologies For The Description Logic Alc K Lee, T Meyer, R Booth, J Pan, Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), Gil, Mooney. AAAI Press, Menlo Park, California, 2006, pp. 269 - 274
Finding Optimal L1 Cache Configuration For Embedded Systems A Janapsatya, A Ignjatovic, S Parameswaran, ASPDAC 2006, Proceedings, H. Onodera, Y. Matsunaga. IEEE, USA, 2006, pp. 796 - 801
Fingerprint Alignment Using A Two Stage Optimization N Yager, A Amin, Pattern Recognition Letters, T.K.Ho, G.Sanniti di Baja. Elsevier, The Netherlands, 2006, pp. 317 - 324
Formal Consistency Verification Between Bpel Process And Privacy Policy Y Li, B Benatallah, H Paik, S Benbernou, Proceddings of the 4th Annual Privacy Security Trust Conference, George Yee, Patrick Hung. McGraw Hill, Whitby, Canada, 2006, pp. 212 - 223
Formal Methods In The Enhancement Of Data Security Protocols Of Mobile Agents R Al-Jaljouli, 4th international conference on computer systems and applications, Proceedings, M. Langston. IEEE computer society, USA, 2006, pp. 475 - 484
Formal Verification And Simulation For Performance Analysis For Probabilistic Broadcast Protocols A Fehnker, P Gao, Ad-Hoc, Mobile, and Wireless Networks (LNCS 4104), T. Kunz & S.S. Ravi. Springer Verlag, Heidelberg, D-69121, Germany, Germany, 2006, pp. 128 - 141
Formalizing Complex Task Libraries In Golog A Gabaldon, Proceedings of the 17th Conference on Artificial Intelligence, Brewka, Coradeschi, Perini, Traverso. IOS Press, Netherlands, 2006, pp. 755 - 756
Functional Unit Chaining: A Runtime Adaptive Architecture For Reducing Bypass Delays O Diessel, L Koh, Advances in computer systems architecture, C. Jesshope, C. Egan. Springer-Verlag, Germany, 2006, pp. 161 - 174
General Symmetry Breaking Constraints T Walsh, Principles and Practice of Constraint Programming - CP 2006, Frederic Benhamou. Springer Verlag, Heidelberg, D-69121, Germany, Germany, 2006, pp. 650 - 664
Global Grammar Constraints T Walsh, C Quimper, Principles and Practice of Constraint Programming - CP 2006, Frederic Benhamou. Springer-Verlag Berlin Heidelberg, Germany, 2006, pp. 751 - 755
Graduated Automated Assessments: Multiply Correct Multiple Choice E Martin, A Ramer, R Ramer, Proceedings of Thailand international conference on 21st century information technology in mathematics education, Gullaya Dhompongsa, et al.. Chiang Mai Rajabhat university, Thailand, 2006, pp. 293 - 302
Hard And Soft Constraints For Reasoning About Qualitative Conditional Preferences T Walsh, C Domshlak, S Prestwich, F Rossi, K Venable, Journal of Heuristics, Springer, Dordrecht, 2006, pp. 263 - 285
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP-nets model. In particular, we show how hard constraints are sufficient to model the optimal outcomes of a possibly cyclic CP-net, and how soft constraints can faithfully approximate the semantics of acyclic conditional preference statements whilst improving the computational efficiency of reasoning about these statements. preferences; hard and soft constraints; CP-nets
Hardware Assisted Pre-emptive Cont. Fl. Chking. for Emb. Processors to improve Reliability (None HERDC) S Parameswaran, R Ragel, Proceedings of the 4th International CODES, ACM Press, New York, 2006, 100-105
Reliability in embedded processors can be improved by control
flow checking and such checking can be conducted using software
or hardware. Proposed software-only approaches suffer from significant
code size penalties, resulting in poor performance. Proposed
hardware-assisted approaches are not scalable and therefore
cannot be implemented in real embedded systems. This paper presents
a scalable, cost effective and novel fault detection technique, to ensure proper control flow of a program. This technique includes
architectural changes to the processor and software modifications.
While architectural refinement incorporates additional instructions,
the software transformation utilizes these instructions into the program flow. Applications from an embedded systems benchmark
suite are used for testing and evaluation. The overheads are compared
with the state of the art approach that performs t he same
error coverage using software-only techniques. Our method has
greatly reduced overheads compared to the state of the art. Our
approach increased code size by between 3.85-11.2% and reduced
performance by just 0.24-1.47% for eight different industry standard
applications. The additional hardware (gates) overhead in this
approach was just 3.59%. In contrast, the state of the art software only approach required 50-150% additional code, and reduced performance by 53.5-99.5% when error detection was inserted.
Heterogenous Multiprocessor Implementations For Jpeg: A Case Study A Erdos, S Parameswaran, S Shee, Proceedings of the International Conference on Hardware/Software Code design and System Synthesis CODES+ISSS 2006, S Ha, K.Choi. ACM Press, New York, USA, 2006, pp. 217 - 222
Heyting Domains For Constraint Abduction M Maher, AI 2006: advances in artificial intelligence, A. Sattar, B. Kang. Springer, Germany, 2006, pp. 9 - 18
Higher Order Flattening M Chakravarty, G Keller, R Leshchinskiy, Computational science --- ICCS 2006, Proceedings, V. Alexandrov, G. van Albada, J. Dongarra. Springer-Verlag, Germany, 2006, pp. 920 - 928
Hybrid System Verification Is Not A Sinecure - The Electronic Throttle Control Case Study A Fehnker, B Krogh, International Journal of Foundations of Computer Science, World Scientific Publ Co Pte Ltd, Singapore, 2006, pp. 885 - 901
Though model checking itself is a fully automated process, verifying correctness of a hybrid system design using model checking is not. This paper describes the necessary steps, and choices to be made, to go from an informal description of the problem to the final verification result for a formal model and requirement. It uses an automotive control system for illustration.
Identifying Clusters From Positive Data E Martin, J Case, S Jain, A Sharma, F Stephan, Siam Journal on Computing, E. Tardos. Siam Publications, Philadelphia, 2006, pp. 28 - 55
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hypothesis space, i.e., numbering, A(0), A(1),... of nonempty recursively enumerable (r. e.) subsets of N or Q(k). A clustering task is a finite and nonempty set of r. e. indices of pairwise disjoint such sets. The class S is said to be clusterable if there is an algorithm which, for every clustering task I, converges in the limit on any text for boolean OR(i is an element of I) A(i) to a finite set J of indices of pairwise disjoint clusters such that boolean OR(j is an element of J) A(j) = boolean OR(i is an element of I) A(i). A class is called semiclusterable if there is such an algorithm which finds a J with the last condition relaxed to boolean OR(j is an element of J) A(j) superset of boolean OR(i is an element of I) A(i). The relationship between natural topological properties and clusterability is investigated. Topological properties can provide sufficient or necessary conditions for clusterability, but they cannot characterize it. On the one hand, many interesting conditions make use of both the topological structure of the class and a well-chosen numbering. On the other hand, the clusterability of a class does not depend on which numbering of the class is used as a hypothesis space for the clusterer. These ideas are demonstrated in the context of naturally geometrically defined classes. Besides the text for the clustering task, clustering of many of these classes requires the following additional information: the class of convex hulls of finitely many points in a rational vector space can be clustered with the number of clusters as additional information. Interestingly, the class of polygons ( together with their interiors) is clusterable if the number of clusters and the overall number of vertices of these clusters is given to the clusterer as additional information. Intriguingly, inductive inference; clustering; hypothesis space; numbering; Turing, degree; topological and geometric properties of clusterable classes
Impact On Holes On Geometric Ad-Hoc Routing Protocols V Chhieng, R Choi, R Wong, 2006 IEEE International Conference of Networks Networking - Challenges and Frontiers, Saira Kuttan. IEEE, Singapore, 2006, pp. 510 - 515
Implementation Of A Multi-Homing Agent For Mobile On-Board Communication Y Duan, J Pan, J Yao, K Lan, Proceedings of Vehicular Technology Conference, 2006, VTC2006-Spring, Mark Reed, Dhammika Jayalath. IEEE, USA, 2006, pp. 869 - 900
Impres: Integrated Monitoring For Processor Reliability And Security R Ragel, S Parameswaran, 43rd Design automation conference 2006, Proceedings, ACM press, New York, 2006, pp. 502 - 505
Incremental Learning For Segmentation In Medical Images A Misra, P Compton, A Sowmya, IEEE international symposium on biomedical imaging, Proceedings, E. Meijering. IEEE, USA, 2006, pp. 1360 - 1363
Inducible Platelet-Derived Growth Factor D-Chain Expression By Angiotensin Ii And Hydrogen Peroxide Involves Transcriptional Regulation By Ets-1 And Sp1 F Santiago, M Eyries, L Khachigian, C Zhang, M Liu, Blood, Amer Soc Hematology, Washington, 2006, pp. 2322 - 2329
Platelet-derived growth factor D-chain (PDGF-D) is the newest member of the PDGF family of mitogens and chemoattractants expressed in a wide variety of cell types, including vascular smooth muscle cells (SMCs). The molecular mechanisms regulating PDGF-D transcription are not known. Primer extension analysis mapped a single transcriptional start site to the ccAGCGC motif with several potential Ets motifs located upstream. Ets-1, but not Ets-1 bearing only the DNA-binding domain, activates the PDGF-D promoter and mRNA expression in SMCs. Ets site D3 ((-470)GGAT(-467)) is singly required for basal and Ets-1-inducible PDGF-D promoter-dependent expression. D3 supports the interaction of endogenous and recombinant Ets-1 and Sp1. Sp1, like Ets-1, induces PDGF-D transcription and mRNA expression, which is blocked by mutant Ets-1. H2O2 stimulates Ets-1, but not Sp1, and activates D3-dependent PDGF-D transcription. Ets-1 and Sp1 siRNA block peroxide-inducible PDGF-D expression. Anglotensin II (ATII) induction of PDGF-D and Ets-1 was blocked by prior incubation of the cells with PEG-catalase, but not BSA, indicating that ATII-inducible Ets-1 and PDGF-D expression is mediated via H2O2. Thus, 2 separate transacting factors regulate PDGF-D transcription, alone and in response to oxidative stress.
Inmaf: Indexing Music Databases Via Multiple Accoustic Features J Shen, J Shepherd, A Ngu, Proceedings of the ACM SIGMOD International Conference in Management of Data, S.Chaudhuri, V.Hristidis, N.Polyzotis. ACM, New York, 2006, pp. 778 - 780
Instruction Scheduling With Release Times And Deadlines On Ilp Processors H Wu, J Xue, J Jaffar, 12th IEEE international conference on embedded and real-time computing systems, Proceedings, S. Petters, S. Hong. IEEE, Los Alamitos, CA, USA, 2006, pp. 51 - 60
Internal Popularity Of Streaming Video And Its Implication On Caching C Chou, X Du, T Wang, J Yu, Proceedings 20th International Conference on Advanced Information Networking and Applications, Roland Wagner, Jianhua Ma, Arjan Durresi. IEEE, USA, 2006
Inverse Consistencies For Non-Binary Constraints T Walsh, K Stergiou, ECAI 2006 17th European Conference on Artificial Intelligence, Gerhard Brewka, S.Coradeschi, A.Perini, P.Traverso. IOS Press, Netherlands, 2006, pp. 153 - 157
Ipsom: A Self-Organising Map Spatial Model Of How Humans Complete Interlocking Puzzles S Revithis, N Marcus, W Wilson, AI 2006: advances in artificial intelligence, A. Sattar, B. Kang. Springer, Berlin, 2006, pp. 285 - 294
Isaac Levi On Abduction M Pagnucco, Knowledge and inquiry, Cambridge university press, New York, 2006
Knowledge Compilation And Belief Change M Pagnucco, 19th Australian joint conference on artificial intelligence, Proceedings, A Sattar, B. Kang. Springer Verlag, Berlin, 2006, pp. 90 - 99
Learning Causal Networks From Microarray Data N Ahsan, M Bain, I Dawes, B Gaeta, J Potter, M Temple, Intelligent systems for bioinformatics, M. Boden, T. Bailey. Australian computer society inc., Sydney, Australia, 2006, pp. 3 - 8
Learning Parameter Tuning For Object Extraction X Cai, A Sowmya, J Trinder, Computer vision, ACCV 2006, D. Narayanan et al.. Springer, Berlin/Heidelberg, Germany, 2006, pp. 868 - 877
Learning Sensor Data Charactersitics In Unknown Environments T Bokareva, S Jha, N Bulusu, Mobiquitous, 2006, H. Ahmadi, T. La Porta. X-CD technologies, USA, 2006
Liveness, Fairness And Impossible Futures R van Glabbeek, M Voorhoeve, Concurrency theory---CONCUR 2006, C. Baier, H. Hermanns. Springer-Verlag Berlin, Berlin, 2006, pp. 126 - 141
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same `AGEF` properties: temporal logic properties saying that reaching a desired outcome is not doomed to fail. We show that this equivalence, with an added root condition, is the coarsest congruence containing weak bisimilarity with explicit divergence that respects deadlock/livelock traces (or fair testing, or any liveness property under a global fairness assumption) and assigns unique solutions to recursive equations.
Location-Free Fault Repair In Hybrid Sensor Networks N Ahmed, S Jha, L Tuan, 1st international conference on integrated internet ad hoc and sensor networks, Proceedings, I. Stojmenovic, G. Chelius. ACM press, France, 2006
Lock Selection Made Easy A Shanneb, J Potter, 2006 Australasian software engineering conference, Proceedings, J. Han, M. Staples. IEEE computer society, Los Alamitos, CA, USA, 2006, pp. 341 - 350
Low-Latency Broadcast In Multi-Rate Wireless Mesh Networks C Chou, J Qadir, A Misra, IEEE Journal on Selected Areas in Communications, Nicholas F. Maxemchuk. IEEE, USA, 2006, pp. 2081 - 2091
Mapping Recursive Functions To Reconfigurable Hardware H Elgindy, G Ferizis, Proceedings of the 2006 International Conference on Field Programming, Koch, Leong, Boemo. IEEE Computer Society, 2006, pp. 283 - 287
Measurement And Decision Making M Berry, A Aurum, Value-based software engineering, Stefan Biffl, Aybüke Aurum, Barry Boehm, Hakan Erdogmus and Paul Grünbacher. Springer, New York, NY, 2006
Value-Based Software Engineering requires the capability to measure and analyse value in order to make informed decisions. The difficulty experienced by many organizations in measuring concepts that are even simpler than value suggest s that this requirement will be hard to meet. The goal of this chapter is to build an understanding of measurement and decision making and the relationship between them. A multi-view model of measurement is presented as a way to cope with the complexity of measuring concepts such as value. A behavioural decision making model is presented that identifies the points at which measurement products impact the decision making behaviour of a manager or software engineer. This model attempts to satisfactorily account for the idiosyncrasies of human behaviour, while preserving some elements of the rational model of decision making. The chapter concludes with an application of these models to a case study in which achieving value is a key goal. Decision making, decision support system, image theory, measurement analysis
Microelectronic Retinal Prosthesis: Ii. Use Of High-Voltage Cmos In Retinal Neurostimulators N Dommel, P Byrnes-Preston, T Lehmann, N Lovell, Y Wong, G Suaning, Final Program and Abstract Book 28th Annual International Conference of the IEEE Engineering in Medicine and Biology Society., Atam P.Dhawan. IEEE Press, Piscataway, New Jersey, USA, 2006, pp. 4651 - 4654 digital-to-analog converter (DAC), high-voltage CMOS, Parallel neural Stimulation, vision prosthesis.
Minimising The Energy Consumption Of Real-Time Tasks With Precedence Constraints On A Single Processor S Parameswaran, H Wu, Embedded and ubiquitous computing 2006, Proceedings, E. Sha, et al.. Springer, Germany, 2006, pp. 45 - 56
Minimizing Bank Selection Instructions For Partitioned Memory Architectures J Xue, B Burgstaller, B Scholz, Proceedings of the 2006 International Conference on Compilers, Architectures, and Synthesis for Embedded Systems, Krisztian Flautner and Taewhan Kim. ACM Press, New York, USA, 2006, pp. 201 - 211
Minimum Latency Broadcasting In Multi-Radio, Multi-Channel, Multi-Rate Wireless Meshes C Chou, J Qadir, A Misra, IEEE SECON 2006 CD, IEEE, USA, 2006
Model Checking Russian Cards R Van Der Meyden, J Ruan, H van der Hoek, H van Ditmarsch, Electronic notes in theoretical computer science, C. Pecheur, B. Williams. Elsevier, 2006, pp. 105 - 123
Model-Driven Benchmark Generation For Web Services L Zhu, B Bui, I Gorton, Y Liu, 2006 international worskhop on service-oriented software engineering, Proceedings, G. Roman. ACM press, New York, USA, 2006, pp. 36 - 39
Multi-Robot Path Planning With Subgraphs M Ryan, 2006 Australasian conference on robotics and automation, Proceedings, B. McDonald. ARAA, Auckland, NZ, 2006
Mutual Enrichment For Agents Through Nested Belief Change: A Semantic Approach T Meyer, L Perrussel, J Thevenin, Proceedings of the 11th Workshop on Nonmonotonic Reasoning, J.Dix, A.Hunter. Clausthal University of Technology, Clausthal, 2006, pp. 498 - 503
Mutual Enrichment Through Nested Belief Change T Meyer, L Perrussel, J Thevenin, Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, Peter Stone, Gerhard Weiss. ACM Press, New York, USA, 2006, pp. 226 - 228
On Cache Prefetching Strategies For Integrated Infostation-Cellular Network H Elgindy, J Wang, J Lipman, The 31st IEEE Conference on Local Computer Networks (LCN'06), Hossam Hassanein. IEEE Computer Society, Tampa, Florida, USA, 2006, pp. 185 - 192
On Ordinal Vc-Dimentsion And Some Notions Of Complexity E Martin, A Sharma, F Stephan, Theoretical computer science, Gavalda, Takimoto. Elsevier, Amsterdam, The Netherlands, 2006, pp. 62 - 76
On Ownership And Accessibility Y Lu, J Potter, 20th European conference on object-oriented programming, Proceedings, D. Thomas. Springer, Berlin, Germany, 2006, pp. 99 - 123
On The Expressiveness Of Higher Dimensional Automata R van Glabbeek, Theoretical Computer Science, J. Baeten, F. Corradini. Elsevier, Amsterdam, Netherlands, 2006, pp. 265 - 290
On The Fading And Shadowing Effects For Wireless Sensor Networks C Chou, S Jha, IEEE interantional conference on mobile, ad hoc and sensor networks, Proceedings, Z. Haas, J. Hou. IEEE, USA, 2006, pp. 51 - 60
On The Sensitivity Of Sensor Network Simulations S Jha, M Nawaz, L Tuan, C Sreenan, VTC 2006-spring, F. Zheng. IEEE, USA, 2006, pp. 1043 - 1047
Ontology Engineering For Efinance W Ying, N Parameswaran, P Ray, The Semantic Web ASWC2006 Workshop Proceedings, Li, Liang, Ronchetti. Jilin University Press, Beijing, China, 2006, pp. 75 - 83
Ontology-Based Miltiagent Systems (Obmas) For Semantic Interoperability A Wong, N Parameswaran, P Ray, The semantic web (ASWC) 2006 workshop proceedings, G. Li, et al. Jilin university press, China, 2006, pp. 121 - 122
Openxup-An Alternative Approach To Developing Highly Iteractive Web Applications B Benatallah, R Saint-Paul, J Yu, F Casati, The 6th International Conference on Web Engineering, D.Wolber, N.Calder, C.Brooks, A.Ginige. ACM Press, USA, 2006, pp. 289 - 296
Overload Protection For Commodity Network Appliances L Macpherson, Advances in computer systems architecture, C. Jesshope, C. Egan. Springer-Verlag, Berlin, 2006, pp. 203 - 218
Packet Pacing In Short Buffer Optical Packet Switched Networks H Elgindy, V Sivaraman, D Moreland, D Ostry, Packet pacing in short buffer optical packet switched networks, IEEE, Piscataway, NJ, 2006
In the absence of a cost-effective technology for storing optical signals, emerging optical packed switched (OPS) networks are expected to have severly limited buffering capability. This paper investigates the resulting impact on end-to-end loss and throughput, and proposes that the optical edge switched "pace" packets into OPS core to improve performance without adversely affecting end-to-end delays. In this context, our contributions are three-fold. We first evaluate the impact of short buffers on the performance of real-time and TCP traffic.
Partial Dead Code Elimination On Predicated Code Regions Q Cai, G Lin, J Xue, Software -- Practice and Engineering, R.N. Horspool & A.J. Wellings. John Wiley & Sons, Inc., USA, 2006, pp. 1655 - 1685
Patching Approximate Solutions In Reinforcement Learning M Kim, W Uther, Machine learning: ECML 2006, J. Furnkranz, T. Scheffer, M. Spiliopoulou. Springer-Verlag, Berlin, Germany, 2006, pp. 258 - 269
Perceptual Evaluation Of Spatial Audio For "Audio Nomad" Augmented Reality Artworks N Mariette, Engage 2006, E.Edmonds, L.Muller,D.Turnbull. Creativity and Cognition Studio Press, Sydney, 2006, pp. 260 - 269
Performance Enhancement Of On-Board Communication Networks Using Outage Prediction A Baig, M Hassan, L Libman, Journal on Selected Areas of Communications (JSAC), Behcet Sarikaya. IEEE, USA, 2006, pp. 1692 - 1701
Performance Evaluation Of Vision-Based High Dof Human Movement Tracking: A Survey And Human Computer Interaction Perspective D Heckenberg, 2nd IEEE workshop for human computer interaction, Proceedings, A. Fitzgibbon, C. Taylor, Y. LeCun. IEEE computer society, Los Alamitos, CA, USA, 2006
Policy-Driven Middleware For Self-Adaptation Of Web Services Compositions A Erradi, P Maheshwari, 2006 ACM/IFIP/USENIX 7th international middleware confrence, Proceedings, M. van Steen, M. Henning. Springer, Germany, 2006, pp. 62 - 80
Population Entropy For Mobile Hotspots B Benatallah, M Hassan, M Hassan, S Das, 5th international Asian mobile computing conference, Proceedings, A. Acharya. Tata McGraw-Hill, New Delhi, 2006, pp. 184 - 190
Programming-Logic Analysis Of Fault Tolerance C Morgan, A McIver, Rigorous Development of Complex Fault-Tolerant Systems, Butler, Jones, Romanovsky, Troubitsyna. Springer, Germany, 2006
Propagation Algorithms For Lexicographic Ordering Constraints T Walsh, A Frisch, B Hnich, Z Kiziltan, I Miguel, Artificial Intelligence, Elsevier Science Bv, Amsterdam, 2006, pp. 803 - 834
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constraint programming to a problem, it is modelled by a set of constraints on a set of decision variables. A common modelling pattern is the use of matrices of decision variables. The rows and/or columns of these matrices are often symmetric, leading to redundancy in a systematic search for solutions. An effective method of breaking this symmetry is to constrain the assignments of the affected rows and columns to be ordered lexicographically. This paper develops an incremental propagation algorithm, GACLexLeq, that establishes generalised arc consistency on this constraint in O(n) operations, where n is the length of the vectors. Furthermore, this paper shows that decomposing GACLexLeq into primitive constraints available in current finite-domain constraint toolkits reduces the strength or increases the cost of constraint propagation. Also presented are extensions and modifications to the algorithm to handle strict lexicographic ordering, detection of entailment, and vectors of unequal length. Experimental results on a number of domains demonstrate the value of GACLexLeq. (c) 2006 Elsevier B.V. All rights reserved. artificial intelligence; constraints; constraint programming;, constraint propagation; lexicographic ordering; symmetry; symmetry, breaking; generalized are consistency; matrix models
Protecting Multicast Sessions In Wireless Mesh Networks C Chou, J Guo, S Jha, X Zhao, 31st IEEE conference on local computer networks, Proceedings, H. Hassanein. IEEE, USA, 2006, pp. 467 - 474
Protecting Representation With Effect Encapsulation Y Lu, J Potter, POPL 2006, S. Jones. ACM, USA, 2006, pp. 359 - 371
Protocol Discovery From Imperfect Service Interaction Data B Benatallah, H Motahari Nezhad, R Saint-Paul, Very large databases (VLDB) 2006, PhD workshop, vol-170, Proceedings, J. Shim, F. Casati. CEUR, Germany, 2006, pp. 6 - 10
Qos Driven Parallelization Of Resources To Reduce File Download Delay S Sohail, C Chou, S Jha, S Kanhere, IEEE Transactions on Parallel & Distributed Systems, Laxmi Bhuyan. IEEE Computer Society, New York, USA, 2006, pp. 1204 - 1215
Qualitative Simulation Model For Software Engineering Process M Huo, D Jeffery, B Kitchenham, H Zhang, Proceedings of the 2006 Australian Software Engineering Conference, Jun Han, Mark Staples. Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, USA, 2006, pp. 391 - 400
Quantification Over Names And Modalities E Martin, Advances in modal logic, vol 6, G. Governatori, et al. College publications, London, UK, 2006, pp. 353 - 372
Query-Topic Focused Web Pages Summarization S Yoo, A Hoffmann, PRICAI 2006: trends in artificial intelligence, Proceedings, Q. Yang, G. Webb. Springer, Germany, 2006, pp. 533 - 543
Querying E-Catelogs Using Content-Summaries B Benatallah, M Hassan, A Sun, M Hacid, On the Move to Meaningful Internet Systems 2006, CoopIS, DOA, GADA, and ODBASE, R.Meersman, T.Tari et al. Springer, Germany, 2006, pp. 109 - 126
Ray-Tracing Based Registration For Hrct Images Of The Lungs S Busayarat, T Zrimec, Medical Image Computing and Computer-Assisted Intervention - Proceedings, Part II, Rasmus Larsen, Mads Nielsen, Jon Sporting. Springer, Germany, 2006, pp. 670 - 677
Reconsidering The Human Immunoglobulin Heavy-Chain Locus: 1. An Evaluation Of The Expressed Human Ighd Gene Repertoire C Lee, M Bain, A Collins, B Gaeta, W Sewell, H Malming, Immunogenetics, Springer, New York, 2006, pp. 917 - 925
We have used a bioinformatics approach to evaluate the completeness and functionality of the reported human immunoglobulin heavy-chain IGHD gene repertoire. Using the hidden Markov-model-based iHMMune-align program, 1,080 relatively unmutated heavy-chain sequences were aligned against the reported repertoire. These alignments were compared with alignments to 1,639 more highly mutated sequences. Comparisons of the frequencies of gene utilization in the two databases, and analysis of features of aligned IGHD gene segments, including their length, the frequency with which they appear to mutate, and the frequency with which specific mutations were seen, were used to determine the reliability of alignments to the less commonly seen IGHD genes. Analysis demonstrates that IGHD4-23 and IGHD5-24, which have been reported to be open reading frames of uncertain functionality, are represented in the expressed gene repertoire; however, the functionality of IGHD6-25 must be questioned. Sequence similarities make the unequivocal identification of members of the IGHD1 gene family problematic, although all genes except IGHD1-14*01 appear to be functional. On the other hand, reported allelic variants of IGHD2-2 and of the IGHD3 gene family appear to be nonfunctional, very rare, or nonexistent. Analysis also suggests that the reported repertoire is relatively complete, although one new putative polymorphism (IGHD3-10*p03) was identified. This study therefore confirms a surprising lack of diversity in the available IGHD gene repertoire, and restriction of the germline sequence databases to the functional set described here will substantially improve the accuracy of IGHD gene alignments and therefore the accuracy of analysis of the V-D-J junction. human; B Cells; antibodies; repertoire development
Recovery Policies For Enhancing Web Services Reliability A Erradi, P Maheshwari, V Tosic, 2006 IEEE international conference on web services, Proceedings, F. Leymann, L. Jie. IEEE computer society, Los Alamitos, CA, USA, 2006, pp. 189 - 196
Representing Action Domains With Numeric-Valued Fluents A Gabaldon, E Erdem, Lecture Notes in Artificial Intelligence, Fisher, Hoek, Konev, Lisitsa. Springer-Verlag, 2006, pp. 151 - 163
Resilient Multicasting In Wireless Mesh Networks C Chou, J Guo, S Jha, X Zhao, 13th International conference on telecommunications, Proceedings, L. Correia. Instituto telecomincacoes -- Polo de Aveiro, Aveiro, Portugal, 2006
Running The Manual: An Approach To High-Assurance Microkernel Development P Derrin, M Chakravarty, D Cock, K Elphinstone, G Klein, 2006 ACM SIGPLAN Haskell workshop, Proceedings, A. Loh. ACM press, New York, NY, USA, 2006, pp. 60 - 71
Secure Untrusted Binaries---Provably! M Chakravarty, S Winwood, Formal aspects in security and trust: 3rd international workshop, FAST 2005, T. Dimitrakos, et al.. Springer-Verlag, Germany, 2006, pp. 171 - 186
Security Vulnerabilities In Channel Assignment Algorithms Of Multi-Radio Multi-Channel Wireless Mesh Networks S Kanhere, A Naveed, IEEE 2006 Global TeleCommunications Conference (GLOBECOM 2006), Terrence Kero. IEEE Communications Society, New York, 2006
Semantic Data Integration For It Governance A Wong, N Parameswaran, P Ray, F Yip, The semantic web (ASWC) 2006 workshop proceedings, G. Li, et al.. Jilin university press, China, 2006, pp. 189 - 198
Semantic Interoperability Of E-Health Systems Using Dialog Based Mapping Of Ontologies P Ganguly, A Wong, N Parameswaran, P Ray, The Semantic Web ASWC 2006 Workshops Proceedings, Li, Liang, Ronchetti. Jilin University Press, China, 2006, pp. 136 - 141
Semantic Service Mediation B Benatallah, H Lei, G Xie, L Zeng, Service Oriented Computing - ICSOC 2006, A.Dan, W.Lamersdorf. Springer, Germany, 2006, pp. 490 - 495
Semantical Considerations For A Logic Of Actions: An Imperative Manifesto V Jauregui, Principles of knowledge representation and reasoning 2006, Proceedings, P. Doherty, J. Mylopoulos. AAAI press, USA, 2006, pp. 371 - 376
Semi-Quantitative Simulation Modeling Of Software Engineering Process B Kitchenham, H Zhang, Software Process Change: The Proceedings of the International Software Process Workshop and International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006, Q.Wang, D.Pfahl, D.Raffo, P.Wernick. Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, Germany, 2006, pp. 242 - 253
Service Design Principles: A Case Study In Modeling Services For The Securities Trading Domain A Erradi, S Anand, N Kulkarni, International Journal of Computer Systems Science and Engineering, Prof. Tharam Dillon, Dr George Feuerlicht. CRL Publishing, UK, 2006, pp. 263 - 271
Servicemosaic: A Model-Driven Framework For Web Services Life-Cycle Management B Benatallah, H Motahari Nezhad, F Casati, J Ponge, F Toumani, IEEE Internet Computing, IEEE, 2006, pp. 55 - 63
Shallow Nlp Techniques For Internet Search A Penev, R Wong, 29th Australasian computer science conference, Proceedings, V. Estivill-Castro, G. Dobbie. ACS, Australia, 2006, pp. 167 - 176
Situation Management System For Disaster Relief Operations Management N Parameswaran, P Ray, J Buford, G Jakobson, L Lewis, Proceedings of the 3rd International Information Systems for Crisis Response and Management Conference, B.Van de Walle, M.Turoff. IEEE, USA, 2006, pp. 1 - 12
Skvr: Scalable Knowledge-Based Routing Architecture For Public Transport Networks S Ahmed, S Kanhere, Proceedings of the 3rd ACM Workshop on Vehicular Ad-hoc Networks, W.Holfelder, D.Johnson. ACM, New York, 2006, pp. 92 - 93
Soaf: An Architectural Framework For Service-Definition And Realization A Erradi, S Anand, N Kulkarni, Proceedings of the 2006 IEEE International Conference on Services Computing, Hemant Jain, Zhiwei Xu, Liang-Jie Zhang. IEEE Computer Society, Los Alamitos, California, 2006, pp. 151 - 158
Social Choice Theory, Belief Merging, And Strategy-Proofness T Meyer, S Chopra, A Ghose, Information fusion, S. Konieczny, E. Gregoire. Elsevier, Orlando, USA, 2006, pp. 61 - 79
Solving Logic Programming Conflict Through Strong And Weak Forgettings N Foo, Y Zhang, Artificial Intelligence, C.Perrault, E.Sandewall. Elsevier, Amsterdam, 2006, pp. 739 - 778
Space-Efficient Relative Error Order Sketch Over Data Streams J Xu, X Lin, W Wang, Y Zhang, F Korn, 22nd international conference on data engineering, Proceedings, L. Liu, A. Reuter, et al.. IEEE computer society, Losa Alamitos, CA, USA, 2006, pp. 51 - 52
Stochastic Constraint Programming: A Scenario-Based Approach T Walsh, S Manandhar, S Tarim, Constraints, Springer, Dordrecht, 2006, pp. 53 - 80
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs contain both decision variables, which we can set, and stochastic variables, which follow a discrete probability distribution. We provide a semantics for stochastic constraint programs based on scenario trees. Using this semantics, we can compile stochastic constraint programs down into conventional (non-stochastic) constraint programs. This allows us to exploit the full power of existing constraint solvers. We have implemented this framework for decision making under uncertainty in stochastic OPL, a language which is based on the OPL constraint modelling language (Van Hentenryck, P., Michael, L., Perron, L., & Regin, J.-C. (1999) Constraint programming in OPL. In G. Nadathur, (Ed.), Principles and practice of declarative programming, LNCS 1702, (pp. 97-116). Springer-Verlag). To illustrate the potential of this framework, we model a wide range of problems in areas as diverse as portfolio diversification, agricultural planning and production/inventory management. constraint programming; constraint satisfaction; reasoning under, uncertainty
Straight-Line Drawing Algorithms For Hierarchical Graphs And Clustered Graphs X Lin, P Eades, Q Feng, H Nagamochi, Algorithmica, Springer, New York, 2006, pp. 1 - 32
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization and VLSI design. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of planar straight-line representation has not been solved completely. In this paper we answer the question: does every planar hierarchical graph admit a planar straight-line hierarchical drawing? We present an algorithm that constructs such drawings in linear time. Also, we answer a basic question for clustered graphs, that is, does every planar clustered graph admit a planar straight-line drawing with clusters drawn as convex polygons? We provide a method for such drawings based on our algorithm for hierarchical graphs. computational geometry; automatic graph drawing; hierarchical graph; clustered graph; straight-line drawing
Structural Description To Recognizing Hand-Printed Arabic Characters Using Decision Tree Learning Techniques A Amin, N Al-Darwish, International Journal of Computers and Applications, , 2006, pp. 129 - 134
Character recognition systems can contribute tremendously to the advancement of the automation process and can improve the interaction between man and machine in many applications, including office automation, cheque verification, and a large variety of banking, business, and data entry applications. The main theme of this paper is the automatic recognition of hand-printed Arabic characters using machine learning. Conventional methods have relied on hand-constructed dictionaries that are tedious to construct and difficult to make tolerant to variation in writing styles. The advantages of machine learning are that it can generalize over the large degree of variation between writing styles and recognition rules can be constructed by example. The system was tested on a sample of handwritten characters from several individuals whose writing quality ranged from acceptable to poor. The average recognition rate obtained using cross-validation was 87.23%. Character recognition, Learning systems, Trees (mathematics), Automation, Data acquisition, Glossaries, Technical writing, Feature extraction
Summarizing Level-Two Topological Relations In Large Spatial Datasets Q Liu, Y Yuan, X Lin, L Hongjun, X Zhou, ACM Transactions on Database Systems, ACM press, NY, USA, 2006, pp. 584 - 630
Surface K-Nn Query Processing X Lin, K Deng, H Shen, K Xu, X Zhou, 22nd international conference on data engineering (IDCE), Proceedings, L. Liu, et al.. IEEE computer society, Piscataway, NJ, USA, 2006, pp. 78 - 86
Symmetry Breaking Using Valude Precedence T Walsh, ECAI 2006 17th European conference on artificial intelligence, G. Brewka, et al.. IOS press, The Netherlands, 2006, pp. 168 - 172
Tank Monitoring: A Pamn Case Study T Hoang, K Robinson, S Schneider, H Treharne, Formal aspects of computing, E. Boiten, M. Butler. Springer, London, 2006, pp. 308 - 328
Tetravex Is Np-Complete T Walsh, Y Takenaga, Information Processing Letters, A. Tarlecki. Elsevier Science Bv, Amsterdam, 2006, pp. 171 - 174 computational complexity; NP-completeness; TETRAVEX
Texture And Distinctness Analysis For Natural Feature Extraction K Kiang, A Blair, R Willgoss, Australasian conference on robotics and automation 2005 (CD only), C. Sammut. Australian robotics and automation association, Australia, 2006
The All Different And Global Cardinality Constraints On Set, Multiset And Tuple Variables T Walsh, C Quimper, Lecture Notes in Artificial Intelligence, Springer-Verlag Berlin, Berlin, 2006, pp. 1 - 13
We describe how the propagator for the ALL-DIFFERENT constraint can be generalized to prune variables whose domains are not just simple finite domains. We show, for example, how it can be used to propagate set variables, multiset variables and variables which represent tuples of values. We also describe how the propagator for the global cardinality constraint (which is a generalization of the ALL-DIFFERENT constraint) can be generalized in a similar way. Experiments show that such propagators can be beneficial in practice, especially when the domains are large.
The Enotropy Of Fpga Reconfiguration O Diessel, U Malik, International conference on field programmable logic and applications, Proceedings, A. Koch, P. Leong, E. Boemo. Publidisa, Spain, 2006, pp. 261 - 266
The Perceived Utility Of Standard Ontologies In Document Management For Specialized Domains P Compton, M Kim, International Journal of Human-Computer Studies, E. Motta, S. Wiedenbeck. Academic Press Ltd Elsevier Science Ltd, London, 2006, pp. 15 - 26
A user-based document management system has been developed for small communities on the Web. The system is based on the free annotation of documents by users. A number of annotation support tools are used to suggest possible annotations, including suggesting terms from external ontologies. This paper outlines some evaluation data on how users actually interact with the system in annotating their document especially on the use of standard ontologies. Results indicate that although an established external taxonomy can be useful in proposing annotation terms, users appear to be very selective in their use of the terms proposed and to have little interest in adhering to the particular hierarchical structure provided. (c) 2005 Elsevier Ltd. All rights reserved. utility of standard ontologies; user-based document management
The Range Constraint: Algorithms And Implementation E Hebrard, T Walsh, C Bessiere, B Hnich, Z Kiziltan, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, J. Beck, B.Smith. Pringer-Verlag Berlin Heidelberg, Germany, 2006, pp. 59 - 73
The Roots Constraint T Walsh, C Bessiere, E Hebrard, B Hnich, Z Kiziltan, Principles and practice of constraint programming---CP 2006, F. Benhamou. Springer-Verlag, Germany, 2006, pp. 75 - 90
The Shadow Knows: Refinement Of Ignorance In Sequential Programs C Morgan, LNCS 4014, T. Uustalu. Springer, Germany, 2006, pp. 359 - 378
Topic Distillation In Desktop Search M Gebski, A Penev, R Wong, 17th international conference on database and expert systms applications, Proceedings, S. Bressan, et al. Springer Verlag, Germany, 2006, pp. 478 - 488
Towards A Distributive Software Architecture Evaluation Process --- A Preliminary Assessment M Ali Babar, I Gorton, B Kitchenham, 28th international conference on software engineering, Proceedings, B. Cheng, B. Shen. ACM, USA, 2006, pp. 845 - 848
Towards An Ontology Mapping Approach For Security Management A Wong, N Parameswaran, P Ray, International Journal on Artificial Intelligence Tools, I.Russell, Z.Markov, L.B.Holder. World Scientific, New Jersey, USA, 2006, pp. 1071 - 1090
Towards An Ontology-Driven Approach For The Interoperability Problem In Security Compliance A Wong, N Parameswaran, P Ray, 19th International FLAIRS conference, Proceedings, G. Sutcliffe, R. Goebel. AAAI press, Menlo Park, CA, USA, 2006, pp. 165 - 170
Towards Efficient Automated Singer Identification In Large Music Databases J Shen, J Shepherd, B Cui, K Tan, SIGIR 2006, S. Dumais, et al.. Association for Computing Machinery, New York, NY 10036-5701, United States, NY, USA, 2006, pp. 59 - 66
Automated singer identification is important in organising, browsing and retrieving data in large music databases. In this paper, we propose a novel scheme, called Hybrid Singer Identifier (HSI), for automated singer recognition. HSI can effectively use multiple low-level features extracted from both vocal and non-vocal music segments to enhance the identification process with a hybrid architecture and build profiles of individual singer characteristics based on statistical mixture models. Extensive experimental results conducted on a large music database demonstrate the superiority of our method over state-of-the-art approaches. Copyright 2006 ACM. Speech recognition, Electronic document identification systems, Database systems, Computer music, Statistical methods, Feature extraction
Towards Multidimensional Subspace Skyline Analysis Y Yuan, X Lin, W Wang, M Ester, W Jin, Q Liu, J Pei, Y Tao, J Yu, Q Zhang, ACM transactions on database systems, ACM press, New York, USA, 2006, pp. 1335 - 1381
Towards Semantic-Driven, Flexible And Scalable Framework For Peering And Querying E-Catalog Communities B Benatallah, H Paik, F Toumani, M Hacid, C Rey, Information Systems, David Bell, Christopher Busller, Jian Yang. Pergamon-Elsevier Science Ltd, Oxford, 2006, pp. 266 - 294
Given that e-catalogs are often autonomous and heterogeneous, effectively integrating and querying them is a delicate and time-consuming task. More importantly, the number of e-catalogs to be integrated and queried may be large and continuously changing. Conventional approaches where the development of an integrated e-catalog requires the understanding of each of the underlying catalog are inappropriate. In this paper, we use the concept of e-catalog communities and peer relationships among them to facilitate the querying of a potentially large number of dynamic e-catalogs. E-catalog communities are essentially containers of related e-catalogs. We propose a flexible and user-centric query matching algorithm that exploits both community descriptions and peer relationships to find e-catalogs that best match a user query. The user query is formulated using a description of a given community. (c) 2005 Elsevier B.V. All rights reserved. E-catalogs communities; P2P and networked data management; semantic, web; query rewriting; description logics
Trace-Based Cache Leakage Reduction At Link Time L Li, J Xue, Advances in computer systems architecture, 11th Asia-Pacific conference, Proceeidngs, C. Jesshope, C. Egan. Springer, Germany, 2006, pp. 175 - 189
Trust Updating In Belief Revision A Ramer, Proceedings of IPMU 2006, B. Bouchon-Meunier, R. Yager. EDK, Paris, France, 2006, pp. 1459 - 1466
Two Variants Of The Constructive Neural Network Tiling Algorithm A Ramer, J Bertini Jr, E Hruschka Jr, M Nicoletti, Proceedings of the 6th International Conference of Hybrid Intelligent Systems, A. Abraham, N.Kasabov, M.Koppen, A.Konig, Q.Song. IEEE Computer Society, Auckland, New Zealand, 2006
Unifying Logic, Topology And Learning In Parametric Logic E Martin, A Sharma, F Stephan, Theoretical Computer Science, C. Bianchi, et al.. Elsevier, Amsterdam, The Netherlands, 2006, pp. 103 - 124
Up Close And Pedagogical: Computing Academics Talk About Teaching C Kutay, R Lister, Computing education conference 2006, Proceedings, D. Tolhurst, and S. Mann. ACM, Adelaide, 2006, pp. 125 - 134
User-Level Fine-Grained Adaptive Real-Time Scheduling Via Temporal Relfection S Ruocco, Real-time systems symposium, Proceedings, T. Abdelzaher, G. Fowler. IEEE computer society, Los Alamitos, USA, 2006, pp. 246 - 256
Using A Hybrid Madm Approach For The Evaluation Of E-Business Architectural Patterns T Al-Naeem, F Dabous, F Rabhi, L Al Shalabi, Proceedings of the 4th International Multiconference on Computer Science and Information Technology (CSIT 2006), Ghassan Issa. Applied Science University, Amman, Jordan, 2006, pp. 196 - 205
Using Probabilistic Kleene Algebra For Protocol Verification C Morgan, E Cohen, A McIver, Lecture Notes in Artificial Intelligence, Renate Schmidt. Springer-Verlag Berlin, Berlin, 2006, pp. 296 - 310
We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilistic/demonic computation [3,16,10]. Our technical aim is to express probabilistic versions of Cohen`s separation theorems[1]. Separation theorems simplify reasoning about distributed systems, where with purely algebraic reasoning they can reduce complicated interleaving behaviour to, `separated` behaviours each of which can be analysed on its own. Until now that has not been possible for probabilistic distributed systems. Algebraic reasoning in general is very robust, and easy to check: thus an algebraic approach to probabilistic distributed systems is attractive because in that `doubly hostile` environment (probability and interleaving) the opportunities for subtle error abound. Especially tricky is the interaction of probability and the demonic or `adversarial` scheduling implied by concurrency. Our case study - based on Rabin`s Mutual exclusion with bounded waiting [6] - is one where just such problems have already occurred: the original presentation was later shown to have subtle flaws [15]. It motivates our interest in algebras, where assumptions relating probability and secrecy are clearly exposed and, in some cases, can be given simple characterisations in spite of their intricacy. Kleene algebra; probabilistic systems; probabilistic verification
Vanetcode: Network Coding To Enhance Cooperative Downloading In Vehicular Ad-Hoc Networks S Ahmed, S Kanhere, IWCMC 2006, Proceedings, M. Guizani. ACM press, USA, 2006, pp. 527 - 532
Visual Specification And Optimization Of Xquery Using Vxq R Choi, W Wang, R Wong, Database and Expert Systems applications, 2006, S. Bressan, et al. Springer, Poland, 2006, pp. 161 - 171
Web Service Computing: Overview And Directions B Benatallah, F Rabhi, C Godart, O Perrin, Handbook of Nature-Inspired and Innovative Computing: Integrating classical models with emerging technologies, Spring, USA, 2006
Web Service Interoperability Specifications B Benatallah, H Motahari Nezhad, F Casati, F Toumani, IEEE Computer, D. Carver, B.Schilit et al. IEEE, 2006, pp. 24 - 32
Xupclient---A Thin Client For Rich Internet Applications B Benatallah, R Saint-Paul, J Yu, F Casati, Web information systems---WISE 2006, K. Aberer, et al.. Springer, Germany, 2006, pp. 524 - 535
