ppxscal/embedding_network huggingface dataset:
Meta-patterns: Revealing Hidden Periodic Patterns
Authors: Wei Wang, Jiong Yang, Philip S. Yu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Discovery of periodic patterns in time series data has become an active research area with many applications. These patterns can be hierarchical in nature, where higher level pattern may consist of repetitions of lower level patterns.Unfortunately, the presence of noise m y prevent these higher level patterns from being recognized in the sense that two portions (of data sequence) that support the same (high level) pattern may have different layouts of occurrences of basic symbols. There may not exist any common representation in terms of raw symbol combinations; and hence such (high level) pattern may not be expressed by any previous model (defined on raw symbols or symbol combinations) and would not be properly recognized by any existing method. In this paper, we propose novel model, namely meta-pattern, to capture these high level patterns. As more flexible model, the number of potential meta-patterns could be very large. A substantial difficulty lies on how to identify the proper pattern candidates. However, the well-known Apriori property is not able to provide sufficient pruning power. A new property, namely component location property, is identified and used to conduct the candidate generation so that an efficient computation-based mining algorithm can be developed. Last but not least, we apply our algorithm to some real and synthetic sequences and some interesting patterns are discovered.
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
Authors: Sang Nguyen, Stefano Pallottino, Federico Malucelli
Venue: Transportation Science (2001)

This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.
Design of Capacitated Multicommodity Networks with Multiple Facilities
Authors: Yogesh K. Agarwal
Venue: Operations Research (2002)

This paper addresses the problem of designing a multicommodity network using several facilities with different costs and capacities. The problem is addressed in a special context of designing private telecommunications networks using Fractional-T1 services. The algorithm starts from any given solution of the problem and gradually improves it by solving a series of subproblems, arriving at a local minimum. The subproblem is defined over a subset of links, called the subnetwork, by using one of the links as the base link. It is shown that the subproblem can be formulated as a multiple choice knapsack problem that is solved by dynamic programming. Computational results and lower bounds are reported on problems of up to 20 nodes and up to 3 facilities. On most problems, the algorithm produces solutions within about 5% of lower bound on the average. Although it was not possible to compute lower bounds for larger problems, heuristic solutions and running times are reported for problems of up to 99 nodes and four facilities.
Intuitive visualizations for presence and recency information for ambient displays
Authors: Jaroslav Tyman, Elaine M. Huang
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The Semi-Public Displays project utilizes public displays to assist in the interactions of small groups. This paper describes a set of visualizations for presence information of group members designed for the displays. Here we show that visual mappings of such information can be intuitive. Through our interviews, we also identify data usage, data ambiguity, and data recording as issues influencing how comfortable participants were with privacy in relation to semi-public displays of such information.
One-pass evaluation of region algebra expressions
Authors: Matthew Young-Lai, Frank Wm. Tompa
Venue: Information Systems (2003)

A region algebra is a set of operators that take lists of regions as inputs and return lists of regions as results. Consider evaluating an operator tree that has region lists at the leaf nodes, operators at the internal nodes, and edges representing the data flow between the operators. A simple method is to evaluate operators one at a time in a bottom-up manner starting at the leaves. This requires that intermediate results be buffered in memory or written to disk.We describe an alternative method that merges the input region lists and performs the evaluation using a single pass over this merged list. This can be more efficient than evaluating operators one at a time since intermediate results are not buffered or written to disk.
A Relational Modeling System for Linear and Integer Programming
Authors: Atamtürk A., Johnson E. L., Linderoth J. T., Savelsbergh M. W. P.
Venue: Operations Research (2000)

We discuss an integer linear programming modeling system based on relational algebra. In this system, all modeling related activities, such as model formulation, model instantiation, and model and instance management, are done using simple operations such as selection, projection, and predicated join.
Image understanding methods in biomedical informatics and digital imaging
Authors: Marek R. Ogiela, Ryszard Tadeusiewicz
Venue: Computers and Biomedical Research (2001)

This paper will present new possibilities for the application of image recognition methods and AI application in biomedical informatics as well as semantically oriented analysis of 2D images of coronary arteries originating from coronography examinations. In particular this paper presents the possibilities for computer analysis and recognition of local stenoses of the lumen of coronary arteries via the application of syntactic methods of pattern recognition. Such stenoses are the result of the appearance of arteriosclerosis plaques, which in consequence lead to different forms of ischemic cardiovascular diseases. Such diseases may be seen in the form of stable or unstable disturbances of heart rhythm or infarction. Analysis of the correct morphology of these artery lumina is made possible with the application of syntactic analysis and pattern recognition methods, in particular with the attribute, context-free grammar of look-ahead LR(1) type.
Categorizing decision support systems: a multidimensional approach
Authors: D. J. Power
Venue: Decision making support systems: achievements, trends and challenges for (2002)

