ppxscal/embedding_network huggingface dataset:
The Research of Network Administrative Permit Management System Based on Agent Technology
Authors: Huaiming Li, Tian Ma, Ning Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Network Administrative Permit Management System is a crucial part in the construction of E-Government .Now it is paid more attention by the government. As we all know that (Administrative Permit Law Of PRC) was brought into effect on July 1st, 2004 .The law supplies legal basis for the Network Administrative Permit Management System. From then on, such system emerges like bamboo shoots after spring rain. Permit System has many attributes .For example, it has to deal with lots of different kinds of affairs which are continuously changing with time and space under complicated system condition. But traditional technical solutions could not meet the actual demands .So the paper proposes a solution based on Agent technology to resolve such problems.
High-resolution direction of arrival estimation using minimum-norm method without eigendecomposition
Authors: A. K. Shaw, Wei Xia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The minimum-norm method (MNM) for high-resolution directions-of-arrival (DOA) estimation relies on special purpose hardware or software for obtaining the signal and noise subspace eigenvectors of autocorrelation (AC) matrices. It is shown in this paper that the DFT of the AC matrix (DFT-of-AC) essentially performs an equivalent task of separating the signal and noise subspaces. Furthermore, when the signal-subspace part of the DFT-of-AC vectors are used in the minimum-norm framework, almost identical high-resolution DOA estimates are produced. When compared with eigendecomposition-based MNM, the computational load of the proposed DFT-based approach (D-MNM) is lower but the bias, mean-squared error and the root locations are almost similar. The simulations further show that at low SNR the performance of D-MNM is more robust and it also has superior dynamic range.
A Model to Support Adaptative Learning Assessment Using Graph Grammars
Authors: Priscilla Lanne Cordeiro de Leao, Carla Alessandra Lima Reis
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper proposes an adaptative model for automated learning assessment. The proposal is based on a formal model specified through a visual language to assist assessment modeling. On one hand, the proposed model is useful for teachers and content providers to describe the assessment flow in a flexible way. Besides, it describes the scenario for end-user (i.e., student) interactive applications. A tool called AvaWeb was derived from this model. AvaWeb is a web-based application composed by federation of specialized, distributed components that provide support for question and assessment management (through a graphical editor), and a customized assessment application for the students. The paper also briefly discusses the impact on the use of a Graph Grammar formalism for the specification of both syntax and semantics of the proposed visual language, which also assisted on the definition and implementation of the concrete software application.
Best Effort Query Processing in DHT-based P2P Systems
Authors: Philipp Rosch, Kai-Uwe Sattler, Christian von der Weth, Erik Buchmann
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applications the supported key lookup queries are not sufficient. Instead, techniques for managing and querying (relational) structured data are required. In this paper, we argue that in order to cope with the dynamics in large-scale P2P systems such query techniques should be work in a best effort manner. We describe such operations (namely grouping/ aggregation, similarity and nearest neighbor search) and discuss appropriate query evaluation strategies.
Effects of Vestibular Rotatory Accelerations on Covert Attentional Orienting in Vision and Touch
Authors: Francesca Figliozzi, Paola Guariglia, Massimo Silvetti, Isabelle Siegler, Fabrizio Doricchi
Venue: Journal of Cognitive Neuroscience (2005)

Peripheral vestibular organs feed the central nervous system with inputs favoring the correct perception of space during head and body motion. Applying temporal order judgments (TOJs) to pairs of simultaneous or asynchronous stimuli presented in the left and right egocentric space, we evaluated the influence of leftward and rightward vestibular rotatory accelerations given around the vertical head&ndash;body axis on covert attentional orienting. In a first experiment, we presented visual stimuli in the left and right hemifield. In a second experiment, tactile stimuli were presented to hands lying on their anatomical side or in a crossed position across the sagittal body midline. In both experiments, stimuli were presented while normal subjects suppressed or did not suppress the vestibulo-ocular response (VOR) evoked by head&ndash;body rotation. Independently of VOR suppression, visual and tactile stimuli presented on the side of rotation were judged to precede simultaneous stimuli presented on the side opposite the rotation. When limbs were crossed, attentional facilitatory effects were only observed for stimuli presented to the right hand lying in the left hemispace during leftward rotatory trials with VOR suppression. This result points to spatiotopic rather than somatotopic influences of vestibular inputs, suggesting that cross-modal effects of these inputs on tactile ones operate on a representation of space that is updated following arm crossing. In a third control experiment, we demonstrated that temporal prioritization of stimuli presented on the side of rotation was not determined by response bias linked to spatial compatibility between the directions of rotation and the directional labels used in TOJs (i.e., "left" or "right" first). These findings suggest that during passive rotatory head&ndash;body accelerations, covert attention is shifted toward the direction of rotation and the direction of the fast phases of the VOR.
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D⌊logmD⌋
Authors: Serge Grigorieff
Venue: Theoretical Computer Science (2006)

