ppxscal/embedding_network huggingface dataset:
Agile Coaching in British Telecom: Making Strawberry Jam
Authors: Sean Hanly, Laura Waite, Linsley Meadows, Roger Leaton
Venue: Proceedings of the conference on AGILE 2006 (2006)

When BT began to look at how you transform an organization of approximately 14,000 people to become an Agile organisation a key challenge faced was how to support this size of a transformation from a coaching perspective i.e. how do you leverage a relatively small finite coaching resource so that it can be effective. BT drew inspiration from the "Law of Strawberry Jam"and intentionally set out to build internal Agile coaching capability. Based on positive experience with "Pair Coaching" an "Apprentice Coaching" model was chosen as an effective approach for building this internal coaching capability. This provided a rich and experience based learning environment while also allowing the group to be effective as it engaged with the BT Exact organisation.
Effect of Creative Lesson by using Cyber Theater Gallery
Authors: Hiroshi Matsuda, Yoshiaki Shindo
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

To improve and to aid the courses of computer-based education in elementary school, we have developed new educational support tool named Cyber Theater. Cyber Theater provides the capability of easy making the 3D-CG animation of pupil's story by using script language named Cyber Theater Scenario Language (CTSL). We also hope that high school pupils are able to make their original 3D-CG animation stories. We call it Creative Lesson. In this paper, we report the detail of CTSL, the results of Creative Lesson.
A Picture Language Translator
Authors: Hiroshi Migiyama, Taiichiro Hayashi, Nikolay Mirenkov
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Picture languages are on attractive basis for communication. However, it is difficult to represent and understand accurate meaning in such languages. So, we are developing an approach where pictures with captions are allocated on positions of a 2D structure and special translators generate corresponding sentences in natural languages. These positions have pre-defined meaning and represent a multimedia hieroglyph. The hieroglyph is a complex picture (a multimedia sentence) including more simple pictures (multimedia words). In this approach the "hieroglyphic writing" is reduced to selecting appropriate multimedia words through special interface panels without necessity to use keyboards. As a result, the users can send and receive multimedia messages, though they have never used a computer before. In this paper, methods and implementation techniques for translating multimedia hieroglyphs into English are explained.
On computing ordN(2) and its application
Authors: Lihua Liu, Zhengjun Cao
Venue: Information and Computation (2006)

Shor proposed a polynomial time algorithm for prime factorization on quantum computers. For a given number N, he gave an algorithm for finding the order r of an element x in the multiplicative group (mod N). The method succeeds because factorization can be reduced to finding the order of an element using randomization. But the algorithm has two shortcomings, the order of the number must be even and the output might be a trivial factor. Actually, these drawbacks can be overcome in a particular case, i.e., N is an RSA modulus. In this paper, we propose a new quantum algorithm for factoring RSA modulus without the two drawbacks. Moreover, we show that the cost of the algorithm mainly depends on the calculation of ordN(2).
Self-adaptive time integration of flux-conservative equations with sources
Authors: Y. A. Omelchenko, H. Karimabadi
Venue: Journal of Computational Physics (2006)

We present a novel, flux-conserving, asynchronous method for the explicit time integration of multi-scale, flux-conservative partial differential equations with source terms. Unlike the conventional explicit and implicit integration schemes, it is based on a discrete-event simulation paradigm, which describes time advance in terms of increments to physical quantities and causality rules rather than time stepping. This method exerts self-adaptive control over local update rates of solution by predicting and correcting changes to simulation variables in accordance with local physical scales. The discrete-event simulation paradigm is independent of the underlying spatial mesh and thus can be incorporated into block-structured and unstructured mesh refinement techniques. The effectiveness and robustness of the new method is demonstrated on a number of one-dimensional, uniform mesh models based on diffusion-convection reaction equations. The event-driven integration reduces numerical approximation errors due to large local time derivatives, prevents explosive numerical instabilities in locally super-Courant calculations and automatically reduces the CPU overhead associated with stiff terms and inactive regions in computation space.
Is problem solving, or simulation model solving, mission critical?: the panel reloads
Authors: Ray J. Paul, Richard Nance, Mark Elder, Ernest H. Page, Jerzy Rozenblit
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Discussion from panellists representing different simulation schools of thought: Software engineering, standardised Simulation methodologies, Simulation software vendors, traditional academic, and a typical Simulation consumer/user.
Tagging and Referrals in the EVM Architecture
Authors: Mariusz Nowostawski, Martin Purvis
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The Evolvable Virtual Machine architecture (EVM) is a computing architecture based on the notion of distributed interactive asynchronously communicating agents. The EVM provides a massively decentralised and distributed asynchronous framework for experimenting with and studying properties of artificial evolutionary and open multi-agent systems. It can be used for multi-task learning and for automated program discovery. In this article, we discuss the template-based tagging mechanism and referrals extension to the EVM architecture. The new tagging and referrals mechanisms expands the information processing capabilities of the EVM architecture. Referrals provide more scalable automated search mechanisms that enable faster knowledge dissemination among distant EVM agents, or cells. In addition, referrals can be used as one of the mechanisms to combat parasitism among the EVM cells.
Trust and honour in information-based agency
Authors: Carles Sierra, John Debenham
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