This chapter summarizes a multidimensional approach to categorizing specific decision support systems (DSS) developed in Power (2002) and related works. The suggested approach or expanded framework emphases evaluates DSS in terms of one primary dimension and three secondary dimensions. Managers and analysts need to examine what drives the DSS and provides the dominant functionality of the system. Then a DSS can be further categorized in terms of targeted users, purpose of the system and primary deployment technology. The framework can improve discussions about DSS and assist in organizing our current knowledge about DSS.
Defining a target distinctness measure through a single-channel computational model of vision
Authors: M. C. Aranda, J. Fdez-Valdivia, J. A. García
Venue: Pattern Recognition Letters (2003)

The main goal of this paper is to define a computational measure for quantifying the visual distinctness of targets in complex natural scenes, using a single-channel vision model. The basic features incorporated in the defined target distinctness measure are: (i) an adaptive contrast sensitivity function; (ii) an estimation of image contrast masking and (iii) an estimation of a set of interest points in the image. Several experiments are performed to determine the relative contribution of each of these factors to the measure, using the correlation with human performance data as the evaluation function.
Hardware-software cosynthesis of multi-mode multi-task embedded systems with real-time constraints
Authors: Hyunok Oh, Soonhoi Ha
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

An embedded system is called multi-mode when it supports multiple applications by dynamically reconfiguring the system functionality. This paper proposes a hardware-software cosynthesis technique for multi-mode multi-task embedded systems with real-time constraints. The cosynthesis problem involves three subproblems: selection of appropriate processing elements, mapping and scheduling of function modules to the selected processing elements, and schedule analysis. The proposed cosynthesis framework defines an iteration loop of three steps that solve the subproblems separately. One of the key benefits of such a modular approach is extensibility and adaptability. Moreover, unlike the previous approaches, the proposed technique considers task sharing between modes and hardware sharing between tasks at the same time. We demonstrate the usefulness of the proposed technique with a realistic multimode embedded system that supports three modes of operation with 5 different tasks.
Object-oriented implementation of a model for fuzzy temporal reasoning
Authors: Slobodan Ribarić, Bojana Dalbelo-Bašić, Drazen Tomac
Venue: Technologies for constructing intelligent systems: Tasks (2002)

A program object-oriented implementation of a new formal model for fuzzy temporal knowledge representation and reasoning in temporally rich domains is described in the paper. The model is based on the modification of the Petri Nets, called the Petri Nets with Fuzzy Time Tokens (PNFTT). It is suitable for knowledge bases design in intelligent systems that deal with vague, humanlike linguistic expressions.
On-line scheduling with tight deadlines
Authors: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
Venue: Theoretical Computer Science (2003)

This paper is concerned with the on-line problem of scheduling jobs with tight deadlines in a uni-processor system. It has been known for long that in such a setting, no on-line algorithm is 1-competitive (i.e., optimal) in the sense of matching the optimal off-line algorithm on the total value of jobs that meet the deadlines; indeed, no algorithm can be better than k-competitive, where k is the importance ratio of the jobs. Recent work, however, reveals that the competitive ratio can be improved to a constant if the on-line scheduler is equipped with a processor O(1) times faster (J. ACM 47(4) (2000) 617), and further to one when using a processor O(logk) times faster (Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2001, p. 755). This paper presents a new on-line algorithm for scheduling jobs with tight deadlines and shows that it is 1-competitive when using a processor that is only O(1) times faster.
Towards a semantics of proofs for non-commutative logic: multiplicatives and additives
Authors: V. Michele Abrusci
Venue: Theoretical Computer Science (2003)

Interpretation of proofs of the multiplicative-additive fragment of non-commutative logic, by using bimodules on coherent spaces and bilinear functions.
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
Authors: Masao Fukushima, Zhi-Quan Luo, Paul Tseng
Venue: SIAM Journal on Optimization (2002)

