ppxscal/embedding_network huggingface dataset:
Software-Based Self-Test for Pipelined Processors: A Case Study
Authors: M. Hatzimihail, M. Psarakis, G. Xenoulis, D. Gizopoulos, A. Paschalis
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Software-Based Self-Test (SBST) for processors and processor-based systems recently captured the interest of test technology researchers and practitioners due to its several advantages over traditional hardware Built-In Self-Test (BIST). In this paper, we demonstrate for first time the full applicability of a recently proposed SBST methodology to a publicly available complex RISC processor implementation which includes a full pipelined architecture consisting of five pipeline stages, hazard detection, data forwarding and exceptions handling. We first show that the straightforward application of SBST routines developed for the non-pipelined version of the RISC processor can only reach a fault coverage less than 85% in the fully pipelined model. Then, we identify and classify areas with poor testability and provide solutions that extend the SBST methodology and achieve fault coverage more than 95% for this complex processor implementation.
Development of Teaching Material on the Web for Programming Course and its Evaluation
Authors: Chieko Matsuyama, Toyoshiro Nakashima, Naohiro Ishii, Hidenori Itoh
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In authors programming course, students create animations as programming practice because this type of practice will make students interested in learning programming. This type of animation creation practice is well received by students. For the animation creation, we provide students with material such as fundamentals for creating basic animation, explanations of graphics functions, basic animation creation method, its application and its programming example in printed form (black and white). However, it is difficult for students to see the actual color or motion in printed material, because some of the animation is only shown on the screen and it is difficult for the students to actually reproduce the motion or examine the source codes by themselves. In order to overcome those problems, we have developed teaching material on the web and actually used them in programming course. As a result it is clear that this material contributes to the increase in LOC, FP and the volume of animation created. In this paper, we give the general description of programming course, the objective of developing teaching material on the web and guidelines for it, a general description of material, its effectiveness and problems we may see in the future.
Supervised dimensionality reduction using mixture models
Authors: Sajama, Alon Orlitsky
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We present a method based on maximum conditional likelihood estimation of mixture models. Use of mixture models allows us to approximate the distributions to any desired accuracy while use of conditional likelihood as the contrast function ensures that the selected subspace retains maximum possible mutual information between feature vectors and class labels. Classification experiments using Gaussian mixture components show that this method compares favorably to related dimension reduction techniques. Other distributions belonging to the exponential family can be used to reduce dimensions when data is of a special type, for example binary or integer valued data. We provide an EM-like algorithm for model estimation and present visualization experiments using Gaussian and Bernoulli mixture models.
Receivers' reactions to dissonant use of communication technology in the workplace: effects on communication strategies and the perceived usefulness of technology
Authors: Stephanie Alodie Hamel
Venue:  (2005)

This study examined receivers' reactions to the dissonant use of communication technology in the workplace and how they respond to it. Results of an online questionnaire indicate communication technology misuse is viewed by organizational members (N = 114) as a routine negative side effect of media use in the workplace with dire implications for work relationships. The incidence and severity of communication technology misuse is far greater than had been perceived previously with most types of misuse eliciting a moderate to high degree of concern from media users. The concern over media misuse is further illustrated by organizational members' admission they have a moderate to high intolerance for media misuse committed by coworkers, superiors, and subordinates. This concern is further underscored by the predominance of direct (voice) and punitive (exit) responses of media users' when blame is attributed to their communication partner, rather than the technology used in the incident. Communication technology appears to be misused most often while communicating about routine work-related matters with coworkers using email. Out of 15 different types of communication technology misuse, using technology to avoid others and broadcasting messages to others were the most frequently experienced types of technology misuse respectively. Respondents' written accounts of communication technology misuse most often described coworkers who intentionally and unintentionally broadcast messages to others and coworkers and superiors who made poor matches between the technology used (usually email) and the sensitivity of the message (usually negative feedback or confidential information). More than half of the respondents indicated the technology misuse they described in their story represented a pattern of behavior, rather than a single event, and was considered a moderate to high cause for concern. A key purpose of the study was to test a model of communication technology misuse. While tests of absolute model fit were nonsignificant, post hoc analyses reveal experience with the technology in the incident and relationship satisfaction with one's communication partner are stronger predictors of perceived usefulness of technology and exit, voice, loyalty, and neglect then attributions of blame for the misuse incident. Theoretical contributions and practical implications, along with limitations of the study, are discussed in light of the results.
Textual and behavioral views of function changes
Authors: Kai Pan, E. James Whitehead, Guozheng Ge
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

