ppxscal/embedding_network huggingface dataset:
eLearning Content Provision
Authors: R. Anane, S. Crowther, J. Beadle, G. Theodoropoulos
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

It is widely acknowledged that the acceptance of eLearning frameworks requires the adoption of, and compliance with standards. This requirement is especially relevant to the design and delivery of courseware. This paper is concerned with learning content provision mediated by a learning management system (LMS), which complies with Instructional Management System (IMS) standards. The requirements for the LMS, as a tool for course management, are specified through different perspectives. Issues related to content creation and delivery are identified and addressed from the perspectives of the instructor, the learner, as well as the requirements of specific learning content. The learning management system is put in context by considering ways of enhancing content mediation in eLearning. The system is part of a research programme aimed at providing a framework for agent-supported eLearning.
Managing and Securing Web Services with VPNs
Authors: Lina Alchaal, Vincent Roca, Michel Habert
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Web Services constitute a set of technologies thatmany believe will change the web communication landscapewithin the next few years. They offer standardized andeasy communications for distributed systems over the Internet.However their dynamic and distributed naturerequires a well-managed system, and pending security issuesprevent their widespread adoption. Meanwhile thereis a big rage toward the use of Virtual Private Networks(VPNs) to secure communications in a cost-effective environmentlike the Internet. In this paper we explain howto merge these two technologies in a new powerful hybridmodel that: (1) enables an easy management of web services,(2) provides web services security thanks to the useof dynamic and programmable VPNs, and (3) remains simpleand fully integrated.
Multiple RNA Structure Alignment
Authors: Zhuozhi Wang, Kaizhong Zhang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

RNA structures can be viewed as a kind of special strings with some characters bonded with each other. The question of aligning two RNA structures has been studied for a while, and there are several successful algorithms that are based upon different models. In this paper, by adopting the model introduced in [18], we propose two algorithms to attack the question of aligning multiple RNA structures. We reduce the multiple RNA structure alignment problem to the problem of aligning two RNA structure alignments.
A Tree-Structured Query Interface for Querying Semi-Structured Data
Authors: Scott Newman, Z. Meral Ozsoyoglu
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

XML is a semi-structured data format that is quicklybecoming the standard means of communicationacross the Internet. We introduce a simple, powerful,unambiguous tree-structured user-interface for queryingsemi-structured data. It emphasizes ease-of-useand provides generic access to XML repositories. Animplementation of this interface called the PathwaysExplorer has been built in the context of biologicalpathways. The implementation illustrates some basiccapabilities, such as selection, projection, equijoins,and self-joins. It builds efficient queries using SQL,and it has been shown that XQuery's performancewould be comparable. Future implementations mightallow semantic client-side caching, aggregation andgrouping, recursion, and set operations.
A formal approach for modeling and verification of RTCORBA-based applications
Authors: Matteo Rossi, Dino Mandrioli
Venue: ACM SIGSOFT Software Engineering Notes (2004)

We introduce a formal model for describing Real-Time CORBA-based applications, and a set of guidelines to formally check that the design of such an application is consistent with its specification. The model and the guidelines are then applied to the verification of a simple test application.
Shortest route computation in distributed systems
Authors: Jinchang Wang, Thomas Kaempke
Venue: Computers and Operations Research (2004)

This paper presents a polynomial time algorithm for computing the shortest route in distributed systems. A distributed system is composed of autonomous subsystems and a central computing server. A subsystem stores and maintains its own data, and is obligated to provide the central computing server with the information about its intersections with other subsystems. The approach presented in this paper is for the central computing server to compute the shortest route that crosses subsystems based on the partial local information provided by the subsystems. It is the first efficient algorithm that guarantees to find the shortest route in such a distributed system.
On a Construction of a Hierarchy of Best Linear Spline Approximations Using a Finite Element Approach
Authors: David F. Wiley, Martin Bertram, Bernd Hamann
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

We present a method for the hierarchical approximation of functions in one, two, or three variables based on the finite element method (Ritz approximation). Starting with a set of data sites with associated function, we first determine a smooth (scattered-data) interpolant. Next, we construct an initial triangulation by triangulating the region bounded by the minimal subset of data sites defining the convex hull of all sites. We insert only original data sites, thus reducing storage requirements. For each triangulation, we solve a minimization problem: computing the best linear spline approximation of the interpolant of all data, based on a functional involving function values and first derivatives. The error of a best linear spline approximation is computed in a Sobolev-like norm, leading to element-specific error values. We use these interval/triangle/tetrahedron-specific values to identify the element to subdivide next. The subdivision of an element with largest error value requires the recomputation of all spline coefficients due to the global nature of the problem. We improve efficiency by 1) subdividing multiple elements simultaneously and 2) by using a sparse-matrix representation and system solver.
Evaluating a polynomial and its reverse
Authors: Jan van Leeuwen
Venue: ACM SIGACT News (1978)

