ppxscal/embedding_network huggingface dataset:
Contact formulation for solid-shell elements undergoing large deformations
Authors: M. Harnau, K. Schweizerhof
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A special application for the 'Solid-Shell' elements are sheet metal forming problems. To describe such kind of problems as free bending or deep drawing, contact formulations are necessary to introduce the contact condition of the metal sheets against the rigid tools. To describe the rigid contact surfaces analytical functions are used, thus simple surface geometries can easily be described. In this paper the penalty method and an Augmented Lagrangian approach will be used without taking friction into account as a first step in our developments. With usual nodal contact formulations as in [25] the problem of weighting the single nodal contribution appears. The weight depends on the geometry as well as on the kind of node - edge, corner or center - for the biquadratic elements. To overcome this problem surface contact elements are developed with four resp. nine nodes similar to the 'Solid-Shell' element types. Therefore instead of evaluating the contact conditions at the nodal points, the contact forces are integrated over the element area [13] and the penetration function is evaluated at the Gauss points of the contact segment, as it is also apparently done in [26]. To describe contact against plane surfaces the usual number of Gauss points is used in the surface contact elements. For non plane and partial overlapping contact geometries increasing the number of Gauss points can be necessary to fulfill the contact condition.
Stabilization techniques for domain decomposition methods with non-matching grids
Authors: Franco Brezzi, Leopoldo P. Franca, Donatella L. Marini, Alessandro Russo
Venue:  (1997)

The Dirichlet problem with Lagrange multipliers is a common ingredient in domain decomposition methods with non-matching grids. We propose a new way of stabilizing it by means of bubble functions on the boundary. Static condensation allows the elimination of both bubbles and Lagrange multipliers, leading to a simple variant of Nitsche''s scheme. EMAIL:: ian@microian.ian.pv.cnr.it
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Authors: E. Boros, V. Gurvich, L. Khachiyan, K. Makino
Venue: Annals of Mathematics and Artificial Intelligence (2003)

Given an m&times;n binary matrix A, a subset C of the columns is called t-frequent if there are at least t rows in A in which all entries belonging to C are non-zero. Let us denote by &alpha; the number of maximal t-frequent sets of A, and let &beta; denote the number of those minimal column subsets of A which are not t-frequent (so called t-infrequent sets). We prove that the inequality &alpha;&les;(m&minus;t+1)&beta; holds for any binary matrix A in which not all column subsets are t-frequent. This inequality is sharp, and allows for an incremental quasi-polynomial algorithm for generating all minimal t-infrequent sets. We also prove that the analogous generation problem for maximal t-frequent sets is NP-hard. Finally, we discuss the complexity of generating closed frequent sets and some other related problems.
A note on variational representation for singular values of matrix
Authors: Zhi-Hao Cao, Li-Hong Feng
Venue: Applied Mathematics and Computation (2003)

In this note we address the variational property of singular values of matrix and point out that a theorem in [Matrix Computations, John Hopkins University Press, Baltimore, MD, 1989,1993,1996] is incomplete.
View 3: A Programming Environment for Distributed Programming
Authors: Ann Kratzer
Venue:  (1986)

View 3 is an experimental programming environment to support the development and use of distributed programs. It builds upon three major concepts. First, distributed programs and distributed processes are basic objects. Second, the port mechanism allows a process to exchange information with another process, a file or an I/O device without concern for the type of the object on the other end of the port. Third, test and use of distributed programs are facilitated by the user interface program screen format that allows the user to control both the format and contents of the physical terminal.
Frames, Riesz systems and MRA in Hilbert spaces
Authors: Stephanus J.L. Eijndhoven, Patrick J. Oonincx
Venue:  (1997)

The concept of multiresolution analysis (MRA) is introduced for arbitrary separable Hilbert spaces $H$. It is put in the general terms of unitary operators $U_1$ and $U_{2,1},\ldots , U_{2,d},\: d \in {\ol Z}$ and a generating element $\phi$. Each MRA yields a system ${\cal V} =\{ U_1^k U_{2,1}^{l_1}\cdots U_{2,d}^{l_d} \psi_n \: | \: n=0,\ldots,N-1, \, k \in {\ol Z} ,l \in {\ol Z}^d \}$, where the $\psi_n$ are related to $\phi$. Necessary and sufficient conditions on $U_1$, $U_{2,1},\dots , U_{2,d}$, $\phi$ and $\psi_n$ are given, such that $V$ is a Riesz system or basis in $H$.
Interfaces for Disk-Directed I/O
Authors: David Kotz
Venue:  (1995)