In this paper, we describe an approach that automatically computes function change information between consecutive revisions along the revision history of C language projects. Function changes are computed at two abstract levels. First, we compute the textual changes between two function revisions. Computed results include function additions and deletions, and the quantity and the ratio of textual change in changed functions across two revisions. Second, we compute the behavioral changes of functions using program slicing techniques. We use an XML-formatted document to represent computed function change information. The function change information, together with the SCM change log, helps maintainers understand code changes between two revisions. The structured format of the function change information also helps create traceability links between the changes and other artifacts. We describe our prototype implementation for computing function changes, and we evaluate our approach through a case study on the Sed project.
Analyzing Conversations of Web Services
Authors: Tevfik Bultan, Jianwen Su, Xiang Fu
Venue: IEEE Internet Computing (2006)

A conversation is the global sequence of messages exchanged among the components of a distributed system. Conversations provide a promising model for specifying and analyzing the interactions among the peers participating to a composite Web service. In this article, we discuss the following question: What is the impact of asynchronous communication on the conversation behavior? We show that the conversation behavior is significantly different for synchronous and asynchronous communication even if the local behaviors of the peers remain the same. We discuss two techniques for analyzing conversations: synchronizability and realizability analyses. Synchronizability analysis is used to identify bottom-up Web service specifications for which asynchronous communication does not change the conversation behavior. Realizability analysis, on the other hand, is used to identify top-down Web service specifications which are realizable using asynchronous communication. We show that using the synchronizability and realizability analyses it is possible to automatically verify conversation behavior for bottom-up and topdown Web service specifications using model checking.
A Comprehensive Model for On-Chip Spiral Inductors
Authors: B. Khadem Hosseinieh, N. Masoumi
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The accurate modeling of on-chip inductors is very important and a necessity in today¿s RF circuit design. This paper presents an accurate modeling method for on-chip inductors which includes various parameters and parasitic. A number of important parameters are the skin effect, mutual inductance between any two parallel wires and parasitic capacitances resulted form the proximity effect between wires.
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems
Authors: Dalila B. Fontes, Eleni Hadjiconstantinou, Nicos Christofides
Venue: Journal of Global Optimization (2006)

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221---228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.
Presentation Retrieval Method Considering the Scope of Targets and Outputs
Authors: Hiroaki OKAMOTO, Takashi KOBAYASHi, Haruo YOKOTA
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

We proposed the UPRISE (Unified Presentation Slide Retrieval by Impression Search Engine) to retrieve scenes matched with given keywords from a video recording a lecture using presentation slides. To distinguish the most suitable scene for the keywords from scenes using reused or backtracked slides, we proposed a number of impression indicators based on the position, duration and context. The combined indicator is provide higher precision than the traditional TF·IDF. Moreover, our approach can still be improved by combining with some specificity factor like IDF. However, it is important to choose some appropriate range of calculating the factor. In this paper, we propose a new specificity factor ISFP (Inverse Scene Frequency in a Presentation) to indicate the appearance ratio of a keyword in a presentation corresponding to a lecture. We also have to consider scope of output. Sometime, it is preferable to provide scenes from beginning the topic as output. To adjust the scope of output dynamically, we propose a new concept "output range." We evaluate the ISFP and scope varying method using actual lecture presentations. The experimental results indicate that the proposed method is effective especially for keywords appeared less frequently.
Interior Point Methods in Function Space
Authors: Martin Weiser
Venue: SIAM Journal on Control and Optimization (2005)

A primal-dual interior point method for optimal control problems is considered. The algorithm is directly applied to the infinite-dimensional problem. Existence and convergence of the central path are analyzed, and linear convergence of a short-step path-following method is established.
Senior users of the internet: lessons from the cybernun study
Authors: J. Smith
Venue: Universal Access in the Information Society (2005)

