ppxscal/embedding_network huggingface dataset:
Shoeprint Image Retrieval by Topological and Pattern Spectra
Authors: H. Su, D. Crookes, A. Bouridane
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

In this paper, we propose a novel technique for the automatic classification of noisy and incomplete shoeprint images, based on topological and pattern spectra. We first consider the pattern spectrum proposed by Maragos. We extend each spectrum with the spectrum for the complement image. We also propose a Topological Spectrum for a shoeprint image, based on repeated open operations with increasing size of structuring element, giving a distribution of Euler numbers. The normalised differential of this series gives the topological spectrum. We secondly propose a hybrid algorithm which uses a distance measure based on a combination of both spectra as the feature of a shoeprint image. To evaluate the performance of the techniques, we use a database of 500 "clean' shoeprints to generate five test databases each with 2500 degraded images, such as Gaussian noise, incompletion, rotation, rescale, and scene background. The statistical evaluations in terms of precision vs. recall are given in the final section. Tests show that our hybrid technique combining both spectra gives significant improvements over previously published results for edge direction histogram.
"KODAMA": mischievous echoes
Authors: Hisako Kroiden Yamakawa
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

I created "KODAMA" to demonstrate my sensation of solidified human voices in conversation. "KODAMA" is an interactive installation. The "KODAMA" are tree fairies that live in the forest who listen to human voices and mimic their sounds. They are visually depicted as bubbles or pockets of air that move around a projection of the forest. Their movement on screen is controlled by the movement of the audience detected by motion sensors. The audience's voices are captured and re-played by the "KODAMA".
Structuring cross-organizational knowledge sharing
Authors: Kevin F. White, Wayne G. Lutters
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Ontology development is fundamental to most knowledge management efforts. When approached in a formal knowledge engineering manner the resulting ontology usually becomes brittle when spanning even a modest number of groups within a single organization. It breaks entirely when scaled to multiple, heterogeneous organizations. A promising alternative is the bottom-up approach such as can be found in social tagging systems (e.g., del.ico.us), but little research has examined the utility of these systems for knowledge reuse activities. In this paper we extend our field work with IT helpdesk staff to examine the drivers for natural ontology development. We found that a balance between some degree of external order while maintaining local flexibility was required. This information space is navigated via social relations, especially expert referral. We examine the user-centered design criteria for both mid-level ontology development and related expert profile management.
Realizing property-based attestation and sealing with commonly available hard- and software
Authors: Ulrich Kühn, Marcel Selhorst, Christian Stüble
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

The authenticated boot process introduced by the Trusted Computing Group (TCG) uses binary measurements, i.e., hashes of executables, to give an indication of which software configuration runs on a given computing platform. As the binary measurements change with any software update, sealed data becomes unavailable, too. To solve this and other problems regarding binary measurements, the concept ofproperty-based attestation has been introduced. In this paper we show how to realize both property-based attestation and property-based sealing using existing TCG-enabled hard- and software. The main idea is that an enhanced boot loader translates between binary measurements and properties, allowing to attest properties of unmodified operating systems loaded. Moreover, applications running on top of this operating system can use existing mechanisms, e.g., an existing Trusted Software Stack (TSS) implementation, to seal data to properties instead of binary hash values One cornerstone of our proposal is the ability to also revoke the translation of certain binary measurements into properties in case of identified security problems. Our proposal is ideally suited for enterprise environments having a centralized IT-management infrastructure and scales well with the number of participating clients.
A Novel Rake Receiver Design for Wideband Wireless Communications
Authors: Konstantinos B. Baltzis, John N. Sahalos
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper a novel RAKE receiver design is proposed. Its main characteristic is its non-uniform taps distribution. A wide-sense stationary uncorrelated scattering (WSSUS) frequency-selective Rayleigh fading channel is assumed. Uniform and exponential power delay profiles (PDPs) are considered. Taps positions optimization is done according to the Maximum Power Minimum Correlation (MPMC) criterion. This implies the simultaneous maximization of the sum of squares of total average signal power received in each finger and minimization of the sum of squares of autocorrelation between each pair of fingers. Robustness of the technique with respect to errors in channel estimation or in the optimum taps placement is also studied. Several simulation examples of the proposed receiver show its superior performance comparing with other implementations. Finally analytical expressions for the correlation coefficients at the branches outputs of a RAKE receiver for rectangular chip waveforms are derived.
A method for voxel visualization of 3D objects
Authors: N. A. Taranukha, Z. A. Izabekov
Venue: Programming and Computing Software (2007)

