Computational Complexity of the Accessory Function Setting Mechanism in Fuzzy Intellectual Systems

2019 ◽  
Vol 8 (5) ◽  
pp. 2370-2377
Author(s):  
Ayaz Ahmad M ◽  
Keyword(s):  
Computational Complexity ◽  
Accessory Function ◽  
Setting Mechanism

Bipolar Abstract Argumentation with Dual Attacks and Supports

2020 ◽  
Author(s):  
Nico Potyka
Keyword(s):  
Computational Complexity ◽  
Decision Problems ◽  
Abstract Argumentation ◽  
Stable Semantics ◽  
Support Relations ◽  
Support Relationships ◽  
Computational Properties ◽  
Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Capacity Analysis for Correlated Multi-Hop MIMO Channels under Colored Noise

2015 ◽  
Vol 1 ◽  
pp. 41
Author(s):  
Nguyen N. Tran ◽  
Ha X. Nguyen
Keyword(s):  
Computational Complexity ◽  
Mutual Information ◽  
Closed Form Solution ◽  
Optimal Solution ◽  
Form Solution ◽  
Maximization Problem ◽  
Capacity Analysis ◽  
Mimo Channels ◽  
Average Mutual Information ◽  
Channel Output

A capacity analysis for generally correlated wireless multi-hop multi-input multi-output (MIMO) channels is presented in this paper. The channel at each hop is spatially correlated, the source symbols are mutually correlated, and the additive Gaussian noises are colored. First, by invoking Karush-Kuhn-Tucker condition for the optimality of convex programming, we derive the optimal source symbol covariance for the maximum mutual information between the channel input and the channel output when having the full knowledge of channel at the transmitter. Secondly, we formulate the average mutual information maximization problem when having only the channel statistics at the transmitter. Since this problem is almost impossible to be solved analytically, the numerical interior-point-method is employed to obtain the optimal solution. Furthermore, to reduce the computational complexity, an asymptotic closed-form solution is derived by maximizing an upper bound of the objective function. Simulation results show that the average mutual information obtained by the asymptotic design is very closed to that obtained by the optimal design, while saving a huge computational complexity.

Fat Computational Complexity and Heuristic Design for the TSP

2009 ◽  
Vol 20 (9) ◽  
pp. 2344-2351 ◽  
Author(s):  
He JIANG ◽  
Yan HU ◽  
Qiang LI ◽  
Hong YU
Keyword(s):  
Computational Complexity

Causes, Scope and Features of Disputes in Budgetary Sphere

2020 ◽  
Vol 2 ◽  
pp. 80-89
Author(s):  
A. D. Selyukov ◽  
Keyword(s):  
Public Sector ◽  
Goal Setting ◽  
Management Decision ◽  
Public Interests ◽  
The Public ◽  
Legal Relationship ◽  
Setting Mechanism ◽  
The Law ◽  
Judicial Protection ◽  
Ruling Party

The article is devoted to identifying the features of conflicts in the public sector as a basis for disputes, including with the participation of courts. The concept of «public interests» is introduced, on the basis of which the characteristic of disputes in the budgetary sphere is given as a dispute between the parties, relations between which are based on the method of legal inequality. It is concluded that by virtue of the law, the ruling party gives instructions to the subordinate party to do something in relation to the budget, but not always the public interests of the parties to the legal relationship are equally protected by law, which is not sufficiently manifested in the practice of legal support of budgetary activities. Since the efforts of the legislator to regulate budgetary relations are mainly aimed at ensuring procedural activities, they almost do not affect the goal-setting mechanism, so the subordinate party has no opportunity to challenge the management decision that infringes the implementation of the public interests of the subordinate party. By virtue of the above, the courts do not participate in the consideration of issues that go beyond the procedure for spending budget funds and the application of appropriate sanctions. Therefore, frequent cases of arbitrariness of the powerful party in budgetary legal relations remain without proper judicial protection. To solve the problem, it is required to introduce the institution of goal-setting in the budget legislation, so that it will be possible to talk about the proper provision of public interests in the budget sphere.

Asset Pricing under Computational Complexity

2019 ◽  
Author(s):  
Peter L. Bossaerts ◽  
Elizabeth Bowman ◽  
Felix Fattinger ◽  
Harvey Huang ◽  
Carsten Murawski ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Asset Pricing
Sign in / Sign up

Export Citation Format

Share Document