ppxscal/embedding_network huggingface dataset:
Using narratives to convey knowledge in decision making support systems
Authors: Lee A. Freeman
Venue: Decision making support systems: achievements, trends and challenges for (2002)

Information systems, and specifically decision making support systems, present information to users in a variety of modes--raw data, tables, graphs, and others. Rarely, if ever, does an information system present information to users in a narrative or story-based format. The last three decades have seen a variety of research articles that have presented an argument, an example, or a reference to what can be termed narrative-based information systems (NBIS). This chapter traces this history as they contribute to the development of NBIS. This chapter traces this history as they contribute to the development of NBIS. Previous work has come from multiple disciplines and multiple streams within Information Systems. To date, there has been very little work done in this area, and it is hypothesized that the reason is in part due to the multi-disciplinary approach and the lack of a unified effort. In order to further the efforts of this area of research, a conceptual model of the history is developed. The paper concludes with areas for future research.
Adapting to Unfamiliar Environmental Events: a Look at the Evolution of Interpretation and its Role in Strategic Change
Authors: Marc R. Lambrecht, Philip L. Ivens, Nico J. Vandaele, John H. Miller, Pamela S. Barr
Venue: Organization Science (1998)

This paper argues that a key component in a firm's strategic response to unfamiliar environmental events is the interpretations managers develop about the event itself and about key dimensions of their strategy. Using historical data from the pharmaceutical industry, the revealed interpretations of top management from six firms over a ten-year period are analyzed and are compared to the timing and content of the changes in strategy each firm undertook following a significant change in regulation. The results reveal two distinct patterns of interpretation development that appear to be linked to whether or not the target of interpretation is familiar. Further, interpretations appear to be linked both temporally and in terms of content to the strategic change undertaken by each firm. Both sets of results suggest that the interpretations of managers are linked to organizational actions.
Wavelength Routing and Assignment in a Survivable WDM Mesh Network
Authors: Jeffery Kennington, Eli Olinick, Augustyn Ortynski, Gheorghe Spiride
Venue: Operations Research (2003)

All-optical networks with wavelength division multiplexing (WDM) capabilities are prime candidates for future wide-area backbone networks. The simplified processing and management of these very high bandwidth networks make them very attractive. A procedure for designing low cost WDM networks is the subject of this investigation.In the literature, this design problem has been referred to as the routing and wavelength assignment problem. Our proposed solution involves a three-step process that results in a low-cost design to satisfy a set of static point-to-point demands. Our strategy simultaneously addresses the problem of routing working traffic, determining backup paths for single node or single link failures, and assigning wavelengths to both working and restoration paths.An integer linear program is presented that formally defines the routing and wavelength assignment problem (RWA) being solved along with a simple heuristic procedure. In an empirical analysis, the heuristic procedure successfully solved realistically sized test cases in under 30 seconds on a Compaq AlphaStation. CPLEX 6.6.0 using default settings required over 1,000 times longer to obtain only slightly better solutions than those obtained by our new heuristic procedure.
Mendler-style inductive types, categorically
Authors: Tarmo Uustalu, Varmo Vene
Venue: Nordic Journal of Computing (1999)

We present a basis for a category-theoretic account of Mendler-style inductive types. The account is based on suitably defined concepts of Mendler-style algebra and algebra homomorphism; Mendler-style inductive types are identified with initial Mendler-style algebras. We use the identification to obtain a reduction of conventional inductive types to Mendler-style inductive types and a reduction in the presence of certain restricted existential types of Mendler-style inductive types to conventional inductive types.
Results of classroom enterprise security assessment of five large enterprise networks
Authors: George L. Wooley
Venue: Journal of Computing Sciences in Colleges (2003)

The paper addresses a full network security assessment of the working network of five enterprises. Our activities were evaluative assessments that were performed with no actual touches of the network itself. We start the paper with the handling of the issues of assessment confidential and methodology. In additional to requesting background information, we requested each enterprise answer 16 questions. As the assessments continued, additional questions were handled case by case until complete packages were formed. The paper captures summary findings that involve IP address and authentication, Intrusion Detection Systems, Demilitarized Zones, Wireless Network, Virtual Private Networks and most glaring Security Policy problems.
Modification point depth and genome growth in genetic programming
Authors: Sean Luke
Venue: Evolutionary Computation (2003)

