ppxscal/embedding_network huggingface dataset:
C-Net: Generating Multivariate Decision Trees From Artificial Neural Networks Using C5
Authors: Hussein A. Abbass, Michael Towsey, Gerard Finn
Venue:  (1999)

Despite the fact that artificial neural networks (ANNs) are universal function approximators, their black box nature (that is, their lack of direct interpretability or expressive power) limits their utility. In contrast, univariate decision trees (UDTs) have expressive power though they are not as accurate as ANNs. We propose an amelioration for both the expressiveness of ANNs and the accuracy of UDTs by consolidating both technologies for generating multivariate decision trees (MDTs). In addition, we introduce a new concept, recurrent decision tree, where C-Net uses recurrent neural networks to generate an MDT with a recurrent feature. That is, a memory is associated with each node in the tree with a recursive condition replaces the conventional linear one. Furthermore, we show empirically that, in our test cases, our proposed method achieves a balance of comprehensibility and accuracy intermediate between ANNs and UDTs. MDTs are found to be intermediate since they are more expressive than ANNs, but not UDTs, and more accurate than UDTs, but not ANNs. Moreover, in many cases MDTs are more compact than UDTs.
Positional adaptation of processors: application to energy reduction
Authors: Michael C. Huang, Jose Renau, Josep Torrellas
Venue: ACM SIGARCH Computer Architecture News (2003)

Although adaptive processors can exploit application variability to improve performance or save energy, effectively managing their adaptivity is challenging. To address this problem, we introduce a new approach to adaptivity: the Positional approach. In this approach, both the testing of configurations and the application of the chosen configurations are associated with particular code sections. This is in contrast to the currently-used Temporal approach to adaptation, where both the testing and application of configurations are tied to successive intervals in time.We propose to use subroutines as the granularity of code sections in positional adaptation. Moreover, we design three implementations of subroutine-based positional adaptation that target energy reduction in three different workload environments: embedded or specialized server, general purpose, and highly dynamic. All three implementations of positional adaptation are much more effective than temporal schemes. On average, they boost the energy savings of applications by 50% and 84% over temporal schemes in two experiments.
Exact Monte Carlo Calculations for Fermions on a Parallel Machine
Authors: Shiwei Zhang, M. H. Kalos
Venue:  (1993)

We describe how a recently published algorithm--which addresses the sign problem with the context of the Green''s function Monte Carlo method--can be implemented in a parallel distributed environment. The method of parallelization maintains large granularity and therefore low overhead. Despite the stochastic nature of the algorithm, good load-balancing can be accomplished and reproducibility is ensured.
Energy dissipating capacity of reinforced concrete members
Authors: P. G. Bakir, M. H. Boduroglu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper gives a detailed account of the parameters that influence the energy dissipation capacities of cyclically loaded exterior beam-column joints. Several parametric studies are carried out on an experimental database. The results of these parametric studies show that the energy dissipation capacities of cyclically loaded reinforced concrete exterior beam-column joints increase when the stirrup ratio and the ratio of the cross-sectional area of the beam compressive reinforcement to the cross-sectional area of the beam tensile reinforcement are increased. The normalised energy dissipation capacity decreases when the beam longitudinal reinforcement ratio, the concrete cylinder strength, the column longitudinal reinforcement ratio increase. The parametric studies show that the normalised energy index is independent of the joint aspect ratio, the intermediate column bars and the column axial stress.
Protected procedure call on the PRIME(TM) machines
Authors: Edward A. Feustel
Venue: ACM SIGARCH Computer Architecture News (1982)

The procedure call and argument transfer mechanism on the Model P400 and the 50 Series of PRIME machines is described. First, PRIME V-mode addressing is examined. Next, data structures interpreted by hardware and relevant to procedure call are explained. Finally, the process of procedure call, argument transfer, and return are described.The mechanism is evaluated on the basis of our experience. This mechanism has facilitated inter-language communications and has permitted the development of a shared operating system that is embedded within the user's address space. Its high speed has permitted a system environment consisting of many procedures. It has several novel features not available in other machines.Some extensions to the mechanism are suggested. These extensions would simplify the use of procedure call in languages which use call by value. They would facilitate procedure call in a general register environment.
Noise-Aware Driver Modeling for Nanometer Technology
Authors: Xiaoliang Bai, Rajit Chandra, Sujit Dey, P. V. Srinivas
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

