A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

Effect of beta-lactamase-catalyzed hydrolysis of cephalosporins on peroxynitrite-mediated nitration of serum albumin and cytochrome c

The hydrolysis of beta-lactam antibiotics by beta-lactamases is one of the major bacterial defense systems. These enzymes generally hydrolyze a variety of antibiotics including the latest generation of cephalosporins, cephamycins and imipenem. In this paper, the effect of cephalosporins-based antibiotics on the peroxynitrite-mediated nitration of protein tyrosine is described. Although some of the antibiotics have weak inhibitory effect on the nitration reactions in the absence of beta-lactamase, they exhibit very strong inhibition in the presence of beta-lactamase. This is due to the elimination of heterocyclic thiol/thione moieties from cephalosporins by beta-lactamase-mediated hydrolysis. After the elimination, the thiols/thiones effectively scavenge peroxynitrite, leading to the inhibition of the nitration reactions.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

Access Control in Communication Systems

Access control is an important component in the security of communication systems. While cryptography has rightfully been a significant component in the design of large scale communication systems, its relation to access control, especially its complementarity, has not often been brought out in full. With the wide availability of SELinux, a comprehensive model of access control has all the more become important. In many large scale systems, access control and trust management have become important components in the design. In survivable systems, models of group communication systems may have to be integrated with access control models. In this paper, we discuss the problem of integrating various formalisms often encountered in large scale communication systems, especially in connection with dynamic access control policies as well as trust management

Optimal Parameterized Policies for Resource Allocation in Communication Networks

The problem of finding optimal parameterized feedback policies for dynamic bandwidth allocation in communication networks is studied. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider two different classes of multilevel closed-loop feedback policies for the system and use a two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm to find optimal policies within each prescribed class. We study the performance of the proposed algorithm on a numerical setting and show performance comparisons of the two optimal multilevel closedloop policies with optimal open loop policies. We observe that closed loop policies of Class B that tune parameters for both the queues and do not have the constraint that the entire bandwidth be used at each instant exhibit the best results overall as they offer greater flexibility in parameter tuning. Index Terms — Resource allocation, dynamic bandwidth allocation in communication networks, two-timescale SPSA algorithm, optimal parameterized policies. I.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

Pre-emptive queue processing scheme for handovers in mobile cellular communication systems

A new scheme for minimizing handover failure probability in mobile cellular communication systems is presented. The scheme involves a reassignment of priorities for handover requests enqueued in adjacent cells to release a channel for a handover request which is about to fail. Performance evaluation of the new scheme carried out by computer simulation of a four-cell highway cellular system has shown a considerable reduction in handover failure probability

Computer Simulation Of Random Sphere Packing In An Arbitrarily Shaped Container

Most simulations of random sphere packing concern a cubic or cylindric container with periodic boundary, containers of other shapes are rarely studied. In this paper, a new relaxation algorithm with pre-expanding procedure for random sphere packing in an arbitrarily shaped container is presented. Boundaries of the container are simulated by overlapping spheres which covers the boundary surface of the container. We find 0.4 similar to 0.6 of the overlap rate is a proper value for boundary spheres. The algorithm begins with a random distribution of small internal spheres. Then the expansion and relaxation procedures are performed alternately to increase the packing density. The pre-expanding procedure stops when the packing density of internal spheres reaches a preset value. Following the pre-expanding procedure, the relaxation and shrinking iterations are carried out alternately to reduce the overlaps of internal spheres. The pre-expanding procedure avoids the overflow problem and gives a uniform distribution of initial spheres. Efficiency of the algorithm is increased with the cubic cell background system and double link data structure. Examples show the packing results agree well with both computational and experimental results. Packing density about 0.63 is obtained by the algorithm for random sphere packing in containers of various shapes.

Jogos casuais: comunicação, entretenimento e desenvolvimento sustentável em EcoCity

A complexidade do fenômeno comunicacional desafia estudiosos do campo na atualidade, principalmente no âmbito dos ambientes sociais. O processo de interação mediada, por exemplo, ganhou grandes proporções na virada do século XXI com o advento das Tecnologias de Informação e de Comunicação (TIC). Os suportes tecnológicos eletrônicos ou computacionais passaram a nortear grande parte do entretenimento e da comunicação. Nesse caminho esta pesquisa analisa novas práticas de comunicação na atualidade e aponta como os jogos eletrônicos, ou também chamados games, vêm se conjugando nos processos de mediação nessas práticas. O trabalho envolve os jogos para computador, mais especificamente os chamados jogos casuais. O objeto de estudo são os tipos de interação social em jogos casuais online e o corpus de análise é o EcoCity, um jogo de simulação com final aberto que funciona nos sites de serviço de rede social. A abordagem da construção de cidades sustentáveis no game traz fatores ambientais à cena. A hipótese é que a socialização em torno desses fatores podem de alguma forma agregar valor nos usos e apropriações que os indivíduos fazem dos jogos casuais durante os processos comunicativos e interativos.