OpenRaiser/Intern-Atlas huggingface dataset:
Cognitive Routing with Stretched Network Awareness through Hidden Markov Model Learning at Router Level
Venue: arXiv cs.NI 2010
Year: 2010

The routing of packets are generally performed based on the destination address and forward link channel available from the instantaneous Router without sufficient cognizance of either the performance of the forward Router or forward channel characteristics. The lack of awareness of forward channel property can lead to packet loss or delayed delivery leading to multipleretransmissions or routing to an underperforming pathway. This paper describes an application of Cognitive Network to improve the network performance by implementing a Hidden Markov Model (HMM) algorithm for learning and predicting the performance of surrounding routers continuously while a routing demand is initiated. The cognition segment/domain of every router can gain knowledge about the quality of forward network. The information of the current network conditions is shared between routers by the Forward Channel Performance Index FCPI. This enables complete cognition of surroundings and efficient delivery of messages in various paradigms of performance
Application of Artificial Neural Networks in Aircraft Maintenance, Repair and Overhaul Solutions
Venue: arXiv cs.NE 2010
Year: 2010

This paper reviews application of Artificial Neural Networks in Aircraft Maintenance, Repair and Overhaul (MRO). MRO solutions are designed to facilitate the authoring and delivery of maintenance and repair information to the line maintenance technicians who need to improve aircraft repair turn around time, optimize the efficiency and consistency of fleet maintenance and ensure regulatory compliance. The technical complexity of aircraft systems, especially in avionics, has increased to the point at which it poses a significant troubleshotting and repair challenge for MRO personnel. As per the existing scenario, the MRO systems in place are inefficient. In this paper, we propose the centralization and integration of the MRO database to increase its efficiency. Moreover the implementation of Artificial Neural Networks in this system can rid the system of many of its deficiencies. In order to make the system more efficient we propose to integrate all the modules so as to reduce the efficacy of repair.
Multicast Transmission Prefix and Popularity Aware Interval Caching Based Admission Control Policy
Venue: arXiv cs.MM 2010
Year: 2010

Admission control is a key component in multimedia servers, which will allow the resources to be used by the client only when they are available. A problem faced by numerous content serving machines is overload, when there are too many clients who need to be served, the server tends to slow down. An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. By caching and streaming only the data in the interval between two successive requests on the same object, the following request can be serviced directly from the buffer cache without disk operations and within the deadline of the request. An admission control strategy based on Popularity-aware interval caching for Prefix [3] scheme extends the interval caching by considering different popularity of multimedia objects. The method of Prefix caching with multicast transmission of popular objects utilizes the hard disk and network bandwidth efficiently and increases the number of requests being served.
Relaxation Control of Packet Arrival Rate in the Neighborhood of the Destination in Concentric Sensor Networks
Venue: arXiv cs.NI 2010
Year: 2010

One of the challenges in the wireless sensor applications which are gaining much attention is the real-time transmission of continuous data packets across the network. Though advances in communication in sensor networks are providing guaranteed quality data packet delivery they still have some drawbacks. One such drawback is transmission of incessant data packets over high speed networks. Here in this paper we have designed a concentric sensor network having buffer just not at the sink but also in selected intermediate nodes to minimize the packet loss caused due to congestion. This approach results in haggle congestion and less packet loss in the designed network.
Combinatorial Bounds and Characterizations of Splitting Authentication Codes
Venue: arXiv cs.CR 2010
Year: 2010

We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.
Secret Key Establishment over a Pair of Independent Broadcast Channels
Venue: arXiv cs.IT 2010
Year: 2010

This paper considers the problem of information-theoretic Secret Key Establishment (SKE) in the presence of a passive adversary, Eve, when Alice and Bob are connected by a pair of independent discrete memoryless broadcast channels in opposite directions. We refer to this setup as 2DMBC. We define the secret-key capacity in the 2DMBC setup and prove lower and upper bounds on this capacity. The lower bound is achieved by a two-round SKE protocol that uses a two-level coding construction. We show that the lower and the upper bounds coincide in the case of degraded DMBCs.
Defect Prevention Approaches in Medium Scale it Enterprises
Venue: arXiv cs.SE 2010
Year: 2010

