ppxscal/embedding_network huggingface dataset:
Information-theoretic co-clustering
Authors: Inderjit S. Dhillon, Subramanyam Mallela, Dharmendra S. Modha
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingency table analysis is co-clustering: simultaneous clustering of the rows and columns. A novel theoretical formulation views the contingency table as an empirical joint probability distribution of two discrete random variables and poses the co-clustering problem as an optimization problem in information theory---the optimal co-clustering maximizes the mutual information between the clustered random variables subject to constraints on the number of row and column clusters. We present an innovative co-clustering algorithm that monotonically increases the preserved mutual information by intertwining both the row and column clusterings at all stages. Using the practical example of simultaneous word-document clustering, we demonstrate that our algorithm works well in practice, especially in the presence of sparsity and high-dimensionality.
Software confederations: an architecture for global systems and global management
Authors: Jaroslav Král, Michal Žemlička
Venue: Managing globally with information technology (2003)

Many (especially the large) software systems tend to be virtual peer-to-peer (P2P) networks of permanent autonomous services (e.g., e-government should be supported by the network of information systems of individual offices). The services are loosely coupled, a service can join/leave the system quite easily. We call such networks software confederation (SWC). The paradigm of the SWC is orthogonal to the paradigm of the object-oriented methodology. The architecture of SWC is an engineering necessity in the case of global or very large information systems (IS) and provides many software engineering advantages like incremental development, openness, modifiability, maintainability, etc. SWC is a necessity in many other cases. SWC supports the trend of large enterprises or modern states to be decentralized, dynamic, and able to work in the time of globalization. Software confederations are the result of the tendency to globalization, and at the same time, the tool allowing of implementation of IS for a globalized society. SWC changes basic features of a CEO's work as well as a CIO's. In both cases, it supports the decentralization. This paper discusses the motivation of software confederations, the techniques of their design and implementation, including the use of XML (inclusive SOAP-UDDI), their software engineering advantages, relation to object-oriented technology and methodological consequences of their use. The main conclusion is that the concept of SWC is the crucial for the future software and information technologies and substantially changes the management tasks of the CIO and CEO.
It's (more) Scandinavian approach to IS research: but how do we know it?
Authors: Markku I. Nurminen
Venue: Scandinavian Journal of Information Systems (2003)

To be Scandinavian in one's IS research - or not to be - cannot be a dichotomy. There must be different degrees of this attribute, perhaps there are multiple dimensions to characterise the Scandinavian character. Some of these dimensions are briefly outline below.
Numerical Solution of Inverse Scattering Problems with Multi-experimental Limited Aperture Data
Authors: Gang Bao, Jun Liu
Venue: SIAM Journal on Scientific Computing (2003)

In this paper, a regularized homotopy continuation method is presented for numerical solution of nonlinear ill-posedness inverse problems. Two major difficulties for solving these inverse problems by an optimization method are the ill-posedness and the presence of many local minima. Classic iterative methods, such as Gauss--Newton or Levenberg--Marquardt algorithms, offer fast local convergence but might not be able to compute the global minimum. Based on a natural concept of multi-experimental data, a regularized homotopy continuation method is constructed to compute the global minimum. As the experimental index t increases continuously, the global minimizer can be computed continuously by using local optimization methods. By discretizing the continuous homotopy method, various recursive linearization algorithms are developed. These algorithms are applied to numerical solution of an inverse medium scattering problem which reconstructs the refractive index of an inhomogeneous medium from limited aperture measurements of the far field pattern of the scattered fields. It is assumed that the data is measured at multiple frequencies. The inverse scattering problem with limited aperture is challenging, since without full aperture measurements, the ill-posedness and nonlinearity of the inverse problem become more severe. An efficient regularized iterative linearization method (recursive linearization with respect to the wave number) is developed for solving the inverse problem. The convergence of the iterative method is examined by numerical examples.
Technology Development Trends for Cyber Civilization
Authors: A. B. Patki, M. D. Kulkarni, S. Sivasubramanian, Dhanvanti D. Patki
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper discusses the applications of Softcomputing Technology for developing and implementingInformation Technology projects required for cybercivilization era. The technological requirements forfacilitating the systems development along with the initialexperience obtained through the case of MISNOSTechnology based product development are discussed.
Dominating a Family of Graphs with Small Connected Subgraphs
Authors: Yair Caro, Raphael Yuster
Venue: Combinatorics, Probability and Computing (2000)