This paper presents a sequential quadratically constrained quadratic programming (SQCQP) method for solving smooth convex programs. The SQCQP method solves at each iteration a subproblem that involves convex quadratic inequality constraints as well as a convex quadratic objective function. Such a quadratically constrained quadratic programming problem can be formulated as a second-order cone program, which can be solved efficiently by using interior point methods. We consider the following three fundamental issues on the SQCQP method: the feasibility of subproblems, the global convergence, and the quadratic rate of convergence. In particular, we show that the Maratos effect is avoided without any modification to the search direction, even though we use an ordinary $\ell_1$ exact penalty function as the line search merit function.
Improving route lookup performance using network processor cache
Authors: Kartik Gopalan, Tzi-cker Chiueh
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Earlier research has shown that the route lookup performance of a network processor can be significantly improved by caching ranges of lookup/classification keys rather than individual keys. While the previous work focused specifically on reducing capacity misses, we address two other important aspects - (a) reducing conflict misses and (b) cache consistency during frequent route updates. We propose two techniques to minimize conflict misses that aim to balance the number of cacheable entries mapped to each cache set. They offer different tradeoffs between performance and simplicity while improving the average route lookup time by 76% and 45.2% respectively. To maintain cache consistency during frequent route updates, we propose a selective cache invalidation technique that can limit the degradation in lookup latency to within 10.2%. Our results indicate potentially large improvement in lookup performance for network processors used at Internet edge and motivate further research into caching at the Internet core.
Scalable analysis techniques for microprocessor performance counter metrics
Authors: Dong H. Ahn, Jeffrey S. Vetter
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Contemporary microprocessors provide a rich set of integrated performance counters that allow application developers and system architects alike the opportunity to gather important information about workload behaviors. Current techniques for analyzing data produced from these counters use raw counts, ratios, and visualization techniques help users make decisions about their application performance. While these techniques are appropriate for analyzing data from one process, they do not scale easily to new levels demanded by contemporary computing systems. Very simply, this paper addresses these concerns by evaluating several multivariate statistical techniques on these datasets. We find that several techniques, such as statistical clustering, can automatically extract important features from the data. These derived results can, in turn, be fed directly back to an application developer, or used as input to a more comprehensive performance analysis environment, such as a visualization or an expert system.
Higher-order averaging: periodic solutions, linear systems and an application
Authors: Hartono, A. H. P. van der Burgh
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

Existence and stability of periodic solutions by using second-order averaging when the vector field by first-order averaging vanishes, will be studied in this paper as well as its generalization to higher order. A special averaging algorithm for the computation of higher approximations of the fundamental matrix of linear equations with periodic coefficients is given. As an application the existence and stability of periodic solutions of an inhomogeneous second-order equation with time-dependent damping coefficient are studied.
For the Common Good? New Zealanders Comply with Quality Standards
Authors: Cynthia Barnhart, Natashia L. Boland, Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Rajesh G. Shenoi, Maria Humphries
Venue: Organization Science (1998)

The heralding of improved economic indicators has generated worldwide interest in New Zealand's economic experiment despite the growing concern about the social repercussions of such rapid economic liberalisation. This paper argues that the compliance of New Zealanders to this economic experiment was achieved through the simultaneous development of a discourse of economic liberalism and a discourse of "the management of quality" and the subsequent cooption of the latter by the former. As an experiment for potential global emulation, this paper cautions those who pin their hopes for social justice on a common commitment to increasing productivity in the context of neoconservative economic policy preferences.
Coherence for sharing proof-nets
Authors: Stefano Guerrini, Simone Martini, Andrea Masini
Venue: Theoretical Computer Science (2003)

Sharing graphs are an implementation of linear logic proof-nets in which a redex is never duplicated. In their usual formulation, sharing graphs present a problem of coherence: if the proof-net N reduces by standard cut-elimination to N', then, by reducing the sharing graph of N we do not obtain the sharing graph of N'. We solve this problem by changing the way the information is coded into sharing graphs and introducing a new reduction rule (absorption). The rewriting system is confluent and terminating. The proof exploits an algebraic semantics for sharing graphs.
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
Authors: Jeremy Gunawardena
Venue: Theoretical Computer Science (2003)

Discrete event systems provide a useful abstraction for modelling a wide variety of systems: digital circuits, communication networks, manufacturing plants, etc. Their dynamics--stability, equilibrium states, cyclical behaviour, asymptotic average delays--are of vital importance to system designers. However, in marked contrast to continuous dynamical systems, there has been little systematic mathematical theory that designers can draw upon. In this paper, we survey the development of such a theory, based on the dynamics of maps which are nonexpansive in the l∞ norm. This has its origins in linear algebra over the max-plus semiring but extends to a nonlinear theory that encompasses a variety of problems arising in other mathematical disciplines. We concentrate on the mathematical aspects and set out several open problems.
The Founding of Informs: a Decision Analysis Perspective
Authors: L. Robin Keller, Craig W. Kirkwood
Venue: Operations Research (1999)

