Given a parametric LTI system, the set of parameters for which all roots lie in a prescribed region Γ in the complex plane can be determined. In a similar fashion conditions for the Nyquist plane, e.g. the Nyquist st...
详细信息
Given a parametric LTI system, the set of parameters for which all roots lie in a prescribed region Γ in the complex plane can be determined. In a similar fashion conditions for the Nyquist plane, e.g. the Nyquist stability margin, can be mapped into the parameter plane. We present a method which allows representation of objectives from both the eigenvalue and Nyquist plane. To this end, frequency domain specifications are color coded. This enables simultaneous consideration of eigenvalue and frequency domain specifications. Both numerical and symbolical computation of the color coded regions is used. The proposed method is applied to design a controller for a track-guided bus with uncertain mass and velocity.
While color-coding methods have improved the measuring efficiency of a structured light three-dimensional (3D) measurement system, they decreased the measuring accuracy significantly due to lateral chromatic aberratio...
详细信息
While color-coding methods have improved the measuring efficiency of a structured light three-dimensional (3D) measurement system, they decreased the measuring accuracy significantly due to lateral chromatic aberration (LCA). In this study, the LCA in a structured light measurement system is analyzed, and a method is proposed to compensate the error caused by the LCA. Firstly, based on the projective transformation, a 3D error map of LCA is constructed in the projector images by using a flat board and comparing the image coordinates of red, green and blue circles with the coordinates of white circles at preselected sample points within the measurement volume. The 3D map consists of the errors, which are the equivalent errors caused by LCA of the camera and projector. Then in measurements, error values of LCA are calculated and compensated to correct the projector image coordinates through the 3D error map and a tri-linear interpolation method. Eventually, 3D coordinates with higher accuracy are re-calculated according to the compensated image coordinates. The effectiveness of the proposed method is verified in the following experiments.
In the pursuit of high-precision load identification, traditional methodologies grapple with significant drawbacks, including low recognition rates, intricate signature construction, and narrow applicability. This stu...
详细信息
In the pursuit of high-precision load identification, traditional methodologies grapple with significant drawbacks, including low recognition rates, intricate signature construction, and narrow applicability. This study introduces a novel approach employing weighted recursive graph (WRG) color coding to surmount these challenges. Power consumption data, procured from advanced load monitoring devices, undergo extraction of single-cycle currents, which are then subjected to dimensional reduction via Piece-wise Aggregate Approximation (PAA). In a transformative step, these currents are encoded into load signatures through the recursive graph time series methodology, culminating in the generation of WRG images. An AlexNet neural network model is engaged to distil and assimilate the distinctive features of the WRG images. The simulation results indicate that the identification rate can exceed 97%. Additionally, an experimental platform was set up to verify the method proposed in this paper, and the results show that the actual identification rate can reach over 96%. Both the simulation results and experiments fully demonstrate that the proposed identification method has a high accuracy. This method not only sets a new standard in non-intrusive load identification but also enhances the generalization of load signature applicability across diverse scenarios.
The research in the parameterized 3D-MATCHING problem has yielded a number of new algorithmic techniques and an impressive list of improved algorithms. In this article, a new deterministic algorithm for the problem is...
详细信息
The research in the parameterized 3D-MATCHING problem has yielded a number of new algorithmic techniques and an impressive list of improved algorithms. In this article, a new deterministic algorithm for the problem is developed that integrates and improves a number of known techniques, including greedy localization, dynamic programming, and color coding. The new algorithm, which either constructs a matching of k triples in a given triple set or correctly reports that no such a matching exists, runs in time O*(2.80(3k)), improving a long list of previous algorithms for the problem.
In this paper, a novel color-coding method for absolute phase measurement is proposed. A three steps phase-shift algorithm was adopted to calculate the relative phase (wrapped phase) because of the least need of image...
详细信息
In this paper, a novel color-coding method for absolute phase measurement is proposed. A three steps phase-shift algorithm was adopted to calculate the relative phase (wrapped phase) because of the least need of images. color strips were used to mark each 2 pi phase-change period and three neighboring colors as a group were used as codewords to identify the fringe orders. With the two parts, relative phase and fringe orders, the absolute phase can be obtained directly. We selected five colors (black, red, green, blue, and white) to test our algorithm, and nearly 60 different codewords were embedded in one image. The fringe orders and the relative phase are calculated simultaneously, and this algorithm can circumvent the phase unwrapping process. Moreover, errors will not diffuse, because the relative phase and fringe orders are uncorrelated. Besides, no need of unwrapping processing will lead to high speed in 3D profile measurement. In addition, large object can be measured with high precision using this method owe to enormous codewords can be embedded in one color image. One experiment with a small object and a big complex object was designed to test the algorithm for separate objects, and experimental results showed the validity of our algorithm for absolute phase measurement. (C) 2013 Elsevier B.V. All rights reserved.
Previous work has identified attribute level overlap and level color coding as effective and attractive strategies to reduce task complexity and improve behavioral efficiency in discrete choice experiments (DCEs). How...
详细信息
Previous work has identified attribute level overlap and level color coding as effective and attractive strategies to reduce task complexity and improve behavioral efficiency in discrete choice experiments (DCEs). However, the simultaneous and combined impact of level overlap and level color coding on attribute non-attendance and choice consistency has not yet been investigated. To address this limitation and to strengthen the available evidence base, this paper reanalyzed an existing randomized controlled DCE from the Netherlands (N = 2,731) and analyzed a new randomized controlled DCE conducted in the United Kingdom (N = 3,084) using heteroskedastic attribute non-attendance mixed logit models. Both randomized controlled experiments were based on a relatively complex instrument with 5 attributes with 5 levels each and the results from both experiments were remarkably similar. In the base-case study arms without level overlap and color coding, only about half of the attributes are attended to. Level color coding as a stand-alone strategy improves attribute attendance but reduces respondents' choice consistency. In contrast, level overlap as a stand-alone strategy improves attribute attendance while simultaneously increasing respondents' choice consistency. The combination of level overlap and color coding is even more effective: it results in approximately full attribute attendance and a 30% increase in respondents' choice consistency. Experimental designs with level overlap are therefore recommended as a default design strategy and level color coding recommended to further increase respondents' behavioral efficiency in complex DCEs.
Founding proper reading and comprehension abilities of the Arabic written text is of great significance for learners of the language since this is a means for extracting the linguistic and cultural knowledge. This pro...
详细信息
ISBN:
(纸本)9781509026418
Founding proper reading and comprehension abilities of the Arabic written text is of great significance for learners of the language since this is a means for extracting the linguistic and cultural knowledge. This process is complex in Arabic since the script is interwoven and multiple segments can be fused to create a single word which in return complicates identifying word units for new learners and accordingly delays proper acquisition. Proper acquisition is defined here as the ability to fluently read the text as well as manage to decode word parts formed by the agglutination of affixes. This paper introduces the requirements for software that simplifies instruction on word decoding and comprehension through utilizing color-coding on Arabic text.
Previous research has shown multihue scales to be well-suited to code categorical features and shown lightness scales to be well-suited to code ordinal quanti. ties. We introduce an algorithm, Motley, that produces co...
详细信息
Previous research has shown multihue scales to be well-suited to code categorical features and shown lightness scales to be well-suited to code ordinal quanti. ties. We introduce an algorithm, Motley, that produces color scales varying in both hue and lightness, intended to be effective for both categorical and ordinal coding, allowing users to determine both absolute and relative quantities efficiently and accurately. The algorithm first determines the lightnesses of scale colors to maximize perceived lightness differences and establish the lightness ordering, generating separate search spaces for each scale position. It then selects hues by heuristic search to maximize the discriminability of the scale. It produces scales that are ordered with respect to lightness but unordered with respect to hue and thus more discriminable than typical multihue lightness scales. In an experimental evaluation on human subjects, Motley's scales enabled accurate judgments of relative quantity, with response times superior to unordered multihue scales and comparable to ordered lightness scales, and enabled accuracy and speed of judgments of absolute quantity superior to lightness scales and comparable to multihue scales. (dagger)Published 2009 Wiley Periodicals, Inc. Col Res Appl, 35, 18-28, 2010;Published online 17 November 2009 in Wiley InterScience (***). DOI 10.1002/col.20559
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we focus on the local patterns in simplicial complexes called simplets, a gen...
详细信息
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we focus on the local patterns in simplicial complexes called simplets, a generalization of graphlets. We study the problem of counting simplets of a given size in a given simplicial complex. For this problem, we extend a sampling algorithm based on color coding, from graphs to simplicial complexes, with essential technical novelty. We theoretically analyze our proposed algorithm named SC3, showing its correctness, unbiasedness, convergence, and time/space complexity. Through extensive experiments on sixteen real-world datasets, we show the superiority of SC3 in terms of accuracy, speed, and scalability, compared to the baseline methods. We use the counts given by SC3 for simplicial complex analysis, especially for characterization, which is further used for simplicial complex clustering, where SC3 shows a strong ability of characterization with domain-based similarity. Additionally, we explore a variant of simplet counting (specifically, estimating the relative counts of simplets) under realistic scenarios where the entire simplicial complex is not provided at once but can only be partially accessed, for instance, through a limited number of API calls. For such scenarios, we propose a random-walk-based sampling algorithm, SCRW, and analyze its theoretical properties. In our experiments, SCRW requires, on average, 16.5x\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$16.5\times $$\end{document} less memory than SC3, while the speed-accuracy trade-offs provided by the two methods are comparable.
暂无评论