ppxscal/embedding_network huggingface dataset:
A Novel Digital Image Watermarking Approach Based on Image Blocks Similarity
Authors: Haiyong Liao, Ruisong Ye
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

In this paper, we propose a simple digital image watermarking algorithm, which can embed the watermark image blocks into the host image based on their blocks similarity coefficient. In the proposed scheme, both of watermark image and host image are divided into image blocks of size 8-by-8, and similarity coefficients between watermark image blocks and host image blocks are computed. Each watermark image block is embedded into the host image location with best similarity, namely, with the largest block similarity coefficient. Since the embedded watermark image blocks and their corresponding host image blocks are similar to some extent, the whole embedded watermark image is well imperceptible. Experimental results show that watermark images embedded by this technique are robust against various attacks, such as noising, cropping, JPEG compression.
The Importance of Including the Haptics Factor in Interaction Design
Authors: Petter Øyan, Anne Liseth Schøyen
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

One aspect of interaction design is communication of information through the use of a screen. Another aspect, the physical or haptic interaction with the device itself, is another important issue, especially to reduce errors when the device is used in critical situations.Ostfold university college has cooperated with the Institute for Energy Technology in Halden and the Norwegian Defence Research Establishment in Kjeller, and several student groups have been given the opportunity to work on research data and in collaboration with researchers from these two institutions within their final year studies.The focus of the projects has been realistic; emphasizing the importance of minimizing operating errors to ensure safe operation in critical situations, where the ability to give correct feedback through haptic interaction is as important as the correct understanding of visual communication.The cases are demonstrating the user centered approach to problem solving used by industrial designers and the analogy between the design- and the resarch process, especially focusing on the use of physical designs to test and review and thereby exploring form as an interaction parameter.
Building secure business applications at Microsoft
Authors: John Steer, Ashish Popli
Venue: Information Security Tech. Report (2008)

Like many global enterprises, Microsoft depends on internally developed and third-party line-of-business (LOB) applications to run its daily business activities. Nearly 4000 LOB applications are in service at Microsoft including a significant number of applications that contain business-sensitive data, customer data, or confidential employee data. In 2001 the Microsoft IT organization wanted to make sure that the company's security risk was appropriately managed. The Security Development Life cycle for IT (SDL-IT) was created within Microsoft IT to keep track of, assess, and address potential security and privacy vulnerabilities found in LOB applications. A specialist team called the Application Consulting and Engineering (ACE) Team was formed to manage the program, providing support and oversight ensuring that application development teams adhere to the SDL-IT process. This paper contains descriptions of the processes and standards that make up the SDL-IT process and discusses best practices that might be useful to other organizations wishing to create and enforce a security and privacy processes for LOB applications. While this paper describes Microsoft ITs own security and privacy process the authors recognize that every organization is unique and believe that the technology agnostic SDL-IT process and methodologies described can be implemented in other enterprises.
Function-valued Padé-type approximant via the formal orthogonal polynomials and its applications in solving integral equations
Authors: Chuanqing Gu, Jindong Shen
Venue: Journal of Computational and Applied Mathematics (2008)

A kind of function-valued Pade-type approximant via the formal orthogonal polynomials (FPTAVOP) is introduced on the polynomial space and an algorithm is sketched by means of the formal orthogonal polynomials. This method can be applied to approximate characteristic values and the corresponding characteristic function of Fredholm integral equation of the second kind. Moreover, theoretical analyses show that FPTAVOP method is the most effective one for accelerating the convergence of a sequence of functions. In addition, a typical numerical example is presented to illustrate when the estimates of characteristic value and characteristic function by using this new method are more accurate than other methods.
Multi-agent Architecture for Intelligent Tutoring Systems Interoperability in Health Education
Authors: Carolina González, Juan C. Burguillo, Martín Llamas
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Intelligent Tutoring Systems (ITSs) base their interoperability on the interchange of domain knowledge about learning and teaching processes and about students. To enable the interchange of domain knowledge between ITSs and heterogeneous Health Information Systems (HIS) we propose a multi-agent architecture allowing sharing patient's clinical data in Health Information Systems. The Health Level (HL7) is used as a standard messaging protocol for collecting the clinical patient data distributed over Health Information Systems.
A new arrangement of AC/DC converters for high direct-current applications
Authors: Francesco Muzi, Luigi Passacantando
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

