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

8th International Conference on Hybrid Intelligent Systems, HIS 2008

作者： Maia, José Everardo B. Barreto, Guilherme A. Coelho, André L. V. State Univ. of Ceará Department of Statistics and Computing Fortaleza Ceará Brazil Federal Univ. of Ceará Department of Teleinformatics Engineering Fortaleza Ceará Brazil University of Fortaleza Graduate Program in Applied Informatics Fortaleza Ceará Brazil

ISBN: (纸本)9780769533261

This paper examines the formation of self-organizing feature maps (SOFM) by the direct optimization of a cost function through a genetic algorithm (GA). The resulting SOFM is expected to produce simultaneously a topologically correct mapping between input and output spaces and a low quantization error. The proposed approach adopts a cost (fitness) function which is a weighted combination of indices that measure these two aspects of the map quality, specifically, the quantization error and the Pearson correlation coefficient between the corresponding distances in input and output spaces. The resulting maps are compared with those generated by the Kohonen's self-organizing map (SOM) algorithm in terms of the Quantization Error (QE), the Weighted Topological Error (WTE) and the Pearson correlation coefficient (PCC) indices. The experiments show the proposed approach produces better values of the quality indices as well as is more robust to outliers. © 2008 IEEE.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Particle Swarm Optimization applied to the Dynamic Allocation Problem

Particle Swarm Optimization Applied to the Dynamic Allocatio...

引用

Brazilian Symposium on Neural Networks

作者： Jean L. Pierobom Myriam R. Delgado Celso A.A. Kaestner Graduate Program on Applied Computing (PPGCA) Federal University of Technology of Paraná (UTFPR) Curitiba Parana Brazil

Particle Swarm Optimization (PSO) is based on the analysis of emergent behavior of bird flocks. Though it was originally designed for continuous optimization, PSO has provided good results in some recent works when applied to static and discrete optimization problems. In this paper, the particle encoding scheme is based on permutations and the PSO algorithm is adapted to solve a real-world application (cabs-customers allocation) of the dynamic task assignment problem. In the proposed approach, as the optimal solution may change during the optimization process, different strategies to detect and react to changes are tested. The results show that combinations of traditional techniques achieve good solutions in tested instances defined with different sizes and scales of changes.

关键词： Heuristic algorithms Optimization Resource management Robustness Particle swarm optimization Monitoring Accuracy

来源：评论

学校读者我要写书评

暂无评论

Saasport model: Exploring protocol portability, resource elasticity and microservice architecture in the efficient execution of iot applications 20

Saasport model: Exploring protocol portability, resource ela...

引用

20th International Conferences on WWW/Internet 2021 and applied computing 2021

作者： da Silveira, Maria Gisele Flores da Silva Silveira, Wagner da Rosa Righi, Rodrigo da Costa, Cristiano André Griebler, Dalvan Três de Maio - RS Brazil Applied Computing Graduate Program Unisinos University Av. Unisinos 950 RS São Leopoldo Brazil Av. Ipiranga 6681 RS Porto Alegre Brazil

ISBN: (纸本)9789898704344

Despite the high growth of the Internet of Things and the multitude of applications that use the information generated, it is estimated that 90 % of these data are not yet fully used. This is because IoT systems are based on heterogeneous networks and devices with resource restrictions, which cannot execute significant processing. So one of the alternatives that have been addressed is the use of cloud applications, where the data can be appropriately processed, stored, and analyzed. In the cloud, applications can then employ resource elasticity and be developed in microservice architectures. In state-of-the-art, the main efforts to provide portability and efficient treatment of IoT applications are described. However, a platform that provides protocol portability, resource elasticity using microservices architecture for the efficient execution of IoT applications has not yet been implemented. In this context, this work presents SaaSport, which among its contributions, will allow the efficient treatment of data generated by IoT devices that use the MQTT and CoAP protocols. The final result of this work demonstrates that the model provides an efficient treatment of the data generated in IoT environments. © 20th International Conferences on WWW/Internet 2021 and applied computing 2021.

关键词： Elasticity

来源：评论

学校读者我要写书评

暂无评论

An ontology-based repository for a spontaneous social network

An ontology-based repository for a spontaneous social networ...

引用

2011 International Conference on Computational Aspects of Social Networks, CASoN'11

作者： Silva, Bryan Garber Da Costa, Cristiano André Da Zaupa, Dante Freitas, Gustavo Universidade Do Vale Do Rio Dos Sinos - UNISINOS São Leopoldo Brazil Applied Computing Graduate Program - PIPCA Universidade Do Vale Do Rio Dos Sinos - UNISINOS São Leopoldo Brazil

ISBN: (纸本)9781457711312

