OpenRaiser/Intern-Atlas huggingface dataset:
Communication and Knowledge: How is the knowledge base of an economy constructed?
Venue: arXiv cs.CY 2009
Year: 2009

The competitive advantages in a knowledge-based economy can no longer be attributed to single nodes in the network. Political economies are increasingly reshaped by knowledge-based developments that upset market equilibria and institutional arrangements. The network coordinates the subdynamics of (i) wealth production, (ii) organized novelty production, and (iii) private appropriation versus public control. The interaction terms generate a complex dynamics which cannot be expected to contain central coordination. However, the knowledge infrastructure of systems of innovations can be measured, for example, in terms of university-industry-government relations. The mutual information in these three dimensions indicates the globalization of the knowledge base. Patent statistics and data from the Internet are compared in terms of this indicator.
Understanding edge-connectivity in the Internet through core-decomposition
Venue: arXiv cs.DM 2009
Year: 2009

Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partitions and selected paths) this work provides a formal lower bound to it based on core-decomposition, under certain conditions, and low complexity algorithms to find it. We apply them to analyze maps obtained from the prominent Internet mapping projects, using the LaNet-vi open-source software for its visualization.
Computing Hulls And Centerpoints In Positive Definite Space
Venue: arXiv cs.CG 2009
Year: 2009

In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a Euclidean space, are positive definite (p.d.) matrices. These applications include diffusion tensor imaging in the brain, elasticity analysis in mechanical engineering, and the theory of kernel maps in machine learning. Our work centers around the notion of a horoball: the limit of a ball fixed at one point whose radius goes to infinity. Horoballs possess many (though not all) of the properties of halfspaces; in particular, they lack a strong separation theorem where two horoballs can completely partition the space. In spite of this, we show that we can compute an approximate "horoball hull" that strictly contains the actual convex hull. This approximate hull also preserves geodesic extents, which is a result of independent value: an immediate corollary is that we can approximately solve problems like the diameter and width in positive definite space. We also use horoballs to show existence of and compute approximate robust centerpoints in positive definite space, via the horoball-equivalent of the notion of depth.
Fixed-complexity vector perturbation with Block diagonalization for MU-MIMO systems
Venue: arXiv cs.IT 2009
Year: 2009

Block diagonalization (BD) is an attractive technique that transforms the multi-user multiple-input multiple-output (MU-MIMO) channel into parallel single-user MIMO (SU-MIMO) channels with zero inter-user interference (IUI). In this paper, we combine the BD technique with two deterministic vector perturbation (VP) algorithms that reduce the transmit power in MU-MIMO systems with linear precoding. These techniques are the fixed-complexity sphere encoder (FSE) and the QR-decomposition with M-algorithm encoder (QRDM-E). In contrast to the conventional BD VP technique, which is based on the sphere encoder (SE), the proposed techniques have fixed complexity and a tradeoff between performance and complexity can be achieved by controlling the size of the set of candidates for the perturbation vector. Simulation results and analysis demonstrate the properness of the proposed techniques for the next generation mobile communications systems which are latency and computational complexity limited. In MU-MIMO system with 4 users each equipped with 2 receive antennas, simulation results show that the proposed BD-FSE and BD-QRDM-E outperforms the conventional BD-THP (Tomlinson Harashima precoding) by 5.5 and 7.4dB, respectively, at a target BER of 10^{-4}.
Frequency of Occurrence and Information Entropy of American Sign Language
Venue: arXiv cs.IT 2009
Year: 2009

American Sign Language (ASL) uses a series of hand based gestures as a replacement for words to allow the deaf to communicate. Previous work has shown that although it takes longer to make signs than to say the equivalent words, on average sentences can be completed in about the same time. This leaves unresolved, however, precisely why that should be the case. This paper reports a determination of the empirical entropy and redundancy in the set of handshapes of ASL. In this context, the entropy refers to the average information content in a unit of data. It is found that the handshapes, as fundamental units of ASL, are less redundant than phonemes, the equivalent fundamental units of spoken English, and that their entropy is much closer to the maximum possible information content. This explains why the slower signs can produce sentences in the same time as speaking; the low redundancy compensates for the slow rate of sign production. In addition to this precise quantification, this work is also novel in its approach towards quantifying an aspect of the ASL alphabet. Unlike spoken and written languages, frequency analysis of ASL is difficult due to the fact that every sign is composed of phonemes that are created through a combination of manual and a relatively large and imprecise set of bodily features. Focusing on handshapes as the ubiquitous and universal feature of all sign languages permits a precise quantitative analysis. As interest in visual electronic communication explodes within the deaf community, this work also paves the way for more precise automated sign recognition and synthesis.
Emotions in Pervasive Computing Environments
Venue: arXiv cs.HC 2009
Year: 2009

