OpenRaiser/Intern-Atlas huggingface dataset:
A Lookback Scheduling Framework for Long-Term Quality-of-Service Over Multiple Cells
Venue: arXiv cs.NI 2014
Year: 2014

In current cellular networks, schedulers allocate wireless channel resources to users based on instantaneous channel gains and short-term moving averages of user rates and queue lengths. By using only such short-term information, schedulers ignore the users' service history in previous cells and, thus, cannot guarantee long-term Quality of Service (QoS) when users traverse multiple cells with varying load and capacity. In this paper, we propose a new Long-term Lookback Scheduling (LLS) framework, which extends conventional short-term scheduling with long-term QoS information from previously traversed cells. We demonstrate the application of LLS for common channel-aware, as well as channel and queue-aware schedulers. The developed long-term schedulers also provide a controllable trade-off between emphasizing the immediate user QoS or the long-term measures. Our simulation results show high gains in long-term QoS without sacrificing short-term user requirements. Therefore, the proposed scheduling approach improves subscriber satisfaction and increases operational efficiency.
Three Semantics for Modular Systems
Venue: arXiv cs.LO 2014
Year: 2014

In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define two novel semantics, a structural operational semantics, and an inference-based semantics. We prove the new semantics are equivalent to the original model-theoretic semantics and describe future research directions.
New Algorithmic Approaches to Point Constellation Recognition
Venue: arXiv cs.CV 2014
Year: 2014

Point constellation recognition is a common problem with many pattern matching applications. Whilst useful in many contexts, this work is mainly motivated by fingerprint matching. Fingerprints are traditionally modelled as constellations of oriented points called minutiae. The fingerprint verifier's task consists in comparing two point constellations. The compared constellations may differ by rotation and translation or by much more involved transforms such as distortion or occlusion. This paper presents three new constellation matching algorithms. The first two methods generalize an algorithm by Bringer and Despiegel. Our third proposal creates a very interesting analogy between mechanical system simulation and the constellation recognition problem.
A Network Intrusions Detection System based on a Quantum Bio Inspired Algorithm
Venue: arXiv cs.NE 2014
Year: 2014

Network intrusion detection systems (NIDSs) have a role of identifying malicious activities by monitoring the behavior of networks. Due to the currently high volume of networks trafic in addition to the increased number of attacks and their dynamic properties, NIDSs have the challenge of improving their classification performance. Bio-Inspired Optimization Algorithms (BIOs) are used to automatically extract the the discrimination rules of normal or abnormal behavior to improve the classification accuracy and the detection ability of NIDS. A quantum vaccined immune clonal algorithm with the estimation of distribution algorithm (QVICA-with EDA) is proposed in this paper to build a new NIDS. The proposed algorithm is used as classification algorithm of the new NIDS where it is trained and tested using the KDD data set. Also, the new NIDS is compared with another detection system based on particle swarm optimization (PSO). Results shows the ability of the proposed algorithm of achieving high intrusions classification accuracy where the highest obtained accuracy is 94.8 %.
D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation
Venue: arXiv cs.CL 2014
Year: 2014

Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within a certain context. WSD was recently addressed as a combinatorial optimization problem in which the goal is to find a sequence of senses that maximize the semantic relatedness among the target words. In this article, a novel algorithm for solving the WSD problem called D-Bees is proposed which is inspired by bee colony optimization (BCO)where artificial bee agents collaborate to solve the problem. The D-Bees algorithm is evaluated on a standard dataset (SemEval 2007 coarse-grained English all-words task corpus)and is compared to simulated annealing, genetic algorithms, and two ant colony optimization techniques (ACO). It will be observed that the BCO and ACO approaches are on par.
An expert system for recommending suitable ornamental fish addition to an aquarium based on aquarium condition
Venue: arXiv cs.AI 2014
Year: 2014

Expert systems prove to be suitable replacement for human experts when human experts are unavailable for different reasons. Various expert system has been developed for wide range of application. Although some expert systems in the field of fishery and aquaculture has been developed but a system that aids user in process of selecting a new addition to their aquarium tank never been designed. This paper proposed an expert system that suggests new addition to an aquarium tank based on current environmental condition of aquarium and currently existing fishes in aquarium. The system suggest the best fit for aquarium condition and most compatible to other fishes in aquarium.
Comment on "Quantifying Long-term Scientific Impact"
Venue: arXiv cs.DL 2014
Year: 2014