In the paper, a method for forming data structures for voxel description of volume objects is suggested. An approach for projecting octant trees (octrees) is formulated and described. A method for visualization of volume data represented by a voxel octree with removing invisible objects is suggested. We formulate a rule for the choice of transversal order for recursive structure for forming an image with removing invisible parts, which makes it possible to reduce the time of priority calculations in sorting voxels by the distance to the observer. Formation of topology of voxel projection images of three types and the corresponding data structures are considered. A space of 3D object mappings represented by voxel octant trees is discussed.
Key Management Based on Elliptic Curve Paillier Scheme in Ad Hoc Networks
Authors: Huaqun Wang, Shuping Zhao, Guoxing Jiang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The problem of key management in ad hoc networks was analyzed. Based on the elliptic curve Paillier scheme and Shamir secret sharing scheme, a new key management scheme that adapts to ad hoc networks was proposed. In this scheme, the new node provided elliptic curve Paillier scheme to the authentication nodes in the system, and kept the corresponding trapdoor secret. Making use of the homeostasis of elliptic curve Paillier scheme, the nodes that participate in the key distribution encrypted the corresponding shadows and added them one by one. At last, the sum was sent to the new node and was decrypted. In order to prevent the attacker who came from the system, the shuffling factors were added to the encryption. The new scheme has better security, and the difficulties to break it are not less than to break RSA.
Sub-optimal Multiuser Detector Using a Time-varying Gain Chaotic Simulated Annealing Neural Network
Authors: Yunxiao Jiang, Zifa Zhong, Jun-an Yang, Min Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper proposes a sub-optimal multiuser detector (MUD) algorithm for CDMA system based on the neural network with Time-varying Gain Chaotic Simulated Annealing Neural Network (TGCSANN), and gives a concrete model of the MUD after appropriate transformations and mappings. By refraining from the serious local optimal problem of Hopfield-type neural networks, the TGCSANN makes use of the time-varying and chaotic simulated annealing parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks, so that it can be expected to have much ability to search for globally optimal or sub-optimal solutions. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for MUD.
Variable Ordering in the Conditional Independence Bayesian Classifier Induction Process: An Evolutionary Approach
Authors: Estevam R. Jr. Hruschka, Edimilson B. dos Santos, Sebastian D. C. de O. Galvao
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This work proposes, implements and discusses a hybrid Bayes/Genetic collaboration (VOGACMarkovPC) designed to induce Conditional Independence Bayesian Classifiers from data. The main contribution is the use of MarkovPC algorithm in order to reduce the computational complexity of a Genetic Algorithm (GA) designed to explore the Variable Orderings (VOs) in order to optimize the induced classifiers. Experiments performed in a number of datasets revealed that VOGAC-MarkovPC required less than 25% of the time demanded by VOGAC-PC on average. In addition, when concerning the classification accuracy, VOGAC-MakovPC performed as well as VOGAC-PC did.
Intelligent Window Based on Embedded System
Authors: Jingwen Tian, Meijuan Gao, Jin Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

An intelligent window based on the embedded system is introduced in this paper, the control system of which can automatically close or open the window according to the alteration of humidity and wind speed. In addition, network communication and network control functions can also be realized in this intelligent system. We established a fuzzy inference modeling with two inputs of temperature and wind speed. The network communication function extremely facilitated our remote monitoring. The system adopted ARM chip S3C2410 as main controller, and chip OV6630 of the Omnivision company as image sensor, and use step-motor for driving the window. More over, we use the Hall sensor for indicating the different positions of the window. Generally we use the fuzzy inference control and network control to realize the auto and remote moving of the window.
Utilizing venation features for efficient leaf image retrieval
Authors: JinKyu Park, EenJun Hwang, Yunyoung Nam
Venue: Journal of Systems and Software (2008)

Most Content-Based Image Retrieval systems use image features such as textures, colors, and shapes. However, in the case of a leaf image, it is not appropriate to rely on color or texture features only as such features are very similar in most leaves. In this paper, we propose a new and effective leaf image retrieval scheme. In this scheme, we first analyze leaf venation which we use for leaf categorization. We then extract and utilize leaf shape features to find similar leaves from the already categorized group in a leaf database. The venation of a leaf corresponds to the blood vessels in organisms. Leaf venations are represented using points selected by a curvature scale scope corner detection method on the venation image. The selected points are then categorized by calculating the density of feature points using a non-parametric estimation density. We show this technique's effectiveness by performing several experiments on a prototype system.
QBE/OBE: A Language for Office and Business Automation
Authors: M. M. Zloof
Venue: Computer (1981)

