ppxscal/embedding_network huggingface dataset:
An Automated, Segmentation-Based, Rigid Registration System for Cervigram" Images Utilizing Simple Clustering and Active Contour Techniques
Authors: Philip King, Sunanda Mitra, Brian Nutter
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this article, a technique for the automated registration of Cervigram¿ images willbe introduced. The motivation for the development of such a technique is warranted by the fact that registration is often a first step to other, more sophisticated, algorithms useful in medical applications. Such algorithms are typically processes developed for the tracking andmonitoring of patient health. The registration described in this article is segmentation-basedand utilizes a combination of clustering- and active contour-based methodologies. Theclustering algorithm is used to obtain an initial contour that will subsequently serve asinitialization for an active contour. The active contour, in conjunction with various internal andexternal forces, should converge to a more precise segmentation of the region of interest which, in this application, is the cervix. Once the segmentations are completed, more traditional registration techniques, such as those of Fourier- or correlation-based techniques, may be used to register the segmented images with more accuracy as the adverse effects stemming from the highly variable background features are no longer a source of error. For illustration purposes, the results from two patients are demonstrated at the end of this article.
Un amour mobile
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

A short animation about two characters living on a mobile, inspired by French illustrations from the 1920's. To achieve images that suited this style, custom software was written to render the 3D animated figures. The animation style derives from 2D and 3D conventions, exploring and University combining the spacial abstraction available to both. Copyright held by creator.
An operator load-balancing problem in a semi-automatic parallel machine shop
Authors: Dug Hee Moon, Dae Kyoung Kim, Jong Yun Jung
Venue: Computers and Industrial Engineering (2004)

This paper deals with a load-balancing problem among several operators in a semi-automatic parallel machine shop in which two types of machine are operated. The objective is to assign jobs to the proper machines and allocate machines to operators in order to minimize the unbalance of the workloads among operators under the constraints of available machine- and operator-time. There are two types of parallel machines and jobs are classified into the two types. However, operator can handle machines of both types.Although, this situation can be formulated with non-linear integer programming, it is difficult to solve this program. Therefore, a hierarchical heuristic solution procedure is suggested and the performance of the algorithm is evaluated with various data.
Integrity Management in Component Based Systems
Authors: Johan Muskens, Michel Chaudron
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

There is a need for mechanisms for maintaining and restoring software integrity on deployed systems. Dynamic replacement, removal and addition of components in deployed systems is supported by most component models. This is needed to enable the software on a device to evolve in the period that it is owned by a consumer, but endangers the integrity of the software on these devices. For high volume consumer devices the challenge is to keep the devices operating reliable and robust in the period that it is owned, used and possibly reconfigured by a consumer. To this end, we propose mechanisms and tools, for maintaining system integrity on deployed systems.
Hyperdatabases for Peer-to-Peer Data Stream Processing
Authors: Gert Brettlecker, Heiko Schuldt, Raimund Schatz
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

New sensor technologies, powerful mobile devices,and wireless communication standards strongly proliferateubiquitous and pervasive computing. This is particularlytrue for healthcare applications. Modern non-invasiveunobtrusive sensors enable sophisticated monitoring ofthe human body. As a result of this monitoring a growingamount of elderly people suffering from chronic diseaseswill benefit from an enhanced quality of life and improvedtreatment. Healthcare applications process a vastamount of continuously generated data, this has becomea serious challenge. Data stream managementaddresses this problem in general. However, healthcare applicationshave additional requirements, e.g., flexibilityand reliability. As a consequence, we propose the combinationof a sophisticated information infrastructure,called hyperdatabase, and data stream management. Hyperdatabasesalready allow for reliable process managementin a peer-to-peer fashion. In this paper, we elaboratethe close relation between distributed process managementand data stream management. Further, we show thatdata stream processing can significantly benefit from an infrastructurefor reliable process management. We presentthe architecture of our prototype infrastructure that supportsprocessing of continuous data streams with a highdegree of flexibility and reliability.
Debugging VHDL Designs: Introducing Multiple Models and First Empirical Results
Authors: Franz Wotawa
Venue: Applied Intelligence (2004)

Debugging is a time-consuming task. This holds especially for large programs that are usually written by different groups of programmers. An example for this observation is the hardware design domain. Nowadays hardware designs are written in special hardware description language, e.g., VHDL, by groups which work in different companies and places. Moreover, there is a high pressure for completing the system in time with a very high quality because of the huge costs for correcting a bug after manufacturing the circuit. In order to decrease time for debugging we introduce an approach for diagnosis of VHDL hardware designs and present first empirical results. In contrast to other debugging approaches we make use of model-based diagnosis which is a general diagnosis approach. The models we use are logical descriptions of the syntax and semantics of a VHDL program that can be automatically derived from the program at compile time. The main part of this paper describes a general model and the derivation of specialized models that capture only some aspects of the program. The specialized models should be used in a specific debugging situation where they deliver the most appropriate solution in reasonable time. In order to select such a model we propose the use of a probability-based selection strategy. For example, larger programs should be debugged using a model only distinguishing concurrent VHDL statements and not sequential statements. As a result of multi-model reasoning in this domain we expect performance gains allowing to debug larger designs in a reasonable time, and more expressive diagnosis results.
Integrating Concept Mapping and Semantic Web Technologies for Effective Knowledge Management
Authors: Diane Mularz, Margaret Lyell
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Exploring a new technology space is always a daunting task. Its complexity is increased when the area of interest spans thousands of publications with multiple definitions of terms, authors, and dimensions of investigations; when the technology space is many times a secondary but important element of the investigation being reported upon; and where there are many application domains. Furthermore, when the space must not only be reviewed but must also be analyzed to determine trends, state of the art/practice, and to provide promising research agendas, there is a need to find mechanisms and strategies for codifying the knowledge. The goal is an integrated knowledge map so that concepts can be captured, queried, and perhaps most importantly connections discovered and reasoned about. Such is the project that has motivated our exploration of concept mapping tools and has subsequently led us into the semantic web space with a vision that the integration of these two technologies would lead to a powerful knowledge management environment for unexplored and complex domains of study. We present here the results of an initial investigation into the exploration of a complex space, situate it in the context of an extended knowledge life cycle, and discus how semantic technologies can be leveraged to enhance concept mapping tools.
Exploring the relationship between information technology and business process reengineering
Authors: Mohsen Attaran
Venue: Information and Management (2004)

This study examines a series of relationships between information technology (IT) and business process reengineering (BPR). Specifically, it argues that those aspiring to do business process reengineering must begin to apply the capabilities of information technology. This paper provides a summary of IT roles in initiating and sustaining BPR and examines several companies that have successfully applied IT to reengineering. The paper also addressees barriers to successful implementation of reengineering and identifies critical factors for its success.
Gene Recovery of Two Genome-Filtration Sequencing Techniques When Applied to the Maize Genome
Authors: Xiequn Xu, W. Bradley Barbazuk, Yucheng Feng, Karel Schubert, Agnes P. Chan, Geo Pertea, Li Zheng, Foo Cheung, Yuandan Lee
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The large size of the maize genome and the expectation that most of the genome is represented by repetitive elements is a challenge to standard genome sequencing techniques. Genome-filtration sequencing techniques may target gene-rich reqions in the genome. Two such approaches, methylation filtration and high Cot selection, may provide rapid and cost-effective alternative to sequencing the maize genome. Approximately 450k sequence reads have been obtained from both methylation filtration (MF) and high Cot (HC) libraries, and these sequences have been clustered and assembled. An analysis was undertaken to examine whether MF and MC enrich for maize genes and target non-identical sequence space. Simple sequence repeat analysis and mapped marker coverage provide guages to examine whether MF and HC sample identical sequence space. Marker hits also provide evidence that MF and HC enrich for unique genic portions of the genome. Finally, the identification of maize and other protein sequences in the MF and HC sequence sets can indicate the expected fraction and coverage of the maize gene space by MF and HC.
On Migrating a Legacy Application to the Palm Platform
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Handheld computing devices such as Personal DigitalAssistants (PDAs) and the latest mobile phones are becomingwidespread, so migrating desktop applications to theseplatforms is of great interest to developers. However, littleinformation is available to guide the novice especiallyfor the Palm OS, the most popular platform in the PDAand smartphone arena. This paper highlights the migrationchallenges involved and potential directions in easingthis reengineering process. To explore the practical understandingand reengineering issues, a large legacy applicationwas partially migrated to Palm OS.
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Authors: Mohit Tawarmalani, Nikolaos V. Sahinidis
Venue: Mathematical Programming: Series A and B (2004)

This work addresses the development of an efficient solution strategy for obtaining global optima of continuous, integer, and mixed-integer nonlinear programs. Towards this end, we develop novel relaxation schemes, range reduction tests, and branching strategies which we incorporate into the prototypical branch-and-bound algorithm. In the theoretical/algorithmic part of the paper, we begin by developing novel strategies for constructing linear relaxations of mixed-integer nonlinear programs and prove that these relaxations enjoy quadratic convergence properties. We then use Lagrangian/linear programming duality to develop a unifying theory of domain reduction strategies as a consequence of which we derive many range reduction strategies currently used in nonlinear programming and integer linear programming. This theory leads to new range reduction schemes, including a learning heuristic that improves initial branching decisions by relaying data across siblings in a branch-and-bound tree. Finally, we incorporate these relaxation and reduction strategies in a branch-and-bound algorithm that incorporates branching strategies that guarantee finiteness for certain classes of continuous global optimization problems. In the computational part of the paper, we describe our implementation discussing, wherever appropriate, the use of suitable data structures and associated algorithms. We present computational experience with benchmark separable concave quadratic programs, fractional 0&#x2013;1 programs, and mixed-integer nonlinear programs from applications in synthesis of chemical processes, engineering design, just-in-time manufacturing, and molecular design.
Randomized parallel algorithms for the multidimensional assignment problem
Authors: Carlos A. S. Oliveira, Panos M. Pardalos
Venue: Applied Numerical Mathematics (2004)

The multidimensional assignment problem (MAP) is a combinatorial optimization problem arising in diverse applications such as computer vision and motion tracking. In the MAP, the objective is to match tuples of objects with minimum total cost. Randomized parallel algorithms are proposed to solve MAPs appearing in multi-sensor multi-target applications. A parallel construction heuristic is described, together with some variations, as wall as a parallel local search heuristic. Experimental results using the proposed algorithms are discussed.
Divisible Load Scheduling on Arbitrary Distributed Networks via Virtual Routing Approach
Authors: Zeng Zeng, Bharadwaj Veeravalli
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we propose a distributed algorithm forscheduling divisible loads originating from single site onarbitrary networks. We first propose a mathematical modeland formulate the scheduling problem as an optimizationproblem with an objective to minimize the processing timeof the loads. A number of theoretical results on the solutionof the optimization problem are derived. On the basisof these results, we propose our algorithm using the conceptof virtual routing. The proposed algorithm has threeattractive features - distributed working style, simple structure,in terms of implementation ease, and offers generalizedapproach for handling divisible load scheduling forany network topology. This is the first time in the divisibleload scheduling literature that a distributed strategy is attempted.
Digital maps for learning: a review and prospects
Authors: Ann Jones, Canan Blake, Clare Davies, Eileen Scanlon
Venue: Computers Education (2004)

Over the last 10 years there has been a rapid increase in the development and use of digital maps for teaching and learning in Higher Education. There is also a political drive to encourage and foster best practice in this area. This is part of a more general initiative on fostering the development and demonstrating the impact of the use of digital resources in education, as evidenced by recent funding programmes by JISC [1] in the UK and NSF [2] in the US. This paper presents and discusses the evaluation of digital resources to support the use of digital maps for learning. First it reviews the use of digital maps for learning, outlining the features that make them powerful tools, before then considering the more general literature on learners' use of maps which suggests that although they have great potential, the use of digital maps by learners may not be straightforward.The paper then discusses a project called 'e-MapScholar', which was funded by JISC [3]. The 'e-Map-Scholar' project has been developing tools and learning and teaching materials to enhance and support the use of geo-spatial data currently available within tertiary education, including digital map data. The project includes teaching case studies of how such resources can be used and have been used in practice. The e-MapScholar project serves to illustrate the possibilities of learning with digital maps and the challenge of delivering on this possibility. The final two sections of the paper discuss the outcomes of the e-MapScholar evaluation and conclude with prospects for the use of digital maps in education.
Focus and Context for Volume Visualization
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Scientific investigation and simulation have been producingincreasingly large datasets. Usually that kind ofdata is visualized employing some Scientific Visualizationtechnique. Another related field, Information Visualization,deals with non-scientific large scale data, using differentapproaches to achieve an effective understanding. This paperaims to bring these two fields together, proposing a taxonomyfor volume visualization, employing Information Visualizationtechniques, particularly the focus and contextidea. A prototype is being developed, which aims to implementand evaluate a number of solutions for this problem,identifying through demonstration which applicationswould benefit most from focus+context approaches. Thispaper describes work in progress.
The Kernel Craze
Authors: Ivaán Arce
Venue: IEEE Security and Privacy (2004)

Although kernel bugs have had serious security implications for the past three decades, researchers have not studied their importance or the mechanics for discovering, exploiting, and fixing them as much as theyýve focused on other information technology infrastructure components. Yet, over the past several years, an increasing number of kernel security vulnerabilities have demonstrated that the most important component of todayýs operating systems is not free of bugs--when these vulnerabilities are exploited, serious security incidents ensue.In this installment of Attack Trends, I focus on kernel security issues, recent vulnerabilities, and the emergence of publicly available exploit code for them.
Spoken Language Processing for Audio Archives of Lectures and Panel Discussions
Authors: Tatsuya Kawahara
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

Intelligent archiving systems of lectures and panel discussionsbased on automatic transcription and indexingare introduced. Our speech recognition system Julius hasbeen improved to deal with these kinds of spontaneousspeech. Transcriptions are automatically edited for improvingreadability, and then key sentences are indexedfor each segment based on statistically-derived discoursemarkers and topic words. For panel discussions consistingof multiple speakers, unsupervised speaker indexingis applied beforehand to segment audio into speakerturns. Thus, we realize efficient browsing of these audioarchives.
Some results concerning the Smarandache deconstructive sequence
Authors: Jason Earls
Venue: Smarandache Notions Journal (2004)

In this note some new primes which were found in the Smarandache Deconstructive Sequence (SDS(n)) are reported, unusual sequences involving SDS(n) are given, along with a list of factorizations for SDS(n). All computations were done with PARI/GP [3], except where noted.
Towards partnership in software subcontracting
Authors: Danilo Assmann, Teade Punter
Venue: Computers in Industry (2004)

As outsourcing of software is a growing market, the need for subcontracting also increases. Frequently, questions are asked like: 'What is the quality of my subcontractor? Or, is this company able to produce part(s) of our software?' Although asking the question is easy, answering it is confronted by the problem: 'How to assess the potential subcontractor before the product exists?' A range of assessment methods has been defined over the years as the result of in-house as well as public standardization projects. In this paper, the authors present an analysis of these existing methods and propose a 'best-of' approach: the so-called MASS: Method for Assessing Software Subcontractors.
Load management and high availability in the Medusa distributed stream processing system
Authors: Magdalena Balazinska, Hari Balakrishnan, Michael Stonebraker
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Medusa [3, 6] is a distributed stream processing system based on the Aurora single-site stream processing engine [1]. We demonstrate how Medusa handles time-varying load spikes and provides high availability in the face of network partitions. We demonstrate Medusa in the context of Borealis, a second generation stream processing engine based on Aurora and Medusa.
A Virtual Light Field Approach to Global Illumination
Authors: Mel Slater, Jesper Mortensen, Pankaj Khanna, Insu Yu
Venue: Proceedings of the Computer Graphics International (2004)

This paper describes an algorithm that providesreal-time walkthrough for globally illuminated scenesthat contain mixtures of ideal diffuse and specularsurfaces. A type of light field data structure is used forpropagating radiance outward from light emittersthrough the scene, accounting for any kind of L(S|D)*light path. The light field employed is constructed bychoosing a regular point subdivision over ahemisphere, to give a set of directions, and thencorresponding to each direction there is a rectangulargrid of parallel rays. Each rectangular grid of rays isfurther subdivided into rectangular tiles, such thateach tile references a sequence of 2D imagescontaining colour values corresponding to theoutgoing radiances of surfaces intersected by the raysin that tile. This structure is then used for final imagerendering. Propagation times can be very long and thememory requirements very high. This algorithm,however, offers a global illumination solution for real-timewalkthrough even on a single processor.
A geometric optics method for high-frequency electromagnetic fields computations near fold caustics: part II. the energy
Authors: J.-D. Benamou, O. Lafitte, I. Solliec, R. Sentis
Venue: Journal of Computational and Applied Mathematics (2004)

We present the computation of the amplitudes needed to evaluate the energy deposited by the laser wave in a plasma when a fold caustic forms. We first recall the Eulerian method designed in Benamou et al. (J. Comput. Appl. Math. 156 (2003) 93) to compute the caustic location and the phases associated to the two ray branches on its illuminated side. We then turn to the computation of the amplitudes needed to evaluate the energy. We use the classical geometrical form of the amplitudes to avoid the blow up problem at the caustic. As our proposed method is Eulerian we have to consider transport equations for these geometrical quantities where the advection field depends on the ray flow. The associated vector field structurally vanishes like the square root of the distance to the caustic when approaching the caustic. This introduces an additional difficulty as traditional finite difference scheme do not retain their accuracy for such advection fields. We propose a new scheme which remains of order 1 at the caustic and present a partial theoretical analysis as well as a numerical validation. We also test the capability of our Eulerian geometrical algorithm to produce numerical solution of the Helmholtz equation and attempt to check their frequency asymptotic accuracy.