ppxscal/embedding_network huggingface dataset:
A Performance Analysis of HICCUPS--A Steganographic System for WLAN
Authors: Krzysztof Szczypiorski
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

The paper presents an analysis of performance features of the HICCUPS (HIdden Communication system for CorrUPted networkS) including the efficiency and the cost of the system in WLANs (Wireless Local Area Networks). The analysis relies on the original CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) 802.11 Markov chain-based model and proves that the HICCUPS is the efficient steganographic method with the reasonable cost.
Digital Image Watermarking Using Iterative Blending Based on Wavelet Technique
Authors: Shun-liao Yang, Zheng-bing Zhang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

With the rapid growth of Internet technology, image watermarking techniques have been widely studied since the need for copyright protection. This paper presents a scheme of digital image watermarking using iterative blending based on Discrete Wavelet Transform (DWT). The method is based on decomposing host image and watermarking image by DWT, and then embedding the significant coefficients of watermarking image into the same part of host image using iterative blending. The watermarking won't be visible and can be extracted later. Experimental results show that the proposed watermarking technique is robust against several attacks, such as cutting, median filtering, rotation and JPEG compressing.
Evolutionary algorithm for advanced process planning and scheduling in a multi-plant
Authors: Chiung Moon, Yoonho Seo
Venue: Computers and Industrial Engineering (2005)

Integration of process planning and scheduling is one of the most important functions to support flexible planning in a multi-plant. The planning and scheduling are actually interrelated and should be solved simultaneously. In this paper, we propose an advanced process planning and scheduling model for the multi-plant. The objective of the model is to decide the schedules for minimizing makespan and operation sequences with machine selections considering precedence constraints, flexible sequences, and alternative machines. The problem is formulated as a mathematical model, and an evolutionary algorithm is developed to solve the model. Numerous experiments are carried out to demonstrate the efficiency of the proposed approach.
Ontologies and semantic mining for bio-technology and chemistry data and patents
Authors: Ilkka Havukkala
Venue: Proceeding of the 2nd international workshop on Patent information retrieval (2009)

Current Semantic Web technologies and fast retrieval methods for internet scale databases are reviewed and challenges for handling biotechnology and chemistry data and patents identified. Possible solutions are discussed and future directions for integrated scalable solutions indicated.
Lossy distributed source coding using graphs
Authors: Suhan Choi
Venue: IEEE Communications Letters (2009)

In this letter, lossy distributed source coding using graphs is considered. This corresponds to the source coding part of the graph-based framework [1] for transmission of analog correlated sources over the multiple-access channel (MAC). Consequently, it is shown that a pair of analog correlated sources can be reliably represented into a bipartite graph by allowing certain amount of distortion. An achievable rate-distortion region for this problem is also provided. Therefore, it can be concluded that, for transmission of any (both discrete and continuous) set of correlated sources over MACs, graphs can be used as discrete interface between source coding and channel coding modules.
Design of Cluster-Based System Framework for SIP-Based Multimedia Conferencing Services
Authors: Hui-Kai Su, Wen-Hsu Hsiao, Yu-Kai Lin, Kim-Joan Chen, Cheng-Shong Wu
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

Multimedia conferencing is a communication service to approach multi-party, real-time, interactive and multimedia applications. Due to mature Internet technologies and ubiquitous network access services, more and more Internet applications about real-time multimedia conferencing are used. In the current conferencing systems, the media processing in centralized mixer servers is the system bottleneck. The communication quality will be decreased because of the central system loading. This paper proposes a cluster-based framework to provide a SIP-based multimedia conferencing service. In this framework, the cluster members are self-organizing and self-maintaining to share the resources of mixers within the cluster. Additionally, the extended SIP messages and SIP-based clustering mechanism are designed in this paper. Thus, if the resources of the mixers can be allocated in an optimal planning, the mixer loading can be distributed well to each mixer in the cluster. The system requirements of super-performance mixer servers can be avoided. In the framework, not only the system loading of conference servers can be distributed well, but also the infrastructure cost can be reduced. 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
Evaluation of microbending loss and refractive index changes due to temperature rise and young's modulus variations of coating material in double-coated optical fibers
Authors: Faramarz E. Seraji, Golnoosh Toutian
Venue: Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications (2007)