With the semiconductor industry evolving into the deepsub-micron (DSM) era, crosstalk noise becomes a criticalissue that needs to be handled efficiently and accurately.Modern designs like System-on-Chips have millions ofnoise-prone wires that need to be analyzed. Analysis usingcircuit-level simulation is not feasible. Efficient static noiseanalysis, which statically estimate noise based on linearcircuit model, is widely used. However, traditionallydrivers' holding resistances are pre-characterized withoutconsidering the crosstalk noise. The driver's holdingresistance changes dramatically with the crosstalk noiseinduced voltage changing on the victim wire. For accuratenoise estimation, the driver's substantial nonlinear variationcannot be ignored. In this paper, we propose a novelmethod, which uses layout extracted parameters ofcoupling interconnect and pre-characterized parameters ofdriver to calculate an effective holding resistance. Thenoise-aware effective holding resistance dramaticallyimproves the accuracy for noise magnitude and energyestimation. The proposed method is simple and efficient. Itenables fast on-the-fly calculation of the effective holdingresistance. Experiments show significant improvement inaccuracy with almost negligible computation overhead.
Programming Language Semantics Using Extensional $\lambda$-Calculus Models
Authors: Herbert Egli
Venue:  (1974)

We prove a theorem which provides an intuitive understanding of the meaning of $\lambda$-terms in Scott''s extensional $\lambda$-calculus models. This allows us to use those models for the definition of high-level programming languages. In order to illustrate this we define a programming language which includes blocks and (arbitrary recursive) procedures. Two aspects justify this approach. First of all, the logical properties of those (typeless) $\lambda$-calculus models are appealing for a formalization similar to LCF [6] which formalizes typed $\lambda$-calculus models. Secondly, not having the type restrictions that LCF imposes allows us to define the semantics of high-level programming languages in the spirit of ``mathematical semantics'''' [12] (which is usually based on recursively defined domains), thus the semantic nature of syntactic constructs can be exhibited clearly. Keywords: Mathematical semantics, Programming Languages, $\lambda$-calculus Models, typed, typeless, extensional, Logic, LCF.
On Parallelism in Turing Machines
Authors: Dexter Kozen
Venue:  (1976)

A model of parallel computation based on a generalization of nondeterminism in Turing machines is introduced. Complexity classes //T(n)-TIME, //L(n)-SPACE, //LOGSPACE, //PTIME, etc. are defined for these machines in a way analogous to T(n)-TIME, L(n)-SPACE, LOGSPACE, PTIME, etc. for deterministic machines. It is shown that, given appropriate honesty conditions, 217z L(n)-SPACE $\subseteq$ //L$(n)^{2}$-TIME T(n)-TIME $\subseteq$ //log T(n)-SPACE //L(n)-SPACE $\subseteq$ exp L(n)-TIME //T(n)-TIME $\subseteq$ T$(n)^{2}$-SPACE thus //EXPTIME = EXPSPACE //PSPACE = EXPTIME //PTIME = PSPACE //LOGSPACE = PTIME ? = LOGSPACE That is, the deterministic hierarchy LOGSPACE $\subseteq$ PTIME $\subseteq$ PSPACE $\subseteq$ EXPTIME $\subseteq \ldots$ shifts by exactly one level when parallelism is introduced. We give a natural characterization of the polynomial time hierarchy of Stockmeyer and Meyer in terms of parallel machines. Analogous space hierarchies are defined and explored, and a generalization of Savitch''s result NONDET-L(n)-SPACE $\subseteq$ L$(n)^{2}$-SPACE is given. Parallel finite automata are defined, and it is shown that, although they accept only regular sets, in general, $2^{2^{k}}$ states are necessary and sufficient to simulate a k-state parallel finite automaton deterministically. 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
The Impact of Recovery Mechanisms on the Likelihood of Saving Corrupted State
Authors: Subhachandra Chandra, Peter M. Chen
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Recovery systems must save state before a failure occursto enable the system to recover from the failure. However,recovery will fail if the recovery system saves any statecorrupted by the fault. The frequency and comprehensive-nessof how a recovery system saves state has a majoreffect on how often the recovery system inadvertentlysaves corrupted state. This paper explores and measuresthat effect. We measure how often software faults in theapplication and operating system cause real applicationsto save corrupted state when using different types of recov-erysystems. We find that generic recovery techniques, suchas checkpointing and logging, work well for faults in theoperating system. However, we find that they do not workwell for faults in the application because the very actionstaken to enable recovery often corrupt the state uponwhich successful recovery depends.
Searching Information in Large and Complex Distributed Information Systems: Balance Between Implicit and Explicit Acquisition of the User Model
Authors: Fernando Ferri, Patrizia Grifoni
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The knowledge about users acquired and formalized through a model may be used in more than one way in an interactive intelligent system. At the higher level, these models may be used for recognition and interpretation of information about the user's behavior, to provide him with help facilities and a set of useful information.Literature mainly proposes two different strategies devoted to the acquisition of the user models; that is the implicit acquisition and the explicit acquisition. Both the previously introduced approaches are able to satisfy acquisition needs. In particular, this paper proposes an integrated perspective of the two previously introduced approaches and discusses about the balance between implicit and explicit acquisition taking into account the user behavior.The previously introduced problems are treated considering a Large and Complex Distributed Information (i.e. Intranet system) in a specific domain: medical folders and medical knowledge bases.
On linear ordering finitely-branching graphs and non-well-founded sets
Authors: Alexei Lisitsa, Vladimir Sazonov
Venue:  (1997)

Definability of a linear order in finite structures of some given class by logical means is an important issue of finite model theory and descriptive complexity theory. For example, first-order logic extended by least fixed point operator (FO+LFP) describes exactly PTIME-computability over finite linear ordered structures \cite{Imm82,Var82,Imm86}. If the structures considered are not linearly ordered in advance, but some order may be uniformly definable in FO+LFP then the same result holds for this class of structures, as well. We will show in this paper that this is the case for the class of finite strongly extensional (SE) graphs (i.e. arbitrary graphs considered up to bisimulation equivalence relation). The vertices of such graphs serve as a faithful representation of hereditarily-finite non-well-founded sets HFA (with finite transitive closure). Actually, we define in FO+IFP a linear ordering on arbitrary SE finitely branching graphs which may be infinite and so represent a more general class of hereditarily-finite non-well-founded sets HFA^{\infty} (with infinite transitive closure). Our interest to these questions arose from our work on characterizing the complexity classes of computable set-theoretic operations by some bounded set-theory (BST) languages \cite{Saz87,Saz93,Saz95,SaLi95, LiSa97}. So, definability in the language $\Delta_{D}$ considered in \cite{Saz95} over HFA-sets was characterised in terms of definablity in FO+LFP over finite graphs of the abovementioned kind. Now, having definable linear ordering, we answer affirmatively the question in op. cit. on coincidence of $\Delta_{D}$-definability with PTIME-computability over HFA. We propose two different definitions of linear ordering, one of which is an application of the method of A.Dawar, S.Lindell and S.Weinstein to the case of SE graphs and give a comparison of both approaches in terms of coherence of the orders on different graphs. Cf. also related papers in ftp://ftp.botik.ru/rented/logic/papers/ http://www.botik.ru/PSI/AIReC/logic/ ------------------- Both authors from Program Systems Institute of Russian Acad. of Sci., Pereslavl-Zalessky, 152140, Russia. e-mail: sazonov@logic.botik.rulisitsa@logic.botik.ru phones: +7-08535-98945 and 98942, fax: +7-08535-20566. Supported by RBRF (project 96-01-01717). The work on this paper was started when the second author visited Princeton and Rutgers Universities (DIMACS) in 1996.
Addendum to ``New Notions of Reduction and Non-Semantic Proofs of Beta Strong Normalization in Typed Lambda Calculi''''
Authors: A. J. Kfoury, J. B. Wells
Venue:  (1995)