The ability of an intelligent environment to connect and adapt to real internal sates, needs and behaviors' meaning of humans can be made possible by considering users' emotional states as contextual parameters. In this paper, we build on enactive psychology and investigate the incorporation of emotions in pervasive systems. We define emotions, and discuss the coding of emotional human markers by smart environments. In addition, we compare some existing works and identify how emotions can be detected and modeled by a pervasive system in order to enhance its service and response to users. Finally, we analyze closely one XML-based language for representing and annotating emotions known as EARL and raise two important issues which pertain to emotion representation and modeling in XML-based languages.
Association Rule Pruning based on Interestingness Measures with Clustering
Venue: arXiv cs.LG 2009
Year: 2009

Association rule mining plays vital part in knowledge mining. The difficult task is discovering knowledge or useful rules from the large number of rules generated for reduced support. For pruning or grouping rules, several techniques are used such as rule structure cover methods, informative cover methods, rule clustering, etc. Another way of selecting association rules is based on interestingness measures such as support, confidence, correlation, and so on. In this paper, we study how rule clusters of the pattern Xi - Y are distributed over different interestingness measures.
Adaptive Scheduling of Data Paths using Uppaal Tiga
Venue: arXiv cs.FL 2009
Year: 2009

We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a printer. As far as we know, this is the first application of timed automata technology to an industrial scheduling problem with uncertainty in job arrivals.
Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach
Venue: arXiv cs.LO 2009
Year: 2009

We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus. Next we consider Markov reward chains which are standardly presented in real matrix theory. By interpreting the obtained matrix conditions for bisimulations in this setting, we automatically obtain the definitions of strong, weak, and branching bisimulation for Markov reward chains. The obtained strong and weak bisimulations are shown to coincide with some existing notions, while the obtained branching bisimulation is new, but its usefulness is questionable.
Training and Feedback Optimization for Multiuser MIMO Downlink
Venue: arXiv cs.IT 2009
Year: 2009

We consider a MIMO fading broadcast channel where the fading channel coefficients are constant over time-frequency blocks that span a coherent time $\times$ a coherence bandwidth. In closed-loop systems, channel state information at transmitter (CSIT) is acquired by the downlink training sent by the base station and an explicit feedback from each user terminal. In open-loop systems, CSIT is obtained by exploiting uplink training and channel reciprocity. We use a tight closed-form lower bound on the ergodic achievable rate in the presence of CSIT errors in order to optimize the overall system throughput, by taking explicitly into account the overhead due to channel estimation and channel state feedback. Based on three time-frequency block models inspired by actual systems, we provide some useful guidelines for the overall system optimization. In particular, digital (quantized) feedback is found to offer a substantial advantage over analog (unquantized) feedback.
Security Visualization for peer-to-peer resource sharing applications
Venue: arXiv cs.NI 2009
Year: 2009

Security of an information system is only as strong as its weakest element. Popular elements of such system include hardware, software, network and people. Current approaches to computer security problems usually exclude people in their studies even though it is an integral part of these systems. To fill that gap, this paper discusses crucial people-related problems in computer security and proposes a method of improving security in such systems by integrating people tightly into the whole system. The integration is implemented via visualization to provide visual feedbacks and capture people's awareness of their actions and consequent results. By doing it, we can improve system usability, shorten user's learning curve, and hence enable user uses computer systems more securely.
Fault Predictions in Object Oriented Software
Venue: arXiv cs.SE 2009
Year: 2009