This paper presents a study that examined computer use and life satisfaction of senior religious sisters. A sample was obtained of 103 nuns in Upstate New York. Participants self-identified as computer users (CU) or non-users (NU), completed demographic information, the life satisfaction index-Z (LSIZ), the attitudes toward computer use scale (ATCUS), and responded to additional semi-structured questions. No statistically significant differences were found between CU and NU in life satisfaction. A cross-comparative, grounded analysis of the more open-ended responses found interesting differences in perceptions of sisters about computer use. Senior usability concerns were also considered.
A Quadratic Prediction Based Fractional-Pixel Motion Estimation Algorithm for H.264
Authors: Jing-Fu Chang, Jin-Jang Leou
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this study, a quadratic prediction based fractional-pixel motion estimation (ME) algorithm for H.264 is proposed. Here, a "degenerate" quadratic function is used to determine the "best" quantized predicted fractional-pixel motion vector (MV) for a variable size block. Based on the partial probability distribution of the sum of absolute component differences between the best fractional-pixel MV determined by the full search ME algorithm and the "best" quantized predicted fractional-pixel MV determined by the proposed algorithm, a small diamond search pattern (SDSP) is used to determine the final best MV at 1/4-pixel accuracy and the SDSP will be applied at most 3 times. Additionally, if both the best quantized predicted fractional-pixel MV determined by the proposed algorithm and that determined by the center biased fractional-pixel search (CBFPS) algorithm are identically (0,0), (0,0) is directly determined as the final best MV at 1/4-pixel accuracy. Based on the experimental results obtained in this study, the four ME performance measures of the proposed algorithm are better than that of four comparison algorithms, with slight degradations in average PSNR and bit rate.
Characterization of high and low k dielectrica using low-energy Time of Flight Elastic Recoil Detection
Authors: B. Brijs, T. Sajavaara, S. Giangrandi, K. Arstila, A. Vantomme, W. Vandervorst
Venue: Microelectronic Engineering (2005)

A low-energy Time of Flight Elastic Recoil Detection set-up has been developed for the characterization of ultrathin films, e.g. high and low k dielectrica. The performance is demonstrated by sample analysis of low k materials as they normally contain H, C, O, and Si. The excellent depth resolution is shown on a 6 nm HfSiO and a multistack of 6 nm SiO2, 6 nm Si3N4, 2 nm SO2 on top of Si.
Camera based mixed-lingual card reader for mobile device
Authors: Xi-Ping Luo, Li-Xin Zhen, Gang Peng, Jun Li, Bai-Hua Xiao
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

With the availability of high-resolution cameras and increased computation power, it becomes possible to implement OCR applications such as business card reader in the mobile device. In this paper we introduced the design and implementation of a mixed-lingual business card reader based on build-in camera. It has the capability to recognize business cards with Chinese or English characters. In order to deal with the challenge of limited resource in mobile device, we proposed some new methods to reduce the resource requirement of the image processing and the Chinese OCR engine. Our experiment gives satisfactory result.
Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur Solver
Authors: George Biros, Omar Ghattas
Venue: SIAM Journal on Scientific Computing (2005)

Large-scale optimization of systems governed by partial differential equations (PDEs) is a frontier problem in scientific computation. Reduced quasi-Newton sequential quadratic programming (SQP) methods are state-of-the-art approaches for such problems. These methods take full advantage of existing PDE solver technology and parallelize well. However, their algorithmic scalability is questionable; for certain problem classes they can be very slow to converge. In this two-part article we propose a new method for steady-state PDE-constrained optimization, based on the idea of using a full space Newton solver combined with an approximate reduced space quasi-Newton SQP preconditioner. The basic components of the method are Newton solution of the first-order optimality conditions that characterize stationarity of the Lagrangian function; Krylov solution of the Karush--Kuhn--Tucker (KKT) linear systems arising at each Newton iteration using a symmetric quasi-minimum residual method; preconditioning of the KKT system using an approximate state/decision variable decomposition that replaces the forward PDE Jacobians by their own preconditioners, and the decision space Schur complement (the reduced Hessian) by a BFGS approximation initialized by a two-step stationary method. Accordingly, we term the new method {\it Lagrange--Newton--Krylov--Schur} (LNKS). It is fully parallelizable, exploits the structure of available parallel algorithms for the PDE forward problem, and is locally quadratically convergent. In part I of this two-part article, we investigate the effectiveness of the KKT linear system solver. We test our method on two optimal control problems in which the state constraints are described by the steady-state Stokes equations. The objective is to minimize dissipation or the deviation from a given velocity field; the control variables are the boundary velocities. Numerical experiments on up to 256 Cray T3E processors and on an SGI Origin 2000 include scalability and performance assessment of the LNKS algorithm and comparisons with reduced SQP for up to $1,000,000$ state and 50,000 decision variables. In part II of the article, we address globalization and inexactness issues, and apply LNKS to the optimal control of the steady incompressible Navier--Stokes equations.
Scalpel: optimizing query streams using semantic prefetching
Authors: Ivan Thomas Bowman
Venue:  (2005)

