ppxscal/embedding_network huggingface dataset:
Exploiting early sorting and early partitioning for decision support query processing
Authors: J. Claussen, A. Kemper, D. Kossmann, C. Wiesner
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

Decision support queries typically involve several joins, a grouping with aggregation, and/or sorting of the result tuples. We propose two new classes of query evaluation algorithms that can be used to speed up the execution of such queries. The algorithms are based on (1) early sorting and (2) early partitioning&ndash; or a combination of both. The idea is to push the sorting and/or the partitioning to the leaves, i.e., the base relations, of the query evaluation plans (QEPs) and thereby avoid sorting or partitioning large intermediate results generated by the joins. Both early sorting and early partitioning are used in combination with hash-based algorithms for evaluating the join(s) and the grouping. To enable early sorting, the sort order generated at an early stage of the QEP is retained through an arbitrary number of so-called order-preserving hash joins. To make early partitioning applicable to a large class of decision support queries, we generalize the so-called hash teams proposed by Graefe et al. [GBC98]. Hash teams allow to perform several hash-based operations (join and grouping) on the same attribute in one pass without repartitioning intermediate results. Our generalization consists of indirectly partitioning the input data. Indirect partitioning means partitioning the input data on an attribute that is not directly needed for the next hash-based operation, and it involves the construction of bitmaps to approximate the partitioning for the attribute that is needed in the next hash-based operation. Our performance experiments show that such QEPs based on early sorting, early partitioning, or both in combination perform significantly better than conventional strategies for many common classes of decision support queries.
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
Authors: S. Thomas McCormick, Scott R. S Smallwood., Frits C. R. Spieksma
Venue: Mathematics of Operations Research (2001)

The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for aircraft. Each maintenance period is a job, and the maintenance facilities are machines. In this context, there are very few different types of maintenances performed, so it is natural to consider the problem with only a small, fixed numberC of different types of jobs. Each job type has a processing time, and each machine is available for the same length of time. A machine can handle at most one job at a time, all jobs are released at time zero, there are no due dates or precedence constraints, and preemption is not allowed. The question is whether it is possible to finish all jobs. We call this problem theMultiprocessor Scheduling Problem with C job lengths (MSPC).Scheduling problems such as MSPC where we can partition the jobs into relatively few types such that all jobs of a certain type are identical are often calledhigh-multiplicity problems. High-multiplicity problems are interesting because their input is very compact: The input to MSPC consists of only 2 C + 2 numbers.For the caseC = 2 we present a polynomial-time algorithm. We show that this algorithm guarantees a schedule that uses the minimum possible number of different one-machine schedules, namely three. Further, we extend this algorithm to the case of machine-dependent deadlines (uniform parallel machines), to a multi-parametric case (that contains the case of unrelated parallel machines), and to some related covering problems. Finally, we give some counterexamples showing why our results do not extend to the caseC > 2.
Similarity learning for graph-based image representations
Authors: Ciro de Mauro, Michelangelo Diligenti, Marco Gori, Marco Maggini
Venue: Pattern Recognition Letters (2003)

Visual database engines are usually based on predefined criteria for retrieving the images in response to a given query. In this paper, we propose a novel approach based on neural networks by which the retrieval criterion is derived on the basis of learning from examples. In particular, the proposed approach uses a graph-based image representation that denotes the relationships among regions in the image and on recursive neural networks which can process directed ordered acyclic graphs. The graph-based representation combines structural and subsymbolic features of the image, while recursive neural networks can discover the optimal representation for searching the image database. A set of preliminary experiments on artificial images clearly indicate that the proposed approach is very promising.
Research Commentary: Workflow Management Issues in e-Business
Authors: Amit Basu, Akhil Kumar
Venue: Information Systems Research (2002)

Trends towards increased business process automation, e-commerce, and e-business have led to increasing interest in the field of workflow management. In this paper, we provide a perspective on the state of research in workflow management systems, and discuss possible future research directions in this area, with a particular emphasis on workflow systems in integrating interorganizational processes and enabling e-commerce solutions.
Radon concentration in the atmosphere as an indicator of the height of the mixing layer in the region of mining activity
Authors: L. Osrodka, K. Skubacz, J. Skowronek, E. Krajny, M. Wojtylak
Venue: Development and application of computer techniques to environmental studies (2002)

