ppxscal/embedding_network huggingface dataset:
A BIOLOGICALLY INSPIRED METHOD FOR CONCEPTUAL IMITATION USING REINFORCEMENT LEARNING
Authors: Hossein Mobahi, Majid Nili Ahmadabadi, Babak Nadjar Araabi
Venue: Applied Artificial Intelligence (2007)

Learning by imitation can provide agents with a natural and effective means for transferring knowledge when brain-to-brain connection is infeasible. Natural mechanisms for imitation demonstrate strong abstraction and conceptualization capabilities, however, computational models that have been proposed for imitative learning barely address these fundamental features. Inspired by functions of human brain constituents and exploiting ideas enthused by mirror neurons and the multi-store model of memory, we propose a new model for learning by imitation capable of developing relational concepts. In our model, memory gradually organizes sensory data into concepts through reinforcement learning and consolidation, while mirror neurons maintain an extendible repertoire of familiar actions connected to corresponding concepts. We also discuss the relation between modeling behavior of concept-oriented agents in terms of mathematical functions and relevant biological evidence of mirror neurons. Eventually, we evaluate our method in a phoneme acquisition experiment through real interaction with humans.
XML data integration in SixP2P: a theoretical framework
Authors: Tadeusz Pankowski
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

In the paper we discuss the problem of data integration in a P2P environment. In such setting each peer stores schema of its local data, mappings between the schema and schemas of some other peers (peer's partners), and schema constraints. The goal of the integration is to answer queries formulated against arbitrarily chosen peers. The answer consists of data stored in the queried peer as well as data of its direct and indirect partners. We focus on defining and using mappings, schema constraints, query propagation across the P2P system, and query reformulation in such scenario. A special attention is paid to discovering missing values using schema constraints and to reconcile inconsistent data using reliability levels assigning to the sources of data. The discussed approach has been implemented in SixP2P system (Semantic Integration of XML data in P2P environment).
A Model Checking Approach to Protocol Conversion
Authors: Roopak Sinha, Partha S. Roop, Samik Basu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

System-on-chip verification is an active research area. Of particular interest is protocol conversion, where two components with different protocols are controlled to communicate accurately. We present an approach to protocol conversion using model checking. The temporal logic ACTL is used to describe desired behaviour and finite state machines are used for protocol description. We use tableau-based converter construction and prove that a converter exists only when a successful tableau can be constructed. Liveness is incorporated so that converters satisfy additional constraints on protocol communication. A NuSMV-based implementation has been created and we present results on various problems including a large NuSMV example.
Intrusion Detection for High-Speed Networks Based on Producing System
Authors: Ken Chen, Fei Yu, Cheng Xu, Yan Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper firstly analyzed the front pattern matching algorithm of intrusion detection system, and improved on the pattern matching algorithm. Having immediately analyzed Rete algorithm and aimed at its shortage, the paper introduced the FRete net algorithm on the basis of Rete net algorithm constituting an inference machine based on FRete matching algorithm, which could infer logical suspicious facts. Then the authors discussed and designed an intrusion detection system based on high-speed networks, and finally established a simulation and experiment platform to test the performance of IDS
Life, the universe, and the future of mobile computing
Authors: Roy Want
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Phenomenal growth in the performance and functionality of portable electronic devices has transformed our notion of mobile computing from its roots in the early 90's. In fact, some of the advances are so remarkable that 20 years ago they would have seemed improbable; the exponential growth in the density of solid-state storage being a prime example. Looking forward, can we expect a similar leap in mobile capabilities over the next 20 years? In this presentation, I will examine the trends in processing, storage, wireless networking, displays, data-entry, sensing and battery design, trying to predict the properties of future mobile computers. In order to better understand how the evolution of mobile technology will progress, I will also consider how our lives, needs and work practices might shape the design of these systems, and provide us with powerful tools that are not only functional, but enable a richer user experience.
HOMER: Home-Based Object-Relational Medical Electronic Record
Authors: Joseph M. Woodside
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This article introduces a lab project which can be applied as part of a capstone course for undergraduate students within a computer science or information system degree program. The intent of the coursework is to provide students with a practical application of learned concepts and a forum for gaining additional knowledge and experience prior to entering the workforce. This article identifies coursework literature coverage limitations, and integrates multiple current and advanced areas such as database setup, querying, object-relational concepts, programming, and web technologies/design in order to develop HOMER (Home-based Object-relational Medical Electronic Record). Presented are the details of the course including the project introduction, course outline, assignments, discussion of technology topics, sample code, and demonstrated outputs.
Fault Tolerance Management for a Hierarchical GridRPC Middleware
Authors: Aurelien Bouteiller, Frederic Desprez
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The GridRPC model is well suited for high performance computing on grids thanks to efficiently solving most of the issues raised by geographically and administratively split resources. Because of large scale, long range networks and heterogeneity, Grids are extremely prone to failures. GridRPC middleware are usually managing failures by using 1) TCP or other link network layer provided failure detector, 2) automatic checkpoints of sequential jobs and 3) a centralized stable agent to perform scheduling. Most recent developments have provided some new mechanisms like the optimal Chandra~\&~Toueg~\&~Aguillera failure detector, most numerical libraries now providing their own optimized checkpoint routine and distributed scheduling GridRPC architectures. In this paper we aim at adapting to these novelties by providing the first implementation and evaluation in a grid system of the optimal fault detector, a novel and simple checkpoint API allowing to manage both service provided checkpoint and automatic checkpoint (even for parallel services) and a scheduling hierarchy recovery algorithm tolerating several simultaneous failures. All those mechanisms are implemented and evaluated on a real grid in the \diet middleware.
A Cross-National Study of Computer News Sites: Global News, Local Sites
Authors: Nathaniel D. Poor
Venue: The Information Society (2007)

