Original Node Research Articles

On Ergodic Secrecy Capacity of Random Wireless Networks With Protected Zones

In this paper, we investigate physical-layer security in a random wireless network where both legitimate and eavesdropping nodes are randomly deployed. In the first scenario, we study the basic random network without a protected zone around the source node. The probability density functions (pdfs) for the composite channel gain with both fading and path loss is derived and used to calculate the probability of secure connection and ergodic secrecy capacity. In the second scenario, we consider the use of secrecy protected zone around the source node to enhance the security in a noise-limited network. Here, we study the following two cases: 1) The eavesdroppers are aware of the secrecy protected zone, and 2) the eavesdroppers are unaware of the secrecy protected zone. Moreover, the distribution of the distances between the origin and random nodes outside the secrecy protected zone is derived. In the final scenario, the interferer protected zones around the legitimate receivers are used to improve the physical-layer security by restructuring the interference. The derived analytical results are verified by the Monte Carlo simulations. It is shown that the application of secrecy and interferer protected zones lead to significant improvement in security, depending on different system parameters.

About unimproved opportunities of differentiation of sarcoidosis and tuberculosis

This study was aimed at analysis of own experience of differentiation between pulmonary tuberculosis and sarcoidosis.Methods.We evaluated VATS biopsy samples from 250 patients with disseminated lesion of the lungs and/or intrathoracic lymph nodes of unknown origin. Previous examination excluded any known granulomatosis excepting pulmonary tuberculosis and sarcoidosis. The biopsy samples were collected in different regions of Russia in 2010–2014.Results.Typical epithelioid cell granulomas with giant multinucleated cells were seen in lymph nodes and the lung tissue in all cases. Necrosis and/or presence of acid"fast mycobacteria were necessary and sufficient sign of tuberculosis. Granulomas without necrosis and mycobacteria in slice series, but not in one or two incident slices, were considered as highly specific for sarcoidosis.Conclusion.We suppose that differentiation between tuberculosis and sarcoidosis should be based on complex clinical and morphological analysis with the determinant role of morphological examination

Framework to assess and locate affordable and accessible housing for developing nations: Empirical evidences from Mumbai

Housing for all has been a key developmental agenda in India. Available housing stocks mostly target the higher and upper middle-income group; while supply of affordable housing remains neglected. When it comes to development of affordable housing, the built up area (BUA), cost of construction and land prices are reduced. As a result, more than often, the accessibility aspects are overlooked. Leading to non-acceptance and failure to attract target disadvantaged groups.This paper introduces a methodology to identify potential areas for the development of affordable housing as a part of rapid planning process in urban areas of developing nations. Two probable applications of this approach could be) to assess the current spatial proliferation of slums, and ii) to earmark zones of probable affordable housing. This model framework is based on the generation of chosen travel time isochrones around selected centres as nodes of origin. It is hypothesized that areas having maximum number of overlapping travel time isochrones are most accessible. Overlaying the travel time isochrones with the residential price map might enable in identifying potential areas, which will be suitable for the development of affordable housing. The methodology is then tested empirically in the Greater Mumbai region. The result shows that the city can be classified into well-patterned hierarchical zones of accessibility. It provides evidence of the growth and distribution of slums in these regions, and in the environmentally sensitive areas, as a sign of tradeoff between affordability and accessibility.

Evaluating Multi-User Selection for Exploring Graph Topology on Wall-Displays.

Wall-displays allow multiple users to simultaneously view and analyze large amounts of information, such as the increasingly complex graphs present in domains like biology or social network analysis. We focus on how pairs explore graphs on a touch enabled wall-display using two techniques, both adapted for collaboration: a basic localized selection, and a propagation selection technique that uses the idea of diffusion/transmission from an origin node. We assess in a controlled experiment the impact of selection technique on a shortest path identification task. Pairs consistently divided space even if the task is not spatially divisible, and for the basic selection technique that has a localized visual effect, it led to parallel work that negatively impacted accuracy. The large visual footprint of the propagation technique led to close coordination, improving speed and accuracy for complex graphs only. We then observed the use of propagation on additional graph topology tasks, confirming pair strategies on spatial division and coordination.

Fast inference of ill-posed problems within a convex space