Jiang [The synchronization of non uniform networks of finite automata, in: FOCS, Vol. 89, 1989, pp. 376-381, The synchronization of non uniform networks of finite automata, Inform. and Comput. 97(2) (1992) 234-261] proved a remarkable result: for every k, there exists a cellular automaton synchronizing every degree ≤k connected graph with arbitrary symmetric communication delays. The synchronization time obtained by Jiang is O(δ3) where δ is the maximum communication delay between two cells. Mazoyer [Synchronization of a line of finite automata with non uniform delays, 1990, unpublished] proved an O(D2) synchronization time where D is the sum of the communication delays of the degree ≤k connected graph (together with an O(D log D) synchronization time in case the graph has only two cells).In this paper, we prove (cf. Theorem 23) that for any m ≥ 2 one can synchronize in time D ⌊logm(D)⌋ all lines of total communication delay > m9 (shorter lines being synchronized in time 4D). A result which extends to bounded degree connected graphs using Rosensthiel's technique [P. Rosenstiehl, Existence d'automates capables de s'accorder bien qu'arbitrairement connectés et nombreux, Internat. Comput. Center Bull. 5 (1966) 245-261, P. Rosenstiehl, J.R. Fiksel, A. Holliger, Intelligent graphs: networks of finite automata capable of solving graph problems, in: R.C. Read (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 219-265]. As shown by Vivien [Cellular Automata: A Geometrical Approach, to appear], this result is already optimal for lines of two cells with arbitrary communication delay.The method relies heavily on Jiang technique of circuit with revolving information.
A Cost Effective Output Response Analyzer for \sum - \delta Modulation Based BIST Systems
Authors: Hao-Chiao Hong, Sheng-Chuan Liang
Venue: Proceedings of the 15th Asian Test Symposium (2006)

A cost effective output response analyzer (ORA) for \sum - \delta modulation based BIST systems is presented. Instead of using Fast Fourier Transform (FFT) to derive the signal-tonoise- and-distortion ratio (SNDR) in frequency domain, the proposed ORA using the modified controlled sine wave fitting procedure to calculate the signal power and the totalharmonic- distortion-and-noise power in time domain separately. It requires neither parallel multiplier nor complex CPU/DSP and bulky memory thus has a low cost. A secondorder design-for-digital-testability \sum - \delta modulator is used as the circuit under test example. Simulation results show that the SNDR differences between conventional FFT analysis and the proposed ORA have a mean and standard deviation of 0.64 dB and 0.36 dB respectively. The cost effectiveness and satisfying accuracy features make it suitable for embedded BIST applications.
Folk theorems on the determinization and minimization of timed automata
Authors: Stavros Tripakis
Venue: Information Processing Letters (2006)

Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not algorithmically solvable. Minimizing the "resources" of a TA (number of clocks or size of constants) are also unsolvable problems. In this paper we provide simple undecidability proofs using a "constructive" version of the problems where we require not just a yes/no answer, but also a "witness". Proofs are then simple reductions from the universality problem. Recent work of Finkel shows that the corresponding decision problems are also undecidable [O. Finkel, On decision problems for timed automata, Bulletin of the European Association for Theoretical Computer Science 87 (2005) 185-190].
OAR: an opportunistic auto-rate media access protocol for ad hoc networks
Authors: B. Sadeghi, V. Kanodia, A. Sabharwal, E. Knightly
Venue: Wireless Networks (2005)

The IEEE 802.11 wireless media access standard supports multiple data rates at the physical layer. Moreover, various auto rate adaptation mechanisms at the medium access layer have been proposed to utilize this multi-rate capability by automatically adapting the transmission rate to best match the channel conditions. In this paper, we introduce the Opportunistic Auto Rate (OAR) protocol to better exploit durations of high-quality channels conditions. The key mechanism of the OAR protocol is to opportunistically send multiple back-to-back data packets whenever the channel quality is good. As channel coherence times typically exceed multiple packet transmission times for both mobile and non-mobile users, OAR achieves significant throughput gains as compared to state-of-the-art auto-rate adaptation mechanisms. Moreover, over longer time scales, OAR ensures that all nodes are granted channel access for the same time-shares as achieved by single-rate IEEE 802.11. We describe mechanisms to implement OAR on top of any existing auto-rate adaptation scheme in a nearly IEEE 802.11 compliant manner. We also analytically study OAR and characterize the delay jitter and the gains in throughput as a function of the channel conditions. Finally, we perform an extensive set of ns-2 simulations to study the impact of such factors as node velocity, channel conditions, and topology on the throughput of OAR.
Exact simulation of integrate-and-fire models with synaptic conductances
Authors: Romain Brette
Venue: Neural Computation (2006)

