OpenRaiser/Intern-Atlas huggingface dataset:
Towards automating the generation of derivative nouns in Sanskrit by simulating Panini
Venue: arXiv cs.CL 2015
Year: 2015

About 1115 rules in Astadhyayi from A.4.1.76 to A.5.4.160 deal with generation of derivative nouns, making it one of the largest topical sections in Astadhyayi, called as the Taddhita section owing to the head rule A.4.1.76. This section is a systematic arrangement of rules that enumerates various affixes that are used in the derivation under specific semantic relations. We propose a system that automates the process of generation of derivative nouns as per the rules in Astadhyayi. The proposed system follows a completely object oriented approach, that models each rule as a class of its own and then groups them as rule groups. The rule groups are decided on the basis of selective grouping of rules by virtue of anuvrtti. The grouping of rules results in an inheritance network of rules which is a directed acyclic graph. Every rule group has a head rule and the head rule notifies all the direct member rules of the group about the environment which contains all the details about data entities, participating in the derivation process. The system implements this mechanism using multilevel inheritance and observer design patterns. The system focuses not only on generation of the desired final form, but also on the correctness of sequence of rules applied to make sure that the derivation has taken place in strict adherence to Astadhyayi. The proposed system's design allows to incorporate various conflict resolution methods mentioned in authentic texts and hence the effectiveness of those rules can be validated with the results from the system. We also present cases where we have checked the applicability of the system with the rules which are not specifically applicable to derivation of derivative nouns, in order to see the effectiveness of the proposed schema as a generic system for modeling Astadhyayi.
HALO: Report and Predicted Response Times
Venue: arXiv cs.DC 2015
Year: 2015

HALO: Heterogeneity-Aware Load Balancing is a paper that proposes a class of heterogeneity-aware Load Balancers (LBs) for cluster systems. LBs that are heterogeneity-aware are able to detect when servers differ in speeds and in number of cores. Response times for heterogeneous systems are calculated and presented.
Domain Adaptation and Transfer Learning in StochasticNets
Venue: arXiv cs.CV 2015
Year: 2015

Transfer learning is a recent field of machine learning research that aims to resolve the challenge of dealing with insufficient training data in the domain of interest. This is a particular issue with traditional deep neural networks where a large amount of training data is needed. Recently, StochasticNets was proposed to take advantage of sparse connectivity in order to decrease the number of parameters that needs to be learned, which in turn may relax training data size requirements. In this paper, we study the efficacy of transfer learning on StochasticNet frameworks. Experimental results show ~7% improvement on StochasticNet performance when the transfer learning is applied in training step.
TP1-valid Transformation Functions for Operations on ordered n-ary Trees
Venue: arXiv cs.LO 2015
Year: 2015

Collaborative work on shared documents was revolutionized by web services like Google Docs or Etherpad. Multiple users can work on the same document in a comfortable and distributed way. For the synchronization of the changes a replication system named Operational Transformation is used. Such a system consists of a control algorithm and a transformation function. In essence, a transformation function solves the conflicts that arise when multiple users change the document at the same time. In this work we investigate on the correctness of such transformation functions. We introduce transformation functions n-ary trees that we designed especially for the purpose of synchronization changes on JSON objects. We provide a detailed proof of the necessary property: the Transformation Property 1.
Deformable Distributed Multiple Detector Fusion for Multi-Person Tracking
Venue: arXiv cs.CV 2015
Year: 2015

This paper addresses fully automated multi-person tracking in complex environments with challenging occlusion and extensive pose variations. Our solution combines multiple detectors for a set of different regions of interest (e.g., full-body and head) for multi-person tracking. The use of multiple detectors leads to fewer miss detections as it is able to exploit the complementary strengths of the individual detectors. While the number of false positives may increase with the increased number of bounding boxes detected from multiple detectors, we propose to group the detection outputs by bounding box location and depth information. For robustness to significant pose variations, deformable spatial relationship between detectors are learnt in our multi-person tracking system. On RGBD data from a live Intensive Care Unit (ICU), we show that the proposed method significantly improves multi-person tracking performance over state-of-the-art methods.
Face Hallucination using Linear Models of Coupled Sparse Support
Venue: arXiv cs.CV 2015
Year: 2015

