ppxscal/embedding_network huggingface dataset:
On metrics for probabilistic systems: Definitions and algorithms
Authors: Taolue Chen, Tingting Han, Jian Lu
Venue: Computers Mathematics with Applications (2009)

In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quantitative analogue of probabilistic bisimilarity in the sense that the distance zero captures the probabilistic bisimilarity. The model we are interested in is probabilistic automata, which are based on state transition systems and make a clear distinction between probabilistic and nondeterministic choices. The pseudometrics are defined as the greatest fixpoint of a monotonic functional on the complete lattice of state metrics. A distinguished characteristic of this pseudometric lies in that it does not discount the future, which addresses some algorithmic challenges to compute the distance of two states in the model. We solve this problem by providing an approximation algorithm: up to any desired degree of accuracy @e, the distance can be approximated to within @e in time exponential in the size of the model and logarithmic in 1@e. One of the key ingredients of our algorithm is to express a pseudometric being a post-fixpoint as the elementary sentence over real closed fields, which allows us to exploit Tarski's decision procedure, together with the binary search to approximate the behavioral distance.
Experimental testing in programming languages, stylistic considerations and design techniques
Authors: Ben Shneiderman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

In the early stages of the development of high-level languages, radically differing alternatives were often promulgated. Each language had a dedicated corps of adherents who advocated the primacy of their facility. Turbulent debates among the protagonists were a common affair at conferences and in the trade journals. Now as the field matures, the vehement discussions have subsided and there is a widespread recognition of the usefulness of a variety of languages. Even the proponents of a single universal language have softened their tone and have accepted the multiple language condition.
Fuzzy Comprehensive Evaluation Model Based on SVM
Authors: Sidong Xian
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The fuzzy comprehensive evaluation has the extensive application both in theory and practice, how to reasonably quantify the weights of different evaluation indexes in the fuzzy system is the key problem of it. In this text , a new method namely supper vector machine fuzzy comprehensive evaluation(SVM-FCEM),which can be to calculate the weight of the elements by the method of SVM structuring classification, is established, based on introducing the theory of SVM in briefly. the application shows that this method is stable, and the calculation result is objective. 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
An Efficient Adaptive Minor Subspace Extraction Using Exact Nested Orthogonal Complement Structure
Authors: Masaki Misono, Isao Yamada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a new adaptive minor subspace extraction algorithm based on an idea of Peng and Yi ('07) for approximating the single minor eigenvector of a covariance matrix. By utilizing the idea inductively in the nested orthogonal complement subspaces, the proposed algorithm succeeds to relax the numerical sensitivity which has been annoying conventional adaptive minor subspace extraction algorithms for example, Oja algorithm ('82) and its stabilized version: O-Oja algorithm ('02). Simulation results demonstrate that the proposed algorithm realizes more stable convergence than O-Oja algorithm.
Computer attitude, statistics anxiety and self-efficacy on statistical software adoption behavior: An empirical study of online MBA learners
Authors: Maxwell K. Hsu, Stephen W. Wang, Kevin K. Chiu
Venue: Computers in Human Behavior (2009)

Educators need to know how to motivate business students (i.e., future business practitioners) to learn and use statistical software, which can provide the practical skills necessary for business professionals to analyze data and make informed decisions. Using a sample of 207 online MBA students from an AACSB accredited university in the Midwest, a modified TAM model was examined using LISREL 8.80. The empirical results show that both computer attitude and statistical software self-efficacy have significant, positive effects on perceived usefulness. In addition, it was found that both perceived usefulness and perceived ease of use positively influence learners' intentions to use statistical software, whereas their anxiety with statistics has a significant, negative impact on perceived usefulness, perceived ease of use and behavioral intentions. Both theoretical and practical implications are discussed in this paper.
Curvature measures for discrete surfaces
Authors: John M. Sullivan
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

The curvatures of a smooth curve or surface are local measures of its shape. Here we consider analogous measures for discrete curves and surfaces, meaning polygonal curves and triangulated polyhedral surfaces. We find that the most useful analogs are those which preserve integral relations for curvature, like the Gau&szlig;--Bonnet theorem. For simplicity, we usually restrict our attention to curves and surfaces in euclidean space R3, although many of the results would easily generalize to other ambient manifolds of arbitrary dimension.
Fine-grained dynamic adaptation of distributed components
Authors: Frédéric Peschanski, Jean-Pierre Briot, Akinori Yonezawa
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

Dynamic adaptability of distributed components, nowadays scarcely supported, should become a basic principle of future middleware platforms. While most related work envisage somewhat large software reconfigurations, we explore in this paper fine-grained adaptations which intervene within component boundaries. Our experiments are conducted in the framework of the Comet middleware. Dynamic adaptability is supported in Comet through distributed protocols that can be applied at runtime. These protocols may locally denote intrusive modifications which are abstracted through the notion of role. Functional roles are used to describe all-purpose adaptations. We use hook roles as wrappers around existing functionalities. Finally, filter roles interfere with the communication layer. The expressiveness of these complementary abstractions are illustrated in various examples involving non-trivial system adaptations for distributed debugging and communication flow synchronization. A preliminary but promising quantitative evaluation of our adaptation engine under real-world conditions is proposed. We also discuss the difficult but crucial issue of verifying such dynamic adaptations in terms of type, access and security contracts.
Using Simulation to Characterize Topology of Peer to Peer Botnets
Authors: Junfeng Yu, Zhitang Li, Jun Hu, Feng Liu, Lingyun Zhou
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Future network intruders are constantly changing, improving and extending the capabilities of their botnets. Peer to peer bots are now under widespread development and are quickly evolving into a much tougher species to kill. However, partly due to the lack of understanding of the structural potential of command and control mechanism a botnets can have, countering peer to peer botnets has been ineffective. In this paper, we explore the characteristic of communication networks created by peer to peer botnets. We propose a simulation approach to characterize the structural properties and robustness of P2P botnets, corresponding to different paradigms of forming botnets. Through calculation and simulation for topology construction procedures, we show that extremely resilient peer to peer botnets can be formed to deliver attack code quickly. Such a theory would help predict botnets containment for a given topology and help develop strategies to improve defense against P2P botnets, because applying those strategies can always translate into some network topology transformation.
A Low Cost Fault Detection Mechanism Based on Cycle Cover Algorithm for Optical Burst Switching Networks
Authors: Nan Wang, Ru-yan Wang, Sheng Huang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

The optical burst switching networks are one of the most potential implementation technology of next generation optical switching networks in nowadays. In this paper, after analysis on the characteristics of HST, SPEM, HDFS, we propose a new fault detection mechanism based on minimum-length probe cycle cover algorithm, then this cycle finding algorithm is used to find cycle cover for OBS networks. After that, a probe module is assigned for each cycle and a fast fault localization algorithm is developed, finally a fault detection mechanism based on probe cycle cover is formed. The computation and statistic results show that in this fault detection mechanism comparing minimum-length probe cycle cover algorithm to the existing algorithms, it has the least amount of network resources (measured by the number of cycles, cycles length, etc.) and higher fault localization degree.
Analysis of Effects of Input Arrival Time Variations on On-Chip Bus Power Consumption
Authors: Masanori Muroyama, Tohru Ishihara, Hiroto Yasuura
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper describes analysis of on-chip bus power in the presence of arrival time variations of input signals. With shrinking process geometries, coupling power between neighboring bus lines has enlarged. The coupling power depends on not only signal transition type but also the relative signal transition time difference. For conventional dynamic power estimation, deterministic models of the time difference are assumed. We deal with nondeterministic models considering variations, because variations such as process variations cause the input arrival time variations. As a result of the time variations, power estimation error may increase. In our analysis and experiments, firstly impact of the time variations on the power consumption is analytically modeled. Then, it is demonstrated that certain types of bus coding techniques suppress the impact.
Manufacturing information systems
Authors: Earl Gomersal
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

New eras of increased productivity and profits through advanced Manufacturing Information Systems---the great nonsequitur. Far from fulfilling years of advanced publicity and still resistant to new technologies, more economical devices, and a host of new optimizing gadgets, total systems answers to manufacturing problems continues to be the elusive "brass ring" for the adventurous and a Waterloo for those who have been given the resources to make it happen. 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
Proceedings of the 2009 international symposium on Physical design
Venue: International Symposium on Physical Design (2009)

It is our great pleasure to welcome you to the 2009 ACM International Symposium on Physical Design (ISPD). This year's symposium continues its tradition as the premier small-scale high-quality forum to exchange ideas and present leading-edge research results related to the physical synthesis and layout of VLSI circuits. The mission of the symposium is to share novel physical design ideas that address the challenges involved in integrated circuit design in the deep sub-micron realm, and to identify new directions for future research and development in the domain of physical design. The call for papers attracted over 60 submissions from all over the globe. After a rigorous review process that culminated in a full-day face-to-face meeting of the entire program committee, only 21 papers were accepted. These papers cover a variety of topics -- from early design floorplanning to post-silicon prediction and debug. The regular papers are complemented by invited talks from both industry and academia. We are delighted to start the symposium with a keynote address by Dr. Carl Anderson from IBM. His talk will address the physics and the economics of CMOS scaling to 22nm and beyond. This focus will be continued in an invited session on nanotechnology on Monday evening that will provide glimpses of promising directions currently being pursued to deal with the increasing difficulty of scaling, from structured layout paradigms to an update on the feasibility of graphene-based transistors. Another invited session on Tuesday morning will provide a deep dive into one of today's hottest topics, namely analog design and layout methodologies, with talks from the perspectives of both designers and design automation experts. Additionally, there are invited talks on industrial approaches to early power grid verification (Apache), post-Si validation (ARM), and clock synthesis (Synopsys). This final invited talk will kick off a session on clocking during which the results of the inaugural ISPD Clock Network Synthesis contest will be announced. Over the past four years, ISPD has played a pioneering role in accelerating research in placement and global routing by organizing two highly successful contests each in these areas and by releasing new, realistic suites of benchmarks. This year, the symposium has turned its attention to the area of clock synthesis; the resulting contest has attracted a large number of participants from all around the world.
On Overlays and Minimization Diagrams
Authors: Vladlen Koltun, Micha Sharir
Venue: Discrete Computational Geometry (2009)

The overlay of 2&#x2264;m&#x2264;d minimization diagrams of n surfaces in &#x211d; d is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in &#x211d; d+m&#x2212;1. This elementary observation leads to a new bound on the complexity of the overlay of minimization diagrams of collections of d-variate semi-algebraic surfaces, a&#x00a0;tight bound on the complexity of the overlay of minimization diagrams of collections of hyperplanes, and faster algorithms for constructing such overlays. Further algorithmic implications are discussed.
Data Dependence of Delay Distribution for a Planar Bus
Authors: Francesc Moll, Joan Figueras, Antonio Rubio
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Due to coupling between lines, the delay in a bus depends on the type of transition causing the delay. For a given sequence of data there is a delay distribution that depends on the sequence characteristics (correlation between consecutive data). This information opens the possibility to reduce the clock cycle for a system with error correcting schemes that handles the slower cases. The large number of transitions needed to calculate a realistic bus delay distribution make the use of electrical simulation impractical for obtaining the delay distribution. This paper presents calculations of the delay distribution for representative cases of sequences, using a computationally efficient method based on a reduced number of electrical simulations. It is shown that for quasi consecutive sequences, the most probable delay is considerably lower than worst case delay.
A posteriori error analysis for a transient conjugate heat transfer problem
Authors: D. Estep, S. Tavener, T. Wildey
Venue: Finite Elements in Analysis and Design (2009)

We consider the accuracy of an operator decomposition finite element method for a transient conjugate heat transfer problem consisting of two materials coupled through a common boundary. We derive accurate a posteriori error estimates that account for the transfer of error between components of the operator decomposition method as well as the errors in solving the iterative system. We address a loss of order of convergence that results from the decomposition, and show that the order of convergence is limited by the accuracy of the transferred gradient information. We extend a boundary flux recovery method to transient problems and use it to regain the expected order of accuracy in an efficient manner. In addition, we use the a posteriori error estimates to adaptively compute the recovered boundary flux only within the domain of dependence for a quantity of interest.
Protein Contact Map Prediction Based on an Ensemble Learning Method
Authors: Narjes Khatoon Habibi, Mohammad Hossein Saraee
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Contact map is the simplified, 2D representation of protein spatial structure. Contact map prediction is an intermediate step to predict protein 3D structure. Ensemble learning-based model is a collection of learners that is more accurate than a single learner. In this paper we propose an ensemble learning method for contact map prediction. Results show that a considerable performance improvement is attainable using this approach instead of using a single model.
Disambiguating ninja cursors with eye gaze
Authors: Kari-Jouko Räihä, Oleg Špakov
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Ninja cursors aim to speed up target selection on large or multiple monitors. Several cursors are displayed on the screen with one of them selected as the active cursor. Eye tracking is used to choose the active cursor. An experiment with 13 participants showed that multiple cursors speed up the selection over long distances, but not over short distances. Participants felt the technique was fastest with 4 cursors per monitor, but still preferred to have only 1 cursor per monitor for their own use.
An MPEG2-Based Digital CATV and VOD System using ATM-PON Architecture
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

This paper proposes a next-generation access network infrastructure by NTT (Nippon Telegraph and Telephone Corporation.) The solution for providing both broadband and narrowband multimedia services is the ATM-PON (ATM-passive- optical-network) based FTTH (fiber-to-the-home) access network. Additionally, an MPEG-ATM encoder has been developed in order to provide CATV services in a full-digital residential network. This is a compact, economical, and easily-maintained multi-channel MPEG2 encoder, which is designed with custom LSIs for MPEG2 encoding and one-board circuits for each channel. NTT has been examining these systems in residential broadband service trials since January 1996. An outline of the trials and major features of the systems are presented. 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
Map-guided interpretation of remotely-sensed imagery
Authors: J. M. Tenenbaum, H. G. Barrow, R. C. Bolles, M. A. Fischler, H. C. Wolf
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Aerial and satellite imagery provide an economical means of gathering large amounts of data on the earth's resources and environment. However, except in the area of survey tasks such as crop inventories and land use that can be performed with multispectral analysis, there are few economically feasible techniques for automatically extracting the useful information from such imagery.
Security in a Model for Long-running Transactions
Authors: Damas P. Gruska, Andrea Maggiolo-Schettini, Paolo Milazzo
Venue: Fundamenta Informaticae (2008)

Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long-running transactions. Here, for these automata a security concept is introduced, which is based on a notion of opacity and on the assumption that an attacker can not only observe public system activities, but also cause abortion of some of them. Different intruder capabilities as well as different kinds of opacity are defined and the resulting security properties are investigated. Security of long-running transactions is defined by the mentioned notion of opacity and conditions for compositionality are established.
SpecVAT: Enhanced Visual Cluster Analysis
Authors: Liang Wang, Xin Geng, James Bezdek, Christopher Leckie, Ramamohanarao Kotagiri
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Given a pairwise dissimilarity matrix $\bm{D}$ of a set ofobjects, visual methods such as the VAT algorithm (for visual analysis of cluster tendency) represent $\bm{D}$ as an image $\mathrm{I}(\tilde{\bm{D}})$ where the objects are reordered to highlight cluster structure as dark blocks along the diagonal of the image. A major limitation of such visual methods is their inability to highlight cluster structure in $\mathrm{I}(\tilde{\bm{D}})$ when $\bm{D}$ contains clusters with highly complex structure. In this paper, we address this limitation by proposing a Spectral VAT (SpecVAT) algorithm, where $\bm{D}$ is mapped to $\bm{D'}$ in an embedding space by spectral decomposition of the Laplacian matrix, and then reordered to $\bm{\tilde{D'}}$ using the VAT algorithm. We also propose astrategy to automatically determine the number of clusters in $\mathrm{I}(\bm{\tilde{D'}})$, as well as a method for cluster formation from $\mathrm{I}(\bm{\tilde{D'}})$ based on the difference between diagonal blocks and off-diagonal blocks. We demonstrate the effectiveness of our algorithms on several synthetic and real-world data sets that are not amenable to analysis via traditional VAT.
Using artificial neural networks for real-time observation of the endurance state of a steel specimen under loading
Authors: Murat Selek, Ömer Sinan Şahin, Şirzat Kahramanli
Venue: Expert Systems with Applications: An International Journal (2009)

The surface temperature behavior of a steel specimen under bending fatigue is exactly divided into three stages: an initial temperature increase stage, a constant temperature stage and an abrupt temperature increase stage at the end of which the specimen fails. To obtain the endurance state of the specimen we use its thermal images (TIs). By applying artificial neural networks (ANNs) and other operations to these TIs we obtain spots with maximal, approximately medium and minimal temperatures. Then by using these temperatures we analytically obtain the temperatures all of spots of the specimen and localize the regions consisting of spots of relatively high temperatures. We consider such a region as one to be cracked firstly. This approach allows us to handle only those spots that are of interest and to work in real-time even by using an infrared (IR) camera and a computer with average technical features. We are using the result obtained in this study for fatigue testing the steel materials and for sensing the pre-fatigue state of a specific part of a machine being worked in order to take preventive measures before it breaks down.