Computational neuroscience relies heavily on the simulation of large networks of neuron models. There are essentially two simulation strategies: (1) using an approximation method (e.g., Runge-Kutta) with spike times binned to the time step and (2) calculating spike times exactly in an event-driven fashion. In large networks, the computation time of the best algorithm for either strategy scales linearly with the number of synapses, but each strategy has its own assets and constraints: approximation methods can be applied to any model but are inexact; exact simulation avoids numerical artifacts but is limited to simple models. Previous work has focused on improving the accuracy of approximation methods. In this article, we extend the range of models that can be simulated exactly to a more realistic model: an integrate-and-fire model with exponential synaptic conductances.
Controlling Quality of Service in Multi-Tier Web Applications
Authors: Yixin Diao, Joseph L. Hellerstein, Sujay Parekh, Hidayatullah Shaikh, Maheswaran Surendra
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

The need for service differentiation in Internet services has motivated interest in controlling multi-tier web applications. This paper describes a tier-to-tier (T2T) management architecture that supports decentralized actuator management in multi-tier systems, and a testbed implementation of this architecture using commercial software products. Based on testbed experiments and analytic models, we gain insight into the value of coordinated exploitation of actuators on multiple tiers, especially considerations for control efficiency and control granularity. For control efficiency, we show that more effective utilization of tiers can be achieved by using actuators on the bottleneck tier rather than only using actuators on the entry tier. For granularity of control (the ability to achieve a wide range of service level objectives) we show that a fine granularity of control can be achieved through a coordinated, cross-tier exploitation of coarse grained actuators (e.g., multiprogramming level), an approach that can greatly reduce controllerinduced variability.
Remote Control of Web 2.0-Enabled Laboratories from Mobile Devices
Authors: Diego Lopez-de-Ipina, Javier Garcia-Zubia, Pablo Orduna
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The design of WebLabs has traditionally been focused on the hardware rather than the software side. However, paying more importance to the software side can bring about important improvements: richer collaboration among group members, better scalability, securer access and more natural anywhere at anytime access to the remote lab. Regarding this latter issue, enabling a user to access a remote WebLab not only through standard internet-connected PCs but also by means of their mobile devices can be very interesting and potentially advantageous. The core of this paper is to discuss the transformation of DeustoWebLab into a Web 2.0-compatible application accessible from mobile devices.
Personalised Dynamic Links on theWeb
Authors: Yeliz Yesilada, Sean Bechhofer, Bernard Horan
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

Links on theWeb are unidirectional, embedded, difficult to author and maintain. With a Semantic Web architecture, COHSE (Conceptual Open Hypermedia System) aims to address these limitations by dynamically creating links on the Web. Here we present how this architecture is extended and modified to support customisation and create an adaptable open system by using third party ontologies and services to discover resources on the Web. We then present the deployment of this in a portal and discuss possible extensions to create an adaptive system to dynamically create personalised links.
Application of Optimized EKF in Direct Torque Control System of Induction Motor
Authors: Zhengyun Ran, Huade Li, Shujin Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The paper introduces extended kalman filter(EKF) estimate state variables and stator resistance of induction motor and employs virtual noise to compensate for model error from system model linearity.As EKF can't estimate state variables accurately in case of unknown noise statistics,genetic algorithm is proposed to optimize EKF. Study shows that GA has the shortcoming of inefficiency , so the paper proposes immune genetic algorithm(IGA) optimization scheme, which converges to globally optimal solution on the basis of excellent individual group. Experimental system of induction motor based on direct torque control(DTC) is designed ,and comparative study is carried out a great deal. The conclusion that system's performance based on IGA-EKF optimization scheme is better than that based on GA-EKF optimization scheme is drawn.
A New Extraction Concept Based on Contextual Clustering
Authors: Lobna Karoui, Marie-Aude Aufaure, Nacera Bennacer
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Ontologies provide a common layer that plays a major role in information exchange and support sharing. Ontologies proliferation relies strongly on the automation of their building, integration and deployment processes. In this paper, we present an integrated framework involving complementary dimensions to drive the (semi) automatic acquisition conceptual knowledge process from HTML Web pages. Our approach takes advantage from structural HTML document features and the word location to identify the appropriate term context. Our context definition improves word weighting, the selection of the semantically closer cooccurrents and the relevant extracted ontological concepts. We use an unsupervised clustering method for term groups' generation. Notice that the chosen clustering method relies on a user incremental quality evaluation process. In this paper and after a theoretical presentation of our structural contextual definition, we summarize the most significant results obtained by applying our method on a corpus dedicated to the tourism domain. The first results show how the definition of an appropriate context improves the relevance of the extracted concepts.
Learning decomposable markov networks in pseudo-independent domains with local evaluation
Authors: Y. Xiang, J. Lee
Venue: Machine Learning (2006)

