UNSW   Faculty of Engineering PRINT VERSIONSITE MAP  
cse | School of Computer Science and Engineering (CRICOS Provider No. 00098G)
    #About CSE     #Undergraduate Study     #Postgraduate Study     #Timetables & Courses     #Research & Publications     #People & Work Units     #Help & Resources     #News & Events     #High School Portal
CSE 2007 Publications

CSE 2007 Publications

266 publication/s found
A Comparison Of Semantic Models For Noninterference
R Van Der Meyden, C Zhang, Formal aspects in security and trust, T. Dimitrakos, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 235 - 249

The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on state-machine and trace-set definitions; more recent work has dealt with definitions of security in two distinct process algebraic settings. Comparisons between the definitions has been carried out mainly within semantic frameworks. This paper studies the relationship between semantic frameworks, by defining mappings between a number of semantic models and studying the relationship between notions of noninterference under these mappings. © Springer-Verlag Berlin Heidelberg 2007. Semantic Web, Algebra, Number theory, Security of data
A Compression Algorithm For Large Arity Constraints
T Walsh, G Katsirelos, Principles and practice of constraint programming, C. Bessiere.
Springer, Germany, 2007, pp. 379 - 393
A Cut-Through Mac For Multiple Interface, Multiple Channel Wireless Mesh Networks
J Lim, C Chou, S Jha, A Nyandoro, Wireless communications and networking conference 2007, Proceedings, K. Letaief, C-L I.
IEEE, USA, 2007, pp. 2375 - 2380
A Declarative Approach To Extensible Interface Compilation
N Fitzroy-Dale, 1st international workshop on microkernels for embedded systems MIKES 2007, Proceedings,
NICTA, Australia, 2007, pp. 43 - 49
A Domain-Driven Approach For Detecting Event Patterns In E-Markets: A Case Study In Financial Market Surveillance
P Mangkorntong, F Rabhi, Lecture Notes in Computer Science,
Springer Berlin, Heidelberg, 2007, pp. 147 - 158

An e-market can be thought of as a distributed event system where an event is generated every time the market¿s state changes in response to a number of human or computing agents. The paper describes a practical application of event processing in an e-market context through conventional Event Processing Systems (EPSs). A new EPS architecture that allows an integration of several existing EPSs under a unified domain-specific user interface and execution environment is proposed. We assess the performance of the system for a case study in financial market surveillance and its ability to provide a common interface for two existing EPSs ¿ SMARTS and Coral8. A discussion on the experimental results and the issues arising from the proposed EPS architecture are also provided. e-markets, event-driven architecture, event pattern model.
A Dual Band Wireless Power And Fsk Data Telemetry For Biomedical Implants
L Jung, G Suaning, P Byrnes-Preston, T Lehmann, N Lovell, R Hessler, ,
Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, 2007, pp. 6596 - 6599

A dual-link coil arrangement and a novel digital frequency-shift keying (FSK) demodulator are presented. The primary application of this system is for inductively powered biomedical implants. The implant is provided with data and power via two separate links. Two sets of coils are used in an arrangement such that the magnetic interference between the two pairs is minimized. The demodulator circuitry presented relies solely on delaying elements, utilizing a delayed digital FSK signal to sample the original digital FSK signal. A synchronized clock can be derived from the FSK signals alone, however, by utilizing the power signal to obtain a synchronized clock, a higher data rate and a decrease in complexity of the receiver circuitry can be achieved. The system was implemented on the bench and experimentally tested at a data rate of 2.083 Mbps with zero bit error rate while receiving a 4.17/6.25 MHz FSK carrier signal synchronized with 2.083 MHz clock derived from the power carrier. The power link was set to provide 58mW. © 2007 IEEE. Demodulators, Bit error rate, Frequency shift keying, Implants (surgical)
A Framework For Adopting Software Process Simulation In Cmmi Organizations
D Jeffery, H Zhang, B Kitchenham, International conference on software process (ICSP) 2007, Proceedings, W. Qing, et al..
Springer, Germany, 2007, pp. 320 - 331
A Framework For Managing The Evolution Of Business Protocols In Web Services
B Benatallah, S Ryu, R Saint-Paul, F Casati, Conceptual modelling 2007, V. Estivill-Castro.
ACS, Sydney, Australia, 2007, pp. 49 - 59
A Framework For Rapid Integration Of Presentation Components
B Benatallah, R Saint-Paul, J Yu, F Casati, F Daniel, M Matera, Web engineering, P. Patel-Schneider and P. Shenoy.
ACM press, New York, USA, 2007, pp. 923 - 932
A Graph Drawing Approach To Sensor Network Localization
S Jha, M Nawaz, IEEE MASS 2007, Proceedings, Giordano and Stojmenovic.
IEEE computer society, Italy, 2007
A High-Level Approach For Defining & Composing Event Patterns And Its Application To E-Markets
P Mangkorntong, F Rabhi, VLDB 2007 - 33rd International Conference on Very Large Data Bases, Jinpeng Wei.
Very Large Data Base Endowment Inc, University of Vienna, Austria, 2007

An e-market can be thought of as a distributed event system where an event is generated every time the market's state changes in response to a number of human or computing agents. This paper is concerned with detecting certain types of e-market behaviour using an architecture comprising several conventional Event Processing Systems (EPSs). Such an architecture relies on a unified representation of e-market events and event patterns. This paper describes our approach for defining, composing and storing event patterns. The application of the proposed approach is demonstrated through the construction of existing event patterns used in financial market surveillance.
A Linear Time Algorithm For Pricing European Sequential Barrier Options
P Gao, R Van Der Meyden, Computing: the Australasian theory symposium, Proceedings, J. Gudmundson and B. Jay.
Australian computer society, Bedford Park, SA, 2007, pp. 55 - 62
A Location-Aware Mobile Call Handling Assistant
Y Chan, A Limaru, A Wong, W Wobcke, I Bokharouss, 21st IEEE international conference on advanced information networking and applications workshop/symposia, Proceedings, H. Duman, et al..
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 282 - 289
A Memory Allocation Model For An Embedded Microkernel
P Derrin, D Elkaduwe, K Elphinstone, 1st international workshop on microkernels for embedded systems MIKES 2007, Proceedings, I. Kuz and S. Petters.
NICTA, Australia, Sydney, Australia, 2007, pp. 29 - 35
A Multi-Agent Collabor Ative Fr Amework For Mobile E-Health
V Chan, N Parameswaran, P Ray, Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007), Ralph H. Sprague, Jr..
IEEE, Inc, Piscataway, NJ, 2007, pp. 1 - 10

With today?s unstoppable rise in technological progression, we have seen a growing abundance of consumer health monitoring products in the openmarket. These devices allow patients to have their health signs monitored unobtrusively in their mobile environment. However, the uptake of these technologies is slow and there is a need for a new paradigm to support the cooperation of healthcare professionals using these technologies. The role of the CSCW approach via agents is to increase awareness and collaboration among patients and medical staff in the health monitoring process. The aim of this paper then, is to present a multi-agent collaborative framework for mobile e-health, based on the computer-supported cooperative work (CSCW) paradigm, along with a discussion on its possible workflow effects.
A Novel Gather/Scatter Hardware Support And Fft Case Study
A Ku, J Kuo, ISCA 22nd international conference, Proceedings, B. Gupta.
ISCA, NC, USA, 2007, pp. 52 - 57
A Novel Network Architecture Support For Fast Reconfiguration
H Elgindy, A Ku, J Kuo, 2007 international conference on field programmable technology, Proceedings, H. Amano, et al..
IEEE, Japan, 2007, pp. 353 - 356
A Parallelised High Performance Monte Carlo Simulation Approach For Complex Polymerisation Kinetics
H Chaffey-Millar, C Barner-Kowollik, M Chakravarty, G Keller, D Stewart, Macromolecular Theory and Simulations,
Wiley VCH Verlag GmBH & Co, Germany, 2007, pp. 575 - 592
A Partial Nucleated Differential Cell Count Of The Bone Marrow Aspirate That Is Independent Of Peripheral Blood Dilution
S Ho, H Lee, P Giri, S Lee, H Sia, T Sullivan, D Thomas, B To, INTERNATIONAL JOURNAL OF LABORATORY HEMATOLOGY,
Blackwell Publishing, Oxford, 2007, p. 20
A Power-Efficient 5.6-Ghz Process-Compensated Cmos Frequency Divider
I Lu, S Parameswaran, N Weste, IEEE Transactions on Circuits and Systems II-Express Briefs,
IEEE, Los Amitos, CA, USA, 2007, pp. 323 - 327

This brief presents a robust, power efficient CMOS frequency divider for the 5-GHz UNII band. The divider operates as a voltage controlled ring oscillator with the output frequency modulated by the switching of the input transmission gate. The divider, designed in a 0.25-μm SOS-CMOS technology, occupies 35 × 25 μm2 and exhibit a operating frequency of 5.6 GHz while consuming 79 μ W at a supply voltage of 0.8 V. Process and temperature tolerant operation can be achieved by utilizing a novel compensation circuitry to calibrate the speed of the ring oscillator-based divider. The simple compensation circuitry contains low-speed digital logic and dissipates minimal additional power since it is powered on only during the one-time factory calibration sequence. © 2007 IEEE. Frequency dividing circuits, CMOS integrated circuits, Delay circuits, Frequency modulation, Logic gates, Oscillators (electronic)
A Scheme For Probabilistically Reliable Multicast Routing In Wireless Mesh Networks
C Chou, J Guo, S Jha, X Zhao, 32nd IEEE international conference on local computer networks, Proceedings, M. Frank and E. Elmallah.
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 213 - 214
A Semiq Model Of Test-And-Fix Process Of Incremental Development
D Jeffery, H Zhang, B Kitchenham, 1st international workshop on software productivity analysis and cost estimation, Proceedings, J. Keung.
IPSJ/SIGSE, 2007, pp. 24 - 29
A Smart Random Code Injection To Mask Power Analysis Based Side Channel Attacks
J Ambrose, R Ragel, S Parameswaran, CODES + ISSS 2007, N. Dutt, and J. Teich.
ACM, New York, USA, 2007, pp. 51 - 56
A Stronger Notion Of Equivalence For Logic Programs
K Wong, Logic programming, V. Dahl and I. Niemela.
Springer, Germany, 2007, pp. 453 - 454
A System For Computer Aided Detection Of Diseases Patterns On High Resolution Ct Images Of The Lung
S Busayarat, T Zrimec, Proceedings of the 20th IEEE International Symposium on Computer-based Medical Systems, Peter Kokol.
IEEE Computer Society, Washington DC, USA, 2007, pp. 41 - 46
A Termination Checker For Isabelle Hoare Logic
G Klein, J Meng, L Paulson, 4th International Verfication Workshop - VERIFY '07, Berhard Beckert.
CEUR Workshop Proceedings, online, 2007, pp. 104 - 118
A Test Bed For Web Services Protocols
P Ramsokul, A Sowmya, S Ramesh, 2nd international conference on internet and web applications and services, Proceedings,
IEEE computer society, Piscataway, NJ, USa, 2007, pp. 16 - 21
A Traffic Forecast Neurocomputational Behavioural Model
S Revithis, EuroCogSci 07: the European cognitive science conference 2007, S. Vosniadou, et al..
Lawrence Erlbaum Associates, East Sussex, UK, 2007, pp. 664 - 669
Accurate On-Line Prediction Of Processor And Memory Energy Usage
G Heiser, S Petters, D Snowdon, 7th International conference on embedded software, Proceedings, C. Kirsch and R. Wilhelm.
ACM press, New York, USA, 2007, pp. 84 - 93
Accurate Run-Time Prediction Of Performance Degradation Under Frequency Scaling
G Van Der Linden, G Heiser, S Petters, D Snowdon, OSPERT 2007 workshop on operating system platforms for embedded real-time applications,
NICTA, Australia, 2007, pp. 58 - 64
Achieving Software Project Success: A Semi-Quantitative Approach
D Jeffery, B Kitchenham, H Zhang, Software process dynamics and agility, Q. Wang, et al..
Springer, Berlin/Heidelberg, 2007, pp. 332 - 343

Software process modeling and simulation hold out the promise of improving project planning and control. However, purely quantitative approaches require a very detailed understanding of the software project and process, including reliable and precise project data. Contemporary project management defines the success of project as a cube, rather than the traditional single point, which allows the management of software project semi-quantitatively with uncertainty-tolerance. This paper introduces semi-quantitative simulation into software project planning and control, and develops a practical approach to enhance the confidence of project success under uncertainty and contingency. We illustrate its value and flexibility by an example implementation with a simplified software process model. project management, software process improvement
Adaptive Distance Measurement For Time Series Databases
V Chhieng, R Wong, Advances in databases: concepts, systems and applications, R. Kotagiri et al..
Springer, Berlin Heidelberg, 2007, pp. 598 - 610
Advances And Challenges With Data Broadcasting In Wireless Mesh Networks
J Lim, C Chou, J Qadir, A Misra, IEEE Communications Magazine,
IEEE, New York, USA, 2007, pp. 78 - 85

Wireless mesh networks have become a promising means to provide low-cost broadband access. Many WMN applications require broadcasting data (IPTV etc.) over the WMN. This article studies how efficient data broadcast, measured in terms of broadcast latency, can be realized by exploiting two features of WMNs: the use of multiple transmission rates at the link layer and the use of multiple radio interfaces on each node. We demonstrate that by exploiting these features, broadcast latency can be reduced severalfold compared to the current default practice in wireless LANs of using the lowest transmission rate for broadcast traffic. We also discuss two important insights we have gained from our investigation. First, we find that when multiple radio interfaces are used, a channel assignment algorithm designed for unicast traffic may often perform poorly for broadcast flows. Second, we find that the efficiency of a transmission rate for reducing broadcast latency can be reasonably predicted by the product of the transmission rate and its coverage area. © 2007 IEEE. Wireless networks, Broadband networks, Broadcasting, Telecommunication traffic, Wireless local area networks (WLAN)
Algorithmic Verification Of Noninterference Properties
R Van Der Meyden, C Zhang, Electronic Notes in Theoretical Computer Science,
, 2007, pp. 61 - 75

