ppxscal/embedding_network huggingface dataset:
A Background Reconstruction Method Based on Double-background
Authors: Wei Pan, Kun Wu, Zhi Chai, Zhi-Sheng You
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we show a new method to reconstruct and update the background. This approach is based on double-background. We use the statistical information of the pixel intensity to construct a background that represents the status during a long time, and construct another background with feedback information in motion detection that represents the recent changes at a short time. This couple of background images is fused to construct and update the background image used to motion detection. The background reconstruction algorithm can perform well on the tests that we have applied it to.
An algorithm of pornographic image detection
Authors: Hong Zhu, Shuming Zhou, Jianying Wang, Zhongke Yin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Real-time detection of pornographic images can effectively prevent pornographic images from spreading on the Internet. The methods of detection mainly focus on the identification of skin region. To overcome the disadvantages of traditional algorithms, in this paper, we propose a skin model based on the combination of YIQ, YUV, and HSV. In the step of the pre-dealing, we use white balance algorithm to achieve better skin area. Then, texture model based on Gray Level Co-Matrix (GLCM) and geometric structure of human beings are used to decrease the disruptions of the background region similar with the skin area. The features which extracted from the last images dealt by color and texture model are input into Support Vector Machines (SVM), through which the pornographic images and assorted control images are classified successfully. An experiment using 400 pornographic images and 400 assorted control images is carried out. Experimental results show that the algorithm of skin texture-based and feather-based detection has perfect performances, and the detection rate can reach 88.89%.
Geographically-aware information retrieval for collections of digitized historical maps
Authors: Bruno Martins, Jose Borbinha, Gilberto Pedrosa, João Gil, Nuno Freire
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

DIGMAP is a project focused on historical digitized maps. The project will develop a set of services, to be available in the Internet, based on reusable open-source software solutions. The main service will provide discovery and access to resources related to historical cartography, based on metadata from European national libraries and other relevant third part providers. These resources will comprise both physical and digitized objects. In the case of digitized maps, available metadata will be enriched by automatic and semi-automatic processes that will try to extract relevant indexing information from the images of the digitized maps, as also from any kind of associated text. This paper presents an early overview on the project, particularly focusing on the aspects related to geographical information retrieval.
Enabling MPEG-7 structural and semantic descriptions in retrieval applications
Authors: Ana B. Benitez, Di Zhong, Shih-Fu Chang
Venue: Journal of the American Society for Information Science and Technology (2007)

The MPEG-7 standard supports the description of both the structure and the semantics of multimedia; however, the generation and consumption of MPEG-7 structural and semantic descriptions are outside the scope of the standard. This article presents two research prototype systems that demonstrate the generation and consumption of MPEG-7 structural and semantic descriptions in retrieval applications. The active system for MPEG-4 video object simulation (AMOS) is a video object segmentation and retrieval system that segments, tracks, and models objects in videos (e.g., person, car) as a set of regions with corresponding visual features and spatiotemporal relations. The region-based model provides an effective base for similarity retrieval of video objects. The second system, the Intelligent Multimedia Knowledge Application (IMKA), uses the novel MediaNet framework for representing semantic and perceptual information about the world using multimedia. MediaNet knowledge bases can be constructed automatically from annotated collections of multimedia data and used to enhance the retrieval of multimedia.
Algebraic multigrid methods for elastic structures with highly discontinuous coefficients
Authors: Yingxiong Xiao, Ping Zhang, Shi Shu
Venue: Mathematics and Computers in Simulation (2007)

In this paper, we propose two types of algebraic multigrid (AMG) methods to find the numerical solution of elastic structures with highly discontinuous coefficients. One is the interface preserving coarsening AMG method. The idea of this method is to capture the discontinuous behavior of the gradient of the displacement functions along the interfaces. It selects coarse grid points so that all the coarse grids are aligned with the interface for regular interface problems on structured grids and for irregular interface problems on unstructured grids in a purely algebraic way. As a result, AMG with simple linear interpolation and point block Gauss-Seidel smoothing is sufficient to obtain the usual rapid multigrid convergence. The process of coarse grid selection given in this paper can be performed in parallel. Another method introduced in this paper is an AMG method by applying a special block Gauss-Seidel smoother with blocks corresponding to the constant coefficient regions and their interfaces. The results of various numerical experiments in two dimensions are presented. It is shown from the numerical results that the resulting AMG methods are more robust and efficient than the commonly used AMG method in both CPU times and numbers of iteration for elastic structures with highly discontinuous coefficients.
Regularized collocation method for Fredholm integral equations of the first kind
Authors: M. Thamban Nair, Sergei V. Pereverzev
Venue: Journal of Complexity (2007)

In this paper we consider a collocation method for solving Fredholm integral equations of the first kind, which is known to be an ill-posed problem. An ''unregularized'' use of this method can give reliable results in the case when the rate at which smallest singular values of the collocation matrices decrease is known a priori. In this case the number of collocation points plays the role of a regularization parameter. If the a priori information mentioned above is not available, then a combination of collocation with Tikhonov regularization can be the method of choice. We analyze such regularized collocation in a rather general setting, when a solution smoothness is given as a source condition with an operator monotone index function. This setting covers all types of smoothness studied so far in the theory of Tikhonov regularization. One more issue discussed in this paper is an a posteriori choice of the regularization parameter, which allows us to reach an optimal order of accuracy for deterministic noise model without any knowledge of solution smoothness.
The symbolic programming environment (SPE&trade;): a common Lisp development environment for Sun workstations
Authors: Aaron Endelman, Steve Gadol
Venue: ACM SIGPLAN Lisp Pointers (1988)

The constructs provided in the Common Lisp Language provide a very powerful and flexible representation mechanism. The language alone, however, does not create an efficient work environment. Without tools that explicitly attack the problems of program organization, editing, and debugging, it remains a difficult task to exploit these advantages fully. What is needed is a collection of tools which, with knowledge about the relationship of the components in Lisp and a model of how Lisp programs are developed, encapsulates the tasks that constitute the Lisp programming process. Building such a programming environment in Lisp is a more tractable problem than in most conventional languages (such as C, FORTRAN, and Pascal) because the flexibility of Lisp allows programs to be operated on as data by other Lisp programs. This gives rise to the potential for a much tighter integration of tools than has typically been available.
A Hybrid Intelligent System for Active Video Surveillance
Authors: Massimo de Gregorio
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we propose a new approach to active video surveillance intelligence systems based on the integration of artificial neural networks (ANN) and symbolic Artificial Intelligence (AI). In particular, the neurosymbolic hybrid system here presented is formed by virtual neural sensors (WiSARD like systems) and BDI agents. The coupling of virtual neural sensors with symbolic reasoning for inter- preting their outputs, makes this approach both very light from the computational and hardware point of view and quite robust in performances.
Multi-objective Robust Optimization Using Probabilistic Indices
Authors: Yali Xue, Donghai Li, Wenxiao Shan, Chuanfeng Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In the multi-objective optimizations, it is quite crucial to obtain a set of solutions which make the objective functions robust to the system parameters uncertainties. In this paper, two probability-based indices -- violation probability and cumulative satisfaction probability are introduced to evaluate the multi-objective probabilistic robustness at a specified acceptance performance level. The first index is minimized as the multi-objective function (instead of the original non-robust multi-objective function) to obtain a set of Pareto-optimal solutions, which guarantees the maximum probability of acceptable performance when system parameters vary in a stochastic manner. The second index is used to get an insight and distinct observation of above Pareto-optimal solutions at all performance levels, which facilitate the users to make a decision. An example of probabilistic robust multi-objective optimization problem is solved to illustrate the optimization and analysis method.
Organized Anonymous Agents
Authors: Martijn Warnier, Frances Brazier
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Anonymity can be of great importance in distributed agent applications such as e-commerce & auctions. This paper proposes and analyzes a new approach for organized anonymity of agents based on the use of pseudonyms. A novel naming scheme is presented that can be used by agent platforms to provide automatic anonymity for all agents on its platform, or, alternatively, to provide anonymity on demand. The paper also introduces a new technique, based on the use of handles, that can be fully integrated in an agent platform. Performance measures for an anonymity service implemented for the AgentScape platform provides some insight in the overhead involved.
A Scriptable, Statistical Oracle for a Metadata Extraction System
Authors: Kurt J. Maly, Steven J. Zeil, Mohammad Zubair, Ashraf Amrou, Ali Aazhar, Naveen Ratkal
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

