ppxscal/embedding_network huggingface dataset:
S-Club: An Overlay based Efficient Service Discovery Mechanism in CROWN Grid
Authors: Chunming Hu, Jinpeng Huai, Yanmin Zhu, Yunhao Liu, Lionel M. Ni
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Information service plays a key role in Grid system, handles resource discovery and management process. Employing existing information service architectures suffers from poor scalability, long search response time, and large traffic overhead. In this paper, we propose a service club mechanism, called S-Club, for efficient service discovery. In S-Club, an overlay based on existing GIS mesh network of CROWN is built, so that GISs are organized as service clubs. Each club serves for a certain type of service while each GIS may join one or more clubs. S-Club is adopted in RLDS as the information service in CROWN Grid and the performance of S-Club is evaluated by comprehensive simulations. The results show that S-Club scheme significantly improves search performance and outperforms existing approaches.
Conceptual Design of an XML FACT Repository for Dispersed XML Document Warehouses and XML Marts
Authors: R. Rajugan, Elizabeth Chang, Tharam S. Dillon
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Since the introduction of eXtensible Markup Language (XML), XML repositories have gained a foothold in many global (and government) organizations, where, e-Commerce and e-Business models have maturated in handling daily transactional data among heterogeneous information systems in multi-data formats. Due to this, the amount of data available for enterprise decision-making process is increasing exponentially and are being stored and/or communicated in XML. This presents an interesting challenge to investigate models, frameworks and techniques for organizing and analyzing such voluminous, yet distributed XML documents for business intelligence in the form of XML warehouse repositories and XML marts. In this paper, we address such an issue, where we propose a view-driven approach for modeling and designing of a Global XML FACT (GxFACT) repository under the MDA initiatives. Here we propose the GxFACT using logically grouped, geographically dispersed, XML document warehouses and Document Marts in a global enterprise setting. To deal with organizations' evolving decision-making needs, we also provide three design strategies for building and managing of such GxFACT in the context of modeling of further hierarchical dimensions and/or global document warehouses.
A Multigrid Method for a Fourth-Order Diffusion Equation with Application to Image Processing
Authors: Stefan Henn
Venue: SIAM Journal on Scientific Computing (2005)

In this paper we are concerned with the efficient solution of the elliptic system $(\alpha L +\nobreak I) u =\nobreak f$, where $L$ is the biharmonic operator supplemented by higher-order boundary conditions. This is a core task in image processing arising from the minimization of rotation invariant energy functionals. For the purpose of numerical solution we approximate the partial differential equation by finite differences. In order to obtain efficient and robust solution methods we discuss how the system can be treated efficiently by multigrid methods. Finally, experimental results are reported that demonstrate the effectiveness of the multigrid approach.
Variational Bayesian image modelling
Authors: Li Cheng, Feng Jiao, Dale Schuurmans, Shaojun Wang
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models---Hidden Markov Random Fields (HMRFs). HMRFs are particularly well suited to image modelling and in this paper, we apply them to the problem of image segmentation. Unfortunately, HMRFs are notoriously hard to train and use because the exact inference problems they create are intractable. Our main contribution is to introduce an efficient variational approach for performing approximate inference of the Bayesian formulation of HMRFs, which we can then apply to the density estimation and model selection problems that arise when learning image models from data. With this variational approach, we can conveniently tackle the problem of image segmentation. We present experimental results which show that our technique outperforms recent HMRF-based segmentation methods on real world images.
Cryptographic Keys from Dynamic Hand-Signatures with Biometric Secrecy Preservation and Replaceability
Authors: Yip Wai Kuan, Alwyn Goh, David Ngo, Andrew Teoh
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

