检索结果-内蒙古大学图书馆

Digital Signal Processing and its Applications (DSPA), International Conference on

作者： Alexander L. Shestakov Dmitrii V. Galyshev Victoria A. Eremeeva Olga L. Ibryaeva laboratory of self-diagnostics and self-control of devices and systems South Ural State University Chelyabinsk Russia dept. of Applied Mathematics and Programming South Ural State University Chelyabinsk Russia

ISBN: (数字)9798331518752

ISBN: (纸本)9798331518769

The problem of diagnostics of broken rotor bars in an induction (IM) motor based on its current signals is considered. The proposed fault detection technique is based on filtering the current signal in the region around the frequency 7f, where f is the power supply frequency, and further obtaining its envelope using the Hilbert Transform. Scalograms are constructed from the envelopes using a Continuous Wavelet Transform and form a training dataset for the Convolutional Neural Network (CNN) classifier. In real industrial conditions, we have a lack of defective data which is simulated in this paper. It is shown that a CNN model trained on normal data obtained under different motor operating conditions and defective data obtained under one operating mode will poorly detect a defect when changing the operating mode. The reason for this lies in the characteristic defect frequencies change with the change in the operating mode. A data augmentation method based on spectrum distortion is proposed to solve this problem. We distort the spectrum of a real defective signal taking into account its structure and create synthetic data that simulate missing defective signals with different operating conditions. The paper presents the experimental rig and dataset, and shows that the spectral distortion-based augmentation technique significantly improves the performance of the CNN model under conditions of insufficient defective training data.

关键词： Training Power supplies Rotors Training data Distortion Data augmentation Data models Convolutional neural networks Bars Synthetic data

来源：评论

学校读者我要写书评

暂无评论

USER INTERFACE SERVICES IN AD/CYCLE

引用

IBM systems JOURNAL 1990年第2期29卷 236-249页

作者： ARTIM, JM HARY, JM SPICKHOFF, FJ IBM Programming Systems Santa Teresa Laboratory

Significant progress has been made inthe effort to separateprogrammers fromthe management of data storage. By comparison,the window of a workstation is still managedand controlled in greatdetail by the typicalprogrammer. In AD/Cyclemuser interface ser- vices define a set of servicesthat assist in the man- agement of the displayson the workstation. These ser- vices also help increasethe productivity of the tool builder by entorcing Common User Access rules and guidelines, and raisethe level of consistencyof user displaysof the tools inAD/Cycle.

关键词： .WINDOW user interface workstation Santa Teresa application developer common user programming systems AD/Cycle tools AD/Cycle workplace

来源：评论

学校读者我要写书评

暂无评论

REPOSITORY MANAGER TECHNOLOGY

引用

IBM systems JOURNAL 1990年第2期29卷 209-227页

作者： SAGAWA, JM IBM Programming Systems Santa Teresa Laboratory

IBM"s Repository Manager" enables specifications in- volved inthe program application development proc- ess to be *** the basis of the technology, the Repository ManagerfMVS" was developed as a product. The primary concepts and services the of technology are introduced,and specificaspects of the product and its operation are discussed.A discussion of what is involvedin designing and implementing a tool is also included.

关键词： .run-time IBM systems SAA Repository Manager development and execution RM/MVS specificationdomain data and function

来源：评论

学校读者我要写书评

暂无评论

SMARQ: Software-Managed Alias Register Queue for Dynamic Optimizations 45

SMARQ: Software-Managed Alias Register Queue for Dynamic Opt...

引用

45th IEEE/ACM Annual International Symposium on Microarchitecture (MICRO)

作者： Wang, Cheng Wu, Youfeng Rong, Hongbo Park, Hyunchul Programming Systems Laboratory Microprocessor and Programming Research Intel Laboratories USA

ISBN: (纸本)9780769549248;9781467348195

Traditional alias analysis is expensive and ineffective for dynamic optimizations. In practice, dynamic optimization systems perform memory optimizations speculatively, and rely on hardware, such as alias registers, to detect memory aliases at runtime. Existing hardware alias detection schemes either cannot scale up to a large number of alias registers or may introduce false positives. Order-based alias detection overcomes the limitations. However, it brings considerable challenges as how software can efficiently manage the alias register queue and impose restrictions on optimizations. In this paper, we present SMARQ, a Software-Managed Alias Register Queue, which manages the alias register queue efficiently and supports more aggressive speculative optimizations. We conducted experiments with a dynamic optimization system on a VLIW processor that has 64 alias registers. The experiments on a suite of SPECFP2000 benchmarks show that SMARQ improves the overall performance by 39% as compared to the case without hardware alias detection. By scaling up to a large number (from 16 to 64) of alias registers, SMARQ improves performance by 10%. Compared to a technique with false positives (similar to Itanium), SMARQ improves performance by 13%. To reduce the chance of alias register overflow, the novel alias register allocation algorithm in SMARQ reduces the alias register working set by 74% as compared to a straightforward alias register allocation based on program order.

关键词： alias register

来源：评论

学校读者我要写书评

暂无评论

THE ROLE OF WORK MANAGEMENT IN APPLICATION DEVELOPMENT

引用

IBM systems JOURNAL 1990年第2期29卷 189-208页

作者： CHROUST, G GOLDMANN, H GSCHWANDTNER, O IBM Programming Systems Vienna Software Development Laboratory

Quality is probably one of the most serious concerns of today"s software *** software applica- tions exhibiting a certain complexity, the quality of a product can only be guaranteed by a methodological approach, using appropriate administration and tools. The methodology andadministration must be mani- fested in a well-definedand well-observedapplication development *** must integrate the human activity, the tools, and the intermediateand final work products into a coherent flow of actions. In this regard, the developmentof applications follows patterns that are well establishedin other industries wherean application development (AD)process model is defined andthen executed via an interpretation mechanism. Thecomplexity of the developmentproc- ess makesit necessary tosupport and integrate all of its aspects by means ofon-lineinteractive computer support. Computer-aidedprocess support in the gen- eral sense we call work management. This paper ex- plains the concepts of an application development process model andof work management forapplica- tion development underADlCycIe- and its relation to project management.

关键词： .computer support project management process model AD/Cycle application development process work management Vienna Software Development

来源：评论

学校读者我要写书评

暂无评论

THE CROSS SYSTEM PRODUCT APPLICATION GENERATOR - AN EVOLUTION

引用

IBM systems JOURNAL 1988年第3期27卷 384-390页

作者： HAYNES, WK DEWELL, ME HERMAN, PJ IBM Programming Systems Development Laboratory Cary NC

An application generator is a generalized application development tool with which professional programmers develop applications using a fourth-generation language. This paper describes the requirements that led to the Cross System Product application generator, and how the product progressed from a single-environment product to the current multienvironment product. Also described are how the Cross System Product fits within systems Application Architecture and how that may affect the future of the Cross System Product.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uniform confluence in concurrent computation

引用

Journal of Functional programming 2000年第5期10卷 453-499页

作者： Niehren, Joachim Programming Systems Laboratory Universität des Saarlandes 66041 Saarbrücken Germany

Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on the scheduling of actors created during program execution. This property contrast concurrent programs from purely functional programs. A functional program is uniformly confluent in the sense that all its possible executions coincide modulo reordering of execution steps. In this paper, we investigate concurrent programs that are uniformly confluent and their relation to eager and lazy functional programs. We study uniform confluence in concurrent computation within the applicative core of the π-calculus which is widely used in different models of concurrent programming (with interleaving semantics). In particular, the applicative core of the π-calculus serves as a kernel in foundations of concurrent constraint programming with first-class procedures (as provided by the programming language Oz). We model eager functional programming in the λ-calculus with weak call-by-value reduction and lazy functional programming in the call-by-need λ-calculus with standard reduction. As a measure of time complexity, we count application steps. We encode the λ-calculus with both above reduction strategies into the applicative core of the π-calculus and show that time complexity is preserved. Our correctness proofs employs a new technique based on uniform confluence and simulations. The strength of our technique is illustrated by proving a folk theorem, namely that the call-by-need complexity of a functional program is smaller than its call-by-value complexity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

