OpenRaiser/Intern-Atlas huggingface dataset:
Implementing Transitive Credit with JSON-LD
Venue: arXiv cs.CY 2014
Year: 2014

Science and engineering research increasingly relies on activities that facilitate research but are not currently rewarded or recognized, such as: data sharing; developing common data resources, software and methodologies; and annotating data and publications. To promote and advance these activities, we must develop mechanisms for assigning credit, facilitate the appropriate attribution of research outcomes, devise incentives for activities that facilitate research, and allocate funds to maximize return on investment. In this article, we focus on addressing the issue of assigning credit for both direct and indirect contributions, specifically by using JSON-LD to implement a prototype transitive credit system.
The Expressive Power of Epistemic $μ$-Calculus
Venue: arXiv cs.LO 2014
Year: 2014

While the $μ$-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic $μ$-calculus does not subsume ATL with imperfect information (ATL$_i$) for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to the epistemic $μ$-calculus, and this for any knowledge semantics. Using this result we also show that, for bounded-memory semantics, the epistemic $μ$-calculus is not more expressive than the standard $μ$-calculus, and that its satisfiability problem is EXPTIME-complete.
Context Aware Dynamic Traffic Signal Optimization
Venue: arXiv cs.AI 2014
Year: 2014

Conventional urban traffic control systems have been based on historical traffic data. Later advancements made use of detectors, which enabled the gathering of real time traffic data, in order to reorganize and calibrate traffic signalization programs. Further evolvement provided the ability to forecast traffic conditions, in order to develop traffic signalization programs and strategies precomputed and applied at the most appropriate time frame for the optimal control of the current traffic conditions. We, propose the next generation of traffic control systems based on principles of Artificial Intelligence and Context Awareness. Most of the existing algorithms use average waiting time or length of the queue to assess an algorithms performance. However, a low average waiting time may come at the cost of delaying other vehicles indefinitely. In our algorithm, besides the vehicle queue, we use fairness also as an important performance metric to assess an algorithms performance.
An Optimum Scheduling Approach for Creating Optimal Priority of Jobs with Business Values in Cloud Computing
Venue: arXiv cs.DC 2014
Year: 2014

Realizing an optimal task scheduling by taking into account the business importance of jobs has become a matter of interest in pay and use model of Cloud computing. Introduction of an appropriate model for an efficient task scheduling technique could derive benefit to the service providers as well as clients. In this paper, we have addressed two major challenges which has implications on the performance of the Cloud system. One of the major issues is handling technical aspects of distributing the tasks for targeted gains and the second issue is related to the handling of the business priority for concurrently resolving business complexity related to cloud consumers. A coordinated scheduling can be achieved by considering the weightage of both aspects viz. technical requirements and business requirements appropriately. It can be done in such a way that it meets the QoS requirements of technical domain as well as business domain. Along with the technical priority a business Bp is required in creating a resultant priority which could be given to stages of further processing, like task allocation and arbitration schemes. Here we consider a technical priority Tp that is governed by a semi-adaptive scheduling algorithm whereas the resultant priority is derived in which a Business Priority Bp layer encapsulates the Technical Priority Tp to achieve the overall priority of the incoming tasks. It results in a Hybrid priority creation, which is a combination of both technical priority Tp and business priority Bp. By taking into account the business priority of the jobs it is possible to achieve a higher service level satisfaction for the tasks which are submitted with their native technical priority. With this approach the waiting time of the tasks tends to get reduced and it gives a better service level satisfaction.
A Parametric Analysis of Project Management Performance to Enhance Software Development Process
Venue: arXiv cs.SE 2014
Year: 2014

Project Management process plays a significant role in effective development of software projects. Key challenges in the project management process are the estimation of time, cost, defect count, and subsequently selection of apt developers. Therefore precise estimation of above stated factors decides the success level of a project. This paper provides an empirical study of several projects developed in a service oriented software company in order to comprehend the project management process. The analysis throws light on the existence of variation in the aforementioned factors between estimation and observed results. It further captures the need for betterment of project management process in estimation and allocation of resources in the realization of high quality software product. The paper therefore aims to bring in an improved awareness in software engineering personnel concerning the magnitude and significance of better estimation and accurate allocation of resources for developing successful project.
Optimized Method for Iranian Road Signs Detection and recognition system
Venue: arXiv cs.CV 2014
Year: 2014