The paper comments on "Quantifying long-term scientific impact". It indicates that there is a mistake of [D. S. Wang , C. Song, A. L. Barabasi, Quantifying long-term scientific impact, Science 342, 127 (2013), arXiv:1306.3293].
DepecheMood: a Lexicon for Emotion Analysis from Crowd-Annotated News
Venue: arXiv cs.CL 2014
Year: 2014

While many lexica annotated with words polarity are available for sentiment analysis, very few tackle the harder task of emotion analysis and are usually quite limited in coverage. In this paper, we present a novel approach for extracting - in a totally automated way - a high-coverage and high-precision lexicon of roughly 37 thousand terms annotated with emotion scores, called DepecheMood. Our approach exploits in an original way 'crowd-sourced' affective annotation implicitly provided by readers of news articles from rappler.com. By providing new state-of-the-art performances in unsupervised settings for regression and classification tasks, even using a na\"ıve approach, our experiments show the beneficial impact of harvesting social media data for affective lexicon building.
Multi-Message Broadcast with Abstract MAC Layers and Unreliable Links
Venue: arXiv cs.DC 2014
Year: 2014

We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal propagation and contention. We begin by studying upper and lower bounds for this problem in a {\em standard abstract MAC layer model}---identifying an interesting dependence between the structure of unreliable links and achievable time complexity. In more detail, given a restriction that devices connected directly by an unreliable link are not too far from each other in the reliable link topology, we can (almost) match the efficiency of the reliable case. For the related restriction, however, that two devices connected by an unreliable link are not too far from each other in geographic distance, we prove a new lower bound that shows that this efficiency is impossible. We then investigate how much extra power must be added to the model to enable a new order of magnitude of efficiency. In more detail, we consider an {\em enhanced abstract MAC layer model} and present a new multi-message broadcast algorithm that (under certain natural assumptions) solves the problem in this model faster than any known solutions in an abstract MAC layer setting.
Energy Efficient Clustering using Jumper Firefly Algorithm in Wireless Sensor Networks
Venue: arXiv cs.NI 2014
Year: 2014

Wireless Sensor Network (WSN) is a major and very interesting technology, which consists of small battery powered sensor nodes with limited power resources. The sensor nodes are inaccessible to the user once they are deployed. Replacing the battery is not possible every time. Hence in order to improve the lifetime of the network, energy efficiency of the net- work needs to be maximized by decreasing the energy consumption of all the sensor nodes and balancing energy consumption of every node. Several protocols have been proposed earlier to improve the network lifetime using optimization algorithms. Firefly is a metaheuristic approach. In this paper, Energy efficient clustering for wireless sensor networks using Firefly and Jumper Firefly algorithms are simulated. A new cost function has been defined to minimize the intra- cluster distance to optimize the energy consumption of the network. The performance is compared with the existing protocol LEACH (Low Energy Adaptive Clustering Hierarchy).
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version)
Venue: arXiv cs.LO 2014
Year: 2014

We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running exactly the same finite-state program. We discuss the complexity of deciding that no component reaches an unsafe state. The note is addressed at theoretical computer scientists in general.
Downlink and Uplink Decoupling: a Disruptive Architectural Design for 5G Networks
Venue: arXiv cs.NI 2014
Year: 2014

Cell association in cellular networks has traditionally been based on the downlink received signal power only, despite the fact that up and downlink transmission powers and interference levels differed significantly. This approach was adequate in homogeneous networks with macro base stations all having similar transmission power levels. However, with the growth of heterogeneous networks where there is a big disparity in the transmit power of the different base station types, this approach is highly inefficient. In this paper, we study the notion of Downlink and Uplink Decoupling (DUDe) where the downlink cell association is based on the downlink received power while the uplink is based on the pathloss. We present the motivation and assess the gains of this 5G design approach with simulations that are based on Vodafone's LTE field trial network in a dense urban area, employing a high resolution ray-tracing pathloss prediction and realistic traffic maps based on live network measurements.
Change Management and Version Control of Scientific Applications
Venue: arXiv cs.SE 2014
Year: 2014

The development process of scientific applications is largely dependent on scientific progress and the experimental research results. Thus, dealing with frequent changes is one of the main problems faced by the developers of scientific software. Taking into account the results of the survey conducted among scientists in the HP-SEE project, the implementation of change management and version control software processes is inevitable. In this paper, we propose software engineering principles that should be included in the development process to improve the version control and change management. Moreover, we give some specific recommendations for their implementation, thereby making a slight modification of already generally accepted templates and methods. The development steps practiced by scientists should not be replaced completely, but they need to be supplemented with appropriate practices, documents and formal methods. We also emphasize the reasons for the inclusion of these two processes and the consequences that may arise as a result of their non-application.
The Efficiency Examination of Teaching of Different Normalization Methods
Venue: arXiv cs.DB 2014
Year: 2014