In other papers I propose the idea of disk-directed I/O for multiprocessor file systems. Those papers focus on the performance advantages and capabilities of disk-directed I/O, but say little about the application-programmer''s interface or about the interface between the compute processors and I/O processors. In this short note I discuss the requirements for these interfaces, and look at many existing interfaces for parallel file systems. I conclude that many of the existing interfaces could be adapted for use in a disk-directed I/O system.
On optimal outcomes of negotiations over resources
Authors: Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We analyse scenarios in which self-interested agents negotiate with each other in order to agree on deals to exchange resources. We consider two variants of the framework, one where agents can use money to compensate other agents for disadvantageous deals, and one where this is not possible. In both cases, we analyse what types of deals are necessary and sufficient to guarantee an optimal outcome of negotiation. To assess whether a given allocation of resources should be considered optimal we borrow two concepts from welfare economics: maximal social welfare in the case of the framework with money and Pareto optimality in the case of the framework without money. We also show how conditions for optimal outcomes can change depending on properties of the utility functions used by agents to represent the values they ascribe to certain sets of resources.
Wireless Java Programming for Enterprise Applications: Mobile Devices Go Corporate, 1 edition
Authors: Dan Harkey, Shan Appajodu, Yashwanth Rajaram, Mike Larkin
Venue:  (2002)

:Whether you are a seasoned wireless device programmer looking to extend your applications to the enterprise or an enterprise programmer planning to make your applications available anywhere and anytime using wireless devices, this book is for you.
A contingency perspective on internet adoption and competitive advantage
Authors: Thompson SH Teo, Yujun Pian
Venue: European Journal of Information Systems (2003)

Firms adopt the Internet for different purposes, ranging from simple Internet presence to using the Internet to transform business operations. This paper examines the contingency factors that affect levels of Internet adoption and their impact on competitive advantage. A questionnaire was used to gather data for this study; 159 usable responses were obtained from a sample of 566 firms in Singapore. Results indicate that most firms are still exploring the business use of the Internet. A proactive business technology strategy was found to be positively associated with the level of Internet adoption. Technology compatibility and top management support were found to have no significant relationships with the level of Internet adoption. Further, the level of Internet adoption had a significant positive relationship with competitive advantage. These results provide a better understanding of the contingency factors affecting the level of Internet adoption, as well as providing some evidence of the positive impact of Internet adoption on competitive advantage.
An Algorithm for Bit Reversal Permutation in O(log n) Parallel Time on an n-PE Bit-Serial CCC Network
Authors: A R Wagner, Yijie Han
Venue:  (1986)

A parallel algorithm is given to perform the bit reversal permutation on a bit-serial permutation network. Previous bit reversal permutation algorithms running in $O(log ~n)$ time require either word-parallel communication links, or the precalculation of control bits. The algorithm presented in this paper requires no precalculations and yet it takes only $O(log~ N)$ time, which is optimal to within a constant factor. The algorithm also suggests that the addition of a simple control mechanism to the network will facilitate the network operation and thus improve network performance.
The Immune System as a Prototype of Autonomous Decentralized Systems: An Overview
Authors: Yoshiteru Ishida
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In this paper, we discuss the features of the immune system; its system aspect (compatible with Jerne's network view), its process aspect, and its design aspect (compatible with Metchinikoff's self-defining view). Our applications of these three aspects are also presented briefly. Since these features of the immune system agree with the concept of autonomous decentralized systems, we suggest that the immune system can be a typical model for autonomous decentralized systems.In the self-defining process, agents can refer to the self-information, and can interact with the environment. We propose that this self-defining process extracted from the immune system can be a candidate for design paradigm for autonomous decentralized systems where full specification of the total system is not only available but also inadequate. We also suggest that the internet would be a typical example designed by this paradigm.
A New Algorithm to Compute Quaternary Reed-Muller Expansions
Authors: Susanto Rahardja, Bogdan J. Falkowski
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for >, the new algorithm is computationally more efficient than all existing algorithms. Finally, the fast flow diagram, which is useful for implementation of the algorithm in hardware, has also been shown.
Grasp learning by active experimentation using continuous B-spline model
Authors: Jianwei Zhang, Bernd Rössler
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