OBE's two-dimensional programming brings new flexibility to nonprogramming computer users. They can quickly learn to compose, edit, format, and distribute letters, reports, and graphs.
Build Complicated Granules with Generalized Operations of Fuzzy Sets
Authors: Fusheng Yu, Wenyi Zeng, Qiuyan Sun, Fangmin Wu, Yongke Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Granular computing is a new paradigm in intelligent computing after L.A. Zadeh proposed the information granulation. In the procedure of processing granules, we often meet with fuzzy sets, also being granules, built on different universes, especially complicated composed universes. This paper gives the generalized definitions of the union and the intersection of two fuzzy sets defined on different universes which are in the forms of Cartesian product. The existing definitions of union and intersection of fuzzy sets separately given by L.A. Zadeh, P.Zh. Wang&H.X. Li, and K. Chakrabarty etc. may be treated as the particular cases of this new definition. Some properties of fuzzy sets are investigated under the new definition. The result allows us to deal with the operations of fuzzy sets over different universes, and thus is useful in the process of knowledge acquisition, knowledge representation, and granular computing.
Improving data quality: consistency and accuracy
Authors: Gao Cong, Wenfei Fan, Floris Geerts, Xibei Jia, Shuai Ma
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Two central criteria for data quality are consistency and accuracy. Inconsistencies and errors in a database often emerge as violations of integrity constraints. Given a dirty database D, one needs automated methods to make it consistent, i.e., find a repair D' that satisfies the constraints and "minimally" differs from D. Equally important is to ensure that the automatically-generated repair D' is accurate, or makes sense, i.e., D' differs from the "correct" data within a predefined bound. This paper studies effective methods for improving both data consistency and accuracy. We employ a class of conditional functional dependencies (CFDs) proposed in [6] to specify the consistency of the data, which are able to capture inconsistencies and errors beyond what their traditional counterparts can catch. To improve the consistency of the data, we propose two algorithms: one for automatically computing a repair D' that satisfies a given set of CFDs, and the other for incrementally finding a repair in response to updates to a clean database. We show that both problems are intractable. Although our algorithms are necessarily heuristic, we experimentally verify that the methods are effective and efficient. Moreover, we develop a statistical method that guarantees that the repairs found by the algorithms are accurate above a predefined rate without incurring excessive user interaction.
A Comparison between Decision Trees and Markov Models to Support Proactive Interfaces
Authors: Joan De Boeck, Kristof Verpoorten, Kris Luyten, Karin Coninx
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

During the past few years, personal portable computer systems such as PDAs or laptops are being used in different contexts such as in meetings, at the office, or at home. In the current era of multimodal interaction, each context may require other interaction strategies or system settings to allow the end-users to reach their envisioned goals. For instance, in a meeting room a user may want to use the projection equipment and disable the audio output for a presentation, while audio input and output may be important while in a teleconference. In present computer systems most changes have to be made manually and require explicit interaction with the system. The number of different devices used in such environments makes that this configuration step results in a high cognitive load and causes interrupts of the tasks being executed by the end-user. In this paper we present how proactive user interfaces may predict the next interface changes invoked by context switches or user actions. In particular, we will focus on two machine learning algorithms, decision trees and Markov models, that may support this proactive behaviour for multimodal user interfaces. Based on some simple but relevant scenarios, we compare the outcome of both implementations in order to decide which algorithm is most applicable in this context.
Proceedings of the 14th ACM conference on Computer and communications security
Venue: Conference on Computer and Communications Security (2007)

These proceedings contain the papers selected for presentation at the 14th ACM Conference on Computer and Communications Security (CCS 2007), held October 29 to November 2, 2007 in Alexandria, VA, USA. In response to the call for papers 302 papers were submitted to the conference. These papers were evaluated on the basis of their significance, novelty, and technical quality. Each paper was reviewed by at least three members of the program committee. Reviewing was double-blind, meaning that the program committee was not able to see the names and affiliations of the authors, and the authors were not told which committee members reviewed which papers. After the reviews were written, the program committee met online for three weeks of intensive discussion. Of the papers submitted, 55 were selected for presentation at the conference, giving an acceptance rate of about 18%.
Using Bounded Model Checking with BOGOR
Authors: Taehoon Lee, Mintaek Cho, Gihwon Kwon
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

