Conferences related to Extremities

Back to Top

2020 IEEE International Conference on Plasma Science (ICOPS)

IEEE International Conference on Plasma Science (ICOPS) is an annual conference coordinated by the Plasma Science and Application Committee (PSAC) of the IEEE Nuclear & Plasma Sciences Society.

2020 IEEE/PES Transmission and Distribution Conference and Exposition (T&D)

Bi-Annual IEEE PES T&D conference. Largest T&D conference in North America.

2019 41st Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops andinvitedsessions of the latest significant findings and developments in all the major fields ofbiomedical engineering.Submitted papers will be peer reviewed. Accepted high quality paperswill be presented in oral and postersessions, will appear in the Conference Proceedings and willbe indexed in PubMed/MEDLINE & IEEE Xplore

2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)

The conference is the primary forum for cross-industry and multidisciplinary research in automation. Its goal is to provide a broad coverage and dissemination of foundational research in automation among researchers, academics, and practitioners.

2019 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2019, the 26th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.

More Conferences

Periodicals related to Extremities

Back to Top

Applied Superconductivity, IEEE Transactions on

Contains articles on the applications and other relevant technology. Electronic applications include analog and digital circuits employing thin films and active devices such as Josephson junctions. Power applications include magnet design as well asmotors, generators, and power transmission

Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...

Biomedical Circuits and Systems, IEEE Transactions on

The Transactions on Biomedical Circuits and Systems addresses areas at the crossroads of Circuits and Systems and Life Sciences. The main emphasis is on microelectronic issues in a wide range of applications found in life sciences, physical sciences and engineering. The primary goal of the journal is to bridge the unique scientific and technical activities of the Circuits and Systems ...

Biomedical Engineering, IEEE Transactions on

Broad coverage of concepts and methods of the physical and engineering sciences applied in biology and medicine, ranging from formalized mathematical theory through experimental science and technological development to practical clinical applications.

Computational Biology and Bioinformatics, IEEE/ACM Transactions on

Specific topics of interest include, but are not limited to, sequence analysis, comparison and alignment methods; motif, gene and signal recognition; molecular evolution; phylogenetics and phylogenomics; determination or prediction of the structure of RNA and Protein in two and three dimensions; DNA twisting and folding; gene expression and gene regulatory networks; deduction of metabolic pathways; micro-array design and analysis; proteomics; ...

More Periodicals

Most published Xplore authors for Extremities

Back to Top

Xplore Articles related to Extremities

Back to Top

Computer aided synthesis of an IC electrical diagram from mask data

[{u'author_order': 1, u'affiliation': u'RTC-La Radiotechnique-Compelec, Caen, France', u'full_name': u'J. Le Carpentier'}] 1975 IEEE International Solid-State Circuits Conference. Digest of Technical Papers, 1975

A method affording computerized checking of IC layouts and comparisons with electrical design before commitment to mask making, will be described. Advantages include reduction of development delays and resultant costs.

New planar distributed devices based on a domain principle

[{u'author_order': 1, u'affiliation': u'Plessey Co., Ltd., Dorset, England', u'full_name': u'B. Gilbert'}] 1971 IEEE International Solid-State Circuits Conference. Digest of Technical Papers, 1971

The spacial aspects of bipolar planar circuits are usually of only incidental interest, and are not considered until the layout stage. The devices that constitute the total circuit require attention to geometry, but electrically can be regarded as point-like elements. Structure and function arise from interconnecting these pre-characterized elements.

A modified Pixel Purity Index method for hyperspectral images

[{u'author_order': 1, u'affiliation': u'Center for Imaging Science, Rochester Institute of Technology', u'authorUrl': u'', u'full_name': u'Peter Bajorski', u'id': 37265930100}, {u'author_order': 2, u'affiliation': u'Center for Imaging Science, Rochester Institute of Technology', u'authorUrl': u'', u'full_name': u'Niek Sanders', u'id': 38191590500}] 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, 2010

This paper discusses issues with the Pixel Purity Index (PPI) method, which is a currently popular way to find endmembers in hyperspectral images. Due to randomness of PPI, it does not produce an entirely uniform set of directions. Consequently, some directions are favored in the space of pixel vectors, resulting in biased endmember identification. To overcome this difficulty, we propose ...

Simulation of brain death for detection and diagnosis