In multiple scientific and technological applications we face the problem of having low dimensional data to be justified by a linear model defined in a high dimensional parameter space. The difference in dimensionality makes the problem ill-defined: the model is consistent with the data for many values of its parameters. The objective is to find the probability distribution of parameter values consistent with the data, a problem that can be cast as the exploration of a high dimensional convex polytope. In this work we introduce a novel algorithm to solve this problem efficiently. It provides results that are statistically indistinguishable from currently used numerical techniques while its running time scales linearly with the system size. We show that the algorithm performs robustly in many abstract and practical applications. As working examples we simulate the effects of restricting reaction fluxes on the space of feasible phenotypes of a genome scale Escherichia coli metabolic network and infer the traffic flow between origin and destination nodes in a real communication network.

Risk-Averse Shortest Path Interdiction

We consider a Stackelberg game in a network where a leader minimizes the cost of interdicting arcs and a follower seeks the shortest distance between given origin and destination nodes under uncertain arc traveling cost. In particular, we consider a risk-averse leader, who aims to keep high probability that the follower’s traveling distance is longer than a given threshold, interpreted by a chance constraint. Under the assumption of a wait-and-see follower—i.e., the follower selects a shortest path after seeing realizations of the random arc cost—we propose a branch-and-cut algorithm and apply lifting techniques to exploit the combinatorial structure of the risk-averse leader’s interdiction problem. We demonstrate the computational efficacy of our approaches, risk-averse interdiction solution patterns, and result sensitivity, by testing instances of randomly generated grid networks and real-world transportation networks.

Miscoding of Melanoma Thickness in SEER: Research and Clinical Implications

Melanoma-related deaths and metastases among patients with thin (≤1 mm) and ultrathin (≤0.25 mm) melanomas have been reported. These observations might reflect adverse biology and/or errors in administrative data. Cumulative melanoma-related death rates for thickness groups of patients with thin melanomas were compared among five cohorts including the Surveillance, Epidemiology, and End Results (SEER) registry. Thickness in one SEER region was reexamined in pathology reports. The 5-year cumulative melanoma-related death rate of patients with ultrathin melanomas was higher in SEER (2.8%) compared with other registries (0.6-0.9%). The rates across the 16 SEER regions were 0.25% to 8.4%. In SEER, 21% of thin melanomas were ultrathin; in other registries, they comprised 5.8-15%. A reexamination of thickness in one SEER site revealed that 114 of 447 ultrathin melanomas had errors; after correction, only 17 of the 114 remained ultrathin. The majority of errors were related to decimal point placement. The 86 thin melanomas reclassified to >1.00 mm included 96% of the original ultrathin-associated deaths and 100% of the original positive lymph nodes. Significant miscoding of thickness that is concentrated in ultrathin lesions is present in SEER and results in mischaracterization of patient outcomes. When using administrative data, validation of results can identify critical data issues.

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ϵ ∈ (0, 1) and an n -node edge-weighted network of doubling dimension α ∈ O (loglog n ), we present —a (1 + ϵ)-stretch labeled compact routing scheme with ⌈log n ⌉-bit routing labels, O (log 2 n /loglog n )-bit packet headers, and ((1/ϵ) O (α) log 3 n )-bit routing information at each node; —a (9 + ϵ)-stretch name-independent compact routing scheme with O (log 2 n /loglog n )-bit packet headers, and ((1/ϵ) O (α) log 3 n )-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o ( n (ϵ/60) 2 ) bits of storage at each node has stretch no less than 9 − ϵ for any ϵ ∈ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. We also present a simpler nonscale-free (9 + ϵ)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n .

Ex vivo detection of tumoral lymph nodes of colorectal origin with fluorescence imaging after intraoperative intravenous injection of indocyanine green.

The aim of this study was to investigate the potential role of indocyanine green (ICG) fluorescence imaging after intraoperative intravenous (IV) injection for the "ex vivo" detection of metastatic lymph nodes (mLNs) of colorectal cancer origin. Fresh-fixed LNs in cassettes and/or paraffin-embedded LNs of patients included in a study that evaluated the role of ICG in the detection of peritoneal metastases of colorectal origin (Protocol NCT-01995591) were further explored with a dedicated near-infrared camera system for their fluorescence. An IV injection of ICG was delivered intraoperatively at 0.25 mg/kg. Signal to background ratios (SBRs) were calculated. LNs on operative specimens were evaluated for 12 patients (5 males, 7 females). A total of 182 LNs were analyzed. The mean LN number per patient was 15.2 (median: 15.5; range 3-22). SBRs of mLNs were significantly more fluorescent than benign LNs, 1.41 versus 1.04 arbitrary units (P < 0.0002). On univariate analysis, fluorescence was statistically correlated with LN surface area (>20 mm(2) ) (P < 0.0004). Ex vivo ICG fluorescence imaging after intraoperative IV injection represents a potential method for detecting invaded LN's of colorectal cancer origin on operative specimens. Further clinical studies are needed to better define optimal techniques. J. Surg. Oncol. 2016;114:348-353. © 2016 Wiley Periodicals, Inc.

