ppxscal/embedding_network huggingface dataset:
Soft-edge flip-flops for improved timing yield: design and optimization
Authors: Vivek Joshi, David Blaauw, Dennis Sylvester
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Parameter variations cause high yield losses due to their large impact on circuit delay. In this paper, we propose the use of so-called soft-edge flip-flops as an effective way to mitigate these yield losses. Soft-edge flip-flops have a small window of transparency (ranging from 0.25-3 FO4) instead of a hard edge, allowing limited cycle stealing on critical paths, and thus compensating for delay variations. By enabling time borrowing, soft-edge flip-flops allow random delay variations to average out across multiple logic stages. In addition, they address small amounts of delay imbalance between logic stages, further maximizing the frequency of operation. We develop a library of soft-edge flip-flops with varying amounts of softness. We show that the power and area overhead of soft-edge flip-flops grows directly with the amount of softness. We then propose a statistically aware flip-flop assignment algorithm that maximizes the gain in timing yield while minimizing the incurred power overhead. Experimental results on a wide range of benchmark circuits show that the proposed approach improves the mean delay by 1.9--22.3% while simultaneously reducing the standard deviation of delay by 1.9--24.1% while increasing power by a small amount (0.3--2.8%).
Automated generation of test suites from formal specifications of real-time reactive systems
Authors: Mao Zheng, Vasu Alagar, Olga Ormandjieva
Venue: Journal of Systems and Software (2008)

Real-time reactive systems are among the most difficult systems to test because of their size and complex time-dependent functionality. The number of test experiments for such systems is very large, if not infinite. Often such systems arise in safety-critical contexts. Hence, such systems require a rigorous analysis and thorough testing before they are deployed. This paper addresses test case generation methods and a metric-based test case selection algorithm for sufficient testing of real-time reactive systems. The methods are rigorous, and based on the formal specifications of the system and its fault models. The test generation and execution of algorithms are implemented in TROMLAB, a formal framework for developing real-time reactive systems. The methods are applied to the formal specification of the Train-Gate-Controller (TGC) example, a bench-mark case study in the real-time systems community. A brief description of the experimental results obtained on the case study is given.
Validity Test of the Eigenfunction Expansion Method in the Transient Wave Propagation Simulation
Authors: Hailun He, Shuang Li, Jinbao Song
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To test the validity of the eigenfunction expansion method (EEM), a great deal of wave profiles calculated by EEM are compared with the corresponding results obtained by the boundary element method (BEM), which has been verified by many experiments. The comparisons shown that the rel- ative errors of the maximum wave height between them are smaller than 5.5% after 10 periods when the initial wave steepness is below 0.157. However, the errors exceed 12.3% if the initial wave steepness greater than 0.198. As ref- erences, we also compared them with the linear solutions. The investigation confirmed that EEM is only valid in the transient wave propagation simulation for small or moder- ate wave steepness as expected. The corresponding spectrum analysis also reveals that EEM fails to capture harmonics with high wave numbers for the steep waves.
A Study on ADIF Based on e-Science Deployment Architecture
Authors: Wanbing Shi, Yi Yang, Chunyan Zhang, Lian Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Recently, grid computing related researches have flourished in China. e-Science, which aims to create an enabling grid-based infrastructure appropriate for the science drivers, also has gradually played an important role in scientific communities. Initially, e-Science was always interlaced with grid directly, which resulted in the maintenance of e-Science applications involved in embarrassment. Therefore, the need for legible and distinguishable implications of them becomes widely aware. We have proposed a novel architecture, which emphasizes the notion of deploying e-Science on grid, not to develop e-Science with grid directly. In this paper, we present a preliminary specification, called ADIF, which is the extensibility of our previous work, primarily discussing the details of its resource management, workflow management and virtual team management in e-Science application-level. We also provide a prototype system of the collaborative work environment, which can facilitate scientists taking advantage of e-Science more usably. Last, an exemplary e-Science application scenario in chemistry will be demonstrated.
Pedagogical design issues for e learning: a practical application
Authors: Alan Murphy
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

e-learning provides a relatively new method for teaching in higher education in general and in East and South East Asia in particular. Many e-learning programmes are developed using a western based pedagogy for use in the east. However, the evaluation of these programmes is in its infancy. The current study was co-funded by the EU and adds to the body of research providing guidance for e-educators. The qualitative data collected from e learning tutors from South East and East Asia indicates that there are differences based on cultural context in the following areas of communication; within student peer groups; tutor to student, as well as variations in the willingness to discuss problems. The study provides recommendations to enhance the distance education programmes. The conclusion points to issues that should be addressed at the design and managerial levels.
ET-lipschitzian and ET-kernel aggregation operators
Authors: J. Jacas, J. Recasens
Venue: International Journal of Approximate Reasoning (2007)

Lipschitzian and kernel aggregation operators with respect to natural T-indistinguishability operators E"T and their powers are studied. A t-norm T is proved to be E"T-lipschitzian, and is interpreted as a fuzzy point and a fuzzy map as well. Given an archimedean t-norm T with additive generator t, the quasi-arithmetic mean generated by t is proved to be the most stable aggregation operator with respect to T.
Economic Pseudodivision Processes for Obtaining Square Root, Logarithm, and Arctan
Authors: B. P. Sarkar, E. V. Krishnamurthy
Venue: IEEE Transactions on Computers (1971)

Modified Meggitt methods (pseudodivision methods) are suggested for evaluating logarithm, arctan, and square root. The modifications described here consist in restricting the magnitude of the pseudopartial remainsler such that the pseudoquotient assumes a form close to the minimal representation in the radix of choice. These methods will become useful for large-scale integrated system design.
Matrix Codes: Multiple Bit Upsets Tolerant Method for SRAM Memories
Authors: Costas Argyrides, Hamid R. Zarandi, Dhiraj K. Pradhan
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper presents a high level method called Matrix code to protect SRAM-based memories against multiple bit upsets. The proposed method combines hamming code and parity code to assure the reliability of memory in presence of multiple bit-upsets with low area and performance overhead. The method is evaluated using one million multiple-fault injection experiments; next reliability and MTTF of the protected memories are estimated based on fault injection experiments and several equations. The fault detection/correction coverage are also calculated and compared with previous methods i.e., Reed-Muller and hamming code. The results reveal that the proposed method behaves better than these methods in terms of fault detection and correction of multiple faults regarding to the area overhead
Spatially Adaptive Image Deblurring Algorithm Based on Abdou Operator
Authors: Jianhang Huang, Jianzhong Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

During digital image deblurring, a priori knowledge of blurred image is incorporated into regularization to adaptively adjust the global regularization parameter for better preserving the edge in the image and suppressing ringing effects. So the weighting matrix in the spatial domain is constructed by calculating the gradient amplitude of each pixel based on Abdou operator with the consideration of human visual system. It equals that all pixels in the image are processed with different regularization parameter when the weighting matrix is applied to the solution. The final step is to solve the problem by the method of Conjugate Gradient. Compared with the method proposed by Lagendijk which is based on local variance, algorithm based on Abdou operator is feasible and quite simple with good deblurring results.
Task-based information retrieval: structuring undergraduate history essays for better course evaluation using essay-type visualizations
Authors: John E. Leide, Charles Cole, Jamshid Beheshti, Andrew Large, Yang Lin
Venue: Journal of the American Society for Information Science and Technology (2007)

When domain novices are in C.C. Kuhlthau's (1993) Stage 3, the exploration stage of researching an assignment, they often do not know their information need; this causes them to go back to Stage 2, the topic-selection stage, when they are selecting keywords to formulate their query to an Information Retrieval (IR) system. Our hypothesis is that instead of going backward, they should be going forward toward a goal state--the performance of the task for which they are seeking the information. If they can somehow construct their goal state into a query, this forward-looking query better operationalizes their information need than does a topic-based query. For domain novice undergraduates seeking information for a course essay, we define their task as selecting a high-impact essay structure which will put the student's learning on display for the course instructor who will evaluate the essay. We report a study of first-year history undergraduate students which tested the use and effectiveness of "essay type" as a task-focused query-formulation device. We randomly assigned 78 history undergraduates to an intervention group and a control group. The dependent variable was essay quality, based on (a) an evaluation of the student's essay by a research team member, and (b) the marks given to the student's essay by the course instructor. We found that conscious or formal consideration of essay type is inconclusive as a basis of a task-focused query-formulation device for IR.
An Approach to Improve Accuracy Rate of On-line Signature Verification Systems of Different Sizes
Authors: R. Araujo, G. Cavalcanti, E. Filho
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper discusses the problem of size variation in on-line signature verification systems. The main idea of the article is to investigate the influence of the size variation in the feature extraction techniques and how this distortion can affect the final classification performance of the systems. In this study a new classification approach was suggested based on Kholmatov and Yanikoglu work in order to measure this performance. Besides that, a feature selection technique was applied in the description of the patterns with the purpose of over come the size variation problem. All the experiments were performed in a database constructed with signatures of three different sizes and skilled forgeries. This kind of study plays an important role in the implementation of systems that uses different signature sources.
Dynamically Reconfigurable Cache for Low-Power Embedded System
Authors: Liming Chen, Xuecheng Zou, Jianming Lei, Zhenglin Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The choice of cache configuration impacts the system significantly. Modern embedded systems execute a specific class of applications repeatedly, thus adapting the cache parameters to those few applications can obtain tremendous benefits. We propose the dynamically reconfigurable cache architecture to improve not only overall performance, but also energy consumption for embedded systems. First, we introduce a novel reconfiguration management algorithm (RMA) dynamically detecting phase changes and automatically searching the large space of possible cache configurations for the optimal one. Then, a particular cache organization, cooperating with the RMA, is presented to reconfigure the cache with respect to a three-dimensional space, namely, cache capacity, line size, and associativity. The results of experiments validate the efficiency and accuracy of the RMA by performing simulation on the SPEC CPU2000 embedded system benchmarks. We show that the embedded systems can achieve the compromise between performance and energy using this approach.
The Architecture of Mobile Virtual Environment
Authors: Peng Lv, Yuebin Bai, Jihong Ma, Yanwen Ju, Depei Qian
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Now it is prevalent that researchers have to leave their laboratory for another place to continue their missions. Facing unacquainted environment and feeling discomfort, they desire to have the same work environment as they are in lab. To resolve this issue, ReMoVE, a Research Mobile Virtual Environment, was presented to fulfill this desire. The architecture of ReMoVE, which is based on the virtual machine, is concentrated on first, and many details of every component are provided, such as Describer, Customizer, Loader, Transmitter and distributor. In addition, an integrated workflow for this system is illuminated to comprehend the architecture clearly. Further, the actual application in real lives is shown, which describes the main processes when researchers make use of the ReMoVE in different places.
Verifying Delivered QoS in Multihop Wireless Networks
Authors: Suresh Singh, Tom Shrimpton
Venue: IEEE Transactions on Mobile Computing (2007)

The question we consider here is the following: “How can a source verify the QoS (Quality of Service) experienced by its packet(s) at each hop to the destination in a multi-hop wireless network?” For example, if Bob needs to forward packets within some maximum delay of δB, how can the source verify that Bob did in fact forward the packets within this bound? Answering this question will enable innovations in multi-hop wireless network deployments where nodes may receive payment not only for forwarding packets but also for meeting some QoS guarantees. In this paper we present protocols that enable verification of delivered QoS for individual packets as well as verification of statistical QoS for groups of packets. The protocols are proved to be cheat-proof. We also provide expressions for the minimum verifiable delay.
Generic Fault Characterizations for Table Look-Up Coverage Bounding
Authors: V. K. Agarwal
Venue: IEEE Transactions on Computers (1980)

Given any combinational, internal fan-out-free network and any complete single fault detection test set (SFDTS) for the network, we consider in this paper the problem of determining the minimal extent to which that SFDTS will cover multiple faults in the network. The basis of our approach is the development of a generic perspective to multiple faults which uses a representation of such faults called an L-expression. This perspective leads to a technique for obtaining the greatest lower bound on the multiple fault coverage capability of an SFDTS by means of a simple table look-up process. In addition to generalizing previously known results regarding multiple fault coverage, two particularly interesting results obtained from this approach are as follows: 1) On the average, every SFDTS for an internal fan-out-free network covers 92 percent of all multiple faults of sizes 8 and less. 2) On the average, every SFDTS for an internal fan-out-free network covers at least 46.1 percent of all multiple faults.
Holistic VoIP intrusion detection and prevention system
Authors: Mohamed Nassar, Saverio Niccolini, Radu State, Thilo Ewald
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

