ppxscal/embedding_network huggingface dataset:
Specification-Based Retrieval Strategies for Component Architectures
Authors: David Hemer
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

In component-based software development (CBSD) programs are developed by combining reusable library components. Two of the main technical issues that need to be addressed are: locating suitable components in the library (retrieval); and adapting them to solve a specific problem. Intelligent retrieval techniques, based on matching formal specifications (so-called specification matching), have been developed to overcome some of the problems associated with traditional keyword-based retrieval techniques. Also approaches to semi-automatingcomponent adaptation have been proposed. These approaches are based on using component wrappers and component architectures for defining adaptation strategies. Such strategies can be represented by generic library templates that are parameterised over higher-order variables (therefore ensuring that they are applicable in a variety of situations). We would like to use existing specification matching techniques to locate suitable library adaptation templates. However, at present these two approaches are not compatible. This is because the current specification matching methods are based on matching first-order component specifications, whereas templates are specified using higher-order logic. In this paper we extend existing specification matching methods to handle higher-order library templates, with a focus on achieving the best possible tradeoff between automatability and precision/recall.
MADA, a mobile application development approach
Authors: Nabil Kouici, Nawel Sabri, Denis Conan, Guy Bernard
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Despite the rapid evolution of computers in mobile environments, current middleware are inadequate in mobile environments where resources can vary a lot and even disappear. Most of research works dealing with disconnection management do not provide a design model for applications. In this article, we present MADA, an approach to design distributed applications for disconnections thats follows the Model Driven Architecture approach [23]: the software architecture is modelled using the design pattern "Fa&ccedil;ade" [10] and with 4+1 views [17], and then projected over a platform, here the CCM (CORBA Component Model) platform [25], with a UML (Unified Modelling Language) profile.
On the decidability of containment of recursive datalog queries - preliminary report
Authors: Piero A. Bonatti
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unrestricted recursive queries, and decidable for recursive monadic queries and conjunctive queries over regular path expressions. In this paper, we identify a new class of recursive queries with decidable containment. Our framework extends the aforementioned query classes by supporting recursive predicates with more than two arguments and nonlinear recursion.
Conversational sales assistant for online shopping
Authors: Margo Budzikowska, Joyce Chai, Sunil Govindappa, Veronika Horvath, Nanda Kambhatla, Nicolas Nicolov, Wlodek Zadrozny
Venue: Proceedings of the first international conference on Human language technology research (2001)

Websites of businesses should accommodate both customer needs and business requirements. Traditional menu-driven navigation and key word search do not allow users to describe their intentions precisely. We have developed a conversational interface to online shopping that provides convenient, personalized access to information using natural language dialog. User studies show significantly reduced length of interactions in terms of time and number of clicks in finding products. The core dialog engine is easily adaptable to other domains.
Investigation of online interactive systems
Authors: Robert S. Gray
Venue: Journal of Computing Sciences in Colleges (2004)

The objectives of this project are to investigate multi-user online interactive systems. Online interactive systems are one of the fastest growing areas of computer today. The next logical step for the internet is going from the world of 2-dimensional web pages to a 3-dimensional interactive world in which users do not just read the content but can interact with the site using 3-dimensional rendering software. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Sensitivity Analysis of Parameterized Variational Inequalities
Authors: Alexander Shapiro
Venue: Mathematics of Operations Research (2005)

In this paper we discuss local uniqueness, continuity, and differentiability properties of solutions of parameterized variational inequalities (generalized equations). To this end we use two types of techniques. One approach consists in formulating variational inequalities in a form of optimization problem based on regularized gap functions, and applying a general theory of perturbation analysis of parameterized optimization problems. Another approach is based on a theory of contingent (outer graphical) derivatives and some results about differentiability properties of metric projections.
Logical Key Tree Based Secure Multicast Protocol with Copyright Protection
Authors: Wen-Tsuen Chen, Ho-Ling Hsu, Jeng-Long Chiang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

SMPCP is a multicast watermark scheme to protect valued contents from illegal distribution. However, it requires an overhead of O(N) on cryptographic encryptions and message size, here N is the size of group members. This paper proposes a logical key tree based secure multicast protocol, LKT-SMPCP, to improve the overhead in the SMPCP. Experimental results show that LKT-SMPCP reduces the encryption overhead by 30% as comparing with the original SMPCP.
TRANSFER OF GENERAL SKILLS ACROSS DOMAINS: COMPUTER PROGRAM DEBUGGING AND TROUBLESHOOTING OF CIRCUITS
Authors: Adrienne Y. Lee
Venue: ACM SIGCHI Bulletin (1991)