The reverse of an nth degree polynomial p(x) is rev(p) (x) = xnp(x-1). We show that one can evaluate p and rev(p) in only n+0(log n) multiplications modulo {x-1}. The method uses an algorithm to evaluate reciprocal polynomials of degree n in only [n/2] + 1 + l([n/2]) multiplications modulo {x-1}, where l(k) denotes the length of a shortest addition chain for k.
Addressing architecture for Brain-like Massively Parallel Computers
Authors: Abey Abraham Cohen
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper is concerned with a new type of computer architecture being massively parallel. It describes novel approaches that were developed to solve task execution performance problems inherent in all current parallel computers. It also gives an overview of current addressing methods issues, unique algorithms for storage retrieval and communication between processing nodes scattered in a volume of space, developed for the Brain-like machine that comprises of numerous numbers of nuronic like nodes positioned on unique bus tracks connected to each other forming a geographical map containing complex 'Network layers', comprising of multiple communicating nodes forming mini, maxi, intelligent processing layers. The unique bus tracks containing Mini and or Maxi processing nodes are fully connected to form the next generation network for the Brain-like massively parallel distributed or tightly coupled computing systems. A Simulation that demonstrates the operation of the novel architecture addressing nodes positioned in a volume of space is given.
The optimisation of space structures using evolution strategies with functional networks
Authors: S. Rajasekaran, Shalu Mohan, Osama Khamis
Venue: Engineering with Computers (2004)

In this work, the input for large space structures is created using the Formex algebra of the Formian software. The different search and optimisation algorithm known as evolution strategies (ESs) has been applied to find the optimal design of the space trusses considering the areas of the members of the space structures as discrete variables. The objective function is obtained for first few generations by using a structural analysis package such as Feast and for other generations by functional networks (FNs). Initially, to obtain the data for a functional network, a structural package such as Feast is used. The use of a functional network is motivated by time consuming repeated analyses required by evolution strategies during the optimisation process. In addition, a multilevel optimisation approach is implemented by reducing the size of the search space for individual design variables in each successive level of the optimisation process for the first example; for the remaining three examples, a functional network has been combined with evolution strategies to get away with the use of a structural analysis package and a multilevel optimisation technique. The numerical tests presented demonstrate the computational advantage of the proposed approach of ESs combined with functional networks (FNs) which become pronounced for fairly large scale optimisation problems involving about 700 degrees of freedom.
Enforcing Robust Declassification
Authors: Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Noninterference requires that there is no informationflow from sensitive to public data in a given system. However,many systems perform intentional release of sensitiveinformation as part of their correct functioning and thereforeviolate noninterference. To control information flowwhile permitting intentional information release, some systemshave a downgrading or declassification mechanism.A major danger of such a mechanism is that it may causeunintentional information release. This paper shows that arobustness property can be used to characterize programsin which declassification mechanisms cannot be exploitedby attackers to release more information than intended. Itdescribes a simple way to provably enforce this robustnessproperty through a type-based compile-time program analysis.The paper also presents a generalization of robustnessthat supports upgrading (endorsing) data integrity.
Scalable Duplication Strategy with Bounded Availability of Processors
Authors: Guodong Li, Youtao Zhang, Yongjin Lin, Yaochun Huang
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper we present a new task selection scheme anda list-scheduling algorithm for scheduling DAGs ontohomogeneous/heterogeneous systems with boundedavailability of processors. Specifically, forbiddenduplications and superfluous duplications are eliminatedin the task selection phase and the processor selectionphase respectively. Simulation results show that theproposed algorithm outperforms other high performancealgorithms when the availability of processors is restrained.
Comparison of Two Schemes for Automatic Keyword Extraction from MEDLINE for Functional Gene Clustering
Authors: Ying Liu, Brian J. Ciliax, Karin Borges, Venu Dasigi, Ashwin Ram, Shamkant B. Navathe, Ray Dingledine
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

