OpenRaiser/Intern-Atlas huggingface dataset:
Linear Transceiver Design for a MIMO Interfering Broadcast Channel Achieving Max-Min Fairness
Venue: arXiv cs.IT 2012
Year: 2012

We consider the problem of linear transceiver design to achieve max-min fairness in a downlink MIMO multicell network. This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel (IBC). In this paper we show that when the number of antennas is at least two at each of the transmitters and the receivers, the min rate maximization problem is NP-hard in the number of users. Moreover, we develop a low-complexity algorithm for this problem by iteratively solving a sequence of convex subproblems, and establish its global convergence to a stationary point of the original minimum rate maximization problem. Numerical simulations show that this algorithm is efficient in achieving fairness among all the users.
Behavioral Systel Level Power Consumption Modeling of Mobile Video Streaming applications
Venue: arXiv cs.MM 2012
Year: 2012

Nowadays, the use of mobile applications and terminals faces fundamental challenges related to energy constraint. This is due to the limited battery lifetime as compared to the increasing hardware evolution. Video streaming is one of the most energy consuming applications in a mobile system because of its intensive use of bandwidth, memory and processing power. In this work, we aim to propose a methodology for building and validating a high level global power consumption model including a hardware and software elements. Our approach is based on exploiting the interactions between power consumption sub-models of standalone systems in the perspective to build more accurate global model. The interactions are studied within the exclusive context of video streaming applications that are one of the most used mobile applications.
A Novel Service Oriented Model for Query Identification and Solution Development using Semantic Web and Multi Agent System
Venue: arXiv cs.MA 2012
Year: 2012

In this paper, we propose to develop service model architecture by merging multi-agentsystems and semantic web technology. The proposed architecture works in two stages namely, Query Identification and Solution Development. A person referred to as customer will submit the problem details or requirements which will be referred to as a query. Anyone who can provide a service will need to register with the registrar module of the architecture. Services can be anything ranging from expert consultancy in the field of agriculture to academic research, from selling products to manufacturing goods, from medical help to legal issues or even providing logistics. Query submitted by customer is first parsed and then iteratively understood with the help of domain experts and the customer to get a precise set of properties. Query thus identified will be solved again with the help of intelligent agent systems which will search the semantic web for all those who can find or provide a solution. A workable solution workflow is created and then depending on the requirements, using the techniques of negotiation or auctioning, solution is implemented to complete the service for customer. This part is termed as solution development. In this service oriented architecture, we first try to analyze the complex set of user requirements then try to provide best possible solution in an optimized way by combining better information searches through semantic web and better workflow provisioning using multi agent systems.
A Hardware Time Manager Implementation for the Xenomai Real-Time Kernel of Embedded Linux
Venue: arXiv cs.OS 2012
Year: 2012

Nowadays, the use of embedded operating systems in different embedded projects is subject to a tremendous growth. Embedded Linux is becoming one of those most popular EOSs due to its modularity, efficiency, reliability, and cost. One way to make it hard real-time is to include a real-time kernel like Xenomai. One of the key characteristics of a Real-Time Operating System (RTOS) is its ability to meet execution time deadlines deterministically. So, the more precise and flexible the time management can be, the better it can handle efficiently the determinism for different embedded applications. RTOS time precision is characterized by a specific periodic interrupt service controlled by a software time manager. The smaller the period of the interrupt, the better the precision of the RTOS, the more it overloads the CPU, and though reduces the overall efficiency of the RTOS. In this paper, we propose to drastically reduce these overheads by migrating the time management service of Xenomai into a configurable hardware component to relieve the CPU. The hardware component is implemented in a Field Programmable Gate Array coupled to the CPU. This work was achieved in a Master degree project where students could apprehend many fields of embedded systems: RTOS programming, hardware design, performance evaluation, etc.
Parameterised Multiparty Session Types
Venue: arXiv cs.LO 2012
Year: 2012

For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. This paper proposes a dependent type theory for multiparty sessions which can statically guarantee type-safe, deadlock-free multiparty interactions among processes whose specifications are parameterised by indices. We use the primitive recursion operator from Gödel's System T to express a wide range of communication patterns while keeping type checking decidable. To type individual distributed processes, a parameterised global type is projected onto a generic generator which represents a class of all possible end-point types. We prove the termination of the type-checking algorithm in the full system with both multiparty session types and recursive types. We illustrate our type theory through non-trivial programming and verification examples taken from parallel algorithms and Web services usecases.
False-name-proofness with Bid Withdrawal
Venue: arXiv cs.GT 2012
Year: 2012

