42027884
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
Our problem formulation is as follows. Given a weighted disk graph Gwhere the weight of edge represents the transmission energy consumption, we wish to determine a dominating tree Tof Gsuch that the total weight of edges in Tis minimized. To the best of our knowledge, this problem have not been addressed in the literature. Solving the dominating tree problem can yield a routing backbone for broadcast protocols since: (1) each node does not have to construct their own broadcast tree, (2) utilize the virtual backbone to reduce the message overhead, and (3) the weight of backbone is minimized. 
 
Our contributions to this problem is multi-fold: First, the paper is the first to study this problem, prove the hardness of this problem and propose an approximation framework. Second, we present a heuristic to approximate the solution with low time complexity. Third, a distributed algorithm is provided for practical implementation. Finally, we verify the effectiveness of our proposal through simulation.
14654466
A Purpose-Based Access Control Model
Achieving privacy preservation in a data-sharing computing environment is a challenging problem. The requirements for a privacy preserving data access policy should be formally specified in order to be able to establish consistency between the privacy policy and its purported implementation in practice. Previous work has shown that when specifying a privacy policy, the notion of purpose should be used as the basis for access control. A privacy policy should ensure that data can only be used for its intended purpose, and the access purpose should be compliant with the data's intended purpose. This paper presents a mechanism to specify privacy policy using VDM. The entities in the purpose-based access control model are specified, the invariants corresponding to the privacy requirements in privacy policy are specified, and the operations in the model and their proof obligations are defined and investigated.
14935404
Levels of Authentication Assurance: an Investigation
The ES-LoA project, funded by the UK Joint Information Systems Committee (JISC) under its e- Infrastructure Security Programme, investigates current and future needs among UK research and education community for a more fine-grained authorisation scheme that would allow service providers to take into account of the levels of confidence in identifying a remote entity requesting for service access. Such a fine-grained authorisation scheme is attractive to service providers offering resources with varying levels of sensitivity and/or wishing to tailor their security protections based upon risk levels. Service providers may wish to restrict access to more sensitive resources only to those who have gone through a more stringent authentication process, or given the same remote entity, require the use of a stronger authentication token should the access request come from a more risky environment. In this way, the quality of an authentication instance, expressed as an authentication Level of Assurance (LoA), becomes one of the parameters used in access control decision making. This paper investigates the current worldwide efforts in defining LoA and identifies gaps in existing definitions when they are applied to a federated environment.
1660866
A General Fuzzified CMAC Controller with Eligibility
This paper presents an online neural network controller. Cerebellar Model Articulation Controller (CMAC) is suitable to online control due to its fast learning speed. By integrating the CMAC address scheme with fuzzy logic concept, a general fuzzified CMAC (GFAC) is proposed. Then by incorporating the concept of eligibility into the GFAC, a GFAC controller with eligibility is presented, named FACE. A learning algorithm for the FACE is derived to tune the model parameters. To achieve online control, an efficient implementation of the proposed FACE method is presented. As an example, the proposed FACE is applied to a ship steering control system. The simulation results show that the ship course can be properly controlled under the disturbances of wave, wind and current.
13044783
A New Time-domain Detection Approach with Blind Separation Based on Neural Network
In this paper a new technique is proposed for time-domain detection in energy detection. The proposed scheme is based on a independent-component analysis (ICA): blind separation of unknown source signals. This method not only improves the nicety of time-domain detection for narrow band signal and the sinusoidal signal but also reduces the power of the whole detection system.
1884872
A mobility monitoring based advance reservation protocol
Future wireless cellular networks will be Internet Protocol (IP) based. Users of wireless devices in these networks will expect to run real-time applications that require guarantees of Quality of Service (QoS). Such a user will expect the same seamless QoS that he would receive if he were running real-time applications on a wired network. Achieving seamless QoS in a mobile environment implies that a reservation should be re-established at the new Base Station (BS) before hand-over occurs. However, making these advance reservations is wasteful of valuable bandwidth in the wireless network. This paper proposes a protocol, called the Mobility Monitoring Based Advance Reservation Protocol (M²BARP), which aims to reduce the bandwidth overhead of making advance reservations. The protocol makes use of information about a Mobile Node's (MN) mobility to make a single advance reservation when the MN is about to hand-over. Unlike previous work, M²BARP takes advantage of overlapping cells to help to provide a more seamless QoS by reducing the number of calls dropped at hand-over
10586032
A tag recommendation system for folksonomy
Social bookmarking tools become more and more popular nowadays and tagging is used to organize information and allow users to recall or search the resources. Users need to type the tags whenever they post a resource, so that a good tag recommendation system can ease the process of finding some useful and relevant keywords for users. Researchers have made lots of relevant work for tag recommendation systems, but those traditional collaborative systems may not perform well in the case of a new user and a new resource.
 To address this problem, we propose a tag recommendation system for two different cases. The first case is that the active user or active resource is a new one which has not appeared in the past while the second case is that the active user and resource has already been posted. In this paper, we present two different methods for these two cases: a content-based method and a graph-based method. We implement our tag recommendation system in a realworld academic Folksonomy system. In order to gain better results,we apply improvements and combinations of previous work in each of these two methods.and combinations of previous work in each of these two methods. We participated into the Discovery Challenge 2009 with the proposed methods. The results of our teams are within the top teams.
