17,637 resources related to Benchmark testing
- Topics related to Benchmark testing
- IEEE Organizations related to Benchmark testing
- Conferences related to Benchmark testing
- Periodicals related to Benchmark testing
- Most published Xplore authors for Benchmark testing
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.
2021 IEEE Photovoltaic Specialists Conference (PVSC)
Photovoltaic materials, devices, systems and related science and technology
2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting
The joint meeting is intended to provide an international forum for the exchange of information on state of the art research in the area of antennas and propagation, electromagnetic engineering and radio science
The world's premier EDA and semiconductor design conference and exhibition. DAC features over 60 sessions on design methodologies and EDA tool developments, keynotes, panels, plus the NEW User Track presentations. A diverse worldwide community representing more than 1,000 organizations attends each year, from system designers and architects, logic and circuit designers, validation engineers, CAD managers, senior managers and executives to researchers and academicians from leading universities.
2020 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
CVPR is the premier annual computer vision event comprising the main conference and several co-located workshops and short courses. With its high quality and low cost, it provides an exceptional value for students, academics and industry researchers.
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 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, ...
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.
Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)
Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...
SCC 2013; 9th International ITG Conference on Systems, Communication and Coding, 2013
We consider a two-way relaying system employing physical layer network coding (PNC) in channels suffering from frequency-selective fading. In order to mitigate the distortions introduced by the channel, decision-feedback equalization (DFE) is used at the relay node. We introduce transmit filters that generate identical overall channel impulse responses for the links from both source nodes to the relay node, while ...
26th International Conference on Architecture of Computing Systems 2013, 2013
Dependability and safety are important requirements of embedded real-time systems. It is necessary to integrate mechanisms for an early fault detection to enable a potential error recovery before missing a deadline. Additionally, code size is an important concern regarding these systems. In this paper, we present optimization techniques for a timing and control flow checker designed for hard real-time systems. ...
2018 IEEE/ACM 40th International Conference on Software Engineering: Companion (ICSE-Companion), 2018
Deadlock is among the most complex problems affecting the reliability of programs containing multiple, asynchronous threads. When undetected, deadlocks can lead to permanent thread blockage. Current detection methods are typically based on timeout and rollback of computations, resulting in significant delays. This paper presents Deadlock Detector and Solver (DDS), which can quickly detect and resolve circular deadlocks in Java programs. ...
26th International Conference on Architecture of Computing Systems 2013, 2013
To increase the performance of a program, developers have to parallelize their code due to trends in modern hardware development. Since the parallelization of source code is paired with additional programming effort, it is desirable to know if a parallelization would result in an advantage in performance before implementing it. This paper examines the use of benchmarks for estimating the ...
IEEE Conference Anthology, 2013
Cache plays an important role in multilevel storage system. It can greatly reduce the memory access latency. So the cache hit rate has a significant impact on the performance of the application. Many processors provide cache locking mechanism, which can lock the certain lines in cache. It enables an application to affect the cache replacement decisions under software control. This ...
Validating Cyber-Physical Energy Systems, Part 4: IECON 2018
Validating Cyber-Physical Energy Systems, Part 2: IECON 2018
Validating Cyber-Physical Energy Systems, Part 3: IECON 2018
IMS 2011 Microapps - Digital Radio Testing Using an RF Channel Replicator
Expanding Wellness & Preventative Care via Home-Based Testing - Erika Tyburski - IEEE EMBS at NIH, 2019
IMS 2012 Microapps - Virtual Flight Testing of Radar System Performance Daren McClearnon, Agilent EEsof
Synthetic Fuels to the Rescue?
Non-Volatile Memory Array Based Quantization - Wen Ma - ICRC San Mateo, 2019
Mark I. Montrose: Testing for EMC Compliance
Standards Education: Strategic Standardization (English)
Panel: Integrating POC Testing for HLBS Diseases into Clinical Care - IEEE EMBS at NIH, 2019
Integrating Mobile POC Testing into Nigeria’s Healthcare System - Umut Gurkan - IEEE EMBS at NIH, 2019
MicroApps: Flexible Digital Modulation Testing for Satellite Regenerative Payloads (Agilent Technologies)
Tim Winters: Internet of Things IP Testing Service - IPv6 IoT InterOp-Ware Industry Forum Panel: WF IoT 2016
Analytical, Cost & Outcome: POC Testing Implementation - Bradley Karon - IEEE EMBS at NIH, 2019
POC AAT-based Diagnostic Technology - Paul Yager - IEEE EMBS at NIH, 2019
Standards Education: Strategic Standardization (with Chinese subtitles)
Panel: Moving POC Technologies to the Patient - IEEE EMBS at NIH, 2019
5G mmW Phased Arrays - Future X Radio Panel Talk - Baljit Singh - Brooklyn 5G Summit 2018
We consider a two-way relaying system employing physical layer network coding (PNC) in channels suffering from frequency-selective fading. In order to mitigate the distortions introduced by the channel, decision-feedback equalization (DFE) is used at the relay node. We introduce transmit filters that generate identical overall channel impulse responses for the links from both source nodes to the relay node, while achieving the maximum signal-to- noise ratio (SNR) for zero-forcing DFE and minimum mean-squared error DFE at the relay node. The performance gain of our novel approach is compared against a benchmark filtering scheme which also creates identical channel impulse responses to enable decision-feedback equalization at the relay.
Dependability and safety are important requirements of embedded real-time systems. It is necessary to integrate mechanisms for an early fault detection to enable a potential error recovery before missing a deadline. Additionally, code size is an important concern regarding these systems. In this paper, we present optimization techniques for a timing and control flow checker designed for hard real-time systems. These improvements allow a massive reduction of the required overhead with only slight decreases of the fault detection capabilities. An experimental evaluation shows that the additional memory usage can be minimized by around 30%, while the execution time overhead is even reduced by around 50%. On the other hand, more than 57% of injected faults can still be detected by our technique - at an average detection latency of less than 30 processor cycles.
Deadlock is among the most complex problems affecting the reliability of programs containing multiple, asynchronous threads. When undetected, deadlocks can lead to permanent thread blockage. Current detection methods are typically based on timeout and rollback of computations, resulting in significant delays. This paper presents Deadlock Detector and Solver (DDS), which can quickly detect and resolve circular deadlocks in Java programs. DDS uses a supervisory controller, which monitors program execution and automatically detects deadlocks resulting from hold-and-wait cycles on monitor locks. When a deadlock is detected, DDS uses a preemptive strategy to break the deadlock. Based on our experiments, DDS can in fact resolve deadlocks without significant run-time overhead.
To increase the performance of a program, developers have to parallelize their code due to trends in modern hardware development. Since the parallelization of source code is paired with additional programming effort, it is desirable to know if a parallelization would result in an advantage in performance before implementing it. This paper examines the use of benchmarks for estimating the performance gain looking at the parallelization of Population Based Algorithms (PBAs) like Genetic Algorithms (GAs) and Particle Swarm Optimization Algorithms (PSOs) to be implemented on multi- and many-cores. These benchmarks are named function based benchmarks due to their dependence on the PBAs' functions. Furthermore, the software-hardware mapping with the most performance gain is suggested.
Cache plays an important role in multilevel storage system. It can greatly reduce the memory access latency. So the cache hit rate has a significant impact on the performance of the application. Many processors provide cache locking mechanism, which can lock the certain lines in cache. It enables an application to affect the cache replacement decisions under software control. This paper presents a novel method, which uses cache locking mechanism to reduce the run-time of java virtual machine (JVM). JVM often uses just-in-time compiler (JIT) to improve the performance. JIT compiles the method that has been invoked certain times, and then JVM executes the compiled method when invoking this method the next time. This paper analyzes the calling situation of the compiled method in JVM, and then proposes a heuristic approach to lock the compiled method in cache for an appropriate period. It can reduce cache miss rate when JVM executes the compiled method. The algorithm has been implemented in HotSpot based on Loongson-3A. Also, it can be implemented in other run-time systems. Experiment results show that the cache locking heuristic algorithm averagely reduces the cache miss rate by 8.5%, and improves the performance by 4% on the benchmark SPECjvm2008.
There is a strong belief that the improvement of preventive safety applications and the extension of their operative range are achieved by the deployment of multiple sensors with wide fields of view (FOV). The paper contributes to the solution of the problem and introduces distributed sensor data fusion architectures and algorithms for an efficient deployment of multiple sensors that give redundant or complementary information for the moving objects. The proposed fusion architecture is based on a modular approach allowing exchangeability and benchmarking using the output of individual trackers, whereas the fusion algorithm gives a solution to the track management problem and the coverage of wide perception areas. The test case is LATERAL SAFE sensor configuration, which monitors the rear and lateral areas of the vehicle. Results show that with the given approach the system is able to maintain the ID of all objects in transition (an object enters a sensor's FOV) and blind areas (no sensor coverage)
Brayton (1982-90) and others have developed a rich theory of decomposition of switching functions based on algebraic manipulations of monomials. In this theory, a product g(X/sub g/)/spl middot/h(X/sub h/) is algebraic if X/sub g//spl cap/X/sub h/=O. There are efficient methods for determining if a function has an algebraic product. If a function does not have an algebraic product, then there are good methods for obtaining a decomposition of the form f=g/spl middot/h+r where g/spl middot/h is an algebraic product. Algebraic decompositions have the desirable properties that they are canonical and preserve testability. In this paper we generalize the concept of an algebraic product to decompositions of the form f(X)=g(X/sub g/)??h(X/sub h/) where ?? is any binary Boolean operation and |X/sub g//spl cap/X/sub h/|=k for some k/spl ges/0. We call these decompositions quasi-algebraic decompositions. We begin by showing that we may restrict ourselves to the case where ?? is +(sum),/spl middot/(product) or /spl oplus/ (enclusive-or). We then give necessary and sufficient conditions for a function to have a quasi-algebraic decomposition for a given X/sub g/ and X/sub h/. If a function has such a decomposition we show how to determine the functions g and h in a canonical manner. We also show that these decompositions are fully SSL testable. Finally, using standard benchmark circuits, we show that quasi algebraic decompositions occur often and are useful in reducing circuit size.
Particle swarm optimization (PSO) is a recently proposed population-based random search algorithm, which performs well in some optimization problems. In this paper, we proposed an improved PSO algorithm to solve portfolio selection problems. The proposed approach IPSO employs an opposite mutation operator to enhance the performance of the standard PSO. In order to verify the performance of IPSO, we test it on five well-known benchmark function optimization problems. At last, we use IPSO to solve a classical portfolio selection problem. The results show that the proposed approach is effective and achieves better results than standard PSO.
A novel approach to solving the false path problem is proposed. The approach is based on an extended Boolean algebra and is capable of modeling the logic and timing behavior of logic networks in terms of modified Boolean functions. By applying algebraic manipulations, one can use this approach to extract correct timing information such as path delays as well as the input vectors to activate the sensitizable paths. There are two innovative ideas involved in the approach: (1) an algebraic method is used to deal with the problem of delay analysis, and (2) the rising and falling delays of each node are extracted separately. The approach has been implemented and tested on ISCAS benchmarks.<<ETX>>
Cloud computing has gained enormous popularity both in business and academia due its on demand service over Internet to the customers on pay-as-you-go model. Task scheduling in cloud computing is a well known problem that has been paid enormous attention. This is even more challenging, particularly for multi-cloud environment. Due to its NP-Hardness, many heuristics have been developed recently. In this paper, we also present a task scheduling algorithm which is based on the popular Min-Max normalization technique in data mining. We refer our proposed algorithm as Normalized Multi-Objective Min-Min Max-Min Scheduling (NMOMXS). Through simulation, the algorithm is shown to outperform two well known existing algorithms in terms of makespan and resource utilization.
To specify protocols for the measurement of the peak spatial-average specific absorption rate (SAR) in a simplified model of the head of users of hand-held radio transceivers used for personal wireless communications services and intended to be operated while held next to the ear. It applies to contemporary and future devices with the same or similar operational characteristics as contemporary ...