Abstract This is an addendum to our technical report BUCS TR-94-014 of December 19, 1994. It clarifies some statements, adds information on some related research, includes a comparison with research be de Groote, and fixes two minor mistakes in a proof.
Pattern Recognition with Eye Movement: A Neural Network Model
Authors: Masayuki Kikuchi, Kunihiko Fukushima
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

We offer a neural network model which has the ability of sift, scale, and deformation-invariant pattern recognition. The model extracts spatial relations between fixating feature and each of peripheral features. The mechanism of saccadic eye movement enables the model to analyze whole pattern-structure. The ability of the model has been tested on a computer.
Some forbidden subgraph conditions for a graph to have a k-contractible edge
Authors: Kiyoshi Ando, Ken-ichi Kawarabayashi
Venue: Discrete Mathematics (2003)

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. Let Kn- stand for the graph obtained from Kn by removing one edge. Let G be a k-connected graph (k ≥ 5). It is known that if either "k is odd and G contains no K4- = K2 + 2K1" or "G contains no K1 + 2K2", then G has a k-contractible edge. In this paper, we prove that if G contains neither K2 + sK1 nor K1 + tK2 with positive integers s, t such that s(t - 1) < k, then G has a k-contractible edge. We also prove that if δ(G) ≥ k+ 1 and G contains neither K5- nor 5K1 + P3, then G has a k-contractible edge.
A Case Study in Architectural Modelling: The AEGIS System
Authors: Robert Allen, David Garlan
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

Software architecture is receiving increasingly attention as a critical design level for software systems. However, the current practice of architectural description is largely informal and ad hoc, with the consequence that architectural documents serve as a poor communication mechanism, are difficult to analyze, and may have very little relationship to the implemented system. In an attempt to address these problems several researchers have experimented with formalisms for architectural specification and modelling. One such formalism is Wright. In this paper we show how Wright can be used to provide insight into an architectural design by modelling a prototype implementation of part of the AEGIS Weapons System.
Effective On-chip Inductance Modeling for Multiple Signal Lines and Application on Repeater Insertion
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