The dynamic software development organizations optimize the usage of resources to deliver the products in the specified time with the fulfilled requirements. This requires prevention or repairing of the faults as quick as possible. In this paper an approach for predicting the run-time errors in java is introduced. The paper is concerned with faults due to inheritance and violation of java constraints. The proposed fault prediction model is designed to separate the faulty classes in the field of software testing. Separated faulty classes are classified according to the fault occurring in the specific class. The results are papered by clustering the faults in the class. This model can be used for predicting software reliability.
PKI Implementation Issues: A Comparative Study of Pakistan with some Asian Countries
Venue: arXiv cs.CR 2009
Year: 2009

The paper includes Public Key Infrastructure (PKI), its need and requirements and introduction of some renowned PKI products. However, the major thrust of this work is that how PKI can enhance security of various systems. The paper is intended to serve as a guide on how to adequately prepare for some of the challenges that may be encountered especially in developing countries like Pakistan. The detail of PKI implementation issues is also included in the paper along with future challenges regarding implementation of PKI. Furthermore, paper includes technical issues hindering the implementation of PKI through comparison of PKI issues in Pakistan and some of Asian countries mainly Taiwan, Japan and Singapore. The paper also highlights the PKI issues and learnt lessons regarding PKI implementation and can act as a comprehensive guide for successful future PKI deployments.
VirusPKT: A Search Tool For Assimilating Assorted Acquaintance For Viruses
Venue: arXiv cs.IR 2009
Year: 2009

Viruses utilize various means to circumvent the immune detection in the biological systems. Several mathematical models have been investigated for the description of viral dynamics in the biological system of human and various other species. One common strategy for evasion and recognition of viruses is, through acquaintance in the systems by means of search engines. In this perspective a search tool have been developed to provide a wider comprehension about the structure and other details on viruses which have been narrated in this paper. This provides an adequate knowledge in evolution and building of viruses, its functions through information extraction from various websites. Apart from this, tool aim to automate the activities associated with it in a self-maintainable, self-sustainable, proactive one which has been evaluated through analysis made and have been discussed in this paper.
On Backtracking in Real-time Heuristic Search
Venue: arXiv cs.AI 2009
Year: 2009

Real-time heuristic search algorithms are suitable for situated agents that need to make their decisions in constant time. Since the original work by Korf nearly two decades ago, numerous extensions have been suggested. One of the most intriguing extensions is the idea of backtracking wherein the agent decides to return to a previously visited state as opposed to moving forward greedily. This idea has been empirically shown to have a significant impact on various performance measures. The studies have been carried out in particular empirical testbeds with specific real-time search algorithms that use backtracking. Consequently, the extent to which the trends observed are characteristic of backtracking in general is unclear. In this paper, we present the first entirely theoretical study of backtracking in real-time heuristic search. In particular, we present upper bounds on the solution cost exponential and linear in a parameter regulating the amount of backtracking. The results hold for a wide class of real-time heuristic search algorithms that includes many existing algorithms as a small subclass.
A Formal Framework for Mobile Robot Patrolling in Arbitrary Environments with Adversaries
Venue: arXiv cs.GT 2009
Year: 2009

Using mobile robots for autonomous patrolling of environments to prevent intrusions is a topic of increasing practical relevance. One of the most challenging scientific issues is the problem of finding effective patrolling strategies that, at each time point, determine the next moves of the patrollers in order to maximize some objective function. In the very last years this problem has been addressed in a game theoretical fashion, explicitly considering the presence of an adversarial intruder. The general idea is that of modeling a patrolling situation as a game, played by the patrollers and the intruder, and of studying the equilibria of this game to derive effective patrolling strategies. In this paper we present a game theoretical formal framework for the determination of effective patrolling strategies that extends the previous proposals appeared in the literature, by considering environments with arbitrary topology and arbitrary preferences for the agents. The main original contributions of this paper are the formulation of the patrolling game for generic graph environments, an algorithm for finding a deterministic equilibrium strategy, which is a fixed path through the vertices of the graph, and an algorithm for finding a non-deterministic equilibrium strategy, which is a set of probabilities for moving between adjacent vertices of the graph. Both the algorithms are analytically studied and experimentally validated, to assess their properties and efficiency.
On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
Venue: arXiv cs.NI 2009
Year: 2009

