OpenRaiser/Intern-Atlas huggingface dataset:
Increasing Physical Layer Security through Scrambled Codes and ARQ
Venue: arXiv cs.IT 2011
Year: 2011

We develop the proposal of non-systematic channel codes on the AWGN wire-tap channel. Such coding technique, based on scrambling, achieves high transmission security with a small degradation of the eavesdropper's channel with respect to the legitimate receiver's channel. In this paper, we show that, by implementing scrambling and descrambling on blocks of concatenated frames, rather than on single frames, the channel degradation needed is further reduced. The usage of concatenated scrambling allows to achieve security also when both receivers experience the same channel quality. However, in this case, the introduction of an ARQ protocol with authentication is needed.
A Community-Based Sampling Method Using DPL for Online Social Network
Venue: arXiv cs.SI 2011
Year: 2011

In this paper, we propose a new graph sampling method for online social networks that achieves the following. First, a sample graph should reflect the ratio between the number of nodes and the number of edges of the original graph. Second, a sample graph should reflect the topology of the original graph. Third, sample graphs should be consistent with each other when they are sampled from the same original graph. The proposed method employs two techniques: hierarchical community extraction and densification power law. The proposed method partitions the original graph into a set of communities to preserve the topology of the original graph. It also uses the densification power law which captures the ratio between the number of nodes and the number of edges in online social networks. In experiments, we use several real-world online social networks, create sample graphs using the existing methods and ours, and analyze the differences between the sample graph by each sampling method and the original graph.
A Business Intelligence Model to Predict Bankruptcy using Financial Domain Ontology with Association Rule Mining Algorithm
Venue: arXiv cs.DB 2011
Year: 2011

Today in every organization financial analysis provides the basis for understanding and evaluating the results of business operations and delivering how well a business is doing. This means that the organizations can control the operational activities primarily related to corporate finance. One way that doing this is by analysis of bankruptcy prediction. This paper develops an ontological model from financial information of an organization by analyzing the Semantics of the financial statement of a business. One of the best bankruptcy prediction models is Altman Z-score model. Altman Z-score method uses financial rations to predict bankruptcy. From the financial ontological model the relation between financial data is discovered by using data mining algorithm. By combining financial domain ontological model with association rule mining algorithm and Zscore model a new business intelligence model is developed to predict the bankruptcy.
Stability of time-varying nonlinear switching systems under perturbations
Venue: arXiv cs.SY 2011
Year: 2011

Using a Liao-type exponent, we study the stability of a time-varying nonlinear switching system.
Embedding Constructions of Tail-Biting Trellises for Linear Block Codes
Venue: arXiv cs.IT 2011
Year: 2011

In this paper, embedding construction of tail-biting trellises for linear block codes is presented. With the new approach of constructing tail-biting trellises, most of the study of tail-biting trellises can be converted into the study of conventional trellises. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of embedding constructions from the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) constructed conventional trellises. Furthermore, several properties of embedding constructions of tail-biting trellises are discussed. Finally, we give four sufficient conditions to reduce the maximum state-complexity of a trellis with one peak.
Event Centric Modeling Approach in Colocation Pattern Snalysis from Spatial Data
Venue: arXiv cs.DB 2011
Year: 2011

Spatial co-location patterns are the subsets of Boolean spatial features whose instances are often located in close geographic proximity. Co-location rules can be identified by spatial statistics or data mining approaches. In data mining method, Association rule-based approaches can be used which are further divided into transaction-based approaches and distance-based approaches. Transaction-based approaches focus on defining transactions over space so that an Apriori algorithm can be used. The natural notion of transactions is absent in spatial data sets which are embedded in continuous geographic space. A new distance -based approach is developed to mine co-location patterns from spatial data by using the concept of proximity neighborhood. A new interest measure, a participation index, is used for spatial co-location patterns as it possesses an anti-monotone property. An algorithm to discover co-location patterns are designed which generates candidate locations and their table instances. Finally the co-location rules are generated to identify the patterns.
A Formal Verification Approach to the Design of Synthetic Gene Networks
Venue: arXiv cs.SY 2011
Year: 2011

