ppxscal/embedding_network huggingface dataset:
The Filtering of Internet Images Based on Detecting Erotogenic-part
Authors: Xuanjing Shen, Wei Wei, Qingji Qian
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The research of pornographic images has recently emerged as an active topic. Compared with several deficiencies of the previous approaches which detected by the features of skin-color only, the paper presents a novel algorithm based on the face and trunk detection. And through the recognizing the erotogenic-part in the image, we implemented the algorithm and construct a simple and fast pornographic images classifier system based on a decision tree. The extensive experiments validated that the erotic images detecting system provides a higher detection rate and much lower false positive rate than many ones before. And results of experiments on 193 pornographic and 1259 benign images show a excellent performance, i.e. the detection rate has reached 80.31%, and the false positive rate has reached 18.30%.
Indexing large human-motion databases
Authors: Eamonn Keogh, Themistoklis Palpanas, Victor B. Zordan, Dimitrios Gunopulos, Marc Cardle
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actors, is the most promising approach offered thus far for animating realistic human characters. However, the manipulation of such data for general use and re-use is not yet a solved problem. Many of the existing techniques dealing with editing motion rely on indexing for annotation, segmentation, and re-ordering of the data. Euclidean distance is inappropriate for solving these indexing problems because of the inherent variability found in human motion. The limitations of Euclidean distance stems from the fact that it is very sensitive to distortions in the time axis. A partial solution to this problem, Dynamic Time Warping (DTW), aligns the time axis before calculating the Euclidean distance. However, DTW can only address the problem of local scaling. As we demonstrate in this paper, global or uniform scaling is just as important in the indexing of human motion. We propose a novel technique to speed up similarity search under uniform scaling, based on bounding envelopes. Our technique is intuitive and simple to implement. We describe algorithms that make use of this technique, we perform an experimental analysis with real datasets, and we evaluate it in the context of a motion capture processing system. The results demonstrate the utility of our approach, and show that we can achieve orders of magnitude of speedup over the brute force approach, the only alternative solution currently available.
A Top-Down and Greedy Method for Discretization of Continuous Attributes
Authors: Chien-I Lee, Cheng-Jung Tsai, Ya-Ru Yang, Wei-Pang Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Experiments show that CAIM discretization algorithm is superior to all the other top-down discretization algorithms. However, CAIM algorithm does not take the data distribution into account. The discretization formula used in CAIM also gives a high factor to the numbers of generated intervals. The two disadvantages make CAIM may generate irrational discrete results in some cases and further leads to the decrease of predictive accuracy of a classifier. In this paper we propose the Class-Attribute Contingency Coefficient discretization algorithm. The experimental results showed that compared with CAIM, our method can generate a better discretization scheme to bring on the improvement of accuracy of classification. With regard to the number of generated rules and execution time of a classifier, CACC and CAIM achieve comparable results.
Organization-Oriented Chemical Programming
Authors: Peter Dittrich, Naoki Matsumaru
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Chemical information processing posseses a variety of valuable properties, such as, robustness, concurrency, faulttolerance, and evolvability. However, it is difficult to predict and program a chemical system, because the computation emerges as a global phenomenon from microscopic reactions. Here, we will present design principles for chemical programs. We focus on programs that should compute a qualitative and not quantitative result. The design principles are based on chemical organization theory, which defines a chemical organization as a closed and selfmaintaining set of molecular species. The fundamental assumption of so called organization-oriented programming is that computation should be understood as a movement between chemical organizations. In this case we expect that the resulting system is more robust, and fine-tuning of the kinetic laws will be less important.
Development of Low-power and Real-time VC-1/H.264/MPEG-4 Video Processing Hardware
Authors: M. Hase
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper covers a multi-functional hardware intellectual property (IP) for the encoding and decoding of digital moving pictures with low power consumption. The IP is mainly intended for mobile products such as cellular phones, digital still cameras (DSCs), and digital video cameras (DVCs). It includes VC-1 functionality for Internet content plus AVC (H.264) functionality for digital television broadcasting and MPEG-4 functionality for TV telephony, and is capable of processing D1-sized moving pictures (720 pixels by 480 lines) in real time at an operating frequency of 54 MHz. In addition, original algorithms employed in the IP reduce power consumption by up to 22%.
Feature Refinement
Authors: Steve Reeves, David Streader
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Development by formal stepwise refinement offers a guarantee that an implementation satisfies a specification. But refinement is frequently defined in such a restrictive way as to disallow some useful development steps. Here we de- fine feature refinement to overcome some limitations of re- finement and show its usefulness by applying it to examples taken from the literature. Using partial relations as a canonical state-based semantics and labelled transition systems as a canonical event-based semantics, we degine functions formally linking the state- and event-based operational semantics. We can then use this link to move notions of refinement between the event- and state-based worlds. An advantage of this abstract approach is that it is not restricted to a specific syntax or even a specific interpretation of the operational semantics
An intelligent agent-based architecture for strategic information system applications
Authors: Mohsen Akbarpour Shirazi, Javad Soroor
Venue: Knowledge-Based Systems (2007)

