ppxscal/embedding_network huggingface dataset:
General Approaches to the Modelling of Soft Estimates and Beliefs in Strategic Decision Engineering
Authors: Valery B. Tarassov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Strategic decision engineering problems are formulated. To differ from conventional decision-making approaches, decision engineering faces ill-defined situations typical for strategic management. Here the modeling of various non-factors proper to decider'sestimates, judgments and beliefs is of primary concern.The author introduces the concept of «soft estimates» to define flexible expert estimates taking into account non-factors classes which arise in decider's knowledge representation on bipolar scales. His main purpose in this paper is to specify a general mathematical framework for soft estimates and uncertain beliefs typical for strategic decision engineering.A logical-algebraic description of soft estimation approaches is given. Different types of bipolar scales are considered. Appropriate multi-valued and fuzzy logics are presented. Some early logical approaches to non-factors modeling are discussed. A quasi-ordering relationinduced by a class of negations is taken as a basis for representing judgments and beliefs on bipolar scales. An estimation algebra on bipolar scales is constructed. Some indices of estimate softness are suggested. Generalized fuzzy sets to model flexible linguistic estimates on bipolar scales are proposed.
Effect Of Class Testing On The Reliability Of Object-Oriented Programs
Authors: M.-H. Chen, H. M. Kao
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Although object-oriented programming has been increasingly adopted for software development and many approaches for testing object-oriented programs have been proposed, the issue of reliability of object-oriented programs has not been explored. The objective of this study was to investigate the effectiveness of class testing from the perspective of reliability. The experiments in this study involved testing and measuring the reliability of a C++ program and a Java program. We introduced a class testing technique that exploits the function dependence relationship to reduce the testing effort in subclass testing and in testing polymorphism without degrading the reliability of object-oriented programs. In subclass testing, the impact of function dependence class testing on reliability was compared with two other techniques: exhaustive class testing, which flattens every class and tests every function in the class; and minimal class testing, which tests only new and re-defined functions. The results show that function dependence class testing preserves the same level of program reliability as does exhaustive class testing, while the effort is significant reduced. In polymorphism testing, we conducted an experiment to observe the relationship between the binding coverage and the reliability of the program. The results suggest that testing possible bindings is necessary, and using the function dependence relationship to determine which bindings to cover in testing is sufficient.
Programming agent deliberation: an approach illustrated using the 3APL language
Authors: Mehdi Dastani, Frank de Boer, Frank Dignum, John-Jules Meyer
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper presents the specification of a programming language for implementing the deliberation cycle of cognitive agents. The mental attitudes of cognitive agents are assumed to be represented in an object language. The implementation language for the deliberation cycle is considered as a meta-language the terms of which denote formulae from the object language. Without losing generality, we use the agent programming language 3APL as the object language. Using the meta-deliberation language, one can program the deliberation process of a cognitive agent. We discuss a set of programming constructs that can be used to program various aspects of the deliberation cycle including the planning constructs.
On the two-dimensional differential transform method
Authors: Fatma Ayaz
Venue: Applied Mathematics and Computation (2003)

In this paper, two-dimensional differential transform method of solution of the initial value problem for partial differential equations (PDEs) have been studied. New theorems have been added and some linear and nonlinear PDEs solved by using this method. The method can be easily applied to linear or nonlinear problems and is capable of reducing the size of computational work. In this work, additionally, analytical form solutions of two diffusion problems have been obtained and the solutions are compared very well with those obtained by decomposition method.
Domination Graphs of Tournaments and Digraphs
Authors: David C. Fisher, J. R Lundgren, Sarah K. Merz, K. B Reid
Venue:  (1995)

The domination graph of a digraph has the same vertices as the digraph with an edge between two vertices if every other vertex loses to at least one of the two. Previously, the authors showed that the domination graph of a tournament is either an odd cycle with or without isolated and/or pendant vertices, or a forest of caterpillars. They also showed that any graph consisting of an odd cycle with or without isolated and/or pendant vertices is the domination graph of some tournament. This paper extends these results to oriented graphs. We also show that any caterpillar is the domination graph of some digraph, but a path on four or more vertices is not the domination graph of any tournament. Other results relate the domination graph of a tournament to its positive subtournament defined by fisher and Ryan, and the possible and average number of edges in the domination graph of a tournament.
Race-Condition Detection in Parallel Computation with Semaphores
Authors: Philip N. K Lu, Robert H. B. Netzer
Venue:  (1996)