The paper discusses the problem of model checking a number of noninterference properties in finite state systems: Noninterference, Nondeducibility on Inputs, Generalised Noninterference, Forward Correctability and Restrictiveness. The complexity of these problems is characterized, and a number of possible heuristics for optimization of the model checking are discussed. © 2007 Elsevier B.V. All rights reserved. Computational complexity, Finite automata, Heuristic methods, Mathematical models, Optimization, Problem solving, Signal interference
Aligning The Map Requirements Modelling With The B-Method For Formal Software Development
A Babar, J Potter, V Tosic, 14th Asia-Pacific Softare Engineering Conference, Proceedings of, K. Maruyama.
IEEE Computer Society, Los Alamitos, California, USA, 2007, pp. 17 - 24
An Adaptive Formal Model For Web Services Protocols
P Ramsokul, A Sowmya, 2nd international conference on internet and web applications and services, Proceedings,
IEEE computer society, Piscataway, NJ, USA, 2007, pp. 40 - 45
An Architecture For Tool Use And Learning In Robots
S Brown, C Sammut, 2007 Australasian conference on robotics and automation, Proceedings, M. Dunbabin and M. Srinivasan.
ACRA, Brisbane, Australia, 2007
An Efficient Histogram Method For Outlier Detection
M Gebski, R Wong, Advances in databases: concepts, systems and applications, R. Kotagiri et al..
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 176 - 187

An important problem in database and data mining systems is the detection of outlying points. It is often the case that data observations exhibiting atypical properties are of more interest than those fitting common patterns. While anomaly and outlier detection have received considerable attention from the statistics community, these approaches are primarily focused on analysis of data sets containing relatively few and univariate observations. Recently, valuable approaches have been proposed to facilitate multidimensional analysis for larger data sets. Unfortunately, these approaches are often expensive and require numerous comparisons between each point and the remainder of the data. We propose an approach using histograms for outlier detection. Sparse regions of the data are recognised and used for identifying points that are likely to be outliers. An extensive experimental evaluation demonstrates the efficiency of our approach under a number of circumstances with varying parameters on real world and synthetic data sets. © Springer-Verlag Berlin Heidelberg 2007. Database systems, Data mining, Data structures, Parameter estimation, Problem solving, Statistical methods
An Efficient Multimodal Language Processor For Parallel Input
F Chen, Y Shi, Y Sun, V Chung, International Conference on Semantic Computing, P. Sheu, P. Croll, M. Muhlhauser, H. Yamaguchi.
IEEE Computer Society Press, Los Alamitos, California, 2007, pp. 389 - 396
An Efficient Unification-Based Multimodal Language Processor In Multimodal Input Fusion
F Chen, Y Shi, V Chung, Y Sun, OZCHI 2007 Entertaining User Interfaces, Proceedings of, Mark Billinghurst.
, Adelaide, 2007, pp. 215 - 218
An Experimental Evaluation Of Local Features For Pedestrian Classification
S Paisitkriangkrai, J Zhang, C Shen, 9th biennial conference of the Australian pattern recognition society on digital image computing techniques and applications, Proceedings, A. van den Hengel et al..
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 53 - 60
An Exploratory Study Of Why Organizations Do Not Adopt Cmmi
R Jeffery, M Staples, A Abrahams, P Byatt, R Murphy, M Niazi, Journal of Systems Software,
Elsevier Science Inc, New York, 2007, pp. 883 - 895

This paper explores why organizations do not adopt CMMI (Capability Maturity Model Integration), by analysing two months of sales data collected by an Australian company selling CMMI appraisal and improvement services. The most frequent reasons given by organizations were: the organization was small; the services were too costly, the organization had no time, and the organization was using another SPI approach. Overall, we found small organizations not adopting CMMI tend to say that adopting it would be infeasible, but do not say it would be unbeneficial. We comment on the significance of our findings and research method for SPI research. (C) 2006 Elsevier Inc. All rights reserved. CMM; CMMI; capability maturity model; software process improvement
An Infrastructure For Indexing And Organizing Best Practices
L Zhu, M Staples, I Gorton, Realising evidence-based software engineering 2007,
IEEE, USA, 2007
An Input Parsing Algorithm Supporting Integration Of Delicate Gesture In Natural Language Interface
F Chen, Y Shi, Y Sun, V Chung, HCI Intelligent Multimodal Environment, Julie Jacko.
Springer, Berlin, Germany, 2007, pp. 206 - 215
An Interactive Diagnosis And Repair Of Owl Ontology
L Lu, N Parameswaran, P Ray, 1st International conference on semantic computing, Proceedings, W. Chang.
IEEE Computer Society, California, USA, 2007, pp. 113 - 120
Analysing Embedded System Software
S Seefried, A Fehnker, R Huuck, F Rauch, C/C++ Verification Workshop, Hendrik Tews.
Radbound University, Nijmegen, 2007, pp. 69 - 74
Analysis Of Resource Reservation Aggregation In On-Board Networks
M Malik, M Hassan, S Kanhere, L Libman, IEEE vehicular technology conference, Proceedings, D. Pesch.
Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, Piscataway, USA, 2007, pp. 1006 - 1010

The concept of providing mobile Internet connectivity for passengers in public transport vehicles, where users connect to a local network that attaches to the Internet via a mobile router and a wireless link, has become increasingly popular in recent years, as evidenced by the growing amount of commercially available systems and associated research and standardization activities. The challenge of providing wireless connectivity to networks in motion is compounded by the highly dynamic nature of the user population and the strict Quality-of-Service (QoS) requirements of many applications typical of such environments. As a result, several protocols extending Internet QoS support approaches to on-board mobile networks have been proposed in the past. In this paper, we focus on modeling and performance evaluation of periodical aggregation of resource reservation messages, which forms the basis of the On-Board RSVP protocol. We present a model consisting of a discrete-time, multiple-server and finite-capacity queueing system with bulk arrivals and departures, conduct a detailed analysis of the model, and use it to evaluate the performance of the resource reseration aggregation scheme in a practical scenario. The validity of our model is also backed by extensive simulation results. © 2007 IEEE. Frequency allocation, Internet, Quality of service, Routers, Standardization, Telecommunication links, User interfaces, Vehicle routing
Approximate Range-Sum Query Answering On Data Cubes With Probabilistic Guarantees
W Wang, A Cuzzocrea, Journal of Intelligent Information Systems,
Springer, Dordrecht, 2007, pp. 161 - 197

Approximate range aggregate queries are one of the most frequent and useful kinds of queries for Decision Support Systems (DSS), as they are widely used in many data analysis tasks. Traditionally, sampling-based techniques have been proposed to tackle this problem. However, their effectiveness degrade when the underlying data distribution is skewed. Another approach based on the outlier management can limit the effect of data skews but fails to address other requirements of approximate range aggregate queries, such as error guarantees and query processing efficiency. In this paper, we present a technique that provides approximate answers to range aggregate queries on OLAP data cubes efficiently, with theoretical guarantees on the errors. Our basic idea is to build different data structures to manage outliers and the rest of the data. Carefully chosen outliers are organized in a quad-tree based indexing data structure to provide efficient access for query processing. A query-workload adaptive, tree-like synopsis data structure, called T unable P artition-Tree (TP-Tree), is proposed to organize samples extracted from non-outlier data. Our experiments clearly demonstrate the merits of our technique, by comparing with previous well-known techniques. multidimensional data management; OLAP; approximate query answering;, synopsis data structures
Automatic Application Specific Floating-point Unit Generation (None HERDC)
Y Chong, Y Chong, S Parameswaran, Design, Automation and Test in Europe, K. Preas..
EDAA, 2007, 461-466

This paper describes the creation of custom floating point units (FPUs) for Application Specific Instruction Set Processors (ASIPs). ASIPs allow the customization of processors for use in embedded systems by extending the instruction set, which enhances the performance of an application or a class of applications. These extended instructions are manifested as separate hardware blocks, making the creation of any necessary floating point instructions quite unwieldy. On the other hand, using a predefined FPU includes a large monolithic hardware block with considerable number of unused instructions. A customized FPU will overcome these drawbacks, yet the manual creation of one is a time consuming, error prone process. This paper presents a methodology for automatically generating floating-point units (FPUs) that are customized for specific applications at the instruction level. Generated FPUs comply with the IEEE754 standard, which is an advantage over FP format customization. Custom FPUs were generated for several Mediabench applications. Area savings over a fully-featured FPU without resource sharing of 26%-80% without resource sharing and 33%-87% with resource sharing, were obtained. Clock period increased in some cases by up to 9.5% due to resource sharing.
Automatic Application Specific Floating-Point Unit Generation
Y Chong, S Parameswaran, Design, automation and test in Europe 2007, Proceedings, K. Preas.
EDAA, Leuven, 2007, pp. 461 - 466
Automatic Cognitive Load Detection From Speech Features
M Khawaja, N Ruiz, B Yin, F Chen, OZCHI 2007, Proceedings, M. Billinghurst.
ACM, Adelaide, Australia, 2007, pp. 249 - 255
Benchmark Generation Using Domain Specific Modeling
B Bui, L Zhu, Y Liu, I Gorton, 2007 Australian software engineering conference ASWEC 07, Proceedings, J. Grundy and J. Han.
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 169 - 180
Brand: A New Requirement Aware Rand Based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots
S Jha, Y Rana, 32nd IEEE conference on local computer networks, Proceedings,
IEEE computer society, Washington, DC, USA, 2007, pp. 3 - 9
Breaking Symmetry Of Interchangeable Variables And Values
T Walsh, y law, J Lee, J Yip, Principles and practice of constraint programming, C. Bessiere.
Springer, Germany, 2007, pp. 423 - 437
Breaking Value Symmetry
T Walsh, Principles and practice of constraint programming, C. Bessiere.
Springer Verlag, Heidelberg, D-69121, Germany, Germany, 2007, pp. 880 - 887
Bronchopulmonary Segments Approximation Using Anatomical Atlas
S Busayarat, T Zrimec, Medical Imaging 2007:Image Processing - Proceedings of the SPIE, Volume 6512, J P W Pluim, J M Reinhardt.
SPIE, San Diego, CA, USA, 2007, pp. 651220-1 - 651220-8
Business Process Management: Where Business Processes And Web Services Meet
B Benatallah, F Casati, F Curbera, W van der Aalst, E Verbeek, Data & Knowledge Engineering,
Elsevier Science Bv, Amsterdam, 2007, pp. 1 - 5
Camkes: A Component Model For Secure Microkernel-Based Embedded Systems
G Heiser, I Kuz, Y Liu, I Gorton, Journal of Systems Software,
Elsevier Science Inc, New York, 2007, pp. 687 - 699

Component-based software engineering promises to provide structure and reusability to embedded-systems software. At the same time, microkernel-based operating systems are being used to increase the reliability and trustworthiness of embedded systems. Since the microkernel approach to designing systems is partially based on the componentisation of system services, component-based software engineering is a particularly attractive approach to developing microkernel-based systems. While a number of widely used component architectures already exist, they are generally targeted at enterprise computing rather than embedded systems. Due to the unique characteristics of embedded systems, a component architecture for embedded systems must have low overhead, be able to address relevant non-functional issues, and be flexible to accommodate application specific requirements. In this paper we introduce a component architecture aimed at the development of microkernel-based embedded systems. The key characteristics of the architecture are that it has a minimal, low-overhead, core but is highly modular and therefore flexible and extensible. We have implemented a prototype of this architecture and confirm that it has very low overhead and is suitable for implementing both system-level and application level services. (c) 2006 Elsevier Inc. All rights reserved. component architecture; microkernel; embedded system
Characterising Testing Preorders For Finite Probabilistic Processes
Y Deng, C Morgan, R van Glabbeek, C Zhang, M Hennessy, 22nd Annual IEEE symposium on logic in computer science, Proceedings,
IEEE computer society press, Los Alamitos, USA, 2007, pp. 313 - 322
Circular Trip: An Effective Algorithm For Continuous Knn Queries
Y Yuan, M Cheema, X Lin, Advances in databases: concepts, systems and applications, R. Kotagiri, et al..
Springer, Berlin, Germany, 2007, pp. 863 - 869
Clipper: Counter-Based Low Impact Processor Power Estimation At Run-Time
J Peddersen, S Parameswaran, Proceedings of the ASP-DAC 2006, L. O'Conner.
IEEE, Piscataway, NJ, USA, 2007, pp. 890 - 895
Cluster-Based Forwarding In Delay Tolerant Public Transport Networks
S Ahmed, S Kanhere, 1st IEEE workshop on user mobility and vehicular networks 2007, Proceedings, C. Ahlund and S. Cherkaoui.
IEEE, New York, USA, 2007, pp. 625 - 634
Collaborative Localization For Wireless Sensor Networks
S Jha, M Nawaz, PIMRC 2007, Proceedings, J. Pereira.
IEEE, Athens, Greece, 2007
Conceptual Modeling Of Privacy-Aware Web Service Protocols
R Hamadi, B Benatallah, H Paik, Advanced information systems engineering, J. Krogstie, et al..
Springer, Berlin, Germany, 2007, pp. 233 - 248
Confidential And Secure Broadcast In Wireless Sensor Networks
S Jha, V Sivaraman, D Ostry, J Shaheen, The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communication (PIMRC 2007),
IEEE, Greece, 2007

Wireless sensor networks need broadcast for operations such as software updates, network queries, and command dissemination. Alongside ensuring authenticity of the source and data, keeping the broadcast data secret is vital in certain applications such as battlefield control, emergency response, and natural resource management. In this paper we propose and prototype a mechanism for ensuring confidentiality and authenticity of broadcast data in single-hop networks, and discuss possible extensions to multi-hop settings.
Constraint And Variable Ordering Heuristics For Compiling Configuration Problems
N Narodytska, T Walsh, 20th International joint conference on artificial intelligence, Proceedings, M. Veloso.
AAAI press, CA, USA, 2007, pp. 149 - 154
Constraint And Variable-Ordering Heuristics For Compiling Configuration Problems
N Narodytska, T Walsh, IEEE INTELLIGENT SYSTEMS,
Ieee Computer Soc, Los Alamitos, 2007
Construction Of A Proxy-Based Overlay Skeleton Tree For Large-Scale Real-Time Group Communications
J Guo, S Jha, IFIP Networking 2007, Proceedings, I. Akyldiz, et al..
Springer, Germany, 2007, pp. 726 - 737
Data Cache Locking For Tight Timing Calculations
J Xue, B Lisper, X Vera, ACM transactions on embedded computing systems,
ACM, New York, USA, 2007, pp. 1 - 38
Data Parallel Haskell: A Status Report
M Chakravarty, G Keller, R Leshchinskiy, S Jones, S Marlow, ,
Association for Computing Machinery, New York, NY 10036-5701, United States, 2007, pp. 10 - 18

