ppxscal/embedding_network huggingface dataset:
A mini-product-form-based solution to data-delay evaluation in wireless integrated voice/data networks
Authors: J. E. Wieselthier, A. Ephremides
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Although the product-form solution provides an accurate characterization of equilibrium voice-traffic behavior in wireless integrated voice/data networks, it does not directly provide a method to evaluate data-packet delay. However, examination of each link separately in a manner that incorporates interaction with the rest of the network permits one to take advantage of the wireless nature of the network and obtain a three-flow characterization of each link, which also satisfies a product-form solution and is hence termed a "mini-product-form" solution. By matching the values of these flows, which are natural to the wireless network, to the average values obtained from the product-form solution of the entire network, the authors obtain a three-dimensional Markov chain characterization of the voice occupancy state on the link, which permits a simpler evaluation of data-packet delay. A further reduction is possible by converting the three-dimensional chain to a single-dimensional one.
Modelling of piezolaminated plates using layerwise mixed finite elements
Authors: R. Garcia Lage, C. M. Mota Soares, C. A. Mota Soares, J. N. Reddy
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with the development of a layerwise finite element model for piezo-laminated plate structures. A Reissner mixed variational equation is used to derive the governing equations, using transverse stresses, transverse electrical displacement, displacement components and electrical potential as primary variables. The present model in contrast with the standard layerwise displacement finite elements fulfils the continuity of all primary variables at the interface between adjacent layers. Only the layers in-plane stress components and corresponding electric displacements are evaluated by post-processing through the piezolaminated constitutive equations. The applicability and performance of the proposed model is illustrated with an example. The predictions of the primary variables and the efficiency of the model mainly related with the interlaminar stresses are discussed and compared with alternative three-dimensional solutions.
Modeling use of enterprise resource planning systems: a path analytic study
Authors: Shantanu Bagchi, Shivraj Kanungo, Subhasish Dasgupta
Venue: European Journal of Information Systems (2003)

In this research, we evaluated user participation and involvement in the context of enterprise resource planning (ERP) systems. Since ERP systems are enterprisewide in scope, these systems have a high level of complexity, and require a different implementation methodology. While most studies analyze implementation at an organization or industry level, there is a dearth in research in ERP system adoption at the individual or user level. In our study, we examine ERP system acceptance at the individual level. In this research, we expected to find differences in the nature of user participation and involvement in ERP compared to other information systems. Using Barki and Hartwick's extension of the theory of reasoned action, a revised model was developed and tested empirically. While Barki and Hartwick's model explains user behavior vis-à-vis user participation and involvement, a more parsimonious model demonstrates that usage dynamics in ERP implementation are different. We complemented our statistical analysis by three case studies. Based on our results we believe that, given the nature of ERP and its implementation, traditionally formalized links between influencers of users' attitude and involvement may need to be revised. We have discussed why we need to seek alternate forms of influencers. In doing so, we suggest that investments be made in preparatory work practices and employee development prior to ERP decisions. Such investments are complementary to information technology and are widespread throughout the firm. We believe that such investments will play a significant role in influencing the attitude of users toward any system and also their involvement.
A Fine-Grain Phased Logic CPU
Authors: Robert B. Reese, Mitchell A. Thornton, Cherrice Traver
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

A five-stage pipelined CPU based on the MIPs ISA ismapped to a self-timed logic family known as PhasedLogic (PL).The mapping is performed automaticallyfrom a netlist of D-Flip-Flops and 4-input Lookup Tables(LUT4s)to a netlist of Phased Logic gates.Each PL gateimplements a 4-input Lookup Table in addition to controllogic required for the PL control scheme. PL offers aspeedup technique known as Early Evaluation that can beused to boost performance at the cost of additional PLgates. Several different PL gate-level implementations areproduced to explore different architectural tradeoffsusing early evaluation. Simulations run for fivebenchmark programs show an average speedup of 1.48over the clocked netlist at the cost of 17% additional PLgates .
Query Optimisation in a Complex Network
Authors: George Semeczko
Venue:  (1993)