The Internet is not only an object of and a tool for study; it is also both simultaneously global and local. In order to address how global and how local it is, this study compares the news content of 1 week from four different computer news web sites in four different countries (using four different languages). These sites use the same code base and all strive to be the same in terms of computer culture. They are global in their reach and in the news they cover, yet they are all local in terms of language and geography. They are ideal locales to study how forces of the global and the local play out on the highly connected Internet, using Google language tools for translation. Findings were surprising in that they showed very little in terms of a pattern of any sort. This is similar to a 1953 UNESCO study of newspapers, but strange in that given the passing of 50 years and the connectedness of the Internet, greater overlap was expected. Link destinations for stories that were on more than one site were also examined, and the Japanese site had more in common with the American site while the two European sites were more alike in this lens. This is also surprising, given that an East/West split was expected. Little work in this specific area was found, and this study highlights some of the questions and methodological difficulties that need to be addressed.
Efficient algorithms for incremental utility mining
Authors: Jieh-Shan Yeh, Chih-Yang Chang, Yao-Te Wang
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Temporal data mining is the activity of finding interesting correlations or patterns in large temporal data sets. On the other hand, utility mining aims at identifying the itemsets with high utilities. In 2006, Tseng et al. introduced the temporal utility mining which is extended from both temporal association rule mining and utility mining. In this study, we investigated the incremental utility mining which can identify all high temporal utility itemsets in a specified time period on an incremental transaction database. Two efficient algorithms, Incremental Utility Mining (IUM) and Fast Incremental Utility Mining (FIUM), were proposed. The experimental results also showed that both algorithms are efficient.
An experiment with reflective middleware to support grid-based flood monitoring
Authors: Danny Hughes, Phil Greenwood, Gordon Blair, Geoff Coulson, Paul Grace, Florian Pappenberger, Paul Smith, Keith Beven
Venue: Concurrency and Computation: Practice Experience (2008)

Flooding is a growing problem, which affects more than 10% of the U.K. population. The cost of damage caused by flooding correlates closely with the warning time given before a flood event, making flood monitoring and prediction critical to minimizing the cost of flood damage. This paper describes a wireless sensor network (WSN) for flood warning, which is capable of not only integrating with remote fixed-network grids for computationally intensive flood modelling purposes but also performing on-site grid computation. This functionality is supported by the reflective and component-based GridKit middleware, which provides support for both WSN and grid application domains. Copyright &copy; 2007 John Wiley Sons, Ltd.
SOA What?
Authors: Michael J. Carey
Venue: Computer (2008)

Data services will be integral to designing, building, and maintaining SOA applications.
(d,1)-total labeling of graphs with a given maximum average degree
Authors: Mickaël Montassier, André Raspaud
Venue: Journal of Graph Theory (2006)

