Characterization of different sugarcane bagasse ashes generated for preparation and application as green products in civil construction

Clean Technologies and Environmental Policy - The characterization and manipulation of solid residues according to their types can enable different ways of efficient and specialized applications in...     

Structure and evolution of innovation research in the last 60 years: review and future trends in the field of business through the citations and co-citations analysis

The field of innovation studies has grown considerably in the last four decades, which has led to the emergence of new approaches and theoretical aspects that need to be examined and considered. Therefore, this paper aims to understand what are the main theoretical pillars that support the structure of innovation theories and fields, how it evolved over the years and what are the directions that lead to future trends in innovation research. The procedure consists in a mix-methods using the citation and co-citation analysis associated with bibliometric methods, Social Network Analysis, and a systematic review of the literature. The results were validated by Delphi with academic specialists in innovation. Considering publications between 1956 and 2016 divided into four 15-years timespan, the longitudinal analysis results indicate the evolution of the main streams of thoughts that support the current innovation research fields and depict a research orientation for future works that can be developed to generate relevant contributions for the theoretical development of the area. This paper differentiates itself bringing results based on a large database, by the research methods employed, and by the perspective adopted provides solid contributions to the understanding of the past, present, and future of the scientific research in innovation to business administration field.     

On the modularization and reuse of exception handling with aspects

This paper presents an in‐depth study of the adequacy of the AspectJ language for modularizing and reusing exception‐handling code. The study consisted of refactoring existing applications so that the code responsible for implementing error‐handling strategies was moved to newly created exception handler aspects. We have performed quantitative assessments of five systems—four object‐oriented and one aspect‐oriented—based on four key quality attributes, namely separation of concerns, coupling, cohesion, and conciseness. Our investigation also included a multi‐perspective analysis of the refactored systems, including (i) the extent to which error‐handling aspects can be reused, (ii) the beneficial and harmful aspectization scenarios for exception handling, and (iii) the scalability of AOP to support the modularization of exception handling in the presence of other aspects. Copyright © 2009 John Wiley & Sons, Ltd.     

A security approach for off-chip memory in embedded microprocessor systems

This paper describes a complete off-chip memory security solution for embedded systems. Our security core is based on a one-time pad (OTP) encryption circuit and a CRC-based integrity checking module. These modules safeguard external memory used by embedded processors against a series of well-known attacks, including replay attacks, spoofing attacks and relocation attacks. Our implementation limits on-chip memory space overhead to less than 33% versus memory used by a standard microprocessor and reduces memory latency achieved by previous approaches by at least half. The performance loss for software execution with our solution is only 10% compared with a non-protected implementation. An FPGA prototype of our security core has been completed to validate our findings.     

RIP – A robust IP access architecture

This research is of the view that only tightly coordinated work among security components as we know them today including firewalls, traffic analysis modules, intrusion detection systems, antivirus remediation systems, etc., is likely to take us closer to a more effective solution against some security threats. A structured Robust IP (RIP) access architecture is described and its components are analyzed through the use of a proof of concept testbed. Examples of the use of RIP and the heuristics it implements are evaluated. We also compare RIP performance to existing work. We show that there are currently some tradeoffs that need to be made between accuracy and responsiveness. We believe that this collaborative communication style between the components represents a significant step in the direction of self-defending networks and innovation in the area.     

Localization in time and space for wireless sensor networks: An efficient and lightweight algorithm

In many applications that use Wireless Sensor Networks (WSNs), detected events need to be localized in both time and space. As a result, sensor nodes need to have precisely synchronized clocks as well as to be localized in a common spatial reference system. While synchronization and localization algorithms have been proposed to solve these problems independently, in this work we propose to combine both synchronization and localization into a single problem that we refer to as the time–space localization problem. We then propose a novel and efficient time–space localization algorithm for wireless sensor networks which we refer to as the Lightness algorithm. Our proposed algorithm not only takes advantage of the additional hardware resources required by the positioning mechanism in order to improve the performance and scalability of synchronization, but also benefits from the additional communication needed by the synchronization mechanism in order to decrease positioning errors. We also present an extensive set of experiments to evaluate the performance of our algorithm. Our results indicate clearly that our proposed scheme is scalable while keeping a low synchronization error and a low communication overhead. Our results also indicate that the additional packets needed to compute clocks’ drift have the ability to decrease the positioning errors to almost one third of the initial positioning.     

A simulation-based evolutionary multiobjective approach to manufacturing cell formation

The purpose of this paper is to propose a multiobjective optimization approach for solving the manufacturing cell formation problem, explicitly considering the performance of this said manufacturing system. Cells are formed so as to simultaneously minimize three conflicting objectives, namely, the level of the work-in-process, the intercell moves and the total machinery investment. A genetic algorithm performs a search in the design space, in order to approximate to the Pareto optimal set. The values of the objectives for each candidate solution in a population are assigned by running a discrete-event simulation, in which the model is automatically generated according to the number of machines and their distribution among cells implied by a particular solution. The potential of this approach is evaluated via its application to an illustrative example, and a case from the relevant literature. The obtained results are analyzed and reviewed. Therefore, it is concluded that this approach is capable of generating a set of alternative manufacturing cell configurations considering the optimization of multiple performance measures, greatly improving the decision making process involved in planning and designing cellular systems.     

Discontinuous subgrid formulations for transport problems

In this paper we develop two discontinuous Galerkin formulations within the framework of the two-scale subgrid method for solving advection–diffusion-reaction equations. We reformulate, using broken spaces, the nonlinear subgrid scale (NSGS) finite element model in which a nonlinear eddy viscosity term is introduced only to the subgrid scales of a finite element mesh. Here, two new subgrid formulations are built by introducing subgrid stabilized terms either at the element level or on the edges by means of the residual of the approximated resolved scale solution inside each element and the jump of the subgrid solution across interelement edges. The amount of subgrid viscosity is scaled by the resolved scale solution at the element level, yielding a self adaptive method so that no additional stabilization parameter is required. Numerical experiments are conducted in order to demonstrate the behavior of the proposed methodology in comparison with some discontinuous Galerkin methods.