8279850
Analysis and Simulation Protocols Based on Slotted ALOHA for Plastic Optical Fiber Network
In this paper a novel multipriority reservation protocols for plastic optical fiber network is proposed. In conventional OCDMA system only allows finite units to transmit and access simultaneously according to the number of channels which be restricted by BER. To resolve this problem, a novel protocol based on slotted ALOHA is proposed in this paper. By using the reservation scheme and a distributed arbitration algorithm, channel collision and destination conflict can be avoided. The protocol can efficiently support the transmission of multimedia messages that require the different time-delay. The network throughput and average delay has been investigated by numerical analysis and simulation experiments. It is showed that the multipriority reservation protocol in this POF network is valid and efficient.
16355724
The Bipartite Network Study of the Library Book Lending System
Through collecting the library lending information of the University of Shanghai for Science and Technology during one year, we build the database between the books and readers, and then construct a bipartite network to describe the relationships. We respectively establish the corresponding un-weighted and weighted bipartite network through the borrowing relationship and the reading days, thereout obtain the statistical properties via the theory and methods of complex network. We find all the properties follow exponential distribution and there is a positive correlation between the relevant properties in un-weighted and weighted networks. The un-weighted properties can describe the cooperation situation and configuration, but the properties with node weight may describe the competition results. Besides, we discuss the practical significance for the double relationship and the statistical properties. Further more, we propose a library personal recommendation system for developing the library humanity design resumptively.
16897836
Analysis on Routing Convergence in Optical Network
Today wavelength division multiplexing (WDM) technology, optical amplifiers, and simple optical switching elements like optical add-drop multiplexers (OADMs) are used in the backbone networks of all operators worldwide. The optical network has its own distinct routing features, topology aggregation and abstraction used in inter-domain routing make the view of network topology different to each routing layer, all these factors demand a creative way to converge and synchronize the hierarchical network. This paper tries to bring forward a kind of parallel topology convergence mechanism depending on the exchange of topology abstracts information, which is suitable for inter-domain routing in multiple layers and domains ASON network. Optical systems nowadays provide the basis for cost-effective transmission of large amounts of bandwidth over the Internet, and will enable its future growth and the spreading of new applications and services.
8241163
MS-BID: a Java package for label-free LC-MS-based comparative proteomic analysis
UNLABELLED
MS-BID (MS Biomarker Discovery Platform) is an integrative computational pipeline for biomarker discovery using LC-MS-based comparative proteomic analysis. This platform consists of several computational tools for: (i) detecting peptides in the collected patterns; (ii) matching detected peptides across a number of LC-MS datasets and (iii) selecting discriminatory peptides between classes of samples.


AVAILABILITY
MS-BID source codes, binaries and documentations are freely available under LGPL from http://tools.proteomecenter.org/msBID.php.