OpenRaiser/Intern-Atlas huggingface dataset:
Inventions on reducing number of keys on a Computer Keyboard -- A TRIZ based analysis
Venue: arXiv cs.HC 2013
Year: 2013

A computer keyboard consists of several sections and each section consists of several numbers of keys. The text entry section contains the standard character keys, navigation section contains cursor movement and page control keys, numeric keypad contains numeric keys and function keys section contain function keys and special keys. Although the increased number of keys helps smooth interaction with a computer there are situations where it is necessary to reduce the number of keys. The need for reducing number of keys in a keyboard creates a technical contradiction. Generally more number of keys can support more number of functions and less number of keys can support less number of functions. We need more number of functions (all the functions available in a full size keyboard), but we want only less number of keys (Contradiction). This contradiction has been solved by using multi-stroke mechanism. There may be different purposes to reduce the number of keys in a keyboard. Some of them intend to reduce the size of the keyboard while some others intend to increase the speed of typing. But all of these inventions use multi-stroke mechanism to generate more number of signals from less number of keys.
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
Venue: arXiv cs.OH 2013
Year: 2013

In the context of abstract geometrical computation, computing with colored line segments, we study the possibility of having an accumulation with small signal machines, ie, signal machines having only a very limited number of distinct speeds. The cases of 2 and 4 speeds are trivial: we provide a proof that no machine can produce an accumulation in the case of 2 speeds and exhibit an accumulation with 4 speeds. The main result is the twofold case of 3 speeds. On the one hand, we prove that accumulations cannot happen when all ratios between speeds and all ratios between initial distances are rational. On the other hand, we provide examples of an accumulation in the case of an irrational ratio between 2 speeds and in the case of an irrational ratio between two distances in the initial configuration. This dichotomy is explained by the presence of a phenomenon computing Euclid's algorithm (gcd): it stops if and only if its input is commensurate (ie, of rational ratio).
Optimal Grouping for Group Minimax Hypothesis Testing
Venue: arXiv cs.IT 2013
Year: 2013

Bayesian hypothesis testing and minimax hypothesis testing represent extreme instances of detection in which the prior probabilities of the hypotheses are either completely and precisely known, or are completely unknown. Group minimax, also known as Gamma-minimax, is a robust intermediary between Bayesian and minimax hypothesis testing that allows for coarse or partial advance knowledge of the hypothesis priors by using information on sets in which the prior lies. Existing work on group minimax, however, does not consider the question of how to define the sets or groups of priors; it is assumed that the groups are given. In this work, we propose a novel intermediate detection scheme formulated through the quantization of the space of prior probabilities that optimally determines groups and also representative priors within the groups. We show that when viewed from a quantization perspective, group minimax amounts to determining centroids with a minimax Bayes risk error divergence distortion criterion: the appropriate Bregman divergence for this task. Moreover, the optimal partitioning of the space of prior probabilities is a Bregman Voronoi diagram. Together, the optimal grouping and representation points are an epsilon-net with respect to Bayes risk error divergence, and permit a rate-distortion type asymptotic analysis of detection performance with the number of groups. Examples of detecting signals corrupted by additive white Gaussian noise and of distinguishing exponentially-distributed signals are presented.
Information content versus word length in natural language: A reply to Ferrer-i-Cancho and Moscoso del Prado Martin [arXiv:1209.1751]
Venue: arXiv cs.CL 2013
Year: 2013

Recently, Ferrer i Cancho and Moscoso del Prado Martin [arXiv:1209.1751] argued that an observed linear relationship between word length and average surprisal (Piantadosi, Tily, & Gibson, 2011) is not evidence for communicative efficiency in human language. We discuss several shortcomings of their approach and critique: their model critically rests on inaccurate assumptions, is incapable of explaining key surprisal patterns in language, and is incompatible with recent behavioral results. More generally, we argue that statistical models must not critically rely on assumptions that are incompatible with the real system under study.
Quantitative CV-based indicators for research quality, validated by peer review
Venue: arXiv cs.DL 2013
Year: 2013

