ppxscal/embedding_network huggingface dataset:
Weighted network decapitation: the economics of iterated attack and defense
Authors: Josep Domingo-Ferrer
Venue: Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases (2009)

Vulnerability of networks (e.g. peer-to-peer networks, social networks, etc.) against one-shot decapitation attacks has been addressed several times in the literature. A first study on how a network can best defend itself by replenishing nodes and rewiring edges after decapitation was made by Nagaraja and Anderson. We extend the work of those authors by: i) considering weighted networks; ii) taking into account the economic aspects of the attack and defense strategies, namely the cost of node destruction/replenishment and subtler costs such as the average path length increase or the privacy degradation.
Optimal Integration Model of Multiple Information Security Methods
Authors: Bin Zeng, FuLiang Guo, Lu Yao
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

With the ever growing number of hosts connected to the Internet, network and information security has become more and more important. Due to the increasing sophistication of attacking techniques and automated attacking tools, it is necessary for large scale information to combine multiple and heterogeneous security mechanisms’ collaboration to discover and defend various distributed and coordinated attacks. In order to allow for a coordinated Integration of existing information security technologies, a fusing multi-defense technology optimization model is proposed, which takes into account not only the security aspect but also its impact on the performance, usability, and cost. The relative preference among the objectives can be adjusted by varying the weights associated with each parameter of mathematic model. The model is illustrated and confirmed by applying it to a typical example problem in the information sharing field. This method can improve the scalability, accuracy and capability by adopting multi defense technology.
Research on Three-Dimensional Measurement Using Color-Coding Structured Light
Authors: Xiaopeng Ji, Kuanquan Wang, Zhiqiang Wei
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

This paper presents a color structured light technique for recovering object shape from images. Coding strategy is one of the most important techniques because it effects the measure precision and efficiency directly. Unlike traditional encoding methods, we design new coloured stripe patterns in order to locate both intensity peaks and edges. Then edge detection method with sub-pixel accuracy is performed and the detected stripes centres and the edges between adjacent stripes are matched with the projected pattern. The experimental results show that our methods are very powerful in terms of accuracy and resolution.
Output characterization of constant bit rate traffic in FIFO networks
Authors: Yashar Ghiassi-Farrokhfal, Jörg Liebeherr
Venue: IEEE Communications Letters (2009)

We provide an analytical proof that the departure rate of a CBR flow at an overloaded link with FIFO buffers is proportional to the flow's share of the total offered load at the link. This property of FIFO scheduling was recently validated in [1] in a series of traffic measurement experiments. An extension of the analysis to a multi-node scenario shows that the output rate of a flow in a network with many overloaded FIFO switches approaches the pessimistic values given by blind multiplexing.
Uplink capacity of a variable density cellular system with multicell processing
Authors: Efstathios Katranaras, Muhammad A. Imran, Costas Tzaras
Venue: IEEE Transactions on Communications (2009)

In this work we investigate the information theoretic capacity of the uplink of a cellular system. Assuming centralised processing for all Base Stations, we consider a power-law path loss model along with variable cell size (variable density of Base Stations) and we formulate an average path-loss approximation. Considering a realistic Rician flat fading environment, the analytical result for the per-cell capacity is derived for a large number of users distributed over each cell. We extend this general approach to model the uplink of sectorized cellular system. To this end, we assume that the user terminals are served by perfectly directional receiver antennas, dividing the cell coverage area into perfectly non-interfering sectors. We show how the capacity is increased (due to degrees of freedom gain) in comparison to the single receiving antenna system and we investigate the asymptotic behaviour when the number of sectors grows large. We further extend the analysis to find the capacity when the multiple antennas used for each Base Station are omnidirectional and uncorrelated (power gain on top of degrees of freedom gain). We validate the numerical solutions with Monte Carlo simulations for random fading realizations and we interpret the results for the real-world systems.
Practical interleavers for repeat-accumulate codes
Authors: Sarah J. Johnson, Steven R. Weller
Venue: IEEE Transactions on Communications (2009)

In this paper we design practical interleavers for regular, systematic repeat-accumulate (RA) codes. The new interleavers, which we call L-type and modified L-type interleavers, are deterministic, described by a single parameter, and straightforward to implement. Despite their simple description, the new interleavers are shown to perform equally as well as, or better than, traditional interleavers over a wide range of code lengths and rates.
Construction of Workflow Management System Modeled by Roles
Authors: Qiang Hu, Peng Wu, Donghua Wang
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

