OpenRaiser/Intern-Atlas huggingface dataset:
A Novel Channel Coding for Progressive Transmission of Medical Images
Venue: arXiv cs.IT 2009
Year: 2009

A novel channel coding scheme for progressive transmission of large images is proposed. The transmission time, low distortion reconstructed image and low complexity are most concerned in this paper. In the case of medical data transmission, it is vital to keep the distortion level under control as in most of the cases certain clinically important regions have to be transmitted without any visible error. The proposed system significantly reduces the transmission time and error. The progressive transmission is based on the process that the input image is decomposed into many subblocks each to be coded, compressed, and transmitted individually. Therefore, firstly the image is segmented into a number of subblocks and then the discrete wavelet transform decomposes each subblock into different time-frequency components. Finally the components are coded for error control and transmitted. The complete system is coded in VHDL. In the proposed system, we choose a 3-level Haar wavelet transform to perform the wavelet transform for each subblock. It is simple, faster and easier to implement when compared with other transform method. The channel coding used here is Hamming code which is a simpler and efficient forward error control code.
Towards Expeditious and Unswerving Routing to Corroborate Nascent Internet
Venue: arXiv cs.NI 2009
Year: 2009

The internet is now-a-days experiencing a stress due to some inherent problems with the main interdomain routing protocol, boarder gateway protocol (BGP), the amount of time it takes to converge, number of update message exchanged followed by a failure to stabilize, the amount of time required to get a valid alternate path following the failure, the way size of routing table increasing, and security issues like integrity and privacy of routing tables and routing updates exchanged among the routers, are of our primary concern. In our proposed research work we plan to address aforementioned issues related to internet routing specially in boarder gateway protocol to enable BGP to offer expeditious unswerving routing to corroborate nascent internet. We plan to make some changes in the design of boarder gateway protocol and may introduce addition of extra features in BGP to help support above mentioned objective.
The Effected Oxide Capacitor in CMOS Structure of Integrated Circuit Level 5 Micrometer Technology
Venue: arXiv cs.OH 2009
Year: 2009

This article is present the effected oxide capacitor in CMOS structure of integrated circuit level 5 micrometer technology. It has designed and basic structure of MOS diode. It establish with aluminum metallization layer by sputtering method, oxide insulator layer mode from silicon dioxide, n+ and p+ semiconductor layer, it has high capacitance concentrate. From the MOS diode structure silicon dioxide thickness 0.5 micrometer, it will get capacitance between aluminum metal layer and p+ semiconductor at 28.62 pF, the capacitance between aluminum metal layer and n+ semiconductor at 29.55 pF. In this article establish second metal layer for measurement density values of first aluminum metal layer with second aluminum metal layer, it has density values at 16 pF.
Network Traffic Management
Venue: arXiv cs.NI 2009
Year: 2009

The purposes of this paper have to discuss issues related to Network Traffic Management. A relatively new category of network management is fast becoming a necessity in converged business Networks. Mid-sized and large organizations are finding they must control network traffic behavior to assure that their strategic applications always get the resources they need to perform optimally. Controlling network traffic requires limiting bandwidth to certain applications, guaranteeing minimum bandwidth to others, and marking traffic with high or low priorities. This exercise is called Network Traffic Management.
Fair Exchange of Digital Signatures using RSA-based CEMBS and Offline STTP
Venue: arXiv cs.CR 2009
Year: 2009

One of the essential security services needed to safeguard online transactions is fair exchange. In fair exchange protocols two parties can exchange their signatures in a fair manner, so that either each party gain the other's signature or no one obtain anything useful. This paper examines security solutions for achieving fair exchange. It proposes new security protocols based on the "Certified Encrypted Message Being Signature" (CEMBS) by using RSA signature scheme. This protocol relies on the help of an "off-line Semi-Trusted Third Party" (STTP) to achieve fairness. They provide with confidential protection from the STTP for the exchanged items by limiting the role and power of the STTP. Three different protocols have been proposed. In the first protocol, the two main parties exchange their signatures on a common message. In the second protocol, the signatures are exchanged on two different messages. While in the third one, the exchange is between confidential data and signature.
Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks
Venue: arXiv cs.IT 2009
Year: 2009