We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original programming model and its implementation, both of which were first popularised by the NESL language, in terms of expressiveness as well as efficiency. Our current aim is to provide a convenient programming environment for SMP parallelism, and especially multicore architectures. Preliminary benchmarks show that we are, at least for some programs, able to achieve good absolute performance and excellent speedups. Copyright 2007 ACM. Parallel programming, Computational efficiency, Computer architecture, Data reduction, Program compilers, Software design
Database Summarization: The Saintetiq System
R Saint-Paul, N Mouaddib, G Raschia, ICDE 2007, R. Chirkova, et al..
Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, Piscataway, NJ 08855-1331, USA, 2007, pp. 1475 - 1476
Decentralised Data Fusion With Exponentials Of Polynomials
A Blair, B Tonkes, 2007 IEEE/RSJ international conference on intelligent robotics and systems, Proceedings, E. Grant and T. Henderson.
IEEE omnipress, New York, 2007, pp. 3727 - 3732
Decomposing Global Grammar Constraints
T Walsh, C Quimper, Principles and practice of constraint programming, C. Bessiere.
Springer, Germany, 2007, pp. 590 - 604
Deduction, Induction And Beyond In Parametric Logic
E Martin, A Sharma, F Stephan, Induction, algorithmic learning theory, and philosohpy, M. Friend, et al..
Springer, Dordrecht, The Netherlands, 2007
Deriving Sensor Models And Non-Linear Filtering For Exponentials Of Polynomials
A Blair, B Tonkes, 2007 Australasian conference on robotics and automation, Proceedings,
ARAA, 2007
Desiderata For Languages To Be Used In The Definition Of Reference Business Processes
L Zhu, M Staples, L Osterweil, B Simidchieva, International journal of software and informatics,
Institute of software of the Chinese academy of sciences, China, 2007, pp. 37 - 66
Design Methodology For Pipelined Heterogeneous Multiprocessor System
S Parameswaran, S Shee, 44th Design automation conference, Proceedings,
ACM press, New York, USA, 2007, pp. 811 - 816
Design, Analysis, And Implementation Of A Novel Low Complexity Scheduler For Joint Resource Allocation
S Jha, S Kanhere, F Sabrina, IEEE Transactions on Parallel and Distributed Systems,
Ieee Computer Soc, Los Alamitos, 2007, pp. 749 - 762

Over the past decade, the problem of fair bandwidth allocation among contending traffic flows on a link has been extensively researched. However, as these flows traverse a computer network, they share different kinds of resources ( e. g., links, buffers, router CPU). The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a specific resource. Moreover, conventional resource scheduling algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present a novel scheduler called the Composite Bandwidth and CPU Scheduler ( CBCS), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. CBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing times of the incoming data packets. Analytically, we prove that CBCS is efficient, with a per-packet work complexity of O(1). Finally, we present simulation results and experimental outcomes from a real-world implementation of CBCS on an Intel IXP 2400 network processor. Our results highlight the improved performance achieved by CBCS and demonstrate the ease with which it can be implemented on off-the-shelf hardware. packet-switched networks; distributed applications;, microprocessor/microcomputer applications; scheduling
Design, Analysis, And Implementation Of A Novel Multiple Resource Scheduler
S Jha, S Kanhere, F Sabrina, IEEE Transactions on Computers,
Ieee Computer Soc, Los Alamitos, 2007, pp. 1071 - 1086

Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multiple traffic flows has been extensively researched. However, as these flows traverse a computer network, they share many different kinds of resources, such as links, buffers, and router CPU. The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a single specific resource such as link bandwidth. In this paper, we present a novel scheduler, called Prediction-based Composite Fair Queuing (PCFQ), which jointly allocates the fair share of the link bandwidth and processing resources to all competing flows. We derive the worst-case delay bound, the work complexity, and the relative fairness bound for the PCFQ scheduler and show that it outperforms a system consisting of separate bandwidth and CPU schedulers. We further present simulation results which illustrate the improved performance characteristics achieved by PCFQ. We also demonstrate that our composite scheduler can be easily implemented on an off-the-shelf network processor such as the Intel IXP 2400. Experimental results from the IXP 2400 implementation highlight the effectiveness and high performance of this algorithm in a real-world system. packet-switched networks; microprocessor/microcomputer applications;, scheduling and synchronization
Detecting Unattended Packages Through Human Activity Recognition And Object Association
J Zhang, D Feng, S Lu, Pattern recognition,
Elsevier Science, New York, USA, 2007, pp. 2173 - 2184
Detection And Tracking Using Wireless Sensor Networks
T Bokareva, Y Dong, N Ahmed, S Jha, S Kanhere, T Bessell, N Gordon, B Ristic, M Rutten, SenSys 07, P. Gibbons and A. Ledeczi.
ACM, New York, 2007, pp. 425 - 426
Detection Of Bronchopulmonary Segments On High-Resolution Ct - Preliminary Results
S Busayarat, T Zrimec, Proceedings of the 20th IEEE International Symposium on Computer-based Medical Systems, Peter Kokol.
IEEE Computer Society, Washington DC, USA, 2007, pp. 199 - 204
Distance Constraints In Constraint Satisfaction
T Walsh, E Hebrard, B O'Sullivan, 20th International joint conference on artificial intelligence, Proceedings, M. Veloso.
AAAI press, CA, USA, 2007, pp. 106 - 111
Distance-Based Local Geocasting In Multi-Hop Wireless Networks
Q Chen, M Hassan, S Kanhere, Y Rana, 2007 IEEE communications and networking conference, Proceedings, R. Murch.
IEEE, Piscataway, NJ, USA, 2007, pp. 4077 - 4082
Effect Of Sintering Conditions On The Formation Of Single-Phase Ndmgni4 Compound And Its Hydrogen Storage Properties
Z Wang, R Zou, Q Yao, H Zhou, Journal of Alloys and Compounds,
Elsevier Science Sa, Lausanne, 2007, pp. 260 - 263

Effects of different sintering conditions on the formation of single-phase NdMgNi4 compound and its electrochemical properties have been investigated. XRD analysis shows that an ideal single-phase compound of NdMgNi4 can be synthesized by sintering the pressed tablets of mixture of Mg, Ni and NdNi powders under 973 K for 5 h; single-phase compounds of REMgNi4 (RE = La, Ce, Pr) can be synthesized in this way as well. The electrochemical properties were measured by simulated battery tests. The maximum discharge capacity of NdMgNi4 compound was about 200 mAh/g, and just 78 mAh/g for CeMgNi4 compound. NdMgNi4 compound could store 3.5 H/M of hydrogen under 2.5 MPa at 298 K, whilst it is difficult to absorb hydrogen at a higher temperature (473 K). (c) 2006 Published by Elsevier B.V. REMgNi4; ball milling; sintering; discharge capacity; hydrogenation
Effective Use Of Transposition Tables In Stochastic Game Tree Search
J Veness, A Blair, 2007 IEEE symposium on computational intelligence and games, Proceedings, A. Blair, et al..
IEEE omnipress, Madison, WI, USA, 2007, pp. 112 - 116
Effectiveness Of Methods For Syntactic And Semantic Recognition Of Numeral Strings: Tradeoffs Between Number Of Features And Length Of Word N-Grams
K Min, W Wilson, B Kang, AI2007: Advances in artificial intelligence, M. Orgun and J. Thornton.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 445 - 455

This paper describes and compares the use of methods based on Ngrams (specifically trigrams and pentagrams), together with five features, to recognise the syntactic and semantic categories of numeral strings representing money, number, date, etc., in texts. The system employs three interpretation processes: word N-grams construction with a tokeniser; rule-based processing of numeral strings; and N-gram-based classification. We extracted numeral strings from 1,111 online newspaper articles. For numeral strings interpretation, we chose 112 (10%) of 1,111 articles to provide unseen test data (1,278 numeral strings), and used the remaining 999 articles to provide 11,525 numeral strings for use in extracting N-gram-based constraints to disambiguate meanings of the numeral strings. The word trigrams method resulted in 83.8% precision, 81.2% recall ratio, and 82.5% in F-measurement ratio. The word pentagrams method resulted in 86.6% precision, 82.9% recall ratio, and 84.7% in F-measurement ratio. © Springer-Verlag Berlin Heidelberg 2007. Syntactics, Data reduction, Natural language processing systems, Number theory, Numerical methods, Semantics
Efficient Detection Of Diffuse Lung Disease (None HERDC)
J Wong, T Zrimec, Medical imaging 2007, Computer-aided diagnosis, M. Giger and N. Karssemeijer.
SPIE, Bellingham WA, WA 98227-0010, United States, Bellingham WA, WA 98227-0010, United States, 2007, pp. 651425 - 651431

Automated methods of detecting lung disease typically involve the following: 1) Subdividing the lung into small regions of interest (ROIs). 2) Calculating the features of these small ROIs. 3) Applying a machine learnt classifier to determine the class of each ROI. When the number of features that need to be calculated is large, as in the case of filter bank methods or in methods calculating a large range of textural properties, the classification can run quite slowly. This is even more noticeable when a number of disease patterns are considered. In this paper, we investigate the possibility of using a cascade of classifiers to concentrate the processing power on promising regions. In particular, we focused on the detection of the honeycombing disease pattern. We used knowledge of the appearance and the distribution of honeycombing to selectively classify ROIs. This avoids the need to explicitly classify all ROIs in the lung; making the detection process more efficient. We evaluated the performance of the system over 42 HRCT slices from 8 different patients and show that the system performs the task of detecting honeycombing with a high degree of accuracy (accuracy = 86.2%, sensitivity = 90.0%, specificity = 82.2%). Medical imaging, Computer aided diagnosis, Filter banks, Honeycomb structures, Patient treatment, Pattern recognition, Pulmonary diseases
Efficient Geometric Routing In Ad-Hoc Wireless Networks
V Chhieng, R Choi, R Wong, 2007 4th Consumer communiation and networking conference, Proceedings, W. Zeng.
IEEE, Piscataway, NJ, USA, 2007, pp. 259 - 263
Efficient Method For Detecting Ghost And Left Objects In Surveillance Video
J Zhang, D Feng, S Lu, 2007 IEEE International conference on advanced video and signal-based surveillance, Proceedings,
IEEE, USA, 2007
Efficient Processing Of Branch Queries For High-Performance Xml Filtering
R Choi, R Wong, 2nd International conference on scalable information systems, Proceedings,
ACM, USA, 2007
Eleven Programmers, Seven Artists And Five Kilograms Of Play-Doh: Games For Teaching Games Design
M Ryan, 2007 Australasian conference on interactive entertainment, Proceedings, M. Gibbs and Y. Pasan.
RMIT, Melbourne, Australia, 2007
Encodings Of The Sequence Constraint
N Narodytska, T Walsh, S Brand, C Quimper, P Stuckey, Principles and practice of constraint programming 2007, Proceedings, C. Bessiere.
Springer, Germany, 2007, pp. 210 - 224
End-To-End Privacy Control In Service Outsourcing Of Human Intensive Processes: A Multi-Layered Web Service Integration Approach
R Wong, V Cheng, W Cheung, D Chiu, S Choi, W Fung, P Hung, E Kafeza, J Kwok, J Pun, Information Systems Frontiers,
Springer, Dordrecht, 2007, pp. 85 - 101

With the recent adoption of service outsourcing, there have been increasing general demands and concerns for privacy control, in addition to basic requirement of integration. The traditional practice of a bulk transmission of the customers` information to an external service provider is no longer adequate, especially in the finance and healthcare sectors. From our consultancy experience, application-to-application privacy protection technologies at the middleware layer alone are also inadequate to solve this problem, particularly when human service providers are heavily involved in the outsourced process. Therefore, we propose a layered architecture and a development methodology for enforcing end-to-end privacy control policies of enterprises over the export of personal information. We illustrate how Web services, augmented with updated privacy facilities such as Service Level Agreement (SLA), Platform for Privacy Preferences Project (P3P), and the P3P Preference Exchange Language (APPEL), can provide a suitable interoperation platform for service outsourcing. We further develop a conceptual model and an interaction protocol to send only the required part of a customer`s record at a time. We illustrate our approach for end-to-end privacy control in service outsourcing with a tele-marketing case study and show how the software of the outsourced call center can be integrated effectively with the Web services of a bank to protect privacy. Web service integration; privacy policies; need-to-know principle;, layered architecture; SLA; P3P; APPEL
Energy Driven Application Self-Adaptation At Run-Time
J Peddersen, S Parameswaran, 20th international conference on VLSI design/6th international conference on Embedded systems, Proceedings, L. O'Conner.
IEEE, Los Alamitos, CA, USA, 2007, pp. 385 - 390
Enhancing Web Services Performance Using Adaptive Quality Of Service Management
A Erradi, P Maheshwari, Web information systems engineering---WISE 2007, B. Benatallah, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 349 - 360

The variation of contexts in which a Web service could be used and the resulting variation in Quality of Service (QoS) requirements motivates further research to extend Web services management platforms with automatic and adaptive management mechanisms in order to achieve differentiated service offerings and to improve quality of service in terms of availability, response time and throughput. However, most Web services platforms are based on a best-effort model, which treats all requests uniformly, without service differentiation. This paper presents WS-DiffServ, a service differentiation middleware based on adaptive scheduling of service requests that prioritizes requests depending on their associated class of service and the current degree of service level conformance. The goal of the proposed approach is to increase conformance to negotiated service levels particularly in case of overloads such that me incurred penalties for violations are minimized. The paper first explores the typical requirements of a differential QoS support for Web services. We then present the design of WS-DiffServ. The effectiveness of the proposed approach is analyzed using supply chain management scenarios. © Springer-Verlag Berlin Heidelberg 2007. Web services, Adaptive systems, Middleware, Quality of service, Response time (computer systems)
Ensuring Area Coverage In Hybrid Wireless Sensor Networks
N Ahmed, S Jha, S Kanhere, 3rd International conference on mobile, ad-hoc and sensor networks, Proceedings, H. Zhang and S. Olariu.
Springer Verlag, Heidelberg, D-69121, Germany, Germany, 2007, pp. 548 - 560

Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed protocol for ensuring area coverage using a combination of mobile and static sensor nodes. Most of the assumptions made in our approach are realistic (sensing model, movement thresholds based on real radio characteristics etc.) and implementable in real-life applications. We demonstrate that, for different type of initial deployments, our proposed movement algorithms consume only 30-40% of the energy consumed by the basic virtual force algorithm. We formulated our problem as Integer Linear Program to arrive at idealistic optimal solutions that form basis of our performance comparison. We validated our results through extensive discrete event simulations. © Springer-Verlag Berlin Heidelberg 2007. Wireless sensor networks, Electric power utilization, Mathematical models, Mobile telecommunication systems, Network management, Network protocols, Virtual reality
Ensuring Secure Program Execution In Multiprocessor Embedded Systems: A Case Study
K Patel, S Parameswaran, S Shee, CODES + ISSS 2007, N. Dutt, and J. Teich.
ACM, New York, USA, 2007, pp. 57 - 62
Error Minimization In Approximate Range Aggregates
Q Liu, Y Yuan, Q Zhang, X Lin, Data & Knowledge Engineering,
, 2007, pp. 156 - 176

Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to support approximation of query processing especially aggregates. In this paper, we investigate the problem of minimizing average errors of approximate aggregates using histogram techniques. Firstly, we present a novel linear-spline histogram model that is more accurate than the existing models. Secondly, we propose a novel histogram construction technique for minimizing such average errors, which is shown to generate a near optimal histogram. Our experiment results demonstrate that the new histogram construction techniques lead to a great accuracy improvement on the existing techniques. © 2006 Elsevier B.V. All rights reserved. Error analysis, Approximation theory, Data reduction, Database systems, Optimization, Problem solving
Esp: A Logic Of Only-Knowing, Noisy Sensing And Acting
A Gabaldon, G Lakemeyer, 22nd AAAI Conference on Artificial Intelligence,
American Association for Artificial Intelligence, Menlo Park, CA 94025-3496, United States, USA, 2007, pp. 974 - 979

When reasoning about actions and sensors in realistic domains, the ability to cope with uncertainty often plays an essential role. Among the approaches dealing with uncertainty, the one by Bacchus, Halpern and Levesque, which uses the situation calculus, is perhaps the most expressive. However, there are still some open issues. For example, it remains unclear what an agent`s knowledge base would actually look like. The formalism also requires second-order logic to represent uncertain beliefs, yet a first-order representation clearly seems preferable. In this paper we show how these issues can be addressed by incorporating noisy sensors and actions into an existing logic of only-knowing. Copyright © 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Logic programming, Acoustic resonators, Knowledge based systems, Uncertain systems, Uncertainty analysis
Establishing And Maintaining Trust In Software Outsourcing Relationships: An Empirical Investigation
M Ali Babar, J Verner, Journal of Systems Software,
Elsevier, The Netherlands, 2007, pp. 1438 - 1449

Our research objective is to understand software outsourcing practitioners` perceptions of the role of trust in managing client-vendor relationships and the factors that are critical to trust in off-shore software outsourcing relationships. Participants were 12 Vietnamese software development practitioners developing software for Far Eastern, European, and American clients. They identified that cultural understanding, creditability, capabilities, and personal visits are important factors in gaining the initial trust of a client, while cultural understanding, communication strategies, contract conformance, and timely delivery are vital factors in maintaining that trust. We contrast Vietnamese and Indian practitioners` views on factors affecting trust relationships. © 2006 Elsevier Inc. All rights reserved. Computer software, Client server computer systems, Outsourcing, Process control, Software prototyping
Evolving Strategies For Software Architecture And Reuse
M Staples, J Nedstam, Software process: improvement and practice,
John Wiley and sons, 2007, pp. 295 - 309
Exact Xml Type Checking In Polynomial Time
S Maneth, T Perst, H Seidl, Database theory---ICDT 2007, T. Schwentick and D. Suciu.
Springer, Berlin/Heidelberg, 2007, pp. 254 - 268
Experience Using Systematic Review Guidelines
M Staples, M Niazi, Journal of Systems and Software,
Elsevier, 2007, pp. 1425 - 1437
Experiences In Deploying A Wireless Mesh Network Testbed For Traffic Control
M Hassan, R Berriman, K Lan, L Libman, Z Zaidi, ACM SIGCOMM computer communications review,
ACM, New York, 2007, pp. 19 - 28
Exploiting Speech-Gesture Correlation In Multimedia Interaction
N Wang, F Chen, E Choi, Human Computer Interaction HCI Intelligent Multimodel Interaction, Julie A. Jacko.
Springer, Germany, 2007, pp. 23 - 30
Extending The Capabilities If Component Models For Embedded Systems
I Kuz, Y Liu, LNCS 4880: software architectures, components, and applications, S. Overhage, et al..
Springer-Verlag, Heidelberg, 2007, pp. 182 - 196
Extracting Terrain Features From Range Images For Autonomous Random Stepfield Traversal
M Kadous, C Sammut, R Sheh, B Hengst, SSRR 2007, Proceedings, R. Voyles, et al..
IEEE, Rome, Italy, 2007, pp. 1 - 6
Fairness Control By Mobile Routers In On-Board Communication Networks
A Baig, M Hassan, L Libman, Proceedings of the 65th IEEE Vehicular Technology Conference, VTC Spring 2007,
Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2007, pp. 753 - 757

Communication solutions for passengers on public transport vehicles, in the form of on-board networks connected to the Internet via a mobile router (MR) and a wireless link, are increasingly offered by public transport providers in many countries. An important challenge in such networks is to guarantee a fair access to the scarce wireless bandwidth by all on-board users, particularly in networks with multiple wireless interfaces. Accordingly, we consider an active fairness control scheme, where the MR transparently overrides the TCP advertised receiver window size to limit the transmission rates of on-board TCP connections to their fair share. We focus on the overhead that this scheme places on the mobile router and the wireless interface, due to the need for the MR to estimate the round-trip time (RTT) of each on-board connection. We investigate the performance of three strategies that differ in the timing of RTT estimations, and show that a fairness target-based strategy, which continuously monitors the ongoing fairness index and invokes an RTT reestimation whenever it drops below a predetermined value, consistently achieves a significant improvement in fairness for only a mild overhead cost. � 2007 IEEE. Mobile telecommunication systems, Bandwidth, Interfaces (computer), Parameter estimation, Routers, Telecommunication networks
Fast Code-Phase Alignment Of Gps Signals Using Virtex-4 Fpgas
M Malik, A Dempster, O Diessel, Proceedings of IGNSS2007, Dempster.
IGNSS Society, Sydney, 2007, p. paper 105

This paper describes a Virtex-4 based system for aligning the code-phase of a received GPS signal. The core operation involves a multiplication of the received signal with a local replica of the code followed by integration of all possible alignments within the period of one code epoch. A speedup proportional to the code length is thus achieved. We outline the proposed system, which stores the code in on-chip memory blocks and uses both dedicated DSP hardware and user logic to perform MAC operations in parallel. We study area, time and energy usage as the ratio of user logic to custom blocks is varied and identify a design point and corresponding device size for which energy usage is minimized. GPS, phase, alignment, FPGA.
Feasibility Study Of Using Mobile Gateways In Public Transportation Vehicles For Its Applications
S Iskander, G Setiwan, Z Wu, S Kanhere, K Lan, 3rd international workshop on vehicle-to-vehicle communications, Proceedings, O. Altintas.
IEEE, New York, 2007
Fine-Grained Compatibility And Replaceability Analysis Of Timed Web Service Protocols
B Benatallah, F Casati, J Ponge, F Toumani, Conceptual modeling---ER 2007, C. Parent, et al..
Springer, Heidelberg, 2007, pp. 599 - 614
Forgetting In Logic Programs With Ordered Disjunctions
N Foo, C Wu, M Zhang, AI 2007: advances in artificial intelligence, M. Orgun and J. Thornton.
Springer Verlag, Berlin, 2007, pp. 254 - 262
Formalizing Xml Access Control For Update Operations
S Maneth, I Fundulaki, SACMAT 2007, Proceedings, V. Lotz and B. Thuraisingham.
ACM, New York, 2007, pp. 169 - 174
From Backpack To Handheld: The Recent Trajectory Of Personal Location Aware Spatial Audio
N Mariette, PerthDAC 2007: 7th digital arts and culture conference, Proceedings, A. Hutchison.
Curtin University of Technology, Perth, Australia, 2007, pp. 233 - 240
Gene Expression Profiles Associated With Osteogenesity And/Or Tumorigenesis In Representative Osteosarcoma Cell Lines
J Chen, F Luk, W Walsh, J Yang, Y Yu, Bone,
Elsevier Science Inc, New York, 2007, p. S172
Goanna - A Static Model Checker
A Fehnker, R Huuck, F Rauch, Formal Methods: Applications and Technology, Lubos Brim.
Springer Verlag, Heidelberg, D-69121, Germany, Berlin, Germany, 2007, pp. 297 - 300

In this work we present Goanna, the first tool that uses an off-the-shelf model checker for the static analysis of C/C++ source code. We outline its architecture and show how syntactic properties can be expressed in CTL. Once the properties have been defined the tool analyses source code automatically and efficiently. We demonstrate its applicability by presenting experimental results on analysing OpenSSL and the GNU coreutils. © Springer-Verlag Berlin Heidelberg 2007. Model checking, Computer aided software engineering, Software architecture, Static analysis, Syntactics
Graph Decomposition For Multi-Robot Path Planning
M Ryan, 20th international conference on artificial intelligence, Proceedings, M. Veloso.
AAAI press, CA, USA, 2007, pp. 2003 - 2008
High-Performance Microkernels And Virtualisation On Arm And Segmented Architectures
G Heiser, C van Schaik, 1st international workshop on microkernels for embedded systems MIKES 2007, Proceedings,
NICTA, Australia, Sydney, Australia, 2007, pp. 11 - 21
High-Resolution Multi-Sprite Generation For Background Sprite Coding
G Ye, Lecture Notes in Computer Science, Gerhard Goos, et al.
Springer, 2007, pp. 756 - 767
Hype And Virtue
K Elphinstone, G Heiser, T Roscoe, 11th Workshop on Hot Topics in operating systems, proceedings,
usenix on line, san diego, 2007
Identifying Domain Context For The International Modelling Technique Map
A Babar, S Bleistein, V Tosic, J Verner, K Cox, DEXA 2007, A. Tjoa and R. Wagner.
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 835 - 839
Ihmmune-Align: Hidden Markov Model-Based Alignment And Identification Of Germline Genes In Rearranged Immunoglobulin Gene Sequences
K Jackson, M Bain, A Collins, B Gaeta, H Malming, P Wilson, Bioinformatics,
Oxford Univ Press, Oxford, 2007, pp. 1580 - 1587

Motivation: Immunoglobulin heavy chain (IGH) genes in mature B lymphocytes are the result of recombination of IGHV, IGHD and IGHJ germline genes, followed by somatic mutation. The correct identification of the germline genes that make up a variable VH domain is essential to our understanding of the process of antibody diversity generation as well as to clinical investigations of some leukaemias and lymphomas. Results: We have developed iHMMune-align, an alignment program that uses a hidden Markov model (HMM) to model the processes involved in human IGH gene rearrangement and maturation. The performance of iHMMune-align was compared to that of other immunoglobulin gene alignment utilities using both clonally related and randomly selected IGH sequences. This evaluation suggests that iHMMune-align provides a more accurate identification of component germline genes than other currently available IGH gene characterization programs.
Impacts Of Architecture And Quality Investment In Software Product Line Development
L Zhu, M Staples, M Babar, M Nonaka, SPLC 2007 Proceedings, Tomoji Kishi, Dirk Muthig.
IEEE Computer Society, Los Alamitos, CA, UNSW, 2007, pp. 63 - 73
Implementation Of A Wireless Mesh Network Testbed For Mission Critical Infrastructure
M Hassan, T Moors, Z Wang, K Lan, ACM,
Assoc Computing Machinery, USA, 2007, pp. 19 - 28

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centered around maximization of available bandwith, suitable for non-real-time applications such as Internet access for general public. Wireless mesh network, traffic control, deployment
Implementation Of A Wireless Mesh Network Testbed For Mission-Critical Infrastructure
Z Wang, ACM SIGCOMM 2007,
ACM press, Tokyo, Japan, 2007, pp. 1 - 2
Implementation Of A Wireless Mesh Network Testbed For Traffic Control
M Hassan, T Moors, Z Wang, Proceedings-16th International Conference on Computer Communications and Networks, Xiaobo Zhou, Giuseppe Anastasi.
IEEE, Piscataway, NJ, 2007, pp. 1022 - 1027

Wireless mesh networks (WMN) have attracted considerable interest in recent years as a convenient, flexible and low-cost alternative to wired communication infrastructures in many contexts. However, the great majority of research on metropolitan-scale WMN has been centred around maximization of available bandwith, suitable for non-real-time applications such as Internet access for the general public. On the other hand, the suitability of WMN for mission-critical infrastructure applications remains by and large unknown, as protocol typically employed in WMN are, for the most part, not designed for real time communications.
Implementing Iterated Belief Change Via Prime Implicates
Z Zhuang, T Meyer, M Pagnucco, 20th Australian joint conference on artificial intelligence, Proceedings, M. Orgun and J. Thornton.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 507 - 518
Improving Computer Aided Detection By Using Knowledge About Disease Appearance
J Wong, T Zrimec, Proceedings of the 12th World Conference on Health Informatics, Evelyn Hovenga.
IOS Press, Netherlands, 2007, pp. 830 - 833
Incompleteness And Incomparability In Preference Aggregation
T Walsh, M Pini, F Rossi, K Venable, 20th International joint conference on artificial intelligence, Proceedings, M. Veloso.
AAAI press, CA, USA, 2007, pp. 1464 - 1469
Incremental Lock Selection For Composite Objects
A Shanneb, J Potter, Journal of object technology,
ETH Zurich, Zurich, 2007, pp. 477 - 494
Instruction Trace Compression For Rapid Instruction Cache Simulation
A Janapsatya, A Ignjatovic, S Parameswaran, J Henkel, DATE 07, Kathy Preas.
Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, 2007, pp. 803 - 808

Modern Application Specific Instruction Set Processors (ASIPs) have customizable caches, where the size, associativity and line size can all be customized to suit a particular application. To find the best cache size suited for a particular embedded system, the applications) is/are executed, traces obtained, and caches simulated. Typically, program trace files can range from a few megabytes to several gigabytes. Simulation of cache performance using large program trace files is a time consuming process. In this paper, a novel instruction cache simulation methodology that can operate directly on a compressed program trace file without the need for decompression is presented. This feature allowed our simulation methodology to have an average speed up of 9.67 times compared to the existing state of the art tool (Dinero IV cache simulator), for a range of applications from the Mediabench suite. © 2007 EDAA. Data compression, Buffer storage, Computer simulation, Embedded systems
Integrating Semantics Into Multimodal Interactions Patterns
N Ruiz, R Taib, Machine learning for multimodal interaction, Proceedings, A. Popescu-Belis, et al..
Springer-Verlag, Berlin, 2007, pp. 96 - 107
Intelligent Support For Building Knowledge Bases For Natural Language Processing
S Pham, A Hoffmann, Intelligent assistant system, R. Kaschek.
Idea group publishing, London, 2007
Interdisciplinary Educational Collaborations: Chemistry And Computer Science
E Ngan, W Pak, R Haines, B Hudson, J Mori, D Woo, Journal of Chemical Education,
Amer Chemical Soc, Washington, 2007, pp. 967 - 970
Interprocedural Side-Effect Analysis For Incomplete Object-Oriented Software Modules
P Nguyen, J Potter, J Xue, Journal of Systems Software,
Elsevier, The Netherlands, 2007, pp. 92 - 105

We introduce a new approach to computing interprocedural modification side effects for part of an object-oriented program (e.g., components, libraries or client modules). Our approach consists of first performing a whole-program points-to analysis to such an incomplete program and then applying a so-called mutability analysis (MA) to determine which objects in the program are mutable by unknown code and which references and call sites in the program are complete (since their points-to sets and target methods are statically resolvable). Based on these results, we present a new MA-based interprocedural side-effect analysis for computing the modification side-effects for an incomplete program. Our experimental results show that our mutability analysis enables a variety of pure methods to be detected, yielding the purity information useful in program understanding and debugging. In addition, our MA-based side-effect analysis enables more redundant loads to be removed than a recent TBAA-based PRE algorithm guided by type-based alias analysis (TBAA). Our approach is simple since it is flow-insensitive and achieves these improvements at small costs. © 2006 Elsevier Inc. All rights reserved. Object oriented programming, Computer software, Computation theory, Modification, Information analysis, Redundancy
Invariant Features Of Local Textures (Iflt)---A Rotation Invariant Local Texture Descriptor
P Settisara Janney, Z Yu, IEEE conference on computer vision and pattern recognition 2007, Proceedings, S. Baker, et al..
IEEE, USA, 2007
Issues On Analysing L4 For Its Wcet
S Petters, M Singal, 1st international workshop on microkernels for embedded systems MIKES 2007, Proceedings,
NICTA, Sydney, Australia, 2007, pp. 58 - 63
Itkboard: A Visual Dataflow Language For Biomedical Image Processing
J Potter, H Le, R Li, S Ourselin, ICSOFT 2007, J. Filipe, et al..
INSTICC press, Portugal, 2007, pp. 13 - 21
Knowledge Transformation For Education In Software Engineering
A Aurum, C Kutay, International journal of mobile learning and orgnanisation, J. Chen.
Inderscience, USA, 2007, pp. 58 - 80
Lazy Queuing And Direct Process Switch---Merit Of Myths?
D Greenaway, K Elphinstone, S Ruocco, 2007 workshop on operating systems platforms for embedded real-time applications, Proceedings, S. Brandt and K. Elphinstone.
NICTA, Australia, Sydney, Australia, 2007, pp. 69 - 77
Learning A Plan In The Limit
P Caldon, E Martin, Logical formalizations of commonsense reasoning, E. Amir, V. Lifschitz, R. Miller.
AAAI press, Menlo Park, CA, USA, 2007, pp. 25 - 34
Learning From Ontological Annotation: An Application Of Formal Concept Analysis To Feature Construction In The Gene Ontology
E Akand, M Bain, Advances in ontologies 2007, T. Meyer and A. Nayak.
Australian computer society, Adelaide, 2007, pp. 9 - 17
Level Learning Set: A Novel Classifier Based On Active Contour Models
X Cai, A Sowmya, Machine learning: ECML 2007, J. Kok, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Berlin/Heidelberg, 2007, pp. 79 - 90

This paper presents a novel machine learning algorithm for pattern classification based on image segmentation and optimisation techniques employed in active contour models and level set methods. The proposed classifier, named level learning set (LLS), has the ability to classify general datasets including sparse and non sparse data. It moves developments in vision segmentation into general machine learning by utilising and extending level set-based active contour models from the field of computer vision to construct decision boundaries in any feature space. This model has advantages over traditional classifiers in its ability to directly construct complex decision boundaries, and in better knowledge representation. Various experimental results including comparisons to existing machine learning algorithms are presented, and the advantages of the proposed approach are discussed. © Springer-Verlag Berlin Heidelberg 2007. Learning systems, Algorithms, Image segmentation, Optimization, Pattern recognition
Lipocalin-2 Is An Inflammatory Marker Closely Associated With Obesity, Insulin Resistance, And Hyperglycemia In Humans
J Xu, J Xu, J Zhang, E Kraegen, Y Wang, W Chow, R Hoo, K Lam, G Sweeney, A Tso, N Wat, A Xu, Clinical Chemistry,
Amer Assoc Clinical Chemistry, Washington, 2007, pp. 34 - 41

Background: Lipocalin-2, a 25-kDa secreted glycoprotein, is a useful biomarker for early detection of various renal injuries. Because lipocalin-2 is abundantly expressed in adipose tissue and liver, we investigated its relevance to obesity-related pathologies. Methods: We used real-time PCR and in-house immunoassays to quantify the mRNA and serum concentrations of lipocalin-2 in C57BL/KsJ db/db obese mice and their age- and sex-matched lean littermates. We analyzed the association between serum lipocalin-2 concentrations and various metabolic and inflammatory variables in 229 persons (121 men and 108 women) recruited from a previous cross-sectional study, and we evaluated the effect of the insulin-sensitizing drug rosiglitazone on serum lipocalin-2 concentrations in 32 diabetic patients (21 men and 11 women). Results: Compared with the lean littermates, lipocalin-2 mRNA expression in adipose tissue and liver and its circulating concentrations were significantly increased in db/db diabetic/obese mice (P < 0.001). These changes were normalized after rosiglitazone treatment. In humans, circulating lipocalin-2 concentrations were positively correlated (P < 0.005) with adiposity, hypertriglyceridemia, hyperglycemia, and the insulin resistance index, but negatively correlated (P = 0.002) with HDL cholesterol. There was also a strong positive association between lipocalin-2 concentrations and high sensitivity C-reactive protein (hs-CRP), independent of age, sex, and adiposity (P = 0.007). Furthermore, rosiglitazone-mediated decreases in lipocalin-2 concentrations correlated significantly with increases in insulin sensitivity (r = 0.527; P = 0.002) and decreases in hs-CRP concentrations (r = 0.509; P = 0.003). Conclusions: Lipocalin-2 is an inflammatory marker closely related to obesity and its metabolic complications. Measurement of serum lipocalin-2 might be useful for evaluating the outcomes of various clinical interventions for obesity-related metabolic and cardiovascul
Local Approxiamtions Based On Orthogonal Differential Operators
A Ignjatovic, Journal of Fourier analysis and applications,
Birkhauser, Boston, USA, 2007, pp. 309 - 330
Localized Minimum-Latency Broadcasting In Multi-Rate Wireless Mesh Networks
J Lim, C Chou, J Qadir, A Misra, 8th IEEE international symposium on a world of wireless, mobile and multimedia networks, Proceedings, G. Bianchi and S. Choi.
IEEE, Piscataway, NJ, USA, 2007
Long-Term Trajectory Extraction For Moving Vehicles
J Xu, G Ye, J Zhang, MMSP 2007, P. Maragos, et. al..
IEEE, Los Alamitos, California, 2007, pp. 223 - 226
Loop Recreation For Thread-Level Speculation
L Li, G Lin, J Xue, T Ngai, 2007 international conference on parallel and distributed systems, Proceedings, C. King.
IEEE computer society, 2007, pp. 1 - 10
Lung Surface Classification On High-Resolution Ct Using Machine Learning
S Busayarat, T Zrimec, Proceedings of the 11th Mediterranean conference on medical and biological engineering and computing, Tomaz Jarm.
Springer, New York, 2007, pp. 822 - 825
Managing Impacts Of Security Protocol Changes In Service-Oriented Applications
B Benatallah, F Casati, H Skogsrud, F Toumani, ICSE 07: International conference on software engineering, M. Cohen.
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 468 - 477
Masc - .Net-Based Middleware For Adaptive Composite Web Services
A Erradi, P Maheshwari, V Tosic, 2007 IEEE International Conference on Web Services, Proceedngs of, W. Zanney, et al..
IEEE Computer Society, Los Alamitos, California, USA, 2007, pp. 727 - 734
Mdabench: Customized Benchmark Generation Using Mda
L Zhu, Y Liu, N Bui, I Gorton, Journal of Systems and Software,
Elsevier, 2007, pp. 265 - 282

This paper describes an approach for generating customized benchmark suites from a software architecture description following a Model Driven Architecture (MDA) approach. The benchmark generation and performance data capture tool implementation (MDABench) is based on widely used open source MDA frameworks. The benchmark application is modeled in UML and generated by taking advantage of the existing community-maintained code generation `cartridges` so that current component technology can be exploited. We have also tailored the UML 2.0 Testing Profile so architects can model the performance testing and data collection architecture in a standards compatible way. We then extended the MDA framework to generate a load testing suite and automatic performance measurement infrastructure. This greatly reduces the effort and expertise needed for benchmarking with complex component and Web service technologies while being fully MDA standard compatible. The approach complements current model-based performance prediction and analysis methods by generating the benchmark application from the same application architecture that the performance models are derived from. We illustrate the approach using two case studies based on Enterprise JavaBean component technology and Web services. © 2006 Elsevier Inc. All rights reserved. Computer architecture, Codes (symbols), Computer programming languages, Computer software, Java programming language, Standardization, World Wide Web
Measurements Or Static Analysis Or Both?
G Heiser, S Petters, P Zadarnowski, 7th Workshop on worst-case execution-time analysis, Proceedings, C. Rochange.
IRIT, France, Toulouse, France, 2007, pp. 5 - 11
Measuring Anonymity With Relative Entropy
Y Deng, J Pang, P Wu, Formal aspects in security and trust, T. Dimitrakos, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 65 - 79

Anonymity is the property of maintaining secret the identity of users performing a certain action. Anonymity protocols often use random mechanisms which can be described probabilistically. In this paper, we propose a probabilistic process calculus to describe protocols for ensuring anonymity, and we use the notion of relative entropy from information theory to measure the degree of anonymity these protocols can guarantee. Furthermore, we prove that the operators in the probabilistic process calculus are non-expansive, with respect to this measuring method. We illustrate our approach by using the example of the Dining Cryptographers Problem. © Springer-Verlag Berlin Heidelberg 2007. Entropy, Information theory, Network protocols, Probabilistic logics, Problem solving
Methods For Automatic Honeycombing Detection In Hrct Images Of The Lung
S Busayarat, T Zrimec, Proceedings of the 11th Mediterranean conference on medical and biological engineering and computing, D Miklavcic, T Jarm.
Springer, New York, 2007, pp. 830 - 833
Misleading Metrics And Unsound Analyses
D Jeffery, B Kitchenham, C Connaughton, IEEE Software,
IEEE, 2007, pp. 77 - 78
Mitigation Of Binaurial Front-Back Confusions By Body Motion In Audio Augmented Reality
N Mariette, 13th international conference on auditory display, Proceedings, W. Martens and R. Quesnel.
Schulich school of music, McGill university, Montreal, Canada, 2007, pp. 38 - 44
Mixup: A Development And Runtime Environment For Integration At The Presentation Layer
B Benatallah, R Saint-Paul, J Yu, F Casati, F Daniel, M Matera, Web engineering, L. Baresi, et al..
Springer, Berlin, Germany, 2007, pp. 479 - 484
Model Checking Knowledge And Linear-Time Pspace Cases
K Engelhardt, P Gammie, R Van Der Meyden, Symposium on logical foundations of computer science, Proceedings, S. Artemov and A. Nerode.
Springer, Berlin, 2007, pp. 195 - 211
Model Checking Software At Compile Time
A Fehnker, R Huuck, F Rauch, P Jayet, M Lussenburg, TASE 2007: theoretical aspects of software engineering, L. O'Conner.
Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, Piscataway, NJ 08855-1331, USA, 2007, pp. 45 - 54

Software has been under scrutiny by the verification community from various angles in the recent past. There are two major algorithmic approaches to ensure the correctness of and to eliminate bugs from such systems: software model checking and static analysis. Those approaches are typically complementary. In this paper we use a model checking approach to solve static analysis problems. This not only avoids the scalability and abstraction issues typically associated with model checking, it allows for specifying new properties in a concise and elegant way, scales well to large code bases, and the built-in optimizations of modern model checkers enable scalability also in terms of numbers of properties to be checked. In particular, we present Goanna, the first C/C++ static source code analyzer using the off-the-shelf model checker NuSMV, and we demonstrate Goanna`s suitability for developer machines by evaluating its run-time performance, memory consumption and scalability using the source code of OpenSSL as a test bed. © 2007 IEEE. Model checking, Algorithmic languages, C (programming language), Computer software, Data storage equipment, Problem solving, Static analysis
Modelling And Verification Of The Lmac Protocol For Wireless Sensor Networks
A Fehnker, A Mader, L van Hoesel, Integrated Formal Methods, Jim Davies.
Springer, Berlin, Germany, 2007, pp. 253 - 272
Modular Type Classes
M Chakravarty, D Dreyer, R Harper, 34th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, Proceedings, M. Felleisen.
ACM press, New York, 2007, pp. 63 - 70
Module Graph Merging And Placement To Reduce Reconfiguration Overheads In Paged Fpga Devices
O Diessel, S Koh, International conference on field-programmable logic 2007, Proceedings, K. Bertels, et al. .
IEEE, TU Delft, The Netherlands, 2007, pp. 293 - 298
Motion Modeling With Geometry And Quad-Tree Leaf Merging
R Mathew, D Taubman, .,
IEEE, Piscataway, 2007, pp. 297 - 300

