ppxscal/embedding_network huggingface dataset:
The Design and Realization of Document Transmission Model Based on Agent
Authors: Dujuan Wang, Huaiming Li, Peng Zhang, Shangyu Nie
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This article brings forward a document transmission model based on Agent. The model not only follows document transmission operation, but also brings forward an intelligent way to deal with document transmission, which improves systemic maneuverability and agility greatly, and gives a reference to network intelligence in E-government.
Efficient Search Using Bitboard Models
Authors: Pablo San Segundo, Ramon Galan, Fernando Matia, Diego Rodriguez-Losada, Agustin Jimenez
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpretation in the world of discourse. In models encoded in such a way, states will be described internally as a set of bitboard tuples, whilst operators which allow for transitions between states are essentially bitwise operations over elements belonging to that set. Given a 64-bit processor word, for each transition it would be theoretically possible to reach another state 64 times faster than with a normal encoding, fast transitions being one of the main issues for efficient search algorithms. We have analysed some other key issues related to efficient bitboard model design and formalised the concepts of well formed heuristics and bitboard guides. We have used this approach to solve instances of the maximum clique problem thus increasing the performance of one of the fastest algorithms known in the domain for optimal search.
Semantic Smoothing for Model-based Document Clustering
Authors: Xiaodan Zhang, Xiaohua Zhou, Xiaohua Hu
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

A document is often full of class-independent "general" words and short of class-specific 'core" words, which leads to the difficulty of document clustering. We argue that both problems will be relieved after suitable smoothing of document models in agglomerative approaches and of cluster models in partitional approaches, and hence improve clustering quality. To the best of our knowledge, most model-based clustering approaches use Laplacian smoothing to prevent zero probability while most similarity-based approaches employ the heuristic TF*IDF scheme to discount the effect of "general" words. Inspired by a series of statistical translation language model for text retrieval, we propose in this paper a novel smoothing method referred to as context-sensitive semantic smoothing for document clustering purpose. The comparative experiment on three datasets shows that model-based clustering approaches with semantic smoothing is effective in improving cluster quality.
Estimation as a catalyst for numeracy: micro-interventions that increase the use of numerical information in decision-making
Authors: Luke F. Rinne, Michael A. Ranney, Nicholas H. Lurie
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The utilization of available numerical information represents an important aspect of numeracy. Accordingly, we seek to develop decision-making scaffolds that increase the incorporation of numerical information into preferences. Two experiments contrast five techniques for presenting students with numerical information and prompting them to make decisions related to that information. The techniques are based on a method called EPIC (Estimate, Prefer, Incorporate feedback, and Change preference) from the Numerically-Driven Inferencing (NDI) paradigm. Results regarding post-feedback preferences indicate that having students estimate a quantity's value beforehand increases the impact on preferences when the quantity's true value is presented. However, having students state initial preferences does not yield an analogous effect. An attractive explanation for the estimation effect is that estimating diminishes hindsight bias, making information that diverges from expectations more surprising. Variants of the EPIC method may serve as "micro-interventions" that increase the impact of numerical data on preferences.
Haptic Media Synchronization for Remote Surgery through Simulation
Authors: Olarn Wongwirat, Shigeyuki Ohara
Venue: IEEE MultiMedia (2006)

Network delay affects the operational instability of haptic displays for telehaptic remote surgery applications using simulation. A synchronization control mechanism for haptic media reduces network delay's effects and enhances telehaptic capability in these applications.
Programming using dynamic system modeling VIA a 3D-based multimodeling framework
Authors: Hyunju Shim, Paul Fishwick
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We propose a new approach to visual programming which adopts principles and elements from dynamic multimodeling for structured procedural programming, especially graphics programming. Unlike most traditional visual programming languages which simply replace syntactic parts of program with graphical objects, we applied the principles of dynamic model types in modeling and simulation to create program models and execute/simulate them. With this approach, computer programs are constructed by visual modeling instead of textual writing. The motivation for a method using dynamic model types in graphics programming is also tied to several emerging research areas: novice user interfaces, programming visualization, customized icons, and a broader view of aesthetics within programming. Metaphoric icons are extensively used for the visual representation of program model elements. Rube, a Web- and XML-based modeling and simulation framework, provides the necessary environment for the construction, visualization and execution of program models.
A novel idle mode operation in IEEE 802.11 WLANs: prototype implementation and empirical evaluation
Authors: Sunggeun Jin, Kwanghun Han, Sunghyun Choi
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

