ppxscal/embedding_network huggingface dataset:
Distributed and cooperative intrusion response models for mobile ad hoc networks
Authors: Shiau-Huey Wang
Venue:  (2008)

A Mobile Ad-hoc Network (MANET) provides instant and quick wireless communication for a set of mobile nodes that have no pre-established infrastructure such as in a hostile environment. A MANET possesses some inherent characteristics including: dynamic topology, fully distributed architecture, and a heavy dependence on cooperation among all nodes. These unique characteristics make MANETs more vulnerable to attacks and create a greater challenge for developing an intrusion and response system when compared to traditional wired or wireless networks. To realize Intrusion Detection (ID) in a decentralized MANET, we proposed a distributed Intrusion Detection System (IDS), which is composed of two main models: (1) the Distributed Evidence-driven Message Exchanging intrusion detection Model (DEMEM) that provides a distributed intrusion detection and message exchange framework and (2) the Distributed Routing Evidence Tracing and Authentication intrusion prevention model (DRETA). DRETA provides DEMEM authentication services to protect the integrity and authenticity of the IDS messages being exchanged among distributed detectors and is considerate of low computational and message overhead. All of these IDS decisions are determined independently at each IDS agent. We also developed a distributed automated response system (ARS), which responds to those alarms delivered by IDS. The distributed response system also contains two main models: (1) a cost sensitive response model, which prevents response actions from causing more damage than the attack itself and (2) an alarm validation framework. Because a node that raises an alarm cannot validate its own alarm, validation must be performed at a centralized node. Our framework provides a secure communication for RAs to aggregate their alarms at a centralized node to perform local alarm validation. We apply digital signature algorithm (DSA) to both local and global alarm validations. In conclusion, we have a complete distributed Intrusion and Response System for MANETs.
Introduction to Mathematical Optimization: From Linear Programming to Metaheuristics
Authors: Xin-She Yang
Venue:  (2008)

This book strives to provide a balanced coverage of efficient algorithms commonly used in solving mathematical optimization problems. It covers both the convectional algorithms and modern heuristic and metaheuristic methods. Topics include gradient-based algorithms such as Newton-Raphson method, steepest descent method, Hooke-Jeeves pattern search, Lagrange multipliers, linear programming, particle swarm optimization (PSO), simulated annealing (SA), and Tabu search. Multiobjective optimization including important concepts such as Pareto optimality and utility method is also described. Three Matlab and Octave programs so as to demonstrate how PSO and SA work are provided. An example of demonstrating how to modify these programs to solve multiobjective optimization problems using recursive method is discussed. 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
Digital government through social networks: how citizens can aggregate their money and votes to define digital government
Authors: Britt Blaser, David Weinberger, Joe Trippi
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Politicians seek only money and votes. Citizens control all the money and votes but have never participated broadly and systematically to allocate their control of those resources to affect governance. North Americans possess a "participatory surplus" fueling open source software and presidential campaigns, energizing millions. Well-understood social networking services could provide a barackobama.com for constituents of any politician and for the stakeholders of any government agency or service. How might campaign web site experts design and host a network to govern governance? "Surrounded" online by fully empowered and well informed, networked constituencies, our politicians and government employees would be motivated by self-interest to attend carefully to any policy formulations carrying the force of voters' money and votes. Online, a plurality of anonymous but authenticated voters can pledge their future votes and donations contingent on government behaviors. When issues-based commitments to votes and donations are aggregated, published and audited, politicians are likely to behave as if the entire government were online, a stepping-stone to digitizing government itself. A virtual congressional district is the epitome of politician advice and consent, guiding a representative's policies as effectively as an airplane's "trim tab" governs its far more unwieldy rudder. Proponents of Digital Government could use Virtual Districts to break down the resistance keeping the US on paper. Such a system must engage real-world mechanisms to control the existing levers of government. Politicians are moved not by pure argument or the honest expression of their constituents' preferences, but by their career interests. Any social network aimed at empowering constituents must take those realities into account. The overarching reality is that political power---governance---is regional. Voters' networks for governance must map to voters' real-world, geographical jurisdictions.
Maintenance-based trust for multi-agent systems
Authors: Babak Khosravifar, Maziar Gomrokchi, Jamal Bentahar, Philippe Thiran
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In last years, trust and reputation has been gaining increasing interest in multi-agent systems (MAS). To address this issue, we propose in this paper a maintenance-based trust mechanism for agents operating in multi-agent systems. In the proposed model, a comprehensive trust assessment process is provided to assess the trustworthiness of the participating agents. The main characteristic of this model is the retrospect trust adjustments, which integrate the applicable constraints and modify the involved features with respect to the actual performance of the evaluated agent. Specifically, the retrospect process updates the belief set of the agents in order to adapt them to the social network changes. This paper has two contributions: after describing the architecture of the proposed framework, we provide a theoretical analysis of its assessment and discuss the system implementation, along with simulations comparing it with the broadly known frameworks.
Instruction-based self-testing of delay faults in pipelined processors
Authors: Virendra Singh, Michiko Inoue, Kewal K. Saluja, Hideo Fujiwara
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

Aggressive processor design methodology using high-speed clock and deep submicrometer technology is necessitating the use of at-speed delay fault testing. Although nearly all modern processors use pipelined architecture, no method has been proposed in literature to model these for the purpose of test generation. This paper proposes a graph theoretic model of pipelined processors and develops a systematic approach to path delay fault testing of such processor cores using the processor instruction set. The proposed methodology generates test vectors under the extracted architectural constraints. These test vectors can be applied in functional mode of operation, hence, self-test becomes possible. Self-test in a functional mode can also be used for online periodic testing. Our approach uses a graph model for architectural constraint extraction and path classification. Test vectors are generated using constrained automatic test pattern generation (ATPG) under the extracted constraints. Finally, a test program consisting of an instruction sequence is generated for the application of generated test vectors. We applied our method to two example processors, namely a 16-bit 5-stage VPRO pipelined processor and a 32-bit pipelined DLX processor, to demonstrate the effectiveness of our methodology.
Pro Javascript RIA Techniques: Best Practices, Performance and Presentation, 1st edition
Authors: Den Odell
Venue:  (2009)

Pro JavaScript RIA Techniques: Best Practices, Performance, and Presentation shows you how you can build JavaScript RIAs (Rich Internet Applications) with compelling user interfaces and great performance. With the best practices and optimization techniques youll learn in this book, you can optimize performance without sacrificing a rich user interface. Using a combination of innovative ideas and intelligent use of HTML, CSS, JavaScript, and plugins, this book shows you how to make decisions based on best web standard development practices and realworld browser data. Through practical examples, youll see how to optimize both design and performance with an eye toward future enhancements and efficient maintenance. Starting with the essential principles and techniques of semantic markup, build efficient, responsive web applications based on web standard best practices and realworld experience. Apply practical techniques and see how to reuse examples of broadly relevant page components to improve the interface and performance of existing sites. Explore ways to push the boundaries of the possible with existing browser technology. What youll learn Best practices for building web applications using JavaScript and web standards Optimization techniques for high performance in browsers How to create richer user interfaces Advanced Ajax techniques How to optimize graphic performance by drawing in the browser with SVG Integrating accessibility into rich web applications Who is this book for This book is aimed at web developers and designers who need to improve the user experience of their sites by making their code more efficient and their sites more responsive, and incorporating more complexity all at the same time. It is for Internet professionals ready to go beyond Web 2.0 to a newer, more streamlined vision of rich user experiences. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
Learning faces with the BIAS model: On the importance of the sizes and locations of fixation regions
Authors: Predrag Neskovic, Ian Sherman, Liang Wu, Leon N. Cooper
Venue: Neurocomputing (2009)

During perception of complex objects, the highest density of fixations occurs on the regions that are most salient. For example, when looking at a face, the regions that receive the largest density of fixations are the eyes, the nose, and the mouth. The fact that some regions within an object are more informative than other regions means that a learning system that can acquire this information from a teacher rather than from random fixations can learn faster and likewise recognize faster. An important question, from both the theoretical and practical points of view is: How important are the properties of the fixation regions for the learning system? In this work we consider one such system, the Bayesian integrate and shift (BIAS) model for learning object categories, and investigate its sensitivity to changes in the sizes and locations of fixation regions. We test the model using a face category and show that the learning algorithm is robust to large variations of the regions' sizes and locations. Specifically, we show that the performance is inversely proportional to the sizes of the fixation regions and that the preferred locations are those that are closer to the center of the object.
Special relativity for motions with variable speed
Authors: E. A. Galperin
Venue: Computers Mathematics with Applications (2009)

Relativistic transformations considered in [Albert Einstein, Zur Elektrodynamik der bewegter Korper. Ann. Phys. 17 (1905) 891-921] are extended for motions with variable speed through the introduction of the @c-representation and continuous piecewise linear approximations which are used for velocity identification on the basis of discrete measurements of the distance function. This demonstrates that Einstein's relativistic transformations originally established to explain some physical phenomena experimentally observed in systems one of which is moving with a constant relative velocity with respect to the other are, in fact, applicable (in some modified form) to systems with variable relative velocity. The method is illustrated in application to the control of a flight to Mars in a spacecraft with comfortable weight conditions on board, same as on Earth, moving with acceleration g=9.8 m/s^2 at all times except for the lift-off from Earth and soft touchdown on Mars after 42 h flight. Natural time delays due to finite speed of information transmittal are included into relativistic transformations, leading to a 4D space-time frame in the form of a variable affinely connected time-space structure whose dynamics is defined by the relative velocity v(t)
Face recognition in the presence of age differences using holistic and subpattern-based approaches
Authors: Hüseyin Sertbay, Ösen Toygar
Venue: Proceedings of the 3rd WSEAS international symposium on Wavelets theory and applications in applied mathematics, signal processing & modern science (2009)

The effect of aging on face recognition using holistic and subpattern-based approaches is studied in this paper. The performance analysis of holistic and subpattern-based methods is presented on face recognition in the presence of age progression with specific preprocessing techniques. Original PCA, subspace LDA and subpattern-based counterparts of these holistic methods are used as feature extractors with the combination of the preprocessing techniques of histogram equalization and mean-and-variance normalization in order to nullify the effect of illumination changes which are known to significantly degrade recognition performance. The recognition performance of the holistic approaches is compared with the performance of subpattern-based PCA and subpattern-based subspace LDA approaches in order to demonstrate the performance differences and similarities between these two types of approaches. To be consistent with the research of others, our work has been tested on two publicly available databases namely FGNET and MORPH. The experiments are performed on these aging databases to demonstrate the recognition performances of the holistic and subpattern-based approaches in the presence of age differences on the faces.
Analysis and implementation of multiple-input, multiple-output VBLAST receiver from area and power efficiency perspective
Authors: Zahid Khan, Tughrul Arslan, John S. Thompson, Ahmet T. Erdogan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

This paper presents an analysis of the vertical Bell Laboratories layered space time (VBLAST) receiver used in a multiple-input multiple-output (MIMO) wireless system from the hardware implementation perspective and identifies those processing elements that consume more area and power due to complex signal processing. This paper models a scalable VBLAST receiver based on minimum mean square error (MMSE) nulling criteria assuming a block flat fading channel. After identifying the major area and power consuming blocks, this paper proposes two area and power efficient VLSI architectures for the block that computes pseudoinverse of the channel matrix. This paper discusses different tradeoff issues in both architectures and compares them with the architectures in the literature.
How to Compare Profiled Side-Channel Attacks?
Authors: François-Xavier Standaert, François Koeune, Werner Schindler
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

Side-channel attacks are an important class of attacks against cryptographic devices and profiled side-channel attacks are the most powerful type of side-channel attacks. In this scenario, an adversary first uses a device under his control in order to build a good leakage model. Then, he takes advantage of this leakage model to exploit the actual leakages of a similar target device and perform a key recovery. Since such attacks are divided in two phases (namely profiling and online attack), the question of how to best evaluate those two phases arises. In this paper, we take advantage of a recently introduced framework for the analysis of side-channel attacks to tackle this issue. We show that the quality of a profiling phase is nicely captured by an information theoretic metric. By contrast, the effectiveness of the online key recovery phase is better measured with a security metric. As an illustration, we use this methodology to compare the two main techniques for profiled side-channel attacks, namely template attacks and stochastic models. Our results confirm the higher profiling efficiency of stochastic models when reasonable assumptions can be made about the leakages of a device.
FlexServ
Authors: Jordi Camps, Oliver Carrillo, Agustí Emperador, Laura Orellana, Adam Hospital, Manuel Rueda, Damjan Cicin-Sain, Marco D'Abramo, Josep Lluís Gelpí, Modesto Orozco
Venue: Bioinformatics (2009)

