OpenRaiser/Intern-Atlas huggingface dataset:
The Dilated Triple
Venue: arXiv cs.AI 2010
Year: 2010

The basic unit of meaning on the Semantic Web is the RDF statement, or triple, which combines a distinct subject, predicate and object to make a definite assertion about the world. A set of triples constitutes a graph, to which they give a collective meaning. It is upon this simple foundation that the rich, complex knowledge structures of the Semantic Web are built. Yet the very expressiveness of RDF, by inviting comparison with real-world knowledge, highlights a fundamental shortcoming, in that RDF is limited to statements of absolute fact, independent of the context in which a statement is asserted. This is in stark contrast with the thoroughly context-sensitive nature of human thought. The model presented here provides a particularly simple means of contextualizing an RDF triple by associating it with related statements in the same graph. This approach, in combination with a notion of graph similarity, is sufficient to select only those statements from an RDF graph which are subjectively most relevant to the context of the requesting process.
MIMO ARQ with Multi-bit Feedback: Outage Analysis
Venue: arXiv cs.IT 2010
Year: 2010

We study the asymptotic outage performance of incremental redundancy automatic repeat request (INR-ARQ) transmission over the multiple-input multiple-output (MIMO) block-fading channels with discrete input constellations. We first show that transmission with random codes using a discrete signal constellation across all transmit antennas achieves the optimal outage diversity given by the Singleton bound. We then analyze the optimal SNR-exponent and outage diversity of INR-ARQ transmission over the MIMO block-fading channel. We show that a significant gain in outage diversity is obtained by providing more than one bit feedback at each ARQ round. Thus, the outage performance of INR-ARQ transmission can be remarkably improved with minimal additional overhead. A suboptimal feedback and power adaptation rule, which achieves the optimal outage diversity, is proposed for MIMO INR-ARQ, demonstrating the benefits provided by multi-bit feedback.
Implementing and Evaluating a Wireless Body Sensor System for Automated Physiological Data Acquisition at Home
Venue: arXiv cs.OH 2010
Year: 2010

Advances in embedded devices and wireless sensor networks have resulted in new and inexpensive health care solutions. This paper describes the implementation and the evaluation of a wireless body sensor system that monitors human physiological data at home. Specifically, a waist-mounted triaxial accelerometer unit is used to record human movements. Sampled data are transmitted using an IEEE 802.15.4 wireless transceiver to a data logger unit. The wearable sensor unit is light, small, and consumes low energy, which allows for inexpensive and unobtrusive monitoring during normal daily activities at home. The acceleration measurement tests show that it is possible to classify different human motion through the acceleration reading. The 802.15.4 wireless signal quality is also tested in typical home scenarios. Measurement results show that even with interference from nearby IEEE 802.11 signals and microwave ovens, the data delivery performance is satisfactory and can be improved by selecting an appropriate channel. Moreover, we found that the wireless signal can be attenuated by housing materials, home appliances, and even plants. Therefore, the deployment of wireless body sensor systems at home needs to take all these factors into consideration.
Game Information System
Venue: arXiv cs.AI 2010
Year: 2010

In this Information system age many organizations consider information system as their weapon to compete or gain competitive advantage or give the best services for non profit organizations. Game Information System as combining Information System and game is breakthrough to achieve organizations' performance. The Game Information System will run the Information System with game and how game can be implemented to run the Information System. Game is not only for fun and entertainment, but will be a challenge to combine fun and entertainment with Information System. The Challenge to run the information system with entertainment, deliver the entertainment with information system all at once. Game information system can be implemented in many sectors as like the information system itself but in difference's view. A view of game which people can joy and happy and do their transaction as a fun things.
Survey on the Event Orderings Semantics Used for Distributed System
Venue: arXiv cs.DC 2010
Year: 2010

Event ordering in distributed system (DS) is disputable and proactive subject in DS particularly with the emergence of multimedia synchronization. According to the literature, different type of event ordering is used for different DS mode such as asynchronous or synchronous. Recently, there are several novel implementation of these types introduced to fulfill the demand for establishing a certain order according to a specific criterion in DS with lighter complexity.
Genbit Compress Tool(GBC): A Java-Based Tool to Compress DNA Sequences and Compute Compression Ratio(bits/base) of Genomes
Venue: arXiv cs.MS 2010
Year: 2010