Road sign recognition is one of the core technologies in Intelligent Transport Systems. In the current study, a robust and real-time method is presented to identify and detect the roads speed signs in road image in different situations. In our proposed method, first, the connected components are created in the main image using the edge detection and mathematical morphology and the location of the road signs extracted by the geometric and color data; then the letters are segmented and recognized by Multiclass Support Vector Machine (SVMs) classifiers. Regarding that the geometric and color features ate properly used in detection the location of the road signs, so it is not sensitive to the distance and noise and has higher speed and efficiency. In the result part, the proposed approach is applied on Iranian road speed sign database and the detection and recognition accuracy rate achieved 98.66% and 100% respectively.
Spatially Coupled LDPC Codes Constructed from Protographs
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L. We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear growth of minimum distance with block length. In particular, we show that, for sufficiently large L, the BP thresholds on both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (AWGNC) saturate to a particular value significantly better than the BP decoding threshold and numerically indistinguishable from the optimal maximum a-posteriori (MAP) decoding threshold of the uncoupled LDPC code. When all variable nodes in the coupled chain have degree greater than two, asymptotically the error probability converges at least doubly exponentially with decoding iterations and we obtain sequences of asymptotically good LDPC codes with fast convergence rates and BP thresholds close to the Shannon limit. Further, the gap to capacity decreases as the density of the graph increases, opening up a new way to construct capacity achieving codes on memoryless binary-input symmetric-output (MBS) channels with low-complexity BP decoding.
Certifying the Existence of Epipolar Matrices
Venue: arXiv cs.CV 2014
Year: 2014

Given a set of point correspondences in two images, the existence of a fundamental matrix is a necessary condition for the points to be the images of a 3-dimensional scene imaged with two pinhole cameras. If the camera calibration is known then one requires the existence of an essential matrix. We present an efficient algorithm, using exact linear algebra, for testing the existence of a fundamental matrix. The input is any number of point correspondences. For essential matrices, we characterize the solvability of the Demazure polynomials. In both scenarios, we determine which linear subspaces intersect a fixed set defined by non-linear polynomials. The conditions we derive are polynomials stated purely in terms of image coordinates. They represent a new class of two-view invariants, free of fundamental (resp.~essential)~matrices.
Synthesis of a simple self-stabilizing system
Venue: arXiv cs.LO 2014
Year: 2014

With the increasing importance of distributed systems as a computing paradigm, a systematic approach to their design is needed. Although the area of formal verification has made enormous advances towards this goal, the resulting functionalities are limited to detecting problems in a particular design. By means of a classical example, we illustrate a simple template-based approach to computer-aided design of distributed systems based on leveraging the well-known technique of bounded model checking to the synthesis setting.
Model based design of super schedulers managing catastrophic scenario in hard real time systems
Venue: arXiv cs.DC 2014
Year: 2014

The conventional design of real-time approaches depends heavily on the normal performance of systems and it often becomes incapacitated in dealing with catastrophic scenarios effectively. There are several investigations carried out to effectively tackle large scale catastrophe of a plant and how real-time systems must reorganize itself to respond optimally to changing scenarios to reduce catastrophe and aid human intervention. The study presented here is in this direction and the model accommodates catastrophe generated tasks while it tries to minimize the total number of deadline miss, by dynamically scheduling the unusual pattern of tasks. The problem is NP hard. We prove the methods for an optimal scheduling algorithm. We also derive a model to maintain the stability of the processes. Moreover, we study the problem of minimizing the number of processors required for scheduling with a set of periodic and sporadic hard real time tasks with primary/backup mechanism to achieve fault tolerance. EDF scheduling algorithms are used on each processor to manage scenario changes. Finally we present a simulation of super scheduler with small, medium and large real time tasks pattern for catastrophe management.
Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework
Venue: arXiv cs.GT 2014
Year: 2014

