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.     

The application of semantic classification trees to naturallanguage understanding

This article describes a new method for building a natural language understanding (NLU) system, in which the system's rules are learnt automatically from training data. The method has been applied to design of a speech understanding (SU) system. Designers of such systems rely increasingly on robust matchers to perform the task of extracting meaning from one or several word sequence hypotheses generated by a speech recognizer. We describe a new data structure, the semantic classification tree (SCT), that learns semantic rules from training data and can be a building block for robust matchers for NLU tasks. By reducing the need for handcoding and debugging a large number of rules, this approach facilitates rapid construction of an NLU system. In the case of an SU system, the rules learned by an SCT are highly resistant to errors by the speaker or by the speech recognizer because they depend on a small number of words in each utterance. Our work shows that semantic rules can be learned automatically from training data, yielding successful NLU for a realistic application     

QUEUE

Ohne Zusammenfassung     

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     

Ultrastructure of a bio-electrolytic methanogenic/methanotrophic granular biofilm for the complete degradation of tetrachloroethylene in contaminated groundwater.

The electrolytical methanogenic/methanotrophic coupling (eMaMoC) process was tested in a laboratory-scale single-stage reactor for the treatment of tetrachloroethene (PCE)-contaminated waters. A water electrolysis cell was placed directly in the effluent recirculation loop for the supply of both O2 and H2 to the system: H2 serving as the electron donor for both carbonate reduction into CH4 and reductive dechlorination. The concurrent presence of O2 and CH4 could be used by the methanotrophs for co-metabolically oxidising the chlorinated intermediates left over by the anaerobic transformation of PCE. At a PCE inlet of 33-52 microM and a hydraulic residence time (HRT) of 5.6 days, PCE reductive dechlorination to dichloroethene (DCE) was over 95% with a maximum DCE mineralisation of 83%. Fluorescence in situ hybridisation with 16S rRNA probes related to type I and type II methanotrophic bacteria were utilised to localise the methanotrophic communities in the anaerobic/aerobic granules. It evidenced that with operational time, along with increasing oxygenation rate, methanotrophic communities were specifically colonising onto the outermost layer of the anaerobic/aerobic granule.     

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.     

Practical Interdomain Routing Security

This article reviews risks and vulnerabilities in interdomain routing and best practices that can have near-term benefits for routing security. It includes examples of routing failures and common attacks on routers, and countermeasures to reduce router vulnerabilities.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92