Quad-tree structure often used to model motion between frames of a video sequence. However, a fundamental limitation of the quad-tree structure is that it can only capture horizontal and vertical edge discontinuities at dyadically related locations. Video coding, motion compensation
Multi-Level Classification Of Emphysema In Hrct Lung Images
M Prasad, A Sowmya, Pattern analysis and applications,
Springer Verlag, London, 2007
Node Localization Using Mobile Robots In Delay-Tolerant Sensor Networks
S Jha, A Savkin, N Bulusu, T Dang, P Pathirana, Secure localization and time synchronization for wireless sensor and ac hoc networks, Poovendran, Wang and Roy.
Springer, United States of America, 2007

We present a novel scheme for node localization in a Delay-Tolerant Sensor Network (DTN). In a DTN, sensor devices are often organized in a network clusters that may be mutually disconnected. Some mobile-robots may be used for data collection from the network clusters. They key idea in our scheme is to use this robot to perform location estimation for the sensor nodes it passes by based on the signal strength of radio messages received from them.
Non-Cooperative Coexistence Of Co-Located Independent Wireless Mesh Networks
J Lim, C Chou, S Jha, IEEE international conference on mobile ad-hoc and sensor systems, Proceedings, S. Giordano and I. Stojmenovic.
IEEE, Piscataway, NJ, USA, 2007, pp. 1 - 9
Offline Swimmer Cap Tracking Using Trajectory Interpolation
J Yang, J Zhang, Digital image computing techniques and applications DICTA 2007, Proceedings, M. Bottema, et al..
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 579 - 585
On Embedding Task Memory In Services Composition Frameworks
B Benatallah, H Paik, S Benbernou, R Bova, S Hassas, Web engineering, L. Baresi and G. Houben.
Springer, Berlin, 2007, pp. 1 - 16
On Extending Ws-Policy With Specification Of Xml Web Service Semantics, Monitoring, And Control Driven By Business Value
A Erradi, P Maheshwari, V Tosic, WSEAS Transactions on Computers,
WSEAS Press, Athens, Greece, 2007, pp. 805 - 812

