ppxscal/embedding_network huggingface dataset:
Abduction and chance discovery in science
Authors: Lorenzo Magnani
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

First of all I will illustrate in this paper that some typical internal abductive processes are involved in chance discovery and production (for example through radical innovations). Nevertheless, especially concrete manipulations of the external world constitute a fundamental passage in chance discovery: by a process of manipulative abduction it is possible to build prostheses (epistemic mediators) for human minds, by interacting with external objects and representations in a constructive way. In this manner it is possible to create implicit knowledge through doing and to produce various opportunity to find, for example, anomalies and fruitful new risky perspectives. This kind of embodied and unexpressed knowledge holds a key role in the subsequent processes of scientific comprehension and discovery. The paper describes some of the "templates" of manipulative behavior which account for the most common cognitive and epistemic acting related to chance discovery and chance production.
MPA: A Network-Centric Architecture for Micro-Mobility Support in IP and MPLS Networks
Authors: Eduardo Zagari, Rodrigo Prado, Eleri Cardozo, Maurício Magalhães, Tomás Badan, José Carrilho, Rossano Pinto, André Berenguel, Daniel Barboza, Daniel Moraes, Thienne Johnson, Lars Westberg
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Micro-mobility protocols aim to improve localized mobility by reducing the handover overheads. In this paper we present the Mobility Plane Architecture (MPA). This architecture was designed to support micro-mobility in standard IP or MPLS/GMPLS networks in a network-centric way, that is, the burden demanded by micro-mobility is placed on the network, not on the mobile nodes. The main advantages of this architecture are its independence of IPv6 and the absence of new protocols for supporting L3 mobility.
Fast elliptic curve cryptography on FPGA
Authors: William N. Chelton, Mohammed Benaissa
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper details the design of a new high-speed pipelined application-specific instruction set processor (ASIP) for elliptic curve cryptography (ECC) using field-programmable gate-array (FPGA) technology. Different levels of pipelining were applied to the data path to explore the resulting performances and find an optimal pipeline depth. Three complex instructions were used to reduce the latency by reducing the overall number of instructions, and a new combined algorithm was developed to perform point doubling and point addition using the application specific instructions. An implementation for the United States Government National Institute of Standards and Technology-recommended curve over GF (2163) is shown, which achieves a point multiplication time of 33.05 µs at 91 MHz on a Xilinx Virtex-E FPGA--the fastest figure reported in the literature to date. Using the more modern Xilinx Virtex-4 technology, a point multiplication time of 19.55µs was achieved, which translates to over 51 120 point multiplications per second.
A Search Space Reduction Algorithm for Improving the Performance of a GA-based QoS Routing Method in Ad-Hoc Networks
Authors: Leonard Barolli, Makoto Ikeda, Giuseppe De Marco, Arjan Durresi, Akio Koyama, Jiro Iwashige
Venue: International Journal of Distributed Sensor Networks (2007)

A lot of work has been done on routing in MANETs. However, the proposed routing solutions deal only with the best effort data traffic. Connections with Quality of Service (QoS) requirements are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, for MANETs only few QoS routing algorithms are proposed. For MANETs, approximated solutions and heuristic algorithms should be developed and QoS routing algorithms should be adaptive, flexible, and intelligent. In our previous work, we proposed a Genetic Algorithm (GA) based routing method for Mobile Ad-hoc Networks (GAMAN). In this paper, we enhance the proposed algorithm by adding an effective topology extraction algorithm to reduce the search space of GAMAN. We call this algorithm E-GAMAN. The E-GAMAN uses two QoS parameters for routing. The performance evaluation via simulations show that E-GAMAN has a good performance.
Dual-execution mode processor architecture
Authors: Md. Musfiquzzaman Akanda, Ben A. Abderazek, Masahiro Sowa
Venue: The Journal of Supercomputing (2008)

