发布求助
文献互助 智能选刊 最新文献

2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)最新文献

筛选
英文 中文
Generating Healthy Menus for Older Adults Using a Hybrid Honey Bees Mating Optimization Approach 使用杂交蜜蜂交配优化方法为老年人生成健康菜单
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.73
C. Pop, V. Chifu, I. Salomie, Cristian Prigoana, Tiberiu Boros, Dorin Moldovan
{"title":"Generating Healthy Menus for Older Adults Using a Hybrid Honey Bees Mating Optimization Approach","authors":"C. Pop, V. Chifu, I. Salomie, Cristian Prigoana, Tiberiu Boros, Dorin Moldovan","doi":"10.1109/SYNASC.2015.73","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.73","url":null,"abstract":"This paper models the problem of generating healthy menu recommendations for older adults as an optimization problem and proposes a hybrid Honey Bees Mating Optimization method for solving this problem. The method hybridizes the state of the art Honey Bees Mating Optimization meta-heuristic by injecting strategies inspired from Genetic Algorithms, Hill Climbing, Simulated Annealing, and Tabu Search into the steps that generate new solutions of the optimization problem. The method has been integrated in a food ordering system enabling older adults to order food daily. Experiments have been conducted on several hybridization configurations to identify the most appropriate hybridization that leads to the healthy menu recommendation that best satisfies the older adult's diet recommended by the nutritionist, its culinary preferences and time and price constraints.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"98 1","pages":"452-459"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81197075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
GPU Solver for Systems of Linear Equations with Infinite Precision 无限精度线性方程组的GPU求解器
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.28
Jiri Khun, I. Šimeček, R. Lórencz
{"title":"GPU Solver for Systems of Linear Equations with Infinite Precision","authors":"Jiri Khun, I. Šimeček, R. Lórencz","doi":"10.1109/SYNASC.2015.28","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.28","url":null,"abstract":"In this paper, we would like to introduce a GPU accelerated solver for systems of linear equations with an infinite precision. The infinite precision means that the system can provide a precise solution without any rounding error. These errors usually come from limited precision of floating point values within their natural computer representation. In a simplified description, the system is using modular arithmetic for transforming an original SLE into dozens of integer SLEs that are solved in parallel via GPU. In the final step, partial results are used for a calculation of the final solution. The usage of GPU plays a key role in terms of performance because the whole process is computationally very intensive. The GPU solver can provide about one magnitude higher performance than a multithreaded one.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"18 1","pages":"121-124"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85502946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants 具有k个链的树和单环图的a = 1的一般和连通性索引
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.55
Rozica-Maria Tache, I. Tomescu
{"title":"General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants","authors":"Rozica-Maria Tache, I. Tomescu","doi":"10.1109/SYNASC.2015.55","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.55","url":null,"abstract":"One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as χ<sub>α</sub>(G) = Σ<sub>uvϵE(G)</sub>(d(u) + d(v))α, where d(u) denotes the degree of vertex u in G and is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for α ≥ 1,with 2 ≤ k ≤ n for trees and 0 ≤ k ≤ n - 3 for unicyclic graphs.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"82 1","pages":"307-311"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80813575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Incremental Reasoning on Strongly Distributed Multi-agent Systems 强分布多智能体系统的增量推理
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.68
E. Ravve, Z. Volkovich, G. Weber
{"title":"Incremental Reasoning on Strongly Distributed Multi-agent Systems","authors":"E. Ravve, Z. Volkovich, G. Weber","doi":"10.1109/SYNASC.2015.68","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.68","url":null,"abstract":"We introduce the notion of strongly distributed multi-agent systems and present a uniform approach to incremental problem solving on them. The approach is based on the systematic use of two logical reduction techniques: Feferman-Vaught reductions and syntactically defined translation schemes. The multi-agent systems are presented as logical structures A. The problems are represented as boolean or quantitative formulae on them. We propose a uniform template for methods, which allow for a certain cost evaluation of formulae of logic Lover A from values of formulae over its components and values of formulae over the index structure I. We show that our approach works for very many of extensions of First Order Logic.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"14 1","pages":"415-422"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72999664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An Overview of Monitoring Tools for Big Data and Cloud Applications 大数据和云应用监控工具概述
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.62
Gabriel Iuhasz, I. Drăgan
{"title":"An Overview of Monitoring Tools for Big Data and Cloud Applications","authors":"Gabriel Iuhasz, I. Drăgan","doi":"10.1109/SYNASC.2015.62","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.62","url":null,"abstract":"This paper makes a short overview of current state of the art monitoring tools for cloud and big data frameworks. In order to effectively create, test and deploy new algorithms or frameworks one needs suitable monitoring solutions. Hence we aim on creating a critical overview for some of the monitoring solutions existing on the market. Also we present relevant metrics used for monitoring cloud and big data applications, focused mainly on cloud deployment scenarios for big data frameworks.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"305 1","pages":"363-366"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75817511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling 一种改进的非抢占任务调度上界算法
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.32
S. Andrei, A. Cheng, V. Radulescu
{"title":"An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling","authors":"S. Andrei, A. Cheng, V. Radulescu","doi":"10.1109/SYNASC.2015.32","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.32","url":null,"abstract":"One of the core problems in real-time systems, finding a feasible schedule for a certain task set, is subject to alternative solutions given the various system constraints. While preemptive scheduling has benefited from a large number of significant results, the non-preemptive case has still room for improvement. This paper extends our previous results regarding the minimum number of processors required for getting a feasible schedule and the possible ways of improving the well known traditional scheduling algorithms in the case of non-preemptive, single-instance, multiprocessor systems. The improvements refer to handling the situations when the already determined minimum number of processors proves insufficient, and also to extending an existing technique which allows the algorithm to overcome certain stalling situations.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"17 1","pages":"153-159"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73238156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Creative Telescoping via Hermite Reduction 通过赫米特还原的创造性伸缩
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.9
Manuel Kauers
{"title":"Creative Telescoping via Hermite Reduction","authors":"Manuel Kauers","doi":"10.1109/SYNASC.2015.9","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.9","url":null,"abstract":"We give an overview over various techniques forcreative telescoping, starting from the classical algorithms andending with the most recent approaches based on Hermite reduction.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"45 1","pages":"11-11"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91529851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments 并行环境下k-Means算法在社区检测中的应用
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.54
András Bóta, Miklós Krész, Bogdán Zaválnij
{"title":"Adaptations of the k-Means Algorithm to Community Detection in Parallel Environments","authors":"András Bóta, Miklós Krész, Bogdán Zaválnij","doi":"10.1109/SYNASC.2015.54","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.54","url":null,"abstract":"In this paper we present preliminary results for a fast parallel adaptation of the well-known k-means clustering algorithm to graphs. We are going to use our method to detect communities in complex networks. For testing purposes we will use the graph generator of Lancichinetti et al., and we are going to compare our method with the OSLOM, CPM, and hub percolation overlapping community detection methods.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"45 1","pages":"299-302"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73381420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Proposed Serious Game Architecture to Self-Management HealthCare for Older Adults 老年人自我管理医疗保健的严肃游戏架构建议
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.71
Ioana-Andra Codreanu, A. Florea
{"title":"A Proposed Serious Game Architecture to Self-Management HealthCare for Older Adults","authors":"Ioana-Andra Codreanu, A. Florea","doi":"10.1109/SYNASC.2015.71","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.71","url":null,"abstract":"As people age, older adults' health begins to slow down. Moreover, the elderly population number will grow in upcoming years, according to statistics. This fact can lead to clinics and the hospitals becoming overloaded, and the demand for supervision becomes a challenge for the healthcare area. Because the majority of health issues are in the kinesiology domain, using new technologies like Kinect Sensor, this paper proposes a home system that implies the serious games for older adults, machine learning models for exercises recognition and remote activity supervision. The aim is to minimize the physical effort by offering a believable and motivating virtual world where the patient simulates kinesiology exercises, responds to quizzes and sends feedback. In the same time, the system recovers the exercise data and interprets it in order to model personalized care solutions, to create user profiles, to calibrate the difficulty level of the game using a language of powerful questions, to analyze the exercises progress and the performance feedback, to detect symptoms or falls and to learn the users' behavior. The approach described in this paper is based on analyses of the existing similar systems and on the statistics regarding the acceptability of the lifestyle in self-management physical level for elders.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"250 1","pages":"437-440"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74915156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
NSC-PSO, a Novel PSO Variant without Speeds and Coefficients NSC-PSO，一种无速度和系数的新型PSO变体
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI: 10.1109/SYNASC.2015.74
George Anescu, I. Prisecaru
{"title":"NSC-PSO, a Novel PSO Variant without Speeds and Coefficients","authors":"George Anescu, I. Prisecaru","doi":"10.1109/SYNASC.2015.74","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.74","url":null,"abstract":"The paper is introducing the principles of a new global optimization method, No Speeds and Coefficients Particle Swarm Optimization (NSC-PSO), applied to approaching the Continuous Global Optimization Problem (CGOP). Inspired from existing meta-heuristic optimization methods in the Swarm Intelligence (SI) class, like canonical Particle Swarm Optimization (cPSO) and Artificial Bee Colony (ABC), the proposed two versions of the NSC-PSO method are improving over cPSO by eliminating the need of using the speeds of the particles and the coefficients specific to the method. For proving the competitiveness of the proposed NSC-PSO versions they are compared with the ABC method on a test bed of 10 known multimodal optimization problems by applying an appropriate testing methodology. The experimental results showed overall increased efficiency and in many cases improved success rates of the NSC-PSO versions over the ABC method and demonstrated that the proposed NSC-PSO versions are promising approaches to CGOP.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"39 1","pages":"460-467"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82011306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信