ppxscal/embedding_network huggingface dataset:
Steganalysis of YASS
Authors: Bin Li, Yun Q. Shi, Jiwu Huang
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

In this paper, we describe a method for attacking Yet Another Steganographic Scheme (YASS), which is designed to be a very secure JPEG steganographic algorithm. The success of YASS is attributed to its innovation in embedding, i.e., hiding data in embedding host blocks whose locations are randomized. However, we find that the locations of the embedding host blocks are not randomized enough. Some locations in an image are possible to hold an entire embedding host block and some locations are definitely not. Additionally, YASS employs a Quantization Index Modulation (QIM) embedding strategy in order to enhance the robustness of the embedded data, which on the other hand introduces extra zero coefficients into the embedding host blocks during data hiding. Consequently, statistical features extracted from locations which are possible to hold embedding host blocks are different from those from locations which are impossible to hold embedding host blocks. The trace of YASS embedding is therefore exposed.
Protecting the Intranet Against "JavaScript Malware" and Related Attacks
Authors: Martin Johns, Justus Winter
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

The networking functionality of JavaScript is restricted by the Same Origin Policy (SOP). However, as the SOP applies on a document level, JavaScript still possesses certain functionality for cross domain communication. These capabilities can be employed by malicious JavaScript to gain access to intranet resources from the outside. In this paper we exemplify capabilities of such scripts. To protect intranet hosts against JavaScript based threats, we then propose three countermeasures: Element Level SOP, rerouting of cross-site requests, and restricting the local network. These approaches are discussed concerning their respective protection potential and disadvantages. Based on this analysis, the most promising approach, restricting the local network, is evaluated practically.
Necessary Condition for Path Partitioning Constraints
Authors: Nicolas Beldiceanu, Xavier Lorca
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

Given a directed graph $\mathcal{G}$, the K node-disjoint paths problem consists in finding a partition of $\mathcal{G}$ into K node-disjoint paths, such that each path ends up in a given subset of nodes in $\mathcal{G}$. This article provides a necessary condition for the K node-disjoint paths problem which combines (1) the structure of the reduced graph associated with $\mathcal{G}$, (2) the structure of each strongly connected component of $\mathcal{G}$ with respect to dominance relation between nodes, and (3) the way the nodes of two strongly connected components are inter-connected. This necessary condition is next used to deal with a path partitioning constraint.
Using Peano Curves for Bilevel Display of Continuous-Tone Images
Authors: I. H. Witten
Venue: IEEE Computer Graphics and Applications (1982)

A new method for the black-and-white display of gray-scale images limits cumulative error in binary subdivisions of images and eliminates deficiencies of the ordered dither technique.
Opportunities and challenges in improving surgical work flow
Authors: Yan Xiao, Peter Hu, Jacqueline Moss, J. C. F. de Winter, Daan Venekamp, Colin F. Mackenzie, F. Jacob Seagull, Sherry Perkins
Venue: Cognition, Technology and Work (2008)