The (d,1)-total number $\lambda _{d}^{T}(G)$ of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance between the color of a vertex and its incident edges is at least d. In this paper, we prove that $\lambda_{d}^{T}(G) \leq \Delta (G) + 2d - 2$ for connected graphs with a given maximum average degree. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
Authors: J. A. De Loera, J. Lee, P. N. Malkin, S. Margulies
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution over K. In this paper, we investigate an algorithm aimed at proving combinatorial infeasibility based on the observed low degree of Hilbert's Nullstellensatz certificates for polynomial systems arising in combinatorics and on large-scale linear-algebra computations over K. We report on experiments based on the problem of proving the non-3-colorability of graphs. We successfully solved graph problem instances having thousands of nodes and tens of thousands of edges.
Integrating nonlinear heat conduction equation with source term
Authors: Iryna Dmytruk
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Lie symmetries and similarity solutions have been described for a family of nonlinear parabolic problems of heat conduction through a radiant plasma. As in the technological application, the governing equation contains a time dependent source term. Then considering boundary value problems, the boundary conditions are time dependent, too.
Software Architectures for Task-Oriented Computing
Authors: David Garlan
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Recent advances in ubiquitous computing, autonomic computing, and artificial intelligence have led to a desire to better support user-oriented tasks by placing more intelligence in the computing infrastructure. This infrastructure helps mediate between computing resources and legacy applications on the one hand, and a user's high-level goals on the other hand. In this talk I survey recent research in developing software architectures to support these new capabilities. Key features of these architectures are the ability to interface with legacy applications, but still add considerable support for user tasks; the ability to incorporate machine learning so that the system adapts to the user over time; and the ability to cope with resource variability and user mobility. I outline some of the consequent software engineering challenges that arise in this setting.
A Mechanical Approach for Deriving Algorithmic Programs
Authors: haihe shi, jinyun xue, dawei du
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Formal algorithm derivation is valuable in ensuring resultant algorithm correctness, revealing ideas behind algorithm, and studying automatic algorithm design. An approach called mechanical partition-and-recur (MPAR for short) for deriving algorithmic program is presented. It is built on top of formal method PAR, and provides a series of strategies for mechanical algorithm derivation. Using MPAR, a given problem is partitioned into sub-problems mechanically, according to which the problem specification is transformed to seek the relation between the solutions of original problem and its sub-problems, and then the executable language program is produced automatically. MPAR makes as much work as possible be shifted from the algorithm designers, and thus enables the improvement of productivity and reliability of software.
Updated Data Dissemination for Applications with Time Constraints in Mobile Ad Hoc Networks
Authors: Takahiro Hara, Sanjay Kumar Madria
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In our previous work, we proposed few updated data dissemination methods to refresh old replicas efficiently in mobile ad hoc networks. These methods disseminate updated data items every time when owners of original data items update the items or every time two mobile hosts are newly connected with each other and this causes heavy traffic in the entire network. In this paper, we assume applications that periodically execute read operations with strict deadlines to data items and propose few alternative updated data dissemination methods. These methods reduce the traffic for data dissemination while keeping a high success ratio for read operations.
Highly Efficient Call Admission Control for Wireless Multimedia Traffic
Authors: S. Chatziperis, P. Koutsakis, M. Paterakis
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The development of efficient Call Admission Control schemes for next generation wireless cellular networks remains a challenging and yet unresolved problem, due to the rapidly growing number of multimedia applications and to user mobility. In recent work we have modeled the behavior of H.263 videoconference traces with the use of a Discrete Autoregressive (DAR(1)) model. Based on this model, we then proposed an efficient CAC scheme for videoconference traffic over cellular networks, which uses precomputed traffic scenarios for its decision-making and which was shown to clearly excel in comparison with well-known existing approaches, in terms of Quality of Service (QoS) provisioning to users receiving videoconference traffic. In this paper, we continue our work by enhancing and further studying our scheme for the case of “unknown users” attempting to enter the network and for the case of providing call admission control to web users as well as videoconference ones.
Static contact micro four-point probes with <11nm positioning repeatability
Authors: Dirch H. Petersen, Ole Hansen, Torben M. Hansen, Peter R. E. Petersen, Peter Bøggild
Venue: Microelectronic Engineering (2008)