Strategic information systems (SIS) focus on the use of information system (IS) and information technology (IT) in the strategic management process in business organizations. The emphasis is on the strategic view of IS and IT and their impact on organizational strategy. Increased competition and advances in information technologies push for considerable structural changes in SIS. Agents, as autonomous entities which either work on their own or cooperate with others, and agent architectures have enormous potentials to be applied in such critical systems. In this article, first we investigate the very fundamental concepts of strategic information systems and intelligent agent technology. Then, the discussion continues on the specification of the characteristics and implementation issues of a typical SIS. Afterwards, we make use of these concepts and integrate them into a state-of-the-art, intelligent architecture for strategic information systems, called intelligent agent-based SIS. This is a comprehensive framework for a SIS in IT era which may be put into practice by a team of professionals in the near future. The graphical representation of this model is intended to help the reader understand the concept much better. After explaining the suggested model in full details, we introduce some support agents and specify their corresponding roles in an intelligent agent-based SIS architecture. Discussions and concluding remarks regarding the proposed system are provided at the end of the paper.
Automatic Self-Reconfiguration of System-on-Chip Peripherals
Authors: Neil W. Bergmann, Yi Lu, John A. Williams
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

A technique is presented which allows an FPGA-based reconfigurable System-on-Chip to automatically and dynamically load hardware peripheral controllers and software device drivers depending on the system's automated identification of peripheral boards which are connected to the FPGA. The technique loads peripheral detection modules into peripheral controller slots at system startup, and after these modules identify the peripheral, the correct hardware controllers and software drivers are loaded.
Experimentation of Interferometric Synthetic Aperture Sonar
Authors: Jun Yun, Ming Chen, Jin-song Tang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To verify the feasibility of InSAS in free tow mode other than rail mode, an experimental interfereometric synthetic aperture sonar (InSAS) system has been developed, and a set of experimentations has also been conducted. The primary purpose of the experimentation is to confirm the validity of the platform and the phase unwrapping algorithms. An interferometic synthetic aperture image is successfully formatted by experimental results, and clearly shows the effectiveness of the InSAS system. It also shows the resolution ability of 5cm and 10cm in range and in azimuth respectively. The accuracy of bathymetry is far more than IHO standard.
On the economics of software
Authors: Michael Wing
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Source is not precious. One can go to code.google.com and download source by the gigabyte. That's a lot. It would take most people an entire career to read and appreciate a gigabyte of code. Reading one chapter of a book per hour or a 50,000 word novel in twelve hours corresponds to reading 1 billion characters in 20 years, at 40 hours per week. Wading through gigabytes of code to find the few lines that one cares about can take a long time. On the other hand, applications are valuable, because they do specific things for specific users. Working apps consist of specific bodies of source.
An Integrated System of Intrusion Detection Based on Rough Set and Wavelet Neural Network
Authors: Ling Yu, Bo Chen, Junmo Xiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In order to improve the performance of traditional intrusion detection system(IDS) based on neural network, we design and implement an integrated model of IDS based on rough set and wavelet neural network(RWNN-IDS). This paper focuses on applying RWNN for attacks recognition. We first present a conditional information entropy based algorithm to select the smallest features set, which can ensure the correct classification. We then design a novel wavelet neural network(WNN), its hidden unit is a multi-dimensional non-product wavelet-sigmoid basis function. A set of heuristic learning rules using dynamic hidden nodes method is presented for attacks classification. Constructing and training the WNN with tidy training set can improve generalization capability and classification accuracy. The experimental results show that this system outperforms traditional neural network based IDS in terms of detection speed and accuracy, computational cost, system adaptability. It also provides new ideas to improve performance of Distributed IDS.
New Products
Authors: C. Machover
Venue: IEEE Computer Graphics and Applications (1982)