This paper presents the effect of Young's modulus of fiber coating layers on microbending loss and refractive index changes in the presence of temperature rise and hydrostatic pressure. It is shown that The increase of Young's modulus of primary coating would lower the microbending loss and refractive index changes and in the secondary coating layer, the parameters values increase. We have shown that the temperature rise affecting on the fiber, makes the microbending loss and refractive index decrease, linearly.
Trust Service Selection in Pervasive Computing
Authors: Xiaoying Wang, Yingge Chen, Benlian Xu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

This paper describes the establishment and estimation of trust relation, and put forward a kind of trust service selection model in pervasive computing environment. Through direct and indirect trust relation evaluation, preference adjustment and trust update, a sound trust service evaluation system is set up which has been tested in smart UPS network system and shows a better performance.
Exact analysis of offset-based service differentiation in single-channel multi-class OBS
Authors: H. Emre Kankaya, Nail Akar
Venue: IEEE Communications Letters (2009)

We study a multi-class optical burst switching (OBS) node using the horizon reservation scheme. Multiple traffic classes are differentiated using different offset times per class. Assuming Poisson burst arrivals and phase-type distributed burst lengths, we exactly solve for per-class blocking probabilities using the well-known theory of feedback Markov fluid queues.
A Markovian inventory system with random shelf time and back orders
Authors: Srinivas R. Chakravarthy, Jacob K. Daniel
Venue: Computers and Industrial Engineering (2004)

In this paper we consider an inventory system in which the demands occur according to a Markovian arrival process (MAP). The items in the inventory have shelf times that are assumed to follow an exponential distribution. The inventory is replenished according to an (s, S) policy and the replenishing times are assumed to follow a phase type distribution. Back orders of demands are allowed up to a certain level. Using matrix analytic methods we perform the steady state analysis of the inventory model. We also show that the reorder process can be modelled as a MAP. An optimization problem is proposed and several interesting numerical examples are presented.
Application Research of Data Mining in Travel Agency's Customer Relationship Management
Authors: HaiYing Xie, WenJing Tang
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

CRM can enable the enterprise to enhance greatest the satisfaction degree and loyalty degree of customer through the effective integrating the human resources, the operation flow and the specialized technology. The data mining technology is playing the very essential role in the CRM implementation. This article introduced the CRM and the data mining technology, and constructed the frame of travel agency CRM based on data mining aimed at the travel agency industry, and focused on the using of data mining technology in the travel agency customer relationship management.
Rate balancing in multiuser MIMO OFDM systems
Authors: Pedro Tejera, Wolfgang Utschick, Josef A. Nossek, Gerhard Bauch
Venue: IEEE Transactions on Communications (2009)

Recently, the capacity region of the Gaussian broadcast channel has been characterized. For a given transmit power constraint, those points on the boundary of the capacity region can be regarded as the set of optimal operational points. The present work addresses the problem of selecting the point within this set that satisfies given constraints on the ratios between rates achieved by the different users in the network. This problem is usually known as rate balancing. To this end, the optimum iterative approach for general MIMO channels is revisited and adapted to an OFDM transmission scheme. Specifically, an algorithm is proposed that exploits the structure of the OFDM channel and whose convergence speed is essentially insensitive to the number of subcarriers. This is in contrast to a straightforward extension of the general MIMO algorithm to an OFDM scheme. Still, relatively high complexity and the need of a time-sharing policy to reach certain rates are at least two obstacles for a practical implementation of the optimum solution. Based on a novel decomposition technique for broadcast channels a suboptimum non-iterative algorithm is introduced that does not require time-sharing and very closely approaches the optimum solution.
Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm
Authors: Chao Chen, Jianghai Xia, Jiangping Liu, Guangding Feng
Venue: Computers Geosciences (2006)

Using a genetic algorithm to solve an inverse problem of complex nonlinear geophysical equations is advantageous because it does not require computer gradients of models or ''good'' initial models. The multi-point search of a genetic algorithm makes it easier to find the globally optimal solution while avoiding falling into a local extremum. As is the case in other optimization approaches, the search efficiency for a genetic algorithm is vital in finding desired solutions successfully in a multi-dimensional model space. A binary-encoding genetic algorithm is hardly ever used to resolve an optimization problem such as a simple geophysical inversion with only three unknowns. The encoding mechanism, genetic operators, and population size of the genetic algorithm greatly affect search processes in the evolution. It is clear that improved operators and proper population size promote the convergence. Nevertheless, not all genetic operations perform perfectly while searching under either a uniform binary or a decimal encoding system. With the binary encoding mechanism, the crossover scheme may produce more new individuals than with the decimal encoding. On the other hand, the mutation scheme in a decimal encoding system will create new genes larger in scope than those in the binary encoding. This paper discusses approaches of exploiting the search potential of genetic operations in the two encoding systems and presents an approach with a hybrid-encoding mechanism, multi-point crossover, and dynamic population size for geophysical inversion. We present a method that is based on the routine in which the mutation operation is conducted in the decimal code and multi-point crossover operation in the binary code. The mix-encoding algorithm is called the hybrid-encoding genetic algorithm (HEGA). HEGA provides better genes with a higher probability by a mutation operator and improves genetic algorithms in resolving complicated geophysical inverse problems. Another significant result is that final solution is determined by the average model derived from multiple trials instead of one computation due to the randomness in a genetic algorithm procedure. These advantages were demonstrated by synthetic and real-world examples of inversion of potential-field data.
Error probabilities of noncoherent and coherent FSK in the presence of frequency and phase offsets for two-hop relay networks
Authors: MinChul Ju, Il-Min Kim
Venue: IEEE Transactions on Communications (2009)

