ppxscal/embedding_network huggingface dataset:
Reservation Mechanisms for Efficient Resource Management in Internetworks
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Distributed multimedia applications with quality of service requirements that must be guaranteed by the underlying network are evolving at a fast pace. Resource reservation protocols are therefore essential to enable efficient resource management in internetworks. We survey existing resource reservation protocols and the reservation styles they support. Current protocols do not permit different reservation styles to be combined within the same session. We show, using simulation of realistic scenarios, that allowing different reservation styles to coexist within the same session yields more efficient resource management and provides more satisfactory service to the applications. We then propose a complete mechanism for implementing the shared dynamic reservation style, along with three techniques to enhance its effectiveness in managing the network resources. The effectiveness of these three techniques is evaluated using simulation. 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
Distribution-based bandwidth access scheme in slotted all-optical packet-switched networks
Authors: Akbar Ghaffar Pour Rahbar, Oliver W. W. Yang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

The common approach in an ingress switch to access a slotted all-optical packet-switched network is the TTA (timer-based/threshold-based bandwidth access) bandwidth access scheme in which packet differentiation is provided by a time-out mechanism. In contrast, we propose in this paper the DA (distribution-based bandwidth access) to access the slotted all-optical packet-switched network within a DiffServ domain. Each torrent (the traffic between each pair of ingress and egress switches) is given a bandwidth measured in slots within a frame at an ingress switch. The slots from each torrent are evenly distributed throughout the frame and among the output wavelengths/fibers of the ingress switch. Comparing to the most commonly used technique TTA, we demonstrate that our DA approach can achieve the following: (1) provide each traffic torrent a fairer access to the network bandwidth; (2) reduce the probability of the slot drop rate at the optical network; (3) reduce the excessive bandwidth allocation by the bursty torrents; (4) balance the traffic load much better on wavelength channels; and (5) guarantee a stable edge switch operation to service traffic in which the traffic generation rate to the optical network is lower than the traffic service rate.
Least-Cost High-Quality Object Retrieval for Distributed Multimedia Collaborations
Authors: K. Selcuk Candan, Yifeng Yang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In a collaborative network, retrieval of media objects from corresponding servers introduces many challenges. A major challenge is the multi-objective route establishment requirement, where various QoS and object quality parameters should be simultaneously optimized. This task requires new quality-based routing algorithms. In this paper, we present optimistic, pessimistic, and hybrid algorithms that optimize the media delivery costs while maximizing the quality of the transmitted objects. We also report on simulation results to show applicability of these algorithms for varying sizes of collaborative networks. These algorithms can be implemented either as sub-application-layer solutions in an information-centric network or as application-layer information sharing/communication protocols between collaborators.
An analysis of 4D variational data assimilation and its application
Authors: L. Jiang, C. C. Douglas
Venue: Computing (2009)

In this paper, we give an analysis and a general procedure for 4D variational data assimilation (4D-Var). In functional partial differential equation setting, the adjoint equation method, sensitivity analysis, and multicomponent operator splitting are discussed. Nonlinear optimization methods and convergence analysis are also investigated for 4D-Var.
FGMRES preconditioning by symmetric/skew-symmetric decomposition of generalized stokes problems
Authors: Dany De Cecchis, Hilda López, Brígida Molina
Venue: Mathematics and Computers in Simulation (2009)

The generalized Stokes problem is solved for non-standard boundary conditions. This problem arises after time semi-discretization by ALE method of the Navier-Stokes system, which describes the flow of two immiscible fluids with similar densities but different viscosities in a horizontal pipe, when modeling heavy crude oil transportation. We discretized the generalized Stokes problem in space using the ''Mini'' finite element. The inf-sup condition is proved when the interface between the two fluids and its discretization match exactly. The linear system obtained after discretization is solved using different iterative Krylov methods with and without preconditioning. Numerical experiments with different meshes are presented as well as comparisons between the methods considered. The results suggest that FGMRES and a preconditioning technique based on symmetric/skew-symmetric decomposition is a promising candidate for solving large scale generalized Stokes problem.
Analysis and design of a wide micro beam as a pressure gauge for high sensitivity MEMS fingerprint sensors
Authors: Mitra Damghanian, Burhanuddin Yeop Majlis
Venue: Microsystem Technologies (2009)