We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have been decided, withdraw some of her false-name identities (have some of her false-name identities refuse to pay). While these withdrawn identities will not obtain the items they won, their initial presence may have been beneficial to the agent's other identities. We define a mechanism to be false-name-proof with withdrawal (FNPW) if the aforementioned manipulation is never beneficial. FNPW is a stronger condition than false-name-proofness (FNP).
Compensation of IQ-Imbalance and Phase Noise in MIMO-OFDM Systems
Venue: arXiv cs.IT 2012
Year: 2012

The degrading effect of RF impairments on the performance of wireless communication systems is more pronounced in MIMO-OFDM transmission. Two of the most common impairments that significantly limit the performance of MIMO-OFDM transceivers are IQ-imbalance and phase noise. Low-complexity estimation and compensation techniques that can jointly remove the effect of these impairments are highly desirable. In this paper, we propose a simple joint estimation and compensation technique to estimate channel, phase noise and IQ-imbalance parameters in MIMO-OFDM systems under multipath slow fading channels. A subcarrier multiplexed preamble structure to estimate the channel and impairment parameters with minimum overhead is introduced and used in the estimation of IQ-imbalance parameters as well as the initial estimation of effective channel matrix including common phase error (CPE). We then use a novel tracking method based on the second order statistics of the inter-carrier interference (ICI) and noise to update the effective channel matrix throughout an OFDM frame. Simulation results for a variety of scenarios show that the proposed low-complexity estimation and compensation technique can efficiently improve the performance of MIMO-OFDM systems in terms of bit-error-rate (BER).
Evaluation of some Information Retrieval models for Gujarati Ad hoc Monolingual Tasks
Venue: arXiv cs.IR 2012
Year: 2012

This paper describes the work towards Gujarati Ad hoc Monolingual Retrieval task for widely used Information Retrieval (IR) models. We present an indexing baseline for the Gujarati Language represented by Mean Average Precision (MAP) values. Our objective is to obtain a relative picture of a better IR model for Gujarati Language. Results show that Classical IR models like Term Frequency Inverse Document Frequency (TF_IDF) performs better when compared to few recent probabilistic IR models. The experiments helped to identify the outperforming IR models for Gujarati Language.
Reachability Analysis of Communicating Pushdown Systems
Venue: arXiv cs.LO 2012
Year: 2012

The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem restricted to eager runs (i.e., runs where messages are either received immediately after being sent, or never received). The problem is EXPTIME-complete in the decidable case. The second result is a doubly exponential time algorithm for bounded context analysis in this setting, together with a matching lower bound. Both results extend and improve previous work from La Torre et al.
The expressiveness of MTL with counting
Venue: arXiv cs.LO 2012
Year: 2012

It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times in the next time interval. We show that MTL with the counting modalities, MTL+C, is expressively complete for FO(<,+1). This result strongly supports the assertion of Hirshfeld and Rabinovich that Q2MLO is the most expressive decidable fragments of FO(<,+1).
Optimal Coordinated Beamforming in the Multicell Downlink with Transceiver Impairments
Venue: arXiv cs.IT 2012
Year: 2012

Physical wireless transceivers suffer from a variety of impairments that distort the transmitted and received signals. Their degrading impact is particularly evident in modern systems with multiuser transmission, high transmit power, and low-cost devices, but their existence is routinely ignored in the optimization literature for multicell transmission. This paper provides a detailed analysis of coordinated beamforming in the multicell downlink. We solve two optimization problems under a transceiver impairment model and derive the structure of the optimal solutions. We show numerically that these solutions greatly reduce the impact of impairments, compared with beamforming developed for ideal transceivers. Although the so-called multiplexing gain is zero under transceiver impairments, we show that the gain of multiplexing can be large at practical SNRs.
Force-Directed Graph Drawing Using Social Gravity and Scaling
Venue: arXiv cs.CG 2012
Year: 2012

Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in force-directed layouts, together with a scaling technique, to produce drawings of trees and forests, as well as more complex social networks. Social gravity assigns mass to vertices in proportion to their network centrality, which allows vertices that are more graph-theoretically central to be visualized in physically central locations. Scaling varies the gravitational force throughout the simulation, and reduces crossings relative to unscaled gravity. In addition to providing this algorithmic framework, we apply our algorithms to social networks produced by Mark Lombardi, and we show how social gravity can be incorporated into force-directed Lombardi-style drawings.
Improving the K-means algorithm using improved downhill simplex search
Venue: arXiv cs.LG 2012
Year: 2012