The main objective of this work was examination whether measurement of polonium 218Po concentration in the atmosphere could be useful to evaluate the height of the mixing layer as an alternative method in relation to the theoretical or remote sensing methods. Data analysis based on study of variation of chosen meteorological parameters and its comparison with changes of the radon emanation power. The Fourier-, Wavelet- and Regression analysis were used for this aim. Finally one has been ascertained that meteorological conditions indirectly influenced the radon emanation power however its consequences had an essential meaning. On the other hand the relationship between the daily variation of the mixing height and polonium 218Po concentration in the atmosphere at the ground level was determined. As a result one has been stated that the polonium concentration could be an indicator of the mixing layer.
Interconnect-aware high-level synthesis for low power
Authors: Lin Zhong, Niraj K. Jha
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Interconnects (wires, buffers, clock distribution networks, multiplexers and busses) consume a significant fraction of total circuit power. In this work, we demonstrate the importance of optimizing on-chip interconnects for power during high-level synthesis. We present a methodology to integrate interconnect power optimization into high-level synthesis. Our binding algorithm not only reduces power consumption in functional units and registers in the resultant register-transfer level (RTL) architecture, but also optimizes interconnects for power. We take physical design information into account for this purpose. To estimate interconnect power consumption accurately for deep sub-micron (DSM) technologies, wire coupling capacitance is taken into consideration. We observed that there is significant spurious (i.e., unnecessary) switching activity in the interconnects and propose techniques to reduce it. Compared to interconnect-unaware power-optimized circuits, our experimental results show that interconnect power can be reduced by 53.1% on an average, while reducing overall power by an average of 26.8% with 0.5% area overhead. Compared to area-optimized circuits, the interconnect power reduction is 72.9% and overall power reduction is 56.0% with 44.4% area overhead.
High-level circuit design
Authors: Eric C. R. Hehner, Theodore S. Norvell, Richard F. Paige
Venue: Programming methodology (2003)

We present two new ways to implement ordinary programs with logic gates. One, like imperative programs, has an associated memory to store state; the other, like functional programs, passes the state from one component to the next. Application-specific circuit design can be done more effectively by using a standard programming language to describe the function that a circuit is intended to perform, rather than by describing a circuit that is intended to perform that function. The resulting circuits are produced automatically; they behave according to the programs, and have the same structure as the programs. For timing, we use local delays, rather than a global clock or local handshaking. We give a formal semantics for both programs and circuits in order to prove our circuits correct. By simulation, we also demonstrate that the circuits perform favorably compared to others.
Functional programming concepts and straight-line programs in computer algebra
Authors: N. Bruno, J. Heintz, G. Matera, R. Wachenchauzer
Venue: Mathematics and Computers in Simulation (2002)

In this paper we present MILONGA, a language based on functional programming concepts, which was designed for the implementation of a new generation of nonterm-rewriting elimination algorithms for multivariate polynomial solving [J. Pure Appl. Alg. 124 (1998) 101-146; J. Pure Appl. Alg. 117/118 (1997) 277-317; Appl. Alg. Eng. Commun. Comput. 11 (4) (2001) 239-296; J. Complex. 17 (1) (2001) 154-211].These new algorithms profit from an alternative representation of multivariate polynomials by means of straight-line programs [Algebraic complexity theory, in: Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 634-671 (Chapter 11); Algebraic complexity theory, in: Grundlehren der mathematischen Wissenschaften, Vol. 315, Springer, Berlin, 1997] allowing an exponential improvement of theoretical complexity--with respect to computing time and memory space--upon traditional, term-rewriting procedures.There is a strong analogy between the way how these algorithms employ straight-line programs and the way how functional programming languages treat functions as first-class citizens. Taking advantage of this circumstance, the MILONGA language enables us to analyze the relevance of the functional programming paradigm for the particular kind of task of polynomial equation solving.The paper contains an exhaustive do-it-yourself description of the programming philosophy of MILONGA, of the development of its compiler, of the operational semantics of its run-time system and of the implementation of a couple of fundamental computer algebra procedures in this language.The practical efficiency of this philosophy and implementation is outlined by comparative benchmarking on significant test examples.
A note on the internal consistency of various preference representations
Authors: F. Chiclana, F. Herrera, E. Herrera-Viedma
Venue: Fuzzy Sets and Systems (2002)

In Chiclana et al. (Fuzzy Sets and Systems 97 (1998) 33) we presented a fuzzy multipurpose decision making model integrating different preference representations: preference orderings, utility functions and fuzzy preference relations. We complete the decision model studying its internal consistency.
A social perspective on information security: theoretically grounding the domain
Authors: Steve Clarke, Paul Drake
Venue: Socio-technical and human cognition elements of information systems (2003)