Safe and efficient surgical operations depend on a work environment larger than the individual operating room (OR) and on communications at different levels of the hospital organization. Extensive communication is needed before and during surgery to ensure that surgical rooms, equipment, and supplies; patients; surgeons; supporting personnel; and accompanying documentation are all ready at the appropriate times. In this article, we compile the results of three of our studies of communication activities outside ORs, with the goal of identifying opportunities and challenges in the workflow of surgery. The first study demonstrates the amount of communication work performed by OR coordinators. The second study demonstrates the potential functions of a whiteboard in communication. The third study describes an organizational learning strategy of proactive event reporting. We apply computer-supported cooperative work and organizational learning concepts to the findings and suggest ways in which information technology may improve surgical workflow.
On the Missing Link Between Frequent Pattern Discovery and Concept Formation
Authors: Francesca A. Lisi, Floriana Esposito
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Concept Formation is a unsupervised learning task usually decomposed into the two subtasks of clustering and characterization. This paper presents a novel approach to Concept Formation in First Order Logic (FOL) which adopts a pattern-based approach to clustering and a bias-based approach to characterization. The resulting method extends therefore the levelwise search method for Frequent Pattern Discovery. The FOL fragment chosen is $\mathcal{AL}$-log, a hybrid language that merges the description logic $\mathcal{ALC}$ and the clausal logic Datalog and turns out to be suitable for applications in the context of Ontology Refinement. Indeed the method returns a taxonomy rooted into the concept that occurs in an existing taxonomic ontology and needs to be refined in the light of new knowledge coming from an external data source. Experimental results have been obtained on an $\mathcal{ALC}$ ontology enriched with Datalog data extracted from the on-line CIA World Fact Book.
Cross Ratio-Based Refinement of Local Features for Building Recognition
Authors: Hoang-Hon Trinh, Dae-Nyeon Kim, Kang-Hyun Jo
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper describes an approach to recognize buildings. The characters of building such as facets, their area, vanishing points, wall histogram and a list of local features are extracted and then stored in a database. Given a new image, the facet with biggest area is compared against the database to choose the closest pose. Novel methods of cross ratio-based refinement and SVD (singular value decomposition) based method are used to increase the recognition rate, increase the number of correspondences between image pairs and decrease the size of database. The proposed approach has been performed with 50 interest buildings containing 1050 images and a set of 50 test images. All images are taken under general conditions like different weather, seasons, scale, viewpoints and multiple buildings. We obtained 100(%) recognition rate.
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
Authors: V. Arvind, Partha Mukhopadhyay
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministic identity tests has received a lot of attention recently. The goal of this paper is to compare the isolation lemma with polynomial identity testing: 1 We show that derandomizing reasonably restricted versions of the isolation lemma implies circuit size lower bounds. We derive the circuit lower bounds by examining the connection between the isolation lemma and polynomial identity testing. We give a randomized polynomial-time identity test for noncommutative circuits of polynomial degree based on the isolation lemma. Using this result, we show that derandomizing the isolation lemma implies noncommutative circuit size lower bounds. For the commutative case, a stronger derandomization hypothesis allows us to construct an explicit multilinear polynomial that does not have subexponential size commutative circuits. The restricted versions of the isolation lemma we consider are natural and would suffice for the standard applications of the isolation lemma. 1 From the result of Klivans-Spielman [KS01] we observe that there is a randomized polynomial-time identity test for commutative circuits of polynomial degree, also based on a more general isolation lemma for linear forms. Consequently, derandomization of (a suitable version of) this isolation lemma implies that either or the Permanent over does not have polynomial-size arithmetic circuits.
Topology Aware Task Allocation and Scheduling for Real-Time Data Fusion Applications in Networked Embedded Sensor Systems
Authors: Baokang Zhao, Meng Wang, Zili Shao, Jiannong Cao, Keith C. C. Chan, Jinshu Su
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

In networked embedded sensor systems, data fusion is a viable solution to significantly reduce energy consumption while achieving real-time guarantee. Emerging data fusion applications demand efficient task allocation and scheduling techniques. However, existing approaches can not be effectively applied concerning both network topology and wireless communications. In this paper, we formally model TATAS, the Topology-Aware Task Allocation and Scheduling problem for real-time data fusion applications, and show it is NP-complete. We also propose an efficient three-phase heuristic to solve the TATAS problem. We implement our technique and conduct experiments based on a simulation environment. Experimental results show that, as compared with traditional approaches, our technique can achieve significant energy saving and effectively meet the real-time requirements as well.
On Rules and Parameter Free Systems in Bounded Arithmetic
Authors: Andres Cordòn-Franco, Alejandro Fernández-Margarit, Francisco Felix Lara-Martín
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We present model---theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.
On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
Authors: Jiji Zhang
Venue: Artificial Intelligence (2008)

