Agent Based Intrusion Detection and Response System for Wireless LANs

Wireless LAN technology, despite the numerous advantages it has over competing technologies, has not seen widespread deployment. A primary reason for markets not adopting this technology is its failure to provide adequate security. Data that is sent over wireless links can be compromised with utmost ease. In this project, we propose a distributed agent based intrusion detection and response system for wireless LANs that can detect unauthorized wireless elements like access points, wireless clients that are in promiscuous mode etc. The system reacts to intrusions by either notifying the concerned personnel, in case of rogue access points and promiscuous nodes, or by blocking unauthorized users from accessing the network resources.

Hierarchy-Based Access Control in Distributed Environments

Access control is a fundamental concern in any system that manages resources, e.g., operating systems, file systems, databases and communications systems. The problem we address is how to specify, enforce, and implement access control in distributed environments. This problem occurs in many applications such as management of distributed project resources, e-newspaper and payTV subscription services. Starting from an access relation between users and resources, we derive a user hierarchy, a resource hierarchy, and a unified hierarchy. The unified hierarchy is then used to specify the access relation in a way that is compact and that allows efficient queries. It is also used in cryptographic schemes that enforce the access relation. We introduce three specific cryptography based hierarchical schemes, which can effectively enforce and implement access control and are designed for distributed environments because they do not need the presence of a central authority (except perhaps for set- UP).

Priority-based Lambda Scheduler

Optical networks provide a new dimension to meet the demands of exponentially growing traffic. Optical packet switching requires a good switch architecture, which eliminates the O/E/O conversion as much as possible. Wavelength Division Multiplexing (WDM) provides a breakthrough to exploit the huge bandwidth of the optical fiber. Different applications have different requirements, which necessitate employing differentiated services. This paper presents the idea of a priority-based λ-scheduler, where the packets are differentiated into different classes and services are provided accordingly. For example, class 0 can correspond to non real time applications like email and ftp, while class 1 can correspond to real-time audio and video communications. The architecture is based on that of the λ-scheduler and hence it has the added advantage of reduced component cost by using WDM internally.

Distributed Hybrid Agent Based Intrusion Detection and Real Time Response System

Wireless LANs are growing rapidly and security has always been a concern. We have implemented a hybrid system, which will not only detect active attacks like identity theft causing denial of service attacks, but will also detect the usage of access point discovery tools. The system responds in real time by sending out an alert to the network administrator.

A Generic Autonomous Clustering-Based Heterogeneous Waveband Switching Architecture in WDM Networks

Heterogeneous waveband switching (HeteroWBS) in WDM networks reduces the network operational costs. We propose an autonomous clustering-based HeteroWBS architecture to support the design of efficient HeteroWBS algorithms under dynamic traffic requests in such a network.

The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks

The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.

Maximizing Resource Sharing in WDM Mesh Networks With Path-Based Protection and Sparse OEO Regeneration

We propose a resource-sharing scheme that supports three kinds of sharing scenarios in a WDM mesh network with path-based protection and sparse OEO regeneration. Several approaches are used to maximize the sharing of wavelength-links and OEO regenerators.

Optimization of Amplifier Placements in Switch-Based Optical Networks

Wavelength division multiplexing (WDM) offers a solution to the problem of exploiting the large bandwidth on optical links; it is the current favorite multiplexing technology for optical communication networks. Due to the high cost of an optical amplifier, it is desirable to strategically place the amplifiers throughout the network in a way that guarantees that all the signals are adequately amplified while minimizing the total number amplifiers being used. Previous studies all consider a star-based network. This paper demonstrates an original approach for solving the problem in switch-based WDM optical network assuming the traffic matrix is always the permutation of the nodes. First we formulate the problem by choosing typical permutations which can maximize traffic load on individual links; then a GA (Genetic Algorithm) is used to search for feasible amplifier placements. Finally, by setting up all the lightpaths without violating the power constaints we confirm the feasibility of the solution.

