ppxscal/embedding_network huggingface dataset:
Using QDL to Specify QoS Aware Distributed (QuO) Application Configuration
Authors: Partha Pal, Joseph Loyall, Richard Schantz, John Zinky, Rich Shapiro, James Megquier
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Recent work in opening up distributed object systems to make them suitable for applications needing quality of service control has had the side effect of increasing the complexity in setting up, configuring, and initializing such applications. Configuration of distributed applications is more complicated than that of non-distributed applications, simply because of the heterogeneous and distributed nature of the application's components. CORBA and other distributed object middleware simplifies the configuration of distributed object applications, but hides much of the information and control necessary to achieve quality of service (QoS).This paper describes the techniques and tools that we have developed within our Quality Objects (QuO) framework for simplifying the configuration of distributed applications with QoS attributes. We describe a QuO configuration language, as well as the specific configuration needs of particular QoS properties - real-time, security, and dependability - and the support we provide for them.
Incorporating Relevancy Testing in SATCHMO
Authors: S D Wilson, W D Loveland
Venue:  (1989)

We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. SATCHMO is essentially a forward-chaining prover applicable to potential theorems (refutations) where forward chaining infers variable-free literals. The version of SATCHMO considered here uses PROLOG on the Horn clause subset and forward chains only on clauses with more than one inferred (or head) literal, i.e. non-Horn clauses. The relevancy mechanism presented here marks potentially useful head literals as relevant. We are able to insist that all the head literals be marked relevant (be ``totally relevant'''') before the clause is used for forward chaining and do this without extending the proof search beyond what is done in SATCHMO.
Changing the ordering of Gröbner bases with LLL: case of two variables
Authors: Abdolali Basiri, Jean-Charles Faugère
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present an algorithm for the transformation of a Gröbner basis of an ideal with respect to any given ordering into a Gröbner basis with respect to any other ordering. This algorithm is based on a modified version of the LLL algorithm. The worst case theoretical complexity of this algorithm is not better than the complexity of the FGLM algorithm; but can also give the theoretical complexity with some parameters depending on the size of the output. When the output is small then algorithm is more efficient. We also present a first implementation of the algorithm in Maple. This algorithm is restricted to the case of two variables but works also in positive dimension.
Beyond Simple Rule Extraction: The Extraction of Planning Knowledge from Reinforcement Learners
Authors: Ron Sun
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

This paper will discuss learning in hybrid models that goes beyond simple rule extraction from backpropagation networks. Although simple rule extraction has received a lot of research attention, to further develop hybrid-learning models that include both symbolic and sub-symbolic knowledge and that learn autonomously, it is necessary to study autonomous learning of both sub-symbolic and symbolic knowledge in integrated architectures. This paper will describe knowledge extraction from neural reinforcement learning. It includes two approaches to wards extracting plan knowledge: the extraction of explicit, symbolic rules from neural reinforcement learning, and the extraction of complete plans. This work points to the creation of a general framework for achieving the sub-symbolic to symbolic transition in an integrated autonomous learning framework.
AUTOMATED PARALLELIZATION OF TIMED PETRI-NET SIMULATIONS
Authors: David M. Nicol, Weizhen Mao
Venue:  (1993)

Timed Petri-nets are used to model numerous types of large complex systems, especially computer architectures and communication networks. While formal analysis of such models is sometimes possible, discrete-event simulation remains the most general technique available for assessing the model''s behavior. However, simulation''s computational requirements can be massive, especially on the large complex models that defeat analytic methods. One way of meeting these requirements is by executing the simulation on a parallel machine. This paper describes simple techniques for the automated parallelization of timed Petri-net simulations. We address both the issue of processor synchronization, as well as the automated mapping, static and dynamic, of the Petri-net to the parallel architecture. As part of this effort we describe a new mapping algorithm, one that also applies to more general parallel computations. We establish analytic properties of the solution produced by the algorithm, including optimality on some regular topologies. The viability of our integrated approach is demonstrated empirically on the Intel iPSC/860 and Delta architectures using many processors. Excellent performance is observed on models of parallel architectures.
Dynamical response of steel deck composite slabs with geometric orthotrophy subjected to human rhythmic activities
Authors: J. G. S. da Silva, P. C. G. da S. Vellasco, S. A. L. de Andrade
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The competitive trends of the world market have long been forcing structural engineers to develop minimum weight and labour cost solutions. A direct consequence of this new design trend is a considerable increase in problems related to unwanted floor vibrations. This phenomenon is very frequent in a wide range of structures subjected to rhythmic dynamical loads, generally caused by human activities such as: musical, sporting events, dance or even gymnastics. The main objective of this paper is to incorporate the orthotropic solution for the concrete slabs with steel decks subjected to rhythmic dynamical actions. This investigation focused on the use of different steel deck geometries and their influence in the dynamical response of commonly used composite floors.
A Hopfield-Type Neural Network Used for Remote Sensing Images with Variational Principle
Authors: Shang-Ming Zhou
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In remote sensing image processing, image approximation, or to obtain a high-resolution imageequivalently from a corresponding low-resolution image is an ill-posed inverse problem. In this paper, with the consideration of the constraints on smoothness and discontinuity, the regularization method is used to convert image approximation problem into a solvable variational problem. Furthermore, a Hopfield-type dynamic neural network is proposed to solve the variational problem. This neural network possesses two kinds of states describing the discrepancy of a pixel with adjacent pixels and the intensity evolution of a pixel and two kinds of corresponding weights. The experimental results obtained in this study under free noise added Landsat TM image and noisy image cases show that the proposed approach are better than those by the three previous ones used for comparison indicating its feasibility.
Ace the IT Job Interview!
Authors: Paula Moreira
Venue:  (2002)

:Winning strategies for getting hired as an IT professional Wondering how to stand out from the crowd and land the IT job you really want? Now you can go behind the scenes of the IT interview process and get inside the mind of potential employers using this insightful and practical guide. Learn what today's IT hiring managers are looking for and get expert tips for preparing yourself for the interview process -- from start to finish. Including off-the-record advice from hiring managers in key technology areas, Paula Moreira shows you how to get past human resources, make a great first impression, ace standard technical interview questions, avoid common mistakes, and much more. From overcoming pre-interview jitters to writing first-rate thank-you letters and negotiating salary, she can boost your chances of getting hired. Her ultimate interview reference also contains a handy section with job descriptions, qualifications checklists, and more than 500 sample interview questions for key IT jobs -- including network administrators, Web designers, programmers, desktop support, consultants, and more. Prepare with more than 500 frequently used interview questions -- including sample answers hiring managers want to hear Research potential employers -- and learn the six things you should know about the company before the interview Present your skills effectively and position yourself for the job you want Discover phone tips for getting through to the right hiring person Learn which questions you should always ask at the end of an interview Pick up strategies for scheduling next steps -- including thank-you notes, references, and second interviews Get proven advice on evaluating job offers and negotiating salary Find additional strategies at the companion Web site Includes free online assessment from BrainBench
Static Analysis of Aliases and Side Effects in Higher-Order Languages
Authors: Anne Neirynck
Venue:  (1988)

In recent years, there has been substantial interest in the development of programming languages for new parallel architectures. A basic design conflict arises because languages with simple semantics tend to use storage inefficiently, whereas languages allowing the programmer to access storage explicitly are difficult to analyze. We present a compile-time estimation scheme for determining whether an expression in an imperative language either uses or updates the store. We also determine the aliasing behavior of expressions and in general, we can tell whether the evaluation of two expressions interfere. Current interprocedural dataflow techniques for aliasing and side effect inference are valid for first-order languages. Our inference schemes provide information about aliasing and side effects in a higher-order expression language with call-by-value semantics. The higher order character of the language represents only a partial obstacle. On the other hand, the presence of l-valued expressions has the consequence that aliasing information must be computed for all expressions, and cannot be represented as a relation among identifiers. Furthermore, the introduction of pointers make aliasing and side effects flow-dependent properties. Abstract interpretation techniques allow us to define compositional static inference schemes for aliasing and side effects, which can be proved sound with respect to the standard semantics by structural induction. The abstract interpretation functions are easy to modify, in case a different type of information is requested. We also discuss how different language features may affect the static analyses, simplifying them or making them untractable. The abstract interpretation functions implicitly define static inference algorithms, which can easily be implemented by an attribute grammar, or any other tool capable of performing computations on the abstract syntax tree. The accuracy of these algorithms is better than for the dataflow ones, because we make use of control flow information. Our algorithms also compare favorably in complexity, but the dataflow approach is probably cheaper in most practical settings. In addition, our schemes can give information even in the presence of dynamically allocated data structures.
Mining User Moving Patterns for Personal Data Allocation in a Mobile Computing System
Authors: Wen-Chih Peng, Ming-Syan Chen
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In this paper, we devise a new data mining algorithm which involves mining for user moving patterns in a mobile computing environment, and utilize the mining results to develop data allocation schemes so as to improve the overall performance of a mobile system. First, we devise an algorithm to capture the frequent user moving patterns from a set of log data in a mobile environment. Then, in light of mining results of user moving patterns and the properties of data objects, we develop data allocation schemes for proper allocation of personal data. Two personal data allocation schemes, which explore different levels of mining results, are devised: one utilizes the set level of moving patterns and the other utilizes the path level of moving patterns. Performance of these data allocation schemes is comparatively analyzed. It is shown by our simulation results that the user moving patterns is very important in devising effective data allocation schemes, which can lead to significant performance improvement in a mobile computing system.
The Design and Deployment of a Mobility Supporting Network
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

GEMS (Generic Environment for Mobility Support) is a new project at the State University of New York, Binghamton for exploring essential mechanisms to support mobile users. (GEMS is funded in part by the Center for Computing Technologies at SUNY, Binghamton comprising Loral Federal Systems (formerly IBM), NYSEG and Hughes) In many cases, mobile users require access to the same (or similar) resources irrespective of their location, e.g. the same file system. Yet, there exist other situations in which the most relevant resource (or information) is necessarily location dependent, e.g. nearest printer or weather information. The GEMS project aims to provide an environment with appropriate support for both kinds of situations. It also addresses the case when a mobile user may not have traditional network connectivity (e.g. TCP/IP) but may be reachable through other means, such as a paging device. This paper presents our design of a comprehensive mobility supporting network, current status of the project, a description of ongoing work and future directions.
Tabular application development
Authors: T. Damij
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Summary form only given. The work represents an effective approach called tabular application development (TAD). TAD is a new approach, because it introduces a new idea for developing the application by creating several tables. It has nine phases. The first phase of TAD defines the problem to be solved by organizing interviews with all users. The second phase deals with the business processes of the organization. The third phase of TAD builds the process model. The fourth phase transforms the user's models into stable data structures. The fifth phase identifies the objects of the system. The sixth phase builds the object model. The seventh phase deals with analyzing and defining the outputs of the application. The eighth phase has two steps. The first step develops a model of the application using the information existing in the activity and entity tables and the second step deals with creating the algorithms of the application. The last phase is the implementation. In this phase we convert the objects into classes and the operations into methods. Furthermore, we generate a code according to the method specifications and to the defined algorithms.
ERUF: Early Regulation of Unresponsive Best-Effort Traffic
Authors: Anand Rangarajan, Anurag Acharya
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

In this paper, we propose router mechanisms to regulate unresponsive best-effort traffic. By unresponsive traffic we mean flows that do not reduce their sending rate in response to congestion. The goal of the proposed mechanisms is to drop undeliverable packets as close to the periphery of the network as possible. The key ideas of our approach are: (1) edge routers keep track of incoming flows and their arrival rates; (2) core routers use RED for queue management and generate rate-limited source quenches on packet drops to advice sources to reduce their sending rates; and (3) edge routers snoop on source quenches passing through them and use them to control per-flow regulators. Regulators adjust their maximum sending rate using a multiplicative-decrease, additive-increase discipline. A decrease is triggered by the arrival of a source quench; an increase is triggered by non-arrival of source quenches for a time period. We examine the impact of these mechanisms for a variety of simulated network topologies and traffic patterns.
A Touring Machine: Prototyping 3D Mobile Augmented Reality Systems for Exploring the Urban Environment
Authors: Steven Feiner, Blair MacIntyre, Tobias Hollerer, Anthony Webster
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

We describe a prototype system that combines together the overlaid 3D graphics of augmented reality with the untethered freedom of mobile computing. The goal is to explore how these two technologies might together make possible wearable computer systems that can support users in their everyday interactions with the world. We introduce an application that presents information about our university's campus, using a head-tracked, see-through, headworn, 3D display, and an untracked, opaque, handheld, 2D display with stylus and trackpad. We provide an illustrated explanation of how our prototype is used, and describe our rationale behind designing its software infrastructure and selecting the hardware on which it runs.
Partial Objects in Constructive Type Theory
Authors: Robert L. Constable, Scott F Smith
Venue:  (1987)

Constructive type theories generally treat only total functions; partial functions present serious difficulties. In this paper, a theory of partial objects is given which puts partial functions in a general context. Semantic foundations for the theory are given in terms of a theory of inductive relations. The domain of convergence of a partial function is exactly characterized by a predicate within the theory, allowing for abstract reasoning about termination. Induction principles are given for reasoning about these functions, and comparisons are made to the domain theoretic account of LCF. Finally, an undecidability result is presented to suggest connections to a subset of recursive function theory.
Does Q=MC2? (On the Relationship Between Quality in Electronic Design and the Model of Colloidal Computing)
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

This paper introduces colloidal computing as an alternative to the classical view on computing systems in terms of design feasibility, application adaptability and better energy-performance trade-offs. In colloidal computing, simple computational particles are dispersed into a communication medium which is inexpensive, (perhaps) unreliable, yet sufficiently fast. This type of clustering into computationally intensive kernels with loose inter-particle communication, but tight intra-particle communication is typical not only for the underlying hardware, but also for the actual application which runs on it. We believe that the colloidal model is appropriate to describe the next generation of embedded systems. For these systems, a significantly better design quality can be obtained via run-time trade-offs and application-driven adaptability, as opposed to classical systems where optimizations are sought in a rather statical manner.
Search and Retrieval Experiments in Real-Time Information Retrieval
Authors: Gerard Salton
Venue:  (1968)

Future operating document retrieval systems may be based on fully-automatic information analysis methods instead of manual indexing, and on real-time search procedures which allow the user to interact with the system during the search process. Performance characteristics are first given for fully-automatic information retrieval systems, and comparisons are made with presently operating partly-manual systems. Thereafter, various user-controlled search strategies are described, and the potential of these strategies in improving systems performance is discussed. The evaluation results for the real-time retrieval procedures are used to derive design criteria for future automatic information systems.
Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network
Authors: Raghupathy Sivakumar, Tae-Eun Kim, Narayanan Venkitaraman, Jia-Ru Li, Vaduvur Bharghavan
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Corelite is a Quality of Service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: (a) the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow, (b) weighted fair marker feedback at the core routers upon incipient congestion detection, and (c) linear increase/multiplicative decrease based rate adaptation of packet flows at the edge routers in response to marker feedback.
BAGS: The Brown Animation Generation System
Authors: Paul S Strauss
Venue:  (1988)

BAGS is a system for the production of three-dimensional computer animation. It is also a testbed for research into techniques used within animation systems. The combination of these aspects in one animation system is made possible by a modular design, in the center of which lies SCEFO, a general language for animation specification. SCEFO serves as the interface between the modeling and rendering components of BAGS, allowing these distinct processes to be independent. This decoupling of modeling and rendering permits a variety of modeling and rendering techniques to be incorporated in the system. The use of an object-oriented paradigm also contributes to this flexibility. The use of BAGS as a framework for research has resulted in the development of a realistic lighting model and two extensions to the ray-tracing rendering technique. The first extension implements an area-sampling solution to the aliasing problem inherent in ray tracing, without requiring a special model or complex object intersection procedures. The second extension, which is similar in form to the first, incorporates caustics, the interplay of light between objects.
Structuring Z Specifications with Views
Authors: Daniel Jackson
Venue:  (1994)

A view is a partial specification of a program, consisting of a state space and a set of operations. A full specification is obtained by composing several views, linking them through their states (by asserting invariants across views) and through their operations (by defining external operations as combinations of operations from different views). By encouraging multiple representations of the program''s state, view structuring lends clarity and terseness to the specification of operations. And by separating different aspects of functionality, it brings modularity at the grossest level of organization, so that specifications can accommodate change more gracefully. View structuring in Z is demonstrated with a few small examples. The features of Z that make it especially well suited to composing views are discussed, along with some hints for adapting other languages to the purpose.
The Essence of Distributed Snapshots
Authors: K. M Chandy
Venue:  (1989)

No abstract available.