Maxwell and Rankine reciprocal diagrams via Minkowski sums for two-dimensional and three-dimensional trusses under load

A method is presented for computing and displaying the Maxwell (two-dimensional) or Rankine (three-dimensional) diagram reciprocal to a truss under load. Reciprocals are constructed via the two-dimensional Airy stress function or its three-dimensional analogue. A linear combination of the coordinates of each original node and the coordinates of its reciprocal object leads to the finished diagram. This is related to an underlying Minkowski sum of the polyhedral stress functions of the original and reciprocal diagrams. Some regions of the resulting combined diagram have units of length [Formula: see text] and other regions use units of force [Formula: see text]These regions are connected in a consistent manner, in two dimensions by rectangular areas and in three dimensions by prismatic volumes, each having work units of dimension [Formula: see text] and which give a visual representation of the [Formula: see text] terms in Maxwell’s load path theorem. A linear combination weighted in favour of the original leads to a diagram where original bars are augmented by a thickness (in two-dimensional) or a polygonal cross-sectional area (in three-dimensional). The diagrams thus give an appealing visual representation of the material required for a constant stress design. Although the method gives a complete description of loaded trusses in two dimensions, in three dimensions, it is currently only applicable to those trusses which possess a Rankine reciprocal.

A genetic algorithm for the arrival probability in the stochastic networks

A genetic algorithm is presented to find the arrival probability in a directed acyclic network with stochastic parameters, that gives more reliability of transmission flow in delay sensitive networks. Some sub-networks are extracted from the original network, and a connection is established between the original source node and the original destination node by randomly selecting some local source and the local destination nodes. The connections are sorted according to their arrival probabilities and the best established connection is determined with the maximum arrival probability. There is an established discrete time Markov chain in the network. The arrival probability to a given destination node from a given source node in the network is defined as the multi-step transition probability of the absorbtion in the final state of the established Markov chain. The proposed method is applicable on large stochastic networks, where the previous methods were not. The effectiveness of the proposed method is illustrated by some numerical results with perfect fitness values of the proposed genetic algorithm.

On the Value of Collaboration in Location Estimation

Recently, extensive simulation-based research has shown a benefit to collaboration in wireless location estimation. However, an open question is “Is collaboration always inherently beneficial for location estimation?” In this paper, we answer this question affirmatively under very general conditions and prove that the Cramer–Rao lower bound (CRLB) is strictly decreasing when nodes attempting to determine their locations collaborate, with very mild restrictions. More specifically, for a network of arbitrary size, we establish the value of collaboration in node positioning problems by proving that the inclusion of an additional collaborator strictly reduces the CRLB of the original network nodes' position estimates. Previous work has shown a related result, but only for 1-D and 2-D positioning using pairwise observations. We generalize previous work in several ways: 1) by presenting results that apply to any dimensionality; 2) by generalizing to any observation types, including allowing for mixed observation types and models; and 3) by including nuisance parameter estimation. Several mild conditions arise during the derivation of the proof, which must be satisfied to claim a strictly decreasing lower bound, and these are discussed. Additionally, the results of our analysis allow us to draw further insights into the value of collaboration for the individual nodes in the original network and for the newly introduced collaborator. The theoretical results are supported by numerical results, considering the special case of time-of-arrival (TOA)-based positioning in both line-of-sight and non-line-of-sight conditions. Finally, we draw some qualitative insights into the factors that affect the value of collaboration.

Clinical research and surgical treatment of Hashimoto's disease complicated with papillary thyroid carcinoma