With the latest technological advancements and the popularization of mobile devices nowadays, software development has evolved towards mobility. One of the main uses of mobile devices is to access social networks. They are becoming important tools in people's life. In this context, the Mingle project has the objective of creating a spontaneous social networks that is mainly accessed by mobile devices, such as smartphones. Mingle uses the concepts of ubiquitous computing to create a notion of spontaneity, i.e, providing a social network adapted to the persons specific location. This article has the goal of presenting an ontology and the persistence model for managing the information inside a specific location (called "Cell" in our model). To evaluate our proposal, two technics were applied: lexical evaluation and application-level evaluation. The first assessment employs the Levenshtein edit distance and compares Mingle with other popular ontologies in the field, while the second one evaluates if we deal with all Mingle requirements. © 2011 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

GUGA: A tool for participatory cities

GUGA: A tool for participatory cities

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Luana Carine Schünke Luiz Paulo Luna de Oliveira Marta Becker Villamil Applied Computing Graduate Program University of Vale do Rio dos Sinos - Unisinos São Leopoldo RS Brazil Applied Computing Graduate Program University of Vale do Rio dos Sinos - Unisinos São Leopoldo Brazil

Participatory cities are those that allow the participation of citizens in the construction and improvement of their common daily life. In this work we present a tool for that participation, allowing the citizens to register the occurrences as well as take knowledge about the global geographic status of their city in on a variety of contexts (security, transit, etc.). However, a tool like that, fed by the people, certainly will deal with a large amount of information, distributed geographically. To accomplish that, a precise criterion for visualizing the resultant density distribution of occurrences must be used. In this paper, we also propose an automatic method for that visualization based on Voronoi Diagrams. The Voronoi polygons divide the region according to the concentration of occurrences. In this scheme, the area of each Voronoi polygon defines the density of the occurrences of the specific categories which are shown in the city map in color and transparency intensities for visualization. This can easily reveal the space distribution of important issues, in a variety of contexts such as criminality, commercial and industrial activities, drugs traffic, illumination concerns, and others.

关键词： Cities and towns Data visualization Registers Government Social network services Visualization Color

来源：评论

学校读者我要写书评

暂无评论

Novel Conservative Methods for Schrödinger Equations with Variable Coefficients over Long Time

引用

Communications in Computational Physics 2014年第3期15卷 692-711页

作者： Xu Qian Yaming Chen Songhe Song Department of Mathematics and Systems Science and State Key Laboratory of High Performance ComputingNational University of Defense TechnologyChangsha 410073P.R.China Program in Applied and Computational Mathematics Princeton UniversityPrincetonNJ 08544USA School of Mathematical Sciences Queen Mary University of LondonLondon E14NSUK

In this paper,we propose a wavelet collocation splitting(WCS)method,and a Fourier pseudospectral splitting(FPSS)method as comparison,for solving onedimensional and two-dimensional Schrödinger equations with variable coefficients in quantum *** two methods can preserve the intrinsic properties of original problems as much as *** splitting technique increases the computational ***,the error estimation and some conservative properties are *** is proved to preserve the charge conservation *** global energy and momentum conservation laws can be preserved under several *** experiments are conducted during long time computations to show the performances of the proposed methods and verify the theoretical analysis.

关键词： Schrödinger equation wavelet collocation method splitting technique conservative property

来源：评论

学校读者我要写书评

暂无评论

A Committee of MLP with Adaptive Slope Parameter Trained by the quasi-Newton Method to Solve Problems in Hydrologic Optics

A Committee of MLP with Adaptive Slope Parameter Trained by ...

引用

International Joint Conference on Neural Networks

作者： Fabio Dall Cortivo Ezzat S. Chalhoub Haroldo F. Campos Velho Applied Computing Graduate Program (CAP) National Institute for Space Research (INPE) Sao Jose dos Campos Associated Laboratory for Computing and Applied Mathematics (LAC) National Institute for Space Research (INPE)

ISBN: (纸本)9781467314886

Artificial Neural Networks (ANNs) can be used to solve problems in Hydrologic Optics. A relevant problem is the estimation of the single scattering albedo and the phase function parameters, from the emitted radiation at the surface of natural waters. In this work we use a committee of ANNs of Multilayer Perceptron type to perform the estimation of the two mentioned parameters. The training of each network is formulated as a nonlinear optimization problem subject to constraints. In addition, each activation function has a distinct slope parameter, that is initially chosen by a random number generator function. This set of parameter (slopes) was included within the free variables network set in order to be adjusted to reach "optimal values", together with the weights and biases, during the network training. This procedure (slope parameters inclusion) makes each one of the activation functions to have a different slope. Each network that composes the committee was trained independently, in order to become expert for the estimation of only one of the hydrologic parameters. For the networks training, we used the quasi-Newton method that is implemented in E04UCF subroutine, in the NAG library, developed by the Numerical Algorithms Group - NAG. The use of the quasi-Newton method to train the networks together with the distinct slope parameters resulted in a network with a fast learning and excellent generalization. Once the networks were trained, they were grouped so to share the input patterns, but remained independent from one another. For the validation/generalization test we used two distinct sets. For all considered noise levels, we obtained 100% of correct answers for the first set, and above 90% of correct answers for the second set.

