检索结果-内蒙古大学图书馆

Joint 5th international Conference on Soft Computing and Intelligent Systems and 11th international symposium on Advanced Intelligent Systems, SCIS and ISIS 2010

作者： Yamaguchi, Akihiro Ikeda, Tatsuya Teshima, Ryusuke Department of Information and Systems Engineering Fukuoka Institute of Technology Wajiro-Higashi 1-30-1 Higashi-Ku Fukuoka Japan Fukuoka Institute of Technology Graduate School of Engineering Wajiro-Higashi 1-30-1 Higashi-Ku Fukuoka Japan

A search method of the complex-valued spreading sequences that exhibits good correlation property for the code division multiple access (CDMA) communication, is investigated in terms of Genetic Algorithm (GA). the search problem of the spreading sequence is formalized as the combinatorial optimization problem that maximizes the fitness function for correlations. To solve this problem, a search method of suboptimal solutions based on simple GA is designed. As results, obtained suboptimal solutions are evaluated by their correlation characteristics and bit error rate (BER) for the CDMA communication.

关键词： code division multiple access

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC ALIGNMENT OF ARRAY DATA AND PROCESSES TO REDUCE COMMUNICATION TIME ON DMPPS 95

AUTOMATIC ALIGNMENT OF ARRAY DATA AND PROCESSES TO REDUCE CO...

引用

5th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

作者： PHILIPPSEN, M ICSI International Computer Science Institute Berkeley CA and Dept. of Informatics University of Karlsruhe

ISBN: (纸本)9780897917001

this paper investigates the problem of aligning array data and processes in a distributed-memory implementation. We present complete algorithms for compile-time analysis, the necessary program restructuring, and subsequent code-generation, and discuss their complexity. We finally evaluate the practical usefulness by quantitative experiments. the technique presented analyzes complete programs, including branches, loops, and nested parallelism. Alignment is determined with respect to offset, stride, and general ass's relations. Pplacement of both data and processes are computed in a unifying framework based on an extended preference graph and its analysis. Dynamic redistributions are derived. the experimental results are very encouraging. the optimization algorithms implemented in our Modula-2* compiler improved the execution times of the programs by an average over 40% on a MasPar MP-1 with 16384 processors.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic stochastic EPEC model for competition of dominant producers in generation expansion planning 5

Dynamic stochastic EPEC model for competition of dominant pr...

引用

5th international symposium on Environment-Friendly Energies and Applications (EFEA)

作者： Valinejad, Jaber Marzband, Mousa Barforoshi, Taghi Kyyra, Jorma Pouresmaeil, Edris Virginia Tech Bradley Dept Elect & Comp Engn Falls Church VA 22043 USA Northumbria Univ Dept Phys & Elect Engn Newcastle Upon Tyne Tyne & Wear England Noshirvani Univ Technol Dept Elect & Comp Engn Babol Sar Iran Aalto Univ Dept Elect Engn & Automat Espoo Finland

ISBN: (纸本)9781538655177

this paper aims to presents dynamic stochastic an equilibrium problem with equilibrium constraints (DSEPEC) model to invistigate the generation capacity expansion at a certain time horizon and the presence of dominant producers. the DSEPEC model is proposed while there is an uncertainty in the predicted demand, and it is modeled based on discrete Markov model. Each dominant producer is modeled by a bi-level optimization problem so that the first level and the second level provide models for the investment and operation decisions, respectively. the supply function equilibrium (SFE) is used for short-term electricity market. then, each bi-level model is convert to dynamic stochastic mathemathical problem with equilibrium constraints (DSMPEC). To convert DSEPEC to an auxiliary MILP problem, Karush-Kuhn-Tucker (KKT) conditions as well as primal-dual transformation. A sample two-buses power network is employed for simulation and necessary analysis to confirm the efficiency of the proposed framework.

关键词： generation expansion EPEC MPEC multi-stage planning Dynamic stochastic model

来源：评论

学校读者我要写书评

暂无评论

Downlink joint detection in TD-SCDMA for hardware implementation 5

Downlink joint detection in TD-SCDMA for hardware implementa...

引用

5th international Conference on ASIC

作者： Tu, CJ Lin, R Liu, BA Chen, HY Tsing Hua Univ Inst Microelect Beijing 100084 Peoples R China

ISBN: (纸本)078037889X

Time Division Synchronous code Division Multiple Access (TD-SCDMA) is the time division duplex (TDD) inode in the 3rd generation mobile radio system. Typical joint detection techniques can only be used in uplink due to its high computational complexity in TD-SCDMA system. A novel joint detection designed for hardware implementation is introduced in this paper. By dividing the matrix into smaller sub-blocks, the complexity of matrix manipulation is reduced. Computer simulations of bit error rate (BER) are performed and the complexity reduction is also analyzed. the algorithm will be proved to have low complexity, which can enable chip designer to implement joint detection in a TD-SCDMA baseband receiver.

