Department of Computer Science & Engineering

&ldquo;IIT Jodhpur is committed to impart quality education to facilitate the creation of qualified, competent and responsible human resources to meet the emerging technological challenges of the world. It is working towards creating an equitable learning platform that is positive, accessible and effective in the face of the modern societal and scientific advancements.

Flexibility in curriculum, in all its academic programs, encompassing elements of teaching, research, creativity, innovation and entrepreneurship is the most unique feature of IIT Jodhpur. The Department of Science and Technology (DST), under the National Mission on Cyber Physical Systems, has identified IIT Jodhpur as a Technology &amp; Innovation Hub in the area of Augmented Reality and Virtual Reality. The institute has also been nominated as the coordinator for the Jodhpur City and Knowledge Cluster by the Office of Principal Scientific Adviser, Government of India.

The sprawling 852-acre IIT Jodhpur campus is a majestic tribute to the deep-rooted diverse cultural heritage of the region. The campus is an architectural masterpiece, which is slated to become an international exemplar of sustainability with net-zero energy, and advanced water and waste management strategies.&rdquo;

IIT Jodhpur

Efficient traffic control system now a day's getting importance from different perspectives like number of the vehicle density, time management and less proportionate road lane increase. Different factors engross under various researchers, industries, improving the road transportation system. Major obstacle for vehicle on the road is the junction and traffic clearance at mixed scenarios at the junctions. In this paper, we have proposed a Vehicular Ad-hoc Network (VANET) architecture for real time traffic information exchange from one traffic signal to another traffic signal via vehicle. A probabilistic function also involved to capture future prediction of traffic count at one step ahead of the current traffic signal. As per the traffic information received time to time a modified Round Robin algorithm is introduced with different and segmented quantum time. In our approach, neither complex computations are required, like image processing nor costly infrastructure is required, like GPS systems and centralized management. In this way we can create a smart, decentralized vehicle transportation system for a mega city. © 2017 IEEE.

World University root node

8th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2017

An architecture of smart transportation system using modified RR algorithm and VANET

We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs that have k terminal vertices. We show that every interval graph admits a distancepreserving subgraph with O(k log k) branching vertices. We also prove a matching Ω (k log k) lower bound by exhibiting an interval graph based on bit-reversal permutation matrices. In addition, we show that interval graphs admit subgraphs with O(k) branching vertices that approximate distances up to an additive term of +1.

Leibniz International Proceedings in Informatics, LIPIcs

Distance-preserving subgraphs of interval graphs

OAEP and other similar schemes, proven secure in random-oracle model, require one or more hash functions with an output size larger than those of the standard hash functions. In this paper, we show that by using the popular Sponge construction in the OAEP framework, we can eliminate the need for such a hash function. We provide a new scheme in the OAEP framework and call our scheme Sponge-based asymmetric encryption padding (SpAEP). The scheme SpAEP is based on two functions: Sponge and SpongeWrap, and requires only standard output sizes proposed and standardised for Sponge functions. Our scheme is CCA2 secure for any trapdoor one-way permutation in the ideal permutation model for arbitrary length messages. Our scheme utilises the versatile Sponge function to enhance the capability and efficiency of the OAEP framework. Prior to this work, the only scheme proven secure in the ideal permutation model was OAEP-3R. However this scheme is not efficient in practice as it utilises a full domain permutation which is hard to find and construct efficiently in practice. Therefore, the author of OAEP-3R provided another version of OAEP-3R but in random oracle model. Our scheme SpAEP utilises the ideal permutation model in a novel manner which makes SpAEP efficient and practical to construct a public key encryption. We also propose a key encapsulation mechanism for hybrid encryption using SpAEP with any trapdoor one-way permutation. © 2017 Inderscience Enterprises Ltd.

International Journal of Applied Cryptography

Sponge-based CCA2 secure asymmetric encryption for arbitrary length message (extended version)

Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V, E) which minimizes the maximum vertex cut or separation of a layout. It is an NP-complete problem in general for which metaheuristic techniques can be applied to find near optimal solution. VSMP has applications in VLSI design, graph drawing and computer language compiler design. VSMP is polynomially solvable for grids, trees, permutation graphs and cographs. Construction heuristics play a very important role in the metaheuristic techniques as they are responsible for generating initial solutions which lead to fast convergence. In this paper, we have proposed three construction heuristics H1, H2 and H3 and performed experiments on Grids, Small graphs, Trees and Harwell Boeing graphs, totaling 248 instances of graphs. Experiments reveal that H1, H2 and H3 are able to achieve best results for 88.71%, 43.5% and 37.1% of the total instances respectively while the best construction heuristic in the literature achieves the best solution for 39.9% of the total instances. We have also compared the results with the state-of-the-art meta-heuristic GVNS and observed that the proposed construction heuristics improves the results for some of the input instances. It was found that GVNS obtained best results for 82.9% instances of all input instances and the heuristic H1 obtained best results for 82.3% of all input instances. © 2017 Elsevier B.V.