The software industry is successful, if it can draw the complete attention of the customers towards it. This is achievable if the organization can produce a high quality product. To identify a product to be of high quality, it should be free of defects, should be capable of producing expected results. It should be delivered in an estimated cost, time and be maintainable with minimum effort. Defect Prevention is the most critical but often neglected component of the software quality assurance in any project. If applied at all stages of software development, it can reduce the time, cost and resources required to engineer a high quality product.
Spreadsheet good practice: is there any such thing?
Venue: arXiv cs.HC 2010
Year: 2010

Various techniques for developing spreadsheet models greatly improve the chance that the end result will not contain basic mechanical errors. However, for every discipline in which a given technique is useful, there is likely to be another in which the same technique works badly. As a result, the author urges that EuSpRIG does not succumb to internal or external pressures to champion a particular set of "best practices", because no such set is optimal in all spreadsheet applications.
A Minimal Propositional Type Theory
Venue: arXiv cs.LO 2010
Year: 2010

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for denotational and deductive completeness. Denotational completeness means that every value of the full set-theoretic type hierarchy can be described by a closed term. Deductive completeness is shown for a sequent-based proof system that extends a propositional natural deduction system with lambda conversion and Boolean replacement.
Hamming Code for Multiple Sources
Venue: arXiv cs.IT 2010
Year: 2010

We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. We then introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect SW coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for a perfect SW code with sufficiently long code length, the compression rates of different sources can be trade-off flexibly. Finally, we relax the construction procedure of HCMS and call the resulting code generalized HCMS. We prove that every perfect SW code for Hamming sources is equivalent to a generalized HCMS.
Self-Checks In Spreadsheets: A Survey Of Current Practice
Venue: arXiv cs.SE 2010
Year: 2010

A common application of spreadsheets is the development of models that deliver projections of the future financial statements of companies established to pursue ventures that are subject to project financing. A survey of 11 such spreadsheets prepared by a range of organisations shows that the amount of self-testing included in such models ranges between one formula of testing for each three formulae of calculation, down to essentially no self-testing at all.
Authentication and Authorization in Server Systems for Bio-Informatics
Venue: arXiv cs.CR 2010
Year: 2010

Authentication and authorization are two tightly coupled and interrelated concepts which are used to keep transactions secure and help in protecting confidential information. This paper proposes to evaluate the current techniques used for authentication and authorization also compares them with the best practices and universally accepted authentication and authorization methods. Authentication verifies user identity and provides reusable credentials while authorization services stores information about user access levels. These mechanisms by which a system checks what level of access a particular authenticated user should have to view secure resources is controlled by the system
On the solvability of 3-source 3-terminal sum-networks
Venue: arXiv cs.IT 2010
Year: 2010

We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field $F$ and each terminal wants to receive the sum (over $F$) of the source symbols. Each link in the network is considered to be error-free and delay-free and can carry one symbol from the field in each use. We call such a network a 3-source 3-terminal {\it $(3s/3t)$ sum-network}. In this paper, we give a necessary and sufficient condition for a $3s/3t$ sum-network to allow all the terminals to receive the sum of the source symbols over \textit{any} field. Some lemmas provide interesting simpler sufficient conditions for the same. We show that linear codes are sufficient for this problem for $3s/3t$ though they are known to be insufficient for arbitrary number of sources and terminals. We further show that in most cases, such networks are solvable by simple XOR coding. We also prove a recent conjecture that if fractional coding is allowed, then the coding capacity of a $3s/3t$ sum-network is either $0,2/3$ or $\geq 1$.
SVM-based Multiview Face Recognition by Generalization of Discriminant Analysis
Venue: arXiv cs.CV 2010
Year: 2010