We propose a method of extracting cryptographic key from dynamic handwritten signatures that does not require storage of the biometric template or any statistical information that could be used to reconstruct the biometric data. Also, the keys produced are not permanently linked to the biometric hence, allowing them to be replaced in the event of key compromise. This is achieved by incorporating randomness which provides high-entropy to the naturally low-entropy biometric key using iterative inner-product method as in Goh-Ngo, and modified multiple-bit discretization that deters guessing from key statistics. Our proposed methodology follows the design principles of block ciphers to result in unpredictable key space and secure construction.
A smoothed boosting algorithm using probabilistic output codes
Authors: Rong Jin, Jian Zhang
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method to convert a multi-class learning problem into a set of binary classification problems, and applies the AdaBoost algorithm to solve them efficiently. In this paper, we propose a new boosting algorithm that improves the AdaBoost.OC algorithm in two aspects: 1) It introduces a smoothing mechanism into the boosting algorithm to alleviate the potential overfitting problem with the AdaBoost algorithm, and 2) It introduces a probabilistic coding scheme to generate binary codes for multiple classes such that training errors can be efficiently reduced. Empirical studies with seven UCI datasets have indicated that the proposed boosting algorithm is more robust and effective than the AdaBoost.OC algorithm for multi-class learning.
Service-Oriented Business Solution Development Driven by Process Model
Authors: Xingdong Shi, Weili Han, Yinsheng Li, Ying Huang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Enterprises are driven to be more responsive with flexible information systems to meet dynamic business requirements. This paper provides a service-oriented and business process model driven platform for developing on-demand business systems. The platform uses two separate views for users' interaction, i.e., a business view for business consultants and an IT view for IT experts, to relieve them from unfamiliar domains. The platform contains a reasoning engine to support key rules are presented for automatic process transformation from business view to IT view. Business templates are explored to support business process reuse. A case of retail supplier chain system has been developed on the platform to examine the proposed techniques.
Perceptual media compression for multiple viewers with feedback delay
Authors: Oleg Komogortsev, Javed Khan
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Human eyes have limited perception capabilities; for example, only 2 degrees of our 140 degree vision field provide the highest quality of perception. Due to this fact the idea of perceptual focus emerged to allow a visual content to be changed in a way that only part of the visual field where a human gaze is directed is encoded with a high quality. The image quality in the periphery can be reduced without a viewer noticing it. This compression approach allows a significant decrease in the number of bits required for image encoding, and in the case of the 3D image rendering, it decreases the computational burden. A number of previous researchers have investigated the topic of perceptual focus but only for a single viewer. In our research we investigate a dynamically changing multi-viewer scenario. In this type of scenario a number of people are watching the same visual content at the same time. Each person has his/her own perceptual focus area which changes over time. The visual content is sent through a network with a fixed delay/lag which provides an additional challenge to the whole scheme. The goal of our work was to investigate and develop a method of multi-viewer perceptual focus zones adaptation for real-time media perceptual compression and transmission. In our research we also look into the impact that such a method can have on transmission bandwidth and computational burden reduction.
A product liability cost and risk funding model: the case of the automotive air cushion restraint system
Authors: Conway L. Lackman
Venue: ACM SIGSIM Simulation Digest (1982)

U. S. Government Regulations requiring 1982 car models to be equipped with Air Cushion Restraint Systems (ACRS) as standard equipment necessitated an estimate of product liability cost (PLC) for both the manufacturers of autos and ACRS's.
Reference Architecture of Intelligent Appliances for the Elderly
Authors: J. W. S. Liu, B. Y. Wang, H. Y. Liao, C. Y. Huang, C. S. Shih, T. W. Kuo, A. C. Pang
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper describes reference architecture of consumer electronic and assistive appliances and services designed to improve the quality of life of the elderly. The architecture serves as a foundation for the identification, definition and standardization of internal and external interfaces of such appliances. It is a basis for component-based design and supports a framework for building different types of appliance, and different versions of each type, by integrating configurable and evolvable components in a systematic, verifiable way.
Evaluation strategies for image understanding and retrieval
Authors: Keiji Yanai, Nikhil V. Shirahatti, Prasad Gabbur, Kobus Barnard
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

We address evaluation of image understanding and retrieval large scale image data in the context of three evaluation projects. The first project is a comprehensive strategy for evaluating image retrieval algorithms and provides an open reference data set for doing so. The second project develops word prediction as a semantically relevant evaluation strategy, and applies it to the evaluation of of image processing methods for semantic image analysis. The third project evaluates words for suitability of their visual properties for use in an image annotation framework.
A model for hipaa security compliance
Authors: Kathleen M. Bravo
Venue:  (2005)

The healthcare industry is currently faced with the challenge of implementing the Health Insurance Portability and Accountability Act (HIPAA) security requirements. The HIPAA security regulations went into effect on April 21, 2003, and set forth a 24-month period for organizations to become compliant. The mandatory compliance date was April 21, 2005, for most covered entities (April 21, 2006 for small health plans). Although the April 21, 2005, deadline has passed and the April 21, 2006 deadline is drawing near, covered entities are struggling with preparedness. HIPAA security differs from current security measures that organizations have in place in that organizations cannot pick and choose which measures to implement but, instead, must adhere to set guidelines in order to achieve compliancy. Secondly, the HIPAA security rule is a mandate that all healthcare providers must follow; there is no participation waiver. HIPAA security differs from other federal security regulations in a number of significant ways. First, unlike other federal information technology security regulations which affects only a few, the HIPAA security rule is far-reaching and affects almost every individual residing in the United States. All hospitals, health care providers, insurance companies, financial billing companies, and anyone seeing or under a physician's care are subjected to adhere to or be protected by the set of safeguards that have been mandated by the HIPAA security rule. Secondly, the HIPAA security rule differs from other federal security regulations in that it outlines specific safeguards that must be implemented. Other federal regulations either make vague references to necessary safeguards for compliance, require organizations to adopt a recognized framework, or offer organizations implementation flexibility based on internal risk assessments. This research looked at all state contracted mental healthcare providers in New Jersey. The study had a number of major findings, namely, how the survey results compared to the requirements of the HIPAA security rule, the factors affecting compliance, whether common compliance practices exist, security auditing/evaluation for compliance, and the use of the diamond model in validating findings, assessing the alignment of IT and organizational needs and in constructing a proposed compliance model. The researcher sent a survey questionnaire to key IT professionals at the covered entities. Analysis of the survey resulted in descriptive statistics. These statistics and related graphs were developed for the entire group and were broken down by culture. When the results of the data analysis were compared to the HIPAA security rule and the diamond model, it was found that the majority of the covered entities surveyed were not ready for HIPAA security compliance. The research resulted in a proposed model for HIPAA security implementation and a number of recommendations.
A new standard in secure networking
Authors: Robert Denier
Venue:  (2005)

The growth of networks, both wired and wireless, has brought with it a tremendous increase in flexibility and ease of use of computing. Typical wired networks transmit frames unencrypted. This has often been adequate since to intercept packets requires to be in physical possession of the wires. Conversely, wireless networks have had encryption designed in from the beginning to protect against unauthorized use and reception of network data. The current encryption standard for wireless networks is wireless equivalent privacy (WEP). It has serious security weaknesses that have been effectively compromised. Newer options are currently available that are believed to not contain the same problems. Unfortunately, any system that shares a common key with many users is fundamentally insecure since it is impossible to trust every user in the system. This paper presents the author's own attempt to present a solution to this problem. This design is based on making a cryptographic layer that processes all network packets before sending it to the physical device for transmission. The design presented herein has several major goals. First, it must minimize the ability of anyone, including insiders, to analyze the network traffic. Second, it must prevent any client from being able to decrypt packets not intended for that client. It must be as simple as possible since, &ldquo;You can't secure what you don't understand.&rdquo; Lastly, given the other considerations, it should be as fast as possible. Each possible communications path is encrypted under a unique key, with those keys negotiated through elliptic curve based public key cryptography. Digital signatures are used to verify the origin and integrity of negotiation packets. Key changing is handled automatically. The use of public key cryptography insures that it is impossible for one station to impersonate another. Traffic analysis is made extremely difficult for everyone, including insiders, through the use of randomly generated path variables and common packet design. Access control is possible on a per station basis, with each station able to control the nodes it will accept communications from. The designs is coded in C and implemented as Linux kernel modules.
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Authors: Wei-Zhi Wu, Mei Zhang, Huai-Zu Li, Ju-Sheng Mi
Venue: Information Sciences: an International Journal (2005)