IEEE 802.11 Wireless Local Area Network (WLAN) became a prevailing technology for the broadband wireless Internet access, and new applications such as Voice over WLAN (VoWLAN) are fast emerging today. For the battery-powered VoWLAN devices, the standby time extension is a key concern for the market acceptance while today's 802.11 is not optimized for such an operation. In this paper, we propose a novel Idle Mode operation, which comprises paging, idle hando®, and delayed hando®. Under the idle mode operation, a Mobile Host (MH) does not need to perform a hando® within a predefined Paging Area (PA). Only when the MH enters a new PA, an idle hando® is performed with a minimum level of signaling. Due to the absence of such an idle mode operation, both IP paging and Power Saving Mode (PSM) have been considered the alternatives so far even though they are not efficient approaches. We implement our proposed scheme in order to prove the feasibility. The implemented prototype demonstrates that the proposed scheme outperforms the legacy alternatives with respect to energy consumption, thus extending the standby time.
Controllability and diameter of single-input quantum systems
Authors: A. Agrachev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Lie groups formalism and Riemannian techniques are used to describe the attainable set at time T of left invariant single-input control systems on compact semi-simple Lie groups. This gives controllability properties and an estimation of the minimal time needed to transfer a controlled quantum system with a drift front a given initial position to a given final position.
Structure-Based Ontology Evaluation
Authors: HUANG Ning, DIAO Shihan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

In order to build high quality ontologies, ontology evaluation technologies are needed. Now, most evaluation methods focus on the syntax evaluation which guarantees the correctness and completeness of ontology. The primary goal of these evaluation methods is to prevent applications from using inconsistent or incorrect ontologies. During last few years, some studies pay attention to the common meaningful structures among ontologies, which are analogous to each other. However, fewer studies concentrate on the internal structure of the ontology. Ontology, as the representation of knowledge, should have similar structure with domain knowledge. Furthermore, the ontology with wellorganized structure will make it easy to understand, learn, apply, and reuse. Therefore, based on the statistics and the graph theory, this paper puts forward an improved ontology evaluation method, in which six properties are proposed to describe the characteristics of ontology structure. After discussing the algorithm of these six properties, we introduce an ontology development tool, in which the evaluation method has been integrated. This tool supports the entire ontology development process, and can help ontology developers refine the structure of ontology, and easily make a decision that which aspect of the ontology should be revised or improved.
Adaptive Volterra filters using orthogonal structures
Authors: V. J. Mathews
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The paper presents an adaptive Volterra filter that employs an orthogonalization procedure of Gaussian signals for Volterra system identification. The algorithm is capable of handling arbitrary orders of nonlinearity P as well as arbitrary lengths of memory N for the system model. The adaptive filter consists of a linear lattice predictor of order N, a set of Gram-Schmidt orthogonalizers for N vectors of size P+1 elements each, and a joint process estimator in which each coefficient is adapted individually. The complexity of implementing this adaptive filter is comparable to the complexity of the system model when N is much larger than P, a condition that is true in many practical situations. Experimental results demonstrating the capabilities of the algorithm are also presented in the paper.
A Proposal of Separation of Concerns in EMLs and Its Relation with LD
Authors: Manuel Caeiro-Rodriguez, Luis Anido-Rifon, Martin Llamas-Nistal
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper deals with a separation of concerns proposal for Educational Modeling Languages (EMLs). Basically, it proposes to structure these languages in a way different from the one proposed by the IMS Learning Design (LD) specification, currently considered as the standard EML. We assume that the LD specification is very complex and it is difficult to develop design and runtime applications and to produce EML-educational materials. Therefore, our goal is to simplify the LD specification. The main idea is not to attain the modeling of educational materials as a whole problem, but to divide it in several separated parts that could be solved in a step by step way. We propose two different kinds of parts: perspectives and aspects.
Tests of Complete Positivity in Fiber Optics
Authors: Fabio Benatti, Roberto Floreanini
Venue: Open Systems Information Dynamics (2006)

We consider the propagation of polarized photons in optical in Fibers under the action of randomly generated noise. In such situation, the change in time of the photon polarization can be described by a quantum dynamical semigroup. We show that the hierarchy among the decay constants of the polarization density matrix elements as prescribed by complete positivity can be experimentally probed using standard laboratory set-ups.
State Based Control of Wastewater Treatment Plants--Evaluation of the Algorithm in a Simulation Study
Authors: Alexander Ebel, Michael Bongards, Sean McLoone
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