This paper studies the general multi-antenna multiple-relay network. Every two nodes of the network are either connected together through a Rayleigh fading channel or disconnected. We study the ergodic capacity of the network in the high SNR regime. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.
Dynamic routing based on call quality
Venue: arXiv cs.NI 2009
Year: 2009

The telephony over IP (ToIP) is becoming a new trend in technology widely used nowadays in almost all business sectors. Its concepts rely on transiting the telephone communications through the IP network. Today, this technology is deployed increasingly what the cause of emergence of companies is offering this service as Switzernet. For several highly demanded destinations, recently fake vendors appeared in the market offering voice termination but providing only false answer supervision. The answered signal is returned immediately and calls are being charged without being connected. Different techniques are used to keep the calling party on the line. One of these techniques is to play a record of a ring back tone (while the call is already being charged). Another, more sophisticated technique is to play a human voice randomly picked up from a set of records containing contents similar to: hello, hello, I cannot hear you Apart the fact that the fallaciously established calls are charged at rates of real calls, such malicious routes seriously handicap the switching process. The system does not detect a failure on signaling level and is unable to attempt the call via backup routes, the call technically being already connected. Once the call flow falls into such trap, the calls will continue being routed via the fraudulent route until a manual intervention.
Simplex Subdivisions and Nonnegativity Decision of Forms
Venue: arXiv cs.SC 2009
Year: 2009

This paper mainly studies nonnegativity decision of forms based on variable substitutions. Unlike existing research, the paper regards simplex subdivisions as new perspectives to study variable substitutions, gives some subdivisions of the simplex T_n, introduces the concept of convergence of the subdivision sequence, and presents a sufficient and necessary condition for the convergent self-similar subdivision sequence. Then the relationships between subdivisions and their corresponding substitutions are established. Moreover, it is proven that if the form F is indefinite on T_n and the sequence of the successive L-substitution sets is convergent, then the sequence of sets {SLS^(m)(F)} is negatively terminating, and an algorithm for deciding indefinite forms with a counter-example is obtained. Thus, various effective substitutions for deciding positive semi-definite forms and indefinite forms are gained, which are beyond the weighted difference substitutions characterized by "difference".
On successive refinement of diversity for fading ISI channels
Venue: arXiv cs.IT 2009
Year: 2009

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in [12] where high-rate codes were designed so that they have a high-diversity code embedded within them. These diversity embedded codes were investigated for flat fading channels both from an information theoretic viewpoint [5] and from a coding theory viewpoint in [2]. In this paper we explore the use of diversity embedded codes for inter-symbol interference channels. In particular the main result of this paper is that the diversity multiplexing trade-off for fading MISO/SIMO/SISO ISI channels is indeed successively refinable. This implies that for fading ISI channels with a single degree of freedom one can embed a high diversity code within a high rate code without any performance loss (asymptotically). This is related to a deterministic structural observation about the asymptotic behavior of frequency response of channel with respect to fading strength of time domain taps as well as a coding scheme to take advantage of this observation.
Local and Global Trust Based on the Concept of Promises
Venue: arXiv cs.MA 2009
Year: 2009

We use the notion of a promise to define local trust between agents possessing autonomous decision-making. An agent is trustworthy if it is expected that it will keep a promise. This definition satisfies most commonplace meanings of trust. Reputation is then an estimation of this expectation value that is passed on from agent to agent. Our definition distinguishes types of trust, for different behaviours, and decouples the concept of agent reliability from the behaviour on which the judgement is based. We show, however, that trust is fundamentally heuristic, as it provides insufficient information for agents to make a rational judgement. A global trustworthiness, or community trust can be defined by a proportional, self-consistent voting process, as a weighted eigenvector-centrality function of the promise theoretical graph.
Finding the Maximizers of the Information Divergence from an Exponential Family
Venue: arXiv cs.IT 2009
Year: 2009