The k-means algorithm is one of the well-known and most popular clustering algorithms. K-means seeks an optimal partition of the data by minimizing the sum of squared error with an iterative optimization procedure, which belongs to the category of hill climbing algorithms. As we know hill climbing searches are famous for converging to local optimums. Since k-means can converge to a local optimum, different initial points generally lead to different convergence cancroids, which makes it important to start with a reasonable initial partition in order to achieve high quality clustering solutions. However, in theory, there exist no efficient and universal methods for determining such initial partitions. In this paper we tried to find an optimum initial partitioning for k-means algorithm. To achieve this goal we proposed a new improved version of downhill simplex search, and then we used it in order to find an optimal result for clustering approach and then compare this algorithm with Genetic Algorithm base (GA), Genetic K-Means (GKM), Improved Genetic K-Means (IGKM) and k-means algorithms.
A Linear Category of Polynomial Diagrams
Venue: arXiv cs.LO 2012
Year: 2012

We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally cartesian closed category, whereas the additive (product and coproduct) and exponential Tensor-comonoid comonad) structures require additional properties and are only developed in the category Set, where the objects and morphisms have natural interpretations in terms of games, simulation and strategies.
Teaching cloud computing: a software engineering perspective
Venue: arXiv cs.DC 2012
Year: 2012

This short papers discusses the issues of teaching cloud computing from a software engineering rather than a business perspective. It discusses what topics might be covered in a senior course on cloud software engineering.
Edge-colouring eight-regular planar graphs
Venue: arXiv cs.DM 2012
Year: 2012

It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\le 7$, by various authors. Here we prove it for $d = 8$.
FCM Based Blood Vessel Segmentation Method for Retinal Images
Venue: arXiv cs.CV 2012
Year: 2012

Segmentation of blood vessels in retinal images provides early diagnosis of diseases like glaucoma, diabetic retinopathy and macular degeneration. Among these diseases occurrence of Glaucoma is most frequent and has serious ocular consequences that can even lead to blindness, if it is not detected early. The clinical criteria for the diagnosis of glaucoma include intraocular pressure measurement, optic nerve head evaluation, retinal nerve fiber layer and visual field defects. This form of blood vessel segmentation helps in early detection for ophthalmic diseases, and potentially reduces the risk of blindness. The low-contrast images at the retina owing to narrow blood vessels of the retina are difficult to extract. These low contrast images are, however useful in revealing certain systemic diseases. Motivated by the goals of improving detection of such vessels, this present work proposes an algorithm for segmentation of blood vessels and compares the results between expert ophthalmologist hand-drawn ground-truths and segmented image(i.e. the output of the present work).Sensitivity, specificity, positive predictive value (PPV), positive likelihood ratio (PLR) and accuracy are used to evaluate overall performance.It is found that this work segments blood vessels successfully with sensitivity, specificity, PPV, PLR and accuracy of 99.62%, 54.66%, 95.08%, 219.72 and 95.03%, respectively.
Correctness of an Incremental and Worst-Case Optimal Decision Procedure for Modal Logic with Eventualities
Venue: arXiv cs.LO 2012
Year: 2012

We present a simple theory explaining the construction and the correctness of an incremental and worst-case optimal decision procedure for modal logic with eventualities. The procedure gives an abstract account of important aspects of Goré and Widmann's PDL prover. Starting from an input formula, the procedure grows a Pratt-style graph tableau until the tableau proves or disproves the satisfiability of the formula. The procedure provides a basis for practical provers since satisfiability and unsatisfiability of formulas can often be determined with small tableaux.
Input Scheme for Hindi Using Phonetic Mapping
Venue: arXiv cs.CL 2012
Year: 2012

Written Communication on Computers requires knowledge of writing text for the desired language using Computer. Mostly people do not use any other language besides English. This creates a barrier. To resolve this issue we have developed a scheme to input text in Hindi using phonetic mapping scheme. Using this scheme we generate intermediate code strings and match them with pronunciations of input text. Our system show significant success over other input systems available.
The frog and the octopus: a conceptual model of software development
Venue: arXiv cs.SE 2012
Year: 2012

We propose a conceptual model of software development that encompasses all approaches: traditional or agile, light and heavy, for large and small development efforts. The model identifies both the common aspects in all software development, i.e., elements found in some form or another in each and every software development project (Intent, Product, People, Work, Time, Quality, Risk, Cost, Value), as well as the variable part, i.e., the main factors that cause the very wide variations we can find in the software development world (Size, Age, Criticality, Architecture stability, Business model, Governance, Rate of change, Geographic distribution). We show how the model can be used as an explanatory theory of software development, as a tool for analysis of practices, techniques, processes, as the basis for curriculum design or for software process adoption and improvement, and to support empirical research on software development methods. This model is also proposed as a way to depolarize the debate on agile methods versus the rest-of-the-world: a unified model.
Challenges and Directions for Engineering Multi-agent Systems
Venue: arXiv cs.MA 2012
Year: 2012

