다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Data Mining - Concepts and Techniques.

This document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions

Computer communications

Device-to-Device (D2D) communication has emerged as a promising technology for optimizing spectral efficiency in future cellular networks. D2D takes advantage of the proximity of communicating devices for efficient utilization of available resources, improving data rates, reducing latency, and increasing system capacity. The research community is actively investigating the D2D paradigm to realize its full potential and enable its smooth integration into the future cellular system architecture. Existing surveys on this paradigm largely focus on interference and resource management. We review recently proposed solutions in over explored and under explored areas in D2D. These solutions include protocols, algorithms, and architectures in D2D. Furthermore, we provide new insights on open issues in these areas. Finally, we discuss potential future research directions.

A Survey of Device-to-Device Communications: Research Issues and Challenges

With the rising fuel costs, ride sharing is becoming a common mode of transportation. Sharing taxis which has been prominent in several developing countries is also becoming common in several cities around the world. Sharing taxis presents several advantages as it minimizes vacant seats in cars thus reducing costs on taxi operators which results in significantly lower taxi fares for passengers. Besides the economical advantages, taxi sharing is highly important for reducing congestion on the roads and for minimizing the impact of transportation on the environment. In this paper, we formulate the problem of assigning passengers to taxis and computing the optimal routes of taxis as a mixed integer program. To solve the proposed model, we present a Lagrangian decomposition approach which exploits the structure of the problem leading to smaller problems that are solved separately. Furthermore, we propose two heuristics that are used to obtain good quality feasible solutions. The Lagrangian approach along with the heuristics are implemented and compared to solving the full problem using CPLEX. The computational results indicate the efficiency of the methodology in providing tighter bounds than CPLEX in shorter computational time.

The shared-taxi problem: Formulation and solution methods

Vehicular Ad hoc Networks, also known as VANETs, enable vehicles that are not necessarily within the same radio transmission range to communicate with each other. VANETs also allow vehicles to connect to Roadside Units (RSUs). The latter are connected to the Internet, forming a fixed infrastructure that offers them the capability of communicating with each other and with roaming vehicles. RSUs support cooperative and distributed applications in which vehicles and RSUs work together to coordinate actions and to share and process several types of information. RSUs have so far been used for different roles such as data disseminators, traffic directories, location servers, security managers, and service proxies. In this paper, we focus on routing; namely we exploit RSUs to route packets between any source and destination in the VANET. To our knowledge, this is the first attempt to use the RSU backbone to efficiently route packets to very far locations in VANETs by using geographic forwarding. We evaluate the RSU backbone routing performance via the ns2 simulation platform. We compare our scheme to existing solutions and prove the feasibility and efficiency of our scheme in terms of query delay, packet success delivery ratio, and total generated traffic.

ROAMER: Roadside Units as message routers in VANETs

Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them vulnerable to security threats. In this paper, we propose a novel cluster-based trust-aware routing protocol (CBTRP) for MANETs to protect forwarded packets from intermediary malicious nodes. The proposed protocol organizes the network into one-hop disjoint clusters then elects the most qualified and trustworthy nodes to play the role of cluster-heads that are responsible for handling all the routing activities. The proposed CBTRP continuously ensures the trustworthiness of cluster-heads by replacing them as soon as they become malicious and can dynamically update the packet path to avoid malicious routes. We have implemented and simulated the proposed protocol then evaluated its performance compared to the clustered based routing protocol (CBRP) as well as the 2ACK approach. Comparisons and analysis have shown the effectiveness of our proposed scheme.

A cluster-based trust-aware routing protocol for mobile ad hoc networks

The strong capabilities that exist in a Vehicular Ad hoc Network (VANET) has given birth to the concept of Vehicular Clouds, in which cloud computing services are hosted by vehicles that have sufficient resources to act as mobile cloud servers. In this paper, we design a system that enables vehicles in a VANET to search for mobile cloud servers that are moving nearby and discover their services and resources. The system depends on RSUs that act as cloud directories with which mobile cloud servers register. The RSUs share their registration data to enable vehicles to discover and consume the services of mobile cloud servers within a certain area. We evaluated the proposed system using the ns2 software and demonstrated through comparing the results to another mechanism the feasibility and efficiency of our system in terms of service discovery and service consuming delays and packet success ratio.

Finding a STAR in a Vehicular Cloud

Intervehicular communication lies at the core of a number of industry and academic research initiatives that aim at enhancing the safety and efficiency of transportation systems. Vehicular ad hoc networks (VANETs) enable vehicles to communicate with each other and with roadside units (RSUs). Service-oriented vehicular networks are special types of VANETs that support diverse infrastructure-based commercial services, including Internet access, real-time traffic management, video streaming, and content distribution. Many forms of attacks against service-oriented VANETs that attempt to threaten their security have emerged. The success of data acquisition and delivery systems depends on their ability to defend against the different types of security and privacy attacks that exist in service-oriented VANETs. This paper introduces a system that takes advantage of the RSUs that are connected to the Internet and that provide various types of information to VANET users. We provide a suite of novel security and privacy mechanisms in our proposed system and evaluate its performance using the ns2 software. We show, by comparing its results to those of another system, its feasibility and efficiency.

Hassan Artail

Papers

The shared-taxi problem: Formulation and solution methods

ROAMER: Roadside Units as message routers in VANETs

A cluster-based trust-aware routing protocol for mobile ad hoc networks

Finding a STAR in a Vehicular Cloud

A Framework for Secure and Efficient Data Acquisition in Vehicular Ad Hoc Networks