OpenRaiser/Intern-Atlas huggingface dataset:
A Hajj And Umrah Location Classification System For Video Crowded Scenes
Venue: arXiv cs.CV 2012
Year: 2012

In this paper, a new automatic system for classifying ritual locations in diverse Hajj and Umrah video scenes is investigated. This challenging subject has mostly been ignored in the past due to several problems one of which is the lack of realistic annotated video datasets. HUER Dataset is defined to model six different Hajj and Umrah ritual locations[26]. The proposed Hajj and Umrah ritual location classifying system consists of four main phases: Preprocessing, segmentation, feature extraction, and location classification phases. The shot boundary detection and background/foregroud segmentation algorithms are applied to prepare the input video scenes into the KNN, ANN, and SVM classifiers. The system improves the state of art results on Hajj and Umrah location classifications, and successfully recognizes the six Hajj rituals with more than 90% accuracy. The various demonstrated experiments show the promising results.
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
Venue: arXiv cs.CR 2012
Year: 2012

A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption speed of $O(n^2)$, thus making it the fastest asymmetric encryption scheme available. It has a simple mathematical structure. Thus, it would have low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.
Cognitive Energy Harvesting and Transmission from a Network Perspective
Venue: arXiv cs.IT 2012
Year: 2012

Wireless networks can be self-sustaining by harvesting energy from radio-frequency (RF) signals. Building on classic cognitive radio networks, we propose a novel method for network coexisting where mobiles from a secondary network, called secondary transmitters (STs), either harvest energy from transmissions by nearby transmitters from a primary network, called primary transmitters (PTs), or transmit information if PTs are sufficiently far away; STs store harvested energy in rechargeable batteries with finite capacity and use all available energy for subsequent transmission when batteries are fully charged. In this model, each PT is centered at a guard zone and a harvesting zone that are disks with given radiuses; a ST harvests energy if it lies in some harvesting zone, transmits fixed-power signals if it is outside all guard zones or else idles. Based on this model, the spatial throughput of the secondary network is maximized using a stochastic-geometry model where PTs and STs are modeled as independent homogeneous Poisson point processes (HPPPs), under the outage constraints for coexisting networks and obtained in a simple closed-form. It is observed from the result that the maximum secondary throughput decreases linearly with the growing PT density, and the optimal ST density is inversely proportional to the derived transmission probability for STs.
Availability of titles on peer-to-peer file sharing networks
Venue: arXiv cs.NI 2012
Year: 2012

File sharing, typically involving video or audio material in which copyright may persist and using peer-to-peer (P2P) networks like BitTorrent, has been reported to make up the bulk of Internet traffic. The free-riding problem appears in this "digital gift economy" but its users exhibit rational behaviour, subject to the characteristics of the particular network. The high demand for the Internet as a delivery channel for entertainment underlines the importance of understanding the dynamics of this market, especially when considering possible business models for future pricing or licensing regimes and for the provisioning of network capacity to support future services. The availability of specific titles on file sharing networks is the focus of this paper, with a special emphasis on the P2P protocol BitTorrent. The paper compares the incentives provided in BitTorrent to those in other file-sharing communities, including file hosting, and discusses the number of titles available in the community at any given time, with an emphasis on popular video items with ambiguous legal status.
A survey on social network sites' functional features
Venue: arXiv cs.HC 2012
Year: 2012

Through social network sites (SNS) are between the most popular sites in the Web, there is not a formal study on their functional features. This paper introduces a comprehensive list of them. Then, it shows how these features are supported by top 16 social network platforms. Results show some universal features, such as comments support, public sharing of contents, system notifications and profile pages with avatars. A strong tendency in using external services for authentication and contact recognition has been found, which is quite significant in top SNS. Most popular content types include text, pictures and video. The home page is the site for publishing content and following activities, whilst profile pages mainly include owner's contacts and content lists.
RIO: Minimizing User Interaction in Ontology Debugging
Venue: arXiv cs.AI 2012
Year: 2012

