Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.

Weighted and two-stage least squares estimation of semiparametric truncated regression models

This paper provides a root-n consistent, asymptotically normal weighted least squares estimator of the coefficients in a truncated regression model. The distribution of the errors is unknown and permits general forms of unknown heteroskedasticity. Also provided is an instrumental variables based two-stage least squares estimator for this model, which can be used when some regressors are endogenous, mismeasured, or otherwise correlated with the errors. A simulation study indicates that the new estimators perform well in finite samples. Our limiting distribution theory includes a new asymptotic trimming result addressing the boundary bias in first-stage density estimation without knowledge of the support boundary. © 2007 Cambridge University Press.

Iterative inversion of experimental data in weighted spaces

We present iterative algorithms for solving linear inverse problems with discrete data and compare their performances with the method of singular function expansion, in view of applications in optical imaging and particle sizing.

The Use of Singular Systems and other Inversion Methods in Weighted L2- spaces

info:eu-repo/semantics/published

El análisis de manuales en la enseñanza de la integral definida

Este trabajo realiza, en primer lugar, un estudio de manuales de primero y segundo de Bachillerato-LOGSE, respecto al concepto de integral definida, exponiendo las cuatro dimensiones que se han considerado y un ejemplo de aplicación a un manual de 2º de Bachillerato. En la segunda parte, se hace un estudio comparativo entre los nueve manuales realizados, más representativos de Jaén y provincia, centrándonos en los significados institucionales históricos y en los conflictos semióticos.

La integral definida en bachillerato: restricciones institucionales de las Pruebas de Acceso a la Universidad

En este trabajo se aportan los resultados de una investigación, realizada con cuatro grupos de estudiantes de segundo de bachillerato de la Comunidad Autónoma Andaluza, sobre la incidencia de las pruebas de acceso a la universidad (PAU) en los significados de la integral definida, en cuanto a los posibles sesgos producidos. En primer lugar se detectan los significados de referencia que se comparan posteriormente con los obtenidos en las PAU, después se analiza el significado implementado en el aula. Por último, se dan algunas implicaciones para la enseñanza de la integral definida.

Cálculo diferencial e integral e tecnologias digitais: perspectivas de exploração no sofware GeoGebra

A ênfase algébrica dada ao longo do tempo nos cursos de Cálculo Diferencial e Integral não oportunizou que tratamentos gráficos e numéricos fossem privilegiados, visto a ausência de softwares que possibilitassem uma abordagem diferenciada aos conceitos inerentes a esta disciplina (Richit, 2010, Guimarães, 2001). Contudo, iniciativas no mundo inteiro têm dedicado esforços e desenvolvido softwares que possibilitam explorações qualitativamente diferentes para conceitos de Cálculo a partir de representações gráficas, numéricas ou algébricas envolvendo visualização, a simulação, o aprofundamento do pensamento matemático, conjecturas e validações, etc. Deste modo, a incorporação das tecnologias digitais na aula de Cálculo remove um pouco o fardo da manipulação algébrica, possibilitando a transição entre a ação física (interação do estudante com a tecnologia) e a representação matemática de um conceito. Assim, a proposta de oficina aqui apresentada objetiva explorar conceitos de Cálculo (Funções, Limites, Derivadas e Integrais) em uma perspectiva de investigação com o software GeoGebra.

La significación física de la integral a partir de la modelación de fenómenos

Una pregunta que me plantean con mucha frecuencia los estudiantes es ¿qué significado tiene la integral?; con este trabajo pretendemos incursionar en la problemática referida a la formación de la significación física de la integral, para lograrlo partimos de la idea de que esa significación tiene que ver por un lado con las concepciones matemáticas “heredadas” por los profesores a sus alumnos y por otro con los procesos de matematización de fenómenos en diversos contextos. Hemos realizado un primer acercamiento exploratorio para recoger evidencias, que nos permita elaborar una secuencia basada en prácticas de modelación de fenómenos. Reportamos como es construida la significación física de la integral en el discurso. Un resultado consecuente, es una aproximación a la concepción de práctica social.

¿Qué pintan un motor y una botella en el cálculo integral? Curso corto de didáctica

Se pretende crear un marco de resolución de problemas que sea motivador para los alumnos del último año de Bachillerato o del primer año de estudios en la Universidad, y para ello se presentan cuatro problemas reales, cuya solución requiere establecer el concepto de integral definida, y uno histórico, que fue propuesto y resuelto por Arquímedes. Asimismo, en el desarrollo del curso se verá la importancia del uso de herramientas didácticas, tales como el generador de volúmenes de revolución, que se construirá en el propio curso, y el ordenador, cuyo uso será absolutamente necesario para resolver los problemas planteados. En suma, además de promover adaptaciones curriculares adecuadas, se fijan estos tres objetivos fundamentales: Cómo se crea un marco de resolución de problemas y cómo se integran herramientas didácticas apropiadas.

El aprendizaje del concepto de integral

El propósito de este artículo es presentar una propuesta didáctica de la integral definida para la educación secundaria obligatoria y bachillerato a través de unas secuencias de aprendizaje que ayuden al estudiante a captar las ideas fundamentales del cálculo integral, del concepto de integral y del proceso de integración.

Para qué tantas hipótesis en el criterio de la integral

Se repasa el planteo tradicional del criterio de la integral para la convergencia de series (con las hipótesis de que la función en cuestión sea continua, positiva y decreciente, y la conclusión de que la serie y la integral impropia convergen ambas o divergen ambas). Se muestran ejemplos en los que fallan una o más de las hipótesis y la conclusión del criterio falla. Se demuestra que son innecesarias las hipótesis de continuidad y positividad, y finalmente que basta con una condición aún más débil que la de que la función sea decreciente. Los resultados se aplican tanto a la equivalencia entre la convergencia de la serie y la convergencia de la integral impropia como a la fórmula para la cota del error en las sumas parciales cuando la serie converge.

Minimizing total weighted completion time in a proportionate flow shop

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time. © 1998 John Wiley & Sons, Ltd.

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.

Probabilistic approach in weighted Markov branching processes

This note provides a new probabilistic approach in discussing the weighted Markov branching process (WMBP) which is a natural generalisation of the ordinary Markov branching process. Using this approach, some important characteristics regarding the hitting times of such processes can be easily obtained. In particular, the closed forms for the mean extinction time and conditional mean extinction time are presented. The explosion behaviour of the process is investigated and the mean explosion time is derived. The mean global holding time and the mean total survival time are also obtained. The close link between these newly developed processes and the well-known compound Poisson processes is investigated. It is revealed that any weighted Markov branching process (WMBP) is a random time change of a compound Poisson process.