The method of modeling workflow driven by roles is put forward in the paper. The workflow model is formalized defined as 4-tuple . The key technology of workflow system construction based the present method such as: Data Object, Authority, Modeling Environment and Mothed of Schedul are explicit illustrated. The function architecture of workflow system constructed by the given modeling method and the deployment architecture based on J2EE are also given in the last section of this paper.
Lightweight Information Hiding in H.264/AVC Video Stream
Authors: Ke Liao, Dengpan Ye, Shiguo Lian, Zhichuan Guo, Jinlin Wang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

This paper proposes a new real-time information hiding algorithm on latest H.264/AVC video coding standard. The information is embedded into the Trailing Ones of 4x4 blocks during the Context-based Adaptive Variable Length Coding (CAVLC) process. This algorithm is efficient with low computational complexity. The simulation results show that the degradation of video quality is negligible, and the same overall bit-stream length is maintained. Under the simulation of different RTP packet loss channels, the embedded information can be well recovered.
Direct sequential simulation with histogram reproduction: A comparison of algorithms
Authors: Robyn K. Robertson, Ute A. Mueller, Lynette M. Bloom
Venue: Computers Geosciences (2006)

Sequential simulation is a widely used technique applied in geostatistics to generate realisations that reproduce properties such as the mean, variance and semivariogram. Sequential Gaussian simulation requires the original variable to be transformed to a standard normal distribution before implementing variography, kriging and simulation procedures. Direct sequential simulation allows one to perform the simulation using the original variable rather than in normal score space. The shape of the local probability distribution from which simulated values are drawn is generally unknown and this results in direct simulation not being able to guarantee reproduction of the target histogram; only the Gaussian distribution ensures reproduction of the target distribution, and most geostatistical data sets are not normally distributed. This problem can be overcome by defining the shape of the local probability distribution through the use of constrained optimisation algorithms or by using the target normal-score transformation. We investigate two non-parametric approaches based on the minimisation of an objective function subject to a set of linear constraints, and an alternative approach that creates a lookup table using Gaussian transformation. These approaches allow the variography, kriging and simulation to be performed using original data values and result in the reproduction of both the histogram and semivariogram, within statistical fluctuations. The programs for the algorithms are written in Fortran 90 and follow the GSLIB format. Routines for constrained optimisation have been incorporated.
A Novel Intrusion Detection Architecture for Energy-Constrained Mobile Ad-hoc Networks
Authors: Chuan-xiang Ma, Ze-ming Fang, Lei-chun Wang, Qing-hua Li
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Due to resource limitation, it is an optimum solution for intrusion detection in mobile Ad-hoc networks (MANETs) that all nodes investigate system and user activities while a subset of network nodes are selected as monitoring nodes to monitor and detect network packets. In this paper, a selection scheme of monitoring nodes called Event Triggering Based Adaptive Selection (ETBAS) is proposed, which introduces the mechanism of monitoring states and the method of event triggering. In ETBAS high connectivity and energy resource are balanced for adaptive selection scheme, which is adaptable to dynamically changing networks and enhances the network lifetime. Then a new intrusion detection architecture for energy-constrained mobile Ad-hoc networks based on ETBAS is designed, in which the network detection module is optional, monitoring nodes are selected by activating the network detection model to work. Experiments show that ETBAS is effective and the model works perfectly.
Research on Information Hiding Technology Based on Chaotic Map and Image Fusion
Authors: Li-nan Fan, Bo-tao Song
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

A digital image copyright protection system model is built on the foundation of chaotic map and image fusion. During the pretreatment progress of chaotic map, the safety of the system is reinforced by using encryption technology. As the new embedding algorithm presented, the ability of JPEG anti-compress of the spatial domain algorithm is improved. The reliability of the algorithm is proved by a series of subjective and objective evaluation also by some offensive experiments. Results from large quantity of experiments can prove that the digital watermarking algorithm in this work is able to embed and extract watermark efficiently from the carrier images and it has a remarkable functional value.
Research of Wireless Network Fault Diagnosis Based on Bayesian Networks
Authors: Junhui You
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 03 (2009)

