ppxscal/embedding_network huggingface dataset:
Managerial Insights into the Effects of Interactions on Replacing Members of a Team
Authors: Daniel Solow, George Vairaktarakis, Sandy Kristin Piderit, Ming-chi Tsai
Venue: Management Science (2002)

A mathematical model is presented for studying the effects of interactions among team members on the process of replacing members of a team in an organization. The model provides the ability to control the number of members that interact with each individual on the team. Through the use of analysis and computer simulations, it is shown how the amount of interaction affects the tradeoff between the expected performance and the number of replacements and interviews needed to find a good team using various replacement policies. New managerial insights into this process--such as the fact that it is not necessarily optimal to replace the worst-performing team member--are provided.
A Characterization of GEM Distributions
Authors: Alexander Gnedin, Sergei Kerov
Venue: Combinatorics, Probability and Computing (2001)

Let (Xn) be a residual allocation model with i.i.d. residual fractions Un: For W a random variable with values in [0; 1] and independent of (Xn), we define another sequence (Yn) by setting(formula here)Under minor regularity assumptions we show that (Xn) and (Yn) have the same probability law if and only if this law is a GEM distribution. In this case, the distribution of W and the Uns is Beta(1; &theta;) for some &theta; > 0.
Blue Matter, an application framework for molecular simulation on blue gene
Authors: B. G. Fitch, R. S. Germain, M. Mendell, J. Pitera, M. Pitman, A. Rayshubskiy, Y. Sham, F. Suits, W. Swope, T. J. C. Ward, Y. Zhestkov, R. Zhou
Venue: Journal of Parallel and Distributed Computing (2003)

In this paper we describe the context, architecture, and challenges of Blue Matter, the application framework being developed in conjunction with the science effort within IBM's Blue Gene project. The study of the mechanisms behind protein folding and related topics can require long time simulations on systems with a wide range of sizes and the application supporting these studies must map efficiently onto a large range of parallel partition sizes to optimize scientific throughput for a particular study. The design goals for the Blue Matter architecture include separating the complexities of the parallel implementation on a particular machine from those of the scientific simulation as well as minimizing system environmental dependencies so that running an application within a low overhead kernel with minimal services is possible. We describe some of the parallel decompositions currently being explored that target the first member of the Blue Gene family, BG/L, and present simple performance models for these decompositions that we are using to prioritize our development work. Preliminary results indicate that the high-performance networks on BG/L will allow us to use FFT-based techniques for periodic electrostatics with reasonable speedups on 512-1024 node count partitions even for systems with as few as 5000 atoms.
Visualizing and querying software structures
Authors: Mariano Consens, Alberto Mendelzon, Arthur Ryman
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Software engineering problems often involve large sets of objects and complex relationships among them. This report proposes that graphical visualization techniques can help engineers understand and solve a class of these problems. To illustrate this, two problems are analyzed and recast using the graphical language GraphLog. The first problem is that of simplifying dependencies among components of a system, which translates into removing cycles from a graph. The second problem is that of designing an efficient code overlay structure, which is facilitated in several ways through graphical techniques.
G-networks with propagating resets via RCAT
Authors: P. G. Harrison
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

Stationary Markovian networks, defined by a collection of cooperating agents, can be solved for their equilibrium state probability distribution by a new compositional method that computes their reversed Markov process, under appropriate conditions. We apply this approach to G-networks with chains of triggers and generalised resets, which have some quite distinct properties from the resets proposed recently.
Fast PNN-based Clustering Using K-nearest Neighbor Graph
Authors: Pasi Fränti, Olli Virmajoki, Ville Hautamäki
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Search for nearest neighbor is the main source ofcomputation in most clustering algorithms. We proposethe use of nearest neighbor graph for reducing thenumber of candidates. The number of distancecalculations per search can be reduced from O(N) to O(k)where N is the number of clusters, and k is the number ofneighbors in the graph. We apply the proposed schemewithin agglomerative clustering algorithm known as thePNN algorithm.
Fundamental properties of the fractional-order discrete-time integrator
Authors: Piotr Ostalczyk
Venue: Signal Processing (2003)

In the paper main properties of the fractional-order discrete-time linear, time-invariant integrator are presented. The discrete-time integrators of different classes of signals and integration orders are considered. The closed-loop system with fractional integrator is analysed. The transient and frequency characteristics are discussed. As a numerical example, the approximate realisation of the fractional-order integrator has been proposed.
A variational technique for spacecraft trajectory planning
Authors: Carl Glen Henshaw
Venue:  (2003)

