ppxscal/embedding_network huggingface dataset:
Intelligent Agent Assisted Handover in WLAN and Cellular Networks
Authors: Li-Der Chou, Wei-Cheng Lai, Chen-Han Lin, Yen-Cheng Lin, Chin-Min Huang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper we invent a new architecture for intelligent agent pre-authentication and apply it to seamless handover of VoIP services in integrated WLAN/Cellular networks. On the other hand, we incorporate agent-based key distribution into EAP-SIM based AAA protocols for WLAN. Our goal is minimizing the probability of SIP calls blocking resulting from handoff delay. This paper improves the performance of the existing handover in call drop rates so as to reduce the signaling traffic in wireless networks. The use of intelligent agents and negotiation for better link quality is discussed.
Reflection of generalized thermoelastic waves from a solid half-space under hydrostatic initial stress
Authors: Baljeet Singh, Ajay Kumar, Jagdish Singh
Venue: Applied Mathematics and Computation (2006)

The basic governing equations for isotropic and homogeneous generalized thermoelastic media under hydorstatic initial stress are formulated in context of Lord-Shulman theory. These governing equations are solved analytically to obtain the dimensional velocities in x-y plane. It is shown that there exists three plane waves, namely, thermal wave, P wave and SV wave. Reflection from insulated stress-free surface is studied to obtain the reflection coefficients of the reflected waves for the incidence of thermal wave. The numerical computations are carried out for a particular model. The Effect of hydrostatic initial stress is observed on these reflected waves.
Shape calibration for a nominally linear equispaced array
Authors: J. J. Fuchs
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The author considers a thin flexible line array of equispaced hydrophones that is towed through the sea, and develops a procedure that allows testing of the straightness of the array. The motion of the towing ship, the currents of the ocean and other forces induce deformations on the array and affect the performance of spatial processing of the data developed under the assumption that the array is straight. When the ship is maneuvering, the processing is generally turned off for long periods of time, an extremely penalizing situation that can be overcome by applying the procedure described to determine the maximum size of admissible sub-arrays on which the standard processing can be pursued.
Morphological Priming in Spanish Verb Forms: An ERP Repetition Priming Study
Authors: Antoni Rodriguez-Fornells, Thomas F. Münte, Harald Clahsen
Venue: Journal of Cognitive Neuroscience (2002)

