ppxscal/embedding_network huggingface dataset:
Constructing a Multi-Monitor Displays System for Learning
Authors: Yen-Shou Lai, Yuan-Hou Chang, Pao-Ta Yu
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

This paper proposes a Multi-monitor Displays (MMD) System for assisting primary school students with their learning performance in music learning. The progress of computer technology has enabled an explosion in the visual ways of teaching presentation. In recent years, most educators present their instructional materials by using projectors primarily rather than chalkboards. Multimedia instruction is a good approach for learners to construct meaningful knowledge and to make referential connections between mental representations. This paper proposes a multi-monitor approach for constructing a multimedia aided learning system supported by some popular tools such as Microsoft PowerPoint, Microsoft Word, Microsoft Excel, and Adobe Acrobat Reader. Based on the Cognitive Theory of Multimedia Learning, this aided system is realized to combine and support verbal and pictorial forms. As a result, teachers can easily develop their teaching materials and present reference materials on two different monitors or screens. Our experiment reveals that by using the MMD system to simultaneously present musical notations and a listening map the results using multimedia presentation are superior to those of the conventional instruction methods when it comes to learning achievement and creative ability.
Design of the Electronic Protection Systems with Utilization of the Method of Analysis of Reliebility Structures
Authors: Adam Rosinski
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Paper presents process of design of the electronic protection systems with utilization of the method of analysis of reliability structures. Utilization of the method of analysis of reliability structures makes possible the enlargement of the values of the reliability coefficients of the designed systems by accomplishment of the analyses and simulations which allow to select of the optimal system structure with regard to the user requirements as well as the characteristics of the protected object (e.g. location of the protected objects in terrain, distances between buildings).
An Adaptative Recognition System Using a Table Description Language for Hierarchical Table Structures in Archival Documents
Authors: Isaac Martinat, Bertrand Coüasnon, Jean Camillerapp
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Archival documents are difficult to recognize because they are often damaged. Moreover, variations between documents are important even for documents having a priori the same structure. A recognition system to overcome these difficulties requires external knowledge. Therefore we present a recognition system using a user description. To use table descriptions in analyzing the image, our system uses the intersections of two rulings with a close extremity of one or each of these two rulings. We present some results to show how our system can recognize tables with a general description and how it can deal with noise with a more precise description.
The optimization of printed circuit board manufacturing by improving the drilling process productivity
Authors: Mircea Ancu
Venue: Computers and Industrial Engineering (2008)

With the rapid growth of printed circuit board technology today, board density is becoming an important concern. In every aspect of production, productivity and cost are crucial matters. The aim of this research is the optimization of printed circuit board manufacturing by improving the process productivity. Attention was focused on reducing tool path length and processing time. The paper is divided in two main parts. First part presents an original hybrid heuristic algorithm, for solving traveling salesman problem. The algorithm is based on the structure of a general optimization procedure, and is used to reduce the tool path length. Also, it is developed a practical mathematical model for printed circuit board processing time calculation. The case study on the second part of the paper shows basically the efficient use of the above algorithm in finding the optimal length of the tool path. It is shown the influence of stacked printed circuit board on process productivity. By means of its concepts management, the paper represent a real guide for optimal design of printed circuit board drilling technology.
Between small complex and large simplistic network simulators
Authors: Marat Zhanikeev
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Presently, discrete-even network simulation market is split among a number of popular simulators, such as NS-x, OM-NET++, Opnet, and maybe a few others. These tools are very common in research that targets small to medium size networks. Whenever one needs to simulate a large network of many tens of thousands nodes, the ability to use traditional network simulators is questionable. Since performance, and specifically, execution speed, is the number one priority in traditional network simulation, simulation runs are normally implemented as solid executables running in a memory space, to which there is a physical limit. This paper proposes a different paradigm of simulation that specifically aims at the ability to simulate large networks while supporting models in nodes with any level of complexity.
MoteFinder: a deployment tool for sensor networks
Authors: Olga Saukh, Robert Sauter, Jonas Meyer, Pedro José Marrón
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