Information security has become a largely rule-based domain, substantially focusing on issues of confidentiality. But the standards developed to achieve this, both in the U.S. and in the UK, have not been adopted as widely as had been hoped.By casting information security as a human-centred domain, this chapter, by means of a critique fom a social theoretical perspective, seeks to offer a way forward to a more widely acceptable approach. Social philosophy, social theory, and empirical evidence all suggest a basis in critical social theory as a potential way forward, and an initial framework based on this, is developed within this study.All of this is seen to point toward information security seen as human action, mediated through subjective understanding, and this research is now focusing on the operationalisation of these concepts.
Anatomy of a native XML base management system
Authors: T. Fiebig, S. Helmer, C.-C. Kanne, G. Moerkotte, J. Neumann, R. Schiele, T. Westmann
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2002)

Several alternatives to manage large XML document collections exist, ranging from file systems over relational or other database systems to specifically tailored XML base management systems. In this paper we give a tour of Natix, a database management system designed from scratch for storing and processing XML data. Contrary to the common belief that management of XML data is just another application for traditional databases like relational systems, we illustrate how almost every component in a database system is affected in terms of adequacy and performance. We show how to design and optimize areas such as storage, transaction management - comprising recovery and multi-user synchronization - as well as query processing for XML.
Artificial life: an opportunity to include research in the computer science curriculum
Authors: Gloria Childress Townsend, Wade Hazel
Venue: Journal of Computing Sciences in Colleges (2001)

Student research and interdisciplinary work persist as desirable components of the undergraduate computer science experience; yet, few schools can afford to allocate scarce resources to these endeavors. The course described in this paper incorporates both student research and interdisciplinary work with minimal expenditure of instructor time. This is accomplished, in part, by a biologist and a computer scientist sharing instructor duties. Students receive journal articles pertaining to evolutionary biology that they study in order to produce computer simulations using genetic algorithms. The results of these simulations allow students to reach conclusions that they publicize in formal presentations and Web page publications.
Introducing computer-based telemedicine in three rural Missouri counties
Authors: Kimberly D. Harris, Joseph F. Donaldson, James D. Campbell
Venue: Advanced topics in end user computing (2002)

This study investigated predictors of utilization of the computer-based telemedicine in three rural Missouri counties. Participating health care agencies were given computers and access to an Internet-based workstation that provided e-mail and World Wide Web (WWW) services. Utilization data for e-mail messages sent and WWW pages accessed were collected through proxy servers. A survey was distributed to those employees who are enrolled in the Rural Telemedicine Evaluation Project (RTEP), which addressed perceptions of the Internet-based RTEP workstation. The results of the survey were analyzed to see how perceptions and demographic variables predicted actual utilization. The findings of the study revealed that for e-mail, behavioral intentions/attitude, age, organizational support, and time were the most significant predictors. For WWW, only the behavioral intentions/attitude subscale predicted utilization. The majority of respondents did not utilize the e-mail technology. Strategies need to be developed through training interventions and organizational policies to address non-utilization.
Stochastic-Tree Models in Medical Decision Making
Authors: Gordon B. Hazen, James M. Pellissier, Jayavel Sounderpandian
Venue: Interfaces (1998)

The stochastic tree is a recently introduced generalization of the decision tree which allows the explicit depiction of temporal uncertainty while still employing the familiar rollback procedure for decision trees. We offer an introduction to stochastic-tree modeling and techniques involved in their application to medical-treatment decisions. We also describe an application of these tools to the analysis of the decision to undergo a total hip replacement from the perspectives of an individual patient (via utility analysis) and of society (via cost-effectiveness analysis).
Arachne: adaptive network strategy in a business environment
Authors: Petri Vasara, Valdis Krebs, Laura Peuhkuri, Eero Eloranta
Venue: Computers in Industry (2003)

The dynamic behaviour of networks such as business webs is complex and poorly understood. While this is well known, actual studies creating and applying methodologies to quantify and structure the networks both as static snapshots and dynamic, changing landscapes have been relatively few-given the amount of literature devoted to value chains, b-webs and supply/ demand chains.This paper describes a framework for analysis of the structures and dynamics of networked relationships typical in the Internet era. In the paper, a fusion of traditional social network analysis (SNA) methods with business strategies is presented in the context of a wider methodology for strategic network analysis (our "Rosetta Stone"). As a demonstration of this wider concept, a methodology that utilises the results of SNA analysis for determination of company roles in the network of partnerships/ alliances is presented, together with visualisations developed for the Rosetta Stone and a neural network analysis.The case study, examining a real-world network of strategic alliances between 87 companies in the ICT sector, shows in our opinion that the methodology introduced here is capable of capturing the essentials of business networks to provide information for decision makers. Wider applications, e.g. for a new strategic perspective on the mastery of demand/supply networks, are easily identified.
Security flaws in 802.11 data link protocols
Authors: Nancy Cam-Winget, Russ Housley, David Wagner, Jesse Walker
Venue: Communications of the ACM (2003)

