ppxscal/embedding_network huggingface dataset:
Class Decomposition via Clustering: A New Framework for Low-Variance Classifiers
Authors: Ricardo Vilalta, Murali-Krishna Achari, Christoph F. Eick
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose a pre-processing step to classification thatapplies a clustering algorithm to the training set to discoverlocal patterns in the attribute or input space. Wedemonstrate how this knowledge can be exploited to enhancethe predictive accuracy of simple classifiers. Our focusis mainly on classifiers characterized by high bias butlow variance (e.g., linear classifiers); these classifiers experiencedifficulty in delineating class boundaries over theinput space when a class distributes in complex ways. Decomposingclasses into clusters makes the new class distributioneasier to approximate and provides a viable way toreduce bias while limiting the growth in variance. Experimentalresults on real-world domains show an advantagein predictive accuracy when clustering is used as a pre-processingstep to classification.
Efficiently handling feature redundancy in high-dimensional data
Authors: Lei Yu, Huan Liu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in pre-processing high-dimensional data for successful data mining. Traditionally, feature selection is focused on removing irrelevant features. However, for high-dimensional data, removing redundant features is equally critical. In this paper, we provide a study of feature redundancy in high-dimensional data and propose a novel correlation-based approach to feature selection within the filter model. The extensive empirical study using real-world data shows that the proposed approach is efficient and effective in removing redundant and irrelevant features.
Stimulating appropriate uses of simulation in design
Authors: James J. Rosenberg
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This article addresses the issue of educating undergraduate engineering students in the appropriate use of computer simulation in the design process. The premise that poorly designed assignments involving simulation can actually impair understanding is addressed. A set of goals for simulation-based exercises is suggested, and some tactics for meeting these goals are introduced. Finally, a specific example of a half-term assignment that is used to meet these goals is provided for illustration.
Two time scale global dynamical modelling of power electronic systems
Authors: S. Gusia, F. Labrique, D. Grenier, H. Buyse
Venue: Mathematics and Computers in Simulation (2003)

Global dynamical models of power electronic systems allow to compute their dynamics in a very easy way as they replace the switching behavior of the power electronic converter by a continuous process [F. Labrique, H. Buyse, G. Seguier, R. Bausiere, Les convertisseurs de l'electronique de puissance--Commande et comportement dynamique, vol. 5, Technique et Documentation, Lavoisier, Paris, France, 1998; H. Buyse, D. Grenier, F. Labrique, S. Gusia, Dynamic modelling of power electronic converters using a describing function like approach, in: Proceedings of the ELECTRIMACS'99 Conference, vol. 1, Lisbon, Portugal, 1999, pp. 7-14]. But they are unable to predict the ripples induced by the switching behavior of the power semiconductor switches.The aim of this paper is to show for power electronic systems using a power electronic converter working in a PWM mode, how it is possible to define a global dynamical model including a dynamical model of the ripple effects.
Hysteresis modeling in the MATLAB/power system blockset
Authors: Silvano Casoria, Gilbert Sybille, Patrice Brunelle
Venue: Mathematics and Computers in Simulation (2003)

