OpenRaiser/Intern-Atlas huggingface dataset:
EXIT Chart Approximations using the Role Model Approach
Venue: arXiv cs.IT 2010
Year: 2010

Extrinsic Information Transfer (EXIT) functions can be measured by statistical methods if the message alphabet size is moderate or if messages are true a-posteriori distributions. We propose an approximation we call mixed information that constitutes a lower bound for the true EXIT function and can be estimated by statistical methods even when the message alphabet is large and histogram-based approaches are impractical, or when messages are not true probability distributions and time-averaging approaches are not applicable. We illustrate this with the hypothetical example of a rank-only message passing decoder for which it is difficult to compute or measure EXIT functions in the conventional way. We show that the role model approach (arXiv:0809.1300) can be used to optimize post-processing for the decoder and that it coincides with Monte Carlo integration in the non-parametric case. It is guaranteed to tend towards the optimal Bayesian post-processing estimator and can be applied in a blind setup with unknown code-symbols to optimize the check-node operation for non-binary Low-Density Parity-Check (LDPC) decoders.
Analysis of Collectivism and Egoism Phenomena within the Context of Social Welfare
Venue: arXiv cs.MA 2010
Year: 2010

Comparative benefits provided by the basic social strategies including collectivism and egoism are investigated within the framework of democratic decision-making. In particular, we study the mechanism of growing "snowball" of cooperation.
Holographic Projection Technology: The World is Changing
Venue: arXiv cs.CY 2010
Year: 2010

This research papers examines the new technology of Holographic Projections. It highlights the importance and need of this technology and how it represents the new wave in the future of technology and communications, the different application of the technology, the fields of life it will dramatically affect including business, education, telecommunication and healthcare. The paper also discusses the future of holographic technology and how it will prevail in the coming years highlighting how it will also affect and reshape many other fields of life, technologies and businesses.
Capacity for Half-Duplex Line Networks with Two Sources
Venue: arXiv cs.IT 2010
Year: 2010

The focus is on noise-free half-duplex line networks with two sources where the first node and either the second node or the second-last node in the cascade act as sources. In both cases, we establish the capacity region of rates at which both sources can transmit independent information to a common sink. The achievability scheme presented for the first case is constructive while the achievability scheme for the second case is based on a random coding argument.
Expressiveness of a Provenance-Enabled Authorization Logic
Venue: arXiv cs.LO 2010
Year: 2010

In distributed environments, access control decisions depend on statements of multiple agents rather than only one central trusted party. However, existing policy languages put few emphasis on authorization provenances. The capability of managing these provenances is important and useful in various security areas such as computer auditing and authorization recycling. Based on our previously proposed logic, we present several case studies of this logic. By doing this, we show its expressiveness and usefulness in security arena.
An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks
Venue: arXiv cs.NI 2010
Year: 2010

This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill-effects of free riding in unstructured P2P networks. Based on various parameter values collected during query routing, reward for the actions are computed and these rewards are used for updating the corresponding Q-values of peers. Thus, the routing is done through only nodes which have shown high performance in the past. Simulation experiments are conducted in several times and the results are plotted. Results show that the proposed scheme effectively manages free riders, generates high hit ratio, reduces network traffic and manages partial coverage problem.
Chi-square-based scoring function for categorization of MEDLINE citations
Venue: arXiv cs.IR 2010
Year: 2010

Objectives: Text categorization has been used in biomedical informatics for identifying documents containing relevant topics of interest. We developed a simple method that uses a chi-square-based scoring function to determine the likelihood of MEDLINE citations containing genetic relevant topic. Methods: Our procedure requires construction of a genetic and a nongenetic domain document corpus. We used MeSH descriptors assigned to MEDLINE citations for this categorization task. We compared frequencies of MeSH descriptors between two corpora applying chi-square test. A MeSH descriptor was considered to be a positive indicator if its relative observed frequency in the genetic domain corpus was greater than its relative observed frequency in the nongenetic domain corpus. The output of the proposed method is a list of scores for all the citations, with the highest score given to those citations containing MeSH descriptors typical for the genetic domain. Results: Validation was done on a set of 734 manually annotated MEDLINE citations. It achieved predictive accuracy of 0.87 with 0.69 recall and 0.64 precision. We evaluated the method by comparing it to three machine learning algorithms (support vector machines, decision trees, naïve Bayes). Although the differences were not statistically significantly different, results showed that our chi-square scoring performs as good as compared machine learning algorithms. Conclusions: We suggest that the chi-square scoring is an effective solution to help categorize MEDLINE citations. The algorithm is implemented in the BITOLA literature-based discovery support system as a preprocessor for gene symbol disambiguation process.
A unified approach to mapping and clustering of bibliometric networks
Venue: arXiv cs.DL 2010
Year: 2010

