Synthesis at several length scales of zeolite A membranes using a continuous flow method

Zeolite A membranes were synthesized in the inner side of porous TiO₂ and α-Al₂O₃ tubular supports by a continuous method. The methodology was then used at several scales for preparing membranes on TiO₂ and α-Al₂O₃ supports with lengths of 6, 12 and 25 cm. Formation of an homogeneous zeolite film was confirmed by XRD and SEM in all supports. Single-gas permeation experiments (He, H₂, N₂ and n-C₃H₈) indicated that Knudsen diffusion was the predominant mechanism in both supports. All the synthesized membranes present high flux and moderate selectivity to water in water–ethanol mixtures.     

The relative positions of alanine residues in the hydrophobic core control the formation of two-stranded or four-stranded {alpha}-helical coiled-coils

The objective of this study was to investigate the positionaleffect of hydrophobic interactions in the -helical interfacein controlling the formation of two-stranded and four-strandedcoiled-coils. Two disulfide-bridged antiparallel coiled-coilswere designed which differ only in the position of a singleAla residue in the middle heptad: in peptide 2H the Ala residuesare in register (in the same rung), while in peptide 4H theyare not. Data from size-exclusion chromatography and sedimentationequilibrium experiments showed that under benign conditionspeptides 2H and 4H were two-stranded and four-stranded coiled-coilsrespectively. These results, in conjunction with molecular modelingstudies, suggest that when four Ala residues are in the sameplane of a potential four-stranded coiled-coil, the small sidechains of Ala would create a large cavity in the hydrophobicinterface of the potential four-stranded structure which isdestabilizing and favors the two-stranded, disulfide-bridgedcoiled-coil. In contrast, an alternating Leu-Ala hydrophobicpacking in the two planes distributes the potential cavity overa larger region, which may be partially filled by minor adjustmentsof the neighboring Leu side chains. As a result, there is stillsufficient hydrophobic contact to maintain the four-strandedstructure.     

A global optimum approach for one-layer neural networks

The article presents a method for learning the weights in one-layer feedforward neural networks minimizing either the sum of squared errors or the maximum absolute error, measured in the input scale. This leads to the existence of a global optimum that can be easily obtained solving linear systems of equations or linear programming problems, using much less computational power than the one associated with the standard methods. Another version of the method allows computing a large set of estimates for the weights, providing robust, mean or median, estimates for them, and the associated standard errors, which give a good measure for the quality of the fit. Later, the standard one-layer neural network algorithms are improved by learning the neural functions instead of assuming them known. A set of examples of applications is used to illustrate the methods. Finally, a comparison with other high-performance learning algorithms shows that the proposed methods are at least 10 times faster than the fastest standard algorithm used in the comparison.     

ARMIDA TM: Multimedia Applications across ATM-Based Networks Accessed via Internet Navigation

ARMIDA TM (Applications Retrieving Multimedia Information Distributed over ATM) is a prototypical system for experimental applications based on the interactive retrieval of multimedia information from remote data bases over ATM networks. ARMIDA TM aims at being compliant with the specifications issued by the Digital Audio Visual Council (DAVIC) for interactive multimedia services and applications, as well as at representing a sample implementation of the system specified in DAVIC 1.0. The present paper illustrates the way ARMIDA TM works to provide these applications, by describing the system hardware and software architecture and its main components, with a particular concern towards the way they interact to implement the required functionality.     

On sets of numbers accepted by P/T systems composed by join

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow.Here we continue this line of research by introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only by join. Moreover, we study how J languages relate to other families of formal languages.     

Simulation of atmospheric phenomena

This paper presents a physically based simulation of atmospheric phenomena. It takes into account the physics of non-homogeneous media in which the index of refraction varies continuously, creating curved light paths. As opposed to previous research on this area, we solve the physically based differential equation that describes the trajectory of light. We develop an accurate expression of the index of refraction in the atmosphere as a function of wavelength, based on real measured data. We also describe our atmosphere profile manager, which lets us mimic the initial conditions of real-world scenes for our simulations. The method is validated both visually (by comparing the images with the real pictures) and numerically (with the extensive literature from other areas of research such as optics or meteorology). The phenomena simulated include the inferior and superior mirages, the Fata Morgana, the Novaya–Zemlya, the Viking's end of the world, the distortions caused by heat waves and the green flash.     