We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journeys that maximize the space-time information propagation capacity, in bit-meters per second. More specifically, we provide theoretical lower and upper bounds on the information propagation speed, as a function of the journey capacity. In the particular case of random way-point-like models (i.e., when nodes move for a distance of the order of the network domain size before changing direction), we show that, for relatively large journey capacities, the information propagation speed is of the same order as the mobile node speed. This implies that, surprisingly, in sparse but large-scale mobile DTNs, the space-time information propagation capacity in bit-meters per second remains proportional to the mobile node speed and to the size of the transported data bundles, when the bundles are relatively large. We also verify that all our analytical bounds are accurate in several simulation scenarios.
Application of Radial Basis Network Model for HIV/AIDs Regimen Specifications
Venue: arXiv cs.CY 2009
Year: 2009

HIV/AIDs Regimen specification one of many problems for which bioinformaticians have implemented and trained machine learning methods such as neural networks. Predicting HIV resistance would be much easier, but unfortunately we rarely have enough structural information available to train a neural network. To network model designed to predict how long the HIV patient can prolong his/her life time with certain regimen specification. To learn this model 300 patient's details have taken as a training set to train the network and 100 patients medical history has taken to test this model. This network model is trained using MAT lab implementation.
Logarithmic Barrier Optimization Problem Using Neural Network
Venue: arXiv cs.NA 2009
Year: 2009

The combinatorial optimization problem is one of the important applications in neural network computation. The solutions of linearly constrained continuous optimization problems are difficult with an exact algorithm, but the algorithm for the solution of such problems is derived by using logarithm barrier function. In this paper we have made an attempt to solve the linear constrained optimization problem by using general logarithm barrier function to get an approximate solution. In this case the barrier parameters behave as temperature decreasing to zero from sufficiently large positive number satisfying convexity of the barrier function. We have developed an algorithm to generate decreasing sequence of solution converging to zero limit.
Web Based Cross Language Plagiarism Detection
Venue: arXiv cs.OH 2009
Year: 2009

As the Internet help us cross language and cultural border by providing different types of translation tools, cross language plagiarism, also known as translation plagiarism are bound to arise. Especially among the academic works, such issue will definitely affect the student's works including the quality of their assignments and paper works. In this paper, we propose a new approach in detecting cross language plagiarism. Our web based cross language plagiarism detection system is specially tuned to detect translation plagiarism by implementing different techniques and tools to assist the detection process. Google Translate API is used as our translation tool and Google Search API, which is used in our information retrieval process. Our system is also integrated with the fingerprint matching technique, which is a widely used plagiarism detection technique. In general, our proposed system is started by translating the input documents from Malay to English, followed by removal of stop words and stemming words, identification of similar documents in corpus, comparison of similar pattern and finally summary of the result. Three least-frequent 4-grams fingerprint matching is used to implement the core comparison phase during the plagiarism detection process. In K-gram fingerprint matching technique, although any value of K can be considered, yet K = 4 was stated as an ideal choice. This is because smaller values of K (i.e., K = 1, 2, or 3), do not provide good discrimination between sentences. On the other hand, the larger the values of K (i.e., K = 5, 6, 7...etc), the better discrimination of words in one sentence from words in another.
Speed Control of Multi Level Inverter Designed DC Series Motor with Neuro-Fuzzy Controllers
Venue: arXiv cs.OH 2009
Year: 2009

This paper describes the speed control of a DC series motor for an accurate and high-speed performance. A neural network based controlling operation with fuzzy modeling is suggested in this paper. The driver units of these machines are designed with a Multi-level inverter operation and are controlled by a common current control mechanism for an accurate and efficient driving technique for DC series motor. The neuro-fuzzy logic control technique is introduced to eliminate uncertainties in the plant parameters of the DC Series motors, and also considered as potential candidate for different applications to prove adequacy of the proposed control algorithm through simulations. The simulation result with such an approach is made and observed efficient over other controlling technique.
Fast Fraction-Integer Method for Computing Multiplicative Inverse
Venue: arXiv cs.DS 2009
Year: 2009

Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of numbers, each of which is the inverse of the other. The basic method to find multiplicative inverses is Extended-Euclidean method. In this paper we will propose a new algorithm for computing the inverse, based on continues subtract fraction from integer and divide by fraction to obtain integer that will be used to compute the inverse d. The authors claim that the proposed method more efficient and faster than the existed methods.