Modeling of systems with overflow multi-rate traffic

The article proposes an analytical method for determining occupancy distribution and blocking probability in systems which are offered overflow traffic composed of multi-service traffic streams. The described analytical model enables determination of parameters of traffic overflowed from primary groups in hierarchically constructed telecommunication networks. The proposed method is based on an appropriate modification of the Kaufman-Roberts recursion for the full-availability group with multi-rate traffic and uses the modified Fredericks & Hayward’s approximation. Additionally, an approximate method for dimensioning systems with multi-service overflow traffic is also presented. The analytical results of the blocking probability and the results obtained in the dimensioning processes calculated using the presented methodology are compared with the data obtained from the system simulation process.     

Optimal predictor for a singular random process

An optimal predictor is developed for a singular random process generated by a known system driven by a white noise sequence. The properties of the predictor are compared with those of the optimal predictor for a nonsingular random process.     

Influence of the amount of ferromagnetic addition on the rheological properties of spinning solutions,the structure,the strength,and thermal properties of polyacrylonitrile fibres

The rheological properties of spinning solutions of polyacrylonitrile in dimethyl formamide (DMF) containing various amounts of a ferromagnetic nanoaddition were investigated. The porous structure, the strength and thermal properties of fibers obtained from these solutions were assessed, as well as the uniformity of the nanoaddition distribution on the fiber surface was estimated. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Interfacial activity and rate of palladium(II) extraction with decyl pyridine monocarboxylates

Decyl isonicotiniate and decyl nicotiniate permit a rapid extraction of palladium(II) from its hydrochloride solutions. Decyl picoliniate is not a suitable extractant. 4-Octylphenylamine can act as a phase transfer catalyst when its concentration in the organic phase is at least 2·5 × 10^?4 M . It seems that the interfacial adsorption of pyridine carboxylates and of 4-octylphenylamine is not the decisive phenomenon in palladium(II) extraction. The negligible protonation of the pyridine-type extractants and the phase transfer catalysis explains well the quick extraction of palladium(II) with the commercial and highly hydrophobic extractant ACORGA CLX-50.     

Algorithms for spatial collocation pattern mining in a limited memory environment: a summary of results

Rapid growth of spatial datasets requires methods to find (semi-)automatically spatial knowledge from these sets. Spatial collocation patterns represent subsets of spatial features whose instances are frequently located together in a spatial neighborhood. In recent years, efficient methods for collocation discovery have been developed, however, none of them assume limited size of the operational memory or limited access to memory with short access times. Such restrictions are especially important in the context of the large size of the data structures required for efficient identification of collocation instances. In this work we present and compare three algorithms for collocation pattern mining in a limited memory environment. The first algorithm is based on the well-known joinless method introduced by Shekhar and Yoo. The second and third algorithms are inspired by a tree structure (iCPI-tree) presented by Wang et al. In our experimental evaluation, we have compared the efficiency of the algorithms, both on synthetic and real world datasets.     

Iris-based human identity recognition with machine learning methods and discrete fast Fourier transform

Innovations in Systems and Software Engineering - One of the most important modules of computer systems is the one that is responsible for user safety. It was proven that simple passwords and...     

A compositional Petri net translation of general π-calculus terms

We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation.     

Towards measurable bounds on entanglement measures

While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of ${4\otimes 4}While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of 4?4{4\otimes 4} rotationally invariant states shows that the new bound is positive in regions in which the MB bound gives zero. Finally, we provide measurable upper bounds on the whole class of concurrences.     

A parallel direct solver for the self-adaptive hp Finite Element Method

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive hp$hp$-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p=1$p=1$ to p=9$p=9$. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf.