ppxscal/embedding_network huggingface dataset:
Efficient Algorithms for Multi-dimensional Block-Cyclic Redistribution of Arrays
Authors: Young Won Lim, Neungsoo Park, Viktor K. Prasanna
Venue: Proceedings of the international Conference on Parallel Processing (1997)

We present a uniform framework for a classical problem, redistribution of a multi-dimensional array. Using a generalized circulant matrix formalism, we derive eficient direct, indirect a,nd hybrid contention-free communication schedules. Our indirect schedule reduces the number of communication steps significantly compared with the previous approaches. Our approach exploits the regularity of the block-cyclic redistribution to minimize the index computation overheads. For the case of 2-d redistribution, when the block size increases by factors Of K1 and K2 along each dimension and the process topology remains fixed, our indirect schedule performs the redistribution in O(lOg(K1K2)) communication steps. For the case of fixed block size and the processor topology is transposed, our indirect schedule results in O(log(L/G)) communication Step. Implementations of our algorithms on the IBM SP-2 show superior performance over previous approaches.
A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution
Authors: Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to DNFs with small conjunctions. We use this to prove lower bounds for the Res(k) propositional proof system, an extension of resolution which works with k -DNFs instead of clauses. We also obtain an exponential separation between depth d circuits of bottom fan-in k and depth d circuits of bottom fan-in k +1. Our results for Res(k) are:1. The 2n to n weak pigeonhole principle requires exponential size to refute in Res(k), for k \leqslant \sqrt {{{\log n} \mathord{\left/ {\vphantom {{\log n} {\log \log n}}} \right. \kern-\nulldelimiterspace} {\log \log n}}}.2. For each constant k, there exists a constant w>k so that random w -CNFs require exponential size to refute in Res(k).3. For each constant k , there are sets of clauses which have polynomial size Res(k+1) refutations, but which require exponential size Res(k) refutations.
A Measure of Recognition Difficulty for a Character Image Database
Authors: Jung-Tae Kim, Sung-Yang Bang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A character image database plays an important role not only in the development stage but also for the evaluation of a handwritten character recognition system. Such a database is obtained from outside or customly made. But at this point there is no measure which tells the level of recognition difficulty of a given database. If such a measure is available, we can use it in many useful ways. Especially it will be valuable when we compare and evaluate the performance results of various systems since different databases whose recognition difficulities are unknown are usually used. In this paper we propose such a measure. We first define the entropy of a point of an image in the database. Then we obtain the measure by applying some normalizing factors to the entropy mentioned above. Note that such a measure should be used to compare the recognition difficulties of databases only of the same character set. We show that the proposed measure can be used for databases not only of different numbers of images per class but also of different image sizes. Finally we confirm that the proposed measure really reflects the relative recognition difficulties of databases by using real databases.
Simultaneous Compression of Makespan and Number of Processors Using CRP
Authors: Yiqun Ge, David Y. Y. Yun
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents a new 2D Compression (2DC) method for solving the multiprocessor scheduling (MS) problems to simultaneously achieve both objectives of minimizing the makespan and the number of processors used. Most existing approaches tend to focus on a very specific range of the MS problems, while risking the loss of the solution quality elsewhere. 2DC synthesizes two main classes of compression approaches in both the time and resource dimensions by utilizing the Constrained Resource Planning (CRP) paradigm to balance the resource utilization and conservation. Experimental results show that 2DC extends the range of the solution effectiveness when measured separately in terms of the time and resource dimensions. More significantly, the 2DC method exhibits a remarkable solution quality and stability when measured in terms of a 2D cost function.
A study of moment functions and its use in Chinese character recognition
Authors: Simon X. Liao, Qin Lu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Moment descriptors have been developed as features in pattern recognition since the moment method was first introduced. In this paper, new moment features for Chinese character recognition are proposed. These provide significant improvements in terms of Chinese character recognition, especially for those characters that are very close in shapes.
Statistical Considerations in Learning from Data
Authors: Henry E. Kyburg,  Jr.
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we focus on statistics. Classical statistics and Bayesian statistics are both employed in data mining. Both have advantages but both also have severe limitations in this context. We point out some of these limitations as well as s me of the advantages. The fact that we may need to take account of evidence both internal and external to the data set presents a difficulty for classical statistics. The need to incorporate an objective measure of reliability creates a difficulty for Bayesian statistics.We outline an approach to uncertainty that promises to capture the best of both worlds by incorporating both background knowledge and objectivity.
A Propagation Mechanism for Populated Schema Versions
Authors: Sven-Eric Lautemann
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Object-oriented database systems (OODBMS) offer powerful modeling concepts as required by advanced application domains like CAD/CAM/CAE or office automation. Typical applications have to handle large and complex structured objects which frequently change their value and their structure. As the structure is described in the schema of the database, support for schema evolution is a highly required feature. Therefore, a set of schema update primitives must be provided which can be used to perform the required changes, even in the presence of populated databases and running applications. In this paper, we use the versioning approach to schema evolution to support schema updates as a complex design task. The presented propagation mechanism is based on conversion functions that map objects between different types and can be used to support schema evolution and schema integration.
Piecewise Linear Modulation Model of Handwriting
Authors: Hao Chen, Oscar E. Agazzi, Ching Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A new piecewise linear modulation model of handwriting is proposed in this paper. In this model, the velocity of handwriting trajectory is modeled as the impulse response of a time varying second order system. For mathematical tractability, the entire trajectory is segmented into several non-overlapping frames, while the natural frequency and the damping factor of the system are assumed to vary linearly with time in each frame and are continuous along the entire trajectory. In other words, handwriting is regarded as an oscillation modulated by a continuous and piecewise linear signal. The parameters of this model are estimated by Powell's optimization algorithm which does not require the computation of the first order derivative. The number and lengths of the frames are decided by a modified binary search algorithm along with the estimation of parameters. This model has achieved very high data compression rate as well as accurate reproduction of real handwriting.
Measuring Real-Time Predictive Models
Authors: Sam Steingold, Richard Wherry, Gregory Piatetsky-Shapiro
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we examine the problem of comparing real-time predictive models and propose a number of measures for selecting the best model, based on a combination of accuracy, timeliness, and cost. We apply the measure to the real-time attrition problem.
Selection of Melody Lines for Music Databases
Authors: Michael Tang, Chi Lap Yip, Ben Kao
Venue: 24th International Computer Software and Applications Conference (2000)

One major approach to music retrieval is to model music as a sequence of features, after which traditional information retrieval techniques are applied on the sequence. Because of the temporal nature of music and the inexactness of user queries, most effort on music retrieval systems focus on issues such as indexing and approximation match. In contrast, the processing of music before feature extraction, such as the identification of melody track, were often considered easy or done. This may be the case in a controlled environment, such as one for musicology research, where human beings carefully analyze the pieces before being submitted to the database. However, in an environment where large volumes of music are obtained from the Web, manual music analysis is impractical. Since many well-known musical features often pertain to the melody of musical pieces, and users often remember the melody of a song, algorithms that select the melody tracks of a piece are important for Web-based content-based retrieval systems. In this paper, we describe a number of algorithms for automatic melody track selection in a music retrieval context. We will also study the performance of the algorithms by comparing their answers to those judged by human beings.
Distance Learning and CPD: Special Education and Knowledge Management
Authors: Phil Bayliss
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The field of special education has undergone major transformations in the recent past. UK Government legislation has focused practice on inclusive education which has shifted the focus for meeting special educational needs in ordinary schools away from professional/pedagogical models towards bureaucratic/organisational models. The shift in paradigm has required a shift in the development of teachers away from models of 'knowledge-in-action', towards an understanding of 'organisational knowledge' which iscontextualized and dynamic. The paper presents a view that organisational knowledge' can be supported through coherent research-based continuing professional development for teachers and educational leaders, which uses ICT to develop 'knowledge management' through supporting 'hyperlearning'. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Environmental Detectives: PDAs as a Window into a Virtual Simulated World
Authors: Eric Klopfer, Kurt Squire, Henry Jenkins
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

The use of computer simulations is changing the nature of scientific investigation and providing us unique insights into the way that the world works. As simulation moves from the desktop to more ubiquitous portable devices (such as PDAs), we can draw upon the uniqueaffordances of these devices - portability, social interactivity, context sensitivity, connectivity, and individuality. The purpose of this research project is to develop and examine a new simulation platform that is designed from the ground up for handheld to create augmented reality simulations (i.e. simulations that bridge virtual and real worlds). This paper describesEnvironmental Detectives, one such augmented reality simulation that is currently being developed at MIT. In the upcoming months, we will develop and test this concept as well as produce a suite of authoring tools that students and teachers can use to design their ownaugmented reality simulations.
A Formal Model of Software Pipelining Loops with Conditions
Authors: Dragan Milicev, Zoran Jovanovic
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper addresses the problem of parallelizing loops with conditional branches in the context of software pipelining. A new formal approach to this problem is proposed in the form of Predicated Software Pipelining (PSP) model. The PSP model represents execution of a loop with conditional branches as transitions of a finite state machine. Each node of the state machine is composed of operations of one parallelized loop iteration. The rules for operation movements between nodes in the PSP model are described. The model represents a new theoretical framework for further investigation of inherent properties of these loops.
Predicting Maintenance Effort with Function Points
Authors: Frank Niessink, Hans van Vliet
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Function Point Analysis (FPA) is a well-known method to measure the functionality of a system, from the user's point of view. Both Albrecht's original model and a local variant we studied assume that effort is primarily related to the size of a change. Analysis of data gathered on a major system over a period of 18 months does not confirm this relation. Rather, our data suggests that the size of the component to be changed has a much larger impact on effort than the size of the change itself. Furthermore, the various corrective factors of the function point model do not help to improve effort estimates in the environment we studied. Finally, we found that expert estimates outperform the function point estimates, while analogy-based estimates slightly outperform the expert estimates.
Nonextensive Entropic Image Thresholding
Authors: Israel Esquef, Marcelo Albuquerque, Márcio Abuquerque
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

In image processing, one of the most efficient techniques for image segmentation is entropy-based thresholding. In this work it was applied a generalized entropy formalism that represents a recent development in statistical mechanics. We propose, for the first time, an image thresholding method using a nonextensive entropy regarding the presence of nonadditive information content in some image classes. Preliminary results are shown.
A New Recursive Subclass of Domain Independent Formulas Based on Subimplication
Authors: Joonyeoub Sung, Lawrence J. Henschen
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We motivate and define subimplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible and deductive databases and show that under the subimplication completion they are domain independent and safe.
How Much Has Software Maintenance Changed Since 1983?
Authors: Ted Keller, Ned Chapin, Thomas M. Pigoski, Nicholas Zvegintzov
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

What are the important developments in software maintenance since 1983?. Is there quantitative proof or even qualitative evidence that these developments have made maintenance less expensive or easier to perform? How have developments and practices in managing software maintenance, reengineering, reverse engineering, program comprehension, impact analysis, maintenance tools, maintenance process, maintenance models, maintenance standards, and measurement of maintenance changed the quality and cost of maintenance since 1983? The panelists will address these issues.
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
Authors: Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHP_n^m where m = (1 + {1 \mathord{\left/ {\vphantom {1 {poly\log n)n}}} \right. \kern-\nulldelimiterspace} {poly\log n)n}}. This lower bound qualitatively matches the known quasi-polynomial-size bounded-depth Frege proofs for these principles. Our technique, which uses a switching lemma argument like other lower bounds for bounded-depth Frege proofs, is novel in that the tautology to which this switching lemma is applied remains random throughout the argument.
A Decision Support System for Software Reliability Engineering Strategy Selection
Authors: Ioana Rus, James S. Collofello
Venue: 23rd International Computer Software and Applications Conference (1999)

