ppxscal/embedding_network huggingface dataset:
Evidence-based Approach to Interacting with Open Student Models
Authors: Diego Zapata-Rivera, Eric Hansen, Valerie J. Shute, Jody S. Underwood, Malcolm Bauer
Venue: International Journal of Artificial Intelligence in Education (2007)

Research efforts focused on developing "active reports" are currently underway. Active reports are designed to foster communication among teachers, students, and parents by listening to all stakeholders, using assessment information to guide teaching and learning, and to reconcile potential conflicts. Open student models can handle different views of the student. These views support different kinds of assessment information coming from a variety of sources (e.g. results from summative and formative assessments). As teachers, students, and parents interact with open student models, assessment claims (e.g. students' self-assessment, systems' and teachers' assessment of student knowledge) may evolve from unsupported claims to evidence-based arguments. Paths on this evidentiary argument space are characterized by rich interactions among sources of evidence that may challenge personal claims and improve metacognitive skills. This paper (a) presents an evidence-based approach to interacting with open student models that builds on existing research on open student models, evidentiary arguments and evidence-centered design, (b) illustrates this approach in the context of an assessment-based learning environment called Math Intervention Module (MIM), and (c) reports on a study carried out with Algebra teachers/assessment specialists aimed at evaluating the feasibility of implementing this approach in real settings.
Improvements for the Symbolic Verification of Timed Automata
Authors: Rongjie Yan, Guangyuan Li, Wenliang Zhang, Yunquan Peng
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Based on the equivalence relation for location based reachability between continuous and integer semantics of closed timed automata, Beyer et al. have implemented the verifier Rabbit, with the uniform representation of reachable configurations. However, the growth of maximal constant of clock variables will decline the performance of Rabbit. The paper proposes an improved symbolic method, using binary decision diagrams (BDDs) to store the symbolic representation of discretized states, for the verification of timed systems. Compared with Rabbit, experiments demonstrate that besides the memory reduction, our implementation is also less sensitive to the size of clock domain.
Brief paper: Local L2 gain of bifurcation stabilization
Authors: Tiebao Yang, Xiang Chen
Venue: Automatica (Journal of IFAC) (2008)

Local L"2 gain analysis of a class of stabilizing controllers for nonlinear systems with both stationary and Hopf bifurcations is studied. In particular, a family of Lyapunov functions is first constructed for the corresponding critical system, and simplified sufficient conditions to compute the L"2 gain are derived by solving the Hamilton-Jacobi-Bellman (HJB) inequalities. Local robust analysis for a class of bifurcation stabilizing controllers can then be conducted through computing the local L"2 gain achieved by these controllers at the critical situation. The results obtained in this paper provide useful guidance for selecting a robust controller from a given class of stabilizing controllers in terms of L"2 gain. As an example, application to an axial flow compressor control is discussed in detail.
Time Stamp Protocol for Smart Environment Services
Authors: Deok-Gyu Lee, Jong-Wook Han, Jong Hyuk Park, Sang Soo Yeo, Young-Sik Jeong
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

By development of wireless mobile communication, many users incr-eased. But, in case of 1st generation or 2nd generation, transfer communication service was not satisfying high speed wireless internet Communication consumer's request such as other multimedia service because serviced based on voice and text basically. Can get through service such as data and transfer multimedia service that is not service of voice putting first in wireless hereafter. Problems by much development of service are happening, because a transmit is exposed, problem point that radio net is much unlawful stealing use and tapping etc. by user that is not right can happen. Need method to keep away purpose that is enemy of third party in contract between both men as well as problem for document or accounting information which the third user that is enemy of third party is shared. By solution about problems, certification of contents for document and visual point confirmation must it. Applied service or certification of contents service that is rapidly point of time that is using in wire to solve problem that refer in front in this treatise in smart environment to develop hereafter. Way to propose proposed efficient way using individual in smart environment just as it is.
Externalization Support of Key Phrase Channel in Presentation Preparation
Authors: Koichi Hanaue, Toyohide Watanabe
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper, we propose a framework of supporting presentation scenario composition from a viewpoint of externalizing a presenter's intention. Traditional presentation slides in the style of bullet lists lack in rhetorical relations between idea fragments. This makes it difficult that audiences could understand presentation utterances and presentation slides. In order to solve this problem, we introduce a concept of logical frame. The logical frame is a semantic block in which idea fragments are organized rhetorically. A presentation scenario is composed through the process of organizing idea fragments within a logical frame and relating logical frames to each other. Based on this model of presentation scenario, we have implemented a scenario composition interface.
Prioritized e-mail servicing to reduce non-spam delay and loss: a performance analysis
Authors: Muhammad N. Marsono, M. Watheq El-Kharashi, Fayez Gebali
Venue: International Journal of Network Management (2008)

This paper proposes a prioritized e-mail servicing on e-mail servers to reduce the delay and loss of non-spam e-mails due to queuing. Using a prioritized two-queue scheme, non-spam e-mails are queued in a fast queue and given higher service priority than spam e-mails that are queued in a slow queue. Four prioritized e-mail service strategies for the two-queue scheme are proposed and analyzed. We modeled these four strategies using discrete-time Markov chain analysis under different e-mail traffic loads and service capacities. Non-spam e-mails can be delivered within a small delay, even under heavy e-mail loadings and high spam-to-non-spam a priori. Results from our analysis of the two-queue scheme show that it gives non-spam delay and loss probability two orders of magnitude smaller than the typical single-queue approach during heavy spam traffic. Moreover, prioritized e-mail servicing protects e-mail servers from spam attacks.
Incipient Fault Characteristic Extraction of Rotary Machine Base on Wavelet Transform and Fuzzy Wavelet Threshold Denoising
Authors: Xiaojun Li, Bai Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Due to the weak energy and nonstationarity, incipient fault characteristic signals are usually submerged by vibration signals of rotary machine and noise. Based on the multi-resolution feature and time-frequency localization feature of Wavelet Transform, a method to extract fault characteristic signals by decomposing them into corresponding time-frequency segmentations is presented. The noise is attenuated, and the characteristic signals are amplified since of the different singularity feature in Wavelet Transform. At the time-frequency segmentations including higher order harmonic frequencies of fault vibration signals, the incipient fault characteristics are extracted efficaciously. The fault signals are denoised further more by a wavelet fuzzy threshold denoising constructed. Higher SNR is gained compared to traditional denoising methods. And the legible time and frequencies fault emerging of characteristic signals are extracted, which can be used to diagnose the position and fault degree combined with the energy of branch reconstruction of fault characteristic signals.
Lower Bounds for Hit-and-Run Direct Search
Authors: Jens Jägersküpper
Venue: Proceedings of the 4th international symposium on Stochastic Algorithms: Foundations and Applications (2007)

"Hit-and-run is fast and fun" to generate a random point in a high dimensional convex set K (Lovász/Vempala, MSR-TR-2003-05). More precisely, the hit-and-run random walk mixes fast independently of where it is started inside the convex set. To hit-and-run from a point ${x} \varepsilon {\mathcal{R}}^{n}$, a line L through x is randomly chosen (uniformly over all directions). Subsequently, the walk's next point is sampled from L ¿ K using a membership oracle which tells us whether a point is in K or not.Here the focus is on black-box optimization, however, where the function $f:{\mathcal{R}}^{n} \rightarrow \mathcal R$ to be minimized is given as an oracle, namely a black box for f-evaluations. We obtain in an obvious way a direct-search method when we substitute the f-oracle for the K-membership oracle to do a line search over L, and, naturally, we are interested in how fast such a hit-and-run direct-search heuristic converges to the optimum point x * in the search space ${\mathcal{R}}^{n}$.We prove that, even under the assumption of perfect line search, the search converges (at best) linearly at an expected rate larger (i.e. worse) than 1 ¿ 1/n. This implies a lower bound of 0.5 n on the expected number of line searches necessary to halve the approximation error. Moreover, we show that 0.4 n line searches suffice to halve the approximation error only with an exponentially small probability of $\exp(-\Omega(n^{1/3}))$. Since each line search requires at least one query to the f-oracle, the lower bounds obtained hold also for the number of f-evaluations.
A FUSE-Based Tool for Accessing Meteorological Data in Remote Servers
Authors: Keiichirou Ui, Toshiyuki Amagasa, Hiroyuki Kitagawa
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

This paper describes a tool for providing transparent access to online meteorological databases by way of local file system. The tool is based on FUSE, an implementation of usermode filesystem on Linux, and a user is allowed to deal with online meteorological data as if they were stored in his/her local file systems. The main target of this tool is scientists in meteorology those who are not familiar with computers and related technologies. For this reason, we attempt to provide easy ways for configuring, maintaining, and using the system. For speeding up the data transfer, we integrate a caching mechanism inside the system thereby making the number of HTTP requests smaller.
Human-competitive lens system design with evolution strategies
Authors: Christian Gagné, Julie Beaulieu, Marc Parizeau, Simon Thibault
Venue: Applied Soft Computing (2008)

Lens system design provides ideal problems for evolutionary algorithms: a complex non-linear optimization task, often with intricate physical constraints, for which there is no analytical solutions. This paper demonstrates, through the use of two evolution strategies, namely non-isotropic Self-Adaptive evolution strategy (SA-ES) and Covariance Matrix Adaptation evolution strategy (CMA-ES), as well as multiobjective Non-Dominated Sort Genetic Algorithm 2 (NSGA-II) optimization, the human competitiveness of an approach where an evolutionary algorithm is hybridized with a local search algorithm to solve both a classic benchmark problem, and a real-world problem.
Classification-Based Color Constancy
Authors: Simone Bianco, Gianluigi Ciocca, Claudio Cusano, Raimondo Schettini
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

In this work, we investigate how illuminant estimation techniques can be improved using indoor/outdoor classification. The illuminant estimation algorithms considered are derived from the framework recently proposed by Van de Weijer and Gevers. We have designed a strategy for the selection of the most appropriate algorithm on the basis of the classification results. We have tested the proposed strategy on a subset of the widely used Funt and Ciurea dataset. Experimental results clearly demonstrate that our strategy outperforms general purpose algorithms.
ACML: Capability Based Attack Modeling Language
Authors: Navneet Kumar Pandey, S. K. Gupta, Shaveta Leekha, Jingmin Zhou
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

In this paper, we propose Attack capability modelling language (ACML) used for capability model proposed by Zhau et. al. is a specification and description language that has been utilized to express the capability gained by attacker at each step in the intrusion process. These capabilities have been defined using the IDS alerts. Moreover the language also provides for the specification of compete attack scenarios in terms of capabilities of the intruder. This, in turn, helps to determine the state of the system, in terms of the extent of infiltration. ACML helps to avoid ambiguity in capability specifications while sharing among developers. We also propose Attack capability modelling framework (ACMF) which forms the basis of a capability model-based semi-automated alert correlation process, which has been used to detect and identify the attack scenarios from IDS alerts. The framework consists of the tools for the implementation of the algebraic structure of capability, as defined in Pandey et al., which are needed for the correlation algorithm. Additionally, the language also has features for customizing the definitions of these structures as well as for customizing the correlation algorithm. To verify the expressiveness of the language and its suitability in describing attack capability model, experimental result of standard benchmark has been discussed.
PUBSAT and NERVA launcher fuel sloshing dynamics
Authors: Radu D. Rugescu, Ion Predoiu, Sorin Aldea
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Structural dynamics of the NERVA orbital launcher and of the PUBSAT nanosatellite is presented, with emphasize on loading definition including dynamic effects of liquid sloshing phenomena in the propellant tanck. Mainly subjected to considerable longitudinal loads produced by the high thrust-to-weight ratio of the propulsion system, the structure of the satellite and launcher are also subjected to transversal loads due to simultaneous action of the attitude control system, augmented by fuel sloshing into the huge propellant tancks and due to atmospheric turbulence and high altitude jet streams too. The computational methods of the fuel sloshing modes and stability problems are presented with application in a coherent and confident design of the satellite and launcher vehicle. The real scale laboratory model concept of the PUBSAT is presented, with capability of three axis attitude control demonstration on the ground. The study is part of the UPB program of developing a low cost orbital system for applications in enhanced environmental policies in cooperation with Greece, USA and France.
Cancer Classification Based on Mass Spectrometry
Authors: Yihui Liu
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper wavelet analysis and Genetic Algorithm (GA) are performed to extract features and reduce dimensionality of mass spectrometry data. A set of wavelet features, which include detail coefficients and approximation coefficients, are extracted from mass spectrometry data. Detail coefficients are used to characterize the localized change of mass spectrometry data and approximation coefficients are used to compress mass spectrometry data, reducing the dimensionality. GA performs the further dimensionality reduction and optimizes the wavelet features. Experiments prove that this hybrid method of feature extraction is efficient way to characterize mass spectrometry data. 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
On Combining Classifiers by Relaxation for Natural Textures in Images
Authors: María Guijarro, Gonzalo Pajares, P. Javier Herrera
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

One objective for classifying textures in natural images is to achieve the best performance possible. As reported in the literature, the combination of classifiers performs better than simple ones. The problem is how they can be combined. We propose a relaxation approach, which combines two base classifiers, namely: the probabilistic Bayesian and the fuzzy clustering. The first establishes an initial classification, where the probability values are reinforced or punished by relaxation based on the support provided by the second. A comparative analysis is carried out against classical classifiers, verifying its performance.
Improving the prediction of helix-residue contacts in all-alpha proteins
Authors: Piero Fariselli, Alberto Eusebi, Pier Luigi Martelli, David T. Jones, Rita Casadio
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

In structural Bioinformatics a challenge is still to predict structure from sequence and one promising way to solve this problem is the prediction of protein contact maps. Several step forwards have been described in the last years; however still the prediction is not enough accurate to allow a reliable reconstruction of the 3D structure from the contact map and improvements on previous result are required. Here we focus on the prediction of a specific structural class of proteins, the so-called alpha proteins since specifically for these proteins the prediction accuracy of the contact maps is still lower than those of the other classes. In this paper we address the prediction of the helical residue contacts in all-alpha proteins in order to improve the existing methods on this specific task. Using a non redundant set of 300 all-alpha proteins we achieve an accuracy of 22% and a coverage of 19%, a result that overpasses by 7 percentage points those obtained by the best performing contact map predictors, presently available.
Gasbag polishing trajectory planning for free-form surface mould on machine vision
Authors: Shiming Ji, Yindong Zhang, Li Zhang, Mingsheng Jin, Yaqi Sheng
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

In order to obtain well-proportioned surface quality and high polishing efficiency in free-form surface mould polishing, an effective gasbag polishing technique based on the novel spinning-inflated-gasbag polishing tool is brought out firstly, and then a polishing trajectory planning on machine vision is present in this paper. Computer is fully used to analyze and process the original image of workpiece's contour in this approach, least square method in MATLAB is used to fit the polynomial equation of contour, then the polynomial equation of polishing trajectory will be obtained after coordinate transformation, and finally we enter the polynomial equation into the computer which controls robot to do the polishing operation. On the premise of guaranteeing the polishing precision, this method enables a remarkable reduction in manual work and a total automatic polishing through on-line robots as well, which in another word, highly improves polishing efficiency. This paper aims to prove the feasibility and universality of this method through theoretical analysis and experimental research.
Rate-diversity and resource-aware broadcast and multicast in multi-rate wireless mesh networks
Authors: Bao Hua Liu, Chun Tung Chou, Archan Misra, Sanjay Jha
Venue: Mobile Networks and Applications (2008)

This paper focuses on the problem of increasing the traffic capacity (volume of admissible traffic) of broadcast and multicast flows in a wireless mesh network (WMN). We study and suggest routing strategies where the process of constructing the forwarding tree considers three distinct features: (a) the ability of individual mesh nodes to perform link-layer broadcasts at multiple rates, (b) the wireless broadcast advantage, whereby a single broadcast transmission covers multiple neighboring receivers and (c) the residual transmission capacity at a WMN node, subject to intereference-based constraints from existing traffic flows in its neighborhood. Our metric of interest is the the total number of broadcast and multicast flows that can be admitted into the network, without resulting in unacceptable degradation in metrics such as packet loss and dissemination latency. Our discrete event simulations show that the broadcast tree construction heuristic which takes both transmission rate and residual bandwidth into account out-performs those that do not. Building on our work on resource-aware broadcast tree construction, we propose a resource-aware multicast tree construction algorithm which exploits the multiple link-layer rates, the wireless broadcast advantage and the amount of resources available. Simulation results show that this algorithm performs better than heuristics based on pruning a broadcast tree or shortest path trees.
Rank-biased precision for measurement of retrieval effectiveness
Authors: Alistair Moffat, Justin Zobel
Venue: ACM Transactions on Information Systems (TOIS) (2008)

A range of methods for measuring the effectiveness of information retrieval systems has been proposed. These are typically intended to provide a quantitative single-value summary of a document ranking relative to a query. However, many of these measures have failings. For example, recall is not well founded as a measure of satisfaction, since the user of an actual system cannot judge recall. Average precision is derived from recall, and suffers from the same problem. In addition, average precision lacks key stability properties that are needed for robust experiments. In this article, we introduce a new effectiveness metric, rank-biased precision, that avoids these problems. Rank-biased pre-cision is derived from a simple model of user behavior, is robust if answer rankings are extended to greater depths, and allows accurate quantification of experimental uncertainty, even when only partial relevance judgments are available.
A study of remembered context for information access from personal digital archives
Authors: Liadh Kelly, Yi Chen, Marguerite Fuller, Gareth J. F. Jones
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

Retrieval from personal archives (or Human Digital Memories (HDMs)) is set to become a significant challenge in information retrieval (IR) research. These archives are unique in that the items in them are personal to the owner and as such the owner may have personal memories associated with the items. It is recognized that the harnessing of an individual's memories about HDM items can be used as context data (such as user location at the time of item access) to aid retrieval. We present a pilot study, using one subject's HDM, of remembered context data and its utility in retrieval. Our results explore the types of context data best remembered for different item types and categories over time and show that context appears to become a more important factor in effective HDM IR over time as the subject's recall of contents declines.