Search results for "Abstract data type"
showing 10 items of 1140 documents
Nondivisibility among character degrees II: Nonsolvable groups
2007
We say that a finite group G is an NDAD-group (no divisibility among degrees) if for any 1 < a < b in the set of degrees of the complex irreducible characters of G, a does not divide b. In this article, we determine the nonsolvable NDAD-groups. Together with the work of Lewis, Moreto and Wolf (J. Group Theory 8 (2005)), this settles a problem raised by Berkovich and Zhmud’, which asks for a classification of the NDAD-groups.
Elementary Action Systems
2015
This chapter expounds basic notions. An elementary action system is a triple consisting of the set of states, the transition relation between states, and a family of binary relations defined on the set of states. The elements of this family are called atomic actions. Each pair of states belonging to an atomic action is a possible performance of this action. This purely extensional understanding of atomic actions is close to dynamic logic. Compound actions are defined as sets of finite sequences of atomic actions. Thus compound actions are regarded as languages over the alphabet whose elements are atomic actions. This chapter is concerned with the problem of performability of actions and the…
Notes on the Use of the Tables of Standard ISO 7730 for the Evaluation of the PMV Index
1996
Standard ISO 7730, which is also known as European Standard EN-ISO 7730, provides two alternative methods for the evaluation of the predicted mean vote (PMV) index: a calculation program and a set of tables. In order to use the tables, the operative temperature must be calculated beforehand. The impres sion is given from reading the standard that for a relative humidity of 50%, the two methods are equivalent, i.e. provide the same value for PMV, from the same initial values. In this paper, examples are given showing that the two methods are not equivalent. Differences between them are analysed and a proposal made to introduce an amendment in the next revision of the stan dard.
Quantum state engineering using one-dimensional discrete-time quantum walks
2017
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin, and providing …
Atom, atom-type and total molecular linear indices as a promising approach for bioorganic and medicinal chemistry: theoretical and experimental asses…
2004
Abstract Helminth infections are a medical problem in the world nowadays. In this paper a novel atom-level chemical descriptor has been applied to estimate the anthelmintic activity. Total and local linear indices and linear discriminant analysis were used to obtain a quantitative model that discriminates between anthelmintic and non-anthelmintic drug-like compounds. The discriminant model has an accuracy of 90.11% in the training set, with a high Matthews’ correlation coefficient (MCC = 0.80). To assess the robustness and predictive power of the obtained model, internal (leave-n-out) and external validation process was performed. The QSAR model correctly classified 88.55% of compounds in t…
Mappings of finite distortion : size of the branch set
2018
Abstract We study the branch set of a mapping between subsets of ℝ n {\mathbb{R}^{n}} , i.e., the set where a given mapping is not defining a local homeomorphism. We construct several sharp examples showing that the branch set or its image can have positive measure.
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
2021
The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …
A Data-Based Approach for Modeling and Analysis of Vehicle Collision by LPV-ARMAX Models
2013
Published version of an article in the journal: Journal of Applied Mathematics. Also available from the publisher at: http://dx.doi.org/10.1155/2013/452391 Open Access Vehicle crash test is considered to be the most direct and common approach to assess the vehicle crashworthiness. However, it suffers from the drawbacks of high experiment cost and huge time consumption. Therefore, the establishment of a mathematical model of vehicle crash which can simplify the analysis process is significantly attractive. In this paper, we present the application of LPV-ARMAX model to simulate the car-to-pole collision with different initial impact velocities. The parameters of the LPV-ARMAX are assumed to …
Delay-Probability-Distribution-Dependent FIR Filtering Design with Envelope Constraints
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/930927 Open Access This paper studies the problem of H∞ finite-impulse response (FIR) filtering design of time-delay system. The time-delay considered here is time-varying meanwhile with a certain stochastic characteristic, and the probability of delay distribution is assumed to be known. Furthermore, the requirement of pulse-shape is also considered in filter design. Employing the information about the size and probability distribution of delay, a delay-probability-distribution-dependent criterion is proposed for the filtering error syst…
Discovering representative models in large time series databases
2004
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical observations could allow to perform diagnosis and/or prognosis. Moreover, the efficient discovery of frequent patterns may play an important role in several data mining tasks such as association rule discovery, clustering and classification. However, in order to identify interesting repetitions, it is necessary to allow errors in the matching patterns; in this context, it is difficult to select one pattern particularly suited to represent the set of similar ones, whereas modelling this set with a single model could…