Identity verification of authentic persons by their multiview faces is a real valued problem in machine vision. Multiview faces are having difficulties due to non-linear representation in the feature space. This paper illustrates the usability of the generalization of LDA in the form of canonical covariate for face recognition to multiview faces. In the proposed work, the Gabor filter bank is used to extract facial features that characterized by spatial frequency, spatial locality and orientation. Gabor face representation captures substantial amount of variations of the face instances that often occurs due to illumination, pose and facial expression changes. Convolution of Gabor filter bank to face images of rotated profile views produce Gabor faces with high dimensional features vectors. Canonical covariate is then used to Gabor faces to reduce the high dimensional feature spaces into low dimensional subspaces. Finally, support vector machines are trained with canonical sub-spaces that contain reduced set of features and perform recognition task. The proposed system is evaluated with UMIST face database. The experiment results demonstrate the efficiency and robustness of the proposed system with high recognition rates.
Generic design of Chinese remaindering schemes
Venue: arXiv cs.SC 2010
Year: 2010

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then show that this design enables many different forms of Chinese remaindering (e.g. deterministic, early terminated, distributed, etc.), easy comparisons between these forms and e.g. user-transparent parallelism at different parallel grains.
Review and Analysis of Local Multipoint Distribution System (LMDS) to Deliver Voice, Data, Internet, and Video Services
Venue: arXiv cs.NI 2010
Year: 2010

Local multipoint distribution system (LMDS) uses cellular-like network architecture of microwave radios placed at the client's location and at the company's base station to deliver fixed services, mainly telephony, video and Internet access. The use of time-division multiple access (TDMA) and FDMA (frequency DMA) technology allows multiple customers within a 3-5 mile coverage radius to share the same radio channel. Customers can receive data rates between 64kbps to 155Mbps. LMDS was conceived as a broadband, fixed wireless, point-to-multipoint technology for utilization in the last mile. Throughput capacity and reliable distance of the link depends on common radio link constraints and the modulation method used - either phase-shift keying or amplitude modulation. In general deployment links of up to 5 miles (8 km) from the base station are possible, but distance is typically limited to about 1.5 miles due to rain fading attenuation constraints. Point-to-point systems are also capable of using the LMDS frequencies and can reach slightly farther distances due to increased antenna gain.LMDS uses a scalable architecture combined with industry standards to ensure service can be expanded as customer demand increases.
Review and Analysis of The Issues of Unified Modeling Language for Visualizing, Specifying, Constructing and Documenting the Artifacts of a Software-Intensive System
Venue: arXiv cs.SE 2010
Year: 2010

The UML allows us to specify models in a precise, complete and unambiguous manner. In particular, the UML addresses the specification of all important decisions regarding analysis, design and implementation. Although UML is not a visual programming language, its models can be directly connected to a vast variety of programming languages. This enables a dual approach to software development: the developer has a choice as to the means of input. UML can be used directly, from which code can be generated; or on the other hand, that which is best expressed as text can be entered into the program as code. In an ideal world, the UML tool will be able to reverse-engineer any direct changes to code and the UML representations will be kept in sync with the code. However, without human intervention this is not always possible. There are certain elements of information that are lost when moving from models to code. Even then, there are certain aspects of programming language code do seem to preserve more of their semantics and therefore permits automatic reverse-engineering of code back to a subset of the UML models.
Studying the Feasibility and Importance of Software Testing: An Analysis
Venue: arXiv cs.SE 2010
Year: 2010

Software testing is a critical element of software quality assurance and represents the ultimate review of specification, design and coding. Software testing is the process of testing the functionality and correctness of software by running it. Software testing is usually performed for one of two reasons: defect detection, and reliability estimation. The problem of applying software testing to defect detection is that software can only suggest the presence of flaws, not their absence (unless the testing is exhaustive). The problem of applying software testing to reliability estimation is that the input distribution used for selecting test cases may be flawed. The key to software testing is trying to find the modes of failure - something that requires exhaustively testing the code on all possible inputs. Software Testing, depending on the testing method employed, can be implemented at any time in the development process.
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
Venue: arXiv cs.LO 2010
Year: 2010

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite family, have an easier satisfiability problem; sometimes it is even tractable. All these fragments restrict the use of Boolean operators in one way or another. We look at systematic and more general restrictions of the Boolean operators and establish the complexity of the concept satisfiability problem in the presence of axioms. We separate tractable from intractable cases.
Thermodynamic properties of finite binary strings
Venue: arXiv cs.IT 2010
Year: 2010

Thermodynamic properties such as temperature, pressure, and internal energy have been defined for finite binary strings from equilibrium distribution of a chosen computable measure. It is demonstrated a binary string can be associated with one-dimensional gas of quasi-particles of certain mass, momentum, and energy.
Sentence Simplification Aids Protein-Protein Interaction Extraction
Venue: arXiv cs.CL 2010
Year: 2010

