We study bounded degree graph problems, mainly the problem of k-Dimensional Matching (k-DM), namely, the problem of finding a maximal matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of O( k ln k ) unless P = NP . This improves the previous factor of k 2O( √ ln ) by Trevisan [Tre01]. For low k values we prove NP-har...

The importance of reserve forces is increasing owing to changes in the security environment, such as promotion Defense Reform 2.0 and a sharp decrease military service resources. Under these changes, we focus on combining EEG (ElectroEncephaloGraphy) with Brain-Computer Interface (BCI) for improving combat power contributing future development defense science technology 2050. In study measureme...

Information-feedba k ontrol s hemes (more spe i ally, sensor-based ontrol s hemes) sele t an a tion at ea h stage based on the sensory data provided at that stage. Sin e it is impossible to know future sensor readings in advan e, predi ting the future behavior of a system be omes ne essary. Hyper ltering is a sequential method that enables probabilisti evaluation of future system performan e in...

in this paper we characterize hyper mv -algebras in which 0 or1 are scalar elements . we prove that any nite hyper mv -algebra that 0is a scaler element in it, is an mv -algebra. finally we characterize hypermv -algebras of order 2 and order 3.

hypercoagulable states are a group of conditions associated with an enhanced tendency toward blood clotting. although usual clinical manifestations of hypercoagulable states are thrombotic events such as deep venous thrombosis, hematoma can also occurs as a result of hypercoagulability in some patients. several inherited or acquired conditions may lead to hypercoagulable states. some of them in...

In this paper we study the scheduling of (m, k )–firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three (counter-intuitive) phenomena: (i) choosing, for each task, the initial k -sequence 1k is not optimal, (ii) even less intuitive, but not contradictory, we can even start the scheduling from a (fictive) error state (in regard to the initia...

This paper presents a new algorithm for clustering. It is an generalisation of the K-means algorithms . Each cluster will be represented by a chain of prototypes instead of being represented by one prototype like for the K-means. The chains are competing together to represent clusters and are evolving according to Kohonen maps adaptation rule. It is well known that K-means performs very well wi...

In this paper we study the scheduling of (m, k)–firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is no...

objectives: it is important to recognize any risk factors for the development of injuries in the athletic population. the aim of this study was to investigate the association between joint hyper mobility and low back pain in iranian hyper mobile and non-hyper mobile athletes. methods: 50 athletic patients with low back pain (age=23.20±12.79 years) and 51 healthy athletes (age=24.28±13.70) from ...

Eight hyper cross-linked polymers based on tetrakis(4-ethynylphenyl)germanium and tetrakis(4-ethynylphenyl)methane are presented. After investigation of their N2 adsorption properties at 77 K, the porosity of the germanium-based porous organic polymers (POPs) was modulated under acidic conditions, offering an easy and direct way, in a single step, to tune the adsorption properties.