ppxscal/embedding_network huggingface dataset:
Analytical method for elastoplastic buckling behaviour of H-section truss elements involving local buckling
Authors: T. Ohtsuka, S. Motoyui
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

It is significant to evaluate local buckling in elastoplastic buckling behavior of truss member because local buckling causes extremely strength degradation. However it is very costly to evaluate local buckling by the analysis with finite element method. In this paper, by regarding a local buckling as a softening in resultant stress space (M,N), we will extend the foreging method and propose a new consistent and convenient analytical method to evaluate the elastoplastic buckling behavior involving local buckling for H-section truss member.
Developments in the use of neural nets for truck weigh-in-motion on steel bridges
Authors: I. Flood, R. R. A. Issa, N. Kartam
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

The paper reports on the latest developments of a neural network-based method of accurately estimating truck attributes (such as axle loads) from strain response readings taken from the bridge over which the truck is traveling. The approach is designed to remove the need for intrusive devices (such as tape switches) on the deck of the bridge to obtain such data so as to provide a convenient and viable means of collecting bridge loading statistics.Specifically, this paper compares the performance of three radically different types of neural network used for identifying the class of truck crossing the bridge. Of the methods considered, a binary networking system is found to be the most efficient. The paper concludes with some recommendations for further study.Several recommendations are made for future work, aimed at further improving the performance of the system. Primarily, the work here focused on simply supported steel bridges with negligible skew. It is recommended that the technique be applied to other bridge configurations, such as skewed and pre-stressed concrete structures.
Robust Proximity Queries in Implicit Voronoi Diagrams
Authors: G. Liotta, F. P. Preparata, R. Tamassia
Venue:  (1996)

In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact computation paradigm and formalize the notion of degree of a geometric algorithm, as a worst-case quantification of the precision (number of bits) to which arithmetic calculation have to be executed in order to guarantee topological correctness. We also propose a formalism for the expeditious evaluation of algorithmic degree. As an application of this paradigm and an illustration of our general approach, we consider the important classical problem of proximity queries in 2 and 3 dimensions, and develop a new technique for the efficient and robust execution of such queries based on an implicit representation of Voronoi diagrams. Our new technique gives both low degree and fast query time, and for 2D queries is optimal with respect to both cost measures of the paradigm, asymptotic number of operations and arithmetic degree.
Maintenance of Ambiences for Mobile Systems
Authors: Toshihiko Ando, Kaoru Takahashi, Yasushi Kato, Norio Shiratori
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We propose a formal method to maintain mobile systems placed on fluidal ambiences using a process calculus in this paper. Behavior of physically movable entities of mobile systems, e.g. mobile telephone systems and intelligent transport systems (ITSs), may be affected by their surrounding. We have focused on effects of ambiences to behavior of mobile systems and have introduced the notion of a field into a concurrent calculus. ¡F, an extension of ¡-calculus, formalizes processes constrained by ambiences. Based on ¡F, our maintenance method indicates us how an ambience should be recovered when it is damaged.
Porting a Vector Library: A Comparison of MPI, Paris, CMMD, and PVM (or, "I''ll never have to port CVL again")
Authors: Jonathan C. Hardwick
Venue:  (1994)

This paper describes the design and implementation in MPI of the parallel vector library CVL, which is used as the basis for implementing nested data-parallel languages such as NESL and Proteus. We compare the ease of writing and debugging the portable MPI implementation of CVL with our experiences writing previous versions in CM-2 Paris, CM-5 CMMD, and PVM, and give initial performance results for MPI CVL running on an IBM SP-1, Intel Paragon, and TMC CM-5. 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
Verilog-based performance evaluation of a multiprocessor system
Authors: C. D. Anyanwu, I. P. Jalowiecki
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

We present the outcome of an exercise to model, in Verilog HDL, a non-homogeneous, pyramid-organised, multiprocessor system. The model has been constructed to represent, at varying degrees of detail, the dynamic behaviour of the system and has subsequently been verified and calibrated against components of the realised system. The paper discusses the performance of the model, the type of results available, and the experience gained from the activity.
Comprehension of Object-Oriented Software Cohesion: The Empirical Quagmire
Authors: Steve Counsell, Emilia Mendes, Stephen Swift
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

