ppxscal/embedding_network huggingface dataset:
Robust Perceptual Image Hash Using Gabor Filters
Authors: Lina Wang, Xiaqiu Jiang, Donghui Hu, Dengpan Ye, Shiguo Lian
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

In order to design the image hash from human being's view, we capture the perceptual characters of the image using Gabor filter which can sense the directions in the image just like human's primary visual cortex. For a given image, we compute the reference scale, direction and block to make sure the final hash can resist against RST (Rotation, Scale, Translation) attacks while maintain the sensitivity to local malicious manipulations. In addition, it has another promising ability to locate the tampered image blocks, approximately determined tamper methods (delete, add, modify) and the original direction of each block. The ability is very useful in forensics. The experimental results show that the strategy of the reference metrics works quite well and it is much more effective than the other state of art image hash method.
Leveraging a scalable row store to build a distributed text index
Authors: Ning Li, Jun Rao, Eugene Shekita, Sandeep Tata
Venue: Proceeding of the first international workshop on Cloud data management (2009)

Many content-oriented applications require a scalable text index. Building such an index is challenging. In addition to the logic of inserting and searching documents, developers have to worry about issues in a typical distributed environment, such as fault tolerance, incrementally growing the index cluster, and load balancing. We developed a distributed text index called HIndex, by judiciously exploiting the control layer of HBase, which is an open source implementation of Google's Bigtable. Such leverage enables us to inherit the support on availability, elasticity and load balancing in HBase. We present the design, implementation, and a performance evaluation of HIndex in this paper.
A Comparison Study of Two Fuzzy-Based Handover Systems for Avoiding Ping-Pong Effect in Wireless Cellular Networks
Authors: Gjergji Mino, Leonard Barolli, Arjan Durresi, Fatos Xhafa, Akio Koyama
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

Wireless mobile networks and devices are becoming increasingly popular to provide users the access anytime and anywhere. The mobile systems are based on cellular approach and the area is covered by cells that overlap each other. Many handover algorithms are proposed in the literature. However, to make a better handover and keep the QoS in wireless networks is very difficult task. For this reason, new intelligent algorithms should be implemented to deal with this problem. In this paper, we carried out a comparison study of two handover systems based on fuzzy logic. We implement two Fuzzy-Based Handover Systems (FBHS). We call them FBHS1 and FBHS2. The performance evaluation via simulations shows that FBHS2 has better behavior than FBHS2 and can avoid ping-pong effect in all simulation cases.
Proceeding of the eleventh international workshop on Web information and data management
Venue: Conference on Information and Knowledge Management (2009)

The ACM CIKM 2009 Workshop on Web Information and Data Management (WIDM 2009) is the eleventh in a series of workshops on Web Information and Data Management held in conjunction with the International Conference on Information and Knowledge Management (CIKM). The objective of the workshop is to bring together researchers, industrial practitioners and developers to study how Web information can be extracted, stored, analyzed, and processed to provide useful information to the end users for various advanced database applications. We hope that these proceedings will serve as a valuable reference for all experts in the field. In response to the call for papers, we received 41 papers from 18 countries: Australia, Brazil, Canada, China, the Czech Republic, Finland, Greece, India, Indonesia, Iran, Italy, Japan, Korea, Malaysia, the Netherlands, Norway, the United States, and Vietnam. Starting from 2005, the workshop has a one-day schedule. This year, we adopted a double-blind review process and all papers were reviewed thoroughly by the program committee and external reviewers. The program committee accepted seven full papers and nine short papers, resulting in a competitive 39% acceptance rate. The 16 accepted papers have been divided into four sessions: "Querying, Question Answering and Searching", "Web Algorithms", "Web Information Mining and Extraction Techniques", and "Searching, Matching and Browsing". In addition, Professor Dik Lun Lee from the Hong Kong University of Science and Technology will present a keynote talk this year.
Networks, communities and kronecker products
Authors: Jure Leskovec
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understanding of the structure of such large social and information networks. Here I present our work on clustering and community structure in large networks, where clusters are thought of as sets of nodes that are better connected internally than to the rest of the network. We find that large networks have very different clustering structure from well studied small social networks and graphs that are well-embeddable in a low-dimensional structure. In networks of millions of nodes tight clusters exist at only very small size scales up to around 100 nodes, while at large size scales networks becomes expander like. A network model based on Kronecker products efficiently models such core-periphery network structures. The results suggest broader implications for data analysis and machine learning in sparse and noisy high-dimensional social and information networks, where intuitive notions about cluster quality fail.
Ultraviolet Image Processing Method in Corona Detection
Authors: Yin Limin, Zhangyu
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