The ERP repetition priming paradigm has been shown to be sensitive to the processing differences between regular and irregular verb forms in English and German. The purpose of the present study is to extend this research to a language with a different inflectional system, Spanish. The design (delayed visual repetition priming) was adopted from our previous study on English, and the specific linguistic phenomena we examined are priming relations between different kinds of stem (or root) forms. There were two experimental conditions: In the first condition, the prime and the target shared the same stem form, e.g., "ando-andar" &lsqb;I walk-to walk&rsqb;, whereas in the second condition, the prime contained a marked (alternated) stem, e.g., "duermo-dormir" &lsqb;I sleep-to sleep&rsqb;. A reduced N400 was found for unmarked (nonalternated) stems in the primed condition, whereas marked stems showed no such effect. Moreover, control conditions demonstrated that the surface form properties (i.e., the different degree of phonetic and orthographic overlap between primes and targets) do not explain the observed priming difference. The ERP priming effect for verb forms with unmarked stems in Spanish is parallel to that found for regularly inflected verb forms in English and German. We argue that effective priming is possible because prime target pairs such as "ando-andar" access the same lexical entry for their stems. By contrast, verb forms with alternated stems (e.g., "duermo") constitute separate lexical entries, and are therefore less powerful primes for their corresponding base forms.
Teaching new teammates
Authors: Doran Chakraborty, Sandip Sen
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Knowledge transfer between expert and novice agents is a challenging problem given that the knowledge representation and learning algorithms used by the novice learner can be fundamentally different from and inaccessible to the expert trainer. We are particularly interested in team tasks, robotic or otherwise, where new teammates need to replace currently indisposed team member(s). We are interested in a general knowledge transfer framework where existing team members or experts can train a new agent to follow its role in team coordination by using exemplars of desirable behavior. Each such exemplar presents a team situation and a preferred action. We envisage an iterative training process where the trainer selects more exemplars in the next iteration based on the errors made by the learner in action choices for test exemplars presented in the current iteration. Such an iterative, exemplar based generic knowledge transfer scheme can be used by agents using arbitrary knowledge representation and learning methods. We evaluate the success of training new teammates in the well-known pursuit problem, where some of the current set of expert predators is being replaced by new ones with no a priori hunting knowledge. Experimental results demonstrate the robustness of our knowledge transfer scheme with a graceful performance degradation.
Discrete event simulation in Sasol: petrochemical industry
Authors: Marlize Meyer
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Discrete event simulation, and in this case Arena&reg;, is a tool not traditionally used in continuous environments for design purposes. At Sasol, a petrochemical company, Arena&reg; is used in a continuous environment during design of modifications to existing plants and for the identification of infrastructure constraints in fuel blending scenarios. In these areas the value of Arena&reg; is to evaluate the required changes in the integrated environment dynamically. Interactions between plants can be considered and the influence of integrated operation on planned throughput can be cal-culated. The impact of failures and scheduled maintenance in the plant modifications can be estimated and any adjustment to infrastructure or plant capacity can be made before money is invested. This presentation discusses examples where Arena&reg; is used in fuel blending and where Arena&reg; is used to calculate plant throughput given historic variation, plant availability and interactions between several plants. 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
Reaching Byzantine Agreement in a Processor Fallible Virtual Subnet Network
Authors: S. C. Wang, K. Q. Yan, G. Y. Zheng, C. T. Chih
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Mobile Ad-hoc Network (MANET) is practical more and more due to it can provide processor joins to the network or leaves away anytime with noninfrastructure. Further, the fault-tolerance and reliability of the MANET has also been an important topic. The problem of reaching agreement in the distributed system is one of the most important issues to design a fault-tolerance system. In previous works, reach a common agreement among correct processors to cope with the influence from faulty components is significant in a fault-tolerance system. In this paper, the agreement problem is revisited in a MANET, which the processors maybe subject to malicious failure.
Memory reference reuse latency: Accelerated warmup for sampled microarchitecture simulation
Authors: R. S. Burugula, K. Skadron
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

This paper proposes to speedup sampled microprocessor simulations by reducing warmup times without sacrificing simulation accuracy. It exploiting the observation that of the memory references that precede a sample cluster, references that occur nearest to the cluster are more likely to be germane to the execution of the cluster itself. Hence, while modeling all cache and branch predictor interactions that precede a sample cluster would reliably establish their state, this is overkill and leads to long-running simulations. Instead, accurately establishing simulated cache and branch predictor state can be accomplished quickly by only modeling a subset of the memory references and control-flow instructions immediately preceding a sample cluster. Our technique measures memory reference reuse latencies (MRRLs) - the number of completed instructions between consecutive references to each unique memory location - and uses these data to choose a point prior to each cluster to engage cache hierarchy and branch predictor modeling. By starting cache and branch predictor modeling late in the pre-cluster instruction stream, we were able to reduce overall simulation running times by an average of 90.62% of the maximum potential speedup (accomplished by performing no pre-cluster warmup at all), while generating an average error in IPC of less than 1%, both relative to the IPC generated by warming up all pre-cluster cache and branch predictor interactions.
Applying a Twofold Quality Model: Producing Groundwork for System Specific Attribute Models
Authors: Auvo Finne
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

This paper applies a twofold quality model, presented in a previous article, to produce groundwork for system and project specific attribute models. Evidence to support the model is sought from a case study of an African EMIS implementation that links the paper to research on information and communication technology for development. The paper is a dense extract from a full article. All visualizations are omitted for the sake of brevity.
Sublinear-time approximation algorithms for clustering via random sampling
Authors: Artur Czumaj, Christian Sohler
Venue: Random Structures Algorithms (2007)

