ppxscal/embedding_network huggingface dataset:
The DMCA down under: antitrust implications
Authors: Stephen Corones, Dale Clapperton
Venue: Proceedings of the Fifth IASTED International Conference on Law and Technology (2007)

The Australia-United States Free Trade Agreement (AUSFTA) required Australia to adopt an anti-circumvention regime mirroring that of the US Digital Millennium Copyright Act (DMCA). The AUSFTA-mandated changes have created an unclear and uncertain environment for technology vendors. In combination with pre-existing differences in the scope of copyright between Australia and the US, they create an anti-circumvention regime which may give copyright and DRM system owners the ability to restrict competition in technology markets.
Intrinsic sensor noise features for forensic analysis on scanners and scanned images
Authors: Hongmei Gou, Ashwin Swaminathan, Min Wu
Venue: IEEE Transactions on Information Forensics and Security (2009)

A large portion of digital images available today are acquired using digital cameras or scanners. While cameras provide digital reproduction of natural scenes, scanners are often used to capture hard-copy art in a more controlled environment. In this paper, new techniques for nonintrusive scanner forensics that utilize intrinsic sensor noise features are proposed to verify the source and integrity of digital scanned images. Scanning noise is analyzed from several aspects using only scanned image samples, including through image denoising, wavelet analysis, and neighborhood prediction, and then obtain statistical features from each characterization. Based on the proposed statistical features of scanning noise, a robust scanner identifier is constructed to determine the model/brand of the scanner used to capture a scanned image. Utilizing these noise features, we extend the scope of acquisition forensics to differentiating scanned images from camera-taken photographs and computer-generated graphics. The proposed noise features also enable tampering forensics to detect postprocessing operations on scanned images. Experimental results are presented to demonstrate the effectiveness of employing the proposed noise features for performing various forensic analysis on scanners and scanned images.
A Color Images Steganography Method by Multiple Embedding Strategy Based on Sobel Operator
Authors: Li Li, Bin Luo, Qiang Li, Xiaojun Fang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In this paper, we propose a color images steganography. Firstly, because modification of pixel of image edges is less sensitive to human eye, the edge or texture in one plane is detected by Sobel edge detection operator and the largest certain number of gradients are selected as embedding positions. Secondly, because of strong relevance in gradient among R, G, and B planes, the corresponding LSB (Least Significant Bit) of pixel values to hide the secret data in other planes is modified. Finally, combine the stego-planes and restore the color image. Furthermore, multi-times embedding can be adapted to obtain high data capacity. Experimental results show that stego-images keep good quality and high capacity. For example, there is no noticeable degradation after three times hiding process, the average PSNR is about 45db and data capacity is 6.3bpp. The method also can extract the secret data accurately.
Analyzing Feasibility of Requirement Driven Service Composition
Authors: Liqiong Chen, Guisheng Fan, Yunxiang Liu, Dongmei Liu
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

In a service-oriented architecture, how to analyze the feasibility of service composition according to the requirements of service consumers has become a problem that must be solved in service composition. A method for analyzing feasibility of requirement driven service composition is proposed. Based on the support function at different stages in the lifecycle of service composition, the composition process is divided into a number of independent function modules, colored Petri nets are used to model for them, meanwhile the QoS properties of services such as price and success probability are considered, the task failure and processing strategies are characterized. Based on this, combining with the requirements of service consumer, the definition of feasibility and a service schedulability strategy are advanced. ASK-CTL is introduced to describe and verify basic properties of model, and the corresponding analysis algorithm is also given. What's more, at the end of this paper, an example was given to simulate analysis process by using CPN Tools.
Rate performance of AF two-way relaying in low SNR region
Authors: Jingjing Ping, See Ho Ting
Venue: IEEE Communications Letters (2009)

In this letter, two common protocols in cooperative communications, namely one-way and two-way amplify-and-forward (AF) half-duplex relaying, are investigated and compared in terms of rate. It is generally accepted that two-way AF half-duplex relaying is always better than its one-way counterpart in terms of rate. However, we found that depending on the definition of the total power constraint and the SNR, this is not generally true. We derived the SNR threshold, below which one-way relaying actually outperforms two-way relaying. Simulation results show that for power-limited applications operating at extremely low SNR, two-way relaying might not necessarily be a better choice over one-way relaying.
Maxtream: Stabilizing P2P Streaming by Active Prediction of Behavior Patterns
Authors: Shay Horovitz, Danny Dolev
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

