In this paper, we examine the adequacy of the current international Protocol's Implementation Conformance Statement Proforma (PICSP) [13] to meet the end user's Conformance Testing Requirements (CTRs). We focu...
详细信息
ISBN:
(纸本)9781424438075
In this paper, we examine the adequacy of the current international Protocol's Implementation Conformance Statement Proforma (PICSP) [13] to meet the end user's Conformance Testing Requirements (CTRs). We focus on those CTRs that are applicable to the international Formal Description Techniques (FDTs). A number of shortfalls are uncovered. then, we develop refinements called Testability-Directed PICSP (TDPICSP), of the current international PICSP [131 to rectify the shortfalls. It also enhances the testability of the protocol standard. We illustrate our development by examples using international standards.
this paper presents a technique for enhancing the capabilities of SVG graphics generated via the Batik library and the Java Abstract Windowing Toolkit (AWT). the enhancements include CSS stylesheet support with multip...
详细信息
this paper presents a technique for enhancing the capabilities of SVG graphics generated via the Batik library and the Java Abstract Windowing Toolkit (AWT). the enhancements include CSS stylesheet support with multiple media types, support for high quality patterns, enhancements to enable interactivity and animation, and an enhancement that adds logical grouping to the SVG objects created on introspection of the java stack. these enhancements can be applied to any tool that uses AWT. For the purposes of this paper the enhancements are applied to charts created by the JFreeChart charting library. the enhancements bring the SVG output of the tool up to par with its native Java AWT abilties, and in some instances allow it to surpass its native AWT capability.
Based on the theory of artificial neural network,BP algorithm is used for the training of networks,and the relationship between the controlling parameters in hot rolling (temperature, rolling press, chemical compositi...
详细信息
the Calling Context Tree (CCT) is a prevailing datastructure for calling context profiling. As generating a complete CCT reflecting every method call is expensive, recent research has focused on efficiently approximat...
详细信息
ISBN:
(纸本)9781605585987
the Calling Context Tree (CCT) is a prevailing datastructure for calling context profiling. As generating a complete CCT reflecting every method call is expensive, recent research has focused on efficiently approximating the CCT with sampling techniques. However, for tasks such as debugging, testing, and reverse engineering, complete and accurate CCTs are often needed. In this paper, we introduce the ParCCT, a novel approach to parallelizing application code and CCT generation on multicores. Each thread maintains a shadow stack and generates "packets" of method calls and returns that correspond to partial CCTs. Each packet includes a copy of the shadow stack, indicating the calling context of the first method call in the packet. Hence, packets are independent of each other and can be processed out-of-order and in parallel in order to update the CCT. Our portable and extensible implementation targets standard Java Virtual Machines, thanks to instrumentation techniques that ensure complete bytecode coverage and efficiently support custom calling context representations. the ParCCT is more than 110% faster than a primitive, non-parallel approach to CCT construction, when more than two cores are available. this speedup stems both from reduced contention and from parallelization. Copyright 2009 ACM.
functional Reactive programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchronous data-flow paradigm and supports ...
详细信息
ISBN:
(纸本)9781605583327
functional Reactive programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchronous data-flow paradigm and supports both continuous-time and discrete-time signals (hybrid systems). What sets FRP apart from Most other languages for similar applications is its support for systems with dynamic structure and for higher-order reactive constructs. Statically guaranteeing correctness properties of programs is an attractive proposition. this is true in particular for typical application domains for reactive programming such as embedded systems. To that end, many existing reactive languages have type systems or other static checks that guarantee domain-specific properties, such as feedback loops always being well-formed. However, they are limited in their capabilities to support dynamism and higher-order data-flow compared with FRP. thus, the onus of ensuring such properties of FRP programs has so far been on the programmer as established static techniques do not suffice. In this paper, we show how dependent types allow this concern to be addressed. We present an implementation of FRP embedded in the dependently-typed language Agda, leveraging the type system of the host language to craft a domain-specific (dependent) type system for FRP. the implementation constitutes a discrete, operational semantics of FRP, and as it passes the Agda type, coverage, and termination checks, we know the operational semantics is total, which means our type system is safe.
Multiprocessor System-on-Chips (MPSoCs) are nowadays widely used, but the problem of their software development persists to be one of the biggest challenges for developers. Virtual Platforms (VPs) are introduced to th...
详细信息
ISBN:
(纸本)9781605586281
Multiprocessor System-on-Chips (MPSoCs) are nowadays widely used, but the problem of their software development persists to be one of the biggest challenges for developers. Virtual Platforms (VPs) are introduced to the industry, which allow MPSoC software development without a hardware prototype. Nevertheless, for developers in early design stage where no VP is available, the software programming support is not satisfactory. this paper introduces a High-level Virtual Platform (HVP) which aims at early MPSoC software development. the framework provides a set of tools for abstract MPSoC simulation and the corresponding application programming support in order to enable the development of reusable C code at a high level. the case study performed on several MPSoCs shows that the code developed on the HVP can be easily reused on different target platforms. Moreover, the high simulation speed achieved by the HVP also improves the design efficiency of software developers. Copyright 2009 ACM.
We present a novel predictive statistical framework to improve the performance of an Eigen Tracker which uses fast and efficient eigen space updates to learn new views of the object being tracked on the fly using cand...
详细信息
ISBN:
(纸本)9780769535203
We present a novel predictive statistical framework to improve the performance of an Eigen Tracker which uses fast and efficient eigen space updates to learn new views of the object being tracked on the fly using candid co-variance free incremental PCA. the proposed system detects and tracks an object in the scene by learning the appearance model of the object online motivated by non-traditional uniform norm. It speeds up the tracker many fold by avoiding non-linear optimization generally used in the literature.
We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state varia...
详细信息
ISBN:
(纸本)9780769538709
We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state variables like integers. this method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. We implemented it for programs with scalar variables, and we experimented several classical synchronisation protocols in order to illustrate the precision of our technique, but also to analyze the approximations it performs.
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its e ect has not been examined for applications in managed runtime environmen...
详细信息
ISBN:
(纸本)9781605585987
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its e ect has not been examined for applications in managed runtime environments, where there is no concept of memory address. For this reason, traditional reuse distance analysis based on memory addresses is not directly applicable to these applications. this paper presents the Virtual Reuse Distance Analysis (ViRDA), which resolves the difficulties associated with runtime environments and provides insights into the high-level locality in dynamic applications. ViRDA addresses the problem caused by managed runtime artifacts, garbage collection in particular, by using virtual data identities, obtained through a standard profiling interface, to capture inherent data locality. the effectiveness of ViRDA is evaluated using a subset of the SPECjvm2008 benchmark suite. the new analysis reveals the reuse distance signatures of these programs and helps to explain the cause of excessive cache misses. It also predicts locality for large inputs based on training analysis of several small inputs. the prediction error is no more than 6% for the 4 scimark workloads. Copyright 2009 ACM.
We describe a framework for trace-based parallelization of recursive Java programs. We also explore and evaluate the feasibility of using a hardware transactional memory (HTM) system to handle dependences. We design, ...
详细信息
ISBN:
(纸本)9781605585987
We describe a framework for trace-based parallelization of recursive Java programs. We also explore and evaluate the feasibility of using a hardware transactional memory (HTM) system to handle dependences. We design, implement, and evaluate a system that takes as input a sequential program, identifies traces on it, and groups these traces into coarse-grain units of computation, or tasks. We then insert code that allows tasks to execute in parallel transactions using a fork/join paradigm. We also present a software algorithm that ensures sequential program order is maintained by transactional memory. We identify the associated issues and describe criteria that are necessary for Java programs to execute successfully on HTM systems. Our evaluation using JOlden benchmarks indicates that the computational phases of the benchmarks can be executed effectively on HTM systems. the average speedup is 2.7 for four processors. We conclude that HTM is a viable solution to dealing with dependences when performing trace-based parallelization. Copyright 2009 ACM.
暂无评论