An argumentation based negotiation model is supported by information theory. Argumentative dialogues change the models of agents with respect to ongoing relationships. Trust and Honour are key components. Trust measures expected deviations of behaviour in the execution of commitments. Honour measures the expected integrity of the arguments exchanged. We understand rhetorical moves in dialogues as actions to project the current relationships into the future.
An adaptive incremental LBG for vector quantization
Authors: F. Shen, O. Hasegawa
Venue: Neural Networks (2006)

This study presents a new vector quantization method that generates codewords incrementally. New codewords are inserted in regions of the input vector space where the distortion error is highest until the desired number of codewords (or a distortion error threshold) is achieved. Adoption of the adaptive distance function greatly increases the proposed method's performance. During the incremental process, a removal-insertion technique is used to fine-tune the codebook to make the proposed method independent of initial conditions. The proposed method works better than some recently published efficient algorithms such as Enhanced LBG (Patane, & Russo, 2001) for traditional tasks: with fixed number of codewords, to find a suitable codebook to minimize distortion error. The proposed method can also be used for new tasks that are insoluble using traditional methods: with fixed distortion error, to minimize the number of codewords and find a suitable codebook. Experiments for some image compression problems indicate that the proposed method works well.
Recognition of Handwritten Kannada Numerals
Authors: N. Sharma, U. Pal, F. Kimura
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

This paper deals with a quadratic classifier based scheme for the recognition of off-line handwritten numerals of Kannada, an important Indian script. The features used in the classifier are obtained from the directional chain code information of the contour points of the characters. The bounding box of a character is segmented into blocks and the chain code histogram is computed in each of the blocks. Here we have used 64 dimensional and 100 dimensional features for a comparative study on the recognition accuracy of our proposed system. This chain code features are fed to the quadratic classifier for recognition. We tested our scheme on 2300 data samples and obtained 97.87% and 98.45% recognition accuracy using 64 dimensional and 100 dimensional features respectively, from the proposed scheme using five-fold cross-validation technique.
Effect of Finite Sample Size in Content-Based Image Retrieval
Authors: Gita Das, Sid Ray
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Finite sample size has always been a problem in determining the retrieval accuracy of a Content-Based Image Retrieval (CBIR) system. Though a good amount of research has been done in the statistical pattern recognition field, no such effort is shown in relation to CBIR. In this paper, we considered image retrieval as a dichotomous classification problem and studied the effect of sample size on the retrieval accuracy. We reported experimental results and analysis with two different image databases of size 2000 and 500, both having 10 semantic categories. For both data sets, we showed the variation of precision with sample size. We also studied the effect of sample size on retrieval accuracy as Relevance Feedback (RF) is applied. For both data sets, the nett improvement in precision with RF increases with sample size.
A new approximation algorithm for labeling points with circle pairs
Authors: Minghui Jiang
Venue: Information Processing Letters (2006)

We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such that each site touches two circles and the circle radius is maximized. We present a new approximation algorithm for this problem that runs in O(n log n + n log 1/ε) time and O(n) space and achieves an approximation factor of (2 + √3 + 2√4+ √3)/4 +√3)+ε(≈ 1.486 + ε), which improves the previous best bound of 1.491 + ε.
XORs in the air: practical wireless network coding
Authors: Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft
Venue: ACM SIGCOMM Computer Communication Review (2006)

This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that COPE largely increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
An overlapping task assignment scheme for hierarchical coarse-grain task parallel processing: Research Articles
Authors: Akimasa Yoshida
Venue: Concurrency and Computation: Practice Experience (2006)

This paper proposes an overlapping task assignment scheme for the hierarchical coarse-grain task parallel processing on multiprocessor systems. In coarse-grain task parallel processing, the compiler extracts parallelism among coarse-grain tasks automatically and the coarse-grain tasks are assigned to processor clusters at runtime. However, several programs may decrease the processor-cluster utilization factor owing to lack of parallelism inside each coarse-grain task. Therefore, in order to improve the processor-cluster utilization factor, this paper proposes the execution scheme with overlapping task assignment whose dynamic scheduler can assign several coarse-grain tasks to a processor cluster simultaneously. Also, the performance evaluations by simulations and executions on SMP showed that the proposed scheme could reduce the execution time remarkably. Copyright &copy; 2006 John Wiley & Sons, Ltd.
The statistics of the fractional moments: is there any chance to "read quantitatively" any randomness?
Authors: R. R. Nigmatullin
Venue: Signal Processing (2006)

The statistical meaning of higher ΔN(p) (p = 1,2,...) and fractional ΔN(p) (0<p<∞) moments for an arbitrary random sequence of the length N has been found. The higher moments help to reduce the sequence analyzed to a finite set of k statistically stable parameters, keeping invariant the values of the first kth moments Δk(p) (p 1,2,..., k). The conditions of statistical stability and proximity expressed in terms of higher moments ΔN(p) = ΔN+k(p) (p = 1,2,..., k) help to find k unknown stable points and predict possible future behavior of the random sequence analyzed. The generalized mean value (GMV)-function defined as GN(p) = (ΔN(p))1/p is turned to be very effective in analysis of statistically close random sequences or containing large numbers of measured points (N≫1). The approximate analytical expression for an arbitrary p value from the range (-∞<p<∞) entering into GN(p) has been found. It gives a possibility to transform any random sequence to the determined GMV curve and express quantitatively the reduced characteristics of any random sequence in terms of a 'universal' set of the fitting parameters defined by the determined GMV-function. Statistical proximity factor can be used for construction of calibration curves, when it is necessary to compare one random sequence with another one to respect of variations of some given external factor (small signal). The higher moments are easily generalized for the fractional and even complex moments. In turn, the GMV-function can be also generalized and then calculated for 2D and 3D random sequences. The approach developed in this paper is free from any model assumption and can be extremely helpful in comparison of different random sequences using for these purposes the 'unified' quantitative language based on introduction of the given set of fractional moments. The relationship between the value of the fractional moment and nonextensive parameter q entering into the definition of the nonextensive Tsallis entropy has been found. A possible model of statistical protection of plastic cards and other valuable documents demonstrating the effectiveness of the statistics of fractional moments has been considered. Some instructive examples in detection of superweak signals embedded into the basic random sequence (S/N = 10-2, 10-3) based on model and real data confirm the effectiveness of new approach and can serve a new basis for numerous practical applications. Analysis of dielectric spectroscopy data by means of fractional moments gives unique possibility to compare quantitatively each measurement with each other and express the influence of a neutral additive in terms of calibration curve without concrete knowledge of the corresponding fitting function.
Damping factor in Google page ranking: Research Articles
Authors: Hwai-Hui Fu, Dennis K. J. Lin, Hsien-Tang Tsai
Venue: Applied Stochastic Models in Business and Industry (2006)

Google, the largest search engine worldwide, adopts PageRank technology to determine the rank of website listings. This paper describes how damping factor is a critical factor in changing a website's ranking in traditional Google PageRank technology. A modified algorithm based on input&ndash;output ratio concept is proposed to substitute for the damping factor. Besides there is no need to choose an optimal damping factor value, the modified algorithm has an equivalent effect on computation as the traditional Google's PageRank algorithm. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Shoe-shaped interface for inducing a walking cycle
Authors: Junji Watanabe, Hideyuki Ando, Taro Maeda
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

We propose a shoe-shaped interface designed to induce a specific walking cycle, and investigate stimulation techniques for effective induction of the walking cycle. The proposed interface is useful for walking navigation system, which enables the wearer's locomotion without paying attention to surrounding circumstances. The interface consists of a vibration motor for stimulation and pressure sensors for measuring walking cycle. Using sensory-motor synchronization of human body, this interface can induce a walking cycle effectively without mechanical constraint. The results of our experiments indicate that vibration stimuli at heel grounding timing enable effective induction and that wearers can smoothly shift their walking cycles to the indicated cycle, if the shift of the stimulation cycle is within the range of -100 and +150 ms from their walking cycle.
A Bayesian approach to direction finding with parametric array uncertainty
Authors: M. Viberg, A. L. Swindlehurst
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