Most face super-resolution methods assume that low-resolution and high-resolution manifolds have similar local geometrical structure, hence learn local models on the lowresolution manifolds (e.g. sparse or locally linear embedding models), which are then applied on the high-resolution manifold. However, the low-resolution manifold is distorted by the oneto-many relationship between low- and high- resolution patches. This paper presents a method which learns linear models based on the local geometrical structure on the high-resolution manifold rather than on the low-resolution manifold. For this, in a first step, the low-resolution patch is used to derive a globally optimal estimate of the high-resolution patch. The approximated solution is shown to be close in Euclidean space to the ground-truth but is generally smooth and lacks the texture details needed by state-ofthe-art face recognizers. This first estimate allows us to find the support of the high-resolution manifold using sparse coding (SC), which are then used as support for learning a local projection (or upscaling) model between the low-resolution and the highresolution manifolds using Multivariate Ridge Regression (MRR). Experimental results show that the proposed method outperforms six face super-resolution methods in terms of both recognition and quality. These results also reveal that the recognition and quality are significantly affected by the method used for stitching all super-resolved patches together, where quilting was found to better preserve the texture details which helps to achieve higher recognition rates.
Cloud Computation and Google Earth Visualization of Heat/Cold Waves: A Nonanticipative Long-Range Forecasting Case Study
Venue: arXiv cs.OH 2015
Year: 2015

Long-range forecasting of heat/cold waves is a topical issue nowadays. High computational complexity of the design of numerical and statistical models is a bottleneck for the forecast process. In this work, Windows Server 2012 R2 virtual machines are used as a high-performance tool for the speed-up of the computational process. Six D-series and one standard tier A-series virtual machines were hosted in Microsoft Azure public cloud for this purpose. Visualization of the forecasted data is based on the Google Earth Pro virtual globe in ASP.NET web-site against http://gearth.azurewebsites.net (prototype), where KMZ file represents geographic placemarks. The long-range predictions of the heat/cold waves are computed for several specifically located places based on nonanticipative analog algorithm. The arguments of forecast models are datasets from around the world, which reflects the concept of teleconnections. This methodology does not require the probability distribution to design the forecast models and/or calculate the predictions. Heat weaves at Annaba (Algeria) are discussed in detail. Up to 36.4% of heat waves are specifically predicted. Up to 33.3% of cold waves are specifically predicted for other four locations around the world. The proposed approach is 100% accurate if the signs of predicted and actual values are compared according to climatological baseline. These high-accuracy predictions were achieved due to the interdisciplinary approach, but advanced computer science techniques, public cloud computing and Google Earth Pro virtual globe mainly, form the major part of the work.
Quantifying Orphaned Annotations in Hypothes.is
Venue: arXiv cs.DL 2015
Year: 2015

Web annotation has been receiving increased attention recently with the organization of the Open Annotation Collaboration and new tools for open annotation, such as Hypothes.is. We investigate the prevalence of orphaned annotations, where neither the live Web page nor an archived copy of the Web page contains the text that had previously been annotated in the Hypothes.is annotation system (containing 20,953 highlighted text annotations). We found that about 22% of highlighted text annotations can no longer be attached to their live Web pages. Unfortunately, only about 12% of these annotations can be reattached using the holdings of current public web archives, leaving the remaining 88% of these annotations orphaned. For those annotations that are still attached, 53% are in danger of becoming orphans if the live Web page changes. This points to the need for archiving the target of an annotation at the time the annotation is created.
Test-Driven Development of ontologies (extended version)
Venue: arXiv cs.AI 2015
Year: 2015