In this research work, we propose a novel embedded dual-execution mode 32-bit processor architecture (QSP32), which supports queue and stack programming models. The QSP32 core is based on a high performance produced order parallel queue architecture and is targeted for applications constrained in terms of area, memory, and power requirements. The design focuses on the ability to execute queue programs and also to support stack programs without a considerable increase in hardware to the base queue architecture. A prototype implementation of the processor is produced by synthesizing the high level model for a target FPGA device. We present the architecture description and design results in a fair amount of details. From the design and evaluation results, the QSP32 core efficiently executes both queue and stack based programs and achieves on average about 65 MHz speed. In addition, when compared to the base single-mode architecture (PQP), the QSP32 core requires only about 2.41% additional hardware. Moreover, the prototype fits on a single FPGA device, thereby eliminating the need to perform multi-chip partitioning which results in a loss of resource efficiency.
Misunderstandings about object-oriented design: experiences using code reviews
Authors: Scott A. Turner, Ricardo Quintana-Castillo, Manuel A. Pérez-Quiñones, Stephen H. Edwards
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this paper we present our experience using code reviews in a CS2 course. In particular, we highlight a series of misunderstandings of object-oriented (OO) concepts we observed as a by-product of the code review exercise. In our activity, we asked students to review code, rate it using a rubric, and to justify their explanation. The students were asked to review two solutions to a project from a previous year. Through examples of their explanations, we found that students had a number of basic misunderstandings of object-oriented principles. In this paper, we present our observations of the misunderstandings, and present some general observations of how code reviews can be used as an assessment tool in CS2.
A weaker criterion of asymptotic stability
Authors: Bo Gao, Weinian Zhang
Venue: Computers Mathematics with Applications (2008)

The classical criterion of asymptotic stability for differential equations requires the existence of a Liapunov function V with negative definite dV/dt. Successive efforts have been made to weaken the negative definiteness of dV/dt to semi-negative definiteness. Recently, it was given an interesting result that, under the boundedness of d^m^+^1V/dt^m^+^1, the negative definiteness can be weakened to that dV/dt@?0 together with that -(|dV/dt|+|d^2V/dt^2|+...+|d^mV/dt^m|+|d^m^+^pV/dt^m^+^p|) is negative definite. Unfortunately, its basic lemma is proved to be false by a counter example and cannot support this interesting result. In this paper we re-establish the weak criterion for asymptotic stability with less requirements.
On the convergence of iterative methods for stabilized saddle point problems
Authors: Yiqin Lin
Venue: International Journal of Computer Mathematics (2007)

The convergence of the inexact Uzawa method for stabilized saddle point problems was analysed in a recent paper by Cao, Evans and Qin. We show that this method converges under conditions weaker than those stated in their paper.
Developing women for careers in information and computer science
Authors: Mary Beth Rosson
Venue: Journal of Computing Sciences in Colleges (2008)

As girls enter their teenage years, they often lose interest in the concepts and activities of information and computer science. By the time high school girls consider options for college, their interest in computer-related educational programs is considerably lower than that of their male counterparts. This trend is troubling, both because of concerns about the number of students entering these programs, and more specifically because of the desire for diverse perspectives and values in computing professionals. To combat the trend, researchers and educators have begun to explore a variety of novel pedogogy and other interventions that might better attract and retain women in these disciplines (e.g., pair programming or peer support, computational media as a source of introductory programming problems). In this talk, I discuss the challenges of recruiting and retaining women in computer-related educational programs, and present preliminary work on our own intervention that is based on building and leveraging social networks: wConnect, a developmental learning community in the College of Information Sciences and Technology at The Pennsylvania State University.
Teaching Grid Technologies to PhD Students, Part 2: Course Structure and Experiences
Authors: Dana Petcu
Venue: IEEE Distributed Systems Online (2008)

Grid technologies serving large distributed systems can help address many application areas' computing and storage needs. Consequently, the scientific and large-scale information processing communities are increasingly interested in studying large-scale distributed systems, such as Grid-based ones. Unfortunately, there are relatively few reports on best practices in teaching Grid topics that teachers can follow when they start building a new Grid-related course. The second installment of this two-part department presents a case study of the author's experiences in teaching Grid computing to PhD students over the last three years.
Soil moisture retrieval from MODIS data in Northern China Plain using thermal inertia model
Authors: G. Cai, Y. Xue, Y. Hu, Y. Wang, J. Guo, Y. Luo, C. Wu, S. Zhong, S. Qi
Venue: International Journal of Remote Sensing (2007)