We present a Compression Tool, "GenBit Compress", for genetic sequences based on our new proposed "GenBit Compress Algorithm". Our Tool achieves the best compression ratios for Entire Genome (DNA sequences) . Significantly better compression results show that GenBit compress algorithm is the best among the remaining Genome compression algorithms for non-repetitive DNA sequences in Genomes. The standard Compression algorithms such as gzip or compress cannot compress DNA sequences but only expand them in size. In this paper we consider the problem of DNA compression. It is well known that one of the main features of DNA Sequences is that they contain substrings which are duplicated except for a few random Mutations. For this reason most DNA compressors work by searching and encoding approximate repeats. We depart from this strategy by searching and encoding only exact repeats. our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. As long as 8 lakh characters can be given as input While achieving the best compression ratios for DNA sequences, our new GenBit Compress program significantly improves the running time of all previous DNA compressors. Assigning binary bits for fragments of DNA sequence is also a unique concept introduced in this program for the first time in DNA compression.
Correction to "Generalized Self-Shrinking Generator"
Venue: arXiv cs.DM 2010
Year: 2010

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, "Generalized Self-Shrinking Generator," IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.
The Morphisms With Unstackable Image Words
Venue: arXiv cs.FL 2010
Year: 2010

In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the Leech square-free morphism to gain insights on a larger class of both overlap-free morphisms and square-free morphisms.
Uncovering the Riffled Independence Structure of Rankings
Venue: arXiv cs.LG 2010
Year: 2010

Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of $n$ objects scales factorially in $n$. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impose strong sparsity constraints on distributions and are unsuitable for modeling rankings. We identify a novel class of independence structures, called \emph{riffled independence}, encompassing a more expressive family of distributions while retaining many of the properties necessary for performing efficient inference and reducing sample complexity. In riffled independence, one draws two permutations independently, then performs the \emph{riffle shuffle}, common in card games, to combine the two permutations to form a single permutation. Within the context of ranking, riffled independence corresponds to ranking disjoint sets of objects independently, then interleaving those rankings. In this paper, we provide a formal introduction to riffled independence and present algorithms for using riffled independence within Fourier-theoretic frameworks which have been explored by a number of recent papers. Additionally, we propose an automated method for discovering sets of items which are riffle independent from a training set of rankings. We show that our clustering-like algorithms can be used to discover meaningful latent coalitions from real preference ranking datasets and to learn the structure of hierarchically decomposable models based on riffled independence.
Bounds on Stability and Latency in Wireless Communication
Venue: arXiv cs.NI 2010
Year: 2010

In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model wireless communication. More precisely, there is an adversary that specifies transmission rates of wireless links and injects data in such a way that an average number of data injected in a single round and routed through a single wireless link is at most $r$, for a given $r\in (0,1)$. We also assume that the additional "burst" of data injected during any time interval and scheduled via a single link is bounded by a given parameter $b$. Under this scenario, we show that the nodes following so called {\em work-conserving} scheduling policies, not necessarily the same, are guaranteed stability (i.e., bounded queues) and reasonably small data latency (i.e., bounded time on data delivery), for injection rates $r<1/d$, where $d$ is the maximum length of a routing path. Furthermore, we also show that such a bound is asymptotically optimal on $d$.
PhoenixCloud: Provisioning Resources for Heterogeneous Workloads in Cloud Computing
Venue: arXiv cs.DC 2010
Year: 2010

As more and more service providers choose Cloud platforms, which is provided by third party resource providers, resource providers needs to provision resources for heterogeneous workloads in different Cloud scenarios. Taking into account the dramatic differences of heterogeneous workloads, can we coordinately provision resources for heterogeneous workloads in Cloud computing? In this paper we focus on this important issue, which is investigated by few previous work. Our contributions are threefold: (1) we respectively propose a coordinated resource provisioning solution for heterogeneous workloads in two typical Cloud scenarios: first, a large organization operates a private Cloud for two heterogeneous workloads; second, a large organization or two service providers running heterogeneous workloads revert to a public Cloud; (2) we build an agile system PhoenixCloud that enables a resource provider to create coordinated runtime environments on demand for heterogeneous workloads when they are consolidated on a Cloud site; and (3) A comprehensive evaluation has been performed in experiments. For two typical heterogeneous workload traces: parallel batch jobs and Web services, our experiments show that: a) in a private Cloud scenario, when the throughput is almost same like that of a dedicated cluster system, our solution decreases the configuration size of a cluster by about 40%; b) in a public Cloud scenario, our solution decreases not only the total resource consumption, but also the peak resource consumption maximally to 31% with respect to that of EC2 +RightScale solution.
Using Strategy Improvement to Stay Alive
Venue: arXiv cs.GT 2010
Year: 2010

