ppxscal/embedding_network huggingface dataset:
Grid-based collaboration
Authors: Geoffrey C. Fox
Venue:  (2006)

Grids are managed Internet scale distributed services supporting collaboration and virtual organization. Collaboration over networks is becoming more and more popular and important in such areas as online conferencing, distance education, e-Science, e-Business, and e-Learning. We research the topic of shared event collaboration on Grid; we build three prototypes to investigate the issues from different software models and languages; we demonstrate this by making clients (collaboration entities) collaborate on events, taking advantages of the Grid for delivery of event messages and the computing powers of the clients' host computers. Grids are built from Web Services exchanging messages. Peer-to-peer Grids exploit the observation that the entities in both P2P systems and Grids are autonomous agents (peers, services) whose state is determined by exchanging messages. Our work addresses Peer-to-peer Grids and leverages the advantages of both so that they complement each other. We have developed collaborative prototypes in PowerPoint, Impress, and ReviewPlus applications to demonstrate this, using Message Oriented Middleware (NaradaBrokering Message Service) to provide a Grid messaging substrate that can support collaborative Grids. The work with ReviewPlus is in Interactive Data language (IDL), where the complete and proper definitions of event structures are supplied and elegant mechanisms of widget programming are guaranteed; the events are systematically and completely defined with respect to structures, levels, configurations, and associated types of event handler routines. The prototypes are instantiations of the Shared Event Model and demonstrations of the collaborative Peer-to-peer Grids. In order to promote the collaborative applications' usefulness and universal accessibility, we investigate a "Thin Client Collaboration Web Services" client architecture. We further develop a theoretical framework in terms of deterministic finite automata to describe our collaborative systems. We use the prototypes to define a general approach to shared event collaboration on the Grid.
Solving nonlinear partial differential equations using the modified variational iteration Padé technique
Authors: Tamer A. Abassy, Magdy A. El-Tawil, H. El Zoheiry
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, the modified variational iteration method (MVIM) is reintroduced with the enhancement of Pade approximants to lengthen the interval of convergence of VIM or MVIM when used alone in solving nonlinear problems. KdV, mKdV, Burger's and Lax's equations are used as examples to illustrate the effectiveness and convenience of the proposed technique.
From trading to eCommunity management: Responding to social and contractual challenges
Authors: Lea Kutvonen, Janne Metso, Sini Ruohomaa
Venue: Information Systems Frontiers (2007)

The increasing pressure for enterprises to join into agile business networks is changing the requirements on the enterprise computing systems. The supporting infrastructure is increasingly required to provide common facilities and societal infrastructure services to support the lifecycle of loosely-coupled, eContract-governed business networks. The required facilities include selection of those autonomously administered business services that the enterprises are prepared to provide and use, contract negotiations, and furthermore, monitoring of the contracted behaviour with potential for breach management. The essential change is in the requirement of a clear mapping between business-level concepts and the automation support for them. Our work has focused on developing B2B middleware to address the above challenges; however, the architecture is not feasible without management facilities for trust-aware decisions for entering business networks and interacting within them. This paper discusses how trust-based decisions are supported and positioned in the B2B middleware.
pFusion: A P2P Architecture for Internet-Scale Content-Based Search and Retrieval
Authors: Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimitrios Gunopulos
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

The emerging Peer-to-Peer (P2P) model has become a very powerful and attractive paradigm for developing Internet-scale systems for sharing resources, including files and documents. The distributed nature of these systems, where nodes are typically located across different networks and domains, inherently hinders the efficient retrieval of information. In this paper, we consider the effects of topologically aware overlay construction techniques on efficient P2P keyword search algorithms. We present the Peer Fusion (pFusion) architecture that aims to efficiently integrate heterogeneous information that is geographically scattered on peers of different networks. Our approach builds on work in unstructured P2P systems and uses only local knowledge. Our empirical results, using the pFusion middleware architecture and data sets from Akamai's Internet mapping infrastructure (AKAMAI), the Active Measurement Project (NLANR), and the Text REtrieval Conference (TREC) show that the architecture we propose is both efficient and practical.
Mining Consumers' Most Adaptive Products by Efficient Clustering Algorithm
Authors: Qingzhang Chen, Jianghong Han, Yuqing Chu, Xiaodong Ying
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Use clustering methods to discover the individual consumer's most adaptive products, which can support to make better decisions of marketing service. First, oriented from the consumer's transactional data that we will mine and targeted by finding some consumer's most adaptive products, we present a simple and efficient cluster algorithm to put the most similar data into the same group. Then we can find the mined consumer's most adaptive products from the cluster. Moreover, we propose a Boolean algorithm to improve the performance of the previous.
Addendum to "Code spectrum and the reliability function: Binary symmetric channel"
Authors: M. V. Burnashev
Venue: Problems of Information Transmission (2007)