In this chapter we present a self-valuing learning system based on continuous B-spline model which is capable of learning how to grasp unfamiliar objects and generalize the learned abilities. The learning system consists of two learners which distinguish between local and global grasping criteria. The local criteria are not object specific while the global criteria cover physical properties of each object. The system is self-valuing, i.e. rates its actions by evaluating sensory information and the use of image processing techniques. An experimental setup consisting of a PUMA-260 manipulator, equipped with hand-camera and force/torque sensor, was used to test this scheme. The system has shown the ability to grasp a wide range of objects and to apply previously learned knowledge to new objects.
Artificial Neurogenesis: An application to Autonomous Robotics
Authors: Olivier Michel, Philippe Collard
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

A lot of recent research papers focus on the challenging problem of the combination of genetic algorithms and artificial neural networks. Developmental and molecular biology may be a source of inspiration for designing powerful artificial neurogenesis systems allowing the generation of complex modular structures. This paper describes in details such a neurogenesis model associated with an evolutionary process and its application to the control of a mobile robot. Early results demonstrate the surprising efficiency of this methodology and give hints to continue the research towards the generation of more complex adaptive neural networks.
Evaluation of a Fast Activation Mechanism for the Kanerva SDM Memory
Authors: Roland Karlsson
Venue:  (2001)

The Kanerva Sparse Distributed Memory (SDM) is a mechanism for implementing a memory with a huge address space. The physical memory consists of substantially fewer locations than the virtual address space. In earlier implemen- tations of the SDM memory the addresses of all physical locations had to be scanned to determine which locations to activate. This is time-consuming, and massive parallel hardware support is needed for other than small appli- cations. This paper introduces a new mechanism for finding the active locations. Using this access mechanism, the access time may be speeded up several orders of magnitude.
Densities and Maximum Likelihood Estimation of Matching Constraints
Authors: R. Berthilsson
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In this paper we present a theory for obtaining densities that are important for computer vision. As a result of the theory we compute the exact and novel density of the slope of a line fitted to image points. This density makes it possible to obtain confidence intervals for the slope or to make hypothesis testing about if two intersecting lines form a corner or not. The theory also lets us derive a novel technique for maximum likelihood estimation, that can be used for computing the fundamental matrix, conics, or any other constraint that can be expressed by polynomials of degree 2. We present exact and novel densities for the fundamental matrix and conic constraints, that are needed for the estimation. Experiments show how the results can be used in practice to compute maximum likelihood estimates of the fundamental matrix. 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
Approximation with Kronecker Products
Authors: Charles V Loan, Nikos Pitsianis
Venue:  (1992)

Let A be an m-by-n matrix with m=m1m2 and n=n1n2. We consider the problem of finding (mathematical formula omitted) so that (mathematical formula omitted) is minimized. This problem can be solved by computing the largest singular value and associated singular vectors of a permuted version of A. If A is symmetric, definite, non-negative, or banded, then the minimizing B and C are similarly structured. The idea of using Kronecker product preconditioners is briefly discussed.
A Note on Cryptography and NP$\cap$ CoNP-P
Authors: Giles Brassard, Steven Fortune, John E. Hopcroft
Venue:  (1978)

Diffie and Hellman [2] propose the use of the exponential function in a finite field for cryptographic purposes. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. We show that a proof of this conjecture would have important consequences for theoretical computer science, even under the assumption that P $neq$ NP.
Practices of Software Maintenance
Authors: Janice Singer
Venue: Proceedings of the International Conference on Software Maintenance (1998)

This paper describes the results of an interview study conducted at ten industrial sites. The interview focused on the work practices of software engineers engaged in maintaining large scale systems. Five 'truths' emerged from this study. First, software maintenance engineers are experts in the systems they are maintaining. Second, source code is the primary source of information about systems. Third, the documentation is used, but not necessarily trusted. Fourth, maintenance control systems are important repositories of information about systems. Finally, reproduction of problems and/or problem scenarios is essential to problem solutions. These truths confirm much of the conventional wisdom in the field. However, in fleshing them out, details were elaborated, and additionally new knowledge was acquired. These results are discussed with respect to tool design.
Advanced CISSP Prep Guide: Exam Q&A
Authors: Ronald L. Krutz, Russell Dean Vines
Venue:  (2002)