A successful autonomous spacecraft must be able to navigate &ldquo;intelligently&rdquo;. Intelligent navigation entails finding and following collision-free paths through space which can be traversed in a reasonable time and which use a reasonable amount of fuel. Several spacecraft have been recently proposed for which intelligent navigation abilities are either desirable or necessary. Among these are NASA's AERCam, PSA, and ISS Inspector, ESA's Automated Transfer Vehicle (ATV), and DARPA's Orbital Express. These mission scenarios present challenging guidance problems, as the vehicles may in general start in different orbits from their targets. Trajectory planners for these vehicles must therefore combine &ldquo;long range&rdquo; orbital maneuvering, with its attendant nonlinear dynamics and fuel use constraints, and &ldquo;short range&rdquo; proximity operations where collision avoidance is paramount. We describe a spacecraft trajectory planning algorithm based on the calculus of variations which can solve 6-DOF spacecraft docking and proximity operations problems. The design of a cost functional which trades off fuel use, obstacle clearance distance, and arrival time is discussed. The nonlinear orbital dynamic equations are treated as dynamic constraints. The Euler-Lagrange equations for this functional are derived, as are the Pontryagin criteria for the optimal control input given realistic saturating on-off thrusters. The collocation method is chosen to solve the attendant boundary-value problem, and a number of features added to further improve the algorithm's robustness. The manipulation of the Euler-Lagrange equations and the transversality condition into a form suitable for use with collocation methods is also discussed. The algorithm is shown to be capable of solving &ldquo;traditional&rdquo; free-space path planning problems with complex-shaped, moving obstacles. Trajectories are also shown for a variety of orbital maneuvers, culminating in an end-to-end docking maneuver with a tumbling satellite. The computation effort needed to solve these problems is discussed, as are the tradeoffs between fuel use, obstacle clearance distance, and arrival time.
A constraint satisfaction approach to testbed embedding services
Authors: Jeffrey Considine, John W. Byers, Ketan Meyer-Patel
Venue: ACM SIGCOMM Computer Communication Review (2004)

Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, with the availability of wide-area distributed testbeds such as PlanetLab, it is feasible to move beyond evaluation by simulation, and to perform wide-area experiments across the Internet as an alternate. However, while use of a distributed testbed affords much greater realism than a network simulation, there is a significant downside, as tight control over one's experiments is relinquished.We argue that providing services for distributed testbeds that capture aspects of the specifiable, repeatable behavior implicit in simulation and emulation will be an integral component of next-generation textbeds. As a case study, we consider the following problem: given a desired end-system topology consisting of a set of pairwise constraints (such as upper and lower bounds on bandwidth and delay), locate a representative subtopology within a wide-area testbed that satisfies those constraints. Previous work on Netbed addresses wide-area embedding problems of this form using an optimization framework, whereas we employ constraint satisfaction. We discuss the relative merits of these approaches, outline the theoretical foundations of a distributed service that provides a synergy between adaptive network measurements and the embedding process, and report on preliminary experimental results conducted on PlanetLab.
Semantic matchmaking in a P-2-P electronic marketplace
Authors: Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini, Marina Mongiello
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are peers in the transaction. Peer-to-Peer (P-2-P) e-commerce calls for an infrastructure treating in a uniform way supply and demand, which should base the match on a common ontology for describing both supply and demand. Knowledge representation --- in particular description logics --- can deal with this uniform treatment of knowledge from vendors and customers, by modelling both as generic concepts to be matched. We propose a logical approach to supply-demand matching in P-2-P e-commerce, which allows us to clearly distinguish between exact, potential and partial match, and to define a ranking within the categories. The approach is deployed in a prototype system implemented for a particular case study (but easily generalizable) and is based on Classic, a well-known knowledge representation system.
Geographic information systems in the public sector
Authors: T. R. Carr
Venue: Public information technology: policy and management issues (2003)

