ppxscal/embedding_network huggingface dataset:
A framework for evaluating the performance of cluster algorithms for hierarchical networks
Authors: Jie Lian, Kshirasagar Naik, Gordon B. Agnew
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Table-driven routing algorithms in flat networks have the scalability problem due to the need for global topology updates. To reduce update cost, networks are hierarchically organized. Clustering algorithms organize flat networks into hierarchical networks. One important problem, which has not been adequately addressed so far, is to evaluate how good a clustering algorithm is. In other words, it is useful to know what the desired properties of hierarchical networks are. In this paper, we address this issue by considering the routing update cost, which can be measured by the total routing table size and the variance of cluster size distribution. We provide a set of desired properties of clustering algorithms. Applying these properties to the cluster structure generated by an algorithm, we can determine how good a clustering algorithm is. Specifically, we discuss how to choose appropriate number of hierarchy levels, number of clusters, and cluster size distribution, such that the topology update cost is minimized. The desired properties obtained from the analysis can be used as guidelines in the design of clustering algorithms for table-driven hierarchical networks. We apply the idea developed in this paper to evaluate three routing algorithms, namely the lowest ID algorithm, the maximum degree algorithm, and the variable degree clustering algorithm. We show how the variable degree clustering algorithm, which takes into account these desired properties, improves routing performance.
SSL/TLS Session-Aware User Authentication
Authors: Rolf Oppliger, Ralf Hauser, David Basin
Venue: Computer (2008)

Overall, transport layer security with session-aware user authentication offers a promising approach to solving man-in-the-middle attack problems by leveraging the legacy authentication mechanisms and systems that the general public has become accustomed to using.
Solution of parametric vertical block linear complementarity problems
Authors: B. Chakraborty, M. P. Biswal, S. Nanda
Venue: International Journal of Computer Mathematics (2007)

The parametric vertical block linear complementarity problem is introduced where the associated vertical block matrix and the column vector are parametric. Assuming the matrix to be a vertical block P-matrix, an algorithm is developed for solving vertical block linear complementarity problems. A necessary and sufficient condition is also derived to ensure the same solution basis for any parametric input of the vertical block P-matrix. Based on these, an algorithm is proposed and the solution of the parametric vertical block linear complementarity problem is obtained. A numerical example is presented to illustrate the use of the method.
Biodegradable polymer tubes with lithographically controlled 3D micro- and nanotopography
Authors: K. Seunarine, D. O. Meredith, M. O. Riehle, C. D. W. Wilkinson, N. Gadegaard
Venue: Microelectronic Engineering (2008)

We introduce a novel scaffold fabrication process for making tubular constructs for vascular tissue engineering. Every aspect of the scaffold has been engineered providing unprecedented control of feature size and placement over five orders of magnitude by a combination of electron beam and photolithography. A wide range of micro- and nanotopographies can be incorporated into the scaffold - these have been demonstrated to elicit specific cell responses, and utilising a specific topography can enhance the scaffold's final performance.
On k-ordered Hamiltonian graphs
Authors: H. A. Kierstead, G. N. Sárközy, S. M. Selkow
Venue: Journal of Graph Theory (1999)

A Hamiltonian graph G of order n is k-ordered, 2 &le; k &le; n, if for every sequence v1, v2, &hellip;, vk of k distinct vertices of G, there exists a Hamiltonian cycle that encounters v1, v2, &hellip;, vk in this order. Define f(k, n) as the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine f(k, n) if n is sufficiently large in terms of k. Let g(k, n) = $\lceil{{n}\over{2}}\rceil + \lfloor{{k}\over{2}}\rfloor$ - 1. More precisely, we show that f(k, n) = g(k, n) if n &ge; 11k - 3. Furthermore, we show that f(k, n) &ge; g(k, n) for any n &ge; 2k. Finally we show that f(k, n) > g(k, n) if 2k &le; n &le; 3k - 6. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 17&ndash;25, 1999 An earlier version of this article was written while S&aacute;rk&ouml;zy was visiting MSRI Berkeley, as part of the Combinatorics Program.
Sensitivities to early exchange in synchronous computer-supported collaborative learning (CSCL) groups
Authors: Manu Kapur, John Voiklis, Charles K. Kinzer
Venue: Computers Education (2008)

