In this paper, a robust adaptive MMSE Rake-equalizer receiver scheme is presented with channel estimation that has been transmitted in Direct Sequence-Ultra Wideband (DS-UWB) system. The DS-UWB has a fine path resolution by transmitting information with ultra short pulses. The Rake receiver is known as a technique that can effectively combine paths with different delays and obtain the path dive...

A sequence a1a2 . . . a2n such that ai = an+i for all 1 ≤ i ≤ n is called a repetition. A sequence S is called non-repetitive if no subsequence of consecutive terms of S is a repetition. Let G be a graph whose vertices are coloured. A path in G is a called nonrepetitive if the sequence of colours of its vertices is non-repetitive. If G is a plane graph, a facial non-repetitive vertex colouring ...

We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, generalizing a results of Faudree and Schelp [4], and Dzido, Kubale and Piwakowski [2, 3].

A recommendation method based on heterogeneous information networks and multiple trust relationships is proposed. Firstly, the node sequence in network obtained through random walk of meta-path, representation vector each different paths generated. The user similarity meta-path by calculating spatial distance between vectors. Then, according to among users, trust-relationship calculation method...

Holonomic quantum computation exploits a state's nontrivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces continuous path through parameter space have been well researched. Discrete holonomies, on other hand, state jumps point in space, had little prior investigation. Using sequence of incomplete pro...

The popularity of the autonomous driving requires to establish a data communication path among vehicles. Due its low price and easy deployment, WiFi device is possible approach. Motivated by this, in this paper, we study performance IEEE 802.11a for vehicle-to-vehicle communication. We especially focus on impact multi-path Doppler spreading time synchronization, which main challenges due high m...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

We analyze task reallocation where individually rational (IR) agents (re)contract tasks among themselves based on marginal costs. A task allocation graph is introduced as a tool for analyzing contract types. Traditional single task contracts always have a short path (sequence of contracts) to the optimal task allocation but an IR path may not exist, or it may not be short. We analyze an algorit...

We analyze task reallocation where individually rational ([R) agents (re)contract tasks among themselves based on marginal costs. A task allocation graph is introduced as a tool for analyzing contract types. Traditional single task contracts always have a short path (sequence of contracts) to the optimal task allocation but an IR path may not exist, or it may not be short. We analyze an algorit...

This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...