id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0702162 | Distributed Power Allocation with Rate Constraints in Gaussian Parallel
Interference Channels | cs.IT cs.GT math.IT | This paper considers the minimization of transmit power in Gaussian parallel
interference channels, subject to a rate constraint for each user. To derive
decentralized solutions that do not require any cooperation among the users, we
formulate this power control problem as a (generalized) Nash equilibrium game.
We ob... |
cs/0702163 | First Passage Time for Multivariate Jump-diffusion Stochastic Models
With Applications in Finance | cs.CE cs.NA | The ``first passage-time'' (FPT) problem is an important problem with a wide
range of applications in mathematics, physics, biology and finance.
Mathematically, such a problem can be reduced to estimating the probability of
a (stochastic) process first to reach a critical level or threshold. While in
other areas of a... |
cs/0702164 | Monte-Carlo Simulations of the First Passage Time for Multivariate
Jump-Diffusion Processes in Financial Applications | cs.CE cs.NA | Many problems in finance require the information on the first passage time
(FPT) of a stochastic process. Mathematically, such problems are often reduced
to the evaluation of the probability density of the time for such a process to
cross a certain level, a boundary, or to enter a certain region. While in other
areas... |
cs/0702165 | Efficient estimation of default correlation for multivariate
jump-diffusion processes | cs.CE cs.NA | Evaluation of default correlation is an important task in credit risk
analysis. In many practical situations, it concerns the joint defaults of
several correlated firms, the task that is reducible to a first passage time
(FPT) problem. This task represents a great challenge for jump-diffusion
processes (JDP), where e... |
cs/0702166 | Solving Stochastic Differential Equations with Jump-Diffusion
Efficiently: Applications to FPT Problems in Credit Risk | cs.CE cs.NA | The first passage time (FPT) problem is ubiquitous in many applications. In
finance, we often have to deal with stochastic processes with jump-diffusion,
so that the FTP problem is reducible to a stochastic differential equation with
jump-diffusion. While the application of the conventional Monte-Carlo procedure
is p... |
cs/0702167 | Finite Volume Analysis of Nonlinear Thermo-mechanical Dynamics of Shape
Memory Alloys | cs.CE cs.NA | In this paper, the finite volume method is developed to analyze coupled
dynamic problems of nonlinear thermoelasticity. The major focus is given to the
description of martensitic phase transformations essential in the modelling of
shape memory alloys. Computational experiments are carried out to study the
thermo-mech... |
cs/0702168 | Simulation of Phase Combinations in Shape Memory Alloys Patches by
Hybrid Optimization Methods | cs.CE cs.NA | In this paper, phase combinations among martensitic variants in shape memory
alloys patches and bars are simulated by a hybrid optimization methodology. The
mathematical model is based on the Landau theory of phase transformations. Each
stable phase is associated with a local minimum of the free energy function,
and ... |
cs/0702170 | Generic Global Constraints based on MDDs | cs.AI | Constraint Programming (CP) has been successfully applied to both constraint
satisfaction and constraint optimization problems. A wide variety of
specialized global constraints provide critical assistance in achieving a good
model that can take advantage of the structure of the problem in the search for
a solution. H... |
cs/0702172 | Numerical Model For Vibration Damping Resulting From the First Order
Phase Transformations | cs.CE cs.NA | A numerical model is constructed for modelling macroscale damping effects
induced by the first order martensite phase transformations in a shape memory
alloy rod. The model is constructed on the basis of the modified
Landau-Ginzburg theory that couples nonlinear mechanical and thermal fields.
The free energy function... |
cs/0703002 | Integral Biomathics: A Post-Newtonian View into the Logos of Bios (On
the New Meaning, Relations and Principles of Life in Science) | cs.NE cs.CC | This work is an attempt for a state-of-the-art survey of natural and life
sciences with the goal to define the scope and address the central questions of
an original research program. It is focused on the phenomena of emergence,
adaptive dynamics and evolution of self-assembling, self-organizing,
self-maintaining and... |
cs/0703005 | State Amplification | cs.IT math.IT | We consider the problem of transmitting data at rate R over a state dependent
channel p(y|x,s) with the state information available at the sender and at the
same time conveying the information about the channel state itself to the
receiver. The amount of state information that can be learned at the receiver
is captur... |
cs/0703016 | Outage Probability of Multiple-Input Single-Output (MISO) Systems with
Delayed Feedback | cs.IT math.IT | We investigate the effect of feedback delay on the outage probability of
multiple-input single-output (MISO) fading channels. Channel state information
at the transmitter (CSIT) is a delayed version of the channel state information
available at the receiver (CSIR). We consider two cases of CSIR: (a) perfect
CSIR and ... |
cs/0703017 | Performance Bounds for Bi-Directional Coded Cooperation Protocols | cs.IT math.IT | In coded bi-directional cooperation, two nodes wish to exchange messages over
a shared half-duplex channel with the help of a relay. In this paper, we derive
performance bounds for this problem for each of three protocols.
The first protocol is a two phase protocol were both users simultaneously
transmit during the... |
cs/0703022 | Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its
Implication on Scheduling | cs.IT math.IT | For a multiple antenna system, we compute the asymptotic distribution of
antenna selection gain when the transmitter selects the transmit antenna with
the strongest channel. We use this to asymptotically estimate the underlying
channel capacity distributions, and demonstrate that unlike
multiple-input/multiple-output... |
cs/0703024 | Algorithmic Information Theory: a brief non-technical guide to the field | cs.IT cs.CC math.IT | This article is a brief guide to the field of algorithmic information theory
(AIT), its underlying philosophy, and the most important concepts. AIT arises
by mixing information theory and computation theory to obtain an objective and
absolute notion of information in an individual object, and in so doing gives
rise t... |
cs/0703027 | Interroger un corpus par le sens | cs.CL cs.IR | In textual knowledge management, statistical methods prevail. Nonetheless,
some difficulties cannot be overcome by these methodologies. I propose a
symbolic approach using a complete textual analysis to identify which analysis
level can improve the the answers provided by a system. The approach identifies
word senses... |
cs/0703033 | Time Warp Edit Distance with Stiffness Adjustment for Time Series
Matching | cs.IR | In a way similar to the string-to-string correction problem we address time
series similarity in the light of a time-series-to-time-series-correction
problem for which the similarity between two time series is measured as the
minimum cost sequence of "edit operations" needed to transform one time series
into another.... |
cs/0703034 | Nanoscale Communication with Brownian Motion | cs.IT math.IT | In this paper, the problem of communicating using chemical messages
propagating using Brownian motion, rather than electromagnetic messages
propagating as waves in free space or along a wire, is considered. This problem
is motivated by nanotechnological and biotechnological applications, where the
energy cost of elec... |
cs/0703035 | On the Distortion SNR Exponent of Some Layered Transmission Schemes | cs.IT math.IT | We consider the problem of joint source-channel coding for transmitting K
samples of a complex Gaussian source over T = bK uses of a block-fading
multiple input multiple output (MIMO) channel with M transmit and N receive
antennas. We consider the case when we are allowed to code over L blocks. The
channel gain is as... |
cs/0703036 | Constructions of Grassmannian Simplices | cs.IT math.IT | In this article an explicit method (relying on representation theory) to
construct packings in Grassmannian space is presented. Infinite families of
configurations having only one non-trivial set of principal angles are found
using 2-transitive groups. These packings are proved to reach the simplex bound
and are ther... |
cs/0703038 | Delay and Throughput Optimal Scheduling for OFDM Broadcast Channels | cs.IT math.IT | In this paper a scheduling policy is presented which minimizes the average
delay of the users. The scheduling scheme is investigated both by analysis and
simulations carried out in the context of Orthogonal Frequency Division
Multiplexing (OFDM) broadcast channels (BC). First the delay optimality is
obtained for a st... |
cs/0703042 | Recommender System for Online Dating Service | cs.IR cs.SE | Users of online dating sites are facing information overload that requires
them to manually construct queries and browse huge amount of matching user
profiles. This becomes even more problematic for multimedia profiles. Although
matchmaking is frequently cited as a typical application for recommender
systems, there i... |
cs/0703045 | Performance Bounds on Sparse Representations Using Redundant Frames | cs.IT math.IT | We consider approximations of signals by the elements of a frame in a complex
vector space of dimension $N$ and formulate both the noiseless and the noisy
sparse representation problems. The noiseless representation problem is to find
sparse representations of a signal $\mathbf{r}$ given that such representations
exi... |
cs/0703046 | Optimal Power Allocation for Distributed Detection over MIMO Channels in
Wireless Sensor Networks | cs.IT math.IT | In distributed detection systems with wireless sensor networks, the
communication between sensors and a fusion center is not perfect due to
interference and limited transmitter power at the sensors to combat noise at
the fusion center's receiver. The problem of optimizing detection performance
with such imperfect com... |
cs/0703047 | Precoding for the AWGN Channel with Discrete Interference | cs.IT math.IT | $M$-ary signal transmission over AWGN channel with additive $Q$-ary
interference where the sequence of i.i.d. interference symbols is known
causally at the transmitter is considered. Shannon's theorem for channels with
side information at the transmitter is used to formulate the capacity of the
channel. It is shown t... |
cs/0703048 | Path Loss Models Based on Stochastic Rays | cs.IT math.IT | In this paper, two-dimensional percolation lattices are applied to describe
wireless propagation environment, and stochastic rays are employed to model the
trajectories of radio waves. We first derive the probability that a stochastic
ray undergoes certain number of collisions at a specific spatial location.
Three cl... |
cs/0703049 | Algorithm of Segment-Syllabic Synthesis in Speech Recognition Problem | cs.SD cs.CL | Speech recognition based on the syllable segment is discussed in this paper.
The principal search methods in space of states for the speech recognition
problem by segment-syllabic parameters trajectory synthesis are investigated.
Recognition as comparison the parameters trajectories in chosen speech units on
the sect... |
cs/0703050 | On The Capacity Deficit of Mobile Wireless Ad Hoc Networks: A Rate
Distortion Formulation | cs.IT math.IT | Overheads incurred by routing protocols diminish the capacity available for
relaying useful data in a mobile wireless ad hoc network. Discovering lower
bounds on the amount of protocol overhead incurred for routing data packets is
important for the development of efficient routing protocols, and for
characterizing th... |
cs/0703052 | On the densest MIMO lattices from cyclic division algebras | cs.IT math.IT | It is shown why the discriminant of a maximal order within a cyclic division
algebra must be minimized in order to get the densest possible matrix lattices
with a prescribed nonvanishing minimum determinant. Using results from class
field theory a lower bound to the minimum discriminant of a maximal order with
a give... |
cs/0703053 | Extraction of cartographic objects in high resolution satellite images
for object model generation | cs.CV | The aim of this study is to detect man-made cartographic objects in
high-resolution satellite images. New generation satellites offer a sub-metric
spatial resolution, in which it is possible (and necessary) to develop methods
at object level rather than at pixel level, and to exploit structural features
of objects. W... |
cs/0703055 | Support and Quantile Tubes | cs.IT cs.LG math.IT | This correspondence studies an estimator of the conditional support of a
distribution underlying a set of i.i.d. observations. The relation with mutual
information is shown via an extension of Fano's theorem in combination with a
generalization bound based on a compression argument. Extensions to estimating
the condi... |
cs/0703056 | Unasssuming View-Size Estimation Techniques in OLAP | cs.DB cs.PF | Even if storage was infinite, a data warehouse could not materialize all
possible views due to the running time and update requirements. Therefore, it
is necessary to estimate quickly, accurately, and reliably the size of views.
Many available techniques make particular statistical assumptions and their
error can be ... |
cs/0703057 | Doppler Resilient Waveforms with Perfect Autocorrelation | cs.IT math.IT | We describe a method of constructing a sequence of phase coded waveforms with
perfect autocorrelation in the presence of Doppler shift. The constituent
waveforms are Golay complementary pairs which have perfect autocorrelation at
zero Doppler but are sensitive to nonzero Doppler shifts. We extend this
construction to... |
cs/0703058 | A Comparison of Five Probabilistic View-Size Estimation Techniques in
OLAP | cs.DB cs.PF | A data warehouse cannot materialize all possible views, hence we must
estimate quickly, accurately, and reliably the size of views to determine the
best candidates for materialization. Many available techniques for view-size
estimation make particular statistical assumptions and their error can be
large. Comparativel... |
cs/0703060 | Redesigning Decision Matrix Method with an indeterminacy-based inference
process | cs.AI | For academics and practitioners concerned with computers, business and
mathematics, one central issue is supporting decision makers. In this paper, we
propose a generalization of Decision Matrix Method (DMM), using Neutrosophic
logic. It emerges as an alternative to the existing logics and it represents a
mathematica... |
cs/0703061 | Coding for Errors and Erasures in Random Network Coding | cs.IT cs.NI math.IT | The problem of error-control in random linear network coding is considered. A
``noncoherent'' or ``channel oblivious'' model is assumed where neither
transmitter nor receiver is assumed to have knowledge of the channel transfer
characteristic. Motivated by the property that linear network coding is
vector-space prese... |
cs/0703062 | Bandit Algorithms for Tree Search | cs.LG | Bandit based methods for tree search have recently gained popularity when
applied to huge trees, e.g. in the game of go (Gelly et al., 2006). The UCT
algorithm (Kocsis and Szepesvari, 2006), a tree search method based on Upper
Confidence Bounds (UCB) (Auer et al., 2002), is believed to adapt locally to
the effective ... |
cs/0703067 | Target assignment for robotic networks: asymptotic performance under
limited communication | cs.RO | We are given an equal number of mobile robotic agents, and distinct target
locations. Each agent has simple integrator dynamics, a limited communication
range, and knowledge of the position of every target. We address the problem of
designing a distributed algorithm that allows the group of agents to divide the
targe... |
cs/0703068 | Option Valuation using Fourier Space Time Stepping | cs.CE | It is well known that the Black-Scholes-Merton model suffers from several
deficiencies. Jump-diffusion and Levy models have been widely used to partially
alleviate some of the biases inherent in this classical model. Unfortunately,
the resulting pricing problem requires solving a more difficult partial-integro
differ... |
cs/0703078 | Broadcast Capacity Region of Two-Phase Bidirectional Relaying | cs.IT math.IT | In a three-node network a half-duplex relay node enables bidirectional
communication between two nodes with a spectral efficient two phase protocol.
In the first phase, two nodes transmit their message to the relay node, which
decodes the messages and broadcast a re-encoded composition in the second
phase. In this wo... |
cs/0703081 | Randomized Computations on Large Data Sets: Tight Lower Bounds | cs.DB cs.CC | We study the randomized version of a computation model (introduced by Grohe,
Koch, and Schweikardt (ICALP'05); Grohe and Schweikardt (PODS'05)) that
restricts random access to external memory and internal memory space.
Essentially, this model can be viewed as a powerful version of a data stream
model that puts no cos... |
cs/0703087 | Social Information Processing in Social News Aggregation | cs.CY cs.AI cs.HC cs.MA | The rise of the social media sites, such as blogs, wikis, Digg and Flickr
among others, underscores the transformation of the Web to a participatory
medium in which users are collaboratively creating, evaluating and distributing
information. The innovations introduced by social media has lead to a new
paradigm for in... |
cs/0703088 | Plot 94 in ambiance X-Window | cs.CV cs.GR | <PLOT > is a collection of routines to draw surfaces, contours and so on. In
this work we are presenting a version, that functions over work stations with
the operative system UNIX, that count with the graphic ambiance X-WINDOW with
the tools XLIB and OSF/MOTIF. This implant was realized for the work stations
DEC 500... |
cs/0703089 | Space Program Language (SPL/SQL) for the Relational Approach of the
Spatial Databases | cs.DB cs.CG | In this project we are presenting a grammar which unify the design and
development of spatial databases. In order to make it, we combine nominal and
spatial information, the former is represented by the relational model and
latter by a modification of the same model. The modification lets to represent
spatial data st... |
cs/0703090 | Orthogonal Frequency Division Multiplexing: An Overview | cs.IT math.IT | Orthogonal Frequency Division Multiplexing (OFDM) is a multi-carrier
modulation scheme that provides efficient bandwidth utilization and robustness
against time dispersive channels. This paper deals with the basic system model
for OFDM based systems and with self-interference, or the corruption of desired
signal by i... |
cs/0703091 | Multimodal Meaning Representation for Generic Dialogue Systems
Architectures | cs.AI cs.MM | An unified language for the communicative acts between agents is essential
for the design of multi-agents architectures. Whatever the type of interaction
(linguistic, multimodal, including particular aspects such as force feedback),
whatever the type of application (command dialogue, request dialogue, database
queryi... |
cs/0703095 | Copula Component Analysis | cs.IR cs.AI | A framework named Copula Component Analysis (CCA) for blind source separation
is proposed as a generalization of Independent Component Analysis (ICA). It
differs from ICA which assumes independence of sources that the underlying
components may be dependent with certain structure which is represented by
Copula. By inc... |
cs/0703097 | On Approximating Optimal Weighted Lobbying, and Frequency of Correctness
versus Average-Case Polynomial Time | cs.GT cs.CC cs.MA | We investigate issues related to two hard problems related to voting, the
optimal weighted lobbying problem and the winner problem for Dodgson elections.
Regarding the former, Christian et al. [CFRS06] showed that optimal lobbying is
intractable in the sense of parameterized complexity. We provide an efficient
greedy... |
cs/0703099 | Constrained Cost-Coupled Stochastic Games with Independent State
Processes | cs.IT cs.GT math.IT | We consider a non-cooperative constrained stochastic games with N players
with the following special structure. With each player there is an associated
controlled Markov chain. The transition probabilities of the i-th Markov chain
depend only on the state and actions of controller i. The information structure
that we... |
cs/0703101 | A Note on Approximate Nearest Neighbor Methods | cs.IR cs.CC cs.CV | A number of authors have described randomized algorithms for solving the
epsilon-approximate nearest neighbor problem. In this note I point out that the
epsilon-approximate nearest neighbor property often fails to be a useful
approximation property, since epsilon-approximate solutions fail to satisfy the
necessary pr... |
cs/0703102 | Generation of Efficient Codes for Realizing Boolean Functions in
Nanotechnologies | cs.IT cs.DM math.IT | We address the challenge of implementing reliable computation of Boolean
functions in future nanocircuit fabrics. Such fabrics are projected to have
very high defect rates. We overcome this limitation by using a combination of
cheap but unreliable nanodevices and reliable but expensive CMOS devices. In
our approach, ... |
cs/0703103 | Concept of a Value in Multilevel Security Databases | cs.DB | This paper has been withdrawn.
|
cs/0703104 | Encoding via Gr\"obner bases and discrete Fourier transforms for several
types of algebraic codes | cs.IT math.IT | We propose a novel encoding scheme for algebraic codes such as codes on
algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded
Reed-Solomon codes and present numerical examples. We employ the recurrence
from the Gr\"obner basis of the locator ideal for a set of rational points and
the two-dimensiona... |
cs/0703105 | New List Decoding Algorithms for Reed-Solomon and BCH Codes | cs.IT cs.CC math.IT | In this paper we devise a rational curve fitting algorithm and apply it to
the list decoding of Reed-Solomon and BCH codes. The proposed list decoding
algorithms exhibit the following significant properties. 1 The algorithm
corrects up to $n(1-\sqrt{1-D})$ errors for a (generalized) $(n, k, d=n-k+1)$
Reed-Solomon cod... |
cs/0703111 | Maximum Weighted Sum Rate of Multi-Antenna Broadcast Channels | cs.IT math.IT | Recently, researchers showed that dirty paper coding (DPC) is the optimal
transmission strategy for multiple-input multiple-output broadcast channels
(MIMO-BC). In this paper, we study how to determine the maximum weighted sum of
DPC rates through solving the maximum weighted sum rate problem of the dual
MIMO multipl... |
cs/0703113 | Automatic Selection of Bitmap Join Indexes in Data Warehouses | cs.DB | The queries defined on data warehouses are complex and use several join
operations that induce an expensive computational cost. This cost becomes even
more prohibitive when queries access very large volumes of data. To improve
response time, data warehouse administrators generally use indexing techniques
such as star... |
cs/0703114 | Clustering-Based Materialized View Selection in Data Warehouses | cs.DB | Materialized view selection is a non-trivial task. Hence, its complexity must
be reduced. A judicious choice of views must be cost-driven and influenced by
the workload experienced by the system. In this paper, we propose a framework
for materialized view selection that exploits a data mining technique
(clustering), ... |
cs/0703118 | Mathematical model of interest matchmaking in electronic social networks | cs.CY cs.AI | The problem of matchmaking in electronic social networks is formulated as an
optimization problem. In particular, a function measuring the matching degree
of fields of interest of a search profile with those of an advertising profile
is proposed.
|
cs/0703120 | Sequential decoding for lossless streaming source coding with side
information | cs.IT math.IT | The problem of lossless fixed-rate streaming coding of discrete memoryless
sources with side information at the decoder is studied. A random time-varying
tree-code is used to sequentially bin strings and a Stack Algorithm with a
variable bias uses the side information to give a delay-universal coding system
for lossl... |
cs/0703123 | Adaptive Methods for Linear Programming Decoding | cs.IT math.IT | Detectability of failures of linear programming (LP) decoding and the
potential for improvement by adding new constraints motivate the use of an
adaptive approach in selecting the constraints for the underlying LP problem.
In this paper, we make a first step in studying this method, and show that it
can significantly... |
cs/0703124 | Modelling Complexity in Musical Rhythm | cs.AI | This paper constructs a tree structure for the music rhythm using the
L-system. It models the structure as an automata and derives its complexity. It
also solves the complexity for the L-system. This complexity can resolve the
similarity between trees. This complexity serves as a measure of psychological
complexity f... |
cs/0703125 | Intrinsic dimension of a dataset: what properties does one expect? | cs.LG | We propose an axiomatic approach to the concept of an intrinsic dimension of
a dataset, based on a viewpoint of geometry of high-dimensional structures. Our
first axiom postulates that high values of dimension be indicative of the
presence of the curse of dimensionality (in a certain precise mathematical
sense). The ... |
cs/0703127 | Isochronous Data Transmission With Rates Close to Channel Capacity | cs.IT math.IT | The existing ARQ schemes (including a hybrid ARQ) have a throughput depending
on packet error probability. In this paper we describe a strategy for delay
tolerant applications which provide a constant throughput until the algorithm
robustness criterion is not failed. The algorithm robustness criterion is
applied to f... |
cs/0703129 | A theorem on the quantum evaluation of Weight Enumerators for a certain
class of Cyclic Codes with a note on Cyclotomic cosets | cs.IT math.IT quant-ph | This note is a stripped down version of a published paper on the Potts
partition function, where we concentrate solely on the linear coding aspect of
our approach. It is meant as a resource for people interested in coding theory
but who do not know much of the mathematics involved and how quantum
computation may prov... |
cs/0703130 | Space-contained conflict revision, for geographic information | cs.AI | Using qualitative reasoning with geographic information, contrarily, for
instance, with robotics, looks not only fastidious (i.e.: encoding knowledge
Propositional Logics PL), but appears to be computational complex, and not
tractable at all, most of the time. However, knowledge fusion or revision, is a
common operat... |
cs/0703131 | Open Access Scientometrics and the UK Research Assessment Exercise | cs.IR cs.DL | Scientometric predictors of research performance need to be validated by
showing that they have a high correlation with the external criterion they are
trying to predict. The UK Research Assessment Exercise (RAE), together with the
growing movement toward making the full-texts of research articles freely
available on... |
cs/0703132 | Structure induction by lossless graph compression | cs.DS cs.IT cs.LG math.IT | This work is motivated by the necessity to automate the discovery of
structure in vast and evergrowing collection of relational data commonly
represented as graphs, for example genomic networks. A novel algorithm, dubbed
Graphitour, for structure induction by lossless graph compression is presented
and illustrated by... |
cs/0703133 | Computing Good Nash Equilibria in Graphical Games | cs.GT cs.DS cs.MA | This paper addresses the problem of fair equilibrium selection in graphical
games. Our approach is based on the data structure called the {\em best
response policy}, which was proposed by Kearns et al. \cite{kls} as a way to
represent all Nash equilibria of a graphical game. In \cite{egg}, it was shown
that the best ... |
cs/0703134 | Automatic Generation of Benchmarks for Plagiarism Detection Tools using
Grammatical Evolution | cs.NE cs.IT math.IT | This paper has been withdrawn by the authors due to a major rewriting.
|
cs/0703135 | Dependency Parsing with Dynamic Bayesian Network | cs.CL cs.AI | Exact parsing with finite state automata is deemed inappropriate because of
the unbounded non-locality languages overwhelmingly exhibit. We propose a way
to structure the parsing task in order to make it amenable to local
classification methods. This allows us to build a Dynamic Bayesian Network
which uncovers the sy... |
cs/0703136 | Uncovering Plagiarism Networks | cs.IT cs.SI math.IT | Plagiarism detection in educational programming assignments is still a
problematic issue in terms of resource waste, ethical controversy, legal risks,
and technical complexity. This paper presents AC, a modular plagiarism
detection system. The design is portable across platforms and assignment
formats and provides ea... |
cs/0703138 | Reinforcement Learning for Adaptive Routing | cs.LG cs.AI cs.NI | Reinforcement learning means learning a policy--a mapping of observations
into actions--based on feedback from the environment. The learning can be
viewed as browsing a set of policies while evaluating them by trial through
interaction with the environment. We present an application of gradient ascent
algorithm for r... |
cs/0703141 | Constructive Conjugate Codes for Quantum Error Correction and
Cryptography | cs.IT math.IT | A conjugate code pair is defined as a pair of linear codes either of which
contains the dual of the other. A conjugate code pair represents the essential
structure of the corresponding Calderbank-Shor-Steane (CSS) quantum
error-correcting code. It is known that conjugate code pairs are applicable to
quantum cryptogra... |
cs/0703142 | Pragmatic Space-Time Trellis Codes for Block Fading Channels | cs.IT math.IT | A pragmatic approach for the construction of space-time codes over block
fading channels is investigated. The approach consists in using common
convolutional encoders and Viterbi decoders with suitable generators and rates,
thus greatly simplifying the implementation of space-time codes. For the design
of pragmatic s... |
cs/0703143 | How much feedback is required in MIMO Broadcast Channels? | cs.IT math.IT | In this paper, a downlink communication system, in which a Base Station (BS)
equipped with M antennas communicates with N users each equipped with K receive
antennas ($K \leq M$), is considered. It is assumed that the receivers have
perfect Channel State Information (CSI), while the BS only knows the partial
CSI, pro... |
cs/0703144 | On The Capacity Of Time-Varying Channels With Periodic Feedback | cs.IT math.IT | The capacity of time-varying channels with periodic feedback at the
transmitter is evaluated. It is assumed that the channel state information is
perfectly known at the receiver and is fed back to the transmitter at the
regular time-intervals. The system capacity is investigated in two cases: i)
finite state Markov c... |
cs/0703149 | Exploring Logic Artificial Chemistries: An Illogical Attempt? | cs.NE nlin.AO | Robustness to a wide variety of negative factors and the ability to
self-repair is an inherent and natural characteristic of all life forms on
earth. As opposed to nature, man-made systems are in most cases not inherently
robust and a significant effort has to be made in order to make them resistant
against failures.... |
cs/0703151 | Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO
Relay Network | cs.IT math.IT | This paper considers the setup of a parallel MIMO relay network in which $K$
relays, each equipped with $N$ antennas, assist the transmitter and the
receiver, each equipped with $M$ antennas, in the half-duplex mode, under the
assumption that $N\geq{M}$. This setup has been studied in the literature like
in \cite{nab... |
cs/0703154 | A Hot Channel | cs.IT math.IT | This paper studies on-chip communication with non-ideal heat sinks. A channel
model is proposed where the variance of the additive noise depends on the
weighted sum of the past channel input powers. It is shown that, depending on
the weights, the capacity can be either bounded or unbounded in the input
power. A neces... |
cs/0703156 | Case Base Mining for Adaptation Knowledge Acquisition | cs.AI | In case-based reasoning, the adaptation of a source case in order to solve
the target problem is at the same time crucial and difficult to implement. The
reason for this difficulty is that, in general, adaptation strongly depends on
domain-dependent knowledge. This fact motivates research on adaptation
knowledge acqu... |
cs/9308101 | Dynamic Backtracking | cs.AI | Because of their occasional need to return to shallow points in a search
tree, existing backtracking methods can sometimes erase meaningful progress
toward solving a search problem. In this paper, we present a method by which
backtrack points can be moved deeper in the search space, thereby avoiding this
difficulty. ... |
cs/9308102 | A Market-Oriented Programming Environment and its Application to
Distributed Multicommodity Flow Problems | cs.AI | Market price systems constitute a well-understood class of mechanisms that
under certain conditions provide effective decentralization of decision making
with minimal communication overhead. In a market-oriented programming approach
to distributed problem solving, we derive the activities and resource
allocations for... |
cs/9309101 | An Empirical Analysis of Search in GSAT | cs.AI | We describe an extensive study of search in GSAT, an approximation procedure
for propositional satisfiability. GSAT performs greedy hill-climbing on the
number of satisfied clauses in a truth assignment. Our experiments provide a
more complete picture of GSAT's search than previous accounts. We describe in
detail the... |
cs/9311101 | The Difficulties of Learning Logic Programs with Cut | cs.AI | As real logic programmers normally use cut (!), an effective learning
procedure for logic programs should be able to deal with it. Because the cut
predicate has only a procedural meaning, clauses containing cut cannot be
learned using an extensional evaluation method, as is done in most learning
systems. On the other... |
cs/9311102 | Software Agents: Completing Patterns and Constructing User Interfaces | cs.AI | To support the goal of allowing users to record and retrieve information,
this paper describes an interactive note-taking system for pen-based computers
with two distinctive features. First, it actively predicts what the user is
going to write. Second, it automatically constructs a custom, button-box user
interface o... |
cs/9312101 | Decidable Reasoning in Terminological Knowledge Representation Systems | cs.AI | Terminological knowledge representation systems (TKRSs) are tools for
designing and using knowledge bases that make use of terminological languages
(or concept languages). We analyze from a theoretical point of view a TKRS
whose capabilities go beyond the ones of presently available TKRSs. The new
features studied, o... |
cs/9401101 | Teleo-Reactive Programs for Agent Control | cs.AI | A formalism is presented for computing and organizing actions for autonomous
agents in dynamic environments. We introduce the notion of teleo-reactive (T-R)
programs whose execution entails the construction of circuitry for the
continuous computation of the parameters and conditions on which agent action
is based. In... |
cs/9402101 | Learning the Past Tense of English Verbs: The Symbolic Pattern
Associator vs. Connectionist Models | cs.AI | Learning the past tense of English verbs - a seemingly minor aspect of
language acquisition - has generated heated debates since 1986, and has become
a landmark task for testing the adequacy of cognitive modeling. Several
artificial neural networks (ANNs) have been implemented, and a challenge for
better symbolic mod... |
cs/9402102 | Substructure Discovery Using Minimum Description Length and Background
Knowledge | cs.AI | The ability to identify interesting and repetitive substructures is an
essential component to discovering knowledge in structural data. We describe a
new version of our SUBDUE substructure discovery system based on the minimum
description length principle. The SUBDUE system discovers substructures that
compress the o... |
cs/9402103 | Bias-Driven Revision of Logical Domain Theories | cs.AI | The theory revision problem is the problem of how best to go about revising a
deficient domain theory using information contained in examples that expose
inaccuracies. In this paper we present our approach to the theory revision
problem for propositional domain theories. The approach described here, called
PTR, uses ... |
cs/9403101 | Exploring the Decision Forest: An Empirical Investigation of Occam's
Razor in Decision Tree Induction | cs.AI | We report on a series of experiments in which all decision trees consistent
with the training data are constructed. These experiments were run to gain an
understanding of the properties of the set of consistent decision trees and the
factors that affect the accuracy of individual trees. In particular, we
investigated... |
cs/9406101 | A Semantics and Complete Algorithm for Subsumption in the CLASSIC
Description Logic | cs.AI | This paper analyzes the correctness of the subsumption algorithm used in
CLASSIC, a description logic-based knowledge representation system that is
being used in practical applications. In order to deal efficiently with
individuals in CLASSIC descriptions, the developers have had to use an
algorithm that is incomplet... |
cs/9406102 | Applying GSAT to Non-Clausal Formulas | cs.AI | In this paper we describe how to modify GSAT so that it can be applied to
non-clausal formulas. The idea is to use a particular ``score'' function which
gives the number of clauses of the CNF conversion of a formula which are false
under a given truth assignment. Its value is computed in linear time, without
construc... |
cs/9408101 | Random Worlds and Maximum Entropy | cs.AI | Given a knowledge base KB containing first-order and statistical facts, we
consider a principled method, called the random-worlds method, for computing a
degree of belief that some formula Phi holds given KB. If we are reasoning
about a world or system consisting of N individuals, then we can consider all
possible wo... |
cs/9408102 | Pattern Matching and Discourse Processing in Information Extraction from
Japanese Text | cs.AI | Information extraction is the task of automatically picking up information of
interest from an unconstrained text. Information of interest is usually
extracted in two steps. First, sentence level processing locates relevant
pieces of information scattered throughout the text; second, discourse
processing merges coref... |
cs/9408103 | A System for Induction of Oblique Decision Trees | cs.AI | This article describes a new system for induction of oblique decision trees.
This system, OC1, combines deterministic hill-climbing with two forms of
randomization to find a good oblique split (in the form of a hyperplane) at
each node of a decision tree. Oblique decision tree methods are tuned
especially for domains... |
cs/9409101 | On Planning while Learning | cs.AI | This paper introduces a framework for Planning while Learning where an agent
is given a goal to achieve in an environment whose behavior is only partially
known to the agent. We discuss the tractability of various plan-design
processes. We show that for a large natural class of Planning while Learning
systems, a plan... |
cs/9412101 | Wrap-Up: a Trainable Discourse Module for Information Extraction | cs.AI | The vast amounts of on-line text now available have led to renewed interest
in information extraction (IE) systems that analyze unrestricted text,
producing a structured representation of selected information from the text.
This paper presents a novel approach that uses machine learning to acquire
knowledge for some ... |
cs/9412102 | Operations for Learning with Graphical Models | cs.AI | This paper is a multidisciplinary review of empirical, statistical learning
from a graphical model perspective. Well-known examples of graphical models
include Bayesian networks, directed graphs representing a Markov chain, and
undirected networks representing a Markov field. These graphical models are
extended to mo... |
cs/9412103 | Total-Order and Partial-Order Planning: A Comparative Analysis | cs.AI | For many years, the intuitions underlying partial-order planning were largely
taken for granted. Only in the past few years has there been renewed interest
in the fundamental principles underlying this paradigm. In this paper, we
present a rigorous comparative analysis of partial-order and total-order
planning by foc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.