A much simpler proof of Theorem 1 from [1] is presented; we use the notation and enumeration of formulas of [1]. The text below replaces the subsection General Case in [1, Section 4, p. 271].
Architectures for Silicon Nanoelectronics and Beyond
Authors: R. Iris Bahar, Dan Hammerstrom, Justin Harlow, William H. Joyner Jr., Clifford Lau, Diana Marculescu, Alex Orailoglu, Massoud Pedram
Venue: Computer (2007)

Although nanoelectronics won't replace CMOS for some time, research is needed now to develop the architectures, methods, and toolsto maximally leverage nanoscale devices and terascale capacity. Addressing the complementary architectural and system issues involvedrequires greater collaboration at all levels. The effective use of nanotechnology will call for total system solutions.
Improving the classroom environment
Authors: A. Klinger
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper summarizes effective teaching techniques for engineering identified during one of the technical sessions of the 1999 Frontiers in Education Conference in San Juan, Puerto Rico (A. Klinger, 1999). The paper involves the perspectives of twelve experienced college teachers engaged in a round-table discussion of "Ways to improve a classroom environment" and "Behaviors to avoid in the classroom". Those ideas are discussed and then supplemented with general advice and specific suggestions from the experience of the authors. Advice presented in the paper could benefit any teacher seeking to improve classroom effectiveness.
Bonding of polymer microstructures by UV irradiation and welding at low temperatures
Authors: R. Truckenmuller, P. Henzi, D. Herrmann, V. Saile, W. K. Schomburg
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A new bonding process has been developed for polymer microstructures, especially of Polymethylmethacrylate (PMMA), which avoids the problems caused by using adhesives or solvents or applying high temperatures. It is based on photo degradation of polymers. Moulded PMMA microchannels and microspectrometer gratings were covered with PMMA plates by ultraviolet irradiation of the joining faces and subsequent welding at low temperatures. Because of the low thermal load, structure details even in the submicrometer range remain dimensionally stable during the bonding process.
Building Reputations for Internet Clients
Authors: Songjie Wei, Jelena Mirkovic
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We propose a design of a client reputation system that can be used to reduce unwanted traffic in the Internet. Many reputation systems proposed in the trust literature are provider-oriented, but because of different use and adversary models, their techniques are not directly applicable to client reputation systems. We survey the challenges of building client reputations, discuss two different approaches to information collection - a reporter and a monitor model - and propose their combination that successfully handles major threats to reputation validity.
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs
Authors: Lowell Abrams, Donniell E. Fishkind
Venue: Discrete Computational Geometry (2007)

We prove that the genus of the boundary of a digital image is precisely half of the sum of the cycle ranks of three particular graphs: the "foreground graph" and "background graph," which capture topological information about the digital image and its complement, respectively, and the Reeb graph, relative to the natural height function, associated with the digital image's boundary. We prove several additional results, including a characterization of when the cycle rank of the Reeb graph fails to equal the genus of the digital image's boundary (which can happen by virtue of the failure of the natural height function on the boundary of the digital image to be a Morse function).
Fast recursive basis functions estimators for identification of time-varying processes
Authors: M. Niedzwiecki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

When system parameters vary rapidly with time the weighted least squares filters are not capable of following the changes satisfactorily-some more elaborate estimation schemes, based on the method of basis functions, have to be used instead. The basis functions estimators have increased tracking capabilities but are computationally very demanding. The paper introduces a new class of adaptive filters, based on the concept of postfiltering, which have improved parameter tracking capabilities, typical of the basis functions algorithms, but, at the same time, have pretty low computational requirements, typical of the weighted least squares algorithms.
A case study highlighting the benefits of a novel three dimensional evidence driven, shape model supported, segmentation algorithm
Authors: Gareth Price, Tom Marchant, Chris Moore
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