In the field of wireless network fault diagnosis, the relationship between the phenomenon and reason of fault is complicated and non-linear. So it adds a great deal of difficulty to wireless network optimizers when they are dealing with network problems. In response to this problem, in this paper, taken the CDMA network as an example, the method of wireless network fault diagnosis based on Bayesian Network is discussed. Two diagnosis models, Causation Bayesian Network model and Naive Bayesian Network model, are established and applied to experiment. They are testified to be precise and reliable and the result is used to evaluate the advantage and disadvantage of them. Besides, for the incompleteness of actual performance data, three mature incomplete-data-set learning methods, Monte-Carlo method, Gaussian algorithm and EM algorithm, are applied, whose function and shortcoming are explained. 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 flexible true plurigaussian code for spatial facies simulations
Authors: Chaoshui Xu, Peter Alan Dowd, Kanti V. Mardia, Robert J. Fowell
Venue: Computers Geosciences (2006)

The current forms of plurigaussian simulation have serious limitations for applications to large numbers of geological facies, or units, which have complex contact relations. In this paper the authors present a true plurigaussian simulation (PGS) method, which can be applied in a simple way to any number of geological facies by using any number of Gaussians. A recursive technique is used for multi-dimensional integration of the Gaussian functions, which forms the major part of the PGS computation. A binary, dynamic contact matrix (DCM) is used to specify the contact relations among the facies; this method has proved to be simple, flexible and capable of dealing with general, complex contact relations. A method for incorporating into PGS multivariate correlations among any number of random variables is also included. A simulated example is used to demonstrate the application of the generalised PGS. This example shows that PGS is more robust to under-sampling than traditional direct indicator simulation.
The application of geography markup language (GML) to the geological sciences
Authors: Ron Lake
Venue: Computers Geosciences (2005)

GML 3.0 became an adopted specification of the Open Geospatial Consortium (OGC) in January 2003, and is rapidly emerging as the world standard for the encoding, transport and storage of all forms of geographic information. This paper looks at the application of GML to one of the more challenging areas of automated geography, namely the geological sciences. Specific features of GML of interest to geologists are discussed and then illustrated through a series of geological case studies. We conclude the paper with a discussion of anticipated geological web services that GML will enable. GML is written in XML and makes use of XML Schema for extensibility. It can be used both to represent or model geographic objects and to transport them across the Internet. In this way it serves as the foundation for all manner of geographic web services. Unlike vertical application grammars such as LandXML, GML was intended to define geographic application languages, and hence is applicable to any geographic domain including forestry, environmental sciences, geology and oceanography. This paper provides a review of the basic features of GML that are fundamental to the geological sciences including geometry, coverages, observations, reference systems and temporality. These constructs are then employed in a series of simple geological case studies including structural geological description, surficial geology, representation of geological time scales, mineral occurrences, geohazards and geochemical reconnaissance.
Semantic relatedness hits bibliographic data
Authors: George Tsatsaronis, Iraklis Varlamis, Sofia Stamou, Kjetil Nørvåg, Michalis Vazirgiannis
Venue: Proceeding of the eleventh international workshop on Web information and data management (2009)

In this paper we introduce a novel approach for the thematic organization of bibliographic records that builds upon a semantic relatedness measure we have implemented for this task. In particular, we introduce the Omiotis measure, which captures the semantic relatedness between text segments and enables the thematic organization of the bibliographic data stored in online databases. Experimental evaluation demonstrates that Omiotis can significantly improve the performance of several data mining tasks, such as publications' classification and clustering, compared to existing approaches; even when considering a limited amount of information, i.e., the paper titles.
Optical CDMA coding scheme with a large size of code space
Authors: Chao-Chin Yang
Venue: IEEE Communications Letters (2009)

One new wavelength-time coding scheme is proposed for high-speed optical code division multiple access(OCDMA) networks, and a large number of new codes with asymptotically optimal cardinalities can be generated by this coding scheme. This makes the codeword patterns more random and thus the resulting OCDMA networks are more robust against the eavesdroppers.
Joint importance of multistate systems
Authors: Shaomin Wu
Venue: Computers and Industrial Engineering (2005)

Importance measures in reliability engineering are used to identify weak areas of a system and signify the roles of components in either causing or contributing to proper functioning of the system. Traditional importance measures for multistate systems mainly concern reliability importance of an individual component and seldom consider the utility performance of the systems. This paper extends the joint importance concepts of two components from the binary system case to the multistate system case. A joint structural importance and a joint reliability importance are defined on the basis of the performance utility of the system. The joint structural importance measures the relationship of two components when the reliabilities of components are not available. The joint reliability importance is inferred when the reliabilities of the components are given. The properties of the importance measures are also investigated. A case study for an offshore electrical power generation system is given. nally given.
Business Component Design Method Based on the Feature Matrix
Authors: Baowen Wang, Jinli Peng, Wenyuan Liu
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

