ppxscal/embedding_network huggingface dataset:
Flow shop vs. permutation shop with time delays
Authors: D. Rebaine
Venue: Computers and Industrial Engineering (2005)

This paper considers the evaluation of the worst-case performance ratio between the best solution of the flow shop problem and the permutation flow shop with time delays considerations. It is observed that, even in the restricted case of two machines and unit execution time operations, the two models may generate different optimal values for the makespan. More specifically, it is shown that, in the two-machine case, the performance ratio between the best permutation schedule and the best flow shop schedule is bounded by 2. When the operations of the n jobs are restricted to be unit execution time, this ratio is reduced to (2-(3/n+2)) for the two-machine case, and is m for the m-machine case.
A Reliable Watermarking Algorithm Based on Wavelet Transform for Satellite Images
Authors: M. Abolfathi, R. Amirfattahi
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

According to the need for having a confident and secure communication of satellite images with minimum tolerable delay, a novel method is presented here as a design and simulation of contemporary techniques. This paper turns around modern algorithms, building systems with higher grade-of-service using multi-resolution decomposition. We used Discrete Wavelet Transform (DWT) as a basic tool along by watermarking of satellite images. Choosing the best area to hide the watermark is distinguished from others in excellence as exposed in the last results. This is due to the fact that DWT supports features like progressive image transmission. 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
Blind and semi-blind equalization of downlink MC-CDMA system exploiting guard interval redundancy and excess codes
Authors: A. B. Djebbar, K. Abed-Meraim, A. Djebbari
Venue: IEEE Transactions on Communications (2009)

This paper introduces new blind time domain equalization (TEQ) techniques for downlink multicarrier code division multiple access (MC-CDMA) systems. This equalization exploits the guard interval (GI) redundancy together with the excess codes (EC) to restore the structural properties of MC-CDMA signal destroyed by multipath fading channels. Indeed, since in CDMA based wireless systems, the number of users per cell is significantly less than the spreading factor, a base station can set apart a subset of the codes, the excess codes that will not be used for spreading. It is shown that the joint use of the EC and GI redundancy improves significantly the equalization performance compared to the GI only or EC only cases. A second contribution consists in exploiting the previous information together with the one given by a pilot sequence in a semi blind scheme to further improve the performance. Finally, we propose a new adaptive algorithm for the estimation and tracking of the equalizer that has a faster convergence rate compared to existing algorithms of similar complexity order. Simulation based performance evaluations are given at the end of this paper to assess the effectiveness of the proposed methods in MC-CDMA.
Discovering Host Anomalies in Multi-source Information
Authors: Cuixia Gao, Zhitang Li
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Anomaly detection means developing a reference profile of normal activity and comparing the ongoing activity against it. Anomaly detection is very promising because of its potential to detect unseen types of attacks. In this paper we present our preliminary research on host anomaly detection by fusing multi-source security information. We selected five types of information which may be good indicators of host anomalies. They are RAM usage, host network connections, usage of bandwidth, the alert of antivirus and the alert of our own project SATA. In the information fusion framework, the D-S evidence theory was used to fuse the dynamic host-related information. Some improvements are also discussed. We also use real-world environment to demonstrate the method's capability for detecting host anomaly. We show that our prototype can successfully detect most of anomalies caused by DOS, scanning and other attacks.
On the impact of mobility and soft vertical handoff on voice admission control in loosely coupled 3G/WLAN networks
Authors: Racha Ben Ali, Samuel Pierre
Venue: IEEE Communications Letters (2009)

Loose coupling between 3G and WLAN ensures flexibility and openness. However, providing an ubiquitous mobile voice service in a loosely coupled 3G/WLAN network requires both packet-level and call-level quality of service (QoS) guarantees using soft vertical handoff (SVHO) and call admission control (CAC). In this paper, we evaluate the impact of both SVHO and WLAN mobility on call blocking and dropping probabilities rederived for the integrated network. For this purpose, we propose a new multi-region mobility model that accurately estimate these probabilities under a resource-efficient dynamic-threshold SVHO compared to a standard static-threshold SVHO. Results show us that the resource-efficient SVHO blocks and drops much less voice calls than the static one when very low mean and high variability of multi-mode mobile station velocities are noticed. Therefore, resource-efficient SVHO implementations are highly recommended in these mobility environments.
A class of generalized LDPC codes with fast parallel decoding algorithms
Authors: Xiuni Wang, Xiao Ma
Venue: IEEE Communications Letters (2009)

Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decoding algorithm of subcodes. In this paper, we propose a class of GLDPC codes with fast parallel decoding algorithm. The parity-check matrices of the newly constructed subcodes are composed of several square matrices, which can be viewed as elements of a finite field. Therefore the FFT-based a posteriori probability (APP) algorithm for nonbinary codes can be applied to decode the subcodes. When compared with the trellis-based APP algorithm, the FFT-based APP algorithm can be implemented in parallel and has lower complexity. Simulation results show that the proposed GLDPC codes perform well on AWGN channels.
Coupled model of surface water flow, sediment transport and morphological evolution
Authors: Guy Simpson, Sébastien Castelltort
Venue: Computers Geosciences (2006)

