OpenRaiser/Intern-Atlas huggingface dataset:
Best-in-class and Strategic Benchmarking of Scientific Subject Categories of Web of Science in 2010
Venue: arXiv cs.DL 2013
Year: 2013

Here we show a novel technique for comparing subject categories, where the prestige of academic journals in each category is represented statistically by an impact-factor histogram. For each subject category we compute the probability of occurrence of scholarly journals with impact factor in different intervals. Here impact factor is measured with Thomson Reuters Impact Factor, Eigenfactor Score, and Immediacy Index. Assuming the probabilities associated with a pair of subject categories our objective is to measure the degree of dissimilarity between them. To do so, we use an axiomatic characterization for predicting dissimilarity between subject categories. The scientific subject categories of Web of Science in 2010 were used to test the proposed approach for benchmarking Cell Biology and Computer Science Information Systems with the rest as two case studies. The former is best-in-class benchmarking that involves studying the leading competitor category; the latter is strategic benchmarking that involves observing how other scientific subject categories compete.
Reallocation and Allocation of Virtual Machines in Cloud Computing
Venue: arXiv cs.DC 2013
Year: 2013

Cloud computing has given the new face to the distributed field. Two main issues are discussed in this paper, (I) the process of finding the efficient virtual machine by using the concept of load balancing algorithm. (II) Reallocation of the Virtual Machines i.e. migration of the Virtual Machines when cloud provider is not available with the required Virtual Machines. We have discussed about the different load balancing algorithms which are used for deciding the efficient Virtual Machine for the allocation to the client on demand. While in the second issue is concern we have discuss about different modules available for the migration of Virtual Machines from one source machine to the other target machine. At last discussion about the different simulators available for the cloud are carried out in this paper.
Scheduling of Dependent Tasks Application using Random Search Technique
Venue: arXiv cs.DC 2013
Year: 2013

Since beginning of Grid computing, scheduling of dependent tasks application has attracted attention of researchers due to NP-Complete nature of the problem. In Grid environment, scheduling is deciding about assignment of tasks to available resources. Scheduling in Grid is challenging when the tasks have dependencies and resources are heterogeneous. The main objective in scheduling of dependent tasks is minimizing make-span. Due to NP-complete nature of scheduling problem, exact solutions cannot generate schedule efficiently. Therefore, researchers apply heuristic or random search techniques to get optimal or near to optimal solution of such problems. In this paper, we show how Genetic Algorithm can be used to solve dependent task scheduling problem. We describe how initial population can be generated using random assignment and height based approaches. We also present design of crossover and mutation operators to enable scheduling of dependent tasks application without violating dependency constraints. For implementation of GA based scheduling, we explore and analyze SimGrid and GridSim simulation toolkits. From results, we found that SimGrid is suitable, as it has support of SimDag API for DAG applications. We found that GA based approach can generate schedule for dependent tasks application in reasonable time while trying to minimize make-span.
A Fuzzy Logic Based Certain Trust Model for E-Commerce
Venue: arXiv cs.AI 2013
Year: 2013

Trustworthiness especially for service oriented system is very important topic now a day in IT field of the whole world. There are many successful E-commerce organizations presently run in the whole world, but E-commerce has not reached its full potential. The main reason behind this is lack of Trust of people in e-commerce. Again, proper models are still absent for calculating trust of different e-commerce organizations. Most of the present trust models are subjective and have failed to account vagueness and ambiguity of different domain. In this paper we have proposed a new fuzzy logic based Certain Trust model which considers these ambiguity and vagueness of different domain. Fuzzy Based Certain Trust Model depends on some certain values given by experts and developers. can be applied in a system like cloud computing, internet, website, e-commerce, etc. to ensure trustworthiness of these platforms. In this paper we show, although fuzzy works with uncertainties, proposed model works with some certain values. Some experimental results and validation of the model with linguistics terms are shown at the last part of the paper.
Shadow Estimation Method for "The Episolar Constraint: Monocular Shape from Shadow Correspondence"
Venue: arXiv cs.CV 2013
Year: 2013

Recovering shadows is an important step for many vision algorithms. Current approaches that work with time-lapse sequences are limited to simple thresholding heuristics. We show these approaches only work with very careful tuning of parameters, and do not work well for long-term time-lapse sequences taken over the span of many months. We introduce a parameter-free expectation maximization approach which simultaneously estimates shadows, albedo, surface normals, and skylight. This approach is more accurate than previous methods, works over both very short and very long sequences, and is robust to the effects of nonlinear camera response. Finally, we demonstrate that the shadow masks derived through this algorithm substantially improve the performance of sun-based photometric stereo compared to earlier shadow mask estimation.
Abstract machines for game semantics, revisited
Venue: arXiv cs.LO 2013
Year: 2013