Summary: FlexServ is a web-based tool for the analysis of protein flexibility. The server incorporates powerful protocols for the coarse-grained determination of protein dynamics using different versions of Normal Mode Analysis (NMA), Brownian dynamics (BD) and Discrete Dynamics (DMD). It can also analyze user provided trajectories. The server allows a complete analysis of flexibility using a large variety of metrics, including basic geometrical analysis, B-factors, essential dynamics, stiffness analysis, collectivity measures, Lindemann's indexes, residue correlation, chain-correlations, dynamic domain determination, hinge point detections, etc. Data is presented through a web interface as plain text, 2D and 3D graphics. Availability: http://mmb.pcb.ub.es/FlexServ; http://www.inab.org Contact:modesto@mmb.pcb.ub.es or gelpi@mmb.pcb.ub.es Supplementary information: Additional information and methodology details can be found at http://mmb.pcb.ub.es/FlexServ/help.
Mouse pointer controlled by ocular movements
Authors: Job Ramón De La O Chávez, Carlos Avilés Cruz
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Researchers on Brain-Computer Interface (BCI) have tried to identify the origin of body movements in humans with limited success. This work looks at the problem using an ocular movement tracker based on ocular artifacts in electroencephalograph (EEG) readings, also called electro-oculogram (EOG). The movements are reflected into the EEG signals, which are passed through a multiple classifier, composed of two statistical classic methods (KNN and Bayesian-Gauss) and a Neural Network. The voltage levels of the EEG readings and their polarity provide the necessary information to track the focus of attention of the user in a computer screen. All of these artifacts have characteristic curves which can be classified. Focusing on the eye movements, we have developed an eye tracker to recover the point of attention of the user on a computer screen.
DBDOC: querying and browsing databases and interrelated documents
Authors: Carlos Garcia-Alvarado, Carlos Ordonez, Zhibo Chen
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Large collections of documents are commonly created around a database, where a typical database schema may contain hundreds of tables and thousands of columns. We developed a system based on SQL code generation and User-Defined Functions that analyzes document-to-metadata links by extracting a basic set of relationships at different levels of granularities: coarse, medium and fine. Such relationships are then stored and queried in the DBMS, allowing the user to explore, query, and rank how columns and tables are related to users and applications. At the same time, our system provides typical information retrieval capabilities for querying medium-sized document collections of interrelated documents in the DBMS, with an acceptable performance.
Texture map: an effective representation for image segmentation
Authors: Tao Xu, Iker Gondra
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Because of ubiquitous irregularities among texture patterns in real images, texture representation has long been a challenge for image analysis. Approaches such as wavelet transforms that use fixed-sized windows to extract local features are popular for texture identification and classification. However, due to the unawareness of texture scales and boundary locations, those block-based approaches have limited success for image segmentation. In this paper, we present a novel algorithm that tends to generate statistical descriptors that are adaptive to the variation of texture patterns based on a simple rule of pruning and concatenating the approximately repetitive patterns. In the context of image segmentation, the color information that is used by the popular mean shift segmentation algorithm is usually not sufficient for good segmentation performance. We alleviate this problem by first preprocessing the image with the proposed method to generate a "texture map" which then becomes the input image representation for the mean shift segmentation algorithm. The experimental results demonstrate the robustness and effectiveness of the proposed texture representation.
Outline of a design science research process
Authors: Philipp Offermann, Olga Levina, Marten Schönherr, Udo Bub
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

Discussions about the body of knowledge of information systems, including the research domain, relevant perspectives and methods have been going on for a long time. Many researchers vote for a combination of research perspectives and their respective research methodologies; rigour and relevance as requirements in design science are generally accepted. What has been lacking is a formalisation of a detailed research process for design science that takes into account all requirements. We have developed such a research process, building on top of existing processes and findings from design research. The process combines qualitative and quantitative research and references well-known research methods. Publication possibilities and self-contained work packages are recommended. Case studies using the process are presented and discussed.