关键词： Artificial Neural Network Multilayer Perceptron Backpropagation Quasi-Newton Method Hydrologic Optics Phase Function Single Scattering Albedo Inverse Problems SLOPE FACTOR Newton method Slope parameter Artificial neural networks CSRP3 gene Network Optics hydrologic parameters Hydrology functional parameter Random Number Generators Activating function input mode

来源：评论

学校读者我要写书评

暂无评论

Towards providing middleware-level proactive resource reorganisation for elastic HPC applications in the cloud

Towards providing middleware-level proactive resource reorga...

引用

作者： Da Rosa Righi, Rodrigo Rodrigues, Vinicius Facco De Nardin, Igor Fontana Da Costa, Cristiano André Alves, Marco Antonio Zanata Pillon, Maurício Aronne Applied Computing Graduate Program Unisinos University São Leopoldo Rio Grande do Sul Brazil Federal University of Paraná – UFPR Curitiba Paraná Brazil Santa Catarina State University – UDESC Joinville Santa Catarina Brazil

Elasticity is one of the most important features of cloud computing, referring to the ability to add or remove resources according to the needs of the application or service. Particularly for High Performance computing (HPC), elasticity can provide a better use of resources and also a reduction in the execution time of applications. Today, we observe the emergence of proactive initiatives to handle the elasticity and HPC duet, but they present at least one problem related to the need of a previous user experience, large processing time or completion of parameters. Concerning the aforesaid context, this paper presents ProElastic – a lightweight model that uses proactive elasticity to drive resource reorganisation decisions for HPC applications. Our idea is to explore both performance and adaptivity at middleware level in an effortless way at user perspective. The results showed performance gains and a competitive cost (application time consumed resources). Copyright © 2019 Inderscience Enterprises Ltd.

关键词： Elasticity

来源：评论

学校读者我要写书评

暂无评论

A massively parallel speciation-based differential evolution algorithm applied to the 3D-AB protein structure prediction

A massively parallel speciation-based differential evolution...

引用

作者： Stubs Parpinelli, Rafael Boiani, Mateus Dias, André E. P. Graduate Program in Applied Computing State University of Santa Catarina Santa Catarina Joinville Brazil Rio Grande do Sul Porto Alegre Brazil Computer Science Department State University of Santa Catarina Santa Catarina Joinville Brazil

One of the most challenging problems in Bioinformatics is the finding of a protein conformation and it is known as the Protein Structure Prediction (PSP) problem. The main feature present in the AB off-lattice model is the use of polarity as the main driving force to guide the optimization process. The present work proposes an adaptive evolutionary algorithm based on GPU that is applied to the 3D-AB off-lattice PSP problem. The proposed approach is named cuDSMjDE, and is composed of a Dynamic Speciation-based Mutation Strategies Differential Evolution that employs the jDE mechanism to control F and CR parameters. A crowding strategy is also adopted, increasing competition between individuals and maintaining the diversity of solutions. All routines of the proposed algorithm are developed to run in GPU. During the experiments, eight Protein Data Bank sequences are employed. Results obtained concerning potential energy are competitive when compared with state-of-the-art algorithms. The use of a massively parallel architecture promoted the necessary scalability with speedups up to 708.78 (Figure presented.). © 2021 John Wiley & Sons, Ltd.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Network-aware container scheduling in multi-tenant data center

arXiv

引用

arXiv 2019年

作者： Rodrigues, Leonardo R. Pasin, Marcelo Alves, Omir C. Miers, Charles C. Pillon, Mauricio A. Felber, Pascal Koslovski, Guilherme P. Graduate Program in Applied Computing Santa Catarina State University Joinville Brazil Institut d’informatique Switzerland

Network management on multi-tenant container-based data center has critical impact on performance. Tenants encapsulate applications in containers abstracting away details on hosting infrastructures, and entrust data center management framework with the provisioning of network Quality-of-Service requirements. In this paper, we propose a network-aware multi-criteria container scheduler to jointly process containers and network requirements. We introduce a new Mixed Integer Linear programming formulation for network-aware scheduling encompassing both tenants and providers metrics. We describe two GPU-accelerated modules to address the complexity barrier of the problem and efficiently process scheduling requests. Our experiments show that our scheduling approach accounting for both network and containers outperforms traditional algorithms used by containers orchestrators. Copyright © 2019, The Authors. All rights reserved.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：