ppxscal/embedding_network huggingface dataset:
Prediction and calculation of morphological characteristics and distribution of assimilates in the ROSGRO model
Authors: E. Dayan, E. Presnov, M. Fuchs
Venue: Mathematics and Computers in Simulation (2004)

ROSGRO is a mechanistic photosynthesis-based model for better understanding of rose growth under a controlled environment. The rose canopy is composed of two types of shoots: flower shoots (FSs) and side shoots (SSs). Each shoot type is a complex of three components: stem internodes, compound leaflets and whorled petals, characterized by number, weight and morphological dimension. Light interception by the leaf area, photosynthesis and respiration are calculated in order to determine assimilates production and conversion into structural dry matter (DM). Subsequently, the model partitions the DM among plant organs and estimates spatial distribution of plant material from dry weight. DM partitioning between shoots derives from the potential growth rates established according to the potential growth of shoot templates. The potential growth can be estimated by morphological measurements on basal shoots (BSs). The growth and development of each shoot is arbitrarily divided into 20 age classes (ACs). In each AC, the apex of an FS or SS has similar morphogenetic information to the BS apex, but is deficient in its supply of assimilates. The model handles the daily bookkeeping of the number, weight, and length, area or volume of each component by considering birth and growth, death, entry and exit of components in each AC. The model predicts harvest dates and rates of picking by number and weight. It predicts flower quality characteristics and their seasonal evolution. The calculated numbers, weights, and average weights and lengths of picked flowers agree well with measured values.
Algebraic Properties of Totally Irreducible Elements of Clone Lattices
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Totally join- (meet-) irreducible elements areimportant for algebraic lattices since the join-(meet-) generates them. We study such elementsfor clone lattices, particularly for the clone latticeon a k-element universe. We show that inthis case the set of totally join- (meet-) irreducibleclones is countable; in particular thatthere are 2^{k - 1}(2^k- 2) countable descendingchains of such clones.
Finite State Transducers for Policy Evaluation and Conflict Resolution
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

This paper presents a formal framework for a policyrepresentation model based on Finite State Transducers(FSTs). The main motivation for this approach is to producethe formalities to represent the body of policies in anunambiguous way.Using well-known entities such as finite state machines,we propose interpretations and adaptations to the basic theoryto fit in the domain of policy based management. Policiesare modeled as finite state transducers that consumeevents, and a function we call a tautness function is definedto be on the transitions.The operations of finite state transducers are revised accordingly.In particular, we present determinization and intersectionoperations for FSTs that will mimic the modalityconflict resolution process between policies. We alsodemonstrate how the composition of transducers could beused to express constraints or meta-policies. In our approach,all the tasks associated with the conflict resolutionprocess can be done "a priori," and the computing of apolicy-evaluation is linear in the number of events, and independentof the number of policies.
Embedding instructive assertions in program design
Authors: David Ginat
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Computer programs are operational schemes. Many programmers design, describe, and justify their programs while solely thinking "operationally". Yet, an operational perspective is insufficient. For many years, the important role of an assertional perspective is advocated. However, this perspective is debated [5]. Many are deterred from employing it, possibly because it is displayed with formal notations and mathematical logic. The objective of this paper is to offer the elaboration of this perspective through a natural, informal embedment of assertions in the design process. The essential, revealing, and instructive role of informal, yet concise and accurate assertions is motivated and elaborated; first through three stimulating illustrations, and then with a general instructional approach.
PIPES: a public infrastructure for processing and exploring streams
Authors: Jürgen Krämer, Bernhard Seeger
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

PIPES is a flexible and extensible infrastructure providing fundamental building blocks to implement a data stream management system (DSMS). It is seamlessly integrated into the Java library XXL [1, 2, 3] for advanced query processing and extends XXL's scope towards continuous data-driven query processing over autonomous data sources.
A study of the behavior of several methods for balancing machine learning training data
Authors: Gustavo E. A. P. A. Batista, Ronaldo C. Prati, Maria Carolina Monard
Venue: ACM SIGKDD Explorations Newsletter (2004)