Objective:To analyze the clinical characteristics of Hashimoto's disease complicated with papillary thyroid carcinoma and research surgical treatment and Hashimoto's disease's effect to papillary thyroid carcinoma. Method:Three hundred and twelve cases of papillary thyroid carcinoma were retrospectively reviewed. Among 70 cases of papillary thyroid carcinoma associated Hashimoto's disease (the observation group), 242 cases of single papillary thyroid carcinoma (the control group). Result:The observation group compared with the control group, there was a significant difference in gender, tumor size, thyroid antibody level and the lymph node metastasis, with statistical significance (P<0.05). Conclusion:Hashimoto's disease is a kind of protective factors of thyroid papillary carcinoma, Hashimoto's disease with coexistent papillary thyroid carcinoma is smaller in tumor diameter and have lower lymph node metastasis. Surgery takes the original operation primary radical and central lymph node dissection, try to avoid the preventive side neck lymph node dissection.

Abstract CS1-2: Optimal management of the axilla: A look at the evidence

Abstract The surgical management of the axilla has undergone significant evolution during the past 20 years. The inception of the sentinel lymph node (SLN) concept and the clinical validation of lymphatic mapping and SLN biopsy (SLNB) starting in the 1990s, challenged the century-old primacy of axillary lymph node dissection (ALND) as the procedure of choice for staging the axilla and ushered us into a new era of axillary surgical management. Randomized clinical trials, evaluating SLNB with or without completion ALND in patients with operable breast cancer and negative SLN(s), established SLNB alone as the standard of care for staging the axilla in this setting. These trials established the performance characteristics of SLNB and factors that affect identification and false-negative rate and led to the refinement of the original SLN node concept. More importantly, the results from these trials provided the launching pad for the conduct of additional randomized trials evaluating SLNB alone vs. SLNB with completion ALND in patients with operable breast cancer and limited SLN involvement (micrometastases in IBCSG 23-01 or macrometastases in 1 or 2 SLNs in ACOSOG Z0011). These trials demonstrated no disease-free or overall survival advantage with completion ALND, thus expanding the use of SLNB alone in patients with limited SLN involvement. Another clinical trial (AMAROS) compared the effect of axillary radiotherapy vs. completion ALND in patients with positive SLN(s) and demonstrated equivalent oncologic outcomes between the two approaches but with less morbidity in favor of axillary radiotherapy. Thus, for patients who meet the criteria for inclusion in the ACOSOG Z11 and the IBCSG 23-01 trials, SLNB alone without completion ALND is adequate for staging the axilla. For patients who meet the criteria for inclusion in the AMAROS trial, axillary radiotherapy appears to represent a better option than completion ALND. Lastly, the increasing use of neoadjuvant chemotherapy in appropriately-selected patients with large operable breast cancer and the resulting axillary nodal down-staging in a considerable proportion of patients with axillary lymph node involvement at presentation, has led to an increased interest in the evaluation of SLNB in this setting. After a decade-old debate, the prevailing approach for patients who present with clinically negative axilla and are considered for neoadjuvant chemotherapy, is to perform SLNB after neoadjuvant chemotherapy. This approach has now also been expanded to include patients who present with clinically (or biopsy proven) involvement of the axillary nodes, become clinically node-negative after neoadjuvant chemotherapy and have negative SLNB. Several prospective trials (ACOSOG Z1071, SENTINA, SN FNAC) have recently demonstrated the feasibility and accuracy of SLNB alone in this setting. Provided that certain procedures are followed (removal of 3 or more SLNs, dual-agent lymphatic mapping, localization and removal of previously biopsied positive nodes and even the use of immunohistochemistry in the SLN evaluation), the false-negative rate of SLNB drops to below 10%. Adoption of this approach has the potential to further decrease the use of ALND in patients who present with documented axillary lymph node involvement. Citation Format: Mamounas EP. Optimal management of the axilla: A look at the evidence. [abstract]. In: Proceedings of the Thirty-Eighth Annual CTRC-AACR San Antonio Breast Cancer Symposium: 2015 Dec 8-12; San Antonio, TX. Philadelphia (PA): AACR; Cancer Res 2016;76(4 Suppl):Abstract nr CS1-2.

Recurrence patterns and outcome of patients with stage IIIB-IV(M0) gastric cancer after gastrectomy and adjuvant chemotherapy: A retrospective analysis in one Chinese cancer center.