VoIP security is crucial for current and future networks and services. The rapid shift from a closed and confined telephony towards an all IP network supporting end to end VoIP services provides major challenges to the security plane. Faced with multiple attack vectors, new and comprehensive defensive security solutions for VoIP must emerge from the research community. This paper describes a multilayer intrusion detection and prevention system architecture for VoIP infrastructures. The key components of the approach are based on a VoIP-specific honeypot and on an application layer event correlation engine. While each component alone can detect only a subset of VoIP-specific attacks, the two of them together can provide an effective defense for the many class of attacks. We show in this paper, how different and complementary conceptual approaches can jointly provide an in depth defense for VoIP architectures.
DB2 design advisor: integrated automatic physical database design
Authors: Daniel C. Zilio, Jun Rao, Sam Lightstone, Guy Lohman, Adam Storm, Christian Garcia-Arellano, Scott Fadden
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The DB2 Design Advisor in IBM® DB2® Universal DatabaseTM (DB2 UDB) Version 8.2 for Linux®, UNIX® and Windows® is a tool that, for a given workload, automatically recommends physical design features that are any subset of indexes, materialized query tables (also called materialized views), shared-nothing database partitionings, and multidimensional clustering of tables. Our work is the very first industrial-strength tool that covers the design of as many as four different features, a significant advance to existing tools, which support no more than just indexes and materialized views. Building such a tool is challenging, because of not only the large search space introduced by the interactions among features, but also the extensibility needed by the tool to support additional features in the future. We adopt a novel "hybrid" approach in the Design Advisor that allows us to take important interdependencies into account as well as to encapsulate design features as separate components to lower the reengineering cost. The Design Advisor also features a built-in module that automatically reduces the given workload, and therefore provides great scalability for the tool. Our experimental results demonstrate that our tool can quickly provide good physical design recommendations that satisfy users' requirements.
Global Exponential Stability of Impulsive Cellular Neural Network with Delay
Authors: Zhanji Gui, Jie Zhan, Chunbo Xing
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Sufficient conditions are obtained for the existence and global exponential stability of a unique equilibrium of a class of cellular neural network with Lipschitzian activation functions without assuming their boundedness, monotonicity or differentiability and subjected to impulsive state displacements at fixed instants of time. An illustrative example is given to demonstrate the effectiveness of the obtained results.
Modeling and Assessing the Dependability ofWireless Sensor Networks
Authors: Marcello Cinque, Domenico Cotroneo, Catello Di Martinio, Stefano Russo
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

This paper proposes a flexible framework for dependability modeling and assessing of Wireless Sensor Networks (WSNs). The framework takes into account network related aspects (topology, routing, network traffic) as well as hardware/software characteristics of nodes (type of sensors, running applications, power consumption). It is composed of two basic elements: i) a parametric Stochastic Activity Networks (SAN) failure model, reproducing WSN failure behavior as inferred from a detailed Failure Mode Effect Analysis (FMEA), and ii) an external library reproducing network behavior on behalf of the SAN model. This library specializes the SAN model by feeding it with quantitative parameters obtained by simulation or by experimental campaigns; it is also in charge of updating the network state in response to failure events during the simulation (e.g., routing tree updated due to node failures). The framework is thus suited to evaluate the dependability of several WSNs, with different topologies, routing algorithms, hardware/software platforms, without requiring any changes to its structure. The use of the external library makes the model simpler, decoupling the network behavior from the failure behavior. Simulation experiments are discussed that provide a quantitative evaluation of WSN dependability for a sample scenario: results show how the proposed framework supports WSN developers to find proper cost-reliability trade-offs for the system being deployed.
Dynamics of a continuous-valued discrete-time Hopfield neural network with synaptic depression
Authors: Zhijie Wang, Hong Fan
Venue: Neurocomputing (2007)

A continuous-valued discrete-time Hopfield neural network with synaptic depression (CDHSD) is constructed. We prove that the fixed point of CDHSD is the same as that of a network without synaptic depression and with an activation function determined by the parameters of the synaptic depression. We analyze the stability of the equilibrium, and then give a sufficient condition for the existence of a unique equilibrium of CDHSD. Numerical analysis shows that the attractor of CDHSD might be an equilibrium, a periodic orbit or a nonperiodic orbit depending on its parameter values and initial conditions. A weak external input of the network contributes to the genesis of nonperiodic dynamics of the network. If the value of parameter @?, which is the steepness parameter of the activation function f(x)=1/(1+exp(-x/@?)), is large enough or small enough, nonperiodic dynamics of CDHSD does not appear. It is also shown that nonperiodic dynamics is likely to emerge with intermediate strength of synaptic depression.
Assessing, Comparing, and Combining Statechart- based testing and Structural testing: An Experiment
Authors: Samar Mouchawrab, Lionel C. Briand, Yvan Labiche
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Although models have been proven to be helpful in a number of software engineering activities there is still significant resistance to model-driven development. This paper investigates one specific aspect of this larger problem. It addresses the impact of using statecharts for testing class clusters that exhibit a state-dependent behavior. More precisely, it reports on a controlled experiment that investigates their impact on testing fault-detection effectiveness. Code-based, structural testing is compared to statechart-based testing and their combination is investigated to determine whether they are complementary. Results show that there is no significant difference between the fault detection effectiveness of the two test strategies but that they are significantly more effective when combined. This implies that a cost-effective strategy would specify statechart-based test cases early on, execute them once the source code is available, and then complete them with test cases based on code coverage analysis.