An oracle is described for dynamic validation of an ap- plication (metadata extraction from scanned documents) where a moderate failure rate is acceptable provided that instances of failures during operation can be identified. The oracle combines a variety of deterministic tests and statis- tical tests based upon characteristics of the document col- lection on which the system operates. Because this system must adapt to a variety of document collections with differ- ent characteristics, a scripting language is developed that binds combinations of tests to the metadata fields expected in a given document collection. The suitability of the ora- cle is demonstrated by an experiment measuring its ability to mimic human judgments as to which of several alternate outputs for the same document would be preferred.
Computing in China, 1980
Authors: H. D. Huskey
Venue: Computer (1981)

China is moving to western technology and a revamped educational system to help her computer industry recover from the effects of the Cultural Revolution.
Variable-Mode Counting with Straight Binary Counters
Authors: J. S. Byrd
Venue: IEEE Transactions on Computers (1971)

A design technique using complementary gating and simulated data was developed to permit a straight binary counter to be used as a variable-mode counter. Any family of binary logic modules can be used.
Network Coding Based Multicast in Internet
Authors: Jing Wang, Ying Li, Xinmei Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Multicast transmission is a key technology in Internet, which can send the same information simultaneously to several receivers. A new multicast routing algorithm based on network coding is proposed in this paper, searching the routing groups from source to each receiver by using Dijkstra reduction network. Simulation results show that, compared with traditional multicast routing algorithms, performances of the routing algorithm are improved at a great extent in resource consumption and load balance, and are closer to minimum-cost multicast algorithm based on network coding. Finally, mathematic analysis indicates that the algorithm has lower computational complexity.
A Recommended Curriculum in Computer Science and Engineering
Authors: M. C. Mulder
Venue: Computer (1977)

Digital computers go back to the early 1940's, but significant work in computer science and engineering educaion was not to be seen until the 1960's. Originally, the customer training and education provided by the manufacturers resented virtually the only computer education available. Then in the 1950's, a large number of private computer schools emerged to fill the burgeoning demand for computer personnel. Finally, with encouragement from industry and guidance from the professional societies, computer science and engineering programs began to be offered in institutions of higher learning.
An SoC Embedded System Implementation Using an Array Sensor
Authors: Cheol-Hong Moon, Young-Soo Roo, and Hwa-Young Kim
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Many object detection systems using CCD cameras have been released. However, object recognition is highly limited when these detection systems are used underwater or in dark places. In order to improve these limiting factors, we have implemented a SoC system for object detection by using an ultrasonic sensor array. The SoC system consists of an ultrasonic sensor array control section and a SoC system for object detection. The ultrasonic sensor control section is designed by using a FPGA system. The ultrasonic driving signal and generated analog signal are converted into a 32-bit digital signal and delivered to the SoC system. The SoC system is implemented to detect an object through the data entered and to control the ultrasonic sensor array control section.
Information Coverage and Network Lifetime in Energy Constrained Wireless Sensor Networks
Authors: Bang Wang, Vikram Srinivasan, Kee Chaing Chua, Wei Wang
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper studies the problem of how to maximize the network lifetime while preserving network coverage for an energy constrained wireless sensor network. We consider network coverage from an our recently proposed information coverage model [1] other than the conventional sensing disk model. The lifetime maximization problem is modeled as a nonlinear programming problem and is shown NP-Complete. We then propose a family of greedy algorithms to allocate sensors different roles such that different sensors may consume different amount of energies in different intervals to prolong network lifetime while still guaranteeing application requirements. Simulation results suggest that the algorithm with the best balancing between communication energy consumption and area coverage requirement has the highest network lifetime.
2007 Special Issue: Phenomenology and digital neural architectures
Authors: Igor Aleksander, Helen Morton
Venue: Neural Networks (2007)

A model of conscious mechanisms called Axiomatic Consciousness Theory (ACT) is used to develop a neuroarchitectural model of visual phenomenology. The result is an extension of concepts in neural systems towards phenomenal intentionality: the lack of which is a common starting point for critiques of AI. Here the argument is developed at four interacting grain levels of description and the associated analysis. The visual domain is highlighted due to its dominance in discussions involving inner mental states.
A Particle Swarm Social Model for Multi-Agent Based Insurgency Warfare Simulation
Authors: Xiaohui Cui, Thomas E. Potok
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