We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy -- depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice.
On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
Venue: arXiv cs.LO 2010
Year: 2010

For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1 and Pi1). This contrasts with the class of all graphs, where Delta2=Comp(Sigma1,Pi1).
Begin, After, and Later: a Maximal Decidable Interval Temporal Logic
Venue: arXiv cs.LO 2010
Year: 2010

Interval temporal logics (ITLs) are logics for reasoning about temporal statements expressed over intervals, i.e., periods of time. The most famous ITL studied so far is Halpern and Shoham's HS, which is the logic of the thirteen Allen's interval relations. Unfortunately, HS and most of its fragments have an undecidable satisfiability problem. This discouraged the research in this area until recently, when a number non-trivial decidable ITLs have been discovered. This paper is a contribution towards the complete classification of all different fragments of HS. We consider different combinations of the interval relations Begins, After, Later and their inverses Abar, Bbar, and Lbar. We know from previous works that the combination ABBbarAbar is decidable only when finite domains are considered (and undecidable elsewhere), and that ABBbar is decidable over the natural numbers. We extend these results by showing that decidability of ABBar can be further extended to capture the language ABBbarLbar, which lays in between ABBar and ABBbarAbar, and that turns out to be maximal w.r.t decidability over strongly discrete linear orders (e.g. finite orders, the naturals, the integers). We also prove that the proposed decision procedure is optimal with respect to the complexity class.
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
Venue: arXiv cs.LO 2010
Year: 2010

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation between members of the coalition in which agents issue their actions based on the distributed knowledge, for that coalition, of the system history. We show that model-checking is decidable for this logic. The technique utilizes two variants of games with imperfect information and partially observable objectives, as well as a subset construction for identifying states whose histories are indistinguishable to the considered coalition.
The space of measurement outcomes as a spectrum for non-commutative algebras
Venue: arXiv cs.LO 2010
Year: 2010

Bohrification defines a locale of hidden variables internal in a topos. We find that externally this is the space of partial measurement outcomes. By considering the double negation sheafification, we obtain the space of measurement outcomes which coincides with the spectrum for commutative C*-algebras.
Smoothed Analysis of Balancing Networks
Venue: arXiv cs.DS 2010
Year: 2010

In a balancing network each processor has an initial collection of unit-size jobs (tokens) and in each round, pairs of processors connected by balancers split their load as evenly as possible. An excess token (if any) is placed according to some predefined rule. As it turns out, this rule crucially affects the performance of the network. In this work we propose a model that studies this effect. We suggest a model bridging the uniformly-random assignment rule, and the arbitrary one (in the spirit of smoothed-analysis). We start with an arbitrary assignment of balancer directions and then flip each assignment with probability $α$ independently. For a large class of balancing networks our result implies that after $\Oh(\log n)$ rounds the discrepancy is $\Oh( (1/2-α) \log n + \log \log n)$ with high probability. This matches and generalizes known upper bounds for $α=0$ and $α=1/2$. We also show that a natural network matches the upper bound for any $α$.
Tata Kelola Database Perguruan Tinggi Yang Optimal Dengan Data Warehouse
Venue: arXiv cs.DB 2010
Year: 2010