The use of time-of-treatment imaging is increasingly commonplace in radiotherapy, with cone beam CT (CBCT) the primary modality. To make full use of this technology, the tumour target and critical organs need to be segmented from the image volumes. CBCT images unfortunately often suffer from poor contrast and significant image artefacts compared with the standard CT image sets used in treatment planning, making this task more difficult. Delineations created using the common manual contouring tools suffer, in terms of observer variability, as a result of this. We have recently described a novel segmentation algorithm. The algorithm is fully three dimensional and incorporates prior knowledge but with ultimate control of the delineation morphology remaining with the user. Using multi-observer bladder delineations on a set of serial in-treatment CBCT image volumes, we colourwash three dimensional renderings of the mean surface to visualise how certain features in our algorithm and its implementation can help reduce inter-observer variability.
An Investigation of Cybercrime-Related Online Search Behavior vs General Search Behavior
Authors: Jingguo Wang, Nan Xiao, H. Raghav Rao
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Information seeking through search engines is one of the most common modes of accessing information over the internet. The purpose of the paper is to understand internet information foraging and user search behavior based on user search sessions. We characterize a search session by the number of the queries and the number of the clicks. A set of search logs from a large search engine is used in the study for the analysis. We identify user sessions using hierarchical agglomerative clustering. Based on information foraging theory, we propose a model that yields the probability distribution for the number of queries and the number of clicks in a search session. The model assumes that users make a sequence of decisions to proceed from one query to another query, continuing as long as the expected value of continuing search exceeds some threshold. The relationship between the number of queries and the number of clicks is examined, and it shows a strong linear relationship. We compare characteristics between the generally sampled search sessions and cybercrime-related search sessions. The results indicate strong regularities in user search sessions, and those two types of sessions show different patterns.
New Distance Measure for Microarray Gene Expressions Using Linear Dynamic Range of Photo Multiplier Tube
Authors: Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper deals with a new distance measure for genes using theirmicroarray expressions. The distance measure is called, "Maxrange distance", where an experiment specific normalization factor is incorporated in the computation of the distance. The normalization factor is dependent on the linear dynamic range of the photo multiplier tube (PMT) for scanning fluorescence intensities of the gene expression values. Superiority of this distance measure in the microarray gene ordering problem has been extensively established on widely studied microarray data sets by performing statistical tests.
An Evaluation of the Effortless Approach to Build Algorithm Animations with WinHIPE
Authors: Jaime Urquiza-Fuentes, J. Ángel Velázquez-Iturbide
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The use of algorithm visualizations in computer science education is not a new thing. Although there is a firm belief that graphical representations of algorithms are learning aids, empirical studies show that what is important is what the students do with the animations rather than what they see in them. In this paper we compare to kinds of interaction: viewing animations vs constructing animations. We have conducted a controlled experiment where a group of students (n=15) had to study an algorithm and complete a knowledge test about it and a subjective opinion questionnaire. Students were randomly divided in constructing and viewing groups. Results have been measured by means of learning outcomes, efficiency issues and student's subjective opinion. Results significantly evidence that builders obtained better results than viewers.
Development of high quality acoustic subband echo canceller using dual-filter structure and fast recursive least squares algorithm
Authors: Youhua Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A high quality acoustic subband echo canceller is developed based on a dual-filter structure and the fast recursive least squares (FRLS) algorithm. Methods for overcoming the instability problem of the FRLS algorithm and implementing it using the 32-bit fixed-point arithmetic are presented. A new tap-weight transfer method, which assures double talk detection, is proposed. Computer simulations demonstrate that fast convergence and fast tracking are achieved in an acoustic subband echo canceller using 32 subbands and a total of 4000-tap FIR filter for a 250 ms echo path. The combined use of the FRLS algorithm in the lowest eight frequency bands and the normalized least mean square (NLMS) algorithm in the rest of the frequency bands increases convergence rate for speech signals by five to ten times, and the echo return loss enhancement (ERLE) by more than 10 dB over those of using only the NLMS algorithm.
An instructional feedback model for improved learning and mentoring
Authors: D. L. Vines, J. R. Rowland
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