This decision support system was built to assist project managers to design and tailor the software development process to their specific projects for achieving required software reliability values. The decision support system has two subsystems: a knowledge-based expert system for reliability engineering strategy selection and a process simulator for strategy assessment. We present here the knowledge-based component for strategy selection assistance. The paper describes the framework for identifying software reliability engineering practices and the decision factors for selecting a subset of practices appropriate for the project, taking into account various project constraints. After identifying heuristics for making the selection decisions, we have developed a knowledge base and implemented an expert system to help a less experienced project manager with engineering the process in a product quality driven manner. The expert system is a rule based fuzzy logic system, developed by using the off-the-shelf FuzzyCLIPS shell.
Scalable Templates for Specification Reuse
Authors: Chia-Chu Chiang, Joseph E. Urban
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Software reuse should not be limited to only code. Software reuse should be engineered as early as possible in the software development life cycle. We address specification reuse by defining templates of specifications and then instantiating them to yield specific specifications. From the perspective of software reuse in the large, reusable templates should be created as scalably as possible. Existing technologies for building reusable templates suffer the problems of scalability. Schemes (generic and parameterized modules) in TUG (Tree Unified with Grammar) facilitate specifiers to build scalable templates hierarchically without replication. Reuse is performed vertically and horizontally. Vertical reuse makes a lower scheme inherit all features from its upper level scheme. Horizontal reuse makes a scheme reusable within the same level of abstraction. Parametric building and incremental building are two techniques for realizing the vertical and horizontal reuse. We present a scheme for a generalized inventory control system and demonstrate how a generalized inventory control scheme can be reused to model a library system. Finally, the capabilities, strengths, and weaknesses are discussed.
The Wargo System: Semi-Automatic Wrapper Generation in Presence of Complex Data Access Modes
Authors: Juan Raposo, Alberto Pan, Manuel Álvarez, Justo Hidalgo, Ángel Viña
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Semi-automatic wrapper generation tools aim to ease the task of building structured views over web sources. But the wrapper generation techniques presented up to date show several weaknesses when dealing with the complex commercial web sources of today, specially when constructing advanced navigational sequences for accessing data. We present Wargo, a semi-automatic wrapper generation tool, which has been used by non-programmer staff to successfully wrap more than 700 commercial web sources in several industrial applications.
Quantitative Aspects of Requirements Evolution
Authors: Stuart Anderson, Massimo Felici
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Requirements Evolution is considered one of the most critical issues in developing computer-based systems. Despite the recognised role of requirements in Software Engineering, Requirements Evolution still remains a phenomenon little understood from both quantitative and qualitative perspectives. This paper investigates our ability to understand the Requirements Evolution Process by means of metrics. The empirical investigation of an avionics industrial safety-critical case study assesses our ability to monitor Requirements Evolution by evolutionary trends and the Requirements Maturity Index (RMI). We propose an enrichment of the RMI in order to take into account process aspects and history of changes. The empirical results support the models underlying the proposed metrics. The empirical nature of this work allows to replicate the experiment in other industrial contexts and to benefit of our results.
An Object-Oriented Conceptual Modeling of Video Data
Authors: Young Francis Day, Serhan Dagtas, Mitsutoshi Iino, Ashfaq A. Khokhar, Arif Ghafoor
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We propose a graphical data model for specifying spatio-temporal semantics of video data. The proposed model segments a video clip into subsegments consisting of objects. Each object is detected and recognized, and the relevant information of each object is recorded. The motions of objects are modeled through their relative spatial relationships as time evolves. Based on the semantics provided by this model, a user can create his/her own, object-oriented view of the video database. Using the propositional logic, we describe a methodology for specifying conceptual queries involving spatio-temporal semantics and expressing views for retrieving various video clips. Alternatively, a user can sketch the query, by exemplifying the concept. The proposed methodology can be used to specify spatio-temporal concepts at various levels of information granularity.
"MatchMaker": Synchronising Objects in Replicated Software-Architectures
Authors: Frank Tewissen, Nelson A. Baloian, Heinz Ulrich Hoppe, Erich Reimberg
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

The authors present an approach and an existing implementation to support the object-wise synchronisation of general software entities. The software toolkit "MatchMaker" allows for synchronising already existing software applications by plugging in transparent event listener mechanisms that distribute information via a central server to other remote applications. Based on the original approach that was presented in 1995, the current implementation of "MatchMaker" serves as the communication basis in real world applications of three computer-integrated classrooms in Europe. Current developments are oriented towards the integration of promising technologies in the field of distributed computing. The main goal of "MatchMaker" is the provision of a powerful yet easily applicable high-level API for synchronising distributed objects.