No full-text available
To read the full-text of this research,
you can request a copy directly from the author.
An Entity-Based Black-Box Specification Approach for Modeling Wireless Community Network Services
Abstract
Wireless community networks are emerging as a better alternative to bridge the digital divide in underserved areas. As such, they can stimulate a proximity economy and allow the emergence of local digital service operators like wireless service providers (WISPs). To achieve this goal, we propose in this paper, an entity-based black-box specification approach to formally describe: (1) the concept of wireless community network service (WCNS), (2) the mechanisms of interaction with the latter through the authentication-authorization-accounting (AAA) model, and (3) the profitability mechanisms that complement the AAA model which are: pricing, billing and payment (PBP). Our case study is a campus-type WCN. We have defined an abstract representation of the network service concept through characteristics common to all services. The access control and profitability functions are described through well-defined and justified formalisms. These functions are also well illustrated by practical cases.
The great advantages of open source code-based projects like the case of open source firmware (OSF) are flexibility and freedom of customization. However, the difficulty inherent to their development process, which can be seen as a software composition issue, is the lack of structured approach and a teachable methodology for efficiently tackling such project. In this paper, we propose a 5-step pedagogical OSF’s customization approach, coupled with an agile development process to guide the learner and ease his comprehension. We experience this approach to prototype WiAFirm, an OpenWRT-based firmware for operating IEEE 802.11x enabled WAP. Two groups of 04 students each were involved. After 2 months of experimentation, the group that applied the approach was able to integrate into the core OpenWRT a custom WifiDog captive portal feature as a built-in package; while the other group had barely understood the goal of customizing an OSF.
We would like to generalize to non-Newtonian real numbers the usual Lebesgue measure in real numbers. For this purpose, we introduce the Lebesgue measure on open and closed sets in non-Newtonian sense and examine their basic properties.
As demand on data access and bandwidth explodes, service providers across cellular network infrastructures are struggling to find effective ways to manage the data traffic on their network, and meet customer expectations without eroding profitability, or attracting regulatory attention. Pricing schemes are designed to offer protable business to the operators as well as to create favorable services for the mobile subscribers. In this paper, we analyze three well-known pricing schemes proposed for Long Term Evolution (LTE) mobile networks. We then propose a realistic per-category pricing (R2P) scheme for LTE. Our pricing scheme takes into account QoS parameters, physical resources blocs utilization, user valuation, and user price categories: Gold, Silver and Bronze. Finally, we show, through extensive simulation results that our proposed pricing scheme provides the higher revenue for the operator.
A smart transducer network hosts various nodes with different functionality. Our approach offers the possibility to design different smart transducer nodes as a system-on-a-chip within the same platform. Key elements are a set of code com- patible processor cores which can be equipped with several extension modules. Due to the fact that all processor cores are code compatible, programs developed for one node run on all other nodes without any modification. A well-defined interface between processor cores and extension modules ensures that all mod- ules can be used with every processor type. The applicability of the proposed approach is shown by presenting our experiences with the implementation of a smart transducer featuring the processor core and a UART extension module on an FPGA.
This paper describes a formal method for specifying the observable (external) behavior of information systems using a process algebra and input-output traces. Its notation is mainly based on the entity concept, borrowed from the Jackson System Development method, and integrated with the requirements class diagram to represent data structures and associations. The specification process promotes modular and incremental description of the behavior of each entity through process abstraction, entity type patterns, and entity attribute function patterns. Valid system input traces result from the composition of entity traces by using parallel composition operations. The association between input traces and outputs through an input-output relation completes the specification process.
Next generation networks (NGN) services are assumed to be a new revenue stream for both network operators and service providers. New services especially focused on a mobile telecommunications that would be used not only as a communication de vice but also as a personal gateway to order or consume a variety of services and products [1]. This type of advanced services can be accomplished when the adaptability of the packet-networks (Internet) and the quality of service of the circuit switched networks are combined into one network [2]. New challenges appear in the billing of this heterogeneous multi services network. Some examples of such a services and possible solutions about charging and billing are examined in this paper. The first steps of mathematical model for billing are also considered.
Tribes became a successful basis of measure theory on fuzzy sets. During their investigation, new requirements arose. We discuss possible modifications of the original definition of a tribe. We suggest a more general structure which admits to apply different triangular norms in different parts. Emphasis is put on point-free notions.
In this paper, we contribute to the theory and development of defuzzification techniques. First we define the core of a fuzzy set. Then we formulate a set of criteria for defuzzification in arbitrary universes, ordered universes, and the set of the real numbers. Finally, we classify the most widely used defuzzification techniques into different groups and we examine the prototypes of each group with respect to the defuzzification criteria. We show that the maxima methods behave well with respect to the more basic defuzzification criteria, and hence are good candidates for fuzzy reasoning systems. On the other hand, the distribution methods and the area methods do not fulfill the basic criteria, but they exhibit the property of continuity that makes them suitable for fuzzy controllers.
We introduce MV-observables, an analogue of observables for MV-algebras, as σ-homomorphisms from the Borel tribe generated by the Borel sets of and constant functions from [0, 1] into an MV-algebra M. We show that it is possible to define such observables only for weakly divisible MV-algebras. We present a representation as well as a so-called calculus of MV-observables, which enables us to construct, e.g., the sum or product of MV-observables.
Contenido: 1. Descripción de la seguridad en las computadoras; 2. Matriz del control de acceso; 3. Resultados fundacionales; 4. Políticas de seguridad; 5. Políticas de confidencialidad; 6. Políticas de integridad; 7. Políticas híbridas; 8. No interferencia y política de composición; 9 Criptografía básica; 10. Administración de claves; 11. Técnicas de cifrado; 12. Autentificación; 13. Principios de diseño; 14. Representación de la identidad; 15. Mecanismos de control de acceso; 16. Flujo de información; 17. Problema del confinamiento; 18. Introducción al aseguramiento; 19. Construcción de sistemas con aseguramiento; 20. Métodos formales; 21. Sistemas de evaluación; 22. Lógica malévola; 23. Análisis de la vulnerabilidad; 24. Auditoría; 25. Detección de intrusos; 26. Seguridad de redes; 27. Seguridad del sistema; 28. Seguridad del usuario; 29. Seguridad de los programas; 30. Enrejados; 31. El algoritmo euclediano extendido; 32. Entropía e incertidumbre; 33. Máquinas virtuales; 34. Lógica simbólica; 35. Ejemplo de política de seguridad académica.
Borel spaces. The University of Texas at Austin
- S K Berberian
Resource allocation and pricing in virtual wireless networks
- X Chen