Fulltext

Electronic Notes in Discrete Mathematics

Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem

In the mixed dominating set (mds) problem, we are given an n-vertex graph G and a positive integer k, and the objective is to decide whether there exists a set S⊆ V(G) ∪ E(G) of cardinality at most k such that every element x∈ (V(G) ∪ E(G)) \ S is either adjacent to or incident with an element of S. We show that mds can be solved in time 7. 465 knO ( 1 ) on general graphs, and in time 2O(k)nO(1) on planar graphs. We complement this result by showing that mds does not admit an algorithm with running time 2 o ( k )nO ( 1 ) unless the Exponential Time Hypothesis (ETH) fails, and that it does not admit a polynomial kernel unless coNP ⊆ NP/ poly. In addition, we provide an algorithm which, given a graph G together with a tree decomposition of width tw, solves mds in time 6 twnO ( 1 ). We finally show that unless the Set Cover Conjecture (SeCoCo) fails, mds does not admit an algorithm with running time O((2 - ϵ) tw ( G )nO ( 1 )) for any ϵ&gt; 0, where tw(G) is the tree-width of G. © 2017, Springer International Publishing AG.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Mixed dominating set: A parameterized perspective

Natural language provides a rich combinatorial mechanism for encoding meanings - a finite set of words can express an unbounded number of thoughts. Framed in 2015 to extend the purpose of Zadeh's Z-numbers, a Z*-number is a perceptual symbol of the meaning of a natural language expression and consequently mentalese – or internal speech. This article, through decomposition of the Z*-macro-parameters into its atomic constituents, presents a model for the endogenous arousal of thoughts during empathetic, bespoke comprehension of the real-world. Based on Minsky's Society of Mind, the framework is founded on the assimilation of multimodal experiences, a sense of ‘unified self’ and its derivatives (choice, interest, curiosity, etc.), objective and subjective components of knowledge, commonsense, and attention dynamics over a real-world scenario. The model attempts emulation of slow and fast thinking, instinctive reactions, learning, deliberation, reflection and self-conscious decisions. The design has been validated against human responses, and aims to contribute to the development of autonomous artificial systems for man-machine symbiosis. © 2017 Elsevier Inc.

Information Sciences

A computational model for the endogenous arousal of thoughts through Z*-numbers

Color and strokes are the salient features of text regions in an image. In this work, we use both these features as cues, and introduce a novel energy function to formulate the text binarization problem. The minimum of this energy function corresponds to the optimal binarization. We minimize the energy function with an iterative graph cut-based algorithm. Our model is robust to variations in foreground and background as we learn Gaussian mixture models for color and strokes in each iteration of the graph cut. We show results on word images from the challenging ICDAR 2003/2011, born-digital image and street view text datasets, as well as full scene images containing text from ICDAR 2013 datasets, and compare our performance with state-of-the-art methods. Our approach shows significant improvements in performance under a variety of performance measures commonly used to assess text binarization schemes. In addition, our method adapts to diverse document images, like text in videos, handwritten text images. © 2017, Springer-Verlag Berlin Heidelberg.

International Journal on Document Analysis and Recognition

Unsupervised refinement of color and stroke features for text binarization

Sports Commentaries offer sparse and redundant information in a lengthy format. Patterns can be observed in news articles written by sports journalists. In this paper, we propose a graphical method to synthesise story snippet from football match commentaries. Our model effectively extracts important information from lengthy text documents. Experimental study reveals that our model closely matches with human expectations. Both qualitative and quantitative analysis proves the effectiveness of our proposed method. © 2017, Springer International Publishing AG.

A Graphical Model for Football Story Snippet Synthesis from Large Scale Commentary

ACM International Conference Proceeding Series

Code-borrowedness of english words in Hindi language

Xylem vessels play a pivotal role in plant adaptation to drought stress. In this paper, we propose a novel framework that associates automatic segmentation of xylem vessels with its morphological features as a quantitative proxy to predict drought stress response (DSR). We develop an image processing pipeline that comprises of low level processing which enables high-throughput detection of xylem vessels. With no prior information about its size and location, the proposed detection methodology gives an accuracy of 98%. The labelled data for DSR are either not available or are subjectively developed, which is a low-throughput and error prone task. We resolve this problem by employing simplex volume maximization (SiVM) algorithm. The convex representations obtained from SiVM for each xylem in microscopic images based on its shape factors are aggregated to get an automated scoring of the whole plant. Bhattacharya distance is then employed to obtain the divergence of these responses w.r.t. the control group. The proposed framework successfully captures the phenotypic difference between MTU-1010 (drought susceptible rice cultivar) and Sahbhagi Dhan (drought tolerant rice cultivar). © 2017 MVA Organization All Rights Reserved.