TY - JOUR T1 - Mathematical Approach to Predict the Drug Effects on Cancer Stem Cell Models AU - Fornari, Chiara AU - Cordero, Francesca AU - Manini, Daniele AU - Balbo, Gianfranco AU - Calogero, Raffaele A. JO - Electronic Notes in Theoretical Computer Science VL - 277 SP - 29 EP - 39 PY - 2011 DA - 2011/10/27/ T2 - The Second International Workshop on Interactions between Computer Science and Biology SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2011.09.033 UR - https://www.sciencedirect.com/science/article/pii/S1571066111001241 KW - Prediction of Cancer Stem Cells behaviour KW - Mathemathical approach KW - Biological processes modelling AB - The mechanism behind the growth and development of tumors is intensively studied using several mathematical approaches that rely on linear and non-linear techniques to model the cell population dynamics to better understand the development and progression of cancer. In this paper, we study the progression of a type of malignant tumors characterized by the stem-differentiation hierarchy. Two main issues are modeled and investigated: the differentiation phase and the phenotypic plasticity that suggests the existence of a dynamic interaction among Cancer Stem Cells and non-Cancer Stem Cells populations. Using these models, we study several therapy effects on breast cancer in order to obtain the temporal behavior of the cell populations, taking into account different drug concentrations and oncoantigen-driven vaccinations. ER - TY - JOUR T1 - Short communication: Effects of nanofiltration and evaporation on the gel properties of milk protein concentrates with different preheat treatments AU - Wang, Hong AU - Wang, Yunna AU - Cao, Jialu AU - Yuan, Dongdong AU - Chen, Liankun AU - Han, Jie AU - Li, Yan AU - Zhang, Liebing JO - Journal of Dairy Science VL - 101 IS - 6 SP - 4977 EP - 4982 PY - 2018 DA - 2018/06/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2017-13811 UR - https://www.sciencedirect.com/science/article/pii/S0022030218302431 KW - milk protein concentrate KW - nanofiltration KW - evaporation KW - preheat treatment AB - ABSTRACT This study aimed to evaluate the effects of different concentration methods (nanofiltration and evaporation) and heat treatments on the gel properties of milk protein concentrate (MPC). The MPC gels were produced using glucono-δ-lactone (GDL) as an acidifier with different preheat treatments (30 min at 80°C and 5 min at 92°C). We then evaluated the effect of preheat treatments on MPC gel properties, including storage modulus (G′), loss tangent (tan δ), firmness, whey separation, and microstructure. The results indicated that without preheating, evaporation (EP)-MPC had higher G′ and firmness, and lower tan δ and whey separation than nanofiltration (NF)-MPC. These results suggest that EP-MPC produced a better acid-induced gel than NF-MPC when no preheat treatments were performed. After preheating, however, except for a very small difference in the final G′ (EP-MPC was higher), the 2 MPC did not differ significantly in firmness, final tan δ, or whey separation. Additionally, compared with the gel of unheated MPC, both preheat-treated gels (NF-MPC and EP-MPC) achieved increased G′ and firmness and decreased tan δ and whey separation. The preheat-treated MPC also displayed a more flexible-stranded network. These findings demonstrate that, given a suitable heating treatment, NF-MPC compares favorably with EP-MPC in achieving desired gel properties. ER - TY - JOUR T1 - The joy of science communication AU - Gross, Michael JO - Current Biology VL - 25 IS - 1 SP - R27 EP - R30 PY - 2015 DA - 2015/01/05/ SN - 0960-9822 DO - https://doi.org/10.1016/j.cub.2014.12.014 UR - https://www.sciencedirect.com/science/article/pii/S0960982214015784 AB - Summary To communicate science to a wider audience, it often helps to have fun with science. Occasionally, it is even possible to make fun of science and still get its message across. Michael Gross reports. ER - TY - JOUR T1 - Molecules, Magnets, and Mathematics AU - Chitnis, Ajay B. AU - Goodhill, Geoffrey J. JO - Cell VL - 105 IS - 3 SP - 328 EP - 329 PY - 2001 DA - 2001/05/04/ SN - 0092-8674 DO - https://doi.org/10.1016/S0092-8674(01)00357-9 UR - https://www.sciencedirect.com/science/article/pii/S0092867401003579 ER - TY - JOUR T1 - Mathematical framework for large-scale brain network modeling in The Virtual Brain AU - Sanz-Leon, Paula AU - Knock, Stuart A. AU - Spiegler, Andreas AU - Jirsa, Viktor K. JO - NeuroImage VL - 111 SP - 385 EP - 430 PY - 2015 DA - 2015/05/01/ SN - 1053-8119 DO - https://doi.org/10.1016/j.neuroimage.2015.01.002 UR - https://www.sciencedirect.com/science/article/pii/S1053811915000051 KW - Brain network models KW - Neural mass KW - Neural field KW - Whole brain dynamics KW - Forward solutions KW - Cortical surface KW - Brain simulator KW - EEG KW - MEG KW - fMRI KW - BOLD AB - In this article, we describe the mathematical framework of the computational model at the core of the tool The Virtual Brain (TVB), designed to simulate collective whole brain dynamics by virtualizing brain structure and function, allowing simultaneous outputs of a number of experimental modalities such as electro- and magnetoencephalography (EEG, MEG) and functional Magnetic Resonance Imaging (fMRI). The implementation allows for a systematic exploration and manipulation of every underlying component of a large-scale brain network model (BNM), such as the neural mass model governing the local dynamics or the structural connectivity constraining the space time structure of the network couplings. Here, a consistent notation for the generalized BNM is given, so that in this form the equations represent a direct link between the mathematical description of BNMs and the components of the numerical implementation in TVB. Finally, we made a summary of the forward models implemented for mapping simulated neural activity (EEG, MEG, sterotactic electroencephalogram (sEEG), fMRI), identifying their advantages and limitations. ER - TY - JOUR T1 - Communication complexity of some number theoretic functions AU - Shparlinski, Igor E. JO - Applied Mathematics Letters VL - 20 IS - 8 SP - 872 EP - 875 PY - 2007 DA - 2007/08/01/ SN - 0893-9659 DO - https://doi.org/10.1016/j.aml.2006.05.024 UR - https://www.sciencedirect.com/science/article/pii/S0893965906002795 KW - Communication complexity KW - Discrepancy KW - Number theoretic functions AB - We show that the communication complexity of the parity of the sum of binary digits of x+y is at least 0.085667…n+O(1) where x and y are n-bit integers. We also obtain a nontrivial (but weaker) lower bound on the parity of the total number of prime divisors of x+y counted with multiplicity. ER - TY - JOUR T1 - An occupancy problem involved in multiaccess communication systems AU - Wen, J.H. AU - Wang, J.W. JO - Applied Mathematics Letters VL - 12 IS - 8 SP - 57 EP - 60 PY - 1999 DA - 1999/11/01/ SN - 0893-9659 DO - https://doi.org/10.1016/S0893-9659(99)00122-6 UR - https://www.sciencedirect.com/science/article/pii/S0893965999001226 KW - Occupancy problem KW - Multiaccess communicaton system KW - Markov model AB - An occupancy problem involved in multiaccess communication systems is studied. We are primarily interested in the prbability of the number of successful time slots after n consecutive time slots for contention with the initial number of users being k. Two different approaches are used to derive the required probability: one is based on the concept of multiple summations and the other uses the theory of Markov chain. It is shown that the latter approach is more computationally efficient than the former. ER - TY - JOUR T1 - Time-relaxed broadcasting in communication networks AU - Shastri, Aditya JO - Discrete Applied Mathematics VL - 83 IS - 1 SP - 263 EP - 278 PY - 1998 DA - 1998/03/25/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(97)00114-5 UR - https://www.sciencedirect.com/science/article/pii/S0166218X97001145 KW - Broadcasting KW - Graphs, Networks KW - Communication AB - Broadcasting is the process of information dissemination in communication networks (modelled as graphs) whereby a message originating at one vertex becomes known to all members under the constraint that each call requires one unit of time and at every step any member can call at most one of its neighbours. A broadcast graph on n vertices is a network in which message can be broadcast in the minimum possible (=⌊log2n⌋) time regardless of the originator. Broadcast graphs having the smallest number of edges are called minimum broadcast graphs, and are subjects of intensive study. On the other hand, in Shastri (1995) we have considered how quickly broadcasting can be done in trees. In this paper, we study how the number of edges in a minimum broadcast graphs decrease, as we allow addition time over ⌊log2 n⌋, until we get a tree. In particular, the sparsest possible time-relaxed broadcast graphs are constructed for small n(⩽15) and very sparse time-relaxed broadcast graphs are given for larger n(⩽65). General constructions are also provided putting bounds which hold for all n. Some of these constructions make use of the techniques developed in Bermond et al. (1995, 1992) and Chau and Liestman (1985). ER - TY - JOUR T1 - A defeasible reasoning model of inductive concept learning from examples and communication AU - Ontañón, Santiago AU - Dellunde, Pilar AU - Godo, Lluís AU - Plaza, Enric JO - Artificial Intelligence VL - 193 SP - 129 EP - 148 PY - 2012 DA - 2012/12/01/ SN - 0004-3702 DO - https://doi.org/10.1016/j.artint.2012.08.006 UR - https://www.sciencedirect.com/science/article/pii/S0004370212001063 KW - Induction KW - Logic KW - Argumentation KW - Machine learning KW - Concept learning AB - This paper introduces a logical model of inductive generalization, and specifically of the machine learning task of inductive concept learning (ICL). We argue that some inductive processes, like ICL, can be seen as a form of defeasible reasoning. We define a consequence relation characterizing which hypotheses can be induced from given sets of examples, and study its properties, showing they correspond to a rather well-behaved non-monotonic logic. We will also show that with the addition of a preference relation on inductive theories we can characterize the inductive bias of ICL algorithms. The second part of the paper shows how this logical characterization of inductive generalization can be integrated with another form of non-monotonic reasoning (argumentation), to define a model of multiagent ICL. This integration allows two or more agents to learn, in a consistent way, both from induction and from arguments used in the communication between them. We show that the inductive theories achieved by multiagent induction plus argumentation are sound, i.e. they are precisely the same as the inductive theories built by a single agent with all data. ER - TY - JOUR T1 - Mathematically modeling munitions prepositioning and movement AU - Johnstone, D.P AU - Hill, R.R AU - Moore, J.T JO - Mathematical and Computer Modelling VL - 39 IS - 6 SP - 759 EP - 772 PY - 2004 DA - 2004/03/01/ T2 - Defense transportation: Algorithms, models, and applications for the 21st century SN - 0895-7177 DO - https://doi.org/10.1016/S0895-7177(04)90553-5 UR - https://www.sciencedirect.com/science/article/pii/S0895717704905535 KW - Prepositioning KW - Mathematical modeling KW - Optimization KW - Logistics AB - The Air Force's ability to deploy, employ, and sustain operations in forward operating locations is a key to mission success. An integral part of this new strategy involving forward operating locations is equipment prepositioning, to include: vehicles, aircraft support, consumable inventory, and munitions. Proper prepositioning strategies provide a means to deploy forces rapidly without resorting to an increased overseas presence. This research focuses on defining and developing a mathematical model to aid decision makers with a strategy for positioning and configuring prepositioned assets. This research places particular emphasis on the strategic, global prepositioning of the afloat prepositioning fleet (APF), the configuration of these ships with respect to precision guided weaponry, the development of a transportation plan in response to modeled contingencies, and a port selection and distribution strategy once the APF ship is tasked to support a contingency. In addition to the APF assets, the model considers U.S.-based supply points used to augment on-hand and APF-provided munitions assets. The primary objective is to minimize the overall response time involved with offloading these ships and transporting their cargo (the munitions) to the intended point of use. The Pre-Po model developed is a mixed integer program, implemented using the general algebraic modeling system (GAMS), solved using the XA solver package, and tested against a realistically stressing planning scenario. Analytical results and insights are presented along with avenues for further work. ER - TY - JOUR T1 - The rise of British analysis in the early 20th century: the role of G.H. Hardy and the London Mathematical Society AU - Rice, Adrian C. AU - Wilson, Robin J. JO - Historia Mathematica VL - 30 IS - 2 SP - 173 EP - 194 PY - 2003 DA - 2003/05/01/ SN - 0315-0860 DO - https://doi.org/10.1016/S0315-0860(03)00002-8 UR - https://www.sciencedirect.com/science/article/pii/S0315086003000028 KW - Analysis KW - British mathematics KW - Research KW - G.H. Hardy KW - London Mathematical Society AB - It has often been observed that the early years of the 20th century witnessed a significant and noticeable rise in both the quantity and quality of British analysis. Invariably in these accounts, the name of G.H. Hardy (1877–1947) features most prominently as the driving force behind this development. But how accurate is this interpretation? This paper attempts to reevaluate Hardy's influence on the British mathematical research community and its analysis during the early 20th century, with particular reference to his relationship with the London Mathematical Society. Résumé On a souvent remarqué que les premières années du 20ème siècle ont été témoins d'une augmentation significative et perceptible dans la quantité et aussi la qualité des travaux d'analyse en Grande-Bretagne. Dans ce contexte, le nom de G.H. Hardy (1877–1947) est toujours indiqué comme celui de l'instigateur principal qui était derrière ce développement. Mais, est-ce-que cette interprétation est exacte ? Cet article se propose d'analyser à nouveau l'influence d'Hardy sur la communauté britannique sur la communauté des mathématiciens et des analystes britanniques au début du 20ème siècle, en tenant compte en particulier de son rapport avec la Société Mathématique de Londres. ER - TY - JOUR T1 - Nonlinear mathematical modeling of butterfly valves driven by solenoid actuators AU - Naseradinmousavi, Peiman AU - Nataraj, C. JO - Applied Mathematical Modelling VL - 35 IS - 5 SP - 2324 EP - 2335 PY - 2011 DA - 2011/05/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2010.11.036 UR - https://www.sciencedirect.com/science/article/pii/S0307904X10004464 KW - Dynamic systems modeling KW - Nonlinear modeling KW - Solenoid actuator KW - Butterfly valve KW - Nonlinear dynamics AB - This paper describes high fidelity modeling and analysis of the opening and closing processes of butterfly valves driven by solenoid actuators using multiphysics models. The equations are derived and solved numerically. The variable of primary interest is the butterfly valve rotation angle. The coupled model for electromagnetics, fluid dynamics and mechanical dynamics are derived by making some simplifying assumptions. It is shown that the behavior of hydrodynamic torque plays an important role in the closing and opening processes. A discussion is presented with an explanation of the results and a comparison has been made for both the processes. ER - TY - JOUR T1 - Synchrony vs Asynchrony in Communication Primitives AU - Gorla, Daniele JO - Electronic Notes in Theoretical Computer Science VL - 175 IS - 3 SP - 87 EP - 108 PY - 2007 DA - 2007/06/28/ T2 - Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2006.10.054 UR - https://www.sciencedirect.com/science/article/pii/S1571066107003787 KW - Expressiveness KW - Encodings KW - Communication Primitives KW - Process Calculi AB - We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming features like arity of data, communication medium and possibility of pattern matching. For some primitives, we show how their synchronous version can be encoded in their asynchronous counterpart via a fully abstract encoding, thus proving that the two versions have the same expressive power. For the remaining primitives, we prove that no ‘reasonable’ encoding can exist, thus proving that synchrony adds expressiveness to the language. ER - TY - JOUR T1 - Optimal communication channel utilization for matrix transposition and related permutations on binary cubes AU - Johnsson, S.Lennart AU - Ho, Ching-Tien JO - Discrete Applied Mathematics VL - 53 IS - 1 SP - 251 EP - 274 PY - 1994 DA - 1994/09/14/ SN - 0166-218X DO - https://doi.org/10.1016/0166-218X(94)90189-9 UR - https://www.sciencedirect.com/science/article/pii/0166218X94901899 AB - We present optimal schedules for permutations in which each node sends one or several unique messages to every other node. With concurrent communication on all channels of every node in binary cube networks, the number of element transfers in sequence for K elements per node is K2, irrespective of the number of nodes over which the data set is distributed. For a succession of s permutations within disjoint subcubes of d dimensions each, our schedules yield min(K2+(s−1)d,(s+3)d,K2+2d) exchanges in sequence. The algorithms can be organized to avoid indirect addressing in the internode data exchanges, a property that increases the performance on some architectures. For message-passing communication libraries, we present a blocking procedure that minimizes the number of block transfers while preserving the utilization of the communication channels. For schedules with optimal channel utilization, the number of block transfers for a binary d-cube is d. The maximum block size for K elements per node is ⌈K(2d)⌉. ER - TY - JOUR T1 - Connectivity with directional antennas in the symmetric communication model AU - Dobrev, S. AU - Eftekhari, M. AU - MacQuarrie, F. AU - Maňuch, J. AU - Morales Ponce, O. AU - Narayanan, L. AU - Opatrny, J. AU - Stacho, L. JO - Computational Geometry VL - 55 SP - 1 EP - 25 PY - 2016 DA - 2016/05/01/ SN - 0925-7721 DO - https://doi.org/10.1016/j.comgeo.2016.03.002 UR - https://www.sciencedirect.com/science/article/pii/S0925772116300128 KW - Directional antenna KW - Connected network KW - NP-complete KW - Stretch factor AB - We study the problem of connectivity in wireless networks in which each node uses a single directional antenna. We consider the symmetric model of communication with directional antennas. In this model, two nodes are connected by a link if and only if they lie in the transmission sectors of each other's antenna. Given nodes located in the plane, each with an antenna of beamwidth ϕ and radius r, we study the problem of orienting the antennas in such a way as to create a connected network. We show that for ϕ<π/3 and a given radius, the problem of determining the existence of an orientation that ensures a connected network is NP-complete. For ϕ≥π/2, in which case connectivity is known to be always possible, we study the problem of achieving connectivity while minimizing the radius. For different ranges of ϕ, we give approximation algorithms that achieve connectivity while using a radius that is at most a constant times the optimal radius. Some of our algorithms also have provable bounds on the stretch factor of the resulting network compared to a network of nodes with omnidirectional antennas of a given radius. ER - TY - JOUR T1 - Towards computer aided mathematics AU - Benzmüller, Christoph JO - Journal of Applied Logic VL - 4 IS - 4 SP - 359 EP - 365 PY - 2006 DA - 2006/12/01/ T2 - Towards Computer Aided Mathematics SN - 1570-8683 DO - https://doi.org/10.1016/j.jal.2005.10.001 UR - https://www.sciencedirect.com/science/article/pii/S1570868305000662 ER - TY - JOUR T1 - Formalizing the User's Context to Support User Interfaces for Integrated Mathematical Environments AU - Kiniry, Joseph R. JO - Electronic Notes in Theoretical Computer Science VL - 103 SP - 81 EP - 103 PY - 2004 DA - 2004/11/03/ T2 - Proceedings of the User Interfaces for Theorem Provers Workshop, UITP 2003 SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2004.09.015 UR - https://www.sciencedirect.com/science/article/pii/S157106610405128X ER - TY - JOUR T1 - Information and communication technologies coordinator teachers’ evaluations of computer working environments in terms of ergonomics AU - Bayir, Safak AU - Keser, Hafize JO - Procedia - Social and Behavioral Sciences VL - 1 IS - 1 SP - 335 EP - 341 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.063 UR - https://www.sciencedirect.com/science/article/pii/S1877042809000652 KW - Ergonomics KW - ICT Coordinator Teachers KW - Human-Computer Interaction AB - The aim of this research is to determine information and communication technologies coordinator teachers’ (ICT-CTs’) evaluations of the organisation of computer working environments in terms of ergonomics. ICT-CTs have responsibility for training, guiding and counselling of teachers and students, moreover, planning, managing and evaluating information technologies classes and courses on ICT. ICT-CTs evaluate their computer working environments considering the following 9 sub-dimensions: “selection and organisation of computer desk”, “selection of chair”, “display and screen equipment”, “keyboard and mouse”, “organisation of working environment”, “lighting”, “noise”, “temperature, humidity and ventilation” and “training and information”. ER - TY - JOUR T1 - A communication-less parallel algorithm for tridiagonal Toeplitz systems AU - McNally, Jeffrey M. AU - Garey, L.E. AU - Shaw, R.E. JO - Journal of Computational and Applied Mathematics VL - 212 IS - 2 SP - 260 EP - 271 PY - 2008 DA - 2008/03/01/ SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2006.12.001 UR - https://www.sciencedirect.com/science/article/pii/S037704270600728X KW - Parallel computing KW - Communication-less algorithms KW - Toeplitz KW - Tridiagonal KW - Distributed KW - Linear systems KW - Fast algorithms KW - Perturbation analysis AB - Diagonally dominant tridiagonal Toeplitz systems of linear equations arise in many application areas and have been well studied in the past. Modern interest in numerical linear algebra is often focusing on solving classic problems in parallel. In McNally [Fast parallel algorithms for tri-diagonal symmetric Toeplitz systems, MCS Thesis, University of New Brunswick, Saint John, 1999], an m processor Split & Correct algorithm was presented for approximating the solution to a symmetric tridiagonal Toeplitz linear system of equations. Nemani [Perturbation methods for circulant-banded systems and their parallel implementation, Ph.D. Thesis, University of New Brunswick, Saint John, 2001] and McNally (2003) adapted the works of Rojo [A new method for solving symmetric circulant tri-diagonal system of linear equations, Comput. Math. Appl. 20 (1990) 61–67], Yan and Chung [A fast algorithm for solving special tri-diagonal systems, Computing 52 (1994) 203–211] and McNally et al. [A split-correct parallel algorithm for solving tri-diagonal symmetric Toeplitz systems, Internat. J. Comput. Math. 75 (2000) 303–313] to the non-symmetric case. In this paper we present relevant background from these methods and then introduce an m processor scalable communication-less approximation algorithm for solving a diagonally dominant tridiagonal Toeplitz system of linear equations. ER - TY - JOUR T1 - Wednesday, 5 September 2018 - Free Communication Sessions 01–12 and Poster Sessions 01–15 AU - World Dental Federation, FDI JO - International Dental Journal VL - 68 SP - 2 EP - 41 PY - 2018 DA - 2018/09/01/ T2 - Abstracts of the 106th, FDI World Dental Congress, September 2018 SN - 0020-6539 DO - https://doi.org/10.1111/idj.12441 UR - https://www.sciencedirect.com/science/article/pii/S0020653920320323 ER - TY - JOUR T1 - Mathematical Model for Simulating an Application Integration Solution in the Academic Context of Unijuí University AU - Kraisig, Adriana R. AU - Welter, Franciéli C. AU - Haugg, Igor G. AU - Cargnin, Roberto AU - Roos-Frantz, Fabricia AU - Sawicki, Sandro AU - Frantz, Rafael Z. JO - Procedia Computer Science VL - 100 SP - 407 EP - 413 PY - 2016 DA - 2016/01/01/ T2 - International Conference on ENTERprise Information Systems/International Conference on Project MANagement/International Conference on Health and Social Care Information Systems and Technologies, CENTERIS/ProjMAN / HCist 2016 SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2016.09.176 UR - https://www.sciencedirect.com/science/article/pii/S1877050916323444 KW - Enterprise Application Integration KW - Domain-Specific Language KW - Conceptual Model KW - Simulation Model KW - Petri Nets AB - The enterprise applications consist of a set of applications that make up the software ecosystem. These can be developed in-house or acquired from third party companies. Generally these applications are developed in order to meet a demands/specific business need of the company without worrying of interacting with another existing system. The area of Enterprise Application Integration (EAI) is able to provide all techniques and tools in order to integrate heterogeneous applications software ecosystem of companies. The Guaraná DSL is a language that enables designing conceptual models of integration solutions using a concrete graphical and intuitive syntax. Integrating the applications is not a trivial task and solution development involves addition of costs (time and resources), risks such as the appearance of bugs that most often are observed only after the implementation of the conceptual model. In this paper we propose a simulation model using Petri Nets that enable the analysis of the behavior of an integration solution developed to a real-world integration problem at Unijuí University. ER - TY - JOUR T1 - “Scientific control” in mathematical reviewing and German-U.S.-American relations between the two World Wars AU - Siegmund-Schultze, Reinhard JO - Historia Mathematica VL - 21 IS - 3 SP - 306 EP - 329 PY - 1994 DA - 1994/08/01/ SN - 0315-0860 DO - https://doi.org/10.1006/hmat.1994.1027 UR - https://www.sciencedirect.com/science/article/pii/S0315086084710275 KW - Mathematical reviewing () KW - mathematics in Hitler's Germany KW - rise of American mathematics KW - scientific nationalism AB - Reflections of American mathematicians on the German leadership in mathematical reviewing between the two World Wars reveal one aspect of the rise of American mathematics to worldwide importance. Singular political events such as the mass exodus of German mathematicians and the interference in the work of the then dominant German Zentralblatt led to the foundation of the American Mathematical Reviews in 1940. A look at German national competition in mathematical reviewing during the 1930s (Jahrbuch and Zentralblatt), however, reveals deeper disciplinary as well as ideological and political roots of the “control function” of scientific reviewing that are not necessarily connected to international competition. Razmyshleniya amerikanskikh matematikov v dvadtsatikh i tridtsatikh godakh XX v.o rukovodstve nemetskogo sistema matematicheskogo referirovaniya otrazhayut odin aspekt razvitii globalnoi vazhnosti matematiki S. Sh. A. Politicheskie proisshestviya kak massovaya emigratsiya nemetskikh matematikov i narushenie raboty nemetskogo Tsentralblatta priveli k osnavaniyu amerikanskikh Matematikal Revyus v 1940 g. Vnutrinemetskoe sopernichestvo v tridtsatikh godakh XX v. za rukovodstvo v nemetskoi sisteme matematicheskogo referirovaniya (Yarbukh, Tsentralblatt) otkryvaet slozhnye distsiplinnye, ideologicheskie i politicheskie korni “kontrolnoi funktsii” nauchnogo referirovaniya, chastichno nezavisimye of mezhdunarodnogo matematicheskogo sorevnovaniya. Reflektionen amerikanischer Mathematiker über die Führung Deutschlands im mathematischen Referatewesen zwischen den Weltkriegen widerspiegeln einen Aspekt des Aufstiegs der U.S.A. zu einer mathematischen Weltmacht. Politische Ereignisse wie die Massenvertreibungen deutscher Mathematiker und Einmischung in die Arbeit des damals herrschenden Zentralblatts führten zur Grundung der Mathematical Reviews im Jahre 1940. Innerdeutsche Auseinandersetzungen um die Führung im mathematischen Referatewesen in den 1930er Jahren (Jahrbuch, Zentralblatt) zeigen, daβ die “Kontrollfunktion” des Referatewesens tiefere disciplinäre, ideologische und politische Wurzeln hat, die nicht notwendig mit dem internationalen Wettbewerb in Verbindung stehen. ER - TY - JOUR T1 - A mathematical model of low-head oxygenators AU - Timmons, Michael B AU - Vinci, Brian J AU - Davenport, Matthew T AU - Crum, Michele K JO - Aquacultural Engineering VL - 24 IS - 4 SP - 257 EP - 277 PY - 2001 DA - 2001/04/01/ SN - 0144-8609 DO - https://doi.org/10.1016/S0144-8609(01)00066-8 UR - https://www.sciencedirect.com/science/article/pii/S0144860901000668 KW - Low-head oxygenator KW - Gas transfer KW - Computer model KW - Oxygen absorption KW - Total gas pressure AB - A mathematical model is presented that predicts the performance of low-head oxygenators (LHO). Experimentally determined values of G20 for a single hole in a flooded orifice plate were used as the basis to develop a mathematical model that can be used to predict LHO performance under a variety of design and operating conditions. Model predictions were compared to two published studies. The model predicted the published data for dissolved oxygen levels in the departing effluent within 2–3%, oxygen absorption efficiencies within 5–6%, and total gas pressures within 1%. The mathematical model is thoroughly developed including an analysis of numerical stability and necessary restrictions to assure stability and accuracy. Convergence based solely upon effluent values was not sufficient to produce accurate results, but required additional criteria of requiring a minimum number of chamber flushings prior to convergence checking. The model was used to demonstrate its utility in predicting the effects of G/L ratio on gas absorption efficiency, effluent gas conditions and the effects of number of LHO chambers used. This model allows the designer or operator of an LHO to easily make design and operational decisions by modifying the input parameters and observing the exit conditions and performance indicators. ER - TY - JOUR T1 - Communication aid system for users with physical impairments AU - Yang, Cheng-Huei AU - Chung, Pau-Choo AU - Chuang, Li-Yeh AU - Yang, Cheng-Hong JO - Computers & Mathematics with Applications VL - 43 IS - 6 SP - 901 EP - 910 PY - 2002 DA - 2002/03/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(01)00330-3 UR - https://www.sciencedirect.com/science/article/pii/S0898122101003303 KW - Morse code KW - Adaptive signal processing KW - Least-mean-square algorithm KW - Friedman test KW - Multiple comparison test KW - Adapted computer access KW - Assistive technology AB - For some physically-disabled persons, the conventional computer keyboard may be inappropriate as a usable communication device. They instead require an assistive tool for entering text into a computer or for word-processing for purposes of augmentative and alternative communication in their daily lives. In this study, Morse code is selected as one possible adapted access communication method for persons with impaired hand coordination and limited dexterity. Inherently, a stable switch activation rate is strictly required for the most accurate recognition of Morse code. However, because maintaining a stable switch activation rate is a challenge for many persons who are physically disabled, automatic recognition of Morse code with standardized computer programs is difficult. Therefore, a suitable adaptive automatic recognition method is needed. This study presents a least-mean-square algorithm applied to adaptive Morse code recognition. Four processes are involved in this adaptive Morse code recognition method: space recognition, tone recognition, adaptive processing, and character recognition. Statistical analyses demonstrated that the recognition rate of the proposed method resulted in an 83% improvement over alternative methods described in previous literature. ER - TY - JOUR T1 - A mathematical model for the first-pass dynamics of antibiotics acting on the cardiovascular system AU - Banks, H.T. AU - Holm, Kathleen AU - Wanner, Nathan C. AU - Cintrón-Arias, Ariel AU - Kepler, Grace M. AU - Wetherington, Jeffrey D. JO - Mathematical and Computer Modelling VL - 50 IS - 7 SP - 959 EP - 974 PY - 2009 DA - 2009/10/01/ SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2009.02.007 UR - https://www.sciencedirect.com/science/article/pii/S0895717709000703 KW - Compartmental model KW - Circulatory system KW - Drug delivery KW - Differential equations KW - Optimal dosing strategies KW - Sensitivity AB - We present a preliminary first-pass dynamic model for delivery of drug compounds to the lungs and heart. We use a compartmental mass-balance approach to develop a system of nonlinear differential equations for mass accumulated in the heart as a result of intravenous injection. We discuss sensitivity analysis as well as methodology for minimizing mass in the heart while maximizing mass delivered to the lungs on a first circulatory pass. ER - TY - JOUR T1 - Mathematics of program construction AU - Backhouse, Roland JO - Science of Computer Programming VL - 26 IS - 1 SP - 5 EP - 9 PY - 1996 DA - 1996/05/01/ SN - 0167-6423 DO - https://doi.org/10.1016/0167-6423(95)00032-1 UR - https://www.sciencedirect.com/science/article/pii/0167642395000321 ER - TY - JOUR T1 - A mathematical model for fungal development in heterogeneous environments AU - Davidson, F.A. AU - Park, A.W. JO - Applied Mathematics Letters VL - 11 IS - 6 SP - 51 EP - 56 PY - 1998 DA - 1998/11/01/ SN - 0893-9659 DO - https://doi.org/10.1016/S0893-9659(98)00102-5 UR - https://www.sciencedirect.com/science/article/pii/S0893965998001025 KW - Fungal mycelia KW - Heterogeneous environments AB - A mathematical model for the development of fungal mycelia in heterogeneous environmental conditions is presented. The validity of this model is tested by comparison of numerical simulations with experimental observations. ER - TY - JOUR T1 - Traffic Analysis of Vehicular Ad-Hoc Networks of V2I Communication AU - Paul, Mousumi AU - Sanyal, Gautam JO - Procedia Computer Science VL - 54 SP - 215 EP - 223 PY - 2015 DA - 2015/01/01/ T2 - Eleventh International Conference on Communication Networks, ICCN 2015, August 21-23, 2015, Bangalore, India Eleventh International Conference on Data Mining and Warehousing, ICDMW 2015, August 21-23, 2015, Bangalore, India Eleventh International Conference on Image and Signal Processing, ICISP 2015, August 21-23, 2015, Bangalore, India SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2015.06.024 UR - https://www.sciencedirect.com/science/article/pii/S1877050915013484 KW - Quality of service (QoS) KW - Roadside unit (RSU) KW - Medium access control KW - VANET KW - Traffic analysis. AB - Vehicular Ad-Hoc Network (VANET) has been emerged as a promising technology thanks to the recent advances in mechanics, networking, and information technologies. However, there is still a great deal of additional research required before it finally becomes a mature technology. This article concentrates on two factors which are holding back the development of VANETs. Firstly, there is a lack of traffic analysis & modeling for VANETs. Secondly, network optimization for VANETs needs more investigation. Among these two factors, the understanding regarding the traffic dynamics within VANETs provide a basis for further works on network optimization and anomaly detection for VANETs. ER - TY - JOUR T1 - Mathematical approach and optimisation of nanometric base thickness for a SiGeC HBT dedicated to radiofrequency applications AU - Lakhdara, Maya AU - Latreche, Saïda AU - Gontrand, Christian JO - Journal of Computational and Applied Mathematics VL - 259 SP - 925 EP - 936 PY - 2014 DA - 2014/03/15/ T2 - Recent Advances in Applied and Computational Mathematics: ICACM-IAM-METU SN - 0377-0427 DO - https://doi.org/10.1016/j.cam.2013.09.076 UR - https://www.sciencedirect.com/science/article/pii/S0377042713005311 KW - Numerical modelling KW - DDM model KW - SiGe(C) KW - HBT KW - Nanometric KW - Thickness base AB - In this paper, we present a mathematical approach to the nanometric thickness optimisation of a heterojunction bipolar transistor (HBT) SiGeC base, which is realised using the BiCMOS (bipolar compatible metal oxide semiconductor) industrial process. However, the use of these components in microwave applications and radiofrequency ranges imposes the use of complex shrink structures. Because the SiGeC base is the active portion of the transistor, the optimisation of its nanometric thickness is a crucial aspect in accurately predicting the characteristics of the component. A numerical modelling approach is investigated using our 2D simulator “SIBIDIF”, which is based on the drift–diffusion model (DDM). This method solves the continuity equations for electrons and holes and is coupled with the Poisson equation based on the concept of the finite difference mesh using a revised Scharfetter–Gummel approach and is solved numerically using the Gauss–Seidel method for matrix algebra. This optimisation improves the static gain of the transistor, the transition frequency (fT), and the maximum oscillation frequency (fmax) while reducing the thickness of the base from 100 to 30 nm. However, the model reaches limits for thicknesses less than 25 nm. The simulation results obtained in this study are compared to electrical characteristics obtained by measurements. ER - TY - JOUR T1 - Funds for mathematics: Carnegie Institution of Washington support for mathematics from 1902 to 1921 AU - Fenster, Della Dumbaugh JO - Historia Mathematica VL - 30 IS - 2 SP - 195 EP - 216 PY - 2003 DA - 2003/05/01/ SN - 0315-0860 DO - https://doi.org/10.1016/S0315-0860(03)00005-3 UR - https://www.sciencedirect.com/science/article/pii/S0315086003000053 KW - Carnegie Institution of Washington KW - Philanthropy KW - Eliakim Hastings Moore KW - Leonard Dickson KW - Oswald Veblen AB - This paper examines the role of the CIW in the development of American mathematics from 1902 to 1920, the years from its inception through the conclusion of the term of R.S. Woodward as its second president. Zusammenfassung In dieser Arbeit wird untersucht, welche Rolle die Carnegie-Stiftung, Washington, in der Entwicklung der amerikanischen Mathematik in den Jahren 1902–1920 gespielt hat. Diese Jahre reichen vom Beginn dieser Institution bis zum Abschlußder Amtszeit von R.S. Woodward als ihrem zweiten Präsidenten. ER - TY - JOUR T1 - A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks AU - Curtmola, Reza AU - Kamara, Seny JO - Electronic Notes in Theoretical Computer Science VL - 171 IS - 1 SP - 57 EP - 69 PY - 2007 DA - 2007/04/14/ T2 - Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks (WCAN 2006) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2006.11.009 UR - https://www.sciencedirect.com/science/article/pii/S1571066107000680 KW - reliable message delivery KW - broadcast encryption KW - key updates KW - storage KW - mobility KW - wireless ad hoc wireless networks AB - Due to its low communication cost, stateful broadcast encryption is an appealing solution for secure content distribution in mobile ad hoc wireless networks (MANETs). Unfortunately, the inherent limitations of MANETs prevent a standard application of such schemes since they require receivers to be online. In this paper, we present a reliable message delivery mechanism for MANETs that is based on erasure codes and that leverages node mobility in order to achieve non-interactive recovery of missed messages. We then show how our mechanism can be used to reliably deliver the key updates of a stateful broadcast encryption scheme. Our solution has several useful properties: it allows trade-offs between the amount of storage required at each node and the speed of message recovery; and it has the ability to leverage the resources of unauthorized nodes. We evaluate the performance of our approach through simulation, and show that it achieves good performance for networks with high node density. ER - TY - JOUR T1 - Rogue waves for the generalized nonlinear Schrödinger–Maxwell–Bloch system in optical-fiber communication AU - Zuo, Da-Wei AU - Gao, Yi-Tian AU - Xue, Long AU - Feng, Yu-Jie AU - Sun, Yu-Hao JO - Applied Mathematics Letters VL - 40 SP - 78 EP - 83 PY - 2015 DA - 2015/02/01/ SN - 0893-9659 DO - https://doi.org/10.1016/j.aml.2014.07.016 UR - https://www.sciencedirect.com/science/article/pii/S0893965914002390 KW - Rogue-wave solutions KW - Generalized Darboux transformation KW - Generalized nonlinear Schrödinger–Maxwell–Bloch system KW - Optical-fiber communication AB - In this letter, a generalized nonlinear Schrödinger–Maxwell–Bloch system is investigated, which can be used to describe the solitons in optical fibers. By virtue of the generalized Darboux transformation, higher-order rogue-wave solutions are derived. Rogue-wave propagation and interaction are analyzed: (1) Complex envelope of the field, q, appears as a bright rogue wave, the measure of the polarization of the resonant medium, p, is a bright-dark rogue wave while the extant of the population inversion, η, is a dark rogue wave; (2) Group velocity inhomogeneity and the linear and Kerr nonlinearity inhomogeneity affect q, p and η more than the other parameters do; (3) Character of the interaction between the propagating field and erbium atoms, the gain or loss term and the linear and Kerr nonlinearity inhomogeneous parameter affect the interaction range of the second-order rogue waves. ER - TY - JOUR T1 - Short communication: Production of antihypertensive peptide HLPLP by enzymatic hydrolysis: Optimization by response surface methodology AU - Quirós, A. AU - Hernández-Ledesma, B. AU - Ramos, M. AU - Martín-Álvarez, P.J. AU - Recio, I. JO - Journal of Dairy Science VL - 95 IS - 8 SP - 4280 EP - 4285 PY - 2012 DA - 2012/08/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2012-5459 UR - https://www.sciencedirect.com/science/article/pii/S0022030212004171 KW - response surface methodology KW - caseinate KW - antihypertensive peptide KW - enzymatic hydrolysis AB - This study evaluates the potential ability of proteolytic enzymes to release the antihypertensive peptide HLPLP, β-casein f(134–138), from caseinate. Corolase PP (Röhm GmbH & Co. KG, Darmstadt, Germany) was found as the most appropriate enzyme to produce this peptide. The optimization of the main experimental variables involved in the process [concentration of Corolase PP, concentration of Peptidase 433P (Biocatalysts Ltd., Parc Nantgarw, UK), and the hydrolysis time on the HLPLP concentration, expressed as area of peak] were studied using a central composite face design. The optimum conditions to obtain the maximum concentration of HLPLP provided by the statistical program were a concentration of Corolase PP of 60mg/g of protein and hydrolysis time of 24h. The use of the Peptidase 433P did not increase the amount of the active peptide. The obtained hydrolysate might be used as functional ingredient with antihypertensive properties. ER - TY - JOUR T1 - Cube root extraction in medieval mathematics AU - Johansson, Bo Göran JO - Historia Mathematica VL - 38 IS - 3 SP - 338 EP - 367 PY - 2011 DA - 2011/08/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2010.08.001 UR - https://www.sciencedirect.com/science/article/pii/S0315086010000546 KW - Medieval mathematics KW - Algorithms KW - Root extraction AB - The algorithms used in Arabic and medieval European mathematics for extracting cube roots are studied with respect to algebraic structure and use of external memory (dust board, table, paper). They can be separated into two distinct groups. One contains methods used in the eastern regions from the 11th century, closely connected to Chinese techniques, and very uniform in structure. The other group, showing much wider variation, contains early Indian methods and techniques developed in central and western parts of the Arabic areas and in Europe. This study supports hypotheses previously formulated by Luckey and Chemla on an early scientific connection between China and Persia. Résumé Les algorithmes employé en les mathématiques arabes et européennes médiévales pour l’extraction des racines cubiques sont étudiées par rapport à la structure algébrique et l’emploi de la mémoire externe (table de poussière, papier). On peut séparer deux groupes distincts. Un groupe contiens les méthodes utilisés dans les régions orientaux depuis le XIe siècle, étroitement liés avec des techniques chinoises, avec une structure très uniforme. L’autre groupe, qui montre une variété plus grande, contiens des techniques développés dans les régions arabes centraux et occidentaux et dans l’Europe. Ce traité support la thèse présentée par Luckey et Chemla sur une connexion scientifique entre la Chine et la Perse. ER - TY - JOUR T1 - Mathematical Service Trading Based on Equational Matching AU - Hurault, Aurélie AU - Pantel, Marc JO - Electronic Notes in Theoretical Computer Science VL - 151 IS - 1 SP - 161 EP - 177 PY - 2006 DA - 2006/03/21/ T2 - Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2005) SN - 1571-0661 DO - https://doi.org/10.1016/j.entcs.2005.11.029 UR - https://www.sciencedirect.com/science/article/pii/S1571066106001150 KW - Algebraic specification KW - Equational matching KW - Mathematical software library KW - Service trading AB - Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex ones or to adapt a given service to a slightly different use. The computational grid provides users with access to most of the available software libraries. Service trading, that is searching for services able to fulfil a user requirements is therefore difficult as many different services and service combinations from different libraries can fulfil the same requirements. Usual proposals rely on the use of the service interface and/or domain specific meta-data and ontologies. The service semantics defined in these framework are either easy to use but too poor or application dependent (interface and meta-data); or too complex and sophisticated (ontologies logic) for the common user. The purpose of our work is to provide a trading framework which is both easy to use for specialist of application domains and precise enough to allow service adaptation and combination during the trading process. Our proposal is based on algebraic specification (related to OpenMath) for domain and service description and equational matching for service trading, adaptation and combination. This paper presents our framework proposal and the associated trading algorithm which is both sound and complete: it can find all the appropriate services and combinations according to the given semantics. ER - TY - JOUR T1 - Optimal algorithms for dissemination of information in generalized communication modes AU - Feldmann, R. AU - Hromkovič, J. AU - Madhavapeddy, S. AU - Monien, B. AU - Mysliwietz, P. JO - Discrete Applied Mathematics VL - 53 IS - 1 SP - 55 EP - 78 PY - 1994 DA - 1994/09/14/ SN - 0166-218X DO - https://doi.org/10.1016/0166-218X(94)90179-1 UR - https://www.sciencedirect.com/science/article/pii/0166218X94901791 AB - Some generalized communication modes enabling the dissemination of information among processors of interconnection networks via vertex-disjoint or edge-disjoint paths in one communication step will be investigated. A thorough study of these communication modes will be presented by giving optimal algorithms for broadcasting, accumulation and gossiping in most of the well-known parallel architectures. For those networks in which a Hamiltonian path exists (hypercubes, cube connected cycles, butterflies, shuffle exchange, etc.) optimal algorithms can be obtained quite easily, but for complete binary trees, complete k-ary trees (k⩾3) and arbitrary degree bounded graphs, the optimal algorithms as well as the matching lower bound proofs are more involved. An interesting consequence of the presented algorithms is the fact that in almost all these interconnection networks the gossip problem cannot be solved in less time than the sum of time complexities of the accumulation problem and the broadcast problem (i.e. for most networks the optimal algorithm for the gossip problem is simply the concatenation of optimal algorithms for accumulation and broadcasting). ER - TY - JOUR T1 - Fault tolerance in co-evolutionary communication of EHW modules AU - Baleghi Damavandi, Yasser AU - Mohammadi, Karim JO - Computers & Mathematics with Applications VL - 57 IS - 11 SP - 1730 EP - 1735 PY - 2009 DA - 2009/06/01/ T2 - Proceedings of the International Conference SN - 0898-1221 DO - https://doi.org/10.1016/j.camwa.2008.10.023 UR - https://www.sciencedirect.com/science/article/pii/S0898122108005579 KW - Fault tolerant design KW - Co-evolution KW - Emergent communication KW - Bio-inspired fault tolerance KW - Evolvable hardware AB - Evolvable Hardware (EHW) is a new concept that applies evolutionary algorithms to hardware design. Based on previous work on co-evolutionary communication of EHW modules, this paper investigates the new feature of fault tolerance for this model. A fault model is built for the communication line between EHW modules. The experiment demonstrated in the presentation is the simulation of injecting stuck/bridging faults into an EHW-based serial adder that has been previously developed. The outcomes imply an outstanding feature of fault tolerance in this system with 100% fault coverage, which paves the way for bio-inspired approaches to fault tolerant design instead of the classic ones. ER - TY - JOUR T1 - L-PECS: Application for Inclusive Work Environments AU - Lagos, Paulina AU - Baeza, Rubén AU - Pinto, Oscar AU - Costa, Giannina AU - Ruete, David AU - Fuentealba, Diego AU - Gatica, Gustavo JO - Procedia Computer Science VL - 184 SP - 396 EP - 403 PY - 2021 DA - 2021/01/01/ T2 - The 12th International Conference on Ambient Systems, Networks and Technologies (ANT) / The 4th International Conference on Emerging Data and Industry 4.0 (EDI40) / Affiliated Workshops SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2021.03.050 UR - https://www.sciencedirect.com/science/article/pii/S1877050921006815 KW - ASD KW - labor integration KW - IT disabilities KW - communication persistence KW - PECS AB - Children with ASD may show permanent communication problems due to a decline in the effectiveness of persistence of the information transacted. L-PECS is an application for Android smartphones that uses an alternative language called PECS, based on image exchange. L-PECS allows to improve the persistence of information in work contexts, generating effective communicational instances, task follow-up, and supporting the labor insertion of people with ASD. This work performed user interface tests, user action tests, usability, and accessibility tests on 20 users operating L-PECS to define and show possible behaviors. L-PECS can encourage the hiring of people with ASD. ER - TY - JOUR T1 - Modeling autocorrelation functions of self-similar teletraffic in communication networks based on optimal approximation in Hilbert space AU - Li, Ming AU - Zhao, Wei AU - Jia, Weijia AU - Long, Dongyang AU - Chi, Chi-Hung JO - Applied Mathematical Modelling VL - 27 IS - 3 SP - 155 EP - 168 PY - 2003 DA - 2003/03/01/ SN - 0307-904X DO - https://doi.org/10.1016/S0307-904X(02)00087-2 UR - https://www.sciencedirect.com/science/article/pii/S0307904X02000872 KW - Teletraffic modeling KW - Long-range dependence KW - Autocorrelation functions KW - Optimal approximation AB - The approach to model autocorrelation functions of real-traffic traces in communication networks is presented based on optimal approximation in Hilbert space. The verifications are carried out with the real-traffic traces. ER - TY - JOUR T1 - A Duet for one AU - Friston, Karl AU - Frith, Christopher JO - Consciousness and Cognition VL - 36 SP - 390 EP - 405 PY - 2015 DA - 2015/11/01/ SN - 1053-8100 DO - https://doi.org/10.1016/j.concog.2014.12.003 UR - https://www.sciencedirect.com/science/article/pii/S105381001400230X KW - Communication KW - Theory of mind KW - Active inference KW - Predictive coding KW - Attention KW - Sensory attenuation KW - Bayesian KW - Generalised synchrony AB - This paper considers communication in terms of inference about the behaviour of others (and our own behaviour). It is based on the premise that our sensations are largely generated by other agents like ourselves. This means, we are trying to infer how our sensations are caused by others, while they are trying to infer our behaviour: for example, in the dialogue between two speakers. We suggest that the infinite regress induced by modelling another agent – who is modelling you – can be finessed if you both possess the same model. In other words, the sensations caused by others and oneself are generated by the same process. This leads to a view of communication based upon a narrative that is shared by agents who are exchanging sensory signals. Crucially, this narrative transcends agency – and simply involves intermittently attending to and attenuating sensory input. Attending to sensations enables the shared narrative to predict the sensations generated by another (i.e. to listen), while attenuating sensory input enables one to articulate the narrative (i.e. to speak). This produces a reciprocal exchange of sensory signals that, formally, induces a generalised synchrony between internal (neuronal) brain states generating predictions in both agents. We develop the arguments behind this perspective, using an active (Bayesian) inference framework and offer some simulations (of birdsong) as proof of principle. ER - TY - JOUR T1 - Modelling and analysis of communication overhead for parallel matrix algorithms AU - Wang, Xiaodong AU - Roychowdhury, V.P JO - Mathematical and Computer Modelling VL - 32 IS - 3 SP - 349 EP - 379 PY - 2000 DA - 2000/08/01/ SN - 0895-7177 DO - https://doi.org/10.1016/S0895-7177(00)00140-0 UR - https://www.sciencedirect.com/science/article/pii/S0895717700001400 KW - Communication overhead KW - Parallel matrix algorithms KW - Overlap of communication and computation KW - Performance modelling and analysis KW - Hypercubes AB - We develop and analyze novel algorithms that make efficient use of the communication system in distributed memory architectures with processing elements interconnected by a hypercube network. The algorithms studied here include the parallel Gauss-Jordan (GJ) matrix inversion algorithm and the Gaussian Elimination (GE) algorithm for LU factorization. We first propose a new broadcasting algorithm on the hypercube multiprocessor for the parallel GJ algorithm. This algorithm ensures that the data items are sent out from the source and arrive at the destinations at the earliest possible time. We then present a parallel GJ inversion algorithm using row partitioning. This algorithm exploits a compute-and-send-ahead strategy for achieving overlapping of communication and computation, and the resulting framework leads to rigorous analytical and model-based numerical performance analysis of our parallel algorithms. In particular, we prove a lower bound on the matrix size such that data transmission is fully overlapped by computation. We also prove that the message queue length in the input buffer of each processor is at most two. We next consider the GJ algorithm under submatrix partitioning, with or without pivoting. We show that when submatrix partitioning is used, even when communication is fully overlapped by computation, the communication overhead is larger than when using row partitioning. Thus, we show that by minimizing the communication overhead, the row partitioning scheme can indeed have better overall performance than the submatrix partitioning scheme. Finally, we extend the idea of overlapping communication and computation to the parallel LU factorization algorithm. ER - TY - JOUR T1 - Pure mathematics applied in early twentieth-century America: The case of T.H. Gronwall, consulting mathematician AU - Gluchoff, Alan JO - Historia Mathematica VL - 32 IS - 3 SP - 312 EP - 357 PY - 2005 DA - 2005/08/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2004.05.002 UR - https://www.sciencedirect.com/science/article/pii/S0315086004000448 KW - History of mathematics KW - Biography KW - 20th century KW - General applied mathematics AB - Thomas Hakon Gronwall (1877–1932) was a Swedish-American mathematician with a broad range of interests in mathematical analysis, physics, and engineering. Though he was primarly known for his results in pure mathematics, his career as a “consulting mathematician” in America from 1912 to his death in 1932 provides a backdrop against which one can discuss contemporary issues involved in the increasing application of mathematics to engineering, industrial, and scientific problems. This paper attempts a summary of his major mathematical contributions to industrial, governmental, and academic institutions while relating his often difficult life during these years. Zusammenfassung Thomas Hakon Gronwall (1877–1932) war ein schwedisch-amerikanischer Mathematiker mit briet-gefächertem Interesse an Analysis, Physik, und Ingenieur-Wissenschaften. Während er am besten bekannt ist für seine Ergebnisse in der reinen Mathematik, seine Karriere als “beratender Mathematiker” in Amerika von 1912 bis zu seinem Tod in 1932 bietet einen guten Hintergrund für eine Diskussion von Fragen der Angewandten Mathematik seiner Zeit. Diese Arbeit versucht Gronwalls Anteil an Fortschritten in industriellen, akademischen und Regierungs Bereichen zusammenzufassen, und gleichzeitig sein oft schwieriges Leben darzustellen. ER - TY - JOUR T1 - Modes of representation, working tools, and the history of mathematics AU - Goethe, Norma B. JO - Historia Mathematica VL - 35 IS - 3 SP - 242 EP - 247 PY - 2008 DA - 2008/08/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2008.02.001 UR - https://www.sciencedirect.com/science/article/pii/S0315086008000074 ER - TY - JOUR T1 - The Suàn shù shū , “Writings on reckoning”: Rewriting the history of early Chinese mathematics in the light of an excavated manuscript AU - Cullen, Christopher JO - Historia Mathematica VL - 34 IS - 1 SP - 10 EP - 44 PY - 2007 DA - 2007/02/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2005.11.006 UR - https://www.sciencedirect.com/science/article/pii/S0315086005001084 KW - China KW - Hàn dynasty KW - Jiuˇ zhāng suàn shù KW - Suàn shù shū AB - The Suàn shù shū is an ancient Chinese collection of writings on mathematics approximately 7000 characters in length, written on 190 bamboo strips, recovered from a tomb that appears to have been closed in 186 B.C. This anonymous collection is not a single coherent book, but is made up of approximately 69 independent sections of text, which appear to have been assembled from a variety of sources. Problems treated range from elementary calculations with fractions to applications of the Rule of False Position and finding the volumes of various solid shapes. The Suàn shù shū is now the earliest datable extensive Chinese material on mathematics. This paper discusses its relation to ancient works known through scribal transmission, such as the so-called “Nine Chapters,” Jiuˇ zhāng suàn shù , which is first mentioned in connection with events around A.D. 100, but may have been compiled about a century earlier. It is proposed that the evolution of Chinese mathematical literature in the centuries that separate these two texts may be understood through comparison with what is known to have taken place during that time in another area of Chinese technical literature, that of medicine. ER - TY - JOUR T1 - Short communication: Parameters of abomasal emptying and glucose-insulin dynamics in Holstein-Friesian calves at 2 ages and 2 levels of milk replacer intake AU - Stahel, P. AU - MacPherson, J.A.R. AU - Berends, H. AU - Steele, M.A. AU - Cant, J.P. JO - Journal of Dairy Science VL - 100 IS - 6 SP - 5068 EP - 5072 PY - 2017 DA - 2017/06/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2016-12225 UR - https://www.sciencedirect.com/science/article/pii/S0022030217303260 KW - milk replacer KW - abomasal emptying KW - insulin sensitivity KW - pancreatic responsiveness KW - mechanistic model AB - ABSTRACT Elevated planes of nutrition in the preweaning period of dairy calf management can increase average daily gain, shorten age at puberty, and increase milk yield. In a previous study, 12 Holstein calves were fed 2 meals/d of 4 or 2 L milk replacer up to 7 wk of age. The objective of the current study was to estimate parameters of abomasal emptying and glucose-insulin dynamics in these calves by fitting a mechanistic model to postprandial appearances of plasma glucose, insulin, and the abomasal emptying marker acetaminophen measured at 4 and 7 wk of age. Higher intake of milk replacer resulted in longer bouts of abomasal emptying at a slower rate. Parameters of glucose and insulin dynamics were not affected by milk replacer intake. However, older calves had decreased insulin-stimulated glucose utilization indicating impaired insulin sensitivity, as well as increased pancreatic responsiveness. Neither of these effects were apparent from i.v. glucose tolerance tests on the calves and may have been related to postprandial gut hormone release. Effects of age on parameters of glucose-insulin dynamics were larger than effects of milk replacer intake. Conversely, effects of milk replacer intake on abomasal emptying were larger than effects of age. ER - TY - JOUR T1 - Deterministic communication complexity of set intersection AU - Tamm, Ulrich JO - Discrete Applied Mathematics VL - 61 IS - 3 SP - 271 EP - 283 PY - 1995 DA - 1995/08/18/ SN - 0166-218X DO - https://doi.org/10.1016/0166-218X(94)00021-5 UR - https://www.sciencedirect.com/science/article/pii/0166218X94000215 AB - In this paper the communication complexity C(mn) of the cardinality of set intersection, mn say, will be determined up to one bit: n + ⌈log2(n + 1)⌉ − 1 ⩽ C(mn) ⩽ n + ⌈log2(n + 1)⌉. The proof for the lower bound can also be applied to a larger class of “sum-type” functions sharing the property that f(0,y) = f(x,0) = 0 for all possible x,y. Furthermore, using Kraft's inequality for prefix codes, it is possible to find a communication protocol, which for n = 2t, t ⩾ 2, assumes the lower bound. The upper bound is assumed for n = 2t − 1, t ϵ N. ER - TY - JOUR T1 - The communication complexity of interval orders AU - Faigle, Ulrich AU - Schrader, Rainer AU - Turán, György JO - Discrete Applied Mathematics VL - 40 IS - 1 SP - 19 EP - 28 PY - 1992 DA - 1992/11/18/ SN - 0166-218X DO - https://doi.org/10.1016/0166-218X(92)90019-7 UR - https://www.sciencedirect.com/science/article/pii/0166218X92900197 KW - Communication complexity KW - interval order AB - The communication complexity of interval orders is studied within the following model. Two players choose two elements x and y and want to determine whether x