It is a little over ten years since Chidamber and Kemerer's object-oriented (OO) metric suite which included the Lack of Cohesion Of Methods (LCOM) metric was first proposed [9]. Despite considerable effort both theoretically and empirically since then, the software engineering community is still no nearer finding a generally accepted definition or measure of OO cohesion. Yet, achieving highly cohesive software is a cornerstone of software comprehension and hence, maintainability. In this paper, we suggest a number of suppositions as to why a definition has eluded (and we feel will continue to elude) us. We support these suppositions with empirical evidence from three large C++ systems and a cohesion metric based on the parameters of the class methods; we also draw from other related work. Two major conclusions emerge from the study. Firstly, any sensible cohesion metric does at least provide insight into the features of the systems being analysed. Secondly however, and less reassuringly, the deeper the investigative search for a definitive measure of cohesion, the more problematic its understanding becomes; this casts serious doubt on the use of cohesion as a meaningful feature of object-orientation and its viability as a tool for software comprehension.
Fault-Tolerant Computing on Trees
Authors: Ajit Agrawal
Venue:  (1990)

Much attention has been given recently to the resilience of different networks to faults. Hypercubes have been shown to be robust in presence of a constant fraction of random node and edge failures. Constant-degree networks like the meshes have been analyzed with a view to wafer-scale integration in the presence of faults. Hypercube derivative networks have been shown to be robust in the presence of node failures, though the more difficult case of edge failures remains unsolved. Here we analyze the fault-tolerant computing issues on a complete binary tree. Binary trees are well-known networks, and their structure makes them susceptible to edge faults. Analysis of binary trees is important in its own right as well as in analyzing many other tree derivative networks like the fat-trees, tree of meshes, pyramids, etc. Given a complete binary tree with faulty components, we show how to simulate the fault-free complete binary tree under different models of faults. If nodes of an N-node complete binary tree fail randomly with constant probability $p > 1/2$, then the faulty tree can simulate the fault-free tree with $O (\log \log N)$ slowdown, with high probability. If both edges and nodes fail with independent probability $p > 1/2$, we show that $ \Omega ( { ( \frac{N}{\log N} ) } ^ { \log ( \frac{1}{1~-~p} ) } ) $ is a lower bound on the simulation time of the fault-free tree by the faulty tree. We also show an almost strict upper bound on simulation time that is within a $ \log ^ 2 N$ factor of the lower bound for $p > 1/3$. The above results hold with high probability. The technique presented here, of bounding the size of the largest connected component in presence of edge faults, is new and can be extended to other related networks.
A modified algorithm for reinforced concrete cross section integration
Authors: J. L. Bonet, P. F. Miguel, M. L. Romero, M. A. Fernandez
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with the implementation of a modified integration procedure for arbitrary geometry reinforced concrete cross sections with axial forces and biaxial bending, from service load to ultimate load. The proposed method is applicable in sections which stress field is uniform at least in one direction. The method decompose the integration area in thick layers parallel to the most tensile stressed fibber, which definition depends on the constitutive equation of the concrete. The integration of the stress field of each thick layer is transformed into a path integral over the perimeter of this layer, evaluating them by the Gauss-Legendre cuadrature. The obtained results for the different alternatives are compared in accuracy and in speed in relation with the results obtained with the classical fibber decomposition method and also with other methods proposed by different authors.
Specification of components in a proposition solver
Authors: Bert Lisser, Jos J. Wamel
Venue:  (1997)

In this paper we present a specification of components and data types for a proposition solver. The specification language we use is $\mu$CRL. The components are specified in such a way that they may serve as building blocks in various applications.
On random relational structures
Authors: Manfred Droste, Dietrich Kuske
Venue: Journal of Combinatorial Theory Series A (2003)

Erdös and Rényi gave a probabilistic construction of the countable universal homogeneous graph. We extend their result to more general structures of first-order predicate calculus. Our main result shows that if a class of countable relational structures C contains an infinite ω-categorical universal homogeneous structure U, then U can be constructed probabilistically.
Face Detection and Its Applications in Intelligent and Focused Image Retrieval
Authors: Zhongfei Zhang, Rohini K. Srihari, Aibing Rao
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents a face detection technique and its applications in image retrieval. Even though this face detection method has relatively high false positives and low detection rate (as compared with the dedicated face detection systems in the literature of image understanding), due to its simple and fast nature, it has been shown that this system may be well applied in image retrieval in certain focused application domains. Two application examples are given: one combining face detection with indexed collateral text for image retrieval regarding human beings, and the other combining face detection with conventional similarity matching techniques for image retrieval with similar background. Experimental results show that our proposed approaches have significantly improved the image retrieval precisions than the existing search engines in these focused application domains.
Algorithm engineering for parallel computation
Authors: David A. Bader, Bernard M. E. Moret, Peter Sanders
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

