id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0604082 | Energy-Efficient Power and Rate Control with QoS Constraints: A
Game-Theoretic Approach | cs.IT math.IT | A game-theoretic model is proposed to study the cross-layer problem of joint
power and rate control with quality of service (QoS) constraints in
multiple-access networks. In the proposed game, each user seeks to choose its
transmit power and rate in a distributed manner in order to maximize its own
utility and at the... |
cs/0604083 | Optimum Asymptotic Multiuser Efficiency of Pseudo-Orthogonal Randomly
Spread CDMA | cs.IT math.IT | A $K$-user pseudo-orthogonal (PO) randomly spread CDMA system, equivalent to
transmission over a subset of $K'\leq K$ single-user Gaussian channels, is
introduced. The high signal-to-noise ratio performance of the PO-CDMA is
analyzed by rigorously deriving its asymptotic multiuser efficiency (AME) in
the large system... |
cs/0604085 | Information in Quantum Description and Gate Implementation | cs.IT math.IT | This note considers Kak's observer-reference model of quantum information,
where it is shown that qubits carry information that is sqrt n / ln n times
classical information, where n is the number of components in the measurement
system, to analyze information processing in quantum gates. The obverse side of
this expo... |
cs/0604086 | A Knowledge-Based Approach for Selecting Information Sources | cs.AI | Through the Internet and the World-Wide Web, a vast number of information
sources has become available, which offer information on various subjects by
different providers, often in heterogeneous formats. This calls for tools and
methods for building an advanced information-processing infrastructure. One
issue in this... |
cs/0604087 | Probabilistic Automata for Computing with Words | cs.AI cs.CL | Usually, probabilistic automata and probabilistic grammars have crisp symbols
as inputs, which can be viewed as the formal models of computing with values.
In this paper, we first introduce probabilistic automata and probabilistic
grammars for computing with (some special) words in a probabilistic framework,
where th... |
cs/0604090 | Simplicial models of social aggregation I | cs.CE | This paper presents the foundational ideas for a new way of modeling social
aggregation. Traditional approaches have been using network theory, and the
theory of random networks. Under that paradigm, every social agent is
represented by a node, and every social interaction is represented by a segment
connecting two n... |
cs/0604091 | Robust Distributed Source Coding | cs.IT math.IT | We consider a distributed source coding system in which several observations
are communicated to the decoder using limited transmission rate. The
observations must be separately coded. We introduce a robust distributed coding
scheme which flexibly trades off between system robustness and compression
efficiency. The o... |
cs/0604092 | Optimal and Suboptimal Finger Selection Algorithms for MMSE Rake
Receivers in Impulse Radio UWB Systems | cs.IT math.IT | The problem of choosing the optimal multipath components to be employed at a
minimum mean square error (MMSE) selective Rake receiver is considered for an
impulse radio ultra-wideband system. First, the optimal finger selection
problem is formulated as an integer programming problem with a non-convex
objective functi... |
cs/0604093 | Perfect Space Time Block Codes | cs.IT math.IT | In this paper, we introduce the notion of perfect space-time block codes
(STBC). These codes have full rate, full diversity, non-vanishing constant
minimum determinant for increasing spectral efficiency, uniform average
transmitted energy per antenna and good shaping. We present algebraic
constructions of perfect STB... |
cs/0604094 | A Fast and Accurate Nonlinear Spectral Method for Image Recognition and
Registration | cs.DC cond-mat.stat-mech cs.CG cs.CV | This article addresses the problem of two- and higher dimensional pattern
matching, i.e. the identification of instances of a template within a larger
signal space, which is a form of registration. Unlike traditional correlation,
we aim at obtaining more selective matchings by considering more strict
comparisons of g... |
cs/0604098 | Achievable Rates for the Multiple Access Channel with Feedback and
Correlated Sources | cs.IT math.IT | In this paper, we investigate achievable rates on the multiple access channel
with feedback and correlated sources (MACFCS). The motivation for studying the
MACFCS stems from the fact that in a sensor network, sensors collect and
transmit correlated data to a common sink. We derive two achievable rate
regions for the... |
cs/0604099 | Myopic Coding in Wireless Networks | cs.IT math.IT | We investigate the achievable rate of data transmission from sources to sinks
through a multiple-relay network. We study achievable rates for omniscient
coding, in which all nodes are considered in the coding design at each node. We
find that, when maximizing the achievable rate, not all nodes need to
``cooperate'' w... |
cs/0604102 | HCI and Educational Metrics as Tools for VLE Evaluation | cs.HC cs.LG | The general set of HCI and Educational principles are considered and a
classification system constructed. A frequency analysis of principles is used
to obtain the most significant set. Metrics are devised to provide objective
measures of these principles and a consistent testing regime devised. These
principles are u... |
cs/0604104 | On the Shannon Covers of Certain Irreducible Constrained Systems of
Finite Type | cs.IT cs.DM math.IT | A construction of Crochemore, Mignosi and Restivo in the automata theory
literature gives a presentation of a finite-type constrained system (FTCS) that
is deterministic and has a relatively small number of states. This construction
is thus a good starting point for determining the minimal deterministic
presentation,... |
cs/0604106 | Bounded expected delay in arithmetic coding | cs.IT math.IT | We address the problem of delay in an arithmetic coding system. Due to the
nature of the arithmetic coding process, source sequences causing arbitrarily
large encoding or decoding delays exist. This phenomena raises the question of
just how large is the expected input to output delay in these systems, i.e.,
once a so... |
cs/0604107 | Cognitive Radio: An Information-Theoretic Perspective | cs.IT math.IT | Cognitive radios have been proposed as a means to implement efficient reuse
of the licensed spectrum. The key feature of a cognitive radio is its ability
to recognize the primary (licensed) user and adapt its communication strategy
to minimize the interference that it generates. We consider a communication
scenario i... |
cs/0604110 | Modeling and Mathematical Analysis of Swarms of Microscopic Robots | cs.MA cs.RO | The biologically-inspired swarm paradigm is being used to design
self-organizing systems of locally interacting artificial agents. A major
difficulty in designing swarms with desired characteristics is understanding
the causal relation between individual agent and collective behaviors.
Mathematical analysis of swarm ... |
cs/0604111 | Analysis of Dynamic Task Allocation in Multi-Robot Systems | cs.RO cs.MA | Dynamic task allocation is an essential requirement for multi-robot systems
operating in unknown dynamic environments. It allows robots to change their
behavior in response to environmental changes or actions of other robots in
order to improve overall system performance. Emergent coordination algorithms
for task all... |
cs/0604112 | Designing a Multi-petabyte Database for LSST | cs.DB cs.DL | The 3.2 giga-pixel LSST camera will produce approximately half a petabyte of
archive images every month. These data need to be reduced in under a minute to
produce real-time transient alerts, and then added to the cumulative catalog
for further analysis. The catalog is expected to grow about three hundred
terabytes p... |
cs/0605001 | On Multistage Successive Refinement for Wyner-Ziv Source Coding with
Degraded Side Informations | cs.IT math.IT | We provide a complete characterization of the rate-distortion region for the
multistage successive refinement of the Wyner-Ziv source coding problem with
degraded side informations at the decoder. Necessary and sufficient conditions
for a source to be successively refinable along a distortion vector are
subsequently ... |
cs/0605005 | The Discrete Memoryless Multiple Access Channel with Confidential
Messages | cs.IT math.IT | A multiple-access channel is considered in which messages from one encoder
are confidential. Confidential messages are to be transmitted with perfect
secrecy, as measured by equivocation at the other encoder. The upper bounds and
the achievable rates for this communication situation are determined.
|
cs/0605006 | An Information-Spectrum Approach to Multiterminal Rate-Distortion Theory | cs.IT math.IT | An information-spectrum approach is applied to solve the multiterminal source
coding problem for correlated general sources, where sources may be
nonstationary and/or nonergodic, and the distortion measure is arbitrary and
may be nonadditive. A general formula for the rate-distortion region of the
multiterminal sourc... |
cs/0605009 | On the Foundations of Universal Sequence Prediction | cs.LG cs.IT math.IT math.ST stat.TH | Solomonoff completed the Bayesian framework by providing a rigorous, unique,
formal, and universal choice for the model class and the prior. We discuss in
breadth how and in which sense universal (non-i.i.d.) sequence prediction
solves various (philosophical) problems of traditional Bayesian sequence
prediction. We s... |
cs/0605010 | Complementary Set Matrices Satisfying a Column Correlation Constraint | cs.IT math.IT | Motivated by the problem of reducing the peak to average power ratio (PAPR)
of transmitted signals, we consider a design of complementary set matrices
whose column sequences satisfy a correlation constraint. The design algorithm
recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO)
complementary set m... |
cs/0605012 | Perspective alignment in spatial language | cs.AI | It is well known that perspective alignment plays a major role in the
planning and interpretation of spatial language. In order to understand the
role of perspective alignment and the cognitive processes involved, we have
made precise complete cognitive models of situated embodied agents that
self-organise a communic... |
cs/0605014 | Generalized Multiple Access Channels with Confidential Messages | cs.IT math.IT | A discrete memoryless generalized multiple access channel (GMAC) with
confidential messages is studied, where two users attempt to transmit common
information to a destination and each user also has private (confidential)
information intended for the destination. The two users are allowed to receive
channel outputs, ... |
cs/0605016 | Cooperative Relay Broadcast Channels | cs.IT math.IT | The capacity regions are investigated for two relay broadcast channels
(RBCs), where relay links are incorporated into standard two-user broadcast
channels to support user cooperation. In the first channel, the Partially
Cooperative Relay Broadcast Channel, only one user in the system can act as a
relay and transmit ... |
cs/0605017 | Reasoning and Planning with Sensing Actions, Incomplete Information, and
Static Causal Laws using Answer Set Programming | cs.AI | We extend the 0-approximation of sensing actions and incomplete information
in [Son and Baral 2000] to action theories with static causal laws and prove
its soundness with respect to the possible world semantics. We also show that
the conditional planning problem with respect to this approximation is
NP-complete. We ... |
cs/0605023 | The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy
Constraints | cs.IT cs.CR math.IT | We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this
scenario, multiple users communicate with an intended receiver in the presence
of an intelligent and informed wire-tapper who receives a degraded version of
the signal at the receiver. We define a suitable security measure for this
multi-acc... |
cs/0605024 | A Formal Measure of Machine Intelligence | cs.AI cs.LG | A fundamental problem in artificial intelligence is that nobody really knows
what intelligence is. The problem is especially acute when we need to consider
artificial systems which are significantly different to humans. In this paper
we approach this problem in the following way: We take a number of well known
inform... |
cs/0605025 | Face Recognition using Principal Component Analysis and Log-Gabor
Filters | cs.CV | In this article we propose a novel face recognition method based on Principal
Component Analysis (PCA) and Log-Gabor filters. The main advantages of the
proposed method are its simple implementation, training, and very high
recognition accuracy. For recognition experiments we used 5151 face images of
1311 persons fro... |
cs/0605027 | Recognition of expression variant faces using masked log-Gabor features
and Principal Component Analysis | cs.CV | In this article we propose a method for the recognition of faces with
different facial expressions. For recognition we extract feature vectors by
using log-Gabor filters of multiple orientations and scales. Using sliding
window algorithm and variances -based masking these features are extracted at
image regions that ... |
cs/0605028 | The Gaussian Multiple Access Wire-Tap Channel | cs.IT cs.CR math.IT | We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this
scenario, multiple users communicate with an intended receiver in the presence
of an intelligent and informed wire-tapper who receives a degraded version of
the signal at the receiver. We define suitable security measures for this
multi-acce... |
cs/0605031 | On the Design of Agent-Based Systems using UML and Extensions | cs.AI cs.MA cs.SE | The Unified Software Development Process (USDP) and UML have been now
generally accepted as the standard methodology and modeling language for
developing Object-Oriented Systems. Although Agent-based Systems introduces new
issues, we consider that USDP and UML can be used in an extended manner for
modeling Agent-base... |
cs/0605032 | A framework of reusable structures for mobile agent development | cs.MA cs.AI cs.SE | Mobile agents research is clearly aiming towards imposing agent based
development as the next generation of tools for writing software. This paper
comes with its own contribution to this global goal by introducing a novel
unifying framework meant to bring simplicity and interoperability to and among
agent platforms a... |
cs/0605033 | Mobile Agent Based Solutions for Knowledge Assessment in elearning
Environments | cs.MA cs.AI cs.SE | E-learning is nowadays one of the most interesting of the "e- " domains
available through the Internet. The main problem to create a Web-based, virtual
environment is to model the traditional domain and to implement the model using
the most suitable technologies. We analyzed the distance learning domain and
investiga... |
cs/0605035 | Query Chains: Learning to Rank from Implicit Feedback | cs.LG cs.IR | This paper presents a novel approach for using clickthrough data to learn
ranked retrieval functions for web search results. We observe that users
searching the web often perform a sequence, or chain, of queries with a similar
information need. Using query chains, we generate new types of preference
judgments from se... |
cs/0605036 | Evaluating the Robustness of Learning from Implicit Feedback | cs.LG cs.IR | This paper evaluates the robustness of learning from implicit feedback in web
search. In particular, we create a model of user behavior by drawing upon user
studies in laboratory and real-world settings. The model is used to understand
the effect of user behavior on the performance of a learning algorithm for
ranked ... |
cs/0605037 | Minimally Invasive Randomization for Collecting Unbiased Preferences
from Clickthrough Logs | cs.IR cs.LG | Clickthrough data is a particularly inexpensive and plentiful resource to
obtain implicit relevance feedback for improving and personalizing search
engines. However, it is well known that the probability of a user clicking on a
result is strongly biased toward documents presented higher in the result set
irrespective... |
cs/0605038 | An Unfolding-Based Semantics for Logic Programming with Aggregates | cs.SE cs.AI | The paper presents two equivalent definitions of answer sets for logic
programs with aggregates. These definitions build on the notion of unfolding of
aggregates, and they are aimed at creating methodologies to translate logic
programs with aggregates to normal logic programs or positive programs, whose
answer set se... |
cs/0605040 | General Discounting versus Average Reward | cs.LG | Consider an agent interacting with an environment in cycles. In every
interaction cycle the agent is rewarded for its performance. We compare the
average reward U from cycle 1 to m (average value) with the future discounted
reward V from cycle k to infinity (discounted value). We consider essentially
arbitrary (non-g... |
cs/0605041 | Asymptotically Optimal Multiple-access Communication via Distributed
Rate Splitting | cs.IT math.IT | We consider the multiple-access communication problem in a distributed
setting for both the additive white Gaussian noise channel and the discrete
memoryless channel. We propose a scheme called Distributed Rate Splitting to
achieve the optimal rates allowed by information theory in a distributed
manner. In this schem... |
cs/0605044 | Linear Shift-Register Synthesis for Multiple Sequences of Varying Length | cs.IT math.IT | The problem of finding the shortest linear shift-register capable of
generating t finite length sequences over some field F is considered. A similar
problem was already addressed by Feng and Tzeng. They presented an iterative
algorithm for solving this multi-sequence shift-register synthesis problem,
which can be con... |
cs/0605046 | Patterns of i.i.d. Sequences and Their Entropy - Part I: General Bounds | cs.IT math.IT | Tight bounds on the block entropy of patterns of sequences generated by
independent and identically distributed (i.i.d.) sources are derived. A pattern
of a sequence is a sequence of integer indices with each index representing the
order of first occurrence of the respective symbol in the original sequence.
Since a p... |
cs/0605047 | Generalized Entropy Power Inequalities and Monotonicity Properties of
Information | cs.IT math.IT math.PR math.ST stat.TH | New families of Fisher information and entropy power inequalities for sums of
independent random variables are presented. These inequalities relate the
information in the sum of $n$ independent random variables to the information
contained in sums over subsets of the random variables, for an arbitrary
collection of s... |
cs/0605048 | On Learning Thresholds of Parities and Unions of Rectangles in Random
Walk Models | cs.LG cs.CC math.PR | In a recent breakthrough, [Bshouty et al., 2005] obtained the first
passive-learning algorithm for DNFs under the uniform distribution. They showed
that DNFs are learnable in the Random Walk and Noise Sensitivity models. We
extend their results in several directions. We first show that thresholds of
parities, a natur... |
cs/0605051 | A General Method for Finding Low Error Rates of LDPC Codes | cs.IT math.IT | This paper outlines a three-step procedure for determining the low bit error
rate performance curve of a wide class of LDPC codes of moderate length. The
traditional method to estimate code performance in the higher SNR region is to
use a sum of the contributions of the most dominant error events to the
probability o... |
cs/0605055 | Approximate Discrete Probability Distribution Representation using a
Multi-Resolution Binary Tree | cs.AI | Computing and storing probabilities is a hard problem as soon as one has to
deal with complex distributions over multiple random variables. The problem of
efficient representation of probability distributions is central in term of
computational efficiency in the field of probabilistic reasoning. The main
problem aris... |
cs/0605059 | Ontological Representations of Software Patterns | cs.SE cs.AI | This paper is based on and advocates the trend in software engineering of
extending the use of software patterns as means of structuring solutions to
software development problems (be they motivated by best practice or by company
interests and policies). The paper argues that, on the one hand, this
development requir... |
cs/0605064 | Modal Logics of Topological Relations | cs.LO cs.AI cs.CC | Logical formalisms for reasoning about relations between spatial regions play
a fundamental role in geographical information systems, spatial and constraint
databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's
modal logic of time intervals based on the Allen relations, we introduce a
family of... |
cs/0605065 | On the possible Computational Power of the Human Mind | cs.NE cs.AI cs.CC | The aim of this paper is to address the question: Can an artificial neural
network (ANN) model be used as a possible characterization of the power of the
human mind? We will discuss what might be the relationship between such a model
and its natural counterpart. A possible characterization of the different power
capa... |
cs/0605067 | Efficient Operation of Coded Packet Networks | cs.IT cs.NI math.IT | A fundamental problem faced in the design of almost all packet networks is
that of efficient operation--of reliably communicating given messages among
nodes at minimum cost in resource usage. We present a solution to the efficient
operation problem for coded packet networks, i.e., packet networks where the
contents o... |
cs/0605069 | Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over
GF(q) and Markov Sources | cs.IT math.IT | A sequential updating scheme (SUS) for belief propagation (BP) decoding of
LDPC codes over Galois fields, $GF(q)$, and correlated Markov sources is
proposed, and compared with the standard parallel updating scheme (PUS). A
thorough experimental study of various transmission settings indicates that the
convergence rat... |
cs/0605070 | Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots | cs.RO cs.MA | If a smooth, closed, and embedded curve is deformed along its normal vector
field at a rate proportional to its curvature, it shrinks to a circular point.
This curve evolution is called Euclidean curve shortening and the result is
known as the Gage-Hamilton-Grayson Theorem. Motivated by the rendezvous problem
for mob... |
cs/0605071 | On the Capacity of Interference Channels with Degraded Message sets | cs.IT math.IT | This paper is motivated by a sensor network on a correlated field where
nearby sensors share information, and can thus assist rather than interfere
with one another. A special class of two-user Gaussian interference channels
(IFCs) is considered where one of the two transmitters knows both the messages
to be conveyed... |
cs/0605072 | On the Capacity of Gaussian Weak Interference Channels with Degraded
Message sets | cs.IT math.IT | This paper is motivated by a sensor network on a correlated field where
nearby sensors share information, and can thus assist rather than interfere
with one another. We consider a special class of two-user Gaussian interference
channels (IFCs) where one of the two transmitters knows both the messages to be
conveyed t... |
cs/0605073 | Analytic Properties and Covariance Functions of a New Class of
Generalized Gibbs Random Fields | cs.IT cs.CE math.IT | Spartan Spatial Random Fields (SSRFs) are generalized Gibbs random fields,
equipped with a coarse-graining kernel that acts as a low-pass filter for the
fluctuations. SSRFs are defined by means of physically motivated spatial
interactions and a small set of free parameters (interaction couplings). This
paper focuses ... |
cs/0605075 | On the Capacity and Mutual Information of Memoryless Noncoherent
Rayleigh-Fading Channels | cs.IT math.IT | The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading
channel is considered. Closed-form expressions for the mutual information
between the output and the input of this channel when the input magnitude
distribution is discrete and restricted to having two mass points are derived,
and it is subs... |
cs/0605076 | Numeration-automatic sequences | cs.CL cs.DM | We present a base class of automata that induce a numeration system and we
give an algorithm to give the n-th word in the language of the automaton when
the expansion of n in the induced numeration system is feeded to the automaton.
Furthermore we give some algorithms for reverse reading of this expansion and a
way t... |
cs/0605077 | Universal Filtering via Hidden Markov Modeling | cs.IT math.IT | The problem of discrete universal filtering, in which the components of a
discrete signal emitted by an unknown source and corrupted by a known DMC are
to be causally estimated, is considered. A family of filters are derived, and
are shown to be universally asymptotically optimal in the sense of achieving
the optimum... |
cs/0605079 | On the Capacity of Fading MIMO Broadcast Channels with Imperfect
Transmitter Side-Information | cs.IT math.IT | A fading broadcast channel is considered where the transmitter employs two
antennas and each of the two receivers employs a single receive antenna. It is
demonstrated that even if the realization of the fading is precisely known to
the receivers, the high signal-to-noise (SNR) throughput is greatly reduced if,
rather... |
cs/0605084 | The Generalized Multiple Access Channel with Confidential Messages | cs.IT math.IT | A discrete memoryless generalized multiple access channel (GMAC) with
confidential messages is studied, where two users attempt to transmit common
information to a destination and each user also has private (confidential)
information intended for the destination. This channel generalizes the multiple
access channel (... |
cs/0605086 | Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary
Erasure Channels | cs.IT math.IT | Assuming iterative decoding for binary erasure channels (BECs), a novel
tree-based technique for upper bounding the bit error rates (BERs) of
arbitrary, finite low-density parity-check (LDPC) codes is provided and the
resulting bound can be evaluated for all operating erasure probabilities,
including both the waterfa... |
cs/0605087 | Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels | cs.IT math.IT | In this paper, random coding error exponents and cutoff rate are studied for
noncoherent Rician fading channels, where neither the receiver nor the
transmitter has channel side information. First, it is assumed that the input
is subject only to an average power constraint. In this case, a lower bound to
the random co... |
cs/0605091 | Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker
bounds | cs.IT math.IT | We describe and analyze sparse graphical code constructions for the problems
of source coding with decoder side information (the Wyner-Ziv problem), and
channel coding with encoder side information (the Gelfand-Pinsker problem). Our
approach relies on a combination of low-density parity check (LDPC) codes and
low-den... |
cs/0605092 | The Multiple Access Channel with Feedback and Correlated Sources | cs.IT math.IT | In this paper, we investigate communication strategies for the multiple
access channel with feedback and correlated sources (MACFCS). The MACFCS models
a wireless sensor network scenario in which sensors distributed throughout an
arbitrary random field collect correlated measurements and transmit them to a
common sin... |
cs/0605093 | The Capacity of the Single Source Multiple Relay Single Destination Mesh
Network | cs.IT math.IT | In this paper, we derive the capacity of a special class of mesh networks. A
mesh network is defined as a heterogeneous wireless network in which the
transmission among power limited nodes is assisted by powerful relays, which
use the same wireless medium. We find the capacity of the mesh network when
there is one so... |
cs/0605095 | Single-Symbol-Decodable Differential Space-Time Modulation Based on
QO-STBC | cs.IT math.IT | We present a novel differential space-time modulation (DSTM) scheme that is
single-symbol decodable and can provide full transmit diversity. It is the
first known singlesymbol- decodable DSTM scheme not based on Orthogonal STBC
(O-STBC), and it is constructed based on the recently proposed
Minimum-Decoding-Complexity... |
cs/0605096 | Circle Formation of Weak Robots and Lyndon Words | cs.DC cs.RO | A Lyndon word is a non-empty word strictly smaller in the lexicographic order
than any of its suffixes, except itself and the empty word. In this paper, we
show how Lyndon words can be used in the distributed control of a set of n weak
mobile robots. By weak, we mean that the robots are anonymous, memoryless,
without... |
cs/0605098 | Energy Efficiency in Multi-hop CDMA Networks: A Game Theoretic Analysis | cs.IT math.IT | A game-theoretic analysis is used to study the effects of receiver choice on
the energy efficiency of multi-hop networks in which the nodes communicate
using Direct-Sequence Code Division Multiple Access (DS-CDMA). A Nash
equilibrium of the game in which the network nodes can choose their receivers
as well as their t... |
cs/0605099 | Alphabetic Coding with Exponential Costs | cs.IT cs.DS math.IT | 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 ... |
cs/0605100 | Network Inference from Co-Occurrences | cs.IT math.IT | The recovery of network structure from experimental data is a basic and
fundamental problem. Unfortunately, experimental data often do not directly
reveal structure due to inherent limitations such as imprecision in timing or
other observation mechanisms. We consider the problem of inferring network
structure in the ... |
cs/0605101 | Modeling the Dynamics of Social Networks | cs.CY cs.CE cs.CL cs.HC cs.NI physics.data-an | Modeling human dynamics responsible for the formation and evolution of the
so-called social networks - structures comprised of individuals or
organizations and indicating connectivities existing in a community - is a
topic recently attracting a significant research interest. It has been claimed
that these dynamics ar... |
cs/0605103 | A Better Alternative to Piecewise Linear Time Series Segmentation | cs.DB cs.CV | Time series are difficult to monitor, summarize and predict. Segmentation
organizes time series into few intervals having uniform characteristics
(flatness, linearity, modality, monotonicity and so on). For scalability, we
require fast linear time algorithms. The popular piecewise linear model can
determine where the... |
cs/0605105 | An outer bound to the capacity region of the broadcast channel | cs.IT math.IT | An outer bound to the capacity region of the two-receiver discrete memoryless
broadcast channel is given. The outer bound is tight for all cases where the
capacity region is known. When specialized to the case of no common
information, this outer bound is contained in the Korner-Marton outer bound.
This containment i... |
cs/0605106 | Supervisory Control of Fuzzy Discrete Event Systems: A Formal Approach | cs.LO cs.AI | Fuzzy {\it discrete event systems} (DESs) were proposed recently by Lin and
Ying [19], which may better cope with the real-world problems with fuzziness,
impreciseness, and subjectivity such as those in biomedicine. As a continuation
of [19], in this paper we further develop fuzzy DESs by dealing with
supervisory con... |
cs/0605108 | Diagnosability of Fuzzy Discrete Event Systems | cs.AI | In order to more effectively cope with the real-world problems of vagueness,
{\it fuzzy discrete event systems} (FDESs) were proposed recently, and the
supervisory control theory of FDESs was developed. In view of the importance of
failure diagnosis, in this paper, we present an approach of the failure
diagnosis in t... |
cs/0605112 | An Algorithm to Determine Peer-Reviewers | cs.DL cs.AI cs.DS | The peer-review process is the most widely accepted certification mechanism
for officially accepting the written results of researchers within the
scientific community. An essential component of peer-review is the
identification of competent referees to review a submitted manuscript. This
article presents an algorith... |
cs/0605115 | Key Distillation and the Secret-Bit Fraction | cs.CR cs.IT math.IT quant-ph | We consider distillation of secret bits from partially secret noisy
correlations P_ABE, shared between two honest parties and an eavesdropper. The
most studied distillation scenario consists of joint operations on a large
number of copies of the distribution (P_ABE)^N, assisted with public
communication. Here we cons... |
cs/0605116 | Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks | cs.IT math.IT | We investigate the optimal performance of dense sensor networks by studying
the joint source-channel coding problem. The overall goal of the sensor network
is to take measurements from an underlying random process, code and transmit
those measurement samples to a collector node in a cooperative multiple access
channe... |
cs/0605117 | A Lattice-Based MIMO Broadcast Precoder for Multi-Stream Transmission | cs.IT math.IT | Precoding with block diagonalization is an attractive scheme for approaching
sum capacity in multiuser multiple input multiple output (MIMO) broadcast
channels. This method requires either global channel state information at every
receiver or an additional training phase, which demands additional system
planning. In ... |
cs/0605118 | Pseudocodeword weights for non-binary LDPC codes | cs.IT math.IT | Pseudocodewords of q-ary LDPC codes are examined and the weight of a
pseudocodeword on the q-ary symmetric channel is defined. The weight definition
of a pseudocodeword on the AWGN channel is also extended to two-dimensional
q-ary modulation such as q-PAM and q-PSK. The tree-based lower bounds on the
minimum pseudoco... |
cs/0605119 | An Internet-enabled technology to support Evolutionary Design | cs.CE cs.AI cs.AR cs.MA cs.NI | This paper discusses the systematic use of product feedback information to
support life-cycle design approaches and provides guidelines for developing a
design at both the product and the system levels. Design activities are
surveyed in the light of the product life cycle, and the design information
flow is interpret... |
cs/0605120 | Understanding Design Fundamentals: How Synthesis and Analysis Drive
Creativity, Resulting in Emergence | cs.AI cs.CE cs.HC | This paper presents results of an ongoing interdisciplinary study to develop
a computational theory of creativity for engineering design. Human design
activities are surveyed, and popular computer-aided design methodologies are
examined. It is argued that semiotics has the potential to merge and unite
various design ... |
cs/0605121 | Communication of Social Agents and the Digital City - A Semiotic
Perspective | cs.AI cs.CL cs.CY cs.HC | This paper investigates the concept of digital city. First, a functional
analysis of a digital city is made in the light of the modern study of
urbanism; similarities between the virtual and urban constructions are pointed
out. Next, a semiotic perspective on the subject matter is elaborated, and a
terminological bas... |
cs/0605122 | Modeling Hypermedia-Based Communication | cs.HC cs.CY cs.IR cs.IT math.IT | In this article, we explore two approaches to modeling hypermedia-based
communication. It is argued that the classical conveyor-tube framework is not
applicable to the case of computer- and Internet- mediated communication. We
then present a simple but very general system-theoretic model of the
communication process,... |
cs/0605123 | Classification of Ordinal Data | cs.AI | Classification of ordinal data is one of the most important tasks of relation
learning. In this thesis a novel framework for ordered classes is proposed. The
technique reduces the problem of classifying ordered classes to the standard
two-class problem. The introduced method is then mapped into support vector
machine... |
cs/0605124 | Semantics and Complexity of SPARQL | cs.DB | SPARQL is the W3C candidate recommendation query language for RDF. In this
paper we address systematically the formal study of SPARQL, concentrating in
its graph pattern facility. We consider for this study a fragment without
literals and a simple version of filters which encompasses all the main issues
yet is simple... |
cs/0605127 | Analyzing Large Collections of Electronic Text Using OLAP | cs.DB cs.DL | Computer-assisted reading and analysis of text has various applications in
the humanities and social sciences. The increasing size of many electronic text
archives has the advantage of a more complete analysis but the disadvantage of
taking longer to obtain results. On-Line Analytical Processing is a method used
to s... |
cs/0605129 | An Outer Bound for the Multi-Terminal Rate-Distortion Region | cs.IT math.IT | The multi-terminal rate-distortion problem has been studied extensively.
Notably, among these, Tung and Housewright have provided the best known inner
and outer bounds for the rate region under certain distortion constraints. In
this paper, we first propose an outer bound for the rate region, and show that
it is tigh... |
cs/0605130 | Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure
Channel | cs.IT cond-mat.dis-nn math.IT | We introduce a thermodynamic (large deviation) formalism for computing error
exponents in error-correcting codes. Within this framework, we apply the
heuristic cavity method from statistical mechanics to derive the average and
typical error exponents of low-density parity-check (LDPC) codes on the binary
erasure chan... |
cs/0605131 | Notes on Geometric Measure Theory Applications to Image Processing;
De-noising, Segmentation, Pattern, Texture, Lines, Gestalt and Occlusion | cs.CV | Regularization functionals that lower level set boundary length when used
with L^1 fidelity functionals on signal de-noising on images create artifacts.
These are (i) rounding of corners, (ii) shrinking of radii, (iii) shrinking of
cusps, and (iv) non-smoothing of staircasing. Regularity functionals based upon
total ... |
cs/0605132 | Stable partitions in coalitional games | cs.GT cs.MA | We propose a notion of a stable partition in a coalitional game that is
parametrized by the concept of a defection function. This function assigns to
each partition of the grand coalition a set of different coalition arrangements
for a group of defecting players. The alternatives are compared using their
social welfa... |
cs/0605135 | On the Role of Estimate-and-Forward with Time-Sharing in Cooperative
Communications | cs.IT math.IT | In this work we focus on the general relay channel. We investigate the
application of estimate-and-forward (EAF) to different scenarios. Specifically,
we consider assignments of the auxiliary random variables that always satisfy
the feasibility constraints. We first consider the multiple relay channel and
obtain an a... |
cs/0605137 | Capacity Results for Block-Stationary Gaussian Fading Channels with a
Peak Power Constraint | cs.IT math.IT | We consider a peak-power-limited single-antenna block-stationary Gaussian
fading channel where neither the transmitter nor the receiver knows the channel
state information, but both know the channel statistics. This model subsumes
most previously studied Gaussian fading models. We first compute the asymptotic
channel... |
cs/0605138 | The meaning of manufacturing know-how | cs.AI cs.CE | This paper investigates the phenomenon of manufacturing know-how. First, the
abstract notion of knowledge is discussed, and a terminological basis is
introduced to treat know-how as a kind of knowledge. Next, a brief survey of
the recently reported works dealt with manufacturing know-how is presented, and
an explicit... |
cs/0605147 | Utilisation de la linguistique en reconnaissance de la parole : un
\'{e}tat de l'art | cs.HC cs.CL | To transcribe speech, automatic speech recognition systems use statistical
methods, particularly hidden Markov model and N-gram models. Although these
techniques perform well and lead to efficient systems, they approach their
maximum possibilities. It seems thus necessary, in order to outperform current
results, to u... |
cs/0606004 | A Framework for the Development of Manufacturing Simulators: Towards New
Generation of Simulation Systems | cs.CE cs.HC | In this paper, an attempt is made to systematically discuss the development
of simulation systems for manufacturing system design. General requirements on
manufacturing simulators are formulated and a framework to address the
requirements is suggested. Problems of information representation as an
activity underlying ... |
cs/0606006 | Foundations of Modern Language Resource Archives | cs.CL | A number of serious reasons will convince an increasing amount of researchers
to store their relevant material in centers which we will call "language
resource archives". They combine the duty of taking care of long-term
preservation as well as the task to give access to their material to different
user groups. Acces... |
cs/0606010 | A Decision-Making Support System Based on Know-How | cs.CE cs.AI | The research results described are concerned with: - developing a domain
modeling method and tools to provide the design and implementation of
decision-making support systems for computer integrated manufacturing; -
building a decision-making support system based on know-how and its software
environment. The research... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.