ppxscal/embedding_network huggingface dataset:
Reliable Information Hiding Based on Support Vector Machine
Authors: Yong-Gang Fu, Rui-Min Shen, Li-Ping Shen, Xu-Sheng Lei
Venue: Informatica (2005)

In this paper, a reliable information hiding scheme based on support vector machine and error correcting codes is proposed. To extract the hidden information bits from a possibly tampered watermarked image with a lower error probability, information hiding is modeled as a digital communication problem, and both the good generalization ability of support vector machine and the error correction code BCH are applied. Due to the good learning ability of support vector machine, it can learn the relationship between the hidden information and corresponding watermarked image; when the watermarked image is attacked by some intentional or unintentional attacks, the trained support vector machine can recover the right hidden information bits. The reliability of the proposed scheme has been tested under different attacks. The experimental results show that the embedded information bits are perceptually transparent and can successfully resist common image processing, jitter attack, and geometrical distortions. When the host image is heavily distorted, the hidden information can also be extracted recognizably, while most of existing methods are defeated. We expect this approach provide an alternative way for reliable information hiding by applying machine learning technologies.
Simulating SMEPP middleware
Authors: Javier Barbarán, Carlos Bonilla, Jose Ángel Dianes, Manuel Díaz, Ana Reyna
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Embedded Peer-to-Peer Systems (EP2P) represent a new challenge in the development of software for distributed systems. The main objective of the SMEPP (Secure Middleware for Embedded Peer-to-Peer Systems) project is to develop a new middleware, based on a new network centric abstract model, specially designed for the above described systems, and trying to overcome the main problems of the currently existing domain specific middleware proposals. This paper presents a SMEPP Middleware component-based simulation tool. The main objective of developing this simulator is to provide a tool to enable the testing of the service model proposed for the middleware and to provide a framework to test different middleware design choices. Simulations will help us to make future decisions. Simulating SMEPP applications, that is, applications running on the SMEPP middleware and based on the API that it offers, help us to make decisions about the most requirement-satisfactory way of constructing the middleware. The simulated middleware API component represents a first approach to middleware design, and introduces some of the architectural issues that must to be solved in the near future.
Diagnosis of Lung Nodule Using Independent Component Analysis in Computerized Tomography Images
Authors: Cristiane C. Silva, Daniel Duarte Costa, Aristófanes Corrêa Silva, Allan Kardec Barros
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

This paper analyzes the application of Independent Component Analysis to the characterization of lung nodules as malignant or benign in computerized tomography images. The characterization method is based on a process that verifies which combination of measures, from the proposed measures, has been best able to discriminate between the benign and malignant nodules using Support Vector Machine. In order to verify this application we also describe tests that were carried out using a sample of 38 nodules: 29 benign and 9 malignant. The methodology reaches 100% of Specificity, 98.34% of Sensitivity and 96.66% of accuracy. Thus, preliminary results of this approach are very promising in contributing to pulmonary nodules diagnosis, but it will be necessary to test it in larger series and to make associations with other quantitative imaging methods in order to improve global performance.
Classification of Task Driven Swaying Paths
Authors: Jyrki Rasku, Martti Juhola
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

To make a correct diagnosis in the case of different diseases within a medical specialty is not an easy task, especially when there is not mutual understanding of the underlying factors that describe the problem in question. In this paper we present a method which can be useful in cases where one have to make a decision if a young person's postural control system is normal or not.
Representing and Quantifying Rank - Change for the Web Graph
Authors: Akrivi Vlachou, Michalis Vazirgiannis, Klaus Berberich
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

One of the grand research and industrial challenges in recent years is efficient web search, inherently involving the issue of page ranking. In this paper we address the issue of representing and quantifying web ranking trends as a measure of web pages. We study the rank position of a web page among different snapshots of the web graph and propose normalized measures of ranking trends that are comparable among web graph snapshots of different sizes. We define the ra nk c hang e r ate (racer ) as a measure quantifying the web graph evolution. Thereafter, we examine different ways to aggregate the rank change rates and quantify the trends over a group of web pages. We outline the problem of identifying highly dynamic web pages and discuss possible future work. In our experimental evaluation we study the dynamics of web pages, especially those highly ranked.
On the Applicability of Trusted Computing in Distributed Authorization Using Web Services
Authors: Aarthi Nagarajan, Vijay Varadharajan, Michael Hitchens, Saurabh Arora
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Distributed authorization provides the ability to control access to resources spread over the Internet. Typical authorization systems consider a range of security information like user identities, role identities or even temporal, spatial and contextual information associated with the access requestor. However, the ability to include computing platform related information has been quite limited due to constraints in identification and validation of platforms when distributed. Trusted computing is an exciting technology that can provide new ways to bridge this gap. In this paper, we provide the first steps necessary to achieving distributed authorization using trusted computing platforms. We introduce the notion of a Property Manifest that can be used in the specification of authorization policies. We provide an overview of our authorization architecture, its components and functions. We then illustrate the applicability of our system by implementing it in a Web service oriented architecture.
Cost-based BDI plan selection for change propagation
Authors: Khanh Hoa Dam, Michael Winikoff
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change propagation problem: given a primary change that is made in order to meet a new or changed requirement, what additional, secondary, changes are needed? We build on previous work that has proposed to use a BDI (belief-desire-intention) agent framework to propagate changes by fixing violations of consistency constraints. One question that needs to be answered as part of this framework is how to select between different applicable (repair) plan instances to fix a given constraint violation? We address this issue by defining a suitable notion of repair plan cost that incorporates both conflict between plans, and synergies between plans. We then develop an algorithm, based on the notion of cost, that finds cheapest options and proposes them to the user.
A Distributed Coordination Framework for Adaptive Sensor Uncertainty Handling
Authors: Zhifeng Dai, Yuanxiang Li, Bojin Zheng, Xianjun Shen
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The evaluation and management of sensor uncertainty is particularly necessary in a noisy multi-sensor context. In this paper, focusing on the potential of distributed coordination among sensor nodes based on the built-in association between wireless sensor networks and multi-agent systems, meanwhile in a rough set technique senseof uncertainty, we show how an adaptive distributed coordination framework for a hierarchy of sensor data uncertainty performs local data fusion to increase the certainty of real-time sensor readings coherently, makes global rational decisions under imprecision and partial truth, and reconciles the conflicts somewhat, thus evolving adaptive and robust sensor uncertainty handling systems. Implementation results for an example sensor field demonstrate the application of our proposed approach.
Computational Affective Sociology
Authors: William Sims Bainbridge
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

An alternative tradition concerning emotion in human-centered computing is based on sociological conceptions of personality and the emotional meanings of decisions. This essay summarizes work in this area, beginning with the classic Big 5 personality dimensions and the semantic differential, then illustrates recent work with two projects that developed software research tools. The first builds on the semantic differential to measure an individual's self-esteem across several dimensions, and the second assesses the subject's reactions to 2,000 common events in terms of 20 emotions.
The existence of 5-sparse Steiner triple systems of order n ≡3mod6, n∉{9,15}
Authors: Adam J. Wolfe
Venue: Journal of Combinatorial Theory Series A (2008)

This paper shows the existence of 5-sparse Steiner triple systems of order n=3mod6 for n>=21 by constructing meager systems.
Scaling Dependability and Security in Ad Hoc Networks
Authors: Rogério Lemos
Venue: Proceedings of the 3rd Latin-American symposium on Dependable Computing (2007)

The increasing size and complexity of the next generation of large distributed systems will require radical new approaches for guaranteeing certain levels of dependability and security. Current solutions might become brittle in context of new applications, such as pervasive computing, in which there is a large number of components with dynamic interdependencies between them. The inherent complexity of these future systems due to heterogeneity, decentralisation, and emergent technologies also demand scalable and robust solutions. An example of such emergent technologies is ad hoc networks, which are self-configuring networks that enable the connection of thousands of devices in arbitrary topologies. The objective of the panel is to discuss the challenges and the potential solutions when building dependable and secure applications in the context of ad hoc networks. This panel has been organised as a joint event between the Sixth International Conference on Ad-Hoc Networks and Wireless (Ad Hoc NOW 2007) and the Third Latin American Symposium on Dependable Computing (LADC 2007), which are two co-located events of the Mexican International Conference in Computer Science (ENC 2007).
Theory of relative defect proneness
Authors: A. Güneş Koru, Khaled El Emam, Dongsong Zhang, Hongfang Liu, Divya Mathew
Venue: Empirical Software Engineering (2008)

In this study, we investigated the functional form of the size-defect relationship for software modules through replicated studies conducted on ten open-source products. We consistently observed a power-law relationship where defect proneness increases at a slower rate compared to size. Therefore, smaller modules are proportionally more defect prone. We externally validated the application of our results for two commercial systems. Given limited and fixed resources for code inspections, there would be an impressive improvement in the cost-effectiveness, as much as 341% in one of the systems, if a smallest-first strategy were preferred over a largest-first one. The consistent results obtained in this study led us to state a theory of relative defect proneness (RDP): In large-scale software systems, smaller modules will be proportionally more defect-prone compared to larger ones. We suggest that practitioners consider our results and give higher priority to smaller modules in their focused quality assurance efforts.
The intensity of perceived emotions in 3D virtual humans
Authors: Ahmad S. Shaarani, Daniela M. Romano
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Synthetically generated 3D humans often fail to express a full range of emotions or present different levels of the same type of emotion. Transcending the facial expression, what should a happy synthetically generated human look like? What about a slightly happy or ecstatically happy? This paper reports a study aimed at identifying the appropriate bodily expressions for various emotions in 3D human-like figures at varying emotional strength. Thirty-six volunteers were asked to discriminate and categorize thirty cards with static poses of 3D human-like characters into the Ekman's six basic categories of emotions. This is to judge the compatibility of each posture in relation to each category and to rate their level of emotion within the group.
Transformers Fault Diagnosis Based on Support Vector Machines and Dissolved Gas Analysis
Authors: Haitao Wu, Huilan Jiang, Dapeng Shan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Transformers are one of the critical equipments of electrical system. This paper analyses the merits and flaws of the existing transformer-fault-diagnosis methods, and then utilizes SVC (Support Vector Classification), one of branches of SVM (Support Vector Machine) which has many advantages like great generalization, effectively avoiding "over-learning" and being able to learn from small scale sample, to analyze transformers dissolved gas. Because of the nonlinear classification relationship between DGA and fault diagnosis, this paper unifies the DGA data, selects proper kernel function, solution, and parameters, formulates the SVC with best effect, sets up a two-floor fault diagnosis tree, and ultimately builds the transformer-fault-diagnosis model. Through the self-test and comparison with Three Ratio Method as well as BP neural network, it is improved that the model built in this paper remarkably enhances the accuracy and efficiency of fault diagnosis.
Focused beam routing protocol for underwater acoustic networks
Authors: Josep Miquel Jornet, Milica Stojanovic, Michele Zorzi
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Multi-hop transmission is considered for large coverage areas in bandwidth-limited underwater acoustic networks. In this paper, we present a scalable routing technique based on location information, and optimized for minimum energy per bit consumption. The proposed Focused Beam Routing (FBR) protocol is suitable for networks containing both static and mobile nodes, which are not necessarily synchronized to a global clock. A source node must be aware of its own location and the location of its final destination, but not those of other nodes. The FBR protocol can be defined as a cross-layer approach, in which the routing protocol, the medium access control and the physical layer functionalities are tightly coupled by power control. It can be described as a distributed algorithm, in which a route is dynamically established as the data packet traverses the network towards its final destination. The selection of the next relay is made at each step of the path after suitable candidates have proposed themselves. The system performance is measured in terms of energy per bit consumption and average packet end-to-end delay. The results are compared to those obtained using pre-established routes, defined via Dijkstra's algorithm for minimal power consumption. It is shown that the protocol's performance is close to the ideal case, as the additional burden of dynamic route discovery is minimal.
Variable Relaxation Solve for Nonlinear Thermal Conduction
Authors: Jin Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Efficient and robust nonlinear solvers, based on Variable Relaxation, is developed to solve nonlinear anisotropic thermal conduction arising from fusion plasma simulations. By adding first and/or second order time derivatives to the system, this type of methods advances corresponding time-dependent nonlinear systems to steady state, which is the solution to be sought. In this process, only the stiffness matrix itself is involved so that the numerical complexity and errors can be greatly reduced. In fact, this work is an extension of implementing efficient linear solvers for fusion simulation on Cray X1E.Two schemes are derived in this work, first and second order Variable Relaxations. Four factors are observed to be critical for efficiency and preservation of solution's symmetric structure arising from periodic boundary condition: mesh scales, initialization, variable time step, and nonlinear stiffness matrix computation. First finer mesh scale should be taken in strong transport direction; Next the system is carefully initialized by the solution with linear conductivity; Third, time step and relaxation factor are vertex-based varied and optimized at each time step; Finally, the nonlinear stiffness matrix is updated by just scaling corresponding linear one with the vector generated from nonlinear thermal conductivity. 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
Encouraging Contributions to Online Communities with Personalization and Incentives
Authors: F. Maxwell Harper
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Increasingly, online systems depend on user contributions such as posts, ratings, tags, and comments. Many of these systems wish to encourage broader participation or the contribution of higher quality content. In this doctoral consortium paper, I present past work and propose future work on understanding user motivations to contribute online and on the use of personalization technology and incentives to shape participation.
Stream-Based Electricity Load Forecast
Authors: João Gama, Pedro Pereira Rodrigues
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Sensors distributed all around electrical-power distribution networks produce streams of data at high-speed. From a data mining perspective, this sensor network problem is characterized by a large number of variables (sensors), producing a continuous flow of data, in a dynamic non-stationary environment. Companies make decisions to buy or sell energy based on load profiles and forecast. We propose an architecture based on an online clustering algorithm where each cluster (group of sensors with high correlation) contains a neural-network based predictive model. The goal is to maintain in real-time a clustering model and a predictive model able to incorporate new information at the speed data arrives, detecting changes and adapting the decision models to the most recent information. We present results illustrating the advantages of the proposed architecture, on several temporal horizons, and its competitiveness with another predictive strategy.
How Is It for You? (A Case for Recognising User Motivation in the Design Process)
Authors: Shane Walker, David Prytherch
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