160 Background: Gastric cancer is one of the leading causes of cancer-related death in China. Previous data showed 5-year OS rates varied from 10% to 20% in patients with stage IIIb and IV(M0) disease. This study aimedto explore recurrence patterns and outcome of stage IIIB-IV(M0) gastric cancer patients who underwent radical gastrectomy and adjuvant chemotherapy in the Cancer Hospital, Chinese Academy of Medical Center. Methods: Patients with stage IIIB-IV(M0) (AJCC V6) gastric adenocarcinoma were enrolled. All patients received a total or subtotal gastrectomy with at least D1 lymph node dissection. Adjuvant chemotherapy consisting of oxaliplatin, fluoropyrimidines with or without docetaxel was started within 1 month after surgery for maximum of 12 cycles. Results: From January 2006 to December 2011, a total of 137 patients were included (stage IIIB:85, stage IV(M0):52) in the study. The median age was 56 years (20-77) and 96 (70.1%) were male. With a median follow-up time of 40 months, 89 (65%) patients developed recurrence or a second primary malignancy. Peritoneal recurrence (28, 20.4%), locoregional lymph nodes (38, 27.7%) and hematogenous metastases (24, 17.5%) were the most common recurrence patterns. The 5-year DFS rates were 34% and 30% in patients with stage IIIB and stage IV(M0) diseases, respectively. The 5-year OS rates were 46% and 30%, respectively. No statistical difference was observed between stage IIIB and stage IV(M0) patients in terms of median DFS (27.0 m vs 17.4m, p = 0.35). The median OS was in favor of stage IIIB patients compared to stage IV (M0) patients (46.5 m vs 26.1 m, p = 0.02). Multivariate analysis revealed that male (p = 0.02), leather stomach or multiple original diseases (p = 0.02), T4 stage (p = 0.01) and higher lymph node ratio (p &lt; 0.01) were independent negative prognostic factors. Conclusions: Patients with stage IIIB and IV (M0) gastric cancer achieved a better outcome than the historical data in our center. Further investigations are needed to focus on individual and multimodality adjuvant therapy for this group.

Esophageal Microperforation due to Calcified Mediastinal Lymph Node Leading to Tracheoesophageal Fistula.

A 42-year-old male presented with worsening gastroesophageal reflux disease symptoms and cough. The clinical symptoms during the early course of illness were striking for aspiration pneumonia. He was given a prescription of proton pump inhibitors and antibiotics. Rapid decline in the clinical condition with worsening respiratory status was noted. Worsening symptoms of fever, cough, and chest pain prompted further diagnostic work-up suggesting esophageal microperforation. Esophagogram was found to be suggestive of tracheoesophageal fistula. The tracheoesophageal fistula was due to subcarinal lymph node of nontuberculous origin.

Does duration to ipsilateral breast tumor recurrence affect the success of reoperative sentinel lymph node biopsy?

Abstract Background Five to ten percent of patients with prior breast cancer treated with breast conservation therapy (BCT) will develop ipsilateral breast tumor reoccurrence (IBTR), requiring reoperative sentinel lymph node biopsy (SNLB). IBTR patients may have a history of prior axillary surgery, which can be a SLNB or an axillary lymph node dissection (ALND). Materials & Methods A retrospective chart review was conducted on patients with IBTR who received care in the Department of Surgery at William Beaumont Hospital, Royal Oak and Troy, Michigan, from January 2007 to December 2009. Results Twenty-eight patients were identified and categorized as Prior ALND (>10 lymph nodes, n =14), Prior SLNB (≤10 lymph nodes, n =10) and an Unknown number of lymph nodes ( n =4). Among Prior ALND patients, reoperative SLNB success was increased in the ≥10 years group (25% vs. 50%, p =0.58). Similarly, among Prior SLNB patients, reoperative SLNB success was increased in the ≥10 years group (71% vs. 100%, p =1.0). Conclusion Increased duration to IBTR may be associated with success of reoperative SNLB in patients with IBTR with prior ALND or SNLB. Further study is required to better understand this relationship. Microabstract The relationship between timing of and success of reoperative sentinel lymph node biopsy (SLNB) has not been studied. We conducted an observational, retrospective analysis of 28 patients with ipsilateral breast tumor recurrence (IBTR). Our results may suggest a higher rate of reoperative SNLB success with increased (≥10 years) duration to IBTR among patients who initially underwent breast conserving therapy with initial axillary lymph node dissection or SNLB. Further research is required to characterize this potential relationship. Clinical practice points Specific mechanisms for the regeneration of lymphatic channels in patients with IBTR after original SLNB or ALND are currently being investigated. The time necessary to reestablish significant lymphatic networks is unknown, but likely impacts the success of reoperative SNLB in ITBR patients. Our results may suggest a higher rate of reoperative SNLB success with increased (≥10 years) duration to IBTR among patients who initially underwent BCT with original axillary lymph node dissection or SNLB. Although more advanced research is required to better understand the relationship between timing of and success of reoperative SLNB, the results of this study may suggest that the utility of SLNB may be greater with increased length to IBTR. As a result, clinicians should be somewhat skeptical of the success of SLNB in patients with immediate IBTR until further research can be conducted.