BOGOR model checking framework is developed for Object-Oriented software verification. It represents system as BIR (Bandera Intermediate Language). To model checking BIR, the BOGOR represents state as a node and transition as edge. First, BOGOR generates node and edge. Second, Model checking is performed in graph structure. However, this approach is inefficient to verify large software system. In this paper, we present symbolic model checking techniques to verify efficient BIR model checking. Experimental results show that the proposed algorithm can check more efficiently.
Fuzzy Clustering Ensemble Based on Dual Boosting
Authors: Su-lan Zhai, Bin Luo, Yu-tang Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

It is widely recognized that clustering ensemble is fit for any shape and any distribution dataset and that the boosting method provides superior results for classification problems. In the paper , a dual boosting is proposed for fuzzy clustering ensemble . At each boosting iteration, a new training set is created based on the original datasets' probability which is associated with the previous clustering. According to the dual boosting method, the new training subset contains not only the instances which is hard to cluster in previous stages , but also the instances which is easy to cluster. The final clustering solution is produced by using the clustering based on the co-association matrix. Experiments on both artifical and realworld datasets demonstrate the efficiency of the fuzzy clustering ensemble based on dual boosting in stability and accuracy.
Controlling resist thickness and etch depth for fabrication of 3D structures in electron-beam grayscale lithography
Authors: J. Kim, D. C. Joy, S. -Y. Lee
Venue: Microelectronic Engineering (2007)

In many applications such as optoelectronic devices, three-dimensional (3D) structures are required. Examples include photonic band gap (PBG) crystals, diffractive optical elements, blazed gratings, MEMS, NEMS, etc. It is known that the performance characteristics of such structures are highly sensitive to their dimensional fidelity. Therefore, it is essential to have a fabrication process by which such 3D structures can be realized with high dimensional accuracy. In this paper, practical methods to control thickness of the remaining resist and etch depth, which may be employed for fabrication of such 3D structures using grayscale electron-beam lithography, are described. Through experiments, explicit control of the remaining resist thickness and etch depth at the resolution of 20nm for the feature sizes of 0.5@mm and 1@mm has been successfully demonstrated. Also, the 1:1 ratio of silicon to resist etching rates was achieved for transferring the remaining resist profile onto the silicon substrate.
Dynamic dictionary matching using inverted lists
Authors: Chouvalit Khancome, Veera Boonjing
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper proposes a new solution to the problem of dynamic dictionary matching. It employs inverted lists as data structures accommodating string patterns. The new solution takes (1) O(|P|) time for preprocessing, where |P| is a sum of the length of all patterns in set of pattern P; (2) O(|p|) time for insertion or deletion, where |p| is the length of pattern to be inserted or deleted; and (3) a search O(|t|+locc) time, where |t| is the length of input text and locc is the number of occurrences of matching between a character in the input text and in the inverted list.
The Application of Fuzzy Logic in Exploration Vehicle
Authors: Jianghui Xin, Shunming Li, Qingbin Liao, Rixin Zhan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A fuzzy control is applied in the unmanned driving exploration vehicle in this paper. The exploration vehicle is intended for the unknown environment exploration, and will be equipped with six ultrasonic sensors for detecting obstacles. Onboard speed and steering fuzzy controllers are the core of the guiding system. Measurements of obstacle distance and direction are anticipated to be imprecise however, because the performance of ultrasonic sensors is degraded in complex environments. So we present an unsupervised fuzzy logic algorithm that can determine a trajectory for an exploration vehicle through unknown environments, even in the presence of imprecise sensor data. This algorithm uses a combination of simple fusion of robot behaviors and self-tuning membership functions to determine vehicle navigation without resorting to the degree of complexity of previous fuzzy logic algorithms. The results obtained illustrate the robustness of a fuzzy logic approach regard to sensor imperfections.
An Improved LS-SVM Based on Quantum PSO Algorithm and Its Application
Authors: Guofeng Pan, Kewen Xia, Yao Dong, Jin Shi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In order to avoid the problem of inverse matrix calculation in LS-SVM algorithm, an improved LS-SVM based on quantum PSO algorithm is presented, the main process is to encode the particle swarm with quantum bit, then solve the linear equation set with the iterative quantum PSO algorithm. So the training velocity of LS-SVM algorithm is improved, the computer memory is saved, and the least square solution is always obtained. The actual application in Changqing oil-field indicates the application effect is better than that of classical SVM and LM neural network in oil layer recognition, the improved LS-SVM algorithm not only improves the accuracy of recognition, but also accelerates the velocity of convergence, and the result of oil layer recognition is fully accord with that of oil trial.