A minimization (resp., maximization) problem is called fixed parameter (r, t)-hard for two r, t if there does not exist an algorithm that given a problem instance I with optimum value opt and an integer k, either finds a feasible solution of value at most r(k) · k (resp., at least k/r(k)) in time t(k) or finds in time t(k) a certificate that k < opt (resp., k > opt) in time t(k) · |I|O(1) for s...

In this paper, we present an efficient rapid system design framework for fuzzy systems. Considering hardware and software capability, the given system specification is broken into two components: conceptual and parameter specifications. The conceptual specification contains the system core, which is unchanged throughout the simulation phase and can be implemented in hardware at an early stage. ...

Over the decades, computational models of human cognition have advanced from programs that produce output similar to that of human problem solvers to systems that mimic both the products and processes of human performance. In this paper, we describe a model that achieves the next step in this progression: predicting individual participants’ performance across multiple tasks after estimating a s...

We study the fixed-parameter tractability of the constraint satisfaction problem. We restrict constraint relations to languages in a family of NP-hard languages, classified by a purely combinatorial criterion that generalizes Boolean matrices with fixed row and column sum. For various natural and established structural parameterizations of the instances, we characterize the fixed-parameter trac...

We propose that a new parameter, the set of link stability functions, should be taken into consideration when selecting a route for reliable data transmission in an Ad Hoc Network. Due to this parameter, any proposed routing algorithm must explicitly take into consideration the data transmission method. Polynomial time routing algorithms for both the store-forward and cut-through methods are pr...

Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is t...