Theoretical and experimental studies of a new aniline derivative corrosion inhibitor for mild steel in acid medium

4-Chloro-N-(pyridin-2-ylmethyl)aniline (CPYA) was synthesized by a simple and inexpensive method and tested as a corrosion inhibitor in acid medium for mild steel by using gravimetric studies and electrochemical measurements. An average maximum efficiency of 96.0% was achieved at 4.59 mmol/L. Corrosion kinetic and thermodynamic parameters were also analyzed. Surface analyses (atomic force microscopy and scanning electron microscopy) show that protection is enabled by adsorption on the metal, forming a film. Quantum chemical calculations were performed to access information regarding the molecular structure in the corrosive medium and to support interpretation of the results obtained by experimental methods.     

Algorithms for the coalitional manipulation problem

We investigate the problem of coalitional manipulation in elections, which is known to be hard in a variety of voting rules. We put forward efficient algorithms for the problem in Borda, Maximin and Plurality with Runoff, and analyze their windows of error. Specifically, given an instance on which an algorithm fails, we bound the additional power the manipulators need in order to succeed. We finally discuss the implications of our results with respect to the popular approach of employing computational hardness to preclude manipulation.     

Cranial Base Synchondrosis Lacks PTHrP-Expressing Column-Forming Chondrocytes

The cranial base contains a special type of growth plate termed the synchondrosis, which functions as the growth center of the skull. The synchondrosis is composed of bidirectional opposite-facing layers of resting, proliferating, and hypertrophic chondrocytes, and lacks the secondary ossification center. In long bones, the resting zone of the epiphyseal growth plate houses a population of parathyroid hormone-related protein (PTHrP)-expressing chondrocytes that contribute to the formation of columnar chondrocytes. Whether PTHrP⁺ chondrocytes in the synchondrosis possess similar functions remains undefined. Using Pthrp-mCherry knock-in mice, we found that PTHrP⁺ chondrocytes predominantly occupied the lateral wedge-shaped area of the synchondrosis, unlike those in the femoral growth plate that reside in the resting zone within the epiphysis. In vivo cell-lineage analyses using a tamoxifen-inducible Pthrp-creER line revealed that PTHrP⁺ chondrocytes failed to establish columnar chondrocytes in the synchondrosis. Therefore, PTHrP⁺ chondrocytes in the synchondrosis do not possess column-forming capabilities, unlike those in the resting zone of the long bone growth plate. These findings support the importance of the secondary ossification center within the long bone epiphysis in establishing the stem cell niche for PTHrP⁺ chondrocytes, the absence of which may explain the lack of column-forming capabilities of PTHrP⁺ chondrocytes in the cranial base synchondrosis.     

An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping

Journal of Scheduling - Rapid growth of demand for remote computational power, along with high energy costs and infrastructure limits, has led to treating power usage as a primary constraint in...     

Wireless network design via 3-decompositions

We consider some network design problems with applications for wireless networks. The input for these problems is a metric space (X,d) and a finite subset UX of terminals. In the Steiner Tree with Minimum Number of Steiner Points (STMSP) problem, the goal is to find a minimum size set SX−U of points so that the unit-disc graph of S+U is connected. Let Δ be the smallest integer so that for any finite VX for which the unit-disc graph is connected, this graph contains a spanning tree with maximum degree Δ. The best known approximation ratio for STMSP was Δ−1 [I.I. Măndoiu, A.Z. Zelikovsky, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Information Processing Letters 75 (4) (2000) 165–167]. We improve this ratio to (Δ+1)/2+1+ε.In the Minimum Power Spanning Tree (MPST) problem, V=X is finite, and the goal is to find a “range assignment” on the nodes so that the edge set contains a spanning tree, and ∑_vVp(v) is minimized. We consider a particular case {0,1}-MPST of MPST when the distances are in {0,1}; here the goal is to find a minimum size set SV of “active” nodes so that the graph (V,E₀+E₁(S)) is connected, where , and E₁(S) is the set the edges in with both endpoints in S. We will show that the (5/3+ε)-approximation scheme for MPST of [E. Althaus, G. Calinescu, I. Măndoiu, S. Prasad, N. Tchervenski, A. Zelikovsky, Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks, Wireless Networks 12 (3) (2006) 287–299] achieves a ratio 3/2 for {0,1}-distances. This answers an open question posed in [E. Lloyd, R. Liu, S. Ravi, Approximating the minimum number of maximum power users in ad hoc networks, Mobile Networks and Applications 11 (2006) 129–142].     

A structural linearization principle for processes

In [11], an induction principle for processes was given which allows one to apply model-checking techniques to parameterized families of processes. A limitation of the induction principle is that it does not apply to the case in which one process depends directly upon a parameterized number of processes, which grows without bound. This would seem to preclude its application to families ofN processes interconnected in a star topology. Nonetheless, we show that if the dependency can be computed incrementally, then the direct dependency upon the parameterized number of processes may be re-expressed recursively in terms of a linear cascade of processes, yielding in effect a linearization of the inter-process dependencies and allowing the induction principle to apply.A previous version of this paper appears in the Proceedings of CAV 1993 (LNCS 697).     

Legacy code and parallel computing: updating and parallelizing a numerical model

In this paper, we present several important details in the process of legacy code parallelization, mostly related to the problem of maintaining numerical output of a legacy code while obtaining a balanced workload for parallel processing. Since we maintained the non-uniform mesh imposed by the original finite element code, we have to develop a specially designed data distribution among processors so that data restrictions are met in the finite element method. In particular, we introduce a data distribution method that is initially used in shared memory parallel processing and obtain better performance than the previous parallel program version. Besides, this method can be extended to other parallel platforms such as distributed memory parallel computers. We present results including several problems related to performance profiling on different (development and production) parallel platforms. The use of new and old parallel computing architectures leads to different behavior of the same code, which in all cases provides better performance in multiprocessor hardware.

     

Automatic CoDec generation to reduce test engineering cost

TTCN-3 is an abstract language for specification of Abstract Test Suites. Coding of TTCN-3 values into physically transmittable messages and decoding of bitstrings into their TTCN-3 representation has been removed from the language itself and relayed to external and specialized components, called CoDec. CoDec development, either implicitly or explicitly, is a must in any TTCN-3 testing activity. Field experience showed that there is a high cost associated with CoDec development and maintenance. To achieve adequate software engineering practices, a set of types, tools and definitions were developed. This paper unveils gray areas in TTCN-3 architecture and presents a methodological approach to minimize the complexity of CoDec development. Even though the initial field of application is IPv6 testing, the main tool introduced—the CoDec Generator—is a valuable tool in any testing application domain. It is designed to lower the CoDec maintenance costs in all test case lifecycle stages, from development to maintenance. This work has been partly supported by the IST Go4IT European project: .