Ultraviolet image detection technology is the first choice of the corona detection in power system, which could fulfill an all-weather reliable detection on corona. However, the solar-blind ultraviolet signal issued by corona discharge is relatively weak, and the quality of ultraviolet image is seriously affected by the noise from the detection system. The noise characteristics of the ultraviolet image that is detected by the corona has been analyzed in this paper, one kind of image denoising methods based on mathematics morphology and independence component analysis is put forward, and is applied to the corona and solar-blind ultraviolet image processing method. The method which improves the SNR of images, enhances the goal and weakens the noise is proved by experiments.
Combined Spatial Correlation of Coded Neighboring Blocks for Intra-frame Coding Mode Prediction
Authors: Yu Han, Aidong Men, Ziyi Quan
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

A novel algorithm for coding the intra 4x4 prediction mode selection information with combined spatial correlation of coded neighboring blocks is proposed in this work. A large number of bits are used to transmit the prediction modes of each intra coded block in the H.264/AVC standard, and these bits cost becomes more sensitive in the case of low bit rate application. The proposed algorithm utilizing an L-shaped template to predict and code the mode selection information has significant improvement of compression efficiency. It is proposed to be applied to the next generation video compression algorithm. For some test sequence, the proposed algorithm can achieve 12.62% bit rate reduction compared to the state-of-the-art H.264/AVC standard at the expense of 0.219dB PSNR degradation.
The Images Encryption Algorithm Based on the Multi-chaotic Systems
Authors: Tao Wang, Han Zhang, Zhaohui Li, Qing-hua Zhang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

A new image encryption algorithm is proposed by combining the cat mapping and the standard mapping of conservative chaotic systems. The proposed algorithm first produces chaotic sequence by using the standard mapping; then the sequence is discretized. Two values, which are used as the parameters of the cat mapping to realize the scrambling encryption for images, are extracted. In the end, the alternative encryption for pixel values can be achieved by using two sets of discretized chaotic sequence generated from the first step. This algorithm overcomes the periodicity of using cat mapping directly to encrypt. According to analysis, the algorithm can resist statistical attack and differential attack.
Cyclostationarity-based Doppler spread estimation in mobile fading channels
Authors: Hong Zhang, Ali Abdi
Venue: IEEE Transactions on Communications (2009)

The Doppler spread, or equivalently, the mobile speed, is a measure of the spectral dispersion of mobile fading channel. Accurate estimation of the mobile speed is of importance in wireless mobile applications which require the knowledge of the rate of channel variations. This paper exploits the inherent cyclostationarity of linearly modulated signals, transmitted through fading channels, to design robust blind and data-aided mobile speed estimators. Two categories of cyclic-correlation-and cyclic-spectrum-based methods are developed. Extension to space-time speed estimation at the base station in macrocells is also provided. In comparison with the existing methods, the new estimators can be used without any need for pilot tones, and are robust to additive stationary noise or interference of any color or distribution. Unlike the conventional multi-antenna based method, the proposed space-time speed estimator does not assume the receiver noise to be spatially white. We also devised a suboptimal training sequence for pilot-symbol assisted methods, to reduce the estimation error. The performances of the proposed estimators are illustrated via extensive Monte Carlo simulations.
Building a terabyte NEXRAD radar database for hydrometeorology research
Authors: A. Kruger, Ramon Lawrence, E. C. Dragut
Venue: Computers Geosciences (2006)