COMPOSITIONAL PRIORITY SPECIFICATION IN REAL-TIME DISTRIBUTED systems

引用

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 1992年第1期17卷 75-93页

作者： SHYAMASUNDAR, RK LIU, LY Computer Science Group Tata Institute of Fundamental Research Bombay India IBM Programming Systems Cary Laboratory Cary USA

In this paper, we develop a compositional denotational semantics for prioritized real-time distributed programming languages. One of the interesting features is that it extends the existing compositional theory proposed by Koymans et al (1988) for prioritized real-time languages preserving the compositionality of the semantics. The language permits users to define situations in which an action has priority over another action without the requirement of preassigning priorities to actions for partially ordering the alphabet of actions. These features are part of the languages such as Ada designed specifically keeping in view the needs of real-time embedded systems. Further, the approach does not have the restriction of other approaches such as prioritized internal moves can preempt unprioritized actions etc. Our notion of priority in the environment is based on the intuition that a low priority action can proceed only if the high priority action cannot proceed due to lack of the handshaking partner at that point of execution. In other words, if some action is possible corresponding to that environment at some point of execution then the action takes place without unnecessary waiting. The proposed semantic theory provides a clear distinction between the semantic model and the execution model - this has enabled us to fully ensure that there is no unnecessary waiting.

关键词： COMPOSITIONAL SPECIFICATION REAL-TIME DISTRIBUTED systems PRIORITY SPECIFICATION MESSAGE PASSING MODELS

来源：评论

学校读者我要写书评

暂无评论

Prefetch injection based on hardware monitoring and object metadata

Prefetch injection based on hardware monitoring and object m...

引用

Proceedings of the 2004 ACM SIGPLAN Conference on programming Language Design and Implementation (PLDI'04)

作者： Adl-Tabatabai, Ali-Reza Hudson, Richard L. Serrano, Mauricio J. Subramoney, Sreenivas Programming Systems Laboratory Microprocessor Technology Laboratory Intel Corporation Santa Clara CA United States

Cache miss stalls hurt performance because of the large gap between memory and processor speeds - for example, the popular server benchmark SPEC JBB2000 spends 45% of its cycles stalled waiting for memory requests on the Itanium® 2 processor. Traversing linked data structures causes a large portion of these stalls. Prefetching for linked data structures remains a major challenge because serial data dependencies between elements in a linked data structure preclude the timely materialization of prefetch addresses. This paper presents Mississippi Delta (MS Delta), a novel technique for prefetching linked data structures that closely integrates the hardware performance monitor (HPM), the garbage collector's global view of heap and object layout, the type-level metadata inherent in type-safe programs, and JIT compiler analysis. The garbage collector uses the HPM's data cache miss information to identify cache miss intensive traversal paths through linked data structures, and then discovers regular distances (deltas) between these linked objects. JIT compiler analysis injects prefetch instructions using deltas to materialize prefetch addresses. We have implemented MS Delta in a fully dynamic profile-guided optimization system: the StarJIT dynamic compiler and the ORP Java virtual machine, We demonstrate a 28-29% reduction in stall cycles attributable to the high-latency cache misses targeted by MS Delta and a speedup of 11-14% on the cache miss intensive SPEC JBB2000 benchmark.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Elementary indefinite integration theory for the computer

引用

Journal of Computer and System Sciences 1969年第4期3卷 387-408页

作者： Morris Jr., Alfred H. Programming Systems Branch U. S. Naval Weapons Laboratory Dahlgren VA 22448 United States

In this paper various algebraic properties of the indefinite Riemann integral that are appropriate for its use on the computer are examined. From this analysis it is seen that the operation of the integral on certain simply described families of functions, called invariant algebras, indicates how it must also act on more complex families of maps. Several examples of the theory are presented, illustrating among other things the relationship existing between integrals of certain types of hypergeometric functions and the integrals of the exponential and trigonometric functions. © 1969 Academic Press, Inc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：