The design of genetic networks with specific functions is one of the major goals of synthetic biology. However, constructing biological devices that work "as required" remains challenging, while the cost of uncovering flawed designs experimentally is large. To address this issue, we propose a fully automated framework that allows the correctness of synthetic gene networks to be formally verified in silico from rich, high level functional specifications. Given a device, we automatically construct a mathematical model from experimental data characterizing the parts it is composed of. The specific model structure guarantees that all experimental observations are captured and allows us to construct finite abstractions through polyhedral operations. The correctness of the model with respect to temporal logic specifications can then be verified automatically using methods inspired by model checking. Overall, our procedure is conservative but it can filter through a large number of potential device designs and select few that satisfy the specification to be implemented and tested further experimentally. Illustrative examples of the application of our methods to the design of simple synthetic gene networks are included.
Adding a new site in an existing Oracle Multimaster replication without quiescing the replication
Venue: arXiv cs.DB 2011
Year: 2011

This paper presents a new solution, which adds a new database server on an existing Oracle Multimaster Data replication system with Online Instantiation method. During this time the system is down, because we cannot execute DML statements on replication objects but we can only make queries. The time for adding the new database server depends on the number of objects, on the replication group and on the network conditions. We propose to add a new layer between replication objects and the database sessions, which contain DML statements. The layer eliminates the system down time exploiting our developed packages. The packages will be active only during the addition of a new site process and will modify all DML statements and queries based on replication objects.
Localization on low-order eigenvectors of data matrices
Venue: arXiv cs.DM 2011
Year: 2011

Eigenvector localization refers to the situation when most of the components of an eigenvector are zero or near-zero. This phenomenon has been observed on eigenvectors associated with extremal eigenvalues, and in many of those cases it can be meaningfully interpreted in terms of "structural heterogeneities" in the data. For example, the largest eigenvectors of adjacency matrices of large complex networks often have most of their mass localized on high-degree nodes; and the smallest eigenvectors of the Laplacians of such networks are often localized on small but meaningful community-like sets of nodes. Here, we describe localization associated with low-order eigenvectors, i.e., eigenvectors corresponding to eigenvalues that are not extremal but that are "buried" further down in the spectrum. Although we have observed it in several unrelated applications, this phenomenon of low-order eigenvector localization defies common intuitions and simple explanations, and it creates serious difficulties for the applicability of popular eigenvector-based machine learning and data analysis tools. After describing two examples where low-order eigenvector localization arises, we present a very simple model that qualitatively reproduces several of the empirically-observed results. This model suggests certain coarse structural similarities among the seemingly-unrelated applications where we have observed low-order eigenvector localization, and it may be used as a diagnostic tool to help extract insight from data graphs when such low-order eigenvector localization is present.
Programmable models of growth and mutation of cancer-cell populations
Venue: arXiv cs.CE 2011
Year: 2011

In this paper we propose a systematic approach to construct mathematical models describing populations of cancer-cells at different stages of disease development. The methodology we propose is based on stochastic Concurrent Constraint Programming, a flexible stochastic modelling language. The methodology is tested on (and partially motivated by) the study of prostate cancer. In particular, we prove how our method is suitable to systematically reconstruct different mathematical models of prostate cancer growth - together with interactions with different kinds of hormone therapy - at different levels of refinement.
A Minimal OO Calculus for Modelling Biological Systems
Venue: arXiv cs.CE 2011
Year: 2011

In this paper we present a minimal object oriented core calculus for modelling the biological notion of type that arises from biological ontologies in formalisms based on term rewriting. This calculus implements encapsulation, method invocation, subtyping and a simple formof overriding inheritance, and it is applicable to models designed in the most popular term-rewriting formalisms. The classes implemented in a formalism can be used in several models, like programming libraries.
Conceptual Knowledge Markup Language: The central core
Venue: arXiv cs.DL 2011
Year: 2011

The conceptual knowledge framework OML/CKML needs several components for a successful design. One important, but previously overlooked, component is the central core of OML/CKML. The central core provides a theoretical link between the ontological specification in OML and the conceptual knowledge representation in CKML. This paper discusses the formal semantics and syntactic styles of the central core, and also the important role it plays in defining interoperability between OML/CKML, RDF/S and Ontolingua.
An analysis of Twitter messages in the 2011 Tohoku Earthquake
Venue: arXiv cs.SI 2011
Year: 2011

