Search

A calendar of events related to computer science to be held between September 2009 and December 2010 is presented, which includes the 18th International Symposium on Methodologies for Intelligent Systems, the 19th International Conference on Artificial Neural Network, and the International Conference on Intelligent Computing.

The object deployment of a distributed software has a great impact on its performance. In this paper an analytical model for performance evaluation of different object deployments, is presented. The key advantage of the proposed model over the traditional Queuing Network models is the usefulness in the deployment optimization when the search space is huge and automatic instantiation of Queuing performance models corresponding to an object deployment is costly. Since our model produces an optimal deployment corresponding to each input load separately, the runtime behavior of the software corresponding to each input load should be profiled using simulation first. In this paper a translation scheme for generating the simulate-able Labeled Transition Systems (LTS) from scenarios is also presented. Moreover, two deployment algorithms (a GA-based and an INLP-based) are implemented and the results are compared. [ABSTRACT FROM AUTHOR]

Multicasting protocols deliver data packets from a source node to multiple receivers, and serve a very important function in mobile ad-hoc networks (MANETs). In this paper, a novel receiver-initiated soft-state probabilistic multicasting protocol (RISP) for MANETs is proposed. RISP is inspired by the ant colony's route-seeking mechanism, in which an individual ant chooses the optimal path to its destination through cooperation with others in a totally distributed manner. Imitating the behaviour of ants in nature, RISP introduces probabilistic forwarding and soft-state for making relay decisions that are automatically adaptive to node mobility in MANETs. Compared with other protocols, we show by computer simulations that RISP has lower delivery redundancy, while achieving higher delivery ratio at all mobility scenarios. Furthermore, RISP has lower control overhead. [ABSTRACT FROM AUTHOR]

This paper focuses on the traceability issue as key element in systems design and management of system. The work is presented through the system engineering framework with a main emphasis on requirements process. Effectively in decision making, the need for traceability model is often required in order to find out the link for a considered decision and often the semantics of such link. With the advent for information technology and integrating technical needs and business goal, the traceability find its essence and many models can now be easily implemented automatically. The paper is based on many experiences carried out ranging from audit to requirement evolution issues for impact analysis. [ABSTRACT FROM AUTHOR]

Software systems can be modeled as complex networks in which software components are abstract nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical measure, called average propagation ratio, to characterize the structural quality of general complex software networks, such as software adaptivity and maintainability. Several real-world complex software networks are analyzed in some depth to demonstrate the application of average propagation ratios. Furthermore, we investigate the key factors that determine the average propagation ratios of general complex software networks, resulting in a set of guiding principles that can be used in practical network design for improving the structural quality of complex software systems. [ABSTRACT FROM AUTHOR]

In this paper, we focus on convergence packet routing techniques in an all-optical network, obtained from an Eulerian routing in the digraph modeling the target network. Given an Eulerian circuit C in a digraph C, we deal with the maximal number diamWC of arcs that a packet has to follow on C from its origin to its destination (we talk about the ending guarantee of the routing). We consider the Eulerian diameter of C as defined by E(C) = mm C ∈ Eul(G) diamWc, where E(G) is the set of all the Eulerian circuits in C. After giving a preliminary result about the complexity of finding ((C) for any digraph G, we give some lower and upper bounds of this parameter. The main part of the paper is devoted to the description of a combinatorial design of various network topologies having good Eulerian diameters. [ABSTRACT FROM AUTHOR]

This paper proposes an adaptive network architecture, which can emulate the human knowledge as the fuzzy logic rule, and its applications as the controller for nonlinear systems. The structure of this proposed network, multi-input Fuzzy Rule Emulated Network or FREN, is derived based on human knowledge in the form of fuzzy IF-THEN rules. The initial setting of its parameters can be intuitively chosen from expert's experience. During the learning phase based on the gradient search, the learning rate can be adapted itself to remain the stability with the Lyapunov method. The performance of our network is presented by using this network as controller for the single invert pendulum plant and the water bath temperature control system. The comparison results with other conventional control algorithms such as artificial neural networks and PID controllers can be illustrated in each example. [ABSTRACT FROM AUTHOR]

In this paper we study the square grid area required for laying out H[sub l], the Boolean hypercube of N=2[sup l] vertices. It is shown that this area is [formula]. We describe a layout which occupies this much area and prove that no layout of less area exists. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of [formula] time units for the star graph of dimension n. [ABSTRACT FROM AUTHOR]

No abstract received. [ABSTRACT FROM AUTHOR]

Research on networks is increasingly popular in a wide range of machine learning fields, and structural inference of networks is a key problem. Unfortunately, network structural inference is time consuming and there is an increasing need to infer the structure of ever-larger networks. This article presents the Dense Structural Expectation Maximisation (DSEM) algorithm, a novel extension of the well-known SEM algorithm. DSEM increases the efficiency of structural inference by using the time-expensive calculations required in each SEM iteration more efficiently, and can be O(N) times faster than SEM, where N is the size of the network. The article has also combined DSEM with parallelisation and evaluated the impact of these improvements over SEM, individually and combined. The possibility of combining these novel approaches with other research on structural inference is also considered. The contributions also appear to be usable for all kinds of structural inference, and may greatly improve the range, variety and size of problems which can be tractably addressed. Code is freely available online at: . [ABSTRACT FROM AUTHOR]

Computing inference from a given knowledgebase is one of the key competences of computer science. Therefore, numerous formalisms and specialized inference routines have been introduced and implemented for this task. Typical examples are Bayesian networks, constraint systems or different kinds of logic. It is known today that these formalisms can be unified under a common algebraic roof called valuation algebra. Based on this system, generic inference algorithms for the processing of arbitrary valuation algebras can be defined. Researchers benefit from this high level of abstraction to address open problems independently of the underlying formalism. It is therefore all the more astonishing that this theory did not find its way into concrete software projects. Indeed, all modern programming languages for example provide generic sorting procedures, but generic inference algorithms are still mythical creatures. NENOK breaks a new ground and offers an extensive library of generic inference tools based on the valuation algebra framework. All methods are implemented as distributed algorithms that process local and remote knowledgebases in a transparent manner. Besides its main purpose as software library, NENOK also provides a sophisticated graphical user interface to inspect the inference process and the involved graphical structures. This can be used for educational purposes but also as a fast prototyping architecture for inference formalisms. [ABSTRACT FROM AUTHOR]