Normalization is an important database design method, in the course of the teaching of data modeling the understanding and applying of this method cause problems for students the most. For improving the efficiency of learning normalization we looked for alternative normalization methods and introduced them into education. We made a survey among engineer students how efficient could they execute the normalization with different methods. We executed statistical and data mining examinations to decide whether any of the methods resulted significantly better solutions.
Image Resolution and Contrast Enhancement of Satellite Geographical Images with Removal of Noise using Wavelet Transforms
Venue: arXiv cs.CV 2014
Year: 2014

In this paper the technique for resolution and contrast enhancement of satellite geographical images based on discrete wavelet transform (DWT), stationary wavelet transform (SWT) and singular value decomposition (SVD) has been proposed. In this, the noise is added in the input low resolution and low contrast image. The median filter is used remove noise from the input image. This low resolution, low contrast image without noise is decomposed into four sub-bands by using DWT and SWT. The resolution enhancement technique is based on the interpolation of high frequency components obtained by DWT and input image. SWT is used to enhance input image. DWT is used to decompose an image into four frequency sub bands and these four sub-bands are interpolated using bicubic interpolation technique. All these sub-bands are reconstructed as high resolution image by using inverse DWT (IDWT). To increase the contrast the proposed technique uses DWT and SVD. GHE is used to equalize an image. The equalized image is decomposed into four sub-bands using DWT and new LL sub-band is reconstructed using SVD. All sub-bands are reconstructed using IDWT to generate high resolution and contrast image over conventional techniques. The experimental result shows superiority of the proposed technique over conventional techniques. Key words: Discrete wavelet transform (DWT), General histogram equalization (GHE), Median filter, Singular value decomposition (SVD), Stationary wavelet transform (SWT).
Model-Driven Applications of Fractional Derivatives and Integrals
Venue: arXiv cs.CV 2014
Year: 2014

Fractional order derivatives and integrals (differintegrals) are viewed from a frequency-domain perspective using the formalism of Riesz, providing a computational tool as well as a way to interpret the operations in the frequency domain. Differintegrals provide a logical extension of current techniques, generalizing the notion of integral and differential operators and acting as kind of frequency-domain filtering that has many of the advantages of a nonlocal linear operator. Several important properties of differintegrals are presented, and sample applications are given to one- and two-dimensional signals. Computer code to carry out the computations is made available on the author's website.
A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels
Venue: arXiv cs.IT 2014
Year: 2014

We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels. The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csiszár (2013).
Precision Enhancement of 3D Surfaces from Multiple Compressed Depth Maps
Venue: arXiv cs.CV 2014
Year: 2014

In texture-plus-depth representation of a 3D scene, depth maps from different camera viewpoints are typically lossily compressed via the classical transform coding / coefficient quantization paradigm. In this paper we propose to reduce distortion of the decoded depth maps due to quantization. The key observation is that depth maps from different viewpoints constitute multiple descriptions (MD) of the same 3D scene. Considering the MD jointly, we perform a POCS-like iterative procedure to project a reconstructed signal from one depth map to the other and back, so that the converged depth maps have higher precision than the original quantized versions.
Variational Image Segmentation Model Coupled with Image Restoration Achievements
Venue: arXiv cs.CV 2014
Year: 2014

Image segmentation and image restoration are two important topics in image processing with great achievements. In this paper, we propose a new multiphase segmentation model by combining image restoration and image segmentation models. Utilizing image restoration aspects, the proposed segmentation model can effectively and robustly tackle high noisy images, blurry images, images with missing pixels, and vector-valued images. In particular, one of the most important segmentation models, the piecewise constant Mumford-Shah model, can be extended easily in this way to segment gray and vector-valued images corrupted for example by noise, blur or missing pixels after coupling a new data fidelity term which comes from image restoration topics. It can be solved efficiently using the alternating minimization algorithm, and we prove the convergence of this algorithm with three variables under mild condition. Experiments on many synthetic and real-world images demonstrate that our method gives better segmentation results in comparison to others state-of-the-art segmentation models especially for blurry images and images with missing pixels values.
A New Multi-Tiered Solid State Disk Using Slc/Mlc Combined Flash Memory
Venue: arXiv cs.OH 2014
Year: 2014