WS-Policy is a general framework for the specification of policies for XML Web services. However, it currently lacks detailed specification of ontological meaning, quality of service (QoS) monitoring, executed actions, business value (e.g., prices), and other aspects necessary for comprehensive description of Web service semantics, monitoring, and control activities. We first discuss principles for specification of such information for Web services and how this can be done with policies. Then, we present our WS-Policy4MASC extension of WS-Policy. It enables specification of goal, action, utility, and meta- policy assertions, as well as a number of related constructs (including ontological meaning). Consequently, a Web service composition can be comprehensively described with WSDL, WSBPEL, and WS-Policy4MASC, without the need for additional languages (e.g., OWL-S, WSLA, WSOL, WS-Agreement, or WS-CoL). We illustrate our solutions on a weather temperature Web service example. WS-Policy4MASC is used in our Manageable and Adaptable Service Compositions (MASC) middleware. Web services, Middleware, Network protocols, Quality of service, Semantics, Specifications, XML
On Mitigating Malicious Behavior Against Routing In Wireless Network
H Tan, WCNC 2007,
Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, USA, 2007, pp. 2942 - 2946

Network routing is a cooperative process. The network performance will be seriously degraded if one or more network components are compromised to network attackers and they behave maliciously. There have been a few literatures to address the robustness of network routing but few of them have holistic countermeasure against them (especially combined misbehavior). In this paper, we propose a novel Network Protocol to address these imperative issues that have been ignored in existing literature. We present the scalability evaluation of our network protocol through the simulation in NS2. We derive the complete analytical model behind our design. The respective simulation result from NS2 also proves the correctness of the analytical model. The simulation results on the network performance improvement compared to other solutions are also presented. © 2007 IEEE. Wireless networks, Computer simulation, Intrusion detection, Mathematical models, Network protocols, Network routing, Scalability
On The Automated Synthesis Of Proof-Carrying Temporal Reference Monitors
M Chakravarty, G Klein, S Winwood, Logic-based program synthesis and transformation, G. Puebla.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 111 - 126

We extend the range of security policies that can be guaranteed with proof carrying code from the classical type safety, control safety, memory safety, and space/time guarantees to more general security policies, such as general resource and access control. We do so by means of (1) a specification logic for security policies, which is the pasttime fragment of LTL, and (2) a synthesis algorithm generating reference monitor code and accompanying proof objects from formulae of the specification logic. To evaluate the feasibility of our approach, we developed a prototype implementation producing proofs in Isabelle/HOL. © Springer-Verlag Berlin Heidelberg 2007. Security of data, Algorithms, Codes (symbols), Formal logic, Software prototyping
On The Data Consumption Benefits Of Accepting Increased Uncertainty
E Martin, A Sharma, F Stephan, Theoretical Computer Science,
Elsevier, The Netherlands, 2007, pp. 170 - 182

In the context of learning paradigms of identification in the limit, we address the question: why is uncertainty sometimes desirable? We use mind change bounds on the output hypotheses as a measure of uncertainty and interpret `desirable` as reduction in data memorization, also defined in terms of mind change bounds. The resulting model is closely related to iterative learning with bounded mind change complexity, but the dual use of mind change bounds - for hypotheses and for data - is a key distinctive feature of our approach. We show that situations exist where the more mind changes the learner is willing to accept, the less the amount of data it needs to remember in order to converge to the correct hypothesis. We also investigate relationships between our model and learning from good examples, set-driven, monotonic and strong-monotonic learners, as well as class-comprising versus class-preserving learnability. © 2007 Elsevier Ltd. All rights reserved. Uncertainty analysis, Computational complexity, Data storage equipment, Iterative methods, Learning systems, Mathematical models
Optional Distributed Multiple Sequence Alignment Using Conformal Computing Methods
H Elgindy, B Gaeta, M Helal, L Mullin, 2007 International conference on high performance computing, networking and communication systems, Proceedings, M. Grgic and A. Sung.
ISRST, Orlando, FL, USA, 2007, pp. 120 - 127
Patterns For B: Bridging Formal And Informal Development
K Chan, B Welch, K Robinson, B2007: formal specification and development in B, J. Julliand, O. Kouchnarenko.
Springer, Berlin, 2007, pp. 125 - 139
Place-Hampi
N Brown, P Compton, D Del Favero, M Pagnucco, J Shaw, , Richard Castelli.
Martin-Gropius-Bau, Berlin 2007 , Berlin, Germany, 2007
Place-Hampi
N Brown, P Compton, D Del Favero, M Pagnucco, J Shaw, ,
Singapore Science Centre, Singapore, Singapore, 2007
Placing Multicast Proxies For Internet Live Media Streaming
J Guo, S Jha, IEEE LCN 2007, Proceedings of, Mohamed Younis.
IEEE Computer Society, Los Alamitos, California, US, 2007, pp. 149 - 156
Planning Software Success With Semi-Quantitative Reasoning
D Jeffery, H Zhang, B Kitchenham, 2007 Australian software engineering conference, Proceedings, J. Grundy and J. Han.
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 369 - 378
Platelet Activation In Acute Pulmonary Embolism
T Chung, D Connor, J Joseph, L Kritharides, D Ma, M Peters, L Emmett, R Mansberg, Journal of Thrombosis and Haemostasis,
Blackwell Publishing, Oxford, 2007, pp. 918 - 924

Background: Platelet activation is implicated in thrombotic disorders, but has not been described in acute clinical pulmonary embolism (PE). Objectives: To investigate the natural history of platelet activation in PE and associated markers of inflammation, thrombosis and cardiac dysfunction. Methods: Thirty-five consecutive patients (age 62 +/- 17 years) with acute PE were prospectively enrolled and followed for 6 months. Platelet activation was assessed by flow cytometry [measuring expression of platelet P-selectin, conformational activation of glycoprotein IIb/IIIa complex (PAC-1) and formation of platelet-leukocyte complexes] and by plasma soluble P-selectin. Platelet activation, right ventricular (RV) function (assessed as RV ejection area by transthoracic echocardiography), D-dimer and high-sensitivity C-reactive protein (hs-CRP) were measured at presentation and repeated over 6 months follow-up. Results: Soluble P-selectin (56 +/- 19 ng mL(-1), ANOVA P < 0.0001) and PAC-1 (1.5 +/- 1.8%, ANOVA P = 0.005) were mildly but significantly increased in patients with acute PE relative to healthy young men (soluble P-selectin 33 +/- 13 ng mL(-1), P < 0.001; PAC-1 binding 0.5 +/- 0.6%, P < 0.01) and age-matched controls (soluble P-selectin 31 +/- 9 ng mL(-1), P < 0.001; PAC-1 binding 0.4 +/- 0.4%, P < 0.05). Platelet P-selectin expression and platelet-leukocyte complexes were not increased during acute PE. Echocardiographic RV ejection area correlated inversely with soluble P-selectin (r = -0.47, P = 0.007) and positively with platelet P-selectin (r = 0.49, P = 0.0007), suggesting P-selectin is shed from activated platelets in proportion to the severity of RV dysfunction. Elevated soluble P-selectin, D-dimer and hs-CRP demonstrated a time-dependent return to normal during 6 months follow-up. Conclusion: Platelet activation is evident after acute PE. Platelet activation correlates with the severity of RV dysfunction, and can persist for several months after acute PE. platelet activation; pulmonary embolism; right ventricular dysfunction;, soluble P-selectin; venous thrombosis
Potential Speech Features For Cognitive Load Measurement
M Khawaja, N Ruiz, F Chen, OZCHI 2007, Proceedings, M. Billinghurst.
ACM, Adelaide, 2007, pp. 57 - 60
Preface
R van Glabbeek, Electornic notes in theoretical computer science,
Elsevier, Amsterdam, The Netherlands, 2007
Preface
R van Glabbeek, M Hennessy, Electronic notes in theoretical computer science,
Elsevier, Amsterdam, The Netherlands, 2007
Preservation Of Epistemic Properties In Security Protocol Implementations
R Van Der Meyden, T Wilke, Theoretical aspects of knowledge and rationality, Proceedings, D. Samet.
Louvain, Louvain, Belgium, 2007, pp. 212 - 221
Prime Implicates For Approximate Reasoning
M Pagnucco, D Rajaratnam, Knowledge science, engineering and management: 2nd international conference, Proceedings, Z. Zhang and J. Siekmann.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 61 - 72

Techniques for improving the computational efficiency of inference have held a long fascination in computer science. Two popular methods include approximate logics and knowledge compilation. In this paper we apply the idea of approximate compilation to develop a notion of prime implicates for the family of classically sound, but incomplete, approximate logics S-3. These logics allow for differing levels of approximation by varying membership of a set of propositional atoms. We present a method for computing the prime S-3-implicates of a clausal knowledge base and empirical results on the behaviour of prime S-3-implicates over randomly generated 3-SAT problems. A very important property of S-3-implicates and our algorithm for computing them is that decreasing the level of approximation can be achieved in an incremental manner without re-computing from scratch (Theorem 7). © Springer-Verlag Berlin Heidelberg 2007. Computation theory, Approximation theory, Knowledge engineering, Problem solving, Program compilers, Set theory
Privacy Inspection And Monitoring Framework For Automated Business Processes
Y Li, H Paik, J Chen, 8th International conference on web information systems engineering, Proceedings, B. Benatallah, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Berlin, 2007, pp. 603 - 612

More and more personal data is exposed to automatic and programmatic access, making it more difficult to safeguard the personal information from unauthorised access at every step. We introduce a privacy inspection and monitoring framework provides two functions: (i) the process designers can look over the privacy aspects of the automated business processes and resolve potential problems before deploying, and (ii) the obligation management technique ensures when certain actions performed on personal data, appropriate obligations are carried out. © Springer-Verlag Berlin Heidelberg 2007. Access control, Data reduction, Function evaluation, Information analysis, Problem solving
Probabilistic Skylines On Uncertain Data
B Jiang, Y Yuan, X Lin, J Pei, 33rd International conference on very large databases, Proceedings, C. Koch.
VLDB Endowment, ACM, Vienna, Austria, 2007, pp. 15 - 26
Protocol Discovery From Imperfect Service Interaction Logs
B Benatallah, H Motahari Nezhad, R Saint-Paul, F Casati, 2007 23rd IEEE international conference on data engineering, Proceedings, R. Chirkova, et al..
IEEE, USA, 2007, pp. 1405 - 1409
Querying And Maintaining A Compact Xml Storage
F Lam, W Shui, R Wong, Proceedings of the 16th Internaitonal conference on world wide web,
Association for Computing Machinery, New York, NY 10036-5701, United States, 2007, pp. 1073 - 1082

As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time. In addition to supporting efficient queries, the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum, while insertions and deletions can be performed in near constant time as well. As a result, the proposed structure features a small memory footprint that increases cache locality, whilst still supporting standard APIs, such as DOM, and necessary database operations, such as queries and updates, efficiently. Analysis and experiments show that the proposed structure is space and time efficient. XML, Data storage equipment, Data structures, Query processing, Space time adaptive processing
Rapid Generation Of Realistic Mobility Models For Vanet
K Lan, F Karnadi, Z Mo, 2007 IEEE Wireless communications and networking conference, Proceedings, R. Murch.
Institute of Electrical and Electronics Engineers Inc., New York, NY 10016-5997, United States, New York, USA, 2007, pp. 2508 - 2513

One emerging, new type of ad-hoc network is the Vehicular Ad-Hoc Network (VANET), in which vehicles constitute the mobile nodes in the network. Due to the prohibitive cost of deploying and implementing such a system in real world, most research in VANET relies on simulations for evaluation. A key component for VANET simulations is a realistic vehicular mobility model that ensures conclusions drawn from simulation experiments will carry through to real deployments. In this work, we introduce a tool MOVE that allows users to rapidly generate realistic mobility models for VANET simulations. MOVE is built on top of an open source micro-traffic simulator SUMO. The output of MOVE is a realistic mobility model and can be immediately used by popular network simulators such as ns-2 and qualnet. We evaluate and compare ad-hoc routing performance for vehicular nodes using MOVE to that using the random waypoint model. We show that the simulation results obtained when nodes moving according to a realistic mobility model is significantly different from that of the commonly used random waypoint model. © 2007 IEEE. Rapid prototyping, Ad hoc networks, Computer simulation, Mathematical models, Network routing, Telecommunication traffic
Real Time Robot Audition System Incorporating Both 3d Sound Source Localisation And Voice Characterisation
B Rudzyn, M Kadous, C Sammut, 2007 IEEE International conference on Robotics and Automation, Proceedings, S. Hutchinson.
IEEE, Omnipress, USA, 2007, pp. 4733 - 4738
Reasoning About Bdi Agents From A Programming Languages Perspective
W Wobcke, AAAI 2007 spring symposium on intentions in intelligent systems, Proceedings, G. Ferguson.
AAAI press, Menlo Park, CA, 2007, pp. 48 - 53
Reboots Are For Hardware: Challenges And Solutions To Updating An Operating System On The Fly
A Baumann, G Heiser, J Appavoo, D Da Silva, O Krieger, R Wisniewski, 2007 USENIX annual technical conference, Proceedings, J. Chase and S. Seshan.
USENIX association, CA, USA, 2007, pp. 337 - 350
Reformulating Global Constraints: The Slide And Regular Constraints
T Walsh, C Bessiere, E Hebrard, B Hnich, Z Kiziltan, C Quimper, Abstraction, reformulation and approximation, I. Miguel and W. Ruml.
Springer, Germany, 2007, pp. 80 - 92
Relational Processing Is Fundamental To The Central Executive And Is Limited To Four Variables
W Wilson, G Andrews, J Bain, R Baker, D Birney, G Halford, J McCredden, S Phillips, The cognitive neuroscience of working memory, N. Osaka, et al..
Oxford university press, Oxford, UK, 2007
Reliable Device Drivers Require Well-Defined Protocols
T Bourke, I Kuz, L Ryzhyk, 37th annual IEEE/IFIP conference on dependable systems and networks, Supplemented volume,
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 70 - 75
Remarks On Testing Probabilistic Processes
Y Deng, C Morgan, R van Glabbeek, C Zhang, M Hennessy, Electronic Notes in Theoretical Computer Science,
Elsevier, Online, 2007, pp. 359 - 397