Sensitivity improvement is a challenging issue in miniature pressure sensors. To improve sensitivity and linearity of the device, a wide micro beam structure has been proposed to gauge capacitance changes caused by the applied pressure in a capacitive MEMS fingerprint sensor. Bending behavior of the device and the effect of the protrusion geometry on partial loading of the micro beam has been analytically investigated. Based on the idea of efficient loading of the wide micro beam, an improved design for the capacitive fingerprint sensor is developed to increase sensitivity. It is shown with FEM simulations that the micro wide beam design is superior to the common membrane based MEMS fingerprint sensors in terms of sensitivity and linearity.
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
Authors: Selin Özpeynirci, Meral Azizoğlu
Venue: Computers and Operations Research (2009)

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. Automated machines are assumed to have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. The weight of an operation may represent its profit, processing load, relative priority. Several upper bounding procedures have been taken into account. The results of computational tests have revealed that the proposed upper bounding procedures produce satisfactory solutions in reasonable CPU times. We suggest using some of the bounds when the quality of the solutions is more important than the speed of achieving them and some others when the speed is more important than the quality.
Growth of III-V semiconductor nanowires by molecular beam epitaxy
Authors: F. Jabeen, S. Rubini, F. Martelli
Venue: Microelectronics Journal (2009)

We present here the growth of GaAs, InAs and InGaAs nanowires by molecular beam epitaxy. The nanowires have been grown on different substrates [GaAs(001), GaAs(111), SiO2 and Si(111)] using gold as the growth catalyst. We show how the different substrates affect the results in terms of nanowire density and morphology. We also show that the growth temperature for the InGaAs nanowires has to be carefully chosen to obtain homogeneous alloys.
Multi-label Classification with ART Neural Networks
Authors: Elena P. Sapozhnikova
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Multi-label Classification (MC) is a classification task with instances labeled by multiple classes rather than just one. This task becomes increasingly important in such fields as gene function prediction or web-mining. Early approaches to MC were based on learning independent binary classifiers for each class and combining their outputs in order to obtain multi-label predictions. Alternatively, a classifier can be directly trained to predict a label set of an unknown size for each unseen instance. Recently, several direct multi-label learning algorithms have been proposed. This paper investigates a novel method to solve a MC task by using an Adaptive Resonance Theory (ART) neural network. A modified Fuzzy ARTMAP algorithm Multi-Label-FAM (ML-FAM) was applied to classification of multi-label data. The obtained preliminary results on the Yeast data set and their comparison with the results of existing algorithms demonstrate the effectiveness of the proposed approach.
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Authors: Hari Krovi, Martin Rötteler
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in physics and play an important role in the theory of quantum error-correcting codes. Our algorithm is based on non-commutative Fourier analysis of coset states which are quantum states that arise from a given black-box function. We use Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations. Furthermore, we use a new technique of changing labels of irreducible representations to obtain low-dimensional irreducible representations in the decomposition process. A feature of the presented algorithm is that in each iteration of the algorithm the quantum computer operates on two coset states simultaneously. This is an improvement over the previously best known quantum algorithm for these groups which required four coset states.
From participation to e-participation: the German case
Authors: Peter Mambrey
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper informs about the public policies on e-Participation in Germany. At the moment e-Participation happens in political niche arenas and does not have real impact or importance on political decision-making. Activists and researchers promote the field of e-Participation but not the institutional political system. Thus no coherent strategies or public policies exist by political bodies at federal or state level. The e-Participation experiments practically show the options and risks of innovations of the political system in regard to better represent or empower the citizens but do not allow a generalization of the often somewhat sobering results. Currently the German federal government shows rising awareness for e-Participation but sees it as an integrated part of a representative e-Government. Driving forces of innovation, the political system towards e-Participation comprises activists and civil society movements simply using web 2.0 tools and techniques for their purposes: better organization, rising awareness and gaining power.
A model-based aspect-oriented framework for building intrusion-aware software systems
Authors: Zhi Jian Zhu, Mohammad Zulkernine
Venue: Information and Software Technology (2009)

