ppxscal/embedding_network huggingface dataset:
Ring-to-line mapping and orientation invariant transform for Chinese seal character recognition
Authors: Ching-Liang Su
Venue: International Journal of Computer Mathematics (2007)

The ring-to-line mapping technique is used to map an object image to straight-line signals. The vector magnitude invariant transform technique is used to transfer the object signal to an invariant vector magnitude quantity for object identification. Use of this transform technique allows the image rotation problem to be solved. Vertical magnitude quantity strips are generated to cope with the image-shifting problem. The algorithm developed can classify the object image precisely.
Improving analogy software effort estimation using fuzzy feature subset selection algorithm
Authors: Mohammad Azzeh, Daniel Neagu, Peter Cowling
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

One of the major problems with software project management is the difficulty to predict accurately the required effort for developing software applications. Analogy Software effort estimation appears well suited to model problems of this nature. The analogy approach may be viewed as a systematic development of the expert opinion through experience learning and exposure to analogue case studies. The accuracy of such model depends on characteristics of datasets. This paper examines the impact of feature subset selection algorithms on improving the accuracy of analogy software effort estimation model. We proposed a feature subset selection algorithm based on fuzzy logic for analogy software effort estimation models. Validation using two established datasets (ISBSG, Desharnais) shows that using fuzzy features subset selection algorithm in analogy software effort estimation contribute to significant results as other algorithms: Hill climbing, Forward subset selection, and backward subset selection do.
Performance Evaluation and Benchmarking of Six-Page Segmentation Algorithms
Authors: Faisal Shafait, Daniel Keysers, Thomas Breuel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Informative benchmarks are crucial for optimizing the page segmentation step of an OCR system, frequently the performance limiting step for overall OCR system performance. We show that current evaluation scores are insufficient for diagnosing specific errors in page segmentation and fail to identify some classes of serious segmentation errors altogether. This paper introduces a vectorial score that is sensitive to, and identifies, the most important classes of segmentation errors (over-, under-, and mis-segmentation) and what page components (lines, blocks, etc.) are affected. Unlike previous schemes, our evaluation method has a canonical representation of ground truth data and guarantees pixel-accurate evaluation results for arbitrary region shapes. We present the results of evaluating widely used segmentation algorithms (x-y cut, smearing, whitespace analysis, constrained text-line finding, docstrum, and Voronoi) on the UW-III database and demonstrate that the new evaluation scheme permits the identification of several specific flaws in individual segmentation methods.
Optimal Control and Geodesics on Quadratic Matrix Lie Groups
Authors: Anthony M. Bloch, Peter E. Crouch, Jerrold E. Marsden, Amit K. Sanyal
Venue: Foundations of Computational Mathematics (2008)

The purpose of this paper is to extend the symmetric representation of the rigid body equations from the group SO&#x2009;(n) to other groups. These groups are matrix subgroups of the general linear group that are defined by a quadratic matrix identity. Their corresponding Lie algebras include several classical semisimple matrix Lie algebras. The approach is to start with an optimal control problem on these groups that generates geodesics for a left-invariant metric. Earlier work by Bloch, Crouch, Marsden, and Ratiu defines the symmetric representation of the rigid body equations, which is obtained by solving the same optimal control problem in the particular case of the Lie group SO&#x2009;(n). This paper generalizes this symmetric representation to a wider class of matrix groups satisfying a certain quadratic matrix identity. We consider the relationship between this symmetric representation of the generalized rigid body equations and the generalized rigid body equations themselves. A discretization of this symmetric representation is constructed making use of the symmetry, which in turn give rise to numerical algorithms to integrate the generalized rigid body equations for the given class of matrix Lie groups.
CT Image Processing and Medical Rapid Prototyping
Authors: Jiman Han, Yi Jia
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, the three-dimensional (3D) models of body structures from Computed Tomography (CT) image are reconstructed in SolidWorks by using Planar Contour method and Medical Rapid Prototyping (MRP) models are performed. This paper reports how to transfer CT image into digital binary matrixes; then, to capture section contour points from medical image per slice, to create B-spline curve with the control points in each layer, to produce 3D solid model construction in SoildWorks environment; finally, to build medical rapid prototyping models by Z Corporation Printer. This effort is the first to develop image processing 3D visualization in SolidWorks. MRP data from 3D models are created simultaneously. The system performance is tested using truth CT image, and MRP example models of teeth and knee joint were manufactured. The results reveal that the accuracy of 3D reconstruction is acceptable.
Relevance-Feedback Image Retrieval Based on Multiple-Instance Learning
Authors: Duc A. Tran, S. R. Pamidimukkala, Phuong Nguyen
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

This paper describes the development of a novel content-based image retrieval system using Multiple-Instance Learning (MIL). MIL is designed for learning on bags, each composed of a number of instances (i.e., feature vectors). For a given bag, one or more instances may be responsible for the observed classification of the bag, but their identities are unknown. What we can observe is only the label of the bag and our aim is to predict the label of any given new bag. The image retrieval problem can be mapped to an MIL problem. Our contribution is a new way to improve the effectiveness of MIL in image retrieval. We have implemented a Web-based relevance-feedback image search system to illustrate the proposed idea, which shows that the search accuracy is encouraging.
Internet Filtering and Censorship
Authors: Samir N. Hamade
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Internet filtering is on the rise in the world today. It is being conducted in most western industrialized countries as well as developing countries and undemocratic regimes. Internet filtering software are used as tools to prevent Internet users from accessing or viewing materials that are considered unsafe or inappropriate. While many people support and encourage the use of these software to protect their children and communities, others see them as tools to deprive people from their own right to access information freely, and consider them tools for censorship in violation of the first amendment of the U.S. Constitution. This paper addresses the problem of Internet filtering by identifying the technology used to block information, and addressing the issue of who is using these software and whether filtering is considered protection or censorship. The paper concluded that while no one can object to the filtering and blocking of pornography, hate, violence and terror sites on the Internet, many warn against expanding the use of these software to oppress people and prevent them from exercising their rights of free access to information as part of their intellectual freedom.
Fitting convex surface to scattered data points with applications to medical imaging
Authors: Ravi S. Gautam, Sachin B. Patkar
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Designing surface models for products used in biomedical applications requires geometric softwares which can design good convex surfaces. Therefore the geometric modellers need to contain modules which can convexify a given grid of points, which in turn can be interpolated by surfaces using known algorithms to obtain almost convex surface. In this paper we explain our algorithm to design a smooth convex surface model for cranial implant fitting the cranial CT data in the least square sense.
Support vector machines for shade identification in urban areas
Authors: G. Pajares, J. M. Cruz, M. Belmonte
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