There are several aspects that might influence the performance achieved by existing learning systems. It has been reported that one of these aspects is related to class imbalance in which examples in training data belonging to one class heavily outnumber the examples in the other class. In this situation, which is found in real world data describing an infrequent but important event, the learning system may have difficulties to learn the concept related to the minority class. In this work we perform a broad experimental evaluation involving ten methods, three of them proposed by the authors, to deal with the class imbalance problem in thirteen UCI data sets. Our experiments provide evidence that class imbalance does not systematically hinder the performance of learning systems. In fact, the problem seems to be related to learning with too few minority class examples in the presence of other complicating factors, such as class overlapping. Two of our proposed methods deal with these conditions directly, allying a known over-sampling method with data cleaning methods in order to produce better-defined class clusters. Our comparative experiments show that, in general, over-sampling methods provide more accurate results than under-sampling methods considering the area under the ROC curve (AUC). This result seems to contradict results previously published in the literature. Two of our proposed methods, Smote + Tomek and Smote + ENN, presented very good results for data sets with a small number of positive examples. Moreover, Random over-sampling, a very simple over-sampling method, is very competitive to more complex over-sampling methods. Since the over-sampling methods provided very good performance results, we also measured the syntactic complexity of the decision trees induced from over-sampled data. Our results show that these trees are usually more complex then the ones induced from original data. Random over-sampling usually produced the smallest increase in the mean number of induced rules and Smote + ENN the smallest increase in the mean number of conditions per rule, when compared among the investigated over-sampling methods.
A model of dynamic interest management: interaction analysis in collaborative virtual environment
Authors: Dawei Ding, Miaoling Zhu
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Most previous collaborative virtual environments mainly use spatial aspect to implement interest management. However, it turns to be difficult to manage awareness using semantic or organization considerations, specially in densely populated open space environments. Aiming at this kind of applications, we propose a novel interest management model with dynamic interaction analysis in CVE. Our work is concerned with dynamic interaction in crowds, from which we derive the semantics of user behaviors, more specifically, the alteration of interest focus of users. Above all, we would define the construction of Interest Network. Then an interaction analysis approach is introduced to find out the interest focus of virtual humans. Psychology effects in crowd or a group of participants are also analyzed and incorporated in our approach. Lastly, a prototype virtual conference application is implemented to demonstrate the effects of our model on optimizing collaborative awareness.
Maximum Distance Codes in Matn,s (Zk) with a Non-Hamming Metric and Uniform Distributions
Authors: Steven T. Dougherty, Keisuke Shiromoto
Venue: Designs, Codes and Cryptography (2004)

We establish a bound on the minimum &rho; distance for codes in Matn,s (Zk) with respect to their ranks and call codes meeting this bound MDR codes. We extend the relationship between codes in Matn,s (Zk) and distributions in the unit cube and use the Chinese Remainder Theorem to construct codes and distributions.
Rapid prototyping of real-time control laws for complex mechatronic systems: a case study
Authors: M. Deppe, M. Zanella, M. Robrecht, W. Hardt
Venue: Journal of Systems and Software (2004)

Rapid prototyping of complex systems embedded in even more complex environments raises the need for a layered design approach. Our example is a mechatronic design taken from the automotive industry and illustrates the rapid-prototyping procedure of real-time-critical control laws. The approach is based on an object-oriented structuring allowing not only central control units but also distributed control units as needed by today's designs. The implementation of control laws is a hardware-in-the-loop simulation, refined in steps and reducing the simulation part at every one of these. On the lower level, common platforms, such as FPGAs, microcontrollers or specialized platforms, can be instantiated.
Implementing a scalable XML publish/subscribe system using relational database systems
Authors: Feng Tian, Berthold Reinwald, Hamid Pirahesh, Tobias Mayr, Jussi Myllymaki
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

An XML publish/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of this approach is limited by the amount of available physical memory. In this paper, we propose an implementation that uses a relational database as the matching engine. The heavy lifting part of evaluating a large number of subscriptions is done inside a relational database using indices and joins. We described several different implementation strategies and presented a performance evaluation. The system shows very good performance and scalability in our experiments, handling millions of subscriptions with moderate amount of physical memory.
Qvalue Method May Not Always Control False Discovery Rate in Genomics Applications
Authors: Xiao Yang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The qvalue method by Storey (2002, 2003) has been proved to be theoretically sound for controlling false discovery rate in many high throughput genomic applications. However, empirical evidences suggest that this method can be more stringent than other methods, such as Bonferroni adjustment and the FDR method by Benjamini and Hochberg (1995). We compare these methods for detection of gene differential expression in microarray data analysis. For microarray experiment with the purpose of gene discovery, where many genes are expected to be differentially expressed across different experimental conditions, the qvalue method generally performs well. However, for experiments with only a few genes expected to be differentially expressed, the q-value method performs much worse than other methods. Some insights are provided to examine this discrepancy. Adjustments to q-value method are recommended to accommodate many applications.
Operating System Function Reuse to Achieve Low-Cost Fault Tolerance
Authors: Portolan Michele, Leveugle Regis
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

