ppxscal/embedding_network huggingface dataset:
Unified vs. tailored analogies: effects on conceptual knowledge acquisition
Authors: Valerie J. Shute, Richard Catrambone
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

You have to learn to walk before you can run. Or do you? This simple metaphor for acquiring new knowledge and skills has been implemented in countless pedagogies, but may not be completely true. For instance, in ACT-R [Anderson, 1993] all knowledge starts in declarative form and productions (for carrying out procedures) are formed through an analogy process. Likewise, in SMART [Shute, 1995], the underlying learning theory posits a unidirectional link from symbolic knowledge (SK) acquisition (i.e., knowing basic, abstract curriculum elements), to procedural skill (PS) acquisition (i.e., the application of that knowledge). Conceptual knowledge (CK) is the deeper-level understanding about relationships among SK items as well as the rationale for choosing among different procedures (i.e., the "why" of the material).
Markov Chain Inference From Microarray Data
Authors: Igor Lorenzato Almeida, Denise Regina Pechmann, Adelmo Luis
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Array technologies have made it straightforward to monitor simultaneously the expression pattern of thousands of genes. Thus, a lot of data is being generated and the challenge now is to discover how to extract useful information from these data sets. Microarray data is highly specialized, involves several variables in a non-linear and temporal way, demanding nonlinear recurrent free models, which are complex to formulate and to analyse in a simple way. Markov Chains are easily visualized in the form of graphs of states, which show the influences among the gene expression levels and their changes in time. In this work, we propose a new approach to microarray data analysis, by extracting a Markov Chain from Microarray Data. Two aspects are of interest for the researcher: the time evolution of the genic expression and their mutual influence in the form of regulatory networks.
Evaluation Metrics for Ontology Complexity and Evolution Analysis
Authors: Zhe YANG, Dalu Zhang, Chuan YE
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

With the tremendous development in size, the complexity of ontology increases. Thus ontology evaluation becomes extremely important for developers to determine the fundamental characteristics of ontologies in order to improve the quality, estimate cost and reduce future maintenance. Our research examines the concepts and their hierarchy in conceptual model, the common feature of the most ontologies, which reflects the fundamental complexity. We suggest a well-defined metrics suite of complexity, which mainly examine the quantity, ratio and correlativity of concepts and relationships, to evaluate ontologies from the viewpoint of complexity and its evolution. In the study, we measure three ontologies in GO to verify our metrics. The results indicate that this metrics suite works well, and the biological process ontology is the most complex one from the view of complexity, and the molecular function ontology is the unsteadiest one from the view of evolution.
A Dynamic Semantic Framework to Support Multiple User Viewpoints during Information Retrieval
Authors: Landong Zuo, Stefan Poslad
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

Semantic models offer powerful benefits to mediate between and to reason about heterogeneous data sources, when data from multiple data resources needs to be combined. A single domain conceptualisation and semantics can be projected as a single information viewpoint over multiple information sources, targeted to answer core queries by domain expert type users. This has the advantage that it avoids the necessity of users needing to be familiar with the stored data schema and associated query interfaces. However, some users may not be familiar with the full semantic model in order to pose and refine their queries under the strict constraints of a single conceptualisation. The single conceptualisation may also not adequately capture the operational nuances, side effects and errors in answering data queries. The development and application of a more flexible approach to derive more targeted views, adapted for different types of users and applications, is reported in this paper.
Efficient Incremental Subspace Clustering in Data Streams
Authors: Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clustering streaming time series, based on the sliding window paradigm. More specifically, we use the concept of ®-clusters in each time instance separately. A subspace ®- cluster consists of a set of streams, whose value difference is less than ® in a consecutive number of time instances (dimensions). The clusters can be continuously and incrementally updated as the streaming time series evolve. The proposed technique is based on a careful examination of pair-wise stream similarities for a subset of dimensions and then, it is generalized for more streams per cluster. Performance evaluation results show that the proposed pruning criteria are important for search space reduction, and that the cost of incremental cluster monitoring is computationally more efficient than reclustering.
Requirements for Next Generation Middleware Implementations
Authors: Kavi Kumar Khedo
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Many current and emerging distributed applications require new classes of services from the next generation middleware architectures. The traditional middleware frameworks have become inadequate for next-generation service provisioning due to its poor scalability, customizability, manageability, and reliability. Challenges from existing and new types of applications, including support for multimedia, real-time requirements and mobility seems to indicate the need for defining a new architecture for open distributed systems. The new architecture should be designed from the beginning with flexibility and adaptability in mind. This can be achieved by defining an open engineering middleware platform that is run time configurable and allows inspection and adaptation of the underlying components. This paper will examine the middleware requirements for future distributed systems including grid, RFID, and wireless sensor systems and identifies key research areas. In each area, crucial middleware research issues to support future applications that will enable seamless service provisioning in heterogeneous, dynamically varying computing and communication environments are discussed. The paper also reports on some existing research prototypes with a focus towards their suitability as next generation middleware. Furthermore, the paper proposes a research agenda for next generation middleware to cater for emerging grid, RFID and wireless sensor systems.
On the interdependence of routing and data compression in multi-hop sensor networks
Authors: Anna Scaglione, Sergio Servetto
Venue: Wireless Networks (2005)

We consider a problem of broadcast communication in sensor networks, in which samples of a random field are collected at each node, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b) we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model - to the best of our knowledge, this connection had not been studied before.
Answer Clustering and Fusion in a User-Interactive QA System
Authors: Feng Min, Liu Wenyin, Wei Chen
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The need of answer clustering and fusion in a userinteractive question answering (QA) system is identified and its user interface and enabling technology are presented in this paper. This function aims to help a user to efficiently browse all the answers and find the correct answer to a specific question by clustering answers into groups and providing a representative (fused) answer for each group. The clustering approach proposed in this paper includes a measurement of semantic similarity between answers and an incremental soft-moVMF algorithm. An answer fusion method is proposed, which uses concept vector and authority of data sources to extract the summary for the answers in each cluster. Experiments and user studies show that the UI and the methods are effective.
The Linux implementation of a log-structured file system
Authors: Ryusuke Konishi, Yoshiji Amagai, Koji Sato, Hisashi Hifumi, Seiji Kihara, Satoshi Moriai
Venue: ACM SIGOPS Operating Systems Review (2006)

Toward enhancing the reliability of the Linux file system, we are developing a new log-structured file system (NILFS) for the Linux operating system. Instead of overwriting existing blocks, NILFS appends consistent sets of modified or newly created blocks continuously into segmented disk regions. This writing method allows NILFS to achieve faster recovery time and higher write performance. The address of the block that is written to changes for each write, which makes it difficult to apply modern file system technologies such as B-tree structures. To permit such writing on the Linux kernel basis, NILFS has its own write mechanism that handles data and meta data as one unit and allows them to be relocated. This paper presents the design and implementation of NILFS focussing on the write mechanism.
Simulation and or (operations research) in combination for practical optimization
Authors: Nico van Dijk, Erik van der Sluis, René Haijema, Assil Al-Ibrahim, Jan van der Wal
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Should we pool capacities or not? This is a question that one can regularly be confronted with in operations and service management. It is a question that necessarily requires a combination of queueing (as OR discipline) and simulation (as evaluative tool) and further steps for optimization. It will be illustrated that a combined approach (SimOR) of Simulation (techniques and tools) and classical Operations Research (queueing, linear programming and scheduling) can be most beneficial. First, an instructive example of parallel queues will be provided which shows the necessary and fruitful combination of queueing and simulation. Next, the combined approach will also be illustrated for the optimization of: call centers, checking-in at airports, blood platelet production, and train scheduling for railways. Whether we should pool or not is thus just one simple question for which this SimOR approach can be most fruitful if not necessary for practical optimization.
Towards the Management of Information Quality in Proteomics
Authors: Alun Preece, Binling Jin, Paolo Missier, Suzanne Embury, David Stead, Al Brown
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