This paper presents a static hysteresis model for the saturable transformer blocks in the Power System Blockset (PSB), a MATLAB/Simulink®-based simulation tool. This model will be available in version 3.0 of the PSB (also called SimPowerSystems) and offered as an alternative to the actual core saturation characteristic. The effect of hysteresis and eddy losses are of significance in the studies of: sub harmonic; residual flux effects on the transformer inrush currents; ferroresonance phenomena; harmonics generated by half-cycle saturation.The static model of hysteresis defines the relation between the flux Φ and the magnetization current (i.e. the current through the nonlinear inductance in the model) that is equal to the total excitation current measured in dc (when the eddy current losses are not present). It is useful under transient conditions and can represent minor loops.The principal points are: in transient conditions an oscillating current will produce minor asymmetrical loops; inside a minor loop the excitation curve depends only on the last two reversal points, and each curve tend to return to the reversal point previous to the last.A hysteresis design tool consisting of graphical user interface (GUI) allows precise adjustment to any major loop or saturation characteristic. An animation option of the GUI permits an open loop simulation so to visualize the operating point displacement within the major loop and the formation of the minor loops.Finally, an example case is described to illustrate remanent flux and inrush current at transformer energization.
Functional Coverage Metric Generation from Temporal Event Relation Graph
Authors: Young-Su Kwon, Chong-Min Kyung
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Functional coverage is a technique which can be used for checking the completeness of test vectors. In this paper, automatic generation of temporal events for functional coverage is proposed. The TERG(Temporal Event Relation Graph) is the graph where the nodes represent basic temporal property and the edges represent the time-shift value between two properties. Hierarchical temporal events are generated by traversing TERG such that invalid, or irrelevant properties are eliminated. Concurrent edge groups in TERG make it possible to generate more comprehensive temporal properties.
Mining Significant Pairs of Patterns from Graph Structures with Class Labels
Authors: Akihiro Inokuchi, Hisashi Kashima
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In recent years, the problem of mining association rulesover frequent itemsets in transactional data has been frequentlystudied and yielded several algorithms that can findassociation rules within a limited amount of time. Alsomore complex patterns have been considered such as orderedtrees, unordered trees, or labeled graphs. Althoughsome approaches can efficiently derive all frequent subgraphsfrom a massive dataset of graphs, a subgraph orsubtree that is mathematically defined is not necessarily abetter knowledge representation. In this paper, we proposean efficient approach to discover significant rules to classifypositive and negative graph examples by estimating atight upper bound on the statistical metric. This approachabandons unimportant rules earlier in the computations,and thereby accelerates the overall performance. The performancehas been evaluated using real world datasets, andthe efficiency and effect of our approach has been confirmedwith respect to the amount of data and the computation time.
Customizing lotus notes to build software engineering tools
Authors: Jun Ma, Holger M. Kienle, Piotr Kaminski, Anke Weber, Marin Litoiu
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Many software engineering research tools are stand-alone applications that have trouble interoperating with other development tools and do not fit well into the software developers' established work processes. Our main hypothesis is that in order for new tools to be adopted effectively, they must be compatible with both existing users and existing tools.Typically, software engineering teams in an organization share a set of common applications for their development activities that are a permanent part of each developer's everyday workflow. Among these applications are shrink-wrapped office tools such as IBM® Lotus®Notes®, which are used for tasks such as e-mail, scheduling, and project reports and presentations. These office tools are highly integrated and offer a mature, well-tested working environment, which can be customized to provide support for advanced software engineering tasks.This paper describes RENotes, a reverse engineering tool built by customizing Lotus Notes. RENotes targets software developers who use Notes as part of their work environment. We describe the features of Notes and how they can be used to layer new reverse engineering functionality on top.
A simple and scalable algorithm for the IP address lookup problem
Authors: Inbok Lee, Kunsoo Park, Yanghee Choi, Sung Kwon Chung
Venue: Fundamenta Informaticae (2002)