Orcatech announces Design Engineering Workstation The Orcatech's Design Engineering Workstation, or DEW, series combines three fundamental building blocks, says the company -high-resolution, fast graphics, computer processing power for the application; and graphics and system software to support application development and execution. 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
Quantitative Analysis of In-Field Defects in Image Sensor Arrays
Authors: Jenny Leung, Jozsef Dudas, Glenn H. Chapman, Israel Koren, Zahava Koren
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Growth of pixel density and sensor array size increases the likelihood of developing in-field pixel defects. An ongoing study on defect development in imagers has now provided us sufficient data to be able to quantify characteristics of defect growth. Preliminary investigations have shown that defects are distributed randomly and the closest distance between two defective pixels is approximately 79-340 pixels apart. Furthermore, from an observation of 98 cluster-free defects, the diameter of the defect is estimated to be less than 2.3% of a pixel size at 99% confidence level. The fact that no defect clusters were found in the study of various digital cameras allows us to conclude that defects are not likely to be related to material degradation or imperfect fabrication but are due to environmental stress such as radiation. Furthermore, as verified by a statistical study, the absence of defect clustering provides information on the size of defects and insight into the nature of the defect development.
Tensions across the scales: planning infrastructure for the long-term
Authors: David Ribes, Thomas A. Finholt
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

In designing information infrastructure participants are planning for the long-term. The notion of infrastructure evokes images beyond 'a proof of concept,' a 'prototype' or an isolated 'application'; it is intended to be a persistent, ubiquitous and reliable environment. However, in implementing such projects participants confront multiple difficulties such as securing sustained funding, supporting maintenance and integrating new technologies. Based on cross-case ethnographic analysis this paper traces nine tensions identified by participants as they endeavor to transition from short-term projects to long-term information infrastructure. We explore three core concerns framed by actors: motivating contribution; aligning end-goals; and designing for use. These concerns have unique implications for each scale of infrastructure: institutionalization; the organization of work; and enacting technology.
A plan for malware containment in the DETER testbed
Authors: Ron Ostrenga, Stephen Schwab, Robert Braden
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

The DETER testbed provides a shared Internet-accessible environment where security researchers can safely run experiments and companies can test their security products. Experimentation with malware in DETER has so far been limited to simulated worms, which only simulate the spreading action without actually infecting any computer systems. This paper outlines a set of architectural and procedural changes that should allow safe experimentation with a class of moderately risky, real malware in the DETER testbed.
Minimax Regret Classifier for Imprecise Class Distributions
Authors: Rocío Alaiz-Rodríguez, Alicia Guerrero-Curieses, Jesús Cid-Sueiro
Venue: The Journal of Machine Learning Research (2007)

The design of a minimum risk classifier based on data usually stems from the stationarity assumption that the conditions during training and test are the same: the misclassification costs assumed during training must be in agreement with real costs, and the same statistical process must have generated both training and test data. Unfortunately, in real world applications, these assumptions may not hold. This paper deals with the problem of training a classifier when prior probabilities cannot be reliably induced from training data. Some strategies based on optimizing the worst possible case (conventional minimax) have been proposed previously in the literature, but they may achieve a robust classification at the expense of a severe performance degradation. In this paper we propose a minimax regret (minimax deviation) approach, that seeks to minimize the maximum deviation from the performance of the optimal risk classifier. A neural-based minimax regret classifier for general multi-class decision problems is presented. Experimental results show its robustness and the advantages in relation to other approaches.
Using fuzzy logic to improve a clustering technique for function approximation
Authors: A. Guillén, J. González, I. Rojas, H. Pomares, L. J. Herrera, O. Valenzuela, A. Prieto
Venue: Neurocomputing (2007)

Clustering algorithms have been successfully applied in several disciplines. One of those applications is the initialization of radial basis function (RBF) centers composing a neural network, designed to solve functional approximation problems. The Clustering for Function Approximation (CFA) algorithm was presented as a new clustering technique that provides better results than other clustering algorithms that were traditionally used to initialize RBF centers. Even though CFA improves performance against other clustering algorithms, it has some flaws that can be improved. Within those flaws, it can be mentioned the way the partition of the input data is done, the complex migration process, the algorithm's speed, the existence of some parameters that have to be set in order to obtain good solutions, and the convergence is not guaranteed. In this paper, it is proposed an improved version of this algorithm that solves the problems that its predecessor have using fuzzy logic successfully. In the experiments section, it will be shown how the new algorithm performs better than its predecessor and how important is to make a correct initialization of the RBF centers to obtain small approximation errors.
Recursive prediction for long term time series forecasting using advanced models
Authors: L. J. Herrera, H. Pomares, I. Rojas, A. Guillén, A. Prieto, O. Valenzuela
Venue: Neurocomputing (2007)