Social media such as Facebook and Twitter have proven to be a useful resource to understand public opinion towards real world events. In this paper, we investigate over 1.5 million Twitter messages (tweets) for the period 9th March 2011 to 31st May 2011 in order to track awareness and anxiety levels in the Tokyo metropolitan district to the 2011 Tohoku Earthquake and subsequent tsunami and nuclear emergencies. These three events were tracked using both English and Japanese tweets. Preliminary results indicated: 1) close correspondence between Twitter data and earthquake events, 2) strong correlation between English and Japanese tweets on the same events, 3) tweets in the native language play an important roles in early warning, 4) tweets showed how quickly Japanese people's anxiety returned to normal levels after the earthquake event. Several distinctions between English and Japanese tweets on earthquake events are also discussed. The results suggest that Twitter data can be used as a useful resource for tracking the public mood of populations affected by natural disasters as well as an early warning system.
SRS BUILDER 1.0: An Upper Type CASE Tool For Requirement Specification
Venue: arXiv cs.SE 2011
Year: 2011

Software (SW) development is a labor intensive activity. Modern software projects generally have to deal with producing and managing large and complex software products. Developing such software has become an extremely challenging job not only because of inherent complexity, but also mainly for economic constraints unlike time, quality, maintainability concerns. Hence, developing modern software within the budget still remains as one of the main software crisis. The most significant way to reduce the software development cost is to use the Computer-Aided Software Engineering (CASE) tools over the entire Software Development Life Cycle (SDLC) process as substitute to expensive human labor cost. We think that automation of software development methods is a valuable support for the software engineers in coping with this complexity and for improving quality too. This paper demonstrates the newly developed CASE tools name "SRS Builder 1.0" for software requirement specification developed at our university laboratory, University of North Bengal, India. This paper discusses our new developed product with its functionalities and usages. We believe the tool has the potential to play an important role in the software development process.
Kripke Semantics for Martin-Löf's Extensional Type Theory
Venue: arXiv cs.LO 2011
Year: 2011

It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of interpretations of dependent type theory, i.e., to show that the interpretations of equal expressions are indeed equal. Several classes of models have been used to remedy this problem. We contribute to this investigation by giving a semantics that is standard, coherent, and sufficiently general for completeness while remaining relatively easy to compute with. Our models interpret types of Martin-Löf's extensional dependent type theory as sets indexed over posets or, equivalently, as fibrations over posets. This semantics can be seen as a generalization to dependent type theory of the interpretation of intuitionistic first-order logic in Kripke models. This yields a simple coherent model theory, with respect to which simple and dependent type theory are sound and complete.
Pinning Balloons with Perfect Angles and Optimal Area
Venue: arXiv cs.CG 2011
Year: 2011

We study the problem of arranging a set of $n$ disks with prescribed radii on $n$ rays emanating from the origin such that two neighboring rays are separated by an angle of $2π/n$. The center of the disks have to lie on the rays, and no two disk centers are allowed to lie on the same ray. We require that the disks have disjoint interiors, and that for every ray the segment between the origin and the boundary of its associated disk avoids the interior of the disks. Let $\r$ be the sum of the disk radii. We introduce a greedy strategy that constructs such a disk arrangement that can be covered with a disk centered at the origin whose radius is at most $2\r$, which is best possible. The greedy strategy needs O(n) arithmetic operations. As an application of our result we present an algorithm for embedding unordered trees with straight lines and perfect angular resolution such that it can be covered with a disk of radius $n^{3.0367}$, while having no edge of length smaller than 1. The tree drawing algorithm is an enhancement of a recent result by Duncan et al. [Symp. of Graph Drawing, 2010] that exploits the heavy-edge tree decomposition technique to construct a drawing of the tree that can be covered with a disk of radius $2 n^4$.
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Venue: arXiv cs.DC 2011
Year: 2011

Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independent spanning tree and leads to designing fault tolerant protocols. Optical Transpose Interconnection Systems or OTIS (also referred to as two-level swapped network) is a widely studied interconnection network topology which is popular due to high degree of scalability, regularity, modularity and package ability. Surprisingly, to our knowledge, only one strong result is known regarding Hamiltonicity of OTIS - showing that OTIS graph built of Hamiltonian base graphs are Hamiltonian. In this work we consider Hamiltonicity of OTIS networks, built on Non-Hamiltonian base and answer some important questions. First, we prove that Hamiltonicity of base graph is not a necessary condition for the OTIS to be Hamiltonian. We present an infinite family of Hamiltonian OTIS graphs composed on Non-Hamiltonian base graphs. We further show that, it is not sufficient for the base graph to have Hamiltonian path for the OTIS constructed on it to be Hamiltonian. We give constructive proof of Hamiltonicity for a large family of Butterfly-OTIS. This proof leads to an alternate efficient algorithm for independent spanning trees construction on this class of OTIS graphs. Our algorithm is linear in the number of vertices as opposed to the generalized algorithm, which is linear in the number of edges of the graph.
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
Venue: arXiv cs.NE 2011
Year: 2011