In theory, peer-to-peer (P2P) based streaming designs and simulations provide a promising alternative to server based streaming systems both in cost and scalability. In practice however, implementations of P2P based IPTV and VOD failed to provide a satisfying QoS as the characteristic fluctuational throughput of a peer’s uplink leads to frequent annoying hiccups, substantial delays and latency for those who download from it. A significant factor for the unstable throughput of peers’ uplink is the behavior of other processes running on the source peer that consume bandwidth resources.In this paper we propose Maxtream - a machine learning based solution that actively predicts load in the uplink of streaming peers and coordinates source peers exchanges between peers that suffer from buffer under run and peers that enjoy satisfactory buffer size for coping with future problems.Simulation and experiments have shown that the solution successfully predicts upcoming load in popular protocols and can improve the QoS in existing P2P streaming networks.
United-Judgment Methods Based on Parameter-Estimation for Image Steganalysis
Authors: Jicang Lu, Fenlin Liu, Xiangyang Luo, Chunfang Yang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

In order to synthetically utilize the multi-steganalysis algorithms, and ulteriorly enhance the detection accuracy, the United-Judgment methods based on parameter-estimation were proposed for image steganalysis. According to two types of universal blind detection and specific steganalysis, a United-Judgment method based on weight and threshold, and also a method based on segment were proposed in this paper. Experiments were both made for the former method with seven kinds of typical blind detection algorithms and the latter one with five kinds of typical spatial domain steganalysis algorithms, respectively. The results showed that the proposed methods can synthetically utilize the existing detection algorithms, and comparing the results with a separate use of only one algorithm, the proposed methods could achieve higher detection accuracy. 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
Performance evaluation of heterogeneous wireless local area networks
Authors: J. David Porter, David S. Kim, Kittiporn Paotrakool
Venue: Computers and Industrial Engineering (2005)

The overall market for wireless local area networks (WLANs) grew more than 200% from 2000 to 2002, and will continue to grow at a compound annual growth rate of 23% until 2007. The objective of this research was to assess the performance of commercial-off-the-shelf WLAN systems with respect to interoperability, roaming ability, power consumption, throughput, and range. The evaluation was performed on both homogeneous and heterogeneous WLAN systems. Experimental test results indicate that the fundamental components of a WLAN system (i.e. access points and radio cards) and their combinations, significantly affect performance with respect to range, throughput, and power consumption. No significant differences in performance were observed in the WLAN systems with respect to interoperability (i.e. all systems characterized proved to be fully interoperable) or roaming (i.e. all combinations of access points and radio cards were able to seamlessly roam).
A Biometric Templates Secure Transmission Method Based on Bi-layer Watermarking and PKI
Authors: ChunLei Li, YunHong Wang, LiNing Liu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In this paper, a novel framework combining bi-layer watermarking and PKI for biometric templates secure transmission is proposed. We design a novel bi-layer watermarking algorithm. At the first-layer, DCT-based blind data hiding algorithm is employed. At the second-layer, the employed watermarking algorithm is public to all receivers and removable. The encrypted biometric templates and signature of biometric templates appended encrypted secret key are used as dual watermark, which are embedding into the same host image. Experimental results show that the bi-layer watermarking does not affect each other, and the proposed scheme has good performance while transmitting biometric templates over a noisy network.
A novel approach for privacy mining of generic basic association rules
Authors: Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
Venue: Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases (2009)

Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data. The irony is that data mining results rarely violate privacy. The objective of data mining is to generalize across populations rather than reveal information about individuals [10]. Thus, the true problem is not data mining, but how data mining is done. This paper presents a new scalable algorithm for discovering closed frequent itemsets in distributed environment, using commutative encryption to ensure privacy concerns. We address secure mining of association rules over horizontally partitioned data.
Block approach-tabu search algorithm for single machine total weighted tardiness problem
Authors: Wojciech Boejko, Józef Grabowski, Mieczysław Wodecki
Venue: Computers and Industrial Engineering (2006)