The management and processing of terabyte-scale radar data sets is time-consuming, costly, and an impediment to research. Researchers require rapid and transparent access to the data without being encumbered with the technical challenges of data management. In this paper, we describe a database architecture that manages over 12TB (and growing) of Archive Level II data that is produced by the United States National Weather Service's network of WSR-88D weather radars. The contribution of this work is an automatic system for archiving and analyzing radar data that isolates geoscientists from the complexities of data storage and retrieval. Data access transparency is achieved by using a relational database to store metadata on the raw data, which enables simple SQL queries to retrieve data subsets of interest. The second component is a distributed web platform that cost-effectively distributes data across web servers for access using the ubiquitous HTTP protocol. This work demonstrates how massive data sets can be effectively queried and managed.
Studying students' difficulties in understanding wave phenomena using computer simulations
Authors: Dimos Zarras, Christina Solomonidou
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This study investigated high school students' alternative ideas related to wave phenomena, as well as a teaching approach especially designed to cope with students' learning difficulties in this physics area. Initially, 77 Greek students, 15--16 year olds, answered a written openended questionnaire. Data analysis showed that many students expressed pre-scientific ideas and seemed to have difficulties in understanding wave phenomena. We planned a specific 3-hour teaching approach with constructivist and collaborative learning activities using web-based simulations, to help students construct appropriate knowledge. After teaching, the students responded to an analogous written post-test questionnaire. Data analysis showed that this teaching sequence and the use of appropriate ICT tools had positive effects on students' learning, including motivation for independent study.
Spread-spectrum watermarking security
Authors: Luis Pérez-Freire, Fernando Pérez-González
Venue: IEEE Transactions on Information Forensics and Security (2009)

This paper presents both theoretical and practical analyses of the security offered by watermarking and data hiding methods based on spread spectrum. In this context, security is understood as the difficulty of estimating the secret parameters of the embedding function based on the observation of watermarked signals. On the theoretical side, the security is quantified from an information-theoretic point of view by means of the equivocation about the secret parameters. The main results reveal fundamental limits and bounds on security and provide insight into other properties, such as the impact of the embedding parameters, and the tradeoff between robustness and security. On the practical side, workable estimators of the secret parameters are proposed and theoretically analyzed for a variety of scenarios, providing a comparison with previous approaches, and showing that the security of many schemes used in practice can be fairly low.
Evaluation of tree-based routing ethernet
Authors: G. Ibáñez, A. García-Martínez, J. A. Carral, J. M. Arco, A. Azcorra
Venue: IEEE Communications Letters (2009)

Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)--a forwarding scheme based on a spanning tree that was extended to use some shortcut links.We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing protocols to Ethernet. Finally, TRE is self-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.
Alias-component matrices of multirate systems
Authors: Aryan Saadat Mehr
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

We consider a multirate system, which is a generalization of linear time-invariant systems. Such a system is invariant to a certain shift in the input sequence. In particular, assume that p and q are coprime. A multirate system with the property that a delay of mq samples in its input sequence results in a delay of mp samples in its output sequence is called an (mp, mq)-periodic system. This multirate system can be obtained by cascading an upsampler, followed by a linear periodically time-varying (LPTV) kernel system, then followed by a downsampler. Here, we study the alias-component matrices of multirate systems. We show that they can be obtained from the alias-component matrices of their LPTV kernels by some row and column additions. An example shows the use of the method to design rate changers for a specified frequency band swap.
Retrieving good, better, and best answers to questions in advertisements
Authors: Maria S. Pera, Rani Qumsiyeh, Meher T. Shaikh, Yiu-Kai Ng
Venue: Proceeding of the eleventh international workshop on Web information and data management (2009)

Question-Answering (QA) service is a growing area of research study, and commercial QA systems have recently been developed. We are motivated to provide complementary QA service that answers questions in advertisements (ads). These days with almost all businesses online, potential buyers who search for merchandises to purchase through the Internet are also flourishing. When a Web user looks for products online, he may have many questions on his mind for which he would be eager to receive answers prior to finalizing his purchasing decision. Although some ads Web sites are complemented with FAQs, their QA services either are non-existent or do not provide answers to inquires in real time automatically. We address these problems by answering user's questions such as "Which is the cheapest car?", "Are there any entry-level, software developer positions?", etc., spontaneously in real time. Existing general-purpose QA systems, such as Ask.com, provide answers to a user's question Q in a list format. A more sophisticated approach is to order the answers to Q according to their degrees of relevance to Q. We propose a QA system which deals with the challenge of interpreting users' questions and retrieves correct, as well as partially-matched ranked, answers. Experimental results have verified that the proposed QA system is highly accurate in answering users' questions on car ads.
Calculation of Large and Medium-Size Bridge Design Discharge under Unascertained Information
Authors: Xiuling Sun, Xiaoru Xu, Shuhui Gao
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 01 (2009)