In a university, research assessments are organized at different policy levels (faculties, research council) in different contexts (funding, council membership, personnel evaluations). Each evaluation requires its own focus and methodology. To conduct a coherent research policy however, data on which different assessments are based should be well coordinated. A common set of core indicators for any type of research assessment can provide a supportive and objectivating tool for evaluations at different institutional levels and at the same time promote coherent decision-making. The same indicators can also form the basis for a 'light touch' monitoring instrument, signalling when and where a more thorough evaluation could be considered. This poster paper shows how peer review results were used to validate a set of quantitative indicators for research quality for a first series of disciplines. The indicators correspond to categories in the university's standard CV-format. Per discipline, specific indicators are identified corresponding to their own publication and funding characteristics. Also more globally valid indicators are identified after normalization for discipline-characteristic performance levels. The method can be applied to any system where peer ratings and quantitative performance measures, both reliable and sufficiently detailed, can be combined for the same entities.
Output and citation impact of interdisciplinary networks: Experiences from a dedicated funding program
Venue: arXiv cs.DL 2013
Year: 2013

In a context of ever more specialized scientists, interdisciplinarity receives increasing attention as innovating ideas are often situated where the disciplines meet. In many countries science policy makers installed dedicated funding programs and policies. This induces a need for specific tools for their support. There is however not yet a generally accepted quantitative method or set of criteria to recognize and evaluate interdisciplinary research outputs (Tracking and evaluating interdisciplinary research: metrics and maps, 12th ISSI Conference, 2009). Interdisciplinarity also takes on very different forms, as distinguished in overviews from the first codifications (Klein, 1990) to the latest reference work (Frodeman et al., 2010). In the specific context of research measurement and evaluation, interdisciplinarity was discussed e.g. by Rinia (2007) and Porter et al. (2006). This empirical study aims to contribute to the understanding and the measuring of interdisciplinary research at the micro level, in the form of new synergies between disciplines. Investigation of a specialized funding program shows how a new interdisciplinary synergy and its citation impact are visible in co-publications and cocitations, and that these are important parameters for assessment. The results also demonstrate the effect of funding, which is clearly present after about three years.
Groups of Highly Cited Publications: Stability in Content with Citation Window Length
Venue: arXiv cs.DL 2013
Year: 2013

The growing focus in research policy worldwide on top scientists makes it increasingly important to define adequate supporting measures to help identify excellent scientists. Highly cited publications have since long been associated to research excellence. At the same time, the analysis of the high-end of citation distributions still is a challenging topic in evaluative bibliometrics. Evaluations typically require indicators that generate sufficiently stable results when applied to recent publication records of limited size. Highly cited publications have been identified using two techniques in particular: pre-set percentiles, and the parameter free Characteristic Scores and Scales (CSS) (Glänzel & Schubert, 1988). The stability required in assessments of relatively small publication records, concerns size as well as content of groups of highly cited publications. Influencing factors include domain delineation and citation window length. Stability in size is evident for the pre-set percentiles, and has been demonstrated for the CSS-methodology beyond an initial citation period of about three years (Glänzel, 2007). Stability in content is less straightforward, considering for instance that more highly cited publications can have a later citation peak, as observed by Abt (1981) for astronomical papers. This paper investigates the stability in content of groups of highly cited publications, i.e. the extent to which individual publications enter and leave the group as the citation window is enlarged.
A Propound Method for the Improvement of Cluster Quality
Venue: arXiv cs.LG 2013
Year: 2013

In this paper Knockout Refinement Algorithm (KRA) is proposed to refine original clusters obtained by applying SOM and K-Means clustering algorithms. KRA Algorithm is based on Contingency Table concepts. Metrics are computed for the Original and Refined Clusters. Quality of Original and Refined Clusters are compared in terms of metrics. The proposed algorithm (KRA) is tested in the educational domain and results show that it generates better quality clusters in terms of improved metric values.
Specification Construction Using Behaviours, Equivalences, and SMT Solvers
Venue: arXiv cs.SE 2013
Year: 2013

We propose a method to write and check a specification including quantifiers using behaviors, i.e., input-output pairs. Our method requires the following input from the user: (1) answers to a finite number of queries, each of which presents some behavior to the user, who responds informing whether the behavior is "correct" or not; and (2) an "equivalence" theory (set of formulae), which represents the users opinion about which pairs of behaviors are equivalent with respect to the specification; and (3) a "vocabulary", i.e., a set of formulae which provide the basic building blocks for the specification to be written. Alternatively, the user can specify a type theory and a simple relational grammar, and our method can generate the vocabulary and equivalence theories. Our method automatically generates behaviors using a satisfiability modulo theory solver. Since writing a specification consists of formalizing ideas that are initially informal, there must, by definition, be at least one "initial" step where an informal notion is formalized by the user in an ad hoc manner. This step is the provision of the equivalence theory and vocabulary; we call it the primitive formalization step. We contend that it is considerably easier to write an equivalence theory and vocabulary than to write a full-blown formal specification from scratch, and we provide experimental evidence for this claim. We also show how vocabularies can be constructed hierarchically, with a specification at one level providing vocabulary material for the next level.
Simplifying proofs of linearisability using layers of abstraction
Venue: arXiv cs.LO 2013
Year: 2013