In recent years micro four-point probes (M4PP) have proved a powerful tool for electrical characterization of thin film due to a high surface sensitivity and spatial resolution. However, a common problem is the probe lifetime which is limited mainly due to mechanical wear of the electrode material on the cantilever tips. In this paper we present a three-way flexible M4PP that enables static contact upon surface contact. We experimentally demonstrate that the static contact results in little or no frictional wear of the electrode material. In addition we investigate the repeatability of the effective spatial electrode position and find that the standard deviation of each electrode position is more than one order of magnitude smaller than the length scale of the tip contact area.
Understanding cultural heritage experts' information seeking needs
Authors: Alia Amin, Jacco van Ossenbruggen, Lynda Hardman, Annelies van Nispen
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

We report on our user study on the information seeking behavior of cultural heritage experts and the sources they use to carry out search tasks. Seventeen experts from nine cultural heritage institutes in the Netherlands were interviewed and asked to answer questionnaires about their daily search activities. The interviews helped us to better understand their search motivations, types, sources and tools. A key finding of our study is that the majority of search tasks involve relatively complex information gathering. This is in contrast to the relatively simple fact-finding oriented support provided by current tools. We describe a number of strategies that experts have developed to overcome the inadequacies of their tools. Finally, based on the analysis, we derive general trends of cultural heritage experts' information seeking needs and discuss our preliminary experiences with potential solutions.
Intransitive Noninterference in Dependence Graphs
Authors: Christian Hammer, Jens Krinke, Frank Nodes
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

In classic information flow control (IFC), noninterference guarantees that no information flows from secret input channels to public output channels. However, this notion turned out to be overly restrictive as many intuitively secure programs do allow some release. In this paper we define a static analysis that allows intransitive noninterference in combination with context sensitive analysis for Java bytecode programs. In contrast to type systems that annotate variables, our approach annotates information sources and sinks. To the best of our knowledge this is the first IFC technique which is flow-, context-, and objectsensitive. It allows IFC for realistic languages like Java or C and offers a mechanism for declassification to accommodate some information leakage for cases where traditional noninterference is too restrictive.
On Improving WLAN Medium Access Control via Uniform Transmission Cycle and Performance Analysis
Authors: Warakorn Srichavengsup, Siwaruk Siwamogsatham, Suvit Nakpeerayuth, Lunchakorn Wuttisittikulkij
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we propose a modified backoff mechanism that can be used in conjunction with the existing backoff algorithms for medium access sharing among wireless stations via the CSMA protocol. With a proper design, the resulting scheme can achieve better short-term throughput fairness performance without degradation in the average throughput performance. The main idea of the proposed scheme is to virtually create a transmission cycle for each wireless station. After getting a turn to access the medium, each wireless station is not allowed to start the backoff procedure for its next transmission until it has waited for some additional number of backoff slots. Moreover, the average throughput performance of the proposed scheme is analytically evaluated in this work via the Markov chain approach. The simulation results show that the performance analysis model derived here for the proposed scheme is valid and accurate. In addition, the proposed scheme noticeably improves the short-term throughput fairness performance of the conventional backoff scheme.
Pre-Processing of CT Brain Images for Content-Based Image Retrieval
Authors: Fei Peng, Kehong Yuan, Shu Feng, Wufan Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, we propose an effective pre-processingmethod of CT brain images to provide consistent featurefor content-based medical image retrieval. The key steps inpre-processing include cutting out background region, usingellipse to correct lean imaging angle, and normalization.We take vast CT brain images as experimental data toevaluate the method. Experimental results show the effectof pre-processing.
Why software agents can be effective in biomedical sciences
Authors: Giuliano Armano
Venue: Multiagent and Grid Systems (2007)

Nowadays most of the software systems, tools, and applications in biomedical sciences are very complex and require high flexibility. Seemingly, it is difficult to identify a common underlying technology. In fact, each specific research field imposes its own constraints on the corresponding solutions. Nevertheless, at least from a software engineering perspective, the agent technology appears to fit the requirements imposed by such different research fields and encompasses most of the biomedical systems, tools, and applications in a unifying framework.