Parallelizing large networks using NEURON-Python

Research on brain organization has become increasingly dependent on large multiscale neuronal network simulations. Here we describe current usage of the NEURON simulator with MPI (message passing interface) in Python for simulation of networks in the high performance computing (HPC) parallel computing environment [1-4]. The mixed ordinary differential equation (ODE) and event-driven nature of neuronal simulations offers advantages for parallelization, by allowing each node to work independently for a period equivalent to the minimal synaptic delay before exchanging queue information with other nodes, obviating the need to exchange information at every time step. NEURON's ParallelContext allows access to a few of the important general collective MPI calls, as well as calls adapted from prior usages from the LINDA package, now reimplemented under MPI. From Python, a NEURON ParallelContext is created using pc = h.ParallelContext(), where h provides access to NEURON simulation objects after from neuron import h, ParallelContext permits the periodic transfer of spike information via queue exchanges. Pseudo-random streams must be consistent regardless of numbers of nodes in order to set connectivity, delays, and weights that are not fully defined from experimental studies. These streams are kept consistent regardless of number of nodes being used and therefore allows for the simulations to be identical. In order to create this, randomizers are established for particular purposes using NEURON's h.Random().Random123().[5] The key to reproducibility is to define each randomizer according to 1. a particular usage, 2. a particular cell (based on a global identifier or gid), 3. a particular run based on a run identifier runid: e.g., after for r in randomizers: r.Random123_globalindex(runid, randomdel.Random123(id32('randomdel'), self.gid, 0) where id32() provides a 32-bit hash for a name: def id32(obj):return hash(obj)&0xffffffff. Data saving must be initially managed at node of origin and then combined across nodes, to be accessible for analysis or viewing. Given that file saving may occur incrementally during simulation from different nodes on different local filesystems, file management becomes important. There are several ways to handle data saving, the benefits and applicability of which will be presented. Spike recordings are created as vectors on a per-node basis, later consolidated. Other state variables may also be saved at the same time, or may be recreated later utilizing a re-run of individual cells with identical stimulation using NEURON's PatternStim. We note that ParallelContext in NEURON permits the development of hybrid networks using various types of cells: event-driven cells, integrate-and-fire cells, multicompartment cells, as well as complex cells with calculation of internal chemical milieu. Load balancing in the hybrid circumstance is a crucial issue, particularly when some cells are computationally large due to inclusion of reaction-diffusion mechanisms to develop multiscale models from molecule to network.

Bounds for truncation and perturbation errors of nonuniform sampling series

This paper introduces a comprehensive study of truncation and perturbation errors of nonuniform sampling, interpolation, representations. We derive pointwise as well as global estimates associated with the truncated nonuniform sampling formulae. The study of the perturbation error involves the estimation of the amplitude error which results from replacing the actual samples by approximate ones, as well as the jitter error arising when alternative nodes replace the original nodes, is carried out with rigorous error bounds. Numerical and geometrical verifications of the accuracy of our estimates are exhibited.

TrGraph: Cross-Network Transfer Learning via Common Signature Subgraphs

In this paper, we present a novel transfer learning framework for network node classification. Our objective is to accurately predict the labels of nodes in a target network by leveraging information from an auxiliary source network. Such a transfer learning framework is potentially useful for broader areas of network classification, where emerging new networks might not have sufficient labeled information because node labels are either costly to obtain or simply not available, whereas many established networks from related domains are available to benefit the learning. In reality, the source and the target networks may not share common nodes or connections, so the major challenge of cross-network transfer learning is to identify knowledge/patterns transferable between networks and potentially useful to support cross-network learning. In this work, we propose to learn common signature subgraphs between networks, and use them to construct new structure features for the target network. By combining the original node content features and the new structure features, we develop an iterative classification algorithm, TrGraph, that utilizes label dependency to jointly classify nodes in the target network. Experiments on real-world networks demonstrate that TrGraph achieves the superior performance compared to the state-of-the-art baseline methods, and transferring generalizable structure information can indeed improve the node classification accuracy.