On spiking neural P systems and partially blind counter machines

A k-output spiking neural P system (SNP) with output neurons, , generates a tuple of positive integers if, starting from the initial configuration, there is a sequence of steps such that during the computation, each O _i generates exactly two spikes aa (the times the pair aa are generated may be different for different output neurons) and the time interval between the first a and the second a is n _i . After the output neurons generate their pairs of spikes, the system eventually halts. We give characterizations of sets definable by partially blind multicounter machines in terms of k-output SNPs operating in a sequential mode. Slight variations of the models make them universal.     

A unified access bound on comparison-based dynamic dictionaries

We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w(y)$w\left(y\right)$ distinct elements have been accessed since the last access to element y$y$, and d(x,y)$d(x,y)$ denotes the rank distance between x$x$ and y$y$ among the current set of elements, then the amortized cost to access element x$x$ is O(_minylog[w(y)+d(x,y)+2])$O({min}_{y}log[w\left(y\right)+d(x,y)+2])$. This property generalizes the working-set and dynamic-finger properties of splay trees.     

Efficient retrieval of replicated data

Declustering is a common technique used to reduce query response times. Data is declustered over multiple disks and query retrieval can be parallelized. Most of the research on declustering is targeted at spatial range queries and investigates schemes with low additive error. Recently, declustering using replication has been proposed to reduce the additive overhead. Replication significantly reduces retrieval cost of arbitrary queries. In this paper, we propose a disk allocation and retrieval mechanism for arbitrary queries based on design theory. Using the proposed c-copy replicated declustering scheme, buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high dimensions, supports incremental declustering and has good fault-tolerance property. Experimental results show the feasibility of the algorithm. Recommended by: Sunil Prabhakar     

Tree-systems of morphisms

Starting from the idea of determinism in membrane systems, we introduce a language generating device consisting of morphisms placed in the nodes of a tree. Initial strings are given in the leaves; by iteratively applying the morphisms to them, we produce new strings, which are collected in the root of the tree. Such a device is called a tree-system of morphisms (in short, a T system). We investigate here the power of T systems, both in the extended (a terminal alphabet is considered and only strings over it are accepted) and non-extended case, mainly in comparison with classes of languages in Lindenmayer hierarchy. Received: 8 February 2001 / 18 September 2001     

Honeymoon with IWBs: A qualitative insight in primary students' views on instruction with interactive whiteboard

The main purpose of this study was to investigate the views of primary students about interactive whiteboard [IWB] use in their classes from attitudinal and pedagogical perspectives. Research was designed as an empirical approach to phenomenology. Data was collected from fifty primary students (fourth to eighth) through focus group interviews. Nvivo 9 qualitative data analysis software was used to analyze data. Results showed that students like instruction with IWB especially for such reasons/capabilities as practical and economical use, better visual presentation, and test-based use. Students were predominantly uncomfortable with the technical problems. They believed that instruction with IWB positively impacted their learning especially because of visualization and contextualization, effective presentation, test-based use, and motivational factors. Finally it was inferred that IWBs were not used to their full potential, and both technical problems and common practices indicated that teachers were still at an initial stage of transmission to instruction with IWB and they needed both technical and pedagogical training.     

WATER QUALITY ASSESSMENT AND APPORTIONMENT OF POLLUTION SOURCES OF TIGRIS RIVER (TURKEY) USING MULTIVARIATE STATISTICAL TECHNIQUES—A CASE STUDY

The Tigris is one of the most important transboundary rivers in western Asia and originates in the Toros mountains of the Eastern Anatolia region of Turkey. Multivariate statistical techniques, such as cluster analysis (CA), principal component analysis (PCA) and factor analysis (FA), were applied for the evaluation of temporal/spatial variations and the interpretation of a water quality data set for the Tigris River, which was obtained during 1 year of monitoring. This study presents the usefulness of multivariate statistical techniques for the evaluation and interpretation of complex water quality data sets and apportionment of pollution sources/factors to obtain better information about water quality and the design of a monitoring network for the effective management of water resources. Hierarchical CA grouped 12 months into two periods (the first and second periods) and classified seven monitoring sites into three groups, that is, less polluted sites, medium polluted sites and highly polluted sites, based on similarities in the water quality characteristics. PCA/FA identified five factors in the data structure, which explained 77.5% of the total variance of the data set. This allowed us to group the selected parameters according to common features and to evaluate the influence of each group on the overall variation in water quality. Varifactors obtained from the factor analysis indicated that the parameters responsible for water quality variation were mainly related to soluble salts (natural), organic pollution and nutrients (anthropogenic). Copyright © 2011 John Wiley & Sons, Ltd.     

Iterative performance improvement of fuzzy control systems for three tank systems

This paper suggests the performance improvement of fuzzy control systems (FCSs) for three tank systems using iterative feedback tuning (IFT). The stable design of Takagi–Sugeno–Kang fuzzy controllers is guaranteed by means of a stability theorem based on LaSalle’s global invariant set theorem formulated for a class of multi input-multi output (MIMO) nonlinear processes. An IFT algorithm characterized by setting the step size to guarantee the FCS stability is proposed. The theoretical approaches are applied in a case study that deals with the IFT-based stable design of fuzzy controllers dedicated to the level control of a cylindrical three tank system as a representative MIMO system. A set of experimental results for a laboratory setup illustrates the performance improvement.     

The ratio of crystallinity and thermodynamical interactions of polycaprolactone with some aliphatic esters and aromatic solvents by inverse gas chromatography

Summary The retention diagrams of benzene, toluene, ethyl benzene, chloro benzene, n-propyl benzene, isopropyl benzene, methyl acetate, ethyl acetate, n-propyl acetate, n-butyl acetate and isoamyl acetate on the polycaprolactone were plotted at temperatures between 70 and 140^oC by inverse gas chromatography technique. Percent crystallinity of polycaprolactone were obtained at temperatures below melting point from the retention diagrams of benzene, toluene and ethyl benzene. It was concluded that the data obtained by inverse gas chromatography were comparable those of obtained by differential scanning calorimetry. Specific retention volume, V_g^o, Flory-Huggins polymer-solvent interaction parameters, ₁₂, the weight fraction activity coefficients of the solvents at infinite dilution, ₁, effective exchange energy parameters, X_eff were determined. Later, the partial molar heat of sorption, H_1,sorp and the partial molar heat of mixing, H₁ were obtained from the slope of the logarithm of specific retention volume, Ln V_g^o versus 1/T plot and from the slope of the logarithm of the weight fraction activity coefficients, ₁versus 1/T plot, respectively.     

A New Approximation Algorithm for Finding Heavy Planar Subgraphs

We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NP-hard problem of finding a heaviest planar subgraph in an edge-weighted graph G . This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH had a performance ratio exceeding 1/3 , which is obtained by any algorithm that produces a maximum weight spanning tree in G . Based on the Berman—Ramaiyer Steiner tree algorithm, the new algorithm has performance ratio at least 1/3+1/72 and at most 5/12 . We also show that if G is complete and its edge weights satisfy the triangle inequality, then the performance ratio is at least 3/8 . Furthermore, we derive the first nontrivial performance ratio (7/12 instead of 1/2 ) for the NP-hard SC MAXIMUM WEIGHT OUTERPLANAR SUBGRAPH problem.