This study reports the impact of high sensitivity to early exchange in 11th-grade, CSCL triads solving well- and ill-structured problems in Newtonian Kinematics. A mixed-method analysis of the evolution of participation inequity (PI) in group discussions suggested that participation levels tended to get locked-in relatively early on in the discussion. Similarly, high (low) quality member contributions made earlier in a discussion did more good (harm) than those made later on. Both PI and differential impact of member contributions suggest a high sensitivity to early exchange; both significantly predicting the eventual group performance, as measured by solution quality. Consequently, eventual group performance could be predicted based on what happened in the first 30-40% of a discussion. In addition to drawing theoretical and methodological implications, implications for scaffolding CSCL groups are also discussed.
A Task Pipelining Framework for e-Science Workflow Management Systems
Authors: Hyeong S. Kim, In Soon Cho, Heon. Y. Yeom
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Workflow manager is a useful tool that brings the power of computational Grid resources to the desktop, and allow them to conveniently put together and run their own scientific workflows. In existing workflow systems, individual tasks wait for input to be available perform computation,and produce output. Behind this, workflow manager automates the data movement from the data generating taskto the data consumption task. This process is referred as file staging. Generally, stage-in, process, and stage-out are serially executed and staging is treated by traditional workflow systems as a trivial step. However, as the data sizeis exponentially increasing and more and more scientific workflows require multiple processing steps to obtain the desired output, we argue that the data movement will possess high portion of overall running time and staging will become a challenging step of scientific workflow systems. In this paper, we propose a task pipelining framework for various e-Science workflow systems. Our system is a flexible and efficient tool to help the workflow systems to overlap the execution of adjacent tasks by enabling the pipelining ofthe intermediate data transfer between the interconnected tasks.
Simulation Based Scheduling Applying Petri Nets with Sequences and Priorities
Authors: Gaper Muic, Thomas Löscher, Felix Breitenecker
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The paper deals with modelling and simulation of scheduling and sequencing problems based on Petri nets. In particular, the Petri-net models are simulated over the time domain and a simulation-based optimisation is implemented to optimise the input sequences. A new conflict resolution is implemented and a sophisticated way of defining firing sequences is developed. This enables the optimisation of scheduling problems by automated changing and evaluating the used sequences. The optimisation problem is solved by heuristic algorithms, including genetic algorithms, simulated annealing and threshold accepting. All these methods are implemented in the so called MATLAB PetriSimM toolbox which offers the capability of modelling, simulation, and optimisation of Timed, Coloured, and Stochastic Petri nets. For comparison, a Petri net based heuristic search is implemented, which is based on the reachability tree exploration. The algorithms are compared and tested in a case study dealing with modelling, simulation and optimisation of a production cell.
The projectron: a bounded kernel-based Perceptron
Authors: Francesco Orabona, Joseph Keshet, Barbara Caputo
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernel-based Perceptron for storing the online hypothesis is not bounded. Previous work has been focused on discarding part of the instances in order to keep the memory bounded. In the proposed algorithm the instances are not discarded, but projected onto the space spanned by the previous online hypothesis. We derive a relative mistake bound and compare our algorithm both analytically and empirically to the state-of-the-art Forgetron algorithm (Dekel et al, 2007). The first variant of our algorithm, called Projectron, outperforms the Forgetron. The second variant, called Projectron++, outperforms even the Perceptron.
JLS: a pedagogically targeted logic design and simulation tool
Authors: David A. Poplawski, Zachary Kurmas
Venue: ACM SIGCSE Bulletin (2008)

JLS is a GUI-based digital logic simulation tool specifically designed for use in a wide range of digital logic and computer organization courses. It is comparable in features and functionality to commercial products, but includes many student and instructor-friendly aspects not found in those products such as state-machine and truth table editors, extensive error checking, and multiple simulation result views. Students quickly become proficient in its use, enabling them to concentrate on circuit design and debugging issues. The circuit drawing interface is convenient enough to allow instructors to use it for classroom presentations, and circuits can be modified and tested so quickly that it promotes exploring alternatives not prepared for in advance.
Study of the Beverton-Holt Equation from a Control Theory Point of View
Authors: M. De la Sen, S. Alonso-Quesada, A. Bilbao-Guillerna
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper develops some "ad-hoc" Control Theory formalism useful for the famous Beverton-Holt Equation arising in population dynamics. In particular, the inverse equation is redefined for a finite set of consecutive samples under the equivalent form of a discrete linear dynamic system whose input sequence is defined by the sequence of carrying capacity gains and the unforced dynamics is directly related to the intrinsic growth rate. For that purpose, the environment carrying capacity gains are allowed to be time-varying and designed for control purposes.
MPLS/IP analysis and simulation for the implementation of path restoration schemes
Authors: V. Alarcón-Aquino, Y. L. Takahashi-Iturriaga, J. C. Martínez-Suárez, L. G. Guerrero-Ojeda
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Traditionally, IP (Internet Protocol) has been routed over ATM (Asynchronous Transfer Mode) via Virtual Circuits (VCs) or Multi-Protocol over ATM (MPOA). These methods proved to have a complicated operation mode, reason why the necessity for a simpler method was felt. All these necessities can be supported by the Multi-Protocol Label Switching (MPLS) since it integrates the most important characteristics of layers 2 and 3 of the OSI model. This paper explains and analyzes the concepts of MPLS, as well as performing a simulation and comparison of path restoration schemes using Network Simulator (NS). The results show the advantages of working over a connection-oriented technology (MPLS) by supporting a more efficient rerouting scheme for link failures.
A method for the atmospheric correction of ENVISAT/MERIS data over land targets
Authors: L. Guanter, M. Del Carmen González-Sanpedro, J. Moreno
Venue: International Journal of Remote Sensing (2007)