The support for the actual deployment of wireless sensor networks is, notwithstanding an increased interest and work in this field, still an underdeveloped area of research. We discuss the use of two simple objects built from household materials -- a cantenna and a tinfoil cylinder -- to increase the directivity of an antenna of a standard mote. This MoteFinder can be used in a variety of applications including node localization and as a tool for selective communication with groups of nodes. We show in our evaluation that both devices provide a good sense of direction in indoor and outdoor scenarios and provide a foundation for future research.
Handling Topological Changes in the Topological Active Volumes Model
Authors: N. Barreira, M. G. Penedo, C. Alonso, J. Rouco
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

The Topological Active Volumes (TAV) model is a 3D deformable model based on the active nets and used for segmentation and reconstruction tasks. The model implements automatic procedures, the so called topological changes, that alter the mesh structure in order to segment complex surfaces, such as pronounced curvatures or holes, and detect several objects in the scene. This work analyses previous strategies for performing topological changes in the model and proposes a new methodology that overcomes the limitations of former strategies and improves the adjustment.
Evaluation of Automatically Assigned MeSH Terms for Retrieval of Medical Images
Authors: Miguel E. Ruiz, Aurélie Névéol
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents the results of the State University of New York at Buffalo (UB) team in collaboration with the National Library of Medicine (NLM) in the 2007 ImageCLEFmed task. We use a system that combines visual features (using a CBIR System) and text retrieval. We used the Medical Text Indexer (MTI) developed by NLM to automatically assign MeSH terms and UMLS concepts to the English free text annotations of the images. We also used an equivalent system called MAIF that automatically assigns MeSH and UMLS concepts to French free text. Our results indicate that the use of automatically assigned UMLS concepts improves retrieval performance significantly. We also identified specific aspects of the system that could be improved in the future, such as the method used to perform the automatic translation of medical terms and the addition of image classification to process queries targeted to a specific image modality.
An experimental study of inter-cell interference effects on system performance in unplanned wireless LAN deployments
Authors: Mesut Ali Ergin, Kishore Ramachandran, Marco Gruteser
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper, we report on our experimental study of the effects of inter-cell interference on IEEE 802.11 performance. Due to growing use of wireless LANs (WLANs) in residential areas and settings supporting flash crowds, chaotic unplanned deployments are becoming the norm rather than an exception. Environments in which these WLANs are deployed, have many nearby access points and stations on the same channel, either due to lack of coordination or insufficient available channels. Thus, inter-cell interference is common but not well-understood. According to conventional wisdom, the efficiency of an IEEE 802.11 network is determined by the number of active clients. However, we find that with a typical TCP-dominant workload, cumulative system throughput is characterized by the number of actively interfering access points rather than the number of clients. We verify that due to TCP flow control, the number of backlogged stations in such a network equals twice the number of active access points. Thus, a single access point network proves very robust even with over one hundred clients, while multiple interfering access points lead to a significant increase in collisions that reduces throughput and affects media traffic. Only two congested interfering cells prevent high quality VoIP calls. Based on these findings, we suggest a practical contention window adaptation technique using information on the number of nearby access points rather than clients. We also point out the need for collision-resilient rate adaptation in such a setting. Together these techniques can largely recover the 50% loss in cumulative throughput in a setting with four strongly interfering access points.
Search-Based Extraction of Component-Based Architecture from Object-Oriented Systems
Authors: Sylvain Chardigny, Abdelhak Seriai, Mourad Oussalah, Dalila Tamzalit
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Software architecture modeling and representation are a main phase of the development process of complex systems. In fact, software architecture representation provides many advantages during all phases of software life cycle. Nevertheless, for many systems, like legacy or eroded ones, there is no available representation of their architectures. In order to benefit from this representation, we propose an approach called ROMANTIC which focuses on extracting a component-based architecture of an existing object-oriented system. This approach considers this problem as a balancing problem of competing constraints which aims to select the best solution among all the possible architectures. Consequently, we present in this paper the identified constraints of this problem and its formulation as a search-based problem.
Building a Collision-Resistant Compression Function from Non-compressing Primitives
Authors: Thomas Shrimpton, Martijn Stam
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We consider how to build an efficient compression function from a small number of random, non-compressing primitives. Our main goal is to achieve a level of collision resistance as close as possible to the optimal birthday bound. We present a 2n-to-n bit compression function based on three independent n-to-n bit random functions, each called only once. We show that if the three random functions are treated as black boxes then finding collisions requires ¿(2 n/2/n c ) queries for c ≈ 1. This result remains valid if two of the three random functions are replaced by a fixed-key ideal cipher in Davies-Meyer mode (i.e., E K (x) ¿ x for permutation E K ). We also give a heuristic, backed by experimental results, suggesting that the security loss is at most four bits for block sizes up to 256 bits. We believe this is the best result to date on the matter of building a collision-resistant compression function from non-compressing functions. It also relates to an open question from Black et al. (Eurocrypt'05), who showed that compression functions that invoke a single non-compressing random function cannot suffice.
Model abstraction and temporal behavior analysis of genetic regulatory networks
Authors: Hiroyuki Kuwahara
Venue:  (2007)

With advances in technologies such as high throughput data collection and genome sequencing methods, the Human Genome Project which, among other things, determined the human DNA sequence and identified all the genes in human DNA was completed at least two years ahead of time. As these technologies are becoming more accurate, efficient, and cost effective and a massive amount of genomic and proteomic data are becoming available at a rapid pace, we are now in the position to face the challenge to understand how these genes coupled with environmental stimuli orchestrate the regulation of cell-level behaviors. However, understanding such complex systems is very expensive and is most likely impractical with wet-lab experiments alone as the amount and the complexity of data substantially increase, requiring the integration of computational methods to make the process more efficient. To allow for substantial acceleration in computational analysis, this dissertation develops a model abstraction methodology for biochemical systems which systematically performs various model abstractions to reduce the complexity of computational biochemical models. Our methodology is particularly useful for systems with small molecular counts that require the discrete and stochastic representation and thus demand substantial computational requirements. As a case study, this dissertation illustrates the application of individual abstraction methods to such systems. Furthermore, it demonstrates the application of collective abstraction methods at various accuracy levels to temporal behavior analysis of several genetic regulatory networks. This dissertation shows that analysis time of biologically relevant properties of such genetic regulatory networks can be improved from days of work to minutes of work using our methodology while maintaining reasonable accuracy.
Switching Set-Point Control of Nonlinear System Based on RBF Neural Network
Authors: Xiao-Li Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Multiple controllers based on multiple radial based function neural network(RBFNN) models are used to control a nonlinear system to trace a set-point. Considering the nonlinearity of the system, when the set-point value is time variant, a controller based on a fixed structure RBFNN can not give a good control performance. A switching controller which switches among different controller based on different RBFNN is used to adapt the varing set-point value and improve the output reponse and control performance of the nonlinear system. 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
The Design and Evaluation of MPI-Style Web Services
Authors: Ian Cooper, Yan Huang
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

This paper describes how Message Passing Web Services (MPWS) can be used as a message passing tool to enable parallel processing between WS-based processes in a web services oriented computing environment. We describe the evaluation tests performed to assess the point-to-point communications performance of MPWS compared to mpiJava wrapping MPICH. Following these evaluations we conclude that: using web services to enable parallel processing is a practical solution in coarse grained parallel applications; and that due to inter message pipelining, the MPWS system can, under certain conditions, improve on the communication times of mpiJava.
Preliminary coarse image registration by using straight lines found on them for constructing super resolution mosaics and 3D scene recovery
Authors: D. B. Volegov, D. V. Yurin
Venue: Programming and Computing Software (2008)

An algorithm of coarse image registration of a 3D scene taken from different camera perspectives is proposed. The algorithm uses information on geometrical parameters of straight lines found on the images and on distribution of color and/or brightness around these lines. Colors are taken into account by using the fuzzy logic technique. The result of the algorithm operation is a planar projective transformation (planar homography) matching approximately the images. In order to use the technique in algorithms of 3D scene reconstruction, an estimate of size of the window used for searching correspondent points after the coarse image registration is obtained.
Perfect Derived Propagators
Authors: Christian Schulte, Guido Tack
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

When implementing a propagator for a constraint, one must decide about variants: When implementing min , should one also implement max ? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance.This paper shows how to use variable views to derive perfect propagator variants: derived propagators inherit essential properties such as correctness and domain and bounds completeness.
Computational Modeling of Human-Robot Interaction Based on Active Intention Estimation
Authors: Takashi Omori, Ayami Yokoyama, Hiroyuki Okada, Satoru Ishikawa, Yugo Nagata
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In human interaction with a robot, estimation of the other's intention is thought of as an indispensable factor for achievement of a precise self action. But estimation of the other's intention is heavy loaded information processing, and we don't think humans are always doing it. So, in this paper, we propose a light loaded computational algorithm that achieves human-robot interaction without intention estimation in the self agent. In the method, the self agent assumes the other agent to estimate intention, and searches for an action that is easy to be interpreted by the other agent. We evaluated the effectiveness of the proposed model by computer simulation on a hunter task. This method should be positioned as one of the possible variations of intention-based interaction.
Canonicity!
Authors: Nachum Dershowitz
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. This leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms --- in this general framework --- leads to completeness or saturation. The method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.
Provably Secure N-Party Authenticated Key Exchange in the Multicast DPWA Setting
Authors: Weijia Wang, Lei Hu, Yong Li
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Until now, it is still an open problem to provide a provably secure and efficient protocol for treating the case in which n communication parties can authenticate each other and establish a secure session key with their respective passwords shared with a trusted server. Accordingly, in this paper we propose a solution in a formal way. Firstly, we review the strengthened EKE-M protocol--a maiden attempt to resolve the setting above and point out a subtle flaw in it that may cause unknown key sharing attacks. Next, based on previous work in the adversary model for key establishment protocols, we provide an extended one for the N-party setting. Finally, we propose a constant-round and provably secure generic construction of N-party different password-authentication (DPWA) key exchange protocols in the multicast setting.
A Single Layer Perceptron Approach to Selective Multi-task Learning
Authors: Jaisiel Madrid-Sánchez, Miguel Lázaro-Gredilla, Aníbal R. Figueiras-Vidal
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

A formal definition of task relatedness to theoretically justify multi-task learning (MTL) improvements has remained quite elusive. The implementation of MTL using multi-layer perceptron (MLP) neural networks evoked the notion of related tasks sharing an underlying representation. This assumption of relatedness can sometimes hurt the training process if tasks are not truly related in that way. In this paper we present a novel single-layer perceptron (SLP) approach to selectively achieve knowledge transfer in a multi-tasking scenario by using a different notion of task relatedness. The experimental results show that the proposed scheme largely outperforms single-task learning (STL) using single layer perceptrons, working in a robust way even when not closely related tasks are present.
On Complexity of Ehrenfeucht-Fraïssé Games
Authors: Bakhadyr Khoussainov, Jiamou Liu
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

In this paper we initiate the study of Ehrenfeucht-Fraïssé games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call Ehrenfeucht-Fraïssé problem. Given n ¿ ¿ as a parameter, two relational structures $\mathcal A$ and $\mathcal B$ from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game $G_n(\mathcal A,\mathcal B)$? We provide algorithms for solving the Ehrenfeucht-Fraïssé problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the values of these constants as functions of n.
Steady-State Modeling and Control of Molecular Weight Distributions in a Styrene Polymerization Process Based on B-Spline Neural Networks
Authors: Jinfang Zhang, Hong Yue
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The B-spline neural networks are used to model probability density function (PDF) with least square algorithm, the controllers are designed accordingly. Both the modeling and control methods are tested with molecular weight distribution (MWD) through simulation.