ppxscal/embedding_network huggingface dataset:
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs
Authors: Michele Conforti, Gérard Cornuéjols
Venue: Journal of Combinatorial Theory Series B (2003)

We prove that the strong perfect graph conjecture holds for graphs that do not contain parachutes or proper wheels. This is done by showing the following theorem: If a graph G contains no odd hole, no parachute and no proper wheel, then G is bipartite or the line graph of a bipartite graph or G contains a star cutset or an extended strong 2-join or G is disconnected.To prove this theorem, we prove two decomposition theorems which are interesting in their own rights. The first is a generalization of the Burlet-Fonlupt decomposition of Meyniel graphs by clique cutsets and amalgams. The second is a precursor of the recent decomposition theorem of Chudnovsky, Robertson, Seymour and Thomas for Berge graphs that contain a line graph of a bipartite subdivision of a 3-connected graph.
Algorithms and data structures for computer topology
Authors: Vladimir Kovalevsky
Venue: Digital and image geometry: advanced lectures (2001)

The paper presents an introduction to computer topology with applications to image processing and computer graphics. Basic topological notions such as connectivity, frontier, manifolds, surfaces, combinatorial homeomorphism etc. are recalled and adapted for locally finite topological spaces. The paper describes data structures for explicitly representing classical topological spaces in computers and presents some algorithms for computing topological features of sets. Among them are: boundary tracing (n=2,3), filling of interiors (n=2,3,4), labeling of components, computing of skeletons and others.
Emotional interaction
Authors: Pedro Branco
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper discusses the association of emotions as an underlying component of everyday human-computer interaction. It presents the ongoing work in the design of an experiment to help understand the role that cognitive or appraisal theory of emotions might have in shaping the human-computer dialogue.
On the decidability and complexity of query answering over inconsistent and incomplete databases
Authors: Andrea Calì, Domenico Lembo, Riccardo Rosati
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

In databases with integrity constraints, data may not satisfy the constraints. In this paper, we address the problem of obtaining consistent answers in such a setting, when key and inclusion dependencies are expressed on the database schema. We establish decidability and complexity results for query answering under different assumptions on data (soundness and/or completeness). In particular, after showing that the problem is in general undecidable, we identify the maximal class of inclusion dependencies under which query answering is decidable in the presence of key dependencies. Although obtained in a single database context, such results are directly applicable to data integration, where multiple information sources may provide data that are inconsistent with respect to the global view of the sources.
Remarks From the Editor
Authors: Hemant K. Bhargava, Ramayya Krishnan, Patrick T. Harker
Venue: Operations Research (1998)

I am pleased to present this Focus Issue on Manufacturing Logistics. Unlike a special issue, where new papers are solicited that deal with a theme, this issue was created by pulling together previously accepted papers from all topical areas of the journal. Thus, this focused issue achieves two goals. First, it creates a volume that presents state-of-the-art thinking on manufacturing logistics. Second, it reduces the backlog of accepted papers thereby reducing the publication delay-i.e., the time from acceptance to publication-which had been as long as 24 months. Our goal is, through the use of this supplement, to reduce the publication delay to 12 months over the next year. I hope that you enjoy this focused issue and I look forward to your comments and suggestions.
Research Commentary: Transformational Issues in Researching IS and Net-Enabled Organizations
Authors: Detmar W. Straub, Richard T. Watson
Venue: Information Systems Research (2001)

The conduct of net-enabled business, known variously as electronic commerce (EC) or e-Business, has changed the landscape and opportunities for IS research by shifting the focus from internal to customer/partnering systems. The article examines the two primary dyadic net-enabled relationships in the marketplace: B2C and B2B. It also considers issues that extend beyond these two relationships. B2C practice and research are analyzed from: (1) consumer, (2) service, and (3) risk perspectives. Three central issues of B2B or supply chain practice and research are next considered: (1) beyond simple efficiencies, (2) innovations in B2B technology, and (3) information visibility. Finally, four overarching research issues are examined: (1) strategy, (2) organizational design, (3) metrics, and (4) managing IS.Not all research on the net-enabled organization (NEO) is IS research, and it is critical that IS journals maintain their distinctive focus. Within the bounds of the net-enabled revolution, though, the IS field has an opportunity to shape the phenomenon with timely, theory-based work that will disseminate beyond the IS academic and practitioner communities.
Potential Research Space in MIS: A Framework for Envisioning and Evaluating Research Replication, Extension, and Generation
Authors: Pierre Berthon, Leyland Pitt, Michael Ewing, Christopher L. Carr
Venue: Information Systems Research (2002)