Let F = {G1, &hellip;, Gt} be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive integer. A subset of vertices D &sub; V is called an (F, k)-core if, for each v &isin; V and for each i = 1, &hellip;, t, there are at least k neighbours of v in Gi that belong to D. The subset D is called a connected (F, k)-core if the subgraph induced by D in each Gi is connected. Let &delta;i be the minimum degree of Gi and let &delta;(F) = minti=1&delta;i. Clearly, an (F, k)-core exists if and only if &delta;(F) &ge; k, and a connected (F, k)-core exists if and only if &delta;(F) &ge; k and each Gi is connected. Let c(k, F) and cc(k, F) be the minimum size of an (F, k)-core and a connected (F, k)-core, respectively. The following asymptotic results are proved for every t < ln ln &delta; and k < &radic;ln&delta;:formula hereThe results are asymptotically tight for infinitely many families F. The results unify and extend related results on dominating sets, strong dominating sets and connected dominating sets.
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing
Authors: Carlos Augusto Prolo
Venue:  (2003)

This thesis develops the formal aspects of LR parsing for Tree Adjoining Grammars (TAGS) and investigates its application to natural language best-parse parsing. It is argued that the combination of TAG and the LR technique is beneficial to both. On the one hand, starting from the observation that the rich descriptions provided by Tree Adjoining Grammars are better suited to the description of natural languages than Context Free Grammars, we look for an efficient parsing algorithm that yields a single analysis per sentence. On the other direction, the LR technique is argued to benefit from the rich descriptive power of the Tree Adjoining Grammars, leading to better parsing accuracy than when applied to Context Free Grammars. conception of LR parsing. We then propose practical efficient algorithms for LR table generation for TAGs and for a TAG subclass: the Tree Insertion Grammars (TIGs). Decision procedures are presented for conflict resolution during parsing so as to allow the pursuit of the single best-parse for any given sentence. Such procedures are statistical in nature. We obtain their statistical parameters from a large syntactically annotated corpus, the Penn Treebank, from which also the corresponding grammars are extracted. Thanks to the rich descriptions provided by the elementary trees of the Tree Adjoining Grammars, we were able to use a deterministic parsing strategy with limited backtracking (instead of exhaustive parallel all-paths search), thus obtaining a very fast parser with good accuracy. At the end we propose more elaborate techniques for further improving the parsing accuracy of our LR parser for TAG.**This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation).
The contract gas market with a linear supply function
Authors: I. G. Ivanov, L. G. Taseva
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This paper presents a stylized model of a learning process through which power generating companies could adjust their supply bidding strategies in order to achieve profit- maximizing equilibrium in the form of Supply Function Equilibrium (SFE). The model is based on real market assumptions. Market players can form their behavior relying on market observations with no need of information on other players' contracts and generation costs. We assume an asymmetric duopoly selling a homogenous commodity. Market conditions are characterized by linear demand and supply functions and in addition a constraint is imposed on one of the players' quantity.
Heterogeneous trading agents
Authors: Luc Neuberg, Koen Bertels
Venue: Complexity (2003)

In this article, we present a multiagent system (MAS) simulation of a financial market and investigate the requirements to obtain realistic data. The model consists of autonomous, interactive agents that buy stock on a financial market. Transaction decisions are based on a number of individual and collective elements, the former being risk aversion and a set of decision rules reflecting their anticipation of the future evolution of prices and dividends and the latter the information arriving on the market influencing the decision making process of each trader. We specifically look at this process and the following observations hold: The market behavior is determined by the information arriving at the market and agent heterogeneity is required in order to obtain the right statistical properties of the price and return time series. The observed results are not sensitive to changes in the parameter values.
Embedding untimed into timed process algebra: the case for explicit termination
Authors: J. C. M. Baeten
Venue: Mathematical Structures in Computer Science (2003)

In ACP-style process algebra the interpretation of a constant atomic action combines action execution with termination. In a setting with timing, different forms of termination can be distinguished: some-time termination, termination before the next clock tick, urgent termination, having terminated. In a setting with the silent action $\tau$, we also have silent termination. This leads to problems with the interpretation of atomic actions in timed theories that involve some form of the empty process or some form of the silent action. Reflection on these problems led to a redesign of basic process algebra, where action execution and termination are separated. Instead of actions as constants, we have action prefix operators. Sequential composition remains a basic operator, and thus we have two basic constants for termination: $\delta$ for unsuccessful termination (deadlock) and $\epsilon$ for successful termination (skip). We can recover standard ACP-style process algebras as subtheories of the new theory. The new approach has definite advantages over the standard approach. The paper contributes to ongoing work on relationships between algebras with different timing features.
Scheduling Space&ndash;Ground Communications for the Air Force Satellite Control Network
Authors: Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe
Venue: Journal of Scheduling (2004)