This paper presents a mathematical model coupling water flow and sediment transport dynamics that enables calculating the changing surface morphology through time and space. The model is based on the shallow water equations for flow, conservation of sediment concentration, and empirical functions for bed friction, substrate erosion and deposition. The sediment transport model is a non-capacity formulation whereby erosion and deposition are treated independently and influence the sediment flux by exchanging mass across the bottom boundary of the flow. The resulting hyperbolic system is solved using a finite volume, Godunov-type method with a first-order approximate Riemann solver. The model can be applied both to short time scales, where the flow, sediment transport and morphological evolution are strongly coupled and the rate of bed evolution is comparable to the rate of flow evolution, or to relatively long time scales, where the time scale of bed evolution associated with erosion and/or deposition is slow relative to the response of the flow to the changing surface and, therefore, the classical quasi-steady approximation can be invoked. The model is verified by comparing computed results with documented solutions. The developed model can be used to investigate a variety of problems involving coupled flow and sediment transport including channel initiation and drainage basin evolution associated with overland flow and morphological changes induced by extreme events such as tsunami.
Pervasive access to MRI bias artifact suppression service on a grid
Authors: Edoardo Ardizzone, Orazio Gambino, Alessandro Genco, Roberto Pirrone, Salvatore Sorce
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

Bias artifact corrupts MRIs in such a way that the image is afflicted by illumination variations. Some of the authors proposed the exponential entropy-driven homomorphic unsharp masking (E2D-HUM) algorithm that corrects this artifact without any a priori hypothesis about the tissues or the MRI modality. Moreover, E2D-HUM does not care about the body part under examination and does not require any particular training task. People who want to use this algorithm, which isMatlab-based, have to set their own computers in order to execute it. Furthermore, they have to be Matlab-skilled to exploit all the features of the algorithm. In this paper, we propose to make such algorithm available as a service on a grid infrastructure, so that people can use it almost from everywhere, in a pervasive fashion, by means of a suitable user interface running on smartphones. The proposed solution allows physicians to use the E2D-HUM algorithm (or any other kind of algorithm, given that it is available as a service on the grid), being it remotely executed somewhere in the grid, and the results are sent back to the user's device. This way, physicians do not need to be aware of how to use Matlab to process their images. The pervasive service provision formedical image enhancement is presented, along with some experimental results obtained using smartphones connected to an existing Globus-based grid infrastructure.
Speaker Recognition via Statistics of Acoustic Feature Distribution
Authors: Shaomei Li, Yunfei Guo, Hongquan Wei
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In recent years, with the widely application of speaker recognition, besides recognition precision, people pay more attention to processing speed. The traditional recognition frame which directly uses acoustic feature sequence to match the model of target speaker doesn't work well in real time environment. So new recognition frame based on the statistic of acoustic feature sequence has arisen. By using acoustic feature distribution around common codebook to model speaker's charactistic, a new speaker recognition algorithm is proposed in this paper. The common codebook is generated via the training data from all reference speakers, which is used to classify speech feature space, and the model of each reference speaker is described by the statistics of speaker's acoustic feature distribution around the common codebook. In the recognition, pairwise sequence alignment is adopted to measure the distortion between the acoustic feature distribution of test speech and each reference speaker model, and recognition result is derived by distortion comparison. Experimental results showed that the method proposed in this paper can save calculation and space resource while having better performance over current algorithm which also is based on the statistic of speaker's acoustic feature distribution. 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
FindCite: automatically finding prior art patents
Authors: Shahzad Tiwana, Ellis Horowitz
Venue: Proceeding of the 2nd international workshop on Patent information retrieval (2009)