We outline the application of a framework for managing information quality (IQ) in proteomics. The approach allows scientists to define the quality characteristics that are of importance in their particular domain, by extending a generic ontology of IQ concepts. Two quality indicators are defined for proteomic experiments: hit ratio and mass coverage. We describe how our framework allows experiments marked-up in a standard format (e.g. PEDRo) to be annotated with these computed indicators, and how the annotations can be viewed using a convenient plugin to the commonly-used Pedro data entry tool.
Grammar Processing Outside the Focus of Attention: an MEG Study
Authors: Yury Shtyrov, Friedemann Pulvermüller, Risto Näätänen, Risto J. Ilmoniemi
Venue: Journal of Cognitive Neuroscience (2003)

To address the cerebral processing of grammar, we used whole-head high-density magnetoencephalography to record the brain's magnetic fields elicited by grammatically correct and incorrect auditory stimuli in the absence of directed attention to the stimulation. The stimuli were minimal short phrases of the Finnish language differing only in one single phoneme (word-final inflectional affix), which rendered them as either grammatical or ungrammatical. Acoustic and lexical differences were controlled for by using an orthogonal design in which the phoneme's effect on grammaticality was inverted. We found that occasional syntactically incorrect stimuli elicited larger mismatch negativity (MMN) responses than correct phrases. The MMN was earlier proposed as an index of preattentive automatic speech processing. Therefore, its modulation by grammaticality under nonattend conditions suggests that early syntax processing in the human brain may take place outside the focus of attention. Source analysis (single-dipole models and minimum-norm current estimates) indicated grammaticality dependent differential activation of the left superior temporal cortex suggesting that this brain structure may play an important role in such automatic grammar processing.
Real attacks on virtual networks: Vivaldi out of tune
Authors: Mohamed Ali Kaafar, Laurent Mathy, Thierry Turletti, Walid Dabbous
Venue: Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense (2006)

The recently proposed coordinates-based systems for network positioning have been shown to be accurate, with very low distance prediction error. However, these systems often rely on nodes coordination and assume that information reported by probed nodes is correct. In this paper, we identify different attacks against coordinates embedding systems and study the impact of such attacks on the recently proposed Vivaldi decentralized positioning system. We present a simulation study of attacks carried out by malicious nodes that provide biased coordinates information and delay measurement probes. We experiment with attack strategies that aim to (i) introduce disorder in the system, (ii) fool honest nodes to move far away from their correct positions and (iii) isolate a particular node in the system through collusion. Our findings confirm the susceptibility of the Vivaldi System to such attacks.
Learning to commit in repeated games
Authors: Stéphane Airiau, Sandip Sen
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning of efficient outcomes in repeated plays of incomplete information games when only opponent's actions but not its payoffs are observable. We use a two-stage protocol that allows a player to unilaterally commit to an action, allowing the other player to choose an action knowing the action chosen by the committed player. The motivation behind commitment is to promote trust between the players and prevent them from mutually harmful choices made to preclude worst-case outcomes. Our agents learn whether commitment is beneficial or not. Interestingly, the decision to commit can be thought of as expanding the action space and our proposed protocol can be incorporated by any learning strategies used for playing repeated games. We show the improvement of the outcome efficiency of standard learning algorithms when using our proposed commitment protocol. We propose convergence to pareto optimal Nash equilibrium of repeated games as desirable learning outcomes. The performance evaluation in this paper uses a similarly motivated metric that measures the percentage of Nash equilibria for repated games that dominate the observed outcome.
Low rank approximate solutions to large Sylvester matrix equations
Authors: K. Jbilou
Venue: Applied Mathematics and Computation (2006)

In the present paper, we propose an Arnoldi-based method for solving large and sparse Sylvester matrix equations with low rank right hand sides. We will show how to extract low-rank approximations via a matrix Krylov subspace method. We give some theoretical results such an expression of the exact solution and upper bounds for the norm of the error and for the residual. Numerical experiments will also be given to show the effectiveness of the proposed method.
A Multi-Purpose Ontology-Based Approach for Personalized Content Filtering and Retrieval
Authors: David Vallet, Ivan Cantador, Miriam Fernandez, Pablo Castells
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

