—In this paper, the problem sharing resource among selfish nodes and cooperative partner selection are considered in wireless networks. Each wireless node can act as not only a source, but also a potential relay in the system model. The cooperative partners are willing to jointly adjust their power levels and channel bandwidth for cooperative relaying so that an extra rate increase can be achi...

To sense the spectrum efficiently in heterogeneous multi-channel and multi-user cognitive network, a parallel cooperative spectrum sensing strategy based on genetic algorithm is proposed. It defines the expression of system utility considering the transmission gain and sensing overhead, and protects the primary user network by introducing the penalty function. To obtain the largest system utili...

A new method namely, reduction method is proposed for finding an optimal solution of solid assignment problems. The proposed method does not based on the Hungarian method. With help of a numerical example, the reduction method is illustrated. The solution obtained by the proposed method will help the decision makers to take an appropriate action when they are handling various types of three dim...

Last time we finished the discussion about KM algorithm and its application. We also covered sparse Fourier representations and k-juntas of parities. In the end we started to talk about learning monotone Boolean functions and influence of such functions. Today We will first finish discussion about learning monotone Boolean functions. Then we will also talk about learning k-juntas of halfspaces....

We present a k-means-based clustering algorithm, which optimizes mean square error, for given cluster sizes. A straightforward application is balanced clustering, where the sizes of each cluster are equal. In k-means assignment phase, the algorithm solves the assignment problem by Hungarian algorithm. This is a novel approach, and makes the assignment phase time complexity O(n), which is faster...

This paper presents a method for parsing Hungarian texts using a machine learning approach. The method collects the initial grammar for a learner from an annotated corpus with the help of tree shapes. The PGS algorithm, an improved version of the RGLearn algorithm, was developed and applied to learning tree patterns with various phrase types described by regular expressions. The method also cal...

The aim of this paper is to propose a cross-cultural approach to contemporary Hungarian-German minority literature comprising texts written both in German and in Hungarian in order to give an adequate description of the Hungarian-German minority’s literary scene. Also, the significance of this specific minority literature within the context of culture and heritage conservation and its true iden...

1 The work described in the paper is supported by the ESPRIT project WINPAR No. 23516, the Hungarian-German Intergovernmental TéT project GRADEOMIS No. D-62/96, the Hungarian-Portuguese Intergovernmental TéT project Graphical Quality No. P-12/97 and by the OMFB project WINPARDEBUGGER No. E151/98.04.03. Abstract The paper introduces the concept of collective breakpoints and classifies the possib...

................................................................................................................. 75 ABSTRACT IN HUNGARIAN (ÖSSZEFOGLALÁS) ............................................ 76IN HUNGARIAN (ÖSSZEFOGLALÁS) ............................................ 76

This paper discusses efficient parallel algorithms for obtaining strong lower bounds and exact solutions for large instances of the Quadratic Assignment Problem (QAP). Our parallel architecture is comprised of both multi-core processors and Compute Unified Device Architecture (CUDA) enabled NVIDIA Graphics Processing Units (GPUs) on the Blue Waters Supercomputing Facility at the University of I...