ppxscal/embedding_network huggingface dataset:
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Authors: Chin-Tsai Lin
Venue: Journal of Parallel and Distributed Computing (2003)

The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are node-disjoint, and the lengths of these paths differ from the shortest possible lengths by a small additive constant. This graph can be used to derive fault-tolerant algorithms for broadcasting and scattering problems without prior knowledge of the faulty elements of the network.
Linking physical and virtual interaction spaces
Authors: Berry Eggen, Loe Feijs, Peter Peters
Venue: Proceedings of the second international conference on Entertainment computing (2003)

We explored how game flow can be influenced by adding a physical interaction space to an existing screen-based computer game. In this article we investigate how narrative influences the shifting of a player's focus of attention between physical and virtual interaction spaces.
Perturbing Nonnormal Confidential Attributes: The Copula Approach
Authors: Rathindra Sarathy, Krishnamurty Muralidhar, Rahul Parsa
Venue: Management Science (2002)

Protecting confidential, numerical data in databases from disclosure is an important issue both for commercial organizations as well as data-gathering and disseminating organizations (such as the Census Bureau). Prior studies have shown that perturbation methods are effective in protecting such confidential data from snoopers. Perturbation methods have to provide legitimate users with accurate (unbiased) information, and also provide adequate security against disclosure of confidential information to snoopers. For databases described by nonnormal multivariate distributions, existing perturbation methods do not provide unbiased characteristics. In this study, we develop a copula-based perturbation method capable of maintaining the marginal distribution of perturbed attributes to be the same before and after perturbation. In addition, this method also preserves the rank order correlation between the confidential and nonconfidential attributes, thereby maintaining monotonic relationships between attributes. The method proposed in this study provides a high level of protection against inferential disclosure. An investigation of the new perturbation method for simulated databases shows that the method performs effectively. The methodology presented in this study represents a signicant step toward improving the practical applicability of data perturbation methods.
An integrated approach to olap optimization
Authors: Thomas P. Nadeau
Venue:  (2003)

The goal of on-line analytical processing (OLAP) is to answer queries quickly from large amounts of data residing in a data warehouse. Recent literature in the area of improving OLAP response time has focused on materialized views as the means of achieving this goal. Materialized views are precomputed answers saved to disk. The problem of improving OLAP response time can be divided into four sub-problems: view size estimation, selection of views for materialization, materialized view maintenance, and query optimization in the presence of materialized views. This dissertation contributes research to each of these four areas, describes how the processes interact, and how they can be efficiently integrated. This research serves as a plan for the implementation of a commercial OLAP system with faster query response and much greater scalability properties than previous systems. The contributions include the Pareto Model Algorithm for view size estimation, the Polynomial Greedy Algorithm for view selection, the Paged Bin-Tree for data maintenance, and the semantic search of view metadata for query optimization. The Pareto Model Algorithm for view size estimation reduces the coefficient of variation for the estimate/actual measurement when compared to prior art. This improvement in view size estimation results in better decisions by the view selection algorithm since views are selected for materialization based on the relative benefits. The contribution of the Polynomial Greedy Algorithm provides a means for selecting a near optimal set of views for materialization in polynomial time relative to the number of dimensions. The polynomial time complexity represents scalability beyond the operational capacity of existing algorithms. Views selected for materialization can be quickly created and updated with the invention of the Paged Bin-Tree index structure. The Paged Bin-Tree provides efficient update and query performance, significantly improving response time. Finally, the intelligent use of metadata is utilized to improve query optimization in the presence of materialized views. The semantic search for the best data source is straightforward and reduces the number of query rewrites compared to previous approaches. These improvements to OLAP performance create opportunities for OLAP users to explore their data more quickly and fully. The scalable design opens the possibility of analyzing a wide variety and size of data sets beyond the ability of previous state of the art systems.
Relationship between carotid plaque composition and embolization risk assessed by computer processing of ultrasound images
Authors: P. Theocharakis, I. Kalatzis, N. Piliouras, M. Dimitropoulos, E. Ventouras, D. Cavouras
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The purpose of this work was to process carotid plaque ultrasound images, employing pattern recognition methods, for assessing the embolization risk factor associated with carotid plaque composition. Carotid plaques of 56 ultrasound images displaying carotid artery stenosis were categorized by means of the gray scale median (GSM) as high risk of causing brain infarcts (GSM≤50 gray level) and low-risk (GSM>50 gray level), and in accordance with the physician's assessment and final clinical outcome. In each plaque image, the ratio of echo-dense to echo-lucent area was automatically calculated and it was combined with other textural features, calculated from the image histogram, the co-occurrence matrix, and the run-length matrix. These features were employed as input to two classifiers, the quadratic Bayesian (QB accuracy 91.7%) and the support vector machine (SVM accuracy 100%), which were trained to characterize plaques as either high risk or low risk of causing brain infarcts.
A class of fuzzy random optimization: expected value models
Authors: Yian-Kui Liu, Baoding Liu
Venue: Information Sciences: an International Journal (2003)

