ppxscal/embedding_network huggingface dataset:
Measuring strategic alignment in small firms
Authors: A. J. Hale, P. B. Cragg
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Despite general acceptance of the benefit of aligning IS strategy with organisation strategy, few attempts have been made to define and quantify this alignment relationship. Furthermore, past attempts have largely neglected the specific considerations of small firms. Chart's (1992) instruments were adapted for use in small firms and rigorously tested using eight case firms, from four different industries. The resulting instrument is a significant step towards providing a method for the measurement of strategic alignment. It may prove useful in IS planning by managers and consultants, and by researchers studying the impact of information systems on the performance of small firms.
Combining Grammars For Improved Learning
Authors: Glenn Carroll, Eugene Charniak
Venue:  (1994)

We report experimental work on improving learning methods for probabilistic context-free grammars (PCFGs). From stacked regression we borrow the basic idea of combining grammars. Smoothing, a domain-independent method for combining grammars, does not offer noticeable performance gains. However, PCFGs allow much tighter, domain-dependent coupling, and we show that this maybe exploited for significant performance gains. Finally, we compare two strategies for acquiring the varying grammars needed for any combining method. We suggest that an unorthodox strategy, ``leave-one-in'''' learning, is more effective than the more familiar ``leave-one-out''''.
Classes and Objects A Dynamic Approach
Authors: Jorgen Steensgaard-Madsen
Venue:  (1978)

Data encapsulation, abstract data types and classes are terms associated with a concept not fully clarified or accepted. This paper presents a class concept that differs slightly from previous definitions by the associated dynamics. This allows us to interpret nested and recursive classes as well as class parameters. We will distinguish between types and classes and permit types as parameters in a way that allows simple implementation. A number of examples will be given to illustrate the class concept itself and its application to access control problems for concurrent programs. Synchronization primitives will be viewed as classes and the need for explicit high-level constructs like monitors is questioned. Keywords: Programming language, encapsulation, abstract data type, class, object, synchronization, monitor.
BU/NSF Workshop on Internet Measurement Instrumentation and Characterization
Authors: Azer Bestavros, John Byers, Mark Crovella, Paul Barford, Ibrahim Matta, Michael Mitzenmacher
Venue:  (1999)

Abstract Because of its growth in size, scope, and complexity---as well as its increasingly central role in society---the Internet has become an important object of study and evaluation. Many significant innovations in the networking community in recent years have been directed at obtaining a more accurate understanding of the fundamental behavior of the complex system that is the Internet. These innovations have come in the form of better models of components of the system, better tools which enable us to measure the performance of the system more accurately, and new techniques coupled with performance evaluation which have delivered better system utilization. The continued development and improvement of our understanding of the properties of the Internet is essential to guide designers of hardware, protocols, and applications for the next decade of Internet growth. As a research community, an important next step involves an comprehensive look at the challenges that lie ahead in this area. This includes an an evaluation of both the current unsolved challenges and the upcoming challenges the Internet will present us with in the near future, and a discussion of the promising new techniques that innovators in the field are currently developing. To this end, the Networking Research Group at Boston University, with support from the National Science Foundation, organized a one-day workshop which was held at Boston University on Monday, August 30, 1999. This report summarizes the technical presentations and discussions that took place during that workshop.
On the number of occurrences of a symbol in words of regular languages
Authors: Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
Venue: Theoretical Computer Science (2003)

We study the random variable Yn representing the number of occurrences of a symbol a in a word of length n chosen at random in a regular language L ⊆ {a, b}*, where the random choice is defined via a non-negative rational formal series r of support L. Assuming that the transition matrix associated with r is primitive we obtain asymptotic estimates for the mean value and the variance of Yn and present a central limit theorem for its distribution. Under a further condition on such a matrix, we also derive an asymptotic approximation of the discrete Fourier transform of Yn, that allows to prove a local limit theorem for Yn. Further consequences of our analysis concern the growth of the coefficients in rational formal series; in particular, it turns out that, for a wide class of regular languages L, the maximum number of words of length n in L having the same number of occurrences of a given symbol is of the order of growth λn/√n, for some constant λ>1.
Building J2EE Applications with IBM WebSphere
Authors: Dale R. Nilsson, Louis E. Mauget
Venue:  (2003)