An atmospheric correction algorithm for the retrieval of land surface reflectance from imagery acquired by the Medium Resolution Imaging Spectrometer (MERIS) on-board the European Space Agency (ESA) ENVIronmental SATellite (ENVISAT) platform has been implemented. The algorithm is designed to estimate the main atmospheric parameters needed in the correction, aerosol and water vapour contents, from the image itself, leading to an optimal characterization of the atmospheric state at the time of image acquisition. Once the atmospheric state has been defined, a second step deals with the retrieval of surface reflectance, accounting for the contribution of surface elevation and roughness as well as the atmospheric adjacency effect. The first part of this paper is devoted to the description of the method, outlining the main steps in the atmospheric characterization and in the subsequent surface reflectance retrieval. The validation task is detailed in the second part. Aerosol Optical Thickness (AOT) and water vapour content from different sites of the AErosol RObotic NETwork (AERONET) have been compared with the method's retrievals. Root Mean Square Errors (RMSEs) equal to 0.085, 0.065 and 0.048 are found for AOT at 440, 550 and 870 nm, respectively. Comparison with in situ measurements shows a satisfactory performance except for episodes of Saharan dust intrusions. For water vapour, a high correlation between MERIS and AERONET results is found, although the RMSE equals 0.316 g cm-2 due to a systematic overestimation when compared with AERONET data. It decreases to 0.098 when the retrievals are compared with the ESA water vapour level 2 product.
Half-transitive graphs of valency 4 with prescribed attachment numbers
Authors: Dragan Marušič, Adrian O. Waller
Venue: Journal of Graph Theory (2000)

A graph X is said to be &frac12;-transitive if its automorphism group Aut X acts vertex- and edge-, but not arc-transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so-called alternating cycles, that is even length cycles in X whose every other vertex is the head and every other vertex is the tail of its two incident edges in the above orientation. All alternating cycles have the same length 2r(X), where r(X) is the radius of X, and any two adjacent alternating cycles intersect in the same number of vertices, called the attachment number a(X) of X. All known examples of &frac12;-transitive graphs have attachment number 1, r or 2r, where r is the radius of the graph. In this article, we construct &frac12;-transitive graphs with all other possible attachment numbers. The case of attachment number 2 is dealt with in more detail. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 89&ndash;99, 2000 The work was done during author's postdoctorship at IMFM, University of Ljubljana.
Finding an iterated function systems based representation for complex visual structures using an evolutionary algorihm
Authors: Andrzej Bielecki, Barbara Strug
Venue: Machine Graphics Vision International Journal (2007)

This paper presents an approach to the IFS inverse problem based on evolutionary computations. Having a bitmap image, we look for a set of functions that can reproduce a good approximation of a given image. A method using a variable number of mappings is proposed. A number of different crossover operators is described and tested. The possibility of enriching evolutionary algorithms by a specific type mechanism characteristic for replication of influenza viruses is discussed. The genetic material of the influenza type A virus consists of eight separate segments. In some types of tasks, such a structure of a genome can be more adequate than representation that consists of one sequence only. If influenza virus strains infect the same cell, then their RNA segments can mix freely, producing progeny viruses which represents the reasortment mechanism. Furthermore, mistakes leading to new mutations are common. The structure of problems for which such viral reproduction mechanisms can be effective are analyzed. The paper ends with some experimental results showing the images we were able to generate with the proposed method. The preliminary experimental results suggest that the introduction of the reasortment operator results in achieving satisfactory images in a smaller number of generations.
Decomposition of the multi-dimensional time series identification problem
Authors: V. V. Klimchenko
Venue: Automation and Remote Control (2008)