Accurate systems for extracting Protein-Protein Interactions (PPIs) automatically from biomedical articles can help accelerate biomedical research. Biomedical Informatics researchers are collaborating to provide metaservices and advance the state-of-art in PPI extraction. One problem often neglected by current Natural Language Processing systems is the characteristic complexity of the sentences in biomedical literature. In this paper, we report on the impact that automatic simplification of sentences has on the performance of a state-of-art PPI extraction system, showing a substantial improvement in recall (8%) when the sentence simplification method is applied, without significant impact to precision.
On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields
Venue: arXiv cs.IT 2010
Year: 2010

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum $\sum_{c\in \mathbb{F}_{q^s}}χ^{(s)}(f(x))$. Let $a$ and $b$ be two elements in $\mathbb{F}_q$ with $a\neq 0$, $u$ be a positive integer. We obtain an estimate for the exponential sum $\sum_{c\in \mathbb{F}^*_{q^s}}χ^{(s)}(ac^u+bc^{-1})$, where $χ^{(s)}$ is the lifting of an additive character $χ$ of $\mathbb{F}_q$. Some properties of the sequences constructed from these exponential sums are provided also.
An Enumerative Method for Encoding Spectrum Shaped Binary Run-Length Constrained Sequences
Venue: arXiv cs.IT 2010
Year: 2010

A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence relations for calculating the number of these sequences are derived. Implementation of encoding and decoding procedures is also shown.
Implicit media frames: Automated analysis of public debate on artificial sweeteners
Venue: arXiv cs.IR 2010
Year: 2010

The framing of issues in the mass media plays a crucial role in the public understanding of science and technology. This article contributes to research concerned with diachronic analysis of media frames by making an analytical distinction between implicit and explicit media frames, and by introducing an automated method for analysing diachronic changes of implicit frames. In particular, we apply a semantic maps method to a case study on the newspaper debate about artificial sweeteners, published in The New York Times (NYT) between 1980 and 2006. Our results show that the analysis of semantic changes enables us to filter out the dynamics of implicit frames, and to detect emerging metaphors in public debates. Theoretically, we discuss the relation between implicit frames in public debates and codification of information in scientific discourses, and suggest further avenues for research interested in the automated analysis of frame changes and trends in public debates.
Convex Feasibility Methods for Compressed Sensing
Venue: arXiv cs.IT 2010
Year: 2010

We present a computationally-efficient method for recovering sparse signals from a series of noisy observations, known as the problem of compressed sensing (CS). CS theory requires solving a convex constrained minimization problem. We propose to transform this optimization problem into a convex feasibility problem (CFP), and solve it using subgradient projection methods, which are iterative, fast, robust and convergent schemes for solving CFPs. As opposed to some of the recently-introduced CS algorithms, such as Bayesian CS and gradient projections for sparse reconstruction, which become inefficient as the problem dimension and sparseness degree increase, the newly-proposed methods exhibit a marked robustness with respect to these factors. This renders the subgradient projection methods highly viable for large-scale compressible scenarios.
A Formal Framework of Virtual Organisations as Agent Societies
Venue: arXiv cs.LO 2010
Year: 2010

We propose a formal framework that supports a model of agent-based Virtual Organisations (VOs) for service grids and provides an associated operational model for the creation of VOs. The framework is intended to be used for describing different service grid applications based on multiple agents and, as a result, it abstracts away from any realisation choices of the service grid application, the agents involved to support the applications and their interactions. Within the proposed framework VOs are seen as emerging from societies of agents, where agents are abstractly characterised by goals and roles they can play within VOs. In turn, VOs are abstractly characterised by the agents participating in them with specific roles, as well as the workflow of services and corresponding contracts suitable for achieving the goals of the participating agents. We illustrate the proposed framework with an earth observation scenario.
Structure and Behaviour of Virtual Organisation Breeding Environments
Venue: arXiv cs.SE 2010
Year: 2010

This paper provides an outline of a formal approach that we are developing for modelling Virtual Organisations (VOs) and their Breeding Environments (VBEs). We propose different levels of representation for the functional structures and processes that VBEs and VOs involve, which are independent of the specificities of the infrastructures (organisational and technical) that support the functioning of VBEs. This allows us to reason about properties of tasks performed within VBEs and services provided through VOs without committing to the way in which they are implemented.