Understanding the difficulties in security protocol design and attempting to relocate the struggle between hacker and defender to a different protocol layer.
The Dynamics of Alignment: Insights from a Punctuated Equilibrium Model
Authors: Rajiv Sabherwal, Rudy Hirschheim, Tim Goles
Venue: Organization Science (2001)

Several prior articles have emphasized the importance of alignment between business and information system (IS) strategies, and between business and IS structures. Seeking to advance our understanding of alignment, we examine the dynamics of changes in alignment through strategy/structure interactions in the business and IS domains. More specifically, we address the following question:In what ways does alignment evolve over time? Changes in the strategic IS management profile (which includes business strategy, IS strategy, business structure, and IS structure) over time are examined using a punctuated equilibrium model, involving long periods of relative stability, or evolutionary change, interrupted by short periods of quick and extensive, or revolutionary, change. Case studies of changes in business and IS strategies and structure over long time periods in three organizations suggest that the punctuated equilibrium model provides a valuable perspective for viewing these dynamics.The cases suggest that a pattern of alignment may continue over a long period, because either the level of alignment is high or the managers do not recognize the low alignment as a problem. Revolutions, involving changes in most or all dimensions of the strategic IS management profile, interrupt the evolutionary changes. However, organizations hesitate to make such revolutionary changes in strategic IS management profiles. Complete revolutions apparently require a combination of strong triggers. Finally, post-revolution adjustments to one dimension of the strategic IS management profile seem to follow revolutionary changes.
Project Scheduling Under Partially Renewable Resource Constraints
Authors: Jan Böttcher, Andreas Drexl, Rainer Kolisch, Frank Salewski
Venue: Management Science (1999)

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially renewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make, e.g., timetabling and shift scheduling aspects, amenable to project scheduling. In addition, partially renewable resources serve to model complicated labor regulations. Furthermore, they cover traditional renewable and nonrenewable resource constraints as special cases. We consider makespan minimization as objective. For the exact solution of the problem we employ a basic enumeration scheme. In order to speed up convergence, we formulate bounds which take into account future resource consumption of partially renewable resources. Moreover, we generalize the serial scheduling scheme in order to get fast approximation methods. A rigorous assessment of the procedures is provided by solving ProGen instances generated under a full factorial test design. Besides the well-known problem parameters we employ additionally three parameters which control the generation of partially renewable resources.
Locality-conscious process scheduling in embedded systems
Authors: I. Kadayif, M. Kandemir, I. Kolcu, G. Chen
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

In many embedded systems, existence of a data cache might influence the effectiveness of process scheduling policy significantly. Consequently, a scheduling policy that takes inter-process data reuse into account might result in large performance benefits. In this paper, we focus on array-intensive embedded applications and present a locality-conscious scheduling strategy where we first evaluate the potential data reuse between processes, and then, using the results of this evaluation, select an order for process executions. We also show how process codes can be transformed by an optimizing compiler for increasing inter-process data reuse, thereby making locality-conscious scheduling more effective. Our experimental results obtained using two large, multi-process application codes indicate significant runtime benefits.
On the reversibility of uninorms and t-operators
Authors: Miquel Monserrat, Joan Torrens
Venue: Fuzzy Sets and Systems (2002)

Although the concept of reverse is given in (Publ. Math. Debrecen 12 (1973) 21-39) not only for a t-norm but also for any associative operator, the definition does not work in so general a case. In this paper, the concept of reverse is extended in an appropriate way to some kinds of associative operators like t-conorms, uninorms and t-operators. All continuous and reversible t-conorms are characterized and, after some results, an analogous characterization is also given for all semi-continuous reversible uninorms and all continuous reversible t-operators. In the last case, reversibility becomes a kind of transformation that converts a uninorm into a t-operator and viceversa. Finally, related to reversibility, uninorms and t-operators of moderate growth are studied.
Approximation of Point Sets by 1-Corner Polygonal Chains
Authors: José-Miguel Dí"az-Báñez, Francisco Gómez, Ferran Hurtado
Venue: INFORMS Journal on Computing (2000)

In this paper we consider some problems that belong to the interplay between the field of Facility Location and the area of Computational Geometry. Specifically, given a setS of points in the plane, we discuss several variations of the problem of finding monotone 1-corner polygonal chains that minimize the maximum vertical distance toS.
On the symmetric sequence and its some properties
Authors: Zhang Wenpeng
Venue: Smarandache Notions Journal (2002)

The main purpose of this paper is to prove that there is only one prime among the symmetric sequence. This solved the problem 17 of Professor F.Smarandache in [1].