This paper investigates maximizers of the information divergence from an exponential family $E$. It is shown that the $rI$-projection of a maximizer $P$ to $E$ is a convex combination of $P$ and a probability measure $P_-$ with disjoint support and the same value of the sufficient statistics $A$. This observation can be used to transform the original problem of maximizing $D(\cdot||E)$ over the set of all probability measures into the maximization of a function $\Dbar$ over a convex subset of $\ker A$. The global maximizers of both problems correspond to each other. Furthermore, finding all local maximizers of $\Dbar$ yields all local maximizers of $D(\cdot||E)$. This paper also proposes two algorithms to find the maximizers of $\Dbar$ and applies them to two examples, where the maximizers of $D(\cdot||E)$ were not known before.
Interagir avec un contenu opératique : le projet d'opéra virtuel interactif Virtualis
Venue: arXiv cs.HC 2009
Year: 2009

In this article, we present the interactive opera project on CD-ROM Virtualis. This project includes a scientific dimension as well as artistic. It gave us the opportunity to design a model of the opera performance using formalisms from organization sciences. Moreover, our investigation on interactions between a user and opera contents led us to use models of relationships between entities based on physical forces, where the user is in a way absent. We detail some aspects of a reading but also writing environment on artistic complex contents between text, music and graphics.
Parameterized Modal Satisfiability
Venue: arXiv cs.LO 2009
Year: 2009

We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature, and show that, even though modal satisfiability parameterized by v and the modality depth is FPT, the running time's dependence on the parameters is a tower of exponentials (unless P=NP). To overcome this limitation we propose several possible alternative parameters, namely diamond dimension, box dimension and modal width. We show fixed-parameter tractability results using these measures where the exponential dependence on the parameters is much milder than in the case of modality depth thus leading to FPT algorithms for modal satisfiability with much more reasonable running times.
The Internet's unexploited path diversity
Venue: arXiv cs.NI 2009
Year: 2009

The connectivity of the Internet at the Autonomous System level is influenced by the network operator policies implemented. These in turn impose a direction to the announcement of address advertisements and, consequently, to the paths that can be used to reach back such destinations. We propose to use directed graphs to properly represent how destinations propagate through the Internet and the number of arc-disjoint paths to quantify this network's path diversity. Moreover, in order to understand the effects that policies have on the connectivity of the Internet, numerical analyses of the resulting directed graphs were conducted. Results demonstrate that, even after policies have been applied, there is still path diversity which the Border Gateway Protocol cannot currently exploit.
Intrusion-aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks
Venue: arXiv cs.CR 2009
Year: 2009

Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.
Writer Identification Using Inexpensive Signal Processing Techniques
Venue: arXiv cs.CV 2009
Year: 2009

We propose to use novel and classical audio and text signal-processing and otherwise techniques for "inexpensive" fast writer identification tasks of scanned hand-written documents "visually". The "inexpensive" refers to the efficiency of the identification process in terms of CPU cycles while preserving decent accuracy for preliminary identification. This is a comparative study of multiple algorithm combinations in a pattern recognition pipeline implemented in Java around an open-source Modular Audio Recognition Framework (MARF) that can do a lot more beyond audio. We present our preliminary experimental findings in such an identification task. We simulate "visual" identification by "looking" at the hand-written document as a whole rather than trying to extract fine-grained features out of it prior classification.
On a Model for Integrated Information
Venue: arXiv cs.AI 2009
Year: 2009

In this paper we give a thorough presentation of a model proposed by Tononi et al. for modeling \emph{integrated information}, i.e. how much information is generated in a system transitioning from one state to the next one by the causal interaction of its parts and \emph{above and beyond} the information given by the sum of its parts. We also provides a more general formulation of such a model, independent from the time chosen for the analysis and from the uniformity of the probability distribution at the initial time instant. Finally, we prove that integrated information is null for disconnected systems.
Developing Artificial Herders Using Jason
Venue: arXiv cs.MA 2009
Year: 2009

This paper gives an overview of a proposed strategy for the "Cows and Herders" scenario given in the Multi-Agent Programming Contest 2009. The strategy is to be implemented using the Jason platform, based on the agent-oriented programming language Agent-Speak. The paper describes the agents, their goals and the strategies they should follow. The basis for the paper and for participating in the contest is a new course given in spring 2009 and our main objective is to show that we are able to implement complex multi-agent systems with the knowledge gained in an introductory course on multi-agent systems.
Lexicographic probability, conditional probability, and nonstandard probability
Venue: arXiv cs.GT 2009
Year: 2009