The aim of this paper is the identification of shades in urban areas for remote sensing images. The final goal consists in the risk minimization for image change detection algorithms. Correct shade identification help us to discard urban shades as urban changes. The main contribution of the paper is to focus the problem as a classification problem using the well founded Support Vector Machines theory. A comparative analysis is carried out against other classical existing classification methods where the performance of the proposed approach is verified.
BibNetMiner: mining bibliographic information networks
Authors: Yizhou Sun, Tianyi Wu, Zhijun Yin, Hong Cheng, Jiawei Han, Xiaoxin Yin, Peixiang Zhao
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Online bibliographic databases, such as DBLP in computer science and PubMed in medical sciences, contain abundant information about research publications in different fields. Each such database forms a gigantic information network (hence called BibNet), connecting in complex ways research papers, authors, conferences/journals, and possibly citation information as well, and provides a fertile land for information network analysis. Our BibNetMiner is designed for sophisticated information network mining on such bibliographic databases. In this demo, we will take the DBLP database as an example, demonstrate several attractive functions of BibNetMiner, including clustering, ranking and profiling of conferences and authors based on the research subfields. A user-friendly, visualization-enhanced interface will be provided to facilitate interactive exploration of a bibliographic database. This project will serve as an example to demonstrate the power of links in information network mining. Since the dataset is large and the network is heterogeneous, such a study will benefit the research on the analysis of massive heterogeneous information networks.
Towards a Specification Prototype for Hierarchy-Driven Attack Patterns
Authors: Joshua James Pauli, Patrick Henry Engebretson
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We propose the characteristics of a software tool that leverages specifying attack pattern details in understandable hierarchies. These hierarchies are currently manually populated from the vast CAPEC dictionary which consume an excessive amount of human resources and are wrought with the possibility of user error. Such a software tool will not only automate the population of these attack pattern hierarchies, but also provide system prerequisite information and suggested mitigation strategies for the system under design. The combination of system prerequisites, possible attack patterns, and necessary mitigation strategies gives system designers and developers a checklist-like artifact to consider as development moves from the design phase to the implementation phase.
Commit phase in timestamp-based stm
Authors: Rui Zhang, Zoran Budimlić, William N. Scherer,  III
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Timestamp-based Software Transactional Memory (STM)validation techniques use a global shared counter and timestamping of objects being written to reason about sequencing of transactions and their linearization points, while reducing the number of unnecessary validations that have to be performed, thus improving overall system performance. During the commit phase of a timestamp-based validation scheme, several actions have to be performed: locking of the objects being written to the memory, atomically incrementing a shared timestamp counter, updating timestamps for objects being committed to memory, performing a final validation of the transaction's consistency, and atomically effecting the the transaction's changes to the outside world. The order and manner in which these actions are performed can affect both the correctness of the STM implementation and the overall system performance. We identify several commit sequence designs, prove their correctness, and analyze their performance. We identify cases where timestamps do not have to be unique for different transactions committing concurrently, and cases where unnecessary updates of the global shared counter - which can trigger extra validations in other transactions, hurting performance - can be avoided. We evaluate these commit sequence designs on a set of benchmarks on a 16 processor SunFire SMP machine. We show that a carefully chosen commit sequence can improve overall system performance by up to 14% over the state of the art single counter timestamp-based validation techniques, and we show that it is possible to obtain high performance without incurring space overhead proportional to the number of objects in the system.
Improving Pattern-Based LTL Formulas for Automata Model Checking
Authors: Salamah Salamah, Ann Q. Gates, Steve Roach
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The Property Specification (Prospec) tool uses patterns and scopes defined by Dwyer et. al., to generate formal specifications in Linear Temporal Logic (LTL) and other languages. The work presented in this paper provides improved LTL specifications for patterns and scopes over those originally provided by Prospec. This improvement comes in the efficiency of the LTL formulas as measured in terms of the number of states in the Büchi automaton generated for the formula. Minimizing the size of the Büchi automata for an LTL specification provides a significant support to the area of model checking.
The parabolised stability equations for 3D-flows: implementation and numerical stability
Authors: Michael S. Broadhurst, Spencer J. Sherwin
Venue: Applied Numerical Mathematics (2008)

The numerical implementation of the parabolised stability equations (PSE) using a spectral/hp-element discretisation is considered, and the numerical stability of the governing equations is presented. Analogous to the primitive variable form of the two-dimensional PSE, the equations are ill-posed; although choosing an Euler implicit scheme in the streamwise z-direction yields a stable scheme for sufficiently large step sizes (@Dz>1/|@b|, where @b is the streamwise wavenumber). The source of the instability is a residual ellipticity that remains in the equations, and presents itself as an upstream propagating acoustic wave. Neglecting this term relaxes the lower limit on the step-size restriction. The @q-scheme is also considered, allowing the step-size restriction of the scheme to be determined. The explicit scheme is always unstable, whereas neglecting the pressure gradient term shows stable eigenspectra for @q>=0.5.
A blog-based dynamic learning map
Authors: Kun Te Wang, Yueh-Min Huang, Yu-Lin Jeng, Tzone-I Wang
Venue: Computers Education (2008)

Problem-based learning is a goal directed and constructive process for learners. When meeting problems, learners usually force themselves to form work groups in order to find a solution. Currently, blogs are becoming more popular and in fact has formed a community wherein people can share their learning experiences with others. Many pedagogical applications have adopted what are posted in the community for supplementary learning. Integrating blogs in an intelligent tutoring system means that learners can better regulate and enhance their own learning. In this study, a novel learning device, a blog-based dynamic learning map, which employs both information retrieval and automated scheduling techniques, is designed to provide useful blog articles to help learning. The relevant articles in blogs are used to promote learner engagement in their interactions with the learning map and hence achieve their goals more easily. An experimental course has been implemented and the results show that learners make use of the blog-based learning aid in a very positive way and can eventually cross the specified threshold in a test. The proposed approach can encapsulate the dynamic learning principles in cohesive and supportive ways. Thus it can lead learners to gain useful supplementary materials, shorten the learning time and offering expanded alternative viewpoints to use in the solution of assigned problems. Our results show that both the learners and lectures are very positive to the design of our blog-based dynamic learning map.
Towards Incorporating Discrete-Event Systems in Secure Software Development
Authors: Sarah Whittaker, Mohammad Zulkernine, Karen Rudie
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