We consider learning probabilistic graphical models in a problem domain of unknown dependence structure. Common learning algorithms rely on single-link lookahead search, which assumes the underlying domain is not pseudo-independent. Since the dependence structure of the domain is unknown, such assumption is fallible. We study learning algorithms that make no such assumption and return an approximate dependence structure no matter whether the domain is pseudo-independent or not. The focus of this paper is on learning decomposable Markov networks, which can directly be used for model-based inference or as the intermediate step for further learning of directed graphical models. We identify a small subset of domain variables, termed crux, in the graphical models currently being examined during search. We prove that crux is sufficient for computing the incremental change of both model description length as well as data description length given the model. Based on crux, we propose algorithms that reduce evaluation of alternative graphical models to local computation, improve efficiency significantly, and introduce no error to the selection of alternative models.
A Framework for Data and Web Services Semantic Mediation in Peer-to-Peer Based Medical Information Systems
Authors: Mahmoud Barhamgi, Djamal Benslimane, Pierre-Antoine Champin
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Interoperability is a crucial issue in the health care domain. It must be conducted along two tightly-coupled levels: "data" and "application" levels. The former is about bridging together heterogeneous medical data sources. The later is concerned with enabling medical applications to understand each other when they interact through Web services composition. In this paper we present a peer-to-peer framework for ensuring the interoperability along its two levels. Then we present a semantic mediation model dealing with data's "context heterogeneity" between web services within a composition process.
A numerical method for the wave equation subject to a non-local conservation condition
Authors: Whye-Teong Ang
Venue: Applied Numerical Mathematics (2006)

A numerical method based on an integro-differential equation and local interpolating functions is proposed for solving the one-dimensional wave equation subject to a non-local conservation condition and suitably prescribed initial-boundary conditions. To assess its validity and accuracy, the method is applied to solve several test problems.
Beyond bloom filters: from approximate membership checks to approximate state machines
Authors: Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah, Sushil Singh, George Varghese
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

Many networking applications require fast state lookups in a concurrent state machine,which tracks the state of a large number of flows simultaneously.We consider the question of how to compactly represent such concurrent state machines. To achieve compactness,we consider data structures for Approximate Concurrent State Machines (ACSMs)that can return false positives,false negatives,or a "don 't know "response.We describe three techniques based on Bloom filters and hashing,and evaluate them using both theoretical analysis and simulation.Our analysis leads us to an extremely efficient hashing-based scheme with several parameters that can be chosen to trade off space,computation,and the pact of errors.Our hashing approach also yields a simple alternative structure with the same functionality as a counting Bloom filter that uses much less space.We show how ACSMs can be used for video congestion control.Using an ACSM,a router can implement sophisticated Active Queue Management (AQM)techniques for video traffic (without the need for standards changes to mark packets or change video formats),with a factor of four reduction in memory compared to full-state schemes and with very little error.We also show that ACSMs show promise for real-time detection of P2P traffic.
Applying simulation to the sizing of PETROBRAS' oil refinery tank farms
Authors: Cláudio Duarte Pinto Limoeiro, Guilherme Julio Barbosa, Guilherme De Aquino Barbosa, Ana Chan, Claudio Rodrigo Beal, Mario Jorge Lima
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The simulation model uses scenarios to support decisions on the sizing of a refinery tank farm. It analyzes the impact of new enterprises, demand variations and detects operational bottlenecks. It is made up of a mass balance associated to a regime consisting of the entry of feedstocks, exit of outlet products and handling operations subject to prioritization rules. The arrival of crude oils, serving the oil products' consumer market and operational failures are the random events considered. Its great flexibility allows many variations to the process elements, as well as to the quantity and volume of the tanks. Studies carried out have shown adherence and indicated necessary process adjustments. General routines will be used to replicate the model, consolidating it as an indispensable instrument in the Company's refineries investment analyses. At that stage, the models will have a user friendly interface and will access corporate databases to facilitate their calibration.