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

{"title":"Building a Nature-Inspired Computer","authors":"P. Bentley","doi":"10.1109/SYNASC.2015.12","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.12","url":null,"abstract":"Summary form only given. Since the before birth of computers we have strived to make intelligent machines that share some of the properties of our own brains. We have tried to make devices that quickly solve problems that we find time consuming, that adapt to our needs, and that learn and derive new information. In more recent years we have tried to add new capabilities to our devices: self-adaptation, fault tolerance, self-repair, even self-programming, or self-building. In pursing these challenging goals we push the boundaries of computer and software architectures. We invent new parallel processing approaches or we exploit hardware in new ways. For the last decade Peter Bentley and his group have made their own journey in this area. In order to overcome the observed incompatibilities between conventional architectures and biological processes, Bentley created the Systemic Computer [1] -- a computing paradigm and architecture designed to process information in a way more similar to natural systems. The computer uses a systemic world-view. Instead of the traditional centralized view of computation, here all computation is distributed. There is no separation of data and code/functionality into memory, ALU, and I/O. Everything in systemic computation is composed of systems, which may not be destroyed, but may transform each other through their interactions, akin to collision-based computing. Two systems interact in the context of a third system, which defines the result of their interaction. All interactions may be separated and embedded within scopes, which are also systems, enabling embedded hierarchies. Systemic computation makes the following assertions: · Everything is a system. · Systems can be transformed but never destroyed or created from nothing. · Systems may comprise or share other nested systems. · Systems interact, and interaction between systems may cause transformation of those systems, where the nature of that transformation is determined by a contextual system. · All systems can potentially act as context and affect the interactions of other systems, and all systems can potentially interact in some context. · The transformation of systems is constrained by the scope of systems, and systems may have partial membership within the scope of a system. · Computation is transformation. Computation has always meant transformation in the past, whether it is the transformation of position of beads on an abacus, or of electrons in a CPU. But this simple definition also allows us to call the sorting of pebbles on a beach, or the transcription of protein, or the growth of dendrites in the brain, valid forms of computation. Such a definition is important, for it provides a common language for biology and computer science, enabling both to be understood in terms of computation. The systemic computer is designed to enable many features of natural computation and provide an effective platform for biological modeling and bio-inspired algorithms. S","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 1","pages":"20-21"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75374955","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}