To better understand insurgent activities and asymmetric warfare, a social adaptive model for modeling multiple insurgent groups attacking multiple military and civilian targets is proposed and investigated. This report presents a pilot study using the particle swarm modeling, a widely used non-linear optimal tool, to model the emergence of insurgency campaign. The objective of this research is to apply the particle swarm metaphor as a model of insurgent social adaptation for the dynamically changing environment and to provide insight and understanding of insurgency warfare. Our results show that unified leadership, strategic planning, and effective communication between insurgent groups are not the necessary requirements for insurgents to efficiently attain their objectives.
Hybrid Wavelet Model Construction Using Orthogonal Forward Selection with Boosting Search
Authors: Meng Zhang, Jiaogen Zhou, Lihua Fu, Tingting He
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

often encountered in science and engineering areas, it is unsuitable to use the conventional kernel methods. This paper considers sparse regression modeling using a generalized kernel model in which each kernel regressor has its individually tuned center vector and diagonal covariance matrix. An orthogonal least squares forward selection procedure is employed to select the regressors one by one using a guided random search algorithm. In order to prevent the possible over-fitting, a practical method to select termination threshold is used. A novel hybrid wavelet is constructed to make the model sparser. The experimental results show that this generalized model outperforms traditional methods in terms of precision and sparseness. And the models with wavelet and hybrid kernel have a much faster convergence rate as compared to that with conventional RBF kernel. For example, for non-flat function estimation problem, those methods adopt a single common variance for all kernel regressors and estimate both the steep and smooth variations using an unchanged scale. Recently, a revised version of SVR, namely multi- scale support vector regression (MSSVR) [4, 5], is proposed by combining several feature spaces rather than a single feature space in standard SVR. The constructed multi-feature space is induced by a set of kernels with different scales. MSSVR outperforms traditional methods in terms of precision and sparseness, which will also be illuminated in our experiments. Kernel basis pursuit (KBP) algorithm [6] is another possible solution which enables us to build a - regularized multiple-kernel estimator for regression. However, KBP is prone to over-fit the noisy data. We will compare its performance with our new algorithm. 1 l
A systematic approach to automatically generate test scenarios from UML activity diagrams
Authors: Dong Xu, Huaizhong Li, C. Peng Lam
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Test scenarios are frequently used in scenario-based software testing. However, generation of the test scenarios is usually a manual and labor-intensive task. It is often desired that test scenarios can be automatically generated. As a semi-formal modeling language, UML is widely used in both academia research and industry practice to describe analysis and design specifications. The UML activity diagrams (ADs) are mainly used in business logic processing at the early stage of software development life-cycle. Obviously, testing scenarios generated from ADs can contribute to test driven development. Nevertheless, it is difficult to automatically generate test scenarios from ADs which contains fork-join pairs mixed with loops and branches. In this paper, a systematic approach is proposed to automatically generate test scenarios from the UML activity diagrams which may contain complicated fork-join structure.
Active guideline: spatiotemporal history as a motion technique and navigation aid for virtual environments
Authors: Andreas Simon, Christian Stern
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Users of virtual environments regularly have problems using 3D motion interfaces and exhibit a disturbing tendency to become disoriented and get lost quickly in large virtual worlds. We introduce the active guideline, a novel auxiliary motion technique and navigation aid for virtual environments. Similar to the ubiquitous Back-button interface for web navigation, the active guideline implicitly records a history of the user's motion and allows immediate and convenient travel back (and forth) along a trace of the previously traveled path. This lets users revisit previous viewpoints, allowing them to recover from being "lost in space" by enabling easy, continuous backtracking all the way up to the "home" position. In contrast to bookmarking of viewpoints, the active guideline is "always-on" and requires no active user intervention or strategic planning to successfully function as a navigation aid. This paper discusses the behavior and implementation of the active guideline and presents results of an initial study exploring the usability of the technique.
Method for Automatic Image Recognition based on Algorithm Fusion
Authors: Le Song, Yuchi Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Taking the universal tools microscope (UTM) as an example, this paper proposes an original solution to the automatic image recognition of ocular optical measuring instruments based on algorithm fusion. An area-array CCD is used as the image collection device and a series of image pre-processing methods are adopted to locate the reticles and digit characters in ocular lens view images. A two-layer image recognition model which bands together the correlation-based template matching and an optimized BP concurrent neural network is established. The method featured as multiple complementary extraction is used in generating eigenvectors of the network. The experiment result shows the processing speed of the automatic reading method is enhanced on the basis of exerting the advantages of the high recognition ratio of neural network.