Efficient ontology debugging is a cornerstone for many activities in the context of the Semantic Web, especially when automatic tools produce (parts of) ontologies such as in the field of ontology matching. The best currently known interactive debugging systems rely upon some meta information in terms of fault probabilities, which can speed up the debugging procedure in the good case, but can also have negative impact on the performance in the bad case. The problem is that assessment of the meta information is only possible a-posteriori. Consequently, as long as the actual fault is unknown, there is always some risk of suboptimal interactive diagnoses discrimination. As an alternative, one might prefer to rely on a tool which pursues a no-risk strategy. In this case, however, possibly well-chosen meta information cannot be exploited, resulting again in inefficient debugging actions. In this work we present a reinforcement learning strategy that continuously adapts its behavior depending on the performance achieved and minimizes the risk of using low-quality meta information. Therefore, this method is suitable for application scenarios where reliable a-priori fault estimates are difficult to obtain. Using problematic ontologies in the field of ontology matching, we show that the proposed risk-aware query strategy outperforms both active learning approaches and no-risk strategies on average in terms of required amount of user interaction.
Polynomial Path Orders: A Maximal Model
Venue: arXiv cs.CC 2012
Year: 2012

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.
Testing Lipschitz Property over Product Distribution and its Applications to Statistical Data Privacy
Venue: arXiv cs.CR 2012
Year: 2012

In this work, we present a connection between Lipschitz property testing and a relaxed notion of differential privacy, where we assume that the datasets are being sampled from a domain according to some distribution defined on it. Specifically, we show that testing whether an algorithm is private can be reduced to testing Lipschitz property in the distributional setting. We also initiate the study of distribution Lipschitz testing. We present an efficient Lipschitz tester for the hypercube domain when the "distance to property" is measured with respect to product distribution. Most previous works in property testing of functions (including prior works on Lipschitz testing) work with uniform distribution.
On the Performance of Transmit Antenna Selection Based on Shadowing Side Information
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, a transmit antenna selection scheme, which is based on shadowing side information, is investigated. In this scheme, the selected single transmit antenna provides the highest shadowing coefficient between transmitter and receiver. By the proposed technique, the frequency of the usage of the feedback channel from the receiver to the transmitter and also channel estimation complexity at the receiver can be reduced. We study the performance of our proposed technique and in the analysis, we consider an independent but not identically distributed Generalized-K composite fading model. More specifically exact and closed-form expressions for the outage probability, the moment generating function, the moments of signal-to-noise ratio, and the average symbol error probability are derived. In addition, asymptotic outage probability and symbol error probability expressions are also presented in order to investigate the diversity order and the array gain. Finally, our theoretical performance results are validated by Monte Carlo simulations.
Distributed Bayesian Detection Under Unknown Observation Statistics
Venue: arXiv cs.IT 2012
Year: 2012

In this paper, distributed Bayesian detection problems with unknown prior probabilities of hypotheses are considered. The sensors obtain observations which are conditionally dependent across sensors and their probability density functions (pdf) are not exactly known. The observations are quantized and are sent to the fusion center. The fusion center fuses the current quantized observations and makes a final decision. It also designs (updated) quantizers to be used at the sensors and the fusion rule based on all previous quantized observations. Information regarding updated quantizers is sent back to the sensors for use at the next time. In this paper, the conditional joint pdf is represented in a parametric form by using the copula framework. The unknown parameters include dependence parameters and marginal parameters. Maximum likelihood estimation (MLE) with feedback based on quantized data is proposed to estimate the unknown parameters. These estimates are iteratively used to refine the quantizers and the fusion rule to improve distributed detection performance by using feedback. Numerical examples show that the new detection method based on MLE with feedback is much better than the usual detection method based on the assumption of conditionally independent observations.
Decision-Theoretic Coordination and Control for Active Multi-Camera Surveillance in Uncertain, Partially Observable Environments
Venue: arXiv cs.AI 2012
Year: 2012

A central problem of surveillance is to monitor multiple targets moving in a large-scale, obstacle-ridden environment with occlusions. This paper presents a novel principled Partially Observable Markov Decision Process-based approach to coordinating and controlling a network of active cameras for tracking and observing multiple mobile targets at high resolution in such surveillance environments. Our proposed approach is capable of (a) maintaining a belief over the targets' states (i.e., locations, directions, and velocities) to track them, even when they may not be observed directly by the cameras at all times, (b) coordinating the cameras' actions to simultaneously improve the belief over the targets' states and maximize the expected number of targets observed with a guaranteed resolution, and (c) exploiting the inherent structure of our surveillance problem to improve its scalability (i.e., linear time) in the number of targets to be observed. Quantitative comparisons with state-of-the-art multi-camera coordination and control techniques show that our approach can achieve higher surveillance quality in real time. The practical feasibility of our approach is also demonstrated using real AXIS 214 PTZ cameras
Modeling and Verification of a Multi-Agent Argumentation System using NuSMV
Venue: arXiv cs.AI 2012
Year: 2012