We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, we consider the following simple sampling scheme: select a small sample set of input points uniformly at random and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems.The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach, we obtain for these problems the first time approximation algorithms that have running time independent of the input size, and depending on k and the diameter of the metric space only. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007A preliminary extended abstract of this work appeared in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 396407, 2004.
A Market-Based Adaptation for Resolving Competing Needs for Scarce Resources
Authors: Rui Wang, Tracy Mullen, Viswanath Avasarala, John Yen
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The dynamic nature of many real-world domains (e.g., military, emergency first response and hurricane relief, etc) requires adaptive resource allocation to respond to changes in the environment that trigger additional resource requirements. Since the total resources are limited, there are often conflicts among various tasks regarding their resource needs. Thus, resources must be reallocated in order to maximize global utility for the current situation. This problem is further complicated when scarce resources are owned by distributed teams, each of which needs to allocate resources among tasks assigned to them, because each team has limited information about the other teams' resources and states. In this paper, we propose a market-based approach that uses an agent-based auction mechanism to enable teams to communicate and coordinate their utility information about possibly competing resource needs. As a result, the teams can collaboratively assess trade-offs among competing needs to allocate resources efficiently.
Block adaptive IIR filters using preconditioned conjugate gradients for orthogonalization
Authors: A. W. Hull, W. K. Jenkins
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The method of preconditioned conjugate gradients (PCG) is introduced as an accelerator for simple IIR algorithms to significantly increase their rate of convergence without dramatically adding to their complexity. This paper develops a block Newton-type adaptive IIR digital filter with complexity O(log(N)). The proposed algorithm exploits a structured approximation to the Hessian which permits the application of a fast preconditioned conjugate gradient optimization method. In this novel formulation, the identification problem of the IIR coefficients separates into two subproblems, each of which may be solved by application of fast adaptive FIR techniques. Present IIR algorithms require greater computational cost, or converge more slowly. It is the adoption of fast PCG which permits the development of an O(log(N)) adaptive algorithm. The PCG method manipulates an approximation of the Hessian matrix to form an orthogonalizing update term for the IIR LMS algorithm. Rapid convergence follows, and the method is robust with respect to fixed-point instability. The use of preconditioned conjugate gradients in the Gauss-Newton update leads naturally to the application of the planar least squares inverse to bound the poles of the adaptive system by projecting an unstable denominator onto a stable polynomial. This technique is invoked whenever the output of the adaptive filter exceeds a certain threshold. This approach provides a computationally efficient means to ensure robust IIR adaptive behavior.
Extensible detection and indexing of highlight events in broadcasted sports video
Authors: Dian W. Tjondronegoro, Yi-Ping Phoebe Chen, Binh Pham
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Content-based indexing is fundamental to support and sustain the ongoing growth of broadcasted sports video. The main challenge is to design extensible frameworks to detect and index highlight events. This paper presents: 1) A statistical-driven event detection approach that utilizes a minimum amount of manual knowledge and is based on a universal scope-of-detection and audio-visual features; 2) A semi-schema-based indexing that combines the benefits of schema-based modeling to ensure that the video indexes are valid at all time without manual checking, and schema-less modeling to allow several passes of instantiation in which additional elements can be declared. To demonstrate the performance of the events detection, a large dataset of sport videos with a total of around 15 hours including soccer, basketball and Australian football is used.
Error Minimising Pipeline for Hi-Fidelity, Scalable Geospatial Simulation
Authors: Chris Thorne
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