This research suggests that a novel approach for extending the designers understanding of the user can be found in combining psychological and HCI perspectives. The study examines the users' emotional response to the design of software in Human-Computer Interaction (HCI), the influence it has on their attitudes and expectations of the software, and their motivation to use it. Reference to contemporary theories of human motivation and emotion in psychology, adapted for application to the user at the interface, provide a new `lens' through which to examine the user, and to elicit new data to inform the design process. The exploration of underrepresented variables in humancomputer interaction establishes the basis for additional tools and measures that can be employed by the designer to assess the success, or otherwise, of the user interface. Findings indicate that the opportunity to manage and capitalise on user interaction in the design process is under-recognised.
The obscure nature of epidemic quorum systems
Authors: João Barreto, Paulo Ferreira
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

Epidemic quorum systems enable highly available agreement even when a quorum is not simultaneously connected, and are therefore very interesting for mobile networks. Although recent work has proposed epidemic quorum algorithms, their properties and trade-offs are not well studied. This paper sheds some light on less known aspects of epidemic quorum systems. With simple counter-examples and combinatorial exercises, we contradict common misbeliefs that are often associated with epidemic quorum systems. Our claims advocate the need for a deeper study of these promising systems.
DOC: a new multi-agent approach for DCSP resolution
Authors: Kais Ben Salah, Khaled Ghedira
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

In this paper, we present a new complete method to solve Distributed Constraint Satisfaction Problems (DCSP). DOC-SAT is a Multi-Agent model based on two classes of agents; Decision-Maker agent and Advisor agent that interact to solve inter and intra-agent constraints. The Architecture, dynamic, experimentations and comparison with the Asynchronous Backtracking algorithm are discussed.
Multi-agent Framework Support for Adaptive e-Learning
Authors: Wanjie Liang, Jianmin Zhao, Xinzhong Zhu
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

In the past years, agent technology is considered one of the most innovative technologies for the development of software systems. Meanwhile, following the rapid development of Internet, particularly web page interaction technology, web-based learning has become increasingly popular. However, there not yet has a perfect framework in e-learning system's software designing. This paper proposes a multi-agent framework to realize an adaptive e-learning system. Experimental results indicate that applying the proposed framework for personalized e-learning system is feasible and robust.
Variational iteration method for solving wave equation
Authors: A. A. Hemeda
Venue: Computers Mathematics with Applications (2008)

By the variational iteration method the solution of the wave equation in different forms is exactly obtained. The obtained solutions show that the variational iteration method is effective, simple and easy compared with many of the other methods. So it has a wide range of applications in physical and mathematical problems, linear and nonlinear as well.