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

International Conference on Information Technology for Organizations Development (IT4OD)

作者： Djeddar, Afrah Bendjenna, Hakim Amirat, Abdelkrim Roose, Philippe Univ Larbi Tebessi Dept Math & Comp Sci Lab Math Informat & Syst LAMIS Tebessa 12002 Algeria Univ Souk Ahras Dept Math & Comp Sci Lab Informat & Math Souk Ahras 41000 Algeria Univ Pau & Pays Adour Dept IUT Bayonne LIUPPA Lab F-64000 Pau France

ISBN: (纸本)9781467376891

the development of customized mobile applications basing on the composition mechanism (i.e. using existing software entities) has received a lot of attention in the last couple of years. The mobile devices heterogeneity shows that the portability requirements play an important role in the mobile applications developpement domain. Otherwise, mobile applications strongly depend on the execution environment features. Thereby, in order to make sure the correct deployment and the proper functioning of the composite mobile application it is necessary to ensure that their constituents are adaptable to the current context of the mobile device. To cope with this issue and due to the fact that several software entities can be used to implement the identified requirements for a desired mobile application, we propose in this paper a context-driven selection algorithm that aims at selecting the adaptive software entities among all corresponding ones. Also, it targets to determine the different possible composition paths to build customized mobile applications. To achieve this objective, we propose ontology based descriptions to define the context of the corresponding software entities and the execution environment.

关键词： Mobile applications selection algorithm Context Ontology Composition path

来源：评论

学校读者我要写书评

暂无评论

PWM optimisation for three-level voltage inverter based on clonal selection algorithm

引用

IET ELECTRIC POWER APPLICATIONS 2007年第6期1卷 870-878页

作者： Lou, H. Mao, C. Wang, D. Lu, J. Huazhong Univ Sci & Technol Coll Elect & Elect Engn Wuhan 430074 Peoples R China

A clonal selection algorithm (CSA) is first applied to determine the switching time for a three-level voltage pulse width modulation (PWM) inverter. To obtain an optimal PWM switching pattern, CSA should calculate a set of nonlinear transcendental equations with nonlinear equality and inequality constraints. Unlike the general CSA by penalising infeasible solutions, this new CSA deals with constraints and guides the search to the true optimum solution by an infeasibility degree with a random disturbance (IFDD) selection operation. The proposed method minimise the total harmonic distortion and generates a waveform with adjustable amplitude of the fundamental component. Calculation results verify that the proposed method is efficient to obtain the optimal PWM switching pattern and is superior to natural sampling and genetic algorithm-based PWM switching pattern.

关键词： Total harmonic distortion voltage inverter switching pattern Clonal selection inequality constraint waveforms selection algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Privacy-Aware Fast selection algorithm for Large-Scale Data

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2018年第2期29卷 365-376页

作者： Liu, Hao Chen, Jiming Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China

Finding the k smallest/largest element of a large array, i.e., k-selection is a fundamental supporting algorithm in data analysis. Due to the fact that big data born in geo-distributed environments, it especially requires communication-efficient distributed k-selection, besides typical computation and memory efficiency. Moreover, sensitive organizations make data privacy a rigorous precondition for their participation in such distributed statistical analysis for common profit. To this end, we propose a Distributed Privacy-Aware Median (DPAM) selection algorithm for median selection in distributed large-scale data while preserving local statistics privacy, and extend it to arbitrary k-selection. DPAM utilizes mean to approximate median, via contraction of the standard deviation. It is the theoretical fastest with a worst computation complexity of O(N), and also highly efficient in communication overhead (in logarithm of data range). To preserve is an element of-differential privacy of local statistics, DPAM randomly adds dummy elements (the number follows a rounded Laplacian distribution) to local data. The noise does not degrade the estimation precision or convergence rate. Performance of DPAM is compared with centralized/distributed quick select and optimization, in terms of complexity and privacy preserving ability. Extensive simulation and experiment results show the higher efficiency of DPAM.

关键词： Privacy distributed computing selection algorithm distributed optimization

来源：评论

学校读者我要写书评

暂无评论

Prosthesis choice for transcatheter aortic valve replacement: Improved outcomes with the adoption of a patient-specific transcatheter heart valve selection algorithm

引用

INTERNATIONAL JOURNAL OF CARDIOLOGY 2016年 203卷 1009-1010页