Geographic information systems emerged in the 1970s and have become significant decision-making tools as their capabilities have been enhanced. This chapter includes a brief discussion of various GIS applications and a more detailed discussion of issues that public managers should consider when evaluating implementation of a geographic information system. GIS applications provide benefits at the basic level in terms of producing maps efficiently, at the planning level through the use of database applications, and at the management decision-making level through an ability to access relational databases for policy-level decisions. In considering the capacity of GIS in the public sector, concise definitions of the major application theories--vector and raster--are offered to provide a basic understanding of the analytical process and GIS toolkit aspects. Issues impacting GIS implementation include needs assessment, project planning, access to public records, liability issues, public and private partnerships, dissemination of information, and privacy issues. Public managers should be aware of difficulties associated with justification of costs associated with GIS implementation and that a hesitancy exists on the part of GIS program managers to share missteps and implementation failures.
System Design for DSP Applications Using the MASIC Methodology
Authors: Abhijit K. Deb, Axel Jantsch, Johnny Öberg
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Expensive top-down iterations are often required in the design cycle of complex DSP systems. In this paper, we introduce two levels of abstraction in the design flow by systematically categorizing the architectural decisions. As a result, the top-down iteration loop is broken. We also present a technique to capture and inject the architectural decisions such that the system models can be created and simulated efficiently. The concepts are illustrated by a realistic speech processing example, which is implemented using the AMBA on-chip architecture. Our methodology offers a smooth path from the functional modeling phase to the implementation level, facilitates the reuse of HW and SW components, and enjoys existing tool support at thebackend.
'Field' work
Authors: Andrew Johnson, Thomas Moher, Yong-Joo Cho, Danny Edelson, Eric Russell
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Sixth grade students at Abraham Lincoln Elementary School explore a virtual field via an ImmersaDesk and collect data there using hand-helds computers. Back in the classroom they integrate their data, visualize it to see the patterns that emerge, and then propose explanations for these patterns. The goal is to help the students learn science inquiry skills within an environment that encourages their formation.
Protecting intellectual property in IT layoffs: legal and security issues
Authors: Norman Pendegraft, Jerry Wegman
Venue: Technologies & methodologies for evaluating information technology in business (2003)

Until recently, layoffs were not common among IT workers. The recent "dot com meltdown" has changed this. Because IT workers are knowledge workers, these circumstances combine to create an unusual set of problems for IT managers. Discussed in this chapter is how protection of intellectual property may be affected by layoffs and suggestions are offered for how these problems may be addressed.
Adaptive Multimedia Multi-Party Communication in Ad Hoc Environments
Authors: Pedro M. Ruiz, Juan A. Sanchez, Emilio Garcia, Antonio F. Gomez-Skarmeta, Juan A. Botia, Andreas Kassler, Teodora Guenkova-Luy
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Adaptivity is a key issue for enhanced multimedia communication in wireless environments, where the network QoS for a whole session cannot be guaranteed. Within this paper we propose a set of mechanisms to provide adaptive multimedia multi-party communication according to user-de.ned QoS levels over self-organizing ad hoc network extensions connected to IP access networks. We use special extensions to SIP/SDPng based on XML to negotiate alternative application defined QoS levels and adaptation paths and optionallycouple local resource management with network layer QoS. At the network layer, we propose the MMARP (Multicast MANET Routing Protocol) which provides efficient multicast communications within ad hoc network extension to public infrastructure based access networks. MMARP is able to deal with the complexity of supporting traditional IP nodes whilst inter-operating smoothly with fixed IP networks. An adaptive application architecture is demonstrated that uses the E2ENP and allows multimedia applications to reconfigure themselves in real-time to match the specific network conditions in order to preserve theuser-perceived QoS. Thus, an integration of application layer QoS as defined by the user and network layer QoS is achieved.
How can carbon onion transform into diamond-like structure
Authors: I. V. Ponomareva, L. A. Chernozatonskii
Venue: Microelectronic Engineering (2003)

We propose a mechanism of carbon onion core transformation into diamond-like structure (DLS). It consists of several stages and can realistically describe the main features observed in recent experiments [Nature 382 (1996) 433]. We used molecular dynamic simulation based on classical REBO potential to simulate some of the transition stages.
String and graph reduction systems for gene assembly in ciliates
Authors: Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg
Venue: Mathematical Structures in Computer Science (2002)

Ciliates have developed a unique nuclear dualism, having two nuclei of different functionality: the germline micronucleus and the somatic macronucleus. The way that ciliates assemble the macronuclear genes after cell mating constitutes one of the most intricate DNA processings in living organisms. This processing is also very interesting from the computational point of view. In this paper, we investigate the operations of loop excision and hairpin excision&sol;reinsertion used in the assembly process. In particular, we consider three levels of formalization of this process, culminating in graph reduction systems.
An artificial neural network for resource leveling problems
Authors: Nabil Kartam, Tanit Tongthong
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