The aim of this article is to propose a new approach toFault Tolerance in single processor embedded systemsthat is centred on the Operating System. Particularattention is put on low-cost techniques that exploitfunctions already present in the system in a different-than-usual way to achieve protection with little or nointervention at the application level. An example is given: the realization of a checkpoint and rollback schemethrough the context switch function.
Numerical calculation of the fluid dynamics of drop-on-demand jets
Authors: J. E. Fromm
Venue: IBM Journal of Research and Development (1984)

A numerical method that makes use of the complete incompressible flow equations with a free surface is discussed and used to study an impulsively driven laminar jet. Flow behavior dependence upon fluid properties (characterized by a Reynolds number over Weber number nondimensionalization) is compared jor drop integrity purposes. Several variations of square wave pressure history applied at a nozzle inlet are discussed in relation to drop velocities produced and structure of ejected drops. Timewise development of flow both interior and exterior to the nozzle is illustrated through computed contour sequences.
Palindrome studies (Part I): the palindrome concept and its applications to prime numbers
Authors: Henry Ibstedt
Venue: Smarandache Notions Journal (2004)

This article originates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a first set of numbers to apply the development of ideas and computer programs on. The study begins by exploring regular prime number palindromes. To continue the study it proved useful to introduce a new concept, that of extended palindromes with the property that the union of regular palindromes and extended palindromes form the set of Smarandache generalized palindromes. An interesting observation is proved in the article, namely that the only regular prime number palindrome with an even number of digits is 11.
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
Authors: Amotz Bar-Noy, Richard E. Ladner
Venue: SIAM Journal on Computing (2004)

We address the problem of designing optimal off-line algorithms that minimize the required bandwidth for media-on-demand systems that use stream merging. We concentrate on the case where clients can receive two media streams simultaneously and can buffer up to half of a full stream. We construct an O(nm) optimal algorithm for n arbitrary time arrivals of clients, where m is the average number of arrivals in an interval of a stream length. We then show how to adopt our algorithm to be optimal even if clients have a limited size buffer. The complexity remains the same.We also prove that using stream merging may reduce the required bandwidth by a factor of order $\rho L/\log(\rho L)$ compared to the simple batching solution where L is the length of a stream and $\rho\le 1$ is the density in time of all the n arrivals. On the other hand, we show that the bandwidth required when clients can receive an unbounded number of streams simultaneously is always at least 1/2 the bandwidth required when clients are limited to receiving at most two streams.
Grid Resources for Industrial Applications
Authors: Steve Taylor, Mike Surridge, Darren Marvin
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

We introduce Grid Resources for IndustrialApplications (GRIA), a project that aims to enablecommercial use of the Grid. GRIA enables serviceproviders to rent out spare CPU cycles, and clients tohire those CPU cycles. Web services play a key role in thearchitecture of GRIA, chiefly through theirinteroperability and security features - they provide awell-defined means of limiting clients' access to discreteoperations, thus allowing clients to do "work" on aremote application server without giving them full shellaccess to the server. In this paper, we focus onrequirements, business processes and security, andinteroperability and standardisation issues raised by thiswork. We also describe some of the lessons learnedthrough experience of designing, implementing anddeploying a prototype system, GRIA v1.
Computer Aided Design for Origamic Architecture Models with Polygonal Representation
Authors: Jun Mitani, Hiromasa Suzuki
Venue: Proceedings of the Computer Graphics International (2004)

An Origamic Architecture (OA) is a folded sheet of perforatedpaper from which a three-dimensional structure"pops up" when it is opened. It is similar to a "pop-upstory book", but its unique feature is that it is made purelyby cutting a single piece of paper. Because of this limitation,designing an OA requires considerable experience. We proposea computerised method which assists design of OAs.An OA is modelled using a set of planar polygons. Thismodel must satisfy the conditions required of a valid, realisableOA. A unique point of our method is the application ofboolean set operations to the polygons on the unfolded patternto guarantee that the model can be made from a singlesheet of paper. We also present a procedure for checking themodelýs validity. Additionally, we propose methods for creatingopenings, for generating unfolded patterns, and fordisplaying folding animation. We have implemented a systembased on these methods and demonstrated its usefulnessfor creating OA. Our system allows designers to intuitivelydesign OA models and to easily generate the unfolded patterns.
Interior Point Methods for Second-Order Cone Programming and OR Applications
Authors: Yu-Ju Kuo, Hans D. Mittelmann
Venue: Computational Optimization and Applications (2004)

