ppxscal/embedding_network huggingface dataset:
Gradient Vector Flow Fields and Spiculated Mass Detection in Digital Mammography Images
Authors: Fengmei Zou, Yufeng Zheng, Zhengdong Zhou, Kwabena Agyepong
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In this paper, we proposed an algorithm for spiculated mass detection using digital down-sampled mammography images. In the algorithm, two-resulotion data is generated with a wavelet transform; For each resolution data, two gradient vector flow fields features, along with the standard deviation of a local edge orientation histogram, the mean, the standard deviation, and the standard deviation of the folded gradient orientations are extracted; a neural network classifier is used to generate spiculated mass masks; and the masks are filtered based on local relative intensity of the mammography images. The algorithm was tested using 200 mammograms including 100 massive images and 100 normal images from DDSM [17], in which FPI/TP of 1.0/0.88 and area of 0.71 under the ROC curve were obtained. The experimental results showed that the proposed method is efficient and robust.
Hardware-Accelerated Illustrative Medical Surface Visualization with Extended Shading Maps
Authors: Christian Tietjen, Roland Pfisterer, Alexandra Baer, Rocco Gasteiger, Bernhard Preim
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

In this paper, we introduce a new framework for the illustrative visualization of medical surface data. In most visualization frameworks, only light intensity is used to determine the surface shading. The analysis of medical textbooks reveals more complex shading approaches. The parameters of these approaches are mapped to different Shading Maps, which may be weighted and flexibly combined. We discuss the use of high-level attributes to simplify the specification. The resulting Shading Map is used as a lookup to determine the final intensity at a certain area. For this purpose, the rendering is accomplished on GPU by using OpenGL's Framebuffer Objects. This framework may be useful for interactive educational systems or for medical record printings.
A Dynamic Resource Broker and Fuzzy Logic Based Scheduling Algorithm in Grid Environment
Authors: Jiayi Zhou, Kun-Ming Yu, Chih-Hsun Chou, Li-An Yang, Zhi-Jie Luo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Grid computing is a loosely couple distributed system, and it can solve complex problem with large-scale computing and storage resources. Middleware plays important role to integrate heterogeneous computing nodes. Globus Toolkit (GT) is a popular open source middleware to build grid environment. However, a job submission has lots of complicate operations in GT especially in a large scale gird. Moreover, the information discovery component of Globus Toolkit can only provide the summarized information from Grid Head instead of each computing node. Furthermore, job scheduling is another important issue in the high performance Grid computing. An appropriate scheduling algorithm can efficiently reduce the response time, turnaround time and increase the throughput. In this paper, we develop a resource broker module for GT infrastructure, which can dynamically describe and discover the resource information of computing nodes. Moreover, we design an adaptive fuzzy logic scheduler, which utilizes the fuzzy logic control technology to select the most suitable computing node in the Grid environment. For verifying the performance of the proposed scheduling algorithm, we also implement a resource broker as well as fuzzy logic scheduler based on Globus Toolkit 4. The experimental results show our algorithm can reduce the turnaround time compared with round-robin and random dispatching methods. The experiments also show that our algorithm has better speed-up ratio than round-robin and random dispatching when number of computing nodes increasing.
Gene Expression Data Classification Using Independent Variable Group Analysis
Authors: Chunhou Zheng, Lei Zhang, Bo Li, Min Xu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Microarrays are capable of detecting the expression levels of thousands of genes simultaneously. In this paper, a new method for gene selection based on independent variable group analysis is proposed. In this method, we first used t-statistics method to select a part of genes from the original data. Then we selected the key genes from the selected genes by t-statistics for tumor classification using IVGA. Finally, we used SVM to classify tumors based on the key genes selected using IVGA. To validate the efficiency, the proposed method is applied to classify three different DNA microarray data sets. The prediction results show that our method is efficient and feasible.
Improving efficiency of a flooding-based routing protocol for underwater networks
Authors: Aditi Goel, Aiswariya G. Kannan, Ian Katz, Radim Bartoš
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Routing protocols based on limited flooding can be used reliably in small scale underwater networks for fleets of autonomous underwater vehicles (AUVs). Scalability issues inherent in flooding are addressed by COFSNET+ [3], a framework protocol that controls which nodes will retransmit a packet during its delivery. COFSNET+ does not specify a method for the selection of nodes; this paper proposes such a method, based on the past contribution of nodes in delivering packets to their destinations. A simulator study shows that the proposed method not only reduces the total number of nodes that retransmit a packet, but also that it can adapt to overcome packet loss conditions in the network. For scenarios where loss is negligible, the method converges on the equivalent of the shortest path. In case of higher packet loss rates, end-to-end robustness is achieved by allowing more nodes to retransmit each packet.
MOOGLE: A Model Search Engine
Authors: Daniel Lucrédio, Renata P. M. Fortes, Jon Whittle
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Models are becoming increasingly important in the software process. As a consequence, the number of models being used is increasing, and so is the need for efficient mechanisms to search them. Various existing search engines could be used for this purpose, but they lack features to properly search models, mainly because they are strongly focused on text-based search. This paper presents Moogle, a model search engine that uses metamodeling information to create richer search indexes and to allow more complex queries to be performed. The paper also presents the results of an evaluation of Moogle, which showed that the metamodel information improves the accuracy of the search.
A RFID Transmission System with a Security Agent
Authors: Heung-Kuk Jo, Hoon-Jae Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Radio Frequency Identification (RFID) systems can be applied to various areas. A RFID system is composed of tag, reader and host computer. The reader has an antenna for transferring the energy and sending/receiving of data. Recently, wireless communication between Reader and Host Computer isused much. In addition, wireless communication is good for mobility. But, wireless communication is weak to security, because everybody can take the ID Data. We suggest a solution to this problem, as ID data from tag is transferred to host computer by new encryption technology in the reader. In this paper, we show a algorithm that sends ID Data from reader to the receiver over wireless network using CC1020 chip. From this, the paper explains the system transferring ID data to the host computer over wireless. We proposed the secure RFID transmission-encryption technology for block cipher with OFB mode and stream cipher. The system contains a security agent for security managements and services.
XisQuê: An Online QA Service for Portuguese
Authors: António Branco, Lino Rodrigues, João Silva, Sara Silveira
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

This paper describes XisQuê (http://xisque.di.fc.ul.pt) an online service for real-time, open-domain question answering (QA) on the Portuguese Web.
Accommodative Belief Revision
Authors: Satu Eloranta, Raul Hakli, Olli Niinivaara, Matti Nykänen
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Accommodative revision is a novel method of non-prioritized belief revision. The epistemic state of an agent contains both knowledge that is immune to revision and beliefs that are allowed to change. Incoming information is first revised by the knowledge of the agent, and then the epistemic state of the agent is revised using this modified input. The properties of the method are studied and examples of its use are given.
Self-synchronizing robust texel watermarking in gaussian scale-space
Authors: Mathias Schlauweg, Dima Pröfrock, Benedikt Zeibich, Erika Müller
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

In this paper, we propose a new second generation watermarking method for still images that embeds information in the feature space using rational dither modulation. Embedding at a fixed raster, e.g., the pixel grid, is a big problem in all first generation watermarking approaches. In contrast, our approach does not work depending on any raster. We use a texture-based feature, the so-called gray-level blob in Gaussian scale-space, which is invariant to scaling, rotation, and translation. It is associated with the image content and thus independend of image geometry. Furthermore, we show that our new method is robust against a variety of attacks, such as lossy compression, contrast and luminance enhancement, bluring and sharpening as well as noise adding. In addition, due to embedding at no fixed raster and insertion/deletion error correction even after slight image cropping the watermark can be extracted.
Crosslingual Retrieval in an eLearning Environment
Authors: Cristina Vertan, Kiril Simov, Petya Osenova, Lothar Lemnitzer, Alex Killing, Diane Evans, Paola Monachesi
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper we are reporting about an ongoing project LT4eL (Language Technolohy for eLearning) aiming at improving the effectiveness of retrieval and accessibility of learning objects within a learning management system. We elaborate the process of building the domain ontology and present the multilingual support offered to the application.
Before the Web There Was Gopher
Authors: Philip L. Frana
Venue: IEEE Annals of the History of Computing (2004)

The World Wide Web, universally well known today, was preceded by an efficient software tool that was fondly named Gopher. The Internet Gopher, much like the Web, enabled users to obtain information quickly and easily. Why, then, did it disappear but the Web did not? Gopher faded into obscurity for two main reasons: hypertext and commerce. 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
JPEG Artifact Removal Using Error Distributions of Linear Coefficient Estimates
Authors: Mika Inki
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this paper we present a method for JPEG artifact removal. The method works by estimating the distribution of a DCT coefficient given the values of the other coefficients, and then computing the expected value of this distribution in the quantization interval. We use information from an area exceeding the original block boundaries. Our method requires only information about image covariance, from which we estimate the effects of the transformations and quantization used in JPEG, under certain assumptions about the distributions. We will show that our method significantly improves the mean square error in our testing. Additionally, our method is shown to visibly reduce blocking artifacts in the images. 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
Design Support of Reaction and Compounding Extruders
Authors: M. Schlüter, J. Stewering, E. Haberstroh, I. Assenmacher, T. Kuhlen
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

This section describes the different dimensions of integration inside the plastics processing domain as well as cross-organizational integration and collaboration issues. The presented results range from work process modeling up to technical process analysis for the design of compounding extruders in the chemical engineering context. Standard practices for the design of polymer compounding extruders were analyzed and afterwards formalized in cooperation with subproject I1 using methods and tools developed and used in the CRC 476. Fragments of these workflows were redesigned using innovative informatics functionality provided by the CRC's B-projects which provided the novel tool functionality. Exemplarily, the extruder simulation tool MOREX was integrated with the process-integrated modeling environment PRIME and coupled with BEMflow. The distributed analysis of 3D simulation results using KOMPAKT and TRAMP was developed, and a scenario showing the integration of the project management system AHEAD with the plastics engineering design tools was designed participatively. Another focus was set on an integrated visualization environment using Virtual Reality technology for different data from a number of simulation tools.
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer
Authors: Cuong Than, Guohua Jin, Luay Nakhleh
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differences to locate HGT events. Another approach is based on augmenting a species tree into a phylogenetic network to improve the fitness of the evolution of the gene sequence data under an optimization criterion, such as maximum parsimony (MP). One major problem with the first approach is that gene tree estimates may have wrong branches, which result in false positive estimates of HGT events, and the second approach is accurate, yet suffers from the computational complexity of searching through the space of possible phylogenetic networks.The contributions of this paper are two-fold. First, we present a measure that computes the support of HGT events inferred from pairs of species and gene trees. The measure uses the bootstrap values of the gene tree branches. Second, we present an integrative method to speed up the approaches for augmenting species trees into phylogenetic networks.We conducted data analysis and performance study of our methods on a data set of 20 genes from the Amborella mitochondrial genome, in which Jeffrey Palmer and his co-workers postulated a massive amount of horizontal gene transfer. As expected, we found that including poorly supported gene tree branches in the analysis results in a high rate of false positive gene transfer events. Further, the bootstrap-based support measure assessed, with high accuracy, the support of the inferred gene transfer events. Further, we obtained very promising results, in terms of both speed and accuracy, when applying our integrative method on these data sets (we are currently studying the performance in extensive simulations). All methods have been implemented in the PhyloNet and NEPAL tools, which are available in the form of executable code from http://bioinfo.cs.rice.edu .
Minimum Spanning Tree with Neighborhoods
Authors: Yang Yang, Mingen Lin, Jinhui Xu, Yulai Xie
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

We consider a natural generalization of the classical minimum spanning tree problem called Minimum Spanning Tree with Neighborhoods (MSTN) which seeks a tree of minimum length to span a set of 2D regions called neighborhoods. Each neighborhood contributes exact one node to the tree, and the MSTN has the minimum total length among all possible trees spanning the set of nodes. We prove the NP-hardness of this problem for the case in which the neighborhoods are a set of disjoint discs and rectangles. When the regions considered are a set of disjoint 2D unit discs, we present the following approximation results: (1) A simple algorithm that achieves an approximation ratio of 7.4; (2) Lower bounds and two 3-approximation algorithms; (3) A PTAS for this problem. Our algorithms can be easily generalized to higher dimensions.
Contour Extraction Algorithm Using a Robust Neural Network
Authors: Zhou Zhiheng, Li Zhengfang, Zeng Delu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

For the contour extraction from the images, the traditional active contour models may trap in local minimum and strongly depend on initial contour. A contour extraction algorithm based on a robust neural network is proposed in this paper. A searching series of circles are used in obtained feature pixels with adaptive threshold for the final curve function approaching by neural network. Robust back propagation algorithm has been used to control the final curve shape. The simulations also show that the proposed algorithm has a great performance for different kinds of images.
The AADL/S* Approach to Firmware Design Verification
Authors: W. Damm
Venue: IEEE Software (1986)

If microprogramming aims to provide direct hardware controlallowing fast, reliable, and flexible implementation of higher architectural layers how can high-level microprogramming languages be microarchitecture independent?
Domain Decomposition Methodology with Robin Interface Matching Conditions for Solving Strongly Coupled Problems
Authors: François-Xavier Roux
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

In the case of strongly coupled problems like fluid-structure models in aero-elasticity or aero-thermo-mechanics, a standard solution methodology is based on so called Dirichlet-Neumann iterations. This means that, for instance, the velocity at the interface between the two media is imposed in the fluid, the solution of the fluid problem gives a pressure that is imposed at the boundary of the structure, and then the solution of the problem in the structure gives a new velocity to be imposed to the fluid. This method is not always stable, depending on the relative properties of the media, unless a suitable relaxation parameter is introduced. In order to enforce both velocity and pressure continuity at the interface, the matching conditions can be formulated, like in domain decomposition methods, in a mixed form. This means that the boundary conditions derived in one physical domain from the other one is of Robin type. With Robin boundary condition, an interface stiffness, in the case of velocity-pressure conditions, is introduced. The optimal choice for this stiffness can be proved to be, in the case of linear problems, the so called "Dirichlet-Neumann" operator of the opposite domain, this means for the discrete equations, the static condensation on the interface of the domain stiffness matrix. Of course, the static condensation cannot be performed in practice, since it is extremely expensive and that the resulting matrix is dense. But it can be approximated in several ways. The underlying general idea behind that methodology is the following: with Robin boundary conditions on the interface, a constitutive law is imposed on the boundary of each media that should optimally exactly represent the interaction with the other media.
Evolving Robot Behaviour at Micro (Molecular) and Macro (Molar) Action Level
Authors: Michela Ponticorvo, Orazio Miglino
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

We investigate how it is possible to shape robot behaviour adopting a molecular or molar point of view. These two ways to approach the issue are inspired by Learning Psychology, whose famous representatives suggest different ways of intervening on animal behaviour.Starting from this inspiration, we apply these two solutions to Evolutionary Robotics' models. Two populations of simulated robots, controlled by Artificial Neural Networks are evolved using Genetic Algorithms to wander in a rectangular enclosure. The first population is selected by measuring the wandering behaviour at micro-actions level, the second one is evaluated by considering the macro-actions level. Some robots are evolved with a molecular fitness function, while some others with a molar fitness function. At the end of the evolutionary process, we evaluate both populations of robots on behavioral, evolutionary and latent-learning parameters.Choosing what kind of behaviour measurement must be employed in an evolutionary run depends on several factors, but we underline that a choice that is based on self-organization, emergence and autonomous behaviour principles, the basis Evolutionary Robotics lies on, is perfectly in line with a molar fitness function.