[{u'author_order': 1, u'affiliation': u'Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA', u'authorUrl': u'', u'full_name': u'L.V. Sarma', u'id': 38154884600}, {u'author_order': 2, u'affiliation': u'Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA', u'authorUrl': u'', u'full_name': u'J.R. LaCourse', u'id': 37276455500}, {u'author_order': 3, u'affiliation': u'Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA', u'authorUrl': u'', u'full_name': u'S. Selikowitz', u'id': 37294360100}, {u'author_order': 4, u'affiliation': u'Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA', u'authorUrl': u'', u'full_name': u'S.H. Nain', u'id': 38140386900}, {u'author_order': 5, u'affiliation': u'Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA', u'authorUrl': u'', u'full_name': u'M. Merris', u'id': 37660096200}] 1993 IEEE Annual Northeast Bioengineering Conference, 1993

An electrical analog model of the arterial system of the upper extremities of a Yuvatan swine is presented. The model is used for studying the brain death conditions by measuring the intraoccular pressure (IOP). The data obtained with this model have been correlated to the biological data.<<ETX>>

Field test of a force control rehabilitation system for quantitative evaluation of the disorder in the upper extremities

[{u'author_order': 1, u'affiliation': u'Dept. of Welfare Eng., Oita Univ., Japan', u'authorUrl': u'', u'full_name': u'E. Goto', u'id': 37562174200}, {u'author_order': 2, u'affiliation': u'Dept. of Welfare Eng., Oita Univ., Japan', u'authorUrl': u'', u'full_name': u'K. Ohnishi', u'id': 37548785600}, {u'author_order': 3, u'affiliation': u'Dept. of Welfare Eng., Oita Univ., Japan', u'authorUrl': u'', u'full_name': u'H. Miyagawa', u'id': 37560946600}, {u'author_order': 4, u'authorUrl': u'', u'full_name': u'Y. Saito', u'id': 37404258100}] 9th International Conference on Rehabilitation Robotics, 2005. ICORR 2005., 2005

This paper reports on a field test of our simple force-sensor-based rehabilitation device that can be handled at homes or neighboring medical institutions. We propose a tri-axial load cell controller system for quantitatively evaluating the visually guided motor control characteristic of a weak palsy arm. The result is recorded in the database while evaluation is presented for each trial. The ...

More Xplore Articles

Educational Resources on Extremities

Back to Top