We address a problem arising in debugging parallel programs, detecting race conditions in programs using semaphores for synchronization. It is NP-complete to detect race conditions in programs that use many semaphores. We show in this paper that it remains NP-complete even if the programs are allowed to use only two semaphores. For the case of single semaphore, Lu, Klein, and Netzer gave the previously only-known polynomial-time algorithm that runs in time $O(n^{1.5}p)$, where $p$ is the number of processors and $n$ is the total number of semaphore operations executed. Their algorithm, however, detects only a special class of race conditions. In this paper we cope with the general race-condition detection problem and give an $O(np\log n)$-time algorithm. The output of our algorithm is a compact representation from which one can determine in constant time whether a race condition exists between two given operations.
Code Size Efficiency in Global Scheduling for ILP Processors
Authors: Huiyang Zhou, Thomas M. Conte
Venue: Proceedings of the Sixth Annual Workshop on Interaction between Compilers and Computer Architectures (2002)

In global scheduling for ILP processors, region-enlarging optimizations, especially tail duplication, are commonly used. The code size increase due to such optimizations, however, raises serious concerns about the affected I-cache and TLB performance. In this paper, we propose a quantitative measure of the code size efficiency at compile time for any code size related optimization. Then, based on the efficiency of tail duplication, we propose the solutions to two related problems: (1) how to achieve the best performance for a given code size increase, (2) how to get the optimal code size efficiency for any program. Our study shows that code size increase has a significant but varying impact on IPC, e.g., the first 2% code size increase results in 18.5% increase in static IPC, but less than 1% when the given code size further increases from 20% to 30%. We then use this feature to define the optimal code size efficiency and to derive a simple, yet robust threshold scheme finding it. The experimental results using SPECint95 benchmarks show that this threshold scheme finds the optimal efficiency accurately. While the optimal efficiency results show an average increase of 2% in code size, the improved I-cache performance is observed and a speedup of 17% over the natural treegion results is achieved.
Fault Tolerant Processor Arrays Based on 1 1/2-Track Switch with Generalized Spare Distributions
Authors: Tadayoshi Horita, Itsuo Takanami
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

As VLSI technology has developed, the interest in implementing an entire or significant part of a parallel computer system using wafer scale integration is growing. The major problem for the case is the possibility of drastically low yield and/or reliability of the system if there is no strategy for coping with such situations.In this paper, we propose a reconfigurable processor array based on the 1 1/2-track switch model (shortly denoted as 1 1/2-TS model) such that spare PEs are not necessarily put around the array, but are more flexibly put in the array by changing connections of spare PEs to nonspare PEs while retaining the connections among nonspare PEs in the same manner as those in 1 1/2-TS model.The proposed model has such a desirable property that physical distances between logically adjacent PEs in the reconfigured array are within a constant, that is, independent of sizes of arrays. We show that the hardware overhead of the proposed model is a little greater than that of 1 1/2-TS model, while the yield of the proposed model is much better than that of 1 1/2-TS model.
Scalable routing schemes for massively parallel processing using reconfigurable optical interconnect
Authors: S. M. P. Yip, N. Bambos
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

We consider the message routing/broadcasting problem in an optically interconnected massively parallel processing system, where each node in the system sends/broadcasts randomly generated packets to others. The network model considered is the reconfigurable optical interconnect (ROI). It is based on the new device capabilities enabled by recent advances in optical technology. A ROI node can use light beams to transmit messages to any other nodes in the network, provided that no others transmit to the same destination concurrently. We present communication schemes that can achieve near optimal throughput with significantly lower delay. The difference in performance for routing is on the order of /spl Omega/(n/sup 2/3/ log log n/log n) when the number of nodes n in the network is large.
An Evaluation of Text Matching Systems for Text Excerpts of Varying Scope
Authors: Gerard Salton, Chris Buckley
Venue:  (1990)