When designers and developers create software they often overlook issues related to security. Ideally, protection of the program from illegal usage would be considered at each stage of this program’s life cycle. The proposition put forward here is to augment intrusion detection systems (IDSs) and employ them as a tool to support secure software development. Many state-based intrusion detection methods share structural and behavioural similarities with the set of processes known as discrete-event systems (DESs). A common structure for modelling DESs is the deterministic finite-state automaton. There exist several compatible anomaly detection techniques which construct finitestate machine models of normal behaviour through the decomposition of associated data (e.g., system calls, HTTP requests) into sequences of events. This paper proposes the application of decentralized DES theory to formally analyze and enhance these approaches to anomaly detection with misuse prevention. Models of misuse attacks are generated in the same manner as the legal usage representation, then augmented and integrated into the program model to prevent the execution of malicious sequences. The technique described herein simultaneously uses anomaly and misuse approaches to prevent and disable attacks before their completion.
A Behavioral Approach to Security
Venue: Queue (2007)

The CTO of Finjan, Yuval Ben-Itzhak, makes a strong case for a new approach to security that relies more on analyzing the behavior of suspicious code than signatures that have to developed after the attacks have already started. 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
Computation-Efficient Multicast Key Distribution
Authors: Lihao Xu, Cheng Huang
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose {\\em computation} complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree based schemes, this scheme provides much lower computation complexity, while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.
Microfabricated SERS-arrays with sharp-edged metallic nanostructures
Authors: Uwe Huebner, R. Boucher, H. Schneidewind, D. Cialla, J. Popp
Venue: Microelectronic Engineering (2008)

By means of e-beam lithography, vacuum evaporation and ion-beam etching we have developed fabrication routes for the realisation of very small and sharp-edged metallic nanostructures which can be used as substrates for surface enhanced Raman spectroscopy (SERS). The metallic nanostructures are made from gold, are periodically arranged with a pitch of 250nm and have sharp edges with corner radii of less than 20nm. These structures show uniform SERS-signals across the whole field size of 200x200@mm^2, and a dependency of the SERS signal intensity and of the signal-to-noise ratio on the pattern geometry. Thus the microfabricated SERS-substrates are suitable for practical applications.
Property-directed incremental invariant generation
Authors: Aaron R. Bradley, Zohar Manna
Venue: Formal Aspects of Computing (2008)

A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typically, the proof is performed via induction; however, an assertion, while invariant, may not be inductive (provable via induction). Invariant generation procedures construct auxiliary inductive assertions for strengthening the assertion to be inductive. We describe a general method of generating invariants that is incremental and property-directed. Rather than generating one large auxiliary inductive assertion, our method generates many simple assertions, each of which is inductive relative to those generated before it. Incremental generation is amenable to parallelization. Our method is also property-directed in that it generates inductive assertions that are relevant for strengthening the given assertion. We describe two instances of our method: a procedure for generating clausal invariants of finite-state systems and a procedure for generating affine inequalities of numerical infinite-state systems. We provide evidence that our method scales to checking safety properties of some large finite-state systems.
Efficient generation of stream programs from loops
Authors: Xuejun Yang, Yu Deng, Xiaobo Yan, Li Wang, Jing Du, Ying Zhang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The efficiency of scientific applications on the Imagine stream processor is increasingly concerned by researchers. One of the obstacles is that the programming language of Imagine does not target the scientific computing. This paper introduces a program transformation algorithm to automatically transform loops to the stream programs executed on Imagine. The optimization for memory accessing is also considered during the transformation. We have implemented the transformation and optimization algorithm with the GFORTRAN frontend. Preliminary results over benchmark kernels show that our approach is a convenient and efficient solution to develop scientific applications on the Imagine stream processor.