We analyze the error performance of two-hop relay networks adopting frequency shift keying (FSK) over frequency-flat Rayleigh fading channels. It is assumed that relay networks consist of a source, a relay, and a destination without a direct path signal from the source to the destination and the relay adopts the amplify-and-forward protocol with a fixed gain. Firstly, considering imperfect frequency and phase synchronization, we obtain the exact error probability expressions for noncoherent and coherent binary FSK (BFSK). Secondly, assuming perfect frequency and phase synchronization, we derive a closed-form error probability approximation for coherent M-ary FSK (MFSK). The proposed methods can also be used for the error performance analysis of classical one-hop FSK systems with perfect/imperfect frequency and phase synchronization. The obtained error probability expressions will help the design of two-hop relay networks adopting FSK in determining the system parameters such as the transmission power at the source, the amplifying coefficient at the relay, and the maximum affordable frequency and phase offsets to satisfy the required error performance.
An off-line dictionary attack on a simple three-party key exchange protocol
Authors: Junghyun Nam, Juryon Paik, Hyun-Kyu Kang, Ung Mo Kim, Dongho Won
Venue: IEEE Communications Letters (2009)

Key exchange protocols allow two or more parties communicating over a public network to establish a common secret key called a session key. Due to their significance in building a secure communication channel, a number of key exchange protocols have been suggested over the years for a variety of settings. Among these is the so-called S-3PAKE protocol proposed by Lu and Cao for password-authenticated key exchange in the three-party setting. In the current work, we are concerned with the password security of the S-3PAKE protocol. We first show that S-3PAKE is vulnerable to an off-line dictionary attack in which an attacker exhaustively enumerates all possible passwords in an off-line manner to determine the correct one. We then figure out how to eliminate the security vulnerability of S-3PAKE.
SNR estimation algorithm based on the preamble for OFDM systems in frequency selective channels
Authors: Guangliang Ren, Huining Zhang, Yilin Chang
Venue: IEEE Transactions on Communications (2009)

We propose a new SNR estimation method based on the preamble for OFDM systems in frequency selective channels. The OFDM training symbols in the preamble are equalized by the known data in frequency domain and employed to estimate the noise variance. The second order moments of the received symbols are used to estimate the signal plus noise power in the OFDM packets. The SNRs on the subchannels and the average SNR of the packets can all be estimated. Simulation results show that the proposed method is robust to frequency selectivity in wireless channels, and its performance is considerably improved compared with the available methods.
Non-interfering Multipath Geographic Routing for Wireless Multimedia Sensor Networks
Authors: Bin Fu, RenFa Li, Xiongren Xiao, Caiping Liu, Qiuwei Yang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Wireless multimedia sensor networks are widely used in the information acquiring and processing. Potential applications of multimedia sensor networks span a wide spectrum from military to industrial, from commercial to environmental monitoring. These applications may demand high bandwidth and are extremely delay-sensitive. Multipath routing is one of appropriate solutions for multimedia data transmitting in wireless sensor networks. In this paper, we address the issues of interfering multipath in wireless multimedia sensor networks and propose a new non-interfering multipath geographic routing scheme. Comparison with interfering multipath scheme and simulation results in communication level show that the new scheme can effectively solve the interfering problem of multipath and reduce the average end-to-end packet delay.
Localising missing plants in squared-grid patterns of discontinuous crops from remotely sensed imagery
Authors: J. M. Robbez-Masson, J. C. Foltête
Venue: Computers Geosciences (2005)