We define new abstract machines for game semantics which correspond to networks of conventional computers, and can be used as an intermediate representation for compilation targeting distributed systems. This is achieved in two steps. First we introduce the HRAM, a Heap and Register Abstract Machine, an abstraction of a conventional computer, which can be structured into HRAM nets, an abstract point-to-point network model. HRAMs are multi-threaded and subsume communication by tokens (cf. IAM) or jumps. Game Abstract Machines (GAM), are HRAMs with additional structure at the interface level, but no special operational capabilities. We show that GAMs cannot be naively composed, but composition must be mediated using appropriate HRAM combinators. HRAMs are flexible enough to allow the representation of game models for languages with state (non-innocent games) or concurrency (non-alternating games). We illustrate the potential of this technique by implementing a toy distributed compiler for ICA, a higher-order programming language with shared state concurrency, thus significantly extending our previous distributed PCF compiler. We show that compilation is sound and memory-safe, i.e. no (distributed or local) garbage collection is necessary.
Bidirectional Growth based Mining and Cyclic Behaviour Analysis of Web Sequential Patterns
Venue: arXiv cs.DB 2013
Year: 2013

Web sequential patterns are important for analyzing and understanding users behaviour to improve the quality of service offered by the World Wide Web. Web Prefetching is one such technique that utilizes prefetching rules derived through Cyclic Model Analysis of the mined Web sequential patterns. The more accurate the prediction and more satisfying the results of prefetching if we use a highly efficient and scalable mining technique such as the Bidirectional Growth based Directed Acyclic Graph. In this paper, we propose a novel algorithm called Bidirectional Growth based mining Cyclic behavior Analysis of web sequential Patterns (BGCAP) that effectively combines these strategies to generate prefetching rules in the form of 2-sequence patterns with Periodicity and threshold of Cyclic Behaviour that can be utilized to effectively prefetch Web pages, thus reducing the users perceived latency. As BGCAP is based on Bidirectional pattern growth, it performs only (log n+1) levels of recursion for mining n Web sequential patterns. Our experimental results show that prefetching rules generated using BGCAP is 5-10 percent faster for different data sizes and 10-15% faster for a fixed data size than TD-Mine. In addition, BGCAP generates about 5-15 percent more prefetching rules than TD-Mine.
Inclusion Logic and Fixed Point Logic
Venue: arXiv cs.LO 2013
Year: 2013

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all union-closed first-order definable properties of relations are definable in it. We also provide an Ehrenfeucht-Fraïssé game for Inclusion Logic, and give an example illustrating its use.
Efficient Computation of Mean Truncated Hitting Times on Very Large Graphs
Venue: arXiv cs.DS 2013
Year: 2013

Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However, application of hitting times has been limited to small datasets because of computational restrictions. This paper develops a new approximation algorithm with which hitting times can be computed on very large, disk-resident graphs, making their application possible to problems which were previously out of reach. This will potentially benefit a range of large-scale problems.
Investigating Randomly Generated Adjacency Matrices For Their Use In Modeling Wireless Topologies
Venue: arXiv cs.NI 2013
Year: 2013

Generation of realistic topologies plays an important role in determining the accuracy and validity of simulation studies. This study presents a discussion to justify why, and how often randomly generated adjacency matrices may not not conform to wireless topologies in the physical world. Specifically, it shows through analysis and random trials that, more than 90% of times, a randomly generated adjacency matrix will not conform to a valid wireless topology, when it has more than 3 nodes. By showing that node triplets in the adjacency graph need to adhere to rules of a geometric vector space, the study shows that the number of randomly chosen node triplets failing consistency checks grow at the order of O(base^3), where base is the granularity of the distance metric. Further, the study models and presents a probability estimate with which any randomly generated adjacency matrix would fail realization. This information could be used to design simpler algorithms for generating k-connected wireless topologies.
A Survey of Software Reliability Models
Venue: arXiv cs.SE 2013
Year: 2013

Software reliability analysis is performed at various stages during the process of engineering software as an attempt to evaluate if the software reliability requirements have been (or might be) met. In this report, I present a summary of some fundamental black-box and white-box software reliability models. I also present some general shortcomings of these models and suggest avenues for further research.
System Architecture of HatterHealthConnect: An Integration of Body Sensor Networks and Social Networks to Improve Health Awareness
Venue: arXiv cs.NI 2013
Year: 2013