:Learn how to combine the power of J2EE with WebSphere to build business applications WebSphere, the popular Web application server used to build server-side Java applications, provides a host of features for developing and deploying J2EE applications. With this in-depth book, youll quickly learn how to combine the power of J2EE with WebSphere. It covers all aspects of J2EE development, including the J2EE Architecture, Java applications, Java servlets, Java Server Pages (JSPs), JDBC, Enterprise JavaBeans (EJBs), XML, XSL, and Web services. Covering version 5.0 of WebSphere, this book shows you how to: Configure and use the WebSphere IDE with CVS Learn how to debug Java applications and servlets Create Web applications with HTML, JSPs, Struts, and servlets Deploy and configure a Web application to a server Use JDBC, XML, XSL, EJBs, and Web Services Use data access tools to generate DDL and SQL for relational databases The companion Web site includes all of the code from the book and many useful links to related sites.
TRIANGULAR SPECTRAL ELEMENTS FOR INCOMPRESSIBLE FLUID FLOW
Authors: C. Mavriplis, John V Rosendale
Venue:  (1993)

In this paper we discuss the use of triangular elements in the spectral element method for direct simulation of incompressible flow. Triangles provide much greater geometric flexibility than quadrilateral elements and are better conditioned and more accurate when small angles arise. We employ a family of tensor product algorithms for triangles, allowing triangular elements to be handled with comparable arithmetic complexity to quadrilateral elements. The triangular discretizations are applied and validated on the Poisson equation. These discretizations are then applied to the incompressible Navier-Stokes equations and a laminar channel flow solution is given. These new triangular spectral elements can be combined with standard quadrilateral elements, yielding a general and flexible high order method for complex geometries in two dimensions. The natural generalization to tetrahedral elements in three dimensions will be described in a future work.
Shortest Path Evaluation for Hierarchial Grain Aggregation
Authors: C. L. McCreary, D. H. Gill, Y. Zhu
Venue:  (1993)

This paper presents techniques for analyzing the data dependence structure of a program to determine an efficient task "grain" structure for parallel execution. A graph parsing technique is used to detect potential parallelism in a directed acyclic graph (DAG). The parse identifies graph components which are linear, independent, and primitive. Linear components must be executed serially, while independent components may be executed in parallel. Primitive components have no specific directives for pluralization of linearization. The primary contribution of this paper is a new technique for further decomposition of primitive structures. The new technique allows the parser to discover linear and independent components contained inside primitive components. The second contribution is an efficient scheduling algorithm which is systematic and flexible. The algorithm exploits the parallelism in a DAG based on its parse tree by modeling the parallelization/aggregation decisions with a multi-stage decision graph and then finding the shortest path of the decision graph. The enhanced technique is illustrated by its application to the DAG for the Cooley-Tukey Fast Fourier Transform.
Resolving covert channels within a B2 class secure system
Authors: Keith Loepere
Venue: ACM SIGOPS Operating Systems Review (1985)

For a secure computer system in the B2, B3 and A1 classes (as defined by the DoD Trusted Computer System Evaluation Criteria), the problem of confining a process such that it may not transmit information in violation of the *-property is an analyzable and solvable problem.This paper examines the problem of covert channels and attempts to analyze and resolve them relative to satisfying the B2 security requirements. A novel solution developed for the Multics computer system for a class of covert channels is presented.
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets
Authors: Juris Hartmanis, Lane A. Hemachandra
Venue:  (1987)

This paper 1. gives a relativized counterexample to the conjectured connection between the existence of one-way functions and the existence of non-isomorphic NP-complete sets. 2. establishes that in relativized worlds there are NP-complete sets that are non-isomorphic in a strong sense. 3. proves that robust machines squander their powerful nondeterministic oracle access in all relativizations. (1) resolves an open question. (2) extends our knowledge about non-isomorphic NP-complete sets. (3) sharing the proof techniques of (1) and (2), enriches the nascent theory of robustness and presents a consequence of the limited combinatorial control of machines.
Effective Information Retrieval Using Term Accuracy
Authors: Gerard Salton, C. T. Yu
Venue:  (1975)

The performance of information retrieval systems can be evaluated in a number of different ways. Much of the published evaluation work is based on measuring the retrieval performance of an average user query. Unfortunately, formal proofs are difficult to construct for the average case. In the present study, retrieval evaluation is based on optimizing the performance of a specific user query. The concept of query term accuracy is introduced as the probability of occurrence of a query term in the documents relevant to that query. By relating term accuracy to the frequency of occurrence of the term in the documents of a collection it is possible to give formal proofs of the effectiveness with respect to a given user query of a number of automatic indexing systems that have been used successfully in experimental situations. Among these are inverse document frequency weighting, thesaurus construction, and phrase generation.
Automated Classification, Identification, and Information System: An Integrated Systems Approach to Automated Target Recognition in a Multiple Sensor Multiple Platform Environment
Authors: Kenneth D. Bradley
Venue:  (1991)