Linearisability has become the standard correctness criterion for concurrent data structures, ensuring that every history of invocations and responses of concurrent operations has a matching sequential history. Existing proofs of linearisability require one to identify so-called linearisation points within the operations under consideration, which are atomic statements whose execution causes the effect of an operation to be felt. However, identification of linearisation points is a non-trivial task, requiring a high degree of expertise. For sophisticated algorithms such as Heller et al's lazy set, it even is possible for an operation to be linearised by the concurrent execution of a statement outside the operation being verified. This paper proposes an alternative method for verifying linearisability that does not require identification of linearisation points. Instead, using an interval-based logic, we show that every behaviour of each concrete operation over any interval is a possible behaviour of a corresponding abstraction that executes with coarse-grained atomicity. This approach is applied to Heller et al's lazy set to show that verification of linearisability is possible without having to consider linearisation points within the program code.
Reliability and Comparability of Peer Review Results
Venue: arXiv cs.DL 2013
Year: 2013

In this paper peer review reliability is investigated based on peer ratings of research teams at two Belgian universities. It is found that outcomes can be substantially influenced by the different ways in which experts attribute ratings. To increase reliability of peer ratings, procedures creating a uniform reference level should be envisaged. One should at least check for signs of low reliability, which can be obtained from an analysis of the outcomes of the peer evaluation itself. The peer review results are compared to outcomes from a citation analysis of publications by the same teams, in subject fields well covered by citation indexes. It is illustrated how, besides reliability, comparability of results depends on the nature of the indicators, on the subject area and on the intrinsic characteristics of the methods. The results further confirm what is currently considered as good practice: the presentation of results for not one but for a series of indicators.
Take a break: cloud scheduling optimized for real-time electricity pricing
Venue: arXiv cs.DC 2013
Year: 2013

Cloud computing revolutionised the industry with its elastic, on-demand approach to computational resources, but has lead to a tremendous impact on the environment. Data centers constitute 1.1-1.5% of total electricity usage in the world. Taking a more informed view of the electrical grid by analysing real-time electricity prices, we set the foundations of a grid-conscious cloud. We propose a scheduling algorithm that predicts electricity price peaks and throttles energy consumption by pausing virtual machines. We evaluate the approach on the OpenStack cloud manager through an empirical approach and show reductions in energy consumption and costs. Finally, we define green instances in which cloud providers can offer such services to their customers under better pricing options.
Python for education: permutations
Venue: arXiv cs.MS 2013
Year: 2013

Python implementation of permutations is presented. Three classes are introduced: Perm for permutations, Group for permutation groups, and PermError to report any errors for both classes. The class Perm is based on Python dictionaries and utilize cycle notation. The methods of calculation for the perm order, parity, ranking and unranking are given. A random permutation generation is also shown. The class Group is very simple and it is also based on dictionaries. It is mainly the presentation of the permutation groups interface with methods for the group order, subgroups (normalizer, centralizer, center, stabilizer), orbits, and several tests. The corresponding Python code is contained in the modules perms and groups.
MODLEACH: A Variant of LEACH for WSNs
Venue: arXiv cs.NI 2013
Year: 2013

Wireless sensor networks are appearing as an emerging need for mankind. Though, Such networks are still in research phase however, they have high potential to be applied in almost every field of life. Lots of research is done and a lot more is awaiting to be standardized. In this work, cluster based routing in wireless sensor networks is studied precisely. Further, we modify one of the most prominent wireless sensor network's routing protocol "LEACH" as modified LEACH (MODLEACH) by introducing \emph{efficient cluster head replacement scheme} and \emph{dual transmitting power levels}. Our modified LEACH, in comparison with LEACH out performs it using metrics of cluster head formation, through put and network life. Afterwards, hard and soft thresholds are implemented on modified LEACH (MODLEACH) that boast the performance even more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH), MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold (MODLEACHST) is undertaken considering metrics of throughput, network life and cluster head replacements.
An Architecture for Autonomously Controlling Robot with Embodiment in Real World
Venue: arXiv cs.RO 2013
Year: 2013

In the real world, robots with embodiment face various issues such as dynamic continuous changes of the environment and input/output disturbances. The key to solving these issues can be found in daily life; people `do actions associated with sensing' and `dynamically change their plans when necessary'. We propose the use of a new concept, enabling robots to do these two things, for autonomously controlling mobile robots. We implemented our concept to make two experiments under static/dynamic environments. The results of these experiments show that our idea provides a way to adapt to dynamic changes of the environment in the real world.
Competitive MAC under Adversarial SINR
Venue: arXiv cs.NI 2013
Year: 2013