The emerging discipline of algorithm engineering has primarily focused on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used implementations. As parallel computing becomes ubiquitous, we need to extend algorithm engineering techniques to parallel computation. Such an extension adds significant complications. After a short review of algorithm engineering achievements for sequential computing, we review the various complications caused by parallel computing, present some examples of successful efforts, and give a personal view of possible future research.
A hermeneutical approach to external validation of simulation models
Authors: Andrew Hale Feinstein, Hugh M. Cannon
Venue: Simulation and Gaming (2003)

Validation is the most important tool in evaluating the effectiveness of a simulation model. An integral subset of validation is external validation. Through a historical philosophical discussion and examples, the authors provide a road map to navigate approaches to this topic. The authors also provide methodology suggestions by reconciling foundational philosophical approaches and incorporating a hermeneutical perspective to increase the usability, validity, and generalizability of simulation models.
An improved boosting algorithm and its application to automated text categorization
Authors: Fabrizio Sebastiani, Alessandro Sperduti, Nicola Valdambrini
Venue:  (2000)

We describe an improved boosting algorithm, called {\sc AdaBoost.MH$^{KR}$}, and its application to text categorization. Boosting is a method for supervised learning which has successfully been applied to many different domains, and that has proven one of the best performers in text categorization exercises so far. Boosting is based on the idea of relying on the collective judgment of a committee of classifiers that are trained sequentially. In training the $i$-th classifier special emphasis is placed on the correct categorization of the training documents which have proven harder for the previously trained classifiers. {\sc AdaBoost.MH$^{KR}$} is based on the idea to build, at every iteration of the learning phase, not a single classifier but a sub-committee of the $K$ classifiers which, at that iteration, look the most promising. We report the results of systematic experimentation of this method performed on the standard {\sf Reuters-21578} benchmark. These experiments have shown that {\sc AdaBoost.MH$^{KR}$} is both more efficient to train and more effective than the original {\sc AdaBoost.MH$^{R}$} algorithm.
The Ellipsoid Method: A Survey
Authors: Robert G. Bland, Donald Goldfarb, Michael J. Todd
Venue:  (1980)

IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan''s result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan''s result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research.
A Critique of Adaptive Routing
Authors: Michael J. Pertel
Venue:  (1992)

This report refutes claims that adaptive routing performs better than dimension-order routing. Simulation results are presented that show dimension-order routing achieves both higher throughput and lower latency than adaptive routing. Specious claims for the advantages of adaptive routing are critiqued.
Single I/O Space for Scalable Cluster Computing
Authors: Roy S. C. Ho, Hai Jin, Kai Hwang
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this paper, we propose a novel Single I/O Space architecture for achieving a Single System Image (SSI) at the I/O subsystem level. This is very much desired in a scalable cluster computing environment using commodity components. Our design achieves a single address space for all blocks of data in the cluster, which can tolerate all single disk failures. While traditional approaches focused on at user-level or at distributed file subsystem level, we separate the I/O subsystem of a cluster into the file system and a set of distributed Virtual Device Drivers (VDDs). All SSI services are provided by the VDDs with unmodified file systems. Compared to previous approaches, our approach has higher transparency, better performance, lower implementation cost, higher availability, and application compatibility for I/O intensive cluster computing.
Maintenance at ABB (II): Change Execution Processes
Authors: Mira Kajko-Mattsson
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

In large software organizations, a maintenance process is seldom monolithic. Instead, it is a complex family of various processes collaborating with each other, where each process executes a clearly defined task. In this paper, we describe and compare two change execution processes utilized within maintenance by two ABB organizations, namely ABB Automation Products AB and ABB Robotics AB. Thus, this paper is the report of the current state of practice in change execution at ABB. It is also the continuation of a comparative study on the collaborating maintenance processes used for the administration of software problems [11].
A case study of a maintenance support system
Authors: K. J. Wedde, T. Stalhane, I. Nordbo
Venue: Proceedings of the International Conference on Software Maintenance (1995)

