146 resources related to IEEE Network
- Topics related to IEEE Network
- IEEE Organizations related to IEEE Network
- Conferences related to IEEE Network
- Periodicals related to IEEE Network
- Most published Xplore authors for IEEE Network
The conference program will consist of plenary lectures, symposia, workshops and invitedsessions of the latest significant findings and developments in all the major fields of biomedical engineering.Submitted full papers will be peer reviewed. Accepted high quality papers will be presented in oral and poster sessions,will appear in the Conference Proceedings and will be indexed in PubMed/MEDLINE.
ICC 2021 - IEEE International Conference on Communications
IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.
All areas of ionizing radiation detection - detectors, signal processing, analysis of results, PET development, PET results, medical imaging using ionizing radiation
IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.
The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.
Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.
The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...
Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.
Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250), 1998
We describe a new adaptive routing algorithm for meshed-topology deflection networks. This algorithm is based on a local learning method which evolves in order to produce a local spatial representation of the traffic. We prove that we can set the parameters of the learning algorithm such that our adaptive policy is a shortest path routing. Then we show experimentally the ...
IEEE Transactions on Parallel and Distributed Systems, 2006
A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the graph G/sub 0/ /spl oplus/ G/sub 1/ obtained from connecting two graphs G/sub 0/ and G/sub 1/ with n vertices each by n ...
Network Orchestration for 5G - Raquel Morera - IEEE Sarnoff Symposium, 2019
Nita Patel - IEEE Value of Membership Testimonial
APEC 2011-Intergrid: A Future Electronic Energy Network?
Network. Collaborate. Create.
Improved Deep Neural Network Hardware Accelerators Based on Non-Volatile-Memory: the Local Gains Technique: IEEE Rebooting Computing 2017
Don't Get Hooked: Safe Strategies on the Net
WIE: Our Own Voices - Lizette Castro, Progress Energy
Flexible Network Slicing for Low-latency 5G Mobile Services - Akihiro Nakao: Brooklyn 5G Summit 2017
Industry Forum: 5G Technologies and Applications, Ashutosh Dutta - IECON 2018
New value creation with the Future X Network - Peter Vetter - IEEE Sarnoff Symposium, 2019
Eric Vyncke: Internet of Things and Security: Different than Network Security? - WF-IoT 2015
5G & Network Slicing: A New Era in Networking - Constantine Polychronopoulos - 5G World Forum Santa Clara 2018
David Ngar Ching Tse - IEEE Richard W. Hamming Medal, 2019 IEEE Honors Ceremony
Transportation Electrification: The State of IEEE 802LAN MAN Standards in Vehicular Network
802.15: Wireless Personal Area Network
Future Network Initiative Overview - Ashutosh Dutta - India Mobile Congress, 2018
IEEE Themes - Efficient networking services underpin social networks
Sections Congress 2014 IGNITE! Sessions pt.2
IEEE.tv Product Promotion: Collaboration
We describe a new adaptive routing algorithm for meshed-topology deflection networks. This algorithm is based on a local learning method which evolves in order to produce a local spatial representation of the traffic. We prove that we can set the parameters of the learning algorithm such that our adaptive policy is a shortest path routing. Then we show experimentally the efficiency of our algorithm. First, we compare the routing policies in a grid network, under an uniform load. Second, we create local congestion in order to show that the adaptive routing scheme avoid the overloaded region. Moreover, we propose a more realistic traffic model, and show that our algorithm is valid, even in such context. These results show the relevance of this method.
A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the graph G/sub 0/ /spl oplus/ G/sub 1/ obtained from connecting two graphs G/sub 0/ and G/sub 1/ with n vertices each by n pairwise nonadjacent edges joining vertices in G/sub 0/ and vertices in G/sub 1/. Many interconnection networks such as hypercube-like interconnection networks can be represented in the form of G/sub 0/ /spl oplus/ G/sub 1/ connecting two lower dimensional networks G/sub 0/ and G/sub 1/. In the presence of faulty vertices and/or edges, we investigate many-to-many disjoint path coverability of G/sub 0/ /spl oplus/ G/sub 1/ and (G/sub 0/ /spl oplus/ G/sub 1/) /spl oplus/ (G/sub 2/ /spl oplus/ G/sub 3/ ), provided some conditions on the Hamiltonicity and disjoint path coverability of each graph G/sub i/ are satisfied, 0 /spl les/ i /spl les/ 3. We apply our main results to recursive circulant G(2/sup m/, 4) and a subclass of hypercube-like interconnection networks, called restricted HL-graphs. The subclasses includes twisted cubes, crossed cubes, multiply twisted cubes, Mobius cubes, Mcubes, and generalized twisted cubes. We show that all these networks of degree m with f or less faulty elements have a many-to-many k-DPC joining any k distinct source-sink pairs for any k /spl ges/ 1 and f /spl ges/ 0 such that f+2k /spl les/ m - 1.
This standard amends the IEEE 802.16 WirelessMAN-OFDMA specification to provide an advanced air interface for operation in licensed bands. It meets the cellular layer requirements of IMT-Advanced next generation mobile networks. This amendment provides continuing support for legacy WirelessMAN-OFDMA equipment.
This standard specifies unique per-device identifiers (DevID) and the management and cryptographic binding of a device to its identifiers, the relationship between an initially installed identity and subsequent locally significant identities, and interfaces and methods for use of DevIDs with existing and new provisioning and authentication protocols.