Causal discovery becomes especially challenging when the possibility of latent confounding and/or selection bias is not assumed away. For this task, ancestral graph models are particularly useful in that they can represent the presence of latent confounding and selection effect, without explicitly invoking unobserved variables. Based on the machinery of ancestral graphs, there is a provably sound causal discovery algorithm, known as the FCI algorithm, that allows the possibility of latent confounders and selection bias. However, the orientation rules used in the algorithm are not complete. In this paper, we provide additional orientation rules, augmented by which the FCI algorithm is shown to be complete, in the sense that it can, under standard assumptions, discover all aspects of the causal structure that are uniquely determined by facts of probabilistic dependence and independence. The result is useful for developing any causal discovery and reasoning system based on ancestral graph models.
Feature Extraction System for Age Estimation
Authors: Hironobu Fukai, Hironori Takimoto, Yasue Mitsukura, Minoru Fukumi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper, we propose the novel age estimation system with the real-coded genetic algorithm (RGA) and the neural network (NN). The age is one of important information in our living. There are a lot of studies on age estimation by the computer. However, the conventional method of the age estimation, the most of them are the studies intended for an actual age. Therefore, we pay attention to the mechanism of human age perception. The apparent age feature is extracted by the fourier transform, and the important spectrum for the age perception are selected by the RGA. The age is estimated by the 3 layered NN. It is considered that it can extract important age feature using the RGA and it can analyze the important feature area. In addition, proposed method extracts the age feature at each age. In order to show the effectiveness of the proposed method, we show the simulation examples. From the simulation results, we can confirm that the proposed method works well.
The Spec# Programming System: Challenges and Directions
Authors: Mike Barnett, Robert Deline, Manuel Fähndrich, Bart Jacobs, K. Rustan Leino, Wolfram Schulte, Herman Venter
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

The Spec# programming system [4] is a new attempt to increase the quality of general purpose, industrial software. Using old wisdom, we propose the use of specifications to make programmer assumptions explicit. Using modern technology, we propose the use of tools to enforce the specifications. To increase its chances of having impact, we want to design the system so that it can be widely adopted.
Method for analyzing probe scanned surfaces
Authors: Timo Kero, Rikard Söderberg, Matts Andersson
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Probe scanning is widely used in modern dental industry, which is why it is important for the scanning process to be accurate for both hardware and software. Due to the wide range of scanner manufacturers with different types of surface registration algorithms it is of interest to in an analytical way evaluate the successfulness of the scanning. If the surface is registered in a successful way it also increases the probability of fortunate reengineering of the intended object based on the scanning. The rationale of the study is that a well represented scanning result is essential for the manufacturing, internal fit and strength of a coping. The purpose of this paper is to propose a general method that enables analysis of the successfulness of the representation of probe scanning, and an optimization of the scanning. Twenty-four scans of a premolar preparation die were made in order to demonstrate the cause and effect relationship between alignment, central revolution axis of the probe and the representation of the result. Three scans were made for each of 8 alignments of the die. First the central revolution axis of the scanner was set in the concavity between the 2 convexities of the die. In the second scan, the central revolution axis of the scanner was set slightly to the left of the higher convexity of the die. For the third scan, the central revolution axis was set on the maximum of the higher convexity. The fundamental idea of the method is that, by confining a triangulated surface representation, from the scan and the scanned object, to surfaces based on the probe tip geometry, a value for the accuracy of each triangle can be determined. When the position of the central revolution axis and the alignment were optimized the poor areas with a predefined tolerance between 0.05 mm and 1.25 mm than were reduced by a factor of 14. By optimizing scanning, better scan results can be achieved, which is desirable for the internal fit, strength and manufacturing of the coping.
Probabilistic approach to rough sets
Authors: Wojciech Ziarko
Venue: International Journal of Approximate Reasoning (2008)

The article introduces the basic ideas and investigates the probabilistic version of rough set theory. It relies on both classification knowledge and probabilistic knowledge in analysis of rules and attributes. Rough approximation evaluative measures and one-way and two-way inter-set dependency measures are proposed and adopted to probabilistic rule evaluation. A new probabilistic dependency measure for attributes is also introduced and proven to have the monotonicity property. This property makes it possible for the measure to be used to optimize and evaluate attribute-based representations through computation of probabilistic measures of attribute reduct, core and significance factors.
Brief paper: An ILMI approach to robust H2 static output feedback fuzzy control for uncertain discrete-time nonlinear systems
Authors: Huai-Ning Wu
Venue: Automatica (Journal of IFAC) (2008)

