Peer reviewed Publikation in Master Journal List
Refine
Year of publication
Document Type
- Article (121)
- Conference Proceeding (1)
Keywords
- (Strict) sign-regularity (1)
- 1D-CNN (1)
- 3D urban planning (1)
- Aboriginal people (1)
- Accelerometer (1)
- Accelerometer calibration (1)
- Actuators (1)
- Adivasi (1)
- Adolescent idiopathic scoliosis (1)
- Aerobic fermentation (1)
Institute
- Fakultät Bauingenieurwesen (8)
- Fakultät Informatik (3)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (12)
- Institut für Angewandte Forschung - IAF (21)
- Institut für Optische Systeme - IOS (7)
- Institut für Strategische Innovation und Technologiemanagement - IST (5)
- Institut für Systemdynamik - ISD (25)
- Institut für angewandte Thermo- und Fluiddynamik - IATF (2)
- Konstanzer Institut für Prozesssteuerung - KIPS (1)
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper the extended Perron complement of a principal submatrix in a matrix A is investigated. In extension of known results it is shown that if A is irreducible and totally nonnegative and the principal submatrix consists of some specified consecutive rows then the extended Perron complement is totally nonnegative. Also inequalities between minors of the extended Perron complement and the Schur complement are presented.
We consider classes of n-by-n sign regular matrices, i.e., of matrices with the property that all their minors of fixed order k have one specified sign or are allowed also to vanish, k = 1, ... ,n. If the sign is nonpositive for all k, such a matrix is called totally nonpositive. The application of the Cauchon algorithm to nonsingular totally nonpositive matrices is investigated and a new determinantal test for these matrices is derived. Also matrix intervals with respect to the checkerboard partial ordering are considered. This order is obtained from the usual entry-wise ordering on the set of the n-by-n matrices by reversing the inequality sign for each entry in a checkerboard fashion. For some classes of sign regular matrices it is shown that if the two bound matrices of such a matrix interval are both in the same class then all matrices lying between these two bound matrices are in the same class, too.
In this paper totally nonnegative (positive) matrices are considered which are matrices having all their minors nonnegative (positve); the almost totally positive matrices form a class between the totally nonnegative matrices and the totally positive ones. An efficient determinantal test based on the Cauchon algorithm for checking a given matrix for falling in one of these three classes of matrices is applied to matrices which are related to roots of polynomials and poles of rational functions, specifically the Hankel matrix associated with the Laurent series at infinity of a rational function and matrices of Hurwitz type associated with polynomials. In both cases it is concluded from properties of one or two finite sections of the infinite matrix that the infinite matrix itself has these or related properties. Then the results are applied to derive a sufficient condition for the Hurwitz stability of an interval family of polynomials. Finally, interval problems for a subclass of the rational functions, viz. R-functions, are investigated. These problems include invariance of exclusively positive poles and exclusively negative roots in the presence of variation of the coefficients of the polynomials within given intervals.
Sensorlose Positionsregelung eines hydraulischen Proportional-Wegeventils mittels Signalinjektion
(2017)
Es wird eine Methode zur sensorlosen Positionsbestimmung bei elektromagnetisch betätigten Aktoren vorgestellt. Dabei werden basierend auf einer Signalinjektion die positionsabhängigen Parameter bei der injizierten Frequenz bestimmt und daraus über ein geeignetes Modell die Position des Magnetankers ermittelt. Die Eignung des Verfahrens zur sensorlosen Positionsregelung wird an einem bidirektionalen Proportionalventil anhand praktischer Versuche demonstriert.
This work proposes a lossless data compression algorithm for short data blocks. The proposed compression scheme combines a modified move-to-front algorithm with Huffman coding. This algorithm is applicable in storage systems where the data compression is performed on block level with short block sizes, in particular, in non-volatile memories. For block sizes in the range of 1(Formula presented.)kB, it provides a compression gain comparable to the Lempel–Ziv–Welch algorithm. Moreover, encoder and decoder architectures are proposed that have low memory requirements and provide fast data encoding and decoding.
To evaluate the quality of sleep, it is important to determine how much time was spent in each sleep stage during the night. The gold standard in this domain is an overnight polysomnography (PSG). But the recording of the necessary electrophysiological signals is extensive and complex and the environment of the sleep laboratory, which is unfamiliar to the patient, might lead to distorted results. In this paper, a sleep stage detection algorithm is proposed that uses only the heart rate signal, derived from electrocardiogram (ECG), as a discriminator. This would make it possible for sleep analysis to be performed at home, saving a lot of effort and money. From the heart rate, using the fast Fourier transformation (FFT), three parameters were calculated in order to distinguish between the different sleep stages. ECG data along with a hypnogram scored by professionals was used from Physionet database, making it easy to compare the results. With an agreement rate of 41.3%, this approach is a good foundation for future research.
In several organizations, business workgroups autonomously implement information technology (IT) outside the purview of the IT department. Shadow IT, evolving as a type of workaround from nontransparent and unapproved end-user computing (EUC), is a term used to refer to this phenomenon, which challenges norms relative to IT controllability. This report describes shadow IT based on case studies of three companies and investigates its management. In 62% of cases, companies decided to reengineer detected instances or reallocate related subtasks to their IT department. Considerations of risks and transaction cost economics with regard to specificity, uncertainty, and scope explain these actions and the resulting coordination of IT responsibilities between the business workgroups and IT departments. This turns shadow IT into controlled business-managed IT activities and enhances EUC management. The results contribute to the governance of IT task responsibilities and provide a way to formalize the role of workarounds in business workgroups.
Ulrich Finsterwalder
(2017)
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper, the minors are determined from which the maximum allowable entry perturbation of a totally nonnegative matrix can be found, such that the perturbed matrix remains totally nonnegative. Also, the total nonnegativity of the first and second subdirect sum of two totally nonnegative matrices is considered.