作者： Barbanti, Marco Imme, Sebastiano Ohno, Yohei Gulino, Simona Todaro, Denise Sgroi, Carmelo Tamburino, Claudia Patane, Martina Pilato, Gerlando Capodanno, Davide Tamburino, Corrado Univ Catania Ferrarotto Hosp Div Cardiol I-95124 Catania Italy ETNA Fdn Catania Italy

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL selection algorithm

引用

BIT 1984年第3期24卷 274-287页

作者： GUPTA, P BHATTACHARJEE, GP INDIAN INST TECHNOL DEPT MATHKHARAGPUR 721302W BENGALINDIA

The problem of selecting thekth largest or smallest element of {x i +y j |x i εX andy j εY ∀i,j} whereX=(x1,x2, ..,x n ) andY=(y1,y2, ...,y n ) are two arrays ofn elements each, is considered. Certain improvements to an existing algorithm are proposed. An algorithm requiringO(logk·logn) units of time on a Shared Memory Model of a parallel computer havingO(n1+1/β) processors is presented where β is a pre-assigned constant lying between 1 and 2.

关键词： Computational Mathematic selection algorithm Parallel Computer Small Element Memory Model

来源：评论

学校读者我要写书评

暂无评论

A selection algorithm for Power Controller Unit of Hybrid Vehicles

A Selection Algorithm for Power Controller Unit of Hybrid Ve...

引用

14th International IEEE Conference on Intelligent Transportation Systems (ITSC)

作者： Chin, Hubert H. Jafari, Ayat A. New York Inst Technol Elect Engn & Comp Sci Dept Old Westbury NY 11568 USA

ISBN: (纸本)9781457721977

This paper presents an adaptive power management control strategy that is based on selection algorithm for controlling gas engines and electric motor torque. The state of the art hybrid vehicle technology determines the instantaneous power split in order to increase energy efficiency. The selection algorithm, contained by the power controller unit, uses inputs of analog sensors along with commands from driver's desired speed and makes a selection of outputs from preassigned control states. These states are stored in a knowledge base for revealing engine and motor mixed control strategies. The objectives of the control strategies are to minimize fuel consumption, reduce engine-out emissions, maintain higher level safety, and keep passenger and driver's comfort as the current system.

关键词： Hybrid Vehicles Intelligent Vehicles Knowledge Base selection algorithm Power Controller

来源：评论

学校读者我要写书评

暂无评论

Interference Aware Network Function selection algorithm for Next Generation Networks 5

Interference Aware Network Function Selection Algorithm for ...

引用

5th IEEE Conference on Network Softwarization (IEEE NetSoft) / 2nd International Workshop on Advances in Slicing for Softwarized Infrastructures (S4SI)

作者： Reddy, Venkatarami Garg, Gaurav Tamma, Bheemarjuna Reddy Franklin, Antony A. IIT Hyderabad Dept CSE Hyderabad India

ISBN: (纸本)9781538693766

Service Function Chaining (SFC) is used to steer the traffic to a specific set of Network Functions (NFs) (such as load balancer, proxy, firewall, etc.) based on the type of traffic and operator policy. Handling the massive amount of user traffic envisioned in the next generation networks using traditional techniques is costly and tedious. By leveraging advanced technologies such as Network Functions Virtualization (NFV) and Software Defined Networking (SDN), NFs can be deployed as software instances on Virtual Machines (VMs) (also called as Virtual Network Function (VNF)). Network operators widely place different types of VNFs at different locations to meet the user traffic demands. Multiple VNF instances on the same physical server compete for common resources such as network I/O bandwidth, CPU cycles, cache memory, and main memory which can lead to severe performance interference, which is ignored in existing NF selection mechanisms. However, increasing the SFC acceptance rate of SFC requests with an effective selection of required VNFs under the constraint of end-to-end latency is still an open problem. Since this problem is NP-Hard, we propose a heuristic algorithm based on dynamic programming which efficiently selects the required VNFs and steers the traffic by considering the interference effect. Results show that the proposed algorithm improves the average SFC acceptance rate by 29% as compared with existing methods.

关键词： Interference Delays Servers Heuristic algorithms Bandwidth Firewalls (computing) Throughput Heuristic algorithms Next generation networks Servers Bandwidth Throughput Traffic interference delay Types of traffic interference Network Cache memory main memory end-to-end selection algorithm

来源：评论

学校读者我要写书评

暂无评论

Butterfly Traffic Pattern In selection algorithm on Hierarchical Torus Network 2

Butterfly Traffic Pattern In Selection Algorithm on Hierarch...