Knowledge reduction is one of the main problems in the study of rough set theory. This paper deals with knowledge reduction in (random) information systems based on Dempster-Shafer theory of evidence. The concepts of belief and plausibility reducts in (random) information systems are first introduced. It is proved that both of belief reduct and plausibility reduct are equivalent to classical reduct in (random) information systems. The relative belief and plausibility reducts in consistent and inconsistent (random) decision systems are then proposed and compared to the relative reduct and relationships between the new reducts and some existing ones are examined.
Time-Varying Contour Topology
Authors: Bong-Soo Sohn, Chandrajit Bajaj
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend the benefits of the contour tree to time-varying data visualization. We define temporal correspondence of contour components and describe an algorithm to compute the correspondence information in time-dependent contour trees. A graph representing the topology changes of time-varying isosurfaces is constructed in real-time for any selected isovalue using the precomputed correspondence information. Quantitative properties, such as surface area and volume of contour components, are computed and labeled on the graph. This topology change graph helps users to detect significant topological and geometric changes in time-varying isosurfaces. The graph is also used as an interactive user interface to segment, track, and visualize the evolution of any selected contour components over time.
Traceability in viewpoint merging: a model management perspective
Authors: Mehrdad Sabetzadeh, Steve Easterbrook
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Viewpoint merging is one of the core activities in viewpoints-based development. We may consolidate a set of viewpoints to unify different stakeholders' perspectives, to explore interactions between different parts of a problem, or to perform various types of analysis. Once viewpoints are merged, it is important to be able to determine how the merged viewpoint represents each viewpoint, and to track the assumptions involved in the merge. Building on the viewpoint merging framework in our earlier work [22], this paper proposes a systematic way to generate and represent the traceability information required for tracing the merged viewpoint elements back to their originating viewpoints, and to the merge assumptions related to the elements.
A new representation of shape and its use for high performance in online Arabic character recognition by an associative memory
Authors: N. Mezghani, A. Mitiche, M. Cheriet
Venue: International Journal on Document Analysis and Recognition (2005)

The purpose of this study is to investigate a new representation of shape and its use in handwritten online character recognition by a Kohonen associative memory. This representation is based on the empirical distribution of features such as tangents and tangent differences at regularly spaced points along the character signal. Recognition is carried out by a Kohonen neural network trained using the representation. In addition to the Euclidean distance traditionally used in the Kohonen training algorithm to measure the similarities among feature vectors, we also investigate the Kullback&#x2013;Leibler divergence and the Hellinger distance, functions that measure distance between distributions. Furthermore, we perform operations (pruning and filtering) on the trained memory to improve its classification potency. We report on extensive experiments using a database of online Arabic characters produced without constraints by a large number of writers. Comparative results show the pertinence of the representation and the superior performance of the scheme.
Text Extraction on Windows®-Based Documents
Authors: Brian Ray, Chia-Chu Chiang, Jim Melescue
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Syntel™ LLC is the developer of a mail presorting application called AutoMail®, which needs to alter bank statements that are being printed. For this and other applications, it is sometimes impossible to exert any control over the document creation software, but changes to the printed documents must nevertheless be made. The purpose of this project is to retrieve data which has been sent to the Microsoft Windows® printing subsystem, parse the data, ® modify sections of text contained within each document, and continue the print process, leaving the document unmolested except for the altered sections of text. This is done by processing Enhanced MetaFile (EMF) documents, and generating XML documents formatted to be easily read by the software modules responsible for actually altering the text data. During some phase of the print process on Microsoft Windows® Operating systems, each page will exist as an EMF document. Each EMF document consists of a number of entries describing drawing operations. Those drawing operations which are found to pertain to text output in the important spatial regions of the document are converted to plain text. This text, along with certain formatting and positioning information, is written to the XML file. All other drawing operations are included in the XML file as "Black Box" entities, so that the document can be repackaged after processing. Repackaging is accomplished by creating new text drawing operations, reinserting the other drawing operations, and using the Windows® API to print the resulting EMF document.
Hybrid checkpointing for parallel applications in cluster federations
Authors: S. Monnet, C. Morin, R. Badrinath
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Cluster federations are attractive for executing applications like large scale code coupling. However faults may appear frequently in such architectures. Thus, checkpointing long-running applications is desirable to avoid to restart them from the beginning in the event of a node failure. To take into account the constraints of a cluster federation architecture, an hybrid checkpointing protocol is proposed. It uses global coordinated checkpointing inside clusters but only quasi-synchronous checkpointing techniques between clusters. The proposed protocol has been evaluated by simulation and fits well for applications that can be divided into modules with lots of communications within modules but few between them.