Fuzzy random variable is a measurable mapping from a probability space to a collection of fuzzy variables. This concept may be regard as an extension of both random variable and fuzzy variable. In this paper, the linearity of a scalar value expected value operator of fuzzy random variable is discussed, and a fuzzy random simulation approach is suggested to evaluate the expected value of a fuzzy random variable. In addition, three types of fuzzy random expected value models are presented to model fuzzy random decision systems. Moreover, a hybrid intelligent algorithm, which incorporates simulation, neural network and genetic algorithm, is designed in order to solve general fuzzy random expected value models. At the end of this paper, the effectiveness of this algorithm is showed via three numerical examples.
On the Independence Number of Random Interval Graphs
Authors: S. Boucheron, W. Fernandez De LaVega
Venue: Combinatorics, Probability and Computing (2001)

A random interval graph of order n is generated by picking 2n numbers X1,&hellip;,X2n independently from the uniform distribution on [0,1] and considering the collection of n intervals with endpoints X2i&minus;1 and X2i for i &isin; {1,&hellip;,n}. The graph vertices correspond to intervals. Two vertices are connected if the corresponding intervals intersect. This paper characterizes the fluctuations of the independence number in random interval graphs. This characterization is obtained through the analysis of the greedy algorithm. We actually prove limit theorems (central limit theorem and large deviation principle) on the number of phases of this greedy algorithm. The proof relies on the analysis of first-passage times through a random level.
Developing business aligned knowledge management strategy
Authors: El-Sayed Abou-Zeid
Venue: Knowledge management: current issues and challenges (2003)

With the growing awareness of the crucial role that knowledge can play in gaining competitive advantage, several issues with regard to knowledge management (KM) initiatives have challenged executives. The articulation of the relationship between an organization's competitive strategy and its knowledge strategy is the most eminent. This chapter addresses the issue of how to align knowledge strategy with enterprise business strategy. Based on the premise that the realization of business value from KM investments requires alignment between business and knowledge strategies, the issue is addressed by developing a strategic alignment model for KM. This model, which is based on the Henderson-Venkatraman strategic alignment model, includes the external domains (opportunities/threat) and internal domains (capabilities/arrangements) of both business (B-) and knowledge (K-) strategies and the relationships between them. Furthermore, it provides alternative strategic choices. The model is used to study a KM initiative at Buckman Laboratories.
Evaluating Interrater Agreement with Intraclass Correlation Coefficient in SPICE-based Software Process Assessment
Authors: Hyung-Min Park, Ho-Won Jung
Venue: Proceedings of the Third International Conference on Quality Software (2003)

As software process assessment (SPA) involves asubjective procedure, its reliability is an important issue.Two types of reliability have intensively been investigatedin SPA: internal consistency (internal reliability) andinterrater agreement (external reliability). This studyinvestigates interrater agreement. Cohen's Kappacoefficient has been a popular measure for estimatinginterrater agreement. However, the application of Kappacoefficient in certain situations is incorrect due to the"Kappa Paradoxes". To cope with the insufficiency ofKappa coefficient, this study applied the IntraclassCorrelation Coefficient (ICC) to estimate interrateragreement. The ICC has not been employed in the SPAcontext. In addition, we examined the stability of theestimated ICC value by using a bootstrap resamplingmethod. Results show that ICC could be applied where theKappa coefficient could not be applied, but not all cases.
Concurrency issues in C++
Authors: Eshrat Arjomandi, William O'Farrell
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

In this paper we review and analyze concurrency issues in object-oriented languages. We particularly focus on C++-based languages. A categorization of existing concurrent object-oriented languages according to their level of integration between the paradigms of object-oriented programming and concurrent programming is presented. We then review concurrent C++-based languages. An analysis of concurrency issues in C++ is also presented.
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
Authors: Tibor Jordán
Venue: Discrete Applied Mathematics (2003)

A graph G = (V,E) is called minimally (k,T)-edge-connected with respect to some T ⊆ V if there exist k-edge-disjoint paths between every pair u,v ∈ T but this property fails by deleting any edge of G. We show that |V| can be bounded by a (linear) function of k and |T| if each vertex in V - T has odd degree. We prove similar bounds in the case when G is simple and k ≤ 3. These results are applied to prove structural properties of optimal solutions of the shortest k-edge-connected Steiner network problem. We also prove lower bounds on the corresponding Steiner ratio.
Decomposition strategies for configuration problems
Authors: Diego Magro, Pietro Torasso
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