The Automatic Classification, Identification, and Information, (ACII) System is a project designed for Automated Target Recognition in a multiple sensor, multiple platform environment, implemented as a collection of integrated rule based system modules that learn according to the platform type needs. The design concept includes introduction, background, systems and concepts, overall system operation, initial design of a platform level system, description of major information flows, other applications of the system, and conclusions. The appendices contain the design of a platform level system using the CASE tool named "Software through Pictures" (STP)tm. The design consists of data flow diagrams, annotations, level drawings, and structure charts of the major systems. The ACII system is designed for a combined theatre area, local operating area, and unit target correlation system. The individual units perform the collection of target information using their sensors. The unit attempts identification before sending the information to the local area coordinator. The local area coordinator attempts identification using all the information in the area before sending it to the theater system. The theater system uses all the information in the theater for identification. The identification, if completed, is returned to all units within the local operating area. The ACII system can be adapted for numerous other non-military uses including air traffic control, industrial process monitoring, industrial robotics, weather forecasting, seismographic evaluation, and financial systems. The number of military uses are vast, including weapons systems, propulsion systems, damage assessment systems, safety systems, manpower evaluation systems, and numerous others. 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
A VLSI Architecture for Cellular Automata Based Reed-Solomon Decoder
Authors: S. Nandi, Ch. Rambabu, P. Pal Chaudhari
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Design of Cellular Automata(CA) based S b EC-D b ED code analogous to Extended Reed-Solomon code [1] has been proposed in [2] This code has the same restriction on error correction capability as that of Extended RS code. In this paper a new scheme has been proposed for pipeline implementation of CA base tb EC - tb ED codes that are analogous to the conventional RS code. Both encoder and decoder of this code can be implemented in pipeline with Cellular Automata Array(CAA). The proposed decoder provides a simple, modular, and cost effective design that ideally suits for VLSI implementation.
Visual Parallel Programming and Determinacy: A Language Specification, an Analysis Technique, and a Programming Tool
Authors: Adam Beguelin, Gary Nutt
Venue:  (1993)

Phred is a visual parallel programming language in which programs can be statically analyzed for deterministic behavior. This paper presents the Phred language, techniques for analyzing the language, and a programming environment which supports Phred programming. There are many methods for specifying synchronization and data sharing in parallel programs. The Phred programmer uses graph constructs for describing parallelism, synchronization and data sharing. These graphs are formally described in this paper as a graph grammar. The use of graphs in Phred provides an intuitive and visual representation for parallel computations. The inadvertent specification of nondeterministic computations is a common error in parallel programming. Phred addresses the issue of determinacy by visually indicating regions of a program where nondeterminacy may exist. This analysis and its integration into a programming environment is presented here. The Phred programming environment supports the specification, analysis and execution of Phred programs. Thedistribution of the programming environment itself over several workstations is also described.
Mobile real-time communications in FDDI networks
Authors: Yibin Yang, Ten-Hwang Lai, Ming-Tsan Liu
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