引用

2nd International Conference on Electrical Engineering and Information and Communication Technology (ICEEICT)

作者： Rahman, M. M. Hafizur Akhand, M. A. H. Shill, Pintu Chandra Inoguchi, Yasushi IIUM Dept Comp Sci KICT Jalan Gombak POB 10 Kuala Lumpur 50728 Malaysia KUET Dept Comp Sci & Engn Khulna 9203 Bangladesh JAIST Res Ctr Adv Comp Infrastruct Nomi Ishikawa 9231292 Japan

ISBN: (纸本)9781467366762

A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. The combination of link selection and channel selection (LS+CS) algorithm improves the dynamic communication performance of the HTN by efficient use of physical links and virtual channels. In this paper, we have evaluated the dynamic communication performances of an HTN is evaluated by using dimension-order routing and LS+CS algorithm under butterfly traffic pattern. It is found that the dynamic communication performance of an HTN using the LS+CS algorithm is better than when the dimension-order routing is used.

关键词： HTN selection algorithm butterfly traffic pattern dynamic communication performance

来源：评论

学校读者我要写书评

暂无评论

An Area-Overhead-Oriented Monitoring-Path selection algorithm for Suspicious Timing Error Prediction

An Area-Overhead-Oriented Monitoring-Path Selection Algorith...

引用

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)

作者： Yoshida, Shinnosuke Shi, Youhua Yanagisawa, Masao Togawa, Nozomu Waseda Univ Dept Comp Sci & Commun Engn Tokyo Japan Waseda Univ Waseda Inst Adv Study Tokyo Japan

ISBN: (纸本)9781479952304

As process technologies advance, the importance of timing error correction techniques is increasing as well. In this paper, We propose an area-overhead-oriented monitoring-path selection algorithm for suspicious timing error prediction circuits (STEPCs). STEPC predicts timing errors by monitoring the middle points of several speed-paths in a circuit. However, we need many STEPCs with a high area overhead to predict timing errors in an overall circuit. Our proposed method moves the STEPC insertion positions to minimize the number of inserted STEPCs. We apply a max-flow and min-cut approach to determine the optimal positions of inserted STEPCs. Our proposed algorithm reduces the required number of STEPCs to 1/19 and their area to 1/5 compared with a naive algorithm. Furthermore, our algorithm realizes 2.25X overclocking compared with just inserting STEPCs into several speed-paths.

关键词： error correction graph theory timing circuits STEPC insertion positions area-overhead-oriented monitoring-path selection algorithm max-flow approach min-cut approach naive algorithm speed-paths suspicious timing error prediction circuits timing error correction techniques algorithm design and analysis Clocks Delays Logic gates Monitoring Registers algorithm design and analysis timing circuits selection algorithm Registers error forecasting Timing devices Logic gates error correction Graph theory TIMING ERROR Maximum Flow dividing and cutting machine delay

来源：评论

学校读者我要写书评

暂无评论

Long Step User selection algorithm for Unitary Beamforming

Long Step User Selection Algorithm for Unitary Beamforming

引用

IEEE 75th Vehicular Technology Conference (VTC Spring)

作者： Li, Yan Sun, Yi Zhou, Feng Dalian Univ Technol Fac Elect Informat & Elect Engn Dalian Peoples R China

ISBN: (纸本)9781467309905;9781467309882

This paper focuses on the design of user selection algorithm for Unitary Beamforming (UBF) in multi-user multiple-input multiple-output (MIMO) systems. A long step user selection (LSUS) algorithm is proposed, and is verified to be rather robust when combined with Givens rotation-based iterative optimization UBF. For most of existing user selection algorithms, only the best user is chosen at each selection, we regard the step length as one. However, because members of the optimal user set must both have high channel gains and low inter-user interference, if only one user is considered each step, the user that will be selected at next step can not be guaranteed to have both high channel gain and low inter-user interference with the just selected users. Therefore, an algorithm that two users are considered at each selection is proposed in this paper, the step length is regarded as two. It will in some extent help find the favorable user set and finally lead to a higher capacity. Moreover, Gram-Schmidt orthogonalization is used in our proposed algorithm to select the favorable users and at the same time generate the initial unitary beamforming matrix according to the channel state information (CSI). Two other beamforming schemes are simulated as references to demonstrate the good performance of the proposed algorithm even under low signal-to-noise-ratio (SNR) scenario.

关键词： selection algorithm step size Beamforming Unitary multiple input multiple output systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：