When large text collections must be processed, it is not possible to limit the scope of the subject matter of interest. In such a situation the standard content analysis methods that are based on the use of knowledge bases to represent the relevant subject areas are not applicable. Necessarily, the text themselves must then serve as the main basis for the content analysis operations. Experiments are described in this note designed to evaluate text matching operations for text excerpts of varying scope, including in particular text paragraphs and text sentences extracted from book size materials. The evaluation shows that when the global text similarity between distinct text paragraphs is high, while at the same time local similarities also exist for particular text sentences included in these paragraphs, the presumption is that the paragraphs cover related subject matter. One concludes that text matching systems may prove useful for text linking and information retrieval.
A method for decentralized clustering in large multi-agent systems
Authors: Elth Ogston, Benno Overeinder, Maarten van Steen, Frances Brazier
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional clustering. However, we add the additional constraint that agents must remain in place on a network, instead of first being collected into a centralized database. To do this we connect agents in a random network and have them search in a peer-to-peer fashion for other similar agents. We thus aim to tackle the basic clustering problem on an Internet scale and create a method by which agents themselves can be grouped, forming coalitions. In order to investigate the feasibility of a decentralized approach, this paper presents a number of simulation experiments involving agents representing two-dimensional points. A comparison between our method's clustering ability and that of the k-means clustering algorithm is presented. Generated data sets containing 2,500 to 160,000 points (agents) grouped in 25 to 1,600 clusters are examined. Results show that our decentralized agent method produces a better clustering than the centralized k-means algorithm, quickly placing 95% to 99% of points correctly. The the time required to find a clustering depends on the quality of solution required; a fairly good solution is quickly converged on, and then slowly improved. Overall, our experiments indicate that the time to find a particular quality of solution increases less than linearly with the number of agents.
Designing of curves and surfaces using cubic splines with geometric characterization
Authors: M. Sarfraz
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

A constructive approach has been adopted to build interpolatory and B-spline like cubic spline curves with a more general continuity than /spl beta/-continuity. This method provides not only a large variety of very interesting shape controls like biased, point and interval tensions but, as a special case, also recovers a number of spline methods like /spl nu/-spline of G.M. Nielson (1974), /spl beta/-splines, /spl gamma/-splines of W. Boehm (1995) and weighted /spl nu/-splines. The curve schemes have also been generalized to produce smooth surfaces with local shape control. The local shape control has been achieved by introducing variable shape parameters.
A practical strategy for testing pair-wise coverage of network interfaces
Authors: A. W. Williams, R. L. Probert
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Distributed systems consist of a number of network elements that interact with each other. As the number of network elements and interchangeable components for each network element increases, the trade-off that the system tester faces is the thoroughness of test configuration coverage vs. limited resources of time and expense that are available. An approach to resolving this trade-off is to determine a set of test configurations that test each pair-wise combination of network components. This goal gives a well-defined level of test coverage, with a reduced number of system configurations. To select such a set of test configurations, we show how to apply the method of orthogonal Latin squares, from the design of balanced statistical experiments. Since the theoretical treatment assumes constraints that may not be satisfied in practice, we then show how to adapt this approach to realistic application constraints.
Lessons from the Cyberspace Classroom: The Realities of Online Teaching, 2 edition
Authors: Rena M. Palloff, Keith Pratt
Venue:  (2002)

:Authors Rena Palloff and Keith Pratt have written a comprehensive reference for faculty to use to hone their skills as online instructors and for students to use to become more effective online learners. Filled with numerous examples from actual online courses and insights from teachers and students, Lessons from the Cyberspace Classroom covers the entire online teaching process. This essential guide offers helpful suggestions for dealing with such critical issues as evaluating effective courseware, working with online classroom dynamics, addressing the needs of the online student, making the transition to online teaching, and promoting the development of the learning community.
Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem
Authors: A R Wagner, Yijie Han
Venue:  (1986)

The prefix problem is to compute, for given $x _ 1 , x _ 2 ,\cdots, x _ n$, all the products $x _ 1 ~\bigcirc ~ x _ 2 ~\bigcirc ~ \cdots ~\bigcirc ~ x _ k , 1 \leq k \leq n$, where $\bigcirc$ is an associative operation. The data dependent prefix problem is to perform the task assuming the input sequence given is a linked list. For the data dependent prefix problem, a parallel algorithm is presented. With $p$ processors, the time complexity of our algorithm is $O(\frac {n} {p} + log n~ log \frac {n} {p} )$ on the exclusive read exclusive write computation model. This result raises the number of processors for achieving linear speedup to $p=0(\frac {n} {logn~ loglogn})$ from the previous result of $p > n ^ \epsilon , 0 \leq \epsilon > 1$. The time complexity of our algorithm improves the best previous result of $O(\frac {logn ~~~n} {log(2n/p)p})$. Our results show for the first time that linear speedup can be achieved for the data dependent prefix problem with poly-logarithmic time complexity. A bucket sorting algorithm is also developed to be used as a component of the prefix algorithm. This bucket sorting algorithm sorts $n$ numbers in the range $\{ 1,2,...,m \}$ using $p$ processors. The time complexity for sorting is $O( \lceil \frac {log m} {log (\frac {n} {p} + log p)} \rceil ( \frac {n} {p} + log p))$.
Design of Telephony Services In Lotos
Authors: Jose L Vivas
Venue:  (1994)