关键词： 3G mobile communication code division multiple access time division multiple access communication complexity signal detection downlink joint detection TD-SCDMA hardware implementation time division synchronous code division multiple access time division duplex 3rd generation mobile radio system joint detection techniques computational complexity matrix manipulation computer simulations bit error rate BER complexity reduction baseband receiver

来源：评论

学校读者我要写书评

暂无评论

An interactive model generator/preprocessor for the multidisciplinary optimization of aircraft

An interactive model generator/preprocessor for the multidis...

引用

5th symposium on Multidisciplinary Analysis and optimization, 1994

作者： Stevens, Donald C. Striz, Alfred G. Yurkovich, Rudy N. Simula Inc. PhoenixAZ85044-5299 United States The University of Oklahoma NormanOK73019-0601 United States McDonnell Douglas Corporation St. LouisMO63 166 United States

the purpose of this project was to develop a dedicated software program which would simplify and partially automate the preparation of the extensive input data decks required for structural analysis and optimization with aeroelastic constraints. the result is ASTRIGS, the ASTROS Input generation System, which was developed at the University of Oklahoma under the sponsorship of McDonnell Douglas Aerospace. Within the Microsoft®W indows™ environment for personal computers, this preprocessor and model generator queries the user as to the configuration of the aircraft to be modeled and the parameters governing its analysis and optimization. From the responses to its "tree" of queries, the code creates a complete input data deck in ASCII code format. In addition to synthesizing a model, the program also displays a graphical image of the wing as it was described by the user’s input and displays the generated data deck on the screen for inspection. Currently, the ASTRIGS output data deck file format is tailored to the NASTRAN-based multidisciplinary structural optimization code ASTROS, however, the concept is easily adapted to other optimization codes. the most significant result and principal benefit of such a dedicated preprocessor is the reduction in the time required to build a model from days to a matter of minutes. Additional benefits include the automation of tedious and error-prone modeling tasks and the ability to inspect the model in graphical as well as text format to insure that the data correctly describe the intended configuration. © 1994 by the American Institute of Aeronautics and Astronautics, Inc., All rights reserved.

关键词： Structural optimization

来源：评论

学校读者我要写书评

暂无评论

Bit-width optimization of Extrinsic Information in Turbo Decoder

Bit-width Optimization of Extrinsic Information in Turbo Dec...

引用

5th international symposium on Turbo codes and Related Topics

作者： Singh, Ashwani Boutillon, Emmanuel Masera, Guido Politecn Torino Dept Elect VLSI Lab I-10129 Turin Italy European Univ Bretagne CNRS UBS Lab-STICC Lorient France

ISBN: (纸本)9781424428625

Soft Input Soft Output (SISO) decoders iteratively exchanging intermediate results (extrinsic information) between themselves lie at the core of turbo decoder architectures. the implementation architecture could be serial, parallel or network on chip (NoC) based. In this paper, we present a technique for bit-width reduction of exchanged extrinsic information and analyze the impact of it for different implementation architectures. the methodology is investigated over two kinds of turbo decoding system, both based on the Max-Log-MAP algorithm. First is a serial concatenated convolutional code (SCCC) decoder and the other is a WiMax (IEEE 802.16e) parallel concatenated convolutional code (PCCC) decoder. For the SCCC decoder, bitwidth of the extrinsic information can be reduced from 8 bits down to 4 without significant bit-error-rate (BER) degradation. For the WiMax case it can be reduced from 8 bits down to 5 with a BER degradation of 0.2 dB.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Surface remeshing by local hermite diffuse interpolation

引用

international JOURNAL FOR NUMERICAL MEthODS IN ENGINEERING 2000年第1-2期49卷 31-49页

作者： Rassineux, A Villon, P Savignat, JM Stab, O Univ Technol Compiegne CNRS URA 1505 F-60205 Compiegne France Ecole Natl Super Mines Paris CGES F-77305 Fontainebleau France

We propose a method to build a three-dimensional adapted surface mesh with respect to a mesh size map driven by surface curvature. the data needed to optimize the mesh have been reduced to an initial mesh. the building of a local geometrical model but continuous over the whole domain is based on a local Hermite diffuse interpolation calculated from the nodes of the initial mesh and from the normal vectors to the surface. the optimization procedures involve extracting from the surface mesh sets of triangles sharing the same node or the same edge and then remeshing the outer contour to a higher criterion (size or shape). these procedures may be used in order to refine or coarsen the mesh but also in a final step to enhance the shape quality of the elements. Examples demonstrate the ability of the method to create adapted meshes of complex surfaces while meeting high-quality standards and a good respect of the geometrical surface. Copyright (C) 2000 John Wiley & Sons, Ltd.

关键词： unstructured mesh generation mesh adaptation mesh optimization moving least squares diffuse approximation