A general finding in psychological studies is that little to no transfer occurs across domains. This research proposes four components as critical elements for finding across domain transfer: 1) examining a single level of skill, 2) transfer of domain general knowledge, 3) extensive practice, and 4) specific training on the strategies used. To test these components, the skill of diagnosis will be examined. General diagnostic skill should transfer, but specific knowledge such as computer programming knowledge or electronic component knowledge should not transfer.The experiments focus on the transfer of diagnostic strategies across domains by examining computer progra m debugging and electronic troubleshooting. The first experiment examines spontaneous transfer of skill by asking experts and novices to solve debugging and troubleshooting problems. The results from this experiment will expose strategies that are used spontaneously when experienced programmers encounter the troubleshootin g problems. The second experiment examines subjects who have little to no experience with either computer programming or electronic troubleshooting. The results from this second experiment will test whether or not training can influence transfer of across domains.To summarize, the current research provides a good analysis of the components of skills and a specific definition and measure of transfer. Extensive training in programming should enable transfer of general diagnostic skills to an electronic troubleshooting task. Thus, if extensive training on how to debug computer programs, with specific training on the skill is provided, and students are asked to reflect on how that skill is used, students should be able to use the diagnosis skill on other types o f diagnostic tasks. Therefore, the skill of diagnosis can be transferable to other situations.
Playing Mastermind optimally
Authors: Peter Norvig
Venue: Issue 90 (October 1984) (1984)