An instructional feedback model is presented to incorporate such elements as the course objectives, classroom lectures, course materials, and student written responses with the extra instruction obtained during out of class interactions. The value of each phase is described and costs which accompany the benefits of implementing the model are identified. The primary advantage of the instructional feedback model is that the professor can combine in a classroom setting both a technical curiosity among students about specific problems and an encouragement for productive discussions during office visits. Related to the more subjective components of the model, data are collected from several students at two different institutions. Out of class interactions with students are shown to yield extensive benefits and thereby justify the costs. The focus of the paper is to provide insights for beginning instructors who have never taught before and for research professors needing to improve teaching skills. Recommendations are made to enhance these valuable interactions with students.
Wireless and Wired Temperature Data System
Authors: Radek Kuchta, Radimir Vrba
Venue: Proceedings of the Second International Conference on Systems (2007)

Knowledge of temperature course during a certain time is needed in scientific, medical and industrial applications. In some applications, however, the recorded temperature course should be read wirelessly. This paper describes main principles applied in a set of mobile temperature data logger and portable interrogator with wireless transfer of digitized temperature values.
A Versioning Model for Enterprise Services
Authors: Rainer Weinreich, Thomas Ziebermayr, Dirk Draheim
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Software systems based on a service-oriented architecture (SOA) are partitioned into loosely coupled services. Services may be developed by different parties, deployed to different nodes and operated by different organizations. In an SOA services may evolve independently from one another, ideally without sacrificing interoperability. Supporting service evolution is still a topic of ongoing research. We present a versioning model for supporting the evolution of service-oriented architectures. We present suggestions for release management, evolution scenarios, and a versioning scheme for enterprise services. The presented approach has been developed for an SOA in the banking domain.
Experiment substituting in-class discussions with Email discussions
Authors: C. Schahczenski
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper describes the results of a one year experiment in which class discussions were held online, by exchanging electronic mail messages. This experiment was conducted for the computer ethics portion of a two semester software engineering course. The experiment was motivated by the question of whether class discussion could be effectively moved to an online format and how the dynamics would change with such a move. It was hoped that the online format could alleviate some of the problems of open-ended in-class discussions, such as domination by a few members and too many silent class members. It was found that there are several advantages to online discussions, making email a useful tool for enhancing class material. Furthermore, the experiment indicated that in-class discussions can be moved to the online format for small classes (ten students or less) of motivated students. The evidence did not support moving large classes to the online format. It also did not support moving classes of any size to the online format if the students are not motivated. In-class discussions provide more opportunities for facilitators to engage students than online discussions do. In conclusion, the online format requires greater instruction time and increased ingenuity in motivating students. While no inherent obstacle requires discussions to be in-class, limited resources make the online format impractical for most discussion situations.
Mass customization and configuration: Requirement analysis and constraint based modeling propositions
Authors: Michel Aldanondo, Khaled Hadj-Hamou, Guillaume Moynard, Jacques Lamothe
Venue: Integrated Computer-Aided Engineering (2003)

The purpose of this paper is, on the one hand, to identify to define and classify customization requirements and, on the other hand, to evaluate how generic modeling and configuration assistance within the Constraint Satisfaction Problem (CSP) framework can fulfil the requirements. The aim is to provide commercial configurator knowledge base designers with constraint based generic modeling elements for customizable industrial product. A first part recalls the main trends of the configuration problem. In a second part divided in four sections corresponding with different requirement set; each section proposes a definition of the requirement set, some CSP based modeling elements and a discussion about adequacy of relevant configuration assistance techniques.
A Social Group-Aware and Tunnel-Based Scatternet Formation Scheme
Authors: Myeong-a Yang, Yangwoo Ko, Dongman Lee
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Bluetooth is a major technology for short range wireless communication. Scatternets expand its use to larger networks. If communication patterns are known before scatternet formation, frequently communicating pairs could be connected directly or with fewer hops to enhance performance. Communication patterns are obtainable by observing traffic, but this approach is ineffective in a pervasive computing environment where interactions are mostly spontaneous. We propose to use social group membership as an estimate of communication patterns. The proposed scatternet formation scheme forms a scatternet per a social group and then connects scatternets through tunnels. In order to ensure that each communicating pair has a reasonable share of bandwidth, the proposed scheme considers the number of hops and branches and traffic distribution when interconnecting scatternets. Simulation results show that the proposed scheme not only enhances the total throughput of scatternets but also shares network capacity more fairly among communicating pairs.