A novel AC/DC converter designed for high-output direct currents and tight output voltage regulations is introduced. The proposed converter exhibits good efficiency and very low output voltage ripple. In order to verify the performances of the four-stage proposed converter, a 400A rated current prototype was designed and built. The prototype was properly verified by experimental tests performed in a laboratory. A subsequent FFT (Fast Fourier Transform) analysis was carried out to verify the harmonic pollution produced by the converter in the supply network.
Fuzzy Relation-Based PNNs with the Aid of IG and Symbolic Gene Type-Based GAs
Authors: Sung-Kwun Oh, In-Tae Lee, Hyun-Ki Kim, Seong-Whan Jang
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In this paper, we propose a new design methodology of fuzzy-neural networks --- Fuzzy Relation---based Polynomial Neural Networks (FRPNN) with symbolic genetic algorithms and Information Granules (IG). We have developed a design methodology based on symbolic genetic algorithms to find the optimal structure for fuzzy-neural networks that expanded from Group Method of Data Handling (GMDH). Such parameters as the number of input variables, the order of the polynomial, the number of membership functions, and a collection of the specific subset of input variables are optimized for topology of FRPNN with the aid of symbolic genetic optimization that has search capability to find the optimal solution on the solution space. The augmented and genetically developed FRPNN (gFRPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional FRPNNs. The GA-based design procedure being applied at each layer of FRPNN leads to the selection of the most suitable nodes (or FRPNs) available within the FRPNN. The performance of genetically optimized FRPNN (gFRPNN) is quantified through experimentation where we use a number of modeling benchmarks data which are already experimented with in fuzzy or neurofuzzy modeling.
Robust MCD-Based Backpropagation Learning Algorithm
Authors: Andrzej Rusiecki
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Training data containing outliers are often a problem for supervised neural networks learning methods that may not always come up with acceptable performance. In this paper a new, robust to outliers learning algorithm, employing the concept of initial data analysis by the MCD (minimum covariance determinant) estimator, is proposed. Results of implementation and simulation of nets trained with the new algorithm and the traditional backpropagation (BP) algorithm and robust Lmls are presented and compared. The better performance and robustness against outliers for the new method are demonstrated. 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
Implementing a Built-In Self-Test PLA Design
Authors: Robert Treuer, Hideo Fujiwara, Vinod Agarwal
Venue: IEEE Design Test (1985)

An NMOS implementation of a new built-in self-test PLA design is presented. The layouts for its additional test circuitryresult in appoximately 15-percent overhead for most large PlAS, a significantly better overhead than that of any existingscheme. Both the input test patterns and the output responses, which are compressed intoastring of parity bits, are independentof the functions that the PLA realizes, and the 15-percent overhead includes the storage needed for the fault-free compressedoutput data. The fault coverage of this approach consists of all single and (1-2 -( 2n + m)) of all multiple stuck, crosspoint,and bridging faults in the original PLA and the additional test circuitry (n and m are the number of input variables and productterms, respectively). The article begins with a short review of existing design schemes.
An Application of Weighted Triangular Norms to Complexity Reduction of Neuro-fuzzy Systems
Authors: Krzysztof Cpalka, Leszek Rutkowski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In the paper we develop a new method for designing and reduction of neuro-fuzzy systems. The method is based on the concept of the weighted triangular norms. In subsequent stages we reduce number of inputs, number of rules and number of antecedents. Simulation results are given.
Building Semantic Resources for Legislative Drafting: The DALOS Project
Authors: Enrico Francesconi, Daniela Tiscornia
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

The DALOS Project aims at building an ontological- linguistic resource to be used in the multilingual EU legislative drafting process, as well as in a linguistically reliable national transpositions of EU directives. This paper outlines the design of the ontological-linguistic resource, as well as the main phases carried on for its implementation.
Peer Group Filter for Impulsive Noise Removal in Color Images
Authors: Bogdan Smolka
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper a new approach to the problem of impulsive noise removal in color images is presented. The proposed method is based on the evaluation of the statistical properties of a sorted sequence of the accumulated distances used for the calculation of the vector median of samples belonging to the filtering window. The statistical analysis is performed using the Fisher's linear discriminant, which enables the detection of outliers introduced by the noise process. The described filter output switches between the vector median and the original central pixel. In order to increase the filter's performance, two thresholds are introduced, which enhance the detail preserving abilities of the proposed filtering scheme. The described filtering technique is robust, fast and therefore it can be used in real time denoising applications.
NN Music: Improvising with a `Living' Computer
Authors: Michael Young
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

A live algorithm describes an ideal autonomous performance system able to engage in performance with abilities analogous, if not identical, to a human musician. This paper proposes five attributes of a live algorithm: adaptability, empowerment, intimacy, opacity and unimagined music. These attributes are explored in NN Music, a performer-machine system for Max/MSP that fosters listening and learning. Live improvisation is encoded statistically to train a feed-forward neural network, mapped to stochastic processes for musical output. Through adaptation, mappings are learnt and covertly assigned, to be revisited by both player and machine as a performance develops.
Image Segmentation Via Iterative Histogram Thresholding and Morphological Features Analysis
Authors: Nadia Brancati, Maria Frucci, Gabriella Sanniti Di Baja
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this paper, we present a new segmentation algorithm, based on iterated thresholding and on morphological features. A first thresholding, based on the histogram of the image, is done to partition the image into three sets including respectively pixels belonging to foreground, pixels belonging to background, and unassigned pixels. Thresholding of components of unassigned pixels is then iteratively done, based on the histogram of the components. Components of unassigned pixels, possibly still present at the end of iterated thresholding, are assigned to foreground or background by taking into account area, minimum grey-level and spatial relationship with the adjacent sets.
A Middleware Services Simulation Platform for Wireless Sensor Networks
Authors: Hock Beng Lim, Bang Wang, Cheng Fu, Arpan Phull, Di Ma
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In the recent years, wireless sensor networks have attracted a lot of attention due to their broad application areas. In many application scenarios, hundreds or thousands of sensor nodes may be deployed in the physical environment. To design, implement, manage and maintain such large-scale networks efficiently is a major challenge which requires an integrated middleware development approach. In this paper, we focus on the development of a simulation platform specifically designed to support the development of sensor network middleware services. This novel platform is designed in a modular manner to facilitate the rapid integration and testing of different middleware algorithms and services. We present the simulator's software architecture and its operation. A case study to illustrate the usage of our simulation platform is also presented. The simulation platform shows potentials to support the research and development of middleware servicesfor wireless sensor networks.
Zigzag decoding: combating hidden terminals in wireless networks
Authors: Shyamnath Gollakota, Dina Katabi
Venue: ACM SIGCOMM Computer Communication Review (2008)

This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag's core contribution is a new form of interference cancellation that exploits asynchrony across successive collisions. Specifically, 802.11 retransmissions, in the case of hidden terminals, cause successive collisions. These collisions have different interference-free stretches at their start, which ZigZag exploits to bootstrap its decoding. ZigZag makes no changes to the 802.11 MAC and introduces no overhead when there are no collisions. But, when senders collide, ZigZag attains the same throughput as if the colliding packets were a priori scheduled in separate time slots. We build a prototype of ZigZag in GNU Radio. In a testbed of 14 USRP nodes, ZigZag reduces the average packet loss rate at hidden terminals from 72.6% to about 0.7%.
Locating and Ranking XML Documents Based on Content and Structure Synopses
Authors: Weimin He, Leonidas Fegaras, David Levine
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We present a new framework for indexing, locating and ranking XML documents based on content and structural synopses extracted from the documents. Instead of indexing each single element or term in a document, we extract a structural summary and a small number of data synopses from the document, which are indexed in an efficient way suitable for query evaluation. Our query language is XPath extended with full-text search. The result of query evaluation is a ranked list of document locations that best match the query. We propose a novel aggregated ranking scheme, which is integrated into the query evaluation to score the documents based on those data synopses. Our experimental evaluation shows that our indexing scheme outperforms the standard XML indexing scheme based on inverted lists and our ranking scheme is effective in terms of precision and recall.
Normal contact of elastic solids (Hertzian contact) by MathCAD method
Authors: Enescu Ioan, Vlase Sorin, Lepadatescu Badea
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

When two non-conforming solids are through into contact they touch initially at a single point along a line. In this paper its make a application of Hertz theory used the Math Cad program for the contact of two cylinders.
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
Authors: Zoltán Király
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We first consider the problem of finding a maximum stable matching if incomplete lists and ties are both allowed, but ties only for one gender. For this problem we give a simple, linear time 3/2-approximation algorithm, improving on the best known approximation factor 5/3 of Irving and Manlove [5]. Next, we show how this extends to the Hospitals/Residents problem with the same ratio if the residents have strict orders. We also give a simple linear time algorithm for the general problem with approximation factor 5/3, improving the best known 15/8-approximation algorithm of Iwama, Miyazaki and Yamauchi [7]. For the cases considered in this paper it is NP-hard to approximate within a factor of 21/19 by the result of Halldórsson et al. [3].Our algorithms not only give better approximation ratios than the cited ones, but are much simpler and run significantly faster. Also we may drop a restriction used in [5] and the analysis is substantially more moderate.
Equivalent Semantic Translation from Parallel DEVS Models to Time Automata
Authors: Shoupeng Han, Kedi Huang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Dynamic reconfigurable simulation based on Discrete Event System Specification (DEVS) requires efficient verification of simulation models. Traditional verification method of DEVS model is based on I/O test in which a DEVS model is regarded as a black box or a grey box. This method is low efficient and insufficient because input samples are often limited. This paper proposes a formal method which can translate Parallel DEVS model into a restrict kind of Timed Automata (TA) with equivalent behaviors. By this translation, a formal verification problem of Parallel DEVS model can be changed into the formal verification of according timed automata.
Development of a tool for code automatic generation of persistent objects
Authors: Ana Garis, Claudia Albornoz, Daniel Riesco, German Montejano, Narayan Debnath
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

The presented CASE tool makes persistent classes generation easy. The tool is a bridge between object oriented languages and relational databases. Generated persistent classes contain database access code. The programmer use this classes to instantiate objects with persistence facilities. In this way the tool allows to automate and improve part of the process of software development.
Divergence-constrained moving least squares for fluid simulation
Authors: Jeong-Mo Hong Jong-Chul Yoon Chang-Hun Kim
Venue: Computer Animation and Virtual Worlds (2008)

Developing suitable interpolation methods to simulate dynamic motions of continuous materials such as fluids is an important problem. In this paper, we propose a novel method to enforce the divergence condition to the interpolated velocity field by moving least squares (MLS), by means of the diffusive derivatives and moving divergence constraints that allow the practical use and easy implementation. As results, we present the velocity interpolation examples and a fluid-like particle simulation method to show the meaningful potential of our method as a tool of physical interpolation for fluid simulations. Copyright &copy; 2008 John Wiley & Sons, Ltd.
When Is Assistance Helpful to Learning? Results in Combining Worked Examples and Intelligent Tutoring
Authors: Bruce M. Mclaren, Sung-Joo Lim, Kenneth R. Koedinger
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

When should instruction provide or withhold assistance? In three empirical studies, we have investigated whether worked examples, a high-assistance approach, studied in conjunction with tutored problems to be solved, a mid-level assistance approach, can lead to better learning. Contrary to prior results with untutored problem solving, a low-assistance approach, we found that worked examples alternating with isomorphic tutored problems did not produce more learning gains than tutored problems alone. However, the examples group across the three studies learned more efficiently than the tutored-alone group. Our studies, in conjunction with past studies, suggest that mid-level assistance leads to better learning than either lower or higher level assistance. However, while our results are illuminating, more work is needed to develop predictive theory for what combinations of assistance yield the most effective and efficient learning.
Quality Processes and Milestones for the Development and Monitoring of Business Software in the Area of Accessibility
Authors: Dewi Gani, Urte Thölke
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Once a company has defined and documented all requirements in a standard for accessibility, what is the best way of making sure that development teams observe them as intended? Which factors can require revisions to be made to the Accessibility Standard? What are the key milestones for the planning of all development activities around the standard? What areas have to be tested to have a quality assurance and how can the result be given to the customer to serve legal and individual requirements? In this presentation you will get an overview about quality processes and milestones for the development and monitoring of business software in the area of accessibility at SAP.
Tools for Computer-Aided Engineering
Authors: Thomas Bruggere, Elizabeth Hollomon
Venue: IEEE Computer Graphics and Applications (1983)

Shorter product lifespan and longer product development time make an integrated system of design, documentation, planning, and management essential to the survival of today's engineering firms.