来源：评论

学校读者我要写书评

暂无评论

Optical Design and Multi-Objective optimization for U-type 2X Zoom Projection Optics

Optical Design and Multi-Objective Optimization for U-type 2...

引用

5th international symposium on Advanced Optical Manufacturing and Testing Technologies - Advanced Optical Manufacturing Technologies

作者： Sun, Jung-Hung Fang, Yi-Chin Hsueh, Bo-Ren Natl Kaohsiung First Univ Sci & Technol Dept Mech & Automat Engn 2 Juoyue Rd Kaohsiung Taiwan Natl Kaohsiung First Univ Sci & Technol Grad Electro Opt Engn Kaohsiung Taiwan Natl Kaohsiung First Univ Sci & Technol Inst Engn Sci & Technol Kaohsiung Taiwan

ISBN: (纸本)9780819480859

When a U-type 2X zoom optical lens design for Digital Light Processing (DLP) projector was designed by code V, we found that the MTF and RI values at position 1 of the maximum field are less then 10% (MTF) and 60% (RI) at 50 lp/mm, which didn't conform the lowest performance. But if we corrected the design to improve the value of MTF, then RI value would become lower and probably not match the requirement relatively. In order to achieve the optimal values of MTF and RI simultaneously, we employed the integration of the Taguchi method and the robust multiple criterion optimization (RMCO) approach to solve such a multiple objective (MTF and RI) optimization problem.

关键词： Optical Design Taguchi Methods robust multiple criterion optimization (RMCO) approach Miniature Projector U-type

来源：评论

学校读者我要写书评

暂无评论

Enhancing Robustness for Automated Mobile Network optimization by Uncovering Causal Relationships 19

Enhancing Robustness for Automated Mobile Network Optimizati...

引用

19th international symposium on Wireless Communication Systems (ISWCS)

作者： Sousa, M. Vieira, P. Queluz, M. P. Rodrigues, A. Inst Telecomunicacoes Lisbon Portugal CELFINET Lisbon Portugal Inst Super Engn Lisboa Lisbon Portugal Inst Super Tecn Lisbon Portugal

ISBN: (纸本)9798350362527;9798350362510

the progression toward autonomous Mobile Wireless Networks (MWNs) is underway in anticipation of the forthcoming 6th generation (6G), where native Artificial Intelligence (AI) capabilities are being considered imperative. therefore, as the drive to incorporate AI into MWNs advances, robustness and explainability emerge as critical attributes in facilitating a seamless integration of AI/Machine Learning (ML) models. In this context, the concept of causality, which is mostly absent from AI/ML models, can enhance the robustness and explainability of such models, thereby contributing to the realization of AInative MWNs. this paper presents a data-driven methodology employing unsupervised learning and causal concepts to identify network performance patterns and their underlying causal factors towards optimizing network performance. the methodology extends previous work to exploit the temporal domain of timebased data, as found in Performance Management (PM) data, while including radio coverage data in the causal relationships' analyses by resorting to a propagation model, the Ubiquitous Satellite Aided Radio Propagation (USARP). the methodology was evaluated with data from a live 5th generation (5G) network. Notably, a causal association between a group of Base Stations (BSs) with lower performance and a Configuration Management (CM) parameter was identified, providing an immediate optimization action to enhance the network performance. As a datadriven, unsupervised, and causal-based approach, the proposed methodology is a step towards identifying robust optimization actions and pursuing enhanced autonomy for MWNs.

关键词： Mobile Networks Network optimization Artificial Intelligence Causality Performance Management

来源：评论

学校读者我要写书评

暂无评论

Biped Robot Joint Trajectory generation Using PSO Evolutionary Algorithm

Biped Robot Joint Trajectory Generation Using PSO Evolutiona...

引用

3rd Joint Conference of AI and Robotics / 5th RoboCup Iran Open international symposium

作者： Aghaabbasloo, Mohammad Azarkaman, Mostafa Salehi, Mostafa E. Islamic Azad Univ Qazvin Branch Mechatron Res Lab Qazvin Iran

ISBN: (纸本)9781467363150

In last decades, interest in biped robots (specially humanoid robots) have been growing up. Stable Walking is one of the critical challenging problems in these kinds of robots and many researches have been done to achieve a walking model similar to human. Central Pattern Generator (CPG) is one of the biological gait generation models which can produce complex nonlinear oscillation as a pattern for walking. In our model we use polynomial equation for the support leg and Sinusoid Fourier series equation for the swing leg in sagittal plane for producing a single step of walk. For balancing, the same values are used for both swing and support leg with Sinusoid Fourier series equation in frontal plane. PSO is used as an evolutionary algorithm to optimize equation parameters and achieve the best speed and performance in walking.

关键词： Humanoid Robot Biped RobotWalking Central Pattern Generator(CPG) Particle Swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：