The paper introduces and discusses the notion of decomposition of a configuration problem within the framework of a structured logical approach. The paper describes under which conditions a given configuration problem can be decomposed into a set of noninteracting subproblems and how to exploit such a decomposition, both for improving the performance of the configurator and for supporting interactive configuration. Different kinds of decomposition are considered, but all of them exploit, as much as possible, the explicit representation of the partonomic relations in the FPC language, a KL-One like representation formalism augmented with constraints for expressing complex interrole relations. The paper introduces a notion of boundness among constraints, which is used for formally specifying different types of decomposition. One decomposition strategy aims at singling out the components and subcomponents that are directly related to the constraints put by the user's requirements; the configurator exploits such decomposition by first configuring that portion of the product and then configuring the parts that are not related to the user's requirements. Another decomposition strategy verifies whether the set of constraints for the product to be configured can be split into a set of noninteracting problems. In such a case the configurator solves the configuration problem by splitting the whole search space into a set of smaller search spaces. Different combinations of these two decomposition techniques are considered, and the impact of the decomposition strategies on the performance of the configurator is evaluated via a set of experiments using the configuration of computer systems as a test bed. The results of the experiments show a significant reduction of the computational effort (both in terms of number of backtrackings and in CPU time) when decomposition strategies are used.
On the equivalence between some local and global Chinese postman and traveling salesman graphs
Authors: Daniel Granot, Herbert Hamers
Venue: Discrete Applied Mathematics (2004)

A connected graph G = (V,E), a vertex in V and a non-negative weight function defined on E can be used to induce Chinese postman and traveling salesman (cooperative) games. A graph G = (V,E) is said to be locally (respectively, globally) Chinese postman balanced (respectively, totally balanced, submodular) if for at least one vertex (respectively, for all vertices) in V and any non-negative weight function defined on E, the corresponding Chinese postman game is balanced (respectively, totally balanced, submodular). Local and global traveling salesman balanced (respectively, totally balanced, submodular) graphs are similarly defined.In this paper, we study the equivalence between local and global Chinese postman balanced (respectively, totally balanced, submodular) graphs, and between local and global traveling salesman submodular graphs.
Some Exact Results and New Asymptotics for Hypergraph Tur&aacute;n Numbers
Authors: Dhruv Mubayi
Venue: Combinatorics, Probability and Computing (2002)