Problem of scheduling on a single machine to minimize total weighted tardiness of jobs can be described as follows: there are n jobs to be processed, each job has an integer processing time, a weight and a due date. The objective is to minimize the total weighted tardiness of jobs. The problem belongs to the class of NP-hard problems. Some new properties of the problem associated with the blocks have been presented and discussed. These properties allow us to propose a new fast local search procedure based on a tabu search approach with a specific neighborhood which employs blocks of jobs and a compound moves technique. A compound move consists in performing several moves simultaneously in a single iteration of algorithm and allows us to accelerate the convergence to good solutions. In the algorithm, we use an idea which decreases the complexity for the search of neighborhood from O(n^3) to O(n^2). Additionally, the neighborhood is reduced by using some elimination criteria. The method presented in this paper is deterministic one and has not any random element, as distinct from other effective but non-deterministic methods proposed for this problem, such as tabu search of Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1998). Local search heuristics for the single machine total weighted tardiness Scheduling Problem. INFORMS Journal on Computing, 10(3), 341-350, iterated dynasearch of Congram, R. K., Potts C. N., & Van de Velde, S. L. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(1), 52-67 and enhanced dynasearch of Grosso, A., Della Croce, F., & Tadei, R. (2004). An enhanced dynasearch neighborhood for single-machine total weighted tardiness scheduling problem. Operations Research Letters, 32, 68-72. Computational experiments on the benchmark instances from OR-Library (http://people.brunel.ac.uk/mastjjb/jeb/info.html) are presented and compared with the results yielded by the best algorithms discussed in the literature. These results show that the algorithm proposed allows us to obtain the best known results for the benchmarks in a short time. The presented properties and ideas can be applied in any local search procedures.
Communication coverage in wireless passive sensor networks
Authors: Alper Bereketli, Ozgur B. Akan
Venue: IEEE Communications Letters (2009)

System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of conventional WSN. However, the communication performance of WPSN is directly related to the RF coverage provided over the field the passive sensor nodes are deployed. In this letter, RF communication coverage in WPSN is analytically investigated. The required number of RF sources to obtain interference-free communication connectivity with the WPSN nodes is determined and analyzed in terms of output power and the transmission frequency of RF sources, network size, RF source and WPSN node characteristics.
Simulation model of a rotary expander of a small cogeneration unit
Authors: Evžen Thöndel
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

Today, steam engines are used for special purposes only, for example to reduce steam pressure in pressure reduction stations, where they replace the traditional and inefficient throttling process. Throttling is the most used way to control the pressure in steam reduction stations. This way is unsatisfactory from the economical point of view, because the exergy is lost uselessly. It is a part of heat energy that can perform a work. The better way of the pressure reduction is an expansion in a backpressure turbine or in a steam engine by simultaneous transformation of the heat energy into electricity (cogeneration). This article describes the design and implementation of the mathematical model of a steam engine used as pressure regulator in a pressure reduction station. The present model is a part of a comprehensive mathematical model of a cogeneration unit and also a part of the author's doctoral thesis. The model assumes detailed mathematical description of physical processes in a steam engine and implementation in an MATLAB-SIMULINK software environment.
Benchmarking Derivative-Free Optimization Algorithms
Authors: Jorge J. Moré, Stefan M. Wild
Venue: SIAM Journal on Optimization (2009)

We propose data profiles as a tool for analyzing the performance of derivative-free optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide estimates for the performance difference between these solvers, and show that on these problems, the model-based solver tested performs better than the two direct search solvers tested.
Bit-interleaved coded multiple beamforming with imperfect CSIT
Authors: Ersin Sengul, Hong Ju Park, Ender Ayanoglu
Venue: IEEE Transactions on Communications (2009)

This paper addresses the performance of bit-interleaved coded multiple beamforming (BICMB) [1], [2] with imperfect knowledge of beamforming vectors. Most studies for limited-rate channel state information at the transmitter (CSIT) assume that the precoding matrix has an invariance property under an arbitrary unitary transform. In BICMB, this property does not hold. On the other hand, the optimum precoder and detector for BICMB are invariant under a diagonal unitary transform. In order to design a limited-rate CSIT system for BICMB, we propose a new distortion measure optimum under this invariance. Based on this new distortion measure, we introduce a new set of centroids and employ the generalized Lloyd algorithm for codebook design. We provide simulation results demonstrating the performance improvement achieved with the proposed distortion measure and the codebook design for various receivers with linear detectors. We show that although these receivers have the same performance for perfect CSIT, their performance varies under imperfect CSIT.
Improvement in intrusion detection with advances in sensor fusion
Authors: Ciza Thomas, N. Balakrishnan
Venue: IEEE Transactions on Information Forensics and Security (2009)

Various intrusion detection systems (IDSs) reported in the literature have shown distinct preferences for detecting a certain class of attack with improved accuracy, while performing moderately on the other classes. In view of the enormous computing power available in the present-day processors, deploying multiple IDSs in the same network to obtain best-of-breed solutions has been attempted earlier. The paper presented here addresses the problem of optimizing the performance of IDSs using sensor fusion with multiple sensors. The trade-off between the detection rate and false alarms with multiple sensors is highlighted. It is illustrated that the performance of the detector is better when the fusion threshold is determined according to the Chebyshev inequality. In the proposed data-dependent decision (DD) fusion method, the performance optimization of individual IDSs is first addressed. A neural network supervised learner has been designed to determine the weights of individual IDSs depending on their reliability in detecting a certain attack. The final stage of this DD fusion architecture is a sensor fusion unit which does the weighted aggregation in order to make an appropriate decision. This paper theoretically models the fusion of IDSs for the purpose of demonstrating the improvement in performance, supplemented with the empirical evaluation.
Two-phase chief complaint mapping to the UMLS metathesaurus in Korean electronic medical records
Authors: Bo-Yeong Kang, Dae-Won Kim, Hong-Gee Kim
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

The task of automatically determining the concepts referred to in chief complaint (CC) data from electronic medical records (EMRs) is an essential component of many EMR applications aimed at biosurveillance for disease outbreaks. Previous approaches that have been used for this concept mapping have mainly relied on term-level matching, whereby the medical terms in the raw text and their synonyms are matched with concepts in a terminology database. These previous approaches, however, have shortcomings that limit their efficacy in CC concept mapping, where the concepts for CC data are often represented by associative terms rather than by synonyms. Therefore, herein we propose a concept mapping scheme based on a two-phase matching approach, especially for application to Korean CCs, which uses term-level complete matching in the first phase and concept-level matching based on concept learning in the second phase. The proposed concept-level matching suggests the method to learn all the terms (associative terms as well as synonyms) that represent the concept and predict the most probable concept for a CC based on the learned terms. Experiments on 1204 CCs extracted from 15 618 discharge summaries of Korean EMRs showed that the proposed method gave significantly improved F-measure values compared to the baseline system, with improvements of up to 73.57%.
Time Series Analysis and Forcast Based on Active Learning Artificial Neural Network
Authors: Tongzhi He, Shijue Zheng
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 01 (2009)

As is known to all, The neutral network has made a great progress in many fields. But due to some strict theoretical system, there are still many defaults in practical application. In this paper, We present an active learning artificial neural network (ALANN).The key issue of this kind of approach is what information can be analysis and forecast about time series(TS).However, the parameters of ALANN need to be adjusted for optimal performance. This point is just what this paper explain about. It overcomes the conventional method defaults, such as slow convergence, local minimum. The good result of the algorithm makes it can be used in the changing of temperature, the trends of population, etc.
An Improved 3D Reconstruction Method
Authors: Huiyan Jiang, Rui Zhang, Hongjuan Liu, Beilei Wang, Yuanfei Li
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Marching Cube Algorithm is a classical 3D reconstruction method, while topological ambiguity exists. Marching Tetrahedra Algorithms can solve the problem of topological ambiguity, but there are too many triangle patches. This paper proposes a new decomposing method that combines with MC method. We used several sets of medical images in the experiments, which proved this method could avoid topological ambiguity and the number of triangle patches falls off sharply, so it has better reconstruction efficiency
University courseware development: Comparative views of computer-based teaching by users and non-users
Authors: Denise McDonough, Janet Strivens, Roy Rada
Venue: Computers Education (1994)

This paper analyses the responses to a questionnaire survey carried out at Liverpool University into the state of courseware development and the use of computer-based teaching (CBT) throughout the departments of the University. It focuses on the contrasting views expressed by those who have used CBT and those who have not and compares the needs and requirements of these two groups. For instance, the users did not find that using CBT reduced their tutorial time, while the non-users assumed that it would. The latter group also wanted department-based hardware and support, while the users thought that these facilities should be centralized. A discussion follows which examines the main issues raised and makes some recommendations as to the development of an initial infrastructure for support.