Survivable Network Design: The State of the Art

In the past few years the telecommunications industry has undergone significant changes. We are rapidly evolving to a state where audio/visual and data traffic is all provided on the same networks. Telecommunication companies are investing billions of dollars in the design and maintenance of telecommunication networks to provide the users with the better quality of service that they have begun to expect. Due to their high capacity, fiber optic cables have become the medium of choice in the deployment of such new networks worldwide. Such high capacities encourage telecommunication providers to create networks that are substantially more sparse than previous copper based networks. Unfortunately, with sparsity comes vulnerability to failure. Given the dependence on the varied services offered by the modern networks, the magnitudes of the investments involved and the costs of disasters it is only logical that researchers look at problems in survivable network design as an interesting research question. There have been a number of papers that have addressed these and other related issues. In this paper we try to classify the area of survivable network design and provide a classification scheme for the same.     

Data stream classification with novel class detection: a review,comparison and challenges

Knowledge and Information Systems - Developing effective and efficient data stream classifiers is challenging for the machine learning community because of the dynamic nature of data streams. As a...     

Formal probabilistic analysis of a surgical robot control algorithm with different virtual fixtures

Surgical robots are increasingly being used in operation theaters involving normal or laparoscopic surgeries. The working of these surgical robots is highly dependent on their control algorithms, which require very rigorous analysis to ensure their correct functionality due to the safety-critical nature of surgeries. Traditionally, safety of control algorithms is ensured by simulations, but they provide incomplete and approximate analysis results due to their inherent sampling-based nature. We propose to use probabilistic model checking, which is a formal verification method, for quantitative analysis, to verify the control algorithms of surgical robots in this paper. As an illustrative example, the paper provides a formal analysis of a virtual fixture control algorithm, implemented in a neuro-surgical robot, using the PRISM model checker. In particular, we provide a formal discrete-time Markov chain-based model of the given control algorithm and its environment. This formal model is then analyzed for multiple virtual fixtures, like cubic, hexagonal and irregular shapes. This verification allowed us to discover new insights about the considered algorithm that allow us to design safer control algorithms.     

A comprehensive study on RF MEMS switch

This paper emphasis on state-of-the-art of the earlier until the current trend and demand, principles, design considerations, key performance and fabrication technology of RF MEMS switch devices developed over the past few years. RF MEMS switch performance and features such as actuation voltage, insertion loss, isolation and ease with cost of fabrication and applications are compared and discussed.     

Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

The calculation of the degree d of an approximate greatest common divisor of two inexact polynomials f(y) and g(y) reduces to the determination of the rank loss of a resultant matrix, the entries of which are functions of the coefficients of f(y) and g(y). This paper considers this issue by describing two methods to calculate d, such that knowledge of the noise level imposed on the coefficients of f(y) and g(y) is not assumed. One method uses the residual of a linear algebraic equation whose coefficient matrix and right hand side vector are derived from the Sylvester resultant matrix S(f,g), and the other method uses the first principal angle between a line and a hyperplane, the equations of which are calculated from S(f,g). Computational results on inexact polynomials whose exact forms have multiple roots of high degree are shown and very good results are obtained. These results are compared with the rank loss of S(f,g) for the calculation of d, and it is shown that this method yields incorrect results for these examples.     

Effects of interface style on user perceptions and behavioral intention to use computer systems

This study examines the influence of two interface styles (menu- and command-based) on the perceived ease of use, perceived usefulness, and behavioral intention of the user to use the system. We have treated the system interface style as an external factor in the technology acceptance model (TAM) to examine its direct and indirect effects on behavioral intention to accept and use a system. The results showed that the interface style had direct effects on perceived ease of use and perceived usefulness which, in turn, demonstrated significant effects on behavioral intention to use the system. Further, the results showed that perceptions of the menu-based interface were more favorable than perceptions of the command-based interface. These results provide several theoretical and practical implications for designing an effective system.     

A group theoretic approach to construct cryptographically strong substitution boxes