Emerging ontology authoring methods to add knowledge to an ontology focus on ameliorating the validation bottleneck. The verification of the newly added axiom is still one of trying and seeing what the reasoner says, because a systematic testbed for ontology authoring is missing. We sought to address this by introducing the approach of test-driven development for ontology authoring. We specify 36 generic tests, as TBox queries and TBox axioms tested through individuals, and structure their inner workings in an `open box'-way, which cover the OWL 2 DL language features. This is implemented as a Protege plugin so that one can perform a TDD test as a black box test. We evaluated the two test approaches on their performance. The TBox queries were faster, and that effect is more pronounced the larger the ontology is. We provide a general sequence of a TDD process for ontology engineering as a foundation for a TDD methodology.
On the solutions of the minimum energy problem in one dimensional sensor networks
Venue: arXiv cs.NI 2015
Year: 2015

We discuss solutions of the minimum energy problem in one dimensional wireless sensor networks for the data transmission cost function $E(x_i,x_j) = d(x_i,x_j)^a + λ\;d(x_i,x_j)^b$ with any exponent $a,b\in R$ and $λ\geq 0$, where $d(x_i,x_j)$ is a distance between transmitter and receiver. We define the minimum energy problem in terms of sensors signal power, transmission time and capacities of a transmission channels. We prove, that for the point-to-point data transmission method utilized by the sensors in the physical layer, when the transmitter adjust the power of its radio signal to the distance to the receiver, the solutions of the minimum energy problem written in terms of data transmission cost function and in terms of the sensors signal power coincide.
Botnets Drilling Away Privacy Infrastructure
Venue: arXiv cs.CR 2015
Year: 2015

In this paper, we explore various technologies and their roles in subverting the privacy infrastructure of the Internet. We also provide mitigation techniques on the attack vectors the technologies provide, and assess the overall severity of these threats.
Sparse Coding with Fast Image Alignment via Large Displacement Optical Flow
Venue: arXiv cs.CV 2015
Year: 2015

Sparse representation-based classifiers have shown outstanding accuracy and robustness in image classification tasks even with the presence of intense noise and occlusion. However, it has been discovered that the performance degrades significantly either when test image is not aligned with the dictionary atoms or the dictionary atoms themselves are not aligned with each other, in which cases the sparse linear representation assumption fails. In this paper, having both training and test images misaligned, we introduce a novel sparse coding framework that is able to efficiently adapt the dictionary atoms to the test image via large displacement optical flow. In the proposed algorithm, every dictionary atom is automatically aligned with the input image and the sparse code is then recovered using the adapted dictionary atoms. A corresponding supervised dictionary learning algorithm is also developed for the proposed framework. Experimental results on digit datasets recognition verify the efficacy and robustness of the proposed algorithm.
SRPS: Secure Routing Protocol for Static Sensor Networks
Venue: arXiv cs.NI 2015
Year: 2015

In sensor networks, nodes cooperatively work to collect data and forward it to the final destination. Many protocols have been proposed in the literature to provide routing and secure routing for ad hoc and sensor networks, but these protocols either very expensive to be used in very resource-limited environments such as sensor networks, or suffer from the lack of one or more security guarantees and vulnerable to attacks such as wormhole, Sinkhole, Sybil, blackhole, selective forwarding, rushing, and fabricating attacks. In this paper we propose a secure lightweight routing protocol called SRPS. SRPS uses symmetric cryptographic entities within the capabilities of the sensors, supports intermediate node authentication of the routing information in addition to end-to-end authentication, provides secure multiple disjoint paths, and thwarts all the known attacks against routing infrastructure against Byzantine cooperative attack model. We analyze the security guarantees of SRPS and use Ns-2 simulations to show the effectiveness of SRPS in counter-measuring known attacks against the routing infrastructure. Overhead cost analysis is conducted to prove the lightweight-ness of SRPS
Comparison of full-text versus metadata searching in an institutional repository: Case study of the UNT Scholarly Works
Venue: arXiv cs.DL 2015
Year: 2015

Authors in the library science field disagree about the importance of using costly resources to create local metadata records, particularly for scholarly materials that have full-text search alternatives. At the University of North Texas (UNT) Libraries, we decided to test this concept by answering the question: What percentage of search terms retrieved results based on full-text versus metadata values for items in the UNT Scholarly Works institutional repository? The analysis matched search query logs to indexes of the metadata records and full text of the items in the collection. Results show the distribution of item discoveries that were based on metadata exclusively, on full text exclusively, and on the combination of both. This paper describes in detail the methods and findings of this study.
A Critical Survey Of Privacy Infrastructures
Venue: arXiv cs.CY 2015
Year: 2015

Over the last two decades, the scale and complexity of the Internet and its associated technologies built on the World Wide Web has grown exponentially with access to Internet as a facility occupying a prime place with other amenities of modern lives. In years to come, usage of Internet may unravel more pleasant surprises for us as far as novelty in its usage is concerned. As a democratic function of Internet, and relying on the open model on which it has been built, there has been concerted efforts in the direction of privacy protection and use of privacy enhancing tools which have gained tangible traction. Innovation in use of VPN, TLS/SSL and cryptographic tools are a testimony to it. Another popular tool is Tor, which has gained widespread popularity as it is being increasingly used by anonymity seeking users to effectively maintain their discretion while surfing the web. However, there is a darker side to increased proliferation of Internet in our everyday routine. We are certainly not living in a utopian age and there are potentials of misuse of Internet as well. Across every nook and cranny of Internet's sprawling virtual world, there are cyber criminals lurking n dangerous alleys to use the very same Internet as malevolent tool to abuse it and cause financial, physical and social harm to ordinary people. Failing to manage the widespread spawning of World Wide Web has rendered it weak against misuse. In last few decades especially, Internet has been inundated with malware, ransomware, viruses, Trojans, illegal spy tools and what not created with malignant sentiments. In this paper, we will analyze few of the subverting privacy infrastructures.
Study of Opportunistic Cooperation Techniques using Jamming and Relays for Physical-Layer Security in Buffer-aided Relay Networks
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. We propose an algorithm to select a set of relay nodes to enhance the legitimate users' transmission and another set of relay nodes to perform jamming of the eavesdroppers. With Inter-Relay interference (IRI) taken into account, interference cancellation can be implemented to assist the transmission of the legitimate users. Secondly, IRI can also be used to further increase the level of harm of the jamming signal to the eavesdroppers. By exploiting the fact that the jamming signal can be stored at the relay nodes, we also propose a hybrid algorithm to set a signal-to-interference and noise ratio (SINR) threshold at the node to determine the type of signal stored at the relay node. With this separation, the signals with high SINR are delivered to the users as conventional relay systems and the low SINR performance signals are stored as potential jamming signals. Simulation results show that the proposed techniques obtain a significant improvement in secrecy rate over previously reported algorithms.
Modelling and Analysis of AODV in UPPAAL
Venue: arXiv cs.NI 2015
Year: 2015

This paper describes work in progress towards an automated formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in ad hoc wireless networks. We give a brief overview of a model of AODV implemented in the UPPAAL model checker, and describe experiments carried out to explore AODV's behaviour in two network topologies. We were able to locate automatically and confirm some known problematic and undesirable behaviours. We believe this use of model checking as a diagnostic tool complements other formal methods based protocol modelling and verification techniques, such as process algebras. Model checking is in particular useful for the discovery of protocol limitations and in the development of improved variations.
A Process Algebra for Wireless Mesh Networks
Venue: arXiv cs.LO 2015
Year: 2015

We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.
Complete weight enumerators of two classes of linear codes
Venue: arXiv cs.IT 2015
Year: 2015

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes.
Dynamic Base Station Operation in Large-Scale Green Cellular Networks
Venue: arXiv cs.IT 2015
Year: 2015

In this paper, to minimize the on-grid energy cost in a large-scale green cellular network, we jointly design the optimal base station (BS) on/off operation policy and the on-grid energy purchase policy from a network-level perspective. Due to the fluctuations of the on-grid energy prices, the harvested renewable energy, and the network traffic loads over time, as well as the BS coordination to hand over the traffic offloaded from the inactive BSs to the active BSs, it is generally NP-hard to find a network-level optimal adaptation policy that can minimize the on-grid energy cost over a long-term and yet assures the downlink transmission quality at the same time. Aiming at the network-level dynamic system design, we jointly apply stochastic geometry (Geo) for large-scale green cellular network analysis and dynamic programming (DP) for adaptive BS on/off operation design and on-grid energy purchase design, and thus propose a new Geo-DP design approach. By this approach, we obtain the optimal BS on/off policy, which shows that the optimal BSs' active operation probability in each horizon is just sufficient to assure the required downlink transmission quality with time-varying load in the large-scale cellular network. We also propose a suboptimal on-grid energy purchase policy with low-complexity, where the low-price on-grid energy is over-purchased in the current horizon only when the current storage level and the future renewable energy level are both low. We compare the proposed policy with the existing schemes and show that our proposed policy can more efficiently save the on-grid energy cost over time.
Thermal Aware Design Method for VCSEL-Based On-Chip Optical Interconnect
Venue: arXiv cs.ET 2015
Year: 2015

Optical Network-on-Chip (ONoC) is an emerging technology considered as one of the key solutions for future generation on-chip interconnects. However, silicon photonic devices in ONoC are highly sensitive to temperature variation, which leads to a lower efficiency of Vertical-Cavity Surface-Emitting Lasers (VCSELs), a resonant wavelength shift of Microring Resonators (MR), and results in a lower Signal to Noise Ratio (SNR). In this paper, we propose a methodology enabling thermal-aware design for optical interconnects relying on CMOS-compatible VCSEL. Thermal simulations allow designing ONoC interfaces with low gradient temperature and analytical models allow evaluating the SNR.
Optical Crossbars on Chip: a comparative study based on worst-case losses
Venue: arXiv cs.ET 2015
Year: 2015

The many cores design research community have shown high interest in optical crossbars on chip for more than a decade. Key properties of optical crossbars, namely a) contention free data routing b) low latency communication and c) potential for high bandwidth through the use of WDM, motivate several implementations of this type of interconnect. These implementations demonstrate very different scalability and power efficiency ability depending on three key design factors: a) the network topology, b) the considered layout and the c) the injection losses induced by the fabrication process. In this paper, the worst-case optical losses of crossbar implementations are compared according to the factors mentioned above. The comparison results has the potential to help many cores system designer to select the most appropriate crossbar implementation according, for instance, to the number of IP cores and the chip die size.