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.
{"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}
We give an overview over various techniques forcreative telescoping, starting from the classical algorithms andending with the most recent approaches based on Hermite reduction.
我们概述了各种创造性伸缩技术，从经典算法开始，以基于赫米特约简的最新方法结束。
{"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}
SCBiCG (Bi-Conjugate Gradient method for Symmetric Complex matrices) has been proposed for solving linear equations with complex symmetric matrices, where coefficients ci need to be set by users in SCBiCG. We have had the numerical results that the residual norms of SCBiCG do not converge when the coefficients ci are real. We therefore design an efficient implementation such that the coefficients ci which are complex are given by a computation. Numerical experiments show that the residual norms of our proposed variant with the complex coefficients ci converge slightly faster than those of COCG (Conjugate Orthogonal Conjugate Gradient method) and some implementations of SCBiCG.
对称复矩阵的双共轭梯度法(Bi-Conjugate Gradient method for Symmetric Complex matrices, SCBiCG)用于求解具有复杂对称矩阵的线性方程，其中系数ci需要由用户在SCBiCG中设置。数值结果表明，当系数ci为实数时，SCBiCG的残差范数不收敛。因此，我们设计了一个有效的实现，使得复系数ci可以通过计算得到。数值实验表明，该方法的残差范数收敛速度略快于共轭正交共轭梯度法和SCBiCG的一些实现。
{"title":"Variant Implementations of SCBiCG Method for Linear Equations with Complex Symmetric Matrices","authors":"Kuniyoshi Abe, S. Fujino","doi":"10.1109/SYNASC.2015.27","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.27","url":null,"abstract":"SCBiCG (Bi-Conjugate Gradient method for Symmetric Complex matrices) has been proposed for solving linear equations with complex symmetric matrices, where coefficients ci need to be set by users in SCBiCG. We have had the numerical results that the residual norms of SCBiCG do not converge when the coefficients ci are real. We therefore design an efficient implementation such that the coefficients ci which are complex are given by a computation. Numerical experiments show that the residual norms of our proposed variant with the complex coefficients ci converge slightly faster than those of COCG (Conjugate Orthogonal Conjugate Gradient method) and some implementations of SCBiCG.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"165 1","pages":"117-120"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86467689","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}
C. Stoean, R. Stoean, Adrian Sandita, C. Mesina, D. Ciobanu, C. Gruia
Histopathological image understanding is a demanding task for pathologists, involving the risky decision of confirming or denying the presence of cancer. What is more, the increased incidence of the disease, on the one hand, and the current prevention screening, on the other, result in an immense quantity of such pictures. For the colorectal cancer type in particular, a computational approach attempts to learn from small manually annotated portions of images and extend the findings to the complete ones. As the output of such techniques highly depends on the input variables, the current study conducts an investigation of the effect on the automatic contour detection that the choices for parameter values have from a cropped section to the complete image.
{"title":"Investigation on Parameter Effect for Semi-automatic Contour Detection in Histopathological Image Processing","authors":"C. Stoean, R. Stoean, Adrian Sandita, C. Mesina, D. Ciobanu, C. Gruia","doi":"10.1109/SYNASC.2015.72","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.72","url":null,"abstract":"Histopathological image understanding is a demanding task for pathologists, involving the risky decision of confirming or denying the presence of cancer. What is more, the increased incidence of the disease, on the one hand, and the current prevention screening, on the other, result in an immense quantity of such pictures. For the colorectal cancer type in particular, a computational approach attempts to learn from small manually annotated portions of images and extend the findings to the complete ones. As the output of such techniques highly depends on the input variables, the current study conducts an investigation of the effect on the automatic contour detection that the choices for parameter values have from a cropped section to the complete image.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"445-451"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91238253","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}
This paper presents an unsupervised method for aspect level sentiment analysis that uses the Growing Hierarchical Self-organizing Maps. Different sentences in a product review refer to different aspects of the reviewed product. We use the Growing Hierarchical Self-organizing Maps in order to classify the review sentences. This way we determine whether the various aspects of the target entity (e.g. a product) are opinionated with positive or negative sentiment in the review sentences. By classifying the sentences against a domain specific tree-like ontological taxonomy of aspects and sentiments associated with the aspects (positive/ negative sentiments), we really classify the opinion polarity as expressed in sentences about the different aspects of the target object. The approach proposed has been tested on a collection of product reviews, more exactly reviews about photo cameras.
{"title":"Unsupervised Aspect Level Sentiment Analysis Using Self-Organizing Maps","authors":"E. Chifu, Tiberiu St. Letia, V. Chifu","doi":"10.1109/SYNASC.2015.75","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.75","url":null,"abstract":"This paper presents an unsupervised method for aspect level sentiment analysis that uses the Growing Hierarchical Self-organizing Maps. Different sentences in a product review refer to different aspects of the reviewed product. We use the Growing Hierarchical Self-organizing Maps in order to classify the review sentences. This way we determine whether the various aspects of the target entity (e.g. a product) are opinionated with positive or negative sentiment in the review sentences. By classifying the sentences against a domain specific tree-like ontological taxonomy of aspects and sentiments associated with the aspects (positive/ negative sentiments), we really classify the opinion polarity as expressed in sentences about the different aspects of the target object. The approach proposed has been tested on a collection of product reviews, more exactly reviews about photo cameras.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"4 2 1","pages":"468-475"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90441605","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}
In this paper we sketch out a smart home system(and the reasoning mechanism behind it) designed to improve the living experience of the severely impaired, relying on logic, brain-computer interfacing (BCI) and mobile sensor agents. There exists a significant social category of people who because of either old age or conditions such as paralysis lose their ability to manage their own lives. Such persons are compelled to rely on others in order to manage their finances, expenses, daily necessities such as eating or turning on the television or dialing an emergency number. In our previous research we have described a manner in which to model emotions, as captured via BCI. Here, we extend this model to abstract and concrete concepts and employ epistemic logic and a logic of trust in order to allow communication between the person and heterogeneous agents via a BCI headset. We firstly describe a formal model for expressing reasoning as captured in its cortical projection. Secondly, we describe a communication protocol that uses a logic of trust that allows the user to give commands to specific listening agents. The system should use reasoning and logic to learn from the user commands they receive and configure routines that correspond to the usual preferences and needs. Finally, the agents, on receiving and corroborating data from other sensors that relate to vital signs of the user or that otherwise identify a crisis situation, should be able to decide when to change their task priorities andthe system should ad hoc self-configure in order to provide bestassistance to the user.
{"title":"A Matter of Trust: Smart Home System Relying on Logic, BCI, and Sensor Agents","authors":"Violeta Tulceanu","doi":"10.1109/SYNASC.2015.35","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.35","url":null,"abstract":"In this paper we sketch out a smart home system(and the reasoning mechanism behind it) designed to improve the living experience of the severely impaired, relying on logic, brain-computer interfacing (BCI) and mobile sensor agents. There exists a significant social category of people who because of either old age or conditions such as paralysis lose their ability to manage their own lives. Such persons are compelled to rely on others in order to manage their finances, expenses, daily necessities such as eating or turning on the television or dialing an emergency number. In our previous research we have described a manner in which to model emotions, as captured via BCI. Here, we extend this model to abstract and concrete concepts and employ epistemic logic and a logic of trust in order to allow communication between the person and heterogeneous agents via a BCI headset. We firstly describe a formal model for expressing reasoning as captured in its cortical projection. Secondly, we describe a communication protocol that uses a logic of trust that allows the user to give commands to specific listening agents. The system should use reasoning and logic to learn from the user commands they receive and configure routines that correspond to the usual preferences and needs. Finally, the agents, on receiving and corroborating data from other sensors that relate to vital signs of the user or that otherwise identify a crisis situation, should be able to decide when to change their task priorities andthe system should ad hoc self-configure in order to provide bestassistance to the user.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"4 1","pages":"177-180"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90568311","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}
Software-as-a-Service (SaaS) providers increasingly rely on multi-cloud setups to leverage the combined benefits of different enabling technologies and third-party providers. Especially, in the context of NoSQL storage systems, which are characterized by heterogeneity and quick technological evolution, adopting the multi-cloud paradigm is a promising way to deal with different data storage requirements. Existing data access middleware platforms that support this type of setup (polyglot persistence) commonly rely on (i) configuration models that describe the multi-cloud setup, and (ii) the hard-coded logic in the application source code or the data storage policies that define how the middleware platforms should store data across different storage systems. In practice, however, both models are tightly coupled, i.e. the hard-coded logic in the application source code and data storage policies refer to specific configuration model elements, leads to fragility issues (ripple effects) and hinders reusability. More specifically, in multi-cloud configurations that change often (e.g., in dynamic cloud federations), this is a key problem. In this paper, we present a more expressive way to specify storage policies, that involves (i) enriching the configuration models with metadata about the technical capabilities of the storage systems, (ii) referring to the desired capabilities of the storage system in the storage policies, and (iii) leaving actual resolution to the policy engine. Our validation in the context of a realistic SaaS application shows how the policies accommodate such changes for a number of realistic policy change scenarios. In addition, we evaluate the performance overhead, showing that policy evaluation is on average less than 2% of the total execution time.
{"title":"Expressive Data Storage Policies for Multi-cloud Storage Configurations","authors":"A. Rafique, D. Landuyt, W. Joosen","doi":"10.1109/SYNASC.2015.58","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.58","url":null,"abstract":"Software-as-a-Service (SaaS) providers increasingly rely on multi-cloud setups to leverage the combined benefits of different enabling technologies and third-party providers. Especially, in the context of NoSQL storage systems, which are characterized by heterogeneity and quick technological evolution, adopting the multi-cloud paradigm is a promising way to deal with different data storage requirements. Existing data access middleware platforms that support this type of setup (polyglot persistence) commonly rely on (i) configuration models that describe the multi-cloud setup, and (ii) the hard-coded logic in the application source code or the data storage policies that define how the middleware platforms should store data across different storage systems. In practice, however, both models are tightly coupled, i.e. the hard-coded logic in the application source code and data storage policies refer to specific configuration model elements, leads to fragility issues (ripple effects) and hinders reusability. More specifically, in multi-cloud configurations that change often (e.g., in dynamic cloud federations), this is a key problem. In this paper, we present a more expressive way to specify storage policies, that involves (i) enriching the configuration models with metadata about the technical capabilities of the storage systems, (ii) referring to the desired capabilities of the storage system in the storage policies, and (iii) leaving actual resolution to the policy engine. Our validation in the context of a realistic SaaS application shows how the policies accommodate such changes for a number of realistic policy change scenarios. In addition, we evaluate the performance overhead, showing that policy evaluation is on average less than 2% of the total execution time.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"3 ","pages":"329-336"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91453265","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}
We introduce Venn diagrams for multisets and showhow they simplify the analysis of multisets. Venn diagrams arevery useful in proofs involving multisets and multiset orders, especially considering the complications introduced by the multiplicity of elements in multisets. We compare the Venn diagramsfor multisets with the corresponding ones for sets. Thus, wepresent two types of Venn diagrams for multisets, a simple onethat looks like a diagram for sets, but with areas that are notnecessarily disjoint, and a complex one (compared to sets), butwith certain delimited disjoint areas.
{"title":"Simple Venn Diagrams for Multisets","authors":"Aurelian Radoaca","doi":"10.1109/SYNASC.2015.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.36","url":null,"abstract":"We introduce Venn diagrams for multisets and showhow they simplify the analysis of multisets. Venn diagrams arevery useful in proofs involving multisets and multiset orders, especially considering the complications introduced by the multiplicity of elements in multisets. We compare the Venn diagramsfor multisets with the corresponding ones for sets. Thus, wepresent two types of Venn diagrams for multisets, a simple onethat looks like a diagram for sets, but with areas that are notnecessarily disjoint, and a complex one (compared to sets), butwith certain delimited disjoint areas.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"98 1","pages":"181-184"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80948012","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}
Many prominent NP-hard problems have been shown tractable for bounded treewidth. To put these results to practice, dynamic programming (DP) via a traversal of the nodes of a tree decomposition is the standard technique. However, the concrete implementation of suitable efficient algorithms is often tedious. To this end, we have developed the D-FLAT system, which [1]-[4] allows the user to specify the DP algorithm in a declarative fashion and where the computation of intermediate solutions is delegated to a logic-programming system. In this talk, we first give a brief introduction to the D-FLAT system and demonstrate its usage on some standard DP algorithms. In the second part of the talk, we reflect on some of our experiences.
{"title":"Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned","authors":"S. Woltran","doi":"10.1109/SYNASC.2015.13","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.13","url":null,"abstract":"Many prominent NP-hard problems have been shown tractable for bounded treewidth. To put these results to practice, dynamic programming (DP) via a traversal of the nodes of a tree decomposition is the standard technique. However, the concrete implementation of suitable efficient algorithms is often tedious. To this end, we have developed the D-FLAT system, which [1]-[4] allows the user to specify the DP algorithm in a declarative fashion and where the computation of intermediate solutions is delegated to a logic-programming system. In this talk, we first give a brief introduction to the D-FLAT system and demonstrate its usage on some standard DP algorithms. In the second part of the talk, we reflect on some of our experiences.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"65 1","pages":"22-22"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89498301","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}
This paper is a case study which presents numericalinvestigations based on the theoretical background developed in [1]. The purpose is to numerically investigate the existence and the stability of equilibriums, as well as the existence of possible bifurcation at an equilibrium point for a set of given aero-dynamic data. The computations are performed in the framework of the non-simplified Aero-Data Model in a Research Environment, when the angle of attack is high.
{"title":"Numerical Investigations of Equilibriums in a Flight with High Angle of Attack","authors":"A. Fortis, S. Balint","doi":"10.1109/SYNASC.2015.22","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.22","url":null,"abstract":"This paper is a case study which presents numericalinvestigations based on the theoretical background developed in [1]. The purpose is to numerically investigate the existence and the stability of equilibriums, as well as the existence of possible bifurcation at an equilibrium point for a set of given aero-dynamic data. The computations are performed in the framework of the non-simplified Aero-Data Model in a Research Environment, when the angle of attack is high.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"61 6 1","pages":"85-89"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79767508","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：