The purpose of this thesis is to design and validate a telephony system using the formal description language LOTOS and a series of tools provided by the Lotosphere Integrated Tool Environment, LITE. The starting point is a requirements document containing a series of informal specifications of services common to modern telephony systems. Special emphasis has been laid on choosing a design that simplifies the integration of additional telephone services in the specification. Most design decisions were thus taken with the purpose of creating an environment that could help different designers to develop distinct functionalities without the need for each one to be acquainted with other existing features in the system. To this end, the design was structured in a fashion that might enhance the extensibility of the system, as well as prevention and detection of incompatibilities between different features. A methodology is thus proposed for dealing with what is commonly known as the feature interaction problem for telephony systems.
Automata on Guarded Strings and Applications
Authors: Dexter Kozen
Venue:  (2001)

Guarded strings are like ordinary strings over a finite alphabet P, except that atoms of the free Boolean algebra on a set of atomic tests B alternate with the symbols of P. The regular sets of guarded strings play the same role in Kleene algebra with tests as the regular sets of ordinary strings do in Kleene algebra. In this paper we develop the elementary theory of finite automata on guarded strings, a generalization of the theory of finite automata on ordinary strings. We give several basic constructions, including determinization, state minimization, and an analog of Kleene''s theorem. We then use these results to verify a conjecture on the complexity of a complete Gentzen-style sequent calculus for \partial correctness. We also show that a basic result of the theory of Boolean decision diagrams (BDDs), namely that minimal ordered BDDs are unique, is a special case of the Myhill-Nerode theorem for a class of automata on guarded strings.
Constant Propagation with Conditional Branches
Authors: Mark N. Wegman, F. K Zadeck
Venue:  (1991)

Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that are constant on all possible executions of a program and to propagate these constant values as far forward through the program as possible. Expressions whose operands are all constants can be evaluated at compile time and the results propagated further. Using the algorithms in this paper can produce smaller and faster compiled programs. The same algorithms can be used for other kinds of analyses (e.g. type determination). We present four algorithms in this paper, all {\it conservative} in the sense that all constants may not be found, but each constant found is constant over all possible executions of the program. These algorithms are among the simplest, fastest, and most powerful global constant propagation algorithms known. A new algorithm is also presented that performs a form of interprocedural data flow analysis in which aliasing information is gathered in conjunction with constant propagation. Several variants of this algorithm are considered.
A Polynomial Time Algorithm for Reconfiguring the 1 1/2 Track-Switch Model with PE and Bus faults
Authors: Tadayoshi Horita, Itsuo Takanami
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

As VLSI technology has developed, the interest in implementing an entire or significant part of a parallel computer system using wafer scale integration is growing. The major problem for the case is the possibility of drastically low yield and/or reliability of the system if there is no strategy for coping with such situations. Various strategies to restructure the faulty physical system into the fault-free target logical system are described in the literature. These restructures are performed using interconnection networks consisting of links and switches. Then the reliabilities of the systems depend on those of PEs and the interconnection networks. However, as far as we know, there are few studies considering the simultaneous faults of PEs and interconnection links. In this paper, by extending the Roychowdhury's algorithm, we propose a polynomial time algorithm for reconfiguring the 1 1/2 track-switch model compensating for simultaneous PEs and buses faults. Keywords- mesh arrays, fault-tolerance, polynomial time algorithm, wafer scale integration, the 1\frac{1}{2} track-switch model
Prediction of workability of concrete incorporating metakaolin and PFA using neural networks
Authors: J. Bai, S. Wild, A. Ware, B. B. Sabir
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper presents neural networks for the prediction of workability of concrete incorporating metakaolin (MK) and pulverised-fuel ash (PFA). The neural network models are validated using independent data sets and give high prediction accuracy. The predictions produced reflect the effect of variations in pozzolanic replacement of portland cement (PC) by graduated replacement levels of up to 15% metakaolin and 40% PFA. The results show that the models developed are reliable and accurate and they can be used to predict the workability parameters of slump, compacting factor and Vebe time across a wide range of Portland cement-PFA-MK. These demonstrate that using neural networks to predict concrete workability is practical and beneficial.