Hydrological system is an unascertained system. When calculate the large and medium-size bridge design discharge with hydrological data, with different method and series different results may be gained. As the design discharge has the unascertained character, applying unascertained mathematics theory to calculate can get the bridge design discharge with more confidence and more conforming to the actual situation. It also provides theoretical basis for experts to optimally select results.
An algorithm for production planning in a flexible production system
Authors: M. A. Al-Fawzan
Venue: Computers and Industrial Engineering (2005)

In this paper, we consider the problem of determining the production rate, production batch size, and production sequence when production rate, setup cost, and unit processing cost are sequence-dependent. Using a standard lot sizing model with backorder, a tabu search algorithm for solving this problem is proposed. The algorithm is tested on some random test problems and its performance is compared with random sequencing. Computational results show that the proposed algorithm is very efficient.
SHC: A Spectral Algorithm for Hierarchical Clustering
Authors: Xiaohong Li, Jingwei Huang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Hierarchical clustering (HC) is a widely used approach both in pattern recognition and data mining and has rich solutions in the literature. But all these existing solutions have some restrictions when the clustered dataset has complex structure. Spectral clustering is a graph-based, simple and outperforming method with the ability to find complex structure in dataset using spectral properties of the dataset-associated affinity matrix. In this paper, we propose a novel effective HC algorithm called SHC base on the techniques of spectral method. The experiment results both on artificial and real data sets show that our algorithm can hierarchically cluster complex data effectively and naturally.
Implementation of biofilm permeability models for mineral reactions in saturated porous media
Authors: Vicky L. Freedman, K. Prasad Saripalli, Diana H. Bacon, Philip D. Meyer
Venue: Computers Geosciences (2005)

An approach based on continuous biofilm models is proposed for modeling permeability changes due to mineral precipitation and dissolution in saturated porous media. In contrast to the biofilm approach, implementation of the film depositional models within a reactive transport code requires a time-dependent calculation of the mineral films in the pore space. Two different methods for this calculation are investigated. The first method assumes a direct relationship between changes in mineral radii (i.e., surface area) and changes in the pore space. In the second method, an effective change in pore radii is calculated based on the relationship between permeability and grain size. Porous media permeability is determined by coupling the film permeability models (Mualem and Childs and Collis-George) to a volumetric model that incorporates both mineral density and reactive surface area. Results from single mineral dissolution and single mineral precipitation simulations provide reasonable estimates of permeability, though they predict smaller permeability changes relative to the Kozeny and Carmen model. However, a comparison of experimental and simulated data show that the Mualem film model is the only one that can replicate the oscillations in permeability that occur as a result of simultaneous dissolution and precipitation reactions occurring within the porous media.
Image-Based Rendering Using Unstructured Image Set
Authors: Siren Bato, Yoshinori Dobashi, Tsuyoshi Yamamoto
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

This paper proposes a new, simple and effective image based rendering (IBR) technique for rendering new viewpoint images from large unstructured image set. Unlike most of the existing image based rendering systems, the proposed system is compatible with the standard model based rendering systems and able to synthesize the target scene with other artificial CG objects or scenes.
Delay estimation and sizing of CMOS logic using logical effort with slope correction
Authors: Cheng C. Wang, Dejan Markovic
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief presents an improved logical-effort model to account for the slope mismatch between the input and output of a gate. The model has a simple formulation in which only one additional parameter is needed, making the analysis suitable for hand calculations. Using 65- and 90-nm complementary metal-oxide-semiconductor technologies, the model maintains less than 5% error in gate-delay estimations compared to Spectre simulations even under large variations between the input and output slopes. Using this model, a circuit optimization tool is written to optimize an adder synthesized with a 65-nm standard-cell library. The estimation error for the adder is also within the modeling accuracy of 5%, whereas the original logical-effort model and the synthesis timing libraries have errors of up to 40% and 20%, respectively.
Coordination Traffic Control under the Framework of Multi-agent Technology
Authors: Jian-yu Zhao, Dian-kui Tang
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

This paper studies the control mechanism of a traffic network with multi-junction. In order to solve regional transportation problem with complex, strong stochastic Features, more considerations focus on the mutual influence between junctions. Coordination control method based on multi-agent technology is proposed to process the coordination of district traffic when traffic jams occur, and a new specific control structure is designed in detail. On this basis, optimization based on genetic algorithm is used to readjust the signal control parameters including the cycle length, green split. Compared with the traditional timing control, through the preparation of program simulation with average delay as the indicators, the situation of network congestion is improved.