The emergence of new higher education institutions has created the competition in higher education market, and data warehouse can be used as an effective technology tools for increasing competitiveness in the higher education market. Data warehouse produce reliable reports for the institution's high-level management in short time for faster and better decision making, not only on increasing the admission number of students, but also on the possibility to find extraordinary, unconventional funds for the institution. Efficiency comparison was based on length and amount of processed records, total processed byte, amount of processed tables, time to run query and produced record on OLTP database and data warehouse. Efficiency percentages was measured by the formula for percentage increasing and the average efficiency percentage of 461.801,04% shows that using data warehouse is more powerful and efficient rather than using OLTP database. Data warehouse was modeled based on hypercube which is created by limited high demand reports which usually used by high level management. In every table of fact and dimension fields will be inserted which represent the loading constructive merge where the ETL (Extraction, Transformation and Loading) process is run based on the old and new files.
On the Proximity Factors of Lattice Reduction-Aided Decoding
Venue: arXiv cs.IT 2010
Year: 2010

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this aim, the proximity factors are defined to measure the worst-case losses in distances relative to closest point search (in an infinite lattice). Upper bounds on the proximity factors are derived, which are functions of the dimension $n$ of the lattice alone. The study is then extended to the dual-basis reduction. It is found that the bounds for dual basis reduction may be smaller. Reasonably good bounds are derived in many cases. The constant bounds on proximity factors not only imply the same diversity order in fading channels, but also relate the error probabilities of (infinite) lattice decoding and lattice reduction-aided decoding.
Interference Channel with Generalized Feedback (a.k.a. with source cooperation). Part I: Achievable Region
Venue: arXiv cs.IT 2010
Year: 2010

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel activity. The signal overheard from the channel provides information about the activity of the other users, and thus furnishes the basis for cooperation. In this two-part paper we study achievable strategies and outer bounds for a general IFC-GF with two source-destination pairs. We then evaluate the proposed regions for the Gaussian channel. Part I: achievable region. We propose that the generalized feedback is used to gain knowledge about the message sent by other user and then exploited in two ways: (a) to {\em relay} the messages that can be decoded at both destinations--thus realizing the gains of beam-forming of a distributed multi-antenna system--and (b) to {\em hide} the messages that can not be decoded at the non-intended destination--thus leveraging the interference "pre-cancellation" property of dirty-paper-type coding. We show that our achievable region generalizes several known achievable regions for IFC-GF and that it reduces to known achievable regions for some of the channels subsumed by the IFC-GF model.
Simple ROI untuk justifikasi investasi proyek Data Warehouse pada perguruan tinggi swasta
Venue: arXiv cs.OH 2010
Year: 2010

Decreasing new students for private high education push the management particularly for high level management for making an information which can help them to make decisions in order for competition with other high educations. One of way out by building with information technology approaching like data warehouse for data handling and making the best decisions. Simple ROI is used for project justification. Based on ROI value between 1,850.13% and cash flow Rp. 22,081,297,308 then can be concluded that project data warehouse development in private high education can be implemented with the particular assumptions.
Sistem Pengambilan Keputusan Penanganan Bencana Alam Gempa Bumi Di Indonesia
Venue: arXiv cs.OH 2010
Year: 2010

After Aceh's quake many earthquakes have struck Indonesia alternately and even other disasters have been a threat for every citizen in this country. Actually an everyday occurrence on earth and more than 3 million earthquakes occur every year, about 8,000 a day, or one every 11 seconds in Indonesia there are 5 to 30 quakes prediction everyday. Government's responsibility to protect the citizen has been done by making National body of disaster management. Preparing, saving and distribution logistic become National body of disaster management's responsibility to build information management. Many law's products have been produced as a government's responsibility to give secure life for the citizen. We can not prevent them totally, we have to learn to live with them and need to be prepared all the time, need to learn how to mitigate risk of losses in such events by managing crisis and emergencies correctly. After disaster happens respond must be rapidly and at an optimal level to save lives and help to victims. DSS is information technology environment which can be used to help human in order to learn from past earthquake, record it, learn and plan for future mitigation and hope will reduce the disaster risk in the future. Using web technology for DSS will give value added where not only make a strategic decision for the decision maker, but for others who need national earthquake information like citizen, scholars, researches and people around the world.
Calibration and Internal no-Regret with Partial Monitoring
Venue: arXiv cs.GT 2010
Year: 2010

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary game. We establish the converse: a strategy that approaches a convex $B$-set can be derived from the construction of a calibrated strategy. We develop these tools in the framework of a game with partial monitoring, where players do not observe the actions of their opponents but receive random signals, to define a notion of internal regret and construct strategies that have no such regret.