Interior point methods (IPM) have been developed for all types of constrained optimization problems. In this work the extension of IPM to second order cone programming (SOCP) is studied based on the work of Andersen, Roos, and Terlaky. SOCP minimizes a linear objective function over the direct product of quadratic cones, rotated quadratic cones, and an affine set. It is described in detail how to convert several application problems to SOCP. Moreover, a proof is given of the existence of the step for the infeasible long-step path-following method. Furthermore, variants are developed of both long-step path-following and of predictor-corrector algorithms. Numerical results are presented and analyzed for those variants using test cases obtained from a number of application problems.
Mining complex matchings across Web query interfaces
Authors: Bin He, Kevin Chen-Chuan Chang, Jiawei Han
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sourcess. As a new attempt, this paper studies such matching as a data mining problem. Specifically, while complex matchings are common, because of their far more complex search space, most existing techniques focus on simple 1:1 matchings. To tackle this challenge, this paper takes a conceptually novel approach by viewing schema matching as correlation mining, for our task of matching Web query interfaces to integrate the myriad databases on the Internet. On this "deep Web," query interfaces generally form complex matchings between attribute groups (e.g., {author} corresponds to {first name, last name} in the Books domain). We observe that the co-occurrences patterns across query interfaces often reveal such complex semantic relationships: grouping attributes (e.g., {first name, last name}) tend to be co-present in query interfaces and thus positively correlated. In contrast, synonym attributes are negatively correlated because they rarely co-occur. This insight enables us to discover complex matchings by a correlation mining approach, which consists of dual mining of positive and negative correlations. We evaluate our approach on deep Web sources in several object domains (e.g., Books and Airfares) and the results show that the correlation mining approach does discover semantically meaningful matchings among attributes.
File sharing activities over BT Networks: pirated movies
Authors: Sai Ho Kwok
Venue: Computers in Entertainment (CIE) (2004)

Pirated movies are available for sale at low prices in many online stores such as eBay and MovieGoods. But a new way of distributing pirated movies based on Peer-to-Peer (P2P) networks, in particular BitTorrent (BT), which can cause even greater financial losses to the movie industry, has surged in popularity. The financial losses to the movie industry due to P2P can be more severe and long-lasting because (1) distributing the digital form of pirated movies is much easier; (2) copyright holders or movie publishers can do very little to prevent distribution over P2P networks, and they usually respond passively; and (3) pirated movies exist even before their official release since the Telesync (TS) version of movies shot in the cinema can be easily produced. For the movie industry to come up with an effective anti-piracy strategy to combat BT networks, it is necessary to understand the sharing activity of pirated movies in BT. This article presents data collected from two representative BT discussion groups to explain the file-sharing patterns of pirated movies over BT networks and to analyze their impact on other movies in the same series. "The Lord of The Rings" was chosen for our study. We were amazed at the speed that this unreleased Hollywood movie became available for download in BT. So our study is intended to generate insights as to when BT users began to show interest in the movie, to think about downloading it, to actually download and play the movie, and finally to leave BT undetected. This article concludes with suggestions on the design of an anti-piracy strategy.
Exploring Collective Communications on A Cluster of SMPs
Authors: Meng-Shiou Wu, Ricky A. Kendall, Srinivas Aluru
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

In this paper we investigate two strategies to improve the performance of collective communications on a cluster of SMPs. In the first part of the paper we explore the advantages and disadvantages of the commonly used strategy "optimize shared memory send and receive only". In the second part of the paper we show a model to design collective communications on SMP clusters which can be used to improve the disadvantages of the former strategy. Several collective operations are implemented through the later process, and the experimental results show better performance than vendor supplied implementations.
Incremental Validation of Policy-Based Systems
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Management and control of systems are becomingmore and more automated and based on policies that areexpressed in a suitable policy specification language.Such policies need to be validated to ensure correctoperation of the managed or controlled systems. The setof policies in a system is dynamic and is constantlychanging. When this set is very large, incremental policyvalidation is a topic worth exploring. In this paper, such anotion of incremental policy-validation is introduced. Thewell-known decision tables, a systems analysis tool, areadapted for representing policies. Based on suchadaptations, two algorithms are developed forincremental validation and they are compared, withrespect to the number of computations they require.