Security is a critical issue for software systems, especially for those systems which are connected to networks and the Internet, since most of them suffer from various malicious attacks. Intrusion detection is an approach to protect software against such attacks. However, security vulnerabilities that are exploited by intruders cut across multiple modules in software systems and are difficult to address and monitor. These kinds of concerns, called cross-cutting concerns, can be handled by aspect-oriented software development (AOSD) for better modularization. A number of works have utilized AOSD to address security issues of software systems, but none of them has employed AOSD for intrusion detection. In this paper, we propose a model-based aspect-oriented framework for building intrusion-aware software systems. We model attack scenarios and intrusion detection aspects using an aspect-oriented Unified Modeling Language (UML) profile. Based on the UML model, the intrusion detection aspects are implemented and woven into the target system. The resulting target system has the ability to detect the intrusions automatically. We present an experimental evaluation by applying this framework for some of the most common attacks included in the Web Application Security Consortium (WASC) web security threat classification. The experimental results demonstrate that the framework is effective in specifying and implementing intrusion detection and can be applied for a wide range of attacks.
Quantitative Cryptanalysis of Six-Round DES Using Evolutionary Algorithms
Authors: Fan Yang, Jun Song, Huanguo Zhang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper presents a new approach integrated evolutionary optimization into cryptanalysis techniques. The idea that relies on key likelihood estimation and linearity approximation is used to design the fitness function model. The experimental results indicate that the above techniques are effective to attack the 49 bits key and the 42 bits key for DES cipher reduced to six rounds or less. Furthermore, preliminary analyses indicate that the designing of fitness function and the capability of resisting linear approximation are the key factors affecting evolutionary cryptanalysis.
Size Versus Stability in the Marriage Problem
Authors: Péter Biró, David F. Manlove, Shubham Mittal
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

Given an instance I of the classical Stable Marriage problem with Incomplete preference lists (smi), a maximum cardinality matching can be larger than a stable matching. In many large-scale applications of smi, we seek to match as many agents as possible. This motivates the problem of finding a maximum cardinality matching in I that admits the smallest number of blocking pairs (so is &ldquo;as stable as possible&rdquo;). We show that this problem is NP-hard and not approximable within n 1&thinsp;&minus;&thinsp;&epsilon; , for any &epsilon;>&thinsp;0, unless P=NP, where n is the number of men in I. Further, even if all preference lists are of length at most 3, we show that the problem remains NP-hard and not approximable within &delta;, for some &delta;>&thinsp;1. By contrast, we give a polynomial-time algorithm for the case where the preference lists of one sex are of length at most 2.
Research on the Technological Innovation Diffusion Based on the Self-organization Theory: The Case of China Communication Industry
Authors: Rui Li, Xiaofeng Ju
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Technological innovation is a complex system. There are complex characteristic of openness, dynamic, nonlinearity, fluctuation and indetermination in the system. From the perspective of system theory this paper illuminates the self-organization characteristics of technological innovation system and analyzes the self-organization mechanisms of the innovation process and characteristics of instability, the multiplicity (branch), the sudden change and stochastic “the fluctuation” and constructs the self-organization model of technological innovation then carries on the confirmation with statistical software to the model fitting degree and the model parameters, using the data of China communication market, obtains the quite satisfied result. This model has realized the integration of the natural sciences and the social sciences, and has more in-depth understanding about the achieve mechanism and the evolutionary process of the technological innovation and diffusion.
A spatiotemporal data model for river basin-scale hydrologic systems
Authors: Jonathan L. Goodall, David R. Maidment
Venue: International Journal of Geographical Information Science (2009)

Despite a long history of synergy, current techniques for integrating Geographic Information System (GIS) software with hydrologic simulation models do not fully utilize the potential of GIS for modeling hydrologic systems. Part of the reason for this is a lack of GIS data models appropriate for representing fluid flow in space and time. Here we address this challenge by proposing a spatiotemporal data model designed specifically for large-scale river basin systems. The data model builds from core concepts in geographic information science and extends these concepts to accommodate mathematical representations of fluid flow at a regional scale. Space-time is abstracted into three basic objects relevant to hydrologic systems: a control volume, a flux and a flux coupler. A control volume is capable of storing mass, energy or momentum through time, a flux represents the movement of these quantities within space-time and a flux coupler insures conservation of the quantities within an overall system. To demonstrate the data model, a simple case study is presented to show how the data model could be applied to digitally represent a river basin system.
Partitions of &#8484n into arithmetic progressions
Authors: William Y. C. Chen, David G. L. Wang, Iris F. Zhang
Venue: European Journal of Combinatorics (2009)