A new approach to handle the inductance effect on multiple signal lines is presented. The worst case switching pattern is first identified. Then a numerical approach is used to model the effective loop inductance (Leff) for multiple lines. Based on look-up table for Leff, an equivalent single line model can be generated to decouple a specific signal line from the others to perform static timing analysis. Compared to the use of full RLC netlist for multiple lines, this approach greatly improves the computation efficiency and maintains accuracy for timing and signal integrity analysis. Applications to repeater insertion in the critical path chains are demonstrated. For a single line, the RLC model minimizes delay with fewer number of repeaters than RC model. However, for multiple lines, we find that same number of repeaters is inserted for optimal delay according to both the RC and RLC multiple line models.
Management of Environments in 2K
Authors: Dulcineia Carvalho, Fabio Kon, Francisco Ballesteros, Manuel Roman, Roy Campbell, Dennis Mickunas
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Computer users are increasingly multi-device equipped, and no longer sedentary. It is desirable that the execution environment in any of these devices be customized to the user preferences and to the device characteristics. This paper describes a framework for managing execution environments in 2k, an adaptable, distributed, network-centric, user- and application-oriented operating system aimed at accommodating change. A 2k environment is a container of components, devices and configuration parameters and provides an execution context for users within the 2k distributed systems. A user has a distributed execution environment that consists of several subenvironments running on different platforms or suspended to be resumed later. The management of the execution environments is designed to provide a user-centric view of the system; it facilitates user mobility, by liberating users from the restriction of being explicitly attached to specific platforms, and by seamlessly recruiting resources where they are available.
Linguistic Analysis of Italian Perception and Speech Act Verbs
Authors: Monica Monachini, Adriana Roventini, Antonietta Alonge, Niocoletta Calzolari, Ornella Corazzari
Venue:  (1994)

Two theoretical hypotheses are in the background of the present work, and of DELIS work in general: a corpus based lexicographical approach and a frame based semantic analysis. We assume that only a careful and detailed analysis of corpus data can constitute a sound basis for a realistic approach to lexicon building, be it a human oriented dictionary or a computationally oriented lexicon. Obviously corpus data cannot be used in a simplistic way. In order to become usable they must be analysed according to some theoretical hypothesis, according to which to model and structure what would be otherwise an unstructured set of data. The best mixture of empirical and theoretical approach is the one in which the theoretical hypothesis is itself emerging from and guided by successive analyses of the data, and is cyclically refined and adjusted to textual evidence...
Building reconfiguration primitives into the law of a system
Authors: N. H. Minsky, V. Ungureanu, Junbiao Zhang, Wenhui Wang
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Given a certain class C of reconfigurations, deemed to be potentially important for a given system, we define a reconfiguration suite S/sub c/ to be a set of primitive operations that satisfy the following conditions: any reconfiguration in C can be carried out by a sequence of primitives from S/sub c/. The correctness of S/sub c/ should be independent of the functionality of the system, and invariant of its reconfigurations (for a given set of possible configurations of the system at hand). We describe a mechanism for implementing such reconfiguration suites, for a system that operates under law-governed interaction (LGI), currently supported by an experimental toolkit called Moses. LGI is a mode of interaction between the members of a given group (or system) of agents, which is governed by an explicit and strictly enforced set of rules, called the law of this group. The existence of such a law under LGI provides us with an architectural model of the system, which can be made to include the definition of reconfiguration suites.
Computable exponential bounds for intree networks with routing
Authors: Cheng-Shang Chang, Jay Cheng
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

In this paper, we refine the calculus proposed previously by Chang et al. (1994). The new calculus, including network operations for multiplexing, input-output relation, and routing, allows us to compute tighter exponential bounds for the tail distributions of queue lengths in intree networks with routing. In particular, if external arrival processes and routing processes are either Markov arrival processes or autoregressive processes, the stationary queue length at a local node is stochastically bounded above by the sum of a constant and an Erlang random variable. The decay rate of the Erlang random variable is not greater than (in some cases equal to) the decay rate of the tail distribution of the stationary queue length. The number of stages of the Erlang random variable is the number of external arrival processes and routing processes contributing to its queue length. For the single queue case, both the lower and upper-bounds are derived.
The Packed Exponential Connections Network
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

PEC (Packed Exponential Connections) is a scalable interconnection network for parallel systems that meets many requirements for a large range of system sizes, i.e. from 16 to over 1,000,000 processors. A scalable network architecture must meet the following criteria: have a low average and maximum diameter to avoid communication latency; minimize routing contentions; have a constant number of ports per node and a simple wire layout to allow for expansion; be inherently fault tolerant; be subdividable for disjoint multi-user applications; and be able to handle a large range of algorithm implementations without adding undo overhead. Our initial research has shown that PEC can meet each of the above criteria within acceptable limits. Further investigation is required to confirm these preliminary results. 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