This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.
Modeling Probability of Path Loss for DSDV, OLSR and DYMO above 802.11 and 802.11p
Venue: arXiv cs.NI 2013
Year: 2013

This paper presents path loss model along with framework for probability distribution function for VANETs. Furthermore, we simulate three routing protocols Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Dynamic MANET On-demand (DYMO) in NS-2 to evaluate and compare their performance using two Mac-layer Protocols 802.11 and 802.11p. A novel approach of this work is modifications in existing parameters to achieve high efficiency. After extensive simulations, we observe that DSDV out performs with 802.11p while DYMO gives best performance with 802.11.
A Review of Machine Learning based Anomaly Detection Techniques
Venue: arXiv cs.LG 2013
Year: 2013

Intrusion detection is so much popular since the last two decades where intrusion is attempted to break into or misuse the system. It is mainly of two types based on the intrusions, first is Misuse or signature based detection and the other is Anomaly detection. In this paper Machine learning based methods which are one of the types of Anomaly detection techniques is discussed.
Optimal Rate Sampling in 802.11 Systems
Venue: arXiv cs.NI 2013
Year: 2013

In 802.11 systems, Rate Adaptation (RA) is a fundamental mechanism allowing transmitters to adapt the coding and modulation scheme as well as the MIMO transmission mode to the radio channel conditions, and in turn, to learn and track the (mode, rate) pair providing the highest throughput. So far, the design of RA mechanisms has been mainly driven by heuristics. In contrast, in this paper, we rigorously formulate such design as an online stochastic optimisation problem. We solve this problem and present ORS (Optimal Rate Sampling), a family of (mode, rate) pair adaptation algorithms that provably learn as fast as it is possible the best pair for transmission. We study the performance of ORS algorithms in both stationary radio environments where the successful packet transmission probabilities at the various (mode, rate) pairs do not vary over time, and in non-stationary environments where these probabilities evolve. We show that under ORS algorithms, the throughput loss due to the need to explore sub-optimal (mode, rate) pairs does not depend on the number of available pairs, which is a crucial advantage as evolving 802.11 standards offer an increasingly large number of (mode, rate) pairs. We illustrate the efficiency of ORS algorithms (compared to the state-of-the-art algorithms) using simulations and traces extracted from 802.11 test-beds.
Towards Meta-Reasoning in the Concurrent Logical Framework CLF
Venue: arXiv cs.LO 2013
Year: 2013

The concurrent logical framework CLF is an extension of the logical framework LF designed to specify concurrent and distributed languages. While it can be used to define a variety of formalisms, reasoning about such languages within CLF has proved elusive. In this paper, we propose an extension of LF that allows us to express properties of CLF specifications. We illustrate the approach with a proof of safety for a small language with a parallel semantics.
Meta SOS - A Maude Based SOS Meta-Theory Framework
Venue: arXiv cs.LO 2013
Year: 2013

Meta SOS is a software framework designed to integrate the results from the meta-theory of structural operational semantics (SOS). These results include deriving semantic properties of language constructs just by syntactically analyzing their rule-based definition, as well as automatically deriving sound and ground-complete axiomatizations for languages, when considering a notion of behavioural equivalence. This paper describes the Meta SOS framework by blending aspects from the meta-theory of SOS, details on their implementation in Maude, and running examples.
Real-time Peer-to-Peer Botnet Detection Framework based on Bayesian Regularized Neural Network
Venue: arXiv cs.NI 2013
Year: 2013

Over the past decade, the Cyberspace has seen an increasing number of attacks coming from botnets using the Peer-to-Peer (P2P) architecture. Peer-to-Peer botnets use a decentralized Command & Control architecture. Moreover, a large number of such botnets already exist, and newer versions- which significantly differ from their parent bot- are also discovered practically every year. In this work, the authors propose and implement a novel hybrid framework for detecting P2P botnets in live network traffic by integrating Neural Networks with Bayesian Regularization. Bayesian Regularization helps in achieving better generalization of the dataset, thereby enabling the detection of botnet activity even of those bots which were never used in training the Neural Network. Hence such a framework is suitable for detection of newer and unseen botnets in live traffic of a network. This was verified by testing the Framework on test data unseen to the Detection module (using untrained botnet dataset), and the authors were successful in detecting this activity with an accuracy of 99.2 %.