We present the first coupled formal and empirical analysis of the Satellite Range Scheduling application. We structure our study as a progression; we start by studying a simplified version of the problem in which only one resource is present. We show that the simplified version of the problem is equivalent to a well-known machine scheduling problem and use this result to prove that Satellite Range Scheduling is NP-complete. We also show that for the one-resource version of the problem, algorithms from the machine scheduling domain outperform a genetic algorithm previously identified as one of the best algorithms for Satellite Range Scheduling. Next, we investigate if these performance results generalize for the problem with multiple resources. We exploit two sources of data: actual request data from the U.S. Air Force Satellite Control Network (AFSCN) circa 1992 and data created by our problem generator, which is designed to produce problems similar to the ones currently solved by AFSCN. Three main results emerge from our empirical study of algorithm performance for multiple-resource problems. First, the performance results obtained for the single-resource version of the problem do not generalize: the algorithms from the machine scheduling domain perform poorly for the multiple-resource problems. Second, a simple heuristic is shown to perform well on the old problems from 1992; however it fails to scale to larger, more complex generated problems. Finally, a genetic algorithm is found to yield the best overall performance on the larger, more difficult problems produced by our generator.
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities
Authors: Bingsheng He, Xiaoming Yuan, Jason J. Z. Zhang
Venue: Computational Optimization and Applications (2004)

In this paper, we study the relationship between the forward-backward splitting method and the extra-gradient method for monotone variational inequalities. Both of the methods can be viewed as prediction-correction methods. The only difference is that they use different search directions in the correction-step. Our analysis explains theoretically why the extra-gradient methods usually outperform the forward-backward splitting methods. We suggest some modifications for the two methods and numerical results are given to verify the superiority of the modified methods.
Speech and sketching for multimodal design
Authors: Aaron Adler, Randall Davis
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

While sketches are commonly and effectively used in the early stages of design, some information is far more easily conveyed verbally than by sketching. In response, we have combined sketching with speech, enabling a more natural form of communication. We studied the behavior of people sketching and speaking, and from this derived a set of rules for segmenting and aligning the signals from both modalities. Once the inputs are aligned, we use both modalities in interpretation. The result is a more natural interface to our system.
Evaluating Keyword Selection Methods for WEBSOM Text Archives
Authors: Arnulfo P. Azcarraga, Teddy N. Yap, Jonathan Tan, Tat Seng Chua
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--The WEBSOM methodology, proven effective for building very large text archives, includes a method that extracts labels for each document cluster assigned to nodes in the map. However, the WEBSOM method needs to retrieve all the words of all the documents associated to each node. Since maps may have more than 100,000 nodes and since the archive may contain up to seven million documents, the WEBSOM methodology needs a faster alternative method for keyword selection. Presented here is such an alternative method that is able to quickly deduce meaningful labels per node in the map. It does this just by analyzing the relative weight distribution of the SOM weight vectors and by taking advantage of some characteristics of the random projection method used in dimensionality reduction. The effectiveness of this technique is demonstrated on news document collections.
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
Authors: T. Dean Hendrix, James H. Cross,  II, Larry A. Barowski
Venue: ACM SIGCSE Bulletin (2004)

A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can be created with minimal coding through the use of an external viewer model. The framework supplies a customizable viewer template as well as high-level APIs to a graph drawing library and the Java Debugger Interface. Initial classroom use has demonstrated the framework's ease of use as well as its potential to as an aid to student learning.
Variable Strength Interaction Testing of Components
Authors: Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, James S. Collofello
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Complete interaction testing of components is too costlyin all but the smallest systems. Yet component interactionsare likely to cause unexpected faults. Recently, design of experimenttechniques have been applied to software testingto guarantee a minimum coverage of all t-way interactionsacross components.However, t is always fixed.This paperexamines the need to vary the size of t in an individual testsuite and defines a new object, the variable strength coveringarray, that has this property.We present some computationalmethods to find variable strength arrays and provideinitial bounds for a group of these objects.
On Case-Based Knowledge Sharing in Semantic Web
Authors: Huajun Chen, Zhaohui Wu
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Human experience is a special kind of knowledge, which captures previously experienced, similar problem situations (case) for human problem solving. This paper describes a case-based approach for knowledge sharing and management with regard to the semantic web settings. We define a RDF-based Case Markup Language (CaseML) for experience knowledge representation and develop a generic architecture for the case based reasoning in the open, distributed environment with the emphasis on the integration of case knowledge with web ontologies. An application scenario from Traditional Chinese Medicine field is introduced to evaluate our methodology. With our application experience, we claim that, in contrast with logic-based knowledge representation formalisms, case is a more suitable forknowledge sharing in the semantic web, because case based reasoning is similarity-based and there is weak demand on semantic consistent in such reasoning processes.
Protection of wavelet-based watermarking systems using filter parametrization
Authors: Werner Dietl, Peter Meerwald, Andreas Uhl
Venue: Signal Processing (2003)