No eLearning Articles are currently tagged "Extremities"


  • Intermezzo: Encoding the Digraph Associated with an Image

    This chapter shows how to encode the node‐weighted digraphs representing images, taking advantage of their regular structure. It focuses on images the various operators defined earlier for extracting the regional minima, catchment zones and their overlapping. The downstream and upstream operators are used for extracting marked catchment zones. All nodes belonging to the same substructure, for instance, a regional minimum, or a catchment zone, or a flowing path may then share the same label. The labels may be propagated upstream or downstream on digraphs. The label has been propagated downstream: in blue, the downstream of the red node and, in green, the black hole where the flowing path ends. The level of the pass point is the minimal level for which an overflow may occur from a labeled region into a neighboring region. The pass point has the same meaning as on a real topographic surface.

  • Two Paradigms for Creating a Partition or a Partial Partition on a Graph

    This chapter discusses the relative merits of partitions versus dead leaves models. In a watershed partition, each node is assigned to the catchment basin of one and only one black hole. Catchment basins do not overlap and form a partition of the domain. In a dead leaves model, the labels are assigned priorities and the catchment zones are stacked on top of one another, the most prioritary ones covering the less prioritary ones. The core‐expanding algorithm constructs a partition of the nodes in catchment basins, i.e. catchment zones with minimum overlapping. It uses the node weights and the arrows of the digraph. The chapter illustrates the pruning effect on the downstream of a node and the catchment zones containing it with two examples. Pruning the digraph is the source of great flexibility: upstream or downstream propagation of labels may be done locally, in any order.

  • Measuring the Steepness of Flowing Paths

    Unweighted gravitational digraphs convey rich topographic information. However, in the absence of weights, all directed paths connecting a particular node with a black hole are, aside from their length, equivalent. This chapter proposes an order relation between the directed paths having a common origin, expressing the steepness of these paths. A lexicographic order relation is defined on infinite lists of weights. Between two directed paths with the same origin, the steepest is the one whose list of weights is the smallest for this lexicographic order relation. The chapter studies the topography of an edge‐ or node‐weighted graph from a hydrographic point of view. The deep similarities between the topography of node‐ and edge‐weighted graphs appear as it is possible to associate with each of them a weightless gravitational digraph, on which the flowing paths become directed paths, the regional minima become black holes, and each node belongs to the catchment zone of the black holes.

  • Pruning a Flow Digraph

    This chapter considers a node‐weighted flow digraph and indifferently determines whether the digraph has been derived from a node‐ or an edge‐weighted graph. It introduces a pruning operator, which increases the steepness of a node‐weighted digraph, by cutting several arcs. The pruning is obtained by alternatively applying two operators on a node‐weighted digraph: erosion operator and scissor operator. The unweighted digraph resulting from the pruning remains a gravitational digraph with the same black holes as the initial graph; its catchment zones, however, are not identical, as some directed paths have been cut. The effect of pruning clearly appears if we consider the downstream and the catchment basin of a particular node. The downstream of a node is the union of all flowing paths having the node as the origin. With higher intensities of pruning, the number of such paths is reduced.

  • Weighted Graphs

    This chapter introduces graphs, collections of nodes or vertices linked by undirected edges or directed arcs. It discusses two types of graphs: node‐weighted graphs and edge‐weighted graphs. Graphs are simple and abstract structures that are able to model all kinds of relations. Node‐weighted graphs may be used for modeling a topographic surface. Edge‐weighted graphs may be used for modeling the relations between the catchment zones of a topographic surface. Some nodes in a node‐weighted graph are surrounded by nodes with a higher weight. Such nodes are isolated regional minima nodes. In a node‐weighted graph, each edge is a flowing edge for its extremity holding the highest weight. The chapter analyzes and compares the "topography" of both edge‐weighted and node‐weighted graphs. The topography is described by analyzing the trajectories followed by a drop of water moving from node to node.

  • Propagating Segmentations

    This chapter shows how an image with sufficient contrasted objects may be segmented region‐by‐region and how to extract the neighboring catchment zone, separated from the previous one by the lowest pass point. It presents an example of an image with well‐marked transitions between structures and substructures in the image, and without noise. The intensity of the transition between a newly segmented catchment zone and the portion of the image segmented previously is measured by the altitude of the pass point between the two regions. The transitions between neighboring catchment zones do not have the same intensity. Some zones are extremely similar in the initial image, and the gradient between them has a low value. The chapter also shows how it is possible to adapt the step‐by‐step segmentation method to marker‐based segmentation.

  • Flowing Graphs

    This chapter explains how to assign weights to the nodes in an edge‐weighted graph or to the edges in a node‐weighted graph. In a node‐weighted graph, each edge is the flowing edge of one of its extremities, whose weight may be assigned to the edge. In an edge‐weighted graph, each node is the origin of one or several flowing edges, the adjacent edges with minimal weight. The chapter models node‐ and edge‐weighted graphs as a network of tanks interconnected by pipes. The level of water in the tanks represents the node weights and the altitude of the pipes represents the edge weights. The chapter establishes an equivalence between node‐ and edge‐weighted graphs. It associates each node (respectively edge) weighted graph with an edge (respectively node) weighted graph such that the regional minima and catchment zones of both graphs are identical.

  • Flooding and Flooding Distances

    This chapter paves the way for many algorithms to construct dominated flooding. A flooding distance between nodes is defined as the lowest lake that contains two nodes. The shortest flooding distance to a node or a set of nodes is a valid flooding. Furthermore, dominated flooding may be expressed as the shortest flooding distance on an augmented graph, in which a dummy node and dummy edges encoding the ceiling function are introduced. The augmented graph enables us to devise several dominated flooding algorithms using popular shortest distance transforms. In particular, Dijkstra's shortest distance algorithm may be adapted to both node‐ and edge‐weighted graphs. Dijkstra's algorithm floods all the nodes in the increasing order of their flooding level. The core‐expanding algorithm on the contrary schedules the flooding in the increasing order of the flooding nodes and not of the flooded nodes.

  • The Topography of Digraphs

    The flowing paths defined for the initial node‐ or edge‐weighted, undirected graphs simply become directed paths in the derived digraphs. This chapter explores how much topographic information is encoded in the arcs of an unweighted digraph. The digraphs derived from a node‐ or edge‐weighted graph by replacing each flowing edge with a directed arc are not the most general possible. In such a digraph, a directed loop only exists if all internal arcs are bidirectional. The chapter examines how much of the topography of the initial graph is lost or, on the contrary, preserved, if we skip the weights of nodes or edges in the digraph derived from a node‐ or edge‐weighted graph. Labels may be attributed to the nodes to encode the various substructures extracted from the digraph. All nodes belonging to the same substructure, for instance, a black hole, or a catchment zone, or a flowing path, may share the same label.

Standards related to Extremities

Back to Top

IEEE Standard for Safety Levels with Respect to Human Exposure to Radio Frequency Electromagnetic Fields, 3 kHz to 300 GHz

Recommendations are made to protect against established adverse health effects in human beings associated with exposure to electric, magnetic and electromagnetic fields in the frequency range of 3 kHz to 300 GHz. The recommendations are expressed in terms of basic restrictions (BRs) and maximum permissible exposure (MPE) values. The BRs are limits on internal fields, specific absorption rate (SAR), and ...