In distributed database design, the problem of query optimisation is an important one. In a distributed database system queries are optimised to reduce either communication costs or response time. As the creation of queries and the state of a database system are not static, it is often desired that query optimisers should be executed at run time and not run as a compiling process at design time. Therefore it is desirable that query optimisers not only return an efficient query plan but also carry out the query optimisation efficiently. In this paper we take an existing query optimisation algorithm and show how it can be executed more efficiently. This is done by reducing the complexity of the algorithm by using knowledge about the network configuration.
Efficient Parallelism vs Reliable Distribution: a Trade-off for Concurrent Computations
Authors: Paris C. Kanellakis, Dimitris Michailidis, Alex A. Shvartsman
Venue:  (1994)

Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive trade-off: efficiency requires removing redundancy from computations whereas reliability requires some redundancy. We survey a spectrum of algorithmic models (from fail-stop, synchronous to asynchronous and from approximate to exact computations) in which reliability is guaranteed with small trade-offs in efficiency. We illustrate a number of cases where optimal trade-offs are achievable. A basic property of all these models, which is of some interest in the study of concurrency, is that ``true'''' read/write concurrency is necessary for fault tolerance. In particular, we outline how algorithms can be designed so that, in each execution, the total ``true'''' concurrency used can be closely related to the faults that can be tolerated.
Using fuzzy set theory (FST) in selecting a suitable foundation type
Authors: H. K. Amin, K. M. El Zahaby, M. A. Taha, A. S. Bazaraa
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

In this paper, fuzzy set analysis is used as a tool to find a suitable foundation type for a given site with known characteristics. A set of 23 fuzzy variables, covering 6 main subgroups is used in the current analysis. The proposed development is implemented using a total of (84) projects, which has been collected from 6 major consulting offices in Egypt. An interactive, structured, FORTRAN computer program is prepared for the analysis. A parametric study is also performed. The results are logical, useful and can be easily utilised by geotechnical engineers to help them select a suitable foundation type.
Unusual Stabilized Finite Element Methods and Residual-Free-Bubbles
Authors: L. P. Franca, C. Farhat, M. Lesoinne, A. Russo
Venue:  (1996)

An overview of the unusual stabilized finite element method and of the standard Galerkin method enriched with residual-free-bubble functions is presented. For the first method a concrete model problem illustrates its application in advective-diffusive-reactive equations and for the second method it is shown how static condensation of residual-free-bubbles gives rise to mass lumping and selective reduced integration, which are viewed as numerical tricks and can now be derived by the standard Galerkin method without tricks.
GMRES vs. ideal GMRES
Authors: Toh Kim-Chuan
Venue:  (1995)

\begin{abstract} \noindent The GMRES algorithm minimizes $\norm{p(A)b}$ over polynomials $p$ of degree $n$ normalized at $z=0$. The ideal GMRES problem is obtained if one considers minimization of $\norm{p(A)}$ instead. The ideal problem forms an upper bound for the worst-case true problem, where the GMRES norm $\norm{p_b(A)b}$ is maximized over $b$. In work not yet published, Faber, Joubert, Knill and Manteuffel have shown that this upper bound need not be attained, constructing a $4 \times 4$ example in which the ratio of the true to ideal GMRES norms is $0.9999$. Here, we present a simpler $4 \times 4$ example in which the ratio approaches zero when a certain parameter tends to zero. The same example also leads to the same conclusion for Arnoldi vs. ideal Arnoldi norms. \end{abstract} 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 Omniscient Scheduling Oracle for Systems with Harmonic Periods
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides schedules for periodic task sets with harmonic periods and variable resource requirements. Three different job value functions are described and implemented. Each corresponds to a different system goal. The oracle is used to examine the performance of different on-line schedulers under varying loads, including overload. We have compared the oracle against Rate Monotonic Scheduling, Statistical Rate Monotonic Scheduling, and Slack Stealing Job Admission Control Scheduling. Consistently, the oracle provides an upper bound on performance for the metric under consideration.
Interaction with the Reorderable Matrix
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well they perform a simple task of finding correlating attributes. Visualizing a set of data is a common task in various activities such as decision-making or opinion-forming. Typical situations are a person making business-related decisions, a doctor examining test results of a patient or an engineer making choices between different constructs. All these situations involve examining complex data interactions in a limited time. In this experiment the participants were interacting with the Reorderable Matrix for the first time and tried to find correlating attributes from an unfamiliar set of data.
Pragmatic Study of Parametric Decomposition Models for Estimating Software Reliability Growth
Authors: Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