Replications are an important component of scientific method in that they convert tentative belief to accepted knowledge. Given the espoused importance of replications to the extraction of knowledge from research, there is surprisingly little evidence of its practice or discussion of its importance in the management information systems literature. In this article we develop a framework within which to systematize the conceptualization of replications; we review and illustrate how some key information systems research fits into the framework and examine the factors that influence the selection of a research strategy. Our framework includes a conceptualization of the relationship among replication, extension, and generation in IS research. The concept of "research space" is defined and a framework is developed that delineates eight possible research strategies. Finally, the benefits of our framework to salient stakeholders in the research process are outlined.
A Distributed Multi-Storage Resource Architecture and I/O Performance Prediction for Scientific Computing
Authors: X. Shen, A. Choudhary, C. Matarazzo, P. Sinha
Venue: Cluster Computing (2003)

I/O intensive applications have posed great challenges to computational scientists. A major problem of these applications is that users have to sacrifice performance requirements in order to satisfy storage capacity requirements in a conventional computing environment. Further performance improvement is impeded by the physical nature of these storage media even when state-of-the-art I/O optimizations are employed.In this paper, we present a distributed multi-storage resource architecture, which can satisfy both performance and capacity requirements by employing multiple storage resources. Compared to a traditional single storage resource architecture, our architecture provides a more flexible and reliable computing environment. This architecture can bring new opportunities for high performance computing as well as inherit state-of-the-art I/O optimization approaches that have already been developed. It provides application users with high-performance storage access even when they do not have the availability of a single large local storage archive at their disposal. We also develop an Application Programming Interface (API) that provides transparent management and access to various storage resources in our computing environment. Since I/O usually dominates the performance in I/O intensive applications, we establish an I/O performance prediction mechanism which consists of a performance database and a prediction algorithm to help users better evaluate and schedule their applications. A tool is also developed to help users automatically generate performance data stored in databases. The experiments show that our multi-storage resource architecture is a promising platform for high performance distributed computing.
Modeling drivers' speech under stress
Authors: Raul Fernandez, Rosalind W. Picard
Venue: Speech Communication (2003)

We explore the use of features derived from multiresolution analysis of speech and the Teager energy operator for classification of drivers' speech under stressed conditions. We apply this set of features to a database of short speech utterances to create user-dependent discriminants of four stress categories. In addition we address the problem of choosing a suitable temporal scale for representing categorical differences in the data. This leads to two modeling approaches. In the first approach, the dynamics of the feature set within the utterance are assumed to be important for the classification task. These features are then classified using dynamic Bayesian network models as well as a model consisting of a mixture of hidden Markov models (M-HMM). In the second approach, we define an utterance-level feature set by taking the mean value of the features across the utterance. This feature set is then modeled with a support vector machine and a multilayer perceptron classifier. We compare the performance on the sparser and full dynamic representations against a chance-level performance of 25% and obtain the best performance with the speaker-dependent mixture model (96.4% on the training set, and 61.2% on a separate testing set). We also investigate how these models perform on the speaker-independent task. Although the performance of the speaker-independent models degrades with, respect to the models trained on individual speakers, the mixture model still outperforms the competing models and achieves significantly better than random recognition (80.4% on the training set, and 51.2% on a separate testing set).
A possibilistic approach to selecting portfolios with highest utility score
Authors: Christer Carlsson, Robert Fullér, Péter Majlender
Venue: Fuzzy Sets and Systems (2002)

The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this paper we will assume that: (i) each investor can assign a welfare, or utility, score to competing investment portfolios based on the expected return and risk of the portfolios; and (ii) the rates of return on securities are modelled by possibility distributions rather than probability distributions. We will present an algorithm of complexity o(n3) for finding an exact optimal solution (in the sense of utility scores) to the n-asset portfolio selection problem under possibility distributions.
Revenue Management: Research Overview and Prospects
Authors: Jeffrey I. McGill, Garrett J. Van Ryzin
Venue: Transportation Science (1999)

This survey reviews the forty-year history of research on transportation revenue management (also known as yield management). We cover developments in forecasting, overbooking, seat inventory control, and pricing, as they relate to revenue management, and suggest future research directions. The survey includes a glossary of revenue management terminology and a bibliography of over 190 references.
Detection and restoration of tampered JPEG compressed images
Authors: Hsien-Chu Wu, Chin-Chen Chang
Venue: Journal of Systems and Software (2002)

To protect the integrity of digital images, our scheme proposes a technique based on standard JPEG still image compression. The proposed scheme can detect tampered images and can also recover them. Images are compressed using the JPEG compression technique, and the proposed scheme also incorporates an edge detection technique. First, the edge detection technique identifies the edges of the image before image compression takes place. The obtained edge characteristic is then embedded into the image immediately after compression. If the image is tampered during transmission, the embedded edge characteristic can be used to detect the tampered areas, and these tampered areas can be reconstructed using the interpolation method and the embedded edges. Therefore, the proposed scheme allows recipients to know that the image has been tampered with during transmission.
MR2RP: the multi-rate and multi-range routing protocol for IEEE 802.11 ad hoc wireless networks
Authors: Shiann-Tsong Sheu, Yihjia Tsai, Jenhui Chen
Venue: Wireless Networks (2003)