We discuss wavelet filter parametrization as a means to add security to wavelet-based watermarking schemes. It turns out that our proposed scheme is resistant to unauthorized detection and unauthorized removal attacks and is equally robust as compared to the use of standard wavelet filters in case the underlying watermarking scheme is spread-spectrum based. Quantization-based watermarking techniques are not suited to be enhanced by this approach. We assess the security, quality and robustness of our approach in the light of four selected watermarking algorithms. Furthermore, we present an attack tailored to exploit a common weakness in image-adaptive watermarking and propose filter parametrization as a suitable countermeasure.
Improving recruit distribution decisions in the US marine corps
Authors: Hemant K. Bhargava, Kevin J. Snoap
Venue: Decision Support Systems (2003)

The United States Marine Corps (USMC) accomplishes its mission "to put the right Marine in the right place at the right time with the right skills and quality of life" in various ways. One of these is a recruit distribution modeling (RDM) and information system that assigns new recruits to entry-level schools, thereby determining the entire career paths. This article proposes improvements to the existing Marine Corps decision processes and information systems for recruit distribution. The proposed system, recruit distribution decision support system (RDdss), provides intuitive navigation through a hierarchy of switchboards, and promotes data integrity by eliminating manual data entry for data already available in the system. It incorporates four objective measures for understanding the quality of proposed distributions, and allows the user to generate and compare multiple solutions based on the trade-off between these objectives. It is a fully functional working prototype system that was installed into the USMC manpower environment, and demonstrated to provide several improvements over the current technology.
Numerical solution to the time-dependent Maxwell equations in axisymmetric singular domains: the singular complement method
Authors: F. Assous, P. Ciarlet,  Jr., S. Labrunie, J. Segré
Venue: Journal of Computational Physics (2003)

In this paper, we present a method to solve numerically the axisymmetric time-dependent Maxwell equations in a singular domain. In [Math. Methods Appl. Sci. 25 (2002) 49; Math. Methods Appl. Sci. 26 (2003) 861], the mathematical tools and an in-depth study of the problems posed in the meridian half-plane were exposed. The numerical method and experiments based on this theory are now described here. It is also the generalization to axisymmetric problems of the Singular Complement Method that we developed to solve Maxwell equations in 2D singular domains (see [C. R. Acad. Sci. Paris, t. 330 (2000) 391]). It is based on a splitting of the space of solutions in a regular subspace, and a singular one, derived from the singular solutions of the Laplace problem. Numerical examples are finally given, to illustrate our purpose. In particular, they show how the Singular Complement Method captures the singular part of the solution.
Scalar cardinalities of finite fuzzy sets for t-norms and t-conorms
Authors: J. Casasnovas, J. Torrens
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

An axiomatic approach to scalar cardinalities of finite fuzzy sets involving t-norms and t-conorms is presented. A characterization theorem for these cardinalities is proved and it is also proved that some standard properties remain true. On the other hand, properties like finite additivity, valuation property or finite subadditivity depend on the t-norm and the t-conorm.
A Java framework for the static reflection, composition and synthesis of software components
Authors: I. McRitchie, T. J. Brown, I. T. A. Spence
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The development of distributed embedded real-time telecommunication systems requires close coupling of hardware and software components. Current component models lack support for large-scale reuse at the hardware/software interface. A component model is proposed that separates the component's core functionality from its variable facets. Generative programming techniques are applied to enable component-based engineering whilst maintaining close coupling with the underlying hardware. The described technique is illustrated by generating a simple device driver for a System on a Programmable Chip (SOPC) device from an XML specification.