This paper studies the problem of robust H"2 static output feedback (SOF) fuzzy control for discrete-time nonlinear systems with parametric uncertainties. The Takagi and Sugeno fuzzy model is employed to represent an uncertain discrete-time nonlinear system. A sufficient condition for the existence of robust H"2 SOF fuzzy controllers is presented in terms of a set of matrix inequalities, which not only guarantees the stability of the closed-loop fuzzy system, but also provides an upper bound on the quadratic cost function. A suboptimal robust H"2 SOF fuzzy control problem is addressed in the sense of minimizing the bound. An iterative linear matrix inequality (ILMI) algorithm is proposed to compute the feedback gain matrices of the suboptimal fuzzy controller. Finally, two numerical examples are also provided to demonstrate the effectiveness of the proposed method.
Code Generation by Model Transformation
Authors: Zef Hemel, Lennart C. L. Kats, Eelco Visser
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

The realization of model-driven software development requires effective techniques for implementing code generators. In this paper, we present a case study of code generation by model transformation with Stratego, a high-level transformation language based on the paradigm of rewrite rules with programmable strategies that integrates model-to-model, model-to-code, and code-to-code transformations. The use of concrete object syntax guarantees syntactic correctness of code patterns, and enables the subsequent transformation of generated code. The composability of strategies supports two dimensions of transformation modularity. Vertical modularity is achieved by designing a generator as a pipeline of model-to-model transformations that gradually transforms a high-level input model to an implementation. Horizontal modularity is achieved by supporting the definition of plugins which implement all aspects of a language feature. We discuss the application of these techniques in the implementation of WebDSL, a domain-specific language for dynamic web applications with a rich data model.
Application of the Holonic Approach in Distributed Control Systems Designing
Authors: Dariusz Choinski, Witold Nocon, Mieczyslaw Metzger
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Design of a multidisciplinary project is a complicated process requiring cooperation of different designers specialized in particular branches of engineering. The paper proposes a holonic approach to testify that a solution of distributed control systems is compliant with dynamically changing technology rules with ontology-based decomposition. The proposed holarchy includes a multi-agent system considering also its hybrid control architecture connected with a self-organization database. The proposed approach was implemented for a biotechnological pilot-plant continuously working as a platform for several process investigations.
Poisson modulated stochastic model for partially developed multi-look speckle
Authors: Jean-Pierre Dubois
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Biological tissues of physiological systems have different characteristics. As a result, tissues imaged by ultrasound systems have varying degrees of "roughness" with respect to the wavelength of the illuminating radiation. This roughness can be modeled in terms of the locations of the individual elemental scatterers or scattering centers that contribute to the ultrasound backscatter from the tissue. When the number of scatterers within a tissue is very large and the scatterers' distribution occurs on a scale of a wavelength or greater, the speckle is referred to as fully developed. However, many tissue structures have a relatively small number of dominant scatterers within the imaged region. In this case, when the imaged tissue is smooth on the scale of a wavelength, speckle is referred to as partially developed and it can carry useful information about the scattering tissue. In this paper, we derive stochastic models for partially developed multi-look speckle noise. The motivation for this work is the problem of segmentation and tissue classification using ultrasound imaging. Modeling of speckle in this context involves an underlying Poisson point process which modulates a Gram-Charlier series of generalized Laguerre weighted gamma functions, resulting in a doubly stochastic marked accumulator Poisson point process. It is observed that as the mean number of scatterers in a resolution cell or the number of looks is increased, the probability density function of speckle intensity approaches a gamma distribution. This is consistent with fully developed speckle noise as dictated by the Central Limit theorem.
An Optimal Strategy for Online Non-uniform Length Order Scheduling
Authors: Feifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

This paper will study an online non-uniform length order scheduling problem. For the case where online strategies have the knowledge of Δ beforehand, which is the ratio between the longest and shortest length of order, Ting [3] proved an upper bound of $(\frac{6\Delta}{\log\Delta}+O(\Delta^{5/6}))$ and Zheng et al. [2] proved a matching lower bound. This work will consider the scenario where online strategies do not have the knowledge of Δ at the beginning. Our main work is a $(\frac{6\Delta}{\log\Delta}+O(\Delta^{5/6}))$-competitive optimal strategy, extending the result of Ting [3] to a more general scenery.