This paper discusses the issue of routing packets over an IEEE 802.11 ad hoc wireless network with multiple data rates (1/2/5.5/11 Mb/s). With the characteristics of modulation schemes, the data rate of wireless network is inversely proportional with the transmission distance. The conventional shortest path of minimum-hops approach will be no longer suitable for the contemporary multi-rate/multi-range wireless networks (MR2WN). In this paper, we will propose an efficient delay-oriented multi-rate/multi-range routing protocol (MR2RP) for MR2WN to maximize the channel utilization as well as to minimize the network transfer delay from source to destination. By analyzing the medium access delay of the IEEE 802.11 medium access control (MAC) protocol, the proposed MR2RP is capable of predicting the transfer delay of a routing path and finding the best one, which has the minimum transfer delay from source to destination. The proposed MR2RP may choose a longer path but with less contention competitors and buffer queuing delay. Simulation results show that MR2RP performs the load balancing and fast routing very well, and its call blocking probability is obviously lower than that of conventional minimum-hops approach with fixed transmission rate.
Large exploration for HW/SW partitioning of multirate and aperiodic real-time systems
Authors: Abdenour Azzedine, Jean-Philippe Diguet, Jean-Luc Pillippe
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper addresses the domain of fine and coarse grain HW / SW codesign for Real-Time System On-Chip. We propose a new method for the real-time scheduling and the HW / SW partitioning of multi-rate or aperiodic tasks. The large design space exploration is based on parallelism/delay trade-off curves.
An Efficient Technique for Simulations of Viscoelastic Flows, Derived from the Brownian Configuration Field Method
Authors: C. Chauvière, A. Lozinski
Venue: SIAM Journal on Scientific Computing (2002)

In this paper we present a new approach for calculating viscoelastic flows. This method is derived from the Brownian configuration field method [M. A. Hulsen, A. P. G. Van Heel, and B. H. A. A. Van Den Brule, J. Non-Newtonian Fluid Mech., 70 (1997), pp. 79--101] for the simulation of flows of dilute polymeric solutions. The method presented here has the same attractive features as those in a previous work [C. Chauviere, SIAM J. Sci. Comput., 23 (2002), pp. 2123--2140], i.e., improved stability in comparison with traditional methods starting from closed-form constitutive equations. Moreover, the method developed here has the additional advantage of being significantly more CPU efficient. Results are presented by solving the benchmark problem of the flow of an Oldroyd-B fluid past a cylinder in a channel using a spectral element method to demonstrate the advantages of the proposed method.
The generalized inverse A(2)T and its applications
Authors: Chong-Guang Cao, Xian Zhang
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The existence and representations of some generalized inverses, including AT,*(2), AT,*(1,2), AT,*(2,3), A*,S(2), A*,S(1,2), and A*,S(2,4), are showed. As applications, the perturbation theory for the generalized inverse AT,S(2) and the perturbation bound for unique solution of the general restricted system Ax = b (dim(AT) =dimT, b ∈ AT and x ∈ T) are studied. Moreover, a characterization and representation of the generalized inverse AT,*,(2) is obtained.
Adding value to simulation/games through internet mediation: the medium and the message
Authors: Andrew Martin
Venue: Simulation and Gaming (2003)

This theoretical article identifies and classifies the added value of internet mediation to simulation/games to inform their design, evaluation, and research. The fundamental capabilities of the Internet are to support communication and access to multimedia information resources readily and economically across the global computer network. The article proposes a framework that maps out how these capabilities can contribute to development, operation, or strategic learning outcomes of simulation/games. It discusses the validity, application, and implications of the framework. It concludes that Internet mediation lends itself particularly well to support computer-assisted simulation/games that use international collaboration of participants and information resources to develop skills and awareness in areas such as negotiation, decision making, and policy formulation in an intercultural context.
Metrics for design space exploration of heterogeneous multiprocessor embedded systems
Authors: Donatella Sciuto, Fabio Salice, Luigi Pomante, William Fornaciari
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper considers the problem of designing heterogeneous multiprocessor embedded systems. The focus is on a step of the design flow: the definition of innovative metrics for the analysis of the system specification to statically identify the most suitable processing elements class for each system functionality. Experimental results are also included, to show the applicability and effectiveness of the proposed methodology.
Differential operators having Sobolev-type Jacobi polynomials as eigenfunctions
Authors: H. Bavinck
Venue: Journal of Computational and Applied Mathematics (2003)