We introduce the notion of arithmetic progression blocks or m-AP-blocks of &lfloor;n, which can be represented as sequences of the form (x,x+m,x+2m,...,x+(i-1) m)(modn). Then we consider the problem of partitioning &lfloor;n into m-AP-blocks. We show that subject to a technical condition, the number of partitions of &lfloor;n into m-AP-blocks of a given type is independent of m, and is equal to the cyclic multinomial coefficient which has occurred in Waring's formula for symmetric functions. The type of such a partition of &lfloor;n is defined by the type of the underlying set partition. We give a combinatorial proof of this formula and the construction is called the separation algorithm. When we restrict our attention to blocks of sizes 1 and p+1, we are led to a combinatorial interpretation of a formula recently derived by Mansour and Sun as a generalization of the Kaplansky numbers. By using a variant of the cycle lemma, we extend the bijection to deal with an improvement of the technical condition recently given by Guo and Zeng.
Identifying disgruntled employee systems fraud risk through text mining: A simple solution for a multi-billion dollar problem
Authors: Carolyn Holton
Venue: Decision Support Systems (2009)

Occupational fraud is a $652 billion problem to which disgruntled employees are a major contributor. Much security research addresses reducing fraud opportunity and increasing fraud detection, but detecting motivational factors like employee disgruntlement is less studied. The Sarbanes-Oxley Act requires that companies archive email, creating an untapped resource for deterring fraud. Herein, protocols to identify disgruntled communications are developed. Messages cluster well according to disgruntled content, giving confidence in the value of email for this task. A highly accurate naive Bayes model predicts whether messages contain disgruntled communications, providing extremely relevant information not otherwise likely to be revealed in a fraud audit. The model can be incorporated into fraud risk analysis systems to improve their ability to detect and deter fraud.
Computational Analysis of Expected Climate Change in the Carpathian Basin Using a Dynamical Climate Model
Authors: Judit Bartholy, Rita Pongrácz, Ildikó Pieczka, Péter Kardos, Adrienn Hunyady
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

For analyzing the possible regional climate change in the Carpathian Basin, model PRECIS has been adapted, which is the hydrostatic regional climate model HadRM3P developed at the UK Met Office, Hadley Centre, and nested in HadCM3 GCM. First, control run simulations (1961-1990) of the PRECIS model (with two different sets of boundary conditions) are analyzed. In the validation, seasonal temperature and precipitation mean values from the CRU datasets are used. According to the results, model PRECIS slightly overestimates the temperature and underestimates the precipitation. Then, model results for the periods 2071-2100 (using SRES A2 scenario) and 1961-1990 (as the reference period) are compared. The results suggest that the temperature increase expected in the Carpathian Basin may considerably exceed the global warming rate. The climate of this region is expected to become wetter in winter and drier in the other seasons.
Implementable mse-optimal dynamic partial-overlapping batch means estimators for steady-state simulations
Authors: Wheyming Tina Song, Mingchang Chih
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Estimating the variance of the sample mean from a stochastic process is essential in assessing the quality of using the sample mean to estimate the population mean which is the fundamental question in simulation experiments. Most existing studies for estimating the variance of the sample mean from simulation output assume simulation run length is known in advance. This paper proposes an implementable batch-size selection procedure for estimating the variance of the sample mean without requiring that the sample size or simulation run length a priori.
A web interface for the HyperSim-G Grid simulation package
Authors: Fatos Xhafa, Leonard Barolli, David Martos
Venue: International Journal of Web and Grid Services (2009)

In this paper we present the design and implementation of a web interface for the HyperSim-G Grid simulation package. The web interface aims to facilitate the work of users with the Grid simulator package. Thus, through the web interface, users can remotely run their own simulations, trace the state of the simulations, export the simulation results and graphically represent them for a better understanding. Also, the interface facilitates the configuration of many parameters of the simulator as opposed to the straightway command line running of the simulator. Moreover, all the simulation results are stored at the server side and can be consulted and extracted at any time either in pdf or spreadsheet form. The web application is based on a Condor queueing system running on a cluster to allow a large number of users to run the simulator simultaneously.
Dynamic dispatching in job class scheduled systems
Authors: Jon C. Strauss
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Many different approaches have been attempted to the problem of controlling the processing of a multiprogramming computer system so as to improve performance. In Reference 1, Bowdon, et al. simulate an IBM 360/75 under OS with HASP and adjust job initiation priority based on estimates of processing time to effect a shortest-processing-time discipline. Their simulation demonstrates a dramatic increase in thruput and decrease in turnaround as a result of this job scheduling modification.