In the analysis of bibliometric networks, researchers often use mapping and clustering techniques in a combined fashion. Typically, however, mapping and clustering techniques that are used together rely on very different ideas and assumptions. We propose a unified approach to mapping and clustering of bibliometric networks. We show that the VOS mapping technique and a weighted and parameterized variant of modularity-based clustering can both be derived from the same underlying principle. We illustrate our proposed approach by producing a combined mapping and clustering of the most frequently cited publications that appeared in the field of information science in the period 1999-2008.
Systolic Array Technique for Determining Common Approximate Substrings
Venue: arXiv cs.DS 2010
Year: 2010

A technique using a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introduced in earlier work from the computation of the edit-distance between two strings to the more encompassing CAS problem. A comparison to existing work is given, and the technique presented is validated and analyzed based on simulations.
Optimal Source-Based Filtering of Malicious Traffic
Venue: arXiv cs.NI 2010
Year: 2010

In this paper, we consider the problem of blocking malicious traffic on the Internet, via source-based filtering. In particular, we consider filtering via access control lists (ACLs): these are already available at the routers today but are a scarce resource because they are stored in the expensive ternary content addressable memory (TCAM). Aggregation (by filtering source prefixes instead of individual IP addresses) helps reduce the number of filters, but comes also at the cost of blocking legitimate traffic originating from the filtered prefixes. We show how to optimally choose which source prefixes to filter, for a variety of realistic attack scenarios and operators' policies. In each scenario, we design optimal, yet computationally efficient, algorithms. Using logs from Dshield.org, we evaluate the algorithms and demonstrate that they bring significant benefit in practice.
An Algorithm to Self-Extract Secondary Keywords and Their Combinations Based on Abstracts Collected using Primary Keywords from Online Digital Libraries
Venue: arXiv cs.IR 2010
Year: 2010

The high-level contribution of this paper is the development and implementation of an algorithm to selfextract secondary keywords and their combinations (combo words) based on abstracts collected using standard primary keywords for research areas from reputed online digital libraries like IEEE Explore, PubMed Central and etc. Given a collection of N abstracts, we arbitrarily select M abstracts (M<< N; M/N as low as 0.15) and parse each of the M abstracts, word by word. Upon the first-time appearance of a word, we query the user for classifying the word into an Accept-List or non-Accept-List. The effectiveness of the training approach is evaluated by measuring the percentage of words for which the user is queried for classification when the algorithm parses through the words of each of the M abstracts. We observed that as M grows larger, the percentage of words for which the user is queried for classification reduces drastically. After the list of acceptable words is built by parsing the M abstracts, we now parse all the N abstracts, word by word, and count the frequency of appearance of each of the words in Accept-List in these N abstracts. We also construct a Combo-Accept-List comprising of all possible combinations of the single keywords in Accept-List and parse all the N abstracts, two successive words (combo word) at a time, and count the frequency of appearance of each of the combo words in the Combo-Accept-List in these N abstracts.
Counting dependent and independent strings
Venue: arXiv cs.CC 2010
Year: 2010

The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise αindependent, (3) the set of strings that are mutually αindependent. The relevant definitions are as follows: C(x) is the Kolmogorov complexity of the string x. A string y has α-dependency with a string x if C(y) - C(y|x) \geq α. A set of strings {x_1, \ldots, x_t} is pairwise α-independent if for all i different from j, C(x_i) - C(x_i | x_j) \leq α. A tuple of strings (x_1, \ldots, x_t) is mutually α-independent if C(x_{π(1)} \ldots x_{π(t)}) \geq C(x_1) + \ldots + C(x_t) - α, for every permutation πof [t].
Analyzing Graph Transformation Systems through Constraint Handling Rules
Venue: arXiv cs.LO 2010
Year: 2010

Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well-known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS, and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.
New worst upper bound for #SAT
Venue: arXiv cs.AI 2010
Year: 2010