In this paper, we present a method to construct a substitution box used in encryption applications. The proposed algorithm for the construction of substitution box relies on the linear fractional transform method. The design methodology is simple, while the confusion-creating ability of the new substitution box is complex. The strength of the proposed substitution box is evaluated, and an insight is provided to quantify the confusion-creating ability. In addition, tests are performed to assess the vulnerability of the encrypted data to algebraic and statistical attacks. The substitution box is critically analyzed by strict avalanche criterion, bit independent criterion, differential approximation probability test, linear approximation probability test, non-linearity test, and majority logic criterion. The performance of the proposed substitution box is also compared with those of some of the well-known counterparts including AES, APA, Gray, S₈, Skipjack, Xyi, and prime of residue substitution boxes. It is apparent that the performance, in terms of confusion-creating ability, of the new substitution box is better than those of some of the existing non-linear components used in encryption systems. The majority logic criterion is applied to these substitution boxes to further evaluate the strength and usefulness.     

On Logical Foundations of Multilevel Secure Databases

It is envisaged that the application of the multilevel security (MLS) scheme will enhance flexibility and effectiveness of authorization policies in shared enterprise databases and will replace cumbersome authorization enforcement practices through complicated view definitions on a per user basis. However, the critical problem with the current model is that the belief at a higher security level is cluttered with irrelevant or inconsistent data as no mechanism for attenuation is supported. Critics also argue that it is imperative for MLS database users to theorize about the belief of others, perhaps at different security levels, an apparatus that is currently missing and the absence of which is seriously felt.The impetus for our current research is the need to provide an adequate framework for belief reasoning in MLS databases. In this paper, we show that these concepts can be captured in a F-logic style declarative query language, called MultiLog, for MLS deductive databases for which a proof theoretic, model theoretic and fixpoint semantics exist. This development is significant from a database perspective as it now enables us to compute the semantics of MultiLog databases in a bottom-up fashion. We also define a bottom-up procedure to compute unique models of stratified MultiLog databases. Finally, we establish the equivalence of MultiLog's three logical characterizations—model theory, fixpoint theory and proof theory.     

A fuzzy long-term investment planning model for a GenCo in a hybrid electricity market considering climate change impacts

We study the long-term generation capacity investment problem of an independent power generation company (GenCo) that functions in an environment where GenCos perform business with both bilateral contracts (BC) and transactions in the day-ahead market (DAM). A fuzzy mixed integer linear programming model with a fuzzy objective and fuzzy constraints is developed to incorporate the impacts of imprecision/uncertainty in the economic environment on the calculation of the optimal value of the GenCo’s objective function. In formulating the fuzzy objective function we also include the potential impacts of climate change on the energy output of hydroelectric power plants. In addition to formulating and solving the capacity planning/investment problem, we also performed scenario-based (sensitivity) analysis to explore how investment decisions of the GenCos change when fuzziness (tolerance) in the maximum energy output of hydroelectric units and/or drought expectation increases. The proposed model is novel and investigates the effects of factors like drought expectations of climate changes, hydroelectric power plant investments, and other power generation technology investment options.     

Feature Selection for Detecting ICMPv6-Based DDoS Attacks Using Binary Flower Pollination Algorithm

Internet Protocol version 6 (IPv6) is the latest version of IP that goal to host 3.4 × 10³⁸ unique IP addresses of devices in the network. IPv6 has introduced new features like Neighbour Discovery Protocol (NDP) and Address Auto-configuration Scheme. IPv6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol (ICMPv6). IPv6 is vulnerable to numerous attacks like Denial of Service (DoS) and Distributed Denial of Service (DDoS) which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial implications. Therefore, an Intrusion Detection System (IDS) is a monitoring system of the security of a network that detects suspicious activities and deals with a massive amount of data comprised of repetitive and inappropriate features which affect the detection rate. A feature selection (FS) technique helps to reduce the computation time and complexity by selecting the optimum subset of features. This paper proposes a method for detecting DDoS flooding attacks (FA) based on ICMPv6 messages using a Binary Flower Pollination Algorithm (BFPA-FA). The proposed method (BFPA-FA) employs FS technology with a support vector machine (SVM) to identify the most relevant, influential features. Moreover, The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack scenarios. The results show that the proposed method BFPA-FA achieved the best accuracy rate (97.96%) for the ICMPv6 DDoS detection with a reduced number of features (9) to half the total (19) features. The proven proposed method BFPA-FA is effective in the ICMPv6 DDoS attacks via IDS.