Autonomous intelligent agent research is a domain situated at the forefront of artificial intelligence. Interest-based negotiation (IBN) is a form of negotiation in which agents exchange information about their underlying goals, with a view to improve the likelihood and quality of a offer. In this paper we model and verify a multi-agent argumentation scenario of resource sharing mechanism to enable resource sharing in a distributed system. We use IBN in our model wherein agents express their interests to the others in the society to gain certain resources.
On the Construction of Polar Codes
Venue: arXiv cs.IT 2012
Year: 2012

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponential in the block length. In \cite{TV11}, Tal and Vardy show that if instead the evaluation if performed approximately, the construction has only linear complexity. In this paper, we follow this approach and present a framework where the algorithms of \cite{TV11} and new related algorithms can be analyzed for complexity and accuracy. We provide numerical and analytical results on the efficiency of such algorithms, in particular we show that one can find all the "good" channels (except a vanishing fraction) with almost linear complexity in block-length (except a polylogarithmic factor).
Applicability of Crisp and Fuzzy Logic in Intelligent Response Generation
Venue: arXiv cs.AI 2012
Year: 2012

This paper discusses the merits and demerits of crisp logic and fuzzy logic with respect to their applicability in intelligent response generation by a human being and by a robot. Intelligent systems must have the capability of taking decisions that are wise and handle situations intelligently. A direct relationship exists between the level of perfection in handling a situation and the level of completeness of the available knowledge or information or data required to handle the situation. The paper concludes that the use of crisp logic with complete knowledge leads to perfection in handling situations whereas fuzzy logic can handle situations imperfectly only. However, in the light of availability of incomplete knowledge fuzzy theory is more effective but may be disadvantageous as compared to crisp logic.
Distributing an Exact Algorithm for Maximum Clique: maximising the costup
Venue: arXiv cs.DS 2012
Year: 2012

We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad-hoc cluster of machines. Our goal was to achieve a significant speedup in performance with minimal development effort, i.e. a maximum costup. We present a simple modification to a state-of-the-art exact algorithm for maximum clique that allows us to distribute it across many machines. An empirical study over large hard benchmarks shows that speedups of an order of magnitude are routine for 25 or more machines.
A Metric for the Activeness of a Class
Venue: arXiv cs.SE 2012
Year: 2012

In this paper, the authors propose a software metric called Class Activeness Metric which helps to determine the level of accessibility of the members of a class when it is instantiated as objects. Object interactions need to be straight forward as far as possible as complexity in these interactions can lead to time delays in accessing members not just confusing inheritance hierarchies. For object interactions to be non-complex, the classes must be designed well so that they are easily accessible. This necessitates the development of a metric for gauging the quality of design of a class. This metric is the Class Activeness Metric.
Simultaneous Auctions are (almost) Efficient
Venue: arXiv cs.GT 2012
Year: 2012

Simultaneous item auctions are simple procedures for allocating items to bidders with potentially complex preferences over different item sets. In a simultaneous auction, every bidder submits bids on all items simultaneously. The allocation and prices are then resolved for each item separately, based solely on the bids submitted on that item. Such procedures occur in practice (e.g. eBay) but are not truthful. We study the efficiency of Bayesian Nash equilibrium (BNE) outcomes of simultaneous first- and second-price auctions when bidders have complement-free (a.k.a. subadditive) valuations. We show that the expected social welfare of any BNE is at least 1/2 of the optimal social welfare in the case of first-price auctions, and at least 1/4 in the case of second-price auctions. These results improve upon the previously-known logarithmic bounds, which were established by [Hassidim, Kaplan, Mansour and Nisan '11] for first-price auctions and by [Bhawalkar and Roughgarden '11] for second-price auctions.
Energy Aware, Scalable, K-Hop Based Cluster Formation In MANET
Venue: arXiv cs.DC 2012
Year: 2012

