A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Maximum-and-Concatenation Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
In this work, we propose a novel architecture called Maximum-and-Concatenation Networks (MCN) to try eliminating bad local minima and improving generalization ability as well. ...
While successful in many fields, deep neural networks (DNNs) still suffer from some open problems such as bad local minima and unsatisfactory generalization performance. ...
Maximum-and-Concatenation Networks The design of our MCN-a linearity and maximum concatenation network-is inspired by the following observations. ...
arXiv:2007.04630v1
fatcat:3yitm2jlenddxmwvuaquvexrle
IPAC: IP-based Adaptive Packet Concatenation for Multihop Wireless Networks
2006
2006 Fortieth Asilomar Conference on Signals, Systems and Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, our goal is to reduce contention through concatenation of several small packets into a single large packet, and subsequently transmit this large packet. ...
As a result of contention overhead, end-to-end delay and energy dissipation increase and the medium utilization decreases. ...
ACKNOWLEDGMENTS This work was supported in part by NSF Career Award CNS-0347886 and by NSF NeTS Award CNS-0435527. ...
doi:10.1109/acssc.2006.355148
fatcat:fthqxtpsd5a25k4kvlbspcyqfu
Packet concatenation at the IP level for performance enhancement in wireless local area networks
2007
Wireless networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The performance of the proposed algorithm is evaluated through both simulations and an experimental WLAN testbed environment covering the single-hop and the widespread infrastructure network scenarios. ...
Wireless local area networks experience performance degradation in presence of small packets. The main reason for that is the large overhead added at the physical and link layers. ...
Concatenation and fragmentation concepts are both designed to adjust the outgoing traffic to network data units of a given size. ...
doi:10.1007/s11276-006-0734-6
fatcat:2ydul2heevfehaylf3ru6fk2cm
Loss Resilient Strategy in Body Sensor Networks
2011
Proceedings of the 6th International ICST Conference on Body Area Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a loss resilient strategy where prioritized scheduling and packet concatenation schemes are integrated for high network capacity and acceptable data reliability. ...
Body sensor networks have gained continuous popularity in applications such as monitoring, sports training, and interactive gaming. ...
It may be desirable to perform some fine-tuning with the MAC message structure and design the concatenation at the MAC level for maximum throughput improvement. ...
doi:10.4108/icst.bodynets.2011.247076
dblp:conf/bodynets/ReadL0WCP11
fatcat:bi35vgo6qbhmpptqlogoqzbyoi
Defending Synchrophasor Data Networks Against Traffic Analysis Attacks
2011
IEEE Transactions on Smart Grid
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Considering the periodic nature of synchrophasor data, we propose defense mechanisms based on packet concatenation and random packet drops as a countermeasure against attacks that may use the timing as ...
well as data volume information to compromise the network. ...
Given the sampling rate of the synchrophasor measurement units and compensating for the network latency, the maximum number of packets that may be concatenated can be easily obtained. ...
doi:10.1109/tsg.2011.2165090
fatcat:dwcjteulmvdrvl6ger4hmrmzue
Using Consensus Networks to Visualize Contradictory Evidence for Species Phylogeny
2004
Molecular biology and evolution
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We compare gene trees for eight yeast genomes and show that consensus networks have potential for helping to visualize contradictory evidence for species phylogenies. ...
We propose an approach to do this using consensus networks. ...
Acknowledgments We thank the anonymous reviewers and AE for their helpful and constructive comments. This work was financially supported by the New Zealand Marsden Fund ...
doi:10.1093/molbev/msh145
pmid:15084681
fatcat:vjlbfdqxqnfalg7zgviuonbx4i
Reliable multi-path provisioning for next-generation SONET/SDH networks with virtual concatenation
2005
OFC/NFOEC Technical Digest. Optical Fiber Communication Conference, 2005.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We propose effective multi-path bandwidth to provision a connection onto multiple paths while satisfying its availability requirement in next-generation SONET/SDH networks supporting virtual concatenation ...
concatenation. ...
We investigate the problem of provisioning connections with availability guarantees in next-generation SONET/SDH networks supporting virtual concatenation. ...
doi:10.1109/ofc.2005.192743
fatcat:ytzwcbtklndhvf6srismedrrau
Dynamic Capacity Allocation in OTN Networks
2015
Communications and Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Virtual Concatenation (VCAT) and Link Capacity Adjustment Scheme (LCAS) are two techniques that when properly combined can be used to provide improved dynamism in OTN networks. ...
This feature has the potential to reduce operational costs and at the same time to optimize networks resources. ...
For the UBN network the maximum distance between network nodes goes up to 7,200 km leading to a maximum propagation delay of about 144 ms. ...
doi:10.4236/cn.2015.71005
fatcat:e6wvdqgsljd7vlvnpf3i46q5cu
Using Feature Fusion and Parameter Optimization of Dual-input Convolutional Neural Network for Face Gender Recognition
2020
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In recent years, convolutional neural networks (CNNs) have been successfully used in image recognition and image classification. General CNNs only use a single image as feature extraction. ...
The experimental results show that in the dual-input CNN experiment, average accuracy rates of 99.98% and 99.11% on the CIA and MORPH data sets are achieved, respectively, which is superior to the traditional ...
The weighting fusion result is obtained more effectively than the concatenation method, sum method, product method and maximum method. ...
doi:10.3390/app10093166
fatcat:py3duzhrvnbirm3fonteazmxom
Maximizing Resilient Throughput in Peer-to-Peer Network
2011
Communications and Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Under this framework, we divide the domain of optimal peer selection along several dimensions including network topology, overlay organization, and the definition of resilience factor and generalized flow ...
A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. ...
and non-concatenation models. ...
doi:10.4236/cn.2011.33021
fatcat:lngkt6qwpjgknm3jdqoepde4py
Efficiency Issues in MPLS Transport for the UMTS Access Network
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, the efficient transport of short voice and data packets in the UMTS access network requires multiplexing and segmentation functions not provided by MPLS. ...
Multiprotocol Label Switching (MPLS) offers a simple and flexible transport solution for multiservice networks. Therefore, many UMTS operators are currently considering the use of a MPLS backbone. ...
They are concatenated up to Timer_CU expiration or up to a given maximum length Lmax (e.g. set to comply with a maximum transmission time in the Node B -Edge Router link), and transmitted over an LSP preceded ...
doi:10.1007/978-3-540-30193-6_21
fatcat:mkpoisza5jgbxcwgdu4lxsudmq
On optimal monitor placement for localizing node failures via network tomography
2015
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
state if and only if it contains no failed nodes. ...
The proposed algorithm is shown to be optimal for probing mechanism (i), and provides upper and lower bounds on the minimum number of monitors required by the other probing mechanisms. ...
We will refer to Ω(v) as the node maximum identifiability and Ω(G) as the network maximum identifiability. ...
doi:10.1016/j.peva.2015.06.003
fatcat:ewr6bw5zzjc5hhvuwoewgrk72e
Numerical Computation of Partial Differential Equations by Hidden-Layer Concatenated Extreme Learning Machine
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
network and exposes all the hidden nodes to the output-layer nodes. ...
The new method is based on a type of modified feedforward neural networks (FNN), termed HLConcFNN (hidden-layer concatenated FNN), which incorporates a logical concatenation of the hidden layers in the ...
Figures 12(a ) and (b) show the maximum/rms errors and the network training time of the HLConcELM method as a function of Q 1 for the neural network M 1 . ...
arXiv:2204.11375v2
fatcat:nismj4bj6rbtxae4etr3nuxkia
Correction: Phylogenetic Analysis Reveals a Cryptic Species Blastomyces gilchristii, sp. nov. within the Human Pathogenic Fungus Blastomyces dermatitidis
2016
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Maximum-parsimony tree constructed from the concatenated sequences of seven nuclear genes (chs2-drk1-fads-pyrF-tub1-arf6-its2). ...
Values along branches represent maximum parsimony bootstrap values (MPB) and Bayesian posterior probability (BPP) values respectively. ...
doi:10.1371/journal.pone.0168018
pmid:27936170
pmcid:PMC5148079
fatcat:buk7tnxe2nasfbk7hmvjjfb6za
Scalable Fine-grained Path Control in Software Defined Networks
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To implement SR efficiently and flexibly, PACO presents each path as a concatenation of pathlets and introduces algorithms to compute pathlets and concatenate paths with minimum path labels. ...
In this paper, we propose PACO, a framework based on Source Routing to address that problem through quickly pushing paths into the packet header at network edges and pre-installing few rules at the network ...
After solving the above problem, for the desired path P D , we can obtain the maximum number of concatenation paths P concatenate (through y) and the pathlet selection solution S select (through t), under ...
arXiv:1611.09011v2
fatcat:eecmt2tlurbqhb3fy7bzly2fku
« Previous
Showing results 1 — 15 out of 118,558 results