This paper presents the design of a supervised controller with the primary objectives of improvement of process stability and reduction of operating costs. The controller uses a rule set for determination of the process state extracted from the results of a fuzzy c-means clustering algorithm. Additionally a finite state machine is used for the evaluation of identified states in order to check logical consistency and process behavior. The result of the state machine is a symbolic value which describes the condition of the process. Based on the condition-identification an appropriate control strategy is used. The supervised controller methodology is evaluated in a simulation study. A significant improvement of process stability and energy saving has been achieved.
Spectral problems on arbitrary open subsets of Rn involving the distance to the boundary
Authors: D. E. Edmunds, W. D. Evans
Venue: Journal of Computational and Applied Mathematics (2006)

We consider Sobolev spaces weighted by means of powers of the distance function, analyse their embeddings from the standpoint of approximation numbers, and give upper and lower estimates for the spectral counting function for naturally associated elliptic operators.
Simulation optimization using tabu search: an emperical study
Authors: Abdullah Konak, Sadan Kulturel-Konak
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper proposes alternative strategies to perform simulation within a simulation optimization algorithm based on tabu search. These strategies are tested empirically on a stochastic knapsack problem. Results have shown that the way simulation is implemented and the number of simulation replications have a prAB@ofound effect on the performance of tabu search.
Memory Models for Improving Tabu Search with Real Continuous Variables
Authors: Andrew M. Connor
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

This paper proposes that current memory models in use for tabu search algorithms are at best evolving, as opposed to adaptive, and that improvements can be made by considering the nature of human memory. By introducing new memory structures, the search method can learn about the solution space in which it is operating. The memory model is based on the transfer of events from episodic memory into generalised rules stored in semantic memory. By adopting this model, the algorithm can intelligently explore the solution space in response to what has been learned to date and continuously update the stored knowledge.
Distributed holonic multi-agent system for resource discovery in grids
Authors: M. Bakhouya, J. Gaber, A. Koukam
Venue: Multiagent and Grid Systems (2006)

Large scale networks such as computational Grid is a distributed computing infrastructure that can provide globally available network resources. Their size and complexity continue to increase and permit an almost ubiquitous availability of resources; users become able to access network resources irrespective to their location. Therefore, new resource management and access models are required and need to be highly flexible with self-organizing capabilities in order to cope with a dynamically changing environment. In this paper, a distributed and adaptive holonic multi-agent system for resource discovery in Grids is presented. Simulations are presented to demonstrate that structuring servers into holons improves the performance of request resolution processes in dynamic Grid environment.
Part 2: multilayer perceptron and natural gradient learning
Authors: Hyeyoung Park
Venue: New Generation Computing (2006)

Since the perceptron was developed for learning to classify input patterns, there have been plenty of studies on simple perceptrons and multilayer perceptrons. Despite wide and active studies in theory and applications, multilayer perceptrons still have many unsettled problems such as slow learning speed and overfitting. To find a thorough solution to these problems, it is necessary to consolidate previous studies, and find new directions for uplifting the practical power of multilayer perceptrons. As a first step toward the new stage of studies on multilayer perceptrons, we give short reviews on two interesting and important approaches; one is stochastic approach and the other is geometric approach. We also explain an efficient learning algorithm developed from the statistical and geometrical studies, which is now well known as the natural gradient learning method.
Examination of gearbox cracks using time-frequency distributions
Authors: H. Oehlmann, D. Brie, V. Begotto, M. Tomczak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Nonstationary gearbox vibration signals are analysed using a time-frequency (TF) representation which is chosen with respect to its interpretability. With its help, a crack transient is examined in detail and decomposed into three physical parts. Following this analysis, a time-domain signal is synthesized. Its good phase fitting proves on one hand, the validity of the analysis and on the other hand, the good accuracy of the TF representation chosen.
Type-based XML projection
Authors: Véronique Benzaken, Giuseppe Castagna, Dario Colazzo, Kim Nguyên
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

XML data projection (or pruning) is one of the main optimization techniques recently adopted in the context of main-memory XML query-engines. The underlying idea is quite simple: given a query Q over a document D, the subtrees of D not necessary to evaluate Q are pruned, thus obtaining a smaller document D'. Then Q is executed over D', hence avoiding to allocate and process nodes that will never be reached by navigational specifications in Q.In this article, we propose a new approach, based on types, that greatly improves current solutions. Besides providing comparable or greater precision and far lesser pruning overhead our solution, unlike current approaches, takes into account backward axes, predicates, and can be applied to multiple queries rather than just to single ones. A side contribution is a new type system for XPath able to handle backward axes, which we devise in order to apply our solution.The soundness of our approach is formally proved. Furthermore, we prove that the approach is also complete (i.e., yields the best possible type-driven pruning) for a relevant class of queries and DTDs, which include nearly all the queries used in the XMark and XPathMark benchmarks. These benchmarks are also used to test our implementation and show and gauge the practical benefits of our solution.
WebGPSS: the first two hours of simulation education
Authors: Richard G. Born, Ingolf Ståhl
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper we present seven short lessons used for introducing management science students to discrete event simulation. It has been used both as the only element of such simulation in courses that devote only two classroom hours to this topic and as the introduction in courses that are devoted almost completely to simulation.
Cooperative Cognition and Its Implementation under Web Environment
Authors: Wanchun Dou, Guihai Chen, S. C. Cheung, Shijie Cai
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Problem cognition is often the first step to problem solving. Complex problem solving is often promoted by cooperative cognition. Our research work presented in this paper is initialed by a motivated example. Then meta-cognition and cooperative cognition are explored by defining their Cognition Logic Context and Cognition Resource Context. Cognition evolution is discussed from the transformation of problem state space. Moreover, the knowledge flow principle engaged in cooperative cognition is explored from the perspective of learning and cognition evolution. To promote cooperative cognition under Web environment, a context application paradigm is proposed based on P2P scenarios. The conclusions and our future works are presented at last.
Efficient Techniques for Signalling Intra Prediction Modes of H.264/Mpeg-4 Part 10
Authors: Jamil-ur- Rehman, Zhang Ye
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Enhanced Intra and Inter prediction techniques are the key factors to the success of H.264. There are a total of nine optional prediction modes for each 4 × 4 luma block. The choice of intra prediction mode for each 4 × 4 block must be signalled to the decoder and this could potentially require a large number of bits. However, intra modes for neighbouring 4 × 4 blocks are often correlated. To take advantage of this correlation, predictive coding is used to signal 4 × 4 intra modes. At the boundaries of frame, we can't apply all modes because of limitation of available pixels for prediction. Now question arises, is it feasible to use same technique to signal less number of modes as for nine modes? In this Paper we used techniques different than the given technique for nine modes, experimental results show that the proposed methods are more efficient than the existing one.
A framework for interactive web-based visualization
Authors: Nathan Holmberg, Burkhard Wünsche, Ewan Tempero
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

As the power of end user web browsers increases, the delivery of sophisticated visualizations of information via the web becomes possible. However no technology exists that offers the kind of interactions that a stand-alone application can deliver. Technologies such as Java3D, VRML, X3D and SVG incorporate powerful rendering capabilities but make it difficult to interact with the underlying source data. Other technologies such as SMIL can also offer synchronization but then lack this rendering context. We present a framework within which these technologies can be evaluated.We also address the question of how to integrate these technologies with existing and well-understood web technologies such as Javascript, CSS, Web Services, and PHP, to provide interactive web-based visualization applications. We then describe a generalized framework for determining how to choose the right set of technologies for a web-based visualization application.
Comparing representative selection strategies for dissimilarity representations: Research Articles
Authors: Zane Reynolds, Horst Bunke, Mark Last, Abraham Kandel
Venue: International Journal of Intelligent Systems (2006)

Many of the computational intelligence techniques currently used do not scale well in data type or computational performance, so selecting the right dimensionality reduction technique for the data is essential. By employing a dimensionality reduction technique called representative dissimilarity to create an embedded space, large spaces of complex patterns can be simplified to a fixed-dimensional Euclidean space of points. The only current suggestions as to how the representatives should be selected are principal component analysis, projection pursuit, and factor analysis. Several alternative representative strategies are proposed and empirically evaluated on a set of term vectors constructed from HTML documents. The results indicate that using a representative dissimilarity representation with at least 50 representatives can achieve a significant increase in classification speed, with a minimal sacrifice in accuracy, and when the representatives are selected randomly, the time required to create the embedded space is significantly reduced, also with a small penalty in accuracy. &copy; 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 1093&ndash;1109, 2006.