The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is assumed, Popper spaces and a subclass of LPS's are equivalent; without the assumption of countable additivity, the equivalence no longer holds. If the state space is finite, LPS's are equivalent to NPS's. However, if the state space is infinite, NPS's are shown to be more general than LPS's.
Pervasive Service Architecture for a Digital Business Ecosystem
Venue: arXiv cs.CE 2009
Year: 2009

In this paper we present ideas and architectural principles upon which we are basing the development of a distributed, open-source infrastructure that, in turn, will support the expression of business models, the dynamic composition of software services, and the optimisation of service chains through automatic self-organising and evolutionary algorithms derived from biology. The target users are small and medium-sized enterprises (SMEs). We call the collection of the infrastructure, the software services, and the SMEs a Digital Business Ecosystem (DBE).
Quantum mechanics can provide unbiased result
Venue: arXiv cs.CR 2009
Year: 2009

Getting an unbiased result is a remarkably long standing problem of collective observation/measurement. It is pointed out that quantum coin tossing can generate unbiased result defeating dishonesty.
Alphabetic Coding with Exponential Costs
Venue: arXiv cs.IT 2009
Year: 2009

An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing $\sum_{i=1}^n w(i) l(i)$, this variant involves minimizing $\log_a \sum_{i=1}^n w(i) a^{l(i)}$ for a given $a \in (0,1)$. This note introduces a dynamic programming algorithm that finds the optimal solution in polynomial time and space, and shows that methods traditionally used to improve the speed of optimizations in related problems, such as the Hu-Tucker procedure, fail for this problem. This note thus also introduces two approximation algorithms which can find a suboptimal solution in linear time (for one) or $\order(n \log n)$ time (for the other), with associated coding redundancy bounds.
A Prototype for Educational Planning Using Course Constraints to Simulate Student Populations
Venue: arXiv cs.AI 2009
Year: 2009

Distance learning universities usually afford their students the flexibility to advance their studies at their own pace. This can lead to a considerable fluctuation of student populations within a program's courses, possibly affecting the academic viability of a program as well as the related required resources. Providing a method that estimates this population could be of substantial help to university management and academic personnel. We describe how to use course precedence constraints to calculate alternative tuition paths and then use Markov models to estimate future populations. In doing so, we identify key issues of a large scale potential deployment.
Mapping the Object-Role Modeling language ORM2 into Description Logic language DLRifd
Venue: arXiv cs.LO 2009
Year: 2009

In recent years, several efforts have been made to enhance conceptual data modelling with automated reasoning to improve the model's quality and derive implicit information. One approach to achieve this in implementations, is to constrain the language. Advances in Description Logics can help choosing the right language to have greatest expressiveness yet to remain within the decidable fragment of first order logic to realise a workable implementation with good performance using DL reasoners. The best fit DL language appears to be the ExpTime-complete DLRifd. To illustrate trade-offs and highlight features of the modelling languages, we present a precise transformation of the mappable features of the very expressive (undecidable) ORM/ORM2 conceptual data modelling languages to exactly DLRifd. Although not all ORM2 features can be mapped, this is an interesting fragment because it has been shown that DLRifd can also encode UML Class Diagrams and EER, and therefore can foster interoperation between conceptual data models and research into ontological aspects of the modelling languages.
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
Venue: arXiv cs.DS 2009
Year: 2009

We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower bound by Guha and Khuller is 1.463. An algorithm is a {\em ($λ_f$,$λ_c$)-approximation algorithm} if the solution it produces has total cost at most $λ_f \cdot F^* + λ_c \cdot C^*$, where $F^*$ and $C^*$ are the facility and the connection cost of an optimal solution. Our new algorithm, which is a modification of the $(1+2/e)$-approximation algorithm of Chudak and Shmoys, is a (1.6774,1.3738)-approximation algorithm for the UFL problem and is the first one that touches the approximability limit curve $(γ_f, 1+2e^{-γ_f})$ established by Jain, Mahdian and Saberi. As a consequence, we obtain the first optimal approximation algorithm for instances dominated by connection costs. When combined with a (1.11,1.7764)-approximation algorithm proposed by Jain et al., and later analyzed by Mahdian et al., we obtain the overall approximation guarantee of 1.5 for the metric UFL problem. We also describe how to use our algorithm to improve the approximation ratio for the 3-level version of UFL.