Soil moisture plays an important role in surface energy balances, regional runoff, potential drought and crop yield. Early detection of potential drought or flood is important for the local government and people to take actions to protect their crop. Traditionally measurement of soil moisture is a time-consuming job and only limited samples could be collected. Many problems would be results from extending those point measurements to 2D space, especially for a regional area with heterogeneous soil characteristics. The emergency of remote-sensing technology makes it possible to rapidly monitor soil moisture on a regional scale. Thermal inertia represents the ability of a material to conduct and store heat, and in the context of planetary science, it is a measure of the subsurface's ability to store heat during the day and reradiate it during the night. One major application of thermal inertia is to monitor soil moisture. In this paper, a thermal inertia model was developed to be suitable in situations whether or not the satellite overpass time coincides with the local maximum and minimum temperature time. Besides, the sensibilities of thermal inertia with surface albedo and the surface temperature difference were discussed. It shows that the surface temperature difference has more effects on the thermal inertia than the surface albedo. When the temperature difference is less than 10 Kelvin degrees, 1 Kelvin degree error of temperature difference will lead to a big fluctuation of thermal inertia. When the temperature difference is more than 10 Kelvin degrees, 1 Kelvin degree error of temperature difference will cause a small change of thermal inertia. The temperature difference should be larger than 10 Kelvin degrees when the thermal inertia model is selected to derive soil moisture or other applications. Based on this thermal inertia model, the soil moisture map was obtained for North China Plain. It shows that the averaged difference between the soil moisture values derived from MODIS data and in situ measured soil moisture data is 4.32%. This model is promising for monitoring soil moisture on a large regional scale.
A Novel Technique for Real-Time Internet Radio Recorder on Non-DSP Embedded System
Authors: Lain-Jing Hwang, Chien-Chou Shih, I-Ting Kuo
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The capability of providing real-time multimedia player over the Internet is an important future application for embedded system. However, the main challenge of such an application is the limitation on computation performance and memory size in architecture of embedded system, especially while encoding and decoding. In this paper, a Streaming Packet Tracer (SPT) algorithm is proposed for real-time tracing the streaming packet header. Based on the SPT algorithm, we present a novel software-based technique which enables a non-DSP embedded system to play and record real-time streaming audio simultaneously. To verify the feasibility of the proposed technique, a real-time Internet radio recorder has been implemented on SBC-2410x embedded system successfully. The experimental results show that our achievement has reduced the CPU usage rate from over 100% to about 30%-40% in comparison with other recording method.
Paths to stardom: calibrating the potential of a peer-based data management system
Authors: Mihai Lupu, Beng Chin Ooi, Y. C. Tay
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database applications. Indexing methods are adapted on top of P2P networks and querying methods are developed to handle the data distribution on different nodes. These procedures largely depend on how nodes are connected to each other. So far, limited attempts have been made to compare all these systems in a generalized framework. This is because the systems are quite different from each other, and there are so many of them that brute force comparison is practically impossible. Fortunately, it has recently been observed that a large subset of the most important P2P networks share a common algebraic and combinatorial base, in the form of Cayley graphs. The specific requirements of Peer-based Data Management Systems (PDMS), such as query completeness, range queries, load balancing, communication overhead, and scalability are strongly related to the properties of the underlying graphs, and naturally, some graphs are better than others. We conduct a comprehensive graph-theoretic analysis from the point of view of PDMS and identify the necessary conditions for a graph to be considered a potential network structure for a PDMS. In so doing, we provide a basis for the future development of such networks. We complement our analytical study with extensive experimental results and identify three measures that provide significant information about the potential of a [Cayley] graph to support the requirements of a PDMS.
Performance evaluation for DRED discrete-time queueing network analytical model
Authors: Hussein Abdel-Jaber, Mike Woodward, Fadi Thabtah, Amer Abu-Ali
Venue: Journal of Network and Computer Applications (2008)

Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our analytical model on two-queue nodes queueing network. Furthermore, we compare between the proposed analytical model and three known active queue management (AQM) algorithms, including DRED, random early detection (RED) and adaptive RED, in order to figure out which of them offers better quality of service (QoS). We also experimentally compare the queue nodes of the proposed analytical model and the three AQM methods in terms of different performance measures, including, average queue length, average queueing delay, throughput, packet loss probability, etc., aiming to determine the queue node that offers better performance.
Hierarchical Clustering of Time-Series Data Streams
Authors: Pedro Pereira Rodrigues, João Gama, Joao Pedroso
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