Over the last decade, the demand for efficient healthcare monitoring has increased and forced the health and wellness industry to embrace modern technological advances. Body Sensor Networks, or BSNs, can remotely collect users data and upload vital statistics to servers over the Internet. Advances in wireless technologies such as cellular devices and Bluetooth increase the mobility users experience while wearing a body sensor network. When connected by the proper framework, BSNs can efficiently monitor and record data while minimizing the energy expenditure of nodes in the BSN. Social networking sites play a large role in the aggregation and sharing of data between many users. Connecting a BSN to a social network creates the unique ability to share health related data with other users through social interaction. In this research, we present an integration of BSNs and social networks to establish a community promoting well being and great social awareness. We present the system architecture; both hardware and software, of a prototype implementation using Zephyr HxM heart monitor, Intel-Shimmer EMG senor and a Samsung Captivate smart phone. We provide implementation details for the design on the base station, the database server and the Facebook application. We illustrate how the Android application was designed with both functionality and user perspective in mind that resulted in an easy to use system. This prototype can be used in multiple health related applications based on the type of sensors used.
Robust Joint Precoder and Equalizer Design in MIMO Communication Systems
Venue: arXiv cs.IT 2013
Year: 2013

We address joint design of robust precoder and equalizer in a MIMO communication system using the minimization of weighted sum of mean square errors. In addition to imperfect knowledge of channel state information, we also account for inaccurate awareness of interference plus noise covariance matrix and power shaping matrix. We follow the worst-case model for imperfect knowledge of these matrices. First, we derive the worst-case values of these matrices. Then, we transform the joint precoder and equalizer optimization problem into a convex scalar optimization problem. Further, the solution to this problem will be simplified to a depressed quartic equation, the closed-form expressions for roots of which are known. Finally, we propose an iterative algorithm to obtain the worst-case robust transceivers.
Construction of Self-dual Codes over $F_p+vF_p$
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.
Multi-Branch MMSE Decision Feedback Detection Algorithms with Error Propagation Mitigation for Multi-Antenna Systems
Venue: arXiv cs.IT 2013
Year: 2013

In this work we propose novel decision feedback (DF) detection algorithms with error propagation mitigation capabilities for multi-input multi-output (MIMO) spatial multiplexing systems based on multiple processing branches. The novel strategies for detection exploit different patterns, orderings and constraints for the design of the feedforward and feedback filters. We present constrained minimum mean-squared error (MMSE) filters designed with constraints on the shape and magnitude of the feedback filters for the multi-branch MIMO receivers and show that the proposed MMSE design does not require a significant additional complexity over the single-branch MMSE design. The proposed multi-branch MMSE DF detectors are compared with several existing detectors and are shown to achieve a performance close to the optimal maximum likelihood detector while requiring significantly lower complexity.
Automated Switching System for Skin Pixel Segmentation in Varied Lighting
Venue: arXiv cs.CV 2013
Year: 2013

In Computer Vision, colour-based spatial techniquesoften assume a static skin colour model. However, skin colour perceived by a camera can change when lighting changes. In common real environment multiple light sources impinge on the skin. Moreover, detection techniques may vary when the image under study is taken under different lighting condition than the one that was earlier under consideration. Therefore, for robust skin pixel detection, a dynamic skin colour model that can cope with the changes must be employed. This paper shows that skin pixel detection in a digital colour image can be significantly improved by employing automated colour space switching methods. In the root of the switching technique which is employed in this study, lies the statistical mean of value of the skin pixels in the image which in turn has been derived from the Value, measures as a third component of the HSV. The study is based on experimentations on a set of images where capture time conditions varying from highly illuminated to almost dark.
Bitcoin and Beyond: Exclusively Informational Monies
Venue: arXiv cs.CY 2013
Year: 2013

