Inclusive Education for Persons with Disabilities: A case study of Resource Centre for Inclusive Education in Shivaji University, Kolhapur

The study is based on the Inclusive Education Resource Center at the Balasaheb Khardekar Connaught Resource Center at Shivaji University. This study reviews the services provided to students with disabilities through the Inclusive Education Resource Center. It provides information on the equipment available at the center for the disabled and its use for services. Also, information about various programs and activities conducted by the center for students with disabilities

Parallel Processing Of Visual And Motion Saliency From Real Time Video

Extracting moving and salient objects from videos is important for many applications like surveillance and video retargeting .The proposed framework extract foreground objects of interest without any user interaction or the use of any training data(Unsupervised Learning) .To separate foreground and background regions within and across video frames, the proposed method utilizes visual and motion saliency information extracted from the input video. The Smoothing filter is extremely helpful in characterizing fundamental image constituents, i.e. salient edges and can simultaneously reduce insignificant details, thus producing more accurate boundary information. Our proposed model uses smoothing filter to reduce the effect of noise and achieve a better performance. Proposed system uses real time video data input as well as offline data to process using parallel processing technique. A conditional random field can be applied to effectively combine the saliency induced features. To evaluate the performance of saliency detection methods, the precision-recall rate and F-measures are utilized to reliably compare the extracted saliency information. DOI: 10.17762/ijritcc2321-8169.150317

Hitting Diamonds and Growing Cacti

We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primal-dual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is \Theta(\log n), where n denotes the number of vertices in the graph.Comment: v2: several minor changes

On the Approximability of Digraph Ordering

Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\ell : V \to [k]$ maximizing the number of forward edges, i.e. edges (u,v) such that $\ell$(u) < $\ell$(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2). This work studies the approximability of Max-k-Ordering and its generalizations, motivated by their applications to job scheduling with soft precedence constraints. We give an LP rounding based 2-approximation algorithm for Max-k-Ordering for any k={2,..., n}, improving on the known 2k/(k-1)-approximation obtained via random assignment. The tightness of this rounding is shown by proving that for any k={2,..., n} and constant $\varepsilon > 0$, Max-k-Ordering has an LP integrality gap of 2 - $\varepsilon$ for $n^{\Omega\left(1/\log\log k\right)}$ rounds of the Sherali-Adams hierarchy. A further generalization of Max-k-Ordering is the restricted maximum acyclic subgraph problem or RMAS, where each vertex v has a finite set of allowable labels $S_v \subseteq \mathbb{Z}^+$. We prove an LP rounding based $4\sqrt{2}/(\sqrt{2}+1) \approx 2.344$ approximation for it, improving on the $2\sqrt{2} \approx 2.828$ approximation recently given by Grandoni et al. (Information Processing Letters, Vol. 115(2), Pages 182-185, 2015). In fact, our approximation algorithm also works for a general version where the objective counts the edges which go forward by at least a positive offset specific to each edge. The minimization formulation of digraph ordering is DAG edge deletion or DED(k), which requires deleting the minimum number of edges from an n-vertex directed acyclic graph (DAG) to remove all paths of length k. We show that both, the LP relaxation and a local ratio approach for DED(k) yield k-approximation for any $k\in [n]$.Comment: 21 pages, Conference version to appear in ESA 201

All quantum states useful for teleportation are nonlocal resources

Understanding the relation between the different forms of inseparability in quantum mechanics is a longstanding problem in the foundations of quantum theory and has implications for quantum information processing. Here we make progress in this direction by establishing a direct link between quantum teleportation and Bell nonlocality. In particular, we show that all entangled states which are useful for teleportation are nonlocal resources, i.e. lead to deterministic violation of Bell's inequality. Our result exploits the phenomenon of super-activation of quantum nonlocality, recently proved by Palazuelos, and suggests that the latter might in fact be generic.Comment: 4 pages. v2: Title and abstract changed, presentation improved, references updated, same result

AN EVALUATION OF FIXED DOSE COMBINATIONS (FDCs) USED FOR TREATMENT OF DIABETES IN INDIAN MARKET

Objective: To analyse the rationality of various FDCs used in the treatment Diabetes Mellitus and to find out the irrational FDCs existing in Indian market. Material and Methods: Study Design: Analytical study. Data on FDC's available in the Indian market was collected from&nbsp;Current Index of Medical Specialities (CIMS) and Monthly Index of Medical Specialities (MIMS) and their rationality was analysed using a pretested tool based on FDCs listed in WHO essential list of medicines and National List of Essential Medicines (NLEM), others based on their pharmacodynamic activity, Pharmacokinetic parameters and significant drug interactions occurring due to API (Active pharmaceutical ingredients) contained within the product Result: A total of 18 combinations were analysed, among those 11 combinations were irrational. Conclusion: Predominantly irrational FDCs are being circulated in the Indian market hence through analyses by prescribers is needed before prescribing to patients in order to avoid ADR. This calls for a close scrutiny of marketed FDC's and educating prescribers to use them with great care and caution also indicates a serious review of regulatory framework for drug manufacturing and marketing. KEYWORDS: Fixed Dose Combinations; Antidiabetics; Irrational

Scheduling over Scenarios on Two Machines

We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all scenarios are given explicitly. The two objectives that we consider are minimizing the maximum makespan over all scenarios and minimizing the sum of the makespans of all scenarios. For both versions, we give several approximation algorithms and lower bounds on their approximability. With this research into optimization problems over scenarios, we have opened a new and rich field of interesting problems.Comment: To appear in COCOON 2014. The final publication is available at link.springer.co

A Hypergraph Dictatorship Test with Perfect Completeness

A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan and serves as a key component in their unique games based \PCP construction. Such a test has oracle access to a collection of functions and determines whether all the functions are the same dictatorship, or all their low degree influences are $o(1).$ Their test makes $q\geq3$ queries and has amortized query complexity $1+O(\frac{\log q}{q})$ but has an inherent loss of perfect completeness. In this paper we give an adaptive hypergraph dictatorship test that achieves both perfect completeness and amortized query complexity $1+O(\frac{\log q}{q})$.Comment: Some minor correction