In order to enhance the efficiency of information system’s development, capture business components with high reusability, a business component deign method based on the feature matrix was proposed. Through analyzing the existing business models, a domain business model oriented to component analysis was proposed, the elements composite models were described and business components identification algorithm based on the relationship between business elements was given. In the identification process, the concept of business elements similarity which can overcome the limitation of artificial weight was given. Application example showed that the algorithm effectively reduced the time complexity and identified highly reusable business components.
Energy Demand Forecast in China Based on Wavelet Neural Network
Authors: Li Jiang, Jue Wang
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

In this paper, a wavelet-neural-network-based forecast model is developed for energy demand in China. Combining qualitative with quantitative analysis, we analyze some main factors affecting energy demand in China. A first order wavelet-neural network forecasting model with time-delay is established, including population, GDP, variation of industrial structure and energy consumption. The simulation result shows that this nonlinear forecasting model is more reasonable and has higher precision than other multiple regression models.
MIMO transmission and reception techniques using three-element ESPAR antennas
Authors: Osama N. Alrabadi, Constantinos B. Papadias, Antonis Kalis, Nicola Marchetti, Ramjee Prasad
Venue: IEEE Communications Letters (2009)

A novel scheme for spatially multiplexing two BPSK signals using a 3-element ESPAR (electronically steerable parasitic array radiator) antenna was reported in [3]. In this paper we first optimize the set of loads controlling the parasitic elements within the transmission mode by maximizing the outage capacity. We also propose different reception techniques for spatially demultiplexing real and complex signals (using the same set of loads). The proposed transmission and reception schemes are evaluated in an indoor peer-to-peer mobile ad-hoc channel via simulations, where each ad-hoc node is equipped with a 3-element ESPAR terminal.
Security weakness in a dynamic program update protocol for wireless sensor networks
Authors: Peng Zeng, Zhenfu Cao, Kim-Kwang Raymond Choo, Shengbao Wang
Venue: IEEE Communications Letters (2009)

In 2008, Das and Joshi proposed a new dynamic program update protocol for wireless sensor networks using the orthogonality principle. We identify an inherent flaw in their design and demonstrate that the Das-Joshi scheme is vulnerable to an impersonation attack, in violation of their security claim. We then present a modified scheme to eliminate the security vulnerability.
Reconstructing a 3-D structure with multiple deformable solid primitives
Authors: Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita
Venue: Computers and Graphics (1997)

This paper develops a sophisticated approach to a method for fitting of complex 3-D shapes to unsegmented sets of data. The approach features dynamic models consisting of parametrically defined solid primitives (such as superquadrics), global geometric transformations, global deformations and local finite element deformations. Our technique deals with a deformable model consisting of multiple primitives (parts) that can be used to represent even more complex shapes than are common in the natural world. The deformable model is extended to the case of unsegmented data, incorporating an extended version of a fuzzy clustering technique. The image or range data are transformed into forces acting on the model that deform and conform to the given data set while continually synthesizing nonrigid motion. An adaptive procedure updates a damping factor in accordance with the largest possible step in an implemented iteration process. We demonstrate the fitting process in experiments involving the extraction of the shape of the mouse embryo's organs from microscopic sections.
A Peer-to-Peer Framework for Accelerating Trust Establishment
Authors: Bailing Liu, Hongwei Lu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Trust negotiation is an approach that establishes mutual trust between strangers wishing to share resources or conduct business by gradually requesting and disclosing digitally signed credentials. Sometimes negotiators do not have very strict security requirements or the efficiency is the most crucial need. In such cases, it is preferable to adopt schemes that speed up the negotiations, even if they do not maximize the protection of the involved resources. Therefore, in this paper, we present a trust negotiation framework that speeds up negotiations from two aspects whenever possible, disclosure sequence generation and credential validation, which are computationally expensive during negotiations. The framework we propose presents several innovative features, such as the support for predicting disclosure sequences by locally trusted peers, and the use of declaration tickets and proving tickets to reduce the number of exchanged credentials and credential validations.