Evolutionary algorithms are popular heuristics for solving various combinatorial problems as they are easy to apply and often produce good results. Island models parallelize evolution by using different populations, called islands, which are connected by a graph structure as communication topology. Each island periodically communicates copies of good solutions to neighboring islands in a process called migration. We consider the speedup gained by island models in terms of the parallel running time for problems from combinatorial optimization: sorting (as maximization of sortedness), shortest paths, and Eulerian cycles. Different search operators are considered. The results show in which settings and up to what degree evolutionary algorithms can be parallelized efficiently. Along the way, we also investigate how island models deal with plateaus. In particular, we show that natural settings lead to exponential vs. logarithmic speedups, depending on the frequency of migration.
The use of microblogging for field-based scientific research
Venue: arXiv cs.SI 2011
Year: 2011

Documenting the context in which data are collected is an integral part of the scientific research lifecycle. In field-based research, contextual information provides a detailed description of scientific practices and thus enables data interpretation and reuse. For field data, losing contextual information often means losing the data altogether. Yet, documenting the context of distributed, collaborative, field-based research can be a significant challenge due to the unpredictable nature of real-world settings and to the high degree of variability in data collection methods and scientific practices of different researchers. In this article, we propose the use of microblogging as a mechanism to support collection, ingestion, and publication of contextual information about the variegated digital artifacts that are produced in field research. We perform interviews with scholars involved in field-based environmental and urban sensing research, to determine the extent of adoption of Twitter and similar microblogging platforms and their potential use for field-specific research applications. Based on the results of these interviews as well as participant observation of field activities, we present the design, development, and pilot evaluation of a microblogging application integrated with an existing data collection platform on a handheld device. We investigate whether microblogging accommodates the variable and unpredictable nature of highly mobile research and whether it represents a suitable mechanism to document the context of field research data early in the scientific information lifecycle.
Support Recovery of Sparse Signals in the Presence of Multiple Measurement Vectors
Venue: arXiv cs.IT 2011
Year: 2011

This paper studies the problem of support recovery of sparse signals based on multiple measurement vectors (MMV). The MMV support recovery problem is connected to the problem of decoding messages in a Single-Input Multiple-Output (SIMO) multiple access channel (MAC), thereby enabling an information theoretic framework for analyzing performance limits in recovering the support of sparse signals. Sharp sufficient and necessary conditions for successful support recovery are derived in terms of the number of measurements per measurement vector, the number of nonzero rows, the measurement noise level, and especially the number of measurement vectors. Through the interpretations of the results, in particular the connection to the multiple output communication system, the benefit of having MMV for sparse signal recovery is illustrated providing a theoretical foundation to the performance improvement enabled by MMV as observed in many existing simulation results. In particular, it is shown that the structure (rank) of the matrix formed by the nonzero entries plays an important role on the performance limits of support recovery.
Jacobians and Hessians of Mean Value Coordinates for Closed Triangular Meshes
Venue: arXiv cs.GR 2011
Year: 2011

In this technical note, we present the formulae of the derivatives of the Mean Value Coordinates based transformations, using an enclosing triangle mesh, acting as a cage for the deformation of an interior object.
Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
Venue: arXiv cs.AI 2011
Year: 2011

Wind energy plays an increasing role in the supply of energy world-wide. The energy output of a wind farm is highly dependent on the weather condition present at the wind farm. If the output can be predicted more accurately, energy suppliers can coordinate the collaborative production of different energy sources more efficiently to avoid costly overproductions. With this paper, we take a computer science perspective on energy prediction based on weather data and analyze the important parameters as well as their correlation on the energy output. To deal with the interaction of the different parameters we use symbolic regression based on the genetic programming tool DataModeler. Our studies are carried out on publicly available weather and energy data for a wind farm in Australia. We reveal the correlation of the different variables for the energy output. The model obtained for energy prediction gives a very reliable prediction of the energy output for newly given weather data.
Effective Personalized Web Mining by Utilizing The Most Utilized Data
Venue: arXiv cs.IR 2011
Year: 2011

Looking into the growth of information in the web it is a very tedious process of getting the exact information the user is looking for. Many search engines generate user profile related data listing. This paper involves one such process where the rating is given to the link that the user is clicking on. Rather than avoiding the uninterested links both interested links and the uninterested links are listed. But sorted according to the weightings given to each link by the number of visit made by the particular user and the amount of time spent on the particular link.