The purpose of this work is to localise and characterise missing plants on very high resolution (VHR) aerial images of agricultural parcels, in the case of discontinuous crops like wine and olive tree, which are planted according to a squared-grid pattern. It aims to establish an assisted, image processing system for remote sensed images, allowing the inventory the missing or withering plants, and the monitoring of their evolution during time. The global approach considers the planted parcel as a topological graph of vertices, whose reciprocal location conforms to a set of geometrical rules about orientation and length. The proposed system initiates the graph from the original image; then it adds missing vertices and refines its knowledge of the spatial pattern on an iterative basis. Quality indicators are assigned at each added vertex, and several stopping criteria are estimated for each iteration, permitting an automated use of the algorithm. Test cases have been conducted on two data sets of three parcels each: olive groves and goblet vineyards. The results are compared to validation data. They show an efficient reconstruction of the geometry and satisfactory omission-commission errors; they allow drawing up a typology of the major errors, and propose calibration parameters based on a sensitivity analysis. The main improvements include essentially the preprocessing, filtering step of the initial image. The process is being used for Languedocian vineyards (France), and may be potentially usable for other problematic with the same kind of spatial patterns.
Complexity metrics for manufacturing control architectures based on software and information flow
Authors: Areejit Phukan, Manoj Kalava, Vittal Prabhu
Venue: Computers and Industrial Engineering (2005)

A number of architectures can be used to integrate different components of a manufacturing enterprise such as machine tools, robots, and guided vehicles. The choice of architecture has a significant impact on system complexity, which in turn determines properties such as scalability, flexibility, fault-tolerance and modifiability. There is a need to develop metrics that quantify the complexity of a system that can serve as a means for comparing alternative architecture at the design stage. In this paper, we propose metrics used in software engineering to characterize the complexity of manufacturing systems. These metrics have been applied for measuring the complexity of two software systems: material delivery system and distributed scheduling.
Living the free/open source software development process in the classroom: an experience with RUP
Authors: Kenyer Domínguez, Anna Grimán, Luis E. Mendoza, María Pérez
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

Despite the advances in software engineering, the development of information systems (IS) is still a difficult task; even more difficult is to develop the needed skills in an academic environment (a classroom). This is partly because it is not always possible to simulate real situations in the classroom. This article presents the lessons learned from the experience of teaching IS to computer engineering students at the Universidad Sim&oacute;n Bol&iacute;var in Venezuela. The teaching venture used a development process based on free/open source software, with the innovative use of collaborative and free tools and under the methodological guidelines of RUP. As a result we have developed 4 case studies for the college community; each one obtained high levels of satisfaction from users and provided students with not only the knowledge, but also with the practical experience in regards with IS development learning.
Gaussian process regressors for multiuser detection in DS-CDMA systems
Authors: Juan José Murillo-Fuentes, Fernando Pérez-Cruz
Venue: IEEE Transactions on Communications (2009)

In this paper we present Gaussian processes for Regression (GPR) as a novel detector for CDMA digital communications. Particularly, we propose GPR for constructing analytical nonlinear multiuser detectors in CDMA communication systems. GPR can easily compute the parameters that describe its nonlinearities by maximum likelihood. Thereby, no cross-validation is needed, as it is typically used in nonlinear estimation procedures. The GPR solution is analytical, given its parameters, and it does not need to solve an optimization problem for building the nonlinear estimator. These properties provide fast and accurate learning, two major issues in digital communications. The GPR with a linear decision function can be understood as a regularized MMSE detector, in which the regularization parameter is optimally set. We also show the GPR receiver to be a straightforward nonlinear extension of the linear minimum mean square error (MMSE) criterion, widely used in the design of these receivers. We argue the benefits of this new approach in short codes CDMA systems where little information on the users' codes, users' amplitudes or the channel is available. The paper includes some experiments to show that GPR outperforms linear (MMSE) and nonlinear (SVM) state-of-the-art solutions.
A correct rule-based geometric constraint solver
Authors: R. Joan-Arinyo, A. Soto
Venue: Computers and Graphics (1997)

We present a rule-based geometric constraint solver. The solver handles 2-D, variational, constraint-defined geometric objects. The solver computes a solution in two phases. First, the solver builds a sequence of construction steps. Then the construction steps are carried out to generate an instance of the geometric object for the current dimension values. We prove that the solver is correct. First, we formalize the solver as a rewrite system whose rewriting rules are geometric construction steps. Then we prove that, for well-constrained geometric objects, the sequence in which the solver applies the construction steps defines a terminating confluent reduction system.