The rigorous theoretical analyses of algorithms for #SAT have been proposed in the literature. As we know, previous algorithms for solving #SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving #SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving #2-SAT and #3-SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.1892m) for #2-SAT and O(1.4142m) for #3-SAT, where m is the number of clauses.
ToLeRating UR-STD
Venue: arXiv cs.AI 2010
Year: 2010

A new emerging paradigm of Uncertain Risk of Suspicion, Threat and Danger, observed across the field of information security, is described. Based on this paradigm a novel approach to anomaly detection is presented. Our approach is based on a simple yet powerful analogy from the innate part of the human immune system, the Toll-Like Receptors. We argue that such receptors incorporated as part of an anomaly detector enhance the detector's ability to distinguish normal and anomalous behaviour. In addition we propose that Toll-Like Receptors enable the classification of detected anomalies based on the types of attacks that perpetrate the anomalous behaviour. Classification of such type is either missing in existing literature or is not fit for the purpose of reducing the burden of an administrator of an intrusion detection system. For our model to work, we propose the creation of a taxonomy of the digital Acytota, based on which our receptors are created.
A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes
Venue: arXiv cs.IT 2010
Year: 2010

The Welch--Berlekamp approach for Reed--Solomon (RS) codes forms a bridge between classical syndrome--based decoding algorithms and interpolation--based list--decoding procedures for list size l=1. It returns the univariate error--locator polynomial and the evaluation polynomial of the RS code as a y-root. In this paper, we show the connection between the Welch--Berlekamp approach for a specific Interleaved Reed--Solomon code scheme and the Guruswami--Sudan principle. It turns out that the decoding of Interleaved RS codes can be formulated as a modified Guruswami--Sudan problem with a specific multiplicity assignment. We show that our new approach results in the same solution space as the Welch--Berlekamp scheme. Furthermore, we prove some important properties.
Variants of the LLL Algorithm in Digital Communications: Complexity Analysis and Fixed-Complexity Implementation
Venue: arXiv cs.IT 2010
Year: 2010