There have been several recent articles in the SIGART Newsletter about the game of Mastermind (T. M. Rao, #82, E. Shapiro, #85, P. Koppstein, #88). This note describes an algorithm that is different from the others in that it is specifically designed to be an approximation to the optimal strategy.
When prefetching improves/degrades performance
Authors: Thomas R. Puzak, A. Hartstein, P. G. Emma, V. Srinivasan
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

We formulate a new method for evaluating any prefetching algorithm (real or hypothetical). This method allows researchers to analyze the potential improvements prefetching can bring to an application independent of any known prefetching algorithm. We characterize prefetching with the metrics: timeliness, coverage, and accuracy. We demonstrate the usefulness of this method using a Markov prefetch algorithm. Under ideal conditions, prefetching can remove nearly all of the pipeline stalls associated with a cache miss. However, in today's processors, we show that nearly all of the performance benefits derived from prefetching are eroded and, in many cases, prefetching loses performance. We do quantitative analysis of these trade-offs, and show that there are linear relationships between overall performance and coverage, accuracy, and bandwidth
Erratum
Authors: Staff
Venue: Natural Language Engineering (2005)

Journal of Natural Language Engineering, volume 9, issue 4, pp. 365&ndash;80, December 2003 The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Constructing a theoretical machines website: an agile software generation and maintenance experience
Authors: Brenda Aldine, Darlene Banta
Venue: Journal of Computing Sciences in Colleges (2004)

Recently, we received a Computer Research Association (CRA) grant under the Computer Research Experience for Women (CREW) program. Our research entitled Constructing a Theoretical Machines Website: An Agile Software Generation and Maintenance Experience, began as a project to provide a resource for students in CMPS 260 to construct, test, experiment with theoretical machines and to ultimately upload their machine for instructor evaluation.
A methodology for analyzing SAGE libraries for cancer profiling
Authors: Jörg Sander, Raymond T. Ng, Monica C. Sleumer, Man Saint Yuen, Steven J. Jones
Venue: ACM Transactions on Information Systems (TOIS) (2005)

Serial Analysis of Gene Expression (SAGE) has proven to be an important alternative to microarray techniques for global profiling of mRNA populations. We have developed preprocessing methodologies to address problems in analyzing SAGE data due to noise caused by sequencing error, normalization methodologies to account for libraries sampled at different depths, and missing tag imputation methodologies to aid in the analysis of poorly sampled SAGE libraries. We have also used subspace selection using the Wilcoxon rank sum test to exclude tags that have similar expression levels regardless of source. Using these methodologies we have clustered, using the OPTICS algorithm, 88 SAGE libraries derived from cancerous and normal tissues as well as cell line material. Our results produced eight dense clusters representing ovarian cancer cell line, brain cancer cell line, brain cancer bulk tissue, prostate tissue, pancreatic cancer, breast cancer cell line, normal brain, and normal breast bulk tissue. The ovarian cancer and brain cancer cell lines clustered closely together, leading to a further investigation on possible associations between these two cancer types. We also investigated the utility of gene expression data in the classification between normal and cancerous tissues. Our results indicate that brain and breast cancer libraries have strong identities allowing robust discrimination from their normal counterparts. However, the SAGE expression data provide poor predictive accuracy in discriminating between prostate and ovarian cancers and their respective normal tissues.
Robot perception of impedance
Authors: Ryo Kikuuwe, Tsuneo Yoshikawa
Venue: Journal of Robotic Systems (2005)

This paper proposes an algorithm for robot perception of impedance, which can be used as a fundamental technique for real-time and qualitative perception of physical constraints imposed on the robot's end-effector. This algorithm (1) estimates the impedance that represents the motion-force relation of the end-effector; (2) calculates the uncertainties of the estimates; and (3) detects discontinuous changes in the impedance. The estimated impedance can be used to recognize local dynamic properties of the environment and temporary constraint conditions imposed on the end-effector. The detected discontinuities can be used to segment the manipulated tasks and to recognize the geometric structure of the environment. This method can be implemented in both autonomous and remote-controlled robots because it is designed separately from control methodologies. Results of preliminary experiments are presented. &copy; 2005 Wiley Periodicals, Inc.
Beyond the Alder-Strassen bound
Authors: Markus Bläser
Venue: Theoretical Computer Science (2005)

We prove a lower bound of 5/2n2 - 3n for the multiplicative complexity of n × n-matrix multiplication over arbitrary fields. More general, we show that for any finite dimensional semisimple algebra A with unity, the multiplicative complexity C (A) of the multiplication in A is bounded from below by 5/2 dim A - 3(n1 +...+ nt) if the decomposition of A ≃ A1 × ... × At into simple algebras Aτ ≃ Dτnτ×nτ contains only noncommutative factors, that is, the division algebra Dτ is noncommutative or nτ≥2.We also deal with the complexity of multiplication in algebras with nonzero radical. We present an example that shows that our methods in the semisimple case cannot be applied directly to this problem. We exhibit lower bound techniques for C(A) that yield bounds still significantly above the Alder-Strassen bound. The main application is the lower bound C (Tn(k)) ≥ (21/8-o(1)) dim Tn(k) for the multiplicative complexity of multiplication in the algebra Tn(k) of upper triangular n × n-matrices.
DCG: a system for automatic code generation for hyperbolic problems (abstract)
Authors: Björn Engquist, Tom Smedsaas
Venue: ACM SIGNUM Newsletter (1975)

DCG is a program which generates FORTRAN code for difference approximations from a mathematical specification of a hyperbolic system.
Review of "Handbook of Design Automation by Steve Sapiro and Robert J. Smith II"; CAE Systems, Inc.
Authors: D. Scott Baeder
Venue: ACM SIGDA Newsletter (1984)

The material presented in this book covers the whole spectrum of CAE, Computer Aided Engineering, from Design Methodologies to Physical Implementation. The book starts out with a very basic discussion of exactly what CAE is, and how it impacts the design cycle. Chapters two and three cover the design cycle and how different design methodologies, Structured Design vs. LSSD, and physical constraints (Gate Array vs. Standard Cell vs. Full Custom) can affect the design process. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Image authentication based on digital signature and semi-fragile watermarking
Authors: Hong-Bin Zhang, Cheng Yang, Xiao-Mei Quan
Venue: Journal of Computer Science and Technology (2004)

This paper proposes an authentication scheme for JPEG images based on digital signature and semi-fragile watermarking. It can detect and locate malicious manipulations made to the image, and verify the ownership of the image at the same time. The algorithm uses the invariance of the order relationship between two DCT coefficients before and after JPEG compression to embed image content dependent watermark, therefore the watermark can survive the JPEG lossy compression. Since the scheme is based on the security of the cryptographic hash function and public key algorithm, it is believed to be secure to the extent that cryptography is believed to be. Theoretical analysis and experimental results show that the proposed scheme has the desired property and good performance for image authentication.
Optimization model of internet protocols
Authors: Steven Low, J. Doyle, L. Li, A. Tang, J. Wang
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Layered architecture is one of the most fundamental and influential structures of network design. Can we integrate the various protocol layers into a single coherent theory by regarding them as carrying out an asynchronous distributed primal-dual computation over the network to implicitly solve a global optimization problem? Different layers iterate on different subsets of the decision variables using local information to achieve individual optimalities, but taken together, these local algorithms attempt to achieve a global objective. Such a theory will expose the interconnection between protocol layers and can be used to study rigorously the performance tradeoff in protocol layering as different ways to distribute a centralized computation. In this talk, we describe some preliminary work towards this goal and discuss some of the difficulties of this approach.
On Modelling Nonlinear Shape-and-Texture Appearance Manifolds
Authors: C. Mario Christoudias, Trevor Darrell
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Statistical shape-and-texture appearance models employ image metamorphosis to form a rich, compact representation of object appearance. They achieve their efficiency by decomposing appearance into simpler shape-and-texture representations. In general, the shape and texture of an object can vary nonlinearly and in this case the conventional shape-and-texture mappings using Principle Component Analysis (PCA) may poorly approximate the true space. In this paper we propose two nonlinear techniques for modelling shape-and-texture appearance manifolds. Our first method uses a mixture of Gaussians in image space to separate the different parts of the shape and texture spaces. A linear shape-and-texture model is defined at each component to form the overall model. Our second approach employs a nearest-neighbor method to find a local set of shapes and images that can be morphed to explain a new input. We test each approach using a speaking-mouth video sequence and compare both approaches to a conventional Active Appearance Model (AAM).
Improved Genetic Algorithm to Solve Preplanned Backup Path on WDM Networks
Authors: Yih-Fuh Wang, Chien-Hsun Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

A novel GA-based approach, Species Modified Genetic Algorithms (SMGA), is proposed to enhance the restoration of preplanned backup lightpaths in WDM networks and regards chromosomes to be classified branches into races as kinds of species in population, which convergence the algorithm approaching to globally optimal solution. Compared with CMGA (Contract Mapping Genetic Algorithm), SMGA can not obtain better performance. it can be found the compound algorithm, amalgamating both of SMGA and CMGA, not only converged to more globally optimal solution but also improve the speed of convergence.
Towards Service Orientation in Pervasive Computing Systems
Authors: Umesh Bellur, N. C. Narendra
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The emergence of the service-oriented computing paradigm has opened the possibility of using dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive computing that is characterized by disconnected operation and mobility, the process of using service specifications and dynamic binding becomes critical. In this paper, we summarize our ongoing work in the area of integrating service orientation into pervasive computing using the notion of specifying service requirements and using these specifications to bind to the available resources dynamically instead of hardwiring them statically. We term these specifications programmable requirements since they can be interpreted at run time to bind to a resource satisfying those specifications. Interestingly this approach also satisfies the basis for two key types of adaptation prevalent in pervasive computing systems - functional and architectural - as we show in this paper.
Improving Memory Encryption Performance in Secure Processors
Authors: Jun Yang, Lan Gao, Youtao Zhang
Venue: IEEE Transactions on Computers (2005)

Due to the widespread software piracy and virus attacks, significant efforts have been made to improve security for computer systems. For stand-alone computers, a key observation is that, other than the processor, any component is vulnerable to security attacks. Recently, an execution only memory (XOM) architecture has been proposed to support copy and tamper resistant software. In this design, the program and data are stored in an encrypted format outside the CPU boundary. The decryption is carried out after they are fetched from memory and before they are used by the CPU. As a result, the lengthened critical path causes a serious performance degradation. In this paper, we present an innovative technique in which the cryptography computation is shifted off from the memory access critical path. We propose using a different encryption scheme, namely, "pseudo-one-time pad¿ encryption, to produce the instructions and data ciphertext. With some additional on-chip storage, cryptography computations are carried in parallel with memory accesses, minimizing the performance penalty. We performed experiments to study the trade-off between storage size and performance penalty. Our technique reduces the performance overhead from 20.79 percent to 1.28 percent on average for reasonably sized (64KB) on-chip storage.
A viscous paint model for interactive applications: Research Articles
Authors: William Baxter, Yuanxin Liu, Ming C. Lin
Venue: Computer Animation and Virtual Worlds (2004)

We present a viscous paint model for use in an interactive painting system based on the well-known Stokes' equations for viscous flow. Our method is, to our knowledge, the first unconditionally stable numerical method that treats viscous fluid with a free surface boundary. We have also developed a real-time implementation of the Kubelka-Munk reflectance model for pigment mixing, compositing and rendering entirely on graphics hardware, using programmable fragment shading capabilities. We have integrated our paint model with a prototype painting system, which demonstrates the model's effectiveness in rendering viscous paint and capturing a thick, impasto-like style of painting. Several users have tested our prototype system and were able to start creating original art work in an intuitive manner not possible with the existing techniques in commercial systems. Copyright &copy; 2004 John Wiley & Sons, Ltd.