Thionine immobilized in crosslinked chitosan films

Redox and acid–base properties of thionine immobilized in crosslinked chitosan films are analyzed. The experimental conditions for the preparation of the films are described. Results obtained with cyclic voltammetry, spectroelectrochemistry and spectrophotometry indicate that the immobilized dye retains the redox and acid–base activity of free thionine. An acid dissociation constant (K_a) for the immobilized dye of K_a = 2.7 × 10⁻¹¹ was obtained.

Due to the stable and reversible pH dependent optical signal of the studied film, this membrane can be used as a building component of an optical pH sensor.     

Reconstructing design parameters of a rectangular resonator via peak signal-to-noise ratio and global optimization algorithms

This article proposes an approach for reconstructing physical parameters of a sample in a rectangular resonator during microwave radiation, knowing a priori, its electric field distribution. The inverse problem was solved using two global optimization algorithms and the peak signal-to-noise ratio (PSNR) criterion. First, the Self-regulated Fretwidth Harmony Search algorithm (SFHS) identified suitable resonant frequencies for a given configuration. Next, the unified Particle Swarm Optimization (UPSO) optimized said configuration. Together, they became a maximization strategy of the PSNR through a dual optimization process. Results showed the ability of the approach for estimating the height of each sample block and the resonating frequency of the cavity. This process takes longer to finish as a higher PSNR is demanded (mainly due to the aforementioned dual optimization). Even so, it allows for more similar electric field distributions between both, the direct and inverse problems.     

Interlocking, Ribbing and Folding: Explorations in Parametric Constructions

This paper presents three projects involving the design and fabrication of architectural structures through the use of different parametric software and digital manufacturing methods. The first project is a flexible partition composed of interlocking elements shaped using a laser-cutter. The second project is a university exhibition unit made with various wooden panels manufactured through a computer numerical controlled (CNC) system. The third project is a system of metal sheets folded by digital machines to create urban circulation spaces. The three works develop a parametric programming of geometry based on certain technical factors, enabling the recognition of patterns of interaction between formal and constructive issues involved in the definition of shapes through parametric controls. Differences in materials and processes are contrasted by similarities of function and conditions involved, creating a system of local, global, productive and environmental parameters that produces a repertoire of self-similar dimensions and variations as well as multiple possibilities of initial setups and final configurations. It suggests a specific field of design exploration focusing on the development of differentiated components and variable architectural configurations, in a kind of open parametric system.     

Improving the non-extensive medical image segmentation based on Tsallis entropy

Thresholding techniques for image segmentation is one of the most popular approaches in Computational Vision systems. Recently, M. Albuquerque has proposed a thresholding method (Albuquerque et al. in Pattern Recognit Lett 25:1059–1065, 2004) based on the Tsallis entropy, which is a generalization of the traditional Shannon entropy through the introduction of an entropic parameter q. However, the solution may be very dependent on the q value and the development of an automatic approach to compute a suitable value for q remains also an open problem. In this paper, we propose a generalization of the Tsallis theory in order to improve the non-extensive segmentation method. Specifically, we work out over a suitable property of Tsallis theory, named the pseudo-additive property, which states the formalism to compute the whole entropy from two probability distributions given an unique q value. Our idea is to use the original M. Albuquerque’s algorithm to compute an initial threshold and then update the q value using the ratio of the areas observed in the image histogram for the background and foreground. The proposed technique is less sensitive to the q value and overcomes the M. Albuquerque and k-means algorithms, as we will demonstrate for both ultrasound breast cancer images and synthetic data.     

Perceived stress,sensation seeking,and college students’ abuse of the Internet

College students (n = 140) were examined to test whether sensation seeking and perceived stress would predict abuse of the Internet. Previous studies have found that disinhibition, boredom susceptibility, and total sensation seeking scores were related to Internet abuse ( 9 and 30). Because stress has been documented to have a negative effect on students ( Pierceall & Keim, 2007), and may be linked to Internet use ( Lavoie & Pychyl, 2001), it was tested as a possible predictor of Internet abuse. This study also analyzed abuse of the Internet for sexual purposes, because sexuality is prevalent online, and college students are in an age of sexual exploration. Results of stepwise regression analyses revealed that disinhibition and total perceived stress were predictive of Internet abuse for sexual purposes, and perceived hopelessness and boredom susceptibility were predictive of Internet abuse for non-sexual purposes. Implications for students and Internet abuse are discussed.     

An algorithm for computerized automatic tuning of power system stabilizers

The main objective of this paper is to relieve the power system engineers from the burden of the complex and time-consuming process of power system stabilizer (PSS) tuning. To achieve this goal, the paper proposes an automatic process for computerized tuning of PSSs, which is based on an iterative process that uses a linear matrix inequality (LMI) solver to find the PSS parameters. It is shown in the paper that PSS tuning can be written as a search problem over a non-convex feasible set. The proposed algorithm solves this feasibility problem using an iterative LMI approach and a suitable initial condition, corresponding to a PSS designed for nominal operating conditions only (which is a quite simple task, since the required phase compensation is uniquely defined). Some knowledge about the PSS tuning is also incorporated in the algorithm through the specification of bounds defining the allowable PSS parameters. The application of the proposed algorithm to a benchmark test system and the nonlinear simulation of the resulting closed-loop models demonstrate the efficiency of this algorithm.     

SVM practical industrial application for mechanical faults diagnostic

A large percentage of the total induction motor failures are due to mechanical faults. It is well known that, machine’s vibration is the best indicator of its overall mechanical condition, and an earliest indicator of arising defects. Support vector machines (SVM) is also well known as intelligent classifier with strong generalization ability. In this paper, both, machine‘s vibrations and SVM are used together for a new intelligent mechanical fault diagnostic method. Using only one vibration sensor and only four SVM’s it was achieved improved results over the available approaches for this purpose in the literature. Therefore, this method becomes more attractive for on line monitoring without maintenance specialist intervention. Vibration signals turns out to occur in different directions (axial, horizontal or vertical) depending on the type of the fault. Thus, to diagnose mechanical faults it is necessary to read signals at various positions or use more them one accelerometer. From this work we also determined the best position for signals acquisition, which is very important information for the maintenance task.     

A semi-automatic strategy for achieving learning content and practice repurposing

The development of instructional content using Information Technologies is an expensive, time-consuming and complex process that requires new methodologies. It was in this context that the concept of Learning Objects (LOs) was proposed in order to promote reuse. However, this goal is not yet fully attained and new contributions to increase reuse are still welcome. Besides, if content is conveyed in LOs that are easier to reuse, they must be combined and sequenced in order to build more elaborated and complex content. This paper presents a strategy to deal with these problems based on the definition of small LOs here called Component Objects (COs). These COs are structured and combined according to a conceptual metamodel, which is the basis for the definition of conceptual schemas representing the existing material, including not only content but also practice. This strategy for searching, extracting, and sequencing COs, supports a teacher to better control the implementation of complex content, reducing errors in the authoring process. This approach includes a specification language and an algorithm for semi-automatic sequencing learning content and practice. Finally, a case study that shows the proposed approach and some results of using the algorithm are presented.     

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper, we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests.