Processing math: 66%
Research article Special Issues

MIMO fuzzy adaptive control systems based on fuzzy semi-tensor product

  • Received: 30 December 2022 Revised: 01 April 2023 Accepted: 25 April 2023 Published: 13 December 2023
  • Based on fuzzy semi-tensor product (STP) algorithms and fuzzy relation matrix (FRM) models, the design of an adaptive fuzzy controller was proposed in this paper for the multivariable nonlinear systems with uncertainty. The controlled multi-input-and-multi-output (MIMO) plants were expressed and processed first by FRM models and fuzzy STP operations, and then the indirect adaptive fuzzy control laws were designed. The tracking property of the FRM models was proved for the control objective of MIMO systems. The effectiveness of the novel matrix expression was verified by simulations of the tracking control on a two-link rigid robot manipulator. Results in simulation tests show that the proposed design of adaptive FRM control is efficient for nonlinear multivariables. Therefore, the proposed indirect fuzzy adaptive controllers can be extended to general matrix expression for MIMO nonlinear systems with fuzzy STP algorithms and FRM models and online approximate unknown parameters, according to required accuracy.

    Citation: Hongli Lyu, Yanan Lyu, Yongchao Gao, Heng Qian, Shan Du. MIMO fuzzy adaptive control systems based on fuzzy semi-tensor product[J]. Mathematical Modelling and Control, 2023, 3(4): 316-330. doi: 10.3934/mmc.2023026

    Related Papers:

    [1] Markus Haas . The Cowles–Jones test with unspecified upward market probability. Data Science in Finance and Economics, 2023, 3(4): 324-336. doi: 10.3934/DSFE.2023019
    [2] Alejandro Rodriguez Dominguez, Om Hari Yadav . A causal interactions indicator between two time series using extreme variations in the first eigenvalue of lagged correlation matrices. Data Science in Finance and Economics, 2024, 4(3): 422-445. doi: 10.3934/DSFE.2024018
    [3] Dirk Tasche . Proving prediction prudence. Data Science in Finance and Economics, 2022, 2(4): 335-355. doi: 10.3934/DSFE.2022017
    [4] Jawad Saleemi . Political-obsessed environment and investor sentiments: pricing liquidity through the microblogging behavioral perspective. Data Science in Finance and Economics, 2023, 3(2): 196-207. doi: 10.3934/DSFE.2023012
    [5] Sangjae Lee, Joon Yeon Choeh . Exploring the influence of online word-of-mouth on hotel booking prices: insights from regression and ensemble-based machine learning methods. Data Science in Finance and Economics, 2024, 4(1): 65-82. doi: 10.3934/DSFE.2024003
    [6] Kazuo Sano . Intelligence and global bias in the stock market. Data Science in Finance and Economics, 2023, 3(2): 184-195. doi: 10.3934/DSFE.2023011
    [7] Dominic Joseph . Estimating credit default probabilities using stochastic optimisation. Data Science in Finance and Economics, 2021, 1(3): 253-271. doi: 10.3934/DSFE.2021014
    [8] Antoni Wilinski, Mateusz Sochanowski, Wojciech Nowicki . An investment strategy based on the first derivative of the moving averages difference with parameters adapted by machine learning. Data Science in Finance and Economics, 2022, 2(2): 96-116. doi: 10.3934/DSFE.2022005
    [9] Habib Zouaoui, Meryem-Nadjat Naas . Option pricing using deep learning approach based on LSTM-GRU neural networks: Case of London stock exchange. Data Science in Finance and Economics, 2023, 3(3): 267-284. doi: 10.3934/DSFE.2023016
    [10] Michael Jacobs, Jr . Benchmarking alternative interpretable machine learning models for corporate probability of default. Data Science in Finance and Economics, 2024, 4(1): 1-52. doi: 10.3934/DSFE.2024001
  • Based on fuzzy semi-tensor product (STP) algorithms and fuzzy relation matrix (FRM) models, the design of an adaptive fuzzy controller was proposed in this paper for the multivariable nonlinear systems with uncertainty. The controlled multi-input-and-multi-output (MIMO) plants were expressed and processed first by FRM models and fuzzy STP operations, and then the indirect adaptive fuzzy control laws were designed. The tracking property of the FRM models was proved for the control objective of MIMO systems. The effectiveness of the novel matrix expression was verified by simulations of the tracking control on a two-link rigid robot manipulator. Results in simulation tests show that the proposed design of adaptive FRM control is efficient for nonlinear multivariables. Therefore, the proposed indirect fuzzy adaptive controllers can be extended to general matrix expression for MIMO nonlinear systems with fuzzy STP algorithms and FRM models and online approximate unknown parameters, according to required accuracy.



    When firms merge, antagonistic forces emerge which affect the future pricing policy of the combined company. Disappearing competition between merging parties boosts, while decreasing marginal cost restrains the incentive for a price increase. The boost is due to the fact that, after a price increase, a portion of the diverted customers are captured by other product(s) of the now same owner. The importance of this recapture is scaled up by the price-cost margin(s). The potential restraint is due to the well-known synergies (economies of scale and scope etc.).1 In other words, after the merger, the objective functions of the companies are not separately but globally optimised. It follows that the larger the portion of the recaptured consumers, or the larger the pre-merger price-cost margins of the companies' products, or the smaller the efficiency gain, the greater the incentive for a post-merger price increase. These are the typical unilateral (non-coordinated) price issues under Bertrand competition with differentiated products.

    1 For a detailed survey, see Röller et al. (2006).

    A key element of a merger control procedure is the estimation of the resultant of the abovementioned incentives. Scientific debates have forged several simple indicators as well as more complex methods for this purpose. The spectrum of indicators is quite diverse. An important divide is whether the manner of the pass-through of costs to prices along a demand system is incorporated or not. If it is, the price increase incentive is scaled, that is, the indicator can provide a price-effect (i.e. how much a firm would increase the price of its product post-merger), and not just some outline of the magnitude. Another important aspect is the depth of the optimisation process. The indicators completely or partially lack the price-setting loops of the merging parties (i.e. the internal feedback); moreover, they completely miss the price reactions of the non-merging parties (i.e. the external feedback). Consequently, the estimate of an indicator with pass-through factor is an approximation of a full-fledged simulation's estimate. On the other hand, the indicators' need for data and time is typically less, and so they are better suited for screening purposes.

    In this article, I provide analytically the subpopulations that are flagged by the indicators as problematic (and so the alarm probabilities), with a customisable sample space and threshold. For several reasons, these formulae provide valuable prior information for the competition authorities.

    First, each authority has its own idea of what is an acceptable price increase in a given market, i.e. what is the threshold "standard". (e.g. 5 percent). Now they can finally face the potential consequence, i.e. the portion of the (market-specific) merger population they probably screen out in the long run during the initial inspection. Second, it may make them rethink their standards on the basis of the revealed trade-offs. If an indicator is thought to be acceptably accurate (a conscientious agent would not use it otherwise, would he?), and it flags, say, 95 (or 5) out of 100 mergers with a conventional threshold, the test is too strict (or too soft), and calls for higher (or lower) threshold standards. Third, such extreme (high or low) probabilities with economically reasonable thresholds may also indicate the serious inaccuracy of the indicator, but I do not address this issue in this article. Fourth, the expected rates of price increase under linear and isoelastic demands tend to be the boundary cases. In practice, however, extremes are rare. By mapping the related linear and isoelastic indicators through a specific threshold (or alarm probability), I also show that a rough interval of alarm probability (or threshold) can be estimated, behind which a foggy spectrum of alternative demand systems lurks. To sum it up, if the theories behind the indicators (and thus the accuracy) are thought to be more or less correct, the alarm probabilities provide valuable pieces of information for policymakers and theorists.

    The structure of the article is as follows. Section 2 briefly outlines the indicators. Section 3 derives their alarm probabilities analytically. Section 4 discusses the results through an arbitrary sample space. Section 5 checks the robustness of the results to the assumptions on symmetry and distribution. Section 6 concludes.

    A group of indicators does not incorporate the pass-through factor. In his pioneering work, Werden (1996) derived a formula that shows the marginal cost reduction needed to offset the incentive of a merging firm to increase the price (CMCR, Compensating Marginal Cost Reductions). It was derived under the approach that the prices of the merging parties' products are mutually adjusted. Farrell and Shapiro (2010a) presented a simpler approach, called UPP (Upward Pricing Pressure), about which they claimed to have an advantage in terms of transparency.2 It assumes that the price of the merging partner remains unchanged, that is, in contrast with CMCR, it lacks the in-house feedback. Schmalensee (2009) proposed an amendment to UPP, namely the incorporation of the cost change of the merging partner. Farrell and Shapiro (2010b) argued again that, with this complement, this indicator is more advanced at the expense of transparency. Moresi (2010) presented an indicator based on UPP, called GUPPI (Gross Upward Pricing Pressure Index), which does not account for the downward pressure of efficiencies but is accompanied by an exogenous threshold.

    2 Epstein-Rubinfeld (2010) stated that UPP is essentially a special case of a merger simulation, while Farrell and Shapiro (2010c) refused it, claiming that their information requirement is quite different.

    The other group of indicators, which I call quasi-simulations, incorporates the pass-through factor. Shapiro (2010) derived a formula assuming linear demand and that the slope (own-price derivatives) for both products is −1. It is the generalisation of Schmalensee's (2009) indicator called PCAL (Price Change Assuming Linearity) to asymmetric products (i.e. to non-identical prices, marginal costs, diversion ratios and efficiencies). Additionally, Shapiro (2010) provided another formula assuming constant elasticity of demand and full symmetry of variables. Based on linear demand, Hausman et al. (2011) derived a formula assuming identical cross-price derivatives for the demand functions (Slutsky symmetry). They argued that their assumption is more realistic than Shapiro's (2010); however, their expression does not cover efficiency gains. Hausman et al. (2011) actually provided an additional, more general formula, of which the one with Slutsky symmetry is a special case. All these metrics are called IPR (Illustrative or Indicative Price Rise). In a brief note, Salop and Moresi (2009) described how GUPPI should be transformed to measure the "first-round" price increase, both in the case of linear and isoelastic demand. In the linear case, Shapiro (2010) and Hausman et al. (2011) explicitly showed the difference between the transformed GUPPI and their more complex formulae, i.e. the effect of the feedback.

    Table 1 summarises the indicators. With the assumption of price symmetry, I can express the asymmetric formulae in terms of margins rather than prices and costs. Variable mi is the pre-merger price-cost margin of product i (Firm 1), mi=(pici)/pi. Variable dij is the diversion ratio from product i to product j (Firm 2), dij=(qj/pi)/(qi/pi) where q represents the demand. Variable ei is the efficiency gain as a proportion of the pre-merger marginal cost, ei=(cicposti)/ci. Note that originally the CMCR-equation was arranged to show the marginal cost reduction necessary to restore pre-merger prices; that is, acronym CMCR stood for the ei itself. I have rearranged the original equation to one side, and I call this expression "CMCR" for simplicity.

    In the case of UPPs and CMCR, the incentive for a price increase is signalled if the calculated value of the indicator is non-negative, while in the case of GUPPI, the dividing line is some arbitrary threshold. In the case of quasi-simulations, the alarm condition is the reaching or exceeding of some positive threshold (i.e. the maximum tolerable price increase rate) that is to be adjusted to the properties of the relevant market.

    Table 1.  Simple indicators in horizontal merger control (with my own notations).
    Asymmetry Asymmetry (exception: p1:=p2) Full symmetry Demand assumptions Thold
    Without pass-through factor UPP(FS) Farrell-Shapiro (2010a) d12(p2c2)e1c1 d12m2e1(1m1) DME(1M) - 0
    UPP(Sch) Schmalensee (2009) d12(p2(1e2)c2)e1c1=UPP1(FS)+d12e2c2 d12(m2+e2(1m2))e1(1m1) DME(1D)(1M) - 0
    CMCR a Werden (1996) d12(p2c2)+d12d21(p1c1)e1c1(1d12d21)                =UPP1(FS)+d12d21(p1c1(1e1)) d12(m2+d21m1)e1(1m1)(1d12d21) DME(1D)(1M) - 0
    GUPPI Moresi (2010) d12(p2c2)p1 d12m2 DM - R+
    With pass-through factor IPR(S) Shapiro (2010) (2d12p2c2p2e2(1p2c2p2)(d21d12))p2p1+d21(d21+d12)p1c1p14(d21+d12)2e1(1p1c1p1)(2d21(d12+d21))4(d21+d12)2 2d12m2e2(1m2)(d21d12)+d21(d21+d12)m14(d21+d12)2e1(1m1)(2d21(d12+d21))4(d21+d12)2 DM2(1D)E(1M)2 linear with equal slopes of -1 q1p1=q2p2=1 R+
    IPR(S)i b Shapiro (2010) - - DM1DM isoelastic R+
    IPR(H1) c Hausman et al. (2011) 2d12p2c2p1+d12d21p1c1p1+(p1c1)2(p2c2)p1q2q1d22142d12d21p2c2p1c1q1q2d212p1c1p2c2q2q1d221 2d12m2+d12d21m1+m21m2d21242d12d21m2m1d212m1m2d221 DM2(1D) linear R+
    IPR(H2) Hausman et al. (2011) d12(p2c2)+d12d21(p1c1)2(1d12d21)p1 d12m2+d12d21m12(1d12d21) DM2(1D) linear with Slutsky symmetry q2p1=q1p2 R+
    Gl Salop-Moresi (2009) GUPPI12p2p1=d12(p2c2)2p1p2p1 d12m22 DM2 linear R+
    Gi Salop-Moresi (2009) GUPPI11m1p2p1=d12(p2c2)p1(1m1)p2p1 d12m21m1 DM1M isoelastic R+
    a In the case of full symmetry, the CMCR after some manipulation is DM(1+D)E(1M)(1D)(1+D), and so it can be divided by 1+D since the threshold is zero.
    b The formula is given for full symmetry only.
    c In the cases of price symmetry and full symmetry, I also assumed quantity symmetry (q1:=q2).

     | Show Table
    DownLoad: CSV

    I call a test stricter if it indicates problem with greater probability when merging the ownership of two products randomly selected from the same product market.3 In this experiment, if we have three variables, diversion ratio (D), margin (M), and efficiency (E), the sample space is a cuboid,

    3 If we know the nature of the demand, such a comparison only makes sense between indicators specialised for that particular demand.

    Ω={x=(D,M,E)R3|0dminDdmax<10mminMmmax<10eminEemax<1},

    where the minimum and maximum bounds are market specific. The indicator is a random variable, I:ΩR, and a test is a pair of an indicator and a threshold, i.e. (I,t). The set of outcomes that triggers alarm is then

    A={xΩ:It}.

    The probability measure of the alarm event is

    P(A)=AΩ=A1 dE dM dDΩ1 dE dM dD=A1 dE dM dD(dmaxdmin)(mmaxmmin)(emaxemin),

    where I assumed that the joint distribution of variables is uniform. In geometric terms, the ratio of the volumes of the homogenous objects shows the probability we are looking for.

    Naturally, the concept can be generalised to higher dimensions (i.e. asymmetry of variables). In those cases, the sample space is an n-orthotope ("hypercuboid"), but otherwise the same applies as discussed above. However, over three dimensions or with non-uniform probability measure, it is cumbersome (if not impossible) to provide analytical solutions, either because of the hardship of finding the proper limits of integration or because of the integration procedure itself. In Section 5, using numerical methods, I analyse the robustness of the results to the assumptions on symmetry and distribution.

    The derivation of the alarm set of each indicator can be found in the Appendix. The Excel calculator based on these results can be downloaded from: https://doi.org/10.5281/zenodo.10895535.

    For demonstrational purposes, I discuss the results of the previous section by choosing the domains of variables covering almost all of the products. In real-world applications, i.e. when considering a specific product market, the domains should be narrowed accordingly (although, in theory, it is not excluded that there are markets with similarly wide domains). With the provided Excel calculator, anyone can easily perform their customised calculations.

    With regard to price-cost margins, there are some crutches we can rely on. Damodaran's (2018) collection of average gross profit margins by industry shows that they are mostly between 10 and 70 percent in the USA.4 Since they are averages, there must be some dispersion; thus, I expand this range into both directions with 10 percentage points.5 As for diversion ratios, we can get a blurry picture from the publicly available information of past and recent merger cases. I assume a range of 0 to 50 percent, taking into account that the diversion ratios obtained from consumer surveys tend to overestimate the true values. Regarding efficiency gain, we have the least support. Röller et al. (2006) refutes the conventional wisdom that mergers and efficiency gain often go hand in hand. Moreover, the non-robust empirical examples they cited suggest that only 30 to 70 percent of the possible cost reduction is passed on to prices. It means that in order to offset a 10 percent price increase at a pass-through rate of 0.3, marginal cost should drop by 10/0.3 = 33.3 percent, which is, although a pretty high rate, not excluded by the authors from the realms of reality. Since the efficiency variable in the indicators expresses the effective rate, I assume a range of 0 to 20 percent for this variable.

    4 I excluded banks with profit margin of 100 percent. In Europe, the same range is approximately 15 to 85 percent.

    5 Note that Butler Consultants' (2018) database on average industry profit margins shows significantly greater values than Damodaran's (2018) in lots of industries.

    First, let us get some impressions from the visualisation of the alarm sets (Figure 1).

    Figure 1.  Alarm sets (threshold for GUPPI and quasi-simulations is 0.05).
    Notes: Alarm sets expand to the southwest as threshold decreases. Recall that the floor of object IPR(S) is IPR(H1/H2).

    The alarm set of UPP(Sch)/CMCR is somewhat greater than that of UPP(FS), which is to be expected due to the boosting feedback effect (see Table 1). With the given 5 percent threshold, the difference between the alarm sets of the quasi-simulations is also quite significant. It is not surprising if we compare indicators based on different demand structures, e.g. Gl and Gi, but a remarkable discrepancy is unfortunate if comparing two indicators from the same demand class, e.g. Gl and IPR(H1/H2) (or Gi and IPR(S)i). It logically follows that at least one of a pair is certainly flawed in terms of accuracy in this particular (arbitrary) market situation, but this issue is out of the scope of this paper. In the concrete example, the difference stems from the fact that, unlike IPR(H1/H2), Gl ignores feedback effects.

    Notice the difference between UPPs and IPR(S) regarding their relationship with efficiency, which originates from their different foundations. Strictly speaking, UPPs consider efficiency gain as a must; without any, they would not give a green light to a merger. On the contrary, in the case of IPR(S), the surface intersects the D-M plane in the examined domain. That is, there are green-light cases (i.e. the projected price rise is less than the threshold) even with some loss of efficiency.

    Now, let us see the big picture on a reasonable spectrum of thresholds (Figure 2).

    Figure 2.  Alarm probabilities as a function of threshold.

    Many things reappear from our previous evaluation of Figure 1. In the group of indicators without a pass-through factor, UPPs and CMCR are quite stringent, rejecting about 60–65 percent of the mergers. GUPPI is also not a very indulgent metric. Even with a threshold of 0.1, it flags about 40 percent of the mergers, and it becomes extremely harsh at lower thresholds. In the group of quasi-simulations, IPR(S) is lenient, which is perhaps not a surprise: it assumes linear demand and is the only one that incorporates efficiency gain. Gl is also mostly permissive, but also has a severe side, similar to IPR(H1/H2). Indicators assuming isoelastic demand, IPR(S)i and Gi, are naturally more relentless, even with very high thresholds.

    With dmax+mmax>1, it is easy to prove that the order of the indicated price-effects (without efficiency) is Gl < IPR(S) = IPR(H1/H2) < Gi < IPR(S)i if 1DM>0, and IPR(S)i < Gl < IPR(S) = IPR(H1/H2) < Gi if 1DM0 (see Table 1). The peculiar position-switching of IPR(S)i comes from its "blank triangle" in the northeast (recall Figure 1). Note, however, that this phenomenon can only occur because we are exploring a sample space that includes the upper parts of the economically meaningful domain. That is, were dmax+mmax< 1, this issue would not arise at all.

    Since the price-effects under linear and isoelastic demand systems are typically the lower and upper extremes, the effects under other formations (e.g. logit, almost ideal) tend to be located somewhere between them. On this basis, the above results can also be read in more complex ways if two indicators are paired and linked accordingly. I argue that it is a handhold when facing the chasm of an unknown demand structure.

    For the sake of example, let us link Gl and Gi through a specific threshold or alarm probability. If the authority believes that the maximum tolerable price increase rate is 0.05 in the relevant market, but knows nothing about the true demand system, the portion of the problematic subpopulation can be estimated between about 40 to 70 percent (see Figure 2). Since (with tGl=tGi) Gl < GiAGlAGiP(AGl)< P(AGi), the problematic populations of the intermediate demand formations can be thought of as interpolations (see Figure 3, left side).

    Figure 3.  Overlap of alarm sets.

    What about the reverse? If the authority seeks to flag no more than 40 percent of the population, it suggests that the implied threshold is between 0.05 and 0.2, depending on the (unknown) demand. If either Gl 0.05 or Gi 0.2 is used for testing, the rejection ratio will be 40 percent. However, P(AGl)= P(AGi)AGl=AGi (see Figure 3, right side)! AGlAGi is the set of outcomes that indicates a price increase rate above 0.05 when the demand is linear, but below 0.2 when the demand is isoelastic. Consequently, here the upper bound of our interval estimate of the threshold is too high. AGiAGl is the set of outcomes that indicates a price increase rate above 0.2 when the demand is isoelastic, but below 0.05 when it is linear. Thus, here the lower bound is the one that is overestimated. With a paired testing protocol of [Gl 0.05, Gi 0.2] with at least one rejection, the mergers associated with these two "outlier" subsets would also be blocked. It follows that the rejection ratio would be bigger than 40 percent, but not by much since (AGlAGi)(AGiAGl)AGlAGi= 1 (AGlAGi)(AGlAGi)AGlAGi is moderately small.

    Choosing IPR(S)i instead of Gi, the interval estimates would not be that favourable due to the peculiar feature of this indicator. Setting an equal threshold, Gl IPR(S)i AGlAIPR(S)i, which implies that the size of the problematic subpopulation is not a monotonic function of the "curvature" of the demand system. Setting an equal probability, the corresponding alarm probability of the paired testing is significantly larger than the selected individual alarm probability, which indicates a weak overlap. However, recall that it is the matter of the selected sample space: markets with more moderate diversion ratios and margins are not affected by this issue.

    In summary, mapping indicators along a specific threshold or alarm probability may come in handy if the nature of the underlying demand is unknown. The added value of such a procedure depends on two important caveats. First, by equal thresholds, the alarm set of a linear indicator is not necessarily a proper subset of the alarm set of an isoelastic indicator, which means that the isoelastic demand only tends to (i.e. not always) lead to higher price increases. For a reliable interval estimate of the problematic population (and so the alarm probability), these exceptions need to be modest. Second, the equality of the size of the two alarm objects (and so the equality of the two alarm probabilities) does not necessarily mean a perfect overlap of the alarm objects; therefore, their union according to the paired test can be significantly bigger than the individual object. For a reliable interval estimate of the threshold, this difference needs to be minimal. In a very limited information environment, I reckon that such mappings may be the best, undoubtedly rough, approaches.

    Findings of this section:

    ● There can be huge differences between the alarm probabilities of various indicators with the same threshold, even within the same demand class.

    ● From the latter it logically follows that the accuracies can differ substantially.

    ● The respective trade-offs between threshold and alarm probability is provided for any product market with linear, isoelastic, or unknown demand system.

    ● If the demand system is unknown, a rough interval estimate of the problematic population ratio or the maximum tolerable price-effect can be given by linking the linear-demand and isoelastic-demand indicators.

    It is out of question that the results depend on the basic assumptions – the point is, however, the degree of this dependence. In this section, I explore the "cost" of simplifications (i.e. uniformity of the joint distribution of variables and full symmetry of variables).

    Unfortunately, there is no full-scale open-access database of the product variables, let alone available research on their joint probability distributions. Let us define then a non-uniform distribution, which closely reflects both theory and evidence. Werden and Froeb (2011) argued that in "Bertrand competition among differentiated products […] high degree of differentiation implies low diversion ratios causing high margins" (p. 166), and vice versa. But in practice, we might add, it is far from being a deterministic relationship. Higher than "usual" industry margins could not only be a sign of product uniqueness, but also the consequence of market inefficiency. Moreover, products with high market power could also be managed poorly, that is, with low margins. Therefore, suppose the following stochastic relationship between margin and diversion ratio:

    M=mmaxmmindmaxdminD+mmax+mmaxmmindmaxdmindmin+ξ.

    The deterministic part gives the equation of an intersecting hyperplane of the sample space. Suppose that the intersection is the set of modes of the joint distribution, and that the occurrence density decreases in proportion to the orthogonal distance from this hyperplane (H),

    f(D,M)=max{dist(ˆx,H):ˆxΩ}dist(x,H)                 =(dmaxdmin)(mmaxmmin)(dmaxdmin)2+(mmaxmmin)2                 |mmaxmmindmaxdminD+Mmmaxmmaxmmindmaxdmindmin|(mmaxmmin)2(dmaxdmin)2+1,

    where the maximum distance is naturally the distance from the edge(s) of the sample space opposite to the hyperplane. Figure 4 visualises this setup.

    Figure 4.  Sample space, set of modes, and an orthogonal distance.

    It drives us to an "inverse" distance-weighted probability measure, which, in geometric terms, is the ratio of the masses of the non-homogeneous objects,

    P(A)=AΩ=Af(D,M) dE dM dDΩf(D,M) dE dM dD.

    Figure 5 shows the difference in probabilities between the baseline case and the alternative cases.

    Figure 5.  Difference between baseline and alternative probabilities.
    Legend: Uppercase denotes full symmetry, lowercase denotes asymmetry. Reminder: UPP(Sch)=CMCR, IPR(H1)=IPR(H2), P(AGUPPI)=P(Aguppi), P(AGl)=P(Agl).

    Switching to the non-uniform ("inverse" distance-weighted) measure did not affect probabilities greatly: almost all differences are between ±5 percentage points at lower thresholds. The odd-one-out is IPR(S)i, the reason for which is easy to understand from Figure 1. The alternative distribution puts more emphasis on the area close to the main diagonal, that is, the importance of the unflagged upper right triangle of IPR(S)i plummets, and so the rejection ratio springs up.

    As for the issue of symmetry versus asymmetry, notice that (on the examined spectrum of threshold) full symmetry is usually, but not necessarily, more favourable to the merging parties; the exceptions are ipr(S) and ipr(H2) in higher ranges. Data collection challenges or short deadlines often impel competition authorities to assume symmetry, and thus it is good to be aware of the consequences of this decision. In our concrete case, the differences are mostly small, which advocates the use of the simpler approach (i.e. full symmetry).

    Findings of this section (drawn from a large sample space):

    ● Changing the probability measure from uniform to non-uniform does not affect the alarm probabilities substantially, except for IPR(S)i.

    ● The alarm probabilities under full symmetry are typically lower than under asymmetry; nevertheless, the difference is not substantial.

    Competition authorities have their visions for the tolerable post-merger price increase rates of the relevant markets. However, they do not know what portion of the relevant population is put under potential scrutiny as a result of this vision. I filled this gap by providing analytical solutions of alarm probabilities for each well-known indicator, and thus also how these indicators relate to each other. Based on these and the reverse approach (i.e. inferring the threshold from the population of interest), I also showed that the combination of two demand-specific indicators allows for more sophisticated screening tests than a "universal" indicator.

    As a consequence, I argue that the exploration of the domain of diversion ratios, margins, and efficiency gains of the merger populations is inevitable for the proper use of indicators. I also showed that the exploration of the probability distribution or the use of asymmetric variables might be useful, but they are not necessarily that important.

    From a practical point of view, the exploration of domains is incomparably easier and faster to perform than the exploration of the joint distribution. Note that competition authorities have the privilege of collecting precious data from a very broad spectrum of the economy. They could create their own dedicated database of the main variable values of their merger cases, with which they have the best chance to provide reliable estimates of the domains. Moreover, with such a database, they have the only chance of making robust estimates of the joint probability distributions. In a carefully anonymised form, this could also be made open access, classified by some product/activity standard (e.g. CPA/NACE, NAPCS/NAICS). In (sub)categories, where there are only a few items/economic actors, precaution is needed in order to prevent identifiability, but it can be easily remedied by setting the aggregation levels on a sector-specific basis. Thinking of cross-border mergers, it would be constructive if such national databases were implemented along a harmonised methodology. Not only competition authorities, but also the research community, and thus the average consumer could benefit from such "goldmines".

    Finally, no one should forget that the results of analyses (e.g. accuracy studies) based on empirical merger data are only useful as long as the economic context is relatively stable. As soon as the domains and/or the underlying relationship of the variables change, the validity of these results expires. That is why customisable tools are indispensable, especially in turbulent times.

    The author declares that he did not use Artificial Intelligence (AI) tools in the creation of this article.

    The author thanks the anonymous reviewers for their helpful comments.

    The author declares that there is no conflict of interest.

    Assumptions:

    ● full symmetry of variables,

    ● uniform distribution of variables.

    For simplicity, let d, m, e denote the upper and δ, μ, ε denote the lower bounds of the variables. Since it is not confusing, I also use the conventional notation d for differential operator.

    A. UPP(FS)=DME(1M)0

    The alarm condition rearranged to efficiency is EDM1M, which implies that A if ε<dm1m. Since

    equality holds{ε=0(D=0 M=0)ε>0D>0M>0,

    the derivations are to be separated under different lower bound conditions.

    If ε<dm1me

    ¯Lowerboundcondition1:ε=0_

    With δ=μ=0, the volume is

    d0m0DM1M dM dD.

    Substituting u=1M (du=dM), the inner integral becomes

    m0DM1MdM=D1m1u1udu=D[ulnu]1m1=D(mln(1m)). (1)

    Thus, the outer integral is

    d0D(mln(1m))dD=d2(mln(1m))2.

    With δ>0 or μ>0, the parts below these lower bounds is to be subtracted. Note that if δ>0 and μ>0, the part affected by double subtraction is to be compensated. Thus, the general formula for δ0 and μ0 is

    d2(mln(1m))2δ2(mln(1m))2d2(μln(1μ))2         +δ2(μln(1μ))2. (2)

    ¯Lower bound condition 2:ε>0_

    In order to find the proper limits of integration, let us rearrange the alarm condition to D and M, which is D>E(1M)M and M>EE+D, and thus the alarm set is

    dε(1m)mmεε+DDM1Mε1 dE dM dD=dε(1m)mmεε+D(DM1Mε)dM dD.

    Using result from [1], the inner integral becomes

    mεε+D(DM1Mε)dM=[D(Mln(1M))εM]mεε+D         =D(mln(1m)+εε+D+ln(1εε+D))εm+ε2ε+D,

    and thus the outer integral is

    dε(1m)m((mln(1m))D+εDε+D+ln(1εε+D)Dεm+ε2ε+D)dD. (3)

    First, I calculate the non-trivial indefinite integrals of the second and the third terms of [3]. Here and hereafter I do not use different notations for the constants of integration, i.e. I always stick to letter c.

    The second term of [3] is (substituting u=ε+D)

    εDε+DdD=εuεudu=ε(uεlnu)+c=ε(ε+Dεln(ε+D))+c             =ε(Dεln(ε+D))+c. (4)

    For calculating the third term of [3], we need to integrate by parts (fg=fgfg). Let

    f=ln(1εε+D)  and  g=D.

    Applying chain rule for getting f'

    f=ddDln(1εε+D)=11εε+DddD(1εε+D)=11εε+Dε(ε+D)2                  =ε(ε+D)2ε(ε+D)=εD(ε+D),

    and thus

    fg=ln(1εε+D)DdD=ln(1εε+D)D22ε(ε+D)D2dD                  =ln(1εε+D)D22ε(Dεln(ε+D))2+c,

    where (for the last step) I used the result obtained at [4].

    Remaining integrals of [3] come trivially, and thus the alarm set is

    [(mln(1m))D22+ε(Dεln(ε+D))+ln(1εε+D)D22ε(Dεln(ε+D))2                  εmD+ε2ln(ε+D)]da                  =[(mln(1m))D22+ε(Dεln(ε+D))2+ln(1εε+D)D22εmD                  +ε2ln(ε+D)]da                  =[(mln(1m))D22+εD2+ε2ln(ε+D)2+ln(1εε+D)D22εmD]da                  =[D2((mln(1m))D+ε+ln(1εε+D)D2εm)+ε2ln(ε+D)2]da                  =[D2(D(ln(1εε+D)mln(1m))+ε(12m))+ε2ln(ε+D)2]da, (5)

    where a=ε(1m)m. Since δ and μ may truncate this set, the general formula for δ0 and μ0 is

    [5][5  with d:=δ if δ>ε(1m)m][5  with m:=μ if μ>εε+d]                  +[5  with d:=δ and m:=μ if δ>ε(1μ)μ and μ>εε+δ]. (6)

    If e<dm1m

    In this case, the object part above e is to be subtracted. The alarm sets are then [2] – [6 with ε:=e] under Condition 1, and [6] – [6 with ε:=e] under Condition 2.

    B. UPP(Sch)/CMCR=DME(1D)(1M)0

    The alarm condition rearranged to efficiency is EDM(1D)(1M), which implies that A if ε<dm(1d)(1m). Since (just as with UPP(FS))

    equality holds {ε=0(D=0 M=0)ε>0D>0M>0,

    the derivation are to be separated under different lower bound conditions.

    If ε<dm(1d)(1m)e

    ¯Lower bound condition 1:ε=0_

    With δ=μ=0, the volume is

    d0m0DM(1D)(1M) dM dD.

    The inner integral becomes (like in [1])

    m0DM(1D)(1M)dM=D1D(mln(1m)),

    then the outer integral is

    d0D1D(mln(1m))dD=(d+ln(1d))(m+ln(1m)).

    With δ>0 or μ>0, the parts below these lower bounds is to be subtracted. If δ>0 and μ>0, the part affected by double subtraction is to be compensated. Thus, the general formula is

    (d+ln(1d))(m+ln(1m))(δ+ln(1δ))(m+ln(1m))                  (d+ln(1d))(μ+ln(1μ))+(δ+ln(1δ))(μ+ln(1μ)). (7)

    ¯Lower bound condition 2:ε>0_

    The alarm set is (using rearranged forms of alarm condition, DE(1M)E(1M)+M, ME(1D)E(1D)+D),

    dε(1m)ε(1m)+mmε(1D)ε(1D)+DDM(1D)(1M)ε1 dE dM dDv=dε(1m)ε(1m)+mmε(1D)ε(1D)+D(DM(1D)(1M)ε) dM dD.

    The inner integral is

    mε(1D)ε(1D)+D(DM(1D)(1M)ε)dM=D1D[Mln(1M)]mε(1D)ε(1D)+D[εM]mε(1D)ε(1D)+D                  =D1D(mln(1m)+ε(1D)ε(1D)+D+ln(1ε(1D)ε(1D)+D))εm                  +ε2(1D)ε(1D)+D,

    so the outer integral is

    da(D1D(mln(1m))+εDε(1D)+D+ln(1ε(1D)ε(1D)+D)D1Dεm                  +ε2(1D)ε(1D)+D)dD                  =da(D1D(mln(1m))+ε(1ε)Dε(1D)+D+ln(1ε(1D)ε(1D)+D)                  D1Dεm+ε2ε(1D)+D)dD, (8)

    where a=ε(1m)ε(1m)+m.

    I integrate [8] term by term as an indefinite integral. The first (combined) term is already known from previous calculations (see [1]):

    D1D(mln(1m))dD=(d+ln(1m))(m+ln(1m))+c (9)

    The second term of [8] is (substituting u=ε(1D)+D=(1ε)D+ε and du=(1ε)dD)

    ε(1ε)Dε(1D)+DdD=ε(1ε)uε1εu11εdu                  =ε1εuεudu=ε1ε(uεln(u))+c=ε((1ε)D+ε)ε2ln((1ε)D+ε)1ε+c                  =εDε2ln((1ε)D+ε)1ε+c. (10)

    The third term of [8] is

    ln(1ε(1D)ε(1D)+D)D1DdD.

    Let f=ln(1ε(1D)ε(1D)+D) and g=D1D and so

    f=ddDln(1ε(1D)ε(1D)+D)=11ε(1D)ε(1D)+DddD(1ε(1D)ε(1D)+D). (11)

    Applying chain rule and quotient rule

    ddD(1ε(1D)ε(1D)+D)=ε(ddD1ε(1D)+D+ddDDε(1D)+D)                  =ε(1ε(ε(1D)+D)2+ε(1D)+DD(1ε)(ε(1D)+D)2)                  =ε(1ε(ε(1D)+D)2+εεD+DD+εD(ε(1D)+D)2)=ε(ε(1D)+D)2. (12)

    Writing [12] to [11]

    f=11ε(1D)ε(1D)+Dε(ε(1D)+D)2=ε(ε(1D)+D)2ε(1D)(ε(1D)+D)                  =εD(ε(1D)+D).

    Function g is obtained in a familiar way (see [1])

    g=D1DdD=Dln(1D)+c.

    Now, integrating by parts we get

    fg=fgfg                  =ln(1ε(1D)ε(1D)+D)(Dln(1D))                  εD(ε(1D)+D)(Dln(1D))dD. (13)

    First part of the integral of [13] is (substituting u=ε(1D)+D=(1ε)D+ε and du=(1ε)dD)

    εε(1D)+DdD=ε1ε1udu=εln(ε(1D)+D)1ε+c, (14)

    and the second part is

    εln(1D)D(ε(1D)+D)dD.

    To solve the second part, the first move is partial fraction decomposition:

    AD+Bε(1D)+D=εD(ε(1D)+D)
    A(ε(1D)+D)+BD=ε.

    Choosing D=0 we get A=1. Using this value, by D=1 we get B=ε1. Thus, the integral of the decomposed fraction is

    εln(1D)D(ε(1D)+D)dD=ln(1D)DdD+(ε1)ln(1D)ε(1D)+DdD. (15)

    Knowing that 0dln(1D)DdD=Li2(d), and considering that [8] (the outer integral) is on domain [0,d], we can formalize the first integral of [15] as6

    6 In the Excel calculator, the dilogarithm (Li2) is approximated by trapezoidal rule with a step size of 10-5.

    ln(1D)DdD=Li2(D)+c. (16)

    Now, let us solve the second integral of [15]. Substituting u=ln(1D) (which is exp(u)=1D, and so exp(u)du=dD) we get

    (ε1)ln(1D)ε(1D)+DdD=(ε1)uεexp(u)+1exp(u)exp(u)du                  =(ε1)uexp(u)(ε1)exp(u)+1. (17)

    Let h=u and i=exp(u)(ε1)exp(u)+1 and so (substituting v=(ε1)exp(u)+1 and dv=(ε1)exp(u)du)

    i=exp(u)(ε1)exp(u)+1du=1ε11vdv=lnvε1+c=ln((ε1)exp(u)+1)ε1+c.

    Integrating by parts

    hi=hihi=uln((ε1)exp(u)+1)ε1ln((ε1)exp(u)+1)ε1.

    The latter integral term is (substituting w=(ε1)exp(u) and dw=(ε1)exp(u)du)

    hi=ln((ε1)exp(u)+1)ε1du=ln(1w)wexp(u)1(ε1)exp(u)dw                  =1ε1ln(1w)wdw=Li2(w)ε1+c=Li2((ε1)exp(u))ε1+c.

    Putting together the pieces, hi becomes

    hi=uln((ε1)exp(u)+1)ε1+Li2((ε1)exp(u))ε1+c,

    and so [17] is

    (ε1)ln(1D)ε(1D)+DdD=(ε1)hi                  =uln((ε1)exp(u)+1)Li2((ε1)exp(u))+c                  =ln(1D)ln((ε1)(1D)+1)Li2((ε1)(1D))+c. (18)

    Substituting [16] and [18] to [15] it becomes

    εln(1D)D(ε(1D)+D)dD                  =Li2(D)ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))                  +c. (19)

    And finally, writing [14] and [19] into [13], we earned the third term of [8], which is

    ln(1ε(1D)ε(1D)+D)D1DdD                  =ln(1ε(1D)ε(1D)+D)(Dln(1D))+εln(ε(1D)+D)1εLi2(D)                  ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))+c. (20)

    The fourth term of [8] is trivial. The fifth term of [8] is (see [14])

    ε2ε(1D)+DdD=ε2ln(ε(1D)+D)1ε+c. (21)

    Gathering all terms from first to fifth (writing [9, 10], [20], the trivial fourth, and [21] into [8], respectively), the alarm set is

    [(D+ln(1D))(m+ln(1m))+εDε2ln((1ε)D+ε)1ε                  ln(1ε(1D)ε(1D)+D)(D+ln(1D))+εln(ε(1D)+D)1εLi2(D)                  ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))εmD                  +ε2ln(ε(1D)+D)1ε]da                  =[(D+ln(1D))(m+ln(1m))+ε(1m)D                  ln(1ε(1D)ε(1D)+D)(D+ln(1D))+εln(ε(1D)+D)1εLi2(D)                  ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))]da, (22)

    Where a=ε(1m)ε(1m)+m. Since δ and μ may truncate this set, the general formula for δ0 and μ0 is

    [22][22  with d:=δ if δ>ε(1m)ε(1m)+m][22  with m:=μ if μ>ε(1d)ε(1d)+d]                  +[22  with d:=δ and m:=μ if δ>ε(1μ)ε(1μ)+μ and μ>ε(1δ)ε(1δ)+δ]. (23)

    If e<dm(1d)(1m)

    In this case, the object above e is to be subtracted. The alarm sets are then [7] – [23 with ε:=e] under Condition 1, and [23] – [23 with ε:=e] under Condition 2.

    C. IPR(S)=DME(1M)(1D)2(1D)t

    The alarm condition rearranged to efficiency is EDM(1D)(1M)2t1M, which implies that A if ε<dm(1d)(1m)2t1m. Since t>0, the equality holds ε0 D>0 M>0, and so it is sufficient to derive one triple integral with a general lower bound for E.

    If ε<dm2(1d)t(1d)(1m)e

    The alarm set is (using rearranged forms of alarm condition, D>E(1M)+2tE(1M)+M+2t, M>(E+2t)(1D)E(1D)+D)

    dε(1m)+2tε(1m)+m+2tm(ε+2t)(1D)ε(1D)+DDM(1D)(1M)2t1Mε1 dE dM dD                  =dε(1m)+2tε(1m)+m+2tm(ε+2t)(1D)ε(1D)+D(DM(1D)(1M)2t1Mε)dM dD.

    The inner integral is

    m(ε+2t)(1D)ε(1D)+D(DM(1D)(1M)2t1Mε)dM                  =D1D[Mln(1M)]m(ε+2t)(1D)ε(1D)+D+[2tln(1M)]m(ε+2t)(1D)ε(1D)+D                  [εM]m(ε+2t)(1D)ε(1D)+D                  =D1D(mln(1m)+(ε+2t)(1D)ε(1D)+D+ln(1(ε+2t)(1D)ε(1D)+D))                  +2tln(1m)2tln(1(ε+2t)(1D)ε(1D)+D)εm+ε(ε+2t)(1D)ε(1D)+D,

    so the outer integral is

    da(D1D(mln(1m))+(ε+2t)Dε(1D)+D+D1Dln(1(ε+2t)(1D)ε(1D)+D)                  +2tln(1m)2tln(1(ε+2t)(1D)ε(1D)+D)εm                  +ε(ε+2t)(1D)ε(1D)+D)dD                  =da(D1D(mln(1m))+(1ε)(ε+2t)Dε(1D)+D                  +D1Dln(1(ε+2t)(1D)ε(1D)+D)2tln(1(ε+2t)(1D)ε(1D)+D)                  +2tln(1m)εm+ε(ε+2t)ε(1D)+D)dD, (24)

    where a=ε(1m)+2tε(1m)+m+2t.

    I integrate [24] term by term as an indefinite integral. The first (combined) term is already known from previous calculations

    D1D(mln(1m))dD=(D+ln(1D))(m+ln(1m))+c. (25)

    The second term of [24] comes easy from [10]

    (1ε)(ε+2t)Dε(1D)+DdD=(ε+2t)Dε(ε+2t)ln((1ε)D+ε)1ε+c. (26)

    The third term of [24] is

    ln(1(ε+2t)(1D)ε(1D)+D)D1DdD.

    Let f=ln(1(ε+2t)(1D)ε(1D)+D) and g=D1D and so

    f=ddDln(1(ε+2t)(1D)ε(1D)+D)=11(ε+2t)(1D)ε(1D)+DddD(1(ε+2t)(1D)ε(1D)+D). (27)

    The latter derivative comes easy from [12]

    ddD(1(ε+2t)(1D)ε(1D)+D)=ε+2t(ε(1D)+D)2. (28)

    Writing [28] to [27]

    f=11(ε+2t)(1D)ε(1D)+Dε+2t(ε(1D)+D)2                  =ε+2t(ε(1D)+D)2(ε+2t)(1D)(ε(1D)+D)                  =ε+2t(ε(1D)+D)(ε(1D)+D(ε+2t)(1D))                  =ε+2t(ε(1D)+D)((1+2t)D2t).

    Function g comes like earlier (see [1])

    g=D1DdD=Dln(1D)+c.

    Now, integrating by parts we get

    fg=fgfg                  =ln(1(ε+2t)(1D)ε(1D)+D)(Dln(1D))                  ε+2t(ε(1D)+D)((1+2t)D2t)(Dln(1D))dD. (29)

    First part of the integral of [29] is

    (ε+2t)D(ε(1D)+D)((1+2t)D2t)dD.

    For solving this integral, partial fraction decomposition is needed:

    A(1+2t)D2t+Bε(1D)+D=(ε+2t)D((1+2t)D2t)(ε(1D)+D)
    A(ε(1D)+D)+B((1+2t)D2t)=(ε+2t)D.

    Choosing D=2t1+2t we get A=2t, and choosing D=ε1ε we get B=ε. Thus, the integral of the decomposed fraction is

    (ε+2t)D(ε(1D)+D)((1+2t)D2t)dD=2t(1+2t)D2tdD+εε(1D)+DdD                  =2tln((1+2t)D2t)1+2t+εln((1ε)D+ε)1ε+c. (30)

    The second part of the integral of [29] is

    (ε+2t)ln(1D)(ε(1D)+D)((1+2t)D2t)dD.

    For the first step, we need partial fraction decomposition here, too:

    A(1+2t)D2t+Bε(1D)+D=ε+2t(ε(1D)+D)((1+2t)D2t)
    A(ε(1D)+D)+B((1+2t)D2t)=ε+2t.

    Choosing D=2t1+2t we get A=1+2t, and choosing D=ε1ε we get B=ε1. Thus, the integral of this decomposed fraction is

    (ε+2t)ln(1D)(ε(1D)+D)((1+2t)D2t)dD                  =(1+2t)ln(1D)(1+2t)D2tdD+(ε1)ln(1D)ε(1D)+DdD. (31)

    Let us solve the first integral of [31]. Substituting u=ln(1D) (which is exp(u)=1D, and so exp(u)du=dD) we get

    (1+2t)ln(1D)(1+2t)D2tdD=(1+2t)u(1+2t)(1exp(u))2texp(u)du                  =(1+2t)uexp(u)1(1+2t)exp(u)du. (32)

    Let h=u and i=exp(u)1(1+2t)exp(u) and so (substituting v=1(1+2t)exp(u) and dv=(1+2t)exp(u)du)

    i=exp(u)1(1+2t)exp(u)du=11+2t1vdv=lnv1+2t+c                  =ln(1(1+2t)exp(u))1+2t+c.

    Integrating by parts

    hi=hihi=uln(1(1+2t)exp(u))1+2t+ln(1(1+2t)exp(u))1+2tdu.

    The latter integral is (substituting w=(1+2t)exp(u) and dw=(1+2t)exp(u)du)

    hi=ln(1(1+2t)exp(u))1+2tdu=ln(1w)wexp(u)1(1+2t)exp(u)dw=11+2tln(1w)wdw                  =Li2(w)1+2t+c=Li2((1+2t)exp(u))1+2t+c.

    Putting together the pieces, hi becomes

    hi=     uln(1(1+2t)exp(u))1+2tLi2((1+2t)exp(u))1+2t+c,

    and so [32] is

    (1+2t)ln(1D)(1+2t)D2tdD=(1+2t)hi                  =uln(1(1+2t)exp(u))+Li2((1+2t)exp(u))+c                  =ln(1D)ln(1(1+2t)(1D))+Li2((1+2t)(1D))+c. (33)

    The second integral of [31] is known from [18]:

    (ε1)ln(1D)ε(1D)+DdD                  =ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))+c. (34)

    Substituting [33] and [34] to [31], it becomes

    (ε+2t)ln(1D)(ε(1D)+D)((1+2t)D2t)dD                  =ln(1D)ln(1(1+2t)(1D))+Li2((1+2t)(1D))                  ln(1D)ln(1(1ε)(1D))Li2((1ε)(1D))+c. (35)

    And finally, writing [30] and [35] into [29], we earned the third term of [24], which is

    ln(1(ε+2t)(1D)ε(1D)+D)D1DdD                  =ln(1(ε+2t)(1D)ε(1D)+D)(Dln(1D))+2tln((1+2t)D2t)1+2t                  +εln((1ε)D+ε)1ε+ln(1D)ln(1(1+2t)(1D))                  +Li2((1+2t)(1D))ln(1D)ln(1(1ε)(1D))                  Li2((1ε)(1D))+c. (36)

    The fourth term of [24] is

    2tln(1(ε+2t)(1D)ε(1D)+D)dD. (37)

    Let f=ln(1(ε+2t)(1D)ε(1D)+D) and g=1. From [27 and 28], we know that

    f=ε+2t(ε(1D)+D)((1+2t)D2t),

    and so integrating by parts

    fg=fgfg                  =ln(1(ε+2t)(1D)ε(1D)+D)Dε+2t(ε(1D)+D)((1+2t)D2t)DdD                  =ln(1(ε+2t)(1D)ε(1D)+D)D2tln((1+2t)D2t)1+2t                  εln((1ε)D+ε)1ε+c, (38)

    where, in the last step, I used the result of [30]. Finally, putting [38] to [37] we get the fourth term of [24]

    2tfg=2t(ln(1(ε+2t)(1D)ε(1D)+D)D2tln((1+2t)D2t)1+2t                  εln((1ε)D+ε)1ε)+c. (39)

    The fifth (combined) term of [24] comes trivially. The sixth term of [24] is also obvious from [14]

    ε(ε+2t)ε(1D)+DdD=ε(ε+2t)ln(ε(1D)+D)1ε+c. (40)

    Gathering all terms from first to sixth (writing [25], [26], [36], [39], the trivial fifth term, and [40] into [24], respectively), the outer definite integral becomes

    [(D+ln(1D))(m+ln(1m))+(ε+2t)Dε(ε+2t)ln((1ε)D+ε)1ε                  +ln(1(ε+2t)(1D)ε(1D)+D)(Dln(1D))+2tln((1+2t)D2t)1+2t                  +εln((1ε)D+ε)1ε+ln(1D)ln(1(1+2t)(1D))                  +Li2((1+2t)(1D))ln(1D)ln(1(1ε)(1D))                  Li2((1ε)(1D))                  2t(ln(1(ε+2t)(1D)ε(1D)+D)D2tln((1+2t)D2t)1+2t                  εln((1ε)D+ε)1ε)                  +(2tln(1m)εm)D+ε(ε+2t)ln(ε(1D)+D)1ε]da, (41)

    where a = \frac{\varepsilon \left(1-m\right)+2t}{\varepsilon \left(1-m\right)+m+2t} . Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[41\right]-\left[41\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{\varepsilon \left(1-m\right)+2t}{\varepsilon \left(1-m\right)+m+2t}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ -\left[41\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{\left(\varepsilon +2t\right)\left(1-d\right)}{\varepsilon \left(1-d\right)+d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +[41\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{\varepsilon \left(1-\mu \right)+2t}{\varepsilon \left(1-\mu \right)+\mu +2t}\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu \\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ > \frac{\left(\varepsilon +2t\right)\left(1-\delta \right)}{\varepsilon \left(1-\delta \right)+\delta }]. \end{array} (42)

    \boxed{\mathrm{I}\mathrm{f}\ e < \frac{dm-2\left(1-d\right)t}{\left(1-d\right)\left(1-m\right)}}

    In this case, the object part above e is to be subtracted, and so the alarm set is [42] – [42 with \varepsilon : = e ].

    D. {\bf I}{\bf P}{\bf R}\left({\bf S}\right){\bf i} = \frac{\mathit{\boldsymbol{D}}\mathit{\boldsymbol{M}}}{{\bf{1}}-\mathit{\boldsymbol{D}}-\mathit{\boldsymbol{M}}}\ge \mathit{\boldsymbol{t}}

    The alarm set is non-empty if \frac{dm}{1-d-m} > t or 1-d-m < 0 .

    \boxed{\mathrm{I}\mathrm{f}\ \frac{dm}{1-d-m} > t}

    The alarm set is (using rearranged forms of alarm condition, D > \frac{t\left(1-M\right)}{t+M} , M > \frac{t\left(1-D\right)}{t+D} )

    \begin{array}{l}{\int }_{\frac{t\left(1-m\right)}{t+m}}^{d}{\int }_{\frac{t\left(1-D\right)}{t+D}}^{m}1\ dM\ dD\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = {\int }_{\frac{t\left(1-m\right)}{t+m}}^{d}\left(m-\frac{t\left(1-D\right)}{t+D}\right)dD = {\left[mD-t\mathrm{ln}\left(t+D\right)+t\left(D-t\mathrm{ln}\left(t+D\right)\right)\right]}_{\frac{t\left(1-m\right)}{t+m}}^{d}\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = {\left[\left(m+t\right)D-\left(t+{t}^{2}\right)\mathrm{ln}\left(t+D\right)\right]}_{\frac{t\left(1-m\right)}{t+m}}^{d}\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = \left(m+t\right)d-\left(t+{t}^{2}\right)\mathrm{ln}\left(t+d\right)-t\left(1-m\right)+\left(t+{t}^{2}\right)\mathrm{ln}\left(t+\frac{t\left(1-m\right)}{t+m}\right)\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = \left(m+t\right)d-t\left(1-m\right)+\left(t+{t}^{2}\right)\mathrm{ln}\left(\frac{{t+t}^{2}}{\left(t+d\right)\left(t+m\right)}\right). \end{array} (43)

    Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[43\right]-\left[43\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{t\left(1-m\right)}{t+m}\right]-\left[43\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{t\left(1-d\right)}{t+d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +\left[43\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{t\left(1-\mu \right)}{t+\mu }\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu > \frac{t\left(1-\delta \right)}{t+\delta }\right]. \end{array} (44)

    \boxed{\mathrm{I}\mathrm{f}\ 1-d-m < 0}

    The overhanging part of the object is

    \frac{\left(d-\left(1-m\right)\right)\left(m-\left(1-d\right)\right)}{2},

    which is to be subtracted from [44] to get the alarm set.

    E. {\bf I}{\bf P}{\bf R}\left({\bf H}\right) = \frac{\mathit{\boldsymbol{D}}\mathit{\boldsymbol{M}}}{{\bf{2}}\left({\bf{1}}-\mathit{\boldsymbol{D}}\right)}\ge \mathit{\boldsymbol{t}}

    The alarm set, which is non-empty if \frac{dm}{2\left(1-d\right)} > t , is (using rearranged forms of alarm condition, D > \frac{2t}{2t+M} , M > \frac{2t\left(1-D\right)}{D} )

    \begin{array}{l}{\int }_{\frac{2t}{2t+m}}^{d}{\int }_{\frac{2t\left(1-D\right)}{D}}^{m}1\ dM\ dD = {\int }_{\frac{2t}{2t+m}}^{d}\left(m-\frac{2t\left(1-D\right)}{D}\right)dD = {\left[mD-2t\mathrm{ln}D+2tD\right]}_{\frac{2t}{2t+m}}^{d}\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = md-2t\mathrm{ln}d+2td-\frac{2tm}{2t+m}+2t\mathrm{ln}\frac{2t}{2t+m}-\frac{4{t}^{2}}{2t+m}\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = md+2t\left(\mathrm{ln}\frac{2t}{d\left(2t+m\right)}+d-1\right). \end{array} (45)

    Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[45\right]-\left[45\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{2t}{2t+m}\right]-\left[45\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{2t\left(1-d\right)}{d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +\left[45\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{2t}{2t+\mu }\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu > \frac{2t\left(1-\delta \right)}{\delta }\right]. \end{array}

    F. {\bf G}{\bf U}{\bf P}{\bf P}{\bf I} = \mathit{\boldsymbol{D}}\mathit{\boldsymbol{M}}\ge \mathit{\boldsymbol{t}}

    The alarm set, which is non-empty if dm > t , is (using rearranged forms of alarm condition, D > \frac{t}{m} , M > \frac{t}{D} )

    \begin{array}{l}{\int }_{\frac{t}{m}}^{d}{\int }_{\frac{t}{D}}^{m}1dMdD = {\int }_{\frac{t}{m}}^{d}\left(m-\frac{t}{D}\right)dD = {\left[mD-t\mathrm{ln}D\right]}_{\frac{t}{m}}^{d}= md-t\mathrm{ln}d-t+t\mathrm{ln}\frac{t}{m} \\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = md+t\left(\mathrm{ln}\frac{t}{dm}-1\right). \end{array} (46)

    Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[46\right]-\left[46\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{t}{m}\right]-\left[46\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{t}{d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +\left[46\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{t}{\mu }\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu > \frac{t}{\delta }\right]. \end{array}

    G. {\bf G}{\bf l} = \frac{{\bf G}{\bf U}{\bf P}{\bf P}{\bf I}}{{\bf{2}}} = \frac{\mathit{\boldsymbol{D}}\mathit{\boldsymbol{M}}}{{\bf{2}}}\ge \mathit{\boldsymbol{t}}

    Using [46] obtained at GUPPI, the alarm set is

    md+2t\left(\mathrm{ln}\frac{2t}{dm}-1\right) (47)

    if dm > 2t , else the set is empty. Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[47\right]-\left[47\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{2t}{m}\right]-\left[47\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{2t}{d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +\left[47\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{2t}{\mu }\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu > \frac{2t}{\delta }\right]. \end{array}

    H. {\bf G}{\bf i} = \frac{{\bf G}{\bf U}{\bf P}{\bf P}{\bf I}}{{\bf{1}}-\mathit{\boldsymbol{M}}} = \frac{\mathit{\boldsymbol{D}}\mathit{\boldsymbol{M}}}{{\bf{1}}-\mathit{\boldsymbol{M}}}\ge \mathit{\boldsymbol{t}}

    The alarm set, which is non-empty if \frac{dm}{1-m} > t , is (using rearranged forms of alarm condition, D > \frac{t\left(1-M\right)}{M} , M > \frac{t}{t+D} )

    \begin{array}{l}{\int }_{\frac{t\left(1-m\right)}{m}}^{d}{\int }_{\frac{t}{t+D}}^{m}1\ dM\ dD = {\int }_{\frac{t\left(1-m\right)}{m}}^{d}\left(m-\frac{t}{t+D}\right)dD = {\left[mD-t\mathrm{ln}\left(t+D\right)\right]}_{\frac{t\left(1-m\right)}{m}}^{d}\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = md-t\mathrm{ln}\left(t+d\right)-t\left(1-m\right)+t\mathrm{ln}\left(t+\frac{t\left(1-m\right)}{m}\right)\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ = md+t\left(\mathrm{ln}\frac{t}{m\left(t+d\right)}+m-1\right). \end{array} (48)

    Since \delta and \mu may truncate this set, the general formula for \delta \ge 0 and \mu \ge 0 is

    \begin{array}{l}\left[48\right]-\left[48\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{i}\mathrm{f}\ \delta > \frac{t\left(1-m\right)}{m}\right]-\left[48\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \mu > \frac{t}{t+d}\right]\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ +\left[48\ \mathrm{w}\mathrm{i}\mathrm{t}\mathrm{h}\ d : = \delta \ \mathrm{a}\mathrm{n}\mathrm{d}\ m : = \mu \ \mathrm{i}\mathrm{f}\ \delta > \frac{t\left(1-\mu \right)}{\mu }\ \mathrm{a}\mathrm{n}\mathrm{d}\ \mu > \frac{t}{t+\delta }\right]. \end{array}


    [1] S. Chatterjee, A. Chatterjee, S. S. Das, Analytical performance evaluation of full-dimensional MIMO systems using realistic spatial correlation models, IEEE Trans. Veh. Technol., 67 (2018), 5597–5612. https://doi.org/10.1109/TVT.2018.2801825 doi: 10.1109/TVT.2018.2801825
    [2] D. Liu, S. Xue, B. Zhao, B. Luo, Q. Wei, Adaptive dynamic programming for control: a survey and recent advances, IEEE Trans. Syst. Man Cybern., 51 (2021), 142–160. https://doi.org/10.1109/TSMC.2020.3042876 doi: 10.1109/TSMC.2020.3042876
    [3] O. M. Omisore, S. Han, J. Xiong, H. Li, Z. Li, L. Wang, A review on flexible robotic systems for minimally invasive surgery, IEEE Trans. Syst. Man Cybern., 52 (2022), 631–644. https://doi.org/10.1109/TSMC.2020.3026174 doi: 10.1109/TSMC.2020.3026174
    [4] J. Mao, C. K. Ahn, Z. Xiang, Global stabilization for a class of switched nonlinear time-delay systems via sampled-data output-feedback control, IEEE Trans. Syst. Man Cybern., 52 (2021), 694–705. https://doi.org/10.1109/TSMC.2020.3048064 doi: 10.1109/TSMC.2020.3048064
    [5] A. Isidori, Nonlinear control systems, 3 Eds., Berlin: Springer, 1995.
    [6] L. Wang, A course in fuzzy systems and control, USA: Prentice Hall PTR, 1997.
    [7] P. Wan, Z. Zeng, Stability and stabilization of Takagi-Sugeno fuzzy second-fractional-order linear networks via nonreduced-order approach, IEEE Trans. Syst. Man Cybern., 52 (2022), 6524–6533. https://doi.org/10.1109/TSMC.2022.3147222 doi: 10.1109/TSMC.2022.3147222
    [8] B. Chen, X. Liu, S. S. Ge, C. Lin, Adaptive fuzzy control of a class of nonlinear systems by fuzzy approximation approach, IEEE Trans. Fuzzy Syst., 20 (2012), 1012–1021. https://doi.org/10.1109/TFUZZ.2012.2190048 doi: 10.1109/TFUZZ.2012.2190048
    [9] L. Liu, Y. J. Liu, D. Li, S. Tong, Z. Wang, Barrier Lyapunov function-based adaptive fuzzy FTC for switched systems and its applications to resistance-inductance-capacitance circuit system, IEEE Trans. Cybern., 50 (2020), 3491–3502. https://doi.org/10.1109/TCYB.2019.2931770 doi: 10.1109/TCYB.2019.2931770
    [10] Y. Li, K. Li, S. Tong, Finite-time adaptive fuzzy output feedback dynamic surface control for MIMO non-strict feedback systems, IEEE Trans. Fuzzy Syst., 27 (2019), 96–110. https://doi.org/10.1109/TFUZZ.2018.2868898 doi: 10.1109/TFUZZ.2018.2868898
    [11] L. Liu, W. Zhao, Y. J. Liu, S. Tong, Y. Y. Wang, Adaptive finite-time neural network control of nonlinear systems with multiple objective constraints and application to electromechanical system, IEEE Trans. Neural Networks Learn. Syst., 32 (2021), 5416–5426. https://doi.org/10.1109/TNNLS.2020.3027689 doi: 10.1109/TNNLS.2020.3027689
    [12] L. Liu, X. Li, Y. J. Liu, S. Tong, Neural network based adaptive event trigger control for a class of electromagnetic suspension systems, Control Eng. Pract., 106 (2021), 104675. https://doi.org/10.1016/j.conengprac.2020.104675 doi: 10.1016/j.conengprac.2020.104675
    [13] L. X. Wang, Stable adaptive fuzzy controllers with application to inverted pendulum tracking, IEEE Trans. Syst. Man Cybern., 26 (1996), 677–691. https://doi.org/10.1109/3477.537311 doi: 10.1109/3477.537311
    [14] H. Li, J. Wang, H. Du, H. R. Karimi, Adaptive sliding mode control for Takagi-Sugeno fuzzy systems and its applications, IEEE Trans Fuzzy Syst., 26 (2018), 531–542. https://doi.org/10.1109/TFUZZ.2017.2686357 doi: 10.1109/TFUZZ.2017.2686357
    [15] Y. H. Liu, Y. Liu, Y. F. Liu, C. Y. Su, Adaptive fuzzy control with global stability guarantees for unknown strict-feedback systems using novel integral barrier Lyapunov functions, IEEE Trans. Syst. Man Cybern., 52 (2022), 4336–4348. https://doi.org/10.1109/TSMC.2021.3094975 doi: 10.1109/TSMC.2021.3094975
    [16] D. Cheng, J. Feng, H. Lv, Solving fuzzy relational equations via semi-tensor product, IEEE Trans. Fuzzy Syst., 20 (2012), 390–396. https://doi.org/10.1109/TFUZZ.2011.2174243 doi: 10.1109/TFUZZ.2011.2174243
    [17] J. Feng, H. Lv, D. Cheng, Multiple fuzzy relation and its application to coupled fuzzy control, Asian J. Control, 15 (2013), 1313–1324. https://doi.org/10.1002/asjc.656 doi: 10.1002/asjc.656
    [18] D. Cheng, H. Qi, Z. Li, Analysis and control of Boolean networks: a semi-tensor product approach, Berlin: Springer, 2011. https://doi.org/10.1007/978-0-85729-097-7
    [19] Y Zhao, Z. Li, D. Cheng, Optimal control of logical control networks, IEEE Trans. Automat. Control, 56 (2011), 1766–1776. https://doi.org/10.1109/TAC.2010.2092290 doi: 10.1109/TAC.2010.2092290
    [20] Y. Li, H. Li, W. Sun, Event-triggered control for robust set stabilization of logical control networks, Automatica, 95 (2018), 556–560. https://doi.org/10.1016/j.automatica.2018.06.030 doi: 10.1016/j.automatica.2018.06.030
    [21] J. Xia, J. Zhang, J. Feng, Z. Wang, G. Zhuang, Command filter-based adaptive fuzzy control for nonlinear systems with unknown control directions, IEEE Trans. Syst. Man Cybern., 51 (2021), 1945–1953. https://doi.org/10.1109/TSMC.2019.2911115 doi: 10.1109/TSMC.2019.2911115
    [22] A. Liu, H. Li, Stabilization of delayed Boolean control networks with state constraints: a barrier Lyapunov function method, IEEE Trans. Circuits Syst. II, 68 (2021), 2553–2557. https://doi.org/10.1109/TCSII.2021.3053081 doi: 10.1109/TCSII.2021.3053081
    [23] Y. Yu, B. Wang, J. Feng, Input observability of Boolean control networks, Neurocomputing, 333 (2019), 22–28. https://doi.org/10.1016/j.neucom.2018.12.014 doi: 10.1016/j.neucom.2018.12.014
    [24] Y. Yu, J. Feng, J. Pan, D. Cheng, Block decoupling of Boolean control networks, IEEE Trans. Automat. Control, 64 (2019), 3129–3140. https://doi.org/10.1109/tac.2018.2880411 doi: 10.1109/tac.2018.2880411
    [25] L. Wang, Y. Liu, Z. G. Wu, J. Lu, L. Yu, Stabilization and finite-time stabilization of probabilistic Boolean control networks, IEEE Trans. Syst. Man Cybern., 51 (2021), 1559–1566. https://doi.org/10.1109/TSMC.2019.2898880 doi: 10.1109/TSMC.2019.2898880
    [26] Y. Liu, B. Jiang, J. Lu, J. Cao, G. Lu, Event-triggered sliding mode control for attitude stabilization of a rigid spacecraft, IEEE Trans. Syst. Man Cybern., 50 (2020), 3290–3299. https://doi.org/10.1109/TSMC.2018.2867061 doi: 10.1109/TSMC.2018.2867061
    [27] P. Duan, H. Lv, J. Feng, C. Liu, H. Li, Indoor dynamic thermal control based on fuzzy relation model, IET Control Theory Appl., 30 (2013), 215–221.
    [28] C. Zhang, H. Lyu, P. Duan, Y. Song, Fuzzy modeling of the semi-tensor product-based cold and hot electric installations, Archit. Electr., 34 (2015), 59–64.
    [29] D. Cheng, H. Qi, Controllability and observability of Boolean control networks, Automatica, 45 (2009), 1659–1667. https://doi.org/10.1016/j.automatica.2009.03.006 doi: 10.1016/j.automatica.2009.03.006
    [30] D. Cheng, F. He, H. Qi, T. Xu, Modeling, analysis and control of networked evolutionary games, IEEE Trans. Automat. Control, 60 (2015), 2402–2415. https://doi.org/10.1109/TAC.2015.2404471 doi: 10.1109/TAC.2015.2404471
    [31] Y. Yan, D. Cheng, J. Feng, H. Li, J. Yue, Survey on applications of algebraic state space theory of logical systems to finite state machines, Sci. China Inf. Sci., 66 (2023), 111201. https://doi.org/10.1007/s11432-022-3538-4 doi: 10.1007/s11432-022-3538-4
    [32] H. Lyu, W. Wang, X. Liu, Modeling of multivariable fuzzy systems by semi-tensor product, IEEE Trans. Fuzzy Syst., 28 (2020), 228–235. https://doi.org/10.1109/TFUZZ.2019.2902820 doi: 10.1109/TFUZZ.2019.2902820
    [33] H. Lyu, W. Wang, X. Liu, Universal approximation of multivariable fuzzy systems by semitensor product, IEEE Trans. Fuzzy Syst., 28 (2020), 2972–2981. https://doi.org/10.1109/TFUZZ.2019.2946512 doi: 10.1109/TFUZZ.2019.2946512
    [34] S. Labiod, M. S. Boucherit, T. M. Guerra, Adaptive fuzzy control of a class of MIMO nonlinear systems, Fuzzy Sets Syst., 151 (2005), 59–77. https://doi.org/10.1016/j.fss.2004.10.009 doi: 10.1016/j.fss.2004.10.009
    [35] J. E. Slotine, W. Li, Applied nonlinear control, Englewood Cliffs: Prentice Hall, 1991.
  • This article has been cited by:

    1. László Bokor, On Merger Price-Effect Indicators: Costs of Simplification, Misspecification and Universality, 2025, 1357-1516, 1, 10.1080/13571516.2025.2501340
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1347) PDF downloads(140) Cited by(0)

Figures and Tables

Figures(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog