ppxscal/embedding_network huggingface dataset:
Learning Fuzzy Rules with Evolutionary Algorithms -- An Analytic Approach
Authors: Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper provides an analytical approach to fuzzy rule base optimization. While most research in the area has been done experimentally, our theoretical considerations give new insights to the task. Using the symmetry that is inherent in our formulation, we show that the problem of finding an optimal rule base can be reduced to solving a set of quadratic equations that generically have a one dimensional solution space. This alternate problem specification can enable new approaches for rule base optimization.
A Performance Evaluation of Vertical Hanover Architecture with Low Latency Handover
Authors: Do-Hyung Kim, Won-Tae Kim, Hwan-Gu Lee, Sun-Ja Kim, Cheol-Hoon Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper describes the vertical handover architecture with Low Latency Handover for mobile terminals which supports interworking between heterogeneous networks. The vertical handover architecture defines handover-related modules for mobile terminal and the handover switching flows among them. We adapt Low Latency Handover method to Mobile IP for reducing handover time. The architecture is designed to be easily extended to support more than two heterogeneous networks, so that it is easy to apply architecture to terminals that have multiple heterogeneous wireless network interfaces. We analyze the performance of handover method in terms of handover delay time using test bed system.
Securing Next-Generation Grids
Authors: Lavanya Ramakrishnan
Venue: IT Professional (2004)

Grid computing poses tough security challenges. What do we have—and what do we still need—to make grids safe for tomorrow?
Background and Source Information About Computer Graphics
Authors: Carl Machover
Venue: IEEE Computer Graphics and Applications (1985)

This up-to-date summary* contains a selection of representative books, articles, magazines, newsletters, and journals in the computer graphics field. It singles out some specific articles and also includes professional society names and addresses; titles and dates of conferences, seminars, national meetings, and short courses; names and addresses of commercial exhibitions with technical programs; product reviews and directories; and market data sources.
Pro SQL Server 2008 Reporting Services
Authors: Rodney Landrum, Shawn McGehee, Walter J. Voytek II
Venue: Pro (2008)

Take full advantage of everything SQL Server 2008 Reporting Services has to offer and deliver customizable, webenabled reports across your business at a reasonable cost. Learn bestpractices from professionals who use SQL Server Reporting Services daily to deliver solutions to paying clients and gain the competitive edge on using Microsofts enterpriselevel reporting platform. Provides bestpractices for using Reporting Services Written by practicing professionals with paying clients Your key to delivering business intelligence across the enterprise What youll learn Write efficient queries on which to base a report. Build and lay out a report using Report Designer. Enable end users to create ad hoc reports on demand. Combine Reporting Services with Analysis Services, SharePoint Portal Server, and other technologies to deliver business intelligence across the enterprise. Secure and audit your reports as part of your regulatory compliance efforts. Customize your reports using C# assemblies and embedded Visual Basic .NET code. Who is this book for? Data analysts, developers, database administrators, and others who develop and deploy reports using Microsoft SQL Server Reporting Services. 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.
A comparison between ATNoSFERES and Learning Classifier Systems on non-Markov problems
Authors: Samuel Landau, Olivier Sigaud
Venue: Information Sciences: an International Journal (2008)

The automated design of the controller of software agents embedded in an environment is an important class of problems addressed in information sciences. In that class of problems, the case where agents face perceptual aliasing problems is particularly difficult. Within the evolutionary and adaptive approaches to controller design, there are several families of systems capable of dealing with such problems. This paper is devoted to a comparison of the way perceptual aliasing problems are solved by one family, namely Learning Classifier Systems, compared to our own model, ATNoSFERES. We present this model based on an indirect encoding Genetic Algorithm which builds Augmented Transition Network controllers, and we compare it with different Learning Classifier Systems, namely XCSM (a memory-based extension of the most studied Learning Classifier System, XCS) and ACS (an Anticipatory Learning Classifier System). To solve perceptual aliasing problems, the first uses an explicit internal state management mechanism while the second uses a rule-chaining mechanism. To carry out our comparison, we apply these systems to three different benchmark experiments. Our results raise a discussion of the respective properties of the mechanisms used by XCSM and ACS. Then we show that ATNoSFERES is endowed with enough expressive power to represent the mechanisms used by the other two systems to deal with perceptual aliasing problems. We conclude that ATNoSFERES provides a powerful framework to deal with such problems.
The Environmental Quality Evaluation of Port Regional Based on BP Neural Network and Case Study
Authors: Xin Zhang, Maicheng Guo, Qingchao Liu, Jian Sun, Wenhui Zhu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The pollution of Qinhuangdao Port is the bottleneck of economic development, so how to correct the environmental assessment of the work environment has important significance. The main pollutants in Qinhuangdao port is coal dust pollution, through various observation points on the measurement indicators of pollutants by EPA experts scoring can get a group of data, and then through various BP neural network on a comprehensive evaluation of data, one can draw the actual final objective evaluation for environmental protection work provides a theoretical and practical basis.
KAMET II: An open diagnosis knowledge-acquisition methodology
Authors: Osvaldo Cairó, Julio Alvarez
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

Different methodologies have been developed to solve various tasks such as classification, design, planning, scheduling and diagnosis. Diagnosis is a task of which the desired output is a malfunction of a system. KAMET (Knowledge-Acquisition Methodology) is a knowledge engineering methodology aimed to attack diagnosis tasks exclusively. In this article KAMET II, the second version of KAMET, will be presented with the objective of knowing its most important characteristics as well as its modeling notation which will subsequently be necessary for the knowledge bases, Problem-Solving Methods (PSMs) and the knowledge model specification. KAMET is a model-based methodology appointed to administer knowledge acquisition from multiple knowledge sources. The methodology provides a mechanism by means of which knowledge acquisition is achieved in an incremental fashion and in a cooperative environment. One important feature is the specification used to describe knowledge-based systems independently of their implementation. A four-component architecture is presented to achieve this goal and to allow component separation and consequently component reuse.
Bayesian Methods for Practical Traitor Tracing
Authors: Philip Zigoris, Hongxia Jin
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

The practical success of broadcast encryption hinges on the ability to (1) revoke the access of compromised keys and (2) determine which keys have been compromised. In this work we focus on the latter, the so-called traitor tracing problem. The first method utilizes a Bayesian hierarchical model to replace a crucial step in a well known tracing algorithm. Previously, this step relied on worst case bounds, which often overestimate the number of tests needed to diagnose compromised keys. The second is an adaptive tracing algorithm that selects forensic tests according to the information gain criteria. The results of the tests refine an explicit model of our beliefs that certain keys are compromised. In choosing tests based on this criteria, we significantly reduce the number of tests, as compared to the state-of-the-art techniques, required to identify compromised keys.
Modified Modulated Hebb-Oja Learning Rule: A Method for Biologically Plausible Principal Component Analysis
Authors: Marko Jankovic, Pablo Martinez, Zhe Chen, Andrzej Cichocki
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

This paper presents Modified Modulated Hebb-Oja (MHO) method that performs principal component analysis. Method is based on implementation of Time-Oriented Hierarchical Method applied on recently proposed principal subspace analysis rule called Modulated Hebb-Oja learning rule. Comparing to some other well-known methods for principal component analysis, the proposed method has one feature that could be seen as desirable from the biological point of view --- synaptic efficacy learning rule does not need the explicit information about the value of the other efficacies to make individual efficacy modification. Simplicity of the "neural circuits" that perform global computations and a fact that their number does not depend on the number of input and output neurons, could be seen as good features of the proposed method. The number of necessary global calculation circuit is one. Some similarity to a part of the frog retinal circuit will be suggested, too.
A Three-Dimensional Pedestrian-Flow Simulation for High-Rising Buildings
Authors: Tomoyuki Hamada, Takayuki Hagiwara, Takashi Teramoto, Shin Morishita, Michiyuki Umetsu, Michiyo Ohgama
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

A three-dimensional pedestrian-flow simulation system for optimally designing a floor plan and elevator configuration of a high-rising building was developed. With this simulation system, the pedestrian flow is simulated by synchronizing horizontal traffic on each building floor and vertical traffic in elevators to generate three-dimensional movements of pedestrians in the building. The simulation system comprises an interaction model, in which the horizontal traffic affects the vertical traffic through elevator-calling actions of people, and the vertical traffic affects the horizontal traffic by massive injection of people onto floors from elevator cages. The effectiveness of the developed system was verified by comparing the simulated pedestrian flows with actual flows in two real buildings.
Adaptive Power Management Based on Reinforcement Learning for Embedded System
Authors: Cheng-Ting Liu, Roy Chaoming Hsu
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this study, an adaptive power management method based on reinforcement learning is proposed to improve the energy utilization and battery endurance for resource-limited embedded systems. A simulator which traces battery endurance and device operations is developed to examine the proposed method. Experimental results show that, in terms of battery efficiency and endurance, the performance of our proposed method is better than the traditional power management techniques, such as static power management method.
Effectiveness of Simultaneous Behavior by Interactive Robot
Authors: Masahiko Taguchi, Kentaro Ishii, Michita Imai
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The ability of a robot to do gaze-drawing and to gesture have become recognized as essential elements in achieving joint attention of the real world during human-robot interaction. However, the ability of a robot using such non-verbal actions to interrupt human action is unclear. We have conducted an experiment in which a robot tries to interrupt human action to demonstrate the effectiveness of an interactive robot acting simultaneously with a person. Using the results of this experiment, we developed a system that a robot can use to predict human motion so that the robot can automatically perform simultaneous behavior.
A Hardware/Software Cosimulator with RTOS Supports for Multiprocessor Embedded Systems
Authors: Takashi Furukawa, Shinya Honda, Hiroyuki Tomiyama, Hiroaki Takada
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

This paper presents a hardware/software cosimulator for multiprocessor embedded systems. Our cosimulator consists of multiple software simulators each of which simulates a set of application tasks together with an RTOS running on a processor, multiple hardware simulators and a cosimulation backplane. All of the simulators are executed concurrently with communication. Our cosimulator supports two types of communication; one is based on Remote Procedure Call (RPC), and the other is based on a shared memory on a host computer. Using the cosimulator, we successfully performed cosimulation of an MPEG encoder/decoder system with two processors and some peripheral circuits.
Constraint Abstraction in Verification of Security Protocols
Authors: Ti Zhou, Zhoujun Li, Mengjun Li, Huowang Chen
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

This paper incorporates time constraints in the Horn logic model, and this extended model can verify Wide-Mouthed-Frog protocol quickly. It discusses relations between the constraint system and Horn model, abstracts the constraint system, and gives the proofs of some propositions and theorems. We also give the algorithm about how to compute the abstract constraint, and analyze its complexity. As a case study we discuss the verification of Wide-Mouthed-Frog protocol whose attack can be found quickly in new model. Therefore, the method in this paper is very effective in verification of time sensitive security protocols. In the future, we will use this method to verify some complex protocols, such as Kerberos protocol etc.
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete
Authors: Lior Eldar, Oded Regev
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We show that the quantum SAT problem is -complete when restricted to interactions between a three-dimensional particle and a five-dimensional particle. The best previously known result is for particles of dimensions 4 and 9. The main novel ingredient of our proof is a certain Hamiltonian construction named the Triangle Hamiltonian. It allows to verify the application of a 2-qubit CNOT gate without generating explicitly interactions between pairs of workspace qubits. We believe this construction may contribute to progress in other Hamiltonian-related problems as well as in adiabatic computation.
Knowledge Planning and Learned Personalization for Web-Based Case Adaptation
Authors: David Leake, Jay Powell
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

How to endow case-based reasoning systems with effective case adaptation capabilities is a classic problem. A significant impediment to developing automated adaptation procedures is the difficulty of acquiring the required knowledge. Initial work on WebAdapt [1] proposed addressing this problem with "just-in-time" knowledge mining from Web sources. This paper addresses two key questions building on that work. First, to develop flexible, general and extensible procedures for gathering adaptation-relevant knowledge from the Web, it proposes a knowledge planning [2] approach in which a planner takes explicit knowledge goals as input and generates a plan for satisfying them from a set of general operators. Second, to focus selection of candidate adaptations from the potentially enormous space of possibilities, it proposes personalizing adaptations based on learned information about user preferences. Evaluations of the system are encouraging for the use of knowledge planning and learned preference information to improve adaptation performance.
Yes, Folks, Standards are a Many-Splendored Thing
Authors: P. H. Braverman
Venue: Computer (1979)

The use of written guidelines for application development contributes to a better product, increased productivity, and better communication with both management and users. 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
A Novel Image Fragile Watermarking Algorithm Based on Chaotic Map
Authors: Pei-pei Liu, Zhong-liang Zhu, Hong-xia Wang, Tian-yun Yan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

