Massive MIMO is a promising technology and a strong candidate for future-generation wireless systems. This paper describes some aspects of realistic algorithm design of a 128-antenna prototype, including low-complexit...
详细信息
ISBN:
(纸本)9781509021369
Massive MIMO is a promising technology and a strong candidate for future-generation wireless systems. This paper describes some aspects of realistic algorithm design of a 128-antenna prototype, including low-complexity algorithms and feasible designs such as equivalent channel acquisition at the BS by SRS, SINR estimation at the BS, CQI estimation at the UE, DMRS design and IRC receiver implementation, etc. Finally, the link-level simulation shows the effectiveness and benefits of the proposed algorithms and designs.
We describe and analyze a co-design of algorithm and software for high-performance simulation of a partial differential equation (PDE) numerical solver for large-scale datasets. Large-scale scientific simulations invo...
详细信息
ISBN:
(纸本)9781728112954
We describe and analyze a co-design of algorithm and software for high-performance simulation of a partial differential equation (PDE) numerical solver for large-scale datasets. Large-scale scientific simulations involving parallel Fast Fourier Transforms (FFTs) have extreme memory requirements and high communication cost. This hampers high resolution analysis with fine grids. Moreover, it is difficult to accelerate legacy Fortran scientific codes with modern hardware such as GPUs because of memory constraints of GPUs. Our proposed solution uses signal processing techniques such as lossy compression and domain-local FFTs to lower iteration cost without adversely impacting accuracy of the result. In this work, we discuss proof-of-concept results for various aspects of algorithm development.
A crucial problem in modern data science is data-driven algorithm design, where the goal is to choose the best algorithm, or algorithm parameters, for a specific application domain. In practice, we often optimize over...
详细信息
ISBN:
(纸本)9781538642306
A crucial problem in modern data science is data-driven algorithm design, where the goal is to choose the best algorithm, or algorithm parameters, for a specific application domain. In practice, we often optimize over a parametric algorithm family, searching for parameters with high performance on a collection of typical problem instances. While effective in practice, these procedures generally have not come with provable guarantees. A recent line of work initiated by a seminal paper of Gupta and Roughgarden [1] analyzes application-specific algorithm selection from a theoretical perspective. We progress this research direction in several important settings. We provide upper and lower bounds on regret for algorithm selection in online settings, where problems arrive sequentially and we must choose parameters online. We also consider differentially private algorithm selection, where the goal is to find good parameters for a set of problems without divulging too much sensitive information contained therein. We analyze several important parameterized families of algorithms, including SDP-rounding schemes for problems formulated as integer quadratic programs as well as greedy techniques for several canonical subset selection problems. The cost function that measures an algorithm's performance is often a volatile piecewise Lipschitz function of its parameters, since a small change to the parameters can lead to a cascade of different decisions made by the algorithm. We present general techniques for optimizing the sum or average of piecewise Lipschitz functions when the underlying functions satisfy a sufficient and general condition called dispersion. Intuitively, a set of piecewise Lipschitz functions is dispersed if no small region contains many of the functions' discontinuities. Using dispersion, we improve over the best-known online learning regret bounds for a variety problems, prove regret bounds for problems not previously studied, and provide matching regret lower
An algorithm for the calculation of the sequential parameters in the aircraft electrical system is designed in this paper. The original calculation model of the sequential component calculation is given as a complex f...
详细信息
ISBN:
(纸本)9789889867140
An algorithm for the calculation of the sequential parameters in the aircraft electrical system is designed in this paper. The original calculation model of the sequential component calculation is given as a complex formula which is inconvenient for the general digital programmable computation. The geometrical algorithm is presented in this paper in which the voltage vectors rotate and project to the coordinate axis to simplify the calculation. The projections on x and y coordinates may add up in algebra way, and only one projection is left on each axis. Then synthesize the two components to obtain the required sequential voltage vector. This algorithm may be used in the program design by ordinary programming languages in the fault diagnostics and protection to the electrical system. The asymmetry calculation by hand is also made possible.
The algorithms course demands high rigor to computing students. designing an algorithm requires high level of abstraction, and analyzing the algorithm also requires a mathematical apparatus. However, algorithmics is a...
详细信息
ISBN:
(纸本)9781728109305
The algorithms course demands high rigor to computing students. designing an algorithm requires high level of abstraction, and analyzing the algorithm also requires a mathematical apparatus. However, algorithmics is a topic which also is frequently associated to creativity. We conducted an exploratory study of students' creativity by examining their designs of algorithms for a given problem. In particular, we analyzed their contributions in an assignment, where they were asked to design heuristic algorithms for an optimization problem. Students' contributed algorithms were analyzed using both quantitative and qualitative methods, and the resulting categories were used to compute three components of creativity (namely fluency, flexibility and originality) as well as global creativity. About half the students hardly were creative, but about one tenth of students exhibited notable creativity.
作者：
Duan, YucongHainan Univ
Coll Informat Sci & Technol State Key Lab Marine Resource Utilizat South Chin Haikou Hainan Peoples R China
We proposed an algorithm design approach based on semantics analysis of the problem description and analysis. We showed this approach with the designing of a median selection algorithm. Following the principles of our...
详细信息
ISBN:
(纸本)9781538658895
We proposed an algorithm design approach based on semantics analysis of the problem description and analysis. We showed this approach with the designing of a median selection algorithm. Following the principles of our semantics analysis, we designed a median selection algorithm to find medians for an even amount of numbers with upper bound time complexity of O(3n).
A staple in any accredited undergraduate curriculum in Computer Science is a course in 'The design and Analysis of algorithms'. Additionally, an increasing number of universities now offer bioinformatics cours...
详细信息
ISBN:
(纸本)9781424410286
A staple in any accredited undergraduate curriculum in Computer Science is a course in 'The design and Analysis of algorithms'. Additionally, an increasing number of universities now offer bioinformatics courses and majors. This paper provides some specific algorithms and problems from bioinformatics that can be used to illustrate a variety of design techniques in an algorithms course. It first describes some fundamental biochemical prerequisite knowledge needed for a basic understanding of bioinformatics. The paper then discusses the major algorithm design techniques including brute force, divide-and-conquer, transform-and-conquer, dynamic programming, and the greedy approach. For each of these design techniques, the bioinformatics problem of nucleotide and protein sequence alignment is discussed and solved The motivation for this project stems from a desire to spice up the traditional 'design and Analysis of algorithms' course by introducing students to concepts from the exciting and rapidly expanding field of bioinformatics.
The Cole-Cole model is introduced in layered media of CSAMT to describe induced polarization effect. The Cagniard apparent resistivity amplitude is used to construct the objective function so as to extract IP paramete...
详细信息
ISBN:
(纸本)9781538664032
The Cole-Cole model is introduced in layered media of CSAMT to describe induced polarization effect. The Cagniard apparent resistivity amplitude is used to construct the objective function so as to extract IP parameters from CSAMT data. The calculation method of apparent resistivity containing IP effect is given. Then designed extraction algorithm for IP information based least square. In order to solve the objective function value fluctuation wildly and the impact caused by the size difference of model parameters, the general sense objective function is optimized. The detailed calculation process of partial derivative is given. Derived the method of model parameters changing. Finally the effectiveness of the algorithm is verified by experimental testing. The algorithm is useful to extract IP parameters from over two-dimensional medium and other electrical sounding data.
RSA is an algorithm for public-key cryptography and is considered as one of the great advances in the field of public key cryptography. RSA security lies in the difficulty of factoring large number into prime factors....
详细信息
ISBN:
(纸本)9781509041398
RSA is an algorithm for public-key cryptography and is considered as one of the great advances in the field of public key cryptography. RSA security lies in the difficulty of factoring large number into prime factors. The inventor of RSA algorithm suggests prime number that is used to generate the keys have more than 100 digits' length for security reasons. Elgamal algorithm also is one of public key cryptography algorithm. The security of this algorithm lies in the difficulty of calculating discrete logarithm. In this paper, the author proposes key generation algorithm that is considered safe from the combination of the RSA and Elgamal algorithm. Based on the experiment that has been done, the computing time required for the proposed algorithm is relatively short, compared to the original RSA algorithm.
We propose an algorithm design for a Recommender System based on a Kansei model in this paper, we called this algorithm as Kansei Recommender System (hereafter, we denoted as KRS algorithm). The purpose of KRS algorit...
详细信息
ISBN:
(纸本)9783319725505;9783319725499
We propose an algorithm design for a Recommender System based on a Kansei model in this paper, we called this algorithm as Kansei Recommender System (hereafter, we denoted as KRS algorithm). The purpose of KRS algorithm is to support designers to pre-know the appearance feeling (Kansei) of products from consumers. To complete this algorithm, we divide the algorithm design into three parts: (1) Extract Kansei factors and evaluation factors from consumers' shopping items. (2) Determine a Kansei model for KRS algorithm. (3) Making decision by using KRS algorithm. We also give a concept map of paradigm by using KRS algorithm. In conclusion, we remain the future work to implement the KRS algorithm in real case studies with different fields of enterprises.
暂无评论