We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer valid in our probabilistic setting; even for non-probabilistic CSP processes, the distinguishing power of probabilistic tests is much greater than that of standard tests. We develop a method for deriving inequations valid in probabilistic may testing based on a probabilistic extension of the notion of simulation. Using this, we obtain a complete axiomatisation for non-probabilistic processes subject to probabilistic may testing. © 2007 Elsevier B.V. All rights reserved. Probabilistic logics, Algebra, Computer science, Computer simulation, Differentiation (calculus)
Resolving Non-Determinism In Programs For Complex Task Planning With Search Control
A Gabaldon, Procs. 8th International Symposium on Logical Formalizations of Commonsense Reasoning (CommonSense'07), E. Amir, et al..
American Association for Artificial Intelligence, Menlo Park, CA 94025-3496, United States, Menlo Park, CA 94025-3496, United States, 2007, pp. 47 - 52

We consider the problem of planning in complex domains where actions are stochastic, non-instantaneous, may occur concurrently, and time is represented explicitly. Our approach is based on the situation calculus based language Golog. Instead of general search for a sequence of actions, as in classical planning, we consider the problem of computing a deterministic, sequential program (with stochastic actions as primitives) from an underspecified, non-deterministic, concurrent program. Similar to the search for a plan, the process of obtaining a deterministic program from a non-deterministic one is carried out offline, with the deterministic program obtained by this process then being available for online execution. We then describe a form of domain-dependent search control that can be used to provide some degree of goal-directedness to the search for solutions in this setting, and also show how a simple programming construct for probabilistic tests can be used for further pruning of the search space. Copyright © 2007, American Association for Artificial Intelligence (www.aaai.org). All rights reserved. Random processes, Computer programming, Planning, Problem solving
Results On The Quantitative Mu-Calculus Qm Mu
C Morgan, A McIver, ACM Transactions on Computational Logic,
Assoc Computing Machinery, New York, 2007, pp. 3:1 - 3:43

The mu-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic (universal) and angelic (existential) choice; its quantitative generalization qM mu extends to include probabilistic choice. We make two major contributions to the theory of such systems. The first is to show that for a finite-state system, the logical interpretation of qM mu, via fixed points in a domain of real-valued functions into [0, 1], is equivalent to an operational interpretation given as a turn-based gambling game between two players. The second contribution is to show that each player in the gambling game has an optimal memoryless strategy - that is, a strategy which is independent of the game`s history, and with which a player can achieve his optimal expected reward however his opponent chooses to play. Moreover, since qM mu is expressive enough to encode stochastic parity games, our result implies the existence of memoryless strategies in that framework, as well. As an additional feature, we include an extensive case study demonstrating the aforementioned duality between games and logic. Among other things, it shows that the use of algorithmic verification techniques is mathematically justified in the practical computation of probabilistic system properties. angelic choice; demonic choice; denotational semantics; game semantics;, minimax theorem; modal mu-calculus; probabilistic choice; quantitative, aspects of programming languages
Rewriting Haskell Strings
R Leshchinskiy, D Stewart, D Coutts, Practical aspects of declarative languages, M. Hanus.
Springer-Verlag, Berlin, 2007, pp. 50 - 64
Rijid: Random Code Injection To Mask Power Analysis Based Side Channel Attacks
J Ambrose, R Ragel, S Parameswaran, 2007 Design automation conference, Proceedings, L. Stok and S. Sapatnekar.
ACM, Piscataway, NJ, USA, 2007, pp. 489 - 492
Robustness Of A Spoken Dialogue Interface For A Personal Assistant
A Nguyen, A Wong, W Wobcke, 2007 IEEE/WIC/ACM International conference on intelligent agent technology, Proceedings, T. Lin, et al..
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 123 - 127
Rtrg: Reschedule Trigger To Optimize Rescheduling Frequency For Schedule Based Mac Schemes
S Jha, Y Rana, Globecom workshops, 2007 IEEE,
IEEE, 2007, pp. 1 - 6
Rules And Ontology In Compliance Management
A Wong, N Parameswaran, P Ray, F Yip, 11th IEEE international EDOC enterprises computing conference, Proceedings, S. Ceballos.
IEEE computing society, Los Alamitos, CA, USA, 2007, pp. 435 - 442
Safe State Abstraction And Reusable Continuing Subtasks In Hierarchical Reinforcement Learning
B Hengst, AI 2007: advances in artificial intelligence, M. Orgun and J. Thornton.
Springer, Germany, 2007, pp. 58 - 67
Scalable Locomotion For Large Self-Reconfiguring Robots
R Fitch, Z Butler, ICML 2007, G. Ghahramani.
Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States, New York, USA, 2007, pp. 2248 - 2253

For large self-reconfiguring robots, any algorithm that requires linear amounts of memory per module (with respect to the number of modules) or linear time for computation or communication per actuation is undesirable. While shapeforming may require linear amounts of memory, locomotion can be performed with simpler shape specifications, and therefore sublinear algorithms are possible. In this paper, we present a locomotion technique that performs both planning and actuation control in sublinear time and memory. The algorithm is inspired by reinforcement learning and uses dynamic programming to plan module paths in parallel. To ensure the physical integrity of the overall robot during motion, we have developed a novel localized cooperation scheme which may also be used with other self-reconfiguration algorithms. Our overall algorithm is able to direct locomotion over arbitrary obstacles, and the formulation of the goal used in the planning encourages dynamic stability. © 2007 IEEE. Intelligent robots, Computation theory, Dynamic programming, Industrial locomotives, Linear control systems, Reinforcement learning
Scalar Outcomes Suffice For Finitary Probabilistic Testing
Y Deng, C Morgan, R van Glabbeek, C Zhang, Programming languages and systems, R. De Nicola.
Springer, New York, 2007, pp. 363 - 378
Scratchpad Allocation For Data Aggregates In Superperfect Graphs
L Li, Q Nguyen, J Xue, 2007 ACM conference on languages, compilers and tools for embedded systems, Proceedings, S. Pande and Z. Li.
ACM press, New York, USA, 2007, pp. 207 - 216
Securing Channel Assignment In Multi-Radio Multi-Channel Wireless Mesh Networks
A Haq, S Kanhere, A Naveed, IEEE wireless communications and networking conference 2007, Proceedings, R. Murch.
IEEE communications society, Piscataway, NJ, USA, 2007
Selecting Stars: The K Most Representative Skyline Operator
Y Yuan, X Lin, Y Zhang, Q Zhang, 23rd International conference on data engineering, Proceedings, R. Chirkova, et al..
IEEE computer society, Los Alamitos, CAm USA, 2007, pp. 86 - 95
Semi-Automated Adaptation Of Service Interactions
B Benatallah, H Motahari Nezhad, F Casati, F Curbera, A Marten, 16th international world wide web conference, Proceedings, P. Patel-Schneider and P. Shenoy.
ACM, New York, USA, 2007, pp. 993 - 1002
Service Design Process For Reusable Services: Financial Services Case Study
A Erradi, P Maheshwari, N Kulkarni, 2007 International conference on service-oriented computing, Proceedings, B. Kramer, et al..
Springer, Berlin, 2007, pp. 606 - 617
Service Differentiation Using The Capture Effect In 802.11 Wireless Lans
M Hassan, A Nyandoro, L Libman, IEEE Transactions on Wireless Communications,
IEEE, New York, 2007, pp. 2961 - 2971

We investigate the effects of using dual transmission power to achieve quality-of-service (QoS) differentiation in IEEE 802.11 wireless LANs. Specifically, we assume all stations employ the standard IEEE 802.11 distributed coordination function (DCF), with the exception that some stations transmit at a higher power than others. Consequently, in the event of a collision involving frames from both power levels, a high-power frame is more likely to be received correctly as a result of the so-called capture effect (i.e. received at a power sufficiently higher than that of the interference, allowing it to be decoded correctly). This effectively leads to QoS differentiation between two classes, corresponding to the high-power and low-power stations. We develop a Markov model for the IEEE 802.11 DCF in a network with dual transmission power over a Rayleigh-fading channel, and use it to evaluate the resulting performance, in terms of the key metrics of throughput and delay. We explore how the performance of the service classes depends on the proportion of stations in each class and the transmission power ratio, focusing in particular on the bounds achieved in the limit case of `ideal differentiation`, characterised by a perfect capture probability of high-power frames. We find that significant performance differentiation between high-power and low-power stations is achieved even with transmission power ratios that are not very high, leading us to conclude that employing multiple transmission power levels is a viable and efficient approach for service quality differentiation in wireless LANs. © 2007 IEEE. Telecommunication services, Power control, Quality of service, Signal interference, Wireless local area networks (WLAN)
Servicemosaic: Interactive Analysis And Manipulation Of Service Conversations
B Benatallah, H Motahari Nezhad, J Ponge, R Saint-Paul, F Casati, F Toumani, 2007 23rd IEEE international conference on data engineering, Proceedings, R. Chirkova, et al..
IEEE, CA, USA, 2007, pp. 1497 - 1498
Shared Ordered Binary Decision Diagrams For Dempster-Shafer Theory
N Lehmann, Symbolic and quantitative approaches to reasoning with uncertainty, K. Mellouli.
Springer, Germany, 2007, pp. 320 - 331
Situational Method Quality
L Zhu, M Staples, Situational method engineering: fundamentals and experiences, J. Raltye, et al..
Springer, Boston, 2007, pp. 193 - 206
Social Agents
N Foo, AI 2007: advances in artificial intelligence, M. Orgun and J. Thornton.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, p. 14

Social agents are computational cognitive agents that have epistemic abilities besides the traditional ones of action, communication and other forms of interaction. There is increasing interest in the modelling of such agents. This talk will first outline selected aspects of social agents and potential applications. Then we proceed to an example of how a couple of aspects may be investigated, viz., agent trust based on experience. © Springer-Verlag Berlin Heidelberg 2007. Cognitive systems, Data privacy, Social aspects
Solving Hard Instances Of Fpga Routing With A Congestion-Optimal Restrained-Norm Path Search Space
K So, 2007 international symposium on physical design, Proceedings, P. Madden, D. Pan.
ACM, New York, USA, 2007, pp. 151 - 158
Soya: A Programming Model And Runtime Environment For Component Composition Using Ssdl
P Fornasier, I Gorton, J Webber, Component-based software engineering, H. Schmidt, et al..
Springer, Heidelberg Berlin, 2007, pp. 227 - 241
Spark: Top-K Keyword Query In Relational Databases
Y Luo, X Lin, W Wang, X Zhou, SIGMOD 2007, Proceedings, C. Chan, et al..
Association for Computing Machinery, New York, NY 10036-5701, United States, China, 2007, pp. 115 - 126

With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assembled from multiple relational tables, traditional IR-style ranking and query evaluation methods cannot be applied directly. In this paper, we study the effectiveness and the efficiency issues of answering top-k keyword query in relational database systems. We propose a new ranking formula by adapting existing IR techniques based on a natural notion of virtual document. Compared with previous approaches, our new ranking method is simple yet effective, and agrees with human perceptions. We also study efficient query processing methods for the new ranking method, and propose algorithms that have minimal accesses to the database. We have conducted extensive experiments on large-scale real databases using two popular RDBMSs. The experimental results demonstrate significant improvement to the alternative approaches in terms of retrieval effectiveness and efficiency. Copyright 2007 ACM. Relational database systems, Adaptive systems, Computational efficiency, Information retrieval systems, Query processing, Tabu search
Stream Fusion: From Lists To Streams To Nothing At All
R Leshchinskiy, D Stewart, D Coutts, ICFP'07: proceedings of the 2007 ACM SIGPLAN international conference on functional programming, R. Hinze and N. Ramsey.
ACM, New York, USA, 2007, pp. 315 - 326
Structural Selectivity Estimation For Xml Documents
D Fisher, S Maneth, Data engineering, 2007 IEEE confere, Proceedings,
Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, New York, USA, 2007, pp. 626 - 635

Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many possible execution plans for a particular query. In terms of XML databases, the problem of selectivity estimation of queries presents new challenges: many evaluation operators are possible, such as simple navigation, structural joins, or twig joins, and many different indexes are possible. A new synopsis for XML documents is introduced which can be effectively used to estimate the selectivity of complex path queries. The synopsis is based on a lossy compression of the document tree that underlies the XML document, and can be computed in one pass from the document. It has several advantages over existing approaches: (1) it allows one to estimate the selectivity of queries containing all XPath axes, including the order-sensitive ones, (2) the estimator returns a range within which the actual selectivity is guaranteed to lie, with the size of this range implicitly providing a confidence measure of the estimate, and (3) the synopsis can be incrementally updated to reflect changes in the XML database. © 2007 IEEE. XML, Data compression, Database systems, Mathematical operators, Parameter estimation, Query processing, Trees (mathematics)
Summarizing Order Statistics Over Data Streams With Duplicates
Y Yuan, X Lin, Y Zhang, M Kitsuregawa, J Yu, X Zhou, 23rd International conference on data engineering, Proceedings, R. Chirkova, et al..
IEEE computer society, Los Alamitos, CA, USA, 2007, pp. 1329 - 1333
Sydney Owl Syntax---Towards A Controlled Natural Language Syntax For Owl 1.1
A Cregan, T Meyer, R Schwitter, OWLED 2007 workshop on OWL: experiences and directions, Proceedings, C. Golbreich, et al..
CEUR, http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-258/, 2007
Symbol Grounding For The Semantic Web
A Cregan, The semantic web: research and applications, E. Franconi, et al. .
Springer, Berlin, Germany, 2007, pp. 429 - 442
System F With Equality Constraints
M Chakravarty, K Donnelly, S Jones, M Sulzmann, 3rd ACM SIGPLAN workshop on types in language design and implementation, Proceedings, F. Pottier, G. Necula.
ACM press, New York, 2007, pp. 53 - 66
Task Memories And Task Forums: A Foundation For Sharing Service-Based Personal Processes
B Benatallah, H Paik, S Benbernou, R Bova, L Zheng, International conference on Service oriented computing---ICSOC 2007, B. Kramer, et al..
Springer, Berlin, 2007, pp. 365 - 376
The 'Majority' And 'By Default' Modalities
V Jauregui, AI 2007: advances in artificial intelligence, M. Orgun and J. Thornton.
Springer-Verlag, Berlin, Germany, 2007, pp. 263 - 272
The Complexity Of Reasoning With Global Constraints
T Walsh, C Bessiere, E Hebrard, B Hnich, Constraints,
Springer, New York, 2007, pp. 239 - 259

Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domains of variables. With global (or non-binary) constraints, the cost of such propagation may be much greater than the quadratic cost for binary constraints. We therefore study the computational complexity of reasoning with global constraints. We first characterise a number of important questions related to constraint propagation. We show that such questions are intractable in general, and identify dependencies between the tractability and intractability of the different questions. We then demonstrate how the tools of computational complexity can be used in the design and analysis of specific global constraints. In particular, we illustrate how computational complexity can be used to determine when a lesser level of local consistency should be enforced, when constraints can be safely generalized, when decomposing constraints will reduce the amount of pruning, and when combining constraints is tractable. © Springer Science+Business Media, LLC 2007. Constraint theory, Binary decision diagrams, Computational complexity, Global optimization, Mathematical programming, Numerical methods
The Effects Of Hormone Resuscitation On Transplantable Organs In The Brain Dead Donor
A Hing, G Stewart, M Hicks, P Macdonald, P Tran, S Faddy, I Gao, S Kesteven, A Sharland, Journal of Heart and Lung Transplantation,
Elsevier Science Inc, New York, 2007, p. S214
"The Nomadic Ear": Journeys In Location Aware Spatial Audio
D Woo, N Helyer, F Veronesi, 4th International conference on enactive interfaces 2007, Proceedings, A. Luciani and C. Cadoz.
Association ACROE, Grenoble, France, 2007, pp. 349 - 352
The Prevalence Of Unmet Needs Of Adolescent Survivors Of Cancer
C D'Este, R Sanson-Fisher, A Shakeshaft, T Clinton-McHarg, A Girgis, Psycho-Oncology,
John Wiley & Sons Ltd, Chichester, 2007, pp. S271 - S272
The Smart Personal Assistant: An Overview
A Nguyen, V Ho, A Krzywicki, W Wobcke, AAAI 2007 spring symposium on interaction challenges for artificial intelligence, Proceedings, N. York-Smith.
AAAI press, Menlo Park, CA, 2007, pp. 135 - 136
The Tale Of Peter Rabbit: A Case-Study In Story-Sense Reasoning
N Hannah, J Lobb, M Ryan, 2007 Australasian conference on interactive entertainment, Proceedings, M. Gibbs and Y. Pasan.
RMIT, Melbourne, Australia, 2007
The Unmet Needs Of Parents And Carers Of Adolescent Cancer Survivors
C D'Este, R Sanson-Fisher, A Shakeshaft, T Clinton-McHarg, A Girgis, Psycho-Oncology,
John Wiley & Sons Ltd, Chichester, 2007, p. S213
Topology Control And Channel Assignment In Mr-Mc Wireless Mesh Networks
S Jha, S Kanhere, A Naveed, IEEE MASS 2007, Proceedings, S. Giordano and I. Stojmenovic.
IEEE computer society, (CDROM), 2007
Toward Automatic Data Distribution For Migrating Computations
J Xue, L Bic, M Dillencourt, M Lai, L Pan, 2007 International conference on parallel processing, Proceedings,
IEEE computer society, USA, 2007, p. 27
Toward Evolution Of Strategic It Requirements
A Babar, S Bleistein, K Cox, J Verner, Applied computing 2007, S. Ossowski and R. Menezes.
ACM, USA, 2007, pp. 1220 - 1227
Towards A Practical, Verified Kernel
P Derrin, K Elphinstone, G Klein, T Roscoe, 11th workshop on hot topics in operating systems proceedings,
IEEE, san diego, 2007
Towards A Stringent Bit-Rate Conformance For Frame-Layer Rate Control In H.264/Avc
E Tan, J Chen, Advances in multimedia information processing---PCM 2007, H. Ip, et al..
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 128 - 137

This paper presents a novel frame-layer rate control technique that adaptively determines the frame complexity for bit allocation in order to satisfy the target bit-rate constraints without degrading the decoded video significantly. To do this, we first obtain the edge energy of each frame to measure the frame complexity as well as to determine the weighting of a frame for bit allocation. We then present a new bit-rate traffic model for bit allocation to achieve a better conformance to the target bit-rate. Finally, we integrate the edge energy complexity measure into the rate-quantization (R-Q) model. Our results shows robust improvements over the current rate control methods adopted in H.264/AVC in terms of meeting the target bit-rate as well as determining the quality of the decoded video. © Springer-Verlag Berlin Heidelberg 2007. Bit error rate, Computational complexity, Mathematical models, Telecommunication traffic
Towards Automatic Cognitive Load Measurement From Speech Analysis
F Chen, B Yin, Human Computer Interaction Part 1, HCI 2007, Julie A Jacko.
Springer, Berlin, Germany, 2007, pp. 1011 - 1019
Towards Data Tiling For Whole Programs In Scratchpad Memory Allocation
L Li, H Feng, H Wu, J Xue, Advances in compiler system architecture, L. Choi.
Springer Verlag, Heidelberg, D-69121, Germany, Heidelberg, D-69121, Germany, 2007, pp. 63 - 74

Data tiling is an array layout transformation technique that partitions an array into smaller subarray blocks. It was originally proposed to improve the cache performance of regular loops. Recently, researchers have applied this technique to scratchpad memory (SPM) allocation. Arrays whose sizes exceed a given SPM size can be tiled or divided into smaller subarray blocks or tiles and the program performance can be significantly improved by placing the smaller subarray tiles in SPM. Existing data tiling techniques are applicable to regularly-accessed arrays in individual loop nests. In embedded applications, arrays are often accessed in multiple loop nests via possibly aliased pointers. Tiling arrays in a loop nest alone will often affect the tiling and allocation decisions for arrays accessed in other loop nests. Moreover, tiling arrays accessed via aliased pointers is difficult since their access patterns are unknown at compile time. This paper presents a new data tiling approach to address these practical issues. We perform alias profiling to detect the most likely memory access patterns and use an ILP solver to select the best tiling schemes for all loop nests in the program as a whole. We have integrated data tiling in an existing SPM allocation framework. Our preliminary experimental results show that our approach can improve significantly the performance of a set of programs selected from the Mediabench suite. © Springer-Verlag Berlin Heidelberg 2007. Storage allocation (computer), Computer programming, Data processing
Towards Declarative Monitoring Of Declarative Service Composition
V Tosic, P Brebner, M Kearney, K Lam, K Taylor, D Zhang, Workshop in conjunction with the International Conference on Data Engineering, Vincent Oria, et al..
IEEE Computer Society, Los Alamitos, California, USA, 2007, pp. 315 - 322
Towards Trustworthy Computing Systems: Taking Microkernels To The Next Level
K Elphinstone, G Heiser, G Klein, I Kuz, S Petters, Operating systems review,
ACM, NY, USA, 2007, pp. 3 - 11
Trace-Based Leakage Energy Optimisations At Link Time
L Li, J Xue, Journal of Systems Architecture,
, 2007, pp. 1 - 20

Energy-aware compilers are becoming increasingly important for embedded systems due to the need to meet a variety of design constraints on time, code size and power consumption. This paper introduces for the first time a trace-based, link-time compiler framework on binaries for embedded systems and evaluates its potential benefits in supporting energy optimisations, especially those that exploit the interaction between compilers and architecture. We present two algorithms for reducing leakage energy in functional units and data caches, respectively. Both algorithms work uniformly at the granularity of optimisation regions that are formed by the hot traces of a program. Our experimental results using Mediabench benchmarks show that good leakage energy savings can be achieved at the cost of some small performance and code size penalties. Furthermore, by varying the granularity of optimisation regions, which is a tunable parameter, embedded application programmers can make the tradeoffs between energy savings and these associated costs. © 2006 Elsevier B.V. All rights reserved. Embedded systems, Power control, Program compilers, Electric power utilization, Algorithms, Cache memory, Benchmarking, Costs
Tracking Value Function Dynamics To Improve Reinforcement Learning With Piecewise Linear Function Approximation
R Fitch, C Phua, ICML 2007,
Association for Computing Machinery, New York, NY 10036-5701, United States, New York, USA, 2007, pp. 751 - 758

Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to converge, but often do so slowly or are computationally expensive. In this paper, we propose to improve the convergence speed of piecewise linear function approximation by tracking the dynamics of the value function with the Kalman filter using a random-walk model. We cast this as a general framework in which we implement the TD, Q-Learning and MAXQ algorithms for different domains, and report empirical results demonstrating improved learning speed over previous methods. Reinforcement learning, Algorithms, Approximation theory, Error correction, Function evaluation, Kalman filters, Linear systems
Trial-Error Learning Of A Biped Gait Constrained By Qualitative Reasoning
T Yik, C Sammut, Australian conference on robotics and automation 2007, Proceedings, L. Kleeman and F. Tungadi.
Australian robotics and automation association, Australia, 2007
Two Applications Of Epistemic Logic In Computer Science
R Van Der Meyden, Logic at the crossroads, A. Gupta, et al..
Allied publishers, New Delhi, 2007
Types, Bytes, And Separation Logic
G Klein, H Tuch, M Norrish, 34th ACM SIGPLAN-SIGACT symposium on principles of programming languages, Proceedings, M. Felleisen.
ACM, New York, 2007, pp. 97 - 108
Uml Profiles For Ws-Policy4masc As Support For Business Value Driven Engineering And Management Of Web Services And Their Compositions
b suleiman, V Tosic, H Lutfiyya, 11th IEEE International EDOC Conference, Proceedings of, D. Sparrow, et al..
IEEE Computer Society, Los Alamitos, California, USA, 2007, pp. 157 - 168
Uncertainty In Preference Elicitation And Aggregation
T Walsh, AAAI-07 Proceedings, Anthony Cohn.
American Association for Artificial Intelligence, Menlo Park, CA 94025-3496, United States, Menlo Park, California, 2007, pp. 3 - 9

Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational complexity in determining which candidate or candidates can or must win the election. In this paper, we survey recent work in this area and give some new results. We argue, for example, that the set of possible winners can be computationally harder to compute than the necessary winner. As a second example, we show that, even if the unknown votes are assumed to be single-peaked, it remains computationally hard to compute the possible and necessary winners, or to manipulate the election. Copyright © 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Uncertainty analysis, Computational complexity, Computational methods
Understanding Ui Integration - A Survey Of Problems, Technologies, And Opportunities
B Benatallah, R Saint-Paul, J Yu, F Casati, F Daniel, M Matera, IEEE Internet Computing,
IEEE Computer Soc, Los Alamitos, CA, USA, 2007, pp. 59 - 66

Creating composite applications from reusable components is an important technique in software engineering and data management. Although a large body of research and development covers integration at the data and application levels, little work has been done to facilitate it at the presentation level. This article discusses the existing user interface frameworks and component technologies used in presentation integration, illustrates their strengths and weaknesses, and presents some opportunities for future work.
Using Pen Input Features As Indices Of Cognitive Load
N Ruiz, Y Shi, R Taib, F Chen, E Choi, ICMI'07 9th international conference on multimodal interfaces, Proceedings, Kazuya Takeda, et al..
ACM, New York, 2007, pp. 315 - 318
Using Practice Outcome Areas To Understand Perceived Value Of Cmmi Specific Practices For Smes
X Chen, M Staples, Software process improvement, P. Abrahamsson, et al..
Springer, Berlin, Germany, 2007, pp. 57 - 70
Validity Invariants And Effects
Y Lu, J Potter, J Xue, ECOOP 2007---Object oriented programming, E. Ernst.
Springer, Berlin, 2007, pp. 202 - 227
Vehicular Traffic Density Estimation Via Statistical Methods With Automated State Learning
E Tan, J Chen, AVSS 2007,
IEEE computer society, Piscataway, NJ, USA, 2007, pp. 164 - 169
Virtual Apparatus Approach To Constructing Adaptive Tutorials
D Ben-Naim, M Bain, N Marcus, 2007 international conference on e-learning, e-business, enterprise information systems, and e-government, Proceedings, H. Arabnia, A. Bahrami.
CSREA press, USA, 2007, pp. 3 - 10
What, Indeed, Is Intransitive Noninterference?
R Van Der Meyden, Computer security---ESORICS 2007, J. Biskup and J. Lopez.
Springer Verlag, Heidelberg, D-69121, Germany, Berlin, 2007, pp. 235 - 250

This paper argues that Haigh and Young`s definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby`s unwinding conditions for intransitive noninterference are shown to be sound and complete for one of these definitions, TA-security. Access control systems compatible with a policy are shown to be TA-secure, and it is also shown that TA-security implies that the system can be interpreted as an access control system. © Springer-Verlag Berlin Heidelberg 2007. Access control, Data transfer, Information retrieval
Winner Determination In Sequential Majority Voting
T Walsh, J Lang, M Pini, F Rossi, K Venable, 20th International joint conference on artificial intelligence, Proceedings, M. Veloso.
AAAI press, CA, USA, 2007, pp. 1372 - 1377
Wireless Mesh Networks
M Hassan, S Das, P Mohapatra, C Perkins, IEEE Communications Magazine,
, 2007, pp. 62 - 63
Wizard Of Oz For Multimodal Interface Design: Deployment Considerations
N Ruiz, R Taib, Human computer interaction: interaction, design and usability, J. Jacko.
Springer, Berlin, 2007, pp. 232 - 241
Ws Policy Based Monitoring Of Composite Web Services
A Erradi, P Maheshwari, V Tosic, 5th European conference on web services 2007, Proceedings, W. Zimmermann, et al..
IEEE, Los Alamitos, CA, USA, 2007, pp. 99 - 108
Ws-Advisor: A Task Memory For Service Composition Frameworks
B Benatallah, H Paik, S Benbernou, R Bova, S Hassas, 16th International conference on computer communications networks, Proceedings, H. Wang.
IEEE, NJ, USA, 2007, pp. 535 - 540
Ws-Policy4masc - A Ws-Policy Extension Used In The Masc Middleware
A Erradi, P Maheshwari, V Tosic, 2007 IEEE International Conference on Services Computing, Proceedings of, L.J. Zhang, et al..
Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, Unite, Los Alamitos, California, USA, 2007, pp. 458 - 465

WS-Policy4MASC is a new XML language that we developed for specification of monitoring and control (particularly, adaptation) policies in the Manageable and Adaptable Services Compositions (MASC) middleware. It extends the Web Services Policy Framework (WS-Policy) by defining new types of policy assertions. Goal policy assertions specify requirements and guarantees to be met in desired normal operation. Action policy assertions specify actions to be taken if certain conditions are met or not met. Utility policy assertions specify monetary values assigned to particular situations. Meta-policy assertions are used to specify which action policy assertions are alternatives and which business value-driven conflict resolution strategy should be used. WS-Policy4MASC also enables detailed specification of additional information necessary for run-time policy-driven management. We evaluated feasibility of the WS-Policy4MASC solutions by implementing a policy repository and other modules in MASC. We examined their usefulness on a set of realistic scenarios. © 2007 IEEE. XML, Computer programming languages, Cost accounting, Information services, Middleware, Strategic planning
Xmonad: A Tiling Window Manager
D Stewart, S Sjanssen, Haskell'07, G. Keller.
Association for Computing Machinery, New York, NY 10036-5701, United States, New York, USA, 2007, p. 119

xmonad is a tiling window manager for the X Window system, implemented, configured and dynamically extensible in Haskell. This demonstration presents the case that software dominated by side effects can be developed with the precision and efficiency we expect from Haskell by utilising purely functional data structures, an expressive type system, extended static checking and property-based testing. In addition, we describe the use of Haskell as an application configuration and extension language. Windows operating system, Computer programming languages, Computer software, Functional programming

Top Of Page

 ###
Site maintained by webmistress@cse.unsw.edu.au
Please read the UNSW Copyright & Disclaimer Statement