The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The cloud radio access network (C-RAN) has been deemed a cost-effective architecture for exploiting the capacity benefit of densely deployed radio access points. The low-latency fronthaul data transmission from the central processor to small-cell base stations (SBSs) is a key requirement in C-RANs for which conventional wired fronthaul links will be cost-prohibitive and also inconvenient. Therefore,...
We consider the generalized minimum vertex-biconnected network problem (GMVBCNP). Given a graph where nodes are partitioned into clusters, the goal is to find a minimal cost sub graph containing exactly one node from each cluster and satisfying the vertex-biconnectivity constraint. The problem is NP-hard. The GMVBCNP has applications in the design of survivable backbone networks when single component...
The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single component outage. When given a graph where the nodes are partitioned into clusters, the goal is to find a subgraph of minimum costs that connects exactly one node from each cluster in a vertex-biconnected way.We present a memetic algorithm...
In this paper, a hybrid music recommendation system is proposed, which combines collaborative filtering and content-base recommendation. Neither of these two parts can make full use of all the information. Our method integrates both user rating and music content information using an expansion method of LSA (latent semantic analysis) called M-LSA. We use a text representation for music content information,...
Dense subgraphs of protein interaction networks are believed to be potential protein complexes and play an important role in analyzing cellular organization and predicting functions of proteins. In this paper, we present a new algorithm LD-Miner for mining l-dense subgraphs in protein interaction networks. We apply algorithm LD-Miner to the protein interaction network of Saccharomyces cerevisiae collected...
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given a salesman who has to visit a number of cities to carry out some business. He starts and ends at a specified home city, and the required time for the overall journey, including waiting times, shall be minimized. In this paper,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.