The famous new money Bitcoin is classified as a technical informational money (TIM). Besides introducing the idea of a TIM, a more extreme notion of informational money will be developed: exclusively informational money (EXIM). The informational coins (INCOs) of an EXIM can be in control of an agent but are not owned by any agent. INCOs of an EXIM cannot be stolen, but they can be lost, or thrown away. The difference between an EXIM and a TIM shows up when considering a user perspective on security matters. Security for an EXIM user is discussed in substantial detail, with the remarkable conclusion that computer security (security models, access control, user names, passwords, firewalls etc.) is not always essential for an EXIM, while the application of cryptography based information security is unavoidable for the use of an EXIM. Bitcoin seems to meet the criteria of an EXIM, but the assertion that "Bitcoin is an EXIM", might also be considered problematic. As a thought experiment we will contemplate Bitguilder, a hypothetical copy of Bitcoin that qualifies as an EXIM. A business ethics assessment of Bitcoin is made which reveals a number of worries. By combining Bitguilder with a so-called technical informational near-money (TINM) a dual money system, having two units with a fluctuating rate, may be obtained. It seems that a dual money can remedy some, but not all, of the ethical worries that arise when contemplating Bitcoin after hypothetically having become a dominant form of money. The contributions that Bitcoin's designers can potentially make to the evolution of EXIMs and TIMs is analyzed in terms of the update of the portfolio of money related natural kinds that comes with Bitcoin.
On the Approximation of Submodular Functions
Venue: arXiv cs.DS 2013
Year: 2013

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we consider the question of how well can one class of submodular functions be approximated by another (simpler) class of submodular functions. Such approximations naturally allow algorithms designed for the simpler class to be applied to the bigger class of functions. We prove both upper and lower bounds on such approximations. Our main results are: 1. General submodular functions can be approximated by cut functions of directed graphs to a factor of $n^2/4$, which is tight. 2. General symmetric submodular functions$^{1}$ can be approximated by cut functions of undirected graphs to a factor of $n-1$, which is tight up to a constant. 3. Budgeted additive functions can be approximated by coverage functions to a factor of $e/(e-1)$, which is tight. Here $n$ is the size of the ground set on which the submodular function is defined. We also observe that prior works imply that monotone submodular functions can be approximated by coverage functions with a factor between $O(\sqrt{n} \log n)$ and $Ω(n^{1/3} /\log^2 n) $.
Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)
Venue: arXiv cs.AI 2013
Year: 2013

The paper describes development (improvement/extension) approaches for composite (modular) systems (as combinatorial reengineering). The following system improvement/extension actions are considered: (a) improvement of systems component(s) (e.g., improvement of a system component, replacement of a system component); (b) improvement of system component interconnection (compatibility); (c) joint improvement improvement of system components(s) and their interconnection; (d) improvement of system structure (replacement of system part(s), addition of a system part, deletion of a system part, modification of system structure). The study of system improvement approaches involve some crucial issues: (i) scales for evaluation of system components and component compatibility (quantitative scale, ordinal scale, poset-like scale, scale based on interval multiset estimate), (ii) evaluation of integrated system quality, (iii) integration methods to obtain the integrated system quality. The system improvement/extension strategies can be examined as seleciton/combination of the improvement action(s) above and as modification of system structure. The strategies are based on combinatorial optimization problems (e.g., multicriteria selection, knapsack problem, multiple choice problem, combinatorial synthesis based on morphological clique problem, assignment/reassignment problem, graph recoloring problem, spanning problems, hotlink assignment). Here, heuristics are used. Various system improvement/extension strategies are presented including illustrative numerical examples.
Network Analysis and Application Control Software based on Client-Server Architecture
Venue: arXiv cs.NI 2013
Year: 2013

This paper outlines a comprehensive model to increase system efficiency, preserve network bandwidth, monitor incoming and outgoing packets, ensure the security of confidential files and reduce power wastage in an organization. This model illustrates the use and potential application of a Network Analysis Tool (NAT) in a multi-computer set-up of any scale. The model is designed to run in the background and not hamper any currently executing applications, while using minimum system resources. It was developed as open source software, using VB. Net, with a view to overcoming limitations of legacy systems and financial restrictions in small-to mid-level organizations like businesses and educational institutes. It is fully-customizable and serves as a simple and open-source alternative to existing software. The NAT relies on simple client-server architecture and uses remote access to monitor and maintain the computers on a network, for example logging off a user or shutting down a computer after a certain "idle" time, enabling and disabling applications, troubleshooting and so on. The NAT was tested in a laboratory and resultant data is presented, along with the results of a survey that was conducted among users.
Efficacy of Attack detection capability of IDPS based on it's deployment in wired and wireless environment
Venue: arXiv cs.CR 2013
Year: 2013

Intrusion Detection and/or Prevention Systems (IDPS) represent an important line of defence against a variety of attacks that can compromise the security and proper functioning of an enterprise information system. Along with the widespread evolution of new emerging services, the quantity and impact of attacks have continuously increased, attackers continuously find vulnerabilities at various levels, from the network itself to operating system and applications, exploit them to crack system and services. Network defence and network monitoring has become an essential component of computer security to predict and prevent attacks. Unlike traditional Intrusion Detection System (IDS), Intrusion Detection and Prevention System (IDPS) have additional features to secure computer networks. In this paper, we present a detailed study of how deployment of an IDPS plays a key role in its performance and the ability to detect and prevent known as well as unknown attacks. We categorize IDPS based on deployment as Network-based, host-based, and Perimeter-based and Hybrid. A detailed comparison is shown in this paper and finally we justify our proposed solution, which deploys agents at host-level to give better performance in terms of reduced rate of false positives and accurate detection and prevention.