In this talk I review where we stand regarding the engineering of multi-agent systems. There is both good news and bad news. The good news is that over the past decade we've made considerable progress on techniques for engineering multi-agent systems: we have good, usable methodologies, and mature tools. Furthermore, we've seen a wide range of demonstrated applications, and have even begun to quantify the advantages of agent technology. However, industry involvement in AAMAS appears to be declining (as measured by industry sponsorship of the conference), and industry affiliated attendants at AAMAS 2012 were few (1-2%). Furthermore, looking at the applications of agents being reported at recent AAMAS, usage of Agent Oriented Software Engineering (AOSE) and of Agent Oriented Programming Languages (AOPLs) is quite limited. This observation is corroborated by the results of a 2008 survey by Frank and Virginia Dignum. Based on these observations, I make five recommendations: (1) Re-engage with industry; (2) Stop designing AOPLs and AOSE methodologies ... and instead ... (3) Move to the "macro" level: develop techniques for designing and implementing interaction, integrate micro (single cognitive agent) and macro (MAS) design and implementation; (4) Develop techniques for the Assurance of MAS; and (5) Re-engage with the US.
Sensitivity and block sensitivity of nested canalyzing function
Venue: arXiv cs.DM 2012
Year: 2012

Based on a recent characterization of nested canalyzing function (NCF), we obtain the formula of the sensitivity of any NCF. Hence we find that any sensitivity of NCF is between $\frac{n+1}{2}$ and $n$. Both lower and upper bounds are tight. We prove that the block sensitivity, hence the $l$-block sensitivity, is same to the sensitivity. It is well known that monotone function also has this property. We eventually find all the functions which are both monotone and nested canalyzing (MNCF). The cardinality of all the MNCF is also provided.
Policy based intrusion detection and response system in hierarchical WSN architecture
Venue: arXiv cs.CR 2012
Year: 2012

In recent years, wireless sensor network becomes popular both in civil and military jobs. However, security is one of the significant challenges for sensor network because of their deployment in open and unprotected environment. As cryptographic mechanism is not enough to protect sensor network from external attacks, intrusion detection system (IDS) needs to be introduced. In this paper we propose a policy based IDS for hierarchical architecture that fits the current demands and restrictions of wireless ad hoc sensor network. In this proposed IDS architecture we followed clustering mechanism to build four level hierarchical network which enhance network scalability to large geographical area and use both anomaly and misuse detection techniques for intrusion detection that concentrates on power saving of sensor nodes by distributing the responsibility of intrusion detection among different layers. We also introduce a policy based intrusion response system for hierarchical architecture.
Irregular Bipolar Fuzzy Graphs
Venue: arXiv cs.DM 2012
Year: 2012

In this paper, we define irregular bipolar fuzzy graphs and its various classifications. Size of regular bipolar fuzzy graphs is derived. The relation between highly and neighbourly irregular bipolar fuzzy graphs are established. Some basic theorems related to the stated graphs have also been presented.
Parametric Constructive Kripke-Semantics for Standard Multi-Agent Belief and Knowledge (Knowledge As Unbiased Belief)
Venue: arXiv cs.LO 2012
Year: 2012

We propose parametric constructive Kripke-semantics for multi-agent KD45-belief and S5-knowledge in terms of elementary set-theoretic constructions of two basic functional building blocks, namely bias (or viewpoint) and visibility, functioning also as the parameters of the doxastic and epistemic accessibility relation. The doxastic accessibility relates two possible worlds whenever the application of the composition of bias with visibility to the first world is equal to the application of visibility to the second world. The epistemic accessibility is the transitive closure of the union of our doxastic accessibility and its converse. Therefrom, accessibility relations for common and distributed belief and knowledge can be constructed in a standard way. As a result, we obtain a general definition of knowledge in terms of belief that enables us to view S5-knowledge as accurate (unbiased and thus true) KD45-belief, negation-complete belief and knowledge as exact KD45-belief and S5-knowledge, respectively, and perfect S5-knowledge as precise (exact and accurate) KD45-belief, and all this generically for arbitrary functions of bias and visibility. Our results can be seen as a semantic complement to previous foundational results by Halpern et al. about the (un)definability and (non-)reducibility of knowledge in terms of and to belief, respectively.