We provide a decision analysis perspective on the decision making process leading to the merger of The Institute of Management Sciences (TIMS) and the Operations Research Society of America (ORSA) to form the Institute for Operations Research and the Management Sciences (INFORMS). Throughout the merger negotiation era from 1989 until the merger in 1995, discussion regarding a possible merger was framed in an objectives-oriented manner characteristic of decision analysis methods. In addition, as ORSA and TIMS officers, we applied multiobjective decision analysis and financial analysis methods in portions of the planning and negotiation process leading to the formation of INFORMS. The merger process serves as an instructive case study of the uses and limitations of formal decision analysis methods in strategy formulation and implementation.
Oxidation heat pulses in two-phase expansive flow in porous media
Authors: D. Marchesin, S. Schecter
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2003)

When air or oxygen is injected into a petroleum reservoir, and low temperature oxidation or combustion is induced, traveling oxidation fronts are observed to form.We construct a two-phase model for oxidation, involving air or oxygen and oil, that includes heat loss to the rock formation. We use Darcy's law and energy and mass balance equations. We take into account heat generation and the oil's ensuing viscosity reduction, volume and flow rate changes due to the reaction, capillary pressure, and heat diffusion. The main simplifications are (1) we neglect volume changes of gases due to pressure variations, since the latter are assumed to be small; (2) we assume that liquid water is absent; and (3) we assume that the same Arrhenius chemical reaction rate governs the oxidation of all hydrocarbons in the oil.Our analysis shows: (1) For small heat loss, the oxidation front is actually the lead part of a traveling pulse, while the trailing part of the pulse is a slow cooling process. The overall pulse has a triangular saw-tooth shape and may be long. (2) If the heat loss is too small, the pulse may be so long that only its lead front fits in an actual reservoir of finite length, so just this part of the pulse is observed. On the other hand, if the cooling is faster, not all oxygen is burned, a fact with deleterious consequences when tile unburned oxygen reaches the producing well. (3) If the heat loss is too large, the medium does not sustain oxidation pulses. This last result is proved under the further simplifying assumption of constant effective thermal conductivity.
Software Quality Evaluation Based on Expert Judgement
Authors: Tony Rosqvist, Mika Koskela, Hannu Harju
Venue: Software Quality Control (2003)

A method using expert judgement for the evaluation of software quality is presented. The underlying principle of the approach is the encoding of experts' tacit knowledge into probabilistic measures associated with the achievement level of software quality attributes. An aggregated quality measure is obtained based on preference statements related to the quality attributes. The technical objectives of the paper are&bull; to develop of a generic and operationally feasible measurement technique to transform the tacit knowledge of a software expert to a probability distribution depicting his/her uncertainty of the level of achievement related to a quality attribute;&bull; to develop rules for the construction of a consensus probability measure based on expert-specific probability measures;&bull; to derive a framework for specifying software quality strategy and for evaluating the acceptance of a software produced in a software development process; The above technical developments are used to support group decision-making regarding&bull; the launch or implementation decision of a software version;&bull; the allocation of resources during the software development process.
Partition-Reversible Markov Processes
Authors: Christos Alexopoulos, Akram A. El-Tannir, Richard F. Serfozo
Venue: Operations Research (1999)

This study introduces a generalization of reversibility called partition-reversibility. A Markov jump process is partition-reversible if the average numbers of its transitions between sets that partition the state space are equal. In this case, its stationary distribution is obtainable by solving the balance equations separately on the sets. We present several characterizations of partition-reversibility and identify subclasses of tree like, starlike, and circular partition-reversible processes. A new circular birth-death process is used in the analysis. The results are illustrated by a queueing model with controlled service rate, a multitype service system with blocking, and a parallel-processing model. A few comments address partition-reversibility for non-Markovian processes.
Measuring the Effectiveness of Overlapping Development Activities
Authors: Christian Terwiesch, Christoph H. Loch
Venue: Management Science (1999)

Overlapping development activities is widely used to reduce project completion times in product development. However, research on the applicability of the concept in di fferent technological environments remains scarce. So far, very few industry-specific studies have statistically confirmed an accelerating effect of overlap. In the present article we statistically measure the effectiveness of overlapping development activities in reducing project completion time. Building on analytical research in operations management, we argue that this effectiveness differs with the organization's capability to resolve uncertainty early in the process. Projects benefit more from over lap if they are able to resolve uncertainty early. This contingency view to overlapping development activities is tested based on data from 140 completed development projects across several global electronics industries.