Dataset Viewer
name
stringlengths 0
34
| input
stringlengths 132
715
| output
stringlengths 7
9.38k
| profile
listlengths 57
3.7k
|
|---|---|---|---|
Hua Sun | Generate an abstract for the title "Performance and Sensitivity of Individual Tree Segmentation Methods for UAV-LiDAR in Multiple Forest Types" using the following items: UAV-LiDAR, Individual tree segmentation, CHM, NPC, Forest type. | Using unmanned aerial vehicles (UAV) as platforms for light detection and ranging (LiDAR) sensors offers the efficient operation and advantages of active remote sensing; hence, UAV-LiDAR plays an important role in forest resource investigations. However, high-precision individual tree segmentation, in which the most appropriate individual tree segmentation method and the optimal algorithm parameter settings must be determined, remains highly challenging when applied to multiple forest types. This article compared the applicability of methods based on a canopy height model (CHM) and a normalized point cloud (NPC) obtained from UAV-LiDAR point cloud data. The watershed algorithm, local maximum method, point cloud-based cluster segmentation, and layer stacking were used to segment individual trees and extract the tree height parameters from nine plots of three forest types. The individual tree segmentation results were evaluated based on experimental field data, and the sensitivity of the parameter settings in the segmentation methods was analyzed. Among all plots, the overall accuracy F of individual tree segmentation was between 0.621 and 1, the average RMSE of tree height extraction was 1.175 m, and the RMSE% was 12.54%. The results indicated that compared with the CHM-based methods, the NPC-based methods exhibited better performance in individual tree segmentation; additionally, the type and complexity of a forest influence the accuracy of individual tree segmentation, and point cloud-based cluster segmentation is the preferred scheme for individual tree segmentation, while layer stacking should be used as a supplement in multilayer forests and extremely complex heterogeneous forests. This research provides important guidance for the use of UAV-LiDAR to accurately obtain forest structure parameters and perform forest resource investigations. In addition, the methods compared in this paper can be employed to extract vegetation indices, such as the canopy height, leaf area index, and vegetation coverage. | [
{
"abstract": "Oil tea (Camellia oleifera) is one of the world's major woody edible oil plants and is vital in providing food and raw materials and ensuring water conservation. The yield of oil tea can directly reflect the growth condition of oil tea forests, and rapid and accurate yield measurement is directly beneficial to efficient oil tea forest management. Light detection and ranging (LiDAR), which can penetrate the canopy to acquire the geometric attributes of targets, has become an effective and popular method of yield identification for agricultural products. However, the common geometric attribute information obtained by LiDAR systems is always limited in terms of the accuracy of yield identification. In this study, to improve yield identification efficiency and accuracy, the red-green-blue (RGB) and luminance-bandwidth-chrominance (i.e., YUV color spaces) were used to identify the point clouds of oil tea fruits. An optimized mean shift clustering algorithm was constructed for oil tea fruit point cloud extraction and product identification. The point cloud data of oil tea trees were obtained using terrestrial laser scanning (TLS), and field measurements were conducted in Changsha County, central China. In addition, the common mean shift, density-based spatial clustering of applications with noise (DBSCAN), and maximum-minimum distance clustering were established for comparison and validation. The results showed that the optimized mean shift clustering algorithm achieved the best identification in both the RGB and YUV color spaces, with detection ratios that were 9.02%, 54.53%, and 3.91% and 7.05%, 62.35%, and 10.78% higher than those of the common mean shift clustering, DBSCAN clustering, and maximum-minimum distance clustering algorithms, respectively. In addition, the improved mean shift clustering algorithm achieved a higher recognition rate in the YUV color space, with an average detection rate of 81.73%, which was 2.4% higher than the average detection rate in the RGB color space. Therefore, this method can perform efficient yield identification of oil tea and provide a new reference for agricultural product management.",
"id": "623afe4a5aee126c0fb18f30",
"title": "Identification of the Yield of Camellia oleifera Based on Color Space by the Optimized Mean Shift Clustering Algorithm Using Terrestrial Laser Scanning",
"year": 2022
},
{
"abstract": "Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users’ local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the product of two matrices from the library. A structure-agnostic solution is to treat each possible matrix product as an independent file and use the MAN coded caching scheme for single file retrieval. This paper proposes two structure-aware schemes, which partition each matrix in the library by either rows or columns and let a subset of users cache some sub-matrices, that improve on the structure-agnostic scheme. For the case where the library matrices are “fat” matrices, the structure-aware row-partition scheme is shown to be order optimal under some constraint.",
"id": "62d16bc05aee126c0fd17bde",
"title": "Cache-Aided Matrix Multiplication Retrieval",
"year": 2022
},
{
"abstract": "In order to research the high-concentration CO2 effects on ignition delay time (IDT) of diesel surrogate fuel (70% n-heptane/30% toluene), a carbon dioxide effect (CDE) model is established, which considers fuel and ambient gas concentration, density, and temperature influence on autoignition under CO2/O-2 atmosphere. Firstly, a chemical model of n-heptane/toluene is established, and the coupling, reduction, and simulation processes are carried out in chemical kinetic software with the IDT as the target parameter. Secondly, a constant volume combustion chamber (CVCC) visualization platform is built by incorporating a high-speed camera system and different working conditions are set in the CO2 volume fraction range (40%-70%) at 3.0 MPa and 850 K for an autoignition experiment. Thirdly, experiment and simulation results are discussed in air, 60% CO2/40% O-2, 50% CO2/50% O-2, and 40% CO2/60% O-2 atmospheres, including the IDT, CO2 effects, temperature sensitivity, and OH radical rate of production (ROP). The results show that the CDE model well predicts the 70% n-heptane/30% toluene IDT under the CO2/O-2 atmosphere and the average error in 60% CO2/40% O-2 atmosphere is 5.29%. Besides, when the CO2 volume fraction increases from 40% to 60%, the CO2 thermal effect plays a leading role in the IDT prolongation and the OH radical ROP peak of R4 (O+H2O -> 2OH) decreases by 180%.",
"id": "62d16c1b5aee126c0fd22525",
"title": "Effects of High-Concentration CO2 on Ignition Delay Time of 70% n-Heptane/30% Toluene Mixtures",
"year": 2022
},
{
"abstract": "In the conditional disclosure of secrets (CDS) problem, Alice and Bob (each holds an input and a common secret) wish to disclose, as efficiently as possible, the secret to Carol if and only if their inputs satisfy some function. The capacity of CDS is the maximum number of bits of the secret that can be securely disclosed per bit of total communication. We characterize the necessary and sufficient condition for the extreme case where the capacity of CDS is the highest and is equal to \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$1/2$ </tex-math></inline-formula>\n. For the simplest instance where the capacity is smaller than \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$1/2$ </tex-math></inline-formula>\n, we show that the linear capacity is \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$2/5$ </tex-math></inline-formula>\n.",
"id": "62d172dc5aee126c0fdd84d5",
"title": "Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach",
"year": 2022
},
{
"abstract": "Fractional vegetation cover (FVC) is an important indicator of ecosystem changes. Both satellite remote sensing and ground measurements are common methods for estimating FVC. However, desert vegetation grows sparsely and scantly and spreads widely in desert regions, making it challenging to accurately estimate its vegetation cover using satellite data. In this study, we used RGB images from two periods: images from 2006 captured with a small, light manned aircraft with a resolution of 0.1 m and images from 2019 captured with an unmanned aerial vehicle (UAV) with a resolution of 0.02 m. Three pixel-based machine learning algorithms, namely gradient enhancement decision tree (GBDT), k-nearest neighbor (KNN) and random forest (RF), were used to classify the main vegetation (woody and grass species) and calculate the coverage. An independent data set was used to evaluate the accuracy of the algorithms. Overall accuracies of GBDT, KNN and RF for 2006 image classification were 0.9140, 0.9190 and 0.9478, respectively, with RF achieving the best classification results. Overall accuracies of GBDT, KNN and RF for 2019 images were 0.8466, 0.8627 and 0.8569, respectively, with the KNN algorithm achieving the best results for vegetation cover classification. The vegetation coverage in the study area changed significantly from 2006 to 2019, with an increase in grass coverage from 15.47 +/- 1.49% to 27.90 +/- 2.79%. The results show that RGB images are suitable for mapping FVC. Determining the best spatial resolution for different vegetation features may make estimation of desert vegetation coverage more accurate. Vegetation cover changes are also important in terms of understanding the evolution of desert ecosystems.",
"id": "6326305790e50fcafdf3e655",
"title": "Estimating Fractional Vegetation Cover Changes in Desert Regions Using RGB Data",
"year": 2022
},
{
"abstract": "In the coded caching problem, as originally formulated by Maddah-Ali and Niesen, a server communicates via a noiseless shared broadcast link to multiple users that have local storage capability. In order for a user to decode its demanded file from the coded multicast transmission, the demands of all the users must be globally known, which may violate the privacy of the users. To overcome this privacy problem, Wan and Caire recently proposed several schemes that attain coded multicasting gain while simultaneously guarantee information theoretic privacy of the users’ demands. In Device-to-Device (D2D) networks, the demand privacy problem is further exacerbated by the fact that each user is also a transmitter, which appears to be needing the knowledge of the files demanded by the remaining users in order to form its coded multicast transmission. This paper shows how to solve this seemingly infeasible problem. The main contribution of this paper is the development of new achievable and converse bounds for D2D coded caching that are to within a constant factor of one another when privacy of the users’ demands must be guaranteed even in the presence of colluding users (i.e., when some users share cached contents and demanded file indices). First, a D2D private caching scheme is proposed, whose key feature is the addition of virtual users in the system in order to “hide” the demands of the real users. By comparing the achievable D2D private load with an existing converse bound for the shared-link model without demand privacy constraint, the proposed scheme is shown to be order optimal, except for the very low memory size regime with more files than users. Second, in order to shed light into the open parameter regime, a new achievable scheme and a new converse bound under the constraint of uncoded cache placement (i.e., when each user stores directly a subset of the bits of the library) are developed for the case of two users, and shown to be to within a constant factor of one another for all system parameters. Finally, the two-user converse bound is extended to any number of users by a cut-set type argument. With this new converse bound, the virtual users scheme is shown to be order optimal in all parameter regimes under the constraint of uncoded cache placement and user collusion.",
"id": "6338c35590e50fcafda272b7",
"title": "On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion",
"year": 2022
},
{
"abstract": "In the robust secure aggregation problem, a server wishes to learn and only learn the sum of the inputs of a number of users while some users may drop out (i.e., may not respond). The identity of the dropped users is not known a priori and the server needs to securely recover the sum of the remaining surviving users. We consider the following minimal two-round model of secure aggregation. Over the first round, any set of no fewer than \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$U$ </tex-math></inline-formula>\n users out of \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$K$ </tex-math></inline-formula>\n users respond to the server and the server wants to learn the sum of the inputs of all responding users. The remaining users are viewed as dropped. Over the second round, any set of no fewer than \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$U$ </tex-math></inline-formula>\n users of the surviving users respond (i.e., dropouts are still possible over the second round) and from the information obtained from the surviving users over the two rounds, the server can decode the desired sum. The security constraint is that even if the server colludes with any \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$T$ </tex-math></inline-formula>\n users and the messages from the dropped users are received by the server (e.g., delayed packets), the server is not able to infer any additional information beyond the sum in the information theoretic sense. For this information theoretic secure aggregation problem, we characterize the optimal communication cost. When \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$U \\leq T$ </tex-math></inline-formula>\n, secure aggregation is not feasible, and when \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$U > T$ </tex-math></inline-formula>\n, to securely compute one symbol of the sum, the minimum number of symbols sent from each user to the server is 1 over the first round, and \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$1/(U-T)$ </tex-math></inline-formula>\n over the second round.",
"id": "63730f7e90e50fcafd426ea9",
"title": "Information Theoretic Secure Aggregation With User Dropouts",
"year": 2022
},
{
"abstract": "Urban forest is an important component of terrestrial ecosystems and is highly related to global climate change. However, because of complex city landscapes, deriving the spatial distribution of urban forest carbon density and conducting accuracy assessments are difficult. This study proposes a novel spatial simulation method, optimized geographically weighted logarithm regression (OGWLR), using Landsat 8 data acquired by the Google Earth Engine (GEE) and field survey data to map the forest carbon density of Shenzhen city in southern China. To verify the effectiveness of the novel method, multiple linear regression (MLR), k-nearest neighbors (kNN), random forest (RF) and geographically weighted regression (GWR) models were established for comparison. The results showed that OGWLR achieved the highest coefficient of determination (R-2 = 0.54) and the lowest root mean square error (RMSE = 13.28 Mg/ha) among all estimation models. In addition, OGWLR achieved a more consistent spatial distribution of carbon density with the actual situation. The carbon density of the forests in the study area was large in the central and western regions and coastal areas and small in the building and road areas. Therefore, this method can provide a new reference for urban forest carbon density estimation and mapping.",
"id": "610679695244ab9dcbe27513",
"title": "A Novel Spatial Simulation Method For Mapping The Urban Forest Carbon Density In Southern China By The Google Earth Engine",
"year": 2021
},
{
"abstract": "Conditional disclosure of secrets (CDS) is the problem of disclosing as efficiently as possible, one secret from Alice and Bob to Carol if and only if the inputs at Alice and Bob satisfy some function f. The information theoretic capacity of CDS is the maximum number of bits of the secret that can be securely disclosed per bit of total communication. All CDS instances, where the capacity is the highest and is equal to 1/2, are recently characterized through a noise and signal alignment approach and are described using a graph representation of the function f ,G(f). In this work, we go beyond the best case scenarios and further develop the alignment approach to characterize the linear capacity of a class of CDS instances to be (rho - 1)/(2 rho), where rho is a covering parameter of G(f).",
"id": "60c2d9e591e0117e30ca2811",
"title": "On The Linear Capacity Of Conditional Disclosure Of Secrets",
"year": 2021
},
{
"abstract": "Online lodging platforms have become more and more popular around the world. To make a booking in these platforms, a user usually needs to select a city first, then browses among all the prospective options. To improve the user experience, understanding the zone preferences of a user's booking behavior will be helpful. In this work, we aim to predict the zone preferences of users when booking accommodations for the next travel. We have two main challenges: (1) The previous works about next information of Points Of Interest (POIs) recommendation are mainly focused on users' historical records in the same city, while in practice, the historical records of a user in the same city would be very sparse. (2) Since each city has its own specific geographical entities, it is hard to extract the structured geographical features of accommodation in different cities. Towards the difficulties, we propose DeepPredict, a zone preference prediction system. To tackle the first challenge, DeepPredict involves users' historical records in all the cities and uses a deep learning based method to process them. For the second challenge, DeepPredict uses HERE places API to get the information of POIs nearby, and processes the information with a unified way to get it. Also, the description of each accommodation might include some useful information, thus we use Sent2Vec, a sentence embedding algorithm, to get the embedding of accommodation description. Using a real-world dataset collected from Airbnb, DeepPredict can predict the zone preferences of users' next bookings with a remarkable performance. DeepPredict outperforms the state-of-the-art algorithms by 60% in macro F1-score.",
"id": "619797735244ab9dcb1496d8",
"title": "DeepPredict: A Zone Preference Prediction System for Online Lodging Platforms",
"year": 2021
},
{
"abstract": "Testicular germ cell tumors (TGCTs) are classified into two main subtypes, seminoma (SE) and non-seminoma (NSE), but their molecular distinctions remain largely unexplored. Here, we used expression data for mRNAs and microRNAs (miRNAs) from The Cancer Genome Atlas (TCGA) to perform a systematic investigation to explain the different telomere length (TL) features between NSE (n = 48) and SE (n = 55). We found that TL elongation was dominant in NSE, whereas TL shortening prevailed in SE. We further showed that both mRNA and miRNA expression profiles could clearly distinguish these two subtypes. Notably, four telomere-related genes (TelGenes) showed significantly higher expression and positively correlated with telomere elongation in NSE than SE: three telomerase activity-related genes (TERT, WRAP53 and MYC) and an independent telomerase activity gene (ZSCAN4). We also found that the expression of genes encoding Yamanaka factors was positively correlated with telomere lengthening in NSE. Among them, SOX2 and MYC were highly expressed in NSE versus SE, while POU5F1 and KLF4 had the opposite patterns. These results suggested that enhanced expression of both TelGenes (TERT, WRAP53, MYC and ZSCAN4) and Yamanaka factors might induce telomere elongation in NSE. Conversely, the relative lack of telomerase activation and low expression of independent telomerase activity pathway during cell division may be contributed to telomere shortening in SE. Taken together, our results revealed the potential molecular profiles and regulatory roles involving the TL difference between NSE and SE, and provided a better molecular understanding of this complex disease.",
"id": "5c0f7bc8da562944ac7bc437",
"title": "Distinct telomere length and molecular signatures in seminoma and non-seminoma of testicular germ cell tumor.",
"year": 2019
},
{
"abstract": "Estimating the net primary production (NPP) of vegetation is essential for eco-environment conservation and carbon cycle research. Remote sensing techniques, combined with algorithm models, have been proven to be promising methods for NPP estimation. High-precision and real-time NPP monitoring in heterogeneous areas requires high spatio-temporal resolution remote sensing data, which are not easy to acquire by single remote sensors, especially in cloudy weather. This study proposes to fuse images of different sensors to provide high spatio-temporal resolution data for NPP estimation in cloud-prone areas. Firstly, the time series Normalized Difference Vegetation Index (NDVI) with a spatial resolution of 30 m and a temporal resolution of 16 days, are obtained by the enhanced spatial and temporal adaptive reflectance fusion model (ESTARFM). Then, the time series NDVI data, combined with meteorological data are input into an improved Carnegie-Ames-Stanford Approach (CASA) model for NPP estimation. This method is validated by a case study of a heavily urbanized area, in the middle reaches of the Yangtze River in China. The results indicate that the NPP estimated by the fused NDVI data has more detailed spatial information than by using the MODIS data. The results show a strong correlation between the actual Landsat8 NDVI and the fused NDVI images, which means that the accuracy of synthetic NDVI images (a 16 day interval and a 30 m resolution) is reliable, and it can provide superior inputs for accurate estimations of a NPP time series. The correlation coefficient (R) and root mean square error between the NPP, based on the fused NDVI and the measured NPP, are 0.66 and 14.280 g C/(m(2).yr), respectively, indicating a good consistency. The small discrepancy is caused by the uncertainties of fused NDVI, measurement errors, conversion errors, and other factors in the CASA model. In this study, we achieved NPP with high spatial and temporal resolutions, which can provide higher accuracies of NPP data for analyzing the carbon cycling heavily urbanized areas, compared with similar studies using mono-temporal NPP data. The spatio-temporal fusion technique is an effective way of generating high spatio-temporal resolution images from different sensors, thereby providing enough data for NPP monitoring in urbanized areas.",
"id": "5c641f15f56def979899a57f",
"title": "Estimation of Vegetation Productivity Using a Landsat 8 Time Series in a Heavily Urbanized Area, Central China.",
"year": 2019
},
{
"abstract": "We consider the problem of secure computation, where K users, each holding an independent message, wish to compute a function on the messages without revealing any additional information. We show that to compute M generic linear independent combinations of the messages securely (i.e., for the linear secure computation problem), it suffices to use $\\min\\left(\\left\\lceil\\frac{K-M-1}{2}\\right\\rceil,~M\\right)$ randomness symbols per message symbol (i.e., the randomness cost is no larger than $\\min\\left(\\left\\lceil\\frac{K-M-1}{2}\\right\\rceil,~M\\right)$). The optimality of the achieved randomness cost remains open.",
"id": "5cb9b97aced107d4c6876230",
"title": "On the Randomness Cost of Linear Secure Computation : (Invited Presentation)",
"year": 2019
},
{
"abstract": "The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1u0027$, User $2$ wants message $W_2$ and has side-information $W_2u0027$, and $(W_1, W_1u0027, W_2, W_2u0027)$ may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio $H(W_1,W_2)/H(S)$, where $S$ is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity of computation broadcast $C_{{CB}}$. It is shown that $C_{{CB}}leq H(W_1,W_2)/left[H(W_1|W_1u0027)+H(W_2|W_2u0027)-minBig(I(W_1; W_2, W_2u0027|W_1u0027), I(W_2; W_1, W_1u0027|W_2u0027)Big)right]$. For the linear computation broadcast problem, where $W_1, W_1u0027, W_2, W_2u0027$ are comprised of arbitrary linear combinations of a basis set of independent symbols, the bound is shown to be tight. For non-linear computation broadcast, it is shown that this bound is not tight in general. Examples are provided to prove that different instances of computation broadcast that have the same entropic structure, i.e., the same entropy for all subsets of ${W_1,W_1u0027,W_2,W_2u0027}$, can have different capacities. Thus, extra-entropic structure matters even for two-user computation broadcast. The significance of extra-entropic structure is further explored through a class of non-linear computation broadcast problems where the extremal values of capacity are shown to correspond to minimally and maximally structured problems within that class.",
"id": "5cede0f8da562983788d7be2",
"title": "On the Capacity of Computation Broadcast.",
"year": 2019
},
{
"abstract": "We consider constructing capacity-achieving linear codes with minimum message size for private information retrieval (PIR) from N non-colluding databases, where each message is coded using maximum distance separable (MDS) codes, such that it can be recovered from accessing the contents of any T databases. It is shown that the minimum message size (sometimes also referred to as the sub-packetization factor) is significantly, in fact exponentially, lower than previously believed. More precisely, when K > T/ gcd(N, T) where K is the total number of messages in the system and gcd(·, ·) means the greatest common divisor, we establish, by providing both novel code constructions and a matching converse, the minimum message size as lcm(N - T, T), where lcm(·, ·) means the least common multiple. On the other hand, when K is small, we show that it is in fact possible to design codes with a message size even smaller than lcm(N - T, T).",
"id": "5cede100da562983788dfc76",
"title": "Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size",
"year": 2019
},
{
"abstract": "Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret from each individual database. The information theoretic capacity of PIR (equivalently, the reciprocal of minimum download cost) is the maximum nu...",
"id": "57a4e91aac44365e35c9803b",
"title": "The Capacity of Robust Private Information Retrieval with Colluding Databases.",
"year": 2018
},
{
"abstract": "Private information retrieval (PIR) is the problem of retrieving one message out of K messages from N noncommunicating replicated databases, where each database stores all K messages, in such a way that each database learns no information about which message is being retrieved. The capacity of PIR is the maximum number of bits of desired information per bit of downloaded information among all PIR ...",
"id": "58d82fcbd649053542fd618c",
"title": "Multiround Private Information Retrieval: Capacity and Storage Overhead.",
"year": 2018
},
{
"abstract": "Tissue-specific gene expression is critical in understanding biological processes, physiological conditions, and disease. The identification and appropriate use of tissue-specific genes (TissGenes) will provide important insights into disease mechanisms and organ-specific therapeutic targets. To better understand the tissue-specific features for each cancer type and to advance the discovery of clinically relevant genes or mutations, we built TissGDB (Tissue specific Gene DataBase in cancer) available at http://zhaobioinfo.org/TissGDB. We collected and curated 2461 tissue specific genes (TissGenes) across 22 tissue types that matched the 28 cancer types of The Cancer Genome Atlas (TCGA) from three representative tissue-specific gene expression resources: The Human Protein Atlas (HPA), Tissue-specific Gene Expression and Regulation (TiGER), and Genotype-Tissue Expression (GTEx). For these 2461 TissGenes, we performed gene expression, somatic mutation, and prognostic marker-based analyses across 28 cancer types using TCGA data. Our analyses identified hundreds of TissGenes, including genes that universally kept or lost tissue-specific gene expression, with other features: cancer type-specific isoform expression, fusion with oncogenes or tumor suppressor genes, and markers for protective or risk prognosis. TissGDB provides seven categories of annotations: TissGeneSummary, TissGeneExp, TissGene-miRNA, TissGeneMut, TissGeneNet, TissGeneProg, TissGeneClin.",
"id": "59e750890cf2f004215a4d46",
"title": "TissGDB: tissue-specific gene database in cancer.",
"year": 2018
},
{
"abstract": "We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K independent datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute, to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, obtai...",
"id": "5a260c8b17c44a4ba8a32acd",
"title": "The Capacity of Private Computation",
"year": 2018
},
{
"abstract": "The main result of this paper is that an orthogonal access scheme, such as time division multiple access achieves the all-unicast degrees of freedom (DoF) region of the topological interference management problem if and only if the network topology graph is chordal bipartite, i.e., every cycle that can contain a chord, does contain a chord. The all-unicast DoF region includes the DoF region for an...",
"id": "5a9cb65217c44a376ffb768c",
"title": "TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite.",
"year": 2018
},
{
"abstract": "This paper presents a novel Android malware classification model planned to classify and categorize Android malicious code at Drebin dataset. The amount of malicious mobile application targeting Android based smartphones has increased rapidly. In this paper, Restricted Boltzmann Machine and Deep Belief Network are used to classify malware into families of Android application. A texture-fingerprint based approach is proposed to extract or detect the feature of malware content. A malware has a unique \"image texture\" in feature spatial relations. The method uses information on texture image extracted from malicious or benign code, which are mapped to uncompressed gray-scale according to the texture image-based approach. By studying and extracting the implicit features of the API call from a large number of training samples, we get the original dynamic activity features sets. In order to improve the accuracy of classification algorithm on the features selection, on the basis of which, it combines the implicit features of the texture image and API call in malicious code, to train Restricted Boltzmann Machine and Back Propagation. In an evaluation with different malware and benign samples, the experimental results suggest that the usability of this method-using Deep Belief Network to classify Android malware by their texture images and API calls, it detects more than 94% of the malware with few false alarms. Which is higher than shallow machine learning algorithm clearly.",
"id": "5ac1827b17c44a1fda915884",
"title": "Android malicious code Classification using Deep Belief Network.",
"year": 2018
},
{
"abstract": "Estimating individual tree diameters at breast height (DBH) from delineated crowns and tree heights on the basis of airborne light detection and ranging (LiDAR) data provides a good opportunity for large-scale forest inventory. Generally, ground-based measurements are more accurate, but LiDAR data and derived DBH values can be obtained over larger areas for a relatively smaller cost if a right procedure is developed. A nonlinear least squares (NLS) regression is not an appropriate approach to predict the aboveground biomass (AGB) of individual trees from the estimated DBH because both the response variable and the regressor are subject to measurement errors. In this study, a system of compatible individual tree DBH and AGB error-in-variable models was developed using error-in-variable regression techniques based on both airborne LiDAR and field-measured datasets of individual Picea crassifolia Kom. trees, collected in northwestern China. Two parameter estimation algorithms, i.e., the two-stage error-in-variable model (TSEM) and the nonlinear seemingly unrelated regression (NSUR), were proposed for estimating the parameters in the developed system of compatible individual tree DBH and AGB error-in-variable models. Moreover, two model structures were applied to estimate AGB for comparison purposes: NLS with AGB estimation depending on DBH (NLS&DD) and NLS with AGB estimation not depending on DBH (NLS&NDD). The results showed that both TSEM and NSUR led to almost the same parameter estimates for the developed system. Moreover, the developed system effectively accounted for the inherent correlation between DBH and AGB as well as for the effects of measurement errors in the DBH on the predictions of AGB, whereas NLS&DD and NLS&NDD did not. A leave-one-out cross-validation indicated that the prediction accuracy of the developed system of compatible individual tree DBH and AGB error-in-variable models with NSUR was the highest among those estimated by the four methods evaluated, but, statistically, the accuracy improvement was not significantly different from zero. The main reason might be that, except for the measurement errors, other source errors were ignored in the modeling. This study implies that, overall, the proposed method provides the potential to expand the estimations of both DBH and AGB from individual trees to stands by combining the error-in-variable modeling and LiDAR data and improve their estimation accuracies, but its application needs to be further validated by conducting a systematical uncertainty analysis of various source errors in a future study.",
"id": "5ac1827b17c44a1fda915c5b",
"title": "Development of a System of Compatible Individual Tree Diameter and Aboveground Biomass Prediction Models Using Error-In-Variable Regression and Airborne LiDAR Data.",
"year": 2018
},
{
"abstract": "We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the information theoretic sense about which transmitter sends the message (transmitter anonymity is guaranteed). The capacity of anonymous communications is the maxi...",
"id": "5aed14d617c44a4438158c8c",
"title": "The Capacity of Anonymous Communications.",
"year": 2018
},
{
"abstract": "The continuous wave interferences (CWIs) and the narrow-band interferences (NBIs) have significantly impacted the acquisition, tracking and positioning accuracy of Beidou Navigation Satellite System (BDS) receivers. As an interference suppression technology with a simple structure and low hardware cost, the adaptive infinite-duration impulse response (IIR) notch filter has been widely employed in the receivers to mitigate the CWIs and the NBIs. However, the nonlinear phase characteristics introduced by the IIR notch filters into the navigation receivers, may cause the distortion of navigation signals. It also leads to amplitude and phase distortion of the correlation peak in acquisition and loop tracking, which consequently brings on positioning errors in the measurement domain. This problem, however, has been ignored by many previous papers. Meanwhile, some other researchers came up with the idea of equalizers and all-pass networks compensating the distortion, which is also highly infeasible. Therefore, we propose a new method of an adaptive linear phase IIR notch filter with low hardware cost which is composed of three parts the complex IIR notch filters, the IIR linear phase structure, and the adaptive and variable step-size algorithms. Applying this method, interference suppression and the correlation peak distortion compensation can be achieved with a modest increase hardware cost. This paper compares the performance of the new method with other IIR filters in both CWI and NBI scene and presents the effects of its parameters on the anti-jamming performance. Simulation results show that the proposed module has better anti-jamming performance in NBI scene and can compensate for the correlation peak distortion in the meantime.",
"id": "5b3d98c717c44a510f800fef",
"title": "A BDS Interference Suppression Technique Based on Linear Phase Adaptive IIR Notch Filters.",
"year": 2018
},
{
"abstract": "We consider the storage-retrieval rate tradeoff in private information retrieval systems using a Shannon-theoretic approach. Our focus is on the canonical two-message two-database case, for which a coding scheme based on random codebook generation, joint typicality encoding, and the binning technique is proposed. It is first shown that when the retrieval rate is kept optimal, the proposed non-linear scheme uses less storage than the optimal linear scheme. Since the other extreme point corresponding to using the minimum storage requires both messages to be retrieved, the performance through space-sharing of the two points can also be achieved. However, using the proposed scheme, further improvement can be achieved over this simple strategy. Although the random-coding based scheme has a diminishing but nonzero probability of error, the coding error can be eliminated if variable-length codes are allowed. Novel outer bounds are finally provided and used to establish the superiority of the non-linear codes over linear codes.",
"id": "5b8c9f0717c44af36f8b15ea",
"title": "A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems",
"year": 2018
},
{
"abstract": "We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and show that it has the minimum message size (being one less than the number of servers) and the minimum upload cost (being roughly linear in the number of messages) among a general class of capacity-achieving codes, and in particular, among all capacity-achieving linear codes. Different from existing code constructions, the proposed code is asymmetric, and this asymmetry appears to be the key factor leading to the optimal message size and the optimal upload cost. The converse results on the message size and the upload cost are obtained by a strategic analysis of the information theoretic proof of the PIR capacity, from which a set of critical properties of any capacity-achieving code in the code class of interest is extracted.",
"id": "5b8c9f5317c44af36f8b74f9",
"title": "Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost",
"year": 2018
},
{
"abstract": "Land degradation and desertification in arid and semi-arid areas is of great concern. Accurately mapping percentage vegetation cover (PVC) of the areas is critical but challenging because the areas are often remote, sparsely vegetated, and rarely populated, and it is difficult to collect field observations of PVC. Traditional methods such as regression modeling cannot provide accurate predictions of PVC in the areas. Nonparametric constant k-nearest neighbors (Cons_kNN) has been widely used in estimation of forest parameters and is a good alternative because of its flexibility. However, using a globally constant k value in Cons_kNN limits its ability of increasing prediction accuracy because the spatial variability of PVC in the areas leads to spatially variable k values. In this study, a novel method that spatially optimizes determining the spatially variable k values of Cons_kNN, denoted with Opt_kNN, was proposed to map the PVC in both Duolun and Kangbao County located in Inner Mongolia and Hebei Province of China, respectively, using Landsat 8 images and sample plot data. The Opt_kNN was compared with Cons_kNN, a linear stepwise regression (LSR), a geographically weighted regression (GWR), and random forests (RF) to improve the mapping for the study areas. The results showed that (1) most of the red and near infrared band relevant vegetation indices derived from the Landsat 8 images had significant contributions to improving the mapping accuracy; (2) compared with LSR, GWR, RF and Cons_kNN, Opt_kNN resulted in consistently higher prediction accuracies of PVC and decreased relative root mean square errors by 5%, 11%, 5%, and 3%, respectively, for Duolun, and 12%, 1%, 23%, and 9%, respectively, for Kangbao. The Opt_kNN also led to spatially variable and locally optimal k values, which made it possible to automatically and locally optimize k values; and (3) the RF that has become very popular in recent years did not perform the predictions better than the Opt_kNN for the both areas. Thus, the proposed method is very promising to improve mapping the PVC in the arid and semi-arid areas.",
"id": "5bbacb8817c44aecc4eae9f3",
"title": "Optimizing kNN for Mapping Vegetation Cover of Arid and Semi-Arid Areas Using Landsat Images.",
"year": 2018
},
{
"abstract": "Today's cities are filled with sensors to get real-time data on all aspects of the city. Each of these data sources reflects one aspect of the city and provides support for city computing. However, these data are owned by different organizations or companies and stored in different locations of the Internet. It takes lots of efforts for researchers to obtained all of these data. At the same time, a single data set can only represent one side of a city's activities, but combining multiple data allows us to stand in a better perspective overlooking the city we study. We designed a city data aggregation platform to aggregate several data sources about city computing to get a more comprehensive understanding of the city, to discover pattern that are not reflected in a single data set, and facilitate researchers to access data from multiple sources.\n\n",
"id": "5bdc315817c44a1f58a06562",
"title": "CitySense: A Data Collection Approach for City Computing Applications.",
"year": 2018
},
{
"abstract": "Rice is one of the world's major staple foods, especially in China. Highly accurate monitoring on rice-producing land is, therefore, crucial for assessing food supplies and productivity. Recently, the deep-learning convolutional neural network (CNN) has achieved considerable success in remote-sensing data analysis. A CNN-based paddy-rice mapping method using the multitemporal Landsat 8, phenology data, and land-surface temperature (LST) was developed during this study. First, the spatial-temporal adaptive reflectance fusion model (STARFM) was used to blend the moderate-resolution imaging spectroradiometer (MODIS) and Landsat data for obtaining multitemporal Landsat-like data. Subsequently, the threshold method is applied to derive the phenological variables from the Landsat-like (Normalized difference vegetation index) NDVI time series. Then, a generalized single-channel algorithm was employed to derive LST from the Landsat 8. Finally, multitemporal Landsat 8 spectral images, combined with phenology and LST data, were employed to extract paddy-rice information using a patch-based deep-learning CNN algorithm. The results show that the proposed method achieved an overall accuracy of 97.06% and a Kappa coefficient of 0.91, which are 6.43% and 0.07 higher than that of the support vector machine method, and 7.68% and 0.09 higher than that of the random forest method, respectively. Moreover, the Landsat-derived rice area is strongly correlated (R-2 = 0.9945) with government statistical data, demonstrating that the proposed method has potential in large-scale paddy-rice mapping using moderate spatial resolution images.",
"id": "5c207b5fdf5b8c0b3cfa7a77",
"title": "Mapping Paddy Rice Using a Convolutional Neural Network (CNN) with Landsat 8 Datasets in the Dongting Lake Area, China.",
"year": 2018
},
{
"abstract": "A locally decodable code (LDC) maps \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$K$ </tex-math></inline-formula>\n source symbols, each of size \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$L_{w}$ </tex-math></inline-formula>\n bits, to \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$M$ </tex-math></inline-formula>\n coded symbols, each of size \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$L_{x}$ </tex-math></inline-formula>\n bits, such that each source symbol can be decoded from \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$N \\leq M$ </tex-math></inline-formula>\n coded symbols. A perfectly smooth LDC further requires that each coded symbol is uniformly accessed when we decode any one of the messages. The ratio \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$L_{w}/L_{x}$ </tex-math></inline-formula>\n is called the symbol rate of an LDC. The highest possible symbol rate for a class of LDCs is called the capacity of that class. It is shown that given \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$K, N$ </tex-math></inline-formula>\n, the maximum value of capacity of perfectly smooth LDCs, maximized over all code lengths \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$M$ </tex-math></inline-formula>\n, is \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$C^{*}=N\\left ({1+1/N+1/N^{2}+\\cdots +1/N^{K-1}}\\right)^{-1}$ </tex-math></inline-formula>\n. Furthermore, given \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$K, N$ </tex-math></inline-formula>\n, the minimum code length \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$M$ </tex-math></inline-formula>\n for which the capacity of a perfectly smooth LDC is \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$C^{*}$ </tex-math></inline-formula>\n is shown to be \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$M = N^{K}$ </tex-math></inline-formula>\n. Both of these results generalize to a broader class of LDCs, called universal LDCs. The results are then translated into the context of PIR\n<sub xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>\n, i.e., Private Information Retrieval subject to maximum (rather than average) download cost metric. It is shown that the minimum upload cost of capacity achieving PIR\n<sub xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>\n schemes is \n<inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$(K-1)\\log N$ </tex-math></inline-formula>\n. The results also generalize to a variation of the PIR problem, known as Repudiative Information Retrieval (RIR).",
"id": "5c2c7a9217c44a4e7cf315ec",
"title": "On the Capacity of Locally Decodable Codes",
"year": 2018
},
{
"abstract": "The capacity of symmetric private information retrieval with K messages, N servers (out of which any T may collude) and an omniscient Byzantine adversary (who can corrupt any B answers) is shown to be (1-) T+2B/N [1], under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to (1-) T+2B/N.",
"id": "5c49cbec3a55acf15ebda8e5",
"title": "The ϵ-error Capacity of Symmetric PIR with Byzantine Adversaries",
"year": 2018
},
{
"abstract": "In this note we introduce a new class of refined Eulerian polynomials defined by $$A_n(p,q)=sum_{piinmathfrak{S}_n}p^{{rm des}_{{rm odd}}(pi)}q^{{rm des}_{{rm even}}(pi)},$$ where ${rm des}_{{rm odd}}(pi)$ and ${rm des}_{{rm even}}(pi)$ enumerate the number of descents of permutation $pi$ in odd and even positions, respectively. We show that the refined Eulerian polynomials $A_{2k+1}(p,q),k=0,1,2,ldots,$ and $(1+q)A_{2k}(p,q),k=1,2,ldots,$ have a nice symmetry property.",
"id": "5c757388f56def97988aaf0e",
"title": "A new class of refined Eulerian polynomials.",
"year": 2018
},
{
"abstract": "$X$-secure and $T$-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the useru0027s privacy is guaranteed against collusion among up to $T$ servers. The capacity of XSTPIR is characterized for arbitrary number of servers $N$, and arbitrary security and privacy thresholds $X$ and $T$, in the limit as the number of messages $Krightarrowinfty$. Capacity is also characterized for any number of messages if either $N=3, X=T=1$ or if $Nleq X+T$. Insights are drawn from these results, about aligning versus decoding noise, dependence of PIR rate on field size, and robustness to symmetric security constraints. In particular, the idea of cross subspace alignment, i.e., introducing a subspace dependence between Reed-Solomon code parameters, emerges as the optimal way to align undesired terms while keeping desired terms resolvable.",
"id": "5c8f89e24895d9cbc65081e3",
"title": "Cross Subspace Alignment and the Asymptotic Capacity of X-Secure T-Private Information Retrieval.",
"year": 2018
},
{
"abstract": "Due to many factors, the quality of students in higher vocational colleges has fallen sharply. It's a question worth studying to get more students to listen, study, understand and learn in class The traditional \"task-driven teaching method\" cannot fully adapt to the present higher vocational classroom teaching. This paper introduces the \"task-driven small-step fast-forward teaching method\" to improve the traditional \"task-driven teaching method,\" and verifies with two courses in practice.",
"id": "5ce2cce4ced107d4c62cb2da",
"title": "The Practice Of \"Task-Driven Small-Step Fast-Forward Teaching Method\" In Computer Course",
"year": 2018
},
{
"abstract": "A private information retrieval (PIR) scheme is a mechanism that allows a user to retrieve any one out of K messages from N non-communicating replicated databases, each of which stores all K messages, without revealing anything (in the information theoretic sense) about the identity of the desired message index to any individual database. If the size of each message is L bits and the total downloa...",
"id": "58437725ac44360f1082fc67",
"title": "Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length.",
"year": 2017
},
{
"abstract": "The distribution of forest biomass in a river basin usually has obvious spatial heterogeneity in relation to the locations of the upper and lower reaches of the basin. In the subtropical region of China, a large amount of forest biomass, comprising diverse forest types, plays an important role in maintaining the balance of the regional carbon cycle. However, accurately estimating forest ecosystem aboveground biomass density (AGB) and mapping its spatial variability at a scale of river basin remains a great challenge. In this study, we attempted to map the current AGB in the Xiangjiang River Basin in central southern China. Three approaches, including a multivariate linear regression (MLR) model, a logistic regression (LR) model, and an improved k-nearest neighbors (kNN) algorithm, were compared to generate accurate estimates and their spatial distribution of forest ecosystem AGB in the basin. Forest inventory data from 782 field plots across the basin and remote sensing images from Landsat 5 in the same period were combined. A stepwise regression method was utilized to select significant spectral variables and a leave-one-out cross-validation (LOOCV) technique was employed to compare their predictions and assess the methods. Results demonstrated the high spatial heterogeneity in the distribution of AGB across the basin. Moreover, the improved kNN algorithm with 10 nearest neighbors showed stronger ability of spatial interpolation than other two models, and provided greater potential of accurately generating population and spatially explicit predictions of forest ecosystem AGB in the complicated basin.",
"id": "599c7a36601a182cd269c38e",
"title": "Mapping Forest Ecosystem Biomass Density for Xiangjiang River Basin by Combining Plot and Remote Sensing Data and Comparing Spatial Extrapolation Methods.",
"year": 2017
},
{
"abstract": "In order to gain new insights into multiple-input- multiple-output (MIMO) interference networks, the optimality of Σk=1K Mk/2 (half the cake per user) degrees of freedom is explored for a K-user MIMO interference channel where the cross-channels have arbitrary rank constraints, and the kth transmitter and receiver are equipped with Mk antennas each. The result consolidates and significantly genera...",
"id": "5a260c7317c44a4ba8a2eb56",
"title": "Replication-Based Outer Bounds: On the Optimality of \"Half the Cake\" for Rank-Deficient MIMO Interference Networks.",
"year": 2017
},
{
"abstract": "An extension of private information retrieval (PIR) with colluding servers is considered. The N servers are partitioned into M disjoint sets, such that collusion can only occur between servers that belong to the same set. Specifically, the m-th set is comprised of N-m servers, of which any T-m can collude. The capacity of this PIR problem is shown to be C = (1 + (Sigma(M)(m-1) N-m/T-m)(-1) +...+(Sigma(M)(m-1) N-m/T-m)(-(K-1)))(-1).",
"id": "5a73cb6317c44a0b30357c55",
"title": "The Capacity of Private Information Retrieval with Disjoint Colluding Sets.",
"year": 2017
},
{
"abstract": "A (K, N, T, Kc) instance of private information retrieval from MDS coded data with colluding servers (in short, MDS-TPIR), is comprised of K messages and N distributed servers. Each message is separately encoded through a (Kc, N) MDS storage code. A user wishes to retrieve one message, as efficiently as possible, while revealing no information about the desired message index to any colluding set o...",
"id": "5c8cd72d4895d9cbc6253f30",
"title": "Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al .",
"year": 2017
},
{
"abstract": "It has been recently shown by Geng et al. that in a K-user Gaussian interference network, if for each user, the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all signal strengths measured in dB scale), then power control and treating interference as noise (TIN) is sufficient to achieve the ...",
"id": "53e9be72b7602d9704b37517",
"title": "On the Optimality of Treating Interference as Noise for K user Parallel Gaussian Interference Networks.",
"year": 2016
},
{
"abstract": "In the private information retrieval (PIR) problem, a user wishes to retrieve, as efficiently as possible, one out of $K$ messages from $N$ non-communicating databases (each holds all $K$ messages) while revealing nothing about the identity of the desired message index to any individual database. The information theoretic capacity of PIR is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. For $K$ messages and $N$ databases, we show that the PIR capacity is $(1+1/N+1/N^{2}+cdots +1/N^{K-1})^{-1}$ . A remarkable feature of the capacity achieving scheme is that if we eliminate any subset of messages (by setting the message symbols to zero), the resulting scheme also achieves the PIR capacity for the remaining subset of messages.",
"id": "573696056e3b12023e518660",
"title": "The Capacity of Private Information Retrieval.",
"year": 2016
},
{
"abstract": "Hierarchical modulation (HM) is a layered modulation scheme, which is widely employed by the telecommunication industry. The higher flexibility and lower complexity of the HM scheme has its dramatic benefits for wireless communications, hence the achievable performance of cooperation-aided coded HM has drawn substantial research interests. In this study, a triple-layer HM-aided four-node cooperati...",
"id": "5736966d6e3b12023e579e5e",
"title": "Discrete-input continuous-output memoryless channel capacity of cooperative hierarchical modulation.",
"year": 2016
},
{
"abstract": "Colour-shift keying (CSK) constitutes an important modulation scheme conceived for the visible light communications (VLC). The signal constellation of CSK relies on three different-color light sources invoked for information transmission. The CSK constellation has been optimized for minimizing the bit error rate, but no effort has been invested in investigating the feasibility of CSK aided unequal error protection (UEP) schemes conceived for video sources. Hence, in this treatise, we conceive a hierarchical CSK (HCSK) modulation scheme based on the traditional CSK, which is capable of generating interdependent layers of signals having different error probability, which can be readily reconfigured by changing its parameters. Furthermore, we conceived an HCSK design example for transmitting scalable video sources with the aid of a recursive systematic convolutional (RSC) code. An optimization method is conceived for enhancing the UEP and for improving the quality of the received video. Our simulation results show that the proposed optimized-UEP 16-HCSK-RSC system outperforms the traditional equal error protection scheme by similar to 1.7 dB of optical SNR at a peak signal-to-noise ratio of 37 dB, while optical SNR savings of up to 6.5 dB are attained at a lower PSNR of 36 dB.",
"id": "57a4e908ac44365e35c95285",
"title": "Hierarchical Colour-Shift-Keying Aided Layered Video Streaming for the Visible Light Downlink.",
"year": 2016
},
{
"abstract": "Private information retrieval (PIR) is the problem of retrieving, as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret from each individual database. Symmetric PIR (SPIR) is a generalization of PIR to include the requirement that beyond the desired message, the us...",
"id": "57a4e91aac44365e35c97e41",
"title": "The Capacity of Symmetric Private Information Retrieval.",
"year": 2016
},
{
"abstract": "Although the association classification approach based on frequent patterns has been recently presented, the majority of the methods proposed so far do not deal with the quantitative data directly, and also do not consider the problem of exploring these rules to predict the future behavior of certain variables based on some other known variables. In light of these issues, a new algorithm based on quantitative association rules tree(CRQAR-tree) that synergizes association classification and rule-based TS fuzzy inference is developed to generate the rule tree structure and realize the classification and regression prediction. The classification and regression quantitative association rules are built on the improved Apriori algorithm which offered an efficient way for frequent itemsets learning. To manage the model complexity without sacrificing its predictive accuracy, CRQAR-tree can effectively match the rules to predict new samples that have little contribution over time. The proposed approach is applied to UCI benchmark datasets and a real application, the simulation results show that the performance of the CRQAR-tree is better than other methods, so it is a promising classification and regression algorithm.",
"id": "57d06393ac44367354288c93",
"title": "A classification and regression algorithm based on quantitative association rule tree.",
"year": 2016
},
{
"abstract": "Base on the power flow formulations, a new power flow model that allows for power exchanges among subareas of network and automation generation control in each subarea, is established. The proposed power flow model is rendering by unified newton iteration formulation. Parameters representing the level or allocation of the unbalancing power are introduced to indicate the performance of the generators that participate in the automation generation control. The power exchange formulations for subareas are derived from the power flow equations of the interconnected branches. The Newton iteration method is used to solve the equations that consist of node power injection equations and interconnected power equations. Because of the consideration of the power balance in each subarea and the order of power exchange, the presented method is applicable for power flow problems of interconnected power networks, and is in particular applicable for the system analysis and calculation that based on the uniform iteration formulation. Case studies of IEEE 5 bus test system and IEEE RTS96 system illustrate the efficiency and the convergence of the proposed method.",
"id": "58437783ac44360f10842480",
"title": "Power flow calculation considering power exchange control for multi-area interconnection power networks.",
"year": 2016
},
{
"abstract": "Combining sample plot and image data has been widely used to map forest carbon density at local, regional, national and global scales. When mapping is conducted using multiple spatial resolution images at different scales, field observations have to be collected at the corresponding resolutions to match image values in pixel sizes. Given a study area, however, to save time and cost, field observations are often collected from sample plots having a fixed size. This will lead to inconsistency of spatial resolutions between sample plots and image pixels and impede the mapping and product quality assessment. In this study, a methodological framework was proposed to conduct mapping and accuracy assessment of forest carbon density at four spatial resolutions by combining remotely sensed data and reference values of sample plots from a systematical, nested and clustering sampling design. This design led to one field observation dataset at a 30 m spatial resolution sample plot level and three other reference datasets by averaging the observations from three, five and seven sample plots within each of 250 m and 500 m sub-blocks and 1000 m blocks, respectively. The datasets matched the pixel values of a Landsat 8 image and three MODIS products. A sequential Gaussian co-simulation (SGCS) and a sequential Gaussian block co-simulation (SGBCS), an upscaling algorithm, were employed to map forest carbon density at the spatial resolutions. This methodology was tested for mapping forest carbon density in Huang-Feng-Qiao forest farm of You County in Eastern Hunan of China. The results showed that: First, all of the means of predicted forest carbon density values at four spatial resolutions fell in the confidence intervals of the reference data at a significance level of 0.05. Second, the systematical, nested and clustering sampling design provided the potential to obtain spatial information of forest carbon density at multiple spatial resolutions. Third, the relative root mean square error (RMSE) of predicted values at the plot level was much greater than those at the sub-block and block levels. Moreover, the accuracies of the up-scaled estimates were much higher than those from previous studies. In addition, at the same spatial resolution, SGCSWA (scaling up the SGCS and Landsat derived 30 m resolution map using a window average (WA)) resulted in smallest relative RMSEs of up-scaled predictions, followed by combinations of Landsat images and SGBCS. The accuracies from both methods were significantly greater than those from the combinations of MODIS images and SGCS. Overall, this study implied that the combinations of Landsat 8 images and SGCSWA or SGBCS with the systematical, nested and clustering sampling design provided the potential to formulate a methodological framework to map forest carbon density and conduct accuracy assessment at multiple spatial resolutions. However, this methodology needs to be further refined and examined in other forest landscapes.",
"id": "599c7a34601a182cd269bd9f",
"title": "Multi-Resolution Mapping and Accuracy Assessment of Forest Carbon Density by Combining Image and Plot Data from a Nested and Clustering Sampling Design.",
"year": 2016
},
{
"abstract": "Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret from each individual database. T-private PIR is a generalization of PIR to include the requirement that even if any T of the N databases collude, the identity of the retrieved message remains completely unknown to them. The information theoretic capacity of T-private PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. We show that the capacity of T-private PIR is (1 + T/N + T-2/N-2 + ... + TK-1/NK-1)(-1).",
"id": "599c7e04601a182cd286ef1d",
"title": "The Capacity Of Private Information Retrieval With Colluding Databases",
"year": 2016
},
{
"abstract": " The main result of this work is that fractional coloring (orthogonal access) achieves the all-unicast capacity (degrees of freedom (DoF)) region of the index coding (topological interference management (TIM)) problem if and only if the bipartite network topology graph (with sources on one side and destinations on the other, and edges identifying presence of nontrivial channels whose communication capacity is not zero or infinity) is chordal, i.e., every cycle that can contain a chord, does contain a chord. The all-unicast capacity (DoF) region includes the capacity (DoF) region for any arbitrary choice of a unicast message set, so e.g., the results of Maleki and Jafar on the optimality of orthogonal access for the sum-capacity (DoF) of one-dimensional convex networks are recovered as a special case. ",
"id": "5550416c45ce0a409eb3b218",
"title": "Fractional Coloring (Orthogonal Access) achieves All-unicast Capacity (DoF) Region of Index Coding (TIM) if and only if Network Topology is Chordal.",
"year": 2015
},
{
"abstract": "Accurately mapping forest carbon density by combining sample plots and remotely sensed images has become popular because this method provides spatially explicit estimates. However, mixed pixels often impede the improvement of the estimation. In this letter, regression modeling and spectral unmixing analysis were integrated to improve the estimation of forest carbon density for the You County of Hu...",
"id": "5736955b6e3b12023e483f55",
"title": "Improvement of Forest Carbon Estimation by Integration of Regression Modeling and Spectral Unmixing of Landsat Data.",
"year": 2015
},
{
"abstract": "Compared with airborne laser scanning, terrestrial laser scanning (TLS) offers ground-based point cloud data of trees and provides greater potential to accurately estimate tree and stand parameters. However, there is a lack of effective methods to accurately identify locations of individual trees from TLS point cloud data. It is also unknown whether the estimation accuracy of the parameters, inclu...",
"id": "5736955c6e3b12023e484338",
"title": "Retrieval and Accuracy Assessment of Tree and Stand Parameters for Chinese Fir Plantation Using Terrestrial Laser Scanning.",
"year": 2015
},
{
"abstract": "Hierarchical modulation (HM), which is also known as layered modulation, has been widely adopted across the telecommunication industry. Its strict backward compatibility with single-layer modems and its low complexity facilitate the seamless upgrading of wireless communication services. The specific features of HM may be conveniently exploited for improving the throughput/information-rate of the system without requiring any extra bandwidth, while its complexity may even be lower than that of the equivalent system relying on conventional modulation schemes. As a recent research trend, the potential employment of HM in the context of cooperative communications has also attracted substantial research interests. Motivated by the lower complexity and higher flexibility of HM, we provide a comprehensive survey and conclude with a range of promising future research directions. Our contribution is the conception of a new cooperative communication paradigm relying on turbo trellis-coded modulation-aided twin-layer HM-16QAM and the analytical performance investigation of a four-node cooperative communication network employing a novel opportunistic routing algorithm. The specific performance characteristics evaluated include the distribution of delay, the outage probability, the transmit power of each node, the average packet power consumption, and the system throughput. The simulation results have demonstrated that when transmitting the packets formed by layered modulated symbol streams, our opportunistic routing algorithm is capable of reducing the transmit power required for each node in the network compared with that of the system using the traditional opportunistic routing algorithm. We have also illustrated that the minimum packet power consumption of our system using our opportunistic routing algorithm is also lower than that of the system using the traditional opportunistic routing algorithm.",
"id": "5736959c6e3b12023e4bafb3",
"title": "Five Decades of Hierarchical Modulation and Its Benefits in Relay-Aided Networking.",
"year": 2015
},
{
"abstract": "By introducing a novel outer bound, we find a sufficient condition for optimality of Sigma(K)(k=1) M-k/2 degrees of freedom (half the cake per user) for a K-user multiple-input-multiple-output (MIMO) interference channel (IC) where the cross-channels have arbitrary rank constraints, and the kth transmitter and receiver are equipped with M-k antennas each. The result consolidates and significantly generalizes results from prior studies by Krishnamurthy et al., of rank-deficient interference channels where all users have M antennas; and by Tang et al., of full rank interference channels where the kth user pair has M-k antennas.",
"id": "573697936e3b12023e67855e",
"title": "On the Optimality of \"Half the Cake\" for K-User Rank-Deficient Mk x Mk Interference Channel.",
"year": 2015
},
{
"abstract": "We study the degrees of freedom (DoF) of the layered 2 × 2 × 2 multiple-input-multiple-output (MIMO) interference channel where each node is equipped with arbitrary number of antennas, the channels between the nodes have arbitrary rank constraints, and subject to the rank-constraints the channel coefficients can take arbitrary values. The DoF outer bounds reveal a fundamental rank-matching phenome...",
"id": "5c8749214895d9cbc6fabbb8",
"title": "Rank Matching for Multihop Multiflow.",
"year": 2015
},
{
"abstract": "In this paper we define a cyclic analogue of the MFS-action on derangements, and give a combinatorial interpretation of the expansion of the n-th derangement polynomial on the basis {q(k)(1+q)(n-1-2)}, k = 0, 1, ... , left perpendicular(n - 1)/2 right perpendicular.",
"id": "53e9aaf3b7602d9703475382",
"title": "A Group Action on Derangements.",
"year": 2014
},
{
"abstract": "In this paper, we propose a novel “genie chains” approach to obtain information theoretic degrees of freedom (DoF) outer bounds for MIMO wireless interference networks. This new approach creates a chain of mappings from genie signals provided to a receiver to the exposed signal spaces at that receiver, and then the exposed signal spaces serve as the genie signals for the next receiver in the chain subject to certain linear independence requirements. Our approach essentially converts an information theoretic DoF outer bound problem into a linear algebra problem. Several applications of the genie chains approach are presented.",
"id": "53e9acf6b7602d97036d28a1",
"title": "Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks.",
"year": 2014
},
{
"abstract": "It has been shown recently by Geng et al. that in a K user Gaussian interference network, if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user (all signal strengths measured in dB scale), then power control and treating interference as noise (TIN) is sufficient to achieve the entire generalized degrees of freedom (GDoF) region. Motivated by the intuition that the deterministic model of Avestimehr et al. (ADT deterministic model) is particularly suited for exploring the optimality of TIN, the results of Geng et al. are first re-visited under the ADT deterministic model, and corresponding TIN optimality results are obtained. Next, we focus on the extension of these results to ADT deterministic parallel interference networks, from a sum-capacity perspective. To this end, we interpret the explicit characterization of the sum-capacity of a TIN optimal network (without parallel channels) as a minimum weighted matching problem in combinatorial optimization, and obtain a simple characterization in terms of a partition of the interference network into vertex-disjoint cycles. Aided by insights from the cyclic partition, the sum-capacity optimality of TIN for K user parallel interference networks is characterized for the ADT deterministic model. Subject to a mild invertibility condition the optimality of TIN is shown to extend to parallel networks in a separable fashion.",
"id": "555048db45ce0a409eb720e5",
"title": "On the optimality of treating interference as noise for parallel deterministic interference networks",
"year": 2014
},
{
"abstract": "The topological interference management problem refers to the study of the DoF of partially connected wireless communication networks with no channel state information at the transmitters (no CSIT) beyond the network topology, i.e., a knowledge of which channel coefficients are non-zero. While the problem is originally studied with single input sources and single output destinations (SISO), in this work we explore the implications of multiple inputs and multiple outputs (MIMO), highlighting fundamental differences and new phenomena.",
"id": "555048db45ce0a409eb720c4",
"title": "Topological interference management with multiple antennas",
"year": 2014
},
{
"abstract": "The robust principles of treating interference as noise (TIN) when it is sufficiently weak, and avoiding it when it is not, form the background for this work. Combining TIN with the topological interference management (TIM) framework that identifies optimal interference avoidance schemes, a baseline TIM-TIN approach is proposed which decomposes a network into TIN and TIM components, allocates the signal power levels to each user in the TIN component, allocates signal vector space dimensions to each user in the TIM component, and guarantees that the product of the two is an achievable number of signal dimensions available to each user in the original network.",
"id": "53e99a5cb7602d97022c7949",
"title": "Multilevel topological interference management",
"year": 2013
},
{
"abstract": " An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon information inequalities are necessary for capacity characterization. In particular, this includes the first known example of a multiple unicast (one destination per message) index coding problem where non-Shannon information inequalities are shown to be necessary. The simplest multiple unicast example has 7 edges in the alignment graph and 11 messages. The simplest multiple groupcast (multiple destinations per message) example has 6 edges in the alignment graph, 6 messages, and 10 receivers. For both the simplest multiple unicast and multiple groupcast instances, the best outer bound based on only Shannon inequalities is $\\frac{2}{5}$, which is tightened to $\\frac{11}{28}$ by the use of the Zhang-Yeung non-Shannon type information inequality, and the linear capacity is shown to be $\\frac{5}{13}$ using the Ingleton inequality. Conversely, identifying the minimal challenging aspects of the index coding problem allows an expansion of the class of solved index coding problems up to (but not including) these instances. ",
"id": "53e99cb4b7602d9702565ca4",
"title": "Index Coding Capacity: How far can one go with only Shannon Inequalities?",
"year": 2013
},
{
"abstract": "Let NCn denote the set of noncrossing partitions of [n]={1,2,…,n}. By defining a group action on the set NCn, we give a combinatorial interpretation of the expansion of the n-th Narayana polynomial on the basis {qk(1+q)n−1−2k},k=0,1,…,⌊(n−1)/2⌋.",
"id": "53e99fe9b7602d97028c9f64",
"title": "A group action on noncrossing partitions.",
"year": 2013
},
{
"abstract": "The topological interference management problem refers to the study of the capacity of partially connected linear (wired and wireless) communication networks with no channel state information at the transmitters (no CSIT) beyond the network topology, i.e., a knowledge of which channel coefficients are zero (weaker than the noise floor in the wireless case). While the problem is originally studied with fixed topology, in this work we explore the implications of varying connectivity, through a series of simple and conceptually representative examples. Specifically, we highlight the synergistic benefits of coding across alternating topologies.",
"id": "53e9b3f6b7602d9703ee4d91",
"title": "Topological Interference Management With Alternating Connectivity",
"year": 2013
},
{
"abstract": "We show that an $M\\\\times N$ user MIMO $X$ network with $A$ antennas at each node has $A\\\\left({{MN}\\\\over{M+N-1}}\\\\right)$ degrees of freedom (DoF), thus resolving in this case a discrepancy between the spatial scale invariance conjecture (scaling the number of antennas at each node by a constant factor will scale the total DoF by the same factor) and a decomposability property of overconstrained wireless networks. While the best previously known general DoF outer bound is consistent with the spatial invariance conjecture, the best previously known general DoF inner bound, inspired by the $K$ user MIMO interference channel, was based on the decomposition of every transmitter and receiver into multiple single antenna nodes, transforming the network into an $AM\\\\times AN$ user SISO $X$ network. While such a decomposition is DoF optimal for the $K$ user MIMO interference channel, a gap remained between the best inner and outer bounds for the MIMO $X$ channel. Here we close this gap with the new insight that the MIMO $X$ network is only one-sided decomposable, i.e., either all the transmitters or all the receivers (but not both) can be decomposed by splitting multiple antenna nodes into multiple single antenna nodes without loss of DoF. The result is extended to SIMO and MISO $X$ networks as well and in each case the DoF results satisfy the spatial scale invariance property.",
"id": "53e9b732b7602d97042c75f0",
"title": "Degrees of Freedom of MIMO $X$ Networks: Spatial Scale Invariance and One-Sided Decomposability",
"year": 2013
},
{
"abstract": "A cooperative communication system assisted by Turbo Trellis-Coded Modulation (TTCM) relying on Hierarchical Modulation (HM) is proposed, which invokes iterative soft decoding. Our results demonstrated that the performance of the single-relay aided cooperative system can be improved by at least 4 dB at a BER of 10−5.",
"id": "53e9bd5fb7602d97049fafec",
"title": "Turbo Trellis Coded hierarchical modulation for cooperative communications",
"year": 2013
},
{
"abstract": "This paper defines mapping rules from UML sequence diagrams to Aspect-Oriented Data Concerned Petri Nets (AODCPNs). Each mapping rule for one type of element in a sequence diagram is defined both in graphical and formal syntax forms. Algorithms for aspects automatically generating from messages events are proposed. Weaving rules are used for composing data concerned Petri nets. Composing algorithms are proposed based on aspects and weaving rules. A case study shows the applicability and feasibility of our method.",
"id": "53e99c60b7602d970250ffbf",
"title": "Modelling UML sequence diagrams with aspect-oriented extended Petri nets",
"year": 2012
},
{
"abstract": "We show that an M x N user MIMO X network with A antennas at each node has A (MN/M + N - 1) degrees of freedom (DoF), thus settling the spatial scale invariance conjecture (scaling the number of antennas at each node by a constant factor will scale the total DoF by the same factor) for this class of networks. The previously known best general DoF inner bound, inspired by the K user interference channel, was based on the decomposition of every transmitter and receiver into multiple single antenna nodes, transforming the network into an AM xAN user SISO X network. While such a decomposition is DoF optimal for the K user interference channel, a gap remained between the best inner and outer bound for the MIMO X channel. Here we close this gap with the new insight that the MIMO X network is only one-sided decomposable, i.e., either all the transmitters or all the receivers (but not both) can be decomposed by splitting multiple antenna nodes into multiple single antenna nodes without loss of DoF. The result is extended to SIMO and MISO X networks as well and in each case the DoF results satisfy the spatial scale invariance property. In addition, the feasibility of linear interference alignment is investigated based only on spatial beamforming without symbol extensions. Similar to MIMO interference networks, we show that when the problem is improper, it is infeasible.",
"id": "53e99daab7602d9702668e27",
"title": "Degrees Of Freedom Of Mimo X Networks: Spatial Scale Invariance, One-Sided Decomposability And Linear Feasibility",
"year": 2012
},
{
"abstract": "A Turbo Trellis-Coded Modulation (TTCM) aided superposition modulation scheme is conceived for a Decode-and-Forward (DAF) based cooperative communication system. More specifically, two source nodes communicate simultaneously with the same destination node via a relay node. Superposition modulation is invoked at the relay node in order to combine and simultaneously transmit the two source signals to the destination node. Hence two timeslots are used to transmit two source signals. Extrinsic Information Transfer (EXIT) charts and power sharing techniques are employed in our design. The performance of the proposed scheme is investigated for transmission over uncorrelated Rayleigh fading channels, which is within about 2 dB of the corresponding capacity.",
"id": "53e9a1a8b7602d9702a9b7eb",
"title": "Superposition Coded Modulation for Cooperative Communications",
"year": 2012
},
{
"abstract": "We explore the degrees of freedom (DoF) of the K >; 3 user MT × MR MIMO Gaussian interference channel where each transmitter is equipped with MT and each receiver is equipped with MR antennas. Expressing the DoF characterization as a function of the ratio γ = M/N, where M = min(MT, MR) and N = max(MT, MR), we find that when γ ≤ γo = K-1/K(K-2) = γo, the DoF value per user is piecewise linear depending on M and N alternately, similar to the DoF characterization for K = 3 which has been previously obtained. The regime γ >; γo, which is the dominant regime for K >; 3 users and is not encountered in the K = 3 user setting, is the main focus of this paper. Our DoF results in this regime are obtained through a novel “genie chains” approach, which is the main contribution of this work. It is a chain of mappings from genie signals provided to a receiver to the exposed signal spaces at that receiver, which then serve as the genie signals for the next receiver in the chain, until an acceptable genie with the required number of dimensions is obtained, essentially converting an information theoretic problem into a linear algebra problem.",
"id": "53e9a480b7602d9702d9df51",
"title": "Genie chains and the degrees of freedom of the K-user MIMO interference channel",
"year": 2012
},
{
"abstract": "Unified modeling language (UML) sequence diagrams combined with the UML profile for modeling and analysis of real-time and embedded (MARTE) systems are used to represent the systems' requirements. To enhance formal analysis, sequence diagrams annotated with MARTE stereotypes are mapped into timed colored Petri nets with inhibitor arcs (TCPNIA). The mapping rules for the fragments of sequence diagrams and MARTE stereotypes are proposed respectively. The mapping rules for general ordering between messages are proposed to cope with complicated interactions. The data related issues are handled through colored properties in TCPNIA models, guard functions and operational functions. A mapping rule for state invariant is proposed based on data related information. Through state invariant, complicated control relations can be expressed. Formal definitions for morphing and substitution in TCPNIA models are given. They provide modular and hierarchical modeling methods for TCPINA models. A case study shows the applicability and feasibility of our method.",
"id": "53e9a59ab7602d9702ec0dda",
"title": "Modeling UML Sequence Diagrams Using Extended Petri Nets",
"year": 2012
},
{
"abstract": "To quantitatively predict software security in the design phase, hierarchical software security modeling and evaluation methods are proposed based on Stochastic Petri Nets (SPNs). Hierarchical methods mitigate the state-space explosion problem in SPNs. An isomorphic Markov Chain (MC) is obtained from the component SPN model. The security prediction value is calculated based on the probability distribution of the MC in the steady state. A sensitivity analysis method is proposed through evaluating the derivative of the security evaluation prediction equation. It provides a means to identify and trace back to the critical components for security enhancing. Security prediction and sensitivity analysis in the design phase provide the possibility to investigate and compare different solutions to the target system before realization. A case study shows the applicability and feasibility of our method.",
"id": "53e9a877b7602d97031c396e",
"title": "Modeling and quantitatively predicting software security based on stochastic Petri nets",
"year": 2012
},
{
"abstract": "A general assumption in the reliable network design problem is that probability distributions of the sources of uncertainty are known. However, in reality, this distribution may be unavailable as we may have no (insufficient) data to calibrate the distribution. In this paper, we relax this assumption and present two robust alpha reliable network design models under distribution-free demand by adopting worst-case Value-at-Risk (WVaR) and worst-case conditional Value-at-risk (WCVR) risk measures, where only requires that the first m moments (m is a positive integer and associated with the form of link cost function) of demand to be known. We prove that the two models are equivalent to the same model under general distribution. The equivalent NDP model is formulated as mathematical programs with complementarity constraint (MPCC). A manifold sub optimization algorithm is developed to solve this alpha robust reliable network design problem (NDP). Numerical example is presented to illustrate the features of the proposed NDP model.",
"id": "53e9bd23b7602d97049ad4fe",
"title": "Robust Alpha-Reliable Network Design Problem under Distribution-free Demand",
"year": 2012
},
{
"abstract": "TCPNIA (Timed Colored Petri Nets with Inhibitor Arcs, TCPNIA) is a model for specifying real-time embedded systems. It integrates features of colored Petri nets, timed Petri nets and inhibitor arcs. The methods for modeling modules of systems using TCPNIA are proposed. A depth-first scheduling algorithm for TCPNIA is proposed. The system level resource's influence to schedulable path is considered. Different data in tokens will change an execution path and call different data operational functions. The influence from data operational functions is considered in the scheduling algorithm. The time requirement upper bound of a schedulable path can be calculated in the algorithm. Tasks' parallel executions have been considered when the time upper bound of the path is calculated. The soundness of the algorithm is proved. The time and space complexities of the algorithm are also analyzed. The compositional conditions and method for composing schedulable path are given. A case study shows the applicability and feasibility of the method. © 2011 ACADEMY PUBLISHER.",
"id": "53e999e7b7602d970222b6ec",
"title": "Scheduling Real-Time Embedded Systems Based on TCPNIA.",
"year": 2011
},
{
"abstract": "The objectives of this paper were to estabLish a comprehensive appraise system of China's environmental impact assessment of land development and consoLidation planning through a case study of Nantong city in Jiangsu province. Methods employed include empirical analysis, documentation, and weighting method. The results indicate that, (1) the index system including social, economic and ecological index can be estabLishes and the weighting method can be used in planning environmental impact assessment, (2) the implementation of land development and consoLidation planning improved the integrated environment in Nantong County, and (3) the preventive and mitigation measurements could be proposed for strict control of occupying, idLing and destructing the basic farmland, and improving the management. It is concluded that, the appraise system basing on the weighting method is simple and feasible for improving and developing the environmental impact assessment of land development and consoLidation planning.",
"id": "53e9a946b7602d970329b29a",
"title": "Study on Environment Impact Assessment of Land Development and Consolidation Planning",
"year": 2011
},
{
"abstract": "An aggregate signature is a useful digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, aggregate signature scheme is possible to aggregate all these signature into a single short signature. This single signature, along with the n original messages will convince any verifier that the n users did indeed sign the n original messages respectively (i.e., for i = 1,...,n user i signed message mi). In this paper, we propose an identity based aggregate signature scheme which requires constant pairing operations in the verification and the size of aggregate signature is independent of the number of signers. We prove that the proposed signature scheme is secure against existential forgery under adaptively chosen message and identity attack in the random oracle model assuming the intractability of the computational Diffie-Hellman problem. © 2011 ACADEMY PUBLISHER.",
"id": "53e9af81b7602d97039c4042",
"title": "An Identity Based Aggregate Signature from Pairings.",
"year": 2011
},
{
"abstract": "As the satellites are limited by the deficient hardware resources and the difficulty of upgrading, the application of inter-satellite dynamic routing has been restricted. Meanwhile, the rapid changes of the satellites dynamic network topology caused by satellites' high-speed movement require a highly efficient static routing algorithm. By fully considering the characteristics of sparse edges of the satellite network, an inter-satellite routing algorithm obtaining a good time boundary is analyzed and proposed in this paper based on Fibonacci heap. Firstly, this paper introduces an inter-satellite network topology by using walk constellation and describes the network with the nod-arc-directed line mode. Further, to improve the Dijkstra algorithm, a method implementing the priority queue whose node value can be decreased is proposed. By analyzing the complexity of the algorithm and comparing different simulation results, this paper proves that the remarkable improvement in the conveniences and efficiency for the inter-satellite routing can be achieved through Dijkstra algorithm by using Fibonacci heap structure.",
"id": "53e9b512b7602d97040458e0",
"title": "An Algorithm Design of Inter-satellite Routing Based on Fibonacci Heap",
"year": 2011
},
{
"abstract": "This paper investigates the interference alignment solution for a fully connected (1 x 1, 1/2)(K) K-user symmetric interference network with K single-antenna relays. The criterion of minimum total interference plus noise leakage (Min-INL) is considered with a set of lower and upper bound power constraints at each relay. And an iterative algorithm is proposed to alternatively optimize the precoders at transmitters, decoders at receivers and relay beamforming weights. There have closed-form solutions for subproblems to solve precoders and decoders. Subproblem with variables of relay beamforming weights is formulated as nonconvex quadratically constrained quadratic programs (QCQP) and efficiently solved by semi-definite relaxation (SDR). Simulation results demonstrate that the criterion of Min-INL with proposed algorithm obtains higher throughputs than that of minimum total interference leakage (Min-IL) and the conventional orthogonal transmission scheme.",
"id": "53e9bbc8b7602d9704818792",
"title": "Distributed Beamforming With Relay-Aided Interference Alignment In Fully Connected Interference Network",
"year": 2011
},
{
"abstract": "To enhance trustworthiness, UML (unified modeling language) activity diagrams are transformed into Petri nets for verification and analysis. Data concerned Petri net (DCPN) is proposed for activity diagrams' modeling. Mapping rules for transforming elements in an activity diagram into DCPNs are proposed in both graphical and formal forms. Weaving method is used to compose DCPNs. This paper provides foundation for developing a tool which can automatically transform an activity diagram into an analyzable Petri net. A case study shows the feasibility and applicability of the proposed method.",
"id": "5489116845ce471f90addd21",
"title": "Modeling Activity Diagrams With Extended Petri Nets",
"year": 2011
},
{
"abstract": "Many organizations have created control mechanisms and discipline systems to prevent employees from engaging in non-work-related computing (NWRC). Since such control mechanisms and discipline systems often fail to reduce NWRC, it is necessary to delineate task characteristics and organizational cultures that can enhance the effectiveness of NWRC management. Based on a fit perspective, we examined the effects of task characteristic-control mechanism fit and organizational culture-discipline system fit on employees' NWRC behaviors and attitudes toward NWRC discipline systems. Two separate studies on full-time employees in Asian organizations revealed three important findings. First, when task non-routineness was high, NWRC control mechanisms were less effective in reducing NWRC behavior. Second, progressive (punitive) discipline systems were associated with greater satisfaction with the discipline system in bureaucratic cultures, whereas positive discipline systems were related to higher satisfaction in innovative and supportive cultures. Finally, positive discipline systems were also associated with reduced NWRC behavior in innovative cultures.",
"id": "53e9b12ab7602d9703baaddd",
"title": "The role of task characteristics and organizational culture in non-work-related computing: a fit perspective",
"year": 2010
},
{
"abstract": "Non-wood forest is a kind of important forest resource. This paper focused on the information extraction of non-wood forest based on Advanced Land Observation Satellite (ALOS) data. Band characteristics were analyzed to get understanding of this data wholly by information content, correlation coefficient and Optimum Index Factor (OIF). A new set of data with eight bands were obtained by the fusion of Normalized Difference Vegetation Index (NDVI), the first three components of Principal Component Analysis (PCA1, PCA2, PCA3) and the four bands of ALOS data. Various kinds of vegetations, especially non-wood forest was analyzed through the Spectral Feature Model (SFM) and Maximum Likelihood (ML) with association of topographical map and field investigation data. Results show that NDVI and PCA can improve the extraction accuracy of non-wood forest. In addition, SFM reduces the phenomenon of mixed classification and improves the information extraction accuracy of non-wood forest, which will provide reference for the classification of vegetation.",
"id": "53e9b267b7602d9703d09a4b",
"title": "Non-wood forest information extraction based on ALOS data",
"year": 2010
},
{
"abstract": "To enhance formal analysis, activity diagrams annotated with MARTE stereotypes are mapped into timed colored Petri nets with inhibitor arcs (TCPNIA). The mapping rules for the elements of activity diagrams and MARTE stereotypes are proposed respectively. The rules to map pin nodes and object flows to Petri nets are presented. These nodes can improve activity diagrams' modeling abilities for complicated systems. The reaching of any final nodes will stop all the flows in an activity. A method to map final nodes into Petri nets preserving this semantics is also presented with the help of inhibitor arcs. The data related issues are processed through colored properties in the TCPNIA model, guard functions and operational functions.",
"id": "53e9b2b8b7602d9703d65ef0",
"title": "Mapping UML Activity Diagrams to Analyzable Petri Net Models",
"year": 2010
},
{
"abstract": "This paper analyzes the defects of the present method of company order assessment, a superior membership function is brought forward to establish the element values in the fuzzy evaluation matrix, the rationality of the membership function is proved and an example with the fuzzy evaluation matrix built by this membership function is given. The company order evaluation index system using fuzzy comprehensive evaluation measures can improve the rationality of the assessment of the order with enterprise scheduling system.",
"id": "54890b3445ce471f90a6fc81",
"title": "The Application of Secondary Fuzzy Comprehensive Evaluation in Enterprise Order Evaluation",
"year": 2010
},
{
"abstract": "We present the design of two-wheel self-balanced electric vehicle based on MEMS. In this paper, system structure and functions, signal processing of micro-silicon accelerometer and micro-silicon gyro will be mainly discussed. Two-wheel self-balanced electric vehicle is designed based on the model of the single inverted pendulum system. The system uses two parallel wheels to maintain balance and uses micro-silicon accelerometer and micro-silicon gyro as position detection sensors. The operator standing on it can control the vehicle to move forward or backward by shifting the gravity centre and turns the moving direction through the steering pole.",
"id": "53e99cb4b7602d9702566948",
"title": "Design of two-wheel self-balanced electric vehicle based on MEMS",
"year": 2009
},
{
"abstract": "The reliability of support vector machines for classifying multi-spectral images of remote sensing has been proven in various studies. In this paper, we investigate their applicability for land cover change detection in forest regions. Firstly, multidate remote sensing images are co-registered and we have stacked the NDVI index layers of two dates in red, green, blue bands composite to perform a supervised classification. Secondly, sample pixels were manually selected from changed and unchanged area to be used in the training stage. Thirdly, for each pixel SVM produces a single output through its decision function, high detection overall accuracy (>96%) and overall Kappa coefficient (>0.89) were achieved using two landsat images covering an 8-years period in study area. Lastly, SVM-based change detection with different kernel functions was compared using statistical evaluations.",
"id": "53e99b5db7602d97024032da",
"title": "A SVM-Based Change Detection Method from Bi-Temporal Remote Sensing Images in Forest Area",
"year": 2008
},
{
"abstract": "A fuzzy neural network method based on T-S model was proposed for mobile robots to avoid obstacles. Using the proposed method, the obstacles in all environment types can be recognized, so the mobile robots could reach destination without collision. The new method not only has the advantage of fuzzy logic and neural network, but also has good self-study ability. First the data collected by 8 ultrasonic sensors were classified. Then the navigation algorithm based on T-S model was carried out. The test results show that the mobile robot using this fuzzy neural network can recognize the obstacles in all environment types, decide its action, and then arrive at destination after 231 seconds averagely in ten tests. It is faster than the mobile robot using BP neural network which takes 239 seconds",
"id": "53e9b98bb7602d970457d362",
"title": "A Fuzzy Neural Network Based on T-S Model for Mobile Robots to Avoid Obstacles",
"year": 2008
},
{
"abstract": "The importance of information to any kinds of social behaviors is needless to waste any words. Different information sharing mechanisms and their functionalities to social systems are not well studied. In this paper, with agent-based model, we investigated information sharing mechanisms that leads to different patterns in the macro-level spatial market formation. We proposed three mechanisms. The first is a localized global information sharing mechanism where pheromone is used. The second is one that agents use only information out of their own memory. The third mechanism is one that agents can share information within a group of friends. Simulation results show that centralized markets are formed while agents use localized global information. The distribution of market size in this case follows a power-law distribution. When agents use individual information, no big markets can be formed. In this case, people cannot easily make a successful trade. When agents communicate, they get more information from others but increase uncertainty when communication is not sufficient.",
"id": "5c7825e14895d9cbc67f489e",
"title": "The impact of information sharing mechanism to geographic market formation",
"year": 2008
},
{
"abstract": "Many organizations have scrambled to get control measures and discipline systems in place to deter employees from engaging in NWRC. Since control measures and discipline systems are insufficient to curb NWRC at the workplace, we propose to integrate the control perspective with task characteristics and organization culture. Thus, we examine the following research questions: How would the amount of NWRC control mechanisms affect employees' NWRC behavior under different task characteristics? Does a match between the disciplinary approach and organization culture lead to more effective NWRC management? Two separate studies on full-time employees in various organizations revealed three important findings. Firstly, the ineffectiveness of NWRC control mechanisms occurred under high degree of task non-routineness. Secondly, the fit between discipline systems and organization culture leads to higher employee satisfaction with NWRC management, which subsequently led to lower time spent on NWRC. Thirdly, there is no best NWRC discipline system for each organization.",
"id": "53e99b4ab7602d97023eebc7",
"title": "The role of task characteristics and organization culture in non-work related computing (NWRC)",
"year": 2007
},
{
"abstract": "Remote welding robot system may been used for nuclear components maintenance, space assemble, underwater structures repair. This paper describes the Remote Welding Robot System (RWRS) based on shared control. The paper introduces the structure of remote welding robot system, stereo vision system, autonomous seam-tracking system, the human-machine interface and graphics simulation system of teleoperation.",
"id": "573697d16e3b12023e6b0eeb",
"title": "Remote welding robot system",
"year": 2004
},
{
"abstract": "Information management is believed to be one of the key enabling technologies for collaboration in product development. It would support the collaborative creation, management, dissemination, and use of product and process information across organization boundary. This paper proposes a framework and underlying enabling technologies and methodologies for a novel information management system for dynamic product development processes in distributed manufacturing enterprise. It allows product development process to be created and defined flexibly and dynamically, enables design data be disseminated at fine granularity among the distributed processes, and facilitates fast system reconfiguration to adapt to frequent change of processes and products. It also supports the information exchange between product development and other business processes in intra/inter manufacturing.",
"id": "53e9b937b7602d9704520838",
"title": "Information management system for dynamic product development in distributed manufacturing enterprise",
"year": 2003
}
] |
Ki Il Kim | Generate an abstract for the title "BANSIM: A new discrete-event simulator for wireless body area networks with deep reinforcement learning in Python" using the following items: machine learning, wireless body area networks, network simulator, artificial intelligence, deep reinforcement learning | Many studies have investigated machine learning algorithms to improve the performance of wireless body area networks (WBANs). However, it was difficult to evaluate algorithms in a network simulator because of missing interfaces between the simulators and machine learning libraries. To solve the problem of compatibility, some researchers have attempted to interconnect existing network simulators and artificial intelligence (AI) frameworks. For example, ns3-gym is a simple interface between ns-3 (in C++) and the AI model (in Python) based on message queues and sockets. However, the most essential part is the implementation of an integrated event scheduler, which is left to the user. In this study, we aim to develop a new integrated event scheduler. We present BANSIM, a discrete-event network simulator for WBAN in standard Python that supports deep reinforcement learning (DRL). BANSIM provides an intuitive and simple DRL development environment with basic packet communication and BAN-specific components, such as the human mobility model and on-body channel model. Using BANSIM, users can easily build a WBAN environment, design a DRL-based protocol, and evaluate its performance. We experimentally demonstrated that BANSIM captured a wide range of interactions that occurred in the network. Finally, we verified the completeness and applicability of BANSIM by comparing it with an existing network simulator. | [
{
"abstract": "Compared with typical wireless sensor networks, wireless body area networks (WBANs) have distinct features: on-body communication, a large amount of interference, and dynamic topology changes caused by gestures. Accordingly, the resource management algorithm in the medium access control (MAC) protocol should be dynamic, adaptive, and energy-efficient. Hence, recent studies tend to optimize the available resources by applying several types of analytical models. Although these models have been categorized in terms of their objectives, the major differences between their methodologies have not been emphasized and discussed. In this study, we classify the analytical models applicable to dynamic resource management, and clarify their characteristics and use cases. We present the basic principles, approach classification, comparison, and guidance for dynamic resource management, and investigate state-of-the-art resource management techniques according to the corresponding analytical models. Furthermore, research challenges on dynamic resource management in WBAN are identified to facilitate future research in this area.",
"id": "63262f2890e50fcafdefd4ed",
"title": "A survey on analytical models for dynamic resource management in wireless body area networks",
"year": 2022
},
{
"abstract": "Autonomous path following has gained tremendous popularity during the last few decades. Numerous researchers have contributed to the development of highly automated navigation systems using different types of sensors and their combination. However, their proposed approaches do not provide a cost-efficient solution because of the deployment of exorbitant and sophisticated sensors, which remains a challenging problem for customized vehicles used in academic research. To overcome this issue, this study presents an economically efficient sensorless steering angle approach that employs a single camera for steering control and quick response (QR) based localization of a vehicle. Moreover, we used SONAR for object detection in a defined route to avoid possible collisions. The proposed technique combines a Probablistic Hough Transfrom for lane detection and QR codes, which helps the vehicle stay in its lane for stabilized control. To prove the efficiency of our approach, we tested it on our developed prototype vehicle named EMO. To validate the proposed approach through in-field testing, we designed a customized test track within the campus. The experimental results show the benefit of our proposed approach compared to existing methods available in the literature.",
"id": "628d20755aee126c0f410572",
"title": "A Robust QR and Computer Vision-Based Sensorless Steering Angle Control, Localization, and Motion Planning of Self-Driving Vehicles",
"year": 2021
},
{
"abstract": "As data source for Big Data, wireless sensor networks play great role in data collection and dissemination. Specially, real-time communication remains one of the crucial research challenges, because of the high complexity and severe networking requirements on restrained node in wireless sensor networks. Moreover, current schemes are assumed to take general traffic model for real-time delivery so they lack adaptability. To solve this problem, few routing protocols have been designed to accommodate new real-time model, (m,k)-firm, which is regarded as the most applicable scheme for event as well as query based applications in wireless sensor networks. However, since current schemes for (m,k)-firm stream are proposed to support unicast communications only, they cannot be applied to multicast communications where many group members are willing to receive data packets from the sink node. To overcome this problem, we propose a new multicast scheme for (m,k)-firm stream to deliver data packet to group members. To construct a multicast tree, different types of overlay tree are constructed according to distance based priority (DBP) value. Simulation results prove that the proposed scheme can meet (m,k)-firm requirement and have longer network lifetime than existing schemes.",
"id": "5c7575e4f56def9798a3f29d",
"title": "An Efficient Real-Time Data Dissemination Multicast Protocol for Big Data in Wireless Sensor Networks",
"year": 2019
},
{
"abstract": "Unmanned Aerial Vehicles (UAVs) have great potential to revolutionize the future of automotive, energy, and healthcare sectors by working as wireless relays to improve connectivity with ground networks. They are able to collect and process real-time information by connecting existing network infrastructures including Internet of Medical Things (e.g., Body Area Networks (BANs)) and Internet of Vehicles with clouds or remote servers. In this article, we advocate and promote the notion of employing UAVs as data collectors. To demonstrate practicality of the idea, we propose a UAV-based architecture to communicate with BANs in a reliable and power-efficient manner. The proposed architecture adopts the concept of wakeup-radio based communication between a UAV and multiple BANs. We analyze the performance of the proposed protocol in terms of throughput and delay by allocating different priorities to the hubs or gateways. The proposed architecture may be useful in remote or disaster areas, where BANs have poor or no access to conventional wireless communication infrastructure, and may even assist vehicular networks by monitoring driver’s physiological conditions through BANs. We further highlight open research issues and challenges that are important for developing efficient protocols for UAV-based data collection in smart healthcare systems.",
"id": "5ce2d121ced107d4c63f5230",
"title": "UAV-enabled healthcare architecture: Issues and challenges",
"year": 2019
},
{
"abstract": "Before discovering meaningful knowledge from big data systems, it is first necessary to build a data-gathering infrastructure. Among many feasible data sources, wireless sensor networks (WSNs) are rich big data sources: a large amount of data is generated by various sensor nodes in large-scale networks. However, unlike typical wireless networks, WSNs have serious deficiencies in terms of data reliability and communication owing to the limited capabilities of the nodes. Moreover, a considerable amount of sensed data are of no interest, meaningless, and redundant when a large number of sensor nodes is densely deployed. Many studies address the existing problems and propose methods to overcome the limitations when constructing big data systems with WSN. However, a published paper that provides deep insight into this research area remains lacking. To address this gap in the literature, we present a comprehensive survey that investigates state-of-the-art research work on introducing WSN in big data systems. Potential applications and technical challenges of networks and infrastructure are presented and explained in accordance with the research areas and objectives. Finally, open issues are presented to discuss promising directions for further research.",
"id": "5ce3a81aced107d4c654faf6",
"title": "Wireless Sensor Networks for Big Data Systems",
"year": 2019
},
{
"abstract": "Mobile sink groups play crucial roles to perform their own missions in many wireless sensor network (WSN) applications. In order to support mobility of such sink groups, it is important to design a mechanism for effective discovery of the group in motion. However, earlier studies obtain group region information by periodic query. For that reason, the mechanism leads to significant signaling overhead due to frequent flooding for the query regardless of the group movement. Furthermore, the mechanism worsens the problem by the flooding in the whole expected area. To deal with this problem, we propose a novel mobile sink group support scheme with low communication cost, called Region-Shift-based Mobile Geocasting Protocol (RSMGP). In this study, we utilize the group mobility feature for which members of a group have joint motion patterns. Thus, we could trace group movement by shifting the region as much as partial members move out of the previous region. Furthermore, the region acquisition is only performed at the moment by just deviated members without collaboration of all members. Experimental results validate the improved signaling overhead of our study compared to the previous studies.",
"id": "5a9cb65d17c44a376ffb7ac7",
"title": "Energy-Efficient Region Shift Scheme to Support Mobile Sink Group in Wireless Sensor Networks.",
"year": 2018
},
{
"abstract": "Due to high dynamics of nodes, network partitioning happens frequently in tactical ad hoc networks. To avoid this problem, relay node is one of possible solutions by connecting the partitioned networks and providing alternative backup path temporarily. Even though a vehicle and personal solider may work as relay node, unmanned aerial vehicle (UAV) is the most appropriate in the point of coverage and rapid action. However, there are some important research challenges to deploy UAV relay node such as load balancing and congestion on UAV. Thus, in the paper, we present a new routing protocol to implement UVA relay function in tactical ad hoc networks. The path via UAV relay node is controlled according to type of communications, service, and source and destination pair. The simulation results are given to prove the higher packet deliver ratio and shorter end-to-end delay through the proposed scheme than typical geographical routing protocol in tactical ad hoc networks.",
"id": "5b3d986f17c44a510f7fa566",
"title": "A new routing protocol for UAV relayed tactical mobile ad hoc networks",
"year": 2018
},
{
"abstract": "In this paper, we present a new spectrum aware routing protocol that is based on the number of available channels obtained by prediction algorithm and number of hops to reduce the end-to-end delay in cognitive radio ad hoc networks. Simulation results are given to demonstrate the shorten end-to-end delay in the aspects of mobility speed and varying number of channels.",
"id": "5c20b22cda5629702063b4fd",
"title": "A Spectrum Aware Routing Protocol in Cognitive Radio Ad Hoc Networks",
"year": 2018
},
{
"abstract": "In this paper, we present dynamic clustering scheme and hierarchical routing for Unmanned Aerial Vehicle (UAV) relayed tactical ad hoc networks. The simulation results are given to prove the higher packet deliver ratio and shorter end-to-end delay through the proposed scheme than typical routing protocol in tactical ad hoc networks.",
"id": "5c20b22cda5629702063b4fe",
"title": "Hierarchical Routing for Unmanned Aerial Vehicle Relayed Tactical Ad Hoc Networks",
"year": 2018
},
{
"abstract": "Recent advancement in internet of medical things has enabled deployment of miniaturized, intelligent, and low-power medical devices in, on, or around a human body for unobtrusive and remote health monitoring. The IEEE 802.15.6 standard facilitates such monitoring by enabling low-power and reliable wireless communication between the medical devices. The IEEE 802.15.6 standard employs a carrier sense multiple access with collision avoidance protocol for resource allocation. It utilizes a priority-based backoff procedure by adjusting the contention window bounds of devices according to user requirements. As the performance of this protocol is considerably affected when the number of devices increases, we propose an accurate analytical model to estimate the saturation throughput, mean energy consumption, and mean delay over the number of devices. We assume an error-prone channel with saturated traffic conditions. We determine the optimal performance bounds for a fixed number of devices in different priority classes with different values of bit error ratio. We conclude that high-priority devices obtain quick and reliable access to the error-prone channel compared to low-priority devices. The proposed model is validated through extensive simulations. The performance bounds obtained in our analysis can be used to understand the tradeoffs between different priority levels and network performance.",
"id": "5c2c7a6717c44a4e7cf30f4d",
"title": "Performance Analysis of Priority-Based IEEE 802.15.6 Protocol in Saturated Traffic Conditions.",
"year": 2018
},
{
"abstract": "Peer-to-Peer (P2P) networks offer a scalable solution for efficient query searching and sharing across the unstructured networks. With an increased overhead due to large amount of object searching and routing in unstructured P2P networks, it is a challenge to continue QoS routing among different mobile peers. Most existing mobile P2P protocols focus on inflexible techniques to route queries and discover objects of interest. Such common techniques incur a relatively high search time due to remarkable network traffic and duplication of query messages. The correlation between routing and mobility is crucial to efficiently search and route the query object in an overlay to avoid unnecessary consumption of network resources. Our previous fuzzy search controller model (Shah and Kim in 12th IEEE international conference on dependable, autonomic and secure computing (DASC), 2014) reduced the search time query processing in P2P networks, but it caused low hit rate and a high overhead due to peer mobility. Thus, this article proposes a scalable fuzzy controller based on probabilistic walk for unstructured mobile P2P networks to reduce the search time with controlled mobility. The search time is reduced by jumping a query walker to a 2-hop away ultrapeer, selected through a fuzzy scheme. Furthermore, each mobile ultrapeer shares its pong cache with its directly connected ultrapeer in order to increase the hit rate and reduce the network overhead. Simulations show that the fuzzy search controller gives better performance than the competing protocols in terms time 10% reduction in response time and 15% increase in hit rate in different mobility scenarios.",
"id": "5c756daaf56def979854ee74",
"title": "Fuzzy searching and routing in unstructured mobile peer-to-peer networks",
"year": 2018
},
{
"abstract": "Cloud computing is now being deployed in real world to satisfy several users’ requirements for computation. In the point of management, there are several important considerations such as availability, reliability, resource utilization, and throughput in cloud computing. However, since these performance metrics are affected by the many uncorrelated parameters, it is very hard task to derive new model which takes into them account together. Even though there are many feasible models, fuzzy logic can be the most suitable one in the view of depth, popularity and applicability in many other research areas. However, as far as the authors know, there is only one short survey paper which focuses on introducing research challenges without detail discussion of each mechanism. Based on this deficiency, in this paper, we present the state-of-the-art approaches and their important features in fuzzy logic based cloud computing. First, we present overview of cloud computing and categorization for the current research works. Second, we also provide some of the key techniques presented in the recent literature and provide a summary of related research works. Finally, we suggest potential directions for future research in the field.",
"id": "5c756ec6f56def9798605874",
"title": "A study on fuzzy logic based cloud computing",
"year": 2018
},
{
"abstract": "In this paper, we propose a new enhanced temperature aware routing protocol to assign the temperature of node by considering current temperature and expected rise caused by the packets in the buffer. Also, two hops ahead algorithm is employed to ensure further packet forwarding to the sink. The simulation results are shown to prove that the proposed scheme is able to increase packet delivery ratio and network lifetime.",
"id": "5c8f035c4895d9cbc60667ed",
"title": "An Enhanced Temperature Aware Routing Protocol in Wireless Body Area Networks.",
"year": 2018
},
{
"abstract": "Caching popular multimedia content constitutes a promising solution to mitigate the congestion in the ultimate potential for 5G networks. Moreover, a three-tier heterogeneous network, where device-to-device pairs, small cells, and macro base stations (BSs) are included, is suggested in 5G wireless networks. In addition, local caching of popular multimedia content for small-cell base stations (SBSs) and user equipment has been considered to decrease the BS transmission cost without requiring high capacity backhaul or access to the core network. Thus, in this paper, we first analyze the numerous relevant performances in this three-tier content delivery network. For the independent Poisson point process and uniform distribution, where there are two regular different SBS assumption modes, we first provide theoretical analysis of the hitting probability in this heterogeneous network in different user request transmission modes based on a stochastic geometry theory. Then, we further propose a novel resource selection and scheduling algorithm satisfying the signal-to-interference-plus-noise ratio and signal-to-interference ratio criteria and the optimal transmission link selections and scheduling strategy for the three-tier heterogeneous network in order to reasonably allocate restricted resources. Finally, the numerical results reveal that the theoretical results are in agreement with the simulation results of the Zipf-distribution caching scheme. Meanwhile, the proposed algorithm performs well compared with the theoretical limit and an increase in the state of the art.",
"id": "5c8f324a4895d9cbc63200de",
"title": "Analysis and Scheduling in a 5G Heterogeneous Content Delivery Network.",
"year": 2018
},
{
"abstract": "Wireless Body Area Networks (WBANs) have attracted research interests from the community, as more promising healthcare applications have a tendency to employ them as underlying network technology. While taking design issues, such as small size hardware as well as low power computing, into account, a lot of research has been proposed to accomplish the given tasks in WBAN. However, since most of the existing works are basically developed by assuming all nodes in the static state, these schemes therefore cannot be applied in real scenarios where network topology between sensor nodes changes frequently and unexpectedly according to human moving behavior. However, as far as the authors know, there is no survey paper to focus on research challenges for mobility support in WBAN yet. To address this deficiency, in this paper, we present the state-of-the-art approaches and discuss the important features of related to mobility in WBAN. We give an overview of mobility model and categorize the models as individual and group. Furthermore, an overview of networking techniques in the recent literature and summary are compiled for comparison in several aspects. The article also suggests potential directions for future research in the field.",
"id": "599c7a80601a182cd26be796",
"title": "A Survey on Mobility Support in Wireless Body Area Networks.",
"year": 2017
},
{
"abstract": "In parallel with lots of research to improve message delivery rate in Delay Tolerant Networks (DTN), additional application specific requirements are demanded to deploy them in the real world. Among many requirements, we focus on desired delivery ratio within required deadline in DTN. To achieve this, we propose an adaptive forwarding algorithm primarily based on well-known DTN algorithm, Spray and Wait. Unlike conventional static forwarding schemes, the number of message copies and forwarding algorithm are dynamically adjusted according to the difference between current service level and given requirement in the proposed scheme. Furthermore, analytical model and recorded history on a node are used sequentially depending on availability of parameters to meet application specific requirement. Finally, simulation results demonstrate that our proposed algorithm can meet given requirement with lower resources consumption than existing protocols in varying network conditions.",
"id": "59ae3be32bbe271c4c71aed2",
"title": "Adaptive Forwarding Scheme for Bounded Time Constraint in Delay Tolerant Networks.",
"year": 2017
},
{
"abstract": "Delay Tolerant Networks (DTN) protocols based on the store-and-carry principle off er useful functions such as forwarding, utility value, social networks, and network coding. Although many DTN protocol proposals have been offered, work continues to improve performance. In order to implement DTN functions, each protocol introduces multiple parameters; their performance is largely dependent on how the parameter values are set. In this paper, we focus on improving spray and wait (S&W) by proposing a communication protocol named a Spray and AHP-GRA-based Forwarding (S&AGF) and Spray and Fuzzy based Forwarding (S&FF) scheme for DTN. The proposed protocols include a new forwarding scheme intended to extend network lifetime as well as maintain acceptable delivery ratio by addressing a deficiency in existing schemes that do not take energy into consideration. We choose the most suitable relay node by taking the energy, mobility, measured parameters of nodes into account. The simulation-based comparison demonstrates that the proposed S&AGF and S&FF schemes show better balanced performance level in terms of both delivery ratio and network lifetime than original S&W and its variants.",
"id": "5a260c5d17c44a4ba8a2a229",
"title": "Variants Of Spray And Forwarding Scheme In Delay Tolerant Networks",
"year": 2017
},
{
"abstract": "Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k)-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the (m, k)-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k)-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption.",
"id": "5a4aef9017c44a2190f79da7",
"title": "A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks.",
"year": 2017
},
{
"abstract": "AbstractGenerally, various traffic requirements in wireless sensor network are mostly dependent on specific application types, that is, event-driven, continuous, and query-driven types. In these applications, real-time delivery is one of the important research challenges. However, due to harsh networking environment around a node, many researchers usually take different approach from conventional networks. In order to discuss and analyze the advantage or disadvantage of these approaches, some comprehensive survey literatures were published; however they are either out of date or compiled for communication protocols on single layer. Based on this deficiency, in this paper, we present the up-to-date research approaches and discuss the important features related to real-time communications in wireless sensor networks. As for grouping, we categorize the approaches into hard, soft, and firm real-time model. Furthermore, in all these categories, research has been focused on MAC and scheduling and routing according to research area or objective in second level. Finally, the article also suggests potential directions for future research in the field.",
"id": "5b1643ba8fbcbf6e5a9bcf76",
"title": "A Survey on Real-Time Communications in Wireless Sensor Networks",
"year": 2017
},
{
"abstract": "Even though some velocity based routing protocols for (m,k)-firm stream have been recently proposed in multimedia wireless sensor networks, there are still many perspective parameters to be considered for forwarding procedure. Moreover, since they are not correlated with each other, multi-criteria system for forwarding is desirable to select next hop. However, current existing protocols apply these parameters sequentially without any prioritization. To address this issue, in this paper, we propose two (m,k)-firm specific routing protocols based on fuzzy interference system and analytical hierarchical process in conjunction with the gray relational analysis. In each protocol, delivery ratio, energy, speed, (m,k)-firm stream requirement as well as current stream status are used to select the best appropriate next hop while considering given node's constraints. Through the simulation results, we demonstrate that the proposed scheme gracefully maintains (m,k)-firm requirement while extending the network lifetime. Finally, superiority of the proposed approach to existing velocity based routing protocols is also proven through diverse simulation scenarios.",
"id": "5b65882e4e5c1931ddd0ab0c",
"title": "Real-time routing protocols for ()-firm streams based on multi-criteria in wireless sensor networks",
"year": 2017
},
{
"abstract": "Recently, new emerging research challenge, aircraft ad-hoc networks, has attracted considerable attention from the research community. Due to unique properties of aircraft ad-hoc networks, new routing protocols including geographical routing protocol for heterogeneous aircraft ad-hoc networks (GRHAA) and aeronautical routing protocol (AeroRP) have been proposed and analysed through simulation. However, since these protocols were compared with typical routing protocols for ad-hoc networks with simulation scenarios that were configured with unrealistic parameters for aircraft ad-hoc networks (AANETs), more reliable and credible simulation studies are essentially needed. Based on this demand, in this paper, we conduct simulation-based performance evaluation for two mentioned protocols with new relevant parameters. Based on simulation results, we can identify that two routing protocols are suitable for AANETs. Furthermore, GRHAA shows better performance than AeroRP in the aspects of packet delivery ratio and similar delay by the help of hierarchical architecture as well as more accurate position prediction scheme in heterogeneous environments.",
"id": "57a4e937ac44365e35c9d27d",
"title": "Simulation-Based Performance Comparison Of Two Routing Protocols For Aircraft Ad-Hoc Networks",
"year": 2016
},
{
"abstract": "To prevent scalability problem caused by increasing traffic of real-time applications, cluster architecture with Time Division Multiple Access (TDMA) scheduling scheme is mostly deployed in wireless sensor networks. However, even though it have proven good scalability and suitability for real-time communications, but static scheduling lacks of adaptability in several situations by not admitting some real-time flows where slots remain available. To solve mentioned problem, in this paper, we propose an adaptive cluster-based scheduling scheme for real-time flows by utilizing the time slots for flows according to type of flows such as inside or outside cluster. So, the proposed scheme can achieve better utilization of channel by minimizing the number of unused channels for real-time flows than static scheme through new adaptive TDMA scheduling scheme. Simulation results show that more flows are admitted and delivered within the deadline in the proposed scheme by utilizing unused time slots accordingly.",
"id": "57d063abac4436735428a451",
"title": "Adaptive TDMA scheduling for real-time flows in cluster-based wireless sensor networks.",
"year": 2016
},
{
"abstract": "As good example of potential application-specific requirement, (m,k)-firm real-time streams have been recently introduced to deliver multimedia data efficiently in wireless sensor networks. In addition to stream model, communication protocols to meet specific (m,k)-firm real-time streams have been newly developed or extended from existing protocols. However, since the existing schemes for an (m,k)-firm stream have been proposed under typical flat architecture, the scalability problem remains unsolved when the number of real-time flows increases in the networks. To solve this problem, in this paper, we propose a new clustering scheme for an (m,k)-firm stream. The two different clustering algorithms are performed according to either the (m,k)-firm requirement or the deadline. Simulation results are presented to demonstrate the suitability of the proposed scheme under hierarchical architecture by showing that its performance is acceptable irrespective of the increase in the number of flows.",
"id": "5843772fac44360f1083189f",
"title": "Clustering Scheme for (m, k)-Firm Streams in Wireless Sensor Networks.",
"year": 2016
},
{
"abstract": "As steady research in wireless ad hoc and sensor networks is going on, performance evaluation through relevant network simulator becomes indispensable procedure to demonstrate superiority to comparative schemes and suitability in most literatures. Thus, it is very important to establish credibility of simulation results by investigating merits and limitations of each simulator prior to selection. Based on this motivation, in this article, we present a comprehensive survey on current network simulators for new emerging research area, three-dimensional wireless ad hoc and sensor networks which is represented by airborne ad hoc networks and underwater sensor networks by reviewing major existing simulators as well as presenting their main features in several aspects. In addition, we address the outstanding mobility models which are main components in simulation study for self-organizing ad hoc networks. Finally, open research issues and research challenges are discussed and presented.",
"id": "58d82fa5d649053542fd0650",
"title": "A Survey On Network Simulators In Three-Dimensional Wireless Ad Hoc And Sensor Networks",
"year": 2016
},
{
"abstract": "Despite increasing demand of application specific requirements in wireless sensor networks, lots of research is still going on under assumption of general requirement without considering specific traffic model as well as several constraints. To address this issue, we have already introduced a new real-time application with (, )-firm model and developed communication protocols for multimedia sensor networks. But, scalability problem and lack of architecture for (, )-firm stream are major research challenges that remain unsolved. Based on corresponding demands, in this paper, we propose a new integrated architecture for (, )-firm stream in wireless sensor networks with following functions, that is, flow aggregation based on compositional hierarchical model, velocity based routing protocol, hybrid medium access control protocol, and congestion control scheme. Simulation results are given to prove the suitability of the architecture and performance improvement under several scenarios.",
"id": "5b6588164e5c1931ddd0aa56",
"title": "An architecture for (, )-firm real-time streams in wireless sensor networks",
"year": 2016
},
{
"abstract": "A small device-based, low-rate, short-range wireless radio communication often hampers high reliability in wireless sensor networks. However, more applications are increasingly demanding high reliability. For this requirement to be met, various approaches have been proposed in a layered manner. Among those, MintRoute is a well-known network layer approach to develop a new metric based on link quality for path selection toward the sink. By choosing the link with the highest measured value, the proposed approach can afford a higher possibility to transmit a packet over the link without error. However, there are still several issues to be discussed during operations. In this paper, we propose how to improve the MintRoute protocol through several revised algorithms, including the development of a new metric, a parent selection considering distance and level from the sink node, and a fast recovery method against failures. Simulations and analysis are performed to validate the suitability of reduced end-to-end delay and fast recovery from failures.Copyright © 2013 John Wiley & Sons, Ltd.",
"id": "5550428245ce0a409eb42df7",
"title": "Evaluating revised MintRoute protocol in wireless sensor networks",
"year": 2015
},
{
"abstract": "Even though geographical routing protocol is regarded to energy-efficient and scalable approach in wireless sensor networks, position information through beacon messages should be exchanged prior to forwarding procedure. This is another control overhead when it comes to consider node's constraints. Thus, recently beacons graphical routing have been proposed to perform data forwarding without information exchange by distance-based delay timer and overhearing technique. However, existing schemes causes additional recurrent and redundant delay in cases of network dynamics or partial network holes in each hop. Specially, if the networks are not uniformly deployed, current schemes cannot be applied. To solve this problem, in this paper, we propose a new fast beaconless protocol, which enables neighbor nodes of a sending node to adjust their delay time depending on whether any node is identified by localized back-learning scheme or not. Also, simulation results are presented and analyzed to prove the decreased end-to-delay delay and increased packet delivery ratio.",
"id": "573696f06e3b12023e5ed60c",
"title": "Beaconless Geographic Routing Protocol With Adaptive Delay Timer In Wireless Sensor Networks",
"year": 2015
},
{
"abstract": "In this paper, we propose a novel scheme of how to efficiently and reliably deliver multimedia real-time streams in wireless sensor networks. To specify the property of streams, a multimedia stream is modeled as an m,k-firm stream that is known to have the characteristics of weakly hard real-time system. In addition, a distributed, measurement-based routing scheme for m,k-firm streams is newly proposed while considering several constraints on node as well as on communication medium. Simulations and their analysis are provided to validate the suitability of traffic modeling, reduced dynamic failure probability, and extended network lifetime when the proposed routing protocol is employed. Copyright © 2013 John Wiley & Sons, Ltd.",
"id": "5c77894e4895d9cbc61f152f",
"title": "Modeling and routing scheme for m, k-firm streams in wireless multimedia sensor networks",
"year": 2015
},
{
"abstract": "Due to recent research interests in airborne ad hoc networks, many research works have been conducted in each layer by developing communication protocols which take into unique properties of node (aircraft) as well as operating environments account. Among them, as the research efforts in network layer, several routing protocols have been proposed to improve packet delivery ratio even though a node moves faster than one in existing ad hoc networks. Related to routing protocol, as proved in many previous research works, hierarchical routing protocol can be considered as appropriate approach in airborne ad hoc networks due to its stability against dynamic change on topology. To meet above demand, in this paper, we present how to form two level hierarchies for heterogeneous networks by extending current geographical routing protocol. Furthermore, the proposed scheme introduces how to improve the packet delivery ratio by applying DTN (Delay Tolerant Networks) routing protocol adaptively for network partition. Simulation results are given to prove suitability of proposed protocol in heterogeneous airborne ad hoc networks.",
"id": "53e9a8dbb7602d970322960d",
"title": "Design of hierarchical routing protocol for heterogeneous airborne ad hoc networks",
"year": 2014
},
{
"abstract": "Real-time applications are time and event critical, therefore they have strict constraint on delay, packet loss, and energy consumption in many wireless sensor networks (WSNs) scenarios, which demands the network to continue QoS operations for a preconfigured lifetime. Due to the scarce energy constraint sensor nodes in WSNs, guaranteed network lifetime is more desirable than unpredictable and uncertain prolonged lifetime. However, in spite of its importance and necessity in WSNs real-time deployment, no research work has been proposed to solve this complex problem. In this paper, we present a new centralized energy and coverage aware node scheduling scheme for WSNs to analyze energy usage as well as balancing energy consumption among nodes to survive for the preconfigured lifetime. Furthermore, the scheduling algorithm is extended to provide real-time routing by adjusting dynamic transmission range according to current energy state of a sensor node. Thus, the energy and coverage aware scheduling with dynamic range forwarding enables the unreliable WSNs to accomplish real-time routing for a guaranteed network lifetime. Simulation results show that the proposed scheme can achieve a 10% increase in real-time packets meeting their deadline and a significantly longer guaranteed network lifetime than protocols reported in the literature.",
"id": "55503e6a45ce0a409eb295df",
"title": "A New Real-Time And Guaranteed Lifetime Protocol In Wireless Sensor Networks",
"year": 2014
},
{
"abstract": "In parallel with steady research and development in ad hoc and wireless sensor networks, many testbeds have been implemented and deployed in real world. Furthermore, some research works have addressed design issues for deployment in three-dimensional space such as sky or ocean. Since many research challenges in three-dimensional spaces have not been explored yet as much as two dimensional spaces, it is required to define the challenging tasks to provide reliable communication in three-dimensional space. In this survey, we aim to identify the unique properties of communication environments in three-dimensional space and address the overview of the state of the art in this research area. To achieve this, the survey is organized according to two good example networks, airborne ad hoc networks (AANETs) and underwater wireless sensor networks (UWSNs). For each network, we introduce and review the related research works to focus on infrastructure, localization, topology design, and position-based routing. Finally, open research issues are also discussed and presented.",
"id": "55503e6b45ce0a409eb29634",
"title": "A Survey On Three-Dimensional Wireless Ad Hoc And Sensor Networks",
"year": 2014
},
{
"abstract": "With the rapid growth of individual mobile devices, the researchers are facing new challenges to deploy unstructured peer-to-peer (P2P) applications over mobile ad hoc networks (MANETs). Empirical studies indicates that although P2P and MANETs have similar preferences, but the resultant networks are not performing efficient and effective searching due to peer discovery, connectivity and mobility problems. To resolve these issues, the existing techniques mostly rely on flooding and random walks in P2P over MANETs to discover object of interest and thus introduce incredible network traffic. Thus, this article proposes Gnutella like unstructured P2P network to better meets the mobility requirement of ad hoc networks to optimize search performance. The proposed system presents a novel cache optimization technique and enhances ultrapeer selection scheme to make communication more efficient between peers and ultrapeer. Furthermore for quick and efficient search, we explore a novel jumping multiple walkers random walk approach with controlled replication. The proposed search mechanism not only reduces the effective query search time but also remarkably reduce network overhead. We validate our analysis and compare our proposal to competing protocols in simulations. Simulation results show that proposed scheme gives better performance than the competing protocols in terms of (1) the successful ratio of resolving a query, (2) the time and hop count of routing a query message, (3) the message overhead, and (4) average message response time.",
"id": "55503fa845ce0a409eb2f4d7",
"title": "Towards Enhanced Searching Architecture for Unstructured Peer-to-Peer Over Mobile Ad Hoc Networks",
"year": 2014
},
{
"abstract": "Typical mobile P2P protocols largely relied on inflexible techniques such as, flooding, replicating, random walks and selective forwarding to route queries and discover objects of interest, which incur a relatively high search time due to remarkable network traffic, multiple copies and duplication of query messages. Recently proposed P2P protocols are able to reduce search time but due to peer mobility, these protocols cause low hit rate and high overhead. Thus, this article proposes novel fuzzy controller based probabilistic walk for unstructured mobile P2P networks to reduce search time. The search time is reduced by jumping a query walker to 2-hop away selected ultrapeer through fuzzy controller. Furthermore, each ultrapeer share its pong cache with its directly connected ultrapeer to increase hit rate and reduce network overhead. Simulations show that the fuzzy search controller gives better performance than the competing protocols in terms of reducing response time by 10% and increasing hit rate by 15% in different mobility scenarios.",
"id": "555044c845ce0a409eb50d4d",
"title": "Fuzzy Search Controller in Unstructured Mobile Peer-to-Peer Networks",
"year": 2014
},
{
"abstract": "Delay Tolerant Networks (DTN) has been proposed to provide communication between nodes where they are intermittently connected. In this situation, a new routing approach, store-carry-forward, is used to deliver data between source and destination. Even though long delay is acceptable in DTN, however some applications occasionally require predetermined bounded delay. To meet this requirement, some approaches have been proposed. However, due to dependency on assumption such as infinite buffer size and mobility pattern, they suffer from deployment problem. To defeat this problem, in this paper, we propose a new probabilistic epidemic routing with time constraint and delay. We adjust forwarding probability on each node depending on bounded delay, elapsed time, and current networks environment. Simulation results reveal that the proposed scheme can meet required delivery ratio and consume little resource rather than original one and competitive protocol.",
"id": "5550456b45ce0a409eb56258",
"title": "A Deadline Aware DTN Approach Based on Epidemic Routing",
"year": 2014
},
{
"abstract": "Recently, application-specific requirement becomes one of main research challenges in the area of routing for delay tolerant networks. Among various requirements, in this paper, we focus on achieving the desired delivery ratio within bounded given deadline. For this goal, we use analytical model and develop a new forwarding scheme in respective phase. The proposed protocol dynamically adjusts the number of message copies by analytical model and the next hop node is determined depending on the delivery probability and the inter-meeting time of the encountering nodes as well as remaining time. Simulation results demonstrate that our proposed algorithm meets bounded delay with lower overhead than existing protocols in an adaptive way to varying network conditions.",
"id": "5550480945ce0a409eb6b445",
"title": "Delay bounded spray and wait in delay tolerant networks",
"year": 2014
},
{
"abstract": "Due to the stringent energy constraint wireless \\\"s, network management cost for lifetime becomes\\\" \\\"sensor node\\\" \\\"one of the crucial issues in designing wireless sensor networks (WSNs). In such situation, guaranteed network lifetime is more preferred than unpredictable pro-long one. However, despite of its importance and necessity in real world deployment, few research works have been proposed to solve this complex problem by ideal approach with the lack of applicability. In this paper, we present a new centralized scheduling mechanism to guarantee network lifetime to a pre-determined time while maintaining k-coverage of network field. In order to guarantee network lifetime, each node are enforced to remain steadfast in the idle state for a known duration of its lifetime. In addition, the scheduling algorithm is extended to provide real-time service by adjusting transmission range according to current energy state of a sensor node. These two core functions are implemented by deciding each nodes role in the next round according to nodes energy consumption and active time history in decision phase. The performance of proposed scheme is compared with well-known A-MAC and MMSPEED protocols in terms of guaranteed lifetime and real-time respectively.",
"id": "557c495ef66765fbb46ad65c",
"title": "A Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks",
"year": 2014
},
{
"abstract": "The multimedia transmission based real-time applications have posed a big challenge to wireless sensor networks (WSNs) where both reliability and timeliness need to be guaranteed at the same time, to support an acceptable Quality of Service (QoS). The existing real-time routing protocols, however, are not able to meet the QoS requirements of realtime applications because of the inherent resource constraint of sensor nodes and instability of wireless communication. Therefore, we propose a real-time scheme in this paper, including a QoS-aware routing protocol and a set of fault recovery mechanisms, for ()-firm based real-time applications over WSNs. A local status indicator which is specially devised for ()-firm stream, is used for intermediate nodes to monitor and evaluate their local conditions. The proposed routing protocol takes into account of packet deadline, node condition and remaining energy of next hop, to make optimal forwarding decision. Additionally, according to the stream QoS and node condition, the proposed fault recovery mechanisms are utilized for nodes to handle the congestion, link failure and void problems occurred during transmission and remain the desired reliability and timeliness requirements. The proposed scheme has been well studied and verified through simulations. The results have proved the efficiency of the proposed scheme in terms of high successful transmission ratio, small end-to-end delay and long lifetime of network.",
"id": "5b6587f94e5c1931ddd0a961",
"title": "A novel real-time scheme for ()-firm streams in wireless sensor networks",
"year": 2014
},
{
"abstract": "As a novel real-time application in wireless sensor networks (WSNs), multimedia transmission has posed a new challenge that both reliability and timeliness must be satisfied at the same time to support an acceptable quality of service (QoS). However, the inherent resource constraint of sensor nodes and instability of wireless communication make it not practical for existing routing mechanisms to meet the requirements of this QoS aware application. To address the problem, we propose an innovative protocol in this paper, for energy and QoS aware routing of (m,k)-firm based real-time applications over WSNs. The routing depends on optimal forwarding decision which takes into account of packet end-to-end deadline, node condition and remaining energy of next hop. A local status indicator (LSI), which was specially devised for (m,k)-firm stream, is used in the routing scheme for each node to monitor and evaluate its local condition. The proposed protocol has been well studied and verified through simulations. The results have proved the efficiency of the proposed routing protocol in terms of higher successful transmission ratio and smaller end-to-end delay.",
"id": "53e99f2db7602d97027f8943",
"title": "A real-time routing protocol for (m,k)-firm streams in wireless sensor networks",
"year": 2013
},
{
"abstract": "As wireless sensor networks have been used in various fields, real-time applications are also run in sensor networks, such as real-time data aggregation or periodic image transmissions. In order to guarantee real-time flow deadlines, TDMA scheduling schemes can be applied with consideration of both node interference and flow deadlines. Generally, they require much time complexity as the number of sensor nodes and real-time flows increases in the networks. Thus, in this paper, we provide a cluster-based real-time flow scheduling scheme for the purpose of interference-aware real-time flow scheduling in wireless sensor networks. The proposed scheme includes (i) the intra-cluster scheduling which schedules real-time flows among nodes in each cluster, and (ii) the inter-cluster scheduling which schedules composed real-time flows among clusters. Throughout simulation results, we show the effectiveness of the proposed scheme in many aspects.",
"id": "53e9b6b9b7602d9704241c57",
"title": "Towards Cluster-Based Real-Time Flow Scheduling in Interference-Aware Wireless Sensor Networks",
"year": 2013
},
{
"abstract": "Previous works for airborne ad-hoc networks based on full connectivity is not suitable for actual situations in the sky. To solve this problem, in this poster, we propose a new DTN routing protocol by introducing multi-copy scheme with utility based forwarding. The proposed scheme introduces bounding box for dense deployment and new utility metric for data packet routing for sparse deployment. Simulation results are given to demonstrate the performance enhancement in sparse networks.",
"id": "53e9b7eeb7602d97043a114d",
"title": "A New DTN Routing Protocol for Sparse Airborne Networks",
"year": 2013
},
{
"abstract": "As most sensor nodes are deployed to detect and transmit interesting events or phenomena around them, the real-time delivery of sensed information within a predetermined deadline becomes one of the biggest challenges in wireless sensor networks. Even though some of the recent research works have been published in specific field, they are designed to cover general purpose applications. Therefore, most of applications cannot be supported by existing schemes especially when the requirement is application-specific real-time. In order to solve this problem, we model the target application as a specific traffic, (m, k)-firm stream, which is known as hard real-time requirement, and then propose a scheme to guarantee real-time delivery. To develop these, we introduce a cross-layer design to bring collaboration between layers under the basic principle that real-time delivery will hardly achieve by independent scheme in each layer. Thus, the requirements of application are passed to lower layers and used to adjust transmission power, prioritize packets, and find the adequate path in order to meet (m, k)-firm constraints for any stream dynamically. Finally, simulation results reveal that low failure probability for real-time requirements on (m, k)-firm stream is achieved by the proposed scheme.",
"id": "53e9baadb7602d97046d8689",
"title": "Cross-Layered Approach for (m, k)-Firm Stream in Wireless Sensor Networks.",
"year": 2013
},
{
"abstract": "As the technology of multimedia applications in Wireless Sensor Networks (WSNs) is highly desired nowadays, how to guarantee real-time service becomes one of the biggest research challenges in this area. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for multimedia applications has not been taken yet. It makes these new approaches not adaptable in real deployments. To solve this problem, in this paper, we model the real-time streams of multimedia applications with (m,k)-firm guarantee, using the firm real-time property it contains. A local transmission status indicator modified based on stream DBP (Distance-Based Priority), called L_DBP (local-DBP), is used to monitor the statement of delivery to the next hop and indicate network faults such as congestion and link failure during transmissions. By the contributions of both L_DBP and stream DBP, a novel geographic routing protocol is proposed to meet the requirements of real-time streams, by making routing decisions while considering timeliness and reliability features together. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed routing protocol can efficiently avoid stream end-to-end dynamic failure, which is considered to be the main reason of QoS performance degradation.",
"id": "53e999f5b7602d970223acb9",
"title": "A Novel Routing Protocol For (M,K)-Firm-Based Real-Time Streams In Wireless Sensor Networks",
"year": 2012
},
{
"abstract": "In this paper, we address how to design and implment graphical viewer software for DTRS(Data Transfer and Recording System)[1] in aircraft system. Typically, since a viewer software for DTRS is supposed to be implemented depemently on corresponding manufactors, it takes long time to develop and validate it sequentially. To solve above problme, in this paper, we propose how to use verified commerial flight simulator for DTRS viewer. To achieve this, components for data extraction, analysis, and transfer are defined and designed. Also, interative interfaces between them are cordinated. Finllay, experimental results demonstrate that extended components works very well and current simulator is good candidate for DTRS viewer with less development efforts.",
"id": "53e9addab7602d97037e133b",
"title": "Design of DTRS Viewer with Commercial Flight Simulators.",
"year": 2012
},
{
"abstract": "Many real-time routing mechanisms have been proposed to support the newly developed wireless sensor networks (WSNs) applications such as the transmission and retrieval of multimedia traffic. However, the inherent source constraints of sensor network and instability of wireless communication set quite a problem for the existing routing mechanisms to meet the quality of service (QoS) requirements of some specific QoS-aware applications. Hence, real-time fault-tolerant schemes are highly desired for WSNs to address these challenges. In this paper, we propose an (m, k)-firm-based real-time fault-tolerant mechanism, which helps routing mechanisms to achieve specific QoS requirement by employing a local status indicator (LSI) at each sensor node to monitor and evaluate the local conditions of node and network. Therefore, specific fault recovery mechanisms could be implemented for ensuring an acceptable QoS performance, according to the evaluated LSI values. By using this fault-tolerant scheme, each node dynamically adjusts its transmission capability to mitigate the performance degradation of real-time service caused by network faults and to maintain the desired reliability and timeliness. Simulation result shows that LSI cannot only help to reduce the effects of congestion, link failure, and void, but also reach higher successful transmission ratio and smaller transmission delay.",
"id": "53e9b2dbb7602d9703d8fa73",
"title": "An (M, K)-Firm Real-Time Aware Fault-Tolerant Mechanism In Wireless Sensor Networks",
"year": 2012
},
{
"abstract": "As the recording system such as DTRS (Data Transfer and Recording System)[1] on aircraft becomes available, amount of information during the flight can be obtained and utlilized efficiently. In this paper, we address how to extract pilot preferered display information over dyniamc layout system on an aircaft. To acheive this, display configuration for specific events are recorded in DTRS whenerver they occur. And then, through developed software, we can recognize the pilot's perference of diplay for corresponding event. Furthermore, this function can be extened to extract other useful information for the flight and mission information by modifying software in a flexbile way.",
"id": "53e9bce1b7602d9704966de2",
"title": "Extracting pilot preferred display from data transfer and recording system",
"year": 2012
},
{
"abstract": "In this paper, we design an (m, k)-firm[1] based realtime congestion control scheme to make the prior protocol be able to handle both link-level and node-level congestions during packet transmissions. Simulation results show that for real-time applications, the proposed congestion control scheme could effectively avoid dynamic failures and guarantee end-to-end QoS requirements.",
"id": "558ba28684ae6766fdee6002",
"title": "A congestion control scheme for (m, k)-firm realtime streams in wireless sensor networks",
"year": 2012
},
{
"abstract": "This paper presents a cellular reuse scheme using interference aware time division scheduling coupled with transmit power control. The proposed scheme supports a time reuse of one for interference insensitive users and a time reuse of 1/3 for interference sensitive users. Unlike traditional reuse partitioning, the proposed scheme provides a blind intercell power coordination mechanism for the interference sensitive users. Thus, when a cell transmits data to interference sensitive users, neighboring cells reduce their transmission power, which enables blind intercell coordination and aggressive time reuse. Simulations show that approximately 22% capacity increase can be achieved by the proposed scheme compared with conventional reuse planning.",
"id": "53e99b9bb7602d9702446c3e",
"title": "Time-Reuse Partitioning with Blind Interference Management for Cellular Systems",
"year": 2011
},
{
"abstract": "Due to natural weakness of sensor node in the point of wireless communications, reliable data delivery becomes one of the major challenges in wireless sensor networks. To handle this problem, many schemes in each layer have been proposed in the several literatures. Among those, MintRoute protocol is designed to achieve high reliability by choosing the best qualified path which is mainly measured by the delivery ratio of packets. Moreover, although some literatures provide the simulation and experimental results of performance evaluation, as far as the authors know, there is no previous research works to mention impact on performance by sensor deployment strategies, effect of failure, and the density of nodes. This paper details a simulation study that compare performance of MintRoute at different scenarios. In addition, research challenges will be given through analysis and discussion for performance.",
"id": "53e9a841b7602d970318d931",
"title": "Performance evaluation of MINTRoute protocol at different scenarios",
"year": 2011
},
{
"abstract": "As the many functions on the aircraft are implemented through software, they provide the pilots with more flexible and extensible controls. Among them, display is one of the important instruments in that information on the aircraft is recognized through it. While previous display was static with fixed layout. a new display is dynamic by employing floating layout on the screen through the help of software. In this paper, we propose a new display method, which automatically returns to the layout of instruments on the aircraft according to the pilot preference. To achieve this, the software records current layout and suggests the best matching layout to the pilot whenever the same event occurs. We explain the design and implementation issues to add this function into the current system.",
"id": "53e9aeabb7602d97038cf076",
"title": "Implementation of Display Based on Pilot Preference.",
"year": 2011
},
{
"abstract": "In this letter we propose a revised geographic routing protocol and a scheduling algorithm to support real time applications which are often observed in wireless sensor networks In order to meet real time requirement a specific application is modeled as an (in k) firm stream that has a property of weakly hard real time system In addition both a priority based scheduling and a geographic forwarding scheme based on delay distance and remaining slack time are newly proposed Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime",
"id": "53e9a146b7602d9702a3a134",
"title": "Network Layer Approaches For (M, K)-Firm Stream In Wireless Sensor Networks",
"year": 2010
},
{
"abstract": "Even though many time-sensitive applications have been emerged, it is not easy to guarantee real-time delivery within deadline in wireless sensor networks due to several constraints such as short ranged wireless communication and low computing capacity on a node. In addition, it is very hard to develop real-time communication scheme without any specific traffic model because one scheme cannot meet various requirements. In this paper, we propose a novel scheduling algorithm for (m, k)-firm real-time streams in wireless sensor networks because queuing delay on a node is the main source of end-to-end delay. The priority of each packet is dynamically adjusted by current DBP (Distance Based Priority) state, slack time, and current position relative to the sink. Simulation studies reveal that dynamic failure probability in (m, k)-firm stream is reduced rather than general priority scheme.",
"id": "53e9a2c0b7602d9702bc8f93",
"title": "A novel scheduling for (m, k)-firm streams in wireless sensor networks",
"year": 2010
},
{
"abstract": "In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.",
"id": "53e9b437b7602d9703f3263a",
"title": "Load Balancing For Greedy Forwarding Of Geographic Routing In Wireless Networks",
"year": 2010
},
{
"abstract": "A low-rate, short-range wireless radio communication naturally requires complementary functions to achieve reliability in wireless sensor networks. The well-known protocol is MINT, which is deployed in TinyOS. However, link quality metric like packet reception rates employed in MINT causes huge number of path changes because packet reception rates is drastically affected by many several parameters. Thus, unnecessary delay and packet loss are inevitably brought. In this paper, we propose a new metric for link estimation, which works with MINT to improve the performance. It is designed to take cross-layered principle in wireless sensor networks as well as several network environments into account. Simulation results reveal that current scheme for link quality is not enough to estimate the quality on link. In addition, more reliable links are chosen so less frequent procedures for parent selection are invoked in the proposed scheme.",
"id": "53e9af7ab7602d97039bc8d2",
"title": "New link estimation for reliability in wireless sensor networks",
"year": 2009
},
{
"abstract": "Performance of multicast routing protocol in mobile ad hoc networks is mostly characterized by underlying forwarding structure. Currently, general structures based on tree/mesh based scheme cannot handle with transmission efficiency, robustness to dynamic topology, scalability, and load balancing functionalities at the same time. To handle above key performance factors concurrently, we propose a new virtual backbone architecture for multicast, which is based on hierarchical hypercube structure. Due to the natural properties of hypercube structure, we can achieve efficiency, robustness and load balance in mobile ad hoc networks where links are frequently broken owing to nodes' free immigration. Furthermore, scalability problem is naturally resolved by hierarchical structure. Finally, through simulation results, we have proven good scalability by demonstrating that our structure can provide higher packet delivery ratio with low control overhead and better scalability than tree/mesh based scheme without regard to the number of group members.",
"id": "53e9ae1cb7602d970382a67c",
"title": "Exploring Performance of Hypercube Structure for Multicast in Mobile Ad Hoc Networks",
"year": 2007
},
{
"abstract": "Wireless sensor networks generally have three kinds of objects: sensor nodes generating data, sinks gathering the data, and users that send queries and receive data via the sinks. In addition, the user and the sinks are mostly connected to each other by infrastructure networks. The users, however, should receive the data from the sinks through multi-hop communications between disseminating sensor nodes if such users move into the sensor networks without infrastructure networks. To support mobile users in wireless sensor network, previous work has studied various user mobility models. Nevertheless, such approaches are not compatible with the existing data-centric routing algorithms, and it is difficult for the mobile users to gather data efficiently from sensor nodes due to their mobility. To improve the shortcomings, we propose a view of mobility for wireless sensor networks and propose a model to support a user mobility that is independent of sinks. The model is flexible regarding the number of sinks. Furthermore, it considers a situation in which there is no sink and user. The proposed model, finally, is evaluated by simulation of delivery ratio, latency, and network lifetime.",
"id": "53e9be1bb7602d9704ad7aff",
"title": "A Model to Support Mobile Users in Wireless Sensor Networks",
"year": 2007
},
{
"abstract": "Due to unpredictable topology change and frequent link failure, it becomes evident major challenge to provide the stable route between source and destination in mobile ad hoc networks. Unlike previous multipath routing schemes for redundancy and unicast routing protocol utilizing the longest route expiration time measured by geographical information supported by Global Positioning System (GPS), we develop a framework to establish the most stable route based on measured frequency of link failure, available battery as well as the number of actual connections. To evaluate performance of proposed scheme, we provide practical simulation results for multipath and unicast routing protocol in terms of packet delivery ratio, control overhead, average hop length as well as end-to-end delay. Through analysis of simulation results, we demonstrate that our scheme shows better performance than general unicast routing protocol as well as similar packet delivery ratio to multipath routing protocol with less maintenance overhead.",
"id": "53e99885b7602d97020bf33f",
"title": "Effectiveness of Reliable Routing Protocols in Mobile Ad Hoc Networks",
"year": 2006
},
{
"abstract": "Instead of multicast functionality on a network entity, the overlay multicast schemes support multicast service with help of underlying unicast routing protocol. However, due to a node's free migration and communication based on broadcasting capability, effectiveness of overlay multicast scheme is not guaranteed in Mobile Ad Hoc Networks (MANET). Specially, nodes' density within some areas changes frequently so heterogeneous forwarding scheme based on density is strongly desired in order to reduce a number of collisions as well as enhance resource utilization. To achieve this, in this paper, we introduce a new forwarding scheme, called as DREAM (Density aware overlay Multicast forwarding). A key feature of DREAM is to introduce a scoped flooding where the nodes densely locates, on the other hand, data forwarding based on unicast routing protocol is maintained in sparse environment. Distinct advantages are evaluated by simulation.",
"id": "53e99b71b7602d9702415c22",
"title": "DREAM: Density Aware Overlay Multicast Forwarding in Mobile Ad Hoc Networks",
"year": 2006
},
{
"abstract": "Due to unpredictable topology change and frequent link failure, it is becoming evidently a major challenge to provide a stable route between source and destination in mobile ad hoc networks (MANET). Unlike previous multipath routing schemes for redundancy and unicast routing protocol utilizing longest route expiration time supported by GPS, we develop a framework to establish the most stable route based on measured frequency of link failure, and available battery, as well as the number of actual connections. To evaluate the performance of the proposed scheme, we also provide practical simulation results with multipath routing and unicast routing protocol in terms of packet delivery ratio, control overhead, and hop counts, as well as end-to-end delay. Through analysis of simulation results, we demonstrate that our scheme shows better performance than the general unicast routing protocol as well as similar packet delivery ratio to the multipath routing protocol with less maintenance overhead.",
"id": "53e9a5afb7602d9702ed7c93",
"title": "Establishing measurement-based reliable path in mobile ad hoc networks",
"year": 2005
},
{
"abstract": "Overlay multicast has been proposed as an alternative scheme to provide one-to-many or many-to-many data delivery on Internet. However, since data delivery is entirely dependent on replications on each group member, if one member cannot receive a data packet, none of its children can receive that packet. Furthermore, the higher the member's level is, the more nodes cannot also receive data packet. In this paper, we give a detailed framework to enhance packet delivery ratio in overlay multicast. Unlike previous efforts based on duplicated forwarding, our scheme builds another type of overlay data delivery tree (DDT), which is adaptively reconstructed based on the number of group member's measured packet delivery ratio while guaranteeing end-to-end delay bound. Through practical simulation results, we analyzed packet delivery ratio, control overhead, and end-to-end delay.",
"id": "53e9a87eb7602d97031c973d",
"title": "A framework to enhance packet delivery in delay bounded overlay multicast",
"year": 2005
},
{
"abstract": "In this paper, we give a framework to reduce delivery failure influence in overlay multicast. Unlike previous efforts based on duplicated forwarding, our scheme builds another type of overlay data delivery tree (DDT), which is adaptively reconstructed based on the number of measured packet delivery ratio while guaranteeing end-to-end delay bound. Through practical simulation results, we analyzed packet delivery ratio, control overhead, end-to-end delay and number of replicated packets.",
"id": "53e9b9fab7602d97045f4f30",
"title": "Reducing delivery failure influence over overlay multicast tree",
"year": 2005
},
{
"abstract": "We propose a new adaptive and predictive measurement-based fair call admission control policy. The objective of a new admission policy is to reduce computation overhead and rapidly re-allocate resources to meet desired quality of service (QoS) demands. With numerical analysis, we evaluate QoS constraints by using queuing model which is described by a two-dimensional continuous-time Markov chain. By comparing results of analytical model with one of event-driven simulation, we validate the accuracy.",
"id": "53e9a41cb7602d9702d357f7",
"title": "A predictive call admission control in packet radio networks",
"year": 2004
},
{
"abstract": "This article presents an alternative scheme, called Xcast6+, which is an extension of explicit multicast (Xcast) for an efficient delivery of multicast datagrams over IPv6 networks. The mechanism incorporates MLDv2 and a new control plane into existing Xcast6 (Xcast for IPv6) and not only does it provide the transparency of traditional multicast schemes to sources and recipients, but it also enhances the routing efficiency in networks. Since intermediate routers do not have to maintain any multicast states, it results in a more efficient and scalable mechanism to deliver traditional multicast datagrams. Furthermore, the seamless integration of Xcast6+ in Mobile IPv6 can support multicast efficiently for mobile nodes over IPv6 networks by avoiding tunnel avalanches and tunnel convergence. Our simulation results show distinct performance improvements of our approach. This approach can reduce network resources in many \"medium size groups\" multicast, particularly as the number of recipients in a subnet increases (i.e., \"subnet-dense groups\").",
"id": "53e99d81b7602d970263ed3b",
"title": "Multicast delivery using explicit multicast over IPv6 networks",
"year": 2003
},
{
"abstract": "Previous multicast schemes for MANET (mobile ad hoc networks) are mostly classified as tree-based schemes and mesh-based schemes depending on their multicast delivery structure. Tree-based schemes cannot cope with network mobility due to frequent tree reconfiguration. On the other hand, mesh-based schemes waste unnecessary resource due to delivery along multiple paths. We propose to use an overlay multicast to handle network mobility efficiently with minimized resource. In our scheme, DDT (data delivery tree) can remain static as long as unicast route between members that are related to data forwarding remains reachable. Thus, it can not only minimize the effects of network mobility, but also bring about low additional control overhead. Such distinct advantages are specifically evaluated through the results of the simulation.",
"id": "53e9a89bb7602d97031e8b11",
"title": "Robust and cost-efficient group communication using overlay multicast in mobile ad hoc networks",
"year": 2003
},
{
"abstract": "The motivation of the multi-homing is to improve reliability and load sharing. However, the existing multi-homing schemes for IPv6 seem to simply focus on preserving connectivity via other links when one of the links fails. In this paper, we present a multi-homing scheme in IPv6 considering the load sharing and delay latency, and reliability. The simulation results show the distinct performance of our approach.",
"id": "53e9b110b7602d9703b902d8",
"title": "Scalable ipv6 multi-homing scheme based on end-to-end argument",
"year": 2003
},
{
"abstract": "Mobile IP (MIP) ensures packet routing to the mobile host when its attachment is changed on Internet. MIP defines two functional entities - HA (home agent) and FA (foreign agent) - to pursue the location of mobile host and tunneling to deliver packets that are destined to the mobile node's home address. But, this tunneling has difficulties in adapting Internet service architecture - Integrated Service and Differentiated Service. Since both identify the service session as destination IP address, IP protocol number and destination port, a new different service session must be defined over the IP tunnel. For that reason, how to guarantee the QoS over IP tunnel and interoperate with end-to-end service session are key features for MIP QoS. Since MIP QoS is mostly dependent on host mobility supporting protocol, we believe that the host mobility supporting protocol must be regarded as important factor. The current host mobility supporting protocol has hierarchical architecture as micro mobility and macro mobility. So, if the MIP QoS could be viewed as the same hierarchical architecture, the better QoS guarantee might be possible. This paper specifies a hierarchical scheme, which uses not only aggregate RSVP between domain level agents, but also applies specific local policy between domain level agent and mobile host in a domain.",
"id": "53e99ecab7602d970279799f",
"title": "Domain based approach for QoS provisioning over Mobile IP",
"year": 2001
},
{
"abstract": "The issue for mobile multicast is classified as twotrends. The one is route optimization and the other is howfast the multicast routing tree can be reconstructed. Incase of reconstructing the multicast tree, the FA must jointhe multicast group whenever the attachment point ischanged. This mechanism has the advantage of routeoptimization for transmitting multicast data. But the treereconstruction may be occurred whenever the mobile hostmoves. Its overhead may be increased rapidly. In order toservice multicast, the other way is the use of tunnelingwithout tree reconstruction. Because the HA (HomeAgent) already is being subscribed the multicast session,the multicast datagram is transmitted to HA. The HAtunnels it to the current FA (Foreign Agent), whichmobile host is attached. When this mechanism is applied,the tree reconstruction is not needed. However, the pathfrom the HA to FA may not be optimized. The longer thepath distance is, the more packet delay may be increase.If the FA does not support IGMP, the more seriousproblem is caused. As stated above, the two mechanismsmay not be implemented easily on the current network. Inthis paper, we propose the mobile multicast mechanismbased on SSM (Source-Specific Multicast), which isproposed in order to support one-to-many transmissionefficiently. But, automatic tunneling is used instead of thesource-based tree. The key feature of this mechanism is toremove the overload caused by tree reconstruction and tooptimize the multicast path simultaneously when thehandoff is occurred.",
"id": "53e9a17fb7602d9702a70124",
"title": "New Approach for Mobile Multicast Based on SSM",
"year": 2001
},
{
"abstract": "The ASM (any source multicast) have been proposed to forward IP multicast datagram. However, there remain unsolved deployment issues such as network management and address allocation of multicast sessions. To overcome the above issues, largely new three multicast mechanisms-SGM (Small Group Multicast), ALM (Application Level Multicast) and SSM (Source Specific Multicast)-have been proposed. While the SGM and ALM can support multicast service without constructing the multicast routing tree, SSM constructs the multicast routing tree rooted in the source. SGM is proposed to support a very large number of small multicast groups. However, since SGM needs an additional packet header to service multicast, modification of the legacy routers is inevitable. ALM provides multicast by means of a combination of unicast in WAN and multicast in LAN. Since the standard is not fixed, this mechanism has limited implementation conditions. SSM identifies the multicast session not by G but by (S, G) pair. This mechanism solves the multicast address allocation problem, which is the biggest issue in the ASM. However, all routers along the delivery path must maintain the state (S, G) in order to transmit multicast data. Though the three new mechanisms can solve the many of the problems, one feature of ASM, the scalability problem is not be removed at all. We propose a fast deployment mechanism, which is based on SSM as well as the use the Internet hierarchical architecture. This mechanism may help multicast deployment without any modification of the IP layer while the advantage of SSM is kept. A key feature of the new mechanism is the use of a different multicast service for macro level multicast and micro level multicast.",
"id": "53e9a2ecb7602d9702bf6d84",
"title": "Internet multicast provisioning issues for hierarchical architecture",
"year": 2001
}
] |
Liang Ma | "Generate an abstract for the title \"A model-based approach to assess reproducibility for large-sca(...TRUNCATED) | "•Developed a model-based reproducibility index for large-scale high-throughput MRI-based studies.(...TRUNCATED) | [{"abstract":"Quality-related fault detection is crucial for improving system reliability, reducing (...TRUNCATED) |
Martha Larson | "Generate an abstract for the title \"Color the Word: Leveraging Web Images for Machine Translation (...TRUNCATED) | "Automatic translation allows people around the globe to communicate with one another. However, stat(...TRUNCATED) | [{"abstract":"In this paper, we investigate the connection between how people understand speech and (...TRUNCATED) |
Jizhou Sun | "Generate an abstract for the title \"Learning multi-path CNN for mural deterioration detection\" us(...TRUNCATED) | "Mural deterioration easily destroys valuable paintings and must be monitored frequently for prevent(...TRUNCATED) | [{"abstract":"This paper studies active relocalization of 6D camera pose from a single reference ima(...TRUNCATED) |
Bijan Shirinzadeh | "Generate an abstract for the title \"Modelling the indentation force response of non-uniform soft t(...TRUNCATED) | "A scaled recurrent neural network (RNN) model is developed which accurately predicts the force resp(...TRUNCATED) | [{"abstract":"This paper presents a nonlinear double-integral observer based on finite-time stabilit(...TRUNCATED) |
Yan Lei | "Generate an abstract for the title \"Feature-FL: Feature-Based Fault Localization\" using the follo(...TRUNCATED) | "Fault localization aims at developing an effective methodology identifying suspicious statements po(...TRUNCATED) | [{"abstract":"This study explores the relationship between a journal's ranking and the reviewer's ac(...TRUNCATED) |
Claire Le Goues | "Generate an abstract for the title \"ROSDiscover: Statically Detecting Run-Time Architecture Miscon(...TRUNCATED) | "This is the replication package for the paper, ROSDiscover: Statically Detecting Run-Time Architect(...TRUNCATED) | [{"abstract":"Robot systems are growing in importance and complexity. Ecosystems for robot software,(...TRUNCATED) |
Randal W Beard | "Generate an abstract for the title \"Relative Heading Estimation and Its Application in Target Hand(...TRUNCATED) | "In this paper, we address the problem of target handoff between two fixed wing aircrafts that do no(...TRUNCATED) | [{"abstract":"Various solutions to visual multi-target tracking have been proposed, but many of them(...TRUNCATED) |
Masaki Yamakita | "Generate an abstract for the title \"Convex Approximation for LTL-based Planning\" using the follow(...TRUNCATED) | "We present a formulation for linear temporal logic (LTL)-based task planning of nonlinear dynamical(...TRUNCATED) | [{"abstract":"The dynamical model structure based on the Nonlinear Auto-Regressive with eXogenous in(...TRUNCATED) |
End of preview. Expand
in Data Studio
LongLaMP Dataset
Dataset Summary
LongLaMP is a comprehensive benchmark for personalized long-form text generation. The dataset is designed to evaluate and improve the performance of language models in generating extended, personalized content across various domains and tasks.
Our dataset consists of multiple tasks focusing on different aspects of long-form text generation, including:
- Personalized Email Completion
- Personalized Abstract Generation
- Personalized Review Writing
- Personalized Topic Writing
Each task in LongLaMP is carefully curated to challenge language models in producing coherent, contextually relevant, and personalized long-form text. The dataset provides a robust framework for testing and developing personalization techniques in language models.
Details about the dataset construction, task specifications, and evaluation metrics can be found in our technical paper: [Link]
Accessing the Dataset
You can download the dataset using the Hugging Face datasets library. Here's an example of how to load the product review dataset for the user-based setting:
from datasets import load_dataset
ds = load_dataset("LongLaMP/LongLaMP",
"product_review_user",
split="train",
use_auth_token=True)
Dataset Structure
The LongLaMP dataset is organized into different tasks and settings. Each task has two settings:
- User Setting: Evaluates personalized text generation for new users
- Temporal Setting: Evaluates generating the latest content for previously seen users
Citation
If you use the LongLaMP dataset in your research, please cite our paper:
@misc{kumar2024longlampbenchmarkpersonalizedlongform,
title={LongLaMP: A Benchmark for Personalized Long-form Text Generation},
author={Ishita Kumar and Snigdha Viswanathan and Sushrita Yerra and Alireza Salemi and Ryan A. Rossi and Franck Dernoncourt and Hanieh Deilamsalehy and Xiang Chen and Ruiyi Zhang and Shubham Agarwal and Nedim Lipka and Chien Van Nguyen and Thien Huu Nguyen and Hamed Zamani},
year={2024},
eprint={2407.11016},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2407.11016},
}
- Downloads last month
- 669