Multi-agent location system in wireless networks

In this paper we propose a flexible Multi-Agent Architecture together with a methodology for indoor location which allows us to locate any mobile station (MS) such as a Laptop, Smartphone, Tablet or a robotic system in an indoor environment using wireless technology. Our technology is complementary to the GPS location finder as it allows us to locate a mobile system in a specific room on a specific floor using the Wi-Fi networks.The idea is that any MS will have an agent known at a Fuzzy Location Software Agent (FLSA) with a minimum capacity processing at its disposal which collects the power received at different Access Points distributed around the floor and establish its location on a plan of the floor of the building. In order to do so it will have to communicate with the Fuzzy Location Manager Software Agent (FLMSA). The FLMSAs are local agents that form part of the management infrastructure of the Wi-Fi network of the Organization.The FLMSA implements a location estimation methodology divided into three phases (measurement, calibration and estimation) for locating mobile stations (MS). Our solution is a fingerprint-based positioning system that overcomes the problem of the relative effect of doors and walls on signal strength and is independent of the network device manufacturer.In the measurement phase, our system collects received signal strength indicator (RSSI) measurements from multiple access points. In the calibration phase, our system uses these measurements in a normalization process to create a radio map, a database of RSS patterns. Unlike traditional radio map-based methods, our methodology normalizes RSS measurements collected at different locations on a floor. In the third phase, we use Fuzzy Controllers to locate an MS on the plan of the floor of a building.Experimental results demonstrate the accuracy of the proposed method. From these results it is clear that the system is highly likely to be able to locate an MS in a room or adjacent room.     

Developing control logic using aspect-oriented programming and sequence planning

A fundamental functionality of a Programmable Logic Controller (PLC) is to control and execute a set of operations. But a large part of the program code is more involved in supporting the user with concerns like alarm, HMI, communication, safety and manual control. Code related to these supporting concerns is often tangled with operation execution code, the core concerns, which makes it hard to reuse.This paper describes a method to reuse code and functionality when developing PLC programs and code libraries. The method proposes that core concerns are planned with a software tool called Sequence Planner, and the supporting concerns are integrated into the core concerns with a tool based on aspect-oriented programming.     

Sampling-sensitive multiresolution hierarchy for irregular meshes

Previous approaches of constructing multiresolution hierarchy for irregular meshes investigated how to overcome the connectivity and topology constraints during the decomposition, but did not consider the effects of sampling information on editing and signal processing operations. We propose a sampling-sensitive downsampling strategy and design a decomposition framework that produces a hierarchy of meshes with decreasing maximum sampling rates and increasingly regular vertex support sizes. The resulting mesh hierarchy has good quality triangles and enables more stable editing. The detail vectors better approximate the frequency spectrum of the mesh, thus making signal filtering more accurate.     

A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

In this paper we deal with the survivable internet protocol (IP)/multi-protocol label switching (MPLS)-over-wavelength switched optical network (WSON) multi-layer network optimization problem (SIMNO). This problem entails planning an IP/MPLS network layer over a photonic mesh infrastructure whilst, at the same time, ensuring the highest availability of services and minimizing the capital expenditures (CAPEX) investments. Such a problem is currently identified as an open issue among network operators, and hence, its solution is of great interest. To tackle SIMNO, we first provide an integer linear programming (ILP) formulation which provides an insight into the complexity of its managing. Then, a greedy randomized adaptive search procedure (GRASP) with path-relinking (PR) together with a biased random-key genetic algorithm (BRKGA) are specifically developed to help solve the problem. The performance of both heuristics is exhaustively tested and compared making use of various network and traffic instances. Numerical experiments show the benefits of using GRASP instead of BRKGA when dealing with highly complex network scenarios. Moreover, we verified that the use of GRASP with PR remarkably improves the basic GRASP algorithm, particularly in real-sized, complex scenarios such as those proposed in this paper.