With few exceptions, high-resolution source localization algorithms require an exact characterization of the array, including knowledge of the sensor positions, sensor gain/phase response, mutual coupling, and receiver equipment effects. In practice, all such information is inevitably subject to errors. Recently, several different methods have been proposed for alleviating the inherent sensitivity of parametric methods to such modeling errors. The technique proposed herein is related to the class of so-called auto-calibration procedures, but it is assumed that certain prior knowledge of the array response errors is available. The optimal maximum a posteriori (MAP) estimator for the problem at hand is formulated, and a more computationally attractive large-sample approximation is derived. In addition, the performance advantage of the algorithm is illustrated by an example involving a linear array mounted on a flexible structure.
Simulating dynamic bandwidth allocation on satellite links
Authors: Alberto Gotta, Francesco Potortì, Raffaello Secchi
Venue: Proceeding from the 2006 workshop on ns-2: the IP network simulator (2006)

In the last years, DVB-RCS has emerged as a flexible technology offering broadband Internet access to a large community of users at a relatively low cost. At the same time, the spreading of networked multimedia applications has highlighted the need to investigate mechanisms that guarantee a certain level of Quality of Service (QoS) to the end users. In particular, the DVB-RCS standard specifies different capacity request categories to support QoS at the link layer.We describe Tdma-bod, an ns-2 improvement that implements generic bandwidth-on-demand allocation in TDMA satellite systems; the patch is available as free software. This simulator has been validated through experimental tests performed on the Skyplex satellite system. Specifically, we run CBR UDP flows to measure the characteristics of the satellite link in terms of throughput and delay and to verify that the simulative model output matches the experimental dynamic throughput and one-way delay behaviour. The simulations and experiments show that bandwidth-on-demand allocation mechanisms may cause large delays when sudden variations in the incoming traffic rate occur, a behaviour typical of multimedia flows.
Simulation-based scheduling for photo-reconnaissance satellite
Authors: Qiming Ruan, Yuejin Tan, Renjie He, Yingwu Chen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A simulation-based scheduling mechanism for photo-reconnaissance satellite is presented in this paper. The satellite scheduling problem belongs to a class of single-machine scheduling problems with time window constraint. It is NP-hard in computational complexity. Based on simulation platform, a mixed integer programming model is used to formulate the problem and an advanced tabu algorithm is adopted to solve the MIP. Numerical results demonstrate that this approach is efficient in the scheduling problems.
Naive Bayes Classification Given Probability Estimation Trees
Authors: Zengchang Qin
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Tree induction is one of the most effective and widely used models in classification. Unfortunately, decision trees such as C4.5 [9] have been found to provide poor probability estimates. By the empirical studies, Provost and Domingos [6] found that Probability Estimation Trees (PETs) give a fairly good probability estimation. However, different from normal decision trees, pruning reduces the performances of PETs. In order to get a good probability estimation, we usually need large trees which are not good in terms of the model transparency. In this paper, two hybrid models by combining the Naive Bayes classifier and PETs are proposed in order to build a model with good performance without losing too much transparency. The first model use Naive Bayes estimation given a PET and the second model use a group of small-sized PETs as Naive Bayes estimators. Empirical studies show that the first model outperforms the PET model at shallow depth and the second model is equivalent to Naive Bayes and PET.
The Application of Independent Component Analysis in Process Monitoring
Authors: Li Hongguang, Guo Hui
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A method of using Independent Component Analysis (ICA) to monitor process is proposed in this paper. The concept, model and algorithm of ICA are introduced first, and then ICA applications in the multivariable statistical process monitoring are discussed. A simulation example is used to demonstrate this approach. The results show that the independent component analysis can be considered as a new effective tool providing for statistical process monitoring and fault diagnosis.
A Clustering Algorithm for Time Series Data
Authors: Jian Yin, Duanning Zhou, Qiong-Qiong Xie
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In the Intelligent Traffic System, the research about the analysis of time series of traffic flow is important and meaningful. Using clustering methods to analyze time series not only can find some typical patterns of traffic flow, but also can group the sections of highway by their different flow characteristics. In this paper, we propose an Encoded-Bitmap-approach-based swap method to improve the classic hierarchical method. Experiments show that the proposed method has a better performance on the change trend of time series than classic algorithm.