The study of Mobile Ad-hoc Network remains attractive due to the desire to achieve better performance and scalability. MANETs are distributed systems consisting of mobile hosts that are connected by multi-hop wireless links. Such systems are self organized and facilitate communication in the network without any centralized administration. MANETs exhibit battery power constraint and suffer scalability issues therefore cluster formation is expensive. This is due to the large number of messages passed during the process of cluster formation. Clustering has evolved as an imperative research domain that enhances system performance such as throughput and delay in Mobile Ad hoc Networks (MANETs) in the presence of both mobility and a large number of mobile terminals.In this thesis, we present a clustering scheme that minimizes message overhead and congestion for cluster formation and maintenance. The algorithm is devised to be independent of the MANET Routing algorithm. Depending upon the context, the clustering algorithm may be implemented in the routing or in higher layers. The dynamic formation of clusters helps reduce data packet overhead, node complexity and power consumption, The simulation has been performed in ns-2. The simulation shows that the number of clusters formed is in proportion with the number of nodes in MANET.
Vertical Handoff Decision Based On Genetic Algorithm in 4G Network
Venue: arXiv cs.NI 2012
Year: 2012

The rapid improvement of the mobile generations was for the purpose of supporting as many mobile devices as possible that could benefit the users at anytime and anywhere in terms of common practical applications such as internet access, video-on-demand, video conferencing system and many more applications. In this paper, a review for the mobile generations in the wireless communications is pre-sented in order to highlight and compare the issues and challenges that are involved in each generation starting from the earlier generations along to the following generations and finally till the 4th Generation (4G). The 4G wireless network is intended to complement and replace the current generations. Accessing information anywhere, anytime, with a seamless connection to a wide range of information and services, and receiving a large volume of information, data, pictures, video, and so on, are the keys features of 4G. Based on the developing trends of mobile communication, 4G will have broader bandwidth, higher data rate, and smoother and quicker handoff to provide seamless service across a multitude of wireless systems and networks. One of the major issues of seamless mobility is handoff management. It is a major challenge to design intelligent handoff management schemes for 4G-systems. In this paper we have presented the design of an adaptive multi-attribute vertical handoff decision algorithm based on genetic algorithm which is both cost effective and useful.
Parametric matroid of rough set
Venue: arXiv cs.AI 2012
Year: 2012

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set family, with any subset of a universe as its parameter, to connect rough sets and matroids. On the one hand, for a universe and an equivalence relation on the universe, a parametric set family is defined through the lower approximation operator. This parametric set family is proved to satisfy the independent set axiom of matroids, therefore it can generate a matroid, called a parametric matroid of the rough set. Three equivalent representations of the parametric set family are obtained. Moreover, the parametric matroid of the rough set is proved to be the direct sum of a partition-circuit matroid and a free matroid. On the other hand, since partition-circuit matroids were well studied through the lower approximation number, we use it to investigate the parametric matroid of the rough set. Several characteristics of the parametric matroid of the rough set, such as independent sets, bases, circuits, the rank function and the closure operator, are expressed by the lower approximation number.
Fast Randomized Model Generation for Shapelet-Based Time Series Classification
Venue: arXiv cs.LG 2012
Year: 2012

Time series classification is a field which has drawn much attention over the past decade. A new approach for classification of time series uses classification trees based on shapelets. A shapelet is a subsequence extracted from one of the time series in the dataset. A disadvantage of this approach is the time required for building the shapelet-based classification tree. The search for the best shapelet requires examining all subsequences of all lengths from all time series in the training set. A key goal of this work was to find an evaluation order of the shapelets space which enables fast convergence to an accurate model. The comparative analysis we conducted clearly indicates that a random evaluation order yields the best results. Our empirical analysis of the distribution of high-quality shapelets within the shapelets space provides insights into why randomized shapelets sampling is superior to alternative evaluation orders. We present an algorithm for randomized model generation for shapelet-based classification that converges extremely quickly to a model with surprisingly high accuracy after evaluating only an exceedingly small fraction of the shapelets space.
An Implementation of Computer Graphics as Prepress Image Enhancement Process
Venue: arXiv cs.CV 2012
Year: 2012

The production of a printed product involves three stages: prepress, the printing process (press) itself, and finishing (post press). There are various types of equipments (printers, scanners) and various qualities image are present in the market. These give different color rendering each time during reproduction. So, a color key tool has been developed keeping Color Management Scheme (CMS) in mind so that during reproduction no color rendering takes place irrespective of use of any device and resolution level has also been improved.