TY - JOUR T1 - On routing in VLSI design and communication networks AU - Terlaky, Tamás AU - Vannelli, Anthony AU - Zhang, Hu JO - Discrete Applied Mathematics VL - 156 IS - 11 SP - 2178 EP - 2194 PY - 2008 DA - 2008/06/06/ T2 - In Memory of Leonid Khachiyan (1952 - 2005 ) SN - 0166-218X DO - https://doi.org/10.1016/j.dam.2008.01.014 UR - https://www.sciencedirect.com/science/article/pii/S0166218X0800036X KW - Approximation algorithm KW - Routing KW - VLSI design KW - Communication networks AB - In this paper, we study the global routing problem in VLSI design and the multicast routing problem in communication networks. First we propose new and realistic models for both problems. In the global routing problem in VLSI design, we are given a lattice graph and subsets of the vertex set. The goal is to generate trees spanning these vertices in the subsets to minimize a linear combination of overall wirelength (edge length) and the number of bends of trees with respect to edge capacity constraints. In the multicast routing problem in communication networks, a graph is given to represent the network, together with subsets of the vertex set. We are required to find trees to span the given subsets and the overall edge length is minimized with respect to capacity constraints. Both problems are APX-hard. We present the integer linear programming (LP) formulation of both problems and solve the LP relaxations by the fast approximation algorithms for min–max resource-sharing problems in [K. Jansen, H. Zhang, Approximation algorithms for general packing problems and their application to the multicast congestion problem, Math. Programming, to appear, doi:10.1007/s10107-007-0106-8] (which is a generalization of the approximation algorithm proposed by Grigoriadis and Khachiyan [Coordination complexity of parallel price-directive decomposition, Math. Oper. Res. 2 (1996) 321–340]). For the global routing problem, we investigate the particular property of lattice graphs and propose a combinatorial technique to overcome the hardness due to the bend-dependent vertex cost. Finally, we develop asymptotic approximation algorithms for both problems with ratios depending on the best known approximation ratio for the minimum Steiner tree problem. They are the first known theoretical approximation bound results for the problems of minimizing the total costs (including both the edge and the bend costs) while spanning all given subsets of vertices. ER - TY - JOUR T1 - Mathematical model for performance analysis of a context-aware device with composite service AU - Shin, Dongmin AU - Hur, Sun JO - Mathematical and Computer Modelling VL - 57 IS - 3 SP - 684 EP - 692 PY - 2013 DA - 2013/02/01/ SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2012.08.006 UR - https://www.sciencedirect.com/science/article/pii/S0895717712002142 KW - User context KW - Composite service KW - Mean value analysis KW - Information recency AB - Recent advances in the development of smart devices and wireless network infrastructures have made it possible to provide a variety of rich services to diverse user groups. In order to make the best use of these technological benefits, the services provided by the device need to be developed and supplied with consideration for the user context that contains information about the environments with which the device and the user interact. The user context is mostly inferred based on the data that are dispersed in the user’s environment and can trigger a service when enough data are gathered to infer a certain degree of user context. A service provided by the device usually consists of one or more smaller services taking the form of a composite service. In this regard, we investigate a context-aware composite service provision process and present an analytical tool for assessing the performance of the process by means of a mathematical model. The results from extensive experimental simulations indicate that a performance assessment based on the proposed mean value analysis model effectively confirms the characteristics of the composite service systems. ER - TY - JOUR T1 - A mathematical model for the TCP Tragedy of the Commons AU - López, Luis AU - del Rey Almansa, Gemma AU - Paquelet, Stéphane AU - Fernández, Antonio JO - Theoretical Computer Science VL - 343 IS - 1 SP - 4 EP - 26 PY - 2005 DA - 2005/10/10/ T2 - Game Theory Meets Theoretical Computer Science SN - 0304-3975 DO - https://doi.org/10.1016/j.tcs.2005.05.005 UR - https://www.sciencedirect.com/science/article/pii/S0304397505003075 KW - TCP KW - Game Theory KW - Tragedy of the Commons AB - This paper presents a novel mathematical model for the TCP Tragedy of the Commons, using Game Theory concepts. This tragedy may appear in a TCP/IP-based network when hosts do not respect the protocol rules and try to monopolize the shared network resources by using a selfish strategy. Our model quantifies the effects of this evil behavior in a simple and standard network topology and allows to obtain some interesting results which we prove formally. Finally, we validate the model results by comparing its predictions with a set of extensive simulations carried out using the NS Network Simulator. ER - TY - JOUR T1 - Multi-class machine classification of suicide-related communication on Twitter AU - Burnap, Pete AU - Colombo, Gualtiero AU - Amery, Rosie AU - Hodorog, Andrei AU - Scourfield, Jonathan JO - Online Social Networks and Media VL - 2 SP - 32 EP - 44 PY - 2017 DA - 2017/08/01/ SN - 2468-6964 DO - https://doi.org/10.1016/j.osnem.2017.08.001 UR - https://www.sciencedirect.com/science/article/pii/S2468696417300605 KW - Artificial intelligence KW - Text analysis KW - Web-based interaction KW - Human safety KW - Suicidal ideation AB - The World Wide Web, and online social networks in particular, have increased connectivity between people such that information can spread to millions of people in a matter of minutes. This form of online collective contagion has provided many benefits to society, such as providing reassurance and emergency management in the immediate aftermath of natural disasters. However, it also poses a potential risk to vulnerable Web users who receive this information and could subsequently come to harm. One example of this would be the spread of suicidal ideation in online social networks, about which concerns have been raised. In this paper we report the results of a number of machine classifiers built with the aim of classifying text relating to suicide on Twitter. The classifier distinguishes between the more worrying content, such as suicidal ideation, and other suicide-related topics such as reporting of a suicide, memorial, campaigning and support. It also aims to identify flippant references to suicide. We built a set of baseline classifiers using lexical, structural, emotive and psychological features extracted from Twitter posts. We then improved on the baseline classifiers by building an ensemble classifier using the Rotation Forest algorithm and a Maximum Probability voting classification decision method, based on the outcome of base classifiers. This achieved an F-measure of 0.728 overall (for 7 classes, including suicidal ideation) and 0.69 for the suicidal ideation class. We summarise the results by reflecting on the most significant predictive principle components of the suicidal ideation class to provide insight into the language used on Twitter to express suicidal ideation. Finally, we perform a 12-month case study of suicide-related posts where we further evaluate the classification approach - showing a sustained classification performance and providing anonymous insights into the trends and demographic profile of Twitter users posting content of this type. ER - TY - JOUR T1 - Teacher opinions in the implementation of the drama method in mathematics teaching AU - Tezer, Murat AU - Aktunç, Emine JO - Procedia - Social and Behavioral Sciences VL - 2 IS - 2 SP - 5836 EP - 5840 PY - 2010 DA - 2010/01/01/ T2 - Innovation and Creativity in Education SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2010.03.953 UR - https://www.sciencedirect.com/science/article/pii/S1877042810009936 KW - Drama KW - mathematics teaching KW - primary school KW - classroom teacher AB - This study was administered to classroom teachers working in North Cyprus state schools where the use of drama activities have been stated and different variables towards including the drama method in their classroom such as how many years they have worked, gender, and the study groups they work with have been analyzed. On the contrary of this study, a questionnaire developed by Taş (2008) was used. The questionnaire was used in 2009-2010 academic year in 28 primary schools joint to the Ministry of Education and Culture (MEC) to 376 teachers in North Cyprus. Looking at the findings of this study, only 39.6% of teachers implement the drama method in their teaching and 60.4% do not implement the drama method in their teaching. According to the results of the study, as teachers years of teaching increases the percentage of the drama method usage decreases. As the age group increases of the study group teachers teach, the usage of drama method decreases. ER - TY - JOUR T1 - Theorema: Towards computer-aided mathematical theory exploration AU - Buchberger, Bruno AU - Crǎciun, Adrian AU - Jebelean, Tudor AU - Kovács, Laura AU - Kutsia, Temur AU - Nakagawa, Koji AU - Piroi, Florina AU - Popov, Nikolaj AU - Robu, Judit AU - Rosenkranz, Markus AU - Windsteiger, Wolfgang JO - Journal of Applied Logic VL - 4 IS - 4 SP - 470 EP - 504 PY - 2006 DA - 2006/12/01/ T2 - Towards Computer Aided Mathematics SN - 1570-8683 DO - https://doi.org/10.1016/j.jal.2005.10.006 UR - https://www.sciencedirect.com/science/article/pii/S1570868305000716 KW - Mathematical assistant KW - Automated reasoning KW - Theory exploration KW - “Lazy Thinking” KW - Theorema AB - Theorema is a project that aims at supporting the entire process of mathematical theory exploration within one coherent logic and software system. This survey paper illustrates the style of Theorema-supported mathematical theory exploration by a case study (the automated synthesis of an algorithm for the construction of Gröbner Bases) and gives an overview on some reasoners and organizational tools for theory exploration developed in the Theorema project. ER - TY - JOUR T1 - Conformity between the Instruction Programs: Science-Technology and Mathematics AU - Ozyildirim, Feride AU - Atmaca, Sevilay AU - Aydin, Ozge AU - Kaptan, Fitnat JO - Procedia - Social and Behavioral Sciences VL - 46 SP - 2140 EP - 2147 PY - 2012 DA - 2012/01/01/ T2 - 4th WORLD CONFERENCE ON EDUCATIONAL SCIENCES (WCES-2012) 02-05 February 2012 Barcelona, Spain SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2012.05.443 UR - https://www.sciencedirect.com/science/article/pii/S1877042812015728 KW - Science and Technolgy Instruction Program KW - Mathematic Instruction Program KW - Interdisciplinary Connections KW - Integration AB - In recent decades, in order to achieve learning based on understanding, the importance of interdisciplinary teaching and multi-dimensional approach towards the problem solving has been emphasized, along with the integration of disciplines. The most suitable programs for such multi interdisciplinary approaches are Science-Technology Instruction Programs (STIP) (Ministry of National Education [MNE], 2006) and Mathematics Instruction Program (MIP) (MNE, 2008) due to the magnitude of available application areas and similarities in the approaches used towards problem solving in these disciplines (National Research Council [NRC], 1996). Thus our research is based on the exploration to the question:’How does STIP relate middle school content to MIP in order to establish interdisciplinary connections’. Descriptive situation analysis is used and all data is obtained through’document analysis method’ and’interviews’. The STIP is the central focus in our analysis. In the STIP, all learning material is categorized under four themes (MNE, 2006): Livings and Life, Physical Acts, Substance and Change, Earth and Cosmos all of which are analyzed in this research. In this study, the details of’Rudiments Related to Unit Organization-Explanations’ in STIP and the dimension of’Association with Other Disciplines’ in MIP are taken into consideration (MNE, 2006; MNE, 2008). This research shows that while connections from SCIP to MIP were done directly and effectively for the 6th grade level, such a direct connection was not exist for the 7th and the 8th grade levels. However the analyses of programs indicate that the 6th grade level instruction program is supported with in-direct connection by the example activities, only in-direct connections are exist in both 7th and 8th grade levels’ instruction programs. Based on the findings of this study, suggestions are made both to the authors of the textbooks and the developers of the curriculum, to make these connections more explicitly and more effectively. Moreover, some suggestions can be also made to teachers who are the applicators of the programs according to our findings. ER - TY - JOUR T1 - Plato’s Ghost: The Modernist Transformation of Mathematics AU - Fenster, Della D. JO - Historia Mathematica VL - 36 IS - 4 SP - 444 EP - 447 PY - 2009 DA - 2009/11/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2009.07.003 UR - https://www.sciencedirect.com/science/article/pii/S0315086009000536 ER - TY - JOUR T1 - Separation of Synchronous and Asynchronous Communication Via Testing AU - Cacciagrano, Diletta AU - Corradini, Flavio AU - Palamidessi, Catuscia JO - Electronic Notes in Theoretical Computer Science VL - 154 IS - 3 SP - 95 EP - 108 PY - 2006 DA - 2006/07/19/ T2 - Proceedings of the 12th Workshop on Expressiveness on Concurrency (EXPRESS 2005) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2006.05.009 UR - https://www.sciencedirect.com/science/article/pii/S1571066106003719 KW - Pi-Calculus KW - Communication KW - Synchrony KW - Asynchrony KW - Testing Semantics AB - One of the early results about the asynchronous π-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy's testing semantics. In this sense, it turns out that, under some general conditions, no encoding of output prefix is able to preserve the must testing. This negative result is due to (a) the non atomicity of the sequences of steps which are necessary in the asynchronous π-calculus to mimic synchronous communication, and (b) testing semantics's sensitivity to divergence. ER - TY - JOUR T1 - The effects of online and face to face problem based learning environments in mathematics education on student's academic achievement AU - Gürsul, Fatih AU - Keser, Hafize JO - Procedia - Social and Behavioral Sciences VL - 1 IS - 1 SP - 2817 EP - 2824 PY - 2009 DA - 2009/01/01/ T2 - World Conference on Educational Sciences: New Trends and Issues in Educational Sciences SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2009.01.501 UR - https://www.sciencedirect.com/science/article/pii/S1877042809005035 KW - Problem Based Learning KW - Online Problem Based Learning KW - Face to Face Problem Based Learning KW - Academic Achievement AB - This study aims at finding out the effects of the online and face to face problem based learning environments in mathematics education on student's academic achievement. The study was conducted at Department of Computer Education and Instructional Technologies, Faculty of Education, Hacettepe University. The subjects were 42 freshman students attending to this department at the Autumn term of 2006-2007 academic year. These students were put into two groups as online problem-based learning and face-to-face problem-based learning. The research was conducted on Mathematics-I while implementing the topic of ‘derivation’. The rubric for the students’ performance to evaluate their problem-based skills is used as data collection tool. .The statistical techniques used are ranked mean, Mann-Whitney U test. According to the results, the ranked mean scores (7.70) of achievement level of the students at the online problem-based learning group had higher than the students in the face-to-face problem-based learning group (3.30), which was also statistically significant (U=1,500, p<0,05). ER - TY - JOUR T1 - “A valuable monument of mathematical genius”: The Ladies' Diary (1704–1840) AU - Albree, Joe AU - Brown, Scott H. JO - Historia Mathematica VL - 36 IS - 1 SP - 10 EP - 47 PY - 2009 DA - 2009/02/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2008.09.005 UR - https://www.sciencedirect.com/science/article/pii/S0315086008000967 KW - 18th century KW - 19th century KW - Other institutions and academies KW - Bibliographic studies AB - Our purpose is to view the mathematical contribution of The Ladies' Diary as a whole. We shall range from the state of mathematics in England at the beginning of the 18th century to the transformations of the mathematics that was published in The Diary over 134 years, including the leading role The Ladies' Diary played in the early development of British mathematics periodicals, to finally an account of how progress in mathematics and its journals began to overtake The Diary in Victorian Britain. Résumé Notre but est de voir la contribution mathématique du Journal de Lady en masse. Nous varierons de l'état de mathématiques en Angleterre au début du dix-huitième siècle aux transformations des mathématiques qui a été publié dans le Journal plus de 134 ans, en incluant le principal rôle le Journal de Lady joué dans le premier développement de périodiques de mathématiques britanniques, à finalement un compte de comment le progrès dans les mathématiques et ses journaux a commencé à dépasser le Journal dans l'Homme de l'époque victorienne la Grande-Bretagne. ER - TY - JOUR T1 - Evaluation of the New Secondary School Curriculum in Turkey from the Point of Mathematical Models and Mathematical Modeling AU - Çiltaş, Alper AU - Çelik, Büşra AU - Bilen, Nizamettin AU - Yilmaz, Kübra AU - Doruk, Muhammet AU - Öztürk, Ferhat JO - Procedia - Social and Behavioral Sciences VL - 106 SP - 1151 EP - 1156 PY - 2013 DA - 2013/12/10/ T2 - 4th International Conference on New Horizons in Education SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2013.12.129 UR - https://www.sciencedirect.com/science/article/pii/S1877042813047526 KW - model KW - mathematics KW - mathematical modeling KW - education and training AB - This study aims to evaluate the secondary school mathematics curriculum renewed in 2013-2014 education year in Turkey from the point of mathematical models and mathematical modeling. The old and new mathematics curriculum were compared for all class levels by researches and discussed the changes within the group. The report of researchers shows that the following is stated in the 2009 curriculum vision: “Mathematical concepts are abstract in nature. Given the developmental level of children, these concepts are hard to conceive directly. Hence, mathematical concepts are addressed using concrete and finite life models.” Whereas in the general purposes section of the new curriculum, it's emphasized that information and communication technologies should be effectively used in mathematics education, such technologies should be implemented to create the environment for children to improve their skills such as problem solving by modeling, communicating, and reasoning. Moreover, the addition of improvement of problem solving skills by modeling into the program objectives shows that the new curriculum considers modeling important. Considered in general, the new curriculum is found to be simplified, subjects and gains are reduced, and course hours are increased. As it stands, this curriculum is more beneficial and flexible both for students and teachers. ER - TY - JOUR T1 - Mathematical and computer modeling in agriculture AU - Li, Daoliang JO - Mathematical and Computer Modelling VL - 51 IS - 11 SP - 1285 PY - 2010 DA - 2010/06/01/ T2 - Mathematical and Computer Modelling in Agriculture SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2009.12.019 UR - https://www.sciencedirect.com/science/article/pii/S0895717709004518 ER - TY - JOUR T1 - Computational power of two stacks with restricted communication AU - Karhumäki, Juhani AU - Kunc, Michal AU - Okhotin, Alexander JO - Information and Computation VL - 208 IS - 9 SP - 1060 EP - 1089 PY - 2010 DA - 2010/09/01/ SN - 0890-5401 DO - https://doi.org/10.1016/j.ic.2009.07.001 UR - https://www.sciencedirect.com/science/article/pii/S0890540109001527 KW - Word rewriting KW - String rewriting KW - Post systems KW - Multi-pushdown machines KW - Communication KW - Universality AB - Rewriting systems working on words with a center marker are considered. The derivation is done by erasing a prefix or a suffix and then adding a prefix or a suffix. This models a communication of two stacks according to a fixed protocol defined by the choice of rewriting rules. The paper systematically considers different cases of these systems and determines their expressive power. Several cases are identified where very restricted communication surprisingly yields computational universality. ER - TY - JOUR T1 - Proliferation of C6 glioma cells is blunted by the increase in gap junction communication caused by tolbutamide AU - Sánchez-Alvarez, Rosa AU - Tabernero, Arantxa AU - Sánchez-Abarca, Luis I. AU - Orfao, Alberto AU - Giaume, Christian AU - Medina, José M. JO - FEBS Letters VL - 509 IS - 2 SP - 202 EP - 206 PY - 2001 DA - 2001/12/07/ SN - 0014-5793 DO - https://doi.org/10.1016/S0014-5793(01)03181-7 UR - https://www.sciencedirect.com/science/article/pii/S0014579301031817 KW - Brain KW - Intercellular communication KW - Glia KW - Sulfonylurea KW - Gene therapy KW - Tumor AB - We have previously reported that tolbutamide prevents the inhibition of gap junction communication in astrocytes. Here, we show that tolbutamide increases gap junction communication and connexin 43 expression in poorly coupled C6 glioma cells. The increase in communication is concurrent with the inhibition of the rate of proliferation due to a block of the progression of C6 glioma cells through the S phase of the cell cycle. The effects of tolbutamide were quantitatively similar to that found after the elevation of intracellular cAMP. Furthermore, the effects of tolbutamide and cAMP were additive. The possible beneficial effect of tolbutamide on gene therapy for gliomas is discussed. ER - TY - JOUR T1 - A mathematical program to refine gene regulatory networks AU - Lulli, Guglielmo AU - Romauch, Martin JO - Discrete Applied Mathematics VL - 157 IS - 10 SP - 2469 EP - 2482 PY - 2009 DA - 2009/05/28/ T2 - Networks in Computational Biology SN - 0166-218X DO - https://doi.org/10.1016/j.dam.2008.06.044 UR - https://www.sciencedirect.com/science/article/pii/S0166218X08003636 KW - Gene regulatory networks KW - Reverse engineering KW - Mathematical programming KW - Ant colony optimization AB - In this paper, we propose a methodology for making sense of large, multiple time-series data sets arising in expression analysis. Specifically, we present a mathematical model to release a reduced and coherent regulatory system given a putative regulatory network. We give two equivalent formulations of the problem and prove that the problem is NP-complete. For solving large scale instances we implemented an Ant Colony Optimization procedure. A computational analysis on randomly generated test instances validates the proposed algorithm and the computations on real data concerning Saccharomyces cerevisiae show the practicability of the proposed methodology. ER - TY - JOUR T1 - Special issue of computers and mathematics with applications on “Advances in cryptography, security and applications for future computer science” AU - Park, Jong Hyuk AU - Hussain, Sajid AU - Wang, Guilin AU - Mu, Yi JO - Computers & Mathematics with Applications VL - 60 IS - 2 SP - 175 PY - 2010 DA - 2010/07/01/ T2 - Advances in Cryptography, Security and Applications for Future Computer Science SN - 0898-1221 DO - https://doi.org/10.1016/j.camwa.2010.04.007 UR - https://www.sciencedirect.com/science/article/pii/S0898122110002695 ER - TY - JOUR T1 - New complexity results on scheduling with small communication delays AU - Picouleau, C. JO - Discrete Applied Mathematics VL - 60 IS - 1 SP - 331 EP - 342 PY - 1995 DA - 1995/06/23/ SN - 0166-218X DO - https://doi.org/10.1016/0166-218X(94)00063-J UR - https://www.sciencedirect.com/science/article/pii/0166218X9400063J KW - Scheduling KW - Complexity KW - Communication delay AB - Although most of the scheduling problems with interprocessor communication delays have been shown to be NP-complete, some important special cases were still unsolved. This paper deals with the problem where communication times are smaller than processing times and task duplication is not allowed. We prove that this problem is NP-complete and we give an efficient approximate algorithm with performance guarantee. ER - TY - JOUR T1 - Mathematical and Computer Modeling in Agriculture AU - Li, Daoliang JO - Mathematical and Computer Modelling VL - 58 IS - 3 SP - 731 EP - 732 PY - 2013 DA - 2013/08/01/ T2 - Computer and Computing Technologies in Agriculture 2011 and Computer and Computing Technologies in Agriculture 2012 SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2013.06.002 UR - https://www.sciencedirect.com/science/article/pii/S0895717713001933 ER - TY - JOUR T1 - Implementation, Comparison, and Enhancement of Secure Communication Designs AU - Elshobaky, Aya AU - Elkabbany, Ghada AU - Rasslan, Mohamed AU - Gurguis, Shawkat JO - Procedia Computer Science VL - 37 SP - 363 EP - 369 PY - 2014 DA - 2014/01/01/ T2 - The 5th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN-2014)/ The 4th International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH 2014)/ Affiliated Workshops SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2014.08.054 UR - https://www.sciencedirect.com/science/article/pii/S1877050914010199 KW - Signcryption KW - Encrypt-Sign-Encrypt KW - Schnorr Signcryption KW - Encryption KW - Authentication. AB - Cryptography offers effective techniques to ensure users’ security and privacy in an efficient way. To protect networks from intruders/attackers and transmit a message over an insecure channel, encryption and digital signature algorithms could be used within different designs to provide secure networks and security solutions in order to protect users’ information and their data from being attacked. These designs would ensure confidentiality, authenticity, integrity, and non-repudiation. Signcryption algorithms achieve the properties of both digital signature and encryption schemes. In this paper, we implement the Schnorr Signcryption and RSA Encrypt-Sign-Encrypt (Sign-Encrypt-Sign) schemes. Moreover, we will illustrate the comparison between the RSA Encrypt-Sign-Encrypt and Schnorr Signcryption schemes in terms of computation cost. Additionally, we will present an improvement factor in the case of parallelisation techniques applied to Schnorr Signcryption and RSA Encrypt-Sign-Encrypt (Sign-Encrypt-Sign) schemes. ER - TY - JOUR T1 - Building technology platform aimed to develop service robot with embedded personality and enhanced communication with social environment AU - Rodić, Aleksandar AU - Jovanović, Miloš AU - Stevanović, Ilija AU - Karan, Branko AU - Potkonjak, Veljko JO - Digital Communications and Networks VL - 1 IS - 2 SP - 112 EP - 124 PY - 2015 DA - 2015/04/01/ SN - 2352-8648 DO - https://doi.org/10.1016/j.dcan.2015.03.002 UR - https://www.sciencedirect.com/science/article/pii/S2352864815000127 KW - Human-centric robot KW - Personal robot KW - Artificial emotional intelligence AB - The paper is addressed to prototyping of technology platform aimed to develop of ambient-aware human-centric indoor service robot with attributes of emotional intelligence to enhance interaction with social environment. The robot consists of a wheel-based mobile platform with spinal (segmented) torso, bi-manual manipulation system with multi-finger robot hands and robot head. Robot prototype was designed to see, hear, speak and use its multimodal interface for enhanced communication with humans. Robot is capable of demonstrating its affective and social behavior by using audio and video interface as well as body gestures. Robot is equipped with advanced perceptive system based on heterogeneous sensorial system, including laser range finder, ultrasonic distance sensors and proximity detectors, 3-axis inertial sensor (accelerometer and gyroscope), stereo vision system, 2 wide-range microphones, and 2 loudspeakers. The device is foreseen to operate autonomously but it may be also operated remotely from a host computer through wireless communication link as well as by use of a smart-phone based on advanced client-server architecture. Robot prototype has embedded attributes of artificial intelligence and utilizes advanced cognitive capabilities such as spatial reasoning, obstacle and collision avoidance, simultaneous localization and mapping, etc. Robot is designed in a manner to enable uploading of new or changing existing algorithms of emotional intelligence that should provide to robot human-like affective and social behavior. The key objective of the project presented in the paper regards to building advanced technology platform for research and development of personal robots aimed to use for different purpose, e.g. robot-entertainer, battler, robot for medical care, security robot, etc. In a word, the designed technology platform is expected to help in development human-centered service robots to be used at home, in the office, public institutions, etc. ER - TY - JOUR T1 - Smart Energy and power systems modelling: an IoT and Cyber-Physical Systems perspective, in the context of Energy Informatics AU - Bordin, Chiara AU - Håkansson, Anne AU - Mishra, Sambeet JO - Procedia Computer Science VL - 176 SP - 2254 EP - 2263 PY - 2020 DA - 2020/01/01/ T2 - Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES2020 SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2020.09.275 UR - https://www.sciencedirect.com/science/article/pii/S1877050920321797 KW - Cyber Physical Energy Systems KW - Energy Informatics KW - Energy Systems KW - Interdisciplinary KW - IoT KW - Mathematical Modelling KW - Optimisation KW - Power Systems AB - This paper aims at identifying the key role of ”Smart Energy and Power Systems Modelling”, within the context of Energy Informatics. The main objective is to describe how the specific subject of ”Smart Energy and Power Systems Modelling” can give a key contribution within the novel domain of Energy Informatics, by successfully linking and integrating the different disciplines involved. First the paper will present how and where the specific subject of ”Smart Energy and Power Systems Modelling” can position itself within the broad Energy Informatics domain. Afterwards the paper will explain how Cyber-Physical Systems (CPS) and Information and Communication Technologies (IoT), coupled with ”Smart Energy and Power Systems Modelling”, can enhance the Energy Informatics domain. In addition, the main challenges and opportunities for Energy Informatics specialists will be outlined, with regard to the interdisciplinary approach that characterises this field. ER - TY - JOUR T1 - Some models for scheduling parallel programs with communication delays AU - Bampis, Evripidis AU - Guinand, Frédéric AU - Trystram, Denis JO - Discrete Applied Mathematics VL - 72 IS - 1 SP - 5 EP - 24 PY - 1997 DA - 1997/01/10/ T2 - Models and Algorithms for Planning and Scheduling Problems SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(96)00034-0 UR - https://www.sciencedirect.com/science/article/pii/S0166218X96000340 KW - Parallel processing KW - Scheduling, Communications KW - DAGs, Grids KW - Complete trees AB - The aim of this paper is to present and analyze models for designing parallel programs. In the context of some extensions of the most popular execution models (precedence graphs, dataflow, PRAM), we describe scheduling techniques which take into account the communication delays. We illustrate all these models by two families of representative precedence graphs, namely, grids and complete trees. ER - TY - JOUR T1 - Corrigendum to “An optimal solution to a three echelon supply chain network with multi-product and multi-period” [Applied Mathematical Modelling, 38 (5–6), 1911–1918] AU - Cárdenas-Barrón, Leopoldo Eduardo AU - Treviño-Garza, Gerardo JO - Applied Mathematical Modelling VL - 40 IS - 5 SP - 4268 EP - 4269 PY - 2016 DA - 2016/03/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2015.12.004 UR - https://www.sciencedirect.com/science/article/pii/S0307904X15007982 ER - TY - JOUR T1 - Distributed processing of divisible jobs with communication startup costs AU - Błażewicz, Jacek AU - Drozdowski, Maciej JO - Discrete Applied Mathematics VL - 76 IS - 1 SP - 21 EP - 41 PY - 1997 DA - 1997/06/13/ T2 - Second International Colloquium on Graphs and Optimization SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(96)00115-1 UR - https://www.sciencedirect.com/science/article/pii/S0166218X96001151 KW - Distributed processing KW - Scheduling KW - Communication delays KW - Performance evaluation AB - In this work we analyze the problem of an optimal distribution of a computational task among a set of processors. We assume that the task can be arbitrarily divided and its parts can be processed in parallel on different processors. A wide range of interconnection architectures of distributed computer systems is taken into consideration: a chain, a loop, a tree, a star of processors, a set of processors using shared buses, and a hypercube of processors. It is assumed that the communication time is equal to some startup value plus some amount proportional to the volume of transferred data. Using a uniform methodology we present a method to find the distribution of the load so that the minimum completion time is achieved for the considered data distribution scheme. The results can also be used to find such parameters of the processor network as equivalent speed, speedup and utilization. Moreover, the methodology presented here can be a model of the application roll-in time, and can be applied in load balancing in a heterogeneous multiprocessor system. ER - TY - JOUR T1 - A Study of Wireless Communication Links on a Body Centric Network During Running AU - Sabti, Haider A. AU - Thiel, David V. JO - Procedia Engineering VL - 72 SP - 3 EP - 8 PY - 2014 DA - 2014/01/01/ T2 - The Engineering of Sport 10 SN - 1877-7058 DO - https://doi.org/10.1016/j.proeng.2014.06.005 UR - https://www.sciencedirect.com/science/article/pii/S1877705814005219 KW - WBAN KW - BAN KW - Body Centric Network KW - On Body Communication KW - Received Signal Level KW - Sport KW - Running AB - Wireless Body Area Networks (WBAN) is a developing area of research that allows wireless sensors to be attached in or on the human body. The object of this paper is to establish a WBAN to acquire movement and physiological data using sensors at various places on the body and to send their data to a central node. This node processes and re-transmits information to a remote computer (locally or in the cloud) for further processing and presentation. The real time feedback that can be provided by these nodes is very important in sport for the athletes, coaches and the viewing public. However, the challenge is to sustain good wireless communications between the nodes while the athletes are moving. In this paper we report an investigation into the best node locations on the human body to achieve maximum connectivity to a receiving unit (gateway) located on the chest, as well as the best angular window for the nodes to transmit the data during typical human movements such as running and walking. The results showed that while the distance between the transmitting and receiving nodes changes significantly, the presence of scattering from limbs provides the most significant effect on the received signal strength. These measurements demonstrated that a received signal strength of greater than -70 dBm is available for 20% to 74% of the time for different node locations. The use of an accelerometer sensor at each node allows these positions to be identified in real time for burst transmission to occur reliably. ER - TY - JOUR T1 - Sorting algorithms for broadcast communications: mathematical analysis AU - Grabner, Peter J. AU - Prodinger, Helmut JO - Theoretical Computer Science VL - 289 IS - 1 SP - 51 EP - 67 PY - 2002 DA - 2002/10/23/ SN - 0304-3975 DO - https://doi.org/10.1016/S0304-3975(01)00114-1 UR - https://www.sciencedirect.com/science/article/pii/S0304397501001141 KW - Broadcast communication KW - Sorting KW - Conflict resolution KW - Euler's summation formula AB - We study three algorithms for sorting under the broadcast communication model. Two algorithms are based on the maximum finding and the loser selection strategy, the third one is the naı̈ve strategy based on loser selection only. While a precise description of the algorithms can be found in the paper [15], we concentrate here on the mathematical aspects of the analysis. From these elementary considerations it follows that the average time complexities of the non-naı̈ve algorithms are Θ(n). We give precise expressions for the constants involved by writing them as contour integrals involving zeta functions. The numerical evaluation via residues leads to slowly converging series, and the acceleration of them is a non-trivial task that is done in a slightly more general fashion in order to fit all the applications. ER - TY - JOUR T1 - Symbolism, combinations, and visual imagery in the mathematics of Thomas Harriot AU - Stedall, Jacqueline JO - Historia Mathematica VL - 34 IS - 4 SP - 380 EP - 401 PY - 2007 DA - 2007/11/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2007.05.001 UR - https://www.sciencedirect.com/science/article/pii/S031508600700033X AB - The mathematical work of Thomas Harriot (c. 1560–1621) is distinguished by extensive use of symbolism and other forms of visual imagery and by systematic use of combinations. This paper argues that these characteristics of his mathematical writing were already observable in the mid-1580s, in the phonetic alphabet he devised to record the speech of American Indians. The paper presents several little-known examples of Harriot's mathematics, demonstrating his use of symbolism both as a means of expression and as an analytic tool, and assesses Harriot's work in relation to the broader 17th-century trend toward symbolization in mathematics. Résumé Le travail mathématique de Thomas Harriot (c. 1560–1621) se remarque par l'usage qu'il fait de symbolismes et d'autres formes d'images visuelles, et par l'utilisation systématique de combinaisons. Cet exposé argumente que ces traits de son écriture mathématique s'observaient déjà à partir de 1585, dans l'alphabet phonétique qu'il avait conçu afin d'enregistrer la parole des Indiens d'Amérique. L'exposé présente plusieurs exemples peu connus des mathématiques de Harriot et montre son utilisation du symbolisme à la fois en tant que moyen d'expression et outil analytique. Finalement il évalue la place de son travail par rapport à la tendance générale vers la symbolisation mathématique au dix-septième siècle. ER - TY - JOUR T1 - Existence of piecewise weak solutions of a discrete Cucker–Smale's flocking model with a singular communication weight AU - Peszek, Jan JO - Journal of Differential Equations VL - 257 IS - 8 SP - 2900 EP - 2925 PY - 2014 DA - 2014/10/15/ SN - 0022-0396 DO - https://doi.org/10.1016/j.jde.2014.06.003 UR - https://www.sciencedirect.com/science/article/pii/S0022039614002642 AB - We prove existence of global C1 piecewise weak solutions for the discrete Cucker–Smale's flocking model with a non-Lipschitz communication weight ψ(s)=s−α, 0<α<1. We also discuss the possibility of finite in time alignment of the velocities of the particles. ER - TY - JOUR T1 - Dynamic organizations. How to measure evolution and change in organizations by analyzing email communication networks AU - Zenk, Lukas AU - Stadtfeld, Christoph JO - Procedia - Social and Behavioral Sciences VL - 4 SP - 14 EP - 25 PY - 2010 DA - 2010/01/01/ T2 - Applications of Social Network Analysis SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2010.07.479 UR - https://www.sciencedirect.com/science/article/pii/S1877042810018537 KW - Dynamic networks KW - organizational network analysis KW - social network analysis KW - teams KW - exponential random graph models AB - Since organizations are dynamic systems, they change over time. Communication within organizations represents these changes. The use of social network analysis is an established (although still not common) approach to better understanding organizational structures. Methods and business applications for dynamic analyses are still a new, though promising field. The increasing use of computer mediated communication, like email, provides particularly relevant data for studying organizations. Focusing exclusively on the changes in the use of email communication over time, two different methodological approaches are used to analyze the email data stream: descriptive network visualizations and a new model using exponential random graph models for event stream data. In a simulation with 97 students, a merger of two different organizations was replicated. ER - TY - JOUR T1 - Rival approaches to mathematical modelling in immunology AU - Andrew, Sarah M. AU - Baker, Christopher T.H. AU - Bocharov, Gennady A. JO - Journal of Computational and Applied Mathematics VL - 205 IS - 2 SP - 669 EP - 686 PY - 2007 DA - 2007/08/15/ T2 - Special issue on evolutionary problems SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2006.03.035 UR - https://www.sciencedirect.com/science/article/pii/S037704270600392X KW - Mathematics KW - Immunology KW - Model selection AB - In order to formulate quantitatively correct mathematical models of the immune system, one requires an understanding of immune processes and familiarity with a range of mathematical techniques. Selection of an appropriate model requires a number of decisions to be made, including a choice of the modelling objectives, strategies and techniques and the types of model considered as candidate models. The authors adopt a multidisciplinary perspective. ER - TY - JOUR T1 - Corrigendum to “Aggregating crisp values into intuitionistic fuzzy number for group decision making” [Applied Mathematical Modelling 38 (11–12) (2014) 2969–2982] AU - Yue, Zhongliang JO - Applied Mathematical Modelling VL - 39 IS - 5 SP - 1755 EP - 1756 PY - 2015 DA - 2015/03/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2014.06.008 UR - https://www.sciencedirect.com/science/article/pii/S0307904X14003114 ER - TY - JOUR T1 - Keynote I M2M Communication, Actuation and Coordination Challenges in Large Scale IoT/CPS JO - Procedia Computer Science VL - 34 SP - 12 PY - 2014 DA - 2014/01/01/ T2 - The 9th International Conference on Future Networks and Communications (FNC'14)/The 11th International Conference on Mobile Systems and Pervasive Computing (MobiSPC'14)/Affiliated Workshops SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2014.07.004 UR - https://www.sciencedirect.com/science/article/pii/S187705091400859X ER - TY - JOUR T1 - A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints AU - Zhang, Jie AU - Zhang, Ya-qi AU - Zhang, Li-wei JO - Journal of Computational and Applied Mathematics VL - 280 SP - 202 EP - 216 PY - 2015 DA - 2015/05/15/ SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2014.11.057 UR - https://www.sciencedirect.com/science/article/pii/S0377042714005366 KW - Sample average approximation KW - Log-exponential function KW - Stochastic mathematical program with general vertical complementarity constraints KW - Stochastic Stackelberg game AB - Based on the log-exponential function, a sample average approximation (SAA) regularization method is proposed for solving a stochastic mathematical program with general vertical complementarity constraints (SMPVCC) considered by Birbil et al. (2006). Detailed convergence analysis of this method is investigated. It is demonstrated that under some regularity conditions, any accumulation point of the sequence of optimal solutions of SAA regularized problem is almost surely an optimal solution of the SMPVCC as the parameter tends to zero and the sample size tends to infinity. Furthermore, the optimal value sequence of SAA regularized problem converges to the optimal value of SMPVCC with exponential convergence rate with probability one and a sequence of stationary points of regularized SAA problem converges almost surely to a stationary point of SMPVCC. Finally, we show that a stochastic Stackelberg game can be formulated as a SMPVCC problem and an equilibrium solution can be obtained by the method proposed. ER - TY - JOUR T1 - Discrete Models of Autocrine Cell Communication in Epithelial Layers AU - Přibyl, Michal AU - Muratov, Cyrill B. AU - Shvartsman, Stanislav Y. JO - Biophysical Journal VL - 84 IS - 6 SP - 3624 EP - 3635 PY - 2003 DA - 2003/06/01/ SN - 0006-3495 DO - https://doi.org/10.1016/S0006-3495(03)75093-0 UR - https://www.sciencedirect.com/science/article/pii/S0006349503750930 AB - Pattern formation in epithelial layers heavily relies on cell communication by secreted ligands. Whereas the experimentally observed signaling patterns can be visualized at single-cell resolution, a biophysical framework for their interpretation is currently lacking. To this end, we develop a family of discrete models of cell communication in epithelial layers. The models are based on the introduction of cell-to-cell coupling coefficients that characterize the spatial range of intercellular signaling by diffusing ligands. We derive the coupling coefficients as functions of geometric, cellular, and molecular parameters of the ligand transport problem. Using these coupling coefficients, we analyze a nonlinear model of positive feedback between ligand release and binding. In particular, we study criteria of existence of the patterns consisting of clusters of a few signaling cells, as well as the onset of signal propagation. We use our model to interpret recent experimental studies of the EGFR/Rhomboid/Spitz module in Drosophila development. ER - TY - JOUR T1 - Mathematical modelling for optimized control of Moscow's sewer network AU - Ermolin, Yuri A. JO - Applied Mathematical Modelling VL - 23 IS - 7 SP - 543 EP - 556 PY - 1999 DA - 1999/07/01/ SN - 0307-904X DO - https://doi.org/10.1016/S0307-904X(98)10098-7 UR - https://www.sciencedirect.com/science/article/pii/S0307904X98100987 KW - Sewage KW - Network KW - Sewer KW - Pumping station KW - Flow distribution KW - Control KW - Energy consumption KW - Mathematical model KW - Computer AB - An algorithm for the optimized control of a branching urban head-and-gravity sewer network is proposed. The control consists in redistribution of the sewage flows between the network structural components. The algorithm is based on a mathematical model and presupposes the use of a computer. The mathematical model consists of a set of algebraic equations with the structure transporting capacities captured as constraints. The mathematical task of control is stated and solved as an optimization problem. The objective function is the minimization of total electric energy consumption over all the network pumping stations. The assumptions substantiated by practice would reduce the problem to the known problem of linear programming. The discharge through each pumping station of the considered subnetwork of Moscow's sewer network was computed using a mathematical model and was compared to the value observed under the same actual conditions. From this comparison, it was concluded that the proposed algorithm was more successful in controlling the network than was the traditional operation. The correction of the working conditions of some pumping stations of the Moscow sewer subnetwork in accordance with the precalculated time schedule, has allowed a significant decrease in the electric energy consumption for conveyance of the sewage through the network. ER - TY - JOUR T1 - Framing Bersih 3.0: Online Versus Traditional Mass Communication AU - Kee, Chang Peng AU - Ismail, Nor Syazwani AU - Hashim, Norliana AU - Nie, Kho Suet JO - Procedia Technology VL - 11 SP - 161 EP - 168 PY - 2013 DA - 2013/01/01/ T2 - 4th International Conference on Electrical Engineering and Informatics, ICEEI 2013 SN - 2212-0173 DO - https://doi.org/10.1016/j.protcy.2013.12.176 UR - https://www.sciencedirect.com/science/article/pii/S2212017313003307 KW - Online media KW - mass communication KW - media framing KW - political news KW - controversial issue AB - This study focused on news coverage on “Bersih 3.0” by Utusan Malaysia and Malaysiakini. Frames can be divided into five dimensions which are responsibility, human interest, morality, conflict, and economic consequences. A total of 256 news articles were analyzed starting from 4 April to 4 May 2012 using content analysis method. MANOVA test was applied to scrutinize the differences of portrayal of frames by media and event. Overall, there were significant interaction effects based on the prominence portrayal of frames between two media in two different time periods. Responsibility frame was the most prominent frame in Utusan Malaysia during pre-event period compared to post-event period. But conflict frame became the most prominent frame during post-event period compared to pre-event period, likewise for Malaysiakini. ER - TY - JOUR T1 - Optimal communication algorithms for manhattan street networks AU - Varvarigos, Emmanouel A. JO - Discrete Applied Mathematics VL - 83 IS - 1 SP - 303 EP - 326 PY - 1998 DA - 1998/03/25/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(97)00116-9 UR - https://www.sciencedirect.com/science/article/pii/S0166218X97001169 AB - We evaluate the mean internodal distance and the saturation throughput of the Manhattan Street network in the general case, and present a simple shortest path routing algorithm for this topology. We also propose efficient routing algorithms to execute generic communication tasks, such as the total exchange and the multinode broadcast, in a Manhattan Street network of processors. The proposed algorithms execute these tasks in an optimal number of steps, while achieving full (equal to 100%) utilization of the network links. Finally, we construct edge-disjoint Hamiltonian cycles for the Manhattan Street network. ER - TY - JOUR T1 - Markov-modulated finite-source queueing models in evaluation of computer and communication systems AU - Sztrik, J. AU - Kim, C.S. JO - Mathematical and Computer Modelling VL - 38 IS - 7 SP - 961 EP - 968 PY - 2003 DA - 2003/10/01/ T2 - Hungarian Applied Mathematics SN - 0895-7177 DO - https://doi.org/10.1016/S0895-7177(03)90080-X UR - https://www.sciencedirect.com/science/article/pii/S089571770390080X KW - Finite-source queueing KW - Communication system KW - Markov-modulation KW - Fast arrival KW - Fast service AB - The present paper deals with a first-come, first-served (FCFS) queueing model to analyze the behaviour of a heterogeneous finite-source system with a single server. The sources and the server are assumed to operate in independent Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment; that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as utilizations, mean number of requests staying at the server, mean queue lengths, average waiting, and sojourn times. In the case of fast arrivals or fast service, asymptotic methods can be applied. In the intermediate situations, stochastic simulation is used. As applications of this model, some problems in the field of telecommunications and reliability theory are treated. ER - TY - JOUR T1 - Optimization of generalized mean square error in signal processing and communication AU - Hager, William W. AU - Liu, Yong AU - Wong, Tan F. JO - Linear Algebra and its Applications VL - 416 IS - 2 SP - 815 EP - 834 PY - 2006 DA - 2006/07/15/ SN - 0024-3795 DO - https://doi.org/10.1016/j.laa.2005.12.024 UR - https://www.sciencedirect.com/science/article/pii/S0024379506000127 KW - Trace KW - Mean square error KW - MSE KW - Capacity KW - Determinant KW - Optimization KW - MIMO systems KW - Wireless communication AB - Two matrix optimization problems are analyzed. These problems arise in signal processing and communication. In the first problem, the trace of the mean square error matrix is minimized, subject to a power constraint. The solution is the training sequence, which yields the best estimate of a communication channel. The solution is expressed in terms of the eigenvalues and eigenvectors of correlation and covariance matrices describing the communication, and an unknown permutation. Our analysis exhibits the optimal permutation when the power is either very large or very small. Based on the structure of the optimal permutation in these limiting cases, we propose a small class of permutations to focus on when computing the optimal permutation for arbitrary power. In numerical experiments, with randomly generated matrices, the optimal solution is contained in the proposed permutation class with high probability. The second problem is connected with the optimization of the sum capacity of a communication channel. The second problem, which is obtained from the first by replacing the trace operator in the objective function by the determinant, minimizes the product of eigenvalues, while the first problem minimizes the sum of eigenvalues. For small values of the power, both problems have the same solution. As the power increases, the solutions are different, since the permutation matrix appearing in the solution of the trace problem is not present in the solution of the determinant problem. For large power, the ordering of the eigenvectors in the solution of the trace problem is the opposite of the ordering in the determinant problem. ER - TY - JOUR T1 - An unknown mathematical manuscript by Blaise Pascal AU - Descotes, Dominique JO - Historia Mathematica VL - 37 IS - 3 SP - 503 EP - 534 PY - 2010 DA - 2010/08/01/ T2 - Contexts, emergence and issues of Cartesian geometry: In honour of Henk Bos’s 70th birthday SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2009.11.008 UR - https://www.sciencedirect.com/science/article/pii/S0315086009001323 KW - Pascal KW - Pensées KW - Manuscript KW - Indivisibles AB - Résumé Cet article présente un manuscrit méconnu appartenant au Recueil original des Pensées de Pascal. Il propose la description diplomatique du document original, suivie de l’analyse mathématique de la proposition démontrée par Pascal. L’intérêt majeur de cette étude réside dans le fait que ce théorème est le seul document manuscrit subsistant dans l’oeuvre mathématique de Pascal. This article deals with an unknown mathematical manuscript to be found in the Recueil Original of the manuscript of the Pensées. I give a technical description of the original manuscript, followed by a mathematical analysis of the proposition proved by Pascal. The interest of this study lies in the fact that this theorem is the only handwritten draft remaining in Pascal’s mathematical works. ER - TY - JOUR T1 - Physical and Mathematical Modeling in Experimental Papers AU - Möbius, Wolfram AU - Laan, Liedewij JO - Cell VL - 163 IS - 7 SP - 1577 EP - 1583 PY - 2015 DA - 2015/12/17/ SN - 0092-8674 DO - https://doi.org/10.1016/j.cell.2015.12.006 UR - https://www.sciencedirect.com/science/article/pii/S009286741501630X AB - An increasing number of publications include modeling. Often, such studies help us to gain a deeper insight into the phenomena studied and break down barriers between experimental and theoretical communities. However, combining experimental and theoretical work is challenging for authors, reviewers, and readers. To help maximize the usefulness and impact of combined theoretical and experimental research, this Primer describes the purpose, usefulness, and different types of models and addresses the practical aspect of integrated publications by outlining characteristics of good modeling, presentation, and fruitful collaborations. ER - TY - JOUR T1 - Mathematical modeling of quality in a medical structure: A case study AU - Lo Schiavo, M. AU - Prinari, B. AU - Serio, A.V. JO - Mathematical and Computer Modelling VL - 54 IS - 9 SP - 2087 EP - 2103 PY - 2011 DA - 2011/11/01/ SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2011.05.017 UR - https://www.sciencedirect.com/science/article/pii/S0895717711002871 KW - Generalized kinetic theories KW - Mathematical models KW - Social sciences KW - Quality of health care KW - Complex systems AB - A mathematical model, based on a statistical system approach, has been implemented and tested on the basis of a four-year-long experimental data set, with the aim of analyzing the performance and clinical outcome of an existing medical ward, and predicting the effects that possible readjustments and/or interventions on the structure may produce on it. The dynamics of the system is assumed to be connected to a variable called “atmosphere” that refers to the perceived social and organizational climate, as well as the comfort and ease realized in the ward. In this context, the atmosphere is intuitively related to the “quality” that is (or is perceived as being) offered by the service, as it affects the ability to satisfy the patients’ needs, to provide a livable environment for patients and medical staff, and to guarantee more efficient performances and a more complete professional development. Identifying variables, parameters and events that control the atmosphere is therefore of the deepest importance from a social and health-care point of view. The proposed interdisciplinary approach, referring to paradigms of physical and mathematical models integrated with theories and methods typical of social sciences, has chances of gaining the attention of the scientific community in both fields, and higher possibilities of obtaining appreciation and generalization. ER - TY - JOUR T1 - An Extended Hybridization of Vigenere and Caesar Cipher Techniques for Secure Communication AU - Saraswat, Aditi AU - Khatri, Chahat AU - Sudhakar, AU - Thakral, Prateek AU - Biswas, Prantik JO - Procedia Computer Science VL - 92 SP - 355 EP - 360 PY - 2016 DA - 2016/01/01/ T2 - 2nd International Conference on Intelligent Computing, Communication & Convergence, ICCC 2016, 24-25 January 2016, Bhubaneswar, Odisha, India SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2016.07.390 UR - https://www.sciencedirect.com/science/article/pii/S1877050916316465 KW - Cryptography KW - Caesar Cipher KW - Polyalphabetic cipher KW - Modified Vigenere Table AB - Cryptography is one of the most popular fields of study these days as it is necessary to maintain the confidentiality of the data which is sent over the network. There are various cipher techniques available for encrypting the messages such as vernam cipher, mono-alphabetic cipher, poly-alphabetic cipher, etc. One of the most popular cipher techniques is the vigenere cipher. It is a poly-alphabetic cipher technique which uses the vigenere table for the process of encryption of alphabets. This paper extends the vigenere table by including numerical data, so that the numbers can also be encrypted using this technique. It combines the encryption process of vigenere and Caesar cipher for getting the cipher text from the given plaintext and key. ER - TY - JOUR T1 - On reliability indices of communication networks AU - Rodríguez-Velázquez, Juan Alberto AU - Kamišalić, Aida AU - Domingo-Ferrer, Josep JO - Computers & Mathematics with Applications VL - 58 IS - 7 SP - 1433 EP - 1440 PY - 2009 DA - 2009/10/01/ SN - 0898-1221 DO - https://doi.org/10.1016/j.camwa.2009.07.019 UR - https://www.sciencedirect.com/science/article/pii/S089812210900491X KW - Wiener index KW - Information theory KW - Graph eigenvalues AB - The aim of this paper is to study the global reliability of communication networks. We assume that, in a communication network, the weights of the edges quantify the volume or the quality of the information transmitted by the nodes. In such a case, the strength of a path (resp. walk), called the reliability of the path (resp. walk) can be calculated as the product of the weights of the edges belonging to the paths (resp. walks). We introduce three indices to compute the reliability of a digraph (resp. graph). The first one is a version of Wiener index where we consider only the most reliable path between each pair of nodes. The second notion of reliability index considers reliability of all walks between each pair of nodes instead of taking into account only the most reliable path. The last one is a generalization of the functional centralization to the case of weighted networks. In this case, the notion of reliability index considers, for each node, the reliability of all closed walks starting and ending in the node. In addition, we propose a method for computing the introduced indices. Application of some of the proposed indices to trust-weighted social networks is also discussed. ER - TY - JOUR T1 - Scalable Stochastic and Hybrid Methods and Algorithms for Extreme Scale Computing AU - Alexandrov, Vassil JO - Procedia Computer Science VL - 29 SP - 1888 EP - 1892 PY - 2014 DA - 2014/01/01/ T2 - 2014 International Conference on Computational Science SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2014.05.173 UR - https://www.sciencedirect.com/science/article/pii/S1877050914003500 KW - Scalable Stochastic and Hybrid Mathematical Methods KW - Monte Carlo methods and algorithms KW - Scalable Algorithms KW - Extreme Scale Computing AB - Novel mathematics and mathematical modelling approaches together with scalable algorithms are needed to enable key applications at extreme-scale. This is especially true as HPC systems continue to scale up in compute node and processor core count. At the moment computational scientists are at the critical point/threshold of novel mathematics development as well as large-scale algorithm development and re-design and implementation that will affect most of the application areas. Thus the paper will focus on the mathematical and algorithmic challenges and approaches towards exascale and beyond and in particular on stochastic and hybrid methods that in turn lead to scalable scientific algorithms with minimal or no global communication, hiding network and memory latency, have very high computation/communication overlap, have no synchronization points. ER - TY - JOUR T1 - Spatial reasoning under imprecision using fuzzy set theory, formal logics and mathematical morphology AU - Bloch, Isabelle JO - International Journal of Approximate Reasoning VL - 41 IS - 2 SP - 77 EP - 95 PY - 2006 DA - 2006/02/01/ T2 - Advances in Fuzzy Sets and Rough Sets SN - 0888-613X DO - https://doi.org/10.1016/j.ijar.2005.06.011 UR - https://www.sciencedirect.com/science/article/pii/S0888613X05000502 KW - Spatial reasoning KW - Imprecision KW - Spatial relationships KW - Fuzzy sets KW - Fuzzy mathematical morphology KW - Morpho-logics KW - Fusion KW - Decision making KW - Image interpretation KW - Model-based recognition AB - In spatial reasoning, in particular for applications in image understanding, structure recognition and computer vision, a lot of attention has to be paid to spatial relationships and to the imprecision attached to information and knowledge to be handled. Two main components are knowledge representation and reasoning. We show in this paper that the fuzzy set framework associated to the formalism provided by mathematical morphology and formal logics allows us to derive appropriate representations and reasoning tools. ER - TY - JOUR T1 - Stochastic Modelling of Communication Protocols from Source Code AU - Smith, Michael J.A. JO - Electronic Notes in Theoretical Computer Science VL - 190 IS - 3 SP - 129 EP - 145 PY - 2007 DA - 2007/09/06/ T2 - Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2007.08.013 UR - https://www.sciencedirect.com/science/article/pii/S1571066107005622 KW - Performance modelling KW - Stochastic process algebra KW - Static analysis KW - Communication protocols AB - A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe and motivate similar extensions to quantitative / performance analyses, with particular emphasis on communication protocols. The central aim is to extract a stochastic model (in the PEPA language) from such source code. We construct a model compositionally, so that each function in the system corresponds to a sequential PEPA process. Such a process is derived by abstract interpretation over the state machine of a function, using interval abstraction to represent linear expressions of integer variables. We illustrate this by an analysis of a simple protocol. ER - TY - JOUR T1 - Kenneth O. May and information retrieval in mathematics AU - Lewis, Albert C JO - Historia Mathematica VL - 31 IS - 2 SP - 186 EP - 195 PY - 2004 DA - 2004/05/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2003.11.003 UR - https://www.sciencedirect.com/science/article/pii/S0315086003001034 KW - Information retrieval KW - Kenneth O. May KW - Mathematics AB - From 1966 to 1977 Kenneth O. May led a team of University of Toronto staff and students that aimed to produce the most comprehensive general reference tools to date for the history of mathematics. The major published result was the 1973 Bibliography and Research Manual of the History of Mathematics, but also in the works was a dictionary and thesaurus of mathematical terms linked to their use in the literature. These works were intended to be a basis for subject indexing the whole of mathematical literature. His conceptual design and his goal and methodology, are useful examples in information retrieval. Résumé De 1966 à 1977 Kenneth O. May dirigea une équipe d'étudiants et de membres du personnel de l'université de Toronto dans le but de produire les outils de référence généraux les plus complets jusqu'ici pour l'histoire des mathématiques. L'ouvrage principal qui en résulta fut Bibliography and Research Manual of the History of Mathematics, paru en 1973, mais également prévu étaient un dictionnaire et thesaurus des termes mathématiques liés à leur utilisation dans la littérature. Ces travaux voulaient servir de base au classement des sujets de l'ensemble de la littérature mathématique. Le modèle conceptuel conçu par May, ainsi que son objectif et sa méthodologie, sont des exemples utiles dans la recherche documentaire. ER - TY - JOUR T1 - What Mathematics Mentor Teachers Decide: Intervening in Practice Teachers’ Teaching AU - Wang, Chih-Yeuan JO - Procedia - Social and Behavioral Sciences VL - 8 SP - 41 EP - 49 PY - 2010 DA - 2010/01/01/ T2 - International Conference on Mathematics Education Research 2010 (ICMER 2010) SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2010.12.006 UR - https://www.sciencedirect.com/science/article/pii/S1877042810021117 KW - Critical incidents of practice KW - Mentoring decision-making KW - Teaching intervention AB - In this paper, we mainly investigate, through the pedagogical critical incidents of practice (CIPs), the ways mathematics mentor teachers intervene in the teaching of practice teachers, and the reasons and underlying values for their interventions, based on case studies of a group of 8 mentor-practice teachers and their student classes in secondary schools. When watching practice teachers’ teaching, due to lack of professional knowledge and experiences, mentors may get the feeling that their students are confused about the teaching, or situations of classrooms are not under their control, so that they must deal with the situations at the moment. One general technique mentors might have used is to “intervene-in-action” of practice teachers, when the CIPs appear. According to our raw data, we distinguish the forms of mentor teachers’ on-the-spot interventions into three major categories: “active”, “passive”, and “no” intervention. Two subcategories “direct” and “indirect” intervention are also salient within “active intervention”. The preliminary results show that (1) the reasons and ways of mentor teachers’ interventions were varied; and (2) mentor teachers developed frameworks of mentoring decision-making closely related to the specific modes of intervention that they chose. ER - TY - JOUR T1 - Mathematical Services Composition AU - Chicha, Yannis AU - Gaëtano, Marc JO - Electronic Notes in Theoretical Computer Science VL - 114 SP - 103 EP - 117 PY - 2005 DA - 2005/01/17/ T2 - Proceedings of the Software Composition Workshop (SC 2004) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2004.02.069 UR - https://www.sciencedirect.com/science/article/pii/S1571066104052685 KW - Mathematical Web services KW - Service Composition KW - Mathematical Computation AB - This paper describes the definition and the use of a plan language in the context of mathematical web services. A plan is a document intended to describe how to use different mathematical web services to solve a particular problem. A plan is like a program in which most of the function calls have to be handled by web services. A plan is a multiple-state choreography document which could be either abstract, unresolved or resolved, depending on how much of the web services involved in the choreography is known. Such a plan can be instantiated into a composition language such as BPEL or to a mathematical routine (like a Maple routine) for execution. ER - TY - JOUR T1 - Special Issue on Mathematics Applied to Immunology AU - Bocharov, Gennady AU - Brunner, Hermann AU - Grossman, Zvi JO - Journal of Computational and Applied Mathematics VL - 184 IS - 1 SP - 1 EP - 3 PY - 2005 DA - 2005/12/01/ T2 - Special Issue on Mathematics Applied to Immunology SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2005.02.006 UR - https://www.sciencedirect.com/science/article/pii/S0377042705000579 ER - TY - JOUR T1 - Values for games with two-level communication structures AU - Khmelnitskaya, Anna JO - Discrete Applied Mathematics VL - 166 SP - 34 EP - 50 PY - 2014 DA - 2014/03/31/ SN - 0166-218X DO - https://doi.org/10.1016/j.dam.2013.10.019 UR - https://www.sciencedirect.com/science/article/pii/S0166218X13004472 KW - TU game KW - Coalition structure KW - Communication structure KW - Myerson value KW - Owen value KW - Aumann–Drèze value KW - Component efficiency KW - Deletion link property AB - We consider a new model of a TU game endowed with both coalition and two-level communication structures that applies to various network situations. The approach to the value is close to that of both Myerson (1977) and Aumann and Drèze (1974): it is based on ideas of component efficiency and of one or another deletion link property, and it treats an a priori union as a self-contained unit; moreover, our approach incorporates also the idea of the Owen’s quotient game property (1977). The axiomatically introduced values possess an explicit formula representation and in many cases can be quite simply computed. The results obtained are applied to the problem of sharing an international river, possibly with a delta or multiple sources, among multiple users without international firms. ER - TY - JOUR T1 - Verifier-based computation-and communication-efficient 3EKE protocols AU - Yoon, Eun-Jun JO - Mathematical and Computer Modelling VL - 58 IS - 1 SP - 165 EP - 171 PY - 2013 DA - 2013/07/01/ T2 - Financial IT & Security and 2010 International Symposium on Computational Electronics SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2012.06.015 UR - https://www.sciencedirect.com/science/article/pii/S0895717712001525 KW - Security KW - Authentication KW - Key agreement KW - Password KW - Diffie–Hellman AB - This paper proposes verifier-based computation-and communication-efficient three-party encrypted key exchange (VBCC3EKE) protocols to minimize the complexity of computational and communicational costs among all users and fit three-party communication environments. Compared with related verifier-based 3EKE protocols, the proposed VBCC3EKE protocols have enhanced computational and communicational efficiency. As a result, the proposed VBCC3EKE protocols are most suitable for use in various applications over distributed three-party network environments such as the Internet and mobile e-commerce. ER - TY - JOUR T1 - Predictive Mathematical Emergency Information System (EIS) Using GIS, GPS and Digital Photogrammetry (DP) AU - Al-Garni, Abdullah M. JO - Journal of King Saud University - Engineering Sciences VL - 20 IS - 1 SP - 1 EP - 12 PY - 2008 DA - 2008/01/01/ SN - 1018-3639 DO - https://doi.org/10.1016/S1018-3639(18)30851-1 UR - https://www.sciencedirect.com/science/article/pii/S1018363918308511 KW - GIS KW - GPS KW - Traffic KW - Emergency KW - Deployment KW - Mathematical module KW - Shortest path AB - Predictive Traffic Response Emergency Information System (PTREIS) was developed based on proven mathematical models. Unlike many traditional systems, PTREIS contains an intelligent spatial mechanism and attributes for building a database. On one hand, the spatial mechanism searches for the nearest accessible route to the accident location. On the other hand, the contents of the database can be used for three purposes: (1) building statistical data based on which parameters of PTREIS mathematical models can be improved, (2) defining the most probable dangerous traffic locations and reporting them to planners, engineers, and authorities to make further analysis and to take actions towards correcting the causes of accidents at theses spatial sites, and (3) defining the shortest path to an accident location based on newly introduced advance models, concepts, and mechanisms. The system was tested using a central urban area of Riyadh City, the capital of Saudi Arabia. The model was applied to three primary categories of emergency centers: hospitals, fire stations, and police stations. ER - TY - JOUR T1 - An Improved Joint Channel Estimation of Wireless Communication AU - Fan, Tongliang AU - Huang, Shengbo AU - Gu, Shujie JO - Procedia Computer Science VL - 107 SP - 533 EP - 538 PY - 2017 DA - 2017/01/01/ T2 - Advances in Information and Communication Technology: Proceedings of 7th International Congress of Information and Communication Technology (ICICT2017) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2017.03.106 UR - https://www.sciencedirect.com/science/article/pii/S1877050917303812 KW - TD-SCDMA KW - joint channel estimation KW - conjugate gradient KW - ZF-BLE AB - B. Steiner proposed a low cost channel estimation method through short training sequences, which has been applied in third generation mobile communicationTD-SCDMA system. However, the errors are inevitable in estimated channel impulse response due to inter-carrier interference and additive noise. To further improve the system performance, joint channel estimation has been proposed to reduce the effect of residule interference and noise. In order to get higher estimation accuracy, this paper presents conjugate gradient algorithm for channel estimation, which is suitable for large matrix. Simulation results are compared between B. Steiner channel estimator and conjugate gradient channel estimator. ER - TY - JOUR T1 - Universal prediction-based adaptive fault estimator applied to secure communication AU - Tsai, Jason Sheng-Hong AU - Hsu, Wen-Teng AU - Wei, Chao-Lung AU - Guo, Shu-Mei AU - Shieh, Leang-San JO - Applied Mathematical Modelling VL - 38 IS - 19 SP - 4717 EP - 4732 PY - 2014 DA - 2014/10/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2014.03.028 UR - https://www.sciencedirect.com/science/article/pii/S0307904X14001310 KW - Secure communication KW - Nonlinear system KW - Prediction-based adaptive observer KW - Fault detection and diagnosis KW - Performance recovery KW - Digital redesign AB - In this paper, a communication scheme that could use a nonlinear dynamical system to create encrypted keys with an additional dimension is proposed, and the scheme could keep encrypted keys not to diverge. Since the divergence of encrypted keys (nonlinear signals) easily happens in non-linear systems coupled with other systems, the adaptive control approach, proposed in this paper, uses the universal state-space adaptive observer-based fault diagnosis/estimator and the high-performance tracker to eliminate the divergence of encrypted keys. At the same time, the receiver of communication retrieves informal messages by the universal state-space adaptive observer-based fault diagnosis/estimator and the high-performance tracker. Thus, this paper takes advantage of the merit of digital redesign methodology for a practical implementation of secure-communication, and the estimator solves the problem of secure communication. Thus developed a new approach could add more dimensions into nonlinear secure-communication systems without having the problem of divergence of encrypted keys. ER - TY - JOUR T1 - Food deprivation reduces and leptin increases the amplitude of an active sensory and communication signal in a weakly electric fish AU - Sinnett, Philip M. AU - Markham, Michael R. JO - Hormones and Behavior VL - 71 SP - 31 EP - 40 PY - 2015 DA - 2015/05/01/ SN - 0018-506X DO - https://doi.org/10.1016/j.yhbeh.2015.03.010 UR - https://www.sciencedirect.com/science/article/pii/S0018506X15000434 KW - Energetics KW - Electric fish KW - Electric organ discharge (EOD) KW - Cortisol KW - Melanocortin hormones KW - Leptin KW - Metabolic stress KW - Food deprivation AB - Energetic demands of social communication signals can constrain signal duration, repetition, and magnitude. The metabolic costs of communication signals are further magnified when they are coupled to active sensory systems that require constant signal generation. Under such circumstances, metabolic stress incurs additional risk because energy shortfalls could degrade sensory system performance as well as the social functions of the communication signal. The weakly electric fish Eigenmannia virescens generates electric organ discharges (EODs) that serve as both active sensory and communication signals. These EODs are maintained at steady frequencies of 200–600Hz throughout the lifespan, and thus represent a substantial metabolic investment. We investigated the effects of metabolic stress (food deprivation) on EOD amplitude (EODa) and EOD frequency (EODf) in E. virescens and found that only EODa decreases during food deprivation and recovers after restoration of feeding. Cortisol did not alter EODa under any conditions, and plasma cortisol levels were not changed by food deprivation. Both melanocortin hormones and social challenges caused transient EODa increases in both food-deprived and well-fed fish. Intramuscular injections of leptin increased EODa in food-deprived fish but not well-fed fish, identifying leptin as a novel regulator of EODa and suggesting that leptin mediates EODa responses to metabolic stress. The sensitivity of EODa to dietary energy availability likely arises because of the extreme energetic costs of EOD production in E. virescens and also could reflect reproductive strategies of iteroparous species that reduce social signaling and reproduction during periods of stress to later resume reproductive efforts when conditions improve. ER - TY - JOUR T1 - Recent trends on Computational and Mathematical Methods in Science and Engineering (CMMSE) AU - Vigo-Aguiar, Jesús AU - Cordero, Alicia AU - Ramos, Higinio JO - Journal of Computational and Applied Mathematics VL - 275 SP - 213 EP - 215 PY - 2015 DA - 2015/02/01/ SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2014.08.001 UR - https://www.sciencedirect.com/science/article/pii/S0377042714003446 ER - TY - JOUR T1 - Dodgson condensation: The historical and mathematical development of an experimental method AU - Abeles, Francine F. JO - Linear Algebra and its Applications VL - 429 IS - 2 SP - 429 EP - 438 PY - 2008 DA - 2008/07/15/ SN - 0024-3795 DO - https://doi.org/10.1016/j.laa.2007.11.022 UR - https://www.sciencedirect.com/science/article/pii/S0024379507005290 KW - Automation of determinant evaluations KW - Determinantal identity KW - Condensation KW - Dodgson AB - Dodgson’s condensation method has become a powerful tool in the automation of determinant evaluations. In this expository paper I describe its 19th century roots and the major steps on the path that began in the 20th century when the iteration of an identity derived by Dodgson first was studied, including its role in the discovery of the alternating sign matrix conjecture, the evaluation of an important 19th century determinant in partition theory as well as a combinatorial proof of it. I then discuss additional developments that have led the way to its use in modern experimental mathematics. ER - TY - JOUR T1 - Synthetic Ecology of Microbes: Mathematical Models and Applications AU - Zomorrodi, Ali R. AU - Segrè, Daniel JO - Journal of Molecular Biology VL - 428 IS - 5, Part B SP - 837 EP - 861 PY - 2016 DA - 2016/02/27/ T2 - Engineering Tools and Prospects in Synthetic Biology SN - 0022-2836 DO - https://doi.org/10.1016/j.jmb.2015.10.019 UR - https://www.sciencedirect.com/science/article/pii/S0022283615006129 KW - Microbial communities KW - Synthetic Biology KW - Systems Biology KW - Metabolic network modeling KW - Metabolic engineering AB - As the indispensable role of natural microbial communities in many aspects of life on Earth is uncovered, the bottom-up engineering of synthetic microbial consortia with novel functions is becoming an attractive alternative to engineering single-species systems. Here, we summarize recent work on synthetic microbial communities with a particular emphasis on open challenges and opportunities in environmental sustainability and human health. We next provide a critical overview of mathematical approaches, ranging from phenomenological to mechanistic, to decipher the principles that govern the function, dynamics and evolution of microbial ecosystems. Finally, we present our outlook on key aspects of microbial ecosystems and synthetic ecology that require further developments, including the need for more efficient computational algorithms, a better integration of empirical methods and model-driven analysis, the importance of improving gene function annotation, and the value of a standardized library of well-characterized organisms to be used as building blocks of synthetic communities. ER - TY - JOUR T1 - Geometrical aspects of testing complex statistical hypotheses in mathematical simulation AU - Pichugin, Yury A. JO - St. Petersburg Polytechnical University Journal: Physics and Mathematics VL - 1 IS - 2 SP - 181 EP - 191 PY - 2015 DA - 2015/06/01/ SN - 2405-7223 DO - https://doi.org/10.1016/j.spjpm.2015.07.001 UR - https://www.sciencedirect.com/science/article/pii/S2405722315300189 KW - Boundary point of maximum likelihood KW - Lagrange task KW - Reliability ellipsoid AB - It is well known that mathematical simulation parameters are often obtained by statistical estimation. Therefore the problem of testing complex statistical hypotheses, such as the one about a model parameters vector belonging to some domain, is of current concern. This article deals with the geometrical aspects of the problem. The basic theorem to solve this problem has been stated and proved. The theorem asserts that the solution can be obtained through testing some simple statistical hypothesis concerning a boundary point of maximum likelihood. The theorem proof is based on the use of a generalized Euclidean metric and an affine transformation of parameter space. Typical examples of its use for different mathematical models are also considered. They are the following: (i) Altman's model of the economic stability and risk assessment; an assessment of a specific enterprise is treated in terms of statistical hypotheses testing; (ii) a method to refine statistical estimations of production function parameters; (iii) a statistical estimation of spacecraft dynamic stability is considered on the basis of Kepler's model, as well. ER - TY - JOUR T1 - German mathematicians in exile in Turkey: Richard von Mises, William Prager, Hilda Geiringer, and their impact on Turkish mathematics AU - Eden, Alp AU - Irzik, Gürol JO - Historia Mathematica VL - 39 IS - 4 SP - 432 EP - 459 PY - 2012 DA - 2012/11/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2012.07.002 UR - https://www.sciencedirect.com/science/article/pii/S0315086012000377 KW - Richard von Mises KW - William Prager KW - Hilda Geiringer KW - Istanbul Technical University KW - Applied mathematics KW - Mechanics AB - There is a sizable and growing literature on scholars who fled from the Nazi regime, a literature which often focuses on the periods before leaving Germany and after settling permanently in the USA, but relatively less work on the interim period in which many of them found temporary homes in countries such as Turkey. In this article we would like to discuss the scholarly work, activities and the impact of mathematicians Richard von Mises, William Prager and Hilda Geiringer during their stay in Turkey. We argue that the establishment and the development of applied mathematics and mechanics in Turkey owe much to them. Zusammenfassung Es gibt eine betrachtliche und wachsende Forschungsliteratur zu den Gelehrten, die aus dem NS-Regime flüchteten; diese Literatur befaßt sich oft mit den Zeiträumen vor dem Verlassen Deutschlands oder nach dem dauerhaften Niederlassen in den Vereinigten Staaten. Es gibt aber verhältnismäßig wenig Arbeit über die Übergangszeit, in der viele von ihnen vorübergehendes Heimat in Ländern wie der Türkei gefunden haben. In diesem Aufsatz möchten wir die wissenschaftliche Arbeit, Aktivitäten und Auswirkungen der Mathematiker Richard von Mises, Wilhelm Prager und Hilda Geiringer während ihres Aufenthalts in der Türkei diskutieren. Wir argumentieren, daß die Errichtung und die Entwicklung der angewandten Mathematik und Mechanik in der Türkei ihnen viel verdanken. ER - TY - JOUR T1 - Performance of Coffman-Graham schedules in the presence of unit communication delays AU - Hanen, C. AU - Munier, A. JO - Discrete Applied Mathematics VL - 81 IS - 1 SP - 93 EP - 108 PY - 1998 DA - 1998/01/15/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(97)00077-2 UR - https://www.sciencedirect.com/science/article/pii/S0166218X97000772 AB - This paper studies the relative performance of the Coffman-Graham algorithm for scheduling unitary tasks onm processors with unitary communication delays. Using a particular decomposition of CG-schedules, we prove that its worst case relative performance is bounded by4/3 form = 2 and that this bound is tight. Form ⩾ 3, we provide an instance of the problem for which the performance ratio is3 − [6/(m + 1)]. ER - TY - JOUR T1 - On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA’s AU - Hromkovič, Juraj AU - Petersen, Holger AU - Schnitger, Georg JO - Theoretical Computer Science VL - 410 IS - 30 SP - 2972 EP - 2981 PY - 2009 DA - 2009/08/20/ T2 - A bird’s eye view of theory SN - 0304-3975 DO - https://doi.org/10.1016/j.tcs.2009.03.020 UR - https://www.sciencedirect.com/science/article/pii/S0304397509002382 KW - Communication complexity KW - Descriptional complexity KW - Finite automata KW - Nondeterminism AB - In contrast to the minimization of deterministic finite automata (DFA’s), the task of constructing a minimal nondeterministic finite automaton (NFA) for a given NFA is PSPACE-complete. Moreover, there are no polynomial approximation algorithms with a constant approximation ratio for estimating the number of states of minimal NFA’s. Since one is unable to efficiently estimate the size of a minimal NFA in an efficient way, one should ask at least for developing mathematical proof methods that help to prove good lower bounds on the size of a minimal NFA for a given regular language. Here we consider the robust and most successful lower bound proof technique that is based on communication complexity. In this paper it is proved that even a strong generalization of this method fails for some concrete regular languages. “To fail” is considered here in a very strong sense. There is an exponential gap between the size of a minimal NFA and the achievable lower bound for a specific sequence of regular languages. The generalization of the concept of communication protocols is also strong here. It is shown that cutting the input word into 2O(n1/4) pieces for a size n of a minimal nondeterministic finite automaton and investigating the necessary communication transfer between these pieces as parties of a multiparty protocol does not suffice to get good lower bounds on the size of minimal nondeterministic automata. It seems that for some regular languages one cannot really abstract from the automata model that cuts the input words into particular symbols of the alphabet and reads them one by one using its input head. ER - TY - JOUR T1 - Design and Implementation of MP, a Protocol for Efficient Exchange of Mathematical Expressions AU - Gray, S. AU - Kajler, N. AU - Wang, P.S. JO - Journal of Symbolic Computation VL - 25 IS - 2 SP - 213 EP - 237 PY - 1998 DA - 1998/02/01/ SN - 0747-7171 DO - https://doi.org/10.1006/jsco.1997.0173 UR - https://www.sciencedirect.com/science/article/pii/S0747717197901735 AB - The Multi Project is an ongoing research effort at Kent State University aimed at providing an environment for distributed scientific computing. An integral part of this environment is the Multi Protocol (MP) which is designed to support efficient communication of mathematical data between scientifically-oriented software tools. MP exchanges data in the form of linearized annotated syntax trees. Syntax trees provide a simple, flexible and tool-independent way to represent and exchange data, and annotations provide a powerful and generic expressive facility for transmitting additional information. At a level above the data exchange protocol, dictionaries provide definitions for operators and constants, providing shared semantics across heterogeneous packages. A clear distinction between MP-defined and user-defined entities is enforced. Binary encodings are used for efficiency. Commonly used values and blocks of homogeneous data are further optimized. The protocol is independent of the underlying communication paradigm and can support parallel computation, distributed problem-solving environments, and the coupling of tools for specific applications. ER - TY - JOUR T1 - The Implications of Fuzzy Logic in Qualitative Mathematical Modeling of Some Key Aspects Related to the Sustainability Issues around “Roşia Montană Project” AU - Sîrb, Lucian JO - Procedia Economics and Finance VL - 6 SP - 372 EP - 384 PY - 2013 DA - 2013/01/01/ T2 - International Economic Conference of Sibiu 2013 Post Crisis Economy: Challenges and Opportunities, IECS 2013 SN - 2212-5671 DO - https://doi.org/10.1016/S2212-5671(13)00151-2 UR - https://www.sciencedirect.com/science/article/pii/S2212567113001512 KW - fuzzy logic KW - sustainability KW - multicriteria decision. AB - This paper aims to address in terms of fuzzy logic the qualitative mathematical modeling of some key aspects that implies ensuring of sustainability within “Roşia Montană mining Project”, both from the business itself perspective, as well as from the community and ecological ones. The proposed fuzzy methodology is also very useful and can be successfully applied for any company that evolves in uncertainty and ambiguity conditions and within which the decisional factor reasoning is subjective, due to itself abstract thinking of human being in this kind of situations, which often manifests itself through qualitative linguistic values. In this context, the development of a fuzzy methodology embedded in a fuzzy software tool developed in Java programming language for solving this aspects in a quickly and realiable manner represents an efficient opportunity for treating any ambiguous decisional context, especially within “Roşia Montană mining Project”. ER - TY - JOUR T1 - On multi-partition communication complexity AU - Ďuriš, Pavol AU - Hromkovič, Juraj AU - Jukna, Stasys AU - Sauerhoff, Martin AU - Schnitger, Georg JO - Information and Computation VL - 194 IS - 1 SP - 49 EP - 75 PY - 2004 DA - 2004/10/10/ SN - 0890-5401 DO - https://doi.org/10.1016/j.ic.2004.05.002 UR - https://www.sciencedirect.com/science/article/pii/S0890540104000999 KW - Computational complexity KW - Multi-partition communication complexity KW - Non-obliviousness KW - Lower bounds KW - Complexity hierarchy KW - Read-once branching programs AB - We study k-partition communication protocols, an extension of the standard two-party best-partition model to k input partitions. The main results are as follows.1.A strong explicit hierarchy on the degree of non-obliviousness is established by proving that, using k+1 partitions instead of k may decrease the communication complexity from Θ(n) to Θ(logk).2.Certain linear codes are hard for k-partition protocols even when k may be exponentially large (in the input size). On the other hand, one can show that all characteristic functions of linear codes are easy for randomized OBDDs.3.It is proved that there are subfunctions of the triangle-freeness function and the function ⊕Clique3,n that are hard for multi-partition protocols. As an application, strongly exponential lower bounds on the size of nondeterministic read-once branching programs for these functions are obtained, solving an open problem of Razborov [Proceedings of eighth FCT NCS 529, Springer, 1991, pp. 47–60]. ER - TY - JOUR T1 - Mathematical Analysis and Quantification of Fluorescent Proteins as Transcriptional Reporters AU - Wang, Xiao AU - Errede, Beverly AU - Elston, Timothy C. JO - Biophysical Journal VL - 94 IS - 6 SP - 2017 EP - 2026 PY - 2008 DA - 2008/03/15/ SN - 0006-3495 DO - https://doi.org/10.1529/biophysj.107.122200 UR - https://www.sciencedirect.com/science/article/pii/S0006349508705496 AB - Fluorescent proteins are often used as reporters of transcriptional activity. Here we present a mathematical characterization of a novel fluorescent reporter that was recently engineered to have a short half-life (∼12min). The advantage of this destabilized protein is that it can track the transient transcriptional response often exhibited by signaling pathways. Our mathematical model takes into account the maturation time and half-life of the fluorescent protein. We demonstrate that our characterization allows transient transcript profiles to be inferred from fluorescence data. We also investigate a stochastic version of the model. Our analysis reveals that fluorescence measurements can both underestimate and overestimate fluctuations in protein levels that arise from the stochastic nature of biochemical reactions. ER - TY - JOUR T1 - Topological optimization models for communication network with multiple reliability goals AU - Liu, Baoding AU - Iwamura, K. JO - Computers & Mathematics with Applications VL - 39 IS - 7 SP - 59 EP - 69 PY - 2000 DA - 2000/04/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(00)00065-1 UR - https://www.sciencedirect.com/science/article/pii/S0898122100000651 KW - Network reliability KW - Stochastic programming KW - Genetic algorithm KW - Simulation AB - Network reliability models for determining optimal network topology have been presented and solved by many researchers. This paper presents some new types of topological optimization model for communication network with multiple reliability goals. A stochastic simulation-based genetic algorithm is also designed for solving the proposed models. Some numerical examples are finally presented to illustrate the effectiveness of the algorithm. ER - TY - JOUR T1 - Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks AU - Fragopoulou, Paraskevi AU - Akl, Selim G. JO - Discrete Applied Mathematics VL - 83 IS - 1 SP - 79 EP - 96 PY - 1998 DA - 1998/03/25/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(97)00105-4 UR - https://www.sciencedirect.com/science/article/pii/S0166218X97001054 KW - Cayley graph KW - Communication algorithm KW - Interconnection network KW - Spanning subgraph AB - In this paper, we develop a special framework on a number of networks that exhibit some specific characteristics and belong to a subclass of the Cayley-graph-based networks. Subsequently, we show how this framework can be used to construct on all the applicable networks a spanning subgraph, denoted by BSG, that possesses several special properties. This spanning subgraph constitutes the basic tool for the development of algorithms for three fundamental communication problems on interconnection networks, namely, the multinode broadcasting, and the single-node and multinode scattering. The algorithms are developed in the store-and-forward, all-port, and bidirectional communication model and are analyzed according to the constant cost model. ER - TY - JOUR T1 - Computer supported mathematics with Ωmega AU - Siekmann, Jörg AU - Benzmüller, Christoph AU - Autexier, Serge JO - Journal of Applied Logic VL - 4 IS - 4 SP - 533 EP - 559 PY - 2006 DA - 2006/12/01/ T2 - Towards Computer Aided Mathematics SN - 1570-8683 DO - https://doi.org/10.1016/j.jal.2005.10.008 UR - https://www.sciencedirect.com/science/article/pii/S157086830500073X KW - Artificial intelligence KW - Computer-supported mathematics KW - Proof assistant systems KW - Interactive and automated theorem-proving KW - Proof planning KW - Omega AB - Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces—often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to more abstract planning techniques however opened up a paradigm for mathematical reasoning on a computer and several systems of that kind now employ a mix of interactive, search based as well as proof planning techniques. The Ωmega system is at the core of several related and well-integrated research projects of the Ωmega research group, whose aim is to develop system support for a working mathematician as well as a software engineer when employing formal methods for quality assurance. In particular, Ωmega supports proof development at a human-oriented abstract level of proof granularity. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. Ωmega has many characteristics in common with systems like NuPrL, CoQ, Hol, Pvs, and Isabelle. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems Clam and λClam at Edinburgh. ER - TY - JOUR T1 - Epidemics on networks: Reducing disease transmission using health emergency declarations and peer communication AU - Azizi, Asma AU - Montalvo, Cesar AU - Espinoza, Baltazar AU - Kang, Yun AU - Castillo-Chavez, Carlos JO - Infectious Disease Modelling VL - 5 SP - 12 EP - 22 PY - 2020 DA - 2020/01/01/ SN - 2468-0427 DO - https://doi.org/10.1016/j.idm.2019.11.002 UR - https://www.sciencedirect.com/science/article/pii/S2468042719300405 KW - Awareness spread KW - Behavior change KW - Outbreak and epidemic threats KW - Erdős-rényi network KW - Small-world network KW - Scale-free network AB - Understanding individual decisions in a world where communications and information move instantly via cell phones and the internet, contributes to the development and implementation of policies aimed at stopping or ameliorating the spread of diseases. In this manuscript, the role of official social network perturbations generated by public health officials to slow down or stop a disease outbreak are studied over distinct classes of static social networks. The dynamics are stochastic in nature with individuals (nodes) being assigned fixed levels of education or wealth. Nodes may change their epidemiological status from susceptible, to infected and to recovered. Most importantly, it is assumed that when the prevalence reaches a pre-determined threshold level, P*, information, called awareness in our framework, starts to spread, a process triggered by public health authorities. Information is assumed to spread over the same static network and whether or not one becomes a temporary informer, is a function of his/her level of education or wealth and epidemiological status. Stochastic simulations show that threshold selection P* and the value of the average basic reproduction number impact the final epidemic size differentially. For the Erdős-Rényi and Small-world networks, an optimal choice for P* that minimize the final epidemic size can be identified under some conditions while for Scale-free networks this is not case. ER - TY - JOUR T1 - Cross-Kingdom Chemical Communication Drives a Heritable, Mutually Beneficial Prion-Based Transformation of Metabolism AU - Jarosz, Daniel F. AU - Brown, Jessica C.S. AU - Walker, Gordon A. AU - Datta, Manoshi S. AU - Ung, W. Lloyd AU - Lancaster, Alex K. AU - Rotem, Assaf AU - Chang, Amelia AU - Newby, Gregory A. AU - Weitz, David A. AU - Bisson, Linda F. AU - Lindquist, Susan JO - Cell VL - 158 IS - 5 SP - 1083 EP - 1093 PY - 2014 DA - 2014/08/28/ SN - 0092-8674 DO - https://doi.org/10.1016/j.cell.2014.07.025 UR - https://www.sciencedirect.com/science/article/pii/S0092867414009751 AB - Summary In experimental science, organisms are usually studied in isolation, but in the wild, they compete and cooperate in complex communities. We report a system for cross-kingdom communication by which bacteria heritably transform yeast metabolism. An ancient biological circuit blocks yeast from using other carbon sources in the presence of glucose. [GAR+], a protein-based epigenetic element, allows yeast to circumvent this “glucose repression” and use multiple carbon sources in the presence of glucose. Some bacteria secrete a chemical factor that induces [GAR+]. [GAR+] is advantageous to bacteria because yeast cells make less ethanol and is advantageous to yeast because their growth and long-term viability is improved in complex carbon sources. This cross-kingdom communication is broadly conserved, providing a compelling argument for its adaptive value. By heritably transforming growth and survival strategies in response to the selective pressures of life in a biological community, [GAR+] presents a unique example of Lamarckian inheritance. ER - TY - JOUR T1 - Structural variability and communicative complexity in acoustic communication AU - Fischer, Julia AU - Wadewitz, Philip AU - Hammerschmidt, Kurt JO - Animal Behaviour VL - 134 SP - 229 EP - 237 PY - 2017 DA - 2017/12/01/ SN - 0003-3472 DO - https://doi.org/10.1016/j.anbehav.2016.06.012 UR - https://www.sciencedirect.com/science/article/pii/S000334721630104X KW - bioacoustics KW - call type KW - fuzzy clustering KW - hard clustering KW - information theory KW - primate KW - repertoire KW - signal KW - vocalization AB - The notion that social complexity may drive communicative complexity has invigorated the research interest in the question of how to assess the structural features of a species' communication system. This applies to both the level of the signal repertoire and the level of potential rules governing the succession of elements. This review first provides an overview of some of the most influential studies in the realm of acoustic communication, before turning to a key problem at the foundation of many analyses. Many biological signal repertoires reveal intermediate forms between specific signal types as well as variation within signal types. Therefore, it is often difficult to identify the specific number of signal types (and consequently, their sequential relationships). Nevertheless, subjective classification or ‘hard clustering’ approaches force items into specific categories. Yet, given the graded nature of many repertoires, it may be more appropriate to measure the degree of differentiation within a repertoire, instead of the number of call types, which may also be strongly affected by sampling artefacts. ‘Fuzzy clustering’ provides measures to capture the overall structural variability of a repertoire, i.e. whether they are rather graded or discrete. Because with fuzzy clustering it may also be difficult to identify a single best cluster solution, methods are needed that transcend the number of clusters identified with the cluster analysis. One such approach is the assessment of the distribution of typicality coefficients, which are derived from fuzzy clustering. For the time being, these provide an alternative route to quantitatively test hypotheses regarding the evolution of signal repertoires. Future research should aim to establish a solid mathematical foundation to link the properties of graded repertoires to measures derived from complexity theory. Until then, the notion of complexity to describe the structure of a repertoire should be used with caution. ER - TY - JOUR T1 - Designing a new science-policy communication mechanism for the UN Convention to Combat Desertification AU - Akhtar-Schuster, M. AU - Amiraslani, F. AU - Morejon, C.F. Diaz AU - Escadafal, R. AU - Fulajtar, E. AU - Grainger, A. AU - Kellner, K. AU - Khan, S.I. AU - Pardo, O.Perez AU - Sauchanka, U. AU - Stringer, L.C. AU - Reda, Fasil AU - Thomas, R.J. JO - Environmental Science & Policy VL - 63 SP - 122 EP - 131 PY - 2016 DA - 2016/09/01/ SN - 1462-9011 DO - https://doi.org/10.1016/j.envsci.2016.03.009 UR - https://www.sciencedirect.com/science/article/pii/S1462901116300600 KW - Land degradation KW - Science and technology studies KW - Science-advisory bodies KW - Global environmental governance KW - Scientific autonomy KW - Science-policy interface AB - The United Nations Convention to Combat Desertification (UNCCD) has lacked an efficient mechanism to access scientific knowledge since entering into force in 1996. In 2011 it decided to convene an Ad Hoc Working Group on Scientific Advice (AGSA) and gave it a unique challenge: to design a new mechanism for science-policy communication based on the best available scientific evidence. This paper outlines the innovative ‘modular mechanism’ which the AGSA proposed to the UNCCD in September 2013, and how it was designed. Framed by the boundary organization model, and an understanding of the emergence of a new multi-scalar and polycentric style of governing, the modular mechanism consists of three modules: a Science-Policy Interface (SPI); an international self-governing and self-organizing Independent Non-Governmental Group of Scientists; and Regional Science and Technology Hubs in each UNCCD region. Now that the UNCCD has established the SPI, it is up to the worldwide scientific community to take the lead in establishing the other two modules. Science-policy communication in other UN environmental conventions could benefit from three generic principles corresponding to the innovations in the three modules—joint management of science-policy interfaces by policy makers and scientists; the production of synthetic assessments of scientific knowledge by autonomous and accountable groups of scientists; and multi-scalar and multi-directional synthesis and reporting of knowledge. ER - TY - JOUR T1 - A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints AU - Zhang, Jie AU - Zhang, Li-wei AU - Lin, Shuang JO - Journal of Mathematical Analysis and Applications VL - 387 IS - 1 SP - 201 EP - 220 PY - 2012 DA - 2012/03/01/ SN - 0022-247X DO - https://doi.org/10.1016/j.jmaa.2011.08.073 UR - https://www.sciencedirect.com/science/article/pii/S0022247X11008407 KW - Sample average approximation KW - Smoothing method KW - Stochastic mathematical program with complementarity constraints KW - Almost sure convergence AB - A class of smoothing sample average approximation (SAA) methods is proposed for solving the stochastic mathematical program with complementarity constraints (SMPCC) considered by Birbil et al. [S.I. Birbil, G. Gürkan, O. Listes, Solving stochastic mathematical programs with complementarity constraints using simulation, Math. Oper. Res. 31 (2006) 739–760]. The almost sure convergence of optimal solutions of the smoothed SAA problem to that of the true problem is established by the notion of epi-convergence in variational analysis. It is demonstrated that, under suitable conditions, any accumulation point of Karash–Kuhn–Tucker points of the smoothed SAA problem is almost surely a kind of stationary point of SMPCC as the sample size tends to infinity. Moreover, under a strong second-order sufficient condition for SMPCC, the exponential convergence rate of the sequence of Karash–Kuhn–Tucker points of the smoothed SAA problem is investigated through an application of Robinsonʼs stability theory. Some preliminary numerical results are reported to show the efficiency of proposed method. ER - TY - JOUR T1 - The Research of Human-Computer Interface Design based on Vision Communication AU - Yan, Rushan JO - Procedia Engineering VL - 15 SP - 3114 EP - 3118 PY - 2011 DA - 2011/01/01/ T2 - CEIS 2011 SN - 1877-7058 DO - https://doi.org/10.1016/j.proeng.2011.08.584 UR - https://www.sciencedirect.com/science/article/pii/S1877705811020856 KW - Human-Computer Interface KW - Vision Transmission KW - Information Design AB - In the quick popularity and promoting function of micro-computer and internet, human-computer researches have unprecedented development and develop towards more intellect, convenient, human orientated direction. However, the present researches still lay particular stress on the interface technology characteristics of figure users, and are very poor in the exploring of visual design art plan of figure users interface. Aiming at this, this paper mainly researches how to connect the computer technology with human through the visual expression of interface design, and make human to achieve most convenience and the possibility of high efficiency in the process of operating computer. ER - TY - JOUR T1 - Auditory perceptual objects as generative models: Setting the stage for communication by sound AU - Winkler, István AU - Schröger, Erich JO - Brain and Language VL - 148 SP - 1 EP - 22 PY - 2015 DA - 2015/09/01/ T2 - The electrophysiology of speech, language, and its precursors SN - 0093-934X DO - https://doi.org/10.1016/j.bandl.2015.05.003 UR - https://www.sciencedirect.com/science/article/pii/S0093934X15001054 KW - Audition KW - Cognition KW - Auditory object KW - Auditory scene analysis KW - Deviance (irregularity) detection KW - Predictive modeling KW - Prediction KW - Speech KW - Streaming AB - Communication by sounds requires that the communication channels (i.e. speech/speakers and other sound sources) had been established. This allows to separate concurrently active sound sources, to track their identity, to assess the type of message arriving from them, and to decide whether and when to react (e.g., reply to the message). We propose that these functions rely on a common generative model of the auditory environment. This model predicts upcoming sounds on the basis of representations describing temporal/sequential regularities. Predictions help to identify the continuation of the previously discovered sound sources to detect the emergence of new sources as well as changes in the behavior of the known ones. It produces auditory event representations which provide a full sensory description of the sounds, including their relation to the auditory context and the current goals of the organism. Event representations can be consciously perceived and serve as objects in various cognitive operations. ER - TY - JOUR T1 - A prosopographical analysis of the early American mathematics publication community AU - Timmons, Todd JO - Historia Mathematica VL - 31 IS - 4 SP - 429 EP - 454 PY - 2004 DA - 2004/11/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2003.09.001 UR - https://www.sciencedirect.com/science/article/pii/S0315086003000806 KW - American mathematics KW - Publication community KW - Science journals AB - Mathematics in the United States developed slowly over its first one hundred years. Before the appearance of successful mathematics journals, American mathematicians depended on science journals to publish their work. Three journals, the Transactions of the American Philosophical Society, the Memoirs of the American Academy of Arts and Sciences, and the American Journal of Science and Arts, played pivotal roles in the development of a mathematics publication community. Résumé Les mathématiques se sont développées lentement au cours des cent premières années d'existence des États Unis. Avant l'avènement de revues mathématiques bien établies, les mathématiciens américains dépendaient des journaux scientifiques pour la publication de leurs travaux. Trois revues, Transactions of the American Philosophical Society, Memoirs of the American Academy of Arts and Sciences, et American Journal of Science and Arts, jouèrent un rôle central dans le développement de l'édition consacrée uniquement aux mathématiques. ER - TY - JOUR T1 - The minumum geodetic communication overlap graphs AU - Nieminen, J. AU - Peltola, M. JO - Applied Mathematics Letters VL - 11 IS - 2 SP - 99 EP - 102 PY - 1998 DA - 1998/03/01/ SN - 0893-9659 DO - https://doi.org/10.1016/S0893-9659(98)00018-4 UR - https://www.sciencedirect.com/science/article/pii/S0893965998000184 KW - Geodetic connectivity KW - Communication networks KW - Communication overloading AB - We develop further the communication overlap index of Hong and Zuo in the case where the points of the graph communicate with each other through shortest paths (geodesics) of the graph. The structure of the graphs with minimum geodetic communication index is described, the concept of geodetic connectivity of a graph introduced, and a condition for testing the geodetic connectivity of a graph given. ER - TY - JOUR T1 - A century of mathematics education: ICMI’s first hundred years AU - Jankvist, Uffe Thomas JO - Historia Mathematica VL - 38 IS - 2 SP - 292 EP - 302 PY - 2011 DA - 2011/05/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2010.03.003 UR - https://www.sciencedirect.com/science/article/pii/S0315086010000066 ER - TY - JOUR T1 - Communication in ants AU - Jackson, Duncan E. AU - Ratnieks, Francis L.W. JO - Current Biology VL - 16 IS - 15 SP - R570 EP - R574 PY - 2006 DA - 2006/08/08/ SN - 0960-9822 DO - https://doi.org/10.1016/j.cub.2006.07.015 UR - https://www.sciencedirect.com/science/article/pii/S0960982206018343 ER - TY - JOUR T1 - A Mathematical Model for Intracellular HIV-1 Gag Protein Transport and its Parallel Numerical Simulations AU - Liu, Jiangguo AU - Munoz-Alicea, Roberto AU - Huang, Tingwen AU - Tavener, Simon AU - Chen, Chaoping JO - Procedia Computer Science VL - 9 SP - 679 EP - 688 PY - 2012 DA - 2012/01/01/ T2 - Proceedings of the International Conference on Computational Science, ICCS 2012 SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2012.04.073 UR - https://www.sciencedirect.com/science/article/pii/S1877050912001949 KW - Active transport KW - cytoplasm KW - diffusion KW - finite element methods KW - gag proteins KW - HIV-1 KW - microtubules KW - MPI KW - OpenMP AB - In this paper, we develop a mathematical model for intracellular HIV-1 gag protein tracking based on the hypotheses that gag proteins employ kinesins for active transport on microtubules and they can also diffuse in cytoplasm. This results in a time-dependent convection-diffusion equation in polar coordinates along with appropriate boundary and initial conditions. A finite element method based on tracking characteristics is established for accurately solving this type of transport problems. The numerical method has been implemented in C++. To validate the mathematical model, we perform numerical simulations on the virion timing, i.e., the time needed for HIV-1 virions (puncta) to first appear on the cell plasma membrane. Numerical simulation results and biological experimental data agree principally. For in silico analysis of gag protein tracking, the numerical simulation code needs to be executed repeatedly on a large collection of sets of model parameters. We further investigate code parallelization strategies using MPI and OpenMP. ER - TY - JOUR T1 - Launching mathematical research without a formal mandate: The role of university-affiliated journals in Britain, 1837–1870 AU - Despeaux, Sloan Evans JO - Historia Mathematica VL - 34 IS - 1 SP - 89 EP - 106 PY - 2007 DA - 2007/02/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2006.02.005 UR - https://www.sciencedirect.com/science/article/pii/S0315086006000218 AB - For much of the 19th century, the systems of higher education in Britain provided no formal mandate for students to conduct research. This article explores the conditions facing junior mathematicians who wanted to launch research in this environment and the university-affiliated mathematical journals that provided encouragement and direction for their research. Resumi Durante la maggior parte del diciannovesimo secolo, il sistema dell'istruzione superiore in Gran Bretagna non prevedeva per gli studenti l'obbligo di fare ricerca. Questo articolo esamina le circostanze in cui si trovarono quei giovani matematici che vollero introdurre la ricerca in questo ambiente e le riviste di matematica, affiliate alle universitá, che incoraggiarono e guidarono la loro ricerca. ER - TY - JOUR T1 - A linear lower bound on the unbounded error probabilistic communication complexity AU - Forster, Jürgen JO - Journal of Computer and System Sciences VL - 65 IS - 4 SP - 612 EP - 625 PY - 2002 DA - 2002/12/01/ T2 - Special Issue on Complexity 2001 SN - 0022-0000 DO - https://doi.org/10.1016/S0022-0000(02)00019-3 UR - https://www.sciencedirect.com/science/article/pii/S0022000002000193 KW - Lower bounds KW - Probabilistic communication complexity KW - Hadamard matrix KW - Spectral norm AB - The main mathematical result of this paper may be stated as follows: Given a matrix M∈{−1,1}n×n and any matrix M̃∈Rn×n such that sign(M̃i,j)=Mi,j for all i,j, then rank(M̃)⩾n/||M||. Here ||M|| denotes the spectral norm of the matrix M. This implies a general lower bound on the complexity of unbounded error probabilistic communication protocols. As a simple consequence, we obtain the first linear lower bound on the complexity of unbounded error probabilistic communication protocols for the functions defined by Hadamard matrices. This solves a long-standing open problem stated by Paturi and Simon (J. Comput. System Sci. 33 (1986) 106). We also give an upper bound on the margin of any embedding of a concept class in half spaces. Such bounds are of interest to problems in learning theory. ER - TY - JOUR T1 - Hans Wußing (1927–2011) and the blooming of the history of mathematics and sciences in the German Democratic Republic – A biographical essay AU - Siegmund-Schultze, Reinhard JO - Historia Mathematica VL - 39 IS - 2 SP - 143 EP - 173 PY - 2012 DA - 2012/05/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2012.01.004 UR - https://www.sciencedirect.com/science/article/pii/S0315086012000055 ER - TY - JOUR T1 - A New Mathematical Formulation for the Home Health Care Problem AU - Gayraud, Fabrice AU - Deroussi, Laurent AU - Grangeon, Nathalie AU - Norre, Sylvie JO - Procedia Technology VL - 9 SP - 1041 EP - 1047 PY - 2013 DA - 2013/01/01/ T2 - CENTERIS 2013 - Conference on ENTERprise Information Systems / ProjMAN 2013 - International Conference on Project MANagement/ HCIST 2013 - International Conference on Health and Social Care Information Systems and Technologies SN - 2212-0173 DO - https://doi.org/10.1016/j.protcy.2013.12.116 UR - https://www.sciencedirect.com/science/article/pii/S2212017313002703 KW - Home health care KW - integer linear programming KW - care planning AB - The home health care problem is a growing sector in the French medical service industry. In this paper, we propose a new mathematical model for this problem. This model integrates two original concepts: the degree of competence of the personal and the level of dependence of the patient. The model is validated on a small-size and a medium-size instance. ER - TY - JOUR T1 - Optimal Path Selection Criteria for Multipath Optical Wireless Communication Link AU - Dhore, Jayshree AU - Kharalkar, Anjali AU - Gohane, Suresh AU - Jumle, Pranjali JO - Procedia Computer Science VL - 78 SP - 660 EP - 666 PY - 2016 DA - 2016/01/01/ T2 - 1st International Conference on Information Security & Privacy 2015 SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2016.02.114 UR - https://www.sciencedirect.com/science/article/pii/S1877050916001162 KW - FSO KW - LAN KW - MADM KW - AHP AB - This paper addresses the atmospheric effects on optical channel for short distance multipath communication links. The main focus is to study the performance of optical wireless system by using optimal path selection criteria using AHP algorithm. The atmospheric parameters such as air temperature, attenuation due to scattering and absorption, beam deflection, optical noise etc under varying atmospheric turbulence conditions were compared to select a best alternative optical path between transmitter and receiver. The performance degradation patterns for multiple optical links are tested to achieve maximum signal to noise ratio at every node. The multiple attribute decision method is employed at every node which involves selection from among finite number of alternatives. Different alternatives, Attributes, weight or relative importance of each attribute and measure of performance of alternatives with respect to the attributes are the main parts in each decision table of MADM methods. The simulation results are presented, base on the given finite attribute to achieve the maximum optical link availability as well as reliability of data rate in a high speed data network. ER - TY - JOUR T1 - The Usage of Self-Regulated Learning Strategies among Form Four Students in the Mathematical Problem-Solving Context: A Case Study AU - Puteh, Marzita AU - Ibrahim, Mahani JO - Procedia - Social and Behavioral Sciences VL - 8 SP - 446 EP - 452 PY - 2010 DA - 2010/01/01/ T2 - International Conference on Mathematics Education Research 2010 (ICMER 2010) SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2010.12.061 UR - https://www.sciencedirect.com/science/article/pii/S187704281002166X KW - Self-regulated learning KW - Problem solving strategies KW - Motivation AB - This paper presents findings on the self-regulated learning strategies among Form Four students in the State of Perak, Malaysia. A case study was used to determine the usage of self-regulated strategies among the students and how it helps the students in solving Mathematic's problems. Besides that, the level of motivation among the students is also identified. Data has been collected through Motivated Learning Strategies Questionnaire- Revised (MSLQ-R), reviewing of written answers of students (tests) and interviews. The research revealed the level of motivation and the existence of self-regulated learning strategies among the students. This research has shown that there is a strong relationship between the selfregulated learning strategies and the student's performance of problem-solving. ER - TY - JOUR T1 - Gap junctional communication in morphogenesis AU - Levin, Michael JO - Progress in Biophysics and Molecular Biology VL - 94 IS - 1 SP - 186 EP - 206 PY - 2007 DA - 2007/05/01/ T2 - Gap junction channels: from protein genes to diseases SN - 0079-6107 DO - https://doi.org/10.1016/j.pbiomolbio.2007.03.005 UR - https://www.sciencedirect.com/science/article/pii/S0079610707000168 KW - Gap junctional communication KW - Embryonic patterning KW - Asymmetry KW - Model KW - Electrophoresis AB - Gap junctions permit the direct passage of small molecules from the cytosol of one cell to that of its neighbor, and thus form a system of cell–cell communication that exists alongside familiar secretion/receptor signaling. Because of the rich potential for regulation of junctional conductance, and directional and molecular gating (specificity), gap junctional communication (GJC) plays a crucial role in many aspects of normal tissue physiology. However, the most exciting role for GJC is in the regulation of information flow that takes place during embryonic development, regeneration, and tumor progression. The molecular mechanisms by which GJC establishes local and long-range instructive morphogenetic cues are just beginning to be understood. This review summarizes the current knowledge of the involvement of GJC in the patterning of both vertebrate and invertebrate systems and discusses in detail several morphogenetic systems in which the properties of this signaling have been molecularly characterized. One model consistent with existing data in the fields of vertebrate left–right patterning and anterior–posterior polarity in flatworm regeneration postulates electrophoretically guided movement of small molecule morphogens through long-range GJC paths. The discovery of mechanisms controlling embryonic and regenerative GJC-mediated signaling, and identification of the downstream targets of GJC-permeable molecules, represent exciting next areas of research in this fascinating field. ER - TY - JOUR T1 - Comparing communication primitives via their relative expressive power AU - Gorla, Daniele JO - Information and Computation VL - 206 IS - 8 SP - 931 EP - 952 PY - 2008 DA - 2008/08/01/ SN - 0890-5401 DO - https://doi.org/10.1016/j.ic.2008.05.001 UR - https://www.sciencedirect.com/science/article/pii/S0890540108000436 KW - Process calculi KW - Communication primitives KW - Relative expressiveness KW - Encodings AB - In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), arity (monadic vs polyadic data), communication medium (message passing vs shared dataspaces) and pattern-matching. Some of these primitives have already been used in at least one language which has appeared in the literature; however, to reason uniformly on such primitives, we plug them into a common framework based on the π. By means of possibility/impossibility of ‘reasonable’ encodings, we compare every pair of primitives to obtain a hierarchy of languages based on their relative expressive power. ER - TY - JOUR T1 - The Role of ICT for Supporting Relationships between Students. Evidence for Spain AU - Prieto, Cristina Vilaplana JO - Procedia - Social and Behavioral Sciences VL - 228 SP - 123 EP - 130 PY - 2016 DA - 2016/07/20/ T2 - 2nd International Conference on Higher Education Advances,HEAd'16, 21-23 June 2016, València, Spain SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2016.07.105 UR - https://www.sciencedirect.com/science/article/pii/S1877042816310321 KW - Mathematics KW - ICT KW - interaction KW - integration AB - At present, the use of ICT (Information Communication Technology) is integrated in everyday teaching. Apart from developing new knowledge, it is convenient to test if computer enhances communication and solidarity among students. The implementation of the Program School 2.0 in Spain in conjunction with PISA survey for 2012 provides a unique opportunity for analyzing this issue. We estimate a bivariate ordered probit model for the frequency of support provided to other students and Mathematics performance. We posit the potential endogeneity of the variable Mathematics performance given that support received from others could have a significant effect over the resulting Mathematics achievement. We highlight two main results. First, the probability of helping other classmates with Mathematics increases notoriously in participant Communities in School 2.0 for “strong performers” and “top performers”. Second, for repeater and immigrant students (and specifically those with different mother tongue), the probability of providing support “always/almost always” or “often” increases significantly in participant Communities with respect to non-participant Communities for all Mathematics performance levels. ICT provide an incentive for exchanging mathematical problems and discussing different solutions. And what is even more valuable, ICT may foster togetherness and ease the integration of different profiles of students. ER - TY - JOUR T1 - A mathematical model for supermarket location problem with stochastic station demands AU - Nourmohammadi, Amir AU - Eskandari, Hamidreza AU - Fathi, Masood AU - Aghdasi, Mohammad JO - Procedia CIRP VL - 72 SP - 444 EP - 449 PY - 2018 DA - 2018/01/01/ T2 - 51st CIRP Conference on Manufacturing Systems SN - 2212-8271 DO - https://doi.org/10.1016/j.procir.2018.03.254 UR - https://www.sciencedirect.com/science/article/pii/S2212827118304256 KW - deterministic KW - stochastic KW - part feeding KW - supermarket KW - optimization AB - This paper aims to investigate the effect of station demands variations on supermarket location problem (SLP). This problem arises in the real-world assembly line part feeding (PF) context where supermarkets are used as the intermediate storage areas for stations. To this purpose a stochastic SLP model is developed to optimize the total cost of PF in terms of shipment, inventory and installation costs. The computational results over a real case as well as different test instances verify that the station demands variation has an effect on the SLP solutions. ER - TY - JOUR T1 - Online planning for multi-agent systems with bounded communication AU - Wu, Feng AU - Zilberstein, Shlomo AU - Chen, Xiaoping JO - Artificial Intelligence VL - 175 IS - 2 SP - 487 EP - 511 PY - 2011 DA - 2011/02/01/ SN - 0004-3702 DO - https://doi.org/10.1016/j.artint.2010.09.008 UR - https://www.sciencedirect.com/science/article/pii/S0004370210001578 KW - Decentralized POMDPs KW - Cooperation and collaboration KW - Planning under uncertainty KW - Communication in multi-agent systems AB - We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solving such problems offline. The key challenges in decentralized operation are to maintain coordinated behavior with little or no communication and, when communication is allowed, to optimize value with minimal communication. The algorithm addresses these challenges by generating identical conditional plans based on common knowledge and communicating only when history inconsistency is detected, allowing communication to be postponed when necessary. To be suitable for online operation, the algorithm computes good local policies using a new and fast local search method implemented using linear programming. Moreover, it bounds the amount of memory used at each step and can be applied to problems with arbitrary horizons. The experimental results confirm that the algorithm can solve problems that are too large for the best existing offline planning algorithms and it outperforms the best online method, producing much higher value with much less communication in most cases. The algorithm also proves to be effective when the communication channel is imperfect (periodically unavailable). These results contribute to the scalability of decision-theoretic planning in multi-agent settings. ER - TY - JOUR T1 - Divisible load scheduling in single-level tree networks: Optimal sequencing and arrangement in the nonblocking mode of communication AU - Kim, H.J. AU - Mani, V. JO - Computers & Mathematics with Applications VL - 46 IS - 10 SP - 1611 EP - 1623 PY - 2003 DA - 2003/11/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(03)90196-9 UR - https://www.sciencedirect.com/science/article/pii/S0898122103901969 KW - Divisible loads KW - Nonblocking mode of communication KW - Processing time KW - Optimal load sequence KW - Single-level tree network AB - The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking mode of communication is derived. Using this closed-form expression, this paper analytically proves a number of significant results on load sequencing and processor-link arrangement in a single-level tree network. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication. ER - TY - JOUR T1 - The management of technology enhanced study process development at LUA AU - Vintere, Anna JO - Procedia - Social and Behavioral Sciences VL - 41 SP - 37 EP - 44 PY - 2012 DA - 2012/01/01/ T2 - The First International Conference on Leadership, Technology and Innovation Management SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2012.04.005 UR - https://www.sciencedirect.com/science/article/pii/S1877042812008853 KW - E-education KW - information communication technologies KW - study process organization KW - educational projects AB - This article is the result of the research made in Latvia University of Agriculture (LUA) with the goal to study the possible usage of information communication technologies (ICT) in the studies of mathematics in engineering programs and the basis for that is the Pale's division of ICT usage in education system. The problem has been studied using the analysis of scientific literature, the author's experience reflection and various observations as well as analysis of the results of participation in research and development projects. An empiric research was carried out as well – a questionnaire for the students and lecturers of LUA on the factors determining the organization of study process of mathematics. Thus, according to the results of the research the main emphasis in this paper is put on ICT as a facilitator tool for the intensification of study process in the studies of mathematics development. The intensification includes two essence directions. At first, it includes the minimizing, automatizing or even avoiding at all from so called “non-educational” functions. Secondly, making the learning and studying processes faster, easier, more concentrated, wider and deeper thus providing support in the processes of learning and teaching. ER - TY - JOUR T1 - Structural Optimization of a Self-sustainable Decentralized Energy System by Mathematical Programming Techniques AU - Sakakibara, Kazutoshi AU - Taniguchi, Ittetsu AU - Matsumoto, Takuya AU - Tamaki, Hisashi JO - Procedia Technology VL - 18 SP - 68 EP - 71 PY - 2014 DA - 2014/01/01/ T2 - International workshop on Innovations in Information and Communication Science and Technology, IICST 2014, 3-5 September 2014, Warsaw, Poland SN - 2212-0173 DO - https://doi.org/10.1016/j.protcy.2014.11.015 UR - https://www.sciencedirect.com/science/article/pii/S2212017314005362 KW - renewable and sustainable enrgy KW - DC microdgrid KW - power electronics KW - power converter; AB - The renewal of conventional energy systems is an important countermeasure against the effects of global warming and natural disasters. A self-sustainable, decentralized energy system is one of the promising solutions for future sustainable and resilient societies. The Nushima Project attempts to construct a prototype of a self-sustainable decentralized energy system based on DC power distribution of the renewable energy on Nushima island, an isolated island in Japan. In this paper, under the Nushima Project, a mathematical programming model is formulated and design and utilization of the overall DC micro grid system is optimized based on the model, where the system is equipped not only with stationary batteries but also with mobile batteries. Through the results of numerical simulations, the effectiveness and the potential of the proposed model are investigated, including clarifying the effect of the batteries. ER - TY - JOUR T1 - Broadcast and gossip in line-communication mode AU - Laforest, C. JO - Discrete Applied Mathematics VL - 80 IS - 2 SP - 161 EP - 176 PY - 1997 DA - 1997/12/11/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(97)00054-1 UR - https://www.sciencedirect.com/science/article/pii/S0166218X97000541 KW - Broadcast KW - Gossip KW - Tree KW - Line-communication AB - This paper addresses the problem of efficiently performing two important operations of communication in networks, namely broadcast and gossip. We study these operations in the line-communication model that is similar to the circuit-switching technique. We propose a simpler proof of the fundamental result, due to A. Farley, that gives the exact broadcast time, ⌜log2 n⌝ steps, in any connected network of order n. In the second part we construct gossip algorithms in any tree network and we prove that they are optimal or asymptotically optimal. We finally give a precise idea of the shape of trees in which gossip is possible in ⌜log2 n⌝ steps. Finally, we present general results on gossip in any connected graph. ER - TY - JOUR T1 - Nominalism and constructivism in seventeenth-century mathematical philosophy AU - Sepkoski, David JO - Historia Mathematica VL - 32 IS - 1 SP - 33 EP - 59 PY - 2005 DA - 2005/02/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2003.09.002 UR - https://www.sciencedirect.com/science/article/pii/S0315086003000818 KW - Constructivism KW - Nominalism KW - Isaac Newton KW - Pierre Gassendi AB - This paper argues that the philosophical tradition of nominalism, as evident in the works of Pierre Gassendi, Thomas Hobbes, Isaac Barrow, and Isaac Newton, played an important role in the history of mathematics during the 17th century. I will argue that nominalist philosophy of mathematics offers new clarification of the development of a “constructivist” tradition in mathematical philosophy. This nominalist and constructivist tradition offered a way for contemporary mathematicians to discuss mathematical objects and magnitudes that did not assume these entities were real in a Platonic sense, and helped lay the groundwork for formalist and instrumentalist approaches in modern mathematics. Résumé Cet article soutient que la tradition philosophique du nominalisme, évidente dans les travaux de Pierre Gassendi, Thomas Hobbes, Isaac Barrow et Isaac Newton, a joué un rôle important dans l'histoire des mathématiques pendant le dix-septième siècle. L'argument princicipal est que la philosophie nominaliste des mathématiques est à la base du développement d'une tradition « constructiviste » en philosophie mathématique. Cette tradition nominaliste et constructiviste a permis aux mathématiciens contemporains de pouvoir discuter d'objets et quantités mathématiques sans présupposer leur réalité au sens Platonique du terme, et a contribué au developpement desétudes formalistes et instrumentalistes des mathématiques modernes. ER -