We propose an architecture of FDDI-based mobile networks and address issues that arise in providing real-time communication services on such networks. A wide range of problems concerning synchronous bandwidth management and quality of service guarantee are identified. To solve these problems, we present a dynamic bandwidth management scheme, a source handoff protocol and two approaches to handling destination handoffs. These schemes make handoffs transparent to mobile users; no degradation in quality of service will be observed during handoffs. The proposed solutions are compatible with the FDDI standards
Design and Analysis of Low-Voltage Current-Mode Logic Buffers
Authors: Payam Heydari
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper investigates important problemsinvolved in the design of a CML buffer as well as a chain oftapered CML buffers. A new design procedure to systematicallydesign a chain of tapered CML buffers is proposed. Thedifferential architecture of a CML buffer makes it functionallyrobust in the presence of environmental noise sources (e.g.,crosstalk, power/ground noise). The circuit design issues inregard to the CML buffer are compared with those in a conventionalCMOS inverter. It is shown, both through the experimentsand by using efficient analytical models, why CMLbuffers are better than CMOS inverters in high-speed low-voltageapplications.
Design of Real-Number Checksum Codes Using Shared Partial Computation for CED in Linear DSP Systems
Authors: Huy Nguyen, Abhijit Chatterjee
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We introduce a framework for the design of low-overhead real-number checksum codes for concurrent error detection in linear DSP systems. Low overhead is achieved by using shared partial computations between the DSP system and its checking circuitry. The main issue is concerned with how the partial computations are shared without compromising fault coverage since any sharing can introduce errors into both the DSP system and its checking circuitry. While exploring the design space, fast fault coverage estimators are used. For hardware-shared implementations, we obtain fault coverage exceeding 95%, with average computation overhead of only 15%. When sharing of intermediate computations in the flow-graph is implemented, we obtain 20% reduction in the number of arithmetic operations without loss of fault coverage.
QOS based performance of selective repeat transport user in hybrid ATM/TDMA networks
Authors: M. Talla, A. K. Elhakeem, M. Kadoch
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The selective repeat (SR) transport user end-to-end throughput and delay characteristics are analyzed in a hybrid asynchronous transfer mode/time division multiple access (ATM/TDMA) network. The SR transport user is assumed with an underlying cell-level global congestion control in the ATM multiplexer node. The analysis is based on the interaction of packet level control with the queue management at the ATM cell level. The end-to-end transport users are assumed over an M-node virtual circuit (VC) to derive the throughput and delay using Norton equivalent queueing model. The transport service characteristic of the model is obtained from the end-to-end protocol efficiency. The ATM layer is assumed with a leaky bucket (LB), virtual leaky bucket (VLB), modified LB (mLB), or modified VLB (mVLB) congestion control. A global congestion control scheme prioritizes transit traffic over local traffic and ensures the quality of service (QOS) to several classes of traffic. Based on global congestion status, the transport users modulate their end-to-end flow control parameters, i.e., packet size for video and voice users and window size for data users. The probability of cell-loss at the ATM layer is reflected at the transport layer to derive the effective throughput and delay characteristics. The mVLB scheme consistently provided better end-to-end throughput and delay performance for SR transport user.
Detecting directed 4-cycles still faster
Authors: Friedrich Eisenbrand, Fabrizio Grandoni
Venue: Information Processing Letters (2003)

We present a method to detect simple cycles of length 4 of a directed graph in O(n1/ωe2-2/ω) steps, where n denotes the number of nodes, e denotes the number of edges and ω is the exponent of matrix multiplication. This improves upon the currently fastest methods for α ∈ (2/(4 - ω), (ω + 1)/2), where e = nα.
Local search algorithms for the k-cardinality tree problem
Authors: Christian Blum, Matthias Ehrgott
Venue: Discrete Applied Mathematics (2003)

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. We review existing literature on the problem. Then we prove that under the condition that the graph contains exactly one trough, the problem can be solved in polynomial time. For the general NP-hard problem we implemented several local search methods to obtain heuristic solutions, which are qualitatively better than solutions found by constructive heuristics and which require significantly less time than needed to obtain optimal solutions. We used the well-known concepts of genetic algorithms and tabu search with useful extensions. The general performance of our methods is illustrated by numerical results.
Threshold of Broadcast in Random Graphs
Authors: Hui Chen
Venue:  (1997)

Broadcasting process is to send a piece of information which resides at one nodein the graph to all the remaining nodes. At each time step, a node knows about the information can send it to one of its neighbors. The broadcast problem is to find the minimum time step needed. The problem is NP hard in general. For a random graph $G_{n,p}$, we are interested in at what value of $p$ there exists a broadcast tree of depth exactly $\lc \log _2n\rc $. Frieze and Molloy \cite{FriMo} show that $p$ is of magnitude $\Theta ( \ln n/n)$. In this paper, we give the exact threshold of theedge probability for the existence of such a tree.
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
Authors: Robert H.B.Netzer, Barton P. Miller
Venue:  (1994)

A common debugging strategy involves re-executing a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-passing parallel programs. Because of nondeterminacy, different runs on the given input may produce different results. This non-repeatability is a serious debugging problem, since an execution cannot always be reproduced to track down bugs. This paper presents a technique for tracing and replaying message-passing programs. By tracing the order in which messages are delivered, a reexecution can be forced to deliver messages in their original order, reproducing the original execution. To reduce the overhead of such a scheme, we show that the delivery order of only messages involved in races need be traced (and not every message). Our technique makes run-time decisions to detect and trace racing messages, and is usually optimal in the sense that the minimal number of racing messages is traced. Experiments indicate that only 1 magnitude reduction over traditional techniques which trace every message. These traces allow an execution to be reproduced any number of times for debugging. Our work is novel in that we adaptively decide what to trace, and trace only those messages that introduce nondeterminacy. With our strategy, large reductions in trace size allow long-running programs to be replayed that were previously unmanageable. In addition, the reduced tracing requirements alleviate tracing bottlenecks, allowing executions to be debugged with substantially lower execution-time overhead.