scholarly journals Parity Systems and the Delta-Matroid Intersection Problem

10.37236/1492 ◽  
1999 ◽  
Vol 7 (1) ◽  
Author(s):  
André Bouchet ◽  
Bill Jackson
Keyword(s):  
Abstract System ◽  
Matroid Intersection ◽  
Intersection Problem ◽  
Common Base ◽  
Carry Over ◽  
Matroid Intersection Problem

We consider the problem of determining when two delta-matroids on the same ground-set have a common base. Our approach is to adapt the theory of matchings in 2-polymatroids developed by Lovász $[13]$ to a new abstract system, which we call a parity system. Examples of parity systems may be obtained by combining either, two delta-matroids, or two orthogonal 2-polymatroids, on the same ground-sets. We show that many of the results of Lovász concerning 'double flowers' and 'projections' carry over to parity systems.

scholarly journals Strongly Possible Keys for SQL

2020 ◽  
Vol 9 (2-3) ◽  
pp. 85-99
Author(s):  
Munqath Alattar ◽  
Attila Sali
Keyword(s):  
Data Mining ◽  
Missing Values ◽  
Possible World ◽  
Bipartite Matching ◽  
Matroid Intersection ◽  
Intersection Problem ◽  
Data Mining Approach ◽  
Data Value ◽  
Two Measures ◽  
Matroid Intersection Problem

Abstract Missing data value is an extensive problem in both research and industrial developers. Two general approaches are there to deal with the problem of missing values in databases; they could be either ignored (removed) or imputed (filled in) with new values (Farhangfar et al. in IEEE Trans Syst Man Cybern-Part A: Syst Hum 37(5):692–709, 2007). For some SQL tables, it is possible that some candidate key of the table is not null-free and this needs to be handled. Possible keys and certain keys to deal with this situation were introduced in Köhler et al. (VLDB J 25(4):571–596, 2016). In the present paper, we introduce an intermediate concept called strongly possible keys that is based on a data mining approach using only information already contained in the SQL table. A strongly possible key is a key that holds for some possible world which is obtained by replacing any occurrences of nulls with some values already appearing in the corresponding attributes. Implication among strongly possible keys is characterized, and Armstrong tables are constructed. An algorithm to verify a strongly possible key is given applying bipartite matching. Connection between matroid intersection problem and system of strongly possible keys is established. For the cases when no strongly possible keys hold, an approximation notion is introduced to calculate the closeness of any given set of attributes to be considered as a strongly possible key using the $$g_3$$ g 3 measure, and we derive its component version $$g_4$$ g 4 . Analytical comparisons are given between the two measures.

Inverse Matroid Intersection Problem

1997 ◽  
Vol 45 (2) ◽  
pp. 235-243 ◽  
Author(s):  
Cai Mao-Cheng ◽  
Yanjun Li
Keyword(s):  
Matroid Intersection ◽  
Intersection Problem ◽  
Matroid Intersection Problem

Parallel algorithms for matroid intersection and matroid parity

2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang
Keyword(s):  
Parallel Algorithms ◽  
Polynomial Identity ◽  
Black Box ◽  
Matroid Intersection ◽  
Polynomial Identity Testing ◽  
Identity Testing ◽  
Common Base ◽  
Graphic Matroid ◽  
Matroid Parity ◽  
Nc Algorithms

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).

scholarly journals On resolvability of a graph associated to a finite vector space

2019 ◽  
Vol 18 (02) ◽  
pp. 1950029
Author(s):  
U. Ali ◽  
S. A. Bokhary ◽  
K. Wahid ◽  
G. Abbas
Keyword(s):  
Vector Space ◽  
Domination Number ◽  
Exchange Property ◽  
Metric Dimension ◽  
Resolving Set ◽  
Matroid Intersection ◽  
Finite Vector ◽  
Finite Vector Space ◽  
Partition Dimension ◽  
Matroid Intersection Problem

In this paper, the resolving parameters such as metric dimension and partition dimension for the nonzero component graph, associated to a finite vector space, are discussed. The exact values of these parameters are determined. It is derived that the notions of metric dimension and locating-domination number coincide in the graph. Independent sets, introduced by Boutin [Determining sets, resolving set, and the exchange property, Graphs Combin. 25 (2009) 789–806], are studied in the graph. It is shown that the exchange property holds in the graph for minimal resolving sets with some exceptions. Consequently, a minimal resolving set of the graph is a basis for a matroid with the set [Formula: see text] of nonzero vectors of the vector space as the ground set. The matroid intersection problem for two matroids with [Formula: see text] as the ground set is also solved.

Minimizing Carry-Over Effects After Treatment Failure and Maximizing Therapeutic Outcome