The Lenstra-Lenstra-Lovász (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with either lower theoretic complexity or fixed-complexity implementation are proposed and/or analyzed. Firstly, the $O(n^4\log n)$ theoretic average complexity of the standard LLL algorithm under the model of i.i.d. complex normal distribution is derived. Then, the use of effective LLL reduction for lattice decoding is presented, where size reduction is only performed for pairs of consecutive basis vectors. Its average complexity is shown to be $O(n^3\log n)$, which is an order lower than previously thought. To address the issue of variable complexity of standard LLL, two fixed-complexity approximations of LLL are proposed. One is fixed-complexity effective LLL, while the other is fixed-complexity LLL with deep insertion, which is closely related to the well known V-BLAST algorithm. Such fixed-complexity structures are much desirable in hardware implementation since they allow straightforward constant-throughput implementation.
On the Universality of Sequential Slotted Amplify and Forward Strategy in Cooperative Communications
Venue: arXiv cs.IT 2010
Year: 2010

While cooperative communication has many benefits and is expected to play an important role in future wireless networks, many challenges are still unsolved. Previous research has developed different relaying strategies for cooperative multiple access channels (CMA), cooperative multiple relay channels (CMR) and cooperative broadcast channels (CBC). However, there lacks a unifying strategy that is universally optimal for these three classical channel models. Sequential slotted amplify and forward (SSAF) strategy was previously proposed to achieve the optimal diversity and multiplexing tradeoff (DMT) for CMR. In this paper, the use of SSAF strategy is extended to CBC and CMA, and its optimality for both of them is shown. For CBC, a CBC-SSAF strategy is proposed which can asymptotically achieve the DMT upper bound when the number of cooperative users is large. For CMA, a CMA-SSAF strategy is proposed which even can exactly achieve the DMT upper bound with any number of cooperative users. In this way, SSAF strategy is shown to be universally optimal for all these three classical channel models and has great potential to provide universal optimality for wireless cooperative networks.
Simulating Cyber-Attacks for Fun and Profit
Venue: arXiv cs.CR 2010
Year: 2010

We introduce a new simulation platform called Insight, created to design and simulate cyber-attacks against large arbitrary target scenarios. Insight has surprisingly low hardware and configuration requirements, while making the simulation a realistic experience from the attacker's standpoint. The scenarios include a crowd of simulated actors: network devices, hardware devices, software applications, protocols, users, etc. A novel characteristic of this tool is to simulate vulnerabilities (including 0-days) and exploits, allowing an attacker to compromise machines and use them as pivoting stones to continue the attack. A user can test and modify complex scenarios, with several interconnected networks, where the attacker has no initial connectivity with the objective of the attack. We give a concise description of this new technology, and its possible uses in the security research field, such as pentesting training, study of the impact of 0-days vulnerabilities, evaluation of security countermeasures, and risk assessment tool.
Rozwój bibliotek cyfrowych i repozytoriów elektronicznych na Dolnym Slasku w latach 2004-2008 / Development of Digital Libraries and Electronic Repositories in Lower Silesia in Years 2004-2008
Venue: arXiv cs.DL 2010
Year: 2010

In following elaboration were presented digital libraries and electronic repositories operating in Lower Silesia region (of Poland) in years 2004-2008. General description of character and size of their collections was presented, as well as standards and methods of digital collections management and juridical aspects of this management. Potential of usage of digital collections in regional scientific researches was described. ----- W referacie przedstawiono biblioteki cyfrowe i repozytoria elektroniczne funkcjonujace na Dolnym Slasku w latach 2004-2008. Scharakteryzowano ogólnie ich zawartość i wielkość, zaprezentowano standardy i systemy zarzadzania kolekcjami cyfrowymi oraz omówiono uwarunkowania prawne towarzyszace zarzadzaniu zasobami cyfrowymi. Wskazano możliwości wykorzystania kolekcji cyfrowych w badaniach naukowych realizowanych w regionie.
Message and state cooperation in multiple access channels
Venue: arXiv cs.IT 2010
Year: 2010

We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, and to share information about the private messages that each encoder has. For two-way cooperation, this two-fold purpose is achieved by double-binning, where the first layer of binning is used to generate the state coordination similarly to the two-way source coding, and the second layer of binning is used to transmit information about the private messages. The complete result provides the framework and perspective for addressing a complex level of cooperation that mixes states and messages in an optimal way.
Pemanfaatan Teknologi Sistem Informasi Geografis Untuk Menunjang Pembangunan Daerah
Venue: arXiv cs.OH 2010
Year: 2010

The territory development will depend on that territory itself, where the word of autonomy for each province or territory will give contribution how Indonesian will responsible for development their territory. In order to develop territory, the information technology can be used as a boost or tools to give and deliver the best information and Geographic Information System is one of the information technology tools which can be used to push every each territory to speed the territory development. As a tool Geographic Information System has an ability to save, process, analysis and deliver information right in time and help the decision maker to make better decision.
Dyadic Prediction Using a Latent Feature Log-Linear Model
Venue: arXiv cs.LG 2010
Year: 2010

In dyadic prediction, labels must be predicted for pairs (dyads) whose members possess unique identifiers and, sometimes, additional features called side-information. Special cases of this problem include collaborative filtering and link prediction. We present the first model for dyadic prediction that satisfies several important desiderata: (i) labels may be ordinal or nominal, (ii) side-information can be easily exploited if present, (iii) with or without side-information, latent features are inferred for dyad members, (iv) it is resistant to sample-selection bias, (v) it can learn well-calibrated probabilities, and (vi) it can scale to very large datasets. To our knowledge, no existing method satisfies all the above criteria. In particular, many methods assume that the labels are ordinal and ignore side-information when it is present. Experimental results show that the new method is competitive with state-of-the-art methods for the special cases of collaborative filtering and link prediction, and that it makes accurate predictions on nominal data.
Complexity of Multi-Value Byzantine Agreement
Venue: arXiv cs.DC 2010
Year: 2010

In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. We have proposed a highly efficient Byzantine agreement algorithm on values of length l>1 bits. This algorithm uses error detecting network codes to ensure that fault-free nodes will never disagree, and routing scheme that is adaptive to the result of error detection. Our algorithm has a bit complexity of n(n-1)l/(n-t), which leads to a linear cost (O(n)) per bit agreed upon, and overcomes the quadratic lower bound (Omega(n^2)) in the literature. Such linear per bit complexity has only been achieved in the literature by allowing a positive probability of error. Our algorithm achieves the linear per bit complexity while guaranteeing agreement is achieved correctly even in the worst case. We also conjecture that our algorithm can be used to achieve agreement throughput arbitrarily close to the agreement capacity of a network, when the sum capacity is given.