The IP address lookup problem is to find the longest matching IP prefix from a routing table for a given IP address and it has been a central bottleneck in speeding up the Internet. In this paper we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm does the IP address lookup in O (log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the whole data structure.
A fourth-order compact difference scheme on face centered cubic grids with multigrid method for solving 2D convection diffusion equation
Authors: Haiwei Sun, Ning Kang, Jun Zhang, Eric S. Carlson
Venue: Mathematics and Computers in Simulation (2003)

We present a fourth-order compact finite difference scheme on the face centered cubic (FCC) grids for the numerical solution of the two-dimensional convection diffusion equation. The seven-point formula is defined on a regular hexagon, where the strategy of directional derivative is employed to make the derivation procedure straightforward, efficient, and concise. A corresponding multigrid method is developed to solve the resulting sparse linear system. Numerical experiments are conducted to verify the fourth-order convergence rate of the derived discretization scheme and to show that the fourth-order compact difference scheme is computationally more efficient than the standard second-order central difference scheme.
A fuzzy logic paradigm for industrial economics analysis
Authors: Saeid H. Kashani
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Investment decision in assets with a high degree of "know-how" specificity under uncertainty in the sense of "adverse selection" is an important matter for policy-maker and enterprise managers. According to the "Transaction Cost Theory", these two variables affect deeply the motivation for vertical cooperation. On the other hand, with a given level of these variables, we can determine the organizational size of enterprise. A non appropriate size could provoke a considerable transaction costs due to the unnecessary transactions. In order to measure the impact of "adverse selection" and "know-how" specificity on the contract decision through a subcontractory production system in this paper, we developed a new panoramic vision using "fuzzy logic" methodology. The model applied the real data obtained of 17 enterprises in French automotive industry. Finally, the fuzzy index estimated is compared with the real data about the levels of contracting by the enterprises. The results show a powerful association between the real and fuzzy estimated data, and explain the behavior of contract decision in a pertinent way.
Special Issue: Evolutionary Design
Authors: Peter Bentley
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Throughout the natural world and our human-designed world, design and evolution seem to go hand-in-hand. Some of the most astonishing and complex designs known to humankind&mdash;the embryogeny process, the immune system, the brain, the very structure of DNA&mdash;are products of natural evolution, not human endeavor. In addition, the progress of our own designs seems evolutionary, as the best concepts from existing designs are combined with some small variation to produce the next generation of cars, computers, and indeed, most types of human design. And now, as the papers in this and subsequent special issues will show, our computers are allowing us to harness the power of evolution directly, to aid the design process.
CoMem: Designing an interaction experience for reuse of rich contextual knowledge from a corporate memory
Authors: R. Fruchter, P. Demian
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Managing and reusing knowledge in architecture, engineering, and construction firms can lead to greater competitive advantage, improved designs, and more effective management of constructed facilities. However, reuse often fails because knowledge is not captured; it is captured out of context, rendering it not reusable; or there are no formal mechanisms for finding and retrieving reusable knowledge. This paper presents ongoing research on design knowledge reuse that introduces the notion of knowledge in context from a corporate perspective. We argue that in order for knowledge to be reusable, the user should be able to see the rich context in which this knowledge was originally created and interact with it. We call a repository of such knowledge in context the corporate memory. We describe empirical observations of designers reusing knowledge from their personal design experiences. Based on these observations, we formalize two key activities in the process of knowledge reuse from a corporate repository: finding reusable items and understanding these items in context. We formalize six degrees of exploration that lead to understanding. We describe a prototype system, CoMem, that supports these activities. CoMem is distinguished from the document-centric state of practice solutions by its approach of &ldquo;overview first, zoom and filter, and then details on demand.&rdquo; In order to accomplish this approach we propose three metaphors: corporate map, fisheye lens, and storyteller. These metaphors and their implementation in CoMem are illustrated using an industry scenario.
Zero Sums in Abelian Groups
Authors: W. D. Gao, Y. O. Hamidoune
Venue: Combinatorics, Probability and Computing (1998)

Let k be a positive integer and G a finite abelian group of order n, where n&ge;k2&minus;4k+8. Then every sequence of 2n&minus;&frac14;k2+k&minus;2 elements in G assuming k distinct values has an n-subsequence with sum zero. This settles a conjecture of Bialostocki and Lotspeich.
The Construction of Contextual Def-Use Associations for Object-Oriented Systems
Authors: Amie L. Souter, Lori L. Pollock
Venue: IEEE Transactions on Software Engineering (2003)

This paper describes a program representation and algorithms for realizing a novel structural testing methodology that not only focuses on addressing the complex features of object-oriented languages, but also incorporates the structure of object-oriented software into the approach. The testing methodology is based on the construction of contextual def-use associations, which provide context to each definition and use of an object. Testing based on contextual def-use associations can provide increased test coverage by identifying multiple unique contextual def-use associations for the same context-free association. Such a testing methodology promotes more thorough and focused testing of the manipulation of objects in object-oriented programs. This paper presents a technique for the construction of contextual def-use associations, as well as detailed examples illustrating their construction, an analysis of the cost of constructing contextual def-use associations with this approach, and a description of a prototype testing tool that shows how the theoretical contributions of this work can be useful for structural test coverage.
Management of trusted citations
Authors: Christer Fernstrom
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

We discuss how references and citations within a document to particular sources can be verified and guaranteed. When a document refers through a quotation to another document, the reader should be able to verify that the reference is correct and that any quotation correctly represents the original text. The mechanism we describe enables the authentication of such quotations. It consists of:A notation to be used when expressing quotations. This notation allows a controlled degree of freedom to make alterations from the original text.Different means to check the correctness of such quotations with respect to the cited documents and to quotation rules.
Volunteering Personal Information on the Internet: Effects of Reputation, Privacy Initiatives, and Reward on Online Consumer Behavior
Authors: H. H. Teo, W. Wan, L. Li
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Internet has made it easier for firms to collect consumer information. However, consumers arereluctant to provide personal information or tend to provide false information online because of their concern of the privacy violation risks. Researchers have proposed several instruments to assuage consumers' privacy concern, and to induce them to provide personal information. However, the effectiveness and applicability of these instruments regarding firm's reputation have yet been sufficiently assessed. This study employed a 2*2*2 experimental design to examine the effects of reputation, fair information practices, and reward on the online consumer behavior of volunteering two types of personal information -- demographic and personal identifiable information -- on the Internet. Theoretical and practical Implications of findings were drawn.
Developing Microsoft Office Solutions: Answers for Office 2003, Office XP, Office 2000, and Office 97
Authors: Ken Bluttman
Venue:  (2003)

Build custom Microsoft Office solutions that solve real business problems--fast!Now, there's a practical, easy-to-use guide for every developer and power user who wants to solve real business problems with custom Microsoft Office applications.Packed with case studies and code examples, this book covers all of Office, not just one product. Ken Bluttman shares more than a decade's experience as an Office developer, demonstrating how to program every recent version, from Office 2003 back to Office 97. Working with Office 2003? You'll discover exactly how to make the most of its breakthrough XML support--including schemas, transformations, and more!Everything you need to know to develop custom Office applications: Covers Word, Excel, Access, PowerPoint, Outlook, and InfoPath Clearly explains the key Microsoft Office objects and methods Shows how to integrate multiple Office applications into a complete solution Includes full chapters on XML, InfoPath, and Smart TagsIncludes five chapter-length case studies! A custom mail merge application with Access and Word Create PowerPoint graphs with Excel data Automated Excel charts from imported XML data Using Word to repurpose raw XML data into useful content Using Microsoft's XML parser to overcome Office 2003 XML limitations
Exploring the Relationship Between Parallel Application Run-Time Variability and Network Performance in Clusters
Authors: Jeffrey J. Evans, Cynthia S. Hood, William D. Gropp
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Highly variable parallel application execution time is apersistent issue in cluster computing environments, and canbe particularly acute in systems composed of Networks ofWorkstations (NOWs). We are looking at this issue in termsof consistency. In particular, we are focusing on networkperformance. Before we can use techniques from fault managementto attain consistency, this paper presents our preliminaryanalysis of run-time variability from logs and experiments,exposing important issues related to systemic inconsistencyin NOW clusters. The characterization of applicationsensitivity can be used to set network performancegoals, thereby defining operational requirements. Networkperformance depends on the virtual topology imposed bythe scheduler's allocation of nodes and the communicationpatterns of the set of running applications. Therefore it isimportant to look at both the network and the cluster's centralizednode mapper (scheduler) as critical subsystems.
Some Inequalities for the Largest Eigenvalue of a Graph
Authors: V. Nikiforov
Venue: Combinatorics, Probability and Computing (2002)

Let &lambda;(G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then ***** insert CODING here *****This inequality was first conjectured by Edwards and Elphick in 1983 and supersedes a series of previous results on upper bounds of &lambda;(G).Let Ti denote the number of all i-cliques of G, &lambda; = &lambda;(G) and p = cl(G): We show ***** insert equation here *****Let &delta; be the minimal degree of G. We show ***** insert equation here *****This inequality supersedes inequalities of Stanley and Hong. It is sharp for regular graphs and for a class of graphs which are in some sense maximally irregular.
Three-dimensional modeling from images and video streams
Authors: Miguel Sainz
Venue:  (2003)

Image Based Modeling and Rendering (IBMR) is a fairly new field of research and experimentation with the goal of reducing the complexity of use and the execution time of the modeling of photorealistic 3D graphics. These new techniques can be used to develop methods and tools for acquiring and modeling objects, using pictures and/or video sequences as source data. In this work we present a novel pipeline to reconstruct full 3D photorealistic model reconstruction of real world objects from a set of images. The reconstruction process begins with the acquisition of an unrestricted video walkthrough inside or around the scene to be modeled. Robust digital image processing and computer vision techniques allow the use of low cost acquisition systems such as photo or video cameras. After acquiring and digitizing the frames, a tracking algorithm extracts significant 2D information of the video sequence. Then, a calibration process automatically calculates the 3D position of the tracked features, the 3D position and orientation of cameras and their internal parameters, such as the focal length. We have successfully developed novel algorithms that perform these calculations robust and computationally efficiently. We perform a spatial carving operation on a piece of virtual material containing the scene using a voxel carving methodology highly optimized to use the computation power of the actual videocards. Once this carving is finished, a modeling process obtains a representation suitable to be rendered. We propose three different representations which are a trade-off of different factors with the goal of achieving fast rendering: the final application might require from the 3D model representation several characteristics such as support for level of details (LODs), collision detection, interactive illumination and photorealistic quality. The proposed pipeline targets applications in areas such as Virtual Reality, Computer Gaming and Special Effects. All these environments require high quality 3D models for increased realism. Our approach allows obtaining such data directly from real world objects using images in a fast and automatic way.