The mathematical model of shaping filter is constructed for a stationary multidimensional time series. The identification procedure is simplified by dividing into several steps: each step results in a multidimensional filter such that the autocovariance generating function of the transformed time series has nonzero entries in only one row, one column and in the main diagonal. This decomposition allows to construct adequat models containing relatively small number of estimated parameters. The reasonable parametrizaion, in turn, contributes to the better quality of the model due to the better statistical accuracy of the parameter estimations.
A study of integration of LIGA and M-EDM technology on the microinjection molding of ink-jet printers&#x2019; nozzle plates
Authors: Shi-Chang Tseng, Yi-Chern Chen, Chia-Lung Kuo, Bow-Yuen Shew
Venue: Microsystem Technologies (2005)

Common processes to manufacture nozzle plates of ink-jet printer heads are electroplating or laser machining. In order to reduce the production cost and improve the performance of nozzle plates, a new approach, microinjection molding, is introduced to manufacture nozzle plates in this study. The micro mold was made by integration of the LIGA and M-EDM technology to improve the positioning and alignment accuracy. After assembling the micro mold, microinjection-molding technique was applied to produce four nozzle plates in one shot. There are 60 micro through-holes on each plate. The diameters were measured by an optical microscopy and in the range of 101&#x00b1;1&#x00a0;microns. Experiment and simulation result indicated that the most significant factor for molding these thin films with micro through holes is the mold temperature. This work recommends the mold temperature during filling of the vario-thermal mold system is about 10&#x223c;15&#x00b0;C higher than the glass transition temperature of the polymer. The manufacture procedures proposed in this study are believed to be more accurate and economical.
Language Identifications of Arabic Script Web Documents Using Independent Component Analysis
Authors: Ali Selamat, Zhi-Sam Lee
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

We analyze the language identification algorithms used to identify the Arabic script web documents such as Arabic, Jawi, Persian and Urdu using independent component analysis (ICA). We have used a combination of Entropy term weighting scheme and class based feature (CPBF) vectors as feature selection methods for selecting the best features of Arabic script web documents for web page language identifications. Then we input the selected features based on the identification of latent semantics of user profiles usingsingular value decomposition (SVD). The SVD has beenused to remove the noises on the documents retrieved beforeapplying the ICA for topic extraction. We assume that thetopic on each document is independent from each other. Wehave used the information retrieval measures that are precision, recall and F1 in order to evaluate the effectiveness of the proposed algorithm. From the experiments, we have found that the proposed method could leads to good Arabic script language identification results with good separations of Arabic, Persian, and Urdu languages using the ICA.
Connectivity of a Gaussian network
Authors: P. Balister, B. Bollobas, A. Sarkar, M. Walters
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R&sup2; distributed randomly with density given by a Gaussian distribution about the origin, and assume each transceiver can communicate with all other transceivers within distance s. We give bounds for the distance from the origin to the furthest transceiver connected to the origin, and that of the closest transceiver that is not connected to the origin.
Information Stream Based Model for Organizing Security
Authors: Bernhard Thalheim, Sabah Al-Fedaghi, Khaled Al-Saqabi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

One of the most important aspects of security organization is to establish a framework to identify security-significant points where policies and procedures are declared. The (information) security infrastructure comprises entities, processes, and technology. All are participants in handling information, which is the item that needs to be protected. Our approach is to identify information stream as the principal focus of security consideration, and it is based on recognizing points of transformation in the flow of information as the pivots around which security organization is built. The information stream model is a general, coherent blueprint of security organization without getting into details of specific technology, policies, or practices.
Novel interface services for bioacoustic digital libraries
Authors: J. Stephen Downie, David K. Tcheng, Xin Xiang
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper introduces the CARDINAL (Computer Assisted Recognition and Discovery in Natural Acoustic Landscapes) interface system for use in Bioacoustic Digital Libraries (BADL).
Flexible querying in a relational framework supported by possibilistic logic
Authors: Tom Matthé, Guy De Tré
Venue: Fuzzy Sets and Systems (2008)

Traditionally, flexible querying systems are supported by a logical framework that is based on satisfaction degrees. Alternatively, certainty about query satisfaction can also be modelled by possibility and necessity measures. This approach was extended by our group in order to handle the cases of missing information more adequately. In this paper, it is presented how our extended logical framework can be used to support flexible querying on conventional relational databases. The handling of preferences, both inside elementary query conditions and between query conditions, is presented, as well as the extension of the traditional selection, projection and join operators. Motivated examples are provided to illustrate the used concepts.