The geospatial category of simulations is used to show how origin centric techniques can solve a number of accuracy related problems common to 3D computer graphics applications. Previous work identified how poor understanding of floating point related issues lead to performance, architectural and accuracy problems. This paper extends that work by including time error minimisation, lazy evaluation and progressively refined fidelity and looks at performance trade-offs. The application of these techniques to a geospatial simulation pipeline is described in order to provide more concrete guidance on how to use them.
Risk in Trusted Decentralized Communications
Authors: Omar Khadeer Hussain, Elizabeth Chang, Farookh Khadeer Hussain, Tharam S. Dillon, Ben Soh
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Risk is associated with almost every activity that is undertaken on a daily life. Risk associated with Trust, Security and Privacy. Risk is associated with transactions, businesses, information systems, environments, networks, partnerships, etc. Generally speaking, risk signifies the likelihood of financial losses, human casualties, business destruction and environmental damages. Risk indicator gives early warning to the party involved and helps avoid deserters. Until now, risk has been discussed extensively in the areas of investment, finance, health, environment, daily life activities and engineering. However, there is no systematic study of risk in Decentralised communication, which involves e-business, computer networks and service oriented environment. In this paper, we define risk associated with trusted communication in e-business and e-transactions; provide risk indicator calculations and basic application areas.
Performance analysis of untraceability protocols for mobile agents using an adaptable framework
Authors: Rafał Leszczyna, Janusz Górski
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Recently we had proposed two untraceability protocols for mobile agents and began investigating their quality. We believe that quality evaluation of security protocols should extend a sole validation of their security and cover other quality aspects, primarily their efficiency. Thus after conducting a security analysis, we wanted to complement it with a performance analysis. For this purpose we developed a performance evaluation framework, which, as we realised, with certain adjustments, can be applied to evaluate performance of a whole class of security protocols for mobile agents. This class contains the protocols in which each host on the agent's route is responsible for providing a security function, and, inter alia, includes a big variety of integrity checking schemas and accountability mechanisms for mobile agents such as Lee's Partial Results Authentication Codes or family of Karjoth's et al protocols for protection of computation results of free-roaming agents. Finally, we used the framework to evaluate efficiency of our Untraceability Protocol I. In this paper we present the framework and the results of the evaluation.
A Parallel Method for Backward Parabolic Problems Based on the Laplace Transformation
Authors: Jinwoo Lee, Dongwoo Sheen
Venue: SIAM Journal on Numerical Analysis (2006)

A parallel method for time discretization of backward parabolic problems is proposed. The problem is reformulated to a set of Helmholtz-type problems with a parameter on a suitably chosen contour in the complex plane. After solving the resulting elliptic equations, which can be solved in parallel, we obtain a regularized solution with high frequency terms cut off by the inverse Laplace transforms without requiring the knowledge of the eigenfunctions of the differential operator. Since the regularized solution is obtained without artificial perturbation and high frequency components of the noise are suppressed, the quality of the solution is improved significantly compared to those obtained by other methods. Two different numerical inversions of Laplace transforms, with an arbitrary high order of accuracy and spectral accuracy, respectively, are used. Error estimates and numerical examples are presented.
An approximate method for numerical solution of fractional differential equations
Authors: Pankaj Kumar, Om Prakash Agrawal
Venue: Signal Processing (2006)

This paper presents a numerical solution scheme for a class of fractional differential equations (FDEs). In this approach, the FDEs are expressed in terms of Caputo type fractional derivative. Properties of the Caputo derivative allow one to reduce the FDE into a Volterra type integral equation. Once this is done, a number of numerical schemes developed for Volterra type integral equation can be applied to find numerical solution of FDEs. In this paper the total time is divided into a set of small intervals, and between two successive intervals the unknown functions are approximated using quadratic polynomials. These approximations are substituted into the transformed Volterra type equation to obtain a set of equations. Solution of these equations provides the solution of the FDE. The method is applied to solve two types of FDEs, linear and nonlinear. Results obtained using the scheme presented here agree well with the analytical solutions and the numerical results presented elsewhere. Results also show that the numerical scheme is stable.
Online Recovery of a Distributed Database from Malicious Attack
Authors: A. Chakraborty, M. K. Garg, A. K. Majumdar, S. Sural
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

In this paper, we consider the problem of recovery from committed malicious transactions in distributed databases. We define several useful dependency relations among transactions and based on them present an online recovery scheme for restoring the consistency of a database.
Importance sampling techniques for estimating the bit error rate in digital communication systems
Authors: Wheyming Song, Wenchi Chiu, David Goldsman
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We are interested in estimating the bit error rate (BER) for signal transmission in digital communication systems. Since BERs tend to be extremely small, it is difficult to obtain precise estimators based on the use of crude Monte Carlo simulation techniques. In this paper, we review, expand upon, and evaluate a number of importance sampling variance reduction techniques for estimating the BER. We find that mixtures of certain "tailed" distributions with a uniform distribution produce estimators that are at least competitive with those in the literature. Our comparisons are based on analytical calculations and lay the groundwork for the evaluation of more general mixture distributions.