One of the key challenges of microarray studies is to derive biological insights from the unprecedented quatities of data on gene-expression patterns. Clustering genes by functional keyword association can provide direct information about the nature of the functional links among genes within the derived clusters. However, the quality of the keyword lists extracted from biomedical literature for each gene significantly affects the clustering results. We extracted keywords from MEDLINE that describes the most prominent functions of the genes, and used the resulting weights of the keywords as feature vectors for gene clustering. By analyzing the resulting cluster quality, we compared two keyword weighting schemes: normalized z-score and term frequency-inverse document frequency (TFIDF). The best combination of background comparison set, stop list and stemming algorithm was selected based on precision and recall metrics. In a test set of four known gene groups, a hierarchical algorithm correctly assigned 25 of 26 genes to the appropriate clusters based on keywords extracted by the TDFIDF weighting scheme, but only 23 og 26 with the z-score method. To evaluate the effectiveness of the weighting schemes for keyword extraction for gene clusters from microarray profiles, 44 yeast genes that are differentially expressed during the cell cycle were used as a second test set. Using established measures of cluster quality, the results produced from TFIDF-weighted keywords had higher purity, lower entropy, and higher mutual information than those produced from normalized z-score weighted keywords. The optimized algorithms should be useful for sorting genes from microarray lists into functionally discrete clusters
Development of a High-performance Domain-wise Parallel Direct Solver for Large-scale Structural Analysis
Authors: Jeong Ho Kim, Chang Sung Lee, Seung Jo Kim
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Most of researches for large-scale parallel structural analysis using finite element method have focused on iterative solution methods since direct solution methods generally have many difficulties and disadvantages for large-scale problems. However, due to the numerical robustness of direct methods that guarantees the solution to be obtained within estimated time, direct methods are much more desirable for general application of large-scale structural analysis, as well as due to ease of use which makes most of structural engineers prefer direct methods. In this research, we propose a new parallel direct solver for large-scale finite element analysis that can overcome most of difficulties and disadvantages of direct methods by using domain-wise approach for direct methods. By using the proposed solver with our own structural analysis code, we can show good scalability as a direct method and can solve the largest problem ever solved by direct solvers.
Grid-Based Metadata Services
Authors: Ewa Deelman, Gurmeet Singh, Malcolm P. Atkinson, Ann Chervenak, Neil P. Chue Hong, Carl Kesselman, Sonal Patil, Laura Pearlman, Mei-Hui Su
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Data sets being managed in Grid environments today aregrowing at a rapid rate, expected to reach 100s of Petabytesin the near future. Managing such large data sets poseschallenges for efficient data access, data publication and datadiscovery. In this paper we focus on the data publication anddiscovery process through the use of descriptive metadata.This metadata describe the properties of individual data itemsand collections. We discuss issues of metadata services inservice rich environments, such as the Grid. We describe therequirements and the architecture for such services in thecontext of Grid and the available Grid services. We present adata model that can capture the complexity of the datapublication and discovery process. Based on that model weidentify a set of interfaces and operations that need to beprovided to support metadata management. We present aparticular implementation of a Grid metadata service, basingit on existing Grid services technologies. Finally we examinealternative implementations of that service.
The wow factor: preconceptions and expectations for data analysis software in qualitative research
Authors: Katie MacMillan, Thomas Koenig
Venue: Social Science Computer Review (2004)

Discussions on computer-assisted qualitative data analysis software often begin with the assumption that research will automatically be improved through the use of such software. Consequently, reviews frequently focus on practical concerns with the various software packages. Rather than theoretical considerations of its suitability to the method of analysis, such descriptions frequently treat software as the method of analysis. The following article calls for a clearer understanding of the role of software within research, with critical evaluation focusing on the methodological issues surrounding software use, as well on its technological innovations. The authors examine a number of factors that foster a tendency toward uncritical appraisal--including unrealistic expectations of the software as a methodology in itself; the treatment of qualitative analysis as a single, homogenized category; and the use of grounded theory as a legitimating link between tool and method.
Virtual learning in the biological sciences: pitfalls of simply "putting notes on the web"
Authors: Chris Evans, Nicola J. Gibbons, Kavita Shah, Darren K. Griffin
Venue: Computers Education (2004)