Client applications submit streams of relational queries to database servers. For simple requests, inter-process communication costs account for a significant portion of user-perceived latency. This trend increases with faster processors, larger memory sizes, and improved database execution algorithms, and this trend is not significantly offset by improvements in communication bandwidth. Caching and prefetching are well studied approaches to reducing user-perceived latency. Caching is useful in many applications, but it does not help if future requests rarely match previous requests. Prefetching can help in this situation, but only if we are able to predict future requests. This prediction is complicated in the case of relational queries by the presence of request parameters: a prefetching algorithm must predict not only a query that will be executed in the future, but also the actual parameter values that will be supplied. We have found that, for many applications, the streams of submitted queries contain patterns that can be used to predict future requests. Further, there are correlations between results of earlier requests and actual parameter values used in future requests. We present the Scalpel system, a prototype implementation that detects these patterns of queries and optimizes request streams using context-based predictions of future requests. Scalpel uses its predictions to provide a form of semantic prefetching, which involves combining a predicted series of requests into a single request that can be issued immediately. Scalpel's semantic prefetching reduces not only the latency experienced by the application but also the total cost of query evaluation. We describe how Scalpel learns to predict optimizable request patterns by observing the application's request stream during a training phase. We also describe the types of query pattern rewrites that Scalpel's cost-based optimizer considers. Finally, we present empirical results that show the costs and benefits of Scalpel's optimizations. We have found that even when an application is well suited for its original configuration, it may behave poorly when moving to a new configuration such as a wireless network. The optimizations performed by Scalpel take the current configuration into account, allowing it to select strategies that give good performance in a wider range of configurations.
Grid middleware portal infrastructure
Authors: Dharmesh Chohan, Asif Akram, Rob Allan
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

This paper gives a description of building a Grid middleware portal infrastructure in CCLRC to allow computational scientists, researchers and application users access to resources via an easy to use Web based portal interfaces. The goal is to develop common Grid application components that can be used by portal developers and administrators to build and deploy on open source portal frameworks. This will allow users to authenticate securely to remote resources and provide transparent access via Grid related tools to manage their tasks efficiently. The current portal technology, JSR 168, is described for the development of Java based applications. The work is substantiated by giving an example of building the UK National Grid Service (NGS) portal. NGS Portal itself works as middleware; it "glues" different Grid Resources together in a single location. Portals and portlets are not confined to a Web-based solution, through Web Services for Remote Portlets WSRP [8] portlets offered by different portal framworks can be consumed in software ranging from desktop to PDA.
Structural Information Implant in a Context Based Segmentation-Free HMM Handwritten Word Recognition System for Latin and Bangla Script
Authors: Szilard Vajda, Abdel Belayd
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, an improvement of a 2D stochastic model based handwritten entity recognition system is described. To model the handwriting considered as being a two dimensional signal, a context based, segmentation-free Hidden Markov Model (HMM) recognition system was used. The baseline approach combines a Markov Random Field (MRF) and a HMM so-called Non-Symmetric Half Plane Hidden Markov Model (NSHP-HMM). To improve the results performed by this baseline system operating just on low-level pixel information an extension of the NSHP-HMM is proposed. The mechanism allows to extend the observations of the NSHP-HMM by implanting structural information in the system. At present, the accuracy of the system on the SRTP1 French postal check database is 87.52% while for the handwritten Bangla city names is 86.80%. The gain using this structural information for the SRTP dataset is 1.57%.