Numerous stochastic models for the software failure phenomenon based on Nonhomogeneous Poisson Process (NHPP) have been proposed in the recent three decades. Although these models are quite helpful for software developers and have been widely applied in the industrial organizations or research centers, we still need to do more works on examining/estimating the parameters of existing software reliability growth models (SRGMs). In this paper, we investigate and account for three possible trends of software fault detection phenomenon during the testing phase: increasing, decreasing and steady state. We present empirical results from the quantitative studies on evaluating the fault detection process and develop a valid time-variable fault detection rate model which has the inherent flexibility of capturing a wide range of possible fault detection trends. The applicability of the proposed model and the related methods of parametric decomposition are illustrated through several real data sets from different software projects. Our evaluation results show that the analytic parametric decomposition approach for SRGM have a fairly accurate predicting capability. In addition, the testing-effort control problem based on the proposed model is also demonstrated.
Identifying objects using cluster and concept analysis
Authors: Arie Deursen, T. Kuipers
Venue:  (1998)

Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data structures tend to grow over time, and may contain many unrelated fields at the time of migration. We propose a method for identifying objects by semi-automatically restructuring the legacy data structures. Issues involved include the selection of record fields of interest, the identification of procedures actually dealing with such fields, and the construction of coherent groups of fields and procedures into candidate classes. We explore the use of cluster and concept analysis for the purpose of object identification, and we illustrate their effect on a 100,000 LOC COBOL system. Furthermore, we use these results to contrast clustering with concept analysis techniques.
Job-Shop Scheduling in Localizer
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (1998)

Localizer is a domain-specific language for developing local search procedures. By automating many of the tedious tasks underlying local search algorithms, Localizer was shown to reduce the development time significantly and to preserve most of efficiency of specialized algorithms on applications such as Boolean satisfiability and graph coloring. This paper applies Localizer to job-shop scheduling to provide evidence that it can scale up to more sophisticated applications. It presents two Localizer model: an array-based model and a model based on graph-theoretic concepts. This last model illustrates how advanced data types make the statement even closer to the application, while not degrading performance. Both models find optimal or near optimal solutions to standard scheduling benchmarks quickly (from 20 to 90 seconds) on a modern workstation. The underlying implementation techniques are also described.
On decomposition for incomplete data
Authors: Rafał Latkowski
Venue: Fundamenta Informaticae (2002)

In this paper we present a method of data decomposition to avoid the necessity of reasoning on data with missing attribute values. This method can be applied to any algorithm of classifier induction. The original incomplete data is decomposed into data subsets without missing values. Next, methods for classifier induction are applied to these sets. Finally, a conflict resolving method is used to obtain final classification from partial classifiers. We provide an empirical evaluation of the decomposition method accuracy and model size with use of various decomposition criteria on data with natural missing values. We present also experiments on data with synthetic missing values to examine the properties of proposed method with variable ratio of incompleteness.
Adaptive Distributed Computing through Competition
Authors: Kam Hong Shum
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