There exists a wide range of paradigms, and a high number of different methodologies that are applied to the problem of time series prediction. Most of them are presented as a modified function approximation problem using input/output data, in which the input data are expanded using values of the series at previous steps. Thus, the model obtained normally predicts the value of the series at a time (t+h) using previous time steps (t-@t"1),(t-@t"2),...,(t-@t"n). Nevertheless, learning a model for long term time series prediction might be seen as a more complicated task, since it might use its own outputs as inputs for long term prediction (recursive prediction). This paper presents the utility of two different methodologies, the TaSe fuzzy TSK model and the least-squares SVMs, to solve the problem of long term time series prediction using recursive prediction. This work also introduces some techniques that upgrade the performance of those advanced one-step-ahead models (and in general of any one-step-ahead model), where they are used recursively for long term time series prediction.
Design of Bean Pumping Units Based on Multi-objective Optimal Evolutionary Algorithm
Authors: Keqing Li, Shan Ouyang, Fahong Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

General Multi-objective Optimal Evolutionary Algorithms (MOEA) can find as possible as optimal resolution set during solving Multi-objective Problems (MOP), however it cannot solve those problems which having strict constrained conditions. This paper proposed a novel method based on geometry character-- Geometrical Pareto Selection (GPS), which being used to optimize the two objective problems of beam pumping units (the maximum peak torque factor and acceleration during upstroke). This algorithm generated an initial population whose genes produced by complex method and coded the mechanism dimensions of bean pumping units with float, kept sufficient valid individuals throughout crossover and variation, selected those points which were more farther from the infinite far away point to form candidate set during every generation, and sifted valid Pareto frontier through the candidate set in the final. The experimental results proved that the algorithm proposed in this paper worked well for MOP with strict constrained conditions.
Cleanroom Software Engineering
Authors: H. D. Mills
Venue: IEEE Software (1987)

Software quality can be engineered under statistical quality control and delivered with better quality. The Cleanroom process gives management an engineering approach to release reliable products.
A genetic algorithm environment for star pattern recognition
Authors: Shaunna McClintock, Tom Lunney, Abdulla Hashim
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

This paper reviews genetic algorithms and considers their application in the domain of attributed point pattern matching, specifically star pattern recognition. Conventional algorithms employed in this area are first reviewed and the suitability of the genetic algorithm approach considered. A test environment is built and used to provide feedback on the viability of this approach. Algorithm testing is carried out using this environment, and results compared with the performance of the traditional star pattern search algorithms. The genetic algorithm approach discussed in this paper is shown to be a viable alternative to the conventional search algorithms (Benelli and Mecocci, ESA J. 17 (1993), 185-198; Murtagh, Astronom. Soc. Pacific 104 (1992), 301-307; Junkins and White, J. Astronom. Sci. XXV(3) (1977), 251-270), achieving on average fewer multiple matches and producing 'higher quality' solutions.
A framework for system-level modeling and simulation of embedded systems architectures
Authors: Cagkan Erbas, Andy D. Pimentel, Mark Thompson, Simon Polstra
Venue: EURASIP Journal on Embedded Systems (2007)

The high complexity of modern embedded systems impels designers of such systems to model and simulate system components and their interactions in the early design stages. It is therefore essential to develop good tools for exploring a wide range of design choices at these early stages, where the design space is very large. This paper provides an overview of our system-level modeling and simulation environment, Sesame, which aims at efficient design space exploration of embedded multimedia system architectures. Taking Sesame as a basis, we discuss many important key concepts in early systems evaluation, such as Y-chart-based systems modeling, design space pruning and exploration, trace-driven cosimulation, and model calibration.
Software Engineering: The Future of a Profession
Authors: J. D. Musa
Venue: IEEE Software (1985)

Increasing and diverse pressures, manpower shortages, and technology transfer problems all plague the growing software engineering profession. Industry, government, education, and the professional society together must help.