:Used alone or as an in-depth supplement to the bestselling The CISSP Prep Guide, this book provides you with an even more intensive preparation for the CISSP exam. With the help of more than 300 advanced questions and detailed answers, you'll gain a better understanding of the key concepts associated with the ten domains of the common body of knowledge (CBK).
Introduction to HCI structured engineering design methods
Authors: Steve Cummaford, Ann Blandford, John Long
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Shows how a theoretically-based approach to HCI design allows decisions to be made with explicit reference to performance, knowledge to be communicated between team members, and then re-used to solve similar problems. Is contrasted with a 'prototype-and-test' approach.
Adaptive mode control: A static-power-efficient cache design
Authors: Huiyang Zhou, Mark C. Toburen, Eric Rotenberg, Thomas M. Conte
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Lower threshold voltages in deep submicron technologies cause more leakage current, increasing static power dissipation. This trend, combined with the trend of larger/more cache memories dominating die area, has prompted circuit designers to develop SRAM cells with low-leakage operating modes (e.g., sleep mode). Sleep mode reduces static power dissipation, but data stored in a sleeping cell is unreliable or lost. So, at the architecture level, there is interest in exploiting sleep mode to reduce static power dissipation while maintaining high performance.Current approaches dynamically control the operating mode of large groups of cache lines or even individual cache lines. However, the performance monitoring mechanism that controls the percentage of sleep-mode lines, and identifies particular lines for sleep mode, is somewhat arbitrary. There is no way to know what the performance could be with all cache lines active, so arbitrary miss rate targets are set (perhaps on a per-benchmark basis using profile information), and the control mechanism tracks these targets. We propose applying sleep mode only to the data store and not the tag store. By keeping the entire tag store active the hardware knows what the hypothetical miss rate would be if all data lines were active, and the actual miss rate can be made to precisely track it. Simulations show that an average of 73&percnt; of I-cache lines and 54&percnt; of D-cache lines are put in sleep mode with an average IPC impact of only 1.7&percnt;, for 64 KB caches.
Algebraic multigrid for complex symmetric matrices and applications
Authors: Stefan Reitzinger, Ute Schreiber, Ursula van Rienen
Venue: Journal of Computational and Applied Mathematics (2003)

This paper is concerned with the numerical study of an algebraic multigrid preconditioner for complex symmetric system matrices. We use several different Krylov subspace methods as an outer iteration, namely the QMR method proposed by Freund and Nachtigal, the BiCGCR method of Clemens, and the CSYM method of Bunse-Gerstner and Stoever. In addition, we compare the results with the standard Jacobi preconditioner for complex symmetric problems. We test our approach on the numerical simulation of high-voltage insulators.
Data Mining Using Cultural Algorithms and Regional Schemata
Authors: Xidong Jin, Robert G. Reynolds
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In the paper we demonstrate how evolutionary search for functional optima can be used as a vehicle for data mining. That is, in the process of searching for optima in a multi-dimensional space we can keep track of the constraints that must be placed on related variables in order to move towards the optima. Thus, a side effect of evolutionary search can be the mining of constraints for related variables. Here we use a Cultural Algorithm framework to embed the search and store the results in regional schemata. An application to a large-scale real-world archaeological data set is presented.
The application of rhetorical structure theory to interactive news program generation from digital archives
Authors: C. A. Lindley, J. R. Davis, F. Nack, L. W. Rutledge
Venue:  (2001)

Rhetorical structure theory (RST) provides a model of textual function based upon rhetoric. Initially developed as a model of text coherence, RST has been used extensively in text generation research, and has more recently been proposed as a basis for multimedia presentation generation. This paper investigates the use of RST for generating video presentations having a rhetorical form, using models of the rhetorical roles of video components, together with rules for selecting components for presentation on the basis of their rhetorical functions. An RST model can provide a predefined link structure providing viewers with options for obtaining and dynamically modifying rhetorically coherent video presentations from video archives and databases. The use of an RST analysis for interactive presentation generation may provide a more powerful rhetorical device than conventional linear video presentation. Conversely, making alternative RST analyses of the same video data available to users can have the effect of encouraging closer and more independent viewer analysis of the material, and discourage taking any particular rhetorical presentation at face value.
An Intelligent Tutoring System for Teaching and Learning Hoare Logic
Authors: Kazuaki Goshi, Paul Wray, Yong Sun
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Significant areas of the computer science curriculum are constantly and rapidly changingas new technologies (e.g., multimedia, WWW, Java) are adopted.This presents a challenge to our current education system: Intelligent Tutoring Systems (ITSs) for teaching and learning in Computer Science must be able to assist not only their student users but also the teachers in developing and managing courses to the best advantage of the students.We developed an ITS for teaching and learning Hoare logic.In this paper, we describe the practical use of the system in a computation theory course.