In this paper, a framework for supporting adaptive execution of parallel applications in networks of workstations is presented. The framework is comprised of two levels of competition. At the first level, the tasks of each application are partitioned into grains. The grains race one another until all their tasks are finished. The turn-around time of an application can be shortened by sharing the tasks of the heavily loaded grains with the neighboring grains. At the second level, a prototype system called Comedians has been developed, which enables competition among applications for workstations by mechanisms of auction and bidding. The objectives of the Comedians system are to maximize the speedup of individual parallel applications and, at the same time, to allocate workstations efficiently and fairly to the applications. Unlike all related work, this paper suggests an integrated solution to both the issues of adaptive parallelism and parallel application scheduling in a multi-user environment. The experimental results demonstrate the effectiveness of the support for adaptive parallelism and the dynamics of competition among parallel applications.
A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
Authors: Samantha Ranaweera, Dharma P. Agrawal
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Optimal scheduling of tasks represented by a directed acyclic graph (DAG) onto a set of homogeneous processors is a strong NP-hard problem. In this paper, we introduce a scalable scheduling scheme called STDS for heterogeneous systems. This implies that tasks could potentially have different run times on different processors. The complexity of STDS is. (V 2) where v is the number of nodes in the task graph. Schedule length is primarily reduced by selected task duplication. Current task duplication based scheduling schemes are mostly done for homogeneous systems. Comparing the performance of STDS with BIL, another scheduling scheme for heterogeneous systems, it is observed that STDS obtained speed-ups of 6 to 40 generating shorter schedules when sufficient duplication can be carried out.
A Method of Constructing Dynamic Schema Representing the Structure of Semistructured Data
Authors: Teruhisa Hochin, Tatsuo Tsuji
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The structure of semistructured data is strongly required to be obtained in order to query on a large amount of semistructured data, whereas the structure can not be defined aprior. Data Guides and shape have been proposed to represent the structure of semistructured data. As these can behave as schema in the point of view of representing the structure of data, and are changed according to the existence of objects, these are called dynamic schema in this paper. This paper proposes the semi-dynamic construction method of the dynamic schema. The proposed method uses versions of the dynamic schema. Several versions are kept in the system. Each version of the dynamic schema keeps the objects required to construct its next version from it in a list. The correct dynamic schema can easily be constructed by using the versions of dynamic schema and the lists of objects. The performances in deriving the shape, and inserting and deleting objects are experimentally evaluated. Experimental results show that the proposed method is effective in the case that the retrieval is more frequently occurred than the deletion.
A Logic-Programming Approach to All-Paths Parsing
Authors: Robert P. Goldman
Venue:  (1990)

In this paper we show how all-paths parsing can be smoothly integrated into a unified semantic and pragmatic framework based on forward-chaining logic-programming. This approach combines the advantages of logic-programming parsing approaches with those of Tomita''s efficient all-paths-parsing technique. The efficient representation of dependency-directed breadth-first search makes it well suited for systems that integrate syntactic processing with semantics and pragmatics. 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
SPAM: a data forwarding model for multipoint-to-multipoint connection support in ATM networks
Authors: S. Komandur, D. Mosse
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Many distributed multimedia applications involve data delivery from a source to multiple destinations, the participating nodes forming a multicast group. In the naive solution, separate connections can be established from each source to other group members. However a tree can be established for each source with the participants as the leaf nodes or just have one tree spanning all the participants. In this paper, we introduce the data forwarding model to support such shared multicast trees over the ATM networks called SPAM (a Simple Protocol for ATM Multicast). The authors work allow the wide area multicast protocols (like CBT and PIM) to be supported in ATM networks. Further, SPAM improves the error detection and allows for leaf initiated join of UNI 4.0.
Design Decision Trees
Authors: Alexander Ran, Juha Kuusela
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

This paper proposes a formalism to be used as a systematic approach to incrementally document, refine, organize and reuse the architectural knowledge for software design. The formalism is a hierarchical organization of design patterns into a Design Decision Tree (DDT) that is a partial ordering of design decisions put in the context of the problem requirements and the constraints imposed by earlier decisions. Our model supports the representation of the essential problems that recur in the domain, knowledge of alternative solutions to these problems and the implications of the solutions. This model integrates architectural knowledge of software design into a software development process.
A Pattern Language for Efficient, Predictable, Scalable, and Flexible Dispatching Mechanisms for Distributed Object Computing Middleware
Authors: Irfan Pyarali, Carlos O'Ryan, Douglas C. Schmidt
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In many application domains, the distributed object computing (DOC) middleware is responsible for dispatching upcalls to one or more application objects when events or requests arrive from clients. Implementing efficient, predictable, and scalable middleware dispatching mechanisms is hard and implementing them for multi-threaded systems is even harder. In particular, dispatching mechanisms must be prepared to dispatch upcalls to multiple objects, to handle recursive requests originated from application-provided upcalls, and must often collaborate with the application to control object' life-cycle.In our DOC middleware research we have implemented many dispatching mechanisms that repeatedly apply common solutions to solve the challenges outlined above. Moreover, we have discovered that the forces constraining dispatching mechanisms often differ slightly, thereby requiring alternative solutions.This paper presents two contributions to the design and implementation of efficient, predictable, scalable, and flexible DOC middleware and applications. First, it shows how patterns can be applied to the object-oriented systems to capture key design and performance characteristics of proven dispatching mechanisms. Second, it presents a pattern language that describes successful solutions that are appropriate for key dispatching challenges that arise in various real-time DOC middleware and applications.