In a recent paper Koekoek and Koekoek (J. Comput. Appl. Math. 126 (2000) 1-31) discovered a linear differential equation for the Jacobi-type polynomials {Pnα,β,M,N (x)}n=0∞, which are orthogonal on [- 1,1] with respect to Γ(α + β + 2)/2α+β+1 Γ(α + 1)Γ(β + 1)(1 - x)α(1 + x)β +Mδ(x + 1) + Nδ(x - 1),α,β, > - 1, M,N ≥ 0. (0.1) If M2 + N2 > 0 this differential equation is of finite order in the following cases: (1) M > 0,N = 0 and β ∈ {0,1,2,...}. (2) M = 0,N > 0 and α ∈ {0,1,2,...}. (3) M > 0,N > 0 and α,β ∈ {0,1,2,...}. In this paper the result will be generalized to Sobolev-type Jacobi polynomials.
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
Authors: Luca Bertazzi, Giuseppe Paletta, M. Grazia Speranza
Venue: Transportation Science (2002)

We consider a distribution problem in which a set of products has to be shipped from a supplier to several retailers in a given time horizon. Shipments from the supplier to the retailers are performed by a vehicle of given capacity and cost. Each retailer determines a minimum and a maximum level of the inventory of each product, and each must be visited before its inventory reaches the minimum level. Every time a retailer is visited, the quantity of each product delivered by the supplier is such that the maximum level of the inventory is reached at the retailer. The problem is to determine for each discrete time instant the retailers to be visited and the route of the vehicle. Various objective functions corresponding to different decision policies, and possibly to different decision makers, are considered. We present a heuristic algorithm and compare the solutions obtained with the different objective functions on a set of randomly generated problem instances.
A fuzzy neural network for pattern classification and feature selection
Authors: Rui-Ping Li, Masao Mukaidono, I. Burhan Turksen
Venue: Fuzzy Sets and Systems (2002)

A fuzzy neural network with memory connections for classification, and weight connections for selection is introduced, thereby solving simultaneously two major problems in pattern recognition: pattern classification and feature selection. The proposed network attempts to select important features from among the originally given plausible features, while maintaining the maximum recognition rate. The resulting value of weight connection represents the degree of importance of feature. Moreover, the knowledge acquired by the network can be described as a set of interpretable rules. The effectiveness of this new method has been validated by using Anderson's IRIS data. The results are: first, the use of two features selected by our method from among the original four in the proposed network results in virtually identical classifier performance; and second, the constructed classifier is described by three simple rules that are of if-then form.
On the class of limit reliability functions of homogeneous series-"k-out-of-n" systems
Authors: Beata Milczek
Venue: Applied Mathematics and Computation (2003)

The problem of finding possible limit reliability functions of basic systems is well known For instance Gnedenko [Ann. Math. 44 (1943) 432-453] has found a class of possible limit reliability functions for series and parallel systems. Smirnov [Trudy Matem. Inst. im. V.A. Stelkova, 1949] has solved the problem for "k-out-of-n" systems. In this paper these two areas are brought together and a class of limit reliability functions of homogeneous series-"k-out-of-n" systems is presented. Moreover some applications are given as well.
On a condition for the union of spherical caps to be connected
Authors: H. Maehara
Venue: Journal of Combinatorial Theory Series A (2003)

Let c be a finite family of spherical caps of various sizes on a sphere in 3-space. A cap C ∈ c is called extremal if there is a great circle g such that the centers of those caps that intersect C lie in the same side of g, allowing some of them lie on g. We prove that if C contains no extremal cap, then the intersection graph of the caps in c is connected, and if furthermore every cap is smaller than a hemisphere, then the intersection graph is 2-connected. We also show that analogous assertions are no longer true in higher dimensions.
Computation of the modified Bessel function of the third kind of imaginary orders: uniform Airy-type asymptotic expansion
Authors: Amparo Gil, Javier Segura, Nico M. Temme
Venue: Journal of Computational and Applied Mathematics (2003)

The use of a uniform Airy-type asymptotic expansion for the computation of the modified Bessel functions of the third kind of imaginary orders (Kia(x)) near the transition point x = a, is discussed. In A. Gil et al., Evaluation of the modified Bessel functions of the third kind of imaginary orders, J. Comput. Phys. 17 (2002) 398-411, an algorithm for the evaluation of Kia(x) was presented, which made use of series, a continued fraction method and nonoscillating integral representations. The range of validity of the algorithm was limited by the singularity of the steepest descent paths near the transition point. We show how uniform Airy-type asymptotic expansions fill the gap left by the steepest descent method.