Storing digital information, ensuring the accuracy, steady and uninterrupted access to the data are considered as fundamental challenges in enterprise-class organizations and companies. In recent years, new types of storage systems such as solid state disks (SSD) have been introduced. Unlike hard disks that have mechanical structure, SSDs are based on flash memory and thus have electronic structure. Generally a SSD consists of a number of flash memory chips, some buffers of the volatile memory type, and an embedded microprocessor, which have been interconnected by a port. This microprocessor run a small file system which called flash translation layer (FTL). This software controls and schedules buffers, data transfers and all flash memory tasks. SSDs have some advantages over hard disks such as high speed, low energy consumption, lower heat and noise, resistance against damage, and smaller size. Besides, some disadvantages such as limited endurance and high price are still challenging. In this study, the effort is to combine two common technologies - SLC and MLC chips - used in the manufacture of SSDs in a single SSD to decrease the side effects of current SSDs. The idea of using multi-layer SSD is regarded as an efficient solution in this field.
Evaluation The Efficiency Of Cuckoo Optimization Algorithm
Venue: arXiv cs.NE 2014
Year: 2014

In this paper a new evolutionary algorithm, for continuous nonlinear optimization problems, is surveyed. This method is inspired by the life of a bird, called Cuckoo. The Cuckoo Optimization Algorithm (COA) is evaluated by using the Rastrigin function. The problem is a non-linear continuous function which is used for evaluating optimization algorithms. The efficiency of the COA has been studied by obtaining optimal solution of various dimensions Rastrigin function in this paper. The mentioned function also was solved by FA and ABC algorithms. Comparing the results shows the COA has better performance than other algorithms. Application of algorithm to test function has proven its capability to deal with difficult optimization problems.
G4LTL-ST: Automatic Generation of PLC Programs
Venue: arXiv cs.LO 2014
Year: 2014

G4LTL-ST automatically synthesizes control code for industrial Programmable Logic Controls (PLC) from timed behavioral specifications of input-output signals. These specifications are expressed in a linear temporal logic (LTL) extended with non-linear arithmetic constraints and timing constraints on signals. G4LTL-ST generates code in IEC 61131-3-compatible Structured Text, which is compiled into executable code for a large number of industrial field-level devices. The synthesis algorithm of G4LTL-ST implements pseudo-Boolean abstraction of data constraints and the compilation of timing constraints into LTL, together with a counterstrategy-guided abstraction refinement synthesis loop. Since temporal logic specifications are notoriously difficult to use in practice, G4LTL-ST supports engineers in specifying realizable control problems by suggesting suitable restrictions on the behavior of the control environment from failed synthesis attempts.
Impact of Two Realistic Mobility Models for Vehicular Safety Applications
Venue: arXiv cs.NI 2014
Year: 2014

Vehicular safety applications intended for VANETs. It can be separated by inter-vehicle communication. It is needed for a vehicle can travel safety with high velocity and must interconnect quickly dependably. In this work, examined the impact of the IDM-IM and IDM-LC mobility model on AODV, AOMDV, DSDV and OLSR routing protocol using Nakagami propagation model and IEEE 802.11p MAC protocol in a particular urban scenario of Dhaka city. The periodic broadcast (PBC) agent is employed to transmit messages between vehicles in case of emergency or collision avoidance for vehicular safety communication. The simulation results recommend numerous concerns such as lower packet drop rate, delay, jitter, route cost and mean-hop is necessary to be measured before developing a robust safety application of VANET.
Graph Spectral Properties of Deterministic Finite Automata
Venue: arXiv cs.FL 2014
Year: 2014

We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of matrix rank into a regular language L, the minimal adjacency matrix rank of a deterministic automaton that recognises L. We then define and focus on rank-one languages: the class of languages for which the rank of minimal automaton is one. We also define the expanded canonical automaton of a rank-one language.
Towards an Efficient Prolog System by Code Introspection
Venue: arXiv cs.PL 2014
Year: 2014

To appear in Theory and Practice of Logic Programming (TPLP). Several Prolog interpreters are based on the Warren Abstract Machine (WAM), an elegant model to compile Prolog programs. In order to improve the performance several strategies have been proposed, such as: optimize the selection of clauses, specialize the unification, global analysis, native code generation and tabling. This paper proposes a different strategy to implement an efficient Prolog System, the creation of specialized emulators on the fly. The proposed strategy was implemented and evaluated at YAP Prolog System, and the experimental evaluation showed interesting results.