Personalized multimedia access aims at enhancing the retrieval process by complementing explicit user requests with implicit user preferences. We propose and discuss the benefits of the introduction of ontologies for an enhanced representation of the relevant knowledge about the user, the context, and the domain of discourse, as a means to enable improvements in the retrieval process and the performance of adaptive capabilities. We develop our proposal by describing techniques in several areas that exemplify the explotation of the richness and power of formal and explicit semantics descriptions, and the improvements therein.
Array calibration by Fourier series parameterization: scaled principal components method
Authors: M. A. Koerber, D. R. Fuhrmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Based on a Fourier series model for an antenna array's response and a typical calibration procedure, a maximum likelihood (ML) solution for the array parameters can be derived. The authors review the Fourier series model of an array's response and introduce a suboptimum method of determining the model parameters. The performance of the suboptimal solution is significantly influenced by the scaling of the principal components (M.A. Koerber, 1992). A method of scaling based on a QR decomposition is presented. This method provides for approximately an order of magnitude reduction in error over previously reported scaling methods. This approach has the significant advantage of requiring no a priori knowledge of the array's response. Simulation results compare the use of QR decomposition based scaling with the ML solution.
Identifying refactoring opportunities by identifying dependency cycles
Authors: Hayden Melton, Ewan Tempero
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

The purpose of refactoring is to improve the quality of a software system by changing its internal design so that it is easier to understand or modify, or less prone to errors and so on. One challenge in performing a refactoring is quickly determining where to apply it. We present a tool (Jepends) that analyses the source code of a system in order to identify classes as possible refactoring candidates. Our tool identifies dependency cycles among classes because long cycles are detrimental to understanding, testing and reuse. We demonstrate our tool on a widely-downloaded, open-source, medium-sized Java program and show how cycles can be eliminated through a simple refactoring.
Control discrete systems and their applications to beam dynamics optimization
Authors: E. D. Kotina
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

In this paper a mathematical model is considered that allows simultaneous optimization of program motion and that of ensemble of perturbed motions. Analytical expressions for functional variations are suggested that allows constructing various directed methods of optimization. This mathematical apparatus can be effectively used to beam dynamics optimization in the drift-tube linear accelerators. 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
Analysis and design of minimax-optimal interpolators
Authors: Hyeokho Choi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Studies the problem of interpolating a bandlimited signal from its nonuniform samples. The authors consider a class of interpolation algorithms that includes the least-squares optimal interpolator proposed by J.L. Yen, and derive a closed-form expression of the interpolation error for interpolators of this type. The expression for the interpolation error shows that the error depends on the eigenvalue distribution of a matrix, which is specified by the set of sampling points. The authors notice that the usual sinc-kernel interpolator is an approximation to the Yen interpolator, and suggest a method of choosing the weighting coefficients in the sinc-kernel interpolator. The new sinc-kernel interpolator is superior to the sinc interpolator with the usual Jacobian (area) weighting and is far easier to implement than the Yen interpolator. 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
A DUPS on Ubiquitous Computing
Authors: Changbok Jang, Sunghun Cho, Moohun Lee, Euiin Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

User's demanding which get the information and service without constraint of time and location were increased due to develop the mobile device and speed of network. And for this reason, there are studying about ubiquitous. Various contexts which was brought in this ubiquitous environment recognized user's action through the sensors, got it by infer to use the user information, and it can provide services better. Because the services exists various place on ubiquitous network, application which provide services spent much time on searching it to fit the context. Therefore the technique for which reducing time of service providing to store and process the services efficiently is studying. But it is difficult to provide service more appropriate and quick, because it's only stored simple information of service. For this reason, we suggested technique that stored location and time, frequency information of often used service among various services, put the service which expect to use in the location on time to use. We can reduce using and searching time of service through technique and system that suggested in this paper, and is able to provide service more better and exact than previous technique.