The evolutionary computation community has shown increasing interest in arbitrary-length representations, particularly in the field of genetic programming. A serious stumbling block to the scalability of such representations has been bloat: uncontrolled genome growth during an evolutionary run. Bloat appears across the evolutionary computation spectrum, but genetic programming has given it by far the most attention. Most genetic programming models explain this phenomenon as a result of the growth of introns, areas in an individual which serve no functional purpose. This paper presents evidence which directly contradicts intron theories as applied to tree-based genetic programming. The paper then uses data drawn from this evidence to propose a new model of genome growth. In this model, bloat in genetic programming is a function of the mean depth of the modification (crossover or mutation) point. Points far from the root are correspondingly less likely to hurt the child's survivability in the next generation. The modification point is in turn strongly correlated to average parent tree size and to removed subtree size, both of which are directly linked to the size of the resulting child.
A positive numerical scheme for a mixed-type partial differential equation model for fungal growth
Authors: Graeme P. Boswell, Helen Jacobs, Fordyce A. Davidson, Geoffrey M. Gadd, Karl Ritz
Venue: Applied Mathematics and Computation (2003)

We describe a numerical scheme for the solution of a mixed-type PDE system which arises in the modelling of fungal growth. Given the application, conservation of mass and preservation of positivity are of paramount importance. The scheme employs a method of lines approach in which the system is split into hyperbolic and parabolic parts. Positivity and conservation of mass are ensured by the use of generalised flux functions and, in particular, flux limiters. The spatial discretisation results in stiff and non-stiff components which are solved using implicit and explicit methods respectively. Properties of the scheme are investigated via comparison with experimental data and performance is compared with another method of solution.
Two Dimensional Rendezvous Search
Authors: Edward J. Anderson, Sándor P. Fekete
Venue: Operations Research (2001)

We consider rendezvous problems in which two players move on the plane and wish to cooperate to minimise their first meeting time. We begin by considering the case where both players are placed such that the vector difference is chosen equiprobably from a finite set. We also consider a situation in which they know they are a distanced apart, but they do not know the direction of the other player. Finally, we give some results for the case in which player 1 knows the initial position of player 2, while player 2 is given information only on the initial distance of player 1.
Models for cooperative activities over the web
Authors: Bogdan D. Czejdo, Maciej Zakrzewicz, Govindarao Sathyamoorthi
Venue: Web-enabled systems integration: practices and challenges (2003)

The Chapter discusses the need and the problems associated with WEB based cooperative activities in which several team members work in parallel on a common task. Models for software systems supporting such cooperative activities are discussed. Our models describe structure of the cooperation object, cooperation modes and the network message synchronization, that are of prime importance when the system members work at different places and communicate over the Internet. We introduce and describe a component requirements graph and show how to translate it into an interaction graph. The state diagrams and the design graphs are the basis for the WEB software design. The discussion of software architecture for implementing cooperative activities over the Web is also provided.
Cortico-hippocampal maps and navigation strategies in robots and rodents
Authors: Jean Paul Banquet, Philippe Gaussier, Mathias Quoy, Arnaud Revel, Yves Burnod
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

A biologically inspired integrated model of different hippocampal subsystems makes a distinction between place cells (PC) within entorhinal cortex (diffuse) or dentate gyrus (segregated), and transition cells (TC) in CA3-CA1 that encode transitions between events. These two types of codes support two kinds of hippocampocortical cognitive maps: -A context-independent map in subiculum and EC encodes essentially the spatial layout of the environment thanks to a local dominance of ideothetic movement-related information over allothetic (visual) information; -A task-and-temporal-context dependent map based on the TCs in CA3-CA1 allows encoding, in higher order structures, maps as graphs resulting from combination of learned sequences of events. The dominantly spatial and the temporal-task-dependent maps are permanently stored in parietal cortex and prefrontal cortex respectively. On the basis of these two maps two distinct goal-oriented navigation strategies were designed in experimental robotic paradigms: -one based on a (population) vector code of the location-actions pairs to learn and implement to reach the goal; another based on linking TCs together as conditioning chains that will be implemented under the top-down guidance of drives and motivations.
Decomposition of general queueing networks with MMPP inputs and customer losses
Authors: Armin Heindl
Venue: Performance Evaluation (2003)

For nontrivial general (open) queueing networks, decomposition often represents the only feasible solution method besides simulation. The network is partitioned into individual nodes which are analyzed in isolation with respect to approxamate internal traffic representations. The quality of the quickly obtained results very much depends on the descriptors for the traffic processes within the network, which may be split and merged before traversing the next queue. Recently, one of the existing decomposition formalisms based on renewal processes as traffic descriptors has been extended in order to include semi-Markov processes (SMPs) mad Markov-modulated Poisson processes (MMPPs) with two states. However, due to the restriction to tandem networks, no operations for the splitting and and merging were provided.The numerical procedures for the splitting of SMPs and the superposition of MMPPs proposed in this paper render the extended decomposition framework available for general queueing networks. The correlations in the traffic processes, which are known to have a considerable impact on performance measures, are taken into account to some extent. Moreover, in addition to renewal processes, MMPP inputs--as they frequently arise in computer communication modeling--increase the range of applications of general queueing networks.Numerical experiments on different network configurations illustrate the capabilities and accuracy of the extended decomposition framework.
Evolution on the Network Edge: Intelligent Devices
Authors: Eric Yocum
Venue: IT Professional (2003)