One of the problems when maintaining a system installed at many sites and with many support centres, is that a lot of problems are reported several times, thus creating a large amount of extra work for the system maintenance organization. In order to reduce this problem, we have built a trouble report filter that will filter out more than 30% of all repeated trouble reports, even if the problem is described by different terms or at different system levels. The work consists of building a classification model based on the system description, terms used in the trouble reports, relations between these terms and by using measures for term distance and importance to compute a trouble report distance. The model can be tuned to maximum efficiency by varying the distance and importance measures. After describing the model and the term network, we describe two experiments with real data. The results show that it is possible to build a simple but highly efficient model for recognizing trouble reports.
A Cluster-Based Statistical Model for Object Detection
Authors: Thomas D. Rikert, Michael J. Jones, Paul Viola
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper presents an approach to object detection which is based on recent work in statistical models for texture synthesis and recognition (Heeger and Bergen 1995, De Bonet and Viola 1998, Zhu et al. 1998, Simoncelli and Portilla 1998). Our method follows the texture recognition work of De Bonet and Viola. We use feature vectors which capture the joint occurrence of local features at multiple resolutions. The distribution of feature vectors for a set of training images of an object class is estimated by clustering the data and then forming a mixture of gaussian model. The mixture model is further refined by determining which clusters are the most discriminative for the class and retaining only those clusters. After the model is learned, test images are classified by computing the likelihood of their feature vectors with respect to the model. We present promising results in applying our technique to face detection and car detection.
Get in the Groove: Building Tools and Peer-to-Peer Solutions with the Groove Platform, 1 edition
Authors: Phil Stanhope
Venue:  (2002)

:Building Tools and Peer-to-Peer Solutions with the Groove PlatformThe Groove platform makes peer-to-peer workgroup collaboration easier than ever. With this unique developer's guide, you'll discover how to customize Groove for specific business needs - taking Groove collaboration and ease of use to the next level. Using plenty of code examples in JavaScript, C++, and Visual Basic, veteran Groove developer Phil Stanhope shows you step by step how to create your own Groove tools and layouts and integrate contact management, Web-based customer management services, and data from enterprise systems.Take Groove to the Next LevelUnderstand Groove basics - the transceiver, contacts, messaging, chatting, spaces, and accountsCreate, test, and refine custom HTML viewer tools to integrate existing Web content into GrooveStreamline development by extracting template code from existing toolsCreate your own custom Groove layoutIntegrate contact management with invitation files and online detection toolsEnhance a customer-service Web site by adding a Groove collaboration space with seeded customer data and toolsUnderstand the basics of next-generation edge-based CRM applications by synchronizing center-based enterprise data with custom edge-based toolsImport and export Groove-specific XML as well as third-party XML data from corporate databases and Web-enabled CRM and ERP systemsExploit Groove's communications, security, and transport services to build asynchronous, guaranteed-delivery message and data-synchronization solutionsCD-ROM includes:Sample Groove toolsComplete source code and examples from the bookGroove Preview Edition and Groove Development Kit 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
Visualization of Multi-scale Data Sets in Self-Organized Criticality Sandpile Model
Authors: B. Hnat
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

To study the three-dimensional evolution of a CA model of a sandpile as a function of control parameters a computational steering approach has been used. Sandpile profiles are calculated in real time and displayed in three dimensions simultaneously with the evolution plots of state variables. This represents a generic problem of multi-scale structure in data sets derived from nonlinear systems. The software modules were developed in OpenGL (tm) and the Glut (tm) library and will ultimately be implemented in semi-immersive VR on ImmersaDesk (tm) To achieve sufficient speed in real time display, the full data set is represented graphically in a compact form. 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
Cantor User Report: Version 2.0
Authors: William C. Athas, Charles L. Seitz
Venue:  (1987)

No abstract available.
An Access-Control Calculus for Spanning Administrative Domains
Authors: Jon Howell, David Kotz
Venue:  (1999)

In our quest to give users uniform access to resources unimpeded by administrative boundaries, we discovered that we needed transitive sharing among users, with the possibility of restricted access along each sharing link. To achieve that goal, we extend Lampson et al.''s calculus for access control to support restricted delegations. We discuss the advantages of our extension, including the simplification of constructs like ACLs and statement expiration. We also apply our extension to model the Simple Public Key Infrastructure and make suggestions about its future development. Our extended calculus exposes some surprising consequences in such systems that use restricted delegation.