{"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}

{"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}

{"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}

{"title":"Properties of Multiset Orders by Minimal and Maximal Submultisets","authors":"Aurelian Radoaca","doi":"10.1109/SYNASC.2015.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.31","url":null,"abstract":"We analyze the relations between the multisets and their submultisets involved in the multiset order M>msoand derive many properties that can be used in proofs. These properties are used to refine some proofs of known results, like the transitivity or the termination of >mso. These properties also enable a better understandingof the underlying theory and can be use din implementations of theorem provers. For two finite multisets M, N, there can be several pairs of their submultisets that satisfy M>mso N, which can be seen as solutions to the equation M>mso N. We determine the number of solutions that satisfy M>mso N and establish an order between them, not total, but admittinga minimum and a maximum. We determine the formulae for the minimal submultisets and provide several algorithmsto find the maximal submultisets. The minimal submultisetsare necessary and sufficient to determine if M>mso N. The minimal and maximal submultisets also allow for a deeperanalysis in termination problems with multiset orders, being able to determine, for instance, how fast a program can terminate.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"52 1","pages":"145-152"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79123607","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}

{"title":"A Study on Techniques for Proactively Identifying Malicious URLs","authors":"Adrian-Stefan Popescu, Dumitru-Bogdan Prelipcean, Dragos Gavrilut","doi":"10.1109/SYNASC.2015.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.40","url":null,"abstract":"As most of the malware nowadays use Internet as their main doorway to infect a new system, it has become imperative for security vendors to provide cloud-based solutions that can filter and block malicious URLs. This paper presents different practical considerations related to this problem. The key points that we focus on are the usage of different machine learning techniques and unsupervised learning methods for detecting malicious URLs with respect to memory footprint. The database that we have used in this paper was collected during a period of 48 weeks and consists in approximately 6,000,000 benign and malicious URLs. We also evaluated how detection rate and false positive rate evolved during that period and draw some conclusions related to current malware landscape and Internet attack vectors.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"82 1","pages":"204-211"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85681589","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}

{"title":"A Model-Driven DevOps Framework for QoS-Aware Cloud Applications","authors":"M. Guerriero, M. Ciavotta, G. Gibilisco, D. Ardagna","doi":"10.1109/SYNASC.2015.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.60","url":null,"abstract":"Recently we witnessed a deep transformation in the the design, development and management of modern applications, which have grown in scope and size becoming distributed and service-oriented. A big part in this metamorphosis is played by the Cloud with the availability of almost-infinite resources, high availability and outsourced maintenance. This has led to the emergence of new software development methodologies to effectively deal with this paradigm shift in the field of software engineering. DevOps is one of them, it advocates for a greater level of collaboration and convergence between developers and other IT professionals. Consequently, new tools, purposely designed to ease this process, are required. In this scenario, we present SPACE4Cloud, a DevOps integrated environment for model-driven design-time quality of service assessment and optimization, and runtime capacity allocation of Cloud applications.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"22 1","pages":"345-351"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78003754","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}

{"title":"On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees","authors":"Paul Tarau","doi":"10.1109/SYNASC.2015.33","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.33","url":null,"abstract":"The S and K combinator expressions form a well-known Turing-complete subset of the lambda calculus. Using Prolog as a meta-language, we specify evaluation, type inference and combinatorial generation algorithms for SK-combinator trees. In the process, we unravel properties shedding new light on interesting aspects of their structure and distribution. We study the proportion of well-typed terms among size-limited SK-expressions as well as the type-directed generation of terms of sizes smaller than the size of their simple types. We also introduce the well-typed frontier of an untypable term and we use it to design a simplification algorithm for untypable terms taking advantage of the fact that well-typed terms are normalizable.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"15 1","pages":"160-166"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87228021","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}

{"title":"SLA-Based Secure Cloud Application Development: The SPECS Framework","authors":"V. Casola, Alessandra De Benedictis, M. Rak, Umberto Villano","doi":"10.1109/SYNASC.2015.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.59","url":null,"abstract":"The perception of lack of control over resources deployed in the cloud may represent one of the critical factors for an organization to decide to cloudify or not their own services. Furthermore, in spite of the idea of offering security-as-a-service, the development of secure cloud applications requires security skills that can slow down the adoption of the cloud for nonexpert users. In the recent years, the concept of Security Service Level Agreements (Security SLA) is assuming a key role in the provisioning of cloud resources. This paper presents the SPECS framework, which enables the development of secure cloud applications covered by a Security SLA. The SPECS framework offers APIs to manage the whole Security SLA life cycle and provides all the functionalities needed to automatize the enforcement of proper security mechanisms and to monitor userdefined security features. The development process of SPECS applications offering security-enhanced services is illustrated, presenting as a real-world case study the provisioning of a secure web server.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"23 1","pages":"337-344"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79065444","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}

{"title":"Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction","authors":"Masaru Sanuki, D. Inaba, Tateaki Sasaki","doi":"10.1109/SYNASC.2015.15","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.15","url":null,"abstract":"Let F(x, u1,..., uℓ) be a squarefree multivariate polynomial in main variable x and sub-variables u1,..., uℓ. We say that the leading coefficient (LC) of F is singular if it vanishes at the origin of sub-variables. A representative algorithm for nonsparse multivariate polynomial GCD is the EZ-GCD algorithm, which is based on the generalized Hensel construction (GHC). In order to apply the GHC easily, we require 1) the LC of F is nonsingular, 2) F(x, 0,..., 0) is squarefree, and 3) the initial Hensel factor of GCD is \"lucky\". These requirements are usually satisfied by the \"nonzero substitution\", i.e., to shift the origin of subvariables. However, the nonzero substitution may cause a drastic increase of the number of terms of F if F is sparse. In 1993, Sasaki and Kako proposed the extended Hensel construction (EHC) which does not perform the nonzero substitution even if the LC is singular. Using the EHC, Inaba implemented an algorithm of multivariate polynomial factorization and verified that it is very useful for sparse polynomials. In this paper, we apply the EHC for the computation of GCD of sparse multivariate polynomials. In order to find a lucky initial factor, we utilize the weighting of sub-variables, etc. Our naive implementation in Maple shows that our algorithm is comparable in performance to Maple's GCD routine based on the sparse interpolation.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"29 1","pages":"34-41"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83726089","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}