This paper deals with the problem of efficient resource allocation in dynamic infrastructureless wireless networks. Assuming a reactive interference-limited scenario, each transmitter is allowed to select one frequency channel (from a common pool) together with a power level at each transmission trial; hence, for all transmitters, not only the fading gain, but also the number of interfering transmissions and their transmit powers are varying over time. Due to the absence of a central controller and time-varying network characteristics, it is highly inefficient for transmitters to acquire global channel and network knowledge. Therefore a reasonable assumption is that transmitters have no knowledge of fading gains, interference, and network topology. Each transmitting node selfishly aims at maximizing its average reward (or minimizing its average cost), which is a function of the action of that specific transmitter as well as those of all other transmitters. This scenario is modeled as a multi-player multi-armed adversarial bandit game, in which multiple players receive an a priori unknown reward with an arbitrarily time-varying distribution by sequentially pulling an arm, selected from a known and finite set of arms. Since players do not know the arm with the highest average reward in advance, they attempt to minimize their so-called regret, determined by the set of players' actions, while attempting to achieve equilibrium in some sense. To this end, we design in this paper two joint power level and channel selection strategies. We prove that the gap between the average reward achieved by our approaches and that based on the best fixed strategy converges to zero asymptotically. Moreover, the empirical joint frequencies of the game converge to the set of correlated equilibria. We further characterize this set for two special cases of our designed game.
Research of Load Testing and Result Based on Loadrunner
Venue: arXiv cs.SE 2014
Year: 2014

In this paper, we made the plan of a load testing, and got results by means of the LoadRunner which is an automatic load testing tool.We combined with the characteristics of electronic commerce system and did the load testing and analysis the result of load test by means of the LoadRunner. We fully described the characteristics of the electronic commerce application, designed the reasonable test cases,and simulated the practical scenario. In the process of running Load Runner, we arranged the appropriate transactions and rendezvous, and designed the truthful test network environment. The plan was applied to the load testing phase of the telecommunication equipment sales system of special products. We analyzed the load testing results, proposed the improving measures, and realized the optimization of the telecommunication equipment sales system and also found the defect of the system when the massive users access the system and guided the system improvement using the test result.
Uplink Contention Based SCMA for 5G Radio Access
Venue: arXiv cs.IT 2014
Year: 2014

Fifth generation (5G) wireless networks are expected to support very diverse applications and terminals. Massive connectivity with a large number of devices is an important requirement for 5G networks. Current LTE system is not able to efficiently support massive connectivity, especially on the uplink (UL). Among the issues arise due to massive connectivity is the cost of signaling overhead and latency. In this paper, an uplink contention-based sparse code multiple access (SCMA) design is proposed as a solution. First, the system design aspects of the proposed multiple-access scheme are described. The SCMA parameters can be adjusted to provide different levels of overloading, thus suitable to meet the diverse traffic connectivity requirements. In addition, the system-level evaluations of a small packet application scenario are provided for contention-based UL SCMA. SCMA is compared to OFDMA in terms of connectivity and drop rate under a tight latency requirement. The simulation results demonstrate that contention-based SCMA can provide around 2.8 times gain over contention-based OFDMA in terms of supported active users. The uplink contention-based SCMA scheme can be a promising technology for 5G wireless networks for data transmission with low signaling overhead, low delay, and support of massive connectivity.
A Novel Hybrid Crossover based Artificial Bee Colony Algorithm for Optimization Problem
Venue: arXiv cs.AI 2014
Year: 2014

Artificial bee colony (ABC) algorithm has proved its importance in solving a number of problems including engineering optimization problems. ABC algorithm is one of the most popular and youngest member of the family of population based nature inspired meta-heuristic swarm intelligence method. ABC has been proved its superiority over some other Nature Inspired Algorithms (NIA) when applied for both benchmark functions and real world problems. The performance of search process of ABC depends on a random value which tries to balance exploration and exploitation phase. In order to increase the performance it is required to balance the exploration of search space and exploitation of optimal solution of the ABC. This paper outlines a new hybrid of ABC algorithm with Genetic Algorithm. The proposed method integrates crossover operation from Genetic Algorithm (GA) with original ABC algorithm. The proposed method is named as Crossover based ABC (CbABC). The CbABC strengthens the exploitation phase of ABC as crossover enhances exploration of search space. The CbABC tested over four standard benchmark functions and a popular continuous optimization problem.
Deterministic Versus Randomized Kaczmarz Iterative Projection
Venue: arXiv cs.NA 2014
Year: 2014

Kaczmarz's alternating projection method has been widely used for solving a consistent (mostly over-determined) linear system of equations Ax=b. Because of its simple iterative nature with light computation, this method was successfully applied in computerized tomography. Since tomography generates a matrix A with highly coherent rows, randomized Kaczmarz algorithm is expected to provide faster convergence as it picks a row for each iteration at random, based on a certain probability distribution. It was recently shown that picking a row at random, proportional with its norm, makes the iteration converge exponentially in expectation with a decay constant that depends on the scaled condition number of A and not the number of equations. Since Kaczmarz's method is a subspace projection method, the convergence rate for simple Kaczmarz algorithm was developed in terms of subspace angles. This paper provides analyses of simple and randomized Kaczmarz algorithms and explain the link between them. It also propose new versions of randomization that may speed up convergence.
Evaluating Accumulo Performance for a Scalable Cyber Data Processing Pipeline
Venue: arXiv cs.DB 2014
Year: 2014