By using of chaotic map and block-wise independent technology, a new chaotic fragile watermarking algorithm is proposed in this paper. Firstly, location key is looked as logistic chaotic initial value to iterate and create location matrix, according to this matrix we can generate mapping image and identify the embedding location of watermarking in image blocks. Then watermarking sequence related with mapping image blocks and generated by heénon chaotic map is embedded into the LSB of corresponding location in the block, so as to achieve the different watermarking sequence even if image blocks is same, and effectively overcome security flaws of the block-wise independent watermarking algorithm. In addition, since the image content and watermarking were staggered, the algorithm had a higher security, and we needn't the original image when extracting watermarking. The accuracy of tamper localization can be achieved 2 × 2 block pixels. We provide experimental results to demonstrate the effectiveness of our method.
Triangular Bézier Approximations to Constant Mean Curvature Surfaces
Authors: A. Arnal, A. Lluch, J. Monterde
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

We give a method to generate polynomial approximations to constant mean curvature surfaces with prescribed boundary. We address this problem by finding triangular Bézier extremals of the CMC-functional among all polynomial surfaces with a prescribed boundary. Moreover, we analyze the $\mathcal{C}^1$ problem, we give a procedure to obtain solutions once the tangent planes for the boundary curves are also given.
Automatic Face Detection Using Feature Tracker
Authors: Ki-sang Kim, Gye-Young Kim, Hyung-Il Choi
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper presents a method for face detection which is robustness in face rotation. This method has two main modules, candidate face region detecting and tracking. To detect a face region in variously conditional image, we used skin color detection, which is rule-based algorithm. Then, to track the region, we applied Harris corner detection and a greedy feature tracker which has robustness for rotated facial image. In experimental result, we assess the performance of face tracking algorithm, which is robustness in rotation.
Efficient Hash Collision Search Strategies on Special-Purpose Hardware
Authors: Tim Güneysu, Christof Paar, Sven Schäge
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

Hash functions play an important role in various cryptographic applications. Modern cryptography relies on a few but supposedly well analyzed hash functions which are mostly members of the so-called MD4-family. This work shows whether it is possible to significantly speedup collision search for MD4-family hash functions using special-purpose hardware. A thorough analysis of the computational requirements for MD4-family hash functions and corresponding collision attacks reveals that a microprocessor based architecture is best suited for the implementation of collision search algorithms. Consequently, we designed and implemented a (concerning MD4-family hash-functions) general-purpose microprocessor with minimal area requirements and, based on this, a full collision search unit. Comparing the performance characteristics of both ASICs with standard PC processors and clusters, it turns out that our design, massively parallelized, is nearly four times more cost-efficient than parallelized standard PCs. Although with further optimizations this factor can certainly be improved, we believe that special-purpose hardware does not provide a too significant benefit for hash collision search algorithms with respect to modern off-the-shelf general-purpose processors.
Comparing the Efficiency of Localization Algorithms with the Power-Error-Product (PEP)
Authors: Frank Reichenbach, Jan Blumenthal, Dirk Timmermann
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

The localization process in wireless sensor networks must produce precise positions at minimal requirements. It is hard to comply with these conditions, due to the strong resource limitation of each sensor node. Although numerous algorithms have already been presented, so far there exist neither an extensive simulative comparison of them nor a qualified parameter to indicate their efficiency. Thus, this paper introduces a selected number of the most important algorithms for sensor networks. These algorithms are compared with each other considering achieved localization error and consumed energy. Then, we propose an adequate parameter to quantify their efficiency - the "Power Error Product" (PEP).
Locally Scaled Density Based Clustering
Authors: Ergun Biçici, Deniz Yuret
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Density based clustering methods allow the identification of arbitrary, not necessarily convex regions of data points that are densely populated. The number of clusters does not need to be specified beforehand; a cluster is defined to be a connected region that exceeds a given density threshold. This paper introduces the notion of local scaling in density based clustering, which determines the density threshold based on the local statistics of the data. The local maxima of density are discovered using a k-nearest-neighbor density estimation and used as centers of potential clusters. Each cluster is grown until the density falls below a pre-specified ratio of the center point's density. The resulting clustering technique is able to identify clusters of arbitrary shape on noisy backgrounds that contain significant density gradients. The focus of this paper is to automate the process of clustering by making use of the local density information for arbitrarily sized, shaped, located, and numbered clusters. The performance of the new algorithm is promising as it is demonstrated on a number of synthetic datasets and images for a wide range of its parameters.