2014 ◽  
Vol 222 (3) ◽  
pp. 171-178 ◽  
Author(s):  
Mareile Hofmann ◽  
Nathalie Wrobel ◽  
Simon Kessner ◽  
Ulrike Bingel
Keyword(s):  
Treatment Failure ◽  
Human Subjects ◽  
Subsequent Treatment ◽  
Clinical Samples ◽  
Administration Route ◽  
Healthy Human ◽  
Negative Experiences ◽  
Analgesic Treatment ◽  
Balanced Design ◽  
Carry Over

According to experimental and clinical evidence, the experiences of previous treatments are carried over to different therapeutic approaches and impair the outcome of subsequent treatments. In this behavioral pilot study we used a change in administration route to investigate whether the effect of prior treatment experience on a subsequent treatment depends on the similarity of both treatments. We experimentally induced positive or negative experiences with a topical analgesic treatment in two groups of healthy human subjects. Subsequently, we compared responses to a second, unrelated and systemic analgesic treatment between both the positive and negative group. We found that there was no difference in the analgesic response to the second treatment between the two groups. Our data indicate that a change in administration route might reduce the influence of treatment history and therefore be a way to reduce negative carry-over effects after treatment failure. Future studies will have to validate these findings in a fully balanced design including larger, clinical samples.

Does CBT for Psychosis Have an Impact on Delusions by Improving Reasoning Biases and Negative Self-Schemas?

2018 ◽  
Vol 226 (3) ◽  
pp. 152-163 ◽  
Author(s):  
Stephanie Mehl ◽  
Björn Schlier ◽  
Tania M. Lincoln
Keyword(s):  
Behavioral Therapy ◽  
Theoretical Models ◽  
Self Esteem ◽  
Secondary Outcome ◽  
Intervention Effect ◽  
Produce Change ◽  
Attribution Biases ◽  
Carry Over ◽  
Implicit And Explicit ◽  
Reasoning Biases

Abstract. Cognitive-behavioral therapy for psychosis (CBTp) builds on theoretical models that postulate reasoning biases and negative self-schemas to be involved in the formation and maintenance of delusions. However, it is unclear whether CBTp induces change in delusions by improving these proposed causal mechanisms. This study reports on a mediation analysis of a CBTp effectiveness trial in which delusions were a secondary outcome. Patients with psychosis were randomized to individualized CBTp (n = 36) or a waiting list condition (WL; n = 34). Reasoning biases (jumping to conclusions, theory of mind, attribution biases) and self-schemas (implicit and explicit self-esteem; self-schemas related to different domains) were assessed pre- and post-therapy/WL. The results reveal an intervention effect on two of four measures of delusions and on implicit self-esteem. Nevertheless, the intervention effect on delusions was not mediated by implicit self-esteem. Changes in explicit self-schemas and reasoning biases did also not mediate the intervention effects on delusions. More focused interventions may be required to produce change in reasoning and self-schemas that have the potential to carry over to delusions.

The role of RT carry-over for congruence sequence effects in masked priming.

2017 ◽  
Vol 43 (5) ◽  
pp. 757-780 ◽  
Author(s):  
Christoph Huber-Huber ◽  
Ulrich Ansorge
Keyword(s):  
Masked Priming ◽  
Sequence Effects ◽  
Carry Over

Investigation on the control of multiphase flow behavior in a continuous casting tundish during ladle change

2020 ◽  
Vol 117 (6) ◽  
pp. 619
Author(s):  
Rui Xu ◽  
Haitao Ling ◽  
Haijun Wang ◽  
Lizhong Chang ◽  
Shengtao Qiu
Keyword(s):  
Multiphase Flow ◽  
Flow Behavior ◽  
Rolled Strip ◽  
Impact Zone ◽  
Steel Cleanliness ◽  
Carry Over ◽  
Slag Carry Over ◽  
Hot Rolled ◽  
Turbulence Inhibitor ◽  
The Impact

The transient multiphase flow behavior in a single-strand tundish during ladle change was studied using physical modeling. The water and silicon oil were employed to simulate the liquid steel and slag. The effect of the turbulence inhibitor on the slag entrainment and the steel exposure during ladle change were evaluated and discussed. The effect of the slag carry-over on the water-oil-air flow was also analyzed. For the original tundish, the top oil phase in the impact zone was continuously dragged into the tundish bath and opened during ladle change, forming an emulsification phenomenon. By decreasing the liquid velocities in the upper part of the impact zone, the turbulence inhibitor decreased considerably the amount of entrained slag and the steel exposure during ladle change, thereby eliminating the emulsification phenomenon. Furthermore, the use of the TI-2 effectively lowered the effect of the slag carry-over on the steel cleanliness by controlling the movement of slag droplets. The results from industrial trials indicated that the application of the TI-2 reduced considerably the number of linear inclusions caused by ladle change in hot-rolled strip coils.

Sign in / Sign up

Export Citation Format

Share Document