Bandit-Based Algorithms for Budgeted Learning

We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is specified. This learning model is appropriate in many areas, including medical applications. We present new algorithms for choosing which attributes to purchase of which examples in the budgeted learning model based on algorithms for the multi-armed bandit problem. All of our approaches outperformed the current state of the art. Furthermore, we present a new means for selecting an example to purchase after the attribute is selected, instead of selecting an example uniformly at random, which is typically done. Our new example selection method improved performance of all the algorithms we tested, both ours and those in the literature.

Mesh-based vs. Image-based Statistical Appearance Model of the Human Femur: a Preliminary Comparison Study for the Creation of Finite Element Meshes

Statistical models have been recently introduced in computational orthopaedics to investigate the bone mechanical properties across several populations. A fundamental aspect for the construction of statistical models concerns the establishment of accurate anatomical correspondences among the objects of the training dataset. Various methods have been proposed to solve this problem such as mesh morphing or image registration algorithms. The objective of this study is to compare a mesh-based and an image-based statistical appearance model approaches for the creation of nite element(FE) meshes. A computer tomography (CT) dataset of 157 human left femurs was used for the comparison. For each approach, 30 finite element meshes were generated with the models. The quality of the obtained FE meshes was evaluated in terms of volume, size and shape of the elements. Results showed that the quality of the meshes obtained with the image-based approach was higher than the quality of the mesh-based approach. Future studies are required to evaluate the impact of this finding on the final mechanical simulations.

A Trustability Metric for Code Search based on Developer Karma

The promise of search-driven development is that developers will save time and resources by reusing external code in their local projects. To efficiently integrate this code, users must be able to trust it, thus trustability of code search results is just as important as their relevance. In this paper, we introduce a trustability metric to help users assess the quality of code search results and therefore ease the cost-benefit analysis they undertake trying to find suitable integration candidates. The proposed trustability metric incorporates both user votes and cross-project activity of developers to calculate a "karma" value for each developer. Through the karma value of all its developers a project is ranked on a trustability scale. We present JBENDER, a proof-of-concept code search engine which implements our trustability metric and we discuss preliminary results from an evaluation of the prototype.

European Stroke Science Workshop

The European Stroke Organisation held its first European Stroke Science Workshop in Garmisch-Partenkirchen, Germany (December 15-17, 2011). Stroke experts based in Europe were invited to present and discuss their current research. The scope of the workshop was to review the most recent findings of selected topics in stroke, to exchange ideas, to stimulate new research, and to enhance collaboration between European stroke research groups. Seven scientific sessions were held, each starting with a keynote lecture to review the state of the art of the given topic, followed by 4 or 5 short presentations by experts. They were asked to limit their presentations to 10 slides containing only recent information. The meeting was organized by the executive committee of the European Stroke Organisation (Heinrich Mattle, chairman, Michael Brainin, Angel Chamorro, Werner Hacke, Didier Leys) and supported by the European Stroke Conference (Michael Hennerici). The following sections summarize the content of the workshop.

European Stroke Science Workshop

The European Stroke Organisation held its first European Stroke Science Workshop in Garmisch-Partenkirchen, Germany (December 15-17, 2011). Stroke experts based in Europe were invited to present and discuss their current research. The scope of the workshop was to review the most recent findings of selected topics in stroke, to exchange ideas, to stimulate new research, and to enhance collaboration between European stroke research groups. Seven scientific sessions were held, each starting with a keynote lecture to review the state of the art of the given topic, followed by 4 or 5 short presentations by experts. They were asked to limit their presentations to 10 slides containing only recent information. The meeting was organized by the executive committee of the European Stroke Organisation (Heinrich Mattle, chairman, Michael Brainin, Angel Chamorro, Werner Hacke, Didier Leys) and supported by the European Stroke Conference (Michael Hennerici). The following sections summarize the content of the workshop.