Given a family &Fscr; of r-graphs, let ex(n, &Fscr;) be the maximum number of edges in an n-vertex r-graph containing no member of &Fscr;. Let C(r) 4 denote the family of r-graphs with distinct edges A, B, C, D, such that A &cap; B = C &cap; D = &Oslash; and A &cup; B = C &cup; D. For s1 &les; &hellip; &les; sr, let K(r) (s1,&hellip;,sr) be the complete r-partite r-graph with parts of sizes s1,&hellip;,sr.F&uuml;redi conjectured over 15 years ago that ex(n,C(3)4) &les; (n2) for sufficiently large n. We prove the weaker resultex(n, {C(3)4, K(3)(1,2,4)}) &les; (n2).Generalizing a well-known conjecture for the Tur&aacute;n number of bipartite graphs, we conjecture thatex(n, K(r)(s1,&hellip;,sr)) = &Theta;(nr&minus;1/s),where s = &Pi;r&minus;1i=1 si. We prove this conjecture when s1 = &hellip; = sr&minus;2 = 1 and(i) sr&minus;1 = 2, (ii) sr&minus;1 = sr = 3, (iii)sr > (sr&minus;1&minus;1)!.In cases (i) and (ii), we determine the asymptotic value of ex(n,K(r)(s1,&hellip;,sr)).We also provide an explicit construction givingex(n,K(3)(2,2,3)) > (1/6&minus;o(1))n8/3.This improves upon the previous best lower bound of &OHgr;(n29&#x002F;11) obtained by probabilistic methods. Several related open problems are also presented.
Evolving artifacts at work: a case study of computer-supported cooperative work implementation in a bank
Authors: Marlin Merle Cluts
Venue:  (2003)

This research describes a two-year project involving the implementation of computer-supported cooperative work (CSCW) software in a community bank. The purpose was to develop a greater understanding of the nature and characteristics of cooperative work and to provide insight into interactions among technology, work, and organization. Specific examples of cooperative work involving the new software were studied in search of the evolution of artifacts. Methods of determining artifact meaning, sharing, and credibility were also observed. Activity theory provided a guide and a useful model for discussing the elements involved, including mediating artifacts such as tools, rules, and division of labor. Such artifacts carried a residue of the history of the relationship between the elements they mediated. The hierarchy included in activity theory also yielded perspectives into the dynamics of evolving artifacts and activity systems. The activity theory concept of praxis and the characteristics of communities of practice were particularly insightful in understanding interpersonal interactions in accomplishing work. Users in the study needed to experience results within the activity and social structure of the community to establish meaning and credibility. Based on the dimensions that evolved from the study, recommendations were developed for both developers of CSCW software and managers of work groups. Activity theory forced a well-defined context to be considered. The natural evolution of activity systems and characteristics of communities of practice also provided additional insight worthy of attention.
A numerically reliable approach to robust pole assignment for descriptor systems
Authors: A. Varga
Venue: Future Generation Computer Systems (2003)

We propose a general, numerically reliable computational approach to solve the pole and eigenstructure assignment problem for descriptor systems. In the multi-input case, the proposed approach addresses the intrinsic non-uniqueness of the pole assignment problem solution by simultaneously minimizing the sensitivity of the feedback gain and of closed-loop eigenvalues. For this purpose, a minimum norm robust pole assignment problem is formulated and solved as an unconstrained minimization problem for a suitably chosen cost function. By using a generalized Sylvester equation-based parameterization, an explicit expression of the gradient of the cost function is derived to allow the efficient solution of the minimization problem by using powerful gradient search-based minimization techniques.
Readability and writability in Euclid
Authors: Jim des Rivieres, Henry Spencer
Venue: ACM SIGPLAN Notices (1978)

Neither readability nor writability of programs were major design goals of the programming language Euclid, yet both are obviously important considerations in determining how effectively the language can be used. This paper considers the influence of various Euclid features on readability and writability.
The impact of enterprise application integration on information system lifecycles
Authors: Zahir Irani, Marinos Themistocleous, Peter E. D. Love
Venue: Information and Management (2003)

Information systems (IS) have become the organisational fabric for intra- and inter-organisational collaboration in business. As a result, there is mounting pressure from customers and suppliers for a direct move away from disparate systems operating in parallel towards a more common shared architecture. In part, this has been achieved through the emergence of new technology that is being packaged into a portfolio of technologies known as enterprise application integration (EAI). Its emergence however, is presenting investment decision-makers charged with the evaluation of IS with an interesting challenge. The integration of IS in-line with the needs of the business is extending their identify and lifecycle, making it difficult to evaluate the full impact of the system as it has no definitive start and/or end. Indeed, the argument presented in this paper is that traditional life cycle models are changing as a result of technologies that support their integration with other systems. In this paper, the need for a better understanding of EAI and its impact on IS lifecycles are discussed and a classification framework proposed.
Volume rendering methods for computational fluid dynamics visualization
Authors: David S. Ebert, Roni Yagel, Jim Scott, Yair Kurzion
Venue: Proceedings of the conference on Visualization '94 (1994)

This paper describes three alternative volume rendering approaches to visualizing computational fluid dynamics (CFD) data. One new approach uses realistic volumetric gas rendering techniques to produce photo-realistic images and animations from scalar CFD data. The second uses ray casting that is based on a simpler illumination model and is mainly centered around a versatile new tool for the design of transfer functions. The third method employs a simple illumination model and rapid rendering mechanisms to provide efficient preview capabilities. These tools provide a large range of volume rendering capabilities to be used by the CFD explorer to render rapidly for navigation through the data, to emphasize data features (e.g., shock waves) with a specific transfer function, or to present a realistic rendition of the model.
Syntax-Directed Amorphous Slicing
Authors: Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, Dave Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
Venue: Automated Software Engineering (2004)

An amorphous slice of a program is constructed with respect to a set of variables. The amorphous slice is an executable program which preserves the behaviour of the original on the variables of interest. Unlike syntax-preserving slices, amorphous slices need not preserve a projection of the syntax of a program. This makes the task of amorphous slice construction harder, but it also often makes the result thinner and thereby preferable in applications where syntax preservation is unimportant.This paper describes an approach to the construction of amorphous slices which is based on the Abstract Syntax Tree of the program to be sliced, and does not require the construction of control flow graphs nor of program dependence graphs. The approach has some strengths and weaknesses which the paper discusses.The amorphous slicer, is part of the GUSTT slicing system, which includes syntax preserving static and conditioned slicers, a side effect removal transformation phase, slicing criterion guidance and for which much of the correctness proofs for transformation steps are mechanically verified. The system handles a subset of WSL, into which more general WSL constructs can be transformed.The paper focuses upon the way in which the GUSTT System uses dependence reduction transformation tactics. Such dependence reduction is at the heart of all approaches to amorphous slicing. The algorithms used are described and their performance is assessed with a simple empirical study of best and worst case execution times for an implementation built on top of the FermaT transformation system for maintenance and re-engineering.