Recent developments in cyber-infrastructure and emerging virtual science collaboratories are enabling scientists to transparently co-develop, share, and communicate diverse forms of knowledge artifacts in real-time. U...
详细信息
Recent developments in cyber-infrastructure and emerging virtual science collaboratories are enabling scientists to transparently co-develop, share, and communicate diverse forms of knowledge artifacts in real-time. Using collective action theory as a basis, we introduce an agent-based model of such collaborative environments as complex adaptive social communication systems. By examining empirical data from the Open Biomedical Ontologies (OBO) Foundry, we present a conceptually grounded agent-based model of what we call Global Participatory science (GPS). The model represents the dynamics of GPS in terms of the information foraging, social exposure, and preferential attachment mechanisms. We monitor social network metrics and activity patterns as proxy metrics to infer innovation potential of collaboration networks. In this paper, we introduce our CollectiveInnoSim model and demonstrate the impact of foraging and preferential attachment mechanisms on emergent social network structures. The objective is to further our understanding of the dynamics of GPS and facilitate developing informed policies fostering innovation potential.
National Information and Communications Technology Australia (NICTA) is the largest ICT research center in Australia, having been established 10 years ago in 2002. It has five laboratories in four Australian capital c...
详细信息
Designing and building embedded systems is a challenging problem. Designers must ensure that the software architecture meets its functional requirements and also, since embedded systems often have real-time constraint...
详细信息
Designing and building embedded systems is a challenging problem. Designers must ensure that the software architecture meets its functional requirements and also, since embedded systems often have real-time constraints, meets its performance requirements. It is usually difficult to determine whether or not the embedded system designs will meet functional and performance requirements. To help increase confidence in embedded software architectures, designers often turn to executable model based approaches to assess their systems. There are many different approaches for designing and analyzing real-time embedded systems. This paper is intended to help designers in their choice by comparing two different executable model based approaches for designing and validating real-time embedded systems, namely state machines and colored Petri nets. Both approaches are compared using seven different comparison criteria and examples are given from a cruise control system case study.
Dynamic system management may involve interaction between independent decision-making components which can lead to conflicts. Policy-based Managers Coordination (PobMC) was proposed as an adaptive framework that may h...
详细信息
ISBN:
(纸本)9781467308946
Dynamic system management may involve interaction between independent decision-making components which can lead to conflicts. Policy-based Managers Coordination (PobMC) was proposed as an adaptive framework that may handle such conflicts. In PobMC, policies are used to adapt the system behavior, coordinate managers' tasks and allow us to decouple the adaptation concerns from the application code. Thus, it is required to ensure whether the governing policies are enforced correctly. In this paper we check and evaluate the dynamic conflict avoidance algorithm proposed in our previous works. Policy combination algorithms (PACs) concepts are used in the analysis and the evaluation to avoid policy conflicts and to reach a unique decision.
Support vector machine (SVM) is a pattern classification model suitable for classification and annotation of images using non-vectorial type representations of images. Varying length patterns extracted from image data...
详细信息
Support vector machine (SVM) is a pattern classification model suitable for classification and annotation of images using non-vectorial type representations of images. Varying length patterns extracted from image data correspond to sets of local feature vectors. Kernels designed for varying length patterns are called as dynamic kernels. The talk presents the issues in designing the dynamic kernel based SVMS for classification and annotation of images. Different methods for designing the dynamic kernels are presented. An intermediate matching kernel (IMK) for a pair of varying length patterns is constructed by matching the pairs of local feature vectors selected using a set of virtual feature vectors. For patterns corresponding to sets of feature vectors, a Gaussian mixture model (GMM) is used as the set of virtual feature vectors. The GMM-based IMK is considered for image processing tasks such as image classification, matching and annotation in content-based image retrieval. The talk presents results of experimental studies on image classification, annotation and retrieval of images using the kernel methods.
RC4 is a stream cipher that makes use of aninternal state table, S, which represents a permutation over Z 2 8 . GGHN is a relatively more efficient stream cipher whose design is inspired from RC4 but whose S table, ho...
详细信息
RC4 is a stream cipher that makes use of aninternal state table, S, which represents a permutation over Z 2 8 . GGHN is a relatively more efficient stream cipher whose design is inspired from RC4 but whose S table, however, does not represent a permutation over Z 2 m. In this paper, we point out one challenging aspect of the latter design principle. In particular, we assess GGHN-like algorithms with respect to weak states, in which all internal state words and output elements are even. Once GGHN is absorbed in a weak state, the least significant bit of the plaintext words will be revealed only by looking at the ciphertext. By modelling the algorithm by a Markov chain and calculating chain's absorption time, we show that the average number of steps required by these algorithms to enter this weak state can be lower than expected at first glance and hence caution should be exercised when estimating this number.
Can we reuse some of the huge code-base developed in C to take advantage of modern programming language features such as type safety, object-orientation, and contracts? This paper presents a source-to-source translati...
详细信息
Can we reuse some of the huge code-base developed in C to take advantage of modern programming language features such as type safety, object-orientation, and contracts? This paper presents a source-to-source translation of C code into Eiffel, a modern object-oriented programming language, and the supporting tool C2Eif. The translation is completely automatic and supports the entire C language (ANSI, as well as many GNU C Compiler extensions, through CIL) as used in practice, including its usage of native system libraries and inlined assembly code. Our experiments show that C2Eif can handle C applications and libraries of significant size (such as vim and libgsl), as well as challenging benchmarks such as the GCC torture tests. The produced Eiffel code is functionally equivalent to the original C code, and takes advantage of some of Eiffel's features to produce safe and easy-to-debug translations.
The aim of the ERAMIS project is to set up a network of Master's degree Informatics as a Second Competence among 9 beneficiary universities of Kazakhstan, Kyrgyzstan and Russia, and 5 European universities. This c...
详细信息
It is well recognized that visualizing traceability links between software artifacts helps developers to recover, browse, and maintain these inter-relationships effectively and efficiently. However, it is a major chal...
详细信息
It is well recognized that visualizing traceability links between software artifacts helps developers to recover, browse, and maintain these inter-relationships effectively and efficiently. However, it is a major challenge for researchers to efficiently visualize traceability links for big softwaresystems because of scalability and visual clutter issues. In this paper we present a new approach that combines treemap and hierarchical tree visualization techniques to provide a global structure of traces and a detailed overview of each trace. These both reduce visual clutter while still being highly scalable and interactive. Our usability study shows that our approach can support comprehension, browsing, and maintenance of traceability links.
Relaying is a very promising technique to improve the reliability of data transmission in wireless (industrial) networks. With relaying, relay nodes support source nodes in carrying out retransmissions. A common assum...
详细信息
Relaying is a very promising technique to improve the reliability of data transmission in wireless (industrial) networks. With relaying, relay nodes support source nodes in carrying out retransmissions. A common assumption is that relayers should be placed at “good” positions (e.g. in the middle between source and destination) to achieve benefits. In this paper we tackle the question of whether it is strictly necessary to place relayers at “good” positions (which often requires extensive measurements). We present results indicating that the benefits of relaying are achievable even with randomly placed relayers, as long as enough of them are deployed. Specifically, we present results suggesting that with a sufficient (and still not too high) number of randomly deployed relayers, the probability that all packets, sent by source nodes to a central controller in a TDMA round, reach the controller is larger than for the case with source-only retransmissions. This finding holds true both in the absence and the presence of feedback.
暂无评论