Computer-based learning (CBL) is well established and its benefits are widely reported. It has found considerable utility in recent years with the explosion in interest in the use of the Web as a knowledge medium. Many online courses, however, consist merely of a series of textual notes and pictures with little navigational information or choice. In previous studies we have suggested that there are a number of usability and interactivity mistakes that are commonly made when preparing online learning material. These can be used to develop a set of principles for good design. Here, we apply those principles to modules in genetics and reproduction. This allows us to test the hypothesis that material presented in an interactive, easily navigable computer-based learning system (a "Virtual Lecture" or VL) creates a significant improvement in the student learning experience over identical material presented as simply pictures and text in scrollable Web pages ("Web pages"). The student learning experience was measured in terms of performance in summative assessment and through questionnaire analysis. Two separate studies were conducted. The first study involved two cohorts of students with one being given material as Web pages and another (a year later) given it in the form of a VL. The results showed a significant increase in final examination marks for students taking material as a VL compared with Web pages. Students using Web pages also expressed some discontent with their experience but those using the VL did not. In the second study we divided a single cohort into two groups and exposed them to material in the form of both Web pages and a VL. The results of a multiple-choice assessment reveal a significant increase in scores for material presented as a VL. Questionnaire analysis also revealed overwhelming preference for the VL approach. Taken together, these studies provide compelling evidence that a carefully designed interface can provide a significant improvement in the student learning experience compared to presenting material as scrollable Web pages consisting simply of pictures and text.
Securing Ad hoc Routing Protocols
Authors: Frank Kargl, Stefan Schlott, Andreas Klenk, Alfred Geiss, Michael Weber
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Ad hoc networks are subject of many recent research efforts. Especially in mobile scenarios, self-organizing networks are of high interest. While the routing aspects of mobile ad hoc networks (MANETs) are already well understood, the research activities about security in MANETs are still at their beginning. MANETs pose a number of new security problems in addition to the problems of regular networks. In addition to the classical security threats we identified additional ways how nodes may attack security in an Ad hoc network. In this paper, we explore several aspects of possible (mis)behaviour of MANET participants. We introduce a systematology of attacks on a MANET. Further, we describe the results of simulations that show, how misbehaving nodes affect MANETs based on the DSR routing protocol. Finally we outline a security architecture that provides substantial security services for Ad hoc networks.
Generative Parametric Design of Gothic Window Tracery
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Gothic architecture, and especially window tracery,exhibits quite complex geometric shape configurations bycombining only a few basic geometric patterns, namely circlesand straight lines. They are combined using only a limited setof operations, such as intersection, offsetting, and extrusions.The reason lies in the process how these objects have beenphysically realized, i.e., through construction with compass andruler. Consequently, Gothic architecture is a great, althoughchallenging, domain for parametric modeling.We present some principles of this long-standing domain, togetherwith some delicate details, and show how the constructionsof some prototypic Gothic windows can be formalized usingour Generative Modeling Language (GML). The emphasis ofthis procedural approach is on modularization, so that complexconfigurations can be obtained from combining elementary constructions.Different combinations of specific parametric featurescan be grouped together, which leads to the concept of styles.They permit to differentiate between the basic shape and itsappearance, i.e., a particular ornamental decoration.This leads to an extremely compact representation for a wholeclass of shapes, which can nevertheless be quickly evaluatedto obtain a connected manifold mesh of a particular windowinstance. The resulting mesh may also contain free-form surfaceparts, represented as subdivision surfaces.
Graph entropy and quantum sorting problems
Authors: Andrew Chi-Chih Yao
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Let P = (X, < P) be a partial order on a set of n elements X = x1, x2,..., xn. Define the quantum sorting problem QSORTP as: given n distinct numbers x1, x2,..., xn consistent with P, sort them by a quantum decision tree using comparisons of the form "xi: xj". Let Qε(P) be the minimum number of queries used by any quantum decision tree for solving QSORTP with error less than ε (where 0 < ε < 1/10 is fixed). It was proved by Hoyer, Neerbek and Shi (Algorithmica 34 (2002), 429--448) that, when P0 is the empty partial order, Qε(P0) ≥ Ω (n log n), i. e., the classical information lower bound holds for quantum decision trees when the input permutations are unrestricted.In this paper we show that the classical information lower bound holds, up to an additive linear term, for quantum decision trees for any partial order P. Precisely, we prove Qε(P) ≥ c log2 e(P)-c'n where c,c' > 0 are constants and e(P) is the number of linear orderings consistent with P. Our proof builds on an interesting connection between sorting and Korner's graph entropy that was first noted and developed by Kahn and Kim (JCSS 51(1995), 390--399).
Decomposition of Complex Models for Manufacture
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper presents a feature recognition (FR)technique that separates protrusions bounded byfreeform surface geometry. The method can alsogenerate complementary male/female assemblyfeatures at the interface between components. A novelheuristic that uses edge curvature continuity is appliedto direct the search and the construction of protrusionboundaries. The result is represented as a cellularmodel. The objective is to manufacture complexprototype assemblies on multi-axis machining centres.After describing the algorithm and presenting someexamples of its application the paper concludes bydiscussing the approaches limitations.