In this paper, we introduce FindCite, an algorithm to automatically find prior art patents. The citation based parametric algorithm can be tuned for broadening or narrowing the search for finding prior art patents. This can also be used to automatically generate test collection for patent documents.
Modeling of secure data extraction in ETL processes using UML 2.0
Authors: M. Mrunalini, D. Evangelin Geetha, T. V. Suresh Kumar, K. Rajani Kanth
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

One of the major causes for developing distributed systems is wide variety of target domain and project characteristics. Especially to implement security policies required for such software systems become more complicated. Modeling of these types of scenarios with security constraints is crucial in producing quality software. The scenario is more complicated in case of ETL processes. In this paper, we propose an object-oriented approach using UML 2.0 for secure data extraction in ETL processes. We exploit the features of UML 2.0 for modeling the complex features to implement security policies. We discuss the validity of the model using a case study on Banking application.
Study and Design of Intelligent Authentication System Based on Fingerprint Identification
Authors: Fengling Wang, Yuanyi Zhang
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 03 (2009)

The traditional authentication system used certificates, magnetic cards, or passwords to identify a person. It can easily cause forgery, missing or stealing. For this reason, this paper analyzed the merits of fingerprint which is unique, invariability, and uneasy forge. Then designed an intelligent authentication system used embedded technology and a new fingerprint sensor FPC1011C. The system has many advantages, such as small volume, lower power consumption, lower cost, safety and reliability, easy to install and to maintain, good practicality and so on. The validity and efficiency of the system was validated via test-experiment. The results show that this system has the superiority that traditional authentication system unable to realize. It can open a wide development and application space for fingerprint identification technology. Thus provide an ideal solution for personal identification and information security problems, which the current society has faced.
Peak power reduction of OFDM signals with sign adjustment
Authors: Masoud Sharif, Vahid Tarokh, Babak Hassibi
Venue: IEEE Transactions on Communications (2009)

It has recently been shown that significant reduction in the peak to mean envelope power (PMEPR) can be obtained by altering the sign of each subcarrier in a multicarrier system with n subcarriers. However, finding the best sign not only requires a search over 2n possible signs but also may lead to a substantial rate loss for small size constellations. In this paper, we first propose a greedy algorithm to choose the signs based on p-norm minimization and prove that the resulting PMEPR is guaranteed to be less than c log n where c is a constant independent of n for any n. This approach has lower complexity in each iteration compared to the derandomization approach of [1] while achieving similar PMEPR reduction. We further improve the performance of the proposed algorithm by enlarging the search space using pruning. Simulation results show that PMEPR of a multicarrier signal with 128 subcarriers can be reduced to within 1.6 dB of the PMEPR of a single carrier system. In the second part of the paper, we address the rate loss by proposing a block coding scheme in which only one sign vector is chosen for K different modulating vectors. The sign vector can be computed using the greedy algorithm in n iterations. We show that the multi-symbol encoding approach can reduce the rate loss by a factor of K while achieving the PMEPR of c log Kn, i.e., only logarithmic growth in K. Simulation results show that the rate loss can be made smaller than %10 at the cost of only 1db increase in the resulting PMEPR for a system with 128 subcarriers.
Indexes for three-class classification performance assessment: an empirical comparison
Authors: Mehul P. Sampat, Amit C. Patel, Yuhling Wang, Shalini Gupta, Chih-Wen Kan, Alan C. Bovik, Mia K. Markey
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

Assessment of classifier performance is critical for fair comparison of methods, including considering alternative models or parameters during system design. The assessment must not only provide meaningful data on the classifier efficacy, but it must do so in a concise and clear manner. For two-class classification problems, receiver operating characteristic analysis provides a clear and concise assessment methodology for reporting performance and comparing competing systems. However, many other important biomedical questions cannot be posed as "two-class" classification tasks and more than two classes are often necessary. While severalmethods have been proposed for assessing the performance of classifiers for such multiclass problems, none has been widely accepted. The purpose of this paper is to critically review methods that have been proposed for assessing multiclass classifiers. A number of these methods provide a classifier performance index called the volume under surface (VUS). Empirical comparisons are carried out using 4 three-class case studies, in which three popular classification techniques are evaluated with these methods. Since the same classifier was assessed using multiple performance indexes, it is possible to gain insight into the relative strengths and weakness of the measures. We conclude that: 1) the method proposed by Scurfield provides the most detailed description of classifier performance and insight about the sources of error in a given classification task and 2) the methods proposed by He and Nakas also have great practical utility as they provide both the VUS and an estimate of the variance of the VUS. These estimates can be used to statistically compare two classification algorithms.
Computer-based art learning: Primary children's responses
Authors: Jane Chia, Birnie Duthie
Venue: Computers Education (1994)