A new methodology for solving resource leveling problems is introduced using Artificial Neural Networks (ANN). This paper describes a new efficient and robust approach which is unique to those utilized by traditional heuristic and optimization resource leveling techniques. The Resource Leveling Artificial Neural Network (RLANN) exploits advantages of both Hopfield networks and competition-based artificial neural networks. The universal scheme of the RLANN is applicable to construction project networks produced with Critical Path Method (CPM), in forms of either arrow or precedence diagrams. The scheme is comprised of two layers, an input and a competition layer, of artificial node matrices fully connected by links. Solving mechanisms inside the RLANN are based on an equation of motion and a competition strategy that control the level of daily resource usage. While the equation of motion governs activities to be shifted within schedule constraints, the competition process finds the best positions for the activities to achieve optimum results. The approach is simple and can be implemented on either a personal computer or a parallel processing device. The solutions produced are comparable to, or better than, those generated by other heuristic or optimization techniques. This paper describes the development of the RLANN, its solving mechanisms, and its uses in construction resource leveling problems. The comparison of the result of the RLANN to those of other traditional techniques is also included. The conclusions highlight the applicability of this model to other civil engineering problems.
Design and implementation of a graphical interface to XQuery
Authors: Enrico Augurusa, Daniele Braga, Alessandro Campi, Stefano Ceri
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

As the use of XML is rapidly growing, a growing number of users without programming skills will need to query XML data. Although designed to be easily understood by humans, XQuery, the XML standard query language, has the typical syntax of programming languages, which most users dislike. In this paper we describe a graphical language (XQBE) inspired by "Query By Example" (QBE), a popular relational query language used by MS Access. XQBE covers a significant subset of XQuery and is supported by a prototype enabling the formulation of queries on a graphical interface and their translation into XQuery, thus providing non-trivial querying capabilities to a wide spectrum of users. Simple queries are easily represented in XQBE, but many "complex" queries allow as well for an intuitive graphical representation.
Modelling Contexts in the Or-BAC Model
Authors: Frédéric Cuppens, Alexandre Miège
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

As computer infrastructures become more complex, securitymodels must provide means to handle more flexibleand dynamic requirements. In the Organization Based AccessControl (Or-BAC) model, it is possible to express suchrequirements using the notion of context. In Or-BAC, eachprivilege (permission or obligation or prohibition) only appliesin a given context. A context is viewed as an extracondition that must be satisfied to activate a given privilege.In this paper, we present a taxonomy of different typesof context and investigate the data the information systemmust manage in order to deal with these different contexts.We then explain how to model them in the Or-BAC model.
ANEMIC: automatic interface enabler for model integrated computing
Authors: Steve Nordstrom, Shweta Shetty, Kumar Gaurav Chhokra, Jonathan Sprinkle, Brandon Eames, Akos Ledeczi
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

A domain-specific language provides domain experts with a familiar abstraction for creating computer programs. As more and more domains embrace computers, programmers are tapping into this power by creating their own languages fitting the particular needs of the domain. Graphical domain-specific modeling languages are even more appealing for non-programmers, since the modeling language constructs are automatically transformed into applications through a special compiler called a translator. The Generic Modeling Environment (GME) at Vanderbilt University is a meta-programmable modeling environment. Translators written to interface with GME models typically use a domain-independent API. This paper presents a tool called ANEMIC that generates a domain-specific API for GME translators using the same metamodel that generates the language.
Using latent semantic indexing to filter spam
Authors: Kevin R. Gee
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Past research has explored the effectiveness of a Na&iuml;ve Bayesian classifier when filtering unsolicited bulk email (spam). Results have shown that the degree of precision of this approach is generally superior to the degree of recall. This study evaluates the effectiveness of a classifier incorporating Latent Semantic Indexing (LSI) to filter spam email on corpus used in previous studies. Results show that email classifiers using LSI to filter spam enjoy a very high degree of both recall and precision, no matter if the corpus is treated using a stop list or a lemmatizer. While using LSI leads to precision roughly equal to that of using a Na&iuml;ve Bayesian approach, the LSI technique has a substantially higher recall and is more effective under certain conditions.Results show that incorporating LSI into an anti-spam filter is viable, particularly in implementations when misclassified legitimate messages are not arbitrarily deleted. Other inferences are drawn to the applicability of this method to other text mining tasks.