Intelligent edge devices support complex protocols and packet encapsulations to manage diverse network topologies and deliver new services.
Knowledge engineering: ontology of world religions
Authors: Brandi Gilds
Venue: Journal of Computing Sciences in Colleges (2002)

Knowledge Engineers use knowledge to build knowledge-based systems that solve problems in a particular domain. These systems use an ontology to organize terms, concepts, and relationships that represent a field or domain and are used to explain a conundrum. This paper presents an ontology development for the concept of religion, a psychosocial phenomenon.
Numerical Computations of Viscous, Incompressible Flow Problems Using a Two-Level Finite Element Method
Authors: Faisal Fairag
Venue: SIAM Journal on Scientific Computing (2002)

We consider two-level finite element discretization methods for the stream function formulation of the Navier--Stokes equations. The two-level method consists of solving a small nonlinear system on the coarse mesh and then solving a linear system on the fine mesh. The basic result states that the errors between the coarse and fine meshes are related superlinearly. This paper demonstrates that the two-level method can be implemented to approximate efficiently solutions to the Navier--Stokes equations. Two fluid flow calculations are considered to test problems which have a known solution and the driven cavity problem. Stream function contours are displayed showing the main features of the flow.
Visualizing software for telecommunication services
Authors: Emden R. Gansner, John M. Mocenigo, Stephen C. North
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. One approach is to rely on a component-based architecture such as Distributed Feature Composition (DFC), by which a new service can be specified as a composition of primitive features over time. Formally, a communication episode is represented by a dynamic graph of software feature boxes, called a usage. This serves as the fundamental model for how services are invoked and how they interact with other services.This paper, after providing some background on DFC, discusses a technique for visualizing the usages which arise through DFC specifications. With the visualization, users can monitor and validate service protocols and feature interactions in real time or through playback logs. The principal display component uses a novel variation of force-directed layouts for undirected graphs. The resulting graphical interface has become a principal tool for developers building services using DFC.
Computer integrated construction: recent developments and future directions
Authors: G. Aouad, M. Sun, I. Faraj
Venue: Civil and structural engineering computing: 2001 (2001)

This paper gives an overview of research undertaken within the area of Computer Integrated Construction (CIC) with particular reference to project integrated databases. Recent developments are highlighted and future directions are discussed. The paper starts by providing a historical background of the subject area. It then develops an argument for the use and benefits of integrated environments in construction. This is followed by a discussion about the research issues that need to be addressed in the next few years. These issues will be investigated within a holistic view addressing technical, financial, cultural and process perspectives. This paper then addresses and discusses the various misconceptions about project integrated databases.This paper will make reference to current research being conducted at the University of Salford in the UK. Salford has invested heavily in this area and some fruitful results have been realised in bringing together visualisation, object oriented and web technologies to solve some of the problems associated with construction information modelling, integration and communication. This paper will briefly describe some of the projects and initiatives conducted at Salford, particularly within the area of project integrated databases.
Fully implicit implementation of boundary conditions in operator-splitting methods for steady incompressible Navier-Stokes equations
Authors: C. I. Christov, R. S. Marinova, T. T. Marinov
Venue: Scientific computing and applications (2001)

The steady incompressible Navier-Stokes equations in primitive variables are solved by means of an implicit vectorial operator-splitting scheme. The method allows for complete implicit coupling of the boundary conditions. Conservative approximations for the advective terms are employed on non-uniform staggered grid. The performance of the scheme is demonstrated on the lid-driven flow in a rectangular cavity of aspect ratio two. Results are obtained up to Re = 5000.
A heuristic approach to the overnight security service problem
Authors: R. Wolfler Calvo, R. Cordone
Venue: Computers and Operations Research (2003)

This paper introduces the overnight security service problem. The model obtained is a single-objective mixed integer programming problem. It is NP-hard in the strong sense, and exact approaches are not practicable when solving real-life instances. Thus, the model is solved heuristically, through a decomposition in two subproblem. The former is a capacitated clustering problem, the latter is a multiple travelling salesman problem with time windows. Both have a radius constraint which is unusual. The computational results prove the robustness of the approach used. Moreover, a detailed discussion of the results shows that the management objectives are satisfied, providing lower costs, a strong guarantee on the level of service and several different solutions.
Existence and stability of almost periodic solution for BAM neural networks with delays
Authors: Anping Chen, Lihong Huang, Jinde Cao
Venue: Applied Mathematics and Computation (2003)

By using the Banach fixed point theorem and constructing suitable Lyapunov function, some sufficient conditions are obtained ensuring existence, uniqueness and global stability of almost periodic solution of the BAM neural networks with variable coefficients and delays. These results are helpful to design global exponential stable BAM networks and almost periodic oscillatory BAM networks.
Sensitivity strategies in modelling heterogeneous media undergoing finite deformation
Authors: Eduard Rohan
Venue: Mathematics and Computers in Simulation (2003)

This paper deals with homogenization of microscopically heterogeneous media which are subjected to finite deformations. The updated Lagrangian scheme is applied to obtain linear subproblems which can be homogenized using the two-scale convergence. Microscopic equations and homogenized stiffness coefficients are derived for the hyperelastic material with incompressible inclusions. A sensitivity analysis of homogenized coefficients is proposed to study their dependence on local deformations of the microstructure. This approach can assist in reducing the number of the local microscopic equations that have to be solved in each iteration of macroscopic problems.
On characterizations and regularity of the solution of bilateral obstacle problems
Authors: B. Mermri, X. Chen
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper we introduce a new reformulation of bilateral obstacle problems which allows us to characterize the domain of noncontact with the obstacles, and give a new proof for H2(Ω)-regularity of the solution.
Shape analysis for mobile ambients
Authors: Hanne Riis Nielson, Flemming Nielson
Venue: Nordic Journal of Computing (2001)

The ambient calculus is a calculus of computation that allows active processes to move between sites. We present an analysis inspired by state-of-the-art pointer analyses that safely and accurately predicts which processes may turn up at what sites during the execution of a composite system. The analysis models sets of processes by sets of regular tree grammars enhanced with context dependent counts, and it obtains its precision by combining a powerful redex materialisation with a strong redex reduction (in the manner of the strong updates performed in pointer analyses).
Analysing internet software retrieval systems: modeling and performance comparison
Authors: José Merseguer, Javier Campos, Eduardo Mena
Venue: Wireless Networks (2003)

Nowadays, there exist web sites that allow users to retrieve and install software in an easy way. The performance of these sites may be poor if they are used in wireless networks; the reason is the inadequate use of the net resources that they need. If these kinds of systems are designed using mobile agent technology the previous problem might be avoided. In this paper, we present a comparison between the performance of a software retrieval system especially designed to be used in a wireless network and the performance of a software retrieval system similar to the well-known Tucows.com web site. In order to compare performance, we make use of a software performance process enriched with formal techniques. The process has as important features that it uses UML as a design notation and it uses stochastic Petri nets as formal model. Petri nets provide a formal semantics for the system and a performance model.
Systolic block-Jacobi SVD algorithm for processor meshes
Authors: G. Okša, M. Vajteršic
Venue: Highly parallel computaions: algorithms and applications (2001)

We design the systolic version of the block-Jacobi SVD algorithm for the singular value decomposition (SVD) of matrix A ∈ Rn×n. The algorithm involves the class CO of parallel orderings on the two-dimensional toroidal mesh with p processors. The mathematical background is based on the QR decomposition of local data matrices and on Kogbetliantz's algorithm for local SVDs in the diagonal processors. Subsequent updates of local matrices in the diagonal as well as nondiagonal processors are required. We show that all updates can be realized by orthogonal (modified) Givens rotations. These rotations can be efficiently pipelined in parallel in the horizontal and vertical rings of √p processors through the toroidal mesh. Our solution requires O(3n2) systolic processing elements, O(3n2) memory registers, O(n2) additional delay elements and O[(4(2√p + r + 1) - 2r+4/√p)sn] time steps where s is the number of global sweeps in the block-Jacobi algorithm and r is the number of local sweeps in Kogbetliantz's algorithm.
Aggregation based on integrals: recent results and trends
Authors: Michel Grabisch
Venue: Aggregation operators: new trends and applications (2002)

The paper presents an overview of recent results related to the use of non additive integrals (Choquet and Sugeno integrals) as aggregation operators. We essentially address two main issues, which are the treatment of negative numbers, and the case of ordinal information to aggregate. We do not explicitely presuppose any particular form of aggregation problem (e.g. multicriteria decision making), and remain at an abstract level, although decision making in general can be considered as the main motivation of the work.