This article documents and analyses the work of two computer-based art projects, the Saturday Morning Art (SMART) programme and the School Computers Art Media Project (SCAMP) where primary children were involved in art production using a computer. The children's actions and their art works were closely monitored by participant observers to see how they learned to manipulate the technology, to work collaboratively and developed the ability to exercise judgement and control over the medium. Examples of the children's work are included and discussed in the paper so that the quality and degree of control exhibited by these young children may be fully appreciated by those reading the text.
A Multi Channel Cognitive MAC Protocol with Efficient Channel Reservation and Collision Avoidance Method
Authors: Sarah Mustafa Eljack, M. Azhar Igbal, Wang Furong
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Cognitive radio networks have emerged as a new trend in wireless technology due to their perfect solution to the spectrum scarcity. The critical aspect of the spectrum allocation in distributed cognitive radio networks is how efficiently the spectrum is managed and how the secondary user's (SU) link is maintained once the primary user (PU) arrives or when the channel degrades due to interference. The MAC protocol should allow access to unused spectrum holes without affecting the incumbent privileges, so the incumbent detection is required before and after starting using the band to avoid collision. To address this problem, in this paper a distributed cognitive MAC protocol is proposed to achieve compensation to the suspended secondary link and avoid collision with the primary which obviously increases the network performance. The 802.11 based backup channel reservation protocol (BCRP) is proposed to reconstruct the second communication if forced termination occurred. The protocol operates over a separate common control channel and multiple data channels; thus reservation information easily exchanged through the control channel which effectively enhanced quicker and smoother channel switching to the free sensed or reserved channel. A higher number of sensed channels lead to better chances to implement reservation procedure. The protocol effectively improves the network throughput due to a higher successful transmission as demonstrated by analysis and simulation.
Simulation and Analysis of MAC Security Based on NS2
Authors: Hong Jiang, Qing-song Yu, Hui Lu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Based on IEEE 802.1AF, secure key agreement and management schemes are discussed, including secure key generation and distribution, identification of Live Peer Lists and Potential Live Peer Lists. Key Selection Protocol (KSP) and LAN-based Key Server (LKS) protocol are compared in this paper. To improve the security of Ethernet, a group based MAC key selection protocol (GKSP) for large Ethernet networks is provided, simulated and validated The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A comprehensive approach to data warehouse testing
Authors: Matteo Golfarelli, Stefano Rizzi
Venue: Proceeding of the ACM twelfth international workshop on Data warehousing and OLAP (2009)

Testing is an essential part of the design life-cycle of any software product. Nevertheless, while most phases of data warehouse design have received considerable attention in the literature, not much has been said about data warehouse testing. In this paper we introduce a number of data mart-specific testing activities, we classify them in terms of what is tested and how it is tested, and we discuss how they can be framed within a reference design methodology.
On the role of classification in patent invalidity searches
Authors: Christopher G. Harris, Steven Foster, Robert Arens, Padmini Srinivasan
Venue: Proceeding of the 2nd international workshop on Patent information retrieval (2009)

Searches on patents to determine prior art violations are often cumbersome and require extensive manpower to accomplish successfully. When time is constrained, an automatically generated list of candidate patents may decrease search costs and improve search efficiency. We examine whether semantic relations inferred from the pseudo-hierarchy of patent classifications can contribute to the recognition of related patents. We examine a similarity measure for hierarchically-ordered patent classes and subclasses and return a ranked list of candidate patents, using a similarity measure that has demonstrated its effectiveness when applied to WordNet ontologies. We then demonstrate that this ranked list of candidate patents allows us to better constrain the effort needed to examine for prior art violations on a target patent.
An Active DDoS Defense Model Based on Packet Marking
Authors: Yongping Zhang, Zhuqing Wan, Mingming Wu
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

In the light of that the defense against DDoS attacks is difficult, an active DDoS defense model based on packet marking is proposed in this paper. The model is composed of the subsystem of the tracking of the attacks and the subsystem of filtering of the attack flows. The function of the former is to reconstruct the attack paths using the information from the marked packets while the function of the later is to filter the attacking packets according to the information obtained from the former. The model has a higher efficiency in reconstructing attack path by using a novel authenticated packet marking scheme for IP trace-back. So, it can correspond to the attack flow in a short time. In addition, flow detection and neural network is also used in the model so that the model is more powerful in the functions of identification and filtering of attack packets and protection of the legitimate flows.