Streaming, big data applications face challenges in creating scalable data flow pipelines, in which multiple data streams must be collected, stored, queried, and analyzed. These data sources are characterized by their volume (in terms of dataset size), velocity (in terms of data rates), and variety (in terms of fields and types). For many applications, distributed NoSQL databases are effective alternatives to traditional relational database management systems. This paper considers a cyber situational awareness system that uses the Apache Accumulo database to provide scalable data warehousing, real-time data ingest, and responsive querying for human users and analytic algorithms. We evaluate Accumulo's ingestion scalability as a function of number of client processes and servers. We also describe a flexible data model with effective techniques for query planning and query batching to deliver responsive results. Query performance is evaluated in terms of latency of the client receiving initial result sets. Accumulo performance is measured on a database of up to 8 nodes using real cyber data.
A Comparative Study of Hidden Web Crawlers
Venue: arXiv cs.IR 2014
Year: 2014

A large amount of data on the WWW remains inaccessible to crawlers of Web search engines because it can only be exposed on demand as users fill out and submit forms. The Hidden web refers to the collection of Web data which can be accessed by the crawler only through an interaction with the Web-based search form and not simply by traversing hyperlinks. Research on Hidden Web has emerged almost a decade ago with the main line being exploring ways to access the content in online databases that are usually hidden behind search forms. The efforts in the area mainly focus on designing hidden Web crawlers that focus on learning forms and filling them with meaningful values. The paper gives an insight into the various Hidden Web crawlers developed for the purpose giving a mention to the advantages and shortcoming of the techniques employed in each.
Global optimization using Lévy flights
Venue: arXiv cs.NE 2014
Year: 2014

This paper studies a class of enhanced diffusion processes in which random walkers perform Lévy flights and apply it for global optimization. Lévy flights offer controlled balance between exploitation and exploration. We develop four optimization algorithms based on such properties. We compare new algorithms with the well-known Simulated Annealing on hard test functions and the results are very promising.
Large-Scale MIMO versus Network MIMO for Multicell Interference Mitigation
Venue: arXiv cs.IT 2014
Year: 2014

This paper compares two important downlink multicell interference mitigation techniques, namely, large-scale (LS) multiple-input multiple-output (MIMO) and network MIMO. We consider a cooperative wireless cellular system operating in time-division duplex (TDD) mode, wherein each cooperating cluster includes $B$ base-stations (BSs), each equipped with multiple antennas and scheduling $K$ single-antenna users. In an LS-MIMO system, each BS employs $BM$ antennas not only to serve its scheduled users, but also to null out interference caused to the other users within the cooperating cluster using zero-forcing (ZF) beamforming. In a network MIMO system, each BS is equipped with only $M$ antennas, but interference cancellation is realized by data and channel state information exchange over the backhaul links and joint downlink transmission using ZF beamforming. Both systems are able to completely eliminate intra-cluster interference and to provide the same number of spatial degrees of freedom per user. Assuming the uplink-downlink channel reciprocity provided by TDD, both systems are subject to identical channel acquisition overhead during the uplink pilot transmission stage. Further, the available sum power at each cluster is fixed and assumed to be equally distributed across the downlink beams in both systems. Building upon the channel distribution functions and using tools from stochastic ordering, this paper shows, however, that from a performance point of view, users experience better quality of service, averaged over small-scale fading, under an LS-MIMO system than a network MIMO system. Numerical simulations for a multicell network reveal that this conclusion also holds true with regularized ZF beamforming scheme. Hence, given the likely lower cost of adding excess number of antennas at each BS, LS-MIMO could be the preferred route toward interference mitigation in cellular networks.
A framework for reversible circuit complexity
Venue: arXiv cs.ET 2014
Year: 2014

Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis algorithms but are too general for an actual implementation based on some technology. There is an exponential lower bound on the number of Toffoli gates required to implement any reversible function, however, there is also a linear upper bound on the number of single-target gates which can be proven using a constructive proof based on a former presented synthesis algorithm. Since single-target gates can be mapped to a cascade of Toffoli gates, this synthesis algorithm provides an interesting framework for reversible circuit complexity. The paper motivates this framework and illustrates first possible applications based on it.