TY - JOUR T1 - Mathematical Models of Specificity in Cell Signaling AU - Bardwell, Lee AU - Zou, Xiufen AU - Nie, Qing AU - Komarova, Natalia L. JO - Biophysical Journal VL - 92 IS - 10 SP - 3425 EP - 3441 PY - 2007 DA - 2007/05/15/ SN - 0006-3495 DO - https://doi.org/10.1529/biophysj.106.090084 UR - https://www.sciencedirect.com/science/article/pii/S0006349507711475 AB - Cellular signaling pathways transduce extracellular signals into appropriate responses. These pathways are typically interconnected to form networks, often with different pathways sharing similar or identical components. A consequence of this connectedness is the potential for cross talk, some of which may be undesirable. Indeed, experimental evidence indicates that cells have evolved insulating mechanisms to partially suppress “leaking” between pathways. Here we characterize mathematical models of simple signaling networks and obtain exact analytical expressions for two measures of cross talk called specificity and fidelity. The performance of several insulating mechanisms—combinatorial signaling, compartmentalization, the inhibition of one pathway by another, and the selective activation of scaffold proteins—is evaluated with respect to the trade-off between the specificity they provide and the constraints they place on the network. The effects of noise are also examined. The insights gained from this analysis are applied to understanding specificity in the yeast mating and invasive growth MAP kinase signaling network. ER - TY - JOUR T1 - A comparative analysis of flow features of Newtonian and power law material: A New configuration AU - Mahmood, Rashid AU - Bilal, S. AU - Majeed, Afraz Hussain AU - Khan, Ilyas AU - Sherif, El-Sayed M. JO - Journal of Materials Research and Technology VL - 9 IS - 2 SP - 1978 EP - 1987 PY - 2020 DA - 2020/03/01/ SN - 2238-7854 DO - https://doi.org/10.1016/j.jmrt.2019.12.030 UR - https://www.sciencedirect.com/science/article/pii/S2238785419316825 KW - Finite element method KW - Power-law fluid KW - Channel driven cavity KW - Shear thinning and shear thickening AB - In recent years, material analysis of fluids has generated prodigious interest of researchers due to their effective role in interdisciplinary sciences. In view of its importance, the present communication is devoted to analyze the flow of power law fluid representing the features of shear thinning, shear thickening and Newtonian materials. Constitutive equations expressed in the form of tensorial representations depicting power law relation between viscosity and shear rate. The whole mathematical model is solved computationally via of finite element method by using stable P2−P1 finite element pair. A highly refined hybrid mesh is obliged for the accurate computation of results. Material properties of power law fluid are disclosed in physical configuration renowned as channel driven cavity combining various benchmark problems like cavity flow, forward and backward facing steps and channel flow. Impact of material parameters on pertinent profiles is disclosed through graphs. Verification of computed results is done by comparing the velocity, viscosity, pressure fields for power law fluid with the Newtonian case. ER - TY - JOUR T1 - Communication complexity in lattices AU - Ahlswede, Rudolf AU - Cai, Ning AU - Tamm, Ulrich JO - Applied Mathematics Letters VL - 6 IS - 6 SP - 53 EP - 58 PY - 1993 DA - 1993/11/01/ SN - 0893-9659 DO - https://doi.org/10.1016/0893-9659(93)90078-2 UR - https://www.sciencedirect.com/science/article/pii/0893965993900782 AB - The communcation complexity of functions defined in lattices is bounded from above and below, hereby generalizing former results of Lovasz [1] and Ahlswede and Cai [2]. Especially in geometric lattices, upper and lower bound often differ by at most one bit. ER - TY - JOUR T1 - Methodological Framework for NoC Resources Dimensioning on FPGAs AU - Fresse, Virginie AU - Combes, Catherine AU - Payet, Matthieu AU - Rousseau, Frédéric JO - Procedia Computer Science VL - 56 SP - 391 EP - 396 PY - 2015 DA - 2015/01/01/ T2 - The 10th International Conference on Future Networks and Communications (FNC 2015) / The 12th International Conference on Mobile Systems and Pervasive Computing (MobiSPC 2015) Affiliated Workshops SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2015.07.225 UR - https://www.sciencedirect.com/science/article/pii/S1877050915017068 KW - NoC on FPGA KW - Mathematical models KW - resource dimensionning KW - methodological framework KW - area estimation AB - The two main challenges involved in prototyping a SoC (System-On-Chip) on a FPGA (field programmable gate array) are optimal tuning of the communication architecture according to the task graph of an application, and dimensioning the FPGA resources. In this paper, we present a methodological framework to estimate the number of resources required for a given communication architecture and task graph. Data analysis was based on a set of synthesized results for a given on-chip network. The most appropriate models were identified using a data mining approach. The evaluation of the models shows that the relative error is less than 5% in most cases. It is therefore possible to estimate the required resources in a short exploration time and without the synthesis steps. ER - TY - JOUR T1 - Open block scheduling in optical communication networks AU - Ageev, A.A. AU - Fishkin, A.V. AU - Kononov, A.V. AU - Sevastyanov, S.V. JO - Theoretical Computer Science VL - 361 IS - 2 SP - 257 EP - 274 PY - 2006 DA - 2006/09/01/ T2 - Approximation and Online Algorithms SN - 0304-3975 DO - https://doi.org/10.1016/j.tcs.2006.05.014 UR - https://www.sciencedirect.com/science/article/pii/S0304397506003288 KW - Scheduling KW - Approximation KW - Open shop KW - Data packets AB - In this paper the process of data transmission in star coupled optical communication networks is modelled as a shop-type scheduling problem, where channels (wavelengths) are treated as machines. We formulate an Open Block problem with the minimum makespan objective (OB||Cmax) in which a relation of a new type between the operations of each job is introduced: any two operations of a job have identical processing times and may be processed either simultaneously (in a common block) or, alternatively, at disjoint time intervals. We show that the problem is polynomially solvable for 4 machines, NP-hard for 6 machines and strongly NP-hard for a variable number of machines. For the case of a variable number of machines we present a polynomial time 2-approximation algorithm and prove that there is no polynomial time ρ-approximation algorithm with ρ<11/10, unless P=NP. For the case when the number of machines is fixed, we show that the problem admits a linear time PTAS. In addition, we show that the two-machine problem with release dates is NP-hard in the strong sense. ER - TY - JOUR T1 - Mathematical model of stored logic based computation AU - Mora-Mora, Higinio AU - Mora-Pascual, Jerónimo AU - Signes-Pont, María Teresa AU - Sánchez Romero, José Luis JO - Mathematical and Computer Modelling VL - 52 IS - 7 SP - 1243 EP - 1250 PY - 2010 DA - 2010/10/01/ T2 - Mathematical Models in Medicine, Business & Engineering 2009 SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2010.02.034 UR - https://www.sciencedirect.com/science/article/pii/S0895717710000981 KW - Digital VLSI systems KW - Microprocessors design KW - Memories KW - Look-up tables AB - Emerging VLSI and ULSI integration technologies provide new possibilities for developing computational paradigms based on memories with pre-calculated data. A memory can behave like a processor with complete functionality by simulating a classic Turing machine. By means of this stored logic based architecture, the processor adopts a simple and regular internal organization. In addition, it makes the most of the inherent features in the memories and offers the possibility of reconfiguration by writing new results inside of it. This paper reviews different possibilities to use memory elements to perform computations that would replace combinational logic processing of a given function. In this research, a computational model based on stored logic is described and interesting issues concerned with memory utilization in processing are analyzed. A small functional unit based on these notions is presented. ER - TY - JOUR T1 - Intercellular Communication & Gap Junctions JO - Biophysical Journal VL - 94 IS - 2, Supplement SP - 146 EP - 150 PY - 2008 DA - 2008/02/01/ T2 - 2008 Annual Meeting Abstracts - a supplement of Biophysical Journal SN - 0006-3495 DO - https://doi.org/10.1016/S0006-3495(08)79014-3 UR - https://www.sciencedirect.com/science/article/pii/S0006349508790143 ER - TY - JOUR T1 - Approximation algorithms for the optimal p-source communication spanning tree AU - Wu, Bang Ye JO - Discrete Applied Mathematics VL - 143 IS - 1 SP - 31 EP - 42 PY - 2004 DA - 2004/09/30/ SN - 0166-218X DO - https://doi.org/10.1016/j.dam.2003.10.002 UR - https://www.sciencedirect.com/science/article/pii/S0166218X03006504 KW - Approximation algorithms KW - Network design KW - Spanning trees AB - The computational complexity and the approximation algorithms of the optimal p-source communication spanning tree (p-OCT) problem were investigated. Let G be an undirected graph with nonnegative edge lengths. Given p vertices as sources and all vertices as destinations, and also given arbitrary requirements between sources and destinations, we investigated the problem how to construct a spanning tree of G such that the total communication cost from sources to destinations is minimum, where the communication cost from a source to a destination is the path length multiplied by their requirement. For any fixed integer p⩾2, we showed that the problem is NP-hard even for metric graphs. For metric graphs of n vertices, we show a 2-approximation algorithm with time complexity O(np−1). For general graphs, we present a 3-approximation algorithm for the case of two sources. ER - TY - JOUR T1 - Short communication: Predictive ability of Fourier-transform mid-infrared spectroscopy to assess CSN genotypes and detailed protein composition of buffalo milk AU - Bonfatti, V. AU - Cecchinato, A. AU - Carnier, P. JO - Journal of Dairy Science VL - 98 IS - 9 SP - 6583 EP - 6587 PY - 2015 DA - 2015/09/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2015-9730 UR - https://www.sciencedirect.com/science/article/pii/S0022030215005019 KW - buffalo milk KW - protein composition KW - casein fractions KW - spectroscopy AB - The aim of this work was to test the applicability of Fourier-transform mid-infrared spectroscopy (FT-MIR) for the prediction of the contents of casein (CN) and whey protein fractions in buffalo milk. Buffalo milk samples spectra were collected using a MilkoScan FT2 (Foss, Hillerød, Denmark) over the spectral range from 5,000 to 900 wavenumber × cm−1. Contents of protein fractions, as well as CSN1S1 and CSN3 genotypes, were assessed by reversed phase HPLC. The highest coefficients of determination in cross-validation (1 − VR) were obtained for the contents (g/L of milk) of total protein and CN (1 − VR=0.92), followed by the content of β-CN, total whey protein, and αS2-CN (1 − VR of 0.87, 0.77, and 0.63, respectively). Conversely, contents of αS1-CN, γ-CN, glycosylated-κ-CN, total κ-CN, and whey protein fractions were predicted with poor accuracy (1 − VR <0.51). When protein fractions were expressed as percentages to total protein, 1 − VR values were never greater than 0.61 (β-CN). Only 56 and 70% of the observations were correctly classified by discriminant analysis in each of 2 groups of CSN1S1 and CSN3 genotypes, respectively. Results showed that FT-MIR spectroscopy is not applicable when prediction of detailed milk protein composition with high accuracy is required. Predictions may play a role as indicator traits in selective breeding, if the genetic correlation between FT-MIR predictions and measures of milk protein composition are high enough and predictions of protein fraction contents are sufficiently independent from the predicted total protein content. ER - TY - JOUR T1 - International symposium mathematical journals. Centenary of El Progreso Matematico (1891–1991) Zaragoza, Spain, September 19–21, 1991 AU - Millán, Ana JO - Historia Mathematica VL - 20 IS - 3 SP - 315 EP - 317 PY - 1993 DA - 1993/08/01/ SN - 0315-0860 DO - https://doi.org/10.1016/S0315-0860(08)80001-8 UR - https://www.sciencedirect.com/science/article/pii/S0315086008800018 ER - TY - JOUR T1 - Propagation channel models for mobile communication AU - Pajusco, Patrice JO - Comptes Rendus Physique VL - 7 IS - 7 SP - 703 EP - 714 PY - 2006 DA - 2006/09/01/ T2 - Towards reconfigurable and cognitive communications SN - 1631-0705 DO - https://doi.org/10.1016/j.crhy.2006.07.002 UR - https://www.sciencedirect.com/science/article/pii/S1631070506001484 KW - Propagation KW - Wideband KW - Channel model KW - Measurement KW - MIMO KW - Propagation KW - Large bande KW - Modèle KW - Mesure KW - MIMO AB - Propagation channel properties influence the development of wireless communication systems. During system design, channel properties are required to choose the suitable air interface (modulation, coding and access scheme). Comparisons and assessment of different solutions are performed using wideband propagation channel models. During network planning, prediction channel models provide valuable inputs to optimize network parameters. This article aims to present a short overview of these different propagation channel models. To cite this article: P. Pajusco, C. R. Physique 7 (2006). Résumé Les caractéristiques du canal de propagation impactent le développement des systèmes de communication radio mobile. Lors de la conception, la connaissance des caractéristiques du canal permet de déterminer l'interface radio la mieux adaptée (modulations, codage, type d'accès…). Les modèles de canaux large bande permettent alors d'évaluer et de comparer différentes interfaces radio candidates. En phase de déploiement réel, les modèles de prévision fournissent de précieuses données pour l'optimisation de l'architecture et du paramétrage du réseau radio. Cet article a pour but de rappeler brièvement les principales techniques de caractérisation et les méthodes utilisées pour modéliser le canal de propagation. Pour citer cet article : P. Pajusco, C. R. Physique 7 (2006). ER - TY - JOUR T1 - Dynamical Unstable Processes in the Brain: A Biologically Inspired Communication Mechanism from “Unconscious” to “Conscious” Actors AU - Perrone, Antonio Luigi JO - Procedia Computer Science VL - 88 SP - 64 EP - 70 PY - 2016 DA - 2016/01/01/ T2 - 7th Annual International Conference on Biologically Inspired Cognitive Architectures, BICA 2016, held July 16 to July 19, 2016 in New York City, NY, USA SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2016.07.408 UR - https://www.sciencedirect.com/science/article/pii/S1877050916316647 KW - Workspace KW - qualia KW - conscient behavior KW - chaos KW - brain dynamics. AB - The specific aim of this article is to illustrate a possible model to explain and better define in future, the emergence of a conscience like ability from the normal brain operations. We consider the normal behavior of the brain to be highly dynamic and use the chaos theory to formalize it. The emergence mechanism is explained in terms of the synchronization and filtering capabilities of the single computational units (from single neurons to specific brain regions). To obtain such results we suggest the use of the filtering operation as a read/write operation that uses the unstable dynamics as a distributed processing and memorization device. The main focus of this article, though, is only on the read operation. These mechanisms provides the basic building block to go from an unconscious, purely biological and physical, behavior to a pre-conscious (“core consciousness”) one in which the single elements of the conscious perception can be altered according to a specific target that can violate the underlying biological/physical laws. In other words, it is possible to define the emergence of the basic building block of the conscious behavior (qualia?): that is the simultaneous presence of the elements from different perceptual systems (vision, tact, smell etc.). These lists of simultaneously present elements, that changes in time according to the interaction with the external world, form the lists of elements to be brought in a Global Workspace Theory based system. ER - TY - JOUR T1 - Design and prototyping of a low-cost, energy efficient eggs incubator in developing countries: A case study of Cameroon AU - Tiam Kapen, Pascalin AU - Youssoufa, Mohamadou AU - Foutse, Momo AU - Manfouo, Harold AU - Njotchui Mbakop, Franck Oscar JO - Scientific African VL - 10 SP - e00618 PY - 2020 DA - 2020/11/01/ SN - 2468-2276 DO - https://doi.org/10.1016/j.sciaf.2020.e00618 UR - https://www.sciencedirect.com/science/article/pii/S2468227620303550 KW - Low-cost eggs incubator KW - Temperature and humidity regulation KW - Poultry sector KW - Multi-layered wall KW - Heat transfer AB - Farming in general and poultry in particular is a back bone to Africa's development and self-sufficient in term of food. However, in a country like Cameroon, traditional poultry accounts for more than 70%. Due to this situation, more than 43% of newly hatched chicks do not survive thereby causing a lot of loss both financially and in terms of availability of chicken as food. This paper aims to bring a solution to this problem. The paper deals with the prototyping of an energy efficient eggs incubator in view of providing a solution to the poultry sector in developing countries. The system hardware is composed of an enclosure, mechanical and electronic parts. The enclosure is made of plywood, aluminum and glass wool in order to minimize the heat loss across the multi-layered wall. The mechanical part comprises of electronically controlled mechanical jacks. The electronic module is constituted of a temperature and humidity generator and measurement circuits, a control circuit, a communication module and a microcontroller in charge of monitoring and controlling the operation of the system. Using Proportional-Integral-Derivative (PID) controller, the mathematical modeling of heat transfer permitted the optimization of energy efficiency of the system. The system has a capacity of 600 eggs. The eggs were incubated at a temperature of 37.5°C and a humidity of 45.5% after a preheating stage of 30 min. The developed incubator system gave a hatching rate of 87.27%. ER - TY - JOUR T1 - M-matrices and bounds for reliable transmission of information in communication systems and economic markets AU - O'Neill, William O. JO - Linear Algebra and its Applications VL - 195 SP - 145 EP - 154 PY - 1993 DA - 1993/12/01/ SN - 0024-3795 DO - https://doi.org/10.1016/0024-3795(93)90260-U UR - https://www.sciencedirect.com/science/article/pii/002437959390260U AB - A multivariate normal density N(0, Σ) whose covariance matrix is positive with an M-matrix inverse is shown to give an upper bound to the region in which communication systems and economic markets can reliably transmit information. The upper bound is known to be tight when the density is bivariate. ER - TY - JOUR T1 - Mathematical modal logic: A view of its evolution AU - Goldblatt, Robert JO - Journal of Applied Logic VL - 1 IS - 5 SP - 309 EP - 392 PY - 2003 DA - 2003/10/01/ SN - 1570-8683 DO - https://doi.org/10.1016/S1570-8683(03)00008-9 UR - https://www.sciencedirect.com/science/article/pii/S1570868303000089 KW - Modal logic KW - History of logic KW - Boolean algebra KW - Kripke semantics AB - This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science. ER - TY - JOUR T1 - The communication complexity of computing differentiable functions in a multicomputer network AU - Chen, Pengyuan JO - Theoretical Computer Science VL - 125 IS - 2 SP - 373 EP - 383 PY - 1994 DA - 1994/03/28/ SN - 0304-3975 DO - https://doi.org/10.1016/0304-3975(94)90260-7 UR - https://www.sciencedirect.com/science/article/pii/0304397594902607 AB - Employing Abelson's multistage model of distributed computation, we study the amount of intercomputer communication required for a differentiable function to be computed in a multicomputer network, under the assumption that each computer in the network has only partial information about the input data. We formulate a general approach for obtaining a lower bound on the amount of required information exchange among the computers in the network. Unlike other studies in this setting, where the lower bound results are obtained only for the special two-computer case and often for a certain particular class of functions, our approach makes it possible to obtain a lower bound result for a general multicomputer network and for any differentiable function. The lower bound obtained here is given in terms of a certain differential-geometric property of the function to be computed and is not merely asymptotic, in contrast to most lower bound results in the literature. Furthermore, the lower bound is fully constructive and computable. ER - TY - JOUR T1 - Risk-benefit analysis in food safety and nutrition AU - Membré, Jeanne Marie AU - Santillana Farakos, Sofia AU - Nauta, Maarten JO - Current Opinion in Food Science VL - 39 SP - 76 EP - 82 PY - 2021 DA - 2021/06/01/ SN - 2214-7993 DO - https://doi.org/10.1016/j.cofs.2020.12.009 UR - https://www.sciencedirect.com/science/article/pii/S2214799320301612 AB - Risk-benefit analysis of foods including a formal public health assessment followed by management and communication has been establishing itself as a scientific discipline during the past 15 years. Risk-Benefit Assessments (RBAs), integrating nutrition, toxicology and microbiology, have been increasingly conducted for a variety of foods and food components. Quantitative models in these assessments often use the Disability Adjusted Life Year (DALY) as a common health metric, as it allows for comparison of diverse health effects. Results are typically reported by population group to capture differences in health outcomes and target communication. Strengthening the links between a formal RBA, risk-benefit management decisions and dietary recommendations communicated to the public will improve transparency and potentially public health outcomes. In the coming years, sustainable food production and other factors in addition to public health might result in risk-benefit analysis becoming part of the broader food system analysis. ER - TY - JOUR T1 - Introducing vaccination against serogroup B meningococcal disease: An economic and mathematical modelling study of potential impact AU - Christensen, Hannah AU - Hickman, Matthew AU - Edmunds, W. John AU - Trotter, Caroline L. JO - Vaccine VL - 31 IS - 23 SP - 2638 EP - 2646 PY - 2013 DA - 2013/05/28/ SN - 0264-410X DO - https://doi.org/10.1016/j.vaccine.2013.03.034 UR - https://www.sciencedirect.com/science/article/pii/S0264410X13003691 KW - Meningococcal KW - Vaccine KW - Model KW - Cost-effectiveness AB - Background Meningococcal disease remains an important cause of morbidity and mortality worldwide. The first broadly effective vaccine against group B disease (which causes considerable meningococcal disease in Europe, the Americas and Australasia) was licensed in the EU in January 2013; our objective was to estimate the potential impact of introducing such a vaccine in England. Methods We developed two models to estimate the impact of introducing a new ‘MenB’ vaccine. The cohort model assumes the vaccine protects against disease only; the transmission dynamic model also allows the vaccine to protect against carriage (accounting for herd effects). We used these, and economic models, to estimate the case reduction and cost-effectiveness of a number of different vaccine strategies. Results We estimate 27% of meningococcal disease cases could be prevented over the lifetime of an English birth cohort by vaccinating infants at 2,3,4 and 12 months of age with a vaccine that prevents disease only; this strategy could be cost-effective at £9 per vaccine dose. Substantial reductions in disease (71%) can be produced after 10 years by routinely vaccinating infants in combination with a large-scale catch-up campaign, using a vaccine which protects against carriage as well as disease; this could be cost-effective at £17 per vaccine dose. Conclusions New ‘MenB’ vaccines could substantially reduce disease in England and be cost-effective if competitively priced, particularly if the vaccines can prevent carriage as well as disease. These results are relevant to other countries, with a similar epidemiology to England, considering the introduction of a new ‘MenB’ vaccine. ER - TY - JOUR T1 - Distributed heterogeneous energy storage systems synchronization control with dynamic weights and time-varying unbalanced digraphs AU - Kang, Wenfa AU - Chen, Minyou AU - Lai, Wei AU - Wu, Kunming AU - Cheng, Tingli JO - Energy Reports VL - 6 SP - 877 EP - 885 PY - 2020 DA - 2020/12/01/ T2 - 2020 The 7th International Conference on Power and Energy Systems Engineering SN - 2352-4847 DO - https://doi.org/10.1016/j.egyr.2020.11.118 UR - https://www.sciencedirect.com/science/article/pii/S2352484720315432 KW - Distributed synchronization control KW - Proportional power sharing KW - Battery energy storage system KW - Time-varying communication networks AB - This paper provides a distributed control strategy for battery energy storage systems (BESS) based on multi-agent system. The proposed control laws can guarantee that the state of charge (SoC) is synchronized, and BESS active power can be shared proportionally. Moreover, the heterogeneous characteristics of BESS are considered in modeling BESS and designing control laws, while they are not carefully considered in the existed literature. Besides, the proposed control laws are robust to the changing communication topologies and link broken since they can be applied over the time-varying directed unbalanced communication networks. Simulation studies, which are carried out on matlab/simulink, validate the effectiveness of the control strategy and laws. ER - TY - JOUR T1 - Hidden verification for computational mathematics AU - Gottliebsen, Hanne AU - Kelsey, Tom AU - Martin, Ursula JO - Journal of Symbolic Computation VL - 39 IS - 5 SP - 539 EP - 567 PY - 2005 DA - 2005/05/01/ T2 - Automated Reasoning and Computer Algebra Systems (AR-CA) SN - 0747-7171 DO - https://doi.org/10.1016/j.jsc.2004.12.005 UR - https://www.sciencedirect.com/science/article/pii/S0747717105000295 KW - Computer algebra KW - Automated reasoning KW - Real analysis AB - We present hidden verification as a means to make the power of computational logic available to users of computer algebra systems while shielding them from its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures to attempt proofs of continuity, convergence and differentiability for functions in this class. These are called directly from Maple by a simple pipe-lined interface. Hence we are able to support the analysis of differential equations in Maple by direct calls to PVS for: result refinement and verification, discharge of verification conditions, harnesses to ensure more reliable differential equation solvers, and verifiable look-up tables. ER - TY - JOUR T1 - Detection of Human and Computer Voice Spammers Using Hidden Markov Model in Voice over Internet Protocol Network AU - Vennila, G. AU - Manikandan, M.S.K. JO - Procedia Computer Science VL - 115 SP - 588 EP - 595 PY - 2017 DA - 2017/01/01/ T2 - 7th International Conference on Advances in Computing & Communications, ICACC-2017, 22-24 August 2017, Cochin, India SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2017.09.169 UR - https://www.sciencedirect.com/science/article/pii/S1877050917320033 KW - VoIP KW - SIP KW - Hidden Markov Model KW - Voice spammers AB - This work presents a mathematical model for Voice over Internet Protocol (VoIP) communication which detects voice spammers (both human and computer) before reaching the conversation phase. The call pattern of the voice spammers are measured which are the fundamental characteristics for detection. The proposed Hidden Markov Model (HMM) for voice spammers are compared with existing behavior-based model. Through simulations with various parameter settings, the proposed model effectively distinguishes the voice spammers from legitimate callers and prevents them before making a next call. ER - TY - JOUR T1 - Postscript: “Permutations with forbidden subsequences and a generalized Schröder number” [Discrete Mathematics 218 (2000) 121–130] AU - Kremer, Darla JO - Discrete Mathematics VL - 270 IS - 1 SP - 333 EP - 334 PY - 2003 DA - 2003/08/28/ SN - 0012-365X DO - https://doi.org/10.1016/S0012-365X(03)00124-9 UR - https://www.sciencedirect.com/science/article/pii/S0012365X03001249 ER - TY - JOUR T1 - Indigenous artifacts from remote areas, used to design a lesson plan for preservice math teachers regarding sustainable education AU - Utami, Niken Wahyu AU - Sayuti, Suminto A. AU - Jailani, Jailani JO - Heliyon VL - 7 IS - 3 SP - e06417 PY - 2021 DA - 2021/03/01/ SN - 2405-8440 DO - https://doi.org/10.1016/j.heliyon.2021.e06417 UR - https://www.sciencedirect.com/science/article/pii/S2405844021005223 KW - Sustainable education KW - Indigenous knowledge KW - Ethnomathematics KW - Preservice math teacher KW - Math lesson plan AB - In the context of sustainable education, remote areas require special treatment. However, teachers are not evenly distributed in terms of quantity and quality. Adaptable, creative, and innovative teachers are needed in remote areas. Therefore, universities must prepare preservice teachers to teach in these places. This study explores indigenous artifacts from local communities related to mathematical content that preservice teachers can adopt to design lesson plans using available resources. Data were collected through the artifacts of indigenous people in a mountainous region on the border of Yogyakarta and Central Java, Indonesia, and the math curriculum content was examined. The relational ideas of the artifacts and the math curriculum content were analyzed. Based on the results, this study shows that artifacts can be incorporated into math learning materials. Elaborating on the artifacts can potentially relate culture and math in the classroom. The artifacts contain mathematical value and are close to students' thoughts. Hence, preservice math teachers can use them to design lesson plans, particularly for math learning. By understanding artifacts in remote areas, preservice teachers will have a particular capability for preparing lesson plans relevant to students’ environment for sustainable education. ER - TY - JOUR T1 - The evolutionary dynamics of expectations: Interactions among codes in inter-human communications AU - Leydesdorff, Loet AU - Hoegl, Franz JO - Biosystems VL - 198 SP - 104236 PY - 2020 DA - 2020/12/01/ SN - 0303-2647 DO - https://doi.org/10.1016/j.biosystems.2020.104236 UR - https://www.sciencedirect.com/science/article/pii/S0303264720301258 KW - Sociology KW - Communication theory KW - Theory of knowledge KW - Codes KW - Expectation KW - Monism AB - Double contingency—each of us (Ego) expects others (Alter) to entertain expectations as we entertain them ourselves—can be considered as the micro-operation of an above-individual (i.e., social) logic of expectations. Meaning is provided to events from the perspective of hindsight, but with reference to horizons of meaning. Whereas “natural selection” is based on genotypes that are observable (like DNA), cultural selection mechanisms are not hard-wired, but evolve. The “genotypes” of cultural evolution are codes in the communication which can operate as selections upon one another. Local instantiations shape trajectories; regimes operate as selection pressure with reference to the next-order horizons of meaning. These orders of expectations can operate incursively and hyper-incursively against the arrow of time and thus generate redundancies: (i) horizons of meaning can be expected to overlap and (ii) distinctions generate new options enlarging the maximum capacities. Information theory and the theory of anticipatory systems can be used for the elaboration of operations against the arrow of time. New options can be a synergetic effect of interactions among codes in the communication and serve as sources of wealth in a knowledge-based economy. ER - TY - JOUR T1 - The relationship between self-regulation strategies and prospective elementary school teachers’ academic achievement in mathematics teaching course AU - Acar, Esin AU - Aktamış, Hilal JO - Procedia - Social and Behavioral Sciences VL - 2 IS - 2 SP - 5539 EP - 5543 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.903 UR - https://www.sciencedirect.com/science/article/pii/S1877042810009432 KW - Self-regulation strategies KW - prospective elementary school teachers KW - mathematics teaching KW - academic achievement KW - motivation AB - Self-regulation strategies including motivational beliefs, cognitive and meta-cognitive and resource managing strategies are very important for prospective elementary school teachers in terms of their mathematics teaching efficacy. Accordingly, we assume that if teachers having these strategies adequately, they teach mathematics better. In this study, it is aimed to reveal the relationship between prospective elementary school teachers’ awareness or using of motivational beliefs, cognitive and meta-cognitive strategies and resource managing strategies in relation to mathematics teaching and the prospective teachers’ academic achievement in “Mathematics Teaching” course. ER - TY - JOUR T1 - Communication complexity: Eyal Kushilevitz, Noam Nisan, Cambridge University Press, Cambridge, 1997. ISBN 0-56067-5 AU - Buhrman, Harry JO - Science of Computer Programming VL - 33 IS - 2 SP - 215 EP - 216 PY - 1999 DA - 1999/02/01/ SN - 0167-6423 DO - https://doi.org/10.1016/S0167-6423(98)00025-2 UR - https://www.sciencedirect.com/science/article/pii/S0167642398000252 ER - TY - JOUR T1 - The inclusive analysis of ICT ethical issues on healthy society: a global digital divide approach AU - Haider, Sami Ahmed AU - Zeeshan, Muhammad AU - Irshad, Muhammad AU - Noman, Sohail M. AU - Arshad, Jehangir AU - Ahmed Shah, Syed Mustajar AU - Pervaiz, Aqsa AU - Naseer, Farhan JO - Procedia Computer Science VL - 183 SP - 801 EP - 806 PY - 2021 DA - 2021/01/01/ T2 - Proceedings of the 10th International Conference of Information and Communication Technology SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2021.03.001 UR - https://www.sciencedirect.com/science/article/pii/S1877050921006086 KW - Global digital division KW - ICT KW - Nations ethical issues KW - Sustainable society KW - Digital opportunity index AB - The Global Digital Division remains as a rising focus that has to be brought into the notice of the United Nations UN. It is about the vast disparity in exposure to the existing digital knowledge by ICT information and communication technologies amongst developed and developing nations. The work outlined here seeks to acknowledge the effects and provide feedback of an ethical issue on key areas. The study also provides information about the several concrete solutions to this issue in order to ensure the sustainable development of society. In addition, a Digital Effectiveness Framework has been suggested which consist of five phases namely access, exploration, knowledge acquisition, adoption, and innovation and transformation. The study ends with the molds that leads to address the impact of the Global Digital Divide will continue at national level. National surveillance systems must be set to determine the digital opportunity index DOI for each country and track their role as tech giants in the information and communication technology environment. ER - TY - JOUR T1 - Short communication: Apparent efficiency of colostral immunoglobulin G absorption in Holstein heifers AU - Halleran, Jennifer AU - Sylvester, Hannah J. AU - Foster, Derek M. JO - Journal of Dairy Science VL - 100 IS - 4 SP - 3282 EP - 3286 PY - 2017 DA - 2017/04/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2016-11904 UR - https://www.sciencedirect.com/science/article/pii/S0022030217301261 KW - colostrum KW - apparent efficiency of absorption KW - transfer of passive immunity AB - ABSTRACT Adequate absorption of bovine colostrum correlates with improved neonatal health. The apparent efficiency of absorption (AEA) of immunoglobulins can be measured using a mathematical equation based on serum and colostral IgG concentration levels, as well as calf body weight and the volume of colostrum being fed. Although commonly measured in research projects, little information is available on the normal AEA across a large group of healthy calves on multiple farms. The purpose of this study was to observe how contributing factors (volume of feeding, birth weight, and time of feeding) can alter AEA and establish a reference range for AEA in healthy calves. Study subjects were 100 Holstein heifer calves from 5 different dairies in North Carolina and Colorado. After a normal calving, the heifer received either 4 or 5.6 L of colostrum within 4 h of birth, an aliquot of the fed colostrum was saved, and a blood sample was collected between 24 and 36 h after birth. Birth weights were measured using the same weight tape on each farm. Radial immunodiffusion assay was performed to obtain IgG concentrations in the colostrum and serum samples. From this data, the AEA was calculated. The AEA ranged from 7.7 to 59.9% with mean of 28.1 ± 9.5% and median of 27.5%. The AEA of 69% of the calves fell between 21 and 40%. The AEA varied widely between calves, even when feeding was standardized. Results suggest that serum IgG concentration may potentially be increased by feeding increased volumes of colostrum or genetic selection, given the wide range of AEA values obtained. ER - TY - JOUR T1 - Communication relations: a paradigm for parallel program design AU - Perrin, Guy-René AU - Finance, Jean-Pierre JO - Science of Computer Programming VL - 19 IS - 1 SP - 25 EP - 59 PY - 1992 DA - 1992/10/01/ SN - 0167-6423 DO - https://doi.org/10.1016/0167-6423(92)90003-T UR - https://www.sciencedirect.com/science/article/pii/016764239290003T AB - The design of parallel programs needs to specify the way parallel components cooperate. This has to be progressively derived as systematically as possible from abstract specifications. In this paper we introduce convenient specification tools and a parallelism model for such development expressions. The innovation we propose is the concept of communication relations, which can be considered ••on the one hand, as a powerful parallelism abstraction to capture the semantics of cooperation between communicating processes,••on the other hand, as a paradigm for systematic parallel program design. This concept of communication relations is defined in the first part of this paper. In the second part we show how this concept can be used as a paradigm for parallel program design and we present a notation for the statements and a refinement technique to transform these statements. Four fundamental rules underly this technique, which is then applied to the development of two examples. Very simple examples have been chosen, but they are suggestive enough to show the main steps of a methodological approach. ER - TY - JOUR T1 - Finite-time consensus on strongly convex balls of Riemannian manifolds with switching directed communication topologies AU - Chen, Sheng AU - Shi, Peng AU - Zhang, Weigong AU - Zhao, Lindu JO - Journal of Mathematical Analysis and Applications VL - 409 IS - 2 SP - 663 EP - 675 PY - 2014 DA - 2014/01/15/ SN - 0022-247X DO - https://doi.org/10.1016/j.jmaa.2013.07.062 UR - https://www.sciencedirect.com/science/article/pii/S0022247X13007014 KW - Nonsmooth analysis KW - Consensus algorithm KW - Finite-time KW - Strongly convex balls KW - Riemannian manifolds KW - Rotation attitudes AB - It is known that a consensus problem on any connected complete Riemannian manifold can be transformed into the one on its strongly convex balls via the compression–decompression along geodesics. From the viewpoint of interior metrics, this paper mainly provides a consensus protocol for strongly convex geodesic balls, in which the communication can be switching and directed. With the aid of nonsmooth analysis tools on Riemannian manifolds, our analysis shows that all dynamical points involved can achieve consensus in finite time. Meanwhile, the corresponding global algorithm is given, with its application to the consensus problem of rotation attitudes, as well as a case simulation, to demonstrate and verify our proposed techniques. ER - TY - JOUR T1 - Outage and throughput analysis of power-beacon assisted nonlinear energy harvesting NOMA multi-user relay system over Nakagami-m fading channels AU - Manh Hoang, Tran AU - Nguyen, Ba Cao AU - Trung, Tran Thanh AU - Dung, Le The JO - Heliyon VL - 6 IS - 11 SP - e05440 PY - 2020 DA - 2020/11/01/ SN - 2405-8440 DO - https://doi.org/10.1016/j.heliyon.2020.e05440 UR - https://www.sciencedirect.com/science/article/pii/S2405844020322830 KW - Electrical engineering KW - Algebra KW - Statistics KW - Probability theory KW - Signal processing KW - Wireless network KW - Communication system KW - Non-orthogonal multiple access KW - Power beacon KW - Nonlinear energy harvesting KW - Successive interference cancellation KW - Outage probability KW - Throughput AB - This paper considers a non-orthogonal multiple access (NOMA) multi-user relay system where both source and relay harvest the energy from a power beacon (PB) equipped with multiple antennas and use this harvested energy to transmit signals to several users. Realistic nonlinear energy harvesting models are applied, and time switching protocols are adopted at source and relay. We successfully derive the exact closed-form expressions of the outage probability and throughput of the system over Nakagami-m fading channels. Then, we use Monte-Carlo simulations to validate the correctness of these derived mathematical expressions. Numerical results show that a higher saturated power threshold of the nonlinear energy harvester results in lower outage probability and higher throughput. Moreover, the optimal time switching ratio that maximizes the throughput is smaller than the optimal time switching ratio that minimizes the outage probability. ER - TY - JOUR T1 - Communication complexity and combinatorial lattice theory AU - Lovăsz, László AU - Saks, Michael JO - Journal of Computer and System Sciences VL - 47 IS - 2 SP - 322 EP - 349 PY - 1993 DA - 1993/10/01/ SN - 0022-0000 DO - https://doi.org/10.1016/0022-0000(93)90035-U UR - https://www.sciencedirect.com/science/article/pii/002200009390035U AB - In a recent paper, Hajnal, Maass, and Turán analyzed the communication complexity of graph connectivity. Building on this work, we develop a general framework for the study of a broad class of communication problems which has several interesting special cases including the graph connectivity problem. The approach is based on the combinatorial theory of alignments and lattices. ER - TY - JOUR T1 - MicroRNAs as a Selective Channel of Communication between Competing RNAs: a Steady-State Theory AU - Figliuzzi, Matteo AU - Marinari, Enzo AU - De Martino, Andrea JO - Biophysical Journal VL - 104 IS - 5 SP - 1203 EP - 1213 PY - 2013 DA - 2013/03/05/ SN - 0006-3495 DO - https://doi.org/10.1016/j.bpj.2013.01.012 UR - https://www.sciencedirect.com/science/article/pii/S0006349513000829 AB - It has recently been suggested that the competition for a finite pool of microRNAs (miRNA) gives rise to effective interactions among their common targets (competing endogenous RNAs or ceRNAs) that could prove to be crucial for posttranscriptional regulation. We have studied a minimal model of posttranscriptional regulation where the emergence and the nature of such interactions can be characterized in detail at steady state. Sensitivity analysis shows that binding free energies and repression mechanisms are the key ingredients for the cross-talk between ceRNAs to arise. Interactions emerge in specific ranges of repression values, can be symmetrical (one ceRNA influences another and vice versa) or asymmetrical (one ceRNA influences another but not the reverse), and may be highly selective, while possibly limited by noise. In addition, we show that nontrivial correlations among ceRNAs can emerge in experimental readouts due to transcriptional fluctuations even in the absence of miRNA-mediated cross-talk. ER - TY - JOUR T1 - Energy and area efficient hierarchy multiplier architecture based on Vedic mathematics and GDI logic AU - Shoba, Mohan AU - Nakkeeran, Rangaswamy JO - Engineering Science and Technology, an International Journal VL - 20 IS - 1 SP - 321 EP - 331 PY - 2017 DA - 2017/02/01/ SN - 2215-0986 DO - https://doi.org/10.1016/j.jestch.2016.06.007 UR - https://www.sciencedirect.com/science/article/pii/S2215098616303202 KW - Multiplier KW - FS-GDI logic KW - CslA KW - BEC converter KW - 4-2 compressor AB - Hierarchy multiplier is attractive because of its ability to carry the multiplication operation within one clock cycle. The existing hierarchical multipliers occupy more area and also results in more delay. Therefore, in this paper, a method to reduce the computation delay of hierarchy multiplier by employing CslA and Binary to Excess 1 Converter (BEC) is proposed. The use of BEC eliminates the n/4 number of adders, existing in the conventional addition scheme, where n denotes the multiplier input width. As the area of the hierarchy multiplier is determined by its base multiplier, the base multiplier is realized with the proposed Vedic multiplier, which has small area and operates with less delay than the conventional multipliers. In addition, the reduction of power consumption in the hierarchy multiplier can be ensured by implementing the designed multiplier with full swing Gate Diffusion Input (GDI) logic. The performances of the proposed and the existing multipliers are evaluated by Cadence SPICE simulator using 45nm technology model. From the simulation results, the performance parameters namely, delay and power consumption are calculated. Further, the area is measured from the corresponding layout for the same technology model. It is examined from the results that the proposed multiplier operates with 17% lesser power delay product than the recently reported hierarchy multiplier. The Monte Carlo simulation is performed to understand the robustness of the proposed hierarchy multiplier. ER - TY - JOUR T1 - Mathematical models of innovation diffusion with stage structure AU - Wang, Wendi AU - Fergola, P. AU - Lombardo, S. AU - Mulone, G. JO - Applied Mathematical Modelling VL - 30 IS - 1 SP - 129 EP - 146 PY - 2006 DA - 2006/01/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2005.03.011 UR - https://www.sciencedirect.com/science/article/pii/S0307904X05000533 KW - Innovation diffusion KW - Stage structure KW - Bistable equilibria KW - Stability switches KW - Time delay AB - Mathematical models with stage structures are proposed to describe the process of awareness, evaluation and decision-making. First, a system of ordinary differential equations is presented that incorporates the awareness stage and the decision-making stage. If the adoption rate is bilinear and imitations are dominant, we find a threshold above which innovation diffusion is successful. Further, if the adoption rate has a higher nonlinearity, it is shown that there exist bistable equilibria and a region such that an innovation diffusion is successful inside and is unsuccessful outside. Secondly, a model with a time delay is proposed that includes an evaluation stage of a product. It is proved that the system exhibits stability switches. The bifurcation direction of equilibria is also discussed. ER - TY - JOUR T1 - Real-time dialogue between experimenters and dreamers during REM sleep AU - Konkoly, Karen R. AU - Appel, Kristoffer AU - Chabani, Emma AU - Mangiaruga, Anastasia AU - Gott, Jarrod AU - Mallett, Remington AU - Caughran, Bruce AU - Witkowski, Sarah AU - Whitmore, Nathan W. AU - Mazurek, Christopher Y. AU - Berent, Jonathan B. AU - Weber, Frederik D. AU - Türker, Başak AU - Leu-Semenescu, Smaranda AU - Maranci, Jean-Baptiste AU - Pipa, Gordon AU - Arnulf, Isabelle AU - Oudiette, Delphine AU - Dresler, Martin AU - Paller, Ken A. JO - Current Biology VL - 31 IS - 7 SP - 1417 EP - 1427.e6 PY - 2021 DA - 2021/04/12/ SN - 0960-9822 DO - https://doi.org/10.1016/j.cub.2021.01.026 UR - https://www.sciencedirect.com/science/article/pii/S0960982221000592 KW - REM sleep KW - interactive dreaming KW - lucid dream KW - sleep learning KW - targeted memory reactivation KW - sensory processing KW - two-way communication KW - sleep mentation KW - dreams KW - consciousness AB - Summary Dreams take us to a different reality, a hallucinatory world that feels as real as any waking experience. These often-bizarre episodes are emblematic of human sleep but have yet to be adequately explained. Retrospective dream reports are subject to distortion and forgetting, presenting a fundamental challenge for neuroscientific studies of dreaming. Here we show that individuals who are asleep and in the midst of a lucid dream (aware of the fact that they are currently dreaming) can perceive questions from an experimenter and provide answers using electrophysiological signals. We implemented our procedures for two-way communication during polysomnographically verified rapid-eye-movement (REM) sleep in 36 individuals. Some had minimal prior experience with lucid dreaming, others were frequent lucid dreamers, and one was a patient with narcolepsy who had frequent lucid dreams. During REM sleep, these individuals exhibited various capabilities, including performing veridical perceptual analysis of novel information, maintaining information in working memory, computing simple answers, and expressing volitional replies. Their responses included distinctive eye movements and selective facial muscle contractions, constituting correctly answered questions on 29 occasions across 6 of the individuals tested. These repeated observations of interactive dreaming, documented by four independent laboratory groups, demonstrate that phenomenological and cognitive characteristics of dreaming can be interrogated in real time. This relatively unexplored communication channel can enable a variety of practical applications and a new strategy for the empirical exploration of dreams. ER - TY - JOUR T1 - WPE9: BEGIN WITH THE END IN MIND: ISSUES IN PLANNING PHARMACOECONOMIC RESEARCH FOR MORE EFFECTIVE COMMUNICATION AU - Rindress, D AU - Goetghebeur, M AU - Welner, S AU - McTavish, A JO - Value in Health VL - 2 IS - 3 SP - 227 PY - 1999 DA - 1999/05/01/ SN - 1098-3015 DO - https://doi.org/10.1016/S1098-3015(11)71077-4 UR - https://www.sciencedirect.com/science/article/pii/S1098301511710774 ER - TY - JOUR T1 - An Algorithm to Find Square Root of Quadratic Residues over Finite Fields using Primitive Elements AU - Faisal, AU - Gazali, Wikaria JO - Procedia Computer Science VL - 116 SP - 198 EP - 205 PY - 2017 DA - 2017/01/01/ T2 - Discovery and innovation of computer science technology in artificial intelligence era: The 2nd International Conference on Computer Science and Computational Intelligence (ICCSCI 2017) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2017.10.033 UR - https://www.sciencedirect.com/science/article/pii/S1877050917320781 KW - quadratic residue KW - square root KW - finite field KW - polynomial KW - primitive element AB - Quadratic residue is an important concept in number theory because it has both theoretical and practical application in mathematics and other areas such as computer science and communication. We also have a same concept of quadratic residue in general finite fields. Finding a square root of a quadratic residue in finite fields is an essential problem in computational algebra. In this paper we present an algorithm of computing square root of quadratic residue in finite fields using a primitive element. ER - TY - JOUR T1 - Lower bounds for one-way probabilistic communication complexity and their application to space complexity AU - Ablayev, Farid JO - Theoretical Computer Science VL - 157 IS - 2 SP - 139 EP - 159 PY - 1996 DA - 1996/05/05/ SN - 0304-3975 DO - https://doi.org/10.1016/0304-3975(95)00157-3 UR - https://www.sciencedirect.com/science/article/pii/0304397595001573 AB - We prove three different types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion “probabilistic communication characteristic” that we define. We present boolean functions with the different probabilistic communication characteristics which demonstrates that each of these lower bounds can be more precise than the others depending on the probabilistic communication characteristics of a function. Our lower bounds are good enough for proving that proper hierarchy for one-way probabilistic communication complexity classes depends on a measure of bounded error. As the application of lower bounds for probabilistic communication complexity, we prove two different types of complexity lower bounds for the one-way bounded-error error probabilistic space complexity. Our lower bounds are good enough for proving proper hierarchies for different one-way probabilistic space communication complexity classes inside SPACE(n) (namely for bounded error probabilistic computation, and for errors of probabilistic computation). ER - TY - JOUR T1 - QoS-aware Self-optimized Reconfigurable Framework for Hyperconnected Network AU - Sethi, Anita AU - Bisht, Manoj JO - Global Transitions Proceedings VL - 2 IS - 1 SP - 18 EP - 23 PY - 2021 DA - 2021/06/01/ T2 - 1st International Conference on Advances in Information, Computing and Trends in Data Engineering (AICDE - 2020) SN - 2666-285X DO - https://doi.org/10.1016/j.gltp.2021.01.003 UR - https://www.sciencedirect.com/science/article/pii/S2666285X21000030 KW - Dynamic network slicing KW - QoS KW - HANET KW - NFV AB - The growing need for communication services and the rise in consumer demand for high quality services have contributed to a fundamental shift over how we handle networks in terms of abstracting, separating, management, control and mapping aspects of service forwarding. Business as well as the market with academics welcomes 6G as the potential network capable of serving vertical applications of the next generation with diverse service specifications. In order to implement an efficient existing network, the physical infrastructure must be split into several segregated logical networks of varying sizes and configurations allocated to different services focused on their preferences with different qualities and requirements. To meet the requirements of global coverage, enhanced energy/cost/spectral efficiency and intelligent and secure heuristics in 6G rely on new technologies with novel network architecture. A detailed survey of latest developments and future trends in these various areas is described in the article. Definitely, 6G would facilitate intelligent and effective communication with specific technological requirements beyond that of 5G, to the point that the distinction between the cyber and physical worlds disappears. This paper outlines innovative technologies like artificial intelligence, 3D dimension networking, intelligent reflecting surface, quantum communication, proactive caching, unmanned aircraft, wireless and power transmission integration, integrated sensors and communication, integrated access backhaul. This article explains emerging technologies like big data analytics that can assist the 6G architecture development in guaranteeing the QoS. ER - TY - JOUR T1 - Quorum Regulation via Nested Antagonistic Feedback Circuits Mediated by the Receptors CD28 and CTLA-4 Confers Robustness to T Cell Population Dynamics AU - Zenke, Simon AU - Palm, Margriet M. AU - Braun, Julia AU - Gavrilov, Alina AU - Meiser, Philippa AU - Böttcher, Jan P. AU - Beyersdorf, Niklas AU - Ehl, Stephan AU - Gerard, Audrey AU - Lämmermann, Tim AU - Schumacher, Ton N. AU - Beltman, Joost B. AU - Rohr, Jan C. JO - Immunity VL - 52 IS - 2 SP - 313 EP - 327.e7 PY - 2020 DA - 2020/02/18/ SN - 1074-7613 DO - https://doi.org/10.1016/j.immuni.2020.01.018 UR - https://www.sciencedirect.com/science/article/pii/S1074761320300467 KW - T lymphocyte KW - population dynamics KW - robustness KW - quorum regulation KW - feedback KW - CD80 KW - CTLA-4 KW - CD28 KW - IL-2 AB - Summary T cell responses upon infection display a remarkably reproducible pattern of expansion, contraction, and memory formation. If the robustness of this pattern builds entirely on signals derived from other cell types or if activated T cells themselves contribute to the orchestration of these population dynamics—akin to bacterial quorum regulation—is unclear. Here, we examined this question using time-lapse microscopy, genetic perturbation, bioinformatic predictions, and mathematical modeling. We found that ICAM-1-mediated cell clustering enabled CD8+ T cells to collectively regulate the balance between proliferation and apoptosis. Mechanistically, T cell expressed CD80 and CD86 interacted with the receptors CD28 and CTLA-4 on neighboring T cells; these interactions fed two nested antagonistic feedback circuits that regulated interleukin 2 production in a manner dependent on T cell density as confirmed by in vivo modulation of this network. Thus, CD8+ T cell-population-intrinsic mechanisms regulate cellular behavior, thereby promoting robustness of population dynamics. ER - TY - JOUR T1 - A communication problem and directed triple systems AU - Gyárfás, András AU - Schelp, R.H. JO - Discrete Applied Mathematics VL - 85 IS - 2 SP - 139 EP - 147 PY - 1998 DA - 1998/06/28/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(98)00028-6 UR - https://www.sciencedirect.com/science/article/pii/S0166218X98000286 KW - Networks KW - Transitive triples KW - Complete symmetric digraph KW - Pairable graph AB - The solution of a specific network problem is shown to be equivalent to the decomposition of a certain complete symmetric digraph into edge disjoint balanced transitive triples. Further related decomposition results and conjectures are presented as well. ER - TY - JOUR T1 - Fractional chaotic maps based short signature scheme under human-centered IoT environments AU - Meshram, Chandrashekhar AU - Ibrahim, Rabha W. AU - Obaid, Ahmed J. AU - Meshram, Sarita Gajbhiye AU - Meshram, Akshaykumar AU - El-Latif, Alaa Mohamed Abd JO - Journal of Advanced Research PY - 2020 DA - 2020/09/09/ SN - 2090-1232 DO - https://doi.org/10.1016/j.jare.2020.08.015 UR - https://www.sciencedirect.com/science/article/pii/S2090123220302010 KW - Fractional chaotic map KW - Chaotic systems KW - Short signature scheme KW - Internet of Things (IoT) KW - Confidentiality KW - Probability security analysis AB - The Internet of Things (IoT) comprises of various smart devices for the sharing of sensed data through online services. People will be directly contacted to check their health parameters and the reports will be collected centrally through smart devices. The requirement is protection of messages during the exchange of data between sender and receiver in order to tackle human malicious attacks. Various signature-based schemes are discussed in the literature to provide secure communication. Smart devices however require lightweight tasks by ensuring critical safety strengths. An important problem in the signature based method is that it incurs more computational expenses for signing and verification process in large numbers. This paper introduces an efficient Short Signature Scheme (SSS) that uses Fractional Chaotic Map (FCM) for secure communication in IoT based smart devices, the security of which is closely related to a random oracle model based on FCM assumption. We have used less rigorous operations to carry out signing and verification procedures, similar to human signing on valid documents and then verifying them as per witness. The proposed SSS offers a better security assurance than currently established signature schemes. The key advantage of the presented SSS over the DSA schemes is that at the verification stage and signing period it takes less computation; it retains the degree of protection. The presented SSS takes less bandwidth for storage, communication, and computing resources; particularly applicable to wireless devices and smart cards. Results show superiority of our schemes as compared with preliminaries. ER - TY - JOUR T1 - Logics of communication and change AU - Benthem, Johan van AU - Eijck, Jan van AU - Kooi, Barteld JO - Information and Computation VL - 204 IS - 11 SP - 1620 EP - 1662 PY - 2006 DA - 2006/11/01/ SN - 0890-5401 DO - https://doi.org/10.1016/j.ic.2006.04.006 UR - https://www.sciencedirect.com/science/article/pii/S0890540106000812 KW - Epistemic logic KW - Update KW - Dynamic logic KW - Common knowledge KW - Reduction axioms KW - Product update KW - Finite automata KW - Kleene’s Theorem AB - Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We also show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warm-up stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all model-shifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both ‘cc’ and ‘bcc’ lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene’s Theorem on finite automata, as well as new Ehrenfeucht games of model comparison. ER - TY - JOUR T1 - From Frege to Gödel. A Source Book in Mathematical Logic, 1879–1931: By Jean van Heijenoort. Cambridge, MA (Harvard University Press). 1967; new paperback edn., 2002. 664 pages, 1 halftone. ISBN: 0-674-32449-8. $27.95 AU - Ferreirós, José JO - Historia Mathematica VL - 31 IS - 1 SP - 119 EP - 124 PY - 2004 DA - 2004/02/01/ SN - 0315-0860 DO - https://doi.org/10.1016/j.hm.2003.07.003 UR - https://www.sciencedirect.com/science/article/pii/S0315086003000582 ER - TY - JOUR T1 - Chaos control and Penta-compound combination anti-synchronization on a novel fractional chaotic system with analysis and application AU - Mahmoud, Emad E. AU - Trikha, Pushali AU - Jahanzaib, Lone Seth AU - Eshmawi, Ala' Abdulmajid AU - Matoog, R.T. JO - Results in Physics VL - 24 SP - 104130 PY - 2021 DA - 2021/05/01/ SN - 2211-3797 DO - https://doi.org/10.1016/j.rinp.2021.104130 UR - https://www.sciencedirect.com/science/article/pii/S2211379721002837 KW - Penta-compound combination KW - Sliding mode control KW - Controlling chaos KW - Secure communication AB - The article introduces the fractional modified Sprott A chaotic system with its thorough dynamical analysis such as solution of system, Lyapunov dynamics, route to chaos etc. Penta-compound combination anti-synchronization is introduced and applied on twelve chaotic systems of fractional order using adaptive SMC. The system is also controlled about a randomly chosen point and The synchronization technique is illustrated as application to secure communication. The simulations are performed using MATLAB software. ER - TY - JOUR T1 - All-to-all personalized communication on multistage interconnection networks AU - Massini, Annalisa JO - Discrete Applied Mathematics VL - 128 IS - 2 SP - 435 EP - 446 PY - 2003 DA - 2003/06/01/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(02)00504-8 UR - https://www.sciencedirect.com/science/article/pii/S0166218X02005048 KW - Multistage interconnection networks KW - All-to-all personalized communication KW - Latin Squares AB - In parallel/distributed computing systems, the all-to-all personalized communication (or complete exchange) is required in numerous applications of parallel processing. In this paper, we consider this problem for logN stage Multistage Interconnection Networks (MINs). It is proved that the set of admissible permutations for a MIN can be partitioned in Latin Squares. Since routing permutations belonging to a Latin Square provides the all-to-all personalized communication, a method to realize the complete exchange with time complexity O(N), that is optimal, can be derived. This method, compared with other ones in literature, does not necessitate of neither pre-computation nor memory allocation to record the Latin Square, because an explicit construction of it is not required; furthermore it is applicable to any logN stage multistage networks since it is independent of the topology. ER - TY - JOUR T1 - The task allocation problem with constant communication AU - Fernandez de la Vega, W. AU - Lamari, M. JO - Discrete Applied Mathematics VL - 131 IS - 1 SP - 169 EP - 177 PY - 2003 DA - 2003/09/06/ T2 - Second International Colloquium, Journees de l'Informatique Messine: Algorithmes de graphes SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(02)00423-7 UR - https://www.sciencedirect.com/science/article/pii/S0166218X02004237 KW - Scheduling KW - Polynomial time approximation scheme AB - In the module allocation problem we are given n tasks t1,…,tn, to be executed by m processors P1,…,Pm, subject to both execution and communication costs. The cost of any assignment of the tasks to the processors is defined as the sum of the corresponding execution costs, and the communication costs for any pair of tasks assigned to distinct processors. We consider the case where all the tasks communicate with communication costs all equal to a constant c0. When the number of processors is bounded, we give two exact, polynomial-time algorithms, an elementary one for the case where the execution costs take only two distinct values and one for the general case. When the number of processors is not bounded, we obtain a polynomial-time approximation scheme. We obtain a similar algorithm when the communication graph is the edge union of a bounded number of cliques and complete bipartite graphs. ER - TY - JOUR T1 - Mathematical modelling for the contention-collision elimination access mode of the IVth system model to a multiple star LAN AU - Lu, Zhao-Yi AU - Sun, Li-Jun AU - Lu, Mai AU - Zhao, Dong-Feng JO - Applied Mathematical Modelling VL - 30 IS - 4 SP - 367 EP - 385 PY - 2006 DA - 2006/04/01/ SN - 0307-904X DO - https://doi.org/10.1016/j.apm.2005.05.008 UR - https://www.sciencedirect.com/science/article/pii/S0307904X05000946 KW - Multiple star LAN KW - Contention-collision elimination access mode KW - Mathematical modelling AB - The contention-collision elimination access mode is a new kind of access mode in star LAN. It can be divided into six different models according to the working principle. The mathematical analysis and performance evaluations for the Ist, IInd, IIIrd and Vth models have been presented in our previous papers. The performance evaluation for the IVth model is discussed in this paper by calculating several important parameters in steady-state i.e. the customer’s transfer probability Pij, the mean number of customers M¯, and the mean waiting time W¯. Performance comparisons between the IVth model and the IInd model are also presented. ER - TY - JOUR T1 - ERCW PRAMs and optical communication AU - MacKenzie, Philip D. AU - Ramachandran, Vijaya JO - Theoretical Computer Science VL - 196 IS - 1 SP - 153 EP - 180 PY - 1998 DA - 1998/04/06/ SN - 0304-3975 DO - https://doi.org/10.1016/S0304-3975(97)00199-0 UR - https://www.sciencedirect.com/science/article/pii/S0304397597001990 KW - Parallel algorithms KW - Optical communication KW - ERCW PRAM KW - Lower bounds KW - Bounded fan-out circuits AB - This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some results for unbounded fan-in, bounded fan-out (or ‘BFO’) circuits. Our results for these two models are of importance because of the close relationship of the ERCW model to the OCPC model, a model of parallel computing based on dynamically reconfigurable optical networks, and of BFO circuits to the OCPC model with limited dynamic reconfiguration ability. ER - TY - JOUR T1 - A new approach for adaptive blind equalization of chaotic communication: The optimal linearization technique AU - Tsai, J.S.H. AU - Lu, F.-C. AU - Provence, R.S. AU - Shieh, L.S. AU - Han, Z. JO - Computers & Mathematics with Applications VL - 58 IS - 9 SP - 1687 EP - 1698 PY - 2009 DA - 2009/11/01/ SN - 0898-1221 DO - https://doi.org/10.1016/j.camwa.2009.06.054 UR - https://www.sciencedirect.com/science/article/pii/S0898122109005689 KW - Blind-channel equalization KW - Optimal linearization KW - Chaos KW - Communications KW - Extended Kalman filter AB - Together with the optimal linearization technique, a blind-channel equalization for the extended-Kalman-filter-based chaotic communication is proposed in this paper. First, the optimal linearization technique is utilized to find the exact linear models of the chaotic system at operating states of interest. The proposed blind-channel equalization is formulated as a mixed nonlinear parameter and state estimation problem by an autoregressive (AR) model. The channel coefficients of a fading and multipath channel can be represented by an AR process. Then, an extended Kalman filter algorithm is utilized to reduce the effect of channel noise. By using the extended Kalman filter, the channel coefficients and the state of the system, which is the signal before going through the channel, can be estimated. The stability problem of the proposed blind-channel equalization is also addressed. Numerical examples and simulations are given to show the effectiveness and speed of convergence for the proposed methodology. ER - TY - JOUR T1 - Acoustic communication in insects and anurans: Common problems and diverse solutions: By H. Carl Gerhardt and Franz Huber. The University of Chicago Press, Chicago, IL. (2002): 531 pages. $35 JO - Computers & Mathematics with Applications VL - 46 IS - 2 SP - 516 PY - 2003 DA - 2003/07/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(03)90067-8 UR - https://www.sciencedirect.com/science/article/pii/S0898122103900678 ER - TY - JOUR T1 - RETRACTED: Investigating the Factors Affecting Information and Communication Technology (ICT) Usage of Turkish Students in PISA 2009 AU - Gumus, Sedat JO - Procedia - Social and Behavioral Sciences VL - 64 SP - 219 EP - 227 PY - 2012 DA - 2012/11/09/ T2 - 12 th International Educational Technology Conference - IETC 2012 SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2012.11.026 UR - https://www.sciencedirect.com/science/article/pii/S1877042812050033 AB - This article has been retracted: please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy). This article has been retracted at the request of the Author. The article is a duplicate of a paper that has already been published in TOJET: The Turkish Online Journal of Educational Technology, volume 12 (2013) 102 - 107. http://www.tojet.net/articles/v10i3/10315.pdf. One of the conditions of submission of a paper for publication is that that the paper is not under consideration for publication elsewhere. As such the author requested this article was not included in this set of published proceedings but an error meant that this was not undertaken. Apologies are offered to readers of this publication that this was not detected during the review process. ER - TY - JOUR T1 - Bioinformatics and mathematical modelling in the study of receptor–receptor interactions and receptor oligomerization: Focus on adenosine receptors AU - Guidolin, Diego AU - Ciruela, Francisco AU - Genedani, Susanna AU - Guescini, Michele AU - Tortorella, Cinzia AU - Albertin, Giovanna AU - Fuxe, Kjell AU - Agnati, Luigi Francesco JO - Biochimica et Biophysica Acta (BBA) - Biomembranes VL - 1808 IS - 5 SP - 1267 EP - 1283 PY - 2011 DA - 2011/05/01/ T2 - Adenosine Receptors SN - 0005-2736 DO - https://doi.org/10.1016/j.bbamem.2010.09.022 UR - https://www.sciencedirect.com/science/article/pii/S0005273610003378 KW - Bioinformatic KW - G protein-coupled receptor KW - Oligomerization KW - Receptor–receptor interaction KW - Receptor Mosaic KW - Allosterism KW - Adenosine receptor AB - The concept of intra-membrane receptor–receptor interactions (RRIs) between different types of G protein-coupled receptors (GPCRs) and evidence for their existence was introduced by Agnati and Fuxe in 1980/81 through the biochemical analysis of the effects of neuropeptides on the binding characteristics of monoamine receptors in membrane preparations from discrete brain regions and functional studies of the interactions between neuropeptides and monoamines in the control of specific functions such as motor control and arterial blood pressure control in animal models. Whether GPCRs can form high-order structures is still a topic of an intense debate. Increasing evidence, however, suggests that the hypothesis of the existence of high-order receptor oligomers is correct. A fundamental consequence of the view describing GPCRs as interacting structures, with the likely formation at the plasma membrane of receptor aggregates of multiple receptors (Receptor Mosaics) is that it is no longer possible to describe signal transduction simply as the result of the binding of the chemical signal to its receptor, but rather as the result of a filtering/integration of chemical signals by the Receptor Mosaics (RMs) and membrane-associated proteins. Thus, in parallel with experimental research, significant efforts were spent in bioinformatics and mathematical modelling. We review here the main approaches that have been used to assess the interaction interfaces allowing the assembly of GPCRs and to shed some light on the integrative functions emerging from the complex behaviour of these RMs. Particular attention was paid to the RMs generated by adenosine A2A, dopamine D2, cannabinoid CB1, and metabotropic glutamate mGlu5 receptors (A2A, D2, CB1 and mGlu5, respectively), and a possible approach to model the interplay between the D2–A2A–CB1 and D2–A2A–mGlu5 trimers is proposed. This article is part of a Special Issue entitled: “Adenosine Receptors”. ER - TY - JOUR T1 - Quantum Key Distribution: Simulation and Characterizations AU - Jasim, Omer K. AU - Abbas, Safia AU - El-Horbaty, El-Sayed M. AU - Salem, Abdel-Badeeh M. JO - Procedia Computer Science VL - 65 SP - 701 EP - 710 PY - 2015 DA - 2015/01/01/ T2 - International Conference on Communications, management, and Information technology (ICCMIT'2015) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2015.09.014 UR - https://www.sciencedirect.com/science/article/pii/S1877050915028446 KW - QKD KW - BB84 KW - Key distribution KW - qubit KW - secure communication KW - encryption/decryption algorithms. AB - All traditional cryptographic algorithms used in the network communication environments, relied on mathematical models and computational assumptions, are actually unsafe and apt by many attackers (quantum and man-in-the-middle attacks). Therefore, nowadays Quantum Key Distribution (QKD) promises a secure key agreement by using quantum mechanical systems. QKD becomes a significant trend of new cryptographic revolution. This paper explains how cryptography exploits the quantum mechanics in order to achieve an encryption/decryption process. Additionally, this paper provides a standard simulation for QKD-BB84 protocol and describes improvement key generation and key distribution mechanisms. Then, validation, results and efficiency of BB84 protocol are presented using different security configurations. Finally, our results indicated that the QKD is susceptible to corporate with different security applications and achieve the key availability for such applications. However, it suffers from the higher rate of authentication cost. ER - TY - JOUR T1 - Optimizing Data Traffic Route for Maritime Vessels Communications AU - Sumić, Dean AU - Peraković, Dragan AU - Jurcević, Marinko JO - Procedia Engineering VL - 100 SP - 1286 EP - 1293 PY - 2015 DA - 2015/01/01/ T2 - 25th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2014 SN - 1877-7058 DO - https://doi.org/10.1016/j.proeng.2015.01.495 UR - https://www.sciencedirect.com/science/article/pii/S1877705815005226 KW - GMDSS KW - data traffic KW - ship's communications KW - routing traffic KW - cost optimisation AB - The growing demands for data links capacity in maritime vessels and high costs of satellite communication links through mandatory GMDSS Inmarsat equipment emphasize the possibility of optimizing data traffic routes through alternative service providers either satellite or terrestrial. Lower cost services, as well as increased link capacity will justify introduction of new technologies onboard ships. Implementation of new technologies is important, but also the appropriate implementation of processes and the awareness and motivation of the people on board that ensures the value of such a service. In order to realize more convenient link, the development of a mathematical model is proposed as basis for decision making optimization of data traffic route in communication of maritime vessels. In addition to the presentation of previous research, the paper also shows the optimization of data traffic route by the example of authentic maritime communications within the organizational environment. ER - TY - JOUR T1 - Still another rank determination of set intersection matrices with an application in communication complexity AU - Tamm, U. JO - Applied Mathematics Letters VL - 7 IS - 2 SP - 39 EP - 44 PY - 1994 DA - 1994/03/01/ SN - 0893-9659 DO - https://doi.org/10.1016/0893-9659(94)90028-0 UR - https://www.sciencedirect.com/science/article/pii/0893965994900280 AB - The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in [1] and [2]. In this note, the rank of these matrices is determined by another method of proof, which makes use of a factorization into a product of an upper and a lower triangular matrix. ER - TY - JOUR T1 - Towards a model of musical interaction and communication AU - Murray-Rust, Dave AU - Smaill, Alan JO - Artificial Intelligence VL - 175 IS - 9 SP - 1697 EP - 1721 PY - 2011 DA - 2011/06/01/ SN - 0004-3702 DO - https://doi.org/10.1016/j.artint.2011.01.002 UR - https://www.sciencedirect.com/science/article/pii/S0004370211000038 KW - Multi-agent systems KW - Musical agents KW - Communicative acts KW - Human computer interaction AB - In this paper we argue there is a need for a formalised description of musical interaction, which allows reasoning about the musical decisions of human and computational players. To this end, we define a simple model of musical transmission which is amenable to distribution among several musical agents. On top of this, we construct a model of musical perception, based on analysis functions from the musical surface to values on lattices. These values are then used to construct a musical context, allowing for a music-oriented version of concepts such as common ground. This context allows for the interpretation of individual musical output as a stream of discrete actions, with the possibility of constructing sets of performative actions, analogous to those used in Speech Act Theory. This allows musical agent systems to construct output in terms of a communicative dialogue, and should enable more responsive, intelligent participation from these virtual musicians. Finally, we discuss a prototype system which implements these concepts in order to perform piano duets with human performers, and discuss how this theory can be seen as a better defined extension of previous theories. ER - TY - JOUR T1 - A brain-inspired cognitive support model for stress reduction based on an adaptive network model AU - Andrianov, Andrei AU - Ziabari, S. Sahand Mohammadi AU - Gerritsen, Charlotte JO - Cognitive Systems Research VL - 65 SP - 151 EP - 166 PY - 2021 DA - 2021/01/01/ SN - 1389-0417 DO - https://doi.org/10.1016/j.cogsys.2020.10.010 UR - https://www.sciencedirect.com/science/article/pii/S1389041720300838 KW - Integrative model KW - Computational model KW - Temporal-causal network KW - Network-oriented modelling KW - Stress KW - Cognitive modelling AB - Stress is often seen as a negative factor which affects every individual’s life quality and decision making. To help avoid or deal with extreme emotions caused by an external stressor, a number of practices have been introduced. In the scope of this paper, we take three kinds of therapy into account: mindfulness, humor, and music therapy. This paper aims to see how various practices help people to cope with stress, using mathematical modelling. We present practical implementations in the form of client–server software, incorporating the computational model which describes therapy effects for overcoming stress based on quantitative neuropsychological research. The underlying network model simulates the elicitation of an extremely stressful emotion due to a strong stress-inducing event as an external stimulus, followed by a therapy practice simulation leading to a reduction of the stress level. Each simulation is based on user input and preferences, integrating a parameter tuning process; it fits a simulation for a particular user. The client–server architecture software which has been designed and developed completely fulfills this objective. It includes server part with embedded MATLAB interaction and API for client communication. ER - TY - JOUR T1 - Ordered biclique partitions and communication complexity problems AU - Shigeta, Manami AU - Amano, Kazuyuki JO - Discrete Applied Mathematics VL - 184 SP - 248 EP - 252 PY - 2015 DA - 2015/03/31/ SN - 0166-218X DO - https://doi.org/10.1016/j.dam.2014.10.029 UR - https://www.sciencedirect.com/science/article/pii/S0166218X14004740 KW - Biclique partition KW - Boolean matrix KW - Fooling set KW - Rank KW - Complete graphs AB - An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In this note, we give an explicit construction of such a collection of size n1/2+o(1), which improves the O(n2/3) bound shown in the previous work (Amano, 2014). As the immediate consequences of this result, we show (i) a construction of n×n 0/1 matrices of rank n1/2+o(1) which have a fooling set of size n, i.e., the gap between rank and fooling set size can be at least almost quadratic, and (ii) an improved lower bound (2−o(1))logN on the nondeterministic communication complexity of the clique vs. independent set problem, which matches the best known lower bound on the deterministic version of the problem shown by Kushilevitz et al. (1999). ER - TY - JOUR T1 - Contact tracing – Old models and new challenges AU - Müller, Johannes AU - Kretzschmar, Mirjam JO - Infectious Disease Modelling VL - 6 SP - 222 EP - 231 PY - 2021 DA - 2021/01/01/ SN - 2468-0427 DO - https://doi.org/10.1016/j.idm.2020.12.005 UR - https://www.sciencedirect.com/science/article/pii/S2468042720301093 KW - Contact tracing KW - Mathematical models AB - Contact tracing is an effective method to control emerging infectious diseases. Since the 1980’s, modellers are developing a consistent theory for contact tracing, with the aim to find effective and efficient implementations, and to assess the effects of contact tracing on the spread of an infectious disease. Despite the progress made in the area, there remain important open questions. In addition, technological developments, especially in the field of molecular biology (genetic sequencing of pathogens) and modern communication (digital contact tracing), have posed new challenges for the modelling community. In the present paper, we discuss modelling approaches for contact tracing and identify some of the current challenges for the field. ER - TY - JOUR T1 - Transformation of Language in Teaching and Learning Policy AU - Ahmad, Rokiah @ Rozita AU - Majid, Noriza AU - Mamat, Nur Jumaadzan Zaleha AU - Rambely, Azmin Sham AU - Muda, Nora AU - Jaaman, Saiful Hafizah Hj AU - Suradi, Nur Riza Mohd AU - Ismail, Wan Rosmanira AU - Shahabuddin, Faridatulazna Ahmad AU - Nazar, Roslinda Mohd AU - Samsudin, Humaida Banu AU - Zin, Wan Zawiah Wan AU - Zahari, Marina AU - Rafee, Najib Mahmood JO - Procedia - Social and Behavioral Sciences VL - 59 SP - 685 EP - 691 PY - 2012 DA - 2012/10/17/ T2 - Universiti Kebangsaan Malaysia Teaching and Learning Congress 2011, Volume I, December 17 – 20 2011, Pulau Pinang MALAYSIA SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2012.09.331 UR - https://www.sciencedirect.com/science/article/pii/S1877042812037792 KW - PPSMI KW - MBMMBI KW - Students’ perspective KW - Teaching and learning AB - Due to the abolishment of the Teaching and Learning of Science and Mathematics in English (PPSMI) policy by the Malaysian Cabinet in July 2009, a new policy which is called Upholding the Malay Language and Strengthening Command of English (MBMMBI) policy was introduced. Both languages have their role and importance. The Malay language has long since been the language of knowledge and unity in Malaysia, whereas English is the international communication language. This study focuses on students’ perspectives regarding the issue of the transformation from PPSMI to MBMMBI. A survey has been conducted to gather information from students who enrolled for Science and Mathematics courses. Results show that the students are taking a positive standpoint in upholding the Malay language and at the same time strengthening the command of the English language. The transformation from PPSMI to MBMMBI is hoped to generate Malaysians who are fluent and confident in both Malay and English languages. ER - TY - JOUR T1 - Analyzing the effects of the problem solving approach to the performance and attitude of first year university students AU - Albay, Eduard M. JO - Social Sciences & Humanities Open VL - 1 IS - 1 SP - 100006 PY - 2019 DA - 2019/01/01/ SN - 2590-2911 DO - https://doi.org/10.1016/j.ssaho.2019.100006 UR - https://www.sciencedirect.com/science/article/pii/S2590291119300063 KW - Collaboration KW - Collaborative strategies KW - Mathematics education KW - Problem solving approach KW - Teaching through problem solving AB - The problem solving approach emphasizes that important mathematics concepts and procedures can be best taught through problem solving tasks or activities which engage students in thinking about the important mathematical concepts and skills they need to learn. This study utilized the problem solving approach, also known as teaching through problem solving, as supported by various collaborative strategies, as instructional intervention in teaching mathematics to university freshmen students and investigated its effects to their performance and attitude towards the subject. The pretest-posttest true experimental design using two matched groups of respondents based on their Intelligence Quotient scores and mathematics test scores in the University Admission Test was utilized. Problem solving tasks were developed and provided to the experimental group. The conventional approach in teaching and learning was employed to the control group. Necessary data to fulfill the objectives of the study were gathered through the attitude scale questionnaire and the researcher-made test and were analyzed using appropriate statistical tools. The results established evidences that the problem solving approach when applied to classroom instruction can significantly improve understanding and performance in mathematics and can also promote a favorable attitude towards the subject, hence, indicating the effectiveness of the approach in teaching mathematics. ER - TY - JOUR T1 - A mobile communication aid system for persons with physical disabilities AU - Yang, Cheng-Huei AU - Huang, Hsiu-Chen AU - Chuang, Li-Yeh AU - Yang, Cheng-Hong JO - Mathematical and Computer Modelling VL - 47 IS - 3 SP - 318 EP - 327 PY - 2008 DA - 2008/02/01/ SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2007.01.012 UR - https://www.sciencedirect.com/science/article/pii/S0895717707001707 KW - Morse code KW - Adaptive signal processing KW - Simple message service KW - Assistive technology AB - Assistive technology (AT) is becoming increasingly important in improving mobility, communication and learning capabilities of persons who have disabilities, enabling them to function independently and to improve their social opportunities. Morse code has been shown to be a valuable tool in assistive technology, augmentative and alternative communication, and rehabilitation for people with various conditions such as spinal cord injuries, non-vocal quadriplegics, and vocal, visual or hearing impairments. In this paper, we describe the design and implementation of a mobile phone human-interface system using a single-switch Morse code input device. The proposed system is divided into three parts: input module, control module, and display module. The data format of the signal transmission between the proposed system and the communication devices is the PDU (protocol description unit) mode. A person with disabilities would be able to send/receive SMS (Simple Message Service) messages or make/respond to a phone call. Experimental results revealed that three participants with disabilities were able to operate the mobile phone through this human-interface after two months’ practice. ER - TY - JOUR T1 - Trade-offs between communication and space AU - Lam, Tak AU - Tiwari, Prasoon AU - Tompa, Martin JO - Journal of Computer and System Sciences VL - 45 IS - 3 SP - 296 EP - 315 PY - 1992 DA - 1992/12/01/ SN - 0022-0000 DO - https://doi.org/10.1016/0022-0000(92)90028-H UR - https://www.sciencedirect.com/science/article/pii/002200009290028H AB - This paper initiates the study of communication complexity when the processors have limited work space. The following trade-offs between the number C of communications steps and space S are proved: 1.1. For multiplying two n × n matrices in the arithmetic model with two-way communication, CS = Θ(n3).2.2. For convolution of two degree n polynomials in the arithmetic model with two-way communication, CS = Θ(n2).3.3. For multiplying an n × n matrix by an n-vector in the Boolean model with one-way communication, CS = Θ(n2). In contrast, the discrete Fourier transform and sorting can be accomplished in O(n) communication steps and O(log n) space simultaneously, and the search problems of Karchmer and Wigderson associated with any language in NCk can be solved in O(logk n) communication steps and O(logk n) space simultaneously. ER - TY - JOUR T1 - Euler: The master of us all: By William Dunham. Mathematical Association of America. (1999). 185 pages. $29.95 JO - Computers & Mathematics with Applications VL - 38 IS - 1 SP - 126 PY - 1999 DA - 1999/07/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(99)90033-0 UR - https://www.sciencedirect.com/science/article/pii/S0898122199900330 ER - TY - JOUR T1 - Introduction to numerical analysis, Texts in Applied Mathematics 12: Third Edition. By J. Stoer and R. Bulirsch. Translated by R. Bartels, W. Gautschi, and C. Witzgall. Springer, New York. (2002). 744 pages. $69.95 JO - Computers & Mathematics with Applications VL - 46 IS - 2 SP - 509 EP - 510 PY - 2003 DA - 2003/07/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(03)90058-7 UR - https://www.sciencedirect.com/science/article/pii/S0898122103900587 ER - TY - JOUR T1 - A distributed selection algorithm and its expected communication complexity AU - Santoro, Nicola AU - Sidney, Jeffrey B. AU - Sidney, Stuart J. JO - Theoretical Computer Science VL - 100 IS - 1 SP - 185 EP - 204 PY - 1992 DA - 1992/06/22/ SN - 0304-3975 DO - https://doi.org/10.1016/0304-3975(92)90368-P UR - https://www.sciencedirect.com/science/article/pii/030439759290368P AB - We consider the distributed K-selection problem defined as follows: a set S of n elements is distributed among d processors and an originator processor wants to know the value of the Kth smallest element in S. The goal is to obtain an algorithm that minimizes the communication activities among the processors. We propose an algorithm whose expected communication complexity is O(log logn) whereas the worst-case complexity is O(logn); in the point-to-point model, this yields an O(dlog logn) upper bound on the expected number of messages for distributed selection. ER - TY - JOUR T1 - Short communication: Discrimination between retail bovine milks with different fat contents using chemometrics and fatty acid profiling AU - Vargas-Bello-Pérez, Einar AU - Toro-Mujica, Paula AU - Enriquez-Hidalgo, Daniel AU - Fellenberg, María Angélica AU - Gómez-Cortés, Pilar JO - Journal of Dairy Science VL - 100 IS - 6 SP - 4253 EP - 4257 PY - 2017 DA - 2017/06/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2016-12393 UR - https://www.sciencedirect.com/science/article/pii/S0022030217303351 KW - fatty acid composition KW - gas chromatography-flame ionization detection KW - milk KW - principal component analysis AB - ABSTRACT We used a multivariate chemometric approach to differentiate or associate retail bovine milks with different fat contents and non-dairy beverages, using fatty acid profiles and statistical analysis. We collected samples of bovine milk (whole, semi-skim, and skim; n = 62) and non-dairy beverages (n = 27), and we analyzed them using gas-liquid chromatography. Principal component analysis of the fatty acid data yielded 3 significant principal components, which accounted for 72% of the total variance in the data set. Principal component 1 was related to saturated fatty acids (C4:0, C6:0, C8:0, C12:0, C14:0, C17:0, and C18:0) and monounsaturated fatty acids (C14:1 cis-9, C16:1 cis-9, C17:1 cis-9, and C18:1 trans-11); whole milk samples were clearly differentiated from the rest using this principal component. Principal component 2 differentiated semi-skim milk samples by n-3 fatty acid content (C20:3n-3, C20:5n-3, and C22:6n-3). Principal component 3 was related to C18:2 trans-9,trans-12 and C20:4n-6, and its lower scores were observed in skim milk and non-dairy beverages. A cluster analysis yielded 3 groups: group 1 consisted of only whole milk samples, group 2 was represented mainly by semi-skim milks, and group 3 included skim milk and non-dairy beverages. Overall, the present study showed that a multivariate chemometric approach is a useful tool for differentiating or associating retail bovine milks and non-dairy beverages using their fatty acid profile. ER - TY - JOUR T1 - Dynamic load balancing with group communication AU - Dolev, Shlomi AU - Segala, Roberto AU - Shvartsman, Alexander JO - Theoretical Computer Science VL - 369 IS - 1 SP - 348 EP - 360 PY - 2006 DA - 2006/12/15/ SN - 0304-3975 DO - https://doi.org/10.1016/j.tcs.2006.09.020 UR - https://www.sciencedirect.com/science/article/pii/S0304397506006128 KW - Load balancing KW - Scheduling KW - Dynamic networks KW - Group communications AB - This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore new approaches for load balancing in dynamic networks that can be employed by applications using a group communication service (GCS). The GCS that we consider include a membership service (establishing new groups to reflect dynamic changes) but does not include maintenance of a primary component. For the n-processor, n-task load balancing problem defined in this work, the following specific results are obtained. For the case of fully dynamic changes including fragmentation and merges we show that the termination time of any on-line task assignment algorithm is greater than the termination time of an off-line task assignment algorithm by a factor greater than n/12. We present a load balancing algorithm that guarantees completion of all tasks in all fragments caused by partitions with work O(n+f·n) in the presence of f fragmentation failures. We develop an effective scheduling strategy for minimizing the task execution redundancy and we prove that our strategy provides each of the n processors with a schedule of Θ(n1/3) tasks such that at most one task is performed redundantly by any two processors. ER - TY - JOUR T1 - A Secure and Lightweight Authentication Protocol for Mobile User Preserving Privacy in Global Mobility Networks AU - Madhusudhan, R. AU - Suvidha, K.S. JO - Procedia Computer Science VL - 171 SP - 907 EP - 916 PY - 2020 DA - 2020/01/01/ T2 - Third International Conference on Computing and Network Communications (CoCoNet'19) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2020.04.098 UR - https://www.sciencedirect.com/science/article/pii/S1877050920310747 KW - GLOMONET KW - Security KW - Smartcard KW - ECC KW - Timestamp AB - In two factor authentication schemes the key factor that has to be addressed is user anonymity and privacy preservation during roaming scenario in GLObal MObility NETwork. While roaming MU needs to access the services of the FA, FA grants the service request only to the authenticated MU. To verify the authenticity of the MU, FA sends the service request of MU to HA. HA verifies the authenticity of the MU after which FA allows the MU to access the services. The entire communication during roaming is carried over insecure channel. Due to this, several security concerns are raised. The main objective in GLOMONET is to secure the channel and the designed scheme should over come all active and passive security attacks. Since, the scheme is designed for mobile networks, it should be light weight with less communication cost, one such scheme has been proposed in this article. The proposed scheme is light weight with less communication cost. Additionally the proposed scheme addresses the active and passive security attacks. The scheme is efficient in terms of computational and communication cost. The proposed scheme is robust and practically implementable. ER - TY - JOUR T1 - Immunological self-tolerance: Lessons from mathematical modeling AU - Carneiro, Jorge AU - Paixão, Tiago AU - Milutinovic, Dejan AU - Sousa, João AU - Leon, Kalet AU - Gardner, Rui AU - Faro, Jose JO - Journal of Computational and Applied Mathematics VL - 184 IS - 1 SP - 77 EP - 100 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.2004.10.025 UR - https://www.sciencedirect.com/science/article/pii/S0377042705000713 KW - Self-tolerance KW - Tunning KW - Regulatory CD4+CD25+T cells KW - Modeling AB - One of the fundamental properties of the immune system is its capacity to avoid autoimmune diseases. The mechanism underlying this process, known as self-tolerance, is hitherto unresolved but seems to involve the control of clonal expansion of autoreactive lymphocytes. This article reviews mathematical modeling of self-tolerance, addressing two specific hypotheses. The first hypothesis posits that self-tolerance is mediated by tuning of activation thresholds, which makes autoreactive T lymphocytes reversibly “anergic” and unable to proliferate. The second hypothesis posits that the proliferation of autoreactive T lymphocytes is instead controlled by specific regulatory T lymphocytes. Models representing the population dynamics of autoreactive T lymphocytes according to these two hypotheses were derived. For each model we identified how cell density affects tolerance, and predicted the corresponding phase spaces and bifurcations. We show that the simple induction of proliferative anergy, as modeled here, has a density dependence that is only partially compatible with adoptive transfers of tolerance, and that the models of tolerance mediated by specific regulatory T cells are closer to the observations. ER - TY - JOUR T1 - Evolutionary game theory using agent-based methods AU - Adami, Christoph AU - Schossau, Jory AU - Hintze, Arend JO - Physics of Life Reviews VL - 19 SP - 1 EP - 26 PY - 2016 DA - 2016/12/01/ SN - 1571-0645 DO - https://doi.org/10.1016/j.plrev.2016.08.015 UR - https://www.sciencedirect.com/science/article/pii/S1571064516300884 KW - Evolutionary game theory KW - Agent-based modeling AB - Evolutionary game theory is a successful mathematical framework geared towards understanding the selective pressures that affect the evolution of the strategies of agents engaged in interactions with potential conflicts. While a mathematical treatment of the costs and benefits of decisions can predict the optimal strategy in simple settings, more realistic settings such as finite populations, non-vanishing mutations rates, stochastic decisions, communication between agents, and spatial interactions, require agent-based methods where each agent is modeled as an individual, carries its own genes that determine its decisions, and where the evolutionary outcome can only be ascertained by evolving the population of agents forward in time. While highlighting standard mathematical results, we compare those to agent-based methods that can go beyond the limitations of equations and simulate the complexity of heterogeneous populations and an ever-changing set of interactors. We conclude that agent-based methods can predict evolutionary outcomes where purely mathematical treatments cannot tread (for example in the weak selection–strong mutation limit), but that mathematics is crucial to validate the computational simulations. ER - TY - JOUR T1 - Transmission of intra-cellular genetic information: A system proposal AU - Faria, L.C.B. AU - Rocha, A.S.L. AU - Palazzo, R. JO - Journal of Theoretical Biology VL - 358 SP - 208 EP - 231 PY - 2014 DA - 2014/10/07/ SN - 0022-5193 DO - https://doi.org/10.1016/j.jtbi.2014.05.040 UR - https://www.sciencedirect.com/science/article/pii/S0022519314003233 KW - Genetic coding KW - Geometrically uniform codes KW - Cyclic codes over Galois extension rings and DNA sequences AB - One of the great challenges of the scientific community on theories of genetic information, genetic communication and genetic coding is to determine a mathematical structure related to DNA sequences. In this paper we propose a model of an intra-cellular transmission system of genetic information similar to a model of a power and bandwidth efficient digital communication system in order to identify a mathematical structure in DNA sequences where such sequences are biologically relevant. The model of a transmission system of genetic information is concerned with the identification, reproduction and mathematical classification of the nucleotide sequence of single stranded DNA by the genetic encoder. Hence, a genetic encoder is devised where labelings and cyclic codes are established. The establishment of the algebraic structure of the corresponding codes alphabets, mappings, labelings, primitive polynomials (p(x)) and code generator polynomials (g(x)) are quite important in characterizing error-correcting codes subclasses of G-linear codes. These latter codes are useful for the identification, reproduction and mathematical classification of DNA sequences. The characterization of this model may contribute to the development of a methodology that can be applied in mutational analysis and polymorphisms, production of new drugs and genetic improvement, among other things, resulting in the reduction of time and laboratory costs. ER - TY - JOUR T1 - In-Vehicle Augmented Reality Traffic Information System: A New Type of Communication Between Driver and Vehicle AU - Abdi, Lotfi AU - Abdallah, Faten Ben AU - Meddeb, Aref JO - Procedia Computer Science VL - 73 SP - 242 EP - 249 PY - 2015 DA - 2015/01/01/ T2 - International Conference on Advanced Wireless Information and Communication Technologies (AWICT 2015) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2015.12.024 UR - https://www.sciencedirect.com/science/article/pii/S1877050915034857 KW - Augmented Reality KW - Region Of Interest KW - Driving-Safety KW - Head-up Display KW - Camera Calibration KW - Traffic Information KW - OpenCV. AB - In order to improve driving safety and minimize driving workload, the information provided should be represented in such a way that it is more easily understood and imposing less cognitive load onto the driver. Augmented Reality Head-up Display (AR- HUD) can facilitate a new form of dialogue between the vehicle and the driver; and enhance intelligent transportation systems by superimposing surrounding traffic information on the users view and keep drivers view on roads. In this paper, we investigated the potential costs and benefits of using AR cues to improve driving safety as new form of dialog between the vehicle and the driver. We present a new approach for marker-less AR Traffics Signs Recognition system that superimposes augmented virtual objects onto a real scene under all types of driving situations, including unfavorable weather conditions. Our method uses two steps: hypothesis generation and hypothesis verification. In the first step, Region Of Interest (ROI) is extracted using a scanning window with Haar cascade detector and AdaBoost classifier to reduce the computational region in the hypothesis generation step. The second step verifies whether a given candidate and classified into vehicle and non-vehicle classes using edge information and symmetry measurement to verify them. We employ this approach to improve the accuracy of AR traffic information system to assist the driver in various driving situations, increase the driving comfort and reduce traffic accidents. ER - TY - JOUR T1 - Analysis and estimation of direction of arrival for smart antennas by using a novel filtering algorithm AU - Liu, Ying AU - Zhou, Yuanping JO - Procedia Engineering VL - 15 SP - 2593 EP - 2597 PY - 2011 DA - 2011/01/01/ T2 - CEIS 2011 SN - 1877-7058 DO - https://doi.org/10.1016/j.proeng.2011.08.487 UR - https://www.sciencedirect.com/science/article/pii/S1877705811019886 KW - Signal interference KW - direction of arrival KW - smart antenna KW - novel filtering algorithm AB - For solving the main conflict between the direction of arrival for the radio signal and maintaining the signal details in the wireless communication, this paper presents a novel algorithm for improving the radio signal processing. In order to receive the strongest radio wave from the antenna array, the direction estimation for wireless communication is approached under radio electromagnetic spectrum broadband, in which there are the multiple transmitting antennas and the multiple receiving antennas. We construct the focusing matrix for each frequency point, and then we use the uniform linear array to establish a mathematical model to simulate the direction of arrival for the smart antennas. ER - TY - JOUR T1 - Performance Modeling of x-Folded TM Architecture in the Presence of Transpose Traffic AU - Moudi, Mehrnaz AU - Othman, Mohamed AU - Lun, Kweh Yeah AU - Abdul Rahiman, Amir Rizaan JO - Procedia Computer Science VL - 116 SP - 251 EP - 258 PY - 2017 DA - 2017/01/01/ T2 - Discovery and innovation of computer science technology in artificial intelligence era: The 2nd International Conference on Computer Science and Computational Intelligence (ICCSCI 2017) SN - 1877-0509 DO - https://doi.org/10.1016/j.procs.2017.10.043 UR - https://www.sciencedirect.com/science/article/pii/S1877050917320914 KW - Interconnection Network KW - Mathematical Model KW - Architecture KW - TM KW - x-Folded TM KW - Transpose Traffic KW - Delay AB - With the advance of Massively Parallel Computers usage, the interconnect technology overcomes the limitations of communication as a new concept. One of the most significant challenges in this concept is suitable architecture for these networks’ applications. Recently, x-Folded TM architecture was introduced as a desirable design in interconnection networks. The attractive features for x-Folded TM are less number of links and nodes compared with other architectures. This paper proposes a new mathematical model of x-Folded TM architecture to predict the average network delay under the transpose traffic pattern. Besides the mathematical model derivation for x-Folded TM architecture, we discuss the simulation experiment in x-Folded TM using the same assumptions for the purpose of validation. The mathematical results indicate that the average network delay for x-Folded TM architecture is reduced when compared with other topologies under transpose traffic pattern. The implementation of x-Folded TM architecture relies on simulations to evaluate the performance impact of the architecture as well. Consequently, all results yield the superiority of the x-Folded TM performance compared to the other networks. ER - TY - JOUR T1 - Site-specific Protein Dynamics in Communication Pathway from Sensor to Signaling Domain of Oxygen Sensor Protein, HemAT-Bs: TIME-RESOLVED ULTRAVIOLET RESONANCE RAMAN STUDY* AU - El-Mashtoly, Samir F. AU - Kubo, Minoru AU - Gu, Yuzong AU - Sawai, Hitomi AU - Nakashima, Satoru AU - Ogura, Takashi AU - Aono, Shigetoshi AU - Kitagawa, Teizo JO - Journal of Biological Chemistry VL - 287 IS - 24 SP - 19973 EP - 19984 PY - 2012 DA - 2012/06/08/ SN - 0021-9258 DO - https://doi.org/10.1074/jbc.M112.357855 UR - https://www.sciencedirect.com/science/article/pii/S0021925820498680 KW - Heme KW - Raman Spectroscopy KW - Signal Transduction KW - Spectroscopy KW - UV Spectroscopy KW - Gas Sensor Proteins KW - Oxygen Sensor KW - Protein Dynamics KW - Time-resolved Resonance Raman AB - HemAT-Bs is a heme-based signal transducer protein responsible for aerotaxis. Time-resolved ultraviolet resonance Raman (UVRR) studies of wild-type and Y70F mutant of the full-length HemAT-Bs and the truncated sensor domain were performed to determine the site-specific protein dynamics following carbon monoxide (CO) photodissociation. The UVRR spectra indicated two phases of intensity changes for Trp, Tyr, and Phe bands of both full-length and sensor domain proteins. The W16 and W3 Raman bands of Trp, the F8a band of Phe, and the Y8a band of Tyr increased in intensity at hundreds of nanoseconds after CO photodissociation, and this was followed by recovery in ∼50 μs. These changes were assigned to Trp-132 (G-helix), Tyr-70 (B-helix), and Phe-69 (B-helix) and/or Phe-137 (G-helix), suggesting that the change in the heme structure drives the displacement of B- and G-helices. The UVRR difference spectra of the sensor domain displayed a positive peak for amide I in hundreds of nanoseconds after photolysis, which was followed by recovery in ∼50 μs. This difference band was absent in the spectra of the full-length protein, suggesting that the isolated sensor domain undergoes conformational changes of the protein backbone upon CO photolysis and that the changes are restrained by the signaling domain. The time-resolved difference spectrum at 200 μs exhibited a pattern similar to that of the static (reduced − CO) difference spectrum, although the peak intensities were much weaker. Thus, the rearrangements of the protein moiety toward the equilibrium ligand-free structure occur in a time range of hundreds of microseconds. ER - TY - JOUR T1 - Layered tropical mathematics AU - Izhakian, Zur AU - Knebusch, Manfred AU - Rowen, Louis JO - Journal of Algebra VL - 416 SP - 200 EP - 273 PY - 2014 DA - 2014/10/15/ SN - 0021-8693 DO - https://doi.org/10.1016/j.jalgebra.2014.05.019 UR - https://www.sciencedirect.com/science/article/pii/S0021869314002877 KW - Tropical algebra KW - Layered supertropical domains KW - Polynomial semiring KW - Resultant KW - Sylvester matrix KW - Discriminant KW - Layered derivatives AB - Generalizing supertropical algebras, we present a “layered” structure, “sorted” by a semiring which permits varying ghost layers, and indicate how it is more amenable than the “standard” supertropical construction in factorizations of polynomials, description of varieties, and for mathematical analysis and calculus, in particular with respect to multiple roots of polynomials. This gives rise to a significantly better understanding of the tropical resultant and discriminant. Explicit examples and comparisons are given for various sorting semirings such as the natural numbers and the positive rational numbers, and we see how this theory relates to some recent developments in the tropical literature. ER - TY - JOUR T1 - Comparison of intelligent transportation systems based on biocybernetic vehicle control systems AU - Lieberman, Irina AU - Klachek, Pavel AU - Korjagin, Sergei JO - Transportation Research Procedia VL - 50 SP - 355 EP - 362 PY - 2020 DA - 2020/01/01/ T2 - XIV International Conference on Organization and Traffic Safety Management in Large Cities (OTS-2020) SN - 2352-1465 DO - https://doi.org/10.1016/j.trpro.2020.10.042 UR - https://www.sciencedirect.com/science/article/pii/S2352146520307900 KW - intelligent transportation system KW - artificial intelligence vehicle KW - biocybernetic control system KW - sensor network KW - traffic safety KW - control module AB - Prompt thinking and quick reaction in complex dynamically changing traffic situations are determinant factors of road accidents. A key part of modern and promising intelligent transportation systems (ITSs) can be represented by VANET vehicular ad hoc network and its equivalents, whose nodes are represented by vehicles with installed special communication modules and new-generation intelligent on-board control systems. A concept of VANET network development is presented, which is based on biocybernetic systems of vehicle control and can serve as a starting point for building conceptually new ITSs and allow solving the primary ITS task at a totally new level, which lies in obtaining optimal prompt decisions (when driving a vehicle) in a short period of time, during which neither human no automated system can make a safe decision. We consider the architecture and basics of creating an intelligent on-board information-and-control module of a vehicle, based on the integration of a biocybernetic human-machine interface and elements of VANET vehicular ad hoc network. We also consider the basics of creating a bank of mathematical models as a central element of the intelligent on-board information-and-control module. Based on the analysis of completed experiments, we can conclude that the use of biocybernetic approaches based on sensor networks and corresponding applied vehicle control systems helps solving crucial traffic safety issues, namely: obtaining optimal prompt decisions (when driving a vehicle) in a short period of time, which significantly improves traffic safety and increases traffic intensity. ER - TY - JOUR T1 - A mathematical basis for egress complexity AU - Donegan, H.A. AU - Pollock, A.J. JO - Applied Mathematics Letters VL - 9 IS - 2 SP - 75 EP - 80 PY - 1996 DA - 1996/03/01/ SN - 0893-9659 DO - https://doi.org/10.1016/0893-9659(96)00016-X UR - https://www.sciencedirect.com/science/article/pii/089396599600016X KW - Building KW - Complexity KW - Egress KW - Entropy KW - Fire safety KW - Graph KW - Network AB - This paper demonstrates how a building, expressed as a well-defined structure of nodes and edges, can be shown to possess a latent complexity measure with respect to egress. The mathematical formulation, based on the notion of Shannon entropy, is underpinned by results from graph theory. The method of calculating egress complexity, its use in comparing buildings, and its application to the positioning of additional exits is discussed. ER - TY - JOUR T1 - Wednesday, 7 September 2016 - AWDC 2016 – ABSTRACT BOOK - FREE COMMUNICATION SESSIONS 01–18 POSTER SESSIONS 01–20 AU - World Dental Federation, FDI JO - International Dental Journal VL - 66 SP - 2 EP - 56 PY - 2016 DA - 2016/09/01/ T2 - Abstracts of the 104th, FDI Annual World Dental Congress, September 2016 SN - 0020-6539 DO - https://doi.org/10.1111/idj.12266 UR - https://www.sciencedirect.com/science/article/pii/S0020653920315513 ER - TY - JOUR T1 - Selecting the Optimal Software Solution under Conditions of Uncertainty AU - Aldea, Cosmina Carmen AU - Olariu, Cristian JO - Procedia - Social and Behavioral Sciences VL - 109 SP - 333 EP - 337 PY - 2014 DA - 2014/01/08/ T2 - 2nd World Conference on Business, Economics and Management SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2013.12.467 UR - https://www.sciencedirect.com/science/article/pii/S1877042813050994 KW - Virtual team KW - software tool KW - collaboration KW - Laplace's criterion AB - During the past decade, to a greater extent, companies undertake projects with virtual teams - teams composed of temporary employees from different parts of the world, relying heavily on virtual communication. The aim of this paper is to show a mathematical model of decision-making under conditions of uncertainty using the Laplace's criterion for choosing the right software solution for virtual teams. To do this, the following software solutions were analyzed: Any Meeting, Caltech's EVO, Live Meeting and Skype Free. Even it was mathematically demonstrated that certain software programs are the optimal solutions for defining the collaborative environment of virtual teams, in practice there have to be consider other specific conditions and/or requirements. ER - TY - JOUR T1 - Some hierarchies for the communication complexity measures of cooperating grammar systems AU - Hromkovič, Juraj AU - Kari, Jarkko AU - Kari, Lila JO - Theoretical Computer Science VL - 127 IS - 1 SP - 123 EP - 147 PY - 1994 DA - 1994/05/09/ SN - 0304-3975 DO - https://doi.org/10.1016/0304-3975(94)90103-1 UR - https://www.sciencedirect.com/science/article/pii/0304397594901031 AB - We investigate here the descriptional and the computational complexity of parallel communicating grammar systems (PCGS). A new descriptional complexity measure — the communication structure of the PCGS is introduced and related to the communication complexity (the number of communications). Several hierarchies resulting from these complexity measures and some relations between the measures are established. The results are obtained due to the development of two lower-bound proof techniques for PCGS. The first one is a generalization of pumping lemmas from formal language theory and the second one reduces the lower-bound problem for some PCGS to the proof of lower bounds on the number of reversals of certain sequential computing models. ER - TY - JOUR T1 - Friday, 1 September 2017 - Free Communication Sessions 73-96 and Poster Sessions 68–81 AU - World Dental Federation, FDI JO - International Dental Journal VL - 67 SP - 199 EP - 247 PY - 2017 DA - 2017/09/01/ T2 - Abstracts of the 105th, FDI World Dental Congress, September 2017 SN - 0020-6539 DO - https://doi.org/10.1111/idj.12341 UR - https://www.sciencedirect.com/science/article/pii/S0020653920317652 ER - TY - JOUR T1 - Multiplicative circulant networks topological properties and communication algorithms AU - Stojmenović, Ivan JO - Discrete Applied Mathematics VL - 77 IS - 3 SP - 281 EP - 305 PY - 1997 DA - 1997/08/22/ SN - 0166-218X DO - https://doi.org/10.1016/S0166-218X(96)00138-2 UR - https://www.sciencedirect.com/science/article/pii/S0166218X96001382 KW - Computer architecture KW - Radix representation KW - Interconnection topology KW - Routing KW - Broadcasting KW - Deadlock avoidance KW - Circulant graphs KW - Mesh connected computer AB - In this paper we study an interconnection network topology based on the radix representation of integers and modulo arithmetic. The multiplicative circulant graph MC(r, k) consists of n = rk vertices. Two vertices x and y are connected by an edge if and only if ¦x − y¦= ri mod n for some integer i, 0 ⩽ i ⩽ k − 1. Multiplicative circulant graphs can be considered as a kind of “twisted” torus graphs. We prove that for even r > 2 the diameter of the MC(r, k) network is kr2 − ⌊K2⌋ which is smaller than the diameter of the corresponding torus. We also determine the average distance in the MC(r, k) graphs. The multiplicative circulant graphs are vertex symmetric and have Hamiltonian cycles, one of them being 0, 1, …, n − 1. The MC(r, k) graph can be recursively decomposed into r MC(r, k − 1) graphs and the later Hamiltonian cycle. Hypercubes and complete binary trees are embedded in MC(2, k) graphs with dilation and expansion 1. A (pk)-dimensional hypercube can be embedded into MC(2p, k) graph with expansion 1 and dilation 2p-1. Multiplicative circulant graphs have simple optimal routing and broadcasting algorithms. These algorithms are deadlock free for r = 2 and r = 3. A simple parallel semigroup and prefix computation algorithm for the multiplicative circulant networks are described. ER - TY - JOUR T1 - Mathematical Model of the Spatio-Temporal Dynamics of Second Messengers in Visual Transduction AU - Andreucci, D. AU - Bisegna, P. AU - Caruso, G. AU - Hamm, H.E. AU - DiBenedetto, E. JO - Biophysical Journal VL - 85 IS - 3 SP - 1358 EP - 1376 PY - 2003 DA - 2003/09/01/ SN - 0006-3495 DO - https://doi.org/10.1016/S0006-3495(03)74570-6 UR - https://www.sciencedirect.com/science/article/pii/S0006349503745706 AB - A model describing the role of transversal and longitudinal diffusion of cGMP and Ca2+ in signaling in the rod outer segment of vertebrates is developed. Utilizing a novel notion of surface-volume reaction and the mathematical theories of homogenization and concentrated capacity, the diffusion of cGMP and Ca2+ in the interdiscal spaces is shown to be reducible to a one-parameter family of diffusion processes taking place on a single rod cross section; whereas the diffusion in the outer shell is shown to be reducible to a diffusion on a cylindrical surface. Moreover, the exterior flux of the former serves as a source term for the latter, alleviating the assumption of a well-stirred cytosol. A previous model of visual transduction that assumes a well-stirred rod outer segment cytosol (and thus contains no spatial information) can be recovered from this model by imposing a “bulk” assumption. The model shows that upon activation of a single rhodopsin, cGMP changes are local, and exhibit both a longitudinal and a transversal component. Consequently, membrane current is also highly localized. The spatial spread of the single photon response along the longitudinal axis of the outer segment is predicted to be 3–5μm, consistent with experimental data. This approach represents a tool to analyze pointwise signaling dynamics without requiring averaging over the entire cell by global Michaelis-Menten kinetics. ER - TY - JOUR T1 - Building synthetic multicellular systems using bottom–up approaches AU - Gonzales, David T. AU - Zechner, Christoph AU - Tang, T.-Y. Dora JO - Current Opinion in Systems Biology VL - 24 SP - 56 EP - 63 PY - 2020 DA - 2020/12/01/ T2 - Systems immunology & host-pathogen interaction (2020) SN - 2452-3100 DO - https://doi.org/10.1016/j.coisb.2020.10.005 UR - https://www.sciencedirect.com/science/article/pii/S2452310020300470 KW - Bottom-up synthetic biology KW - Multicellular systems KW - Synthetic cells KW - Intercellular communication KW - Feedback loops KW - Spatial localization KW - Microfluidics KW - 3D printing AB - A grand challenge in bottom–up synthetic biology is the design and construction of synthetic multicellular systems using nonliving molecular components. Abstracting key features of compartmentalisation, reaction and diffusion, and communication provides the blueprint for assembling synthetic multiscale systems with emergent properties. The diverse range of chemistries for building encapsulated reactions in micron-sized compartments offers combinatorial flexibility and modularity in building synthetic multicellular systems with molecular-level control. Here, we focus on recent advances in the emerging area of bottom–up approaches to create biologically inspired multicellular systems. Specifically, we consider how intercellular communication and feedback loops can be integrated into populations of synthetic cells and summarise recent developments for the 2D/3D spatial localisation of microcompartments. Although building bottom–up multicellular systems is still in its infancy, progress in this field offers tractable models to understand the minimal requirements for generating multiscale systems from the molecular level for fundamental research and innovative technological applications. ER - TY - JOUR T1 - Short communication: Variations in major mineral contents of Mediterranean buffalo milk and application of Fourier-transform infrared spectroscopy for their prediction AU - Stocco, G. AU - Cipolat-Gotet, C. AU - Bonfatti, V. AU - Schiavon, S. AU - Bittante, G. AU - Cecchinato, A. JO - Journal of Dairy Science VL - 99 IS - 11 SP - 8680 EP - 8686 PY - 2016 DA - 2016/11/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2016-11303 UR - https://www.sciencedirect.com/science/article/pii/S002203021630618X KW - buffalo milk KW - mineral content KW - Fourier-transform infrared spectroscopy AB - The aims of this study were (1) to assess variability in the major mineral components of buffalo milk, (2) to estimate the effect of certain environmental sources of variation on the major minerals during lactation, and (3) to investigate the possibility of using Fourier-transform infrared (FTIR) spectroscopy as an indirect, noninvasive tool for routine prediction of the mineral content of buffalo milk. A total of 173 buffaloes reared in 5 herds were sampled once during the morning milking. Milk samples were analyzed for Ca, P, K, and Mg contents within 3h of sample collection using inductively coupled plasma optical emission spectrometry. A Milkoscan FT2 (Foss, Hillerød, Denmark) was used to acquire milk spectra over the spectral range from 5,000 to 900 wavenumber/cm. Prediction models were built using a partial least square approach, and cross-validation was used to assess the prediction accuracy of FTIR. Prediction models were validated using a 4-fold random cross-validation, thus dividing the calibration-test set in 4 folds, using one of them to check the results (prediction models) and the remaining 3 to develop the calibration models. Buffalo milk minerals averaged 162, 117, 86, and 14.4mg/dL of milk for Ca, P, K, and Mg, respectively. Herd and days in milk were the most important sources of variation in the traits investigated. Parity slightly affected only Ca content. Coefficients of determination of cross-validation between the FTIR-predicted and the measured values were 0.71, 0.70, and 0.72 for Ca, Mg, and P, respectively, whereas prediction accuracy was lower for K (0.55). Our findings reveal FTIR to be an unsuitable tool when milk mineral content needs to be predicted with high accuracy. Predictions may play a role as indicator traits in selective breeding (if the additive genetic correlation between FTIR predictions and measures of milk minerals is high enough) or in monitoring the milk of buffalo populations for dairy industry purposes. ER - TY - JOUR T1 - Communication-efficient three-party protocols for authentication and key agreement AU - Lee, Tian-Fu AU - Liu, Jenn-Long AU - Sung, Mei-Jiun AU - Yang, Shiueng-Bien AU - Chen, Chia-Mei JO - Computers & Mathematics with Applications VL - 58 IS - 4 SP - 641 EP - 648 PY - 2009 DA - 2009/08/01/ SN - 0898-1221 DO - https://doi.org/10.1016/j.camwa.2009.02.039 UR - https://www.sciencedirect.com/science/article/pii/S0898122109003757 KW - Authentication KW - Key agreement KW - EKE KW - Network communication KW - Diffie–Hellman AB - Encrypted key exchange (EKE) authentication approaches are very important for secure communicating over public networks. In order to solve the security weaknesses three-party EKE, Yeh et al. [H.T. Yeh, H.M. Sun, T. Hwang, Efficient three-party authentication and key agreement protocols resistant to password guessing attacks, Information Science and Engineering 19 (6) (2003) 1059–1070.] proposed two secure and efficient three-party EKE protocols. Based on the protocol developed by Yeh et al., two improved EKE protocols for authentication and key agreement are proposed in this study. The computational costs of the proposed protocols are the same as those of the protocols of Yeh et al. However, the numbers of messages in the communication are fewer than those of the protocols of Yeh et al. Furthermore, the round efficient versions of our proposed protocols are also described. ER - TY - JOUR T1 - Methodological conceptualization of mathematical modelling AU - Carrera, Jorge JO - Mathematical and Computer Modelling VL - 16 IS - 12 SP - 19 EP - 28 PY - 1992 DA - 1992/12/01/ SN - 0895-7177 DO - https://doi.org/10.1016/0895-7177(92)90015-D UR - https://www.sciencedirect.com/science/article/pii/089571779290015D AB - The experience of the author and colleges, as mathematicians working in interdisciplinary groups, have shown the necessity to make the process of mathematical modelling more precise and to establish its different phases. In this way, the specific role of the mathematician in working teams can be better understood by the other members of the team and his or her specific capabilities can be used more efficiently. The proposed structuration of the mathematical modelling process is resumed in a following diagram, especially when computational schemes are the desired result (see Figure 1). The discussion tends to delineate a concept of modelling from a standpoint where the difference between mathematics as a language and mathematics as a science, having its own dynamic and semantics, plays a fundamental role. ER - TY - JOUR T1 - A secure communication over wireless environments by using a data connection core AU - Huang, Yi-Li AU - Leu, Fang-Yie AU - Wei, Ko-Chung JO - Mathematical and Computer Modelling VL - 58 IS - 5 SP - 1459 EP - 1474 PY - 2013 DA - 2013/09/01/ T2 - The Measurement of Undesirable Outputs: Models Development and Empirical Analyses and Advances in mobile, ubiquitous and cognitive computing SN - 0895-7177 DO - https://doi.org/10.1016/j.mcm.2012.11.022 UR - https://www.sciencedirect.com/science/article/pii/S0895717712003330 KW - Wi-Fi KW - 3G KW - Data connection core KW - Internal key KW - Pseudo random number generator KW - Two-dimensional stream cipher AB - Recently, wireless networks, such as Wi-Fi and 3G, have been widely equipped and popularly used in the world. People holding smart devices can conveniently access the Internet services through modern wireless networks. However, when people are enjoying using wireless systems, network security has been a crucial challenge because wireless messages, encrypted or unencrypted, may be maliciously intercepted by hackers. After analyzing and/or decrypting the messages, hackers can illegally capture or steal important information, such as credit card numbers or usernames/passwords, carried in the messages. Currently, SSL and IPsec are utilized to protect the delivery of these types of information. However, each of the two security protocols has its own drawbacks both in their key exchange and message encryption/decryption processes. To solve these drawbacks, in this paper, we propose a secure communication system, named the Wireless Security System with Data Connection Core (WiSDC for short), which consists of two security schemes, including a symmetric key exchange process and a two-dimensional stream cipher mechanism. The former employs random numbers and the connection keys contained in the Data Connection Core (the DCC for short) to generate internal keys, through which the security level of the key exchange process can be enhanced. Here, the DCC is a set of random numbers created when the underlying user registers himself/herself with the wireless system being considered, and the random numbers are only known to the user and AAA server of the wireless system. The latter invokes two operators, including exclusive-or⊕ and binary adder +2 operators, and two Pseudo Random Number Sequences (PRNSs) to encrypt plaintext so as to well protect the ciphertext. The WiSDC also adopts a pseudo random number generator, which feeds back keys in current stage as a part of the inputs of the next stage, to generate more complicated keys for data encryption. Experimental results show that the WiSDC can effectively protect transmitted messages for wireless environments. The analytical results indicate that the WiSDC has higher security level and execution efficiency than those of the SSL and IPsec. ER - TY - JOUR T1 - PMS72 INTERACTIVE ELECTRONIC INTERFACES (IEI): BRIDGING THE COMMUNICATION GAP BY TRANSLATING ECONOMIC ANALYSIS RESULTS TO DECISION-MAKERS EVERYDAY PRACTICE AU - Marinho, M AU - Schiola, A AU - Pimentel, A AU - Santoni, N AU - Teich, V AU - Clark, LGO JO - Value in Health VL - 13 IS - 7 SP - A316 EP - A317 PY - 2010 DA - 2010/11/01/ SN - 1098-3015 DO - https://doi.org/10.1016/S1098-3015(11)72225-2 UR - https://www.sciencedirect.com/science/article/pii/S1098301511722252 ER - TY - JOUR T1 - Students’ Preferences of Communication Tools for Group Projects in a Computer-supported Collaborative Learning Environment: A Survey AU - Arkilic, I. Guven AU - Peker, Serhat AU - Uyar, M. Erhan JO - Procedia - Social and Behavioral Sciences VL - 83 SP - 1121 EP - 1125 PY - 2013 DA - 2013/07/04/ T2 - 2nd World Conference on Educational Technology Research SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2013.06.214 UR - https://www.sciencedirect.com/science/article/pii/S1877042813012810 KW - Collaborative learning KW - computer supported collaborative learning KW - CSCL KW - virtual communication tools. AB - The role and importance of information technology and computers cannot be ignored due to their extensive usages in different application areas. Along with easier access to the Internet and computers, education has become one of the foremost areas benefiting from this progress. Minimizing geographical barriers and facilitating knowledge sharing between people are some of the outcomes of this progress. Because of the advances in information technology, needs for minimizing geographical barriers and facilitating knowledge sharing, computer-supported collaborative learning (CSCL) has emerged. In this study, types of communication tools used by students to share their knowledge during their group projects were analyzed (excluding the e-mail service) in terms of preference. A survey containing questions about demographic information and preferences of communication tools used by students during their group projects was conducted to a reasonable number of students and results are presented in this study. ER - TY - JOUR T1 - Immunodominance in TCD8+ Responses to Viruses: Cell Biology, Cellular Immunology, and Mathematical Models AU - Yewdell, Jonathan W. AU - Del Val, Margarita JO - Immunity VL - 21 IS - 2 SP - 149 EP - 153 PY - 2004 DA - 2004/08/01/ SN - 1074-7613 DO - https://doi.org/10.1016/j.immuni.2004.06.015 UR - https://www.sciencedirect.com/science/article/pii/S107476130400202X AB - Highlights from a Fundación Juan March Interdisciplinary Meeting. CD8+ T cells (TCD8+) play a critical role in immunity to viruses. A central feature of antiviral TCD8+ responses is immunodominance: out of thousands of potential target peptides, only a handful generate measurable responses. A recent Fundación Juan March Meeting brought together scientists working on the various steps in antigen presentation and T cell biology that contribute to immunodominance, whose understanding is key to rationally developing vaccines meant to elicit effective antiviral TCD8+ responses. ER - TY - JOUR T1 - Short communication: Characteristics of student success in an undergraduate physiology and anatomy course AU - Gwazdauskas, F.C. AU - McGilliard, M.L. AU - Corl, B.A. JO - Journal of Dairy Science VL - 97 IS - 10 SP - 6378 EP - 6381 PY - 2014 DA - 2014/10/01/ SN - 0022-0302 DO - https://doi.org/10.3168/jds.2013-7826 UR - https://www.sciencedirect.com/science/article/pii/S0022030214005165 KW - student success KW - physiology KW - anatomy KW - undergraduate AB - Several factors affect the success of students in college classes. The objective of this research was to determine what factors affect success of undergraduate students in an anatomy and physiology class. Data were collected from 602 students enrolled in the Agriculture and Life Sciences (ALS) 2304 Animal Physiology and Anatomy course from 2005 through 2012. The data set included 476 females (79.1%) and 126 males (20.9%). Time to complete exams was recorded for each student. For statistical analyses, students’ majors were animal and poultry sciences (APSC), agricultural sciences, biochemistry, biological sciences, dairy science, and “other,” which combined all other majors. All analyses were completed using the GLIMMIX procedure of SAS (SAS Institute Inc., Cary, NC). Gender, major, matriculation year, major by year interaction, gender by year interaction, and time to complete the exam affected final course grade. The significant gender effect was manifested in the final grade percentage of 75.9±0.4 for female students compared with 72.3±0.6 for male students. Junior males had final course grades comparable with those of females, but sophomore and senior males had lower final course grades than other combinations. Biology majors had a final grade of 82.4±0.6 and this grade was greater than all other majors. Students classified as “other” had a final score of 74.4±0.8, which was greater than agricultural science majors (69.5±0.9). The APSC grade (72.6±0.5) was higher than the agricultural science majors. Junior students had significantly greater final grades (76.1±0.5) than sophomores (73.3±0.6) and seniors (72.9±0.9). All biology students had greater final grades than all other majors, but biochemistry juniors had greater final course grades than APSC, agricultural science, and dairy science juniors. “Other” seniors had greater final course grades than agricultural science seniors. The regression for time to complete the exam was curvilinear and suggests that highest exam scores were at about 90-min completion time. It may be that some male students need better preparation for anatomy and physiology and their educational preparation should mimic that of female students more in terms of advance-placement biology in high school. These results suggest that biology majors might be better prepared for animal anatomy and physiology than other students. ER - TY - JOUR T1 - Principles of applied mathematics: Transformation and approximation: Revised edition. By James P. Keener. Perseus Books, Cambridge, MA. (2000). 603 pages. $60.00 JO - Computers & Mathematics with Applications VL - 40 IS - 2 SP - 420 PY - 2000 DA - 2000/07/01/ SN - 0898-1221 DO - https://doi.org/10.1016/S0898-1221(00)90221-9 UR - https://www.sciencedirect.com/science/article/pii/S0898122100902219 ER - TY - JOUR T1 - Psychological and Social Motivations to the Purchase of Technological Goods: Fuzzy Mathematical Models of Interpretation AU - Maturo, Antonio AU - Rosiello, Maria Grazia JO - Procedia - Social and Behavioral Sciences VL - 84 SP - 1845 EP - 1849 PY - 2013 DA - 2013/07/09/ T2 - The 3rd World Conference on Psychology, Counseling and Guidance, WCPCG-2012 SN - 1877-0428 DO - https://doi.org/10.1016/j.sbspro.2013.07.045 UR - https://www.sciencedirect.com/science/article/pii/S1877042813019174 KW - Motivation to purchase KW - Fuzzy models KW - Fuzzy operations KW - Fuzzy classification. AB - The paper is based on an empirical research on the behavior of customers who decide on the purchase of mobile phones or smart phone in retail outlets in the provinces of Pescara and Chieti. The phones are divided into classes depending on the type of performance and psychological and social aspects satisfied by those typologies. The results of empirical research are compare d with some possible theoretical models. The aims of the research are multiple: one is to get to the elaboration of formal models that simulate the procedures of choice, the other is to grasp the impact of the social environment and personality of the customer in the process of assessing the utilities and the aggregation criteria. In particular, the assessments do not lead, in general, pure numbers, it appears more appropriate to use fuzzy numbers. Moreover, the aggregations are generally not purely additive, but they follow rules represented, at least in many respects, with fuzzy operations. ER - TY - JOUR T1 - Knowledge and communication: A first-order theory AU - Davis, Ernest JO - Artificial Intelligence VL - 166 IS - 1 SP - 81 EP - 139 PY - 2005 DA - 2005/08/01/ SN - 0004-3702 DO - https://doi.org/10.1016/j.artint.2005.05.002 UR - https://www.sciencedirect.com/science/article/pii/S0004370205000767 KW - Communication KW - Knowledge KW - Logic KW - Paradox AB - This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of events, including other communicative acts; and the knowledge states of any agent—speaker, hearer, or third parties—any of these in the past, present, or future—and any logical combination of these, including formulas with quantifiers. We prove that this theory is consistent, and compatible with a wide range of physical theories. We examine how the theory avoids two potential paradoxes, and discuss how these paradoxes may pose a danger when this theory are extended. ER - TY - JOUR T1 - A computational modelling of micro strip patch antenna and its solution by RDTM AU - Chaurasia, R.K. AU - Mathur, Vishal AU - Pareekh, R.L. AU - Tamsir, Mohammad AU - Srivastava, Vineet K. JO - Alexandria Engineering Journal VL - 57 IS - 3 SP - 1877 EP - 1881 PY - 2018 DA - 2018/09/01/ SN - 1110-0168 DO - https://doi.org/10.1016/j.aej.2017.03.040 UR - https://www.sciencedirect.com/science/article/pii/S1110016817301333 KW - Micro strip KW - RDTM KW - Exact solution KW - Impedance AB - This paper concerns with the modelling of a micro strip antenna with strip line feeding technique formulated using Ohm’s law. A partial differential equation is obtained from the model which is solved using “Reduced Differential Transformation Method (RDTM)”. A couple of numerical examples are considered to check the accuracy, efficiency and convergence of the method. The present method is a very powerful mathematical tool for solving wide range of problems arising in circuit theory, RF field, and science and communication system fields. ER -