This paper presents and analyzes an incremental system for clustering streaming time series. The Online Divisive-Agglomerative Clustering (ODAC) system continuously maintains a tree-like hierarchy of clusters that evolves with data. ODAC uses a top-down strategy. The splitting criterion is a correlation-based dissimilarity measure among time series, splitting each node by the farthest pair of streams, which defines the diameter of the cluster. In stationary environments expanding the structure leads to a decrease in the diameters of the clusters. The system uses a merge operator, which agglomerates two sibling clusters, in order to react to changes in the correlation structure between time series. The split and merge operators are triggered in response to changes in the diameters of existing clusters. The system is designed to process thousands of data streams that flow at high-rate. The main features of the system include update time and memory consumption that do not depend on the number of examples in the stream. Moreover, the time and memory required to process an example decreases whenever the cluster structure expands. Experimental results on artificial and real data assess the processing qualities of the system, suggesting competitive performance on clustering streaming time series, exploring also its ability to deal with concept drift.
Kinds of Contexts and their Impact on Semantic Similarity Measurement
Authors: Krzysztof Janowicz
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Semantic similarity measurement gained attention over the last years as a non-standard inference service for various kinds of knowledge representations including description logics. Most existing similarity measures compute an undirected overall similarity, i.e., they do not take the context of the similarity query into account. If they do, the notion of context is usually reduced to the selection of particular concepts for comparison (instead of comparing all concepts within an examined ontology). The importance of context in deriving meaningful similarity judgments is beyond question and has been examined within recent research. This paper argues that there are several kinds of contexts. Each of them has its own impact on the resulting similarity values, but also on their interpretation. To support this view, the paper introduces definitions for the examined contexts and illustrates their influence by example.
Distributed Real-Time Traffic Data Management
Authors: Joonwoo Lee, Jaeil Hwang, Dong-Hoon Shin, Yunmook Nah, Hae-Young Bae, Doo-Hyun Kim
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

As ITS technology evolves, very large volume of traffic data can be obtained in real-time. Traffic data are continuously produced and they can be considered as a kind of stream data. Currently, such traffic data are not maintained permanently because of the storage limitations of operational systems. Therefore, it was impossible to compare temporal historical patterns over long time periods. In this paper, we propose a traffic data management scheme, which can handle historical data as well as current data. The proposed scheme is based on the GALIS architecture, which is a cluster-based distributed computing system architecture that consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. Some experimental results showing performance factors are also explained.
Penalty for power reduction -: performance or schedule or yield?
Authors: Bodhisatya Sarker, Jaswinder Ahuja, Arijit Dutta, Srinath D., Kaip Sridhar, Radhakrishnan Nair, Jayant Lahiri
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

It is often said "It is always give and take" and that "there is no such thing as a free lunch". The same would hold true for Low Power designs. The questions oft asked is What are the trade-offs for reduction in power? What would be the limits of power reduction, before it starts impacting other parameters? Designs are generally characterized by four predominant parameters - performance, timing, area and power. As design and manufacturing became different disciplines supported by independent teams, two additional parameters were added to the design characterization, schedule and yield. Schedule implies the time taken to get the design to the desired performance and yield indicates the percentage of designs that meet the performance criterion, after manufacturing. Performance, schedule and yield have become a proxy for the expertise built in the design team and the capability of the tools to handle the complex designs. Teams with expertise and access to appropriate tools, can build high performance designs faster and at the desired yields. Traditionally performance has been correlated with timing or the maximum operating frequency of the design. More recently power is becoming an important area of concern, and is forcing designers to design within the power specifications of the design. Power has been seen as limiting the timing performance for many designs. In this key panel, we will discuss: What could be some of the best practices to reduce power while maintaining timing performanceHow could one analyze the performance, schedule, yield trade-off with an exampleDiscuss industry-wide effort to reduce the penalty for further power reduction
Suitable EAI architectures are necessary to fit interoperability challenges of SME's in less developed countries
Authors: Gerald Knoll, Karsten Tolle, Claudia Guglielmina
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

In this paper, we describe